id
float64 706
1.8k
| title
stringlengths 1
343
| abstract
stringlengths 6
6.09k
| categories
stringlengths 5
125
| processed_abstract
stringlengths 2
5.96k
| tokenized_abstract
stringlengths 8
8.74k
| centroid
stringlengths 2.1k
2.17k
|
|---|---|---|---|---|---|---|
1,803.09067
|
Gravity model explained by the radiation model on a population landscape
|
Understanding the mechanisms behind human mobility patterns is crucial to
improve our ability to optimize and predict traffic flows. Two representative
mobility models, i.e., radiation and gravity models, have been extensively
compared to each other against various empirical data sets, while their
fundamental relation is far from being fully understood. In order to study such
a relation, we first model the heterogeneous population landscape by generating
a fractal geometry of sites and then by assigning to each site a population
independently drawn from a power-law distribution. Then the radiation model on
this population landscape, which we call the radiation-on-landscape (RoL)
model, is compared to the gravity model to derive the distance exponent in the
gravity model in terms of the properties of the population landscape, which is
confirmed by the numerical simulations. Consequently, we provide a possible
explanation for the origin of the distance exponent in terms of the properties
of the heterogeneous population landscape, enabling us to better understand
mobility patterns constrained by the travel distance.
|
physics.soc-ph
|
understanding the mechanisms behind human mobility patterns is crucial to improve our ability to optimize and predict traffic flows two representative mobility models ie radiation and gravity models have been extensively compared to each other against various empirical data sets while their fundamental relation is far from being fully understood in order to study such a relation we first model the heterogeneous population landscape by generating a fractal geometry of sites and then by assigning to each site a population independently drawn from a powerlaw distribution then the radiation model on this population landscape which we call the radiationonlandscape rol model is compared to the gravity model to derive the distance exponent in the gravity model in terms of the properties of the population landscape which is confirmed by the numerical simulations consequently we provide a possible explanation for the origin of the distance exponent in terms of the properties of the heterogeneous population landscape enabling us to better understand mobility patterns constrained by the travel distance
|
[['understanding', 'the', 'mechanisms', 'behind', 'human', 'mobility', 'patterns', 'is', 'crucial', 'to', 'improve', 'our', 'ability', 'to', 'optimize', 'and', 'predict', 'traffic', 'flows', 'two', 'representative', 'mobility', 'models', 'ie', 'radiation', 'and', 'gravity', 'models', 'have', 'been', 'extensively', 'compared', 'to', 'each', 'other', 'against', 'various', 'empirical', 'data', 'sets', 'while', 'their', 'fundamental', 'relation', 'is', 'far', 'from', 'being', 'fully', 'understood', 'in', 'order', 'to', 'study', 'such', 'a', 'relation', 'we', 'first', 'model', 'the', 'heterogeneous', 'population', 'landscape', 'by', 'generating', 'a', 'fractal', 'geometry', 'of', 'sites', 'and', 'then', 'by', 'assigning', 'to', 'each', 'site', 'a', 'population', 'independently', 'drawn', 'from', 'a', 'powerlaw', 'distribution', 'then', 'the', 'radiation', 'model', 'on', 'this', 'population', 'landscape', 'which', 'we', 'call', 'the', 'radiationonlandscape', 'rol', 'model', 'is', 'compared', 'to', 'the', 'gravity', 'model', 'to', 'derive', 'the', 'distance', 'exponent', 'in', 'the', 'gravity', 'model', 'in', 'terms', 'of', 'the', 'properties', 'of', 'the', 'population', 'landscape', 'which', 'is', 'confirmed', 'by', 'the', 'numerical', 'simulations', 'consequently', 'we', 'provide', 'a', 'possible', 'explanation', 'for', 'the', 'origin', 'of', 'the', 'distance', 'exponent', 'in', 'terms', 'of', 'the', 'properties', 'of', 'the', 'heterogeneous', 'population', 'landscape', 'enabling', 'us', 'to', 'better', 'understand', 'mobility', 'patterns', 'constrained', 'by', 'the', 'travel', 'distance']]
|
[-0.06631208886672933, 0.07829519971666565, -0.11526448121406586, 0.11940091051629756, -0.0548544177632633, -0.1250574115680598, 0.08230798946502786, 0.3598005628908973, -0.2847113257248785, -0.34544367763685085, 0.06770316247424357, -0.2869509194096752, -0.15497120538255177, 0.17310165866602112, -0.04875102609112657, 0.03165731551574476, -0.007916223453441971, 0.021328334470948552, 0.015295403111510047, -0.20575860654374203, 0.31385633891100534, 0.10581290530018418, 0.3200937587969813, 0.01664748264431774, 0.06299749396575534, -0.051617384074727095, -0.031616789196598265, 0.04249255505323141, -0.14708515073464487, 0.13719045182369882, 0.18262993597274918, 0.12479066931367684, 0.26089772495934854, -0.4260880657842001, -0.29777248026606773, 0.11175660550571888, 0.15318394491606088, 0.1114354111949902, -0.03445808090766084, -0.2635272925702788, 0.08141389722004533, -0.16651157960183469, -0.15622102433018925, -0.029918236716886062, 0.02490886199716826, 0.02204895824374889, -0.2280403550588722, 0.06703823523214424, -0.014511647387351617, 0.0328390651948102, -0.0852209753833756, -0.0773278680827794, -0.04292224976164008, 0.19345645767886258, 0.07547581369402336, 0.028396062043787217, 0.1184218864949667, -0.14133851701977201, -0.12345032906510407, 0.40620263784854527, -0.020204478098466677, -0.19321347938581224, 0.23125433855892036, -0.15521485040087746, -0.0806689867076565, 0.0850151118973876, 0.2006840716811817, 0.08887656589588487, -0.20345356551010207, 0.04395956934201082, -0.012042142485874334, 0.15952898636362123, -0.0015176719500604703, 0.026134271244798977, 0.24247803585603833, 0.20082464672804598, 0.025587502096959175, 0.12403274679883293, -0.07281454627160881, -0.1301204578573002, -0.227330352639757, -0.10541521633851779, -0.16919180138474219, 0.03465959171383047, -0.10501959169795806, -0.13831385899144394, 0.42309912773275593, 0.1902788831397936, 0.20986457811724618, 0.08270854666879603, 0.2668469772640481, 0.077662004380212, 0.06158878275961896, 0.05813912633969168, 0.20450048500402684, 0.09748208183929863, 0.05760080425324008, -0.21870720647668174, 0.12441716845854218, 0.03808115879550621]
|
1,803.09068
|
A Single Radio Source in the High-redshift Dual AGN LBQS 0302-0019
|
By discovering a narrow-line emitter embedded in an extended Ly-alpha nebula,
Husemann et al. (2018) found that the luminous radio-quiet quasar LBQS
0302-0019 is a dual active galactic nucleus (AGN) system. By combining
available archival radio interferometric data taken at 8.4 GHz with the Very
Large Array (VLA), we found that the weak 0.4-mJy radio source in this system
positionally coincides with the unobscured optical quasar while its newly
discovered obscured companion has no detectable radio emission (<0.045
mJy/beam, 3-sigma image noise level). However, the non-detection of this object
with the VLA does not rule out the presence of a radio-quiet AGN there.
|
astro-ph.GA
|
by discovering a narrowline emitter embedded in an extended lyalpha nebula husemann et al 2018 found that the luminous radioquiet quasar lbqs 03020019 is a dual active galactic nucleus agn system by combining available archival radio interferometric data taken at 84 ghz with the very large array vla we found that the weak 04mjy radio source in this system positionally coincides with the unobscured optical quasar while its newly discovered obscured companion has no detectable radio emission 0045 mjybeam 3sigma image noise level however the nondetection of this object with the vla does not rule out the presence of a radioquiet agn there
|
[['by', 'discovering', 'a', 'narrowline', 'emitter', 'embedded', 'in', 'an', 'extended', 'lyalpha', 'nebula', 'husemann', 'et', 'al', '2018', 'found', 'that', 'the', 'luminous', 'radioquiet', 'quasar', 'lbqs', '03020019', 'is', 'a', 'dual', 'active', 'galactic', 'nucleus', 'agn', 'system', 'by', 'combining', 'available', 'archival', 'radio', 'interferometric', 'data', 'taken', 'at', '84', 'ghz', 'with', 'the', 'very', 'large', 'array', 'vla', 'we', 'found', 'that', 'the', 'weak', '04mjy', 'radio', 'source', 'in', 'this', 'system', 'positionally', 'coincides', 'with', 'the', 'unobscured', 'optical', 'quasar', 'while', 'its', 'newly', 'discovered', 'obscured', 'companion', 'has', 'no', 'detectable', 'radio', 'emission', '0045', 'mjybeam', '3sigma', 'image', 'noise', 'level', 'however', 'the', 'nondetection', 'of', 'this', 'object', 'with', 'the', 'vla', 'does', 'not', 'rule', 'out', 'the', 'presence', 'of', 'a', 'radioquiet', 'agn', 'there']]
|
[-0.07503860891563818, 0.03907436160967336, 0.015561014297418296, 0.08418649093713611, -0.1659349898993969, -0.16937482826411723, 0.08632149862125515, 0.49691412437707183, -0.05871286328881979, -0.3162185164820403, 0.06918836673954502, -0.3221788167953491, -0.015338818915188313, 0.15375996049344395, -0.040227083349600436, -0.08238137830812775, 0.0576721794065088, -0.20070655417162925, 0.02697497619781643, -0.23639975055586546, 0.226932867243886, 0.16363589447224514, 0.1873380322777666, -0.08066323528408248, 0.15129908743430862, -0.13297146349679678, -0.12981616616249084, -0.022911432851105928, -0.035017170194332724, 0.03412905699573457, 0.3416911903116852, 0.1344298315513879, 0.19783234660280868, -0.2767038215510547, -0.20121591233531944, 0.09190351283643394, 0.1891977622685954, 0.012042076180223375, -0.040704212868586186, -0.3895314222201705, 0.046198646184056995, -0.22498569975607097, -0.20595700557343663, 0.15376957311294973, 0.06290247886674478, -0.008570868728565984, -0.15054445137735456, 0.13005698338150978, 0.00986972957267426, 0.11181997440056875, -0.1276397828303743, -0.07406537745031529, -0.052066688244231045, -0.011415160098113119, -0.04180602541426197, 0.1551609909455874, 0.1722495358483866, -0.13590019663330166, -0.08870297987014056, 0.357236717203632, -0.00883045316208154, 0.0902296488545835, 0.23313708097906782, -0.2458568984689191, -0.2792060401197523, 0.24268501004204154, 0.101417151321657, 0.08025222854688764, -0.14327031459193676, 0.024584749694913626, -0.10265589859336614, 0.3639675480732694, -0.014873189153149724, 0.11444998784339987, 0.350886673592031, 0.07966895239427686, 0.04003295565606095, 0.1740901985950768, -0.3332352291443385, 0.08301368314016144, -0.23060180037748068, 0.025280529140727596, -0.19039729543030262, 0.17307787261219346, -0.1307723899744451, -0.08094741283450275, 0.29754379296675326, 0.07151135020423681, 0.1766441467870027, 0.017418342924211173, 0.33675873848143967, 0.07020214235410094, 0.11004941653751303, 0.16988792051095516, 0.41504937519319357, 0.14807030400959775, 0.12602632111636922, -0.20321903722768184, 0.040920295946998524, -0.007989452742040158]
|
1,803.09069
|
Ground state properties of Ising chain with random monomer-dimer
couplings
|
We study analytically the one-dimensional Ising model with a random binary
distribution of ferromagnetic and antiferromagnetic exchange couplings at zero
temperature. We introduce correlations in the disorder by assigning a dimer of
one type of coupling with probability $x$, and a monomer of the other type with
probability $1-x$. We find that the magnetization behaves differently from the
original binary model. In particular, depending on which type of coupling comes
in dimers, magnetization jumps vanish at a certain set of critical fields. We
explain the results based on the structure of ground state spin configuration.
|
cond-mat.dis-nn
|
we study analytically the onedimensional ising model with a random binary distribution of ferromagnetic and antiferromagnetic exchange couplings at zero temperature we introduce correlations in the disorder by assigning a dimer of one type of coupling with probability x and a monomer of the other type with probability 1x we find that the magnetization behaves differently from the original binary model in particular depending on which type of coupling comes in dimers magnetization jumps vanish at a certain set of critical fields we explain the results based on the structure of ground state spin configuration
|
[['we', 'study', 'analytically', 'the', 'onedimensional', 'ising', 'model', 'with', 'a', 'random', 'binary', 'distribution', 'of', 'ferromagnetic', 'and', 'antiferromagnetic', 'exchange', 'couplings', 'at', 'zero', 'temperature', 'we', 'introduce', 'correlations', 'in', 'the', 'disorder', 'by', 'assigning', 'a', 'dimer', 'of', 'one', 'type', 'of', 'coupling', 'with', 'probability', 'x', 'and', 'a', 'monomer', 'of', 'the', 'other', 'type', 'with', 'probability', '1x', 'we', 'find', 'that', 'the', 'magnetization', 'behaves', 'differently', 'from', 'the', 'original', 'binary', 'model', 'in', 'particular', 'depending', 'on', 'which', 'type', 'of', 'coupling', 'comes', 'in', 'dimers', 'magnetization', 'jumps', 'vanish', 'at', 'a', 'certain', 'set', 'of', 'critical', 'fields', 'we', 'explain', 'the', 'results', 'based', 'on', 'the', 'structure', 'of', 'ground', 'state', 'spin', 'configuration']]
|
[-0.17643514639256816, 0.19530839328409025, -0.032793264414526915, 0.023275801470797313, -0.022838374795882327, -0.179107644997145, 0.09003214452072586, 0.36105306360282396, -0.24990485179679175, -0.2377623480303507, 0.025515525549111004, -0.3123497520855285, -0.10837944946987065, 0.11504439430703459, 0.07774719995887656, -0.02643759947417206, -0.00265549588335776, 0.0870255087110165, -0.10212468587009138, -0.23384500423470805, 0.3600172097157491, -0.03684721682955952, 0.26803201145835615, 0.0321651868914303, 0.09461221165072761, 0.0535990249708687, 0.12486163037093846, 0.02108272866492993, -0.1542657846417186, 0.0658771857790845, 0.16772336177037736, -0.026858156801838624, 0.1914160701127625, -0.3989745994343569, -0.16393255303172688, 0.09265917717528187, 0.0924551149928256, 0.14708271054673547, -0.013867873499954218, -0.26654258278492643, 0.030546932873365126, -0.17655646639238848, -0.1499645256566031, -0.04932133390715248, -0.029943483994391402, 0.08447100847077213, -0.28685621668057715, 0.11116781691579443, 0.0851661857499398, 0.055257324296000755, -0.07119296928867698, -0.12454726084772694, -0.07168164693162238, 0.08520411539724783, 0.05567402011652839, 0.05980856370818066, 0.11506457582214161, -0.14048645086586475, -0.13382835082562738, 0.3297587286975039, -0.0997393259337466, -0.17924345344501105, 0.1746243552329313, -0.19101816305498542, -0.13873926494760733, 0.11778938819556252, 0.1333883581094836, 0.08907187461705976, -0.10461173233098203, 0.11962802857038025, -0.016310442572361545, 0.18339400067649733, 0.019830872314540962, 0.03579720308219916, 0.23371257495723272, 0.16901293026320147, 0.036093137952450075, 0.19968023791137202, -0.13382479058284508, -0.15903810343067898, -0.2721976940373057, -0.13107047141774705, -0.2400625646849604, 0.11066612345411589, -0.1211055398278404, -0.20487168172227316, 0.4064579858003478, 0.1661904282083637, 0.23736529187544397, 0.03999291499709024, 0.1877900761748223, 0.11250120403235901, 0.023632977600822128, 0.028533505710871203, 0.19643986694955903, 0.14088555938858344, 0.07567723533873888, -0.24818461870431507, 0.09119334416463971, 0.059688193103494616]
|
1,803.0907
|
Acoustic Birefringence via Non-Eulerian Metamaterials
|
The recently proposed concept of metamaterials has opened exciting venues to
control wave-matter interaction in unprecedented ways. Here we demonstrate the
relevance of metamaterials for inducing acoustic birefringence, a phenomenon
which has already found its versatile applications in optics in designing light
modulators or filters, and nonlinear optic components. This is achieved in a
suitably designed acoustic metamaterial which is non-Eulerian, in the sense
that at low frequencies, it cannot be homogenized to a uniform acoustic medium
whose behavior is characterized by Euler equation. Thanks to the feasibility of
engineering its subwavelength structure, such non-Eulerian metamaterial allows
one to desirably manipulate the birefringence process. Our findings may give
rise to generation of innovative devices such as tunable acoustic splitters and
filters.
|
physics.app-ph
|
the recently proposed concept of metamaterials has opened exciting venues to control wavematter interaction in unprecedented ways here we demonstrate the relevance of metamaterials for inducing acoustic birefringence a phenomenon which has already found its versatile applications in optics in designing light modulators or filters and nonlinear optic components this is achieved in a suitably designed acoustic metamaterial which is noneulerian in the sense that at low frequencies it cannot be homogenized to a uniform acoustic medium whose behavior is characterized by euler equation thanks to the feasibility of engineering its subwavelength structure such noneulerian metamaterial allows one to desirably manipulate the birefringence process our findings may give rise to generation of innovative devices such as tunable acoustic splitters and filters
|
[['the', 'recently', 'proposed', 'concept', 'of', 'metamaterials', 'has', 'opened', 'exciting', 'venues', 'to', 'control', 'wavematter', 'interaction', 'in', 'unprecedented', 'ways', 'here', 'we', 'demonstrate', 'the', 'relevance', 'of', 'metamaterials', 'for', 'inducing', 'acoustic', 'birefringence', 'a', 'phenomenon', 'which', 'has', 'already', 'found', 'its', 'versatile', 'applications', 'in', 'optics', 'in', 'designing', 'light', 'modulators', 'or', 'filters', 'and', 'nonlinear', 'optic', 'components', 'this', 'is', 'achieved', 'in', 'a', 'suitably', 'designed', 'acoustic', 'metamaterial', 'which', 'is', 'noneulerian', 'in', 'the', 'sense', 'that', 'at', 'low', 'frequencies', 'it', 'can', 'not', 'be', 'homogenized', 'to', 'a', 'uniform', 'acoustic', 'medium', 'whose', 'behavior', 'is', 'characterized', 'by', 'euler', 'equation', 'thanks', 'to', 'the', 'feasibility', 'of', 'engineering', 'its', 'subwavelength', 'structure', 'such', 'noneulerian', 'metamaterial', 'allows', 'one', 'to', 'desirably', 'manipulate', 'the', 'birefringence', 'process', 'our', 'findings', 'may', 'give', 'rise', 'to', 'generation', 'of', 'innovative', 'devices', 'such', 'as', 'tunable', 'acoustic', 'splitters', 'and', 'filters']]
|
[-0.13823515772017972, 0.17650943642604303, -0.0918491898451886, -0.03692088675530822, -0.17719198649054485, -0.17953228224145218, -0.012440535748476683, 0.45149921222788386, -0.29309537706774524, -0.30163355284088034, 0.07765599434382328, -0.2574361240774914, -0.23582112140090922, 0.2508132099173963, -0.04136011104832296, 0.0867316025169948, -0.02463066477908707, -0.06717858859337866, 0.02125337937289513, -0.15800400955419316, 0.23859135072189766, 0.05928586155761102, 0.35281034304806197, 0.0503385255922426, 0.16509659836816862, -0.02673829658115359, 0.036006279289961, 0.016484398629562167, -0.08053755413839397, 0.13809111996431697, 0.30993065696837546, 0.03656371731756467, 0.2978772847611671, -0.3986105404290386, -0.2781108125364866, 0.059522264324067556, 0.17843452187209222, 0.14210906158560185, -0.11220553273060282, -0.29036785680495325, 0.05809416489858852, -0.119511209332888, -0.19371398468108247, -0.10647334302031267, -0.0008940975349701819, 0.014174500478862892, -0.23153337957499717, -0.04437452194769485, 0.05082289391716362, 0.015050776180673818, -0.026759482238973207, -0.04331274417641222, 0.02174055848659978, 0.06389703085745273, -0.04235376416324813, -0.04356099105226334, 0.09247737732423912, -0.14426741767941867, -0.11466012647486154, 0.40017790674064, -0.056871777079755166, -0.17737233883843923, 0.17350938987773157, -0.11824750711332213, -0.0003827542570404342, 0.11877321277279407, 0.2316099988739388, 0.0749924329765996, -0.14378087273006876, 0.0414170410618144, 0.023266295379516286, 0.17183706626967818, 0.12710292702235404, 0.1327926803525293, 0.24203650931232287, 0.2165750569404393, 0.061889537913497196, 0.15300459318630183, -0.03448915887780518, 0.054073444630599536, -0.22955487786838022, -0.13525246495197787, -0.20920278994961963, 0.04633808664638324, -0.06633107257280765, -0.1944887868785223, 0.41235092502148424, 0.17022858028105445, 0.12970386846296367, -0.0640439352871789, 0.3035714187292901, 0.10428967426500482, 0.14901093346998096, 0.015634427231891065, 0.33438649512522045, 0.15195066143460878, 0.16128231303338877, -0.19772368108807895, 0.0401357592953766, 0.0015506779843727585]
|
1,803.09071
|
Chemical event chain model of coupled genetic oscillators
|
We introduce a stochastic model of coupled genetic oscillators in which
chains of chemical events involved in gene regulation and expression are
represented as sequences of Poisson processes. We characterize steady states by
their frequency, their quality factor and their synchrony by the oscillator
cross correlation. The steady state is determined by coupling and exhibits
stochastic transitions between different modes. The interplay of stochasticity
and nonlinearity leads to isolated regions in parameter space in which the
coupled system works best as a biological pacemaker. Key features of the
stochastic oscillations can be captured by an effective model for phase
oscillators that are coupled by signals with distributed delays.
|
physics.bio-ph nlin.AO q-bio.CB
|
we introduce a stochastic model of coupled genetic oscillators in which chains of chemical events involved in gene regulation and expression are represented as sequences of poisson processes we characterize steady states by their frequency their quality factor and their synchrony by the oscillator cross correlation the steady state is determined by coupling and exhibits stochastic transitions between different modes the interplay of stochasticity and nonlinearity leads to isolated regions in parameter space in which the coupled system works best as a biological pacemaker key features of the stochastic oscillations can be captured by an effective model for phase oscillators that are coupled by signals with distributed delays
|
[['we', 'introduce', 'a', 'stochastic', 'model', 'of', 'coupled', 'genetic', 'oscillators', 'in', 'which', 'chains', 'of', 'chemical', 'events', 'involved', 'in', 'gene', 'regulation', 'and', 'expression', 'are', 'represented', 'as', 'sequences', 'of', 'poisson', 'processes', 'we', 'characterize', 'steady', 'states', 'by', 'their', 'frequency', 'their', 'quality', 'factor', 'and', 'their', 'synchrony', 'by', 'the', 'oscillator', 'cross', 'correlation', 'the', 'steady', 'state', 'is', 'determined', 'by', 'coupling', 'and', 'exhibits', 'stochastic', 'transitions', 'between', 'different', 'modes', 'the', 'interplay', 'of', 'stochasticity', 'and', 'nonlinearity', 'leads', 'to', 'isolated', 'regions', 'in', 'parameter', 'space', 'in', 'which', 'the', 'coupled', 'system', 'works', 'best', 'as', 'a', 'biological', 'pacemaker', 'key', 'features', 'of', 'the', 'stochastic', 'oscillations', 'can', 'be', 'captured', 'by', 'an', 'effective', 'model', 'for', 'phase', 'oscillators', 'that', 'are', 'coupled', 'by', 'signals', 'with', 'distributed', 'delays']]
|
[-0.1794499613051475, 0.18813558409534312, -0.006135246837166724, 0.04537081729331813, 0.012490883133270674, -0.15871747878069678, 0.05595235074374445, 0.3523970043062474, -0.2859014046067993, -0.29930726857855916, 0.045729230192524416, -0.2628840821562335, -0.2172968392950241, 0.1636398199264443, -0.017783695129091264, 0.01830712980935695, 0.04524071178295546, 0.010647433346430599, 0.028872730837772705, -0.15792296268692654, 0.32924616014847913, 0.06426367461163965, 0.2732916209950215, -0.06696917665518683, 0.1333355496947964, -0.05867124725935153, 0.001539081481664821, 0.006935833077780747, -0.0892256038899817, 0.08025541429190154, 0.26996606667698536, 0.09662248776294291, 0.25216998823883907, -0.46357119518884077, -0.237178452437985, 0.11168115674000648, 0.1699540127228829, 0.12873036409641994, -0.0009566767839714885, -0.3113992931579964, -0.016970021408741123, -0.13227888790856082, -0.09265003776548568, -0.11039249323463689, 0.011541420204189813, 0.11132850652750305, -0.2768815636583086, 0.1537888252973466, 0.05518395939402075, 0.04992644360754639, -0.05643111475984807, -0.04095934121761712, -0.07039964417237099, 0.1652590910067644, 0.0069368228742624286, -0.030806500779430347, 0.16804322888384815, -0.12041563279840543, -0.14779279140391197, 0.3238521935849416, -0.10034307986023594, -0.23479925683150887, 0.19928974577191252, -0.09767211326915357, -0.0881788598015663, 0.14543999019251377, 0.1918524360473923, 0.07061176621829401, -0.2188539019887146, 0.05238975601538119, 0.06508774457809825, 0.1791710198309307, 0.06467066364388706, 0.049283552703585615, 0.1939265455584973, 0.20251853319954266, 0.03734306733261932, 0.15071513802050268, -0.041156490350625026, -0.15614278226469955, -0.23225979175994224, -0.06397220371635975, -0.1401385420165887, 0.03487324520635108, -0.10927144392701814, -0.15347158639364084, 0.43696455418615154, 0.08780661884574564, 0.21524362007794143, 0.013214852533699875, 0.24855344187192344, 0.1653995480090897, 0.03765560636896192, 0.005836117822952845, 0.23876137285562302, 0.1728947130053442, 0.08629996570568808, -0.27646433622835, 0.10864668855598818, 0.019170460071311228]
|
1,803.09072
|
A Color-locus Method for Mapping $R_V$ Using Ensembles of Stars
|
We present a simple but effective technique for measuring angular variation
in $R_V$ across the sky. We divide stars from the Pan-STARRS1 catalog into
Healpix pixels and determine the posterior distribution of reddening and $R_V$
for each pixel using two independent Monte Carlo methods. We find the two
methods to be self-consistent in the limits where they are expected to perform
similarly. We also find some agreement with high-precision photometric studies
of $R_V$ in Perseus and Ophiuchus, as well as with a map of reddening near the
Galactic plane based on stellar spectra from APOGEE. While current studies of
$R_V$ are mostly limited to isolated clouds, we have developed a systematic
method for comparing $R_V$ values for the majority of observable dust. This is
a proof of concept for a more rigorous Galactic reddening map.x
|
astro-ph.GA
|
we present a simple but effective technique for measuring angular variation in r_v across the sky we divide stars from the panstarrs1 catalog into healpix pixels and determine the posterior distribution of reddening and r_v for each pixel using two independent monte carlo methods we find the two methods to be selfconsistent in the limits where they are expected to perform similarly we also find some agreement with highprecision photometric studies of r_v in perseus and ophiuchus as well as with a map of reddening near the galactic plane based on stellar spectra from apogee while current studies of r_v are mostly limited to isolated clouds we have developed a systematic method for comparing r_v values for the majority of observable dust this is a proof of concept for a more rigorous galactic reddening mapx
|
[['we', 'present', 'a', 'simple', 'but', 'effective', 'technique', 'for', 'measuring', 'angular', 'variation', 'in', 'r_v', 'across', 'the', 'sky', 'we', 'divide', 'stars', 'from', 'the', 'panstarrs1', 'catalog', 'into', 'healpix', 'pixels', 'and', 'determine', 'the', 'posterior', 'distribution', 'of', 'reddening', 'and', 'r_v', 'for', 'each', 'pixel', 'using', 'two', 'independent', 'monte', 'carlo', 'methods', 'we', 'find', 'the', 'two', 'methods', 'to', 'be', 'selfconsistent', 'in', 'the', 'limits', 'where', 'they', 'are', 'expected', 'to', 'perform', 'similarly', 'we', 'also', 'find', 'some', 'agreement', 'with', 'highprecision', 'photometric', 'studies', 'of', 'r_v', 'in', 'perseus', 'and', 'ophiuchus', 'as', 'well', 'as', 'with', 'a', 'map', 'of', 'reddening', 'near', 'the', 'galactic', 'plane', 'based', 'on', 'stellar', 'spectra', 'from', 'apogee', 'while', 'current', 'studies', 'of', 'r_v', 'are', 'mostly', 'limited', 'to', 'isolated', 'clouds', 'we', 'have', 'developed', 'a', 'systematic', 'method', 'for', 'comparing', 'r_v', 'values', 'for', 'the', 'majority', 'of', 'observable', 'dust', 'this', 'is', 'a', 'proof', 'of', 'concept', 'for', 'a', 'more', 'rigorous', 'galactic', 'reddening', 'mapx']]
|
[-0.005223773931222106, 0.04177763002269246, -0.1131284290165813, 0.07267194609675143, -0.07666174246136237, -0.06163959803611592, 0.09838161308370116, 0.4697363501621617, -0.19909079065891327, -0.3317331914548521, 0.027958024018099187, -0.31250927038145837, -0.041280923369858, 0.23777433564127595, -0.06695281978420638, 0.02083463219298412, 0.0543939426265381, -0.07948576472699642, -0.05242069613412712, -0.235494114720711, 0.26992122211010644, 0.039523235304901996, 0.17927117731974082, -0.06069400550935555, 0.09721689268394752, -0.061207571280775246, -0.12790880144953176, 0.039680501070688476, -0.18537850915626794, 0.10173625045507732, 0.24795958057425363, 0.12169873181733742, 0.20016892498566044, -0.3162550076428387, -0.19771097807765559, 0.10949645906824756, 0.20916338889618163, 0.10747347343023177, -0.06323977557702973, -0.2503563476933373, 0.06839788179775631, -0.16470334679233256, -0.1404120131775185, -0.007029499950887704, 0.043529414702896715, 0.06395731932888911, -0.2574189312963022, 0.12039218943833407, -0.0315784688219773, 0.1553437178540561, -0.10486547485235388, -0.16186534715471446, -0.03288952588379659, 0.12549856750777474, -0.01259373871833776, 0.06038735898004638, 0.1449198215165072, -0.11530937364290433, -0.011606194992998132, 0.405991635085256, -0.04966847031308269, -0.10225428384944314, 0.13407276422302755, -0.17268694082481995, -0.20064105572247948, 0.10247609676120596, 0.16442875172468593, 0.13401786950503097, -0.19719366635437366, 0.03899380251532421, -0.03127705552873926, 0.16138393404307189, 0.030539917428460385, 0.02987410387113751, 0.2796183294651133, 0.09762072899827251, 0.07882440885770377, 0.08841172950600998, -0.24439455925624956, -0.08170267332138287, -0.2723420067724806, -0.10681081761916479, -0.1670457176959004, 0.054070261664067705, -0.1617385782436166, -0.1519002837749819, 0.33044694308881406, 0.19546296308162037, 0.2531984069884789, 0.0965794715148621, 0.3620202071412846, 0.0739407937861634, 0.115935351330511, 0.10315508980786911, 0.3102434851170983, 0.1373432000823043, 0.07157504202418581, -0.1599726934572337, 0.07329393526608194, 0.02656139635687901]
|
1,803.09073
|
Contractively embedded invariant subspaces
|
This paper focuses on representations of contractively embedded invariant
subspaces in several variables. We present a version of the de Branges theorem
for $n$-tuples of multiplication operators by the coordinate functions on
analytic reproducing kernel Hilbert spaces over the unit ball $\mathbb{B}^n$
and the Hardy space over the unit polydics $\mathbb{D}^n$ in $\mathbb{C}^n$.
|
math.FA math.CV math.OA
|
this paper focuses on representations of contractively embedded invariant subspaces in several variables we present a version of the de branges theorem for ntuples of multiplication operators by the coordinate functions on analytic reproducing kernel hilbert spaces over the unit ball mathbbbn and the hardy space over the unit polydics mathbbdn in mathbbcn
|
[['this', 'paper', 'focuses', 'on', 'representations', 'of', 'contractively', 'embedded', 'invariant', 'subspaces', 'in', 'several', 'variables', 'we', 'present', 'a', 'version', 'of', 'the', 'de', 'branges', 'theorem', 'for', 'ntuples', 'of', 'multiplication', 'operators', 'by', 'the', 'coordinate', 'functions', 'on', 'analytic', 'reproducing', 'kernel', 'hilbert', 'spaces', 'over', 'the', 'unit', 'ball', 'mathbbbn', 'and', 'the', 'hardy', 'space', 'over', 'the', 'unit', 'polydics', 'mathbbdn', 'in', 'mathbbcn']]
|
[-0.16697571047832474, 0.042795855975083, -0.06446041877811345, 0.06450775735608588, -0.02599476117085522, 0.0073893850382704, -0.024115358983041145, 0.3710434942577894, -0.30089914411879504, -0.08359429788274261, 0.1511785029926194, -0.25457907741628544, -0.13717812029286647, 0.22775634984449986, -0.1705235998826818, 0.0839856005130479, 0.036864405865064606, 0.044982601351176314, -0.14792048558145046, -0.3115905876844548, 0.4977834645945292, -0.030650712406406037, 0.17437141836405948, -0.0378184390003578, 0.15263286922485209, 0.1009139842622412, -0.05893921399883066, -0.14301930055472228, -0.14788642330453372, 0.21686574022113256, 0.28184268451653993, 0.14298065362247422, 0.3114708775224594, -0.3850126455609615, -0.16817102717378965, 0.23270200757094875, 0.1656115950586704, -0.14301629188972023, 0.008549870094821718, -0.331379901456575, -0.032202198080575235, -0.091823929347671, -0.09534219065076635, -0.12304829523110619, 0.024622351146088198, 0.0061512209926709496, -0.2655082746193959, 0.004163976015451436, 0.11761219932052952, 0.08929737584772877, -0.19928341530836546, -0.10715868593587612, 0.02968181749411787, 0.010948303066050777, -0.09878049937721628, 0.15620555034659517, 0.12440454779145792, 0.021024876995047983, -0.10316766255821747, 0.30963301570871127, -0.08323851268841491, -0.3542302969055107, 0.07764694640914407, -0.25665180042135316, -0.14952886145776853, 0.024616233655251563, 0.16481538811841837, 0.1691125352293826, -0.04708141079530693, 0.32297224670429175, -0.15015958704484197, 0.08346048732906078, 0.1322979671128381, 0.08145210065413266, 0.05742015660059853, 0.060644307191698596, 0.10676492661094436, 0.13621388676647955, 0.014134868648397969, -0.1451477951833602, -0.37891949627261895, -0.2576469251384529, -0.20495079104931882, 0.057426553076276414, -0.14932975907280566, -0.20896533676064932, 0.4220243942959664, 0.014556249012597479, 0.27058869322018625, 0.12600413683013847, 0.21367969256467545, 0.026681673999589223, 0.11994975187385884, 0.08588109602435277, 0.04034348390996456, 0.17648187864016598, 0.07329298938678291, -0.10647526806077132, -0.06397408874741253, 0.2934511521508774]
|
1,803.09074
|
Multi-range Reasoning for Machine Comprehension
|
We propose MRU (Multi-Range Reasoning Units), a new fast compositional
encoder for machine comprehension (MC). Our proposed MRU encoders are
characterized by multi-ranged gating, executing a series of parameterized
contract-and-expand layers for learning gating vectors that benefit from long
and short-term dependencies. The aims of our approach are as follows: (1)
learning representations that are concurrently aware of long and short-term
context, (2) modeling relationships between intra-document blocks and (3) fast
and efficient sequence encoding. We show that our proposed encoder demonstrates
promising results both as a standalone encoder and as well as a complementary
building block. We conduct extensive experiments on three challenging MC
datasets, namely RACE, SearchQA and NarrativeQA, achieving highly competitive
performance on all. On the RACE benchmark, our model outperforms DFN (Dynamic
Fusion Networks) by 1.5%-6% without using any recurrent or convolution layers.
Similarly, we achieve competitive performance relative to AMANDA on the
SearchQA benchmark and BiDAF on the NarrativeQA benchmark without using any
LSTM/GRU layers. Finally, incorporating MRU encoders with standard BiLSTM
architectures further improves performance, achieving state-of-the-art results.
|
cs.CL cs.AI cs.NE
|
we propose mru multirange reasoning units a new fast compositional encoder for machine comprehension mc our proposed mru encoders are characterized by multiranged gating executing a series of parameterized contractandexpand layers for learning gating vectors that benefit from long and shortterm dependencies the aims of our approach are as follows 1 learning representations that are concurrently aware of long and shortterm context 2 modeling relationships between intradocument blocks and 3 fast and efficient sequence encoding we show that our proposed encoder demonstrates promising results both as a standalone encoder and as well as a complementary building block we conduct extensive experiments on three challenging mc datasets namely race searchqa and narrativeqa achieving highly competitive performance on all on the race benchmark our model outperforms dfn dynamic fusion networks by 156 without using any recurrent or convolution layers similarly we achieve competitive performance relative to amanda on the searchqa benchmark and bidaf on the narrativeqa benchmark without using any lstmgru layers finally incorporating mru encoders with standard bilstm architectures further improves performance achieving stateoftheart results
|
[['we', 'propose', 'mru', 'multirange', 'reasoning', 'units', 'a', 'new', 'fast', 'compositional', 'encoder', 'for', 'machine', 'comprehension', 'mc', 'our', 'proposed', 'mru', 'encoders', 'are', 'characterized', 'by', 'multiranged', 'gating', 'executing', 'a', 'series', 'of', 'parameterized', 'contractandexpand', 'layers', 'for', 'learning', 'gating', 'vectors', 'that', 'benefit', 'from', 'long', 'and', 'shortterm', 'dependencies', 'the', 'aims', 'of', 'our', 'approach', 'are', 'as', 'follows', '1', 'learning', 'representations', 'that', 'are', 'concurrently', 'aware', 'of', 'long', 'and', 'shortterm', 'context', '2', 'modeling', 'relationships', 'between', 'intradocument', 'blocks', 'and', '3', 'fast', 'and', 'efficient', 'sequence', 'encoding', 'we', 'show', 'that', 'our', 'proposed', 'encoder', 'demonstrates', 'promising', 'results', 'both', 'as', 'a', 'standalone', 'encoder', 'and', 'as', 'well', 'as', 'a', 'complementary', 'building', 'block', 'we', 'conduct', 'extensive', 'experiments', 'on', 'three', 'challenging', 'mc', 'datasets', 'namely', 'race', 'searchqa', 'and', 'narrativeqa', 'achieving', 'highly', 'competitive', 'performance', 'on', 'all', 'on', 'the', 'race', 'benchmark', 'our', 'model', 'outperforms', 'dfn', 'dynamic', 'fusion', 'networks', 'by', '156', 'without', 'using', 'any', 'recurrent', 'or', 'convolution', 'layers', 'similarly', 'we', 'achieve', 'competitive', 'performance', 'relative', 'to', 'amanda', 'on', 'the', 'searchqa', 'benchmark', 'and', 'bidaf', 'on', 'the', 'narrativeqa', 'benchmark', 'without', 'using', 'any', 'lstmgru', 'layers', 'finally', 'incorporating', 'mru', 'encoders', 'with', 'standard', 'bilstm', 'architectures', 'further', 'improves', 'performance', 'achieving', 'stateoftheart', 'results']]
|
[-0.07020589962536306, -0.001969672663257136, -0.019921696171632898, 0.05614282706260888, -0.08326780700331761, -0.22102193416495214, 0.05495333704043572, 0.4709441521537234, -0.2704530557568528, -0.33105274052386396, 0.09488584355543754, -0.2548581341292426, -0.1905096463970731, 0.2401423416568827, -0.08380095793713124, 0.08765669157578779, 0.16404267248005894, 0.007955430471066016, -0.07152893090054219, -0.28229565177472277, 0.24479306871561626, 0.08867922210956962, 0.34510592587121314, 0.006357331123006971, 0.16489775385979932, -0.014885906217216749, -0.014975029928201255, -0.028114764858581866, -0.019086427032790617, 0.14093476663512444, 0.2604208634185948, 0.1750869429043946, 0.268410693359839, -0.42411208317318266, -0.23153994638848593, 0.00589011121563047, 0.1416734658884244, 0.04339226801297287, -0.036249026591475636, -0.3136438914215225, 0.13327526685384194, -0.20271189678773524, 0.09935768677346539, -0.16512856703954176, -0.052321028473585496, 0.03379186064723814, -0.3252150935627389, 0.02289960587435342, 0.10300821657599751, 0.052461174322150604, -0.04206607940372581, -0.19411031500033338, 0.04234807456745521, 0.1959348253195027, -0.005196515817946771, 0.061097748686521375, 0.11236254298958753, -0.15066030465763564, -0.21150513180689504, 0.30241024515956466, -0.11653371020363186, -0.19423431561911228, 0.24614615603867504, 0.015535300194520003, -0.1465327780127351, 0.03859102983049482, 0.205440370830277, 0.12067277899981417, -0.12240449086986264, -0.004283538195427115, -0.0576592571270919, 0.20785919704838052, 0.0707613526971477, 0.01008017737233238, 0.16910222423872542, 0.31458510886006363, 0.008804924769751858, 0.14136807978349297, -0.13521692358442086, -0.09573910558291258, -0.2073931617237497, -0.1101469826116635, -0.15442065532490806, -0.030375131298324955, -0.1205206454278968, -0.10090626857913378, 0.381371002175916, 0.21622649826959037, 0.1905052638422066, 0.16842555806411114, 0.36118652913392635, -0.017470872624673776, 0.12537460184890276, 0.15339751541614532, 0.1601101004148218, 0.01841444252276717, 0.09459122055487935, -0.16830597134247116, 0.09940154744551806, 0.049037390031813705]
|
1,803.09075
|
Design of a sustainable pre-polarizing magnetic resonance imaging system
for infant hydrocephalus
|
The need for affordable and appropriate medical technologies for developing
countries continue to rise as challenges such as inadequate energy supply,
limited technical expertise and poor infrastructure persists. Low-field MRI is
a technology that can be tailored to meet specific imaging needs within such
countries. Its low power requirements and the possibility of operating in
minimally shielded or unshielded environments make it especially attractive.
Although the technology has been widely demonstrated over several decades, it
is yet to be shown that it can be diagnostic and improve patient outcomes in
clinical applications. We here demonstrate the robustness of pre-polarizing MRI
(PMRI) technology for assembly and deployment in developing countries for the
specific application to infant hydrocephalus. Hydrocephalus treatment planning
and management requires modest spatial resolution, and only that the brain can
be distinguished from fluid - tissue contrast detail within the brain
parenchyma is not essential. We constructed an internally shielded PMRI system
based on the Lee-Whiting coil system with a 22 cm diameter of spherical volume.
In an unshielded room, projection phantom images were acquired at 113 kHz with
in-plane resolution of 3 mm x 3 mm, by introducing gradient fields of
sufficient magnitude to dominate the 5000ppm inhomogeneity of the readout
field. The low cost, straightforward assembly, deployment potential, and
maintenance requirements demonstrate the suitability of our PMRI system for
developing countries. Further improvement in the image spatial resolution and
contrast of low-field MRI will broaden its potential clinical utility beyond
hydrocephalus.
|
physics.med-ph eess.IV
|
the need for affordable and appropriate medical technologies for developing countries continue to rise as challenges such as inadequate energy supply limited technical expertise and poor infrastructure persists lowfield mri is a technology that can be tailored to meet specific imaging needs within such countries its low power requirements and the possibility of operating in minimally shielded or unshielded environments make it especially attractive although the technology has been widely demonstrated over several decades it is yet to be shown that it can be diagnostic and improve patient outcomes in clinical applications we here demonstrate the robustness of prepolarizing mri pmri technology for assembly and deployment in developing countries for the specific application to infant hydrocephalus hydrocephalus treatment planning and management requires modest spatial resolution and only that the brain can be distinguished from fluid tissue contrast detail within the brain parenchyma is not essential we constructed an internally shielded pmri system based on the leewhiting coil system with a 22 cm diameter of spherical volume in an unshielded room projection phantom images were acquired at 113 khz with inplane resolution of 3 mm x 3 mm by introducing gradient fields of sufficient magnitude to dominate the 5000ppm inhomogeneity of the readout field the low cost straightforward assembly deployment potential and maintenance requirements demonstrate the suitability of our pmri system for developing countries further improvement in the image spatial resolution and contrast of lowfield mri will broaden its potential clinical utility beyond hydrocephalus
|
[['the', 'need', 'for', 'affordable', 'and', 'appropriate', 'medical', 'technologies', 'for', 'developing', 'countries', 'continue', 'to', 'rise', 'as', 'challenges', 'such', 'as', 'inadequate', 'energy', 'supply', 'limited', 'technical', 'expertise', 'and', 'poor', 'infrastructure', 'persists', 'lowfield', 'mri', 'is', 'a', 'technology', 'that', 'can', 'be', 'tailored', 'to', 'meet', 'specific', 'imaging', 'needs', 'within', 'such', 'countries', 'its', 'low', 'power', 'requirements', 'and', 'the', 'possibility', 'of', 'operating', 'in', 'minimally', 'shielded', 'or', 'unshielded', 'environments', 'make', 'it', 'especially', 'attractive', 'although', 'the', 'technology', 'has', 'been', 'widely', 'demonstrated', 'over', 'several', 'decades', 'it', 'is', 'yet', 'to', 'be', 'shown', 'that', 'it', 'can', 'be', 'diagnostic', 'and', 'improve', 'patient', 'outcomes', 'in', 'clinical', 'applications', 'we', 'here', 'demonstrate', 'the', 'robustness', 'of', 'prepolarizing', 'mri', 'pmri', 'technology', 'for', 'assembly', 'and', 'deployment', 'in', 'developing', 'countries', 'for', 'the', 'specific', 'application', 'to', 'infant', 'hydrocephalus', 'hydrocephalus', 'treatment', 'planning', 'and', 'management', 'requires', 'modest', 'spatial', 'resolution', 'and', 'only', 'that', 'the', 'brain', 'can', 'be', 'distinguished', 'from', 'fluid', 'tissue', 'contrast', 'detail', 'within', 'the', 'brain', 'parenchyma', 'is', 'not', 'essential', 'we', 'constructed', 'an', 'internally', 'shielded', 'pmri', 'system', 'based', 'on', 'the', 'leewhiting', 'coil', 'system', 'with', 'a', '22', 'cm', 'diameter', 'of', 'spherical', 'volume', 'in', 'an', 'unshielded', 'room', 'projection', 'phantom', 'images', 'were', 'acquired', 'at', '113', 'khz', 'with', 'inplane', 'resolution', 'of', '3', 'mm', 'x', '3', 'mm', 'by', 'introducing', 'gradient', 'fields', 'of', 'sufficient', 'magnitude', 'to', 'dominate', 'the', '5000ppm', 'inhomogeneity', 'of', 'the', 'readout', 'field', 'the', 'low', 'cost', 'straightforward', 'assembly', 'deployment', 'potential', 'and', 'maintenance', 'requirements', 'demonstrate', 'the', 'suitability', 'of', 'our', 'pmri', 'system', 'for', 'developing', 'countries', 'further', 'improvement', 'in', 'the', 'image', 'spatial', 'resolution', 'and', 'contrast', 'of', 'lowfield', 'mri', 'will', 'broaden', 'its', 'potential', 'clinical', 'utility', 'beyond', 'hydrocephalus']]
|
[-0.05680331613160282, 0.09529630347921435, -0.011094577858845394, 0.03249655780624986, -0.06374198244011495, -0.15368379096034915, -0.0013572767396302272, 0.4199361267887677, -0.21954467663696656, -0.33768647228134796, 0.15895597749574034, -0.22681053627748043, -0.11510989227196357, 0.22925382477211922, -0.13202030164175085, 0.04345876065878353, 0.0670357025199337, -0.006916910768874611, -0.014833684322123493, -0.24081118184452255, 0.2225825718502165, 0.09287657464446966, 0.3492490079098692, 0.08556274303894801, 0.09845928404829465, -0.025770196749363095, 0.003143039580997235, 0.0339289685235902, -0.08678450834798544, 0.11253465487388895, 0.3588200913664574, 0.17075707949891997, 0.32199881089036353, -0.472387354836125, -0.2322263032590854, 0.08452094306315606, 0.16199409057153388, 0.05151526780100539, -0.05175416741646283, -0.2613747465754083, 0.09135095240344526, -0.180674150310612, -0.1274325544602713, -0.09246059683403776, -0.0026940772445717205, -0.0037949793525816253, -0.27005566494578187, 0.06748338651377708, 0.0005182963373954408, 0.12494522907121185, -0.08018117011621749, -0.10275749309851866, 0.0036580503665997336, 0.16462672189324318, -0.007638104139429439, 0.06580508293312354, 0.20844918969863405, -0.183191817686505, -0.07296557725057937, 0.32536532391871636, 0.01715857420009949, -0.14969611142102318, 0.21779116196606385, -0.15151002152075912, -0.08983028859414238, 0.14920721078306087, 0.15504256108227613, 0.05249693822503711, -0.17385203728032744, 0.06706872835638933, 0.08622988645220175, 0.1923809878799754, 0.09111655682208948, 0.01251919381126451, 0.21133364519046155, 0.24732584451436804, 0.08096932657669337, 0.10969242336747508, -0.1365280671530248, -0.028109072915200765, -0.2213931799303585, -0.16912432748746747, -0.15237741568222798, 0.04485386748037854, -0.0727668037341573, -0.1309200928259088, 0.3460572783447181, 0.18004902923336583, 0.09924543082888704, -0.015546859601939408, 0.35020238982203106, 0.02781814546736617, 0.13477871174060663, 0.035869125969475134, 0.22049392925109715, 0.06873965246874529, 0.1687106132968135, -0.18817327398113168, 0.06148767182603478, -0.06666903556518568]
|
1,803.09076
|
Ground-state magnetization of the Ising spin glass: A recursive
numerical method and Chen-Ma scaling
|
The ground-state properties of quasi-one-dimensional (Q1D) Ising spin glass
are investigated using an exact numerical approach and analytical arguments. A
set of coupled recursive equations for the ground-state energy are introduced
and solved numerically. For various types of coupling distribution, we obtain
accurate results for magnetization, particularly in the presence of a weak
external magnetic field. We show that in the weak magnetic field limit, similar
to the 1D model, magnetization exhibits a singular power-law behavior with
divergent susceptibility. Remarkably, the spectrum of magnetic exponents is
markedly different from that of the 1D system even in the case of two coupled
chains. The magnetic exponent makes a crossover from being dependent on the
distribution function to a constant value independent of distribution. We
provide an analytic theory for these observations by extending the Chen-Ma
argument to the Q1D case. We derive an analytical formula for the exponent
which is in perfect agreement with the numerical results.
|
cond-mat.dis-nn
|
the groundstate properties of quasionedimensional q1d ising spin glass are investigated using an exact numerical approach and analytical arguments a set of coupled recursive equations for the groundstate energy are introduced and solved numerically for various types of coupling distribution we obtain accurate results for magnetization particularly in the presence of a weak external magnetic field we show that in the weak magnetic field limit similar to the 1d model magnetization exhibits a singular powerlaw behavior with divergent susceptibility remarkably the spectrum of magnetic exponents is markedly different from that of the 1d system even in the case of two coupled chains the magnetic exponent makes a crossover from being dependent on the distribution function to a constant value independent of distribution we provide an analytic theory for these observations by extending the chenma argument to the q1d case we derive an analytical formula for the exponent which is in perfect agreement with the numerical results
|
[['the', 'groundstate', 'properties', 'of', 'quasionedimensional', 'q1d', 'ising', 'spin', 'glass', 'are', 'investigated', 'using', 'an', 'exact', 'numerical', 'approach', 'and', 'analytical', 'arguments', 'a', 'set', 'of', 'coupled', 'recursive', 'equations', 'for', 'the', 'groundstate', 'energy', 'are', 'introduced', 'and', 'solved', 'numerically', 'for', 'various', 'types', 'of', 'coupling', 'distribution', 'we', 'obtain', 'accurate', 'results', 'for', 'magnetization', 'particularly', 'in', 'the', 'presence', 'of', 'a', 'weak', 'external', 'magnetic', 'field', 'we', 'show', 'that', 'in', 'the', 'weak', 'magnetic', 'field', 'limit', 'similar', 'to', 'the', '1d', 'model', 'magnetization', 'exhibits', 'a', 'singular', 'powerlaw', 'behavior', 'with', 'divergent', 'susceptibility', 'remarkably', 'the', 'spectrum', 'of', 'magnetic', 'exponents', 'is', 'markedly', 'different', 'from', 'that', 'of', 'the', '1d', 'system', 'even', 'in', 'the', 'case', 'of', 'two', 'coupled', 'chains', 'the', 'magnetic', 'exponent', 'makes', 'a', 'crossover', 'from', 'being', 'dependent', 'on', 'the', 'distribution', 'function', 'to', 'a', 'constant', 'value', 'independent', 'of', 'distribution', 'we', 'provide', 'an', 'analytic', 'theory', 'for', 'these', 'observations', 'by', 'extending', 'the', 'chenma', 'argument', 'to', 'the', 'q1d', 'case', 'we', 'derive', 'an', 'analytical', 'formula', 'for', 'the', 'exponent', 'which', 'is', 'in', 'perfect', 'agreement', 'with', 'the', 'numerical', 'results']]
|
[-0.1682701972072884, 0.12562297001554285, -0.07950305875931536, 0.053666520898320504, -0.039151737660980755, -0.15015509059172003, 0.014269484518726746, 0.35977776073174733, -0.21806648896195957, -0.2728224679106666, 0.047785679902881385, -0.28931792943828527, -0.13044307391279408, 0.23665518596648208, 0.07120208190153203, 0.0583579154745225, -0.005686158212202211, 0.031368714892643416, -0.1004100508732541, -0.18787875786543853, 0.31401329591810223, 0.008597957351875882, 0.2930640961734518, 0.06003961260881155, 0.05823842688133159, 0.016006062795678455, 0.06669964185547865, 0.056392306260644426, -0.18598458651019514, 0.06832755703418966, 0.18378914371883917, -0.024928083557367038, 0.1824549588585092, -0.41877041840625384, -0.2037381722802116, 0.049685437887186004, 0.15771489327382898, 0.1452113735361866, -0.046136926142348635, -0.25753145657119253, 0.07210368048700114, -0.15131809629289614, -0.20441121264931655, -0.10994719860534514, -0.003459980535591322, 0.05651856149967399, -0.32150884642596206, 0.12813277864047595, 0.057580810707182656, 0.0925116537018649, -0.12471261614926099, -0.09045515374896387, 0.0018520640306955865, 0.10149812785150003, 0.07452820045648202, 0.0218115076362606, 0.08500414847306186, -0.1492766842666653, -0.0861267289957933, 0.31127726453236276, -0.0922670497153435, -0.1909724847834197, 0.16687770070988805, -0.1613887125926633, -0.11655105816560887, 0.13755683711835093, 0.10153719221031474, 0.12382487045946501, -0.13891011162871314, 0.0970916805601108, -0.053618207315523775, 0.16263752156463002, -0.004532800883715672, 0.015878777289641044, 0.19494443240785791, 0.13692340943962336, 0.017560906829913295, 0.20083327956662902, -0.07589241102067454, -0.15709184129692375, -0.2694416401787631, -0.12076055056466195, -0.2220147046230493, 0.08801796435108108, -0.14746501422618635, -0.20542760397337617, 0.3939102397300303, 0.1725404005497694, 0.1888008109834646, 0.07339084725902086, 0.2539739571346511, 0.18588470081102118, -0.011416270002542485, 0.0631038309104981, 0.24174060482051105, 0.18883924952618056, 0.09711637880593058, -0.2624364930505474, 0.03421081029359371, 0.060524660628288984]
|
1,803.09077
|
Non-calorimetric determination of absorbed power during magnetic
nanoparticle based hyperthermia
|
Nanomagnetic hyperthermia (NMH) is intensively studied with the prospect of
cancer therapy. A major challenge is to determine the dissipated power during
in vivo conditions and conventional methods are either invasive or inaccurate.
We present a non-calorimetric method which yields the heat absorbed during
hyperthermia: it is based on accurately measuring the quality factor change of
a resonant radio frequency circuit which is employed for the irradiation. The
approach provides the absorbed power in real-time, without the need to monitor
the sample temperature as a function of time. As such, it is free from the
problems caused by the non-adiabatic heating conditions of the usual
calorimetry. We validate the method by comparing the dissipated power with a
conventional calorimetric measurement. We present the validation for two types
of resonators with very different filling factors: a solenoid and a so-called
birdcage coil. The latter is a volume coil, which is generally used in magnetic
resonance imaging (MRI) under in vivo condition. The presented method therefore
allows to effectively combine MRI and thermotherapy and is thus readily
adaptable to existing imaging hardware.
|
physics.med-ph physics.app-ph
|
nanomagnetic hyperthermia nmh is intensively studied with the prospect of cancer therapy a major challenge is to determine the dissipated power during in vivo conditions and conventional methods are either invasive or inaccurate we present a noncalorimetric method which yields the heat absorbed during hyperthermia it is based on accurately measuring the quality factor change of a resonant radio frequency circuit which is employed for the irradiation the approach provides the absorbed power in realtime without the need to monitor the sample temperature as a function of time as such it is free from the problems caused by the nonadiabatic heating conditions of the usual calorimetry we validate the method by comparing the dissipated power with a conventional calorimetric measurement we present the validation for two types of resonators with very different filling factors a solenoid and a socalled birdcage coil the latter is a volume coil which is generally used in magnetic resonance imaging mri under in vivo condition the presented method therefore allows to effectively combine mri and thermotherapy and is thus readily adaptable to existing imaging hardware
|
[['nanomagnetic', 'hyperthermia', 'nmh', 'is', 'intensively', 'studied', 'with', 'the', 'prospect', 'of', 'cancer', 'therapy', 'a', 'major', 'challenge', 'is', 'to', 'determine', 'the', 'dissipated', 'power', 'during', 'in', 'vivo', 'conditions', 'and', 'conventional', 'methods', 'are', 'either', 'invasive', 'or', 'inaccurate', 'we', 'present', 'a', 'noncalorimetric', 'method', 'which', 'yields', 'the', 'heat', 'absorbed', 'during', 'hyperthermia', 'it', 'is', 'based', 'on', 'accurately', 'measuring', 'the', 'quality', 'factor', 'change', 'of', 'a', 'resonant', 'radio', 'frequency', 'circuit', 'which', 'is', 'employed', 'for', 'the', 'irradiation', 'the', 'approach', 'provides', 'the', 'absorbed', 'power', 'in', 'realtime', 'without', 'the', 'need', 'to', 'monitor', 'the', 'sample', 'temperature', 'as', 'a', 'function', 'of', 'time', 'as', 'such', 'it', 'is', 'free', 'from', 'the', 'problems', 'caused', 'by', 'the', 'nonadiabatic', 'heating', 'conditions', 'of', 'the', 'usual', 'calorimetry', 'we', 'validate', 'the', 'method', 'by', 'comparing', 'the', 'dissipated', 'power', 'with', 'a', 'conventional', 'calorimetric', 'measurement', 'we', 'present', 'the', 'validation', 'for', 'two', 'types', 'of', 'resonators', 'with', 'very', 'different', 'filling', 'factors', 'a', 'solenoid', 'and', 'a', 'socalled', 'birdcage', 'coil', 'the', 'latter', 'is', 'a', 'volume', 'coil', 'which', 'is', 'generally', 'used', 'in', 'magnetic', 'resonance', 'imaging', 'mri', 'under', 'in', 'vivo', 'condition', 'the', 'presented', 'method', 'therefore', 'allows', 'to', 'effectively', 'combine', 'mri', 'and', 'thermotherapy', 'and', 'is', 'thus', 'readily', 'adaptable', 'to', 'existing', 'imaging', 'hardware']]
|
[-0.08309372333945009, 0.12635591942895016, -0.04789488622788652, 0.028865943220574095, -0.0665396913800222, -0.14938115451599382, 0.020835039877025775, 0.3769784455614258, -0.23015741772908072, -0.3221168325506359, 0.1073798978565958, -0.23900952321932814, -0.11756813729327567, 0.2807728731263346, -0.06134133459219719, 0.08135865888605154, 0.05480790860930135, 0.016933492050563406, -0.013054581466989394, -0.17744058456048162, 0.25556303233990457, 0.09743352808245567, 0.3190138052404967, 0.0561931018854814, 0.09916766174657884, -0.01186146451597357, -0.006039659971340075, 0.04094570765386247, -0.11182091328024073, 0.09670935408439872, 0.26068370683149916, 0.10652351860924723, 0.2749385925057974, -0.45787690409735415, -0.23680047893782236, 0.08366166229890504, 0.10797153441911803, 0.08317775990327497, -0.05521823645389883, -0.22332947017552132, 0.064364111303305, -0.14045956716144342, -0.09681328806041495, -0.07876883271311581, -0.03494479268133723, 0.01331840238895517, -0.3220153165637781, 0.10479284152024368, 0.024029990210712955, 0.06374692941779093, -0.08226269155814879, -0.06821298132021, 0.040078370311614854, 0.10958558958746992, 0.02470616569258689, 0.04875572975568848, 0.21582919168390083, -0.12291821247154025, -0.07463851151207472, 0.3452038793550159, -0.009737444475719798, -0.17381327964564494, 0.1847008329448056, -0.13842541100873546, -0.0684256029689903, 0.1623020957109607, 0.1326616046945018, 0.1157541290711216, -0.2073292245629228, 0.02489229616144537, 0.06346357107037605, 0.184167128040679, 0.05488177180789702, -0.02215082850827518, 0.1824820761233256, 0.22690780351052903, 0.02611440277590765, 0.17859279551880183, -0.1424483434549486, -0.003521126142167096, -0.23500225562914456, -0.15770372992652004, -0.17354937355351432, 0.04504978168344739, -0.029696334233733843, -0.15812164627265332, 0.3978567185379856, 0.14810166068572822, 0.14188322960008873, -0.014597298347849045, 0.4038872674482162, 0.10892974660606981, 0.1202959115825094, 0.028533656087667583, 0.24475511126337293, 0.11192791310253465, 0.1331807129090267, -0.27204245246046704, 0.07983015516419067, 0.0036318311077547807]
|
1,803.09078
|
Quasinormal modes of black strings in de Rham-Gabadadze-Tolley massive
gravity
|
The effect of massive scalar perturbations on neutral black string in de
Rham-Gabadadze-Tolley (dRGT) massive gravity is investigated through the study
of the quasi-normal modes~(QNMs). Due to the similarity between the equation of
motion of the field in the black-string and black-hole background, similar
numerical and analytical techniques can be used to explore the behaviour of the
QNMs. We use the asymptotic iteration method (AIM) and the WKB method to
numerically calculate the QNMs of scalar perturbation in the black string
background with positive cosmological constant. High-momentum behaviour of such
QNMs can be analytically approximated by the first-order WKB method with
excellent accuracy. For near-extremal black string with event horizon very
close to the cosmological horizon, the P\"oschl-Teller technique gives accurate
analytic formula for the QNMs. When massive-gravity-parameter $\gamma$
increases, we found that the scalar modes oscillate with higher frequencies and
decay faster. The QNMs of black string in spacetime with negative cosmological
constant are explored in all range of possible $\gamma$ using the spectral
method. We found the movement of the holographic sound poles to collide and
form diffusive poles as $\gamma$ changes from positive to negative values. We
observe no evidence of instability of neutral black string in both positive and
negative cosmological constant cases.
|
gr-qc hep-th
|
the effect of massive scalar perturbations on neutral black string in de rhamgabadadzetolley drgt massive gravity is investigated through the study of the quasinormal modesqnms due to the similarity between the equation of motion of the field in the blackstring and blackhole background similar numerical and analytical techniques can be used to explore the behaviour of the qnms we use the asymptotic iteration method aim and the wkb method to numerically calculate the qnms of scalar perturbation in the black string background with positive cosmological constant highmomentum behaviour of such qnms can be analytically approximated by the firstorder wkb method with excellent accuracy for nearextremal black string with event horizon very close to the cosmological horizon the poschlteller technique gives accurate analytic formula for the qnms when massivegravityparameter gamma increases we found that the scalar modes oscillate with higher frequencies and decay faster the qnms of black string in spacetime with negative cosmological constant are explored in all range of possible gamma using the spectral method we found the movement of the holographic sound poles to collide and form diffusive poles as gamma changes from positive to negative values we observe no evidence of instability of neutral black string in both positive and negative cosmological constant cases
|
[['the', 'effect', 'of', 'massive', 'scalar', 'perturbations', 'on', 'neutral', 'black', 'string', 'in', 'de', 'rhamgabadadzetolley', 'drgt', 'massive', 'gravity', 'is', 'investigated', 'through', 'the', 'study', 'of', 'the', 'quasinormal', 'modesqnms', 'due', 'to', 'the', 'similarity', 'between', 'the', 'equation', 'of', 'motion', 'of', 'the', 'field', 'in', 'the', 'blackstring', 'and', 'blackhole', 'background', 'similar', 'numerical', 'and', 'analytical', 'techniques', 'can', 'be', 'used', 'to', 'explore', 'the', 'behaviour', 'of', 'the', 'qnms', 'we', 'use', 'the', 'asymptotic', 'iteration', 'method', 'aim', 'and', 'the', 'wkb', 'method', 'to', 'numerically', 'calculate', 'the', 'qnms', 'of', 'scalar', 'perturbation', 'in', 'the', 'black', 'string', 'background', 'with', 'positive', 'cosmological', 'constant', 'highmomentum', 'behaviour', 'of', 'such', 'qnms', 'can', 'be', 'analytically', 'approximated', 'by', 'the', 'firstorder', 'wkb', 'method', 'with', 'excellent', 'accuracy', 'for', 'nearextremal', 'black', 'string', 'with', 'event', 'horizon', 'very', 'close', 'to', 'the', 'cosmological', 'horizon', 'the', 'poschlteller', 'technique', 'gives', 'accurate', 'analytic', 'formula', 'for', 'the', 'qnms', 'when', 'massivegravityparameter', 'gamma', 'increases', 'we', 'found', 'that', 'the', 'scalar', 'modes', 'oscillate', 'with', 'higher', 'frequencies', 'and', 'decay', 'faster', 'the', 'qnms', 'of', 'black', 'string', 'in', 'spacetime', 'with', 'negative', 'cosmological', 'constant', 'are', 'explored', 'in', 'all', 'range', 'of', 'possible', 'gamma', 'using', 'the', 'spectral', 'method', 'we', 'found', 'the', 'movement', 'of', 'the', 'holographic', 'sound', 'poles', 'to', 'collide', 'and', 'form', 'diffusive', 'poles', 'as', 'gamma', 'changes', 'from', 'positive', 'to', 'negative', 'values', 'we', 'observe', 'no', 'evidence', 'of', 'instability', 'of', 'neutral', 'black', 'string', 'in', 'both', 'positive', 'and', 'negative', 'cosmological', 'constant', 'cases']]
|
[-0.15063545112136426, 0.12206291214300735, -0.09808072372573062, 0.14476481069939537, -0.11171723394293012, -0.15464247049745714, -0.0010650366752688746, 0.3026929828880843, -0.1620675548526811, -0.27848800345893626, 0.03823790245075446, -0.30176694194042547, -0.1367385447594943, 0.1826927354649722, 0.015653976811168407, 0.06564571891717208, 0.003728307151796242, 0.0881830129401704, -0.06081331344926052, -0.2053519230295262, 0.34951324303051257, 0.09666542827436538, 0.22306449442776372, 0.0002861255327764067, 0.07579036750288191, -0.029175974925961887, -0.019669324966617725, 0.0330080494180135, -0.17108005145003086, 0.04968503435587796, 0.22869439411011822, 0.11111153569750633, 0.20002724851924672, -0.40382076368567726, -0.19330805367383275, 0.09324027354901349, 0.22051288247632894, 0.1776286095116023, -0.06505021370000215, -0.2776420065857362, 0.10549952359011089, -0.18186180635572421, -0.17265432236887948, -0.07428738069864672, 0.035764418521475556, -0.031290557864054984, -0.2266808270083433, 0.15665472495975424, -0.013628578714877186, -0.058984260489594514, -0.10621873347441331, -0.06364669773848591, -0.01863068191094993, 0.08887500743773309, 0.20345447514182083, 0.013583302876496128, 0.13884146976763906, -0.11112518495149928, -0.10100455840007465, 0.34474788036975035, -0.1608472382988853, -0.22034420547735634, 0.15321764503198776, -0.24836385328304564, -0.06283236736981583, 0.14947098503296163, 0.14729837495938183, 0.1925778175767475, -0.09240539288703517, 0.14226090367623487, 0.07566396752372384, 0.13711011429877898, 0.17759991798423302, 0.02354288016427851, 0.3082069451174726, 0.06554379030322946, -0.016983014312731012, 0.14838843618506042, -0.03910600221195954, -0.08997605043690589, -0.32009411524547243, -0.11556261267282184, -0.14045473583578358, 0.0637531190527404, -0.1964198661267642, -0.22223814960017582, 0.33771453077285507, 0.11143228685193994, 0.1760957053867033, 0.06679131419655586, 0.2621193034461365, 0.13856392182823432, 0.010206269921997146, 0.09867725973198353, 0.31016038389688866, 0.1574041924486841, 0.13897063753463654, -0.31017500867228504, -0.0676489787693904, 0.0935506895037585]
|
1,803.09079
|
The numerical scheme splitting along the coordinates in models of
hydrocarbon migration based on Darcy flow concept and the mass conservation
law
|
One of the most sophisticated and significant stages of basin modelling is
hydrocarbon (HC) migration. In order to scrutinize this issue, it is expedient
to utilize already available numerical reservoir simulation tools. Such tools
are typically based on the Darcy flow model and are used to identify the
structural features of the formation and estimate the production profile.
Likewise, the migration of HCs can also be modelled allowing to clarify the
possible location of HC deposits with higher accuracy. Despite all the
advantages of this approach, there are some significant drawbacks, including
the long computational time required to simulate the hydrodynamic process of HC
migration. This issue cannot always be resolved by increasing computational
power due to its technological scarcity. Thus, the authors suggest using a
method of the numerical scheme splitting along the coordinates (further called
NSS-method), allowing to significantly reduce the computational time when
modelling HC migration. Explicit and implicit numerical models are created and
scrutinized for the purpose of this research. The validity of these models is
verified by their comparison with the available analytical solutions and by
analyzing the stability of numerical schemes. As a result, the influence of
NSS-method on the calculation accuracy was insignificant, allowing to decrease
the computational time and number of time steps approximately by three orders
of magnitude and 300 times, respectively.
|
physics.flu-dyn physics.comp-ph
|
one of the most sophisticated and significant stages of basin modelling is hydrocarbon hc migration in order to scrutinize this issue it is expedient to utilize already available numerical reservoir simulation tools such tools are typically based on the darcy flow model and are used to identify the structural features of the formation and estimate the production profile likewise the migration of hcs can also be modelled allowing to clarify the possible location of hc deposits with higher accuracy despite all the advantages of this approach there are some significant drawbacks including the long computational time required to simulate the hydrodynamic process of hc migration this issue cannot always be resolved by increasing computational power due to its technological scarcity thus the authors suggest using a method of the numerical scheme splitting along the coordinates further called nssmethod allowing to significantly reduce the computational time when modelling hc migration explicit and implicit numerical models are created and scrutinized for the purpose of this research the validity of these models is verified by their comparison with the available analytical solutions and by analyzing the stability of numerical schemes as a result the influence of nssmethod on the calculation accuracy was insignificant allowing to decrease the computational time and number of time steps approximately by three orders of magnitude and 300 times respectively
|
[['one', 'of', 'the', 'most', 'sophisticated', 'and', 'significant', 'stages', 'of', 'basin', 'modelling', 'is', 'hydrocarbon', 'hc', 'migration', 'in', 'order', 'to', 'scrutinize', 'this', 'issue', 'it', 'is', 'expedient', 'to', 'utilize', 'already', 'available', 'numerical', 'reservoir', 'simulation', 'tools', 'such', 'tools', 'are', 'typically', 'based', 'on', 'the', 'darcy', 'flow', 'model', 'and', 'are', 'used', 'to', 'identify', 'the', 'structural', 'features', 'of', 'the', 'formation', 'and', 'estimate', 'the', 'production', 'profile', 'likewise', 'the', 'migration', 'of', 'hcs', 'can', 'also', 'be', 'modelled', 'allowing', 'to', 'clarify', 'the', 'possible', 'location', 'of', 'hc', 'deposits', 'with', 'higher', 'accuracy', 'despite', 'all', 'the', 'advantages', 'of', 'this', 'approach', 'there', 'are', 'some', 'significant', 'drawbacks', 'including', 'the', 'long', 'computational', 'time', 'required', 'to', 'simulate', 'the', 'hydrodynamic', 'process', 'of', 'hc', 'migration', 'this', 'issue', 'can', 'not', 'always', 'be', 'resolved', 'by', 'increasing', 'computational', 'power', 'due', 'to', 'its', 'technological', 'scarcity', 'thus', 'the', 'authors', 'suggest', 'using', 'a', 'method', 'of', 'the', 'numerical', 'scheme', 'splitting', 'along', 'the', 'coordinates', 'further', 'called', 'nssmethod', 'allowing', 'to', 'significantly', 'reduce', 'the', 'computational', 'time', 'when', 'modelling', 'hc', 'migration', 'explicit', 'and', 'implicit', 'numerical', 'models', 'are', 'created', 'and', 'scrutinized', 'for', 'the', 'purpose', 'of', 'this', 'research', 'the', 'validity', 'of', 'these', 'models', 'is', 'verified', 'by', 'their', 'comparison', 'with', 'the', 'available', 'analytical', 'solutions', 'and', 'by', 'analyzing', 'the', 'stability', 'of', 'numerical', 'schemes', 'as', 'a', 'result', 'the', 'influence', 'of', 'nssmethod', 'on', 'the', 'calculation', 'accuracy', 'was', 'insignificant', 'allowing', 'to', 'decrease', 'the', 'computational', 'time', 'and', 'number', 'of', 'time', 'steps', 'approximately', 'by', 'three', 'orders', 'of', 'magnitude', 'and', '300', 'times', 'respectively']]
|
[-0.07450035692017991, 0.059785280977799136, -0.06634193159936165, 0.047720051612693416, -0.051579529366625305, -0.10580118546389382, 0.05899048754310405, 0.3693597605028613, -0.270293610404108, -0.3526405447840013, 0.1464839650085196, -0.23532266887963157, -0.08942571769293864, 0.19595493252457924, -0.021268530609086157, 0.05585856937872119, 0.07453526876210659, -0.024624130326661876, -0.03535636339458341, -0.26989066601540385, 0.2587787119206041, 0.1040572537950621, 0.2834569254773669, 0.08660692398394035, 0.05889295229598329, -0.06389613619619261, -0.09324079928046558, 0.03958671287718144, -0.12380228478630835, 0.13357696215389298, 0.23735279195180656, 0.11062672780333907, 0.2955279332323698, -0.45898507275533945, -0.23534663703969932, 0.08371570389215115, 0.16722276923035018, 0.10928844162474641, -0.03513229495094327, -0.23721507080534304, 0.10941301028228323, -0.1806108781422319, -0.13511277992405335, -0.09426692618104757, 0.015348001595967534, 0.03545556035083295, -0.22205225254451347, 0.08533415213737912, 0.02913296099074862, 0.06429314116460526, -0.05356388522407294, -0.11942697184541347, -0.04430714170236818, 0.13152465331645957, 0.09354617230538596, 0.0025228881044313312, 0.11410911272237585, -0.11572522102347152, -0.10129687423733148, 0.4009726207449355, -0.02678821195731871, -0.18856445751100018, 0.2491273770458065, -0.11309222335906022, -0.09023298647212373, 0.1556808990675067, 0.1513907199185765, 0.1050735363800248, -0.13492404124732604, 0.03470519765449519, 0.04360557084754956, 0.1586362916711633, 0.05502085670701821, -0.01304374441229315, 0.15747192865660922, 0.19670370827026834, 0.0315093292738311, 0.11675363355633718, -0.09232454649782912, -0.1246090180380799, -0.265965488743545, -0.14810417355435096, -0.14177943267489107, -0.008638487829739461, -0.09040873704467561, -0.1090819468446584, 0.389912870775598, 0.1947398191571913, 0.1765071979893202, 0.03728526334955611, 0.33531638366032646, 0.12929695657274518, 0.09448497438147156, 0.06598542858211492, 0.2285787073415122, 0.10030653981534256, 0.10653201625259086, -0.2523301001236012, 0.12143038811521943, 0.03194221857173199]
|
1,803.0908
|
AAANE: Attention-based Adversarial Autoencoder for Multi-scale Network
Embedding
|
Network embedding represents nodes in a continuous vector space and preserves
structure information from the Network. Existing methods usually adopt a
"one-size-fits-all" approach when concerning multi-scale structure information,
such as first- and second-order proximity of nodes, ignoring the fact that
different scales play different roles in the embedding learning. In this paper,
we propose an Attention-based Adversarial Autoencoder Network Embedding(AAANE)
framework, which promotes the collaboration of different scales and lets them
vote for robust representations. The proposed AAANE consists of two components:
1) Attention-based autoencoder effectively capture the highly non-linear
network structure, which can de-emphasize irrelevant scales during training. 2)
An adversarial regularization guides the autoencoder learn robust
representations by matching the posterior distribution of the latent embeddings
to given prior distribution. This is the first attempt to introduce attention
mechanisms to multi-scale network embedding. Experimental results on real-world
networks show that our learned attention parameters are different for every
network and the proposed approach outperforms existing state-of-the-art
approaches for network embedding.
|
cs.LG stat.ML
|
network embedding represents nodes in a continuous vector space and preserves structure information from the network existing methods usually adopt a onesizefitsall approach when concerning multiscale structure information such as first and secondorder proximity of nodes ignoring the fact that different scales play different roles in the embedding learning in this paper we propose an attentionbased adversarial autoencoder network embeddingaaane framework which promotes the collaboration of different scales and lets them vote for robust representations the proposed aaane consists of two components 1 attentionbased autoencoder effectively capture the highly nonlinear network structure which can deemphasize irrelevant scales during training 2 an adversarial regularization guides the autoencoder learn robust representations by matching the posterior distribution of the latent embeddings to given prior distribution this is the first attempt to introduce attention mechanisms to multiscale network embedding experimental results on realworld networks show that our learned attention parameters are different for every network and the proposed approach outperforms existing stateoftheart approaches for network embedding
|
[['network', 'embedding', 'represents', 'nodes', 'in', 'a', 'continuous', 'vector', 'space', 'and', 'preserves', 'structure', 'information', 'from', 'the', 'network', 'existing', 'methods', 'usually', 'adopt', 'a', 'onesizefitsall', 'approach', 'when', 'concerning', 'multiscale', 'structure', 'information', 'such', 'as', 'first', 'and', 'secondorder', 'proximity', 'of', 'nodes', 'ignoring', 'the', 'fact', 'that', 'different', 'scales', 'play', 'different', 'roles', 'in', 'the', 'embedding', 'learning', 'in', 'this', 'paper', 'we', 'propose', 'an', 'attentionbased', 'adversarial', 'autoencoder', 'network', 'embeddingaaane', 'framework', 'which', 'promotes', 'the', 'collaboration', 'of', 'different', 'scales', 'and', 'lets', 'them', 'vote', 'for', 'robust', 'representations', 'the', 'proposed', 'aaane', 'consists', 'of', 'two', 'components', '1', 'attentionbased', 'autoencoder', 'effectively', 'capture', 'the', 'highly', 'nonlinear', 'network', 'structure', 'which', 'can', 'deemphasize', 'irrelevant', 'scales', 'during', 'training', '2', 'an', 'adversarial', 'regularization', 'guides', 'the', 'autoencoder', 'learn', 'robust', 'representations', 'by', 'matching', 'the', 'posterior', 'distribution', 'of', 'the', 'latent', 'embeddings', 'to', 'given', 'prior', 'distribution', 'this', 'is', 'the', 'first', 'attempt', 'to', 'introduce', 'attention', 'mechanisms', 'to', 'multiscale', 'network', 'embedding', 'experimental', 'results', 'on', 'realworld', 'networks', 'show', 'that', 'our', 'learned', 'attention', 'parameters', 'are', 'different', 'for', 'every', 'network', 'and', 'the', 'proposed', 'approach', 'outperforms', 'existing', 'stateoftheart', 'approaches', 'for', 'network', 'embedding']]
|
[-0.06098056208284106, 0.008289480842540798, -0.0743377170729218, 0.0926624029620143, -0.1406350665805803, -0.16678310119459638, -0.00437887282387237, 0.4567420631530695, -0.3253880629723426, -0.30349357743980365, 0.006543699670146452, -0.2702613973000553, -0.255325059092138, 0.0953564815048594, -0.09609237350232433, 0.074127505531942, 0.11382569347842945, 0.04631950106122531, -0.0678790258418303, -0.2642975509290409, 0.3946387678428437, 0.03864316288891132, 0.39072603023960256, -0.023856068032910117, 0.16360140308970586, -0.008362633333308622, -0.03477958273360855, -0.025818108735438727, -0.04778181980118461, 0.20335990311359636, 0.3081269550486468, 0.19177498640492557, 0.3499469748770935, -0.43452349896742815, -0.29891441053478046, 0.08877588658579043, 0.13593802284158302, 0.11086376457606092, 0.013062015147534111, -0.35231894602184183, 0.08753950506361434, -0.18599803654942662, 0.06363178488827544, -0.16131674906937404, -0.04124432254466228, -0.03925132055592258, -0.3250880651550688, 0.0149349766315936, 0.1205050687865878, -0.02134608122287318, -0.06318047173408559, -0.10542516749410424, -0.009053460894210729, 0.1796628611651613, 0.024403006622742397, 0.06620186265790835, 0.12455895902203337, -0.1507211076284875, -0.14073186602327042, 0.31801805610302836, -0.03574692799084005, -0.21323481736326358, 0.1570418170584162, 0.01006070670846384, -0.17513437148008962, 0.07667691545502749, 0.24651722848648205, 0.10489155636460054, -0.15138848734213753, 0.004875998497300316, -0.05163541275906027, 0.17823677350970685, 0.02360199961985927, 0.022575452014280017, 0.1399759166422882, 0.269169353878533, 0.057922079863374165, 0.13273545634147013, -0.1286018979155415, -0.09883032263169297, -0.22587201048154384, -0.06581189845164773, -0.1992951483873185, -0.04456541878007556, -0.16532334951480152, -0.13433903812083373, 0.44719260225247126, 0.23616427048982586, 0.26066653804737144, 0.11246324701496632, 0.3305989089421928, -0.006139934546081349, 0.10761084032856161, 0.13913655362121063, 0.17287390923156637, 0.018308741692453622, 0.09621376244904241, -0.14067389961128357, 0.13054404238791903, 0.08101573578169337]
|
1,803.09081
|
Ion implantation in nanodiamonds: size effect and energy dependence
|
Nanoparticles are ubiquitous in nature and are increasingly important for
technology. They are subject to bombardment by ionizing radiation in a diverse
range of environments. In particular, nanodiamonds represent a variety of
nanoparticles of significant fundamental and applied interest. Here we present
a combined experimental and computational study of the behaviour of
nanodiamonds under irradiation by xenon ions. Unexpectedly, we observed a
pronounced size effect on the radiation resistance of the nanodiamonds:
particles larger than 8 nm behave similarly to macroscopic diamond (i.e.
characterized by high radiation resistance) whereas smaller particles can be
completely destroyed by a single impact from an ion in a defined energy range.
This latter observation is explained by extreme heating of the nanodiamonds by
the penetrating ion. The obtained results are not limited to nanodiamonds,
making them of interest for several fields, putting constraints on processes
for the controlled modification of nanodiamonds, on the survival of dust in
astrophysical environments, and on the behaviour of actinides released from
nuclear waste into the environment.
|
cond-mat.mtrl-sci astro-ph.GA cond-mat.mes-hall
|
nanoparticles are ubiquitous in nature and are increasingly important for technology they are subject to bombardment by ionizing radiation in a diverse range of environments in particular nanodiamonds represent a variety of nanoparticles of significant fundamental and applied interest here we present a combined experimental and computational study of the behaviour of nanodiamonds under irradiation by xenon ions unexpectedly we observed a pronounced size effect on the radiation resistance of the nanodiamonds particles larger than 8 nm behave similarly to macroscopic diamond ie characterized by high radiation resistance whereas smaller particles can be completely destroyed by a single impact from an ion in a defined energy range this latter observation is explained by extreme heating of the nanodiamonds by the penetrating ion the obtained results are not limited to nanodiamonds making them of interest for several fields putting constraints on processes for the controlled modification of nanodiamonds on the survival of dust in astrophysical environments and on the behaviour of actinides released from nuclear waste into the environment
|
[['nanoparticles', 'are', 'ubiquitous', 'in', 'nature', 'and', 'are', 'increasingly', 'important', 'for', 'technology', 'they', 'are', 'subject', 'to', 'bombardment', 'by', 'ionizing', 'radiation', 'in', 'a', 'diverse', 'range', 'of', 'environments', 'in', 'particular', 'nanodiamonds', 'represent', 'a', 'variety', 'of', 'nanoparticles', 'of', 'significant', 'fundamental', 'and', 'applied', 'interest', 'here', 'we', 'present', 'a', 'combined', 'experimental', 'and', 'computational', 'study', 'of', 'the', 'behaviour', 'of', 'nanodiamonds', 'under', 'irradiation', 'by', 'xenon', 'ions', 'unexpectedly', 'we', 'observed', 'a', 'pronounced', 'size', 'effect', 'on', 'the', 'radiation', 'resistance', 'of', 'the', 'nanodiamonds', 'particles', 'larger', 'than', '8', 'nm', 'behave', 'similarly', 'to', 'macroscopic', 'diamond', 'ie', 'characterized', 'by', 'high', 'radiation', 'resistance', 'whereas', 'smaller', 'particles', 'can', 'be', 'completely', 'destroyed', 'by', 'a', 'single', 'impact', 'from', 'an', 'ion', 'in', 'a', 'defined', 'energy', 'range', 'this', 'latter', 'observation', 'is', 'explained', 'by', 'extreme', 'heating', 'of', 'the', 'nanodiamonds', 'by', 'the', 'penetrating', 'ion', 'the', 'obtained', 'results', 'are', 'not', 'limited', 'to', 'nanodiamonds', 'making', 'them', 'of', 'interest', 'for', 'several', 'fields', 'putting', 'constraints', 'on', 'processes', 'for', 'the', 'controlled', 'modification', 'of', 'nanodiamonds', 'on', 'the', 'survival', 'of', 'dust', 'in', 'astrophysical', 'environments', 'and', 'on', 'the', 'behaviour', 'of', 'actinides', 'released', 'from', 'nuclear', 'waste', 'into', 'the', 'environment']]
|
[-0.04131024983334577, 0.23470814348071317, -0.02717958118245449, 0.04714043887395833, 0.027516476017245578, -0.10052456408794526, 0.027260221830580293, 0.41157739806831595, -0.21574824061688214, -0.35060612432148663, 0.07286583825632642, -0.30511626939377967, -0.0347304545520317, 0.228229452118588, -0.04953626955934202, 0.0112550185655155, 0.04956495039541984, -0.02918953094021639, 0.017276700768325964, -0.1976570913435093, 0.2773509761671968, 0.09859153309315886, 0.26956963523878674, 0.07785944370629122, 0.0804347049256432, -0.013483484795350316, 0.011991942467700158, 0.05676857520787356, -0.10069642073635589, 0.10362947394051367, 0.2403169119151287, 0.05955365802358193, 0.24797005815586695, -0.5002372849932206, -0.26115401930084253, 0.09426980218060114, 0.15479352448424574, 0.11499703294109731, -0.14505196325314632, -0.26832927061782574, 0.05196425691039102, -0.12627382749425514, -0.11443625531059556, -0.016699157964294067, 0.039333195971613305, 0.023146405792517942, -0.24423932819072866, 0.05409220666236555, 0.0378600559509193, 0.08393181740428277, -0.09445641309139319, -0.11311761329748801, -0.0014972940767793695, 0.0749910468113653, 0.033620325756298065, -0.029951103299113345, 0.2802446924373119, -0.1499486118825319, -0.0637454308480734, 0.40926597091657596, -0.037338940162434095, -0.1003705333204423, 0.22461801668673398, -0.18710271986561738, -0.09903749559695522, 0.20370205363170021, 0.19322056763623896, 0.1559465309422064, -0.17884400285713906, 0.027899101089652895, 0.027470027520653924, 0.1458867003005556, 0.08976580875016571, 0.07989383960652742, 0.2351434576197616, 0.20255892602809972, 0.0028803504537791014, 0.16497499350623998, -0.07544771094485657, -0.04942664742702618, -0.22590059654543265, -0.13358839250403912, -0.18693543808296367, 0.08607485402561517, -0.07793828925648649, -0.128985101858797, 0.3229397128896034, 0.13630098942390068, 0.1783159358449103, -0.047324233822846076, 0.2519176146126397, 0.04425609621622633, 0.10264686537751307, -0.0047634436105865804, 0.26093215252538876, 0.12908684834422143, 0.1106089386015637, -0.233232970331474, 0.1162245820520357, -0.06004159737494774]
|
1,803.09082
|
A Proximal Block Coordinate Descent Algorithm for Deep Neural Network
Training
|
Training deep neural networks (DNNs) efficiently is a challenge due to the
associated highly nonconvex optimization. The backpropagation (backprop)
algorithm has long been the most widely used algorithm for gradient computation
of parameters of DNNs and is used along with gradient descent-type algorithms
for this optimization task. Recent work have shown the efficiency of block
coordinate descent (BCD) type methods empirically for training DNNs. In view of
this, we propose a novel algorithm based on the BCD method for training DNNs
and provide its global convergence results built upon the powerful framework of
the Kurdyka-Lojasiewicz (KL) property. Numerical experiments on standard
datasets demonstrate its competitive efficiency against standard optimizers
with backprop.
|
stat.ML cs.LG math.OC
|
training deep neural networks dnns efficiently is a challenge due to the associated highly nonconvex optimization the backpropagation backprop algorithm has long been the most widely used algorithm for gradient computation of parameters of dnns and is used along with gradient descenttype algorithms for this optimization task recent work have shown the efficiency of block coordinate descent bcd type methods empirically for training dnns in view of this we propose a novel algorithm based on the bcd method for training dnns and provide its global convergence results built upon the powerful framework of the kurdykalojasiewicz kl property numerical experiments on standard datasets demonstrate its competitive efficiency against standard optimizers with backprop
|
[['training', 'deep', 'neural', 'networks', 'dnns', 'efficiently', 'is', 'a', 'challenge', 'due', 'to', 'the', 'associated', 'highly', 'nonconvex', 'optimization', 'the', 'backpropagation', 'backprop', 'algorithm', 'has', 'long', 'been', 'the', 'most', 'widely', 'used', 'algorithm', 'for', 'gradient', 'computation', 'of', 'parameters', 'of', 'dnns', 'and', 'is', 'used', 'along', 'with', 'gradient', 'descenttype', 'algorithms', 'for', 'this', 'optimization', 'task', 'recent', 'work', 'have', 'shown', 'the', 'efficiency', 'of', 'block', 'coordinate', 'descent', 'bcd', 'type', 'methods', 'empirically', 'for', 'training', 'dnns', 'in', 'view', 'of', 'this', 'we', 'propose', 'a', 'novel', 'algorithm', 'based', 'on', 'the', 'bcd', 'method', 'for', 'training', 'dnns', 'and', 'provide', 'its', 'global', 'convergence', 'results', 'built', 'upon', 'the', 'powerful', 'framework', 'of', 'the', 'kurdykalojasiewicz', 'kl', 'property', 'numerical', 'experiments', 'on', 'standard', 'datasets', 'demonstrate', 'its', 'competitive', 'efficiency', 'against', 'standard', 'optimizers', 'with', 'backprop']]
|
[-0.03640052119819531, -0.11248456097317037, -0.10032162241855855, 0.07853424921631813, -0.07907421256600132, -0.1998246759826502, 0.03310354604377403, 0.48575590846237837, -0.29225403005949446, -0.3020826604653586, 0.11201312280415247, -0.18092542265013262, -0.2411684347778089, 0.24129757911033994, -0.11995949669555458, 0.18023219292140188, 0.16017327372085405, -0.019319019722699834, -0.09208470040529564, -0.3473608659555179, 0.23318516361518754, 0.09605160971179495, 0.3625913240426631, -0.013007748397990121, 0.15198998820238016, -0.07500285248121095, 0.0024024610940434105, -0.01566464339827632, -0.03661231431787045, 0.19081138567118025, 0.24268291607029266, 0.24164396294325524, 0.3875424272573746, -0.4295793820071865, -0.2039608657360077, 0.1484723041454951, 0.18272721039148065, 0.10252729710938749, -0.08575453848561256, -0.28831829676018644, 0.12402895784534111, -0.12434748158295143, 0.0009757281524372531, -0.1910198255618279, -0.05060576442796905, 0.045518606825656185, -0.2996453494756474, 0.03457813017670199, 0.06362085537103987, 0.04058058468440363, -0.009889216520949392, -0.1637537636257171, 0.06447525987368044, 0.043516082399700944, 0.07390256168589264, 0.09488680737663631, 0.1478242167221332, -0.1232903008265337, -0.17468451499741794, 0.3093430425401206, -0.06513216382161051, -0.20468835937916427, 0.20252170722705085, 0.06766896532965941, -0.1754252273287322, 0.10957277870342673, 0.24432912600428067, 0.2012089534058563, -0.16518512048112513, 0.08252254118282885, -0.0036241525683451343, 0.11937048885686037, -0.014415032584807492, -0.04151379287679185, 0.10900442744815, 0.2725514991896915, 0.11526129406725837, 0.15068504618908707, -0.12342396171381781, -0.1190953592409019, -0.1720809256741861, -0.10066134320689482, -0.21253661874069218, -0.02858169503124045, -0.13788423011774775, -0.1507482648759489, 0.40530661480115343, 0.1898910604618691, 0.1947891649093714, 0.15868658009027173, 0.3676700039288482, 0.05428588762040342, 0.15740892549490068, 0.14991740401580442, 0.2425108071320128, 0.10938056192553795, 0.14370379765593522, -0.22324267099401704, 0.12235395258045043, 0.12894646975690047]
|
1,803.09083
|
Spin polarisation of ultrashort spin current pulses injected in
semiconductors
|
Ultrashort spin current pulses have a great potential of becoming the
carriers of information in future ultrafast spintronics. They present the
outstanding property of an extremely compressed time profile, which can allow
for the building up of spintronics operating at the unprecedented THz
frequencies. The ultrashort spin pulses, however still lack other desirable
features. For instance the spatial profile resembles more that of a spill
rather than that of a spatially compressed pulse. Moreover the ultrashort spin
current pulses can travel only across small distances in metals. The injection
of the ultrashort spin pulses from the metallic ferromagnet, where they have to
be generated, into a semiconductor is proposed as the first step to overcome
both issues by allowing the exited electrons to propagate in a medium with few
scatterings. However designing efficient interfaces for the injection is
challenging due to practical constraints like chemical and structural
stability. This work therefore expands the study of injection to a broader
range of interfaces, and analyses how different metallic layers and
semiconductors influence the amplitude, the spin polarisation and duration of
the ultrashort pulses. This provides guidelines for the selection of efficient
interfaces and, equally importantly, experimentally testable trends.
|
cond-mat.mtrl-sci
|
ultrashort spin current pulses have a great potential of becoming the carriers of information in future ultrafast spintronics they present the outstanding property of an extremely compressed time profile which can allow for the building up of spintronics operating at the unprecedented thz frequencies the ultrashort spin pulses however still lack other desirable features for instance the spatial profile resembles more that of a spill rather than that of a spatially compressed pulse moreover the ultrashort spin current pulses can travel only across small distances in metals the injection of the ultrashort spin pulses from the metallic ferromagnet where they have to be generated into a semiconductor is proposed as the first step to overcome both issues by allowing the exited electrons to propagate in a medium with few scatterings however designing efficient interfaces for the injection is challenging due to practical constraints like chemical and structural stability this work therefore expands the study of injection to a broader range of interfaces and analyses how different metallic layers and semiconductors influence the amplitude the spin polarisation and duration of the ultrashort pulses this provides guidelines for the selection of efficient interfaces and equally importantly experimentally testable trends
|
[['ultrashort', 'spin', 'current', 'pulses', 'have', 'a', 'great', 'potential', 'of', 'becoming', 'the', 'carriers', 'of', 'information', 'in', 'future', 'ultrafast', 'spintronics', 'they', 'present', 'the', 'outstanding', 'property', 'of', 'an', 'extremely', 'compressed', 'time', 'profile', 'which', 'can', 'allow', 'for', 'the', 'building', 'up', 'of', 'spintronics', 'operating', 'at', 'the', 'unprecedented', 'thz', 'frequencies', 'the', 'ultrashort', 'spin', 'pulses', 'however', 'still', 'lack', 'other', 'desirable', 'features', 'for', 'instance', 'the', 'spatial', 'profile', 'resembles', 'more', 'that', 'of', 'a', 'spill', 'rather', 'than', 'that', 'of', 'a', 'spatially', 'compressed', 'pulse', 'moreover', 'the', 'ultrashort', 'spin', 'current', 'pulses', 'can', 'travel', 'only', 'across', 'small', 'distances', 'in', 'metals', 'the', 'injection', 'of', 'the', 'ultrashort', 'spin', 'pulses', 'from', 'the', 'metallic', 'ferromagnet', 'where', 'they', 'have', 'to', 'be', 'generated', 'into', 'a', 'semiconductor', 'is', 'proposed', 'as', 'the', 'first', 'step', 'to', 'overcome', 'both', 'issues', 'by', 'allowing', 'the', 'exited', 'electrons', 'to', 'propagate', 'in', 'a', 'medium', 'with', 'few', 'scatterings', 'however', 'designing', 'efficient', 'interfaces', 'for', 'the', 'injection', 'is', 'challenging', 'due', 'to', 'practical', 'constraints', 'like', 'chemical', 'and', 'structural', 'stability', 'this', 'work', 'therefore', 'expands', 'the', 'study', 'of', 'injection', 'to', 'a', 'broader', 'range', 'of', 'interfaces', 'and', 'analyses', 'how', 'different', 'metallic', 'layers', 'and', 'semiconductors', 'influence', 'the', 'amplitude', 'the', 'spin', 'polarisation', 'and', 'duration', 'of', 'the', 'ultrashort', 'pulses', 'this', 'provides', 'guidelines', 'for', 'the', 'selection', 'of', 'efficient', 'interfaces', 'and', 'equally', 'importantly', 'experimentally', 'testable', 'trends']]
|
[-0.13463545558595355, 0.19511400264172832, -0.07093390092716982, 0.05402178598832585, -0.06963657522999545, -0.1622678768409766, 0.04208918362217695, 0.4622784832558656, -0.2894984545347341, -0.3090437374805776, 0.08221642696416848, -0.2639480758219636, -0.05987833655938071, 0.24832988198052355, 0.024114121233826967, 0.03607759624136066, 0.029615308629670347, -0.07756706983262324, -0.05671142173226601, -0.17158465447887628, 0.22078962131464844, 0.076629525261339, 0.30727978904972675, 0.08223690572052929, 0.08283498817416579, 0.005608486664022891, 0.048223884379122464, -0.04940603272800291, -0.0662219391772754, 0.1262152516250593, 0.30216435112678425, 0.019969467120363286, 0.27128640955153305, -0.5055829552770474, -0.2821106730456828, 0.03846713531819092, 0.17274432177040822, 0.15787522254811912, -0.11878207216175511, -0.2613987342293757, 0.06436234885716792, -0.1364891931042607, -0.12348879485149977, -0.05211888217405052, 0.05482184959027141, 0.045766765689051844, -0.23312756490449274, 0.043332673411882544, 0.07403419825820451, 0.01072243996792435, -0.04013204429686296, -0.06349131102120589, -0.026882845031447368, 0.09791999205303979, 0.04822838209276348, 0.03465732649207437, 0.15615077402092856, -0.17266192813616643, -0.09071323958752667, 0.3914797468498576, -0.04658074392430392, -0.10300962832345045, 0.18228860539124173, -0.15918055254975474, -0.03869683033819807, 0.14723757307428093, 0.17362377472927434, 0.1369402398825694, -0.16462601701017507, 0.002994276593536195, 0.04244156148128665, 0.19935267061931153, 0.08833431793367348, 0.12638754321990278, 0.2780715878958327, 0.21875184876040607, 0.0683342461322959, 0.11132414322222352, -0.11198612323342846, -0.030453036870183376, -0.2100883744761045, -0.14022439827452304, -0.1831929242370773, 0.061256634511129206, -0.0593929855210729, -0.1409831228046997, 0.4711253483150967, 0.22729940498295018, 0.13943799306298157, -0.02405520872556283, 0.3189435981510699, 0.09910821977726227, 0.06475893945491111, 0.03285196509630642, 0.24312307209079034, 0.12487649148079534, 0.1284225602317507, -0.21179888469904548, 0.09504352121491004, -0.08739586089865356]
|
1,803.09084
|
Five-Particle Phase-Space Integrals in QCD
|
We present analytical expressions for the 31 five-particle phase-space master
integrals in massless QCD as an $\epsilon$-series with coefficients being
multiple zeta values of weight up to 12. In addition, we provide computer code
for the Monte-Carlo integration in higher dimensions, based on the RAMBO
algorithm, that has been used to numerically cross-check the obtained results
in 4, 6, and 8 dimensions.
|
hep-ph
|
we present analytical expressions for the 31 fiveparticle phasespace master integrals in massless qcd as an epsilonseries with coefficients being multiple zeta values of weight up to 12 in addition we provide computer code for the montecarlo integration in higher dimensions based on the rambo algorithm that has been used to numerically crosscheck the obtained results in 4 6 and 8 dimensions
|
[['we', 'present', 'analytical', 'expressions', 'for', 'the', '31', 'fiveparticle', 'phasespace', 'master', 'integrals', 'in', 'massless', 'qcd', 'as', 'an', 'epsilonseries', 'with', 'coefficients', 'being', 'multiple', 'zeta', 'values', 'of', 'weight', 'up', 'to', '12', 'in', 'addition', 'we', 'provide', 'computer', 'code', 'for', 'the', 'montecarlo', 'integration', 'in', 'higher', 'dimensions', 'based', 'on', 'the', 'rambo', 'algorithm', 'that', 'has', 'been', 'used', 'to', 'numerically', 'crosscheck', 'the', 'obtained', 'results', 'in', '4', '6', 'and', '8', 'dimensions']]
|
[-0.0936895433172095, 0.07332193648626792, -0.08642494592998849, 0.058058517114793665, -0.004023964089326194, -0.10539729435180055, 0.020091714692439457, 0.38181281334064043, -0.12053605523265776, -0.33126149852626546, 0.09680707025204281, -0.25729070341245075, -0.1403684961441599, 0.251533166593185, 0.04489244865711595, 0.12310626770614944, 0.03596837462506211, 0.03389039878078858, -0.09856595640589834, -0.3226487772753004, 0.2780916185087723, 0.03362670959141411, 0.18240302588721952, 0.05509388387264287, 0.10229358942721223, 0.029674236101602188, -0.05909232490745633, -0.03507906161096008, -0.17237314780790944, 0.10086958837069449, 0.24852301380368041, 0.058707117671757694, 0.1774727903062203, -0.4072431635539063, -0.16485713219239576, 0.01530055794864893, 0.21490157807826019, 0.13142428012778523, -0.02258435076629346, -0.2168342634485882, 0.11562961399494136, -0.2155680712159784, -0.1691543955019996, -0.12973780213992614, 0.019483667004425994, -0.04730778175299285, -0.28950671769953407, 0.07839744605246138, -0.07242672899585278, 0.08925599592630981, -0.06296121811524766, -0.2019328248122188, 0.027460109163839064, 0.14875674243924802, 0.009519697792950223, 0.046342261853154564, 0.03455641196246763, -0.12149046744662718, -0.19725955673111756, 0.340628166068498, -0.07422264635784277, -0.26486858047667095, 0.17172976004982704, -0.16354235452523486, -0.16768370719901363, 0.17029739855254283, 0.14189498495218938, 0.12212816076963896, -0.1713272617122189, 0.09073566198711604, 0.007069758345663059, 0.15316459173374794, 0.119603631727886, -0.008832354762698294, 0.11930349970724984, 0.08507907526475973, -0.03517283611457612, 0.1477163232076669, -0.10129666835695628, -0.1245382161597248, -0.2999742097406434, -0.17274818428578315, -0.15904142699952498, 0.054716731268973626, -0.14910442210313077, -0.123410806731611, 0.3530886808379752, 0.1866876255171221, 0.16002935354338318, 0.09247297340179564, 0.2667184643080977, 0.17195949492571477, 0.08265064006335422, 0.09219508202838116, 0.20253571377280855, 0.1282053845781894, 0.11112766298389093, -0.16718028857540645, -0.07650750271783241, 0.11409939793472895]
|
1,803.09085
|
Spectrum Sensing with Multiple Primary Users over Fading Channels
|
We investigate the impact of multiple primary users (PUs) and fading on the
spectrum sensing of a classical energy detector (ED). Specifically, we present
novel closed-form expressions for the false-alarm and detection probabilities
in a multiple PUs environment, assuming Nakagami-m fading and complex Gaussian
PUs transmitted signals. The results reveal the importance of taking into
consideration the wireless environment, when evaluating the ED spectrum sensing
performance and selecting the ED threshold.
|
cs.IT math.IT
|
we investigate the impact of multiple primary users pus and fading on the spectrum sensing of a classical energy detector ed specifically we present novel closedform expressions for the falsealarm and detection probabilities in a multiple pus environment assuming nakagamim fading and complex gaussian pus transmitted signals the results reveal the importance of taking into consideration the wireless environment when evaluating the ed spectrum sensing performance and selecting the ed threshold
|
[['we', 'investigate', 'the', 'impact', 'of', 'multiple', 'primary', 'users', 'pus', 'and', 'fading', 'on', 'the', 'spectrum', 'sensing', 'of', 'a', 'classical', 'energy', 'detector', 'ed', 'specifically', 'we', 'present', 'novel', 'closedform', 'expressions', 'for', 'the', 'falsealarm', 'and', 'detection', 'probabilities', 'in', 'a', 'multiple', 'pus', 'environment', 'assuming', 'nakagamim', 'fading', 'and', 'complex', 'gaussian', 'pus', 'transmitted', 'signals', 'the', 'results', 'reveal', 'the', 'importance', 'of', 'taking', 'into', 'consideration', 'the', 'wireless', 'environment', 'when', 'evaluating', 'the', 'ed', 'spectrum', 'sensing', 'performance', 'and', 'selecting', 'the', 'ed', 'threshold']]
|
[-0.22725158218871538, 0.04472606005409444, -0.040052592662543476, 0.06717525521280165, -0.029433355935600022, -0.1991873859414752, 0.12631160188400725, 0.38521994272588006, -0.22351291149356206, -0.2679604231051996, 0.06271709933299834, -0.2733301201693445, -0.20656245873427728, 0.11435953388974385, -0.0816844804933898, 0.03698465500918912, 0.0752123585692279, 0.07979882805949261, -0.025455763535639664, -0.19028058567633246, 0.28126948402905966, 0.17257930461684584, 0.36087649537276634, 0.041425810510318885, 0.05477112908126183, 0.16780792996877622, -0.08952471166586792, -0.08296049443978659, -0.1066351297744353, 0.06806603178355686, 0.30646083126185647, 0.22585130005445278, 0.25937109104764294, -0.41846481254193146, -0.27912151692828663, 0.10698359030705522, 0.12155208892753007, 0.008240468757436939, -0.060256115431425124, -0.3641078204939693, 0.10249898568267973, -0.2520049161303946, 0.015605519761816717, 0.046232573425685854, -0.08280206859951288, 0.04324103155645581, -0.36739361939400855, 0.020082481756386623, 0.0018050244838838847, 0.016835210805522725, -0.14206248143536995, -0.12885178133687922, 0.07306257870153222, 0.22490726544359424, 0.05004349866435981, -0.15968448322423748, 0.15243066529231802, -0.13250188772159982, -0.061510051143172026, 0.35885845659904075, 0.017059986774717838, -0.18981613323722088, 0.15818297628208366, -0.14788522327345022, -0.0731580122308412, 0.1994409522199085, 0.27679491622871916, 0.07649360192467419, -0.21607933006299376, 0.04840084972371623, 0.04493039973657316, 0.1311787122624441, 0.07632045312719025, 0.11974327310814824, 0.19165356942242615, 0.13174467364286768, 0.0679075170937978, 0.1287873770785846, -0.1965758557411724, -0.09640038036413386, -0.21390855080582544, -0.10346241095955942, -0.2277736759114958, 0.029330178834563514, -0.10206224381658052, -0.07002251962540855, 0.4203184668604337, 0.11331016712241583, 0.12436915608450876, 0.1375293081206545, 0.39961449418899037, 0.13839946568510691, -0.07249248902064184, 0.1278537521729062, 0.1827573433885692, 0.11475200157015729, 0.08366749314328945, -0.24132507293760566, 0.06065807416116897, -0.07545024758650803]
|
1,803.09086
|
The inf-sup condition and error estimates of the Nitsche method for
evolutionary diffusion-advection-reaction equations
|
The Nitsche method is a method of "weak imposition" of the inhomogeneous
Dirichlet boundary conditions for partial differential equations. This paper
explains stability and convergence study of the Nitsche method applied to
evolutionary diffusion-advection-reaction equations. We mainly discuss a
general space semidiscrete scheme including not only the standard finite
element method but also Isogeometric Analysis. Our method of analysis is a
variational one that is a popular method for studying elliptic problems. The
variational method enables us to obtain the best approximation property
directly. Actually, results show that the scheme satisfies the inf-sup
condition and Galerkin orthogonality. Consequently, the optimal order error
estimates in some appropriate norms are proven under some regularity
assumptions on the exact solution. We also consider a fully discretized scheme
using the backward Euler method. Numerical example demonstrate the validity of
those theoretical results.
|
math.NA
|
the nitsche method is a method of weak imposition of the inhomogeneous dirichlet boundary conditions for partial differential equations this paper explains stability and convergence study of the nitsche method applied to evolutionary diffusionadvectionreaction equations we mainly discuss a general space semidiscrete scheme including not only the standard finite element method but also isogeometric analysis our method of analysis is a variational one that is a popular method for studying elliptic problems the variational method enables us to obtain the best approximation property directly actually results show that the scheme satisfies the infsup condition and galerkin orthogonality consequently the optimal order error estimates in some appropriate norms are proven under some regularity assumptions on the exact solution we also consider a fully discretized scheme using the backward euler method numerical example demonstrate the validity of those theoretical results
|
[['the', 'nitsche', 'method', 'is', 'a', 'method', 'of', 'weak', 'imposition', 'of', 'the', 'inhomogeneous', 'dirichlet', 'boundary', 'conditions', 'for', 'partial', 'differential', 'equations', 'this', 'paper', 'explains', 'stability', 'and', 'convergence', 'study', 'of', 'the', 'nitsche', 'method', 'applied', 'to', 'evolutionary', 'diffusionadvectionreaction', 'equations', 'we', 'mainly', 'discuss', 'a', 'general', 'space', 'semidiscrete', 'scheme', 'including', 'not', 'only', 'the', 'standard', 'finite', 'element', 'method', 'but', 'also', 'isogeometric', 'analysis', 'our', 'method', 'of', 'analysis', 'is', 'a', 'variational', 'one', 'that', 'is', 'a', 'popular', 'method', 'for', 'studying', 'elliptic', 'problems', 'the', 'variational', 'method', 'enables', 'us', 'to', 'obtain', 'the', 'best', 'approximation', 'property', 'directly', 'actually', 'results', 'show', 'that', 'the', 'scheme', 'satisfies', 'the', 'infsup', 'condition', 'and', 'galerkin', 'orthogonality', 'consequently', 'the', 'optimal', 'order', 'error', 'estimates', 'in', 'some', 'appropriate', 'norms', 'are', 'proven', 'under', 'some', 'regularity', 'assumptions', 'on', 'the', 'exact', 'solution', 'we', 'also', 'consider', 'a', 'fully', 'discretized', 'scheme', 'using', 'the', 'backward', 'euler', 'method', 'numerical', 'example', 'demonstrate', 'the', 'validity', 'of', 'those', 'theoretical', 'results']]
|
[-0.09874175685589485, -0.029749565420375355, -0.1577915309563927, 0.11214208102994261, -0.11228826481248319, -0.14616357434230545, 0.034159420271559306, 0.3547049133576102, -0.29993479993140354, -0.23348908252555176, 0.16563488722127606, -0.19676115234429692, -0.15480198857603947, 0.2139071368517867, -0.07584308481950691, 0.13744972461321647, 0.14275574875806551, -0.012081149040950813, -0.11679632189697113, -0.24875690408668522, 0.3447781988399346, -0.037278671843418175, 0.3247656201592822, 0.06392443022122134, 0.14177501876406165, -0.05291147414001002, -0.02972084668505451, 0.029242807992293663, -0.16887811538343658, 0.13373242673443872, 0.20649207504027509, 0.07022221501160791, 0.3411557300799135, -0.3870730749466389, -0.22305919602344595, 0.07131360480021956, 0.12247012134142005, 0.14030091030914607, -0.0568748837433067, -0.2812734746941082, 0.13077378274528714, -0.12658116346616569, -0.19569271457368048, -0.13404243947276712, -0.09877416534362819, 0.05196509703123213, -0.3669061909271134, 0.09908402251523407, 0.0825922875833846, 0.030831314102017685, -0.12401953123449146, -0.09036726189314968, 0.032752671245269586, 0.023201531123207962, 0.048774338938950466, -0.03294931981962282, 0.020722823291747034, -0.045157415956002325, -0.05186238319805378, 0.3736722869731054, -0.06335611871285093, -0.31359004509884975, 0.1462480004613652, -0.08786375205828875, -0.1406626821026557, 0.12133318977093027, 0.1446618336232622, 0.21631541672041235, -0.1563211496365999, 0.12778635805496352, -0.07286100322971174, 0.14172903264103376, 0.05370614604444068, -0.02662668573337715, 0.008905152068135963, 0.1518548336605528, 0.15108294118249763, 0.10116942702839826, -0.03060784290436709, -0.13702744522226462, -0.3621342660035884, -0.16664673527280893, -0.14464593536483691, -0.010984274356156095, -0.13286800803262336, -0.19691520038674976, 0.35923726640857756, 0.19264274512998003, 0.09282648026862222, 0.07267638918795231, 0.3152123126268819, 0.17208131980673963, -0.015576111235439885, 0.07615849023104469, 0.20683589287016177, 0.1942337328227291, 0.09924105375218947, -0.2548063906986077, 0.0706882453219884, 0.24031225157913455]
|
1,803.09087
|
On the use of running $\alpha_s$ in calculations of radiative energy
loss of fast partons in a quark-gluon plasma
|
The incorporation of running $\alpha_s$ for the gluon emission vertex in
calculations of radiative parton energy loss in a quark-gluon plasma is
discussed. It is argued that the virtuality scale for running $\alpha_s$ for
induced gluon emission is determined by the square of the transverse momentum
of the emitted gluon rather than by the square of the invariant mass of the
final two-parton state often used in the literature.
|
hep-ph nucl-th
|
the incorporation of running alpha_s for the gluon emission vertex in calculations of radiative parton energy loss in a quarkgluon plasma is discussed it is argued that the virtuality scale for running alpha_s for induced gluon emission is determined by the square of the transverse momentum of the emitted gluon rather than by the square of the invariant mass of the final twoparton state often used in the literature
|
[['the', 'incorporation', 'of', 'running', 'alpha_s', 'for', 'the', 'gluon', 'emission', 'vertex', 'in', 'calculations', 'of', 'radiative', 'parton', 'energy', 'loss', 'in', 'a', 'quarkgluon', 'plasma', 'is', 'discussed', 'it', 'is', 'argued', 'that', 'the', 'virtuality', 'scale', 'for', 'running', 'alpha_s', 'for', 'induced', 'gluon', 'emission', 'is', 'determined', 'by', 'the', 'square', 'of', 'the', 'transverse', 'momentum', 'of', 'the', 'emitted', 'gluon', 'rather', 'than', 'by', 'the', 'square', 'of', 'the', 'invariant', 'mass', 'of', 'the', 'final', 'twoparton', 'state', 'often', 'used', 'in', 'the', 'literature']]
|
[-0.06574026722312513, 0.27619688709576923, -0.11137590208428277, 0.14773252396802147, -0.03335692145038342, -0.009939811405037408, -0.0450288190546891, 0.39445522378968156, -0.1706807099930618, -0.24618812480711957, -0.014604351549085392, -0.26337728821470036, 0.06942532046873501, 0.12665587823932478, 0.08511966646419487, 0.09795304316271475, 0.07652242594412055, -0.0034654981969599276, -0.047993993425220455, -0.2084213064281621, 0.4031413591372362, 0.0926138540810865, 0.2204881311542746, 0.2056453234070669, 0.12143412726404874, 0.045753962586404406, -0.075987391659747, -0.03891062084585428, -0.10664368298466138, 0.03651490231193062, 0.2008291767721159, 0.04490803031966198, 0.17007206696207108, -0.33465257251932135, -0.1551915740702247, 0.030226655078349984, 0.1451456827260014, 0.0742491206029376, 0.01502503499901597, -0.2186426774504176, 0.026534489005048206, -0.24324069864562023, -0.1500386831931014, -0.025388503318949453, 0.0009423015855144763, -0.039059561326343945, -0.33389549564732157, 0.10567080836230214, -0.008377466283306696, -0.02407241094129015, 0.04910959350620059, -0.20073601669645397, -0.12912659444238828, 0.030371691403991503, 0.14532047556375788, 0.14196566971477823, 0.18453139296152454, -0.25462551004307316, -0.14025413765963438, 0.4171274990059327, -0.04339225522509904, -0.15179765191514624, 0.04944421334084177, -0.19658415351548922, -0.09870138111105864, 0.20175636991642523, 0.1601722453167473, 0.10378236956287014, -0.17811376446237168, 0.11487305086052073, 0.0006288740230535252, 0.1671500638451265, 0.11096696096701898, 0.11262533322071144, 0.1751530299206143, 0.16768619792022998, -0.019405143915851047, 0.11665666017654365, -0.07056860544759294, -0.11558803474274126, -0.36540486689225055, -0.06860166608585395, -0.23163710346283473, 0.08911744802110437, -0.1264969586610686, -0.15244048603041016, 0.4166001062030378, 0.1038257437893122, 0.19760110055474375, 0.0021091795971860056, 0.33505522340968036, 0.164757471228781, 0.10529850085900314, 0.1196011955363919, 0.31405643970314145, 0.17611590614272415, 0.15543606418414393, -0.3045997792058557, 0.05714229691395725, 0.10758542906884375]
|
1,803.09088
|
Three theorems of quantum mechanics and their classical counterparts
|
The Hellmann-Feynman, virial and comparison theorems are three fundamental
theorems of quantum mechanics. For the first two, counterparts exist for
classical mechanics with relativistic or nonrelativistic kinetic energy. It is
shown here that these three theorems are valid for classical mechanics with a
nonstandard kinetic energy. This brings some information about the connections
between the quantum and classical worlds. Constraints about the functional form
of the kinetic energy are also discussed.
|
quant-ph
|
the hellmannfeynman virial and comparison theorems are three fundamental theorems of quantum mechanics for the first two counterparts exist for classical mechanics with relativistic or nonrelativistic kinetic energy it is shown here that these three theorems are valid for classical mechanics with a nonstandard kinetic energy this brings some information about the connections between the quantum and classical worlds constraints about the functional form of the kinetic energy are also discussed
|
[['the', 'hellmannfeynman', 'virial', 'and', 'comparison', 'theorems', 'are', 'three', 'fundamental', 'theorems', 'of', 'quantum', 'mechanics', 'for', 'the', 'first', 'two', 'counterparts', 'exist', 'for', 'classical', 'mechanics', 'with', 'relativistic', 'or', 'nonrelativistic', 'kinetic', 'energy', 'it', 'is', 'shown', 'here', 'that', 'these', 'three', 'theorems', 'are', 'valid', 'for', 'classical', 'mechanics', 'with', 'a', 'nonstandard', 'kinetic', 'energy', 'this', 'brings', 'some', 'information', 'about', 'the', 'connections', 'between', 'the', 'quantum', 'and', 'classical', 'worlds', 'constraints', 'about', 'the', 'functional', 'form', 'of', 'the', 'kinetic', 'energy', 'are', 'also', 'discussed']]
|
[-0.08884106261465488, 0.1499368865042925, -0.12514402087725385, 0.18510543025085624, -0.05243513969258523, -0.1400552281362175, -0.003225575955453473, 0.2910248261784584, -0.26271376357426945, -0.31409017731186367, 0.07115438227495835, -0.3021283671128708, -0.09939610971544514, 0.23608114150300308, 0.013041241219083607, 0.06917589359824926, 0.04222135459282764, 0.08011512176304215, -0.11363617853182827, -0.19265629993882818, 0.3261633500666686, 0.02033773246614761, 0.22533615151564526, 0.08234315366854376, 0.10381467500045685, -0.0055593496613191365, -0.0349079182004215, 0.01747454627430145, -0.17350604384205007, 0.1643933153147219, 0.24570337171390863, 0.07530022116745232, 0.2787141641470748, -0.4619484863598162, -0.2436184850062283, 0.07879848240441839, 0.034102966664621315, 0.11700470784915165, -0.02744529428432735, -0.23760103712409314, 0.04144972539342887, -0.14472376616199462, -0.13683775340741447, -0.09441347576310517, -0.017574979149749582, 0.057427900102199385, -0.15428531694580133, 0.162921995062686, 0.12214918043726766, 0.013254163996644423, -0.05728247732212636, -0.14554621178237065, 0.013174616075842313, 0.09457273379584748, 0.04488815349841516, -0.060447369762827496, 0.11092171449424096, -0.12746074509439648, -0.15082461630899302, 0.4179510804234256, 0.04302301005014336, -0.21500811290363192, 0.22465276363974726, -0.0940895717177855, -0.19096476060640014, 0.0813102763618382, 0.03387150724588985, 0.045455177931088796, -0.2045897853521394, 0.11798989500450364, -0.00696969824567647, 0.10832148312892713, 0.09805126745962131, 0.1122246536058964, 0.22370047934195944, 0.07651235451790649, 0.0038806331068487235, 0.05522907084562409, -0.045066359728364876, -0.26985591269609793, -0.3854135060027032, -0.21314545197438606, -0.15803557210667452, 0.10181662058588904, -0.10907052901309496, -0.11173800374569805, 0.3018414883146351, 0.1295071178858667, 0.07530528319422418, 0.0801222739137814, 0.28077912448354486, 0.1643848975359554, -0.01567006308559171, 0.08656304335536462, 0.3453841076882615, 0.2494494028809205, 0.1117596829336294, -0.15215615297152832, -0.06684945852325207, 0.08214106037884845]
|
1,803.09089
|
An analytic effective model for hairy black holes
|
Hairy black holes (BHs) have macroscopic degrees of freedom which are not
associated with a Gauss law. As such, these degrees of freedom are not manifest
as quasi-local quantities computed at the horizon. This suggests conceiving
hairy BHs as an interacting system with two components: a "bald" horizon
coupled to a "hairy" environment. Based on this idea we suggest an effective
model for hairy BHs -- typically described by numerical solutions -- that
allows computing analytically thermodynamic and other quantities of the hairy
BH in terms of a fiducial bald BH. The effective model is universal in the
sense that it is only sensitive to the fiducial BH, but not to the details of
the hairy BH. Consequently, it is only valid in the vicinity of the fiducial BH
limit. We discuss, quantitatively, the accuracy of the effective model for
asymptotically flat BHs with synchronised hair, both in $D=4$ (including
self-interactions) and $D=5$ spacetime dimensions. We also discuss the
applicability of the model to synchronised BHs in $D=5$ asymptotically $AdS$
and static $D=4$ coloured BHs, exhibiting its limitations.
|
gr-qc hep-th
|
hairy black holes bhs have macroscopic degrees of freedom which are not associated with a gauss law as such these degrees of freedom are not manifest as quasilocal quantities computed at the horizon this suggests conceiving hairy bhs as an interacting system with two components a bald horizon coupled to a hairy environment based on this idea we suggest an effective model for hairy bhs typically described by numerical solutions that allows computing analytically thermodynamic and other quantities of the hairy bh in terms of a fiducial bald bh the effective model is universal in the sense that it is only sensitive to the fiducial bh but not to the details of the hairy bh consequently it is only valid in the vicinity of the fiducial bh limit we discuss quantitatively the accuracy of the effective model for asymptotically flat bhs with synchronised hair both in d4 including selfinteractions and d5 spacetime dimensions we also discuss the applicability of the model to synchronised bhs in d5 asymptotically ads and static d4 coloured bhs exhibiting its limitations
|
[['hairy', 'black', 'holes', 'bhs', 'have', 'macroscopic', 'degrees', 'of', 'freedom', 'which', 'are', 'not', 'associated', 'with', 'a', 'gauss', 'law', 'as', 'such', 'these', 'degrees', 'of', 'freedom', 'are', 'not', 'manifest', 'as', 'quasilocal', 'quantities', 'computed', 'at', 'the', 'horizon', 'this', 'suggests', 'conceiving', 'hairy', 'bhs', 'as', 'an', 'interacting', 'system', 'with', 'two', 'components', 'a', 'bald', 'horizon', 'coupled', 'to', 'a', 'hairy', 'environment', 'based', 'on', 'this', 'idea', 'we', 'suggest', 'an', 'effective', 'model', 'for', 'hairy', 'bhs', 'typically', 'described', 'by', 'numerical', 'solutions', 'that', 'allows', 'computing', 'analytically', 'thermodynamic', 'and', 'other', 'quantities', 'of', 'the', 'hairy', 'bh', 'in', 'terms', 'of', 'a', 'fiducial', 'bald', 'bh', 'the', 'effective', 'model', 'is', 'universal', 'in', 'the', 'sense', 'that', 'it', 'is', 'only', 'sensitive', 'to', 'the', 'fiducial', 'bh', 'but', 'not', 'to', 'the', 'details', 'of', 'the', 'hairy', 'bh', 'consequently', 'it', 'is', 'only', 'valid', 'in', 'the', 'vicinity', 'of', 'the', 'fiducial', 'bh', 'limit', 'we', 'discuss', 'quantitatively', 'the', 'accuracy', 'of', 'the', 'effective', 'model', 'for', 'asymptotically', 'flat', 'bhs', 'with', 'synchronised', 'hair', 'both', 'in', 'd4', 'including', 'selfinteractions', 'and', 'd5', 'spacetime', 'dimensions', 'we', 'also', 'discuss', 'the', 'applicability', 'of', 'the', 'model', 'to', 'synchronised', 'bhs', 'in', 'd5', 'asymptotically', 'ads', 'and', 'static', 'd4', 'coloured', 'bhs', 'exhibiting', 'its', 'limitations']]
|
[-0.13993662646945185, 0.1399696914094503, -0.04032977307162417, 0.13847035214315506, -0.07757715063846925, -0.155013588890473, 0.014767872025417588, 0.3103776350352829, -0.11226406712508337, -0.29255665268481773, 0.10736413518779128, -0.31381745911171904, -0.10904674541300417, 0.16425061188320714, -0.06219243498741311, 0.023531796865427168, -0.005071586955719712, 0.08209820328656034, -0.07433750257372264, -0.23705181305426362, 0.33896006838503207, 0.05648037518469871, 0.20951487721520773, -0.010973437350581993, 0.135062873614102, -0.029764650356479582, 0.05734460880260237, 0.0861837606803006, -0.15995806084447395, 0.06746708809673278, 0.2394223385596309, 0.11162969494100915, 0.17807568854451264, -0.38519070616563444, -0.2213560861418955, 0.07822592476044189, 0.22955424764751858, 0.17574816116922937, -0.06710044609512393, -0.2540738556735133, 0.09930993843425479, -0.24189554500414737, -0.19491082620648245, -0.09000981262810952, 0.06635680661632003, -0.04275668080153268, -0.21784354868710085, 0.13870686158109244, 0.09035308613833463, -0.06984254522037438, -0.10407382677757679, -0.007806403111978646, -0.09549580637593119, 0.10054947123386558, 0.12123214784388768, -0.0019262147331821986, 0.2024466774865604, -0.1277312383621889, -0.11010177482504249, 0.33022197970951145, -0.02048585234627932, -0.22667680856962266, 0.20366314076950817, -0.20901439233388042, -0.12367645275398073, 0.09529875999313928, 0.14702798981902146, 0.23267541201051822, -0.1557223593884952, 0.12945680551940147, 0.026148582971390253, 0.20560532369232865, 0.06864355218236927, 0.08684864120071077, 0.3845749283302046, 0.10203818675257605, 0.019077361432664475, 0.1568489374112687, -0.0010644649939257017, -0.1436700243486319, -0.3372936872236261, -0.12694967547114092, -0.139269551764962, 0.0820522247888882, -0.19923804897462105, -0.19440616087608345, 0.3204576755471697, 0.13226651613447096, 0.19241393721577796, 0.05112313714595406, 0.2392814513253928, 0.07690176075993804, 0.055864039591555906, 0.1405227682870728, 0.34970473431431776, 0.1227491671783024, 0.10511328838964057, -0.22654708130655557, -0.058825621923791586, 0.09476677287602797]
|
1,803.0909
|
Physical Layer Security in the Presence of Interference
|
We evaluate and quantify the joint effect of fading and multiple interferers
on the physical-layer (PHY) security of a system consisted of a base-station
(BS), a legitimate user, and an eavesdropper. To this end, we present a novel
closed-form expression for the secrecy outage probability, which takes into
account the fading characteristics of the wireless environment, the location
and the number of interferers, as well as the transmission power of the BS and
the interference. The results reveal that the impact of interference should be
seriously taken into account in the design and deployment of a wireless system
with PHY security.
|
cs.IT math.IT
|
we evaluate and quantify the joint effect of fading and multiple interferers on the physicallayer phy security of a system consisted of a basestation bs a legitimate user and an eavesdropper to this end we present a novel closedform expression for the secrecy outage probability which takes into account the fading characteristics of the wireless environment the location and the number of interferers as well as the transmission power of the bs and the interference the results reveal that the impact of interference should be seriously taken into account in the design and deployment of a wireless system with phy security
|
[['we', 'evaluate', 'and', 'quantify', 'the', 'joint', 'effect', 'of', 'fading', 'and', 'multiple', 'interferers', 'on', 'the', 'physicallayer', 'phy', 'security', 'of', 'a', 'system', 'consisted', 'of', 'a', 'basestation', 'bs', 'a', 'legitimate', 'user', 'and', 'an', 'eavesdropper', 'to', 'this', 'end', 'we', 'present', 'a', 'novel', 'closedform', 'expression', 'for', 'the', 'secrecy', 'outage', 'probability', 'which', 'takes', 'into', 'account', 'the', 'fading', 'characteristics', 'of', 'the', 'wireless', 'environment', 'the', 'location', 'and', 'the', 'number', 'of', 'interferers', 'as', 'well', 'as', 'the', 'transmission', 'power', 'of', 'the', 'bs', 'and', 'the', 'interference', 'the', 'results', 'reveal', 'that', 'the', 'impact', 'of', 'interference', 'should', 'be', 'seriously', 'taken', 'into', 'account', 'in', 'the', 'design', 'and', 'deployment', 'of', 'a', 'wireless', 'system', 'with', 'phy', 'security']]
|
[-0.2989217334122646, -0.03010830506183885, -0.06505794290195008, 3.292646932203581e-05, -0.04116764735651783, -0.23276842584243357, 0.15831699773512486, 0.3198765629330779, -0.2066762380043764, -0.26971856232658764, 0.042614445610128636, -0.23387465642599187, -0.19844593258925003, 0.08918646131042797, -0.12203002224058503, 0.036174400313065784, 0.007621805607756176, 0.05289622147493802, 0.01792470269633623, -0.2498698827990251, 0.33565728720000915, 0.1479560866638428, 0.35197052541235, 0.08835372219028154, 0.07112382160555018, 0.06053691305736504, -0.04208910082568332, -0.0392964248646899, -0.073771102992846, 0.03442721347794822, 0.2885300326391612, 0.22067984073229208, 0.29395894175118736, -0.44212734160741957, -0.2826823835805206, 0.019091387076469343, 0.1654102592129666, 0.043349981800155105, -0.02807287925434769, -0.35911789589958026, 0.09885049463563257, -0.29717967733003126, -0.009817566741073485, 0.06808891712623362, -0.08383180169241115, 0.07713432418237819, -0.3786536493329423, -0.04677325556294458, 0.0005626974011872812, 0.027741090164031132, -0.07694905744127856, -0.11847407124835149, 0.01078456729456856, 0.25707103952876115, 0.05934166042410796, -0.08587098266874062, 0.11616984215371384, -0.11608808184678535, -0.05626194428947597, 0.4024768334140282, 0.034564759743648886, -0.20474106362919406, 0.09948609352093374, -0.13332633093681814, -0.07807696455776102, 0.17233422749887894, 0.30597948152940757, -0.0055935481784514865, -0.1992315535092413, -0.005164607062631535, 0.008364819893890088, 0.16480014059176246, 0.04969541906231627, 0.1689347693106473, 0.19121665212482508, 0.1802386282758769, 0.10222361345618668, 0.15222095379647385, -0.1924761014294322, -0.0852081471982661, -0.2676195702797936, -0.17105369215904928, -0.20613509360332005, 0.04388695403859757, -0.10824896555104625, -0.07428711665549896, 0.4015534847828466, 0.1589236127628742, 0.16050797741454426, 0.10748970734605584, 0.45842792032895113, 0.12141490691009503, 0.014371506505562822, 0.12529270983955795, 0.19638484327951308, 0.1031482538558764, 0.13872503329271285, -0.21602962314875077, 0.11121661356180021, -0.0630269232989833]
|
1,803.09091
|
Simple Large-scale Relation Extraction from Unstructured Text
|
Knowledge-based question answering relies on the availability of facts, the
majority of which cannot be found in structured sources (e.g. Wikipedia
info-boxes, Wikidata). One of the major components of extracting facts from
unstructured text is Relation Extraction (RE). In this paper we propose a novel
method for creating distant (weak) supervision labels for training a
large-scale RE system. We also provide new evidence about the effectiveness of
neural network approaches by decoupling the model architecture from the feature
design of a state-of-the-art neural network system. Surprisingly, a much
simpler classifier trained on similar features performs on par with the highly
complex neural network system (at 75x reduction to the training time),
suggesting that the features are a bigger contributor to the final performance.
|
cs.CL
|
knowledgebased question answering relies on the availability of facts the majority of which cannot be found in structured sources eg wikipedia infoboxes wikidata one of the major components of extracting facts from unstructured text is relation extraction re in this paper we propose a novel method for creating distant weak supervision labels for training a largescale re system we also provide new evidence about the effectiveness of neural network approaches by decoupling the model architecture from the feature design of a stateoftheart neural network system surprisingly a much simpler classifier trained on similar features performs on par with the highly complex neural network system at 75x reduction to the training time suggesting that the features are a bigger contributor to the final performance
|
[['knowledgebased', 'question', 'answering', 'relies', 'on', 'the', 'availability', 'of', 'facts', 'the', 'majority', 'of', 'which', 'can', 'not', 'be', 'found', 'in', 'structured', 'sources', 'eg', 'wikipedia', 'infoboxes', 'wikidata', 'one', 'of', 'the', 'major', 'components', 'of', 'extracting', 'facts', 'from', 'unstructured', 'text', 'is', 'relation', 'extraction', 're', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'method', 'for', 'creating', 'distant', 'weak', 'supervision', 'labels', 'for', 'training', 'a', 'largescale', 're', 'system', 'we', 'also', 'provide', 'new', 'evidence', 'about', 'the', 'effectiveness', 'of', 'neural', 'network', 'approaches', 'by', 'decoupling', 'the', 'model', 'architecture', 'from', 'the', 'feature', 'design', 'of', 'a', 'stateoftheart', 'neural', 'network', 'system', 'surprisingly', 'a', 'much', 'simpler', 'classifier', 'trained', 'on', 'similar', 'features', 'performs', 'on', 'par', 'with', 'the', 'highly', 'complex', 'neural', 'network', 'system', 'at', '75x', 'reduction', 'to', 'the', 'training', 'time', 'suggesting', 'that', 'the', 'features', 'are', 'a', 'bigger', 'contributor', 'to', 'the', 'final', 'performance']]
|
[-0.08087106271939833, 0.0043585998768497615, -0.03680058964903677, 0.07523098095290122, -0.1173836440749226, -0.17744016087418724, 0.048972551694474065, 0.39065246881857035, -0.26801031700245315, -0.32950347054359175, 0.05556568399920399, -0.29860953111792987, -0.18120703447212075, 0.23110797584388731, -0.08553546965272436, 0.023279862706042497, 0.15313017788913943, 0.04445913747246865, -0.04389325740949942, -0.27213615004063374, 0.35721646970130444, 0.07061413378499809, 0.34717675481712623, 0.004083486059830795, 0.11611650822563999, -0.06786376856935901, -0.025727021560493495, -0.030730442815242457, -0.006930204632519763, 0.2098487833995492, 0.29265987073567007, 0.2161626451190621, 0.3296677804582061, -0.39250726227258004, -0.20884810877783644, 0.04511568697653861, 0.1513468402431059, 0.138906877858737, -0.02212187786860722, -0.32882902259007096, 0.10931745330209754, -0.16074033815323585, 0.005277173334522353, -0.12322984172421839, -0.017000241156276918, -0.017986704920223282, -0.25300317373307, 0.04883615351108376, 0.1271289546148769, 0.09066710596333348, -0.04817324709485195, -0.12069150485612842, 0.006577694196640814, 0.14894678071516776, 0.010357139340128689, 0.06507663153893044, 0.12642076611331093, -0.18073935992076934, -0.11731466740527521, 0.36152137463702066, -0.05540688619214874, -0.18829590083670714, 0.2088243250149272, -0.026716492735900946, -0.17367224604447162, 0.10063792144383994, 0.25023188466025936, 0.11029671335915825, -0.1744518232862315, -0.02826380201863245, -0.07764729553262793, 0.24859765779429807, 0.021988396844526213, 0.007497908215173671, 0.19568048610498437, 0.2949146933425518, 0.02786184754733122, 0.13240539630961365, -0.09916983195768309, -0.04910515988951609, -0.20697409020090896, -0.09703768956880536, -0.18132257350389996, 0.03198922121150498, -0.10939719251191785, -0.15939584146995442, 0.39669364303230276, 0.23116319808703398, 0.21891881991177797, 0.09509354874617496, 0.3322754278929243, 0.01836966446811153, 0.1426840285139699, 0.10939746119472529, 0.17933333889701433, 8.772737384142895e-05, 0.1567462056109141, -0.13103055305809022, 0.13641355222939783, 0.06797033590790365]
|
1,803.09092
|
Adversarial Framework for Unsupervised Learning of Motion Dynamics in
Videos
|
Human behavior understanding in videos is a complex, still unsolved problem
and requires to accurately model motion at both the local (pixel-wise dense
prediction) and global (aggregation of motion cues) levels. Current approaches
based on supervised learning require large amounts of annotated data, whose
scarce availability is one of the main limiting factors to the development of
general solutions. Unsupervised learning can instead leverage the vast amount
of videos available on the web and it is a promising solution for overcoming
the existing limitations. In this paper, we propose an adversarial GAN-based
framework that learns video representations and dynamics through a
self-supervision mechanism in order to perform dense and global prediction in
videos. Our approach synthesizes videos by 1) factorizing the process into the
generation of static visual content and motion, 2) learning a suitable
representation of a motion latent space in order to enforce spatio-temporal
coherency of object trajectories, and 3) incorporating motion estimation and
pixel-wise dense prediction into the training procedure. Self-supervision is
enforced by using motion masks produced by the generator, as a co-product of
its generation process, to supervise the discriminator network in performing
dense prediction. Performance evaluation, carried out on standard benchmarks,
shows that our approach is able to learn, in an unsupervised way, both local
and global video dynamics. The learned representations, then, support the
training of video object segmentation methods with sensibly less (about 50%)
annotations, giving performance comparable to the state of the art.
Furthermore, the proposed method achieves promising performance in generating
realistic videos, outperforming state-of-the-art approaches especially on
motion-related metrics.
|
cs.CV
|
human behavior understanding in videos is a complex still unsolved problem and requires to accurately model motion at both the local pixelwise dense prediction and global aggregation of motion cues levels current approaches based on supervised learning require large amounts of annotated data whose scarce availability is one of the main limiting factors to the development of general solutions unsupervised learning can instead leverage the vast amount of videos available on the web and it is a promising solution for overcoming the existing limitations in this paper we propose an adversarial ganbased framework that learns video representations and dynamics through a selfsupervision mechanism in order to perform dense and global prediction in videos our approach synthesizes videos by 1 factorizing the process into the generation of static visual content and motion 2 learning a suitable representation of a motion latent space in order to enforce spatiotemporal coherency of object trajectories and 3 incorporating motion estimation and pixelwise dense prediction into the training procedure selfsupervision is enforced by using motion masks produced by the generator as a coproduct of its generation process to supervise the discriminator network in performing dense prediction performance evaluation carried out on standard benchmarks shows that our approach is able to learn in an unsupervised way both local and global video dynamics the learned representations then support the training of video object segmentation methods with sensibly less about 50 annotations giving performance comparable to the state of the art furthermore the proposed method achieves promising performance in generating realistic videos outperforming stateoftheart approaches especially on motionrelated metrics
|
[['human', 'behavior', 'understanding', 'in', 'videos', 'is', 'a', 'complex', 'still', 'unsolved', 'problem', 'and', 'requires', 'to', 'accurately', 'model', 'motion', 'at', 'both', 'the', 'local', 'pixelwise', 'dense', 'prediction', 'and', 'global', 'aggregation', 'of', 'motion', 'cues', 'levels', 'current', 'approaches', 'based', 'on', 'supervised', 'learning', 'require', 'large', 'amounts', 'of', 'annotated', 'data', 'whose', 'scarce', 'availability', 'is', 'one', 'of', 'the', 'main', 'limiting', 'factors', 'to', 'the', 'development', 'of', 'general', 'solutions', 'unsupervised', 'learning', 'can', 'instead', 'leverage', 'the', 'vast', 'amount', 'of', 'videos', 'available', 'on', 'the', 'web', 'and', 'it', 'is', 'a', 'promising', 'solution', 'for', 'overcoming', 'the', 'existing', 'limitations', 'in', 'this', 'paper', 'we', 'propose', 'an', 'adversarial', 'ganbased', 'framework', 'that', 'learns', 'video', 'representations', 'and', 'dynamics', 'through', 'a', 'selfsupervision', 'mechanism', 'in', 'order', 'to', 'perform', 'dense', 'and', 'global', 'prediction', 'in', 'videos', 'our', 'approach', 'synthesizes', 'videos', 'by', '1', 'factorizing', 'the', 'process', 'into', 'the', 'generation', 'of', 'static', 'visual', 'content', 'and', 'motion', '2', 'learning', 'a', 'suitable', 'representation', 'of', 'a', 'motion', 'latent', 'space', 'in', 'order', 'to', 'enforce', 'spatiotemporal', 'coherency', 'of', 'object', 'trajectories', 'and', '3', 'incorporating', 'motion', 'estimation', 'and', 'pixelwise', 'dense', 'prediction', 'into', 'the', 'training', 'procedure', 'selfsupervision', 'is', 'enforced', 'by', 'using', 'motion', 'masks', 'produced', 'by', 'the', 'generator', 'as', 'a', 'coproduct', 'of', 'its', 'generation', 'process', 'to', 'supervise', 'the', 'discriminator', 'network', 'in', 'performing', 'dense', 'prediction', 'performance', 'evaluation', 'carried', 'out', 'on', 'standard', 'benchmarks', 'shows', 'that', 'our', 'approach', 'is', 'able', 'to', 'learn', 'in', 'an', 'unsupervised', 'way', 'both', 'local', 'and', 'global', 'video', 'dynamics', 'the', 'learned', 'representations', 'then', 'support', 'the', 'training', 'of', 'video', 'object', 'segmentation', 'methods', 'with', 'sensibly', 'less', 'about', '50', 'annotations', 'giving', 'performance', 'comparable', 'to', 'the', 'state', 'of', 'the', 'art', 'furthermore', 'the', 'proposed', 'method', 'achieves', 'promising', 'performance', 'in', 'generating', 'realistic', 'videos', 'outperforming', 'stateoftheart', 'approaches', 'especially', 'on', 'motionrelated', 'metrics']]
|
[-0.037504588210811984, 0.001786424943286245, -0.05801171987998084, 0.04647584680806176, -0.11611903854556238, -0.12009202814302765, 0.023365015741616774, 0.44521771226472295, -0.26777664926977685, -0.34502920765573014, 0.07308369536454287, -0.2648887594534944, -0.15540643515459335, 0.1646544938486141, -0.1455119932213655, 0.08541387039534198, 0.16214395061162157, 0.0718862849027993, -0.05709781532910151, -0.2711215644859924, 0.29492038070277954, 0.04582121725050876, 0.3668058647818935, 0.003363980948387717, 0.17399483807071542, -0.027208652843434652, -0.05167145103108711, -0.016907394986013128, -0.03403177983871921, 0.21036628102234456, 0.29989726040780973, 0.19752533450865975, 0.31750710770631063, -0.4206659646203312, -0.2379582058924895, 0.057201678715108964, 0.1556792147968036, 0.09988567873907205, -0.05715250562195881, -0.3818991318004779, 0.1086995830466129, -0.15585803880262225, 0.01561790355649114, -0.1807184263920555, -0.017279334613480246, -0.04530187476730834, -0.3175220154834768, 0.05899769218566899, 0.0856441529228155, 0.05041722490165669, -0.08968639459165458, -0.060870625426580845, 0.021821572804429496, 0.2068409289000556, 0.038136423901932386, 0.07686693934061063, 0.16098617611658902, -0.2580632633007973, -0.12342267355057769, 0.4012309503956483, -0.06377907344095338, -0.2370737339853524, 0.2070578055975672, -0.03629673071778738, -0.11934319500847218, 0.1559287567887133, 0.2139528837502719, 0.15261571596269138, -0.16654936688987967, -0.006153759606800472, -0.015029947851927808, 0.19035588066953307, 0.0289781916492547, -0.0099403390936249, 0.18870161984680006, 0.28725471634668515, 0.030758790143702825, 0.11671234057643093, -0.13151319768848435, -0.09487027784612459, -0.22613946253774114, -0.08506150205368893, -0.18332753173487548, -0.021634128905134276, -0.11847594374238934, -0.1297504920931645, 0.40145572415875413, 0.24868351305261827, 0.20627565105588963, 0.092041306817331, 0.37350523492607934, 0.0010765654325950891, 0.0968186524992164, 0.09435917751039737, 0.1548174081567245, -0.007751525700307236, 0.13229651659785305, -0.1709697261186263, 0.09029668613533991, 0.08452512037620181]
|
1,803.09093
|
Comparing Generative Adversarial Network Techniques for Image Creation
and Modification
|
Generative adversarial networks (GANs) have demonstrated to be successful at
generating realistic real-world images. In this paper we compare various GAN
techniques, both supervised and unsupervised. The effects on training stability
of different objective functions are compared. We add an encoder to the
network, making it possible to encode images to the latent space of the GAN.
The generator, discriminator and encoder are parameterized by deep
convolutional neural networks. For the discriminator network we experimented
with using the novel Capsule Network, a state-of-the-art technique for
detecting global features in images. Experiments are performed using a digit
and face dataset, with various visualizations illustrating the results. The
results show that using the encoder network it is possible to reconstruct
images. With the conditional GAN we can alter visual attributes of generated or
encoded images. The experiments with the Capsule Network as discriminator
result in generated images of a lower quality, compared to a standard
convolutional neural network.
|
cs.LG cs.CV stat.ML
|
generative adversarial networks gans have demonstrated to be successful at generating realistic realworld images in this paper we compare various gan techniques both supervised and unsupervised the effects on training stability of different objective functions are compared we add an encoder to the network making it possible to encode images to the latent space of the gan the generator discriminator and encoder are parameterized by deep convolutional neural networks for the discriminator network we experimented with using the novel capsule network a stateoftheart technique for detecting global features in images experiments are performed using a digit and face dataset with various visualizations illustrating the results the results show that using the encoder network it is possible to reconstruct images with the conditional gan we can alter visual attributes of generated or encoded images the experiments with the capsule network as discriminator result in generated images of a lower quality compared to a standard convolutional neural network
|
[['generative', 'adversarial', 'networks', 'gans', 'have', 'demonstrated', 'to', 'be', 'successful', 'at', 'generating', 'realistic', 'realworld', 'images', 'in', 'this', 'paper', 'we', 'compare', 'various', 'gan', 'techniques', 'both', 'supervised', 'and', 'unsupervised', 'the', 'effects', 'on', 'training', 'stability', 'of', 'different', 'objective', 'functions', 'are', 'compared', 'we', 'add', 'an', 'encoder', 'to', 'the', 'network', 'making', 'it', 'possible', 'to', 'encode', 'images', 'to', 'the', 'latent', 'space', 'of', 'the', 'gan', 'the', 'generator', 'discriminator', 'and', 'encoder', 'are', 'parameterized', 'by', 'deep', 'convolutional', 'neural', 'networks', 'for', 'the', 'discriminator', 'network', 'we', 'experimented', 'with', 'using', 'the', 'novel', 'capsule', 'network', 'a', 'stateoftheart', 'technique', 'for', 'detecting', 'global', 'features', 'in', 'images', 'experiments', 'are', 'performed', 'using', 'a', 'digit', 'and', 'face', 'dataset', 'with', 'various', 'visualizations', 'illustrating', 'the', 'results', 'the', 'results', 'show', 'that', 'using', 'the', 'encoder', 'network', 'it', 'is', 'possible', 'to', 'reconstruct', 'images', 'with', 'the', 'conditional', 'gan', 'we', 'can', 'alter', 'visual', 'attributes', 'of', 'generated', 'or', 'encoded', 'images', 'the', 'experiments', 'with', 'the', 'capsule', 'network', 'as', 'discriminator', 'result', 'in', 'generated', 'images', 'of', 'a', 'lower', 'quality', 'compared', 'to', 'a', 'standard', 'convolutional', 'neural', 'network']]
|
[-0.013308659888421878, -0.023981439277961796, -0.048805451268354096, 0.09161621173963141, -0.07594415032788394, -0.19612967107707682, -0.03498098955904611, 0.5206643730784074, -0.28304448479619354, -0.3287306876303867, 0.03319656534660727, -0.28815564977076763, -0.24321629856384766, 0.17223254298397267, -0.1476706263059989, 0.1283245224159402, 0.15176730682977882, 0.03445433985250883, -0.06626704980496867, -0.3095480574844166, 0.3408981313875232, 0.06014338544497523, 0.35215163159852797, -0.027041298308923174, 0.17015849477656259, -0.08962470631022604, -0.009017596734711567, -0.012091894808877558, -0.03804756625644446, 0.17660220538845095, 0.2913810474669728, 0.21173937425005418, 0.279387755280671, -0.4726460106217135, -0.26345473835364175, 0.08554792522082631, 0.07668272064377864, 0.13262228571618787, -0.046004856776189394, -0.3873739364819649, 0.15153961419127882, -0.15015808581852186, 0.08455027901651099, -0.15578530287632766, -0.0947156521739462, -0.007664786669640587, -0.33896436210936653, -0.014221021599578073, 0.05826304847141728, 0.04922624676822661, -0.05366961616509331, -0.0768600224236695, -0.057026324583253324, 0.20510041440437093, 0.017596877650178682, 0.09750008029051316, 0.1346236714400733, -0.2305027297981537, -0.14763431906556854, 0.30653368447047585, -0.0833613578385363, -0.207037044529921, 0.16945146997339833, -0.02424346683964802, -0.11198098711872426, 0.08610088848031293, 0.27023077694078285, 0.12703337752296087, -0.1418307135747268, -0.044530550281753026, -0.0655504415246049, 0.16179791568682936, 0.059701810244661875, 0.001595091346340875, 0.14125287354489466, 0.28751778969457614, -0.03772743994770094, 0.2150008206827363, -0.19367368768442433, -0.022946484963773772, -0.20870191569272906, -0.0664211976616524, -0.24245046873170978, -0.026875837091117714, -0.11711687023592113, -0.1279000039630307, 0.45729031420659083, 0.22847125072103852, 0.2699509497719984, 0.13474595438963613, 0.35382150053733197, 0.004295696876793861, 0.16269786735751834, 0.07271736982362106, 0.18729694774866892, 0.04103135909938898, 0.10016083915923865, -0.11735953471118894, 0.09654646986820854, 0.04350688102213331]
|
1,803.09094
|
Plasma Perturbations and Cosmic Microwave Background Anisotropy in the
Linearly Expanding Milne-like Universe
|
We expose the scenarios of primordial baryon-photon plasma evolution within
the framework of the Milne-like universe models. Recently, such models find a
second wind and promise an inflation-free solution of a lot of cosmological
puzzles including the cosmological constant one. Metric tensor perturbations
are considered using the five-vectors theory of gravity admitting the Friedmann
equation satisfied up to some constant. The Cosmic Microwave Background (CMB)
spectrum is calculated qualitatively.
|
gr-qc astro-ph.CO
|
we expose the scenarios of primordial baryonphoton plasma evolution within the framework of the milnelike universe models recently such models find a second wind and promise an inflationfree solution of a lot of cosmological puzzles including the cosmological constant one metric tensor perturbations are considered using the fivevectors theory of gravity admitting the friedmann equation satisfied up to some constant the cosmic microwave background cmb spectrum is calculated qualitatively
|
[['we', 'expose', 'the', 'scenarios', 'of', 'primordial', 'baryonphoton', 'plasma', 'evolution', 'within', 'the', 'framework', 'of', 'the', 'milnelike', 'universe', 'models', 'recently', 'such', 'models', 'find', 'a', 'second', 'wind', 'and', 'promise', 'an', 'inflationfree', 'solution', 'of', 'a', 'lot', 'of', 'cosmological', 'puzzles', 'including', 'the', 'cosmological', 'constant', 'one', 'metric', 'tensor', 'perturbations', 'are', 'considered', 'using', 'the', 'fivevectors', 'theory', 'of', 'gravity', 'admitting', 'the', 'friedmann', 'equation', 'satisfied', 'up', 'to', 'some', 'constant', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'spectrum', 'is', 'calculated', 'qualitatively']]
|
[-0.14940834303608916, 0.1000626266418362, -0.08236021254495753, 0.09602912459974247, -0.0881372516446594, -0.13015614140000362, -0.11819585344107794, 0.2679688701016912, -0.2591431723323776, -0.32309983712412527, 0.04303520578724235, -0.29834685649778414, -0.08735805692901807, 0.1889020197802404, 0.03376892317823176, 0.04936196779443035, -0.001681366004049778, 0.015069686640888008, -0.034581266809254885, -0.2741286222068871, 0.36858474050384404, 0.141811976667994, 0.24366969567959879, 0.02282602795914038, 0.14804347122171477, -0.15825517144081974, -0.06010886258098172, 0.05534379673537923, -0.18107282221312948, 0.03815689367075353, 0.16094151039383245, 0.19676414525845268, 0.20756894950546437, -0.4451369188670347, -0.33972836815432383, 0.12464407103747796, 0.10978523973347758, 0.19194110338367634, -0.07887694534998554, -0.26783584277910083, 0.03752307317205774, -0.2019923554260784, -0.14128830057999758, -0.05272089838356113, -0.03497389131295147, -0.05570153922620994, -0.2089238049524989, 0.12365783705139782, -0.011263503936300082, -0.07799135782380602, -0.13423596576565125, -0.062016958346479197, 0.013890457853897293, 0.05125586040067806, 0.1151824346083258, 0.023408330323647208, 0.13208574234897189, -0.15626877027827857, -0.07219534928201517, 0.4589401939466818, -0.17797577545853027, -0.15011966656615486, 0.07850874365488095, -0.16780345255870427, -0.17198570686350786, 0.05022698633525687, 0.11358582820576518, 0.11297397994533626, -0.1539181584297721, 0.1937641526994629, 0.029204362336156975, 0.14279995921568306, 0.11808773637193241, 0.017611200615430055, 0.3240517131261416, 0.10672758970020423, 0.005205214899311315, 0.05968395227204953, 0.0003265701790354145, -0.07241171255096127, -0.35049647559870534, -0.08166707757471213, -0.1227088544740161, 0.08051330031854893, -0.21613880201679855, -0.2276561596055529, 0.3769209462482093, 0.12380266506502878, 0.14839062296330177, 0.03447025430513852, 0.28941778841414556, 0.069252572870299, -0.0056435622677985416, 0.1081966438414112, 0.3081201930107278, 0.2016561494188022, 0.13928018227817296, -0.20707909041040912, 0.011344557363929144, 0.03395377000821615]
|
1,803.09095
|
Precursors to Molecular Slip on Smooth Hydrophobic Surfaces
|
Experiments and simulations suggest that simple liquids may experience slip
while flowing near a smooth, hydrophobic surface. Here we show how precursors
to molecular slip can be observed in the complex response of a liquid to
oscillatory shear. We measure both the change in frequency and bandwidth of a
quartz crystal microbalance (QCM) during the growth of a single drop of water
immersed in an ambient liquid. By varying the hydrophobicity of the surface
using self-assembled monolayers, our results show little or no slip for water
on all surfaces. However, we observe excess transverse motion near hydrophobic
surfaces due to weak binding in the corrugated surface potential, an essential
precursor to slip. We also show how this effect can be easily missed in
simulations utilizing finite-ranged interaction potentials.
|
physics.flu-dyn cond-mat.soft
|
experiments and simulations suggest that simple liquids may experience slip while flowing near a smooth hydrophobic surface here we show how precursors to molecular slip can be observed in the complex response of a liquid to oscillatory shear we measure both the change in frequency and bandwidth of a quartz crystal microbalance qcm during the growth of a single drop of water immersed in an ambient liquid by varying the hydrophobicity of the surface using selfassembled monolayers our results show little or no slip for water on all surfaces however we observe excess transverse motion near hydrophobic surfaces due to weak binding in the corrugated surface potential an essential precursor to slip we also show how this effect can be easily missed in simulations utilizing finiteranged interaction potentials
|
[['experiments', 'and', 'simulations', 'suggest', 'that', 'simple', 'liquids', 'may', 'experience', 'slip', 'while', 'flowing', 'near', 'a', 'smooth', 'hydrophobic', 'surface', 'here', 'we', 'show', 'how', 'precursors', 'to', 'molecular', 'slip', 'can', 'be', 'observed', 'in', 'the', 'complex', 'response', 'of', 'a', 'liquid', 'to', 'oscillatory', 'shear', 'we', 'measure', 'both', 'the', 'change', 'in', 'frequency', 'and', 'bandwidth', 'of', 'a', 'quartz', 'crystal', 'microbalance', 'qcm', 'during', 'the', 'growth', 'of', 'a', 'single', 'drop', 'of', 'water', 'immersed', 'in', 'an', 'ambient', 'liquid', 'by', 'varying', 'the', 'hydrophobicity', 'of', 'the', 'surface', 'using', 'selfassembled', 'monolayers', 'our', 'results', 'show', 'little', 'or', 'no', 'slip', 'for', 'water', 'on', 'all', 'surfaces', 'however', 'we', 'observe', 'excess', 'transverse', 'motion', 'near', 'hydrophobic', 'surfaces', 'due', 'to', 'weak', 'binding', 'in', 'the', 'corrugated', 'surface', 'potential', 'an', 'essential', 'precursor', 'to', 'slip', 'we', 'also', 'show', 'how', 'this', 'effect', 'can', 'be', 'easily', 'missed', 'in', 'simulations', 'utilizing', 'finiteranged', 'interaction', 'potentials']]
|
[-0.13492442331880738, 0.1997930262243699, -0.09580641903721698, -0.003217971880985715, -0.03071047905177693, -0.13465620548231527, 0.021525916085010977, 0.4464441940035613, -0.25806120538618416, -0.27867880127450917, 0.06251827522191888, -0.25958687646198086, -0.19734124202568637, 0.1940086152208096, -0.035541682209441205, 0.022681021331663942, 0.04028202011704707, -0.04910102421126794, -0.07286207261313393, -0.18223692022183968, 0.24090899443399394, 0.05234035814100935, 0.290615010442707, 0.17869346512270567, 0.04920163861606852, -0.019554701018932974, 0.08382765259193548, 0.06705344257352408, -0.1911977179500468, 0.049429609141952824, 0.22696567811954083, -0.0852813643105037, 0.19551034649157373, -0.5187033405454713, -0.273200890705084, 0.06514083387810388, 0.12166171515673341, 0.1419481584289315, -0.09466753395918204, -0.25730340358859394, 0.026465614243988966, -0.1399429112789221, -0.15447149481406086, -0.0545481691860914, -0.012620282808711636, 0.05698200791857744, -0.18773838540073484, 0.10934550173419666, 0.032690472162357764, 0.07270702177629573, -0.1035290819745569, -0.03376413869955286, -0.08857086976968276, 0.07570491529259016, 0.0515520170374657, 0.032586689541858505, 0.25953541162016336, -0.13953333471636142, -0.030428254020080203, 0.38071159684477607, -0.1126024931709253, -0.19834770825400483, 0.2575791863418999, -0.1718036361717168, -0.05085077785042813, 0.23368144105916144, 0.18588902084547954, 0.08349284230394005, -0.14188184628710587, -0.024379848510761803, -0.007591900446641375, 0.22075077343106386, 0.13652286275601, -0.05079536106586602, 0.2600296818272909, 0.20996311443741433, 0.030157723289448768, 0.15611513752810424, -0.15835081027944398, -0.03408477206903626, -0.247274245673907, -0.221030078280819, -0.1876832815405578, 0.029107801732607186, -0.0663571270013108, -0.18409797181084286, 0.3295875311596319, 0.08002525759820855, 0.16036836674902588, 0.013753559853284969, 0.23614196852577152, 0.010659488093551772, 0.09437810653707857, 0.01820088723616209, 0.27116040140390396, 0.08364829632228066, 0.07532071687637654, -0.2711307404601939, 0.08686985683198145, -0.005223951196967391]
|
1,803.09096
|
On a variant of Tykhonov regularization in optimal control under PDEs
|
We make some remarks on a variant of the classical Tikhonov regularization in
optimal control under PDEs which allows for a certain flexibility in dealing
with non-linearities and state restrictions, in the sense that differential
constraints between control and state are eliminated and pairs can run freely
in their respective sets of feasibility, at the expense of introducing an
additional variable in a collection of approximated problems. In addition to
exploring basic issues like existence and optimality, we also discuss a
numerical procedure and apply it to some academic, illustrative numerical
tests, as well as examine the convergence of solutions of this new family of
approximated problems to the solutions of the underlying optimal control
problem.
|
math.OC
|
we make some remarks on a variant of the classical tikhonov regularization in optimal control under pdes which allows for a certain flexibility in dealing with nonlinearities and state restrictions in the sense that differential constraints between control and state are eliminated and pairs can run freely in their respective sets of feasibility at the expense of introducing an additional variable in a collection of approximated problems in addition to exploring basic issues like existence and optimality we also discuss a numerical procedure and apply it to some academic illustrative numerical tests as well as examine the convergence of solutions of this new family of approximated problems to the solutions of the underlying optimal control problem
|
[['we', 'make', 'some', 'remarks', 'on', 'a', 'variant', 'of', 'the', 'classical', 'tikhonov', 'regularization', 'in', 'optimal', 'control', 'under', 'pdes', 'which', 'allows', 'for', 'a', 'certain', 'flexibility', 'in', 'dealing', 'with', 'nonlinearities', 'and', 'state', 'restrictions', 'in', 'the', 'sense', 'that', 'differential', 'constraints', 'between', 'control', 'and', 'state', 'are', 'eliminated', 'and', 'pairs', 'can', 'run', 'freely', 'in', 'their', 'respective', 'sets', 'of', 'feasibility', 'at', 'the', 'expense', 'of', 'introducing', 'an', 'additional', 'variable', 'in', 'a', 'collection', 'of', 'approximated', 'problems', 'in', 'addition', 'to', 'exploring', 'basic', 'issues', 'like', 'existence', 'and', 'optimality', 'we', 'also', 'discuss', 'a', 'numerical', 'procedure', 'and', 'apply', 'it', 'to', 'some', 'academic', 'illustrative', 'numerical', 'tests', 'as', 'well', 'as', 'examine', 'the', 'convergence', 'of', 'solutions', 'of', 'this', 'new', 'family', 'of', 'approximated', 'problems', 'to', 'the', 'solutions', 'of', 'the', 'underlying', 'optimal', 'control', 'problem']]
|
[-0.1126587574514721, 0.030545955601249668, -0.06278917186989866, 0.08683846320390926, -0.10279421558089812, -0.15133979283112647, 0.08068351473273902, 0.3551812085066119, -0.3211517096577405, -0.3134552177427144, 0.1954787445790536, -0.2513315036938303, -0.13153189730605688, 0.2343311469303444, -0.10376287468383892, 0.11309999506117711, 0.06638536089629835, 0.0008288315930885488, -0.1079445661483172, -0.26445212033737836, 0.331385885586095, 0.03100147439620522, 0.2337807820274912, 0.03883578115421877, 0.13341690280980528, 0.00454415580065086, -0.01388148700513331, 0.054242480253190575, -0.12815528166319037, 0.12444866497515186, 0.261472909044924, 0.1431085991127224, 0.3531637637040995, -0.42129828695986615, -0.18715086187725757, 0.09299808181019435, 0.13903529408130924, 0.10672577315563103, -0.0617033193371628, -0.26085120638639764, 0.08363250440693107, -0.12318290622728266, -0.16691975740731918, -0.13627613451563805, -0.04879407980077868, 0.07957049793210523, -0.29242373102119773, 0.03895039081845457, 0.04300048442834442, 0.03333236079598809, -0.08685931074683924, -0.09430626756110197, 0.016209103763183772, 0.09123690892010927, 0.0750185741996794, -0.046460873854812235, 0.07488934183091825, -0.1500417494500088, -0.14042596740282848, 0.372416602794366, -0.028856173011671014, -0.2799692986661504, 0.1934737679628848, -0.06876066259654431, -0.1466658980513377, 0.06463257266722362, 0.19852547974582632, 0.12894822740004044, -0.1433367671019494, 0.09678022981498888, -0.014667272993267096, 0.13670506289907217, 0.08567068015690893, 0.057139352538044856, 0.1090473498635251, 0.15782298614945392, 0.12477479984678713, 0.17833571616913482, 0.005188901613643071, -0.1386267295877995, -0.3724912990141532, -0.1318692246427888, -0.11727424491204899, 0.013748034806761506, -0.09953511632983432, -0.15648224551616044, 0.3843150359160941, 0.1660935436992641, 0.18520411458027003, 0.04593297921558682, 0.2519255216104974, 0.11099294106905541, -0.004632563673457581, 0.05855913700311091, 0.20928351318008057, 0.1147068736689358, 0.08328346165844464, -0.22518057270770378, 0.05870818443885394, 0.04514445305464725]
|
1,803.09097
|
Topological Defects in Anisotropic Driven Open Systems
|
We study the dynamics and unbinding transition of vortices in the compact
anisotropic Kardar-Parisi-Zhang (KPZ) equation. The combination of
non-equilibrium conditions and strong spatial anisotropy drastically affects
the structure of vortices and amplifies their mutual binding forces, thus
stabilizing the ordered phase. We find novel universal critical behavior in the
vortex-unbinding crossover in finite-size systems. These results are relevant
for a wide variety of physical systems, ranging from strongly coupled
light-matter quantum systems to dissipative time crystals.
|
cond-mat.quant-gas
|
we study the dynamics and unbinding transition of vortices in the compact anisotropic kardarparisizhang kpz equation the combination of nonequilibrium conditions and strong spatial anisotropy drastically affects the structure of vortices and amplifies their mutual binding forces thus stabilizing the ordered phase we find novel universal critical behavior in the vortexunbinding crossover in finitesize systems these results are relevant for a wide variety of physical systems ranging from strongly coupled lightmatter quantum systems to dissipative time crystals
|
[['we', 'study', 'the', 'dynamics', 'and', 'unbinding', 'transition', 'of', 'vortices', 'in', 'the', 'compact', 'anisotropic', 'kardarparisizhang', 'kpz', 'equation', 'the', 'combination', 'of', 'nonequilibrium', 'conditions', 'and', 'strong', 'spatial', 'anisotropy', 'drastically', 'affects', 'the', 'structure', 'of', 'vortices', 'and', 'amplifies', 'their', 'mutual', 'binding', 'forces', 'thus', 'stabilizing', 'the', 'ordered', 'phase', 'we', 'find', 'novel', 'universal', 'critical', 'behavior', 'in', 'the', 'vortexunbinding', 'crossover', 'in', 'finitesize', 'systems', 'these', 'results', 'are', 'relevant', 'for', 'a', 'wide', 'variety', 'of', 'physical', 'systems', 'ranging', 'from', 'strongly', 'coupled', 'lightmatter', 'quantum', 'systems', 'to', 'dissipative', 'time', 'crystals']]
|
[-0.20914444063352053, 0.23923792278908781, -0.07965313075232859, 0.03445702892924218, -0.03935162705602124, -0.15259481351945156, 0.008780140316383423, 0.3288490842770491, -0.3019025776241171, -0.2405462066740974, -0.005967445075695746, -0.27357718554374416, -0.17730136476855382, 0.1935543492436409, 0.05850793086727591, 0.08502638334864873, -0.005590842990817404, -0.06221020828908015, -0.08490503754613823, -0.16800829450183205, 0.3722651429523371, -0.011127141023998297, 0.3474562465164222, 0.09303642141534701, 0.059885771191482876, -0.0320012747359119, 0.06953928145383925, 0.037354707405412274, -0.22258290244070322, 0.055187825493416505, 0.2183607210356154, -0.04467266575145339, 0.2044901646655298, -0.4320526269852723, -0.25975715257472504, 0.05073684688326657, 0.16838424938032404, 0.19394241540545695, -0.03896588670383943, -0.32367408862582553, 0.01515981534152831, -0.12719772803584897, -0.14470962704600474, -0.1084594024455567, 0.03262756952991415, 0.097890739617134, -0.21586235782735075, 0.15022317875225685, 0.09571088272097864, 0.061672143013167535, -0.09718651967245694, -0.016315562871137734, -0.05379644231135516, 0.12408823089208454, -0.008370224974657359, -0.015388425615750939, 0.20086592852481103, -0.21298768191818931, -0.08278083107679297, 0.3873198050025262, -0.0321590378390331, -0.13479092182272948, 0.2768338342491341, -0.17599408995164068, -0.11820941308121148, 0.17875206572812444, 0.22756269537096255, 0.10793561180808435, -0.13893846429862988, 0.06705972412984058, 0.03543290159493489, 0.1827720201476232, -0.002839537980770202, 0.09532204307125587, 0.2633269955649188, 0.19383301074987302, 0.024173917506184233, 0.16090147250858872, -0.03148031094430113, -0.2128526152411819, -0.2595616331274964, -0.13457059638734026, -0.1799614788523238, 0.06450290149567943, -0.13454857054047784, -0.19819525085193546, 0.3563098028044854, 0.18587288093802176, 0.15574291217643277, 0.004803288620774095, 0.15663315263258196, 0.11783983781443615, 0.03451991364004483, 0.014665190081455205, 0.24127824343495854, 0.14437427620501503, 0.1411908944014852, -0.3338078592603683, 0.02724496696732546, 0.033565065088240725]
|
1,803.09098
|
Equivariant Algebraic Morse Theory
|
In this paper we develop Algebraic Morse Theory for the case where a group
acts on a free chain complex. Algebraic Morse Theory is an adaption of Discrete
Morse Theory to free chain complexes.
|
math.CO math.AT
|
in this paper we develop algebraic morse theory for the case where a group acts on a free chain complex algebraic morse theory is an adaption of discrete morse theory to free chain complexes
|
[['in', 'this', 'paper', 'we', 'develop', 'algebraic', 'morse', 'theory', 'for', 'the', 'case', 'where', 'a', 'group', 'acts', 'on', 'a', 'free', 'chain', 'complex', 'algebraic', 'morse', 'theory', 'is', 'an', 'adaption', 'of', 'discrete', 'morse', 'theory', 'to', 'free', 'chain', 'complexes']]
|
[-0.1631158681394642, 0.12255409925958649, -0.14306643180658712, 0.10716783288208877, -0.11830891305854653, -0.1552301525576588, 0.020920803667703533, 0.35637540222309966, -0.3315720927408513, -0.17268266435712576, 0.04722808802377104, -0.2087237880948712, -0.2297995986745638, 0.1614466623731834, -0.14470826719394503, -0.05196977382087532, -0.01676612109055414, 0.1551774927031468, -0.010643105680013405, -0.17731978377217755, 0.344203596099225, 0.001262583605506841, 0.2216549916740726, 0.06843565218150616, 0.06830171575112377, 0.1069599139805445, 0.032838228980407995, -0.015153876122306375, -0.22300259325215044, 0.24351596467963912, 0.3133253666900975, 0.0036359460997011732, 0.27562355556908774, -0.4451007793164429, -0.26144830290885535, 0.16261133099632227, 0.1567896393072956, 0.11089993421645726, -0.058711365320692384, -0.22086968628333553, 0.07926087453961372, -0.21423505890347502, -0.19493558537214994, -0.04627671303665813, -0.0042506758781040415, 0.012759797247674535, -0.23727041915716493, -0.04307590493494097, 0.01592840363874155, 0.20159304763793068, -0.05780671164393425, 0.016377792700522524, -0.029801493976265192, 0.09521310853169244, -0.01649827467661132, 0.045646601644180274, 0.13646988780237734, -0.018831645241281128, -0.11476946189342176, 0.3607876691967249, -0.06939058046897545, -0.3005797904642189, 0.17491507695933037, -0.009593212456606767, -0.24121367638273275, 0.09045045061365646, 0.08866876922547817, 0.18295117604601033, -0.034674497465055215, 0.28170478439835067, -0.07179363814237363, 0.16980307445149212, 0.033844630480470025, -0.08763768178794314, 0.05144082764437532, 0.11719257447539884, 0.13631695914356148, 0.15888318627634468, 0.05335519694627317, -0.20669334973482525, -0.3297340902773773, -0.20475335947840528, -0.17969939915244193, 0.14510806625270667, -0.0616034439573174, -0.2998480788048576, 0.40848240837016525, 0.021085022734737054, 0.07598811104510199, 0.13513830964289167, 0.2166680515237043, 0.1246984957388657, -0.07876337462050073, -0.01824072779923239, 0.03425721279071534, 0.281262042137849, -0.0326589915819247, -0.14632124043932623, -0.14763893604771616, 0.2749834381427397]
|
1,803.09099
|
A Resourceful Reframing of Behavior Trees
|
Designers of autonomous agents, whether in physical or virtual environments,
need to express nondeterminisim, failure, and parallelism in behaviors, as well
as accounting for synchronous coordination between agents. Behavior Trees are a
semi-formalism deployed widely for this purpose in the games industry, but with
challenges to scalability, reasoning, and reuse of common sub-behaviors.
We present an alternative formulation of behavior trees through a language
design perspective, giving a formal operational semantics, type system, and
corresponding implementation. We express specifications for atomic behaviors as
linear logic formulas describing how they transform the environment, and our
type system uses linear sequent calculus to derive a compositional type
assignment to behavior tree expressions. These types expose the conditions
required for behaviors to succeed and allow abstraction over parameters to
behaviors, enabling the development of behavior "building blocks" amenable to
compositional reasoning and reuse.
|
cs.PL cs.AI
|
designers of autonomous agents whether in physical or virtual environments need to express nondeterminisim failure and parallelism in behaviors as well as accounting for synchronous coordination between agents behavior trees are a semiformalism deployed widely for this purpose in the games industry but with challenges to scalability reasoning and reuse of common subbehaviors we present an alternative formulation of behavior trees through a language design perspective giving a formal operational semantics type system and corresponding implementation we express specifications for atomic behaviors as linear logic formulas describing how they transform the environment and our type system uses linear sequent calculus to derive a compositional type assignment to behavior tree expressions these types expose the conditions required for behaviors to succeed and allow abstraction over parameters to behaviors enabling the development of behavior building blocks amenable to compositional reasoning and reuse
|
[['designers', 'of', 'autonomous', 'agents', 'whether', 'in', 'physical', 'or', 'virtual', 'environments', 'need', 'to', 'express', 'nondeterminisim', 'failure', 'and', 'parallelism', 'in', 'behaviors', 'as', 'well', 'as', 'accounting', 'for', 'synchronous', 'coordination', 'between', 'agents', 'behavior', 'trees', 'are', 'a', 'semiformalism', 'deployed', 'widely', 'for', 'this', 'purpose', 'in', 'the', 'games', 'industry', 'but', 'with', 'challenges', 'to', 'scalability', 'reasoning', 'and', 'reuse', 'of', 'common', 'subbehaviors', 'we', 'present', 'an', 'alternative', 'formulation', 'of', 'behavior', 'trees', 'through', 'a', 'language', 'design', 'perspective', 'giving', 'a', 'formal', 'operational', 'semantics', 'type', 'system', 'and', 'corresponding', 'implementation', 'we', 'express', 'specifications', 'for', 'atomic', 'behaviors', 'as', 'linear', 'logic', 'formulas', 'describing', 'how', 'they', 'transform', 'the', 'environment', 'and', 'our', 'type', 'system', 'uses', 'linear', 'sequent', 'calculus', 'to', 'derive', 'a', 'compositional', 'type', 'assignment', 'to', 'behavior', 'tree', 'expressions', 'these', 'types', 'expose', 'the', 'conditions', 'required', 'for', 'behaviors', 'to', 'succeed', 'and', 'allow', 'abstraction', 'over', 'parameters', 'to', 'behaviors', 'enabling', 'the', 'development', 'of', 'behavior', 'building', 'blocks', 'amenable', 'to', 'compositional', 'reasoning', 'and', 'reuse']]
|
[-0.1302335964597381, 0.03938471366165726, -0.08822856638852479, 0.09155437768688493, -0.18228065865080342, -0.18299333322929204, 0.09135255022280353, 0.3855981894354098, -0.28936461030750327, -0.34584658401236484, 0.08910068268904693, -0.2032519622372776, -0.17982727936876897, 0.1572282878770391, -0.10911260732824754, 0.06099505632364592, 0.02401444910903101, 0.007286730363461984, -0.04239451294734285, -0.19119956210785866, 0.2744127848358947, 0.02113270721173961, 0.28478853725938696, 0.00017420998876438524, 0.08942666216107616, 0.04622605350208435, 0.031050484906202252, -0.0016020393291365925, -0.08653067853420728, 0.142297101208777, 0.4030133507003749, 0.23973273216699162, 0.2901871721642636, -0.4742349788570355, -0.1493034185960644, 0.05639879586494589, 0.1367437843212953, 0.07227565508410606, 0.013060325386179407, -0.27783141638675746, 0.06079712586246268, -0.21311354961366916, -0.14334012737946353, -0.13822571045453966, 0.030627548164368548, 0.02536951281456617, -0.258280191753216, -0.07777637460126277, 0.10885845128545388, 0.1267231655615997, -0.05441334336336675, -0.07758208220641054, 0.04422921961577895, 0.19565122292281883, -0.011013508536411028, -0.09762957539361813, 0.15512429916021162, -0.10000663998461988, -0.1883115088193249, 0.3876428902761018, -0.006569597103639784, -0.23067366782181564, 0.2529845007645972, -0.019516737171428374, -0.16427154541287545, 0.05355254132096676, 0.1999504502945967, 0.0687125510855639, -0.20352963521995032, 0.062436092842920905, 0.07013577942729649, 0.18865490138673488, 0.07807867195164907, 0.075312901274675, 0.20234946726420283, 0.21012665305531372, 0.05457219648698386, 0.1394688588759121, 0.05732432943190972, -0.1503445111133539, -0.2646872931649487, -0.1604445389825443, -0.050367762844492917, -0.0033032655185700334, -0.0739559641587599, -0.2014868763737707, 0.34083284178653556, 0.1972005320712924, 0.14392116676207062, 0.16857642823503943, 0.31173058716158797, 0.08747529043190616, 0.0865198712741589, 0.0682913661207052, 0.104635081750198, 0.0888909877746971, 0.18531346643924795, -0.18349470617249608, 0.15100430429362469, 0.06660674694062203]
|
1,803.091
|
On limit theorems for fields of martingale differences
|
We prove a central limit theorem for stationary multiple (random) fields of
martingale differences $f\circ T_{\underline{i}}$, $\underline{i}\in \Bbb Z^d$,
where $T_{\underline{i}}$ is a $\Bbb Z^d$ action. In most cases the multiple
(random) fields of martingale differences is given by a completely commuting
filtration. A central limit theorem proving convergence to a normal law has
been known for Bernoulli random fields and in [V15] this result was extended to
random fields where one of generating transformations is ergodic. In the
present paper it is proved that a convergence takes place always and the limit
law is a mixture of normal laws. If the $\Bbb Z^d$ action is ergodic and $d\geq
2$, the limit law need not be normal. For proving the result mentioned above, a
generalisation of McLeish's CLT for arrays $(X_{n,i})$ of martingale
differences is used. More precisely, sufficient conditions for a CLT are found
in the case when the sums $\sum_i X_{n,i}^2$ converge only in distribution. The
CLT is followed by a weak invariance principle. It is shown that central limit
theorems and invariance principles using martingale approximation remain valid
in the non-ergodic case.
|
math.PR
|
we prove a central limit theorem for stationary multiple random fields of martingale differences fcirc t_underlinei underlineiin bbb zd where t_underlinei is a bbb zd action in most cases the multiple random fields of martingale differences is given by a completely commuting filtration a central limit theorem proving convergence to a normal law has been known for bernoulli random fields and in v15 this result was extended to random fields where one of generating transformations is ergodic in the present paper it is proved that a convergence takes place always and the limit law is a mixture of normal laws if the bbb zd action is ergodic and dgeq 2 the limit law need not be normal for proving the result mentioned above a generalisation of mcleishs clt for arrays x_ni of martingale differences is used more precisely sufficient conditions for a clt are found in the case when the sums sum_i x_ni2 converge only in distribution the clt is followed by a weak invariance principle it is shown that central limit theorems and invariance principles using martingale approximation remain valid in the nonergodic case
|
[['we', 'prove', 'a', 'central', 'limit', 'theorem', 'for', 'stationary', 'multiple', 'random', 'fields', 'of', 'martingale', 'differences', 'fcirc', 't_underlinei', 'underlineiin', 'bbb', 'zd', 'where', 't_underlinei', 'is', 'a', 'bbb', 'zd', 'action', 'in', 'most', 'cases', 'the', 'multiple', 'random', 'fields', 'of', 'martingale', 'differences', 'is', 'given', 'by', 'a', 'completely', 'commuting', 'filtration', 'a', 'central', 'limit', 'theorem', 'proving', 'convergence', 'to', 'a', 'normal', 'law', 'has', 'been', 'known', 'for', 'bernoulli', 'random', 'fields', 'and', 'in', 'v15', 'this', 'result', 'was', 'extended', 'to', 'random', 'fields', 'where', 'one', 'of', 'generating', 'transformations', 'is', 'ergodic', 'in', 'the', 'present', 'paper', 'it', 'is', 'proved', 'that', 'a', 'convergence', 'takes', 'place', 'always', 'and', 'the', 'limit', 'law', 'is', 'a', 'mixture', 'of', 'normal', 'laws', 'if', 'the', 'bbb', 'zd', 'action', 'is', 'ergodic', 'and', 'dgeq', '2', 'the', 'limit', 'law', 'need', 'not', 'be', 'normal', 'for', 'proving', 'the', 'result', 'mentioned', 'above', 'a', 'generalisation', 'of', 'mcleishs', 'clt', 'for', 'arrays', 'x_ni', 'of', 'martingale', 'differences', 'is', 'used', 'more', 'precisely', 'sufficient', 'conditions', 'for', 'a', 'clt', 'are', 'found', 'in', 'the', 'case', 'when', 'the', 'sums', 'sum_i', 'x_ni2', 'converge', 'only', 'in', 'distribution', 'the', 'clt', 'is', 'followed', 'by', 'a', 'weak', 'invariance', 'principle', 'it', 'is', 'shown', 'that', 'central', 'limit', 'theorems', 'and', 'invariance', 'principles', 'using', 'martingale', 'approximation', 'remain', 'valid', 'in', 'the', 'nonergodic', 'case']]
|
[-0.12386636634279663, 0.14988697817963031, -0.1212234009988606, 0.10574632381192511, -0.0009923974194356966, -0.1593497124190132, 0.038305326589357314, 0.3270039976677961, -0.26778322119951353, -0.1479013716025899, 0.14470717770487276, -0.2514428425580263, -0.10451837317733507, 0.18891903841868044, -0.12160946700670239, 0.03176135948710402, 0.012012610211968422, 0.04128010407504108, -0.013763425620790156, -0.2669566694802294, 0.2764491142420512, -0.05075603448785841, 0.2951991567439917, 0.02682760558964219, 0.1233285593004742, 0.02156678797263238, 0.004585935736152654, 0.012707107448891797, -0.11314789767986642, 0.05456097073749536, 0.25098482633604563, 0.05447731488384307, 0.3104941602641096, -0.35401930016362004, -0.18151110408620702, 0.2014914253370888, 0.14597265363942521, 0.04734984616257457, -0.02930406350100788, -0.260265118882267, 0.11423848664853722, -0.13209391168202272, -0.18974925700264672, -0.05482980532882114, 0.05540912921488699, 0.06545822350308299, -0.3688951682118285, 0.10047011114656926, 0.21948723604954365, 0.06772145087985942, -0.02137764883098296, -0.07228645991482255, 0.013158595882770088, 0.12403153696100667, 0.06164104489273288, 0.052030123664169675, 0.11548578265372068, -0.06851430980152347, -0.08579685128061101, 0.3893389725436767, -0.06771194164498916, -0.24129098150879144, 0.147669640889055, -0.2112015655160778, -0.215126979462285, 0.09550799545896653, 0.08263403901623355, 0.12651184808924476, -0.18107647972558172, 0.18971438400266277, -0.09526283583189878, 0.10233063380130464, 0.10789740482190004, 0.00482183787971735, 0.13538959629626737, 0.08919603587257573, 0.14846838921269712, 0.1371451821404561, -0.03106077760199292, -0.13246954856440424, -0.3288479936160406, -0.1417324954689118, -0.2187849499957843, 0.1585203769190735, -0.14053261551404528, -0.1484941204755968, 0.2896148078867959, 0.11162108781023158, 0.11663092279858474, 0.15755654094585528, 0.19442663478872013, 0.2009741174674774, 0.0029096436148392966, 0.08529666003822867, 0.16588545184996392, 0.21272450639678733, 0.06003036691108719, -0.07710855137427441, 0.06615034591199623, 0.16849547335360612]
|
1,803.09101
|
Every component of a fractal square is a Peano continuum
|
This paper concerns the local connectedness of components of self-similar
sets. Given an equal partition of the unit square into n*n small squares, we
may choose arbitrarily two or more of them and form an iterated function
system. The attractor F resulted from this IFS is called a fractal square. We
prove that every component of F is locally connected. The same result for
three-dimensional analogues of F does not hold.
|
math.GN
|
this paper concerns the local connectedness of components of selfsimilar sets given an equal partition of the unit square into nn small squares we may choose arbitrarily two or more of them and form an iterated function system the attractor f resulted from this ifs is called a fractal square we prove that every component of f is locally connected the same result for threedimensional analogues of f does not hold
|
[['this', 'paper', 'concerns', 'the', 'local', 'connectedness', 'of', 'components', 'of', 'selfsimilar', 'sets', 'given', 'an', 'equal', 'partition', 'of', 'the', 'unit', 'square', 'into', 'nn', 'small', 'squares', 'we', 'may', 'choose', 'arbitrarily', 'two', 'or', 'more', 'of', 'them', 'and', 'form', 'an', 'iterated', 'function', 'system', 'the', 'attractor', 'f', 'resulted', 'from', 'this', 'ifs', 'is', 'called', 'a', 'fractal', 'square', 'we', 'prove', 'that', 'every', 'component', 'of', 'f', 'is', 'locally', 'connected', 'the', 'same', 'result', 'for', 'threedimensional', 'analogues', 'of', 'f', 'does', 'not', 'hold']]
|
[-0.19348044593615168, 0.09374275818363842, -0.08626898719181478, 0.045286594614596436, -0.03876006101343361, -0.11413660828142204, -0.012796654934916173, 0.3287851521351808, -0.30089476841016555, -0.17811772776242923, 0.08871239823827022, -0.2945216458526925, -0.1693756039906949, 0.16714013994566468, -0.07685269431857078, 0.010928791877157775, 0.03392243267587897, 0.09110670543643055, -0.03355265272007337, -0.3079434632599144, 0.3624018028273549, -0.0541791355788288, 0.20436576370831946, 0.027790821236099154, 0.11832261219633822, 0.017906903279420565, 0.0019503800316490758, 0.07398516074819884, -0.13490046203043393, 0.13010916727739322, 0.17570779880371049, 0.1329254067771819, 0.33169278069596053, -0.4042112740247779, -0.14428293475435233, 0.22402441095639491, 0.18039050610722895, -0.011844772976678861, 0.026400987907193117, -0.19724000085302643, 0.12328685070453606, -0.13624870737614503, -0.21989798736692945, -0.03361686405686425, 0.03587765282374138, 0.05283275354509308, -0.30427740185692065, 0.005611056409461398, 0.16700307520526186, 0.07080206120203078, -0.0722459016603903, -0.10564798427398094, -0.038532004927770355, 0.14321736963531395, -0.019143671420415943, 0.08741958515430001, 0.07776773293276357, -0.07958359702024609, -0.07568991344264696, 0.3579838873989041, -0.046010983317539514, -0.23300894218969198, 0.17260255487750506, -0.15502017925322895, -0.14452586763105552, 0.10946952094140291, 0.1367681795980414, 0.09218645794317126, -0.13885318312111875, 0.12285590646575323, -0.12239095874288132, 0.20296583503064974, 0.0800928435432659, -0.002098924391837397, 0.17706423806695556, 0.09981798388155728, 0.16473232602123022, 0.17343707348574217, -0.04210130412920221, -0.030655691026329573, -0.32733100998989295, -0.154322903373764, -0.2361696936668907, 0.13441749714978177, -0.12468862015418676, -0.25353881171051884, 0.359757527351563, 0.05757862886472959, 0.21979748006437866, 0.09998211723712969, 0.23184347195996785, 0.12019090435769357, 0.0768246110791052, 0.0932521569135953, 0.14013365655584084, 0.1083119187641784, -0.005818298348868397, -0.1064045139044051, 0.03866356203306309, 0.14903051534037984]
|
1,803.09102
|
Managing Large-Scale Transient Data in IoT Systems
|
The pervasive availability of streaming data is driving interest in
distributed Fast Data platforms for streaming applications. Such
latency-sensitive applications need to respond to dynamism in the input rates
and task behavior using scale-in and -out on elastic Cloud resources. Platforms
like Apache Storm do not provide robust capabilities for responding to such
dynamism and for rapid task migration across VMs. We propose several dataflow
checkpoint and migration approaches that allow a running streaming dataflow to
migrate, without any loss of in-flight messages or their internal tasks states,
while reducing the time to recover and stabilize. We implement and evaluate
these migration strategies on Apache Storm using micro and application
dataflows for scaling in and out on up to 2-21 Azure VMs. Our results show that
we can migrate dataflows of large sizes within 50 sec, in comparison to Storm's
default approach that takes over 100 sec. We also find that our approaches
stabilize the application much earlier and there is no failure and
re-processing of messages.
|
cs.DC
|
the pervasive availability of streaming data is driving interest in distributed fast data platforms for streaming applications such latencysensitive applications need to respond to dynamism in the input rates and task behavior using scalein and out on elastic cloud resources platforms like apache storm do not provide robust capabilities for responding to such dynamism and for rapid task migration across vms we propose several dataflow checkpoint and migration approaches that allow a running streaming dataflow to migrate without any loss of inflight messages or their internal tasks states while reducing the time to recover and stabilize we implement and evaluate these migration strategies on apache storm using micro and application dataflows for scaling in and out on up to 221 azure vms our results show that we can migrate dataflows of large sizes within 50 sec in comparison to storms default approach that takes over 100 sec we also find that our approaches stabilize the application much earlier and there is no failure and reprocessing of messages
|
[['the', 'pervasive', 'availability', 'of', 'streaming', 'data', 'is', 'driving', 'interest', 'in', 'distributed', 'fast', 'data', 'platforms', 'for', 'streaming', 'applications', 'such', 'latencysensitive', 'applications', 'need', 'to', 'respond', 'to', 'dynamism', 'in', 'the', 'input', 'rates', 'and', 'task', 'behavior', 'using', 'scalein', 'and', 'out', 'on', 'elastic', 'cloud', 'resources', 'platforms', 'like', 'apache', 'storm', 'do', 'not', 'provide', 'robust', 'capabilities', 'for', 'responding', 'to', 'such', 'dynamism', 'and', 'for', 'rapid', 'task', 'migration', 'across', 'vms', 'we', 'propose', 'several', 'dataflow', 'checkpoint', 'and', 'migration', 'approaches', 'that', 'allow', 'a', 'running', 'streaming', 'dataflow', 'to', 'migrate', 'without', 'any', 'loss', 'of', 'inflight', 'messages', 'or', 'their', 'internal', 'tasks', 'states', 'while', 'reducing', 'the', 'time', 'to', 'recover', 'and', 'stabilize', 'we', 'implement', 'and', 'evaluate', 'these', 'migration', 'strategies', 'on', 'apache', 'storm', 'using', 'micro', 'and', 'application', 'dataflows', 'for', 'scaling', 'in', 'and', 'out', 'on', 'up', 'to', '221', 'azure', 'vms', 'our', 'results', 'show', 'that', 'we', 'can', 'migrate', 'dataflows', 'of', 'large', 'sizes', 'within', '50', 'sec', 'in', 'comparison', 'to', 'storms', 'default', 'approach', 'that', 'takes', 'over', '100', 'sec', 'we', 'also', 'find', 'that', 'our', 'approaches', 'stabilize', 'the', 'application', 'much', 'earlier', 'and', 'there', 'is', 'no', 'failure', 'and', 'reprocessing', 'of', 'messages']]
|
[-0.12241806394370373, 0.08658697666644961, -0.052149611500142044, 0.03691661815036334, -0.08898065349890176, -0.1412740468680524, 0.12288081013000832, 0.4467707417771488, -0.2738572222007784, -0.3582101529742965, 0.13864366290533167, -0.2740335988416197, -0.09999639731078983, 0.2369983514267561, -0.08737248969598935, 0.060210691564186604, 0.10831340414929917, -0.031597391810807715, -0.00360507807348615, -0.26225033474522835, 0.22281406226659942, 0.05889479149273084, 0.2964158510722354, 0.0727018320146658, 0.03867199566510846, -0.01108572013365261, -0.04085227994605185, -0.032092481483510155, -0.07404299434724063, 0.08728861166157308, 0.2828611304842683, 0.21685043060705958, 0.3013608392528788, -0.5138724885300961, -0.18931000800189857, 0.06198271937824473, 0.16701110083788276, 0.05731772254834587, -0.06576318910113998, -0.25125621629092554, 0.14174904918345527, -0.21560776181251345, -0.057731972817710774, -0.13420375084370642, 0.0632902590145251, 0.03514862883505607, -0.2799682736196025, 0.014196999652853547, 0.024232355141621864, 0.06448260890208408, -0.08895088262119871, -0.04948576715005238, 0.02512169055066289, 0.18391004013048184, 0.04688622782140703, 0.009930081799358665, 0.2181807620963918, -0.09004072125328944, -0.132727584770942, 0.4185165885088597, -0.032071715864230195, -0.11957586618923878, 0.2660924019647517, -0.03246638635842654, -0.1490853691172457, 0.097321299083174, 0.27394948600272756, 0.062304337527101, -0.12464917697637024, 0.012979390369421485, 0.05036124134991139, 0.18408127518894965, 0.09155199733217007, 0.018297612407066285, 0.16963200882066062, 0.18280849746333624, 0.0895709146168306, 0.108504290141801, -0.09716150424063964, -0.11478873668656779, -0.20071806399218603, -0.15354226349189343, -0.11713989871180432, 0.0106442341565128, -0.09908181397034507, -0.140693420888633, 0.33269002111098855, 0.2501664334032573, 0.17602154375388548, 0.09761019311632688, 0.3463316758548071, 0.011990728889854101, 0.18153332185674972, 0.19094400621412466, 0.1569318461572071, -0.03442232924740773, 0.2011879736029203, -0.18554019920171022, 0.0833141080192346, -0.054821678768588275]
|
1,803.09103
|
Machine Learning and Applied Linguistics
|
This entry introduces the topic of machine learning and provides an overview
of its relevance for applied linguistics and language learning. The discussion
will focus on giving an introduction to the methods and applications of machine
learning in applied linguistics, and will provide references for further study.
|
cs.CL
|
this entry introduces the topic of machine learning and provides an overview of its relevance for applied linguistics and language learning the discussion will focus on giving an introduction to the methods and applications of machine learning in applied linguistics and will provide references for further study
|
[['this', 'entry', 'introduces', 'the', 'topic', 'of', 'machine', 'learning', 'and', 'provides', 'an', 'overview', 'of', 'its', 'relevance', 'for', 'applied', 'linguistics', 'and', 'language', 'learning', 'the', 'discussion', 'will', 'focus', 'on', 'giving', 'an', 'introduction', 'to', 'the', 'methods', 'and', 'applications', 'of', 'machine', 'learning', 'in', 'applied', 'linguistics', 'and', 'will', 'provide', 'references', 'for', 'further', 'study']]
|
[-0.010058782439916692, 0.01930222312109842, -0.09933996390789113, 0.059742678182219414, -0.17027795774505494, -0.1351718258489161, 0.026352440680753677, 0.3753163010833111, -0.2550912152262444, -0.30072978961261665, 0.10255076059269065, -0.25330358553440013, -0.16434762983563098, 0.25563266013372454, -0.16820482766017952, 0.008187743853728108, 0.10240368703578381, 0.1206228899468539, -0.07524991863248671, -0.2817278829740083, 0.2902741633910448, 0.07606840898540426, 0.3510345310775286, 0.12026994429687236, 0.08313164798582488, 0.04082994364162392, -0.14187264959625107, -0.04198013678034569, -0.17444312887543695, 0.27266440124429286, 0.3977806899458804, 0.3002199081882359, 0.41376502574124235, -0.4145118730499389, -0.1884294129273993, 0.03797528046143658, 0.15175725230352677, 0.13566993537576907, -0.12868491026444084, -0.3069669484616594, 0.013468220324671648, -0.17587531039843018, -0.006570561808791567, -0.1935666715329949, 0.04233155338133269, -0.00512618294600001, -0.20410231241034937, -0.07504295210968306, 0.14653009243626544, 0.20232508030343563, -0.017386304314292847, -0.17996159164195366, 0.1583776590513422, 0.15118503521018206, 0.09332038505755841, 0.08012206290174831, 0.13025728581433602, -0.1975720411790733, -0.20300160589172167, 0.4173552576214709, -0.04492451589396025, -0.17013935713057823, 0.21881320888295452, 0.05072193408503811, -0.2033145392779261, 0.00444111547016717, 0.3062517649315773, 0.03869313215638729, -0.14632412807104436, 0.10071896531302085, 0.07961901867801839, 0.13831129771201534, 0.007952456897560587, -0.03383289107141343, 0.24078083305837625, 0.2828107922476657, 0.027498080989623322, 0.182753897093712, -0.07110568888465617, -0.07214822441815062, -0.2826028891858902, -0.16237994810526676, -0.13017250409230907, -0.02887359791574009, -0.00839188793906942, -0.13788028636035768, 0.41765597573620206, 0.24813606811964767, 0.1323967059638272, 0.033569634882138766, 0.26402275739832126, 0.06582444038321363, 0.01580061765878085, 0.04992554288238604, 0.16752130415369856, 0.13490549566105325, 0.24042873319357316, -0.13828602443112337, 0.036232484217257575, 0.022620001391686025]
|
1,803.09104
|
Measuring the academic reputation through citation networks via PageRank
|
The objective assessment of the prestige of an academic institution is a
difficult and hotly debated task. In the last few years, different types of
University Rankings have been proposed to quantify the excellence of different
research institutions in the world. Albeit met with criticism in some cases,
the relevance of university rankings is being increasingly acknowledged:
indeed, rankings are having a major impact on the design of research policies,
both at the institutional and governmental level. Yet, the debate on what
rankings are {\em exactly} measuring is enduring. Here, we address the issue by
measuring a quantitive and reliable proxy of the academic reputation of a given
institution and by evaluating its correlation with different university
rankings. Specifically, we study citation patterns among universities in five
different Web of Science Subject Categories and use the \pr~algorithm on the
five resulting citation networks. The rationale behind our work is that
scientific citations are driven by the reputation of the reference so that the
PageRank algorithm is expected to yield a rank which reflects the reputation of
an academic institution in a specific field. Our results allow to quantifying
the prestige of a set of institutions in a certain research field based only on
hard bibliometric data. Given the volume of the data analysed, our findings are
statistically robust and less prone to bias, at odds with ad--hoc surveys often
employed by ranking bodies in order to attain similar results. Because our
findings are found to correlate extremely well with the ARWU Subject rankings,
the approach we propose in our paper may open the door to new, Academic Ranking
methodologies that go beyond current methods by reconciling the qualitative
evaluation of Academic Prestige with its quantitative measurements via
publication impact.
|
cs.DL cs.SI physics.soc-ph
|
the objective assessment of the prestige of an academic institution is a difficult and hotly debated task in the last few years different types of university rankings have been proposed to quantify the excellence of different research institutions in the world albeit met with criticism in some cases the relevance of university rankings is being increasingly acknowledged indeed rankings are having a major impact on the design of research policies both at the institutional and governmental level yet the debate on what rankings are em exactly measuring is enduring here we address the issue by measuring a quantitive and reliable proxy of the academic reputation of a given institution and by evaluating its correlation with different university rankings specifically we study citation patterns among universities in five different web of science subject categories and use the pralgorithm on the five resulting citation networks the rationale behind our work is that scientific citations are driven by the reputation of the reference so that the pagerank algorithm is expected to yield a rank which reflects the reputation of an academic institution in a specific field our results allow to quantifying the prestige of a set of institutions in a certain research field based only on hard bibliometric data given the volume of the data analysed our findings are statistically robust and less prone to bias at odds with adhoc surveys often employed by ranking bodies in order to attain similar results because our findings are found to correlate extremely well with the arwu subject rankings the approach we propose in our paper may open the door to new academic ranking methodologies that go beyond current methods by reconciling the qualitative evaluation of academic prestige with its quantitative measurements via publication impact
|
[['the', 'objective', 'assessment', 'of', 'the', 'prestige', 'of', 'an', 'academic', 'institution', 'is', 'a', 'difficult', 'and', 'hotly', 'debated', 'task', 'in', 'the', 'last', 'few', 'years', 'different', 'types', 'of', 'university', 'rankings', 'have', 'been', 'proposed', 'to', 'quantify', 'the', 'excellence', 'of', 'different', 'research', 'institutions', 'in', 'the', 'world', 'albeit', 'met', 'with', 'criticism', 'in', 'some', 'cases', 'the', 'relevance', 'of', 'university', 'rankings', 'is', 'being', 'increasingly', 'acknowledged', 'indeed', 'rankings', 'are', 'having', 'a', 'major', 'impact', 'on', 'the', 'design', 'of', 'research', 'policies', 'both', 'at', 'the', 'institutional', 'and', 'governmental', 'level', 'yet', 'the', 'debate', 'on', 'what', 'rankings', 'are', 'em', 'exactly', 'measuring', 'is', 'enduring', 'here', 'we', 'address', 'the', 'issue', 'by', 'measuring', 'a', 'quantitive', 'and', 'reliable', 'proxy', 'of', 'the', 'academic', 'reputation', 'of', 'a', 'given', 'institution', 'and', 'by', 'evaluating', 'its', 'correlation', 'with', 'different', 'university', 'rankings', 'specifically', 'we', 'study', 'citation', 'patterns', 'among', 'universities', 'in', 'five', 'different', 'web', 'of', 'science', 'subject', 'categories', 'and', 'use', 'the', 'pralgorithm', 'on', 'the', 'five', 'resulting', 'citation', 'networks', 'the', 'rationale', 'behind', 'our', 'work', 'is', 'that', 'scientific', 'citations', 'are', 'driven', 'by', 'the', 'reputation', 'of', 'the', 'reference', 'so', 'that', 'the', 'pagerank', 'algorithm', 'is', 'expected', 'to', 'yield', 'a', 'rank', 'which', 'reflects', 'the', 'reputation', 'of', 'an', 'academic', 'institution', 'in', 'a', 'specific', 'field', 'our', 'results', 'allow', 'to', 'quantifying', 'the', 'prestige', 'of', 'a', 'set', 'of', 'institutions', 'in', 'a', 'certain', 'research', 'field', 'based', 'only', 'on', 'hard', 'bibliometric', 'data', 'given', 'the', 'volume', 'of', 'the', 'data', 'analysed', 'our', 'findings', 'are', 'statistically', 'robust', 'and', 'less', 'prone', 'to', 'bias', 'at', 'odds', 'with', 'adhoc', 'surveys', 'often', 'employed', 'by', 'ranking', 'bodies', 'in', 'order', 'to', 'attain', 'similar', 'results', 'because', 'our', 'findings', 'are', 'found', 'to', 'correlate', 'extremely', 'well', 'with', 'the', 'arwu', 'subject', 'rankings', 'the', 'approach', 'we', 'propose', 'in', 'our', 'paper', 'may', 'open', 'the', 'door', 'to', 'new', 'academic', 'ranking', 'methodologies', 'that', 'go', 'beyond', 'current', 'methods', 'by', 'reconciling', 'the', 'qualitative', 'evaluation', 'of', 'academic', 'prestige', 'with', 'its', 'quantitative', 'measurements', 'via', 'publication', 'impact']]
|
[-0.06885181675614957, 0.052583282109379875, -0.07275823380566887, 0.09969299896692974, -0.1199588255072336, -0.11351098621283502, 0.09457143900645962, 0.4072626586870077, -0.17470775864138785, -0.36544426229536636, 0.08507458571956603, -0.3251437982039028, -0.1334222564797124, 0.19030769738310482, -0.11092601951774365, 0.024970079047408136, 0.069447604651537, 0.05767923438907019, -0.004909840519960401, -0.3429873396008689, 0.3444815320860168, 0.1053547162009636, 0.36278213511104695, 0.09768100574567345, 0.03399127264411719, -0.057610156867465574, -0.1317779601900434, 0.061839747046627105, -0.10469808670998443, 0.18120350433714016, 0.36123917524107835, 0.20555872265362674, 0.40818839815134805, -0.3678110207385746, -0.1359410006480175, 0.07389989196801455, 0.08372260973293225, 0.06276485565912379, -0.03672418034208628, -0.3205440839584399, 0.04254827187428924, -0.22255756182130426, -0.06272919009077466, -0.07782474923927414, 0.03841804471085197, 0.0303601179002726, -0.1874727673073519, 0.03362686009333831, -0.00010372133369350599, 0.14859630703641516, -0.03838853865979925, -0.15194138323972262, 0.012488591314144691, 0.19480383008501828, 0.11641446827363527, 0.03250762956435614, 0.15326172695414345, -0.15715880103056812, -0.17262580618120815, 0.4009618931902676, -0.006385958881663909, -0.16315416197256935, 0.1916111099510292, -0.12788404013897686, -0.16289957080071973, 0.04063074563964619, 0.2070261305392099, 0.049370415246913685, -0.18451017875405443, -0.008144672708213976, -0.03049356742283433, 0.15531906797453607, 0.053159791464471105, -0.025842754926998168, 0.21680558199134087, 0.17987095580853443, 0.04716252992147929, 0.08735794820495357, -0.027926737845215637, -0.1044330267146102, -0.22058205479859477, -0.11435812160521487, -0.16603414211567724, 0.01103491192690045, -0.07170127323570341, -0.1719913905772551, 0.43667260982733247, 0.20739050701745831, 0.12236307825797768, 0.013898268909947041, 0.2903698252840614, 0.03838503362875498, 0.07413202800348194, 0.07295621441375665, 0.2461439448885964, 0.03728317876407851, 0.15970267901623933, -0.12954142506431607, 0.17635885104795712, -0.018841306585171778]
|
1,803.09105
|
Instability of Supersonic Cold Streams Feeding Galaxies II. Nonlinear
Evolution of Surface and Body Modes of Kelvin-Helmholtz Instability
|
As part of our long-term campaign to understand how cold streams feed massive
galaxies at high redshift, we study the Kelvin-Helmholtz instability (KHI) of a
supersonic, cold, dense gas stream as it penetrates through a hot, dilute
circumgalactic medium (CGM). A linear analysis (Paper I) showed that, for
realistic conditions, KHI may produce nonlinear perturbations to the stream
during infall. Therefore, we proceed here to study the nonlinear stage of KHI,
still limited to a two-dimensional slab with no radiative cooling or gravity.
Using analytic models and numerical simulations, we examine stream breakup,
deceleration and heating via surface modes and body modes. The relevant
parameters are the density contrast between stream and CGM ($\delta$), the Mach
number of the stream velocity with respect to the CGM ($M_{\rm b}$) and the
stream radius relative to the halo virial radius ($R_{\rm s}/R_{\rm v}$). We
find that sufficiently thin streams disintegrate prior to reaching the central
galaxy. The condition for breakup ranges from $R_{\rm s} < 0.03 R_{\rm v}$ for
$(M_{\rm b} \sim 0.75, \delta \sim 10)$ to $R_{\rm s} < 0.003 R_{\rm v}$ for
$(M_{\rm b} \sim 2.25, \delta \sim 100)$. However, due to the large stream
inertia, KHI has only a small effect on the stream inflow rate and a small
contribution to heating and subsequent Lyman-$\alpha$ cooling emission.
|
astro-ph.GA
|
as part of our longterm campaign to understand how cold streams feed massive galaxies at high redshift we study the kelvinhelmholtz instability khi of a supersonic cold dense gas stream as it penetrates through a hot dilute circumgalactic medium cgm a linear analysis paper i showed that for realistic conditions khi may produce nonlinear perturbations to the stream during infall therefore we proceed here to study the nonlinear stage of khi still limited to a twodimensional slab with no radiative cooling or gravity using analytic models and numerical simulations we examine stream breakup deceleration and heating via surface modes and body modes the relevant parameters are the density contrast between stream and cgm delta the mach number of the stream velocity with respect to the cgm m_rm b and the stream radius relative to the halo virial radius r_rm sr_rm v we find that sufficiently thin streams disintegrate prior to reaching the central galaxy the condition for breakup ranges from r_rm s 003 r_rm v for m_rm b sim 075 delta sim 10 to r_rm s 0003 r_rm v for m_rm b sim 225 delta sim 100 however due to the large stream inertia khi has only a small effect on the stream inflow rate and a small contribution to heating and subsequent lymanalpha cooling emission
|
[['as', 'part', 'of', 'our', 'longterm', 'campaign', 'to', 'understand', 'how', 'cold', 'streams', 'feed', 'massive', 'galaxies', 'at', 'high', 'redshift', 'we', 'study', 'the', 'kelvinhelmholtz', 'instability', 'khi', 'of', 'a', 'supersonic', 'cold', 'dense', 'gas', 'stream', 'as', 'it', 'penetrates', 'through', 'a', 'hot', 'dilute', 'circumgalactic', 'medium', 'cgm', 'a', 'linear', 'analysis', 'paper', 'i', 'showed', 'that', 'for', 'realistic', 'conditions', 'khi', 'may', 'produce', 'nonlinear', 'perturbations', 'to', 'the', 'stream', 'during', 'infall', 'therefore', 'we', 'proceed', 'here', 'to', 'study', 'the', 'nonlinear', 'stage', 'of', 'khi', 'still', 'limited', 'to', 'a', 'twodimensional', 'slab', 'with', 'no', 'radiative', 'cooling', 'or', 'gravity', 'using', 'analytic', 'models', 'and', 'numerical', 'simulations', 'we', 'examine', 'stream', 'breakup', 'deceleration', 'and', 'heating', 'via', 'surface', 'modes', 'and', 'body', 'modes', 'the', 'relevant', 'parameters', 'are', 'the', 'density', 'contrast', 'between', 'stream', 'and', 'cgm', 'delta', 'the', 'mach', 'number', 'of', 'the', 'stream', 'velocity', 'with', 'respect', 'to', 'the', 'cgm', 'm_rm', 'b', 'and', 'the', 'stream', 'radius', 'relative', 'to', 'the', 'halo', 'virial', 'radius', 'r_rm', 'sr_rm', 'v', 'we', 'find', 'that', 'sufficiently', 'thin', 'streams', 'disintegrate', 'prior', 'to', 'reaching', 'the', 'central', 'galaxy', 'the', 'condition', 'for', 'breakup', 'ranges', 'from', 'r_rm', 's', '003', 'r_rm', 'v', 'for', 'm_rm', 'b', 'sim', '075', 'delta', 'sim', '10', 'to', 'r_rm', 's', '0003', 'r_rm', 'v', 'for', 'm_rm', 'b', 'sim', '225', 'delta', 'sim', '100', 'however', 'due', 'to', 'the', 'large', 'stream', 'inertia', 'khi', 'has', 'only', 'a', 'small', 'effect', 'on', 'the', 'stream', 'inflow', 'rate', 'and', 'a', 'small', 'contribution', 'to', 'heating', 'and', 'subsequent', 'lymanalpha', 'cooling', 'emission']]
|
[-0.11105565273576568, 0.15465053948465474, -0.034557484913357465, 0.04998595196385543, -0.09020292997836721, -0.07826620247648206, 0.0365240432067536, 0.3519209949711208, -0.24653519733354104, -0.3130287222640026, 0.04504065663921972, -0.3141912219612751, 0.030304395852523834, 0.18492683950638356, 0.011513885593604903, 0.0071727266643456244, 0.05930970667558181, -0.07238250383024299, -0.029799611887523666, -0.2086064640237668, 0.26966233066673023, 0.07837905743007743, 0.14984044804952518, 0.027263465195726387, 0.034876043429641526, -0.0933403178204804, -0.013689804555804923, 0.0017081949188438958, -0.22619494881276528, -0.04408210632472494, 0.19596253537106242, 0.08628743124995814, 0.2898881582153398, -0.42663686589316224, -0.21694634083812775, 0.033588607260567505, 0.2005776468415333, 0.0436902723664981, -0.07316122297901487, -0.23312666714841196, 0.08895723379412016, -0.23135830816856132, -0.1455225269169395, 0.04812204582660004, 0.12612384097260793, -0.005809989353360305, -0.30311697683064265, 0.19854989593718633, 0.02920030865152935, 0.03246042660957332, -0.05165138494475138, -0.05244910980163272, -0.07413541418283658, 0.0015277157402272489, 0.05408179929783178, 0.10659326510855842, 0.2498107923519646, -0.1309293872611814, 0.082775955681884, 0.4331097010003273, -0.10427526025058226, -0.03426021832626226, 0.2357227502607329, -0.21556448544873746, -0.07199650258421465, 0.14405666216449856, 0.23820690744161216, 0.08161572211768565, -0.07771372917693022, -0.015891438897774925, -0.037759436916040126, 0.22491203716544564, 0.09048121726400284, -0.0018450878099619606, 0.2939641768416, 0.12632026483662168, 0.02567534227314037, 0.03653499626576207, -0.20461932958840112, -0.0170779031181578, -0.2653082193330277, -0.10259908405240885, -0.0936793046678568, 0.045736329686871274, -0.1502100774212226, -0.09987258351039748, 0.30225878566676795, 0.14646723308589657, 0.2817144066181987, 0.032031069886545804, 0.34666328938721225, 0.08486174341903047, 0.08519275385729405, 0.1853311871860696, 0.256446297076899, 0.2189100491186214, 0.08528930558938111, -0.28733971101058603, 0.03173499326546525, 0.006929250937604973]
|
1,803.09106
|
Statistical analysis with cosmic-expansion-rate measurements and
two-point diagnostics
|
Direct measurements of Hubble parameters $H(z)$ are very useful for
cosmological model parameters inference. Based on them, Sahni, Shafieloo and
Starobinski introduced a two-point diagnostic $Omh^2(z_i, z_j)$ as an
interesting tool for testing the validity of the $\Lambda$CDM model. Applying
this test they found a tension between observations and predictions of the
$\Lambda$CDM model. We use the most comprehensive compilation $H(z)$ data from
baryon acoustic oscillations (BAO) and differential ages (DA) of passively
evolving galaxies to study cosmological models using the Hubble parameters
itself and to distinguish whether $\Lambda$CDM model is consistent with the
observational data with statistical analysis of the corresponding $Omh^2(z_i,
z_j)$ two-point diagnostics. Our results show that presently available $H(z)$
data significantly improve the constraints on cosmological parameters. The
corresponding statistical $Omh^2(z_i, z_j)$ two-point diagnostics seems to
prefer the quintessence with $w>-1$ over the $\Lambda$CDM model. Better and
more accurate prior knowledge of the Hubble constant, will considerably improve
the performance of the statistical $Omh^2(z_i, z_j)$ method.
|
astro-ph.CO
|
direct measurements of hubble parameters hz are very useful for cosmological model parameters inference based on them sahni shafieloo and starobinski introduced a twopoint diagnostic omh2z_i z_j as an interesting tool for testing the validity of the lambdacdm model applying this test they found a tension between observations and predictions of the lambdacdm model we use the most comprehensive compilation hz data from baryon acoustic oscillations bao and differential ages da of passively evolving galaxies to study cosmological models using the hubble parameters itself and to distinguish whether lambdacdm model is consistent with the observational data with statistical analysis of the corresponding omh2z_i z_j twopoint diagnostics our results show that presently available hz data significantly improve the constraints on cosmological parameters the corresponding statistical omh2z_i z_j twopoint diagnostics seems to prefer the quintessence with w1 over the lambdacdm model better and more accurate prior knowledge of the hubble constant will considerably improve the performance of the statistical omh2z_i z_j method
|
[['direct', 'measurements', 'of', 'hubble', 'parameters', 'hz', 'are', 'very', 'useful', 'for', 'cosmological', 'model', 'parameters', 'inference', 'based', 'on', 'them', 'sahni', 'shafieloo', 'and', 'starobinski', 'introduced', 'a', 'twopoint', 'diagnostic', 'omh2z_i', 'z_j', 'as', 'an', 'interesting', 'tool', 'for', 'testing', 'the', 'validity', 'of', 'the', 'lambdacdm', 'model', 'applying', 'this', 'test', 'they', 'found', 'a', 'tension', 'between', 'observations', 'and', 'predictions', 'of', 'the', 'lambdacdm', 'model', 'we', 'use', 'the', 'most', 'comprehensive', 'compilation', 'hz', 'data', 'from', 'baryon', 'acoustic', 'oscillations', 'bao', 'and', 'differential', 'ages', 'da', 'of', 'passively', 'evolving', 'galaxies', 'to', 'study', 'cosmological', 'models', 'using', 'the', 'hubble', 'parameters', 'itself', 'and', 'to', 'distinguish', 'whether', 'lambdacdm', 'model', 'is', 'consistent', 'with', 'the', 'observational', 'data', 'with', 'statistical', 'analysis', 'of', 'the', 'corresponding', 'omh2z_i', 'z_j', 'twopoint', 'diagnostics', 'our', 'results', 'show', 'that', 'presently', 'available', 'hz', 'data', 'significantly', 'improve', 'the', 'constraints', 'on', 'cosmological', 'parameters', 'the', 'corresponding', 'statistical', 'omh2z_i', 'z_j', 'twopoint', 'diagnostics', 'seems', 'to', 'prefer', 'the', 'quintessence', 'with', 'w1', 'over', 'the', 'lambdacdm', 'model', 'better', 'and', 'more', 'accurate', 'prior', 'knowledge', 'of', 'the', 'hubble', 'constant', 'will', 'considerably', 'improve', 'the', 'performance', 'of', 'the', 'statistical', 'omh2z_i', 'z_j', 'method']]
|
[-0.02798384696361609, 0.04121067007299643, -0.10313654947094619, 0.12289836249547079, -0.172148414660478, -0.1660078863322269, 0.030380450407392345, 0.31784226349554956, -0.1825457630598976, -0.3182909566559829, 0.06001206307118991, -0.2764174677111441, -0.035558745090384036, 0.2537807839733432, 0.010156071018718649, 0.05109337864632835, 0.0897527058958076, -0.019985721056582407, -0.06664727412353386, -0.27220099969999867, 0.28571780637721533, 0.12425832914886996, 0.2797045031653397, -0.07330256991554052, 0.04929036040775827, -0.09962894220370799, -0.11637927982665133, -0.002303371979360236, -0.27557412301352996, 0.04836440473736729, 0.22818398390620587, 0.21354997442686, 0.21336353113583756, -0.33985588865416505, -0.23048043028102255, 0.1326517406705534, 0.15332228202896658, 0.09760195842536631, 0.0030839485897558917, -0.3002528511104174, 0.025449908486916684, -0.1535380118089961, -0.08502593296580016, -0.06755155199207366, -0.03118393544573337, -0.01277753561953432, -0.30396434030262753, 0.19611977956665214, -0.0626396827694407, 0.026482626888900997, -0.09605346594908042, -0.14006850445875899, -0.032346876458905174, 0.06797811549913604, 0.05637067385177943, 0.07050754373340169, 0.11669874843209982, -0.14499235137336655, -0.058687594029470345, 0.38810145679235575, -0.10882563335762825, -0.13219198608130683, 0.16177790370056755, -0.13615846685715952, -0.15074812528037002, 0.002571449714014307, 0.11424325308180414, 0.04246905749023426, -0.17312806075788104, 0.0977786001003551, 0.039282047629239966, 0.2289634977991227, 0.024435609005740842, -0.030113949661608786, 0.2436791114290827, 0.1467748107512307, -0.00725860676029697, 0.02170077440823661, -0.11877629231476021, -0.015637052615056747, -0.30129019753076136, -0.08196953953365664, -0.15256625040783547, 0.041635524768935284, -0.2091342495875324, -0.15718497333000414, 0.3722553019004408, 0.21993396551770275, 0.21193314220872708, 0.10659950812259922, 0.34426523051952246, 0.017906016505571644, 0.04607062099021277, 0.04509145791671472, 0.2890225280279992, 0.1383722974016564, 0.08793362112119212, -0.2109605828722124, 0.04870458724035416, -0.018539656008942983]
|
1,803.09107
|
Conscious Perception: Time for an Update?
|
Understanding the neural mechanism underlying subjective representation has
become a central endeavor in cognitive-neuroscience. In theories of conscious
perception, stimulus gaining conscious access is usually considered as a
discrete neuronal event to be characterized in time or space, sometimes refer
to as a 'conscious episode'. Surprisingly, the alternative hypothesis according
to which conscious perception is a dynamic process has been rarely considered.
Here, we discuss this hypothesis and envisage its implications. We show how it
can reconcile inconsistent empirical findings on the timing of the neural
correlates of consciousness (NCCs), and make testable predictions. According to
this hypothesis, a stimulus is consciously perceived for as long as it is
recoded to fit an ongoing stream composed of all other perceived stimuli. We
suggest that this 'updating' process is governed by at least three factors (1)
context, (2) stimulus saliency and (3) observer's goal. Finally, this framework
forces us to reconsider the typical distinction between conscious and
unconscious information processing.
|
q-bio.NC
|
understanding the neural mechanism underlying subjective representation has become a central endeavor in cognitiveneuroscience in theories of conscious perception stimulus gaining conscious access is usually considered as a discrete neuronal event to be characterized in time or space sometimes refer to as a conscious episode surprisingly the alternative hypothesis according to which conscious perception is a dynamic process has been rarely considered here we discuss this hypothesis and envisage its implications we show how it can reconcile inconsistent empirical findings on the timing of the neural correlates of consciousness nccs and make testable predictions according to this hypothesis a stimulus is consciously perceived for as long as it is recoded to fit an ongoing stream composed of all other perceived stimuli we suggest that this updating process is governed by at least three factors 1 context 2 stimulus saliency and 3 observers goal finally this framework forces us to reconsider the typical distinction between conscious and unconscious information processing
|
[['understanding', 'the', 'neural', 'mechanism', 'underlying', 'subjective', 'representation', 'has', 'become', 'a', 'central', 'endeavor', 'in', 'cognitiveneuroscience', 'in', 'theories', 'of', 'conscious', 'perception', 'stimulus', 'gaining', 'conscious', 'access', 'is', 'usually', 'considered', 'as', 'a', 'discrete', 'neuronal', 'event', 'to', 'be', 'characterized', 'in', 'time', 'or', 'space', 'sometimes', 'refer', 'to', 'as', 'a', 'conscious', 'episode', 'surprisingly', 'the', 'alternative', 'hypothesis', 'according', 'to', 'which', 'conscious', 'perception', 'is', 'a', 'dynamic', 'process', 'has', 'been', 'rarely', 'considered', 'here', 'we', 'discuss', 'this', 'hypothesis', 'and', 'envisage', 'its', 'implications', 'we', 'show', 'how', 'it', 'can', 'reconcile', 'inconsistent', 'empirical', 'findings', 'on', 'the', 'timing', 'of', 'the', 'neural', 'correlates', 'of', 'consciousness', 'nccs', 'and', 'make', 'testable', 'predictions', 'according', 'to', 'this', 'hypothesis', 'a', 'stimulus', 'is', 'consciously', 'perceived', 'for', 'as', 'long', 'as', 'it', 'is', 'recoded', 'to', 'fit', 'an', 'ongoing', 'stream', 'composed', 'of', 'all', 'other', 'perceived', 'stimuli', 'we', 'suggest', 'that', 'this', 'updating', 'process', 'is', 'governed', 'by', 'at', 'least', 'three', 'factors', '1', 'context', '2', 'stimulus', 'saliency', 'and', '3', 'observers', 'goal', 'finally', 'this', 'framework', 'forces', 'us', 'to', 'reconsider', 'the', 'typical', 'distinction', 'between', 'conscious', 'and', 'unconscious', 'information', 'processing']]
|
[-0.06455925038331954, 0.12701982902622666, -0.1180506473218527, 0.129350013514916, -0.1333940772699263, -0.18366301435199153, 0.0416366379520903, 0.43758611839641876, -0.2545030370614008, -0.3062261200533543, 0.0899484954587231, -0.23904236488315406, -0.23584336052866817, 0.127764234995717, -0.1502716500957532, 0.016335000364696373, 0.02736962931982206, 0.08721976106562003, 0.01758780037760263, -0.2086476925701563, 0.2748230819964687, 0.09168014637064896, 0.29424999431335613, 0.017038251152866273, 0.11311054239167442, -0.03428157970539141, -0.07436019700621785, -0.0195486523822367, -0.05451102320811618, 0.10167753991974471, 0.30524894311770656, 0.23371684502462467, 0.3448993899753388, -0.44872627070150045, -0.22841858284111735, 0.09002752992902187, 0.1459255514119728, 0.06994659793279517, 0.003430466231730873, -0.30892299684692953, 0.06439303944095132, -0.19584036695688398, -0.09439332738424404, -0.05590104669497549, 0.06651900154597397, -0.05875982902317803, -0.24047582427369832, 0.06069178235366398, 0.07306934142473472, 0.08336458653447372, -0.09034843389549045, -0.028010911277283123, 0.021595643971799108, 0.1691967359039626, 0.09026380180185248, 0.07995809941873827, 0.17881050371399881, -0.1486783484586432, -0.17907377265252267, 0.3749065243910196, 0.0035042299242849357, -0.19025156526130776, 0.23681785885680798, -0.11254294134055329, -0.15319994902474027, 0.04380375508932232, 0.14266881139807497, 0.03400398179582214, -0.17172149386510394, -0.03828975897064268, -0.01239065123468496, 0.2079203471399938, 0.05673009466344514, 0.04391991390988136, 0.27277746283201665, 0.22728893912435638, 0.003920988713190714, 0.09140856094220712, -0.01042385675128007, -0.0884485922966011, -0.2802852835002226, -0.13210118923902134, -0.16467869194457307, 0.06358243444716392, -0.03499881582997026, -0.10916857413735383, 0.35149854536262587, 0.20371278756463168, 0.20983208453907526, 0.0543057477430299, 0.2782835376366407, 0.08431941640115331, 0.08007370160385684, 0.04076894213404224, 0.22945090808428212, 0.06550752654630408, 0.11536945746563186, -0.1554202323755886, 0.18004314412062256, -0.010470963027210364]
|
1,803.09108
|
Controlling diffraction patterns with metagratings
|
In this study we elaborate on the recent concept of metagratings proposed in
Ra'di et al. [Phys. Rev. Lett. 119, 067404 (2017)] for efficient manipulation
of reflected waves. Basically, a metagrating is a set of 1D arrays of
polarization line currents which are engineered to cancel scattering in
undesirable diffraction orders. We consider a general case of metagratings
composed of N polarization electric line currents per supercell. This
generalization is a necessary step to totally control diffraction patterns. We
show that a metagrating having N equal to the number of plane waves scattered
in the far-field can be used for controlling the diffraction pattern. To
validate the developed theoretical approach, anomalous and multichannel
reflections are demonstrated with 3D full-wave simulations in the microwave
regime at 10 GHz. The results can be interesting for the metamaterials
community as allow one to significantly decrease the number of used elements
and simplify the design of wavefront manipulation devices, what is very
convenient for optical and infra-red frequency ranges. Our findings also may
serve as a way for development of efficient tunable antennas in the microwave
domain.
|
physics.app-ph
|
in this study we elaborate on the recent concept of metagratings proposed in radi et al phys rev lett 119 067404 2017 for efficient manipulation of reflected waves basically a metagrating is a set of 1d arrays of polarization line currents which are engineered to cancel scattering in undesirable diffraction orders we consider a general case of metagratings composed of n polarization electric line currents per supercell this generalization is a necessary step to totally control diffraction patterns we show that a metagrating having n equal to the number of plane waves scattered in the farfield can be used for controlling the diffraction pattern to validate the developed theoretical approach anomalous and multichannel reflections are demonstrated with 3d fullwave simulations in the microwave regime at 10 ghz the results can be interesting for the metamaterials community as allow one to significantly decrease the number of used elements and simplify the design of wavefront manipulation devices what is very convenient for optical and infrared frequency ranges our findings also may serve as a way for development of efficient tunable antennas in the microwave domain
|
[['in', 'this', 'study', 'we', 'elaborate', 'on', 'the', 'recent', 'concept', 'of', 'metagratings', 'proposed', 'in', 'radi', 'et', 'al', 'phys', 'rev', 'lett', '119', '067404', '2017', 'for', 'efficient', 'manipulation', 'of', 'reflected', 'waves', 'basically', 'a', 'metagrating', 'is', 'a', 'set', 'of', '1d', 'arrays', 'of', 'polarization', 'line', 'currents', 'which', 'are', 'engineered', 'to', 'cancel', 'scattering', 'in', 'undesirable', 'diffraction', 'orders', 'we', 'consider', 'a', 'general', 'case', 'of', 'metagratings', 'composed', 'of', 'n', 'polarization', 'electric', 'line', 'currents', 'per', 'supercell', 'this', 'generalization', 'is', 'a', 'necessary', 'step', 'to', 'totally', 'control', 'diffraction', 'patterns', 'we', 'show', 'that', 'a', 'metagrating', 'having', 'n', 'equal', 'to', 'the', 'number', 'of', 'plane', 'waves', 'scattered', 'in', 'the', 'farfield', 'can', 'be', 'used', 'for', 'controlling', 'the', 'diffraction', 'pattern', 'to', 'validate', 'the', 'developed', 'theoretical', 'approach', 'anomalous', 'and', 'multichannel', 'reflections', 'are', 'demonstrated', 'with', '3d', 'fullwave', 'simulations', 'in', 'the', 'microwave', 'regime', 'at', '10', 'ghz', 'the', 'results', 'can', 'be', 'interesting', 'for', 'the', 'metamaterials', 'community', 'as', 'allow', 'one', 'to', 'significantly', 'decrease', 'the', 'number', 'of', 'used', 'elements', 'and', 'simplify', 'the', 'design', 'of', 'wavefront', 'manipulation', 'devices', 'what', 'is', 'very', 'convenient', 'for', 'optical', 'and', 'infrared', 'frequency', 'ranges', 'our', 'findings', 'also', 'may', 'serve', 'as', 'a', 'way', 'for', 'development', 'of', 'efficient', 'tunable', 'antennas', 'in', 'the', 'microwave', 'domain']]
|
[-0.14517932880710996, 0.13636122235400572, -0.020950492746736958, -0.029460621970700544, -0.10058656538378714, -0.10671053105934385, 0.04834063632737907, 0.4120147941551732, -0.20575793175983825, -0.3122509345875343, 0.0417520721707987, -0.2690482828586018, -0.17594038436985387, 0.25266930709325436, -0.04600058205281667, 0.06148779973386432, 0.009005542381445348, -0.07218092828423031, -0.007953303648694033, -0.2010212982220071, 0.2196530904260706, 0.07893731464369438, 0.3271659188492234, 0.053840630735529235, 0.050058503889926394, 0.039249972787618805, -0.010530145483822124, 0.02041277884973923, -0.09356171071024653, 0.1138889784564506, 0.2855226218865063, 0.056744728221954234, 0.19715255553106062, -0.4596569674470313, -0.23936247338350472, 0.06408314111009651, 0.14343884042772923, 0.1438964161840499, -0.05051619249900278, -0.2755371952900221, 0.07234525258230941, -0.1301217411300013, -0.1812214306053205, -0.0854692724745628, 0.02922059613851141, 0.018140008988550952, -0.3027931039082658, 0.026481777438424395, 0.038860325915070035, 0.04676350216982302, 0.001577338505036568, -0.08239075805906988, 0.017024221168882445, 0.07059806300255146, -0.04678122207679328, 0.020047677480821494, 0.11609635346193505, -0.07257436522416441, -0.14653919296575843, 0.3690381207071162, -0.0359899518941915, -0.17554127905538397, 0.1736968313253778, -0.152288064396315, -0.07391113204397878, 0.15486178575443793, 0.20710672921300427, 0.13586873848516062, -0.1313223158393971, 0.04640836930269046, -0.046262210608686405, 0.1837949485238899, 0.14031030857532034, 0.05897422577286633, 0.22757200991415846, 0.1699729163343735, 0.040542148310917514, 0.14480590022513798, -0.11588244326091088, -0.014767554237761982, -0.2788182325784673, -0.13913717985317853, -0.1864588313873662, 0.04536800447450076, -0.039243627232592684, -0.13875571637573905, 0.3915536855630453, 0.1923885309781869, 0.16256165198302566, -0.01355310101370785, 0.3083320853830372, 0.10669110662335059, 0.06068888011784679, 0.048469571356831415, 0.26208032848241414, 0.15263833968967036, 0.12938550246611896, -0.219418667097967, -0.0024681721720072694, -0.0019139140916381093]
|
1,803.09109
|
DeepWarp: DNN-based Nonlinear Deformation
|
DeepWarp is an efficient and highly re-usable deep neural network (DNN) based
nonlinear deformable simulation framework. Unlike other deep learning
applications such as image recognition, where different inputs have a uniform
and consistent format (e.g. an array of all the pixels in an image), the input
for deformable simulation is quite variable, high-dimensional, and
parametrization-unfriendly. Consequently, even though DNN is known for its rich
expressivity of nonlinear functions, directly using DNN to reconstruct the
force-displacement relation for general deformable simulation is nearly
impossible. DeepWarp obviates this difficulty by partially restoring the
force-displacement relation via warping the nodal displacement simulated using
a simplistic constitutive model -- the linear elasticity. In other words,
DeepWarp yields an incremental displacement fix based on a simplified
(therefore incorrect) simulation result other than returning the unknown
displacement directly. We contrive a compact yet effective feature vector
including geodesic, potential and digression to sort training pairs of per-node
linear and nonlinear displacement. DeepWarp is robust under different model
shapes and tessellations. With the assistance of deformation substructuring,
one DNN training is able to handle a wide range of 3D models of various
geometries including most examples shown in the paper. Thanks to the linear
elasticity and its constant system matrix, the underlying simulator only needs
to perform one pre-factorized matrix solve at each time step, and DeepWarp is
able to simulate large models in real time.
|
cs.GR
|
deepwarp is an efficient and highly reusable deep neural network dnn based nonlinear deformable simulation framework unlike other deep learning applications such as image recognition where different inputs have a uniform and consistent format eg an array of all the pixels in an image the input for deformable simulation is quite variable highdimensional and parametrizationunfriendly consequently even though dnn is known for its rich expressivity of nonlinear functions directly using dnn to reconstruct the forcedisplacement relation for general deformable simulation is nearly impossible deepwarp obviates this difficulty by partially restoring the forcedisplacement relation via warping the nodal displacement simulated using a simplistic constitutive model the linear elasticity in other words deepwarp yields an incremental displacement fix based on a simplified therefore incorrect simulation result other than returning the unknown displacement directly we contrive a compact yet effective feature vector including geodesic potential and digression to sort training pairs of pernode linear and nonlinear displacement deepwarp is robust under different model shapes and tessellations with the assistance of deformation substructuring one dnn training is able to handle a wide range of 3d models of various geometries including most examples shown in the paper thanks to the linear elasticity and its constant system matrix the underlying simulator only needs to perform one prefactorized matrix solve at each time step and deepwarp is able to simulate large models in real time
|
[['deepwarp', 'is', 'an', 'efficient', 'and', 'highly', 'reusable', 'deep', 'neural', 'network', 'dnn', 'based', 'nonlinear', 'deformable', 'simulation', 'framework', 'unlike', 'other', 'deep', 'learning', 'applications', 'such', 'as', 'image', 'recognition', 'where', 'different', 'inputs', 'have', 'a', 'uniform', 'and', 'consistent', 'format', 'eg', 'an', 'array', 'of', 'all', 'the', 'pixels', 'in', 'an', 'image', 'the', 'input', 'for', 'deformable', 'simulation', 'is', 'quite', 'variable', 'highdimensional', 'and', 'parametrizationunfriendly', 'consequently', 'even', 'though', 'dnn', 'is', 'known', 'for', 'its', 'rich', 'expressivity', 'of', 'nonlinear', 'functions', 'directly', 'using', 'dnn', 'to', 'reconstruct', 'the', 'forcedisplacement', 'relation', 'for', 'general', 'deformable', 'simulation', 'is', 'nearly', 'impossible', 'deepwarp', 'obviates', 'this', 'difficulty', 'by', 'partially', 'restoring', 'the', 'forcedisplacement', 'relation', 'via', 'warping', 'the', 'nodal', 'displacement', 'simulated', 'using', 'a', 'simplistic', 'constitutive', 'model', 'the', 'linear', 'elasticity', 'in', 'other', 'words', 'deepwarp', 'yields', 'an', 'incremental', 'displacement', 'fix', 'based', 'on', 'a', 'simplified', 'therefore', 'incorrect', 'simulation', 'result', 'other', 'than', 'returning', 'the', 'unknown', 'displacement', 'directly', 'we', 'contrive', 'a', 'compact', 'yet', 'effective', 'feature', 'vector', 'including', 'geodesic', 'potential', 'and', 'digression', 'to', 'sort', 'training', 'pairs', 'of', 'pernode', 'linear', 'and', 'nonlinear', 'displacement', 'deepwarp', 'is', 'robust', 'under', 'different', 'model', 'shapes', 'and', 'tessellations', 'with', 'the', 'assistance', 'of', 'deformation', 'substructuring', 'one', 'dnn', 'training', 'is', 'able', 'to', 'handle', 'a', 'wide', 'range', 'of', '3d', 'models', 'of', 'various', 'geometries', 'including', 'most', 'examples', 'shown', 'in', 'the', 'paper', 'thanks', 'to', 'the', 'linear', 'elasticity', 'and', 'its', 'constant', 'system', 'matrix', 'the', 'underlying', 'simulator', 'only', 'needs', 'to', 'perform', 'one', 'prefactorized', 'matrix', 'solve', 'at', 'each', 'time', 'step', 'and', 'deepwarp', 'is', 'able', 'to', 'simulate', 'large', 'models', 'in', 'real', 'time']]
|
[-0.04631507754958424, 0.05244524378985768, -0.05467015679769086, 0.05717093696760063, -0.11810333895562958, -0.20263911031013504, -0.03724593001153048, 0.4059522850052618, -0.30966736855803356, -0.2982371330613567, 0.09449986462580222, -0.23516556509745729, -0.18706244722099366, 0.20981674124224037, -0.09214907335385318, 0.12911577230480095, 0.07772070073741034, 0.02243689679055458, -0.06961738187881533, -0.23723953981385196, 0.28596558121024773, 0.0533100214425734, 0.30349145277464595, -0.028984175015506704, 0.149533373767763, 0.012388176216735644, -0.012977883815188456, 0.014680813671918008, -0.04887172243397155, 0.1207566528274076, 0.2714886248447642, 0.11782284226758917, 0.2532292160048949, -0.46134625489522696, -0.2258670032203385, 0.09566084124957648, 0.11666085209667351, 0.12858934105225567, -0.024415592245234225, -0.26600225645929276, 0.07420662643523904, -0.1467254891171557, -0.08009983127961447, -0.1234363390285258, 0.013831712799023144, -0.0006600930448209421, -0.29650134815673745, 0.0459211546348447, 0.05718208114365198, 0.046471396029465296, -0.059610337636070904, -0.08781253479923888, -0.00018879908200897342, 0.12669880350483004, 0.006992940712654222, 0.051275611368308785, 0.12850452316162564, -0.1539262357712373, -0.06674088495041747, 0.38972002873609285, -0.03344644386295808, -0.2484512978554827, 0.213312536461559, -0.04013855031184621, -0.10970197181913804, 0.13152798254890738, 0.21967734876130007, 0.1085836597753326, -0.16366556868064258, 0.04879556793129212, -0.029011903666407983, 0.20916225873263536, 0.04089594050516597, -0.03535779063422202, 0.16358064281119578, 0.21729734412134846, 0.04397269907104577, 0.14691576407063314, -0.10214351976920842, -0.09218987112090124, -0.26616539045822174, -0.10426922420949461, -0.20193011258508334, -0.02264890886340455, -0.13186342473218085, -0.1892688146145114, 0.37038799411559525, 0.15383044360782458, 0.1980138198179976, 0.11559814621078313, 0.3388117256726806, 0.06994777420727305, 0.10449598290142603, 0.06777415287359494, 0.20748362888734523, 0.09927350226727899, 0.08873277189482036, -0.17581210426153795, 0.08202045003314858, 0.04683852120327343]
|
1,803.0911
|
A description of a result of Deligne by log higher Albanese map
|
In a joint work [9] with Kazuya Kato and Chikara Nakayama, log higher
Albanese manifolds was constructed as an application of log mixed Hodge theory
with group action. In this framework, we describe a work of Deligne in [3] on
some nilpotent quotients of the fundamental group of the projective line minus
three points, where polylogarithms appear. As a result, we have $q$-expansions
of higher Albanese maps at boundary points, i.e., log higher Albanese maps over
the boundary.
|
math.AG
|
in a joint work 9 with kazuya kato and chikara nakayama log higher albanese manifolds was constructed as an application of log mixed hodge theory with group action in this framework we describe a work of deligne in 3 on some nilpotent quotients of the fundamental group of the projective line minus three points where polylogarithms appear as a result we have qexpansions of higher albanese maps at boundary points ie log higher albanese maps over the boundary
|
[['in', 'a', 'joint', 'work', '9', 'with', 'kazuya', 'kato', 'and', 'chikara', 'nakayama', 'log', 'higher', 'albanese', 'manifolds', 'was', 'constructed', 'as', 'an', 'application', 'of', 'log', 'mixed', 'hodge', 'theory', 'with', 'group', 'action', 'in', 'this', 'framework', 'we', 'describe', 'a', 'work', 'of', 'deligne', 'in', '3', 'on', 'some', 'nilpotent', 'quotients', 'of', 'the', 'fundamental', 'group', 'of', 'the', 'projective', 'line', 'minus', 'three', 'points', 'where', 'polylogarithms', 'appear', 'as', 'a', 'result', 'we', 'have', 'qexpansions', 'of', 'higher', 'albanese', 'maps', 'at', 'boundary', 'points', 'ie', 'log', 'higher', 'albanese', 'maps', 'over', 'the', 'boundary']]
|
[-0.1650455449707806, 0.004674088749800228, -0.11560916812945303, 0.04149299048873076, -0.05501801623999105, -0.16346516394261995, 0.009780940543799722, 0.30802930050224137, -0.2605427669288663, -0.2562391392451215, 0.11948478004332728, -0.2657397347925739, -0.18318707705173012, 0.19276699955974305, -0.21000013548681246, -0.006120361339349251, -0.03184320094583967, 0.07036675755297403, -0.11908387924943652, -0.3553793835665353, 0.4432714912713832, -0.02616894038926278, 0.22128955856292182, 0.036520277185410156, 0.11357856800102374, -0.02028192988900746, -0.028100461191074413, -0.05480366003663315, -0.12007689565516912, 0.14079394952285212, 0.3148616605571338, 0.025630397918670403, 0.19802141692731287, -0.3477565489419095, -0.2118237607253643, 0.1855477116844774, 0.11540118782696399, 0.02042413938355136, 0.05620944189427832, -0.21813571645406546, 0.08861859824943852, -0.16636301908496912, -0.16631477938469064, -0.04038883194738588, 0.03465304544268103, -0.0177320892523442, -0.19742999499808853, 0.011190336088758784, 0.05466739959143973, 0.22359857879663733, -0.09071925731206482, -0.1342687619656896, -0.11142534589056265, 0.06043783012874328, -0.02402181319844026, 0.0940760391909484, 0.07306816534731876, -0.0949595342904281, -0.12307877649928069, 0.35200448225361186, -0.12599612410821312, -0.17668559318771224, 0.13277841014666603, -0.1983643519274842, -0.2097099061523165, 0.13782836210176155, 0.10104554838367871, 0.22013325253259633, 0.023654783821918747, 0.1605666602573164, -0.11183883139996656, 0.06043567057916677, 0.1724528731240032, -0.042597949589517986, 0.08137519156572397, 0.09389399598026044, 0.0919674556224619, 0.08399086034941403, -0.01768799032713589, 0.02036288861403024, -0.3659875018933377, -0.2114861962421761, -0.09730783180793287, 0.16643002827337325, -0.14467578501627304, -0.1289207200676977, 0.3875308884670595, 0.057640943815326924, 0.2475517708626757, 0.12290136408447833, 0.20955643467847015, 0.05174806428311223, 0.04766374079757385, 0.0675826831055539, 0.08822663761743393, 0.23238717150185015, -0.013798639234215891, -0.11689288130516863, -0.08178571560314264, 0.22782268999265387]
|
1,803.09111
|
Entanglement-guided architectures of machine learning by quantum tensor
network
|
It is a fundamental, but still elusive question whether the schemes based on
quantum mechanics, in particular on quantum entanglement, can be used for
classical information processing and machine learning. Even partial answer to
this question would bring important insights to both fields of machine learning
and quantum mechanics. In this work, we implement simple numerical experiments,
related to pattern/images classification, in which we represent the classifiers
by many-qubit quantum states written in the matrix product states (MPS).
Classical machine learning algorithm is applied to these quantum states to
learn the classical data. We explicitly show how quantum entanglement (i.e.,
single-site and bipartite entanglement) can emerge in such represented images.
Entanglement characterizes here the importance of data, and such information
are practically used to guide the architecture of MPS, and improve the
efficiency. The number of needed qubits can be reduced to less than 1/10 of the
original number, which is within the access of the state-of-the-art quantum
computers. We expect such numerical experiments could open new paths in
charactering classical machine learning algorithms, and at the same time shed
lights on the generic quantum simulations/computations of machine learning
tasks.
|
stat.ML cond-mat.str-el cs.LG quant-ph
|
it is a fundamental but still elusive question whether the schemes based on quantum mechanics in particular on quantum entanglement can be used for classical information processing and machine learning even partial answer to this question would bring important insights to both fields of machine learning and quantum mechanics in this work we implement simple numerical experiments related to patternimages classification in which we represent the classifiers by manyqubit quantum states written in the matrix product states mps classical machine learning algorithm is applied to these quantum states to learn the classical data we explicitly show how quantum entanglement ie singlesite and bipartite entanglement can emerge in such represented images entanglement characterizes here the importance of data and such information are practically used to guide the architecture of mps and improve the efficiency the number of needed qubits can be reduced to less than 110 of the original number which is within the access of the stateoftheart quantum computers we expect such numerical experiments could open new paths in charactering classical machine learning algorithms and at the same time shed lights on the generic quantum simulationscomputations of machine learning tasks
|
[['it', 'is', 'a', 'fundamental', 'but', 'still', 'elusive', 'question', 'whether', 'the', 'schemes', 'based', 'on', 'quantum', 'mechanics', 'in', 'particular', 'on', 'quantum', 'entanglement', 'can', 'be', 'used', 'for', 'classical', 'information', 'processing', 'and', 'machine', 'learning', 'even', 'partial', 'answer', 'to', 'this', 'question', 'would', 'bring', 'important', 'insights', 'to', 'both', 'fields', 'of', 'machine', 'learning', 'and', 'quantum', 'mechanics', 'in', 'this', 'work', 'we', 'implement', 'simple', 'numerical', 'experiments', 'related', 'to', 'patternimages', 'classification', 'in', 'which', 'we', 'represent', 'the', 'classifiers', 'by', 'manyqubit', 'quantum', 'states', 'written', 'in', 'the', 'matrix', 'product', 'states', 'mps', 'classical', 'machine', 'learning', 'algorithm', 'is', 'applied', 'to', 'these', 'quantum', 'states', 'to', 'learn', 'the', 'classical', 'data', 'we', 'explicitly', 'show', 'how', 'quantum', 'entanglement', 'ie', 'singlesite', 'and', 'bipartite', 'entanglement', 'can', 'emerge', 'in', 'such', 'represented', 'images', 'entanglement', 'characterizes', 'here', 'the', 'importance', 'of', 'data', 'and', 'such', 'information', 'are', 'practically', 'used', 'to', 'guide', 'the', 'architecture', 'of', 'mps', 'and', 'improve', 'the', 'efficiency', 'the', 'number', 'of', 'needed', 'qubits', 'can', 'be', 'reduced', 'to', 'less', 'than', '110', 'of', 'the', 'original', 'number', 'which', 'is', 'within', 'the', 'access', 'of', 'the', 'stateoftheart', 'quantum', 'computers', 'we', 'expect', 'such', 'numerical', 'experiments', 'could', 'open', 'new', 'paths', 'in', 'charactering', 'classical', 'machine', 'learning', 'algorithms', 'and', 'at', 'the', 'same', 'time', 'shed', 'lights', 'on', 'the', 'generic', 'quantum', 'simulationscomputations', 'of', 'machine', 'learning', 'tasks']]
|
[-0.06946495262425433, 0.13982321522842617, -0.10531103141615762, 0.09730875723750053, -0.07266148327394052, -0.2043699827565356, 0.05080854771856932, 0.36578733621145343, -0.3135461482254075, -0.3134088755704145, 0.07682153556812951, -0.24193113982835981, -0.16639303517815202, 0.24446048937302003, -0.10173257945434865, 0.14270509563094164, 0.09393325638511475, 0.08307172952497259, -0.060239688177503886, -0.31994885538130047, 0.2896748321518897, 0.02820690642507311, 0.3171193376059664, 0.07309914324581226, 0.07936952725186587, 0.002386307901767221, 0.005641211758669901, -0.006124303121357522, -0.09497290835814907, 0.15918240332827369, 0.35300168319000924, 0.2077662339904643, 0.2832584598329552, -0.45770081062305795, -0.20521449291226554, 0.11040046367239445, 0.15891452216137042, 0.16913165236412092, -0.011736095986363696, -0.3120675429805836, 0.047070492924676535, -0.13113683578062882, -0.052722683377028935, -0.15923734884486196, -0.04054001498003887, -0.05767351992804795, -0.21383893296637752, 0.03769791735078585, 0.07746011037268041, 0.04352126795144633, 0.013097756744134537, -0.0660247111772286, 0.06647961788830604, 0.16363107232981303, -0.035122831956235306, 0.035602504207921076, 0.14526234527039242, -0.1634402183711806, -0.2176209940848144, 0.3858901884188836, -0.014470454185511893, -0.21202773631530555, 0.212795473902085, -0.05807861357684584, -0.15175409808982798, 0.024203200402243576, 0.21631358338747808, 0.08908420855407306, -0.10645712810095419, 0.05224688456856963, -0.02891809579004791, 0.18122624259063122, 0.030879993669123963, 0.07904179556731214, 0.19629536413567814, 0.14577183609133576, 0.026580856845496183, 0.1447924097536746, -0.05239118830464344, -0.16652850903189206, -0.22915074251532713, -0.19683630011252504, -0.24759996561005346, 0.09360044150107956, -0.06699840636816164, -0.12673143468937462, 0.3883682289061711, 0.21161250520108685, 0.14974744529265197, 0.016903167178091455, 0.2886444199780755, 0.09033192742239446, 0.084781174244857, 0.12102026814790541, 0.22320660451015933, 0.12179773751809757, 0.08915199238579086, -0.22168120594467333, 0.046621209290219186, 0.021564480288052048]
|
1,803.09112
|
To overlap or not to overlap: Enabling Channel Bonding in High-Density
WLANs
|
Wireless local area networks (WLANs) are the most popular kind of wireless
Internet connection because of their simplicity of deployment and operation. As
a result, the number of devices accessing the Internet through WLANs such as
laptops, smartphones, or wearables, is increasing drastically at the same time
that applications' throughput requirements do. To cope with these challenges,
channel bonding (CB) techniques are used for enabling higher data rates by
transmitting in wider channels, thus increasing spectrum efficiency. However,
important issues like higher potential co-channel and adjacent channel
interference arise when bonding channels. This may harm the performance of the
carrier sense multiple access (CSMA) protocol because of recurrent backoff
freezing while making nodes more sensitive to hidden node effects. In this
paper, we address the following point at issue: is it convenient for
high-density (HD) WLANs to use wider channels and potentially overlap in the
spectrum? First, we highlight key aspects of DCB in toy scenarios through a
continuous time Markov network (CTMN) model. Then, by means of extensive
simulations covering a wide range of traffic loads and access point (AP)
densities, we show that dynamic channel bonding (DCB) - which adapts the
channel bandwidth on a per-packet transmission - significantly outperforms
traditional single-channel on average. Nevertheless, results also corroborate
that DCB is more prone to generate unfair situations where WLANs may starve.
Contrary to most of the current thoughts pushing towards non-overlapping
channels in HD deployments, we highlight the benefits of allocating channels as
wider as possible to WLANs altogether with implementing adaptive access
policies to cope with the unfairness situations that may appear.
|
cs.NI
|
wireless local area networks wlans are the most popular kind of wireless internet connection because of their simplicity of deployment and operation as a result the number of devices accessing the internet through wlans such as laptops smartphones or wearables is increasing drastically at the same time that applications throughput requirements do to cope with these challenges channel bonding cb techniques are used for enabling higher data rates by transmitting in wider channels thus increasing spectrum efficiency however important issues like higher potential cochannel and adjacent channel interference arise when bonding channels this may harm the performance of the carrier sense multiple access csma protocol because of recurrent backoff freezing while making nodes more sensitive to hidden node effects in this paper we address the following point at issue is it convenient for highdensity hd wlans to use wider channels and potentially overlap in the spectrum first we highlight key aspects of dcb in toy scenarios through a continuous time markov network ctmn model then by means of extensive simulations covering a wide range of traffic loads and access point ap densities we show that dynamic channel bonding dcb which adapts the channel bandwidth on a perpacket transmission significantly outperforms traditional singlechannel on average nevertheless results also corroborate that dcb is more prone to generate unfair situations where wlans may starve contrary to most of the current thoughts pushing towards nonoverlapping channels in hd deployments we highlight the benefits of allocating channels as wider as possible to wlans altogether with implementing adaptive access policies to cope with the unfairness situations that may appear
|
[['wireless', 'local', 'area', 'networks', 'wlans', 'are', 'the', 'most', 'popular', 'kind', 'of', 'wireless', 'internet', 'connection', 'because', 'of', 'their', 'simplicity', 'of', 'deployment', 'and', 'operation', 'as', 'a', 'result', 'the', 'number', 'of', 'devices', 'accessing', 'the', 'internet', 'through', 'wlans', 'such', 'as', 'laptops', 'smartphones', 'or', 'wearables', 'is', 'increasing', 'drastically', 'at', 'the', 'same', 'time', 'that', 'applications', 'throughput', 'requirements', 'do', 'to', 'cope', 'with', 'these', 'challenges', 'channel', 'bonding', 'cb', 'techniques', 'are', 'used', 'for', 'enabling', 'higher', 'data', 'rates', 'by', 'transmitting', 'in', 'wider', 'channels', 'thus', 'increasing', 'spectrum', 'efficiency', 'however', 'important', 'issues', 'like', 'higher', 'potential', 'cochannel', 'and', 'adjacent', 'channel', 'interference', 'arise', 'when', 'bonding', 'channels', 'this', 'may', 'harm', 'the', 'performance', 'of', 'the', 'carrier', 'sense', 'multiple', 'access', 'csma', 'protocol', 'because', 'of', 'recurrent', 'backoff', 'freezing', 'while', 'making', 'nodes', 'more', 'sensitive', 'to', 'hidden', 'node', 'effects', 'in', 'this', 'paper', 'we', 'address', 'the', 'following', 'point', 'at', 'issue', 'is', 'it', 'convenient', 'for', 'highdensity', 'hd', 'wlans', 'to', 'use', 'wider', 'channels', 'and', 'potentially', 'overlap', 'in', 'the', 'spectrum', 'first', 'we', 'highlight', 'key', 'aspects', 'of', 'dcb', 'in', 'toy', 'scenarios', 'through', 'a', 'continuous', 'time', 'markov', 'network', 'ctmn', 'model', 'then', 'by', 'means', 'of', 'extensive', 'simulations', 'covering', 'a', 'wide', 'range', 'of', 'traffic', 'loads', 'and', 'access', 'point', 'ap', 'densities', 'we', 'show', 'that', 'dynamic', 'channel', 'bonding', 'dcb', 'which', 'adapts', 'the', 'channel', 'bandwidth', 'on', 'a', 'perpacket', 'transmission', 'significantly', 'outperforms', 'traditional', 'singlechannel', 'on', 'average', 'nevertheless', 'results', 'also', 'corroborate', 'that', 'dcb', 'is', 'more', 'prone', 'to', 'generate', 'unfair', 'situations', 'where', 'wlans', 'may', 'starve', 'contrary', 'to', 'most', 'of', 'the', 'current', 'thoughts', 'pushing', 'towards', 'nonoverlapping', 'channels', 'in', 'hd', 'deployments', 'we', 'highlight', 'the', 'benefits', 'of', 'allocating', 'channels', 'as', 'wider', 'as', 'possible', 'to', 'wlans', 'altogether', 'with', 'implementing', 'adaptive', 'access', 'policies', 'to', 'cope', 'with', 'the', 'unfairness', 'situations', 'that', 'may', 'appear']]
|
[-0.21049531971906957, 0.05722089571623351, -0.003594586733700318, 0.02488542726208516, -0.07633973003326147, -0.25357613888898506, 0.13728969717057893, 0.4043195637141287, -0.2731005926395168, -0.26680817580055943, 0.08547450601833274, -0.25742300635933196, -0.16451138138112403, 0.17381873946971554, -0.13482365197878018, 0.04785353292626091, 0.08377854891135553, -0.008326271532932049, -0.008951991937918227, -0.24343476579400636, 0.28334306639764356, 0.11932907458801999, 0.36263670349500704, 0.0904875360145995, 0.0120331517552617, 0.01929530267030029, -0.036765742860645934, -0.03298566215485688, -0.07038721798163548, 0.06444324853125351, 0.34717800119934256, 0.13657523473342278, 0.3164526807184565, -0.46615741660768883, -0.29664765424962675, 0.09229910471290705, 0.19530026376346557, 0.060140634855492744, -0.03210721351792806, -0.2761936723484796, 0.1407863070321634, -0.2478763825134392, -0.07546553922680556, -0.03488996301573159, -0.03246181631839689, 0.05282436476528163, -0.30244201241316054, 0.027138337895638017, -0.011807362320602734, 0.02081563801791505, -0.007803756914364029, -0.08763755927926475, 0.008095676970877066, 0.16672094335556897, 0.043583177272212684, -0.03321362872069751, 0.1712925290749072, -0.15995615337308702, -0.11922482482446252, 0.3863797059226002, 0.021603555379598315, -0.16522405233620152, 0.23089297313576018, -0.07371429500024865, -0.12089519520615982, 0.12942554729551559, 0.2150142265434161, 0.04807743611178952, -0.17018113284356964, 0.013018574334588964, 0.023552212059434093, 0.1432795410937304, 0.09038869176102456, 0.1522350225530338, 0.18074857470041192, 0.19826075781562574, 0.14551527459055325, 0.09072503585880977, -0.10285587954164939, -0.1431480578065871, -0.19075734350505416, -0.10211087302428745, -0.18198209654490247, 0.0160714924917999, -0.08392774206369287, -0.08740727917535564, 0.3662314907640587, 0.21815010705589186, 0.15172956665949505, 0.06781442336580529, 0.3635275378370013, 0.028337865497761128, 0.1260666653749395, 0.11514966767334411, 0.1663534267957786, 0.05629619163330007, 0.18455846406105098, -0.16135404583291565, 0.09387793361644009, -0.07033951961109591]
|
1,803.09113
|
Self-conformal sets with positive Hausdorff measure
|
We investigate the Hausdorff measure and content on a class of quasi
self-similar sets that include, for example, graph-directed and sub
self-similar and self-conformal sets. We show that any Hausdorff measurable
subset of such a set has comparable Hausdorff measure and Hausdorff content. In
particular, this proves that graph-directed and sub self-conformal sets with
positive Hausdorff measure are Ahlfors regular, irrespective of separation
conditions. When restricting to self-conformal subsets of the real line with
Hausdorff dimension strictly less than one, we additionally show that the weak
separation condition is equivalent to Ahlfors regularity and its failure
implies full Assouad dimension. In fact, we resolve a self-conformal extension
of the dimension drop conjecture for self-conformal sets with positive
Hausdorff measure by showing that its Hausdorff dimension falls below the
expected value if and only if there are exact overlaps.
|
math.MG math.CA math.DS
|
we investigate the hausdorff measure and content on a class of quasi selfsimilar sets that include for example graphdirected and sub selfsimilar and selfconformal sets we show that any hausdorff measurable subset of such a set has comparable hausdorff measure and hausdorff content in particular this proves that graphdirected and sub selfconformal sets with positive hausdorff measure are ahlfors regular irrespective of separation conditions when restricting to selfconformal subsets of the real line with hausdorff dimension strictly less than one we additionally show that the weak separation condition is equivalent to ahlfors regularity and its failure implies full assouad dimension in fact we resolve a selfconformal extension of the dimension drop conjecture for selfconformal sets with positive hausdorff measure by showing that its hausdorff dimension falls below the expected value if and only if there are exact overlaps
|
[['we', 'investigate', 'the', 'hausdorff', 'measure', 'and', 'content', 'on', 'a', 'class', 'of', 'quasi', 'selfsimilar', 'sets', 'that', 'include', 'for', 'example', 'graphdirected', 'and', 'sub', 'selfsimilar', 'and', 'selfconformal', 'sets', 'we', 'show', 'that', 'any', 'hausdorff', 'measurable', 'subset', 'of', 'such', 'a', 'set', 'has', 'comparable', 'hausdorff', 'measure', 'and', 'hausdorff', 'content', 'in', 'particular', 'this', 'proves', 'that', 'graphdirected', 'and', 'sub', 'selfconformal', 'sets', 'with', 'positive', 'hausdorff', 'measure', 'are', 'ahlfors', 'regular', 'irrespective', 'of', 'separation', 'conditions', 'when', 'restricting', 'to', 'selfconformal', 'subsets', 'of', 'the', 'real', 'line', 'with', 'hausdorff', 'dimension', 'strictly', 'less', 'than', 'one', 'we', 'additionally', 'show', 'that', 'the', 'weak', 'separation', 'condition', 'is', 'equivalent', 'to', 'ahlfors', 'regularity', 'and', 'its', 'failure', 'implies', 'full', 'assouad', 'dimension', 'in', 'fact', 'we', 'resolve', 'a', 'selfconformal', 'extension', 'of', 'the', 'dimension', 'drop', 'conjecture', 'for', 'selfconformal', 'sets', 'with', 'positive', 'hausdorff', 'measure', 'by', 'showing', 'that', 'its', 'hausdorff', 'dimension', 'falls', 'below', 'the', 'expected', 'value', 'if', 'and', 'only', 'if', 'there', 'are', 'exact', 'overlaps']]
|
[-0.11072945701417283, 0.10757244036168508, -0.06090071476806981, 0.16650792513636575, -0.039820164420129055, -0.13902817168812928, 0.060369761188285076, 0.3633398919811715, -0.25627635631953244, -0.1507360453589185, 0.1366543377533663, -0.35318918247956893, -0.09179467428138183, 0.2171762877235027, -0.10690225807416752, 0.04157723785644613, 0.05477838260054156, 0.08248680776012117, -0.05458764131754583, -0.26024815037954546, 0.45062836133402545, -0.0796384811266393, 0.2892194749429768, 0.10222518551365836, 0.10461616543108139, -0.06619031853177518, -0.023868655232523663, 0.144827059256689, -0.20582637415640603, 0.11664858666936988, 0.1919315092238611, 0.1666604127984602, 0.2525164513539547, -0.2668507245126302, -0.19368050322847682, 0.2190677620794462, 0.10170625280116455, -0.03631532719937504, 0.02897199991317736, -0.31720794136703445, 0.1969422130825241, -0.08814027475739789, -0.20151773814543866, -0.09291040490421912, 0.14807523936843095, -0.011674721259623766, -0.2692959431315894, 0.05660086564476723, 0.12060125087104413, 0.08192866149466431, -0.09079266067398577, -0.07026331387527719, -0.06193139215938045, 0.08064388634533237, -0.010283050250491478, 0.043950758855857384, 0.06791651460841513, -0.0011632408815152619, -0.09270804220695804, 0.34753837601781107, -0.06532044449799602, -0.27068846497306787, 0.2618884904026661, -0.30738636594015994, -0.12671416690843046, 0.12711976730075758, 0.09007227511914528, 0.08068180910608583, -0.049496928910388226, 0.17721032563375944, -0.13755003807296895, 0.1875925788645754, 0.17429572593528722, 0.08498246335100544, 0.09318685891322684, 0.13123347494157328, 0.2229151916352735, 0.1598064348243339, -0.020609372334244352, 0.0016624680349090393, -0.30043651756452583, -0.12289790990610566, -0.21475280417075407, 0.14794498532875508, -0.1592924013638749, -0.23605614180838608, 0.3001383411279623, 0.12587530794722177, 0.20621394129820925, 0.18695933937999434, 0.22016073301758454, 0.07860395363019526, 0.006160076943806548, 0.11365945827202413, 0.12153537034232548, 0.10905944161029343, -0.023287364683262465, -0.0986419838745201, 0.04059045073792231, 0.16261901298159923]
|
1,803.09114
|
Systematic Search for Rings around Kepler Planet Candidates: Constraints
on Ring Size and Occurrence Rate
|
We perform a systematic search for rings around 168 Kepler planet candidates
with sufficient signal-to-noise ratios that are selected from all the
short-cadence data. We fit ringed and ringless models to their lightcurves, and
compare the fitting results to search for the signatures of planetary rings.
First, we identify 29 tentative systems, for which the ringed models exhibit
statistically significant improvement over the ringless models. The lightcurves
of those systems are individually examined, but we are not able to identify any
candidate that indicates evidence for rings. In turn, we find out several
mechanisms of false-positives that would produce ring-like signals, and the
null detection enables us to place upper limits on the size of rings.
Furthermore, assuming the tidal alignment between axes of the planetary rings
and orbits, we conclude that the occurrence rate of rings larger than twice the
planetary radius is less than 15 percent. Even though the majority of our
targets are short-period planets, our null detection provides statistical and
quantitative constraints on largely uncertain theoretical models of origin,
formation, and evolution of planetary rings.
|
astro-ph.EP
|
we perform a systematic search for rings around 168 kepler planet candidates with sufficient signaltonoise ratios that are selected from all the shortcadence data we fit ringed and ringless models to their lightcurves and compare the fitting results to search for the signatures of planetary rings first we identify 29 tentative systems for which the ringed models exhibit statistically significant improvement over the ringless models the lightcurves of those systems are individually examined but we are not able to identify any candidate that indicates evidence for rings in turn we find out several mechanisms of falsepositives that would produce ringlike signals and the null detection enables us to place upper limits on the size of rings furthermore assuming the tidal alignment between axes of the planetary rings and orbits we conclude that the occurrence rate of rings larger than twice the planetary radius is less than 15 percent even though the majority of our targets are shortperiod planets our null detection provides statistical and quantitative constraints on largely uncertain theoretical models of origin formation and evolution of planetary rings
|
[['we', 'perform', 'a', 'systematic', 'search', 'for', 'rings', 'around', '168', 'kepler', 'planet', 'candidates', 'with', 'sufficient', 'signaltonoise', 'ratios', 'that', 'are', 'selected', 'from', 'all', 'the', 'shortcadence', 'data', 'we', 'fit', 'ringed', 'and', 'ringless', 'models', 'to', 'their', 'lightcurves', 'and', 'compare', 'the', 'fitting', 'results', 'to', 'search', 'for', 'the', 'signatures', 'of', 'planetary', 'rings', 'first', 'we', 'identify', '29', 'tentative', 'systems', 'for', 'which', 'the', 'ringed', 'models', 'exhibit', 'statistically', 'significant', 'improvement', 'over', 'the', 'ringless', 'models', 'the', 'lightcurves', 'of', 'those', 'systems', 'are', 'individually', 'examined', 'but', 'we', 'are', 'not', 'able', 'to', 'identify', 'any', 'candidate', 'that', 'indicates', 'evidence', 'for', 'rings', 'in', 'turn', 'we', 'find', 'out', 'several', 'mechanisms', 'of', 'falsepositives', 'that', 'would', 'produce', 'ringlike', 'signals', 'and', 'the', 'null', 'detection', 'enables', 'us', 'to', 'place', 'upper', 'limits', 'on', 'the', 'size', 'of', 'rings', 'furthermore', 'assuming', 'the', 'tidal', 'alignment', 'between', 'axes', 'of', 'the', 'planetary', 'rings', 'and', 'orbits', 'we', 'conclude', 'that', 'the', 'occurrence', 'rate', 'of', 'rings', 'larger', 'than', 'twice', 'the', 'planetary', 'radius', 'is', 'less', 'than', '15', 'percent', 'even', 'though', 'the', 'majority', 'of', 'our', 'targets', 'are', 'shortperiod', 'planets', 'our', 'null', 'detection', 'provides', 'statistical', 'and', 'quantitative', 'constraints', 'on', 'largely', 'uncertain', 'theoretical', 'models', 'of', 'origin', 'formation', 'and', 'evolution', 'of', 'planetary', 'rings']]
|
[-0.14107238493636043, 0.03732091851542865, -0.08525712629285896, 0.10877835435087808, -0.08140667498517552, -0.0975408097651043, 0.06757538479768448, 0.38284405386959874, -0.18170930594257886, -0.3581873986391382, 0.09413518671885486, -0.2880969670582979, -0.08797065833552256, 0.2533965632566589, -0.036401738646809616, 0.002948782233750271, 0.10246650511255831, -0.021415315174976333, -0.06665953496398207, -0.3017595412571233, 0.25683732919639507, 0.08367643964232346, 0.1542096618542125, -0.03353049279634149, 0.00032855209298744047, -0.054001651821377054, -0.07667416720599061, -0.027476999398799582, -0.18312890107132748, 0.07957947890107733, 0.22219595082428412, 0.1452164365402709, 0.16788933525257355, -0.3814639838610115, -0.1707759964248613, 0.14294857182930218, 0.16185575690707088, 0.0836449726484716, -0.0469052831202683, -0.24742923398741506, 0.13743967597708417, -0.17238907935357958, -0.12712288305277847, -0.06456003409378522, 0.09252535435501173, 0.044304049603755495, -0.2539712095180495, 0.09556212351987836, 0.09293393019909382, 0.10793186986006603, -0.15929150797411093, -0.13083226297716688, -0.04570845593880425, 0.08969687858294675, 0.03267910255655105, -0.053514964142996384, 0.14027169856175198, -0.10011876135278888, -0.10187129017002049, 0.40102701205448066, -0.06663749715935714, -0.09421057042837476, 0.2655956352444355, -0.20914127515347977, -0.14440039491187262, 0.1788041845442696, 0.17406673309283965, 0.133039232749263, -0.14064951180662522, -0.026136855081675896, -0.0471853300266998, 0.20059240934069597, 0.062013141281496965, 0.06786178566733968, 0.35020362008779243, 0.12020234827358046, 0.05538395540814784, 0.08668913563333618, -0.21753900679993812, -0.08167331609822935, -0.25035454574341537, -0.10300652007344725, -0.08048773070279634, 0.02166345829637422, -0.07645465266014782, -0.12068391337505588, 0.3732095567571967, 0.18941046413640342, 0.21666787942486435, 0.06611056373826639, 0.2587524154405604, 0.04780364264870666, 0.1285248149652034, 0.0743723772127993, 0.3171413009309902, 0.11237721125381953, 0.01509443671746939, -0.17614067004155887, 0.08831257885387012, -0.04264323508455392]
|
1,803.09115
|
The Vollhardt crossing point at high magnetic field
|
Direct measurements of the Vollhardt crossing point coordinates were
performed making use data of dilatometric and ultrasound experiments on MnSi.
As is shown the crossing points are not invariant in the extended range of
magnetic field and should be viewed as a side effects of flattening and
spreading out the fluctuation maxima or minima by magnetic field~\cite{Sti16}.
Correspondingly the crossing point can not be identified with a characteristic
feature controlling the phase transition. So further studies are needed to
understand intriguing features of the phase diagram of helical itinerant magnet
MnSi.
|
cond-mat.str-el
|
direct measurements of the vollhardt crossing point coordinates were performed making use data of dilatometric and ultrasound experiments on mnsi as is shown the crossing points are not invariant in the extended range of magnetic field and should be viewed as a side effects of flattening and spreading out the fluctuation maxima or minima by magnetic fieldcitesti16 correspondingly the crossing point can not be identified with a characteristic feature controlling the phase transition so further studies are needed to understand intriguing features of the phase diagram of helical itinerant magnet mnsi
|
[['direct', 'measurements', 'of', 'the', 'vollhardt', 'crossing', 'point', 'coordinates', 'were', 'performed', 'making', 'use', 'data', 'of', 'dilatometric', 'and', 'ultrasound', 'experiments', 'on', 'mnsi', 'as', 'is', 'shown', 'the', 'crossing', 'points', 'are', 'not', 'invariant', 'in', 'the', 'extended', 'range', 'of', 'magnetic', 'field', 'and', 'should', 'be', 'viewed', 'as', 'a', 'side', 'effects', 'of', 'flattening', 'and', 'spreading', 'out', 'the', 'fluctuation', 'maxima', 'or', 'minima', 'by', 'magnetic', 'fieldcitesti16', 'correspondingly', 'the', 'crossing', 'point', 'can', 'not', 'be', 'identified', 'with', 'a', 'characteristic', 'feature', 'controlling', 'the', 'phase', 'transition', 'so', 'further', 'studies', 'are', 'needed', 'to', 'understand', 'intriguing', 'features', 'of', 'the', 'phase', 'diagram', 'of', 'helical', 'itinerant', 'magnet', 'mnsi']]
|
[-0.18029108056669227, 0.1802982681327396, -0.12263931451986233, 0.07155387155168379, -0.08744106512102816, -0.1187750213417328, 0.0836582959526115, 0.365280067258411, -0.24968626836521757, -0.30875407838159136, 0.10818512511775932, -0.2912342288531363, -0.13225221826643166, 0.17210534614148654, 0.04352457442631324, 0.030723747497217523, -0.0014018142000875539, 0.027727936125463908, -0.11460253394519289, -0.1757600491659509, 0.25337835010917237, 0.048789815834930375, 0.2779223090606845, 0.04431653879065481, 0.027464396394013116, -0.0032973178403659, 0.03661530320015219, 0.0681091848683233, -0.11724520735442638, -0.009200766337259362, 0.27308135897749, -0.0031325553078204393, 0.17765724321620333, -0.43971511835439336, -0.24066967046302226, 0.0796595218565522, 0.19188347774227926, 0.08697865982798653, -0.028225252923503932, -0.31737583890143367, 0.04151272695097658, -0.05923776039853692, -0.15667958423598774, -0.11024340856820344, -0.038940395366969624, 0.027422403626971775, -0.24902609523592723, 0.06695951455945356, 0.047351670285893814, 0.15029205979986324, -0.04290064507577982, -0.08876225509577328, -0.08178435873447193, 0.09501939403772768, 0.07973868553267999, 0.08061037137587038, 0.17778836640322374, -0.11829174348256655, -0.11738147768968095, 0.38038855858354104, -0.010910264640632604, -0.10545385067040722, 0.14634386468678712, -0.18663549515832628, -0.0917317731047256, 0.18266495772533947, 0.10076217460963462, 0.08691328808474484, -0.10475071454291335, 0.03341003771056421, -1.1394814484649235e-05, 0.1504729386807109, 0.06421504851378915, 0.010340008408659035, 0.2988347919864787, 0.13673341281505094, 0.020769583940919902, 0.15103936684059185, -0.17324868134326404, -0.07994832593119806, -0.2783655977083577, -0.15084187531093549, -0.19914904048459398, 0.026386377924548773, -0.04489769138340812, -0.1556149675830966, 0.38494464535680084, 0.14589748035392, 0.23053990345862177, -0.07880396803634035, 0.23541827809272542, 0.1075766062997799, 0.10214759459874283, 0.021359187444775468, 0.2621434414345357, 0.1350512770884153, 0.09110763860452506, -0.21745877388554316, 0.07715753202533557, 0.03418682011898555]
|
1,803.09116
|
Uniform interpolation and coherence
|
A variety V is said to be coherent if any finitely generated subalgebra of a
finitely presented member of V is finitely presented. It is shown here that V
is coherent if and only if it satisfies a restricted form of uniform deductive
interpolation: that is, any compact congruence on a finitely generated free
algebra of V restricted to a free algebra over a subset of the generators is
again compact. A general criterion is obtained for establishing failures of
coherence, and hence also of uniform deductive interpolation. This criterion is
then used in conjunction with properties of canonical extensions to prove that
coherence and uniform deductive interpolation fail for certain varieties of
Boolean algebras with operators (in particular, algebras of modal logic K and
its standard non-transitive extensions), double-Heyting algebras, residuated
lattices, and lattices.
|
math.LO
|
a variety v is said to be coherent if any finitely generated subalgebra of a finitely presented member of v is finitely presented it is shown here that v is coherent if and only if it satisfies a restricted form of uniform deductive interpolation that is any compact congruence on a finitely generated free algebra of v restricted to a free algebra over a subset of the generators is again compact a general criterion is obtained for establishing failures of coherence and hence also of uniform deductive interpolation this criterion is then used in conjunction with properties of canonical extensions to prove that coherence and uniform deductive interpolation fail for certain varieties of boolean algebras with operators in particular algebras of modal logic k and its standard nontransitive extensions doubleheyting algebras residuated lattices and lattices
|
[['a', 'variety', 'v', 'is', 'said', 'to', 'be', 'coherent', 'if', 'any', 'finitely', 'generated', 'subalgebra', 'of', 'a', 'finitely', 'presented', 'member', 'of', 'v', 'is', 'finitely', 'presented', 'it', 'is', 'shown', 'here', 'that', 'v', 'is', 'coherent', 'if', 'and', 'only', 'if', 'it', 'satisfies', 'a', 'restricted', 'form', 'of', 'uniform', 'deductive', 'interpolation', 'that', 'is', 'any', 'compact', 'congruence', 'on', 'a', 'finitely', 'generated', 'free', 'algebra', 'of', 'v', 'restricted', 'to', 'a', 'free', 'algebra', 'over', 'a', 'subset', 'of', 'the', 'generators', 'is', 'again', 'compact', 'a', 'general', 'criterion', 'is', 'obtained', 'for', 'establishing', 'failures', 'of', 'coherence', 'and', 'hence', 'also', 'of', 'uniform', 'deductive', 'interpolation', 'this', 'criterion', 'is', 'then', 'used', 'in', 'conjunction', 'with', 'properties', 'of', 'canonical', 'extensions', 'to', 'prove', 'that', 'coherence', 'and', 'uniform', 'deductive', 'interpolation', 'fail', 'for', 'certain', 'varieties', 'of', 'boolean', 'algebras', 'with', 'operators', 'in', 'particular', 'algebras', 'of', 'modal', 'logic', 'k', 'and', 'its', 'standard', 'nontransitive', 'extensions', 'doubleheyting', 'algebras', 'residuated', 'lattices', 'and', 'lattices']]
|
[-0.12810168620946108, 0.11741320224506642, -0.09465781237179441, 0.07148549529470143, -0.1298590461991088, -0.1883525915805306, -0.002839388541265655, 0.3935435200162204, -0.37572633322161525, -0.1341245829582965, 0.10487820990140369, -0.23785022170797213, -0.09117823347311169, 0.23857626771735055, -0.12412904170272288, 0.0019598247013367545, 0.09353503480435474, 0.13562334495346381, -0.08999579888942248, -0.2902299346395337, 0.35602748637963366, -0.05644264306226717, 0.22410805003349182, 0.029168146287104978, 0.13354782677425417, 0.04791597254337993, 0.01987873940075289, 0.062103883439758374, -0.12457563363117949, 0.11840791508916822, 0.29806716926395893, 0.14613163560357834, 0.26874373350014436, -0.33660714367209976, -0.12878459696171443, 0.20266138814361906, 0.11251778030505669, 0.012083379239010723, -0.030560162518722518, -0.2514014430066098, 0.17421506405206408, -0.2074542040033127, -0.12085286153953022, -0.0906504815889161, 0.13753057456985393, 0.038974593723637624, -0.32016359441983167, -0.014607853108692094, 0.1739176127450617, 0.1453426031764152, -0.04065594207165318, -0.026010992299980804, -0.07792402532493779, 0.01712337309675319, -0.11030525498008772, 0.030280824663784744, 0.08175191133797391, -0.053279976167632685, -0.145241055842628, 0.3994084216390194, -0.0045870077003961176, -0.2365711828999555, 0.1587967503930567, -0.1532077488364346, -0.13419232372917347, 0.09391670921164107, 0.04089856078959445, 0.12319430661461153, -0.08727976185644963, 0.21937370831763664, -0.146156514247657, 0.1284610133812721, 0.10115652855958289, 0.045497704959742084, 0.12687613732101563, 0.09999741883357681, 0.08884143695902469, 0.128753609829339, 0.07730443414418833, -0.018415449447790857, -0.3676809289339763, -0.14872831813018048, -0.1513828111798572, 0.09488411998348449, -0.07054227477913885, -0.21033901537124783, 0.37534199379655575, 0.10976221052401547, 0.11003987657934872, 0.09295493089107436, 0.2437298236494717, 0.11925647968301244, 0.12007738656447783, 0.06287029789023992, 0.10911521425387308, 0.2572994990449802, -0.04548720575594552, -0.09930310166552107, 0.01350955811412588, 0.13630961268313174]
|
1,803.09117
|
Topological order generated by random field in a 2D exchange model
|
We study a 2D exchange model with a weak static random field on lattices
containing over one hundred million spins. Ferromagnetic correlations persist
on the Imry-Ma scale inversely proportional to the random-field strength and
decay exponentially at greater distances. We find that the average energy of
the correlated area is close to the ground-state energy of a skyrmion, while
the topological charge of the area is close to $\pm 1$. Correlation function of
the topological charge density exhibits oscillations with a period determined
by the ferromagnetic correlation length, while its Fourier transform exhibits a
maximum. These findings suggest that static randomness transforms a 2D
ferromagnetic state into a skyrmion-antiskyrmion glass.
|
cond-mat.dis-nn cond-mat.stat-mech
|
we study a 2d exchange model with a weak static random field on lattices containing over one hundred million spins ferromagnetic correlations persist on the imryma scale inversely proportional to the randomfield strength and decay exponentially at greater distances we find that the average energy of the correlated area is close to the groundstate energy of a skyrmion while the topological charge of the area is close to pm 1 correlation function of the topological charge density exhibits oscillations with a period determined by the ferromagnetic correlation length while its fourier transform exhibits a maximum these findings suggest that static randomness transforms a 2d ferromagnetic state into a skyrmionantiskyrmion glass
|
[['we', 'study', 'a', '2d', 'exchange', 'model', 'with', 'a', 'weak', 'static', 'random', 'field', 'on', 'lattices', 'containing', 'over', 'one', 'hundred', 'million', 'spins', 'ferromagnetic', 'correlations', 'persist', 'on', 'the', 'imryma', 'scale', 'inversely', 'proportional', 'to', 'the', 'randomfield', 'strength', 'and', 'decay', 'exponentially', 'at', 'greater', 'distances', 'we', 'find', 'that', 'the', 'average', 'energy', 'of', 'the', 'correlated', 'area', 'is', 'close', 'to', 'the', 'groundstate', 'energy', 'of', 'a', 'skyrmion', 'while', 'the', 'topological', 'charge', 'of', 'the', 'area', 'is', 'close', 'to', 'pm', '1', 'correlation', 'function', 'of', 'the', 'topological', 'charge', 'density', 'exhibits', 'oscillations', 'with', 'a', 'period', 'determined', 'by', 'the', 'ferromagnetic', 'correlation', 'length', 'while', 'its', 'fourier', 'transform', 'exhibits', 'a', 'maximum', 'these', 'findings', 'suggest', 'that', 'static', 'randomness', 'transforms', 'a', '2d', 'ferromagnetic', 'state', 'into', 'a', 'skyrmionantiskyrmion', 'glass']]
|
[-0.18462846997955984, 0.22335916540839457, -0.04815465315160426, 0.07988379218996587, 0.009218393941409886, -0.1534381991696798, 0.05921691765543073, 0.3553279468959028, -0.2573127399198711, -0.27721575391478837, 0.03921421044294469, -0.3663823457265442, -0.058178568851541386, 0.15188225548164072, 0.07683508667925543, 0.014586156610378318, -0.02755587851120667, 0.07500211226923222, -0.1287765153937719, -0.20703967473131013, 0.27076562679867494, -0.001417054845528169, 0.3208971481114118, 0.0642042419619181, 0.07626399254182946, 0.023088001866232267, 0.08705663169517223, 0.04703226998787035, -0.15880689848695925, 0.062026074181564826, 0.14293945150619203, -0.05760884908112612, 0.2450445129917088, -0.3885559993203391, -0.1851865624331615, 0.07297796821115878, 0.13192133157916197, 0.10010514433326369, -0.0243984526891092, -0.28063684691336344, 0.0876653176187326, -0.13867827027993784, -0.1351118346803229, -0.04745886045275256, 0.06140000747029924, 0.03101048099713146, -0.2549574441276491, 0.1503543485548686, 0.05028385121417655, 0.06276364771818572, -0.06895363308722154, -0.08743984575637362, -0.0472513272554021, 0.08855625955197452, 0.06675245568727736, 0.10990926431576636, 0.14878884877332232, -0.10603472018106418, -0.0977796889418228, 0.32074035744775425, -0.0740985733626241, -0.14351439825761853, 0.15543404804034666, -0.20190838231197136, -0.04579645863480188, 0.19985886696641417, 0.13704614930426362, 0.06338533443314108, -0.0859164130514149, 0.05077070241148414, -0.021621589945756237, 0.26553332566029647, 0.02132260335863314, 0.07891114479332993, 0.2854722910137339, 0.17996274916116486, 0.08591555289035155, 0.19014396874064748, -0.14580119228075175, -0.1467967064246874, -0.23438335736705498, -0.13226488071324474, -0.2637134671888568, 0.09311585114760833, -0.12904600758007623, -0.19506892083974725, 0.44797317926687275, 0.12440336501564492, 0.2049247621135278, 0.04652664214372635, 0.23687717348167842, 0.10025005428628488, 0.11372697314377134, 0.06148424007379535, 0.23455623474014414, 0.159306065375197, 0.09987386279548942, -0.2587057686749507, 0.026770436890761962, 0.028020977091298183]
|
1,803.09118
|
Absence of bubbling phenomena for non convex anisotropic nearly
umbilical and quasi Einstein hypersurfaces
|
We prove that, for every closed (not necessarily convex) hypersurface
$\Sigma$ in $\mathbb{R}^{n+1}$ and every $p>n$, the $L^p$-norm of the
trace-free part of the anisotropic second fundamental form controls from above
the $W^{2,p}$-closeness of $\Sigma$ to the Wulff shape. In the isotropic
setting, we provide a simpler proof. This result is sharp since in the
subcritical regime $p\leq n$, the lack of convexity assumptions may lead in
general to bubbling phenomena. Moreover, we obtain a stability theorem for
quasi Einstein (not necessarily convex) hypersurfaces and we improve the
quantitative estimates in the convex setting.
|
math.AP math.DG
|
we prove that for every closed not necessarily convex hypersurface sigma in mathbbrn1 and every pn the lpnorm of the tracefree part of the anisotropic second fundamental form controls from above the w2pcloseness of sigma to the wulff shape in the isotropic setting we provide a simpler proof this result is sharp since in the subcritical regime pleq n the lack of convexity assumptions may lead in general to bubbling phenomena moreover we obtain a stability theorem for quasi einstein not necessarily convex hypersurfaces and we improve the quantitative estimates in the convex setting
|
[['we', 'prove', 'that', 'for', 'every', 'closed', 'not', 'necessarily', 'convex', 'hypersurface', 'sigma', 'in', 'mathbbrn1', 'and', 'every', 'pn', 'the', 'lpnorm', 'of', 'the', 'tracefree', 'part', 'of', 'the', 'anisotropic', 'second', 'fundamental', 'form', 'controls', 'from', 'above', 'the', 'w2pcloseness', 'of', 'sigma', 'to', 'the', 'wulff', 'shape', 'in', 'the', 'isotropic', 'setting', 'we', 'provide', 'a', 'simpler', 'proof', 'this', 'result', 'is', 'sharp', 'since', 'in', 'the', 'subcritical', 'regime', 'pleq', 'n', 'the', 'lack', 'of', 'convexity', 'assumptions', 'may', 'lead', 'in', 'general', 'to', 'bubbling', 'phenomena', 'moreover', 'we', 'obtain', 'a', 'stability', 'theorem', 'for', 'quasi', 'einstein', 'not', 'necessarily', 'convex', 'hypersurfaces', 'and', 'we', 'improve', 'the', 'quantitative', 'estimates', 'in', 'the', 'convex', 'setting']]
|
[-0.13939632716969216, 0.03977777872995664, -0.10511883762815306, 0.10247882511041137, -0.07809457550406136, -0.14890269129987685, -0.006883887914560174, 0.31755316865340033, -0.25654352786800555, -0.1831898793768418, 0.10869113211545052, -0.23386334608839723, -0.138736991915271, 0.19572449119521246, -0.1547021572728471, 0.01959937925811016, 0.038276878753877294, 0.05513705461197132, -0.10796876882343122, -0.2546291009833415, 0.3500336301863514, -0.06853529413841584, 0.21648589812559627, 0.124083655385641, 0.06459604202198886, 0.028526787045261553, 0.052583102537419206, 0.027783768311623606, -0.2354957176581612, 0.12200409740019309, 0.26530853092610357, 0.11291550014478464, 0.2678088156177202, -0.4094293974809379, -0.17972466754176283, 0.2028697473097152, 0.14290362293268705, 0.06227540983117476, -0.016838519623683344, -0.24718088278126332, 0.10465339547203432, -0.05134840438803358, -0.23172346543600802, -0.04470252410899247, -0.0027786969978322263, 0.021359396137056813, -0.2895876044327373, 0.11950334832472827, 0.22101985146441766, 0.033997446328641906, -0.1230602339961596, -0.07653351499754134, -0.006008502942139423, 0.0632907677922518, 0.028452326741410038, 0.06662216163565836, 0.0780866356073348, -0.08206642718274668, -0.05179988430632699, 0.3451272060954443, -0.06763491988863035, -0.2743272067558381, 0.11192374634406259, -0.22777587766208315, -0.16544118721378587, 0.13484095996345885, 0.16059413626389477, 0.15409066278727784, -0.09571559893427997, 0.1710728382859479, -0.07885380890420689, 0.13199963111190066, 0.10613438569169531, 0.019842411544779816, 0.10959872253669767, 0.10836539646330219, 0.1750809611472231, 0.1443789558064553, -5.959467061104313e-05, -0.05591924186615694, -0.4162987137153264, -0.16703928366143217, -0.17734972095137003, 0.11080801488752777, -0.1453113867447496, -0.19858494062497412, 0.3187528806588342, 0.03683253961505108, 0.1723506047380387, 0.11532964475292673, 0.23777419860444723, 0.08851603354998333, 0.00872268693481562, 0.12552982087181982, 0.2658899747315914, 0.15971697521426023, 0.07959758558921436, -0.1410136571487597, 0.03495959488434657, 0.12690822586857825]
|
1,803.09119
|
Gradient descent in Gaussian random fields as a toy model for
high-dimensional optimisation in deep learning
|
In this paper we model the loss function of high-dimensional optimization
problems by a Gaussian random field, or equivalently a Gaussian process. Our
aim is to study gradient descent in such loss functions or energy landscapes
and compare it to results obtained from real high-dimensional optimization
problems such as encountered in deep learning. In particular, we analyze the
distribution of the improved loss function after a step of gradient descent,
provide analytic expressions for the moments as well as prove asymptotic
normality as the dimension of the parameter space becomes large. Moreover, we
compare this with the expectation of the global minimum of the landscape
obtained by means of the Euler characteristic of excursion sets. Besides
complementing our analytical findings with numerical results from simulated
Gaussian random fields, we also compare it to loss functions obtained from
optimisation problems on synthetic and real data sets by proposing a "black
box" random field toy-model for a deep neural network loss function.
|
stat.ML cs.LG
|
in this paper we model the loss function of highdimensional optimization problems by a gaussian random field or equivalently a gaussian process our aim is to study gradient descent in such loss functions or energy landscapes and compare it to results obtained from real highdimensional optimization problems such as encountered in deep learning in particular we analyze the distribution of the improved loss function after a step of gradient descent provide analytic expressions for the moments as well as prove asymptotic normality as the dimension of the parameter space becomes large moreover we compare this with the expectation of the global minimum of the landscape obtained by means of the euler characteristic of excursion sets besides complementing our analytical findings with numerical results from simulated gaussian random fields we also compare it to loss functions obtained from optimisation problems on synthetic and real data sets by proposing a black box random field toymodel for a deep neural network loss function
|
[['in', 'this', 'paper', 'we', 'model', 'the', 'loss', 'function', 'of', 'highdimensional', 'optimization', 'problems', 'by', 'a', 'gaussian', 'random', 'field', 'or', 'equivalently', 'a', 'gaussian', 'process', 'our', 'aim', 'is', 'to', 'study', 'gradient', 'descent', 'in', 'such', 'loss', 'functions', 'or', 'energy', 'landscapes', 'and', 'compare', 'it', 'to', 'results', 'obtained', 'from', 'real', 'highdimensional', 'optimization', 'problems', 'such', 'as', 'encountered', 'in', 'deep', 'learning', 'in', 'particular', 'we', 'analyze', 'the', 'distribution', 'of', 'the', 'improved', 'loss', 'function', 'after', 'a', 'step', 'of', 'gradient', 'descent', 'provide', 'analytic', 'expressions', 'for', 'the', 'moments', 'as', 'well', 'as', 'prove', 'asymptotic', 'normality', 'as', 'the', 'dimension', 'of', 'the', 'parameter', 'space', 'becomes', 'large', 'moreover', 'we', 'compare', 'this', 'with', 'the', 'expectation', 'of', 'the', 'global', 'minimum', 'of', 'the', 'landscape', 'obtained', 'by', 'means', 'of', 'the', 'euler', 'characteristic', 'of', 'excursion', 'sets', 'besides', 'complementing', 'our', 'analytical', 'findings', 'with', 'numerical', 'results', 'from', 'simulated', 'gaussian', 'random', 'fields', 'we', 'also', 'compare', 'it', 'to', 'loss', 'functions', 'obtained', 'from', 'optimisation', 'problems', 'on', 'synthetic', 'and', 'real', 'data', 'sets', 'by', 'proposing', 'a', 'black', 'box', 'random', 'field', 'toymodel', 'for', 'a', 'deep', 'neural', 'network', 'loss', 'function']]
|
[-0.04767081281988794, 0.031169574984232895, -0.10251492409734056, 0.1287588898365925, -0.03841032459458802, -0.09235603529086803, 0.039951660385850116, 0.3940964170013103, -0.2945310271294147, -0.2934620123007335, 0.11242836555466056, -0.2517632021990721, -0.21287864616169827, 0.22212167477846378, -0.06699300598120317, 0.12949145378661342, 0.08291910791595, -0.0038572842500798287, -0.08644853544537909, -0.26643811288522556, 0.35057404742838116, 0.04610298768639041, 0.2661080261459574, -0.0015599338403262664, 0.13951317816463416, 0.04534398502291879, -0.0036582246189936995, 0.041001759244500134, -0.11724156494019553, 0.1331948217113677, 0.21171600552333986, 0.1768998943240149, 0.32139441337203606, -0.40457668696762994, -0.26729519442924354, 0.1295319132943405, 0.1470197050832212, 0.10561408172943629, -0.05383696888384293, -0.2642071440874133, 0.07735692597925663, -0.12751440281572285, -0.1262326996627962, -0.10621140348666813, -0.043209595623920904, 0.08299241842651099, -0.3347061202053737, 0.06834647803461849, 0.018983535845472944, 0.07249016712303273, -0.07207895593892318, -0.15566061511053703, 0.011330659985833335, 0.08548442911196616, 0.07051913960367528, 0.06282923299695539, 0.12362504543561954, -0.1548260879022564, -0.13633580092573538, 0.3186772212240612, -0.09844963473151438, -0.23506424125516787, 0.1589678322750842, -0.10794418124423828, -0.08878205262881238, 0.0778300391335506, 0.22883638973580672, 0.14531786144871148, -0.12849405816523357, 0.09503124419643427, -0.030057956757082137, 0.08443995038396679, 0.029570459498791023, -0.02006148624350317, 0.1344359706126852, 0.166509696385765, 0.09269898229977117, 0.2221667731748312, -0.0760971739760862, -0.12978977489401586, -0.3148813213338144, -0.11170050161308609, -0.23723660086106974, 0.052102695388020946, -0.15619525636921025, -0.2009172080026474, 0.38354621923936066, 0.1489776156115113, 0.2737328914226964, 0.13566504828922915, 0.32394088367000223, 0.13833091396809322, 0.033643056098662784, 0.06651499812869588, 0.17450863923004362, 0.12624777630117023, 0.08887923614383908, -0.17151695747306803, 0.03762086365022697, 0.04890545541129541]
|
1,803.0912
|
The nuclear symmetry energy and the breaking of the isospin symmetry:
how do they reconcile with each other?
|
We analyze and propose a solution to the apparent inconsistency between our
current knowledge of the Equation of State of asymmetric nuclear matter, the
energy of the Isobaric Analog State (IAS) in a heavy nucleus such as 208Pb, and
the isospin symmetry breaking forces in the nuclear medium. This is achieved by
performing state-of-the-art Hartree-Fock plus Random Phase Approximation
calculations of the IAS that include all isospin symmetry breaking
contributions. To this aim, we propose a new effective interaction that is
successful in reproducing the IAS excitation energy without compromising other
properties of finite nuclei.
|
nucl-th nucl-ex
|
we analyze and propose a solution to the apparent inconsistency between our current knowledge of the equation of state of asymmetric nuclear matter the energy of the isobaric analog state ias in a heavy nucleus such as 208pb and the isospin symmetry breaking forces in the nuclear medium this is achieved by performing stateoftheart hartreefock plus random phase approximation calculations of the ias that include all isospin symmetry breaking contributions to this aim we propose a new effective interaction that is successful in reproducing the ias excitation energy without compromising other properties of finite nuclei
|
[['we', 'analyze', 'and', 'propose', 'a', 'solution', 'to', 'the', 'apparent', 'inconsistency', 'between', 'our', 'current', 'knowledge', 'of', 'the', 'equation', 'of', 'state', 'of', 'asymmetric', 'nuclear', 'matter', 'the', 'energy', 'of', 'the', 'isobaric', 'analog', 'state', 'ias', 'in', 'a', 'heavy', 'nucleus', 'such', 'as', '208pb', 'and', 'the', 'isospin', 'symmetry', 'breaking', 'forces', 'in', 'the', 'nuclear', 'medium', 'this', 'is', 'achieved', 'by', 'performing', 'stateoftheart', 'hartreefock', 'plus', 'random', 'phase', 'approximation', 'calculations', 'of', 'the', 'ias', 'that', 'include', 'all', 'isospin', 'symmetry', 'breaking', 'contributions', 'to', 'this', 'aim', 'we', 'propose', 'a', 'new', 'effective', 'interaction', 'that', 'is', 'successful', 'in', 'reproducing', 'the', 'ias', 'excitation', 'energy', 'without', 'compromising', 'other', 'properties', 'of', 'finite', 'nuclei']]
|
[-0.10581723831005786, 0.14178482564043646, -0.11667465408773799, 0.11876567578629443, -0.027546170701910008, -0.08739112047478556, 0.060904408486461954, 0.3311789726323791, -0.20879304752145944, -0.2956321271062878, 0.02441382756775343, -0.27428650637402346, -0.04825450680953892, 0.0462723467866645, 0.05144541966973951, 0.03858700757846236, -0.0029758586597285774, 0.04197773915764533, -0.11762022162346464, -0.14410847804116966, 0.3434127321638363, 0.07525241823474828, 0.26700313818690025, 0.11075946363799678, 0.09232045030221343, 0.0280090032096364, 0.03736203587859085, -0.07227104986576657, -0.07981248987719147, 0.0807857853703593, 0.2572582197234672, 0.061452462867294486, 0.21081291731250915, -0.47727585478048573, -0.22029160252974467, 0.15488131468821514, 0.12307956221660502, 0.2075137581088041, -0.13121064015124972, -0.29224838665931635, 0.03482313595320049, -0.26663495882561333, -0.18096351292670557, -0.12319285812738695, -0.03248275004719433, 0.008885611554509716, -0.24787084366145887, 0.1343056949575456, 0.044409271496299065, 0.020088670777055853, -0.12218059207263746, -0.19760282059249126, -0.013183583199095569, 0.06904644050978516, 0.07839966447239644, 0.03012269596618257, 0.1539799688662721, -0.16805843114362737, -0.0832147329996683, 0.41871926341401905, -0.03863057631411051, -0.13404262209017026, 0.1258212495154064, -0.08638518842329321, -0.12351809994097014, 0.12589798771139038, 0.15313008195999397, 0.08993623131720692, -0.15195505533759532, 0.08033652700557324, 0.0028831379880246365, 0.18232658660333406, 0.0033205881616786906, 0.04105667010145752, 0.13067057096693468, 0.19096209904865213, 0.01666960104515678, 0.10612448445141413, -0.10901878687834955, -0.1350465100209572, -0.33205371757871227, -0.0954213027597258, -0.17339162774273734, 0.057231729482545665, -0.056609432840119364, -0.09068072303443363, 0.3943766524917201, 0.10115288213679666, 0.17112468366364114, -0.021766298995843453, 0.3333847502050431, 0.08093629965166513, 0.05482662369154002, 0.034626901394834646, 0.3099509670154045, 0.16392870947326485, 0.07472559543032395, -0.3460819628922955, 0.05505700100605425, 0.05388385380471223]
|
1,803.09121
|
Probability measure changes in Monte Carlo simulation
|
The objective of Bayesian inference is often to infer, from data, a
probability measure for a random variable that can be used as input for Monte
Carlo simulation. When datasets for Bayesian inference are small, a principle
challenge is that, as additional data are collected, the probability measure
inferred from Bayesian inference may change significantly. That is, the
original probability density inferred from Bayesian inference may differ
considerably from the updated probability density both in its model form and
parameters. In such cases, expensive Monte Carlo simulations may have already
been performed using the original distribution and it is infeasible to start
again and perform a new Monte Carlo analysis using the updated density due to
the large added computational cost. In this work, we discuss four strategies
for updating Mote Carlo simulations for such a change in probability measure:
1. Importance sampling reweighting; 2. A sample augmenting strategy; 3. A
sample filtering strategy; and 4. A mixed augmenting-filtering strategy. The
efficiency of each strategy is compared and the ultimate aim is to achieve the
change in distribution with a minimal number of added computational
simulations. The comparison results show that when the change in measure is
small importance sampling reweighting can be very effective. Otherwise, a
proposed novel mixed augmenting-filtering algorithm can robustly and
efficiently accommodate a measure change in Monte Carlo simulation that
minimizes the impact on the sample set and saves a large amount of additional
computational cost. The strategy is then applied for uncertainty quantification
in the buckling strength of a simple plate given ongoing data collection to
estimate uncertainty in the yield stress.
|
stat.CO
|
the objective of bayesian inference is often to infer from data a probability measure for a random variable that can be used as input for monte carlo simulation when datasets for bayesian inference are small a principle challenge is that as additional data are collected the probability measure inferred from bayesian inference may change significantly that is the original probability density inferred from bayesian inference may differ considerably from the updated probability density both in its model form and parameters in such cases expensive monte carlo simulations may have already been performed using the original distribution and it is infeasible to start again and perform a new monte carlo analysis using the updated density due to the large added computational cost in this work we discuss four strategies for updating mote carlo simulations for such a change in probability measure 1 importance sampling reweighting 2 a sample augmenting strategy 3 a sample filtering strategy and 4 a mixed augmentingfiltering strategy the efficiency of each strategy is compared and the ultimate aim is to achieve the change in distribution with a minimal number of added computational simulations the comparison results show that when the change in measure is small importance sampling reweighting can be very effective otherwise a proposed novel mixed augmentingfiltering algorithm can robustly and efficiently accommodate a measure change in monte carlo simulation that minimizes the impact on the sample set and saves a large amount of additional computational cost the strategy is then applied for uncertainty quantification in the buckling strength of a simple plate given ongoing data collection to estimate uncertainty in the yield stress
|
[['the', 'objective', 'of', 'bayesian', 'inference', 'is', 'often', 'to', 'infer', 'from', 'data', 'a', 'probability', 'measure', 'for', 'a', 'random', 'variable', 'that', 'can', 'be', 'used', 'as', 'input', 'for', 'monte', 'carlo', 'simulation', 'when', 'datasets', 'for', 'bayesian', 'inference', 'are', 'small', 'a', 'principle', 'challenge', 'is', 'that', 'as', 'additional', 'data', 'are', 'collected', 'the', 'probability', 'measure', 'inferred', 'from', 'bayesian', 'inference', 'may', 'change', 'significantly', 'that', 'is', 'the', 'original', 'probability', 'density', 'inferred', 'from', 'bayesian', 'inference', 'may', 'differ', 'considerably', 'from', 'the', 'updated', 'probability', 'density', 'both', 'in', 'its', 'model', 'form', 'and', 'parameters', 'in', 'such', 'cases', 'expensive', 'monte', 'carlo', 'simulations', 'may', 'have', 'already', 'been', 'performed', 'using', 'the', 'original', 'distribution', 'and', 'it', 'is', 'infeasible', 'to', 'start', 'again', 'and', 'perform', 'a', 'new', 'monte', 'carlo', 'analysis', 'using', 'the', 'updated', 'density', 'due', 'to', 'the', 'large', 'added', 'computational', 'cost', 'in', 'this', 'work', 'we', 'discuss', 'four', 'strategies', 'for', 'updating', 'mote', 'carlo', 'simulations', 'for', 'such', 'a', 'change', 'in', 'probability', 'measure', '1', 'importance', 'sampling', 'reweighting', '2', 'a', 'sample', 'augmenting', 'strategy', '3', 'a', 'sample', 'filtering', 'strategy', 'and', '4', 'a', 'mixed', 'augmentingfiltering', 'strategy', 'the', 'efficiency', 'of', 'each', 'strategy', 'is', 'compared', 'and', 'the', 'ultimate', 'aim', 'is', 'to', 'achieve', 'the', 'change', 'in', 'distribution', 'with', 'a', 'minimal', 'number', 'of', 'added', 'computational', 'simulations', 'the', 'comparison', 'results', 'show', 'that', 'when', 'the', 'change', 'in', 'measure', 'is', 'small', 'importance', 'sampling', 'reweighting', 'can', 'be', 'very', 'effective', 'otherwise', 'a', 'proposed', 'novel', 'mixed', 'augmentingfiltering', 'algorithm', 'can', 'robustly', 'and', 'efficiently', 'accommodate', 'a', 'measure', 'change', 'in', 'monte', 'carlo', 'simulation', 'that', 'minimizes', 'the', 'impact', 'on', 'the', 'sample', 'set', 'and', 'saves', 'a', 'large', 'amount', 'of', 'additional', 'computational', 'cost', 'the', 'strategy', 'is', 'then', 'applied', 'for', 'uncertainty', 'quantification', 'in', 'the', 'buckling', 'strength', 'of', 'a', 'simple', 'plate', 'given', 'ongoing', 'data', 'collection', 'to', 'estimate', 'uncertainty', 'in', 'the', 'yield', 'stress']]
|
[-0.04049876978606882, 0.08283435686883565, -0.12356466616160776, 0.11235946282539587, -0.06041586490635081, -0.11672732462280226, 0.10706592676635916, 0.40250204993180816, -0.28055191554192144, -0.3867396918139455, 0.12580182056312092, -0.2611295171922311, -0.10316054666825374, 0.18234545376704991, -0.07170836747837554, 0.08812254019360814, 0.13496097412461036, 0.002079045760648367, -0.07072980035576948, -0.22488990568037712, 0.23816672584595144, 0.11385875230101883, 0.3003654693698868, -0.03261214185373059, 0.09091136472289191, 0.009538945089194126, -0.06927254534443784, 0.05936251863924307, -0.11760784903192946, 0.10265895656723165, 0.24366331304059385, 0.17080614127115765, 0.32083723592200786, -0.39249385500555317, -0.22721002745981278, 0.1395212852010281, 0.13888772009675832, 0.13482466733037832, -0.05887052697817536, -0.2354462189736419, 0.07562778053211776, -0.20282902308088496, -0.07922254878628467, -0.09936463389426638, -0.02553276117554957, 0.01397133132887486, -0.339019787753407, 0.06797601232233833, -0.04168152002638724, 0.03731376862965692, 0.0005865534868168371, -0.14937248179352933, -0.025243025447269973, 0.10448282029671434, 0.0230483272751002, 0.06302498907544055, 0.14884334185188705, -0.10118810909789727, -0.11074590036659536, 0.33558545504605636, -0.04495538937897751, -0.2366521116451157, 0.16474687849185465, -0.09224623222782843, -0.16152137012353965, 0.17989034622494496, 0.20080874482855984, 0.10121505690521483, -0.16255088854124647, 0.05316057842757896, 0.0011046031946001253, 0.1847020197481169, -0.018816215674133788, -0.041843199670048695, 0.15322721799611486, 0.2099735609013272, 0.06965952564452782, 0.14053163041983893, -0.15329017442521112, -0.12681072213007769, -0.26942772335281834, -0.14563540335135408, -0.25131405129699613, 0.023251024411406536, -0.12271171198818435, -0.12988887156913043, 0.32263370861274826, 0.23905545775822357, 0.1825089926894446, 0.09989488288354044, 0.3122418760497095, 0.10440919163013866, 0.05432706333511278, 0.05601174975185186, 0.1974029269671642, 0.07651639952065241, 0.04866273520353313, -0.20749244719999319, 0.14281862125297853, -0.00021817185040703393]
|
1,803.09122
|
A multilevel Monte Carlo method for high-dimensional uncertainty
quantification of low-frequency electromagnetic devices
|
This work addresses uncertainty quantification of electromagnetic devices
determined by the eddy current problem. The multilevel Monte Carlo (MLMC)
method is used for the treatment of uncertain parameters while the devices are
discretized in space by the finite element method. Both methods yield numerical
approximations such that the total errors is split into stochastic and spatial
contributions. We propose a particular implementation where the spatial error
is controlled based on a Richardson-extrapolation-based error indicator. The
stochastic error in turn is efficiently reduced in the MLMC approach by
distributing the samples on multiple grids. The method is applied to a toy
problem with closed-form solution and a permanent magnet synchronous machine
with uncertainties. The uncertainties under consideration are related to the
material properties in the stator and the magnets in the rotor. The examples
show that the error indicator works reliably, the meshes used for the different
levels do not have to be nested and, most importantly, MLMC reduces the
computational cost by at least one order of magnitude compared to standard
Monte Carlo.
|
cs.CE
|
this work addresses uncertainty quantification of electromagnetic devices determined by the eddy current problem the multilevel monte carlo mlmc method is used for the treatment of uncertain parameters while the devices are discretized in space by the finite element method both methods yield numerical approximations such that the total errors is split into stochastic and spatial contributions we propose a particular implementation where the spatial error is controlled based on a richardsonextrapolationbased error indicator the stochastic error in turn is efficiently reduced in the mlmc approach by distributing the samples on multiple grids the method is applied to a toy problem with closedform solution and a permanent magnet synchronous machine with uncertainties the uncertainties under consideration are related to the material properties in the stator and the magnets in the rotor the examples show that the error indicator works reliably the meshes used for the different levels do not have to be nested and most importantly mlmc reduces the computational cost by at least one order of magnitude compared to standard monte carlo
|
[['this', 'work', 'addresses', 'uncertainty', 'quantification', 'of', 'electromagnetic', 'devices', 'determined', 'by', 'the', 'eddy', 'current', 'problem', 'the', 'multilevel', 'monte', 'carlo', 'mlmc', 'method', 'is', 'used', 'for', 'the', 'treatment', 'of', 'uncertain', 'parameters', 'while', 'the', 'devices', 'are', 'discretized', 'in', 'space', 'by', 'the', 'finite', 'element', 'method', 'both', 'methods', 'yield', 'numerical', 'approximations', 'such', 'that', 'the', 'total', 'errors', 'is', 'split', 'into', 'stochastic', 'and', 'spatial', 'contributions', 'we', 'propose', 'a', 'particular', 'implementation', 'where', 'the', 'spatial', 'error', 'is', 'controlled', 'based', 'on', 'a', 'richardsonextrapolationbased', 'error', 'indicator', 'the', 'stochastic', 'error', 'in', 'turn', 'is', 'efficiently', 'reduced', 'in', 'the', 'mlmc', 'approach', 'by', 'distributing', 'the', 'samples', 'on', 'multiple', 'grids', 'the', 'method', 'is', 'applied', 'to', 'a', 'toy', 'problem', 'with', 'closedform', 'solution', 'and', 'a', 'permanent', 'magnet', 'synchronous', 'machine', 'with', 'uncertainties', 'the', 'uncertainties', 'under', 'consideration', 'are', 'related', 'to', 'the', 'material', 'properties', 'in', 'the', 'stator', 'and', 'the', 'magnets', 'in', 'the', 'rotor', 'the', 'examples', 'show', 'that', 'the', 'error', 'indicator', 'works', 'reliably', 'the', 'meshes', 'used', 'for', 'the', 'different', 'levels', 'do', 'not', 'have', 'to', 'be', 'nested', 'and', 'most', 'importantly', 'mlmc', 'reduces', 'the', 'computational', 'cost', 'by', 'at', 'least', 'one', 'order', 'of', 'magnitude', 'compared', 'to', 'standard', 'monte', 'carlo']]
|
[-0.08618071510424015, 0.06726880894627335, -0.04605703337421251, 0.09202982460116145, -0.02465408553401831, -0.1163520202809555, 0.04911205552106853, 0.38431530289871746, -0.276922518845653, -0.34647323155970594, 0.12661131383880952, -0.2529979669602336, -0.09549460095775769, 0.230473702378858, -0.08708152463145251, 0.09476611274971389, 0.09562976546802146, -0.016556945415538583, -0.0900576582525689, -0.24934660079130946, 0.26060062865144573, 0.07445564611441303, 0.3013374087357417, -0.01274848593633113, 0.12465423159030548, -0.03409969234611666, -0.02367055017317017, 0.04895068567261766, -0.10381848283890746, 0.1440437658226962, 0.2447950854507643, 0.06705116592401769, 0.3220682196470714, -0.44174208763856876, -0.21653731882052366, 0.0878553996041964, 0.13402798430700408, 0.14299245308516115, -0.013177100402508798, -0.2525158232067127, 0.07674391001468352, -0.17487608880172809, -0.08395230507482855, -0.08163513025122716, -0.06898804857168174, 0.04878218066411602, -0.3065529152166185, 0.07747322085806234, 0.009868871171547229, 0.03992344207078933, 0.004226862496749206, -0.15644921200230805, 0.024705811267648283, 0.10330102034183869, 0.03887030123976644, 0.017333974929114933, 0.13106670123958136, -0.07707707206417433, -0.12785946124579844, 0.376783910521501, -0.02739780431350715, -0.291868237917126, 0.1224357656671579, -0.09274951912744274, -0.10484103966222773, 0.1667577673824569, 0.18312331977527763, 0.12731371876640857, -0.1695885553375309, 0.0766607039191132, 0.03139042494639884, 0.16758196703956982, -0.027008126457330098, -0.017052302792191852, 0.12253451834671027, 0.18776762388987728, 0.0823111179809974, 0.13244542093381698, -0.1103554115424929, -0.13617354669326612, -0.2791578705306842, -0.13625017241683118, -0.2046037709129281, -0.025711172229125095, -0.10909120470776458, -0.17026846590830924, 0.3660122071647324, 0.217185637724131, 0.12455488966647969, 0.05363693185757066, 0.3643568477181848, 0.1481664835781314, 0.07665978831260703, 0.08614629524121017, 0.20274296123263708, 0.1186851780468376, 0.0574339292686281, -0.2671587984862759, 0.11804682502880433, 0.09509503171064479]
|
1,803.09123
|
Equation Embeddings
|
We present an unsupervised approach for discovering semantic representations
of mathematical equations. Equations are challenging to analyze because each is
unique, or nearly unique. Our method, which we call equation embeddings, finds
good representations of equations by using the representations of their
surrounding words. We used equation embeddings to analyze four collections of
scientific articles from the arXiv, covering four computer science domains
(NLP, IR, AI, and ML) and $\sim$98.5k equations. Quantitatively, we found that
equation embeddings provide better models when compared to existing word
embedding approaches. Qualitatively, we found that equation embeddings provide
coherent semantic representations of equations and can capture semantic
similarity to other equations and to words.
|
stat.ML cs.CL cs.LG
|
we present an unsupervised approach for discovering semantic representations of mathematical equations equations are challenging to analyze because each is unique or nearly unique our method which we call equation embeddings finds good representations of equations by using the representations of their surrounding words we used equation embeddings to analyze four collections of scientific articles from the arxiv covering four computer science domains nlp ir ai and ml and sim985k equations quantitatively we found that equation embeddings provide better models when compared to existing word embedding approaches qualitatively we found that equation embeddings provide coherent semantic representations of equations and can capture semantic similarity to other equations and to words
|
[['we', 'present', 'an', 'unsupervised', 'approach', 'for', 'discovering', 'semantic', 'representations', 'of', 'mathematical', 'equations', 'equations', 'are', 'challenging', 'to', 'analyze', 'because', 'each', 'is', 'unique', 'or', 'nearly', 'unique', 'our', 'method', 'which', 'we', 'call', 'equation', 'embeddings', 'finds', 'good', 'representations', 'of', 'equations', 'by', 'using', 'the', 'representations', 'of', 'their', 'surrounding', 'words', 'we', 'used', 'equation', 'embeddings', 'to', 'analyze', 'four', 'collections', 'of', 'scientific', 'articles', 'from', 'the', 'arxiv', 'covering', 'four', 'computer', 'science', 'domains', 'nlp', 'ir', 'ai', 'and', 'ml', 'and', 'sim985k', 'equations', 'quantitatively', 'we', 'found', 'that', 'equation', 'embeddings', 'provide', 'better', 'models', 'when', 'compared', 'to', 'existing', 'word', 'embedding', 'approaches', 'qualitatively', 'we', 'found', 'that', 'equation', 'embeddings', 'provide', 'coherent', 'semantic', 'representations', 'of', 'equations', 'and', 'can', 'capture', 'semantic', 'similarity', 'to', 'other', 'equations', 'and', 'to', 'words']]
|
[-0.02573253821855018, -0.01081800689253798, -0.10618389775087937, 0.12274880404050094, -0.1679538218518121, -0.1344580793702001, -0.004845193888428151, 0.40610942012980716, -0.3394895858994318, -0.3391849386907362, 0.013432067651258902, -0.37041502660823933, -0.1681619136948822, 0.19934371465693201, -0.07110721254379514, 0.05329402807860746, 0.12781001615483278, 0.057768528798804404, -0.11578223466287889, -0.2918821518061631, 0.3377927335410661, -0.05522919803379326, 0.3217047517350234, -0.01573236305864716, 0.1613288566922991, -0.07243118040827573, -0.0741807832510783, -0.0025089594339012004, -0.14673781851287868, 0.21782867891560181, 0.3853767438477758, 0.19574446960805206, 0.2402268759030507, -0.3982371362481574, -0.21492902629735341, 0.07555268184760364, 0.19789274724722636, 0.13512360495878298, -0.018115982020256716, -0.3595334689619891, 0.0729649951831019, -0.14010698050944084, -0.01338254420701927, -0.19290263575732436, 0.024491410352152968, 0.019769080341024616, -0.19945494999357183, 0.028525467688610796, 0.08744401434316822, 0.04127974826159007, -0.14054871132648591, -0.12095979670780378, 0.016668851269460327, 0.14959610192614625, 0.04939946849454502, 0.02935707687032879, 0.055853869116634404, -0.20107843886223545, -0.15323883220724283, 0.4102436402180326, -0.07228895256705924, -0.27280277582825324, 0.24316264581311187, -0.04701437552912383, -0.1406467905900347, 0.0612601255528082, 0.20682502074547351, 0.10429115324076094, -0.1890737131701776, 0.05060435277132164, -0.061275872589866505, 0.2046326756896024, 0.09798207746951097, 0.001353934056920196, 0.16255599983440233, 0.18221190849259292, -0.013187589798840361, 0.1007084108225856, -0.010282063737101511, -0.07380183198737032, -0.2049904014282954, -0.12457554206816018, -0.09369030013817166, 0.01462391716077787, -0.1192160957282486, -0.17149192790304302, 0.38807373797230493, 0.23424541037059773, 0.14971923150139255, 0.0645619760355015, 0.26535010841939977, 0.0767235726581613, 0.0696717329756378, 0.11859222754853171, 0.12928495790228384, 0.09060669320832015, 0.11624835857506328, -0.11432007349250035, 0.03536297615677323, 0.1485673436476345]
|
1,803.09124
|
When can gravity path-entangle two spatially superposed masses?
|
An experimental test of quantum effects in gravity has recently been
proposed, where the ability of the gravitational field to entangle two masses
is used as a witness of its quantum nature. The key idea is that if gravity can
generate entanglement between two masses then it must have at least some
quantum features (i.e., two non-commuting observables). Here we discuss what
existing models for coupled matter and gravity predict for this experiment.
Collapse-type models, and also quantum field theory in curved spacetime, as
well as various induced gravities, do not predict entanglement generation; they
would therefore be ruled out by observing entanglement in the experiment.
Instead, local linearised quantum gravity models predict that the masses can
become entangled. We analyse the mechanism by which entanglement is established
in such models, modelling a gravity-assisted two-qubit gate.
|
quant-ph
|
an experimental test of quantum effects in gravity has recently been proposed where the ability of the gravitational field to entangle two masses is used as a witness of its quantum nature the key idea is that if gravity can generate entanglement between two masses then it must have at least some quantum features ie two noncommuting observables here we discuss what existing models for coupled matter and gravity predict for this experiment collapsetype models and also quantum field theory in curved spacetime as well as various induced gravities do not predict entanglement generation they would therefore be ruled out by observing entanglement in the experiment instead local linearised quantum gravity models predict that the masses can become entangled we analyse the mechanism by which entanglement is established in such models modelling a gravityassisted twoqubit gate
|
[['an', 'experimental', 'test', 'of', 'quantum', 'effects', 'in', 'gravity', 'has', 'recently', 'been', 'proposed', 'where', 'the', 'ability', 'of', 'the', 'gravitational', 'field', 'to', 'entangle', 'two', 'masses', 'is', 'used', 'as', 'a', 'witness', 'of', 'its', 'quantum', 'nature', 'the', 'key', 'idea', 'is', 'that', 'if', 'gravity', 'can', 'generate', 'entanglement', 'between', 'two', 'masses', 'then', 'it', 'must', 'have', 'at', 'least', 'some', 'quantum', 'features', 'ie', 'two', 'noncommuting', 'observables', 'here', 'we', 'discuss', 'what', 'existing', 'models', 'for', 'coupled', 'matter', 'and', 'gravity', 'predict', 'for', 'this', 'experiment', 'collapsetype', 'models', 'and', 'also', 'quantum', 'field', 'theory', 'in', 'curved', 'spacetime', 'as', 'well', 'as', 'various', 'induced', 'gravities', 'do', 'not', 'predict', 'entanglement', 'generation', 'they', 'would', 'therefore', 'be', 'ruled', 'out', 'by', 'observing', 'entanglement', 'in', 'the', 'experiment', 'instead', 'local', 'linearised', 'quantum', 'gravity', 'models', 'predict', 'that', 'the', 'masses', 'can', 'become', 'entangled', 'we', 'analyse', 'the', 'mechanism', 'by', 'which', 'entanglement', 'is', 'established', 'in', 'such', 'models', 'modelling', 'a', 'gravityassisted', 'twoqubit', 'gate']]
|
[-0.09140975459961703, 0.21616695049074391, -0.1230997054182269, 0.12134091829432657, -0.03249491962638718, -0.22277309817641422, -0.04318921157176158, 0.3483450972026697, -0.22398188325266044, -0.3202673152641014, 0.06795272312161547, -0.2615341288313546, -0.1458715556292898, 0.19423633030253565, -0.030750362443116804, 0.08450303666112531, -0.0021770900563785325, 0.049431507034158266, -0.0591226155947273, -0.2555116304575845, 0.31825212973204475, 0.058252030706757475, 0.23787372032076948, 0.06102905246360159, 0.09231813747297835, -0.07615247220835752, 0.018884113455122267, 0.04200769217374424, -0.10232582869820935, 0.04488388619006232, 0.2570584276222184, 0.1425413161119515, 0.23969914103271783, -0.4495107293542888, -0.26658079562087855, 0.12998958521833023, 0.12739185661819108, 0.19142947558365347, -0.049672776124336654, -0.30212246669387377, 0.027607077888764993, -0.19371143657783116, -0.10284017338934871, -0.12398408004945075, 1.668135152646789e-05, -0.07056936706562907, -0.22412580662510462, 0.05557428216712584, 0.026180189948839448, 0.002314698195550591, -0.005782102696011188, -0.020979470058551265, -0.028357439785678354, 0.1114173243753612, 0.006687008759386286, 0.017282965358484673, 0.13161595859349257, -0.14085352048579672, -0.1750255916647061, 0.38464321068453566, -0.07805986425028769, -0.21844137916858825, 0.20121621468656317, -0.1322477306411774, -0.1258039002110578, -0.008478259850569346, 0.15238229164646733, 0.12191813901342728, -0.16232006960307008, 0.07414422723361187, -0.020641790461485034, 0.17198612962125076, 0.05671364342862809, 0.09639421435142005, 0.3370836365485081, 0.0778066413132129, 0.016820371351032346, 0.11156569858581794, -0.07862168253502912, -0.12265135917329678, -0.31926374010465763, -0.1802350589764063, -0.19493596841995087, 0.07873472328032625, -0.058948874959713536, -0.10923389837973647, 0.3784176284240352, 0.2078037698649698, 0.1392502862546179, 0.010198449728906982, 0.2712206123396754, 0.0901941373306154, 0.10449267228099483, 0.04627269914166795, 0.33432938562537956, 0.14357601309333134, 0.03027286355694135, -0.24276580337986903, 0.0335859561925409, 0.04377498399052355]
|
1,803.09125
|
Predicting Gaze in Egocentric Video by Learning Task-dependent Attention
Transition
|
We present a new computational model for gaze prediction in egocentric videos
by exploring patterns in temporal shift of gaze fixations (attention
transition) that are dependent on egocentric manipulation tasks. Our assumption
is that the high-level context of how a task is completed in a certain way has
a strong influence on attention transition and should be modeled for gaze
prediction in natural dynamic scenes. Specifically, we propose a hybrid model
based on deep neural networks which integrates task-dependent attention
transition with bottom-up saliency prediction. In particular, the
task-dependent attention transition is learned with a recurrent neural network
to exploit the temporal context of gaze fixations, e.g. looking at a cup after
moving gaze away from a grasped bottle. Experiments on public egocentric
activity datasets show that our model significantly outperforms
state-of-the-art gaze prediction methods and is able to learn meaningful
transition of human attention.
|
cs.CV
|
we present a new computational model for gaze prediction in egocentric videos by exploring patterns in temporal shift of gaze fixations attention transition that are dependent on egocentric manipulation tasks our assumption is that the highlevel context of how a task is completed in a certain way has a strong influence on attention transition and should be modeled for gaze prediction in natural dynamic scenes specifically we propose a hybrid model based on deep neural networks which integrates taskdependent attention transition with bottomup saliency prediction in particular the taskdependent attention transition is learned with a recurrent neural network to exploit the temporal context of gaze fixations eg looking at a cup after moving gaze away from a grasped bottle experiments on public egocentric activity datasets show that our model significantly outperforms stateoftheart gaze prediction methods and is able to learn meaningful transition of human attention
|
[['we', 'present', 'a', 'new', 'computational', 'model', 'for', 'gaze', 'prediction', 'in', 'egocentric', 'videos', 'by', 'exploring', 'patterns', 'in', 'temporal', 'shift', 'of', 'gaze', 'fixations', 'attention', 'transition', 'that', 'are', 'dependent', 'on', 'egocentric', 'manipulation', 'tasks', 'our', 'assumption', 'is', 'that', 'the', 'highlevel', 'context', 'of', 'how', 'a', 'task', 'is', 'completed', 'in', 'a', 'certain', 'way', 'has', 'a', 'strong', 'influence', 'on', 'attention', 'transition', 'and', 'should', 'be', 'modeled', 'for', 'gaze', 'prediction', 'in', 'natural', 'dynamic', 'scenes', 'specifically', 'we', 'propose', 'a', 'hybrid', 'model', 'based', 'on', 'deep', 'neural', 'networks', 'which', 'integrates', 'taskdependent', 'attention', 'transition', 'with', 'bottomup', 'saliency', 'prediction', 'in', 'particular', 'the', 'taskdependent', 'attention', 'transition', 'is', 'learned', 'with', 'a', 'recurrent', 'neural', 'network', 'to', 'exploit', 'the', 'temporal', 'context', 'of', 'gaze', 'fixations', 'eg', 'looking', 'at', 'a', 'cup', 'after', 'moving', 'gaze', 'away', 'from', 'a', 'grasped', 'bottle', 'experiments', 'on', 'public', 'egocentric', 'activity', 'datasets', 'show', 'that', 'our', 'model', 'significantly', 'outperforms', 'stateoftheart', 'gaze', 'prediction', 'methods', 'and', 'is', 'able', 'to', 'learn', 'meaningful', 'transition', 'of', 'human', 'attention']]
|
[-0.03425583325583359, 0.06518253706524084, -0.09683937393771164, 0.05850014526192259, -0.1532082703060888, -0.22162365002621864, 0.039675909427500426, 0.5463740312590681, -0.23125557918743841, -0.2967877106082722, 0.029209861339969112, -0.28001876775946083, -0.27069277204573156, 0.1533184870611876, -0.17838664301510515, 0.055862988972362006, 0.15776836602418715, 0.10796668012465896, -0.06959055118294882, -0.19500691992680316, 0.2837558793510182, 0.007350245540247074, 0.3497860317792872, 0.013848340418189765, 0.1527925720695278, -0.022642849844976744, -0.022846006040846738, -0.008985669173075464, -0.07156670255629659, 0.19137260600731804, 0.31131902725018307, 0.1718160621693422, 0.3317755752981737, -0.4182643507061333, -0.29997420731113006, 0.04476053175548541, 0.11785965544394426, 0.11740455203539098, -0.07513638870019851, -0.4455017075745453, 0.05560219495814165, -0.15364237282473336, 0.07064611685526526, -0.1283593015231449, 0.032297199945254575, -0.05473533316419042, -0.2886504527317874, 0.028829776031639557, 0.08236006420940675, 0.12503005109470466, -0.03097802649557205, -0.031345653845446894, -0.00839247078602684, 0.24909955193409053, 0.053088710495624046, 0.09950481360649754, 0.1825682555622389, -0.227127198924728, -0.15626603980821654, 0.3855281172898309, -0.05039089979957147, -0.19737325353098326, 0.16718232835771452, -0.06628018051128963, -0.1835481340932692, 0.09905723411397173, 0.2776101343654867, 0.14412939505940625, -0.1232100518613026, -0.02794282145171972, -0.08677472853230249, 0.19202516168548628, 0.036308612798115814, -0.04487974415372672, 0.22939022407256837, 0.3278612204907655, 0.010107043594250392, 0.1360089158502825, -0.15163709803259579, -0.10482753360451295, -0.17221137167693212, -0.03371825243410622, -0.16150000377654516, -0.04615392221683829, -0.0947283735561008, -0.0867704009014515, 0.454271127704274, 0.27622709636544357, 0.2356366897033977, 0.14959340654072706, 0.3298280913029508, 0.005538382727235299, 0.10133998444111182, 0.035599145814696136, 0.17081859265293542, -0.07239480401260842, 0.1822034842752177, -0.17450150733909986, 0.13662188026154864, 0.08313945965552381]
|
1,803.09126
|
Uniformly accurate oscillatory integrators for the Klein-Gordon-Zakharov
system from low- to high-plasma frequency regimes
|
We present a novel class of oscillatory integrators for the
Klein-Gordon-Zakharov system which are uniformly accurate with respect to the
plasma frequency $c$. Convergence holds from the slowly-varying low-plasma up
to the highly oscillatory high-plasma frequency regimes without any step size
restriction and, especially, uniformly in $c$. The introduced schemes are
moreover asymptotic consistent and approximates the solutions of the
corresponding Zakharov limit system in the high-plasma frequency limit ($c \to
\infty$). We in particular present the construction of the first- and
second-order uniformly accurate oscillatory integrators and establish rigorous,
uniform error estimates. Numerical experiments underline our theoretical
convergence results.
|
math.NA
|
we present a novel class of oscillatory integrators for the kleingordonzakharov system which are uniformly accurate with respect to the plasma frequency c convergence holds from the slowlyvarying lowplasma up to the highly oscillatory highplasma frequency regimes without any step size restriction and especially uniformly in c the introduced schemes are moreover asymptotic consistent and approximates the solutions of the corresponding zakharov limit system in the highplasma frequency limit c to infty we in particular present the construction of the first and secondorder uniformly accurate oscillatory integrators and establish rigorous uniform error estimates numerical experiments underline our theoretical convergence results
|
[['we', 'present', 'a', 'novel', 'class', 'of', 'oscillatory', 'integrators', 'for', 'the', 'kleingordonzakharov', 'system', 'which', 'are', 'uniformly', 'accurate', 'with', 'respect', 'to', 'the', 'plasma', 'frequency', 'c', 'convergence', 'holds', 'from', 'the', 'slowlyvarying', 'lowplasma', 'up', 'to', 'the', 'highly', 'oscillatory', 'highplasma', 'frequency', 'regimes', 'without', 'any', 'step', 'size', 'restriction', 'and', 'especially', 'uniformly', 'in', 'c', 'the', 'introduced', 'schemes', 'are', 'moreover', 'asymptotic', 'consistent', 'and', 'approximates', 'the', 'solutions', 'of', 'the', 'corresponding', 'zakharov', 'limit', 'system', 'in', 'the', 'highplasma', 'frequency', 'limit', 'c', 'to', 'infty', 'we', 'in', 'particular', 'present', 'the', 'construction', 'of', 'the', 'first', 'and', 'secondorder', 'uniformly', 'accurate', 'oscillatory', 'integrators', 'and', 'establish', 'rigorous', 'uniform', 'error', 'estimates', 'numerical', 'experiments', 'underline', 'our', 'theoretical', 'convergence', 'results']]
|
[-0.14422612842988491, 0.06973861894191041, -0.07214084204247932, 0.013531024130925383, -0.030680397983890065, -0.13105321585287139, 0.04412128421545182, 0.36049652353082734, -0.24774205893969414, -0.2141840910333804, 0.11627014793489206, -0.23219451443628245, -0.10881319174245384, 0.2459618923033482, -0.0572755391872728, 0.13071982675836874, 0.10242566601709299, 0.009193449045925103, -0.09090066035806212, -0.19571172905192932, 0.275141351853891, 0.02012600829421552, 0.2684737412095761, -0.0023691543070695448, 0.10107451938956823, -0.07765373511278291, -0.013681985457072552, -0.012974931412021216, -0.1756106676351094, 0.10152492573131933, 0.22617245352222132, 0.022522626365486954, 0.29761744636235776, -0.38476649336708885, -0.16327441691813424, 0.07728165276732642, 0.1715337739532487, 0.13203122448920243, -0.02797176623500922, -0.2907871163003723, 0.10794015233788985, -0.1322746763639536, -0.18970731409661443, -0.1373758525251574, 0.0155988177380611, 0.11994309567836757, -0.3390779744872113, 0.10794362210255769, 0.11931589988453947, 0.03627749417486034, -0.09211768148006085, -0.08660846521127392, 0.020115411823577026, 0.11845745233166002, 0.046986875124275684, 0.017207078971736824, 0.05393700408701276, -0.06695976283055605, -0.05102916727245776, 0.3613028513440459, -0.1097631795264627, -0.23744354944330515, 0.2089839131696169, -0.16951021941897182, -0.11798198453448329, 0.14108390827692047, 0.16833877980651468, 0.17329723933308394, -0.09261901412740081, 0.11915290895033359, 0.014064536881201045, 0.16090078994670173, 0.07846892496196496, 0.03231076968200121, 0.08795198465015777, 0.14631952431062525, 0.11842260412036527, 0.12166723510317658, -0.054421348487670274, -0.1105317427997583, -0.3651326300825962, -0.11545011021446475, -0.15853354592145102, 0.020155663839685395, -0.1322332342994188, -0.17781963926192718, 0.3832101913783507, 0.1611654716207809, 0.1583390618127185, 0.14946713979888862, 0.26535074498514, 0.16778873956219784, -0.046683572752391635, 0.13505773124352252, 0.2389256273727557, 0.15131536251913333, 0.12754785064031782, -0.2344219807953065, 0.04412404505881606, 0.10206719594479528]
|
1,803.09127
|
Merging and Evolution: Improving Convolutional Neural Networks for
Mobile Applications
|
Compact neural networks are inclined to exploit "sparsely-connected"
convolutions such as depthwise convolution and group convolution for employment
in mobile applications. Compared with standard "fully-connected" convolutions,
these convolutions are more computationally economical. However,
"sparsely-connected" convolutions block the inter-group information exchange,
which induces severe performance degradation. To address this issue, we present
two novel operations named merging and evolution to leverage the inter-group
information. Our key idea is encoding the inter-group information with a narrow
feature map, then combining the generated features with the original network
for better representation. Taking advantage of the proposed operations, we then
introduce the Merging-and-Evolution (ME) module, an architectural unit
specifically designed for compact networks. Finally, we propose a family of
compact neural networks called MENet based on ME modules. Extensive experiments
on ILSVRC 2012 dataset and PASCAL VOC 2007 dataset demonstrate that MENet
consistently outperforms other state-of-the-art compact networks under
different computational budgets. For instance, under the computational budget
of 140 MFLOPs, MENet surpasses ShuffleNet by 1% and MobileNet by 1.95% on
ILSVRC 2012 top-1 accuracy, while by 2.3% and 4.1% on PASCAL VOC 2007 mAP,
respectively.
|
cs.CV
|
compact neural networks are inclined to exploit sparselyconnected convolutions such as depthwise convolution and group convolution for employment in mobile applications compared with standard fullyconnected convolutions these convolutions are more computationally economical however sparselyconnected convolutions block the intergroup information exchange which induces severe performance degradation to address this issue we present two novel operations named merging and evolution to leverage the intergroup information our key idea is encoding the intergroup information with a narrow feature map then combining the generated features with the original network for better representation taking advantage of the proposed operations we then introduce the mergingandevolution me module an architectural unit specifically designed for compact networks finally we propose a family of compact neural networks called menet based on me modules extensive experiments on ilsvrc 2012 dataset and pascal voc 2007 dataset demonstrate that menet consistently outperforms other stateoftheart compact networks under different computational budgets for instance under the computational budget of 140 mflops menet surpasses shufflenet by 1 and mobilenet by 195 on ilsvrc 2012 top1 accuracy while by 23 and 41 on pascal voc 2007 map respectively
|
[['compact', 'neural', 'networks', 'are', 'inclined', 'to', 'exploit', 'sparselyconnected', 'convolutions', 'such', 'as', 'depthwise', 'convolution', 'and', 'group', 'convolution', 'for', 'employment', 'in', 'mobile', 'applications', 'compared', 'with', 'standard', 'fullyconnected', 'convolutions', 'these', 'convolutions', 'are', 'more', 'computationally', 'economical', 'however', 'sparselyconnected', 'convolutions', 'block', 'the', 'intergroup', 'information', 'exchange', 'which', 'induces', 'severe', 'performance', 'degradation', 'to', 'address', 'this', 'issue', 'we', 'present', 'two', 'novel', 'operations', 'named', 'merging', 'and', 'evolution', 'to', 'leverage', 'the', 'intergroup', 'information', 'our', 'key', 'idea', 'is', 'encoding', 'the', 'intergroup', 'information', 'with', 'a', 'narrow', 'feature', 'map', 'then', 'combining', 'the', 'generated', 'features', 'with', 'the', 'original', 'network', 'for', 'better', 'representation', 'taking', 'advantage', 'of', 'the', 'proposed', 'operations', 'we', 'then', 'introduce', 'the', 'mergingandevolution', 'me', 'module', 'an', 'architectural', 'unit', 'specifically', 'designed', 'for', 'compact', 'networks', 'finally', 'we', 'propose', 'a', 'family', 'of', 'compact', 'neural', 'networks', 'called', 'menet', 'based', 'on', 'me', 'modules', 'extensive', 'experiments', 'on', 'ilsvrc', '2012', 'dataset', 'and', 'pascal', 'voc', '2007', 'dataset', 'demonstrate', 'that', 'menet', 'consistently', 'outperforms', 'other', 'stateoftheart', 'compact', 'networks', 'under', 'different', 'computational', 'budgets', 'for', 'instance', 'under', 'the', 'computational', 'budget', 'of', '140', 'mflops', 'menet', 'surpasses', 'shufflenet', 'by', '1', 'and', 'mobilenet', 'by', '195', 'on', 'ilsvrc', '2012', 'top1', 'accuracy', 'while', 'by', '23', 'and', '41', 'on', 'pascal', 'voc', '2007', 'map', 'respectively']]
|
[-0.06758370698051455, -0.0006950873892351687, -0.013103724894684981, 0.04642581098934234, -0.09144112822671745, -0.16133272129970277, 0.03825361655320128, 0.4579908894940964, -0.24704320197513338, -0.34039171307620425, 0.10942585941565543, -0.2747496611860617, -0.2206516322295197, 0.2037956422369783, -0.15603744664013344, 0.061351894380432134, 0.1737828393806369, -0.0004373491035506788, -0.09444424884460702, -0.3053743575573564, 0.3109250295667997, 0.06567266938219989, 0.3696793764778181, 0.03666194531525027, 0.1669671383367347, -0.026164905433105665, -0.049121144664401796, -0.03826373760480413, -0.023034511392787213, 0.17266864136365648, 0.22881160094274094, 0.14558772627876568, 0.3050263977264831, -0.4203785521528833, -0.18983125340100893, 0.054199692813772196, 0.08779973306085977, 0.008945311789493494, -0.02777181996345502, -0.3709885129494109, 0.12041141131110696, -0.2341212045802678, 0.08478945640214199, -0.14998832996934652, 0.006697835471450212, -0.012870727116898094, -0.3014764084341776, 0.04093357787765974, 0.07624457509756007, 0.04133988649118692, -0.006577288812329962, -0.1562184230385873, 0.02200188551957395, 0.14274106887574384, -0.07396043339893428, 0.04974021334059598, 0.1541756512185569, -0.16167708567261607, -0.16245063135428714, 0.3405837023316224, -0.0734490684432348, -0.196365588745977, 0.19520783560859933, -0.037047029917967086, -0.17829069101061282, 0.09141556182567503, 0.2217937874201253, 0.06469501992456039, -0.13167852597717628, 0.019144931334413032, -0.06452191150258424, 0.17806289650664475, 0.08632243078495298, 0.012886353320756012, 0.12167037596152028, 0.26229975483276063, 0.04842441122064326, 0.13913967907049266, -0.16786454800125314, -0.06313757120840024, -0.16989575729329778, -0.1101262655767782, -0.16257761018505082, 0.00897429017247169, -0.11326011622834949, -0.10258291246889169, 0.4050943153802285, 0.19928659401282164, 0.19620878542181702, 0.1430479237836791, 0.31249732273059655, -0.009096164881503879, 0.14243988149242415, 0.15623597240973347, 0.15064785330690114, 0.050758317945195745, 0.09748734762886982, -0.13042485827672712, 0.026131096679346832, 0.07486056293571852]
|
1,803.09128
|
Expansion and Brightness Changes in the Pulsar-Wind Nebula in the
Composite Supernova Remnant Kes 75
|
We report new Chandra X-ray observations of the shell supernova remnant (SNR)
Kes 75 (G29.7-0.3) containing a pulsar and pulsar-wind nebula (PWN). Expansion
of the PWN is apparent across the four epochs, 2000, 2006, 2009, and 2016. We
find an expansion rate between 2000 and 2016 of the NW edge of the PWN of
0.249% +/- 0.023% yr^{-1}, for an expansion age R/(dR/dt) of 400 +/- 40 years
and an expansion velocity of about 1000 km s^{-1}. We suggest that the PWN is
expanding into an asymmetric nickel bubble in a conventional Type IIP
supernova. Some acceleration of the PWN expansion is likely, giving a true age
of 480 +/- 50 years. The pulsar's birth luminosity was larger than the current
value by a factor of 3 -- 8, while the initial period was within a factor of 2
of its current value. We confirm directly that Kes 75 contains the youngest
known PWN, and hence youngest known pulsar. The pulsar PSR J1846-0258 has a
spindown-inferred magnetic field of 5 x 10^{13} G; in 2006 it emitted five
magnetar-like short X-ray bursts, but its spindown luminosity has not changed
significantly. However, the flux of the PWN has decreased by about 10% between
2009 and 2016, almost entirely in the northern half. A bright knot has declined
by 30% since 2006. During this time, the photon indices of the power-law models
did not change. This flux change is too rapid to be due to normal PWN evolution
in one-zone models.
|
astro-ph.HE
|
we report new chandra xray observations of the shell supernova remnant snr kes 75 g29703 containing a pulsar and pulsarwind nebula pwn expansion of the pwn is apparent across the four epochs 2000 2006 2009 and 2016 we find an expansion rate between 2000 and 2016 of the nw edge of the pwn of 0249 0023 yr1 for an expansion age rdrdt of 400 40 years and an expansion velocity of about 1000 km s1 we suggest that the pwn is expanding into an asymmetric nickel bubble in a conventional type iip supernova some acceleration of the pwn expansion is likely giving a true age of 480 50 years the pulsars birth luminosity was larger than the current value by a factor of 3 8 while the initial period was within a factor of 2 of its current value we confirm directly that kes 75 contains the youngest known pwn and hence youngest known pulsar the pulsar psr j18460258 has a spindowninferred magnetic field of 5 x 1013 g in 2006 it emitted five magnetarlike short xray bursts but its spindown luminosity has not changed significantly however the flux of the pwn has decreased by about 10 between 2009 and 2016 almost entirely in the northern half a bright knot has declined by 30 since 2006 during this time the photon indices of the powerlaw models did not change this flux change is too rapid to be due to normal pwn evolution in onezone models
|
[['we', 'report', 'new', 'chandra', 'xray', 'observations', 'of', 'the', 'shell', 'supernova', 'remnant', 'snr', 'kes', '75', 'g29703', 'containing', 'a', 'pulsar', 'and', 'pulsarwind', 'nebula', 'pwn', 'expansion', 'of', 'the', 'pwn', 'is', 'apparent', 'across', 'the', 'four', 'epochs', '2000', '2006', '2009', 'and', '2016', 'we', 'find', 'an', 'expansion', 'rate', 'between', '2000', 'and', '2016', 'of', 'the', 'nw', 'edge', 'of', 'the', 'pwn', 'of', '0249', '0023', 'yr1', 'for', 'an', 'expansion', 'age', 'rdrdt', 'of', '400', '40', 'years', 'and', 'an', 'expansion', 'velocity', 'of', 'about', '1000', 'km', 's1', 'we', 'suggest', 'that', 'the', 'pwn', 'is', 'expanding', 'into', 'an', 'asymmetric', 'nickel', 'bubble', 'in', 'a', 'conventional', 'type', 'iip', 'supernova', 'some', 'acceleration', 'of', 'the', 'pwn', 'expansion', 'is', 'likely', 'giving', 'a', 'true', 'age', 'of', '480', '50', 'years', 'the', 'pulsars', 'birth', 'luminosity', 'was', 'larger', 'than', 'the', 'current', 'value', 'by', 'a', 'factor', 'of', '3', '8', 'while', 'the', 'initial', 'period', 'was', 'within', 'a', 'factor', 'of', '2', 'of', 'its', 'current', 'value', 'we', 'confirm', 'directly', 'that', 'kes', '75', 'contains', 'the', 'youngest', 'known', 'pwn', 'and', 'hence', 'youngest', 'known', 'pulsar', 'the', 'pulsar', 'psr', 'j18460258', 'has', 'a', 'spindowninferred', 'magnetic', 'field', 'of', '5', 'x', '1013', 'g', 'in', '2006', 'it', 'emitted', 'five', 'magnetarlike', 'short', 'xray', 'bursts', 'but', 'its', 'spindown', 'luminosity', 'has', 'not', 'changed', 'significantly', 'however', 'the', 'flux', 'of', 'the', 'pwn', 'has', 'decreased', 'by', 'about', '10', 'between', '2009', 'and', '2016', 'almost', 'entirely', 'in', 'the', 'northern', 'half', 'a', 'bright', 'knot', 'has', 'declined', 'by', '30', 'since', '2006', 'during', 'this', 'time', 'the', 'photon', 'indices', 'of', 'the', 'powerlaw', 'models', 'did', 'not', 'change', 'this', 'flux', 'change', 'is', 'too', 'rapid', 'to', 'be', 'due', 'to', 'normal', 'pwn', 'evolution', 'in', 'onezone', 'models']]
|
[-0.08648486040316934, 0.13804492423765086, -0.04235681466716265, 0.07073439824331426, -0.13831058029203722, -0.07005358590853217, 0.067442840377449, 0.42983200336943883, -0.17265218147410644, -0.37941593756960307, 0.09157914476427173, -0.2772133267793774, 0.016769450247577835, 0.20930453168670074, -0.04683764231750039, -0.1033408617410908, 0.11354289630011796, -0.030538076698993805, -0.0592835454922575, -0.26871414049023995, 0.1971290103287711, 0.11392082619293761, 0.1735194536006139, 0.01976826909708134, 0.12407742190216745, -0.1208614509373323, -0.01934068248720294, -0.06771762077801587, -0.10975165663080215, 0.03585926355645213, 0.14956389938018472, 0.1624196679445869, 0.19997990111530314, -0.36994761985260993, -0.20454673050985325, 0.05492187868689233, 0.18486275951011624, -0.035802042395814956, 0.033316102082131156, -0.2772581492546854, 0.05946801979639606, -0.30471043942422704, -0.21476967431429286, 0.14630360961567274, 0.14966129185297894, -0.018608866130874004, -0.1744627835778672, 0.181837503561897, 0.02764654591618503, 0.07364576438739591, -0.11871023944075235, -0.1012519556007035, 0.02147827318971335, 0.013064678897699494, 0.08096804430748367, 0.11771572811851568, 0.11789974389007586, -0.12685909669845818, -0.09595647872784405, 0.35244857154206416, -0.03133357898075731, 0.07139408683831819, 0.18150249949501843, -0.2337229304844857, -0.13100491664859037, 0.24018196921917748, 0.07735222548372342, 0.06901959956768657, -0.16668425237790482, 0.03952749418982183, -0.04486148610623309, 0.22816868139369811, 0.07550289903979245, -0.014772072118756144, 0.2608327127756459, 0.13002642519370325, -0.0017277591844608428, 0.12332355658395873, -0.26337988193711787, 0.00437296596145807, -0.22327106506000732, -0.09398113800686037, -0.14134382055600014, 0.16948884313167015, -0.17853927043360585, -0.11836131593139965, 0.40961704291326956, 0.08225853177031776, 0.17551453117678156, -0.02899704026318342, 0.23089983496914204, 0.11508971652718353, 0.05462088102655396, 0.21904785037193386, 0.3403917457437244, 0.16675873733694344, 0.16041510596539307, -0.17993657988950335, 0.10271574863896812, -0.018618746971726784]
|
1,803.09129
|
A characterization of some Fano 4-folds through conic fibrations
|
We find a characterization for Fano 4-folds $X$ with Lefschetz defect
$\delta_{X}=3$: besides the product of two del Pezzo surfaces, they correspond
to varieties admitting a conic bundle structure $f\colon X\to Y$ with
$\rho_{X}-\rho_{Y}=3$. Moreover, we observe that all of these varieties are
rational. We give the list of all possible targets of such contractions.
Combining our results with the classification of toric Fano $4$-folds due to
Batyrev and Sato we provide explicit examples of Fano conic bundles from toric
$4$-folds with $\delta_{X}=3$.
|
math.AG
|
we find a characterization for fano 4folds x with lefschetz defect delta_x3 besides the product of two del pezzo surfaces they correspond to varieties admitting a conic bundle structure fcolon xto y with rho_xrho_y3 moreover we observe that all of these varieties are rational we give the list of all possible targets of such contractions combining our results with the classification of toric fano 4folds due to batyrev and sato we provide explicit examples of fano conic bundles from toric 4folds with delta_x3
|
[['we', 'find', 'a', 'characterization', 'for', 'fano', '4folds', 'x', 'with', 'lefschetz', 'defect', 'delta_x3', 'besides', 'the', 'product', 'of', 'two', 'del', 'pezzo', 'surfaces', 'they', 'correspond', 'to', 'varieties', 'admitting', 'a', 'conic', 'bundle', 'structure', 'fcolon', 'xto', 'y', 'with', 'rho_xrho_y3', 'moreover', 'we', 'observe', 'that', 'all', 'of', 'these', 'varieties', 'are', 'rational', 'we', 'give', 'the', 'list', 'of', 'all', 'possible', 'targets', 'of', 'such', 'contractions', 'combining', 'our', 'results', 'with', 'the', 'classification', 'of', 'toric', 'fano', '4folds', 'due', 'to', 'batyrev', 'and', 'sato', 'we', 'provide', 'explicit', 'examples', 'of', 'fano', 'conic', 'bundles', 'from', 'toric', '4folds', 'with', 'delta_x3']]
|
[-0.20285100692417474, -0.06837217079955735, -0.04821517182281241, 0.10455762444762513, -0.08683560757199302, -0.26602780919056385, -0.019365480632404796, 0.4072316653560847, -0.24815276926383376, -0.21890106140635907, 0.06206127465702593, -0.3101299104571808, -0.22015418114606292, 0.21181922431569547, -0.20438618885236792, -0.007143434230238199, 0.010485521459486336, -0.02000371388530766, -0.16373617485442082, -0.4196957783293328, 0.5285735237877816, -0.10150204130331986, 0.20038071405142546, 0.1319239037053194, 0.14730554358684458, 0.030666632304200903, 0.04474131916067563, -0.014805645297747106, -0.1759799816009945, 0.15126338427508018, 0.40189878868404777, 0.07623150422004983, 0.0516058601468103, -0.3789165724861959, -0.11945792508486193, 0.21431604481185787, 0.06752313812030479, 0.08342034390661865, -0.005767330259550363, -0.2368287176534068, 0.07585433729109355, -0.08212028412963264, -0.21300363722257315, -0.17926713720080442, -0.025962209317367525, 0.10707978311693296, -0.18775106560569838, -0.0996274635894224, 0.12405466719064862, 0.16504907894413917, -0.012467102450318634, -0.13037944864481688, -0.17092902218282688, -0.0020526916079688816, 0.004434497235342861, 0.04355636095278896, 0.08374319598078728, -0.07173215827351669, -0.1788293825025903, 0.33558002259233033, -0.07031951564131304, -0.22058243142673745, 0.1144361443235539, -0.13327293453621677, -0.14952982981922106, 0.2537071844446473, 0.09472690782276913, 0.2239166969258804, 0.05432246397176641, 0.14007238276462886, -0.10920801106840372, -0.001682366055320017, 0.13648390618036502, -0.0013349723711144179, 0.16243861694820225, 0.10353571747255046, 0.06291016247123479, 0.08975169877303416, -0.06352894352166913, 0.006986257718381239, -0.4178661899641156, -0.1924634993483778, 0.008527076660539024, 0.28656486246327406, -0.11867213456989703, -0.16362834617320915, 0.4003362076124176, -0.04673249137122184, 0.2824419794604182, 0.14247046601958574, 0.181071695080027, -0.06625639567355393, 0.001676286949077621, 0.02009795670164749, 0.17070538167026825, 0.22321290749823675, -0.08393150372430683, -0.09047631983121392, -0.07386203409114386, 0.16453316598199308]
|
1,803.0913
|
Impact of spherical nanoparticles on the nematic order parameter
|
We study experimentally the impact of spherical nanoparticles on the
orientational order parameters of a host nematic liquid crystal. We use
spherical core-shell quantum dots that are surface functionalized to promote
homeotropic anchoring on their interface with the liquid crystal host. We show
experimentally that the orientational order may be strongly affected by the
presence of spherical nanoparticles even at low concentrations. The
orientational order of the composite system is probed by means of polarised
micro-Raman spectroscopy and by optical birefringence measurements as function
of temperature and concentration. Our data show that the orientational order
depends on the concentration in a non linear way, and the existence of a
crossover concentration $\chi_c \approx 0.004\, pw$. It separates two different
regimes exhibiting pure-liquid crystal like ($\chi <\chi_c$) and
distorted-nematic ordering ($\chi >\chi_c$), respectively. In the latter phase
the degree of ordering is lower with respect to the pure-liquid crystal nematic
phase.
|
cond-mat.soft
|
we study experimentally the impact of spherical nanoparticles on the orientational order parameters of a host nematic liquid crystal we use spherical coreshell quantum dots that are surface functionalized to promote homeotropic anchoring on their interface with the liquid crystal host we show experimentally that the orientational order may be strongly affected by the presence of spherical nanoparticles even at low concentrations the orientational order of the composite system is probed by means of polarised microraman spectroscopy and by optical birefringence measurements as function of temperature and concentration our data show that the orientational order depends on the concentration in a non linear way and the existence of a crossover concentration chi_c approx 0004 pw it separates two different regimes exhibiting pureliquid crystal like chi chi_c and distortednematic ordering chi chi_c respectively in the latter phase the degree of ordering is lower with respect to the pureliquid crystal nematic phase
|
[['we', 'study', 'experimentally', 'the', 'impact', 'of', 'spherical', 'nanoparticles', 'on', 'the', 'orientational', 'order', 'parameters', 'of', 'a', 'host', 'nematic', 'liquid', 'crystal', 'we', 'use', 'spherical', 'coreshell', 'quantum', 'dots', 'that', 'are', 'surface', 'functionalized', 'to', 'promote', 'homeotropic', 'anchoring', 'on', 'their', 'interface', 'with', 'the', 'liquid', 'crystal', 'host', 'we', 'show', 'experimentally', 'that', 'the', 'orientational', 'order', 'may', 'be', 'strongly', 'affected', 'by', 'the', 'presence', 'of', 'spherical', 'nanoparticles', 'even', 'at', 'low', 'concentrations', 'the', 'orientational', 'order', 'of', 'the', 'composite', 'system', 'is', 'probed', 'by', 'means', 'of', 'polarised', 'microraman', 'spectroscopy', 'and', 'by', 'optical', 'birefringence', 'measurements', 'as', 'function', 'of', 'temperature', 'and', 'concentration', 'our', 'data', 'show', 'that', 'the', 'orientational', 'order', 'depends', 'on', 'the', 'concentration', 'in', 'a', 'non', 'linear', 'way', 'and', 'the', 'existence', 'of', 'a', 'crossover', 'concentration', 'chi_c', 'approx', '0004', 'pw', 'it', 'separates', 'two', 'different', 'regimes', 'exhibiting', 'pureliquid', 'crystal', 'like', 'chi', 'chi_c', 'and', 'distortednematic', 'ordering', 'chi', 'chi_c', 'respectively', 'in', 'the', 'latter', 'phase', 'the', 'degree', 'of', 'ordering', 'is', 'lower', 'with', 'respect', 'to', 'the', 'pureliquid', 'crystal', 'nematic', 'phase']]
|
[-0.13499897578985104, 0.2701433208667917, -0.07592968864291406, -0.031763473792851674, -0.02293647415217187, -0.11804834274800131, 0.034652169458661855, 0.41764080130663894, -0.24550517270929062, -0.2922695025777438, 0.03698500989773779, -0.32571757082271097, -0.12685436326635363, 0.11947029629634731, 0.07256638782681747, 0.029469000769391556, -0.07691421104132529, -0.03268533414417265, -0.09773891687318183, -0.20661473965534827, 0.263378546354064, -0.0003900494017863284, 0.2997483573103911, 0.08437039157775725, 0.07187242598832279, 0.0231532444755528, 0.11475768882856273, 0.044586094690099255, -0.22479716162333044, 0.0463121609993579, 0.22233798257669046, -0.08232400152361921, 0.16300152763474307, -0.403232652168946, -0.186711773045061, 0.07652162937384924, 0.11764478747226648, 0.0974621259366731, -0.06411951460216145, -0.26806183151850765, 0.07341255098206285, -0.1086347730451962, -0.16585174906411326, -0.08979415654473556, -0.05065353411631096, 0.05658017256220603, -0.2339844044060415, 0.14940231280313843, 0.06377014644981531, 0.10102596045815504, -0.07501039214607254, -0.0982444766876069, -0.09891979496819811, 0.03425247816293932, 0.04832164352703464, 0.04532888402260728, 0.20485568462852263, -0.1280974660446905, -0.05146093478101312, 0.3737825618606786, -0.04908419327166606, -0.13882514809402044, 0.17900392031859633, -0.23705220859710302, -0.056803292699545725, 0.1957892222289346, 0.15819536493591113, 0.12289442261837223, -0.06572401718761547, 0.0411467407988275, -0.012199517032412824, 0.2657743297867327, 0.09836364827500094, 0.043619198990273195, 0.23327080654792937, 0.17739882113157315, 0.0334752375485013, 0.1656139925514479, -0.12446253462194547, -0.04607555431457574, -0.2348359910171204, -0.19425963951687283, -0.20310149115554038, 0.002199949365384227, -0.14438092300626168, -0.1510371033152278, 0.35041480509239253, 0.06501520424221811, 0.16781862931726063, -0.01416393506321931, 0.20968970143855017, 0.042843815879177474, 0.03856878513321843, -0.03743267903766976, 0.27671721226992024, 0.17765772487693185, 0.06942370314863604, -0.3240512013810393, 0.11726420164114527, 0.014925506903521166]
|
1,803.09131
|
A vanishing Ext-branching theorem for $(\mathrm{GL}_{n+1}(F),
\mathrm{GL}_n(F))$
|
We prove a conjecture of Dipendra Prasad on the Ext-branching problem from
$\mathrm{GL}_{n+1}(F)$ to $\mathrm{GL}_n(F)$, where $F$ is a $p$-adic field.
|
math.RT math.NT
|
we prove a conjecture of dipendra prasad on the extbranching problem from mathrmgl_n1f to mathrmgl_nf where f is a padic field
|
[['we', 'prove', 'a', 'conjecture', 'of', 'dipendra', 'prasad', 'on', 'the', 'extbranching', 'problem', 'from', 'mathrmgl_n1f', 'to', 'mathrmgl_nf', 'where', 'f', 'is', 'a', 'padic', 'field']]
|
[-0.21252710529063878, 0.030131879752795947, -0.20172744146303126, 0.042895955799490605, -0.08643181933286159, -0.10759598805912231, 0.006726681695956933, 0.2317962672463373, -0.30919164772096436, -0.21220115385949612, 0.06643431425388706, -0.2195692546543126, -0.16372095146461538, 0.2504445098732647, -0.16977484798745104, -0.007126984625708582, -0.03150341189834044, 0.14180205997667814, -0.00496653505404921, -0.31665566445965515, 0.3750562526677784, -0.10347867668851425, 0.16830231675780133, 0.15313626649348358, 0.10052996981692941, 0.05184667148186188, 0.06965157830793607, -0.06804817052263963, -0.15657284643844163, 0.12250708528230653, 0.27642177731582995, 0.10079806828626285, 0.32817353739550237, -0.3445257721958976, -0.1342947261138378, 0.21902359169172614, 0.06612338782533218, 0.03355927035016449, -0.009238372697789026, -0.3198180069264613, 0.15839292907989339, -0.1135979604564215, -0.12120041123738415, 0.012729401847249583, 0.09121117719424594, -0.015946848317980766, -0.3751017853225532, 0.05389330281238807, 0.07214172968738958, 0.15714861810403435, -0.11454884629500539, -0.08610224664995544, -0.008104168466831508, -0.014614485253236796, 0.054854238540620395, 0.1691936961081075, 0.00760949189823709, -0.10762786362810355, -0.09677346040935893, 0.3335380856143801, -0.08427527507669047, -0.1787528097629547, 0.06930901852779482, -0.160212621779034, -0.22119262557182656, 0.020326302827973115, 0.11687891606829669, 0.19777581468224525, 0.028206732565242993, 0.27649419558675664, -0.24670757098417534, 0.09157538286557323, 0.13258151116927988, -0.1395138096260397, 0.10916789409116302, 0.02509459921796071, 0.08084984966798832, 0.18493365937549816, 0.013206514640172062, 0.030727082177212362, -0.2678964995828114, -0.21603051592644892, -0.18369351146056465, 0.19993855887533804, -0.0020126012202940488, -0.15860505402088165, 0.36748265043685313, 0.1134168035105655, 0.16696361922904066, 0.1750790365530472, 0.17194389984452804, 0.10761263442078703, -0.0032838774158766397, 0.07799322096827, 0.09594002263130326, 0.27760480937400933, -0.047774510531637226, -0.11500075269539498, -0.06130464210812198, 0.22444899419420644]
|
1,803.09132
|
Multi-Level Factorisation Net for Person Re-Identification
|
Key to effective person re-identification (Re-ID) is modelling discriminative
and view-invariant factors of person appearance at both high and low semantic
levels. Recently developed deep Re-ID models either learn a holistic single
semantic level feature representation and/or require laborious human annotation
of these factors as attributes. We propose Multi-Level Factorisation Net
(MLFN), a novel network architecture that factorises the visual appearance of a
person into latent discriminative factors at multiple semantic levels without
manual annotation. MLFN is composed of multiple stacked blocks. Each block
contains multiple factor modules to model latent factors at a specific level,
and factor selection modules that dynamically select the factor modules to
interpret the content of each input image. The outputs of the factor selection
modules also provide a compact latent factor descriptor that is complementary
to the conventional deeply learned features. MLFN achieves state-of-the-art
results on three Re-ID datasets, as well as compelling results on the general
object categorisation CIFAR-100 dataset.
|
cs.CV
|
key to effective person reidentification reid is modelling discriminative and viewinvariant factors of person appearance at both high and low semantic levels recently developed deep reid models either learn a holistic single semantic level feature representation andor require laborious human annotation of these factors as attributes we propose multilevel factorisation net mlfn a novel network architecture that factorises the visual appearance of a person into latent discriminative factors at multiple semantic levels without manual annotation mlfn is composed of multiple stacked blocks each block contains multiple factor modules to model latent factors at a specific level and factor selection modules that dynamically select the factor modules to interpret the content of each input image the outputs of the factor selection modules also provide a compact latent factor descriptor that is complementary to the conventional deeply learned features mlfn achieves stateoftheart results on three reid datasets as well as compelling results on the general object categorisation cifar100 dataset
|
[['key', 'to', 'effective', 'person', 'reidentification', 'reid', 'is', 'modelling', 'discriminative', 'and', 'viewinvariant', 'factors', 'of', 'person', 'appearance', 'at', 'both', 'high', 'and', 'low', 'semantic', 'levels', 'recently', 'developed', 'deep', 'reid', 'models', 'either', 'learn', 'a', 'holistic', 'single', 'semantic', 'level', 'feature', 'representation', 'andor', 'require', 'laborious', 'human', 'annotation', 'of', 'these', 'factors', 'as', 'attributes', 'we', 'propose', 'multilevel', 'factorisation', 'net', 'mlfn', 'a', 'novel', 'network', 'architecture', 'that', 'factorises', 'the', 'visual', 'appearance', 'of', 'a', 'person', 'into', 'latent', 'discriminative', 'factors', 'at', 'multiple', 'semantic', 'levels', 'without', 'manual', 'annotation', 'mlfn', 'is', 'composed', 'of', 'multiple', 'stacked', 'blocks', 'each', 'block', 'contains', 'multiple', 'factor', 'modules', 'to', 'model', 'latent', 'factors', 'at', 'a', 'specific', 'level', 'and', 'factor', 'selection', 'modules', 'that', 'dynamically', 'select', 'the', 'factor', 'modules', 'to', 'interpret', 'the', 'content', 'of', 'each', 'input', 'image', 'the', 'outputs', 'of', 'the', 'factor', 'selection', 'modules', 'also', 'provide', 'a', 'compact', 'latent', 'factor', 'descriptor', 'that', 'is', 'complementary', 'to', 'the', 'conventional', 'deeply', 'learned', 'features', 'mlfn', 'achieves', 'stateoftheart', 'results', 'on', 'three', 'reid', 'datasets', 'as', 'well', 'as', 'compelling', 'results', 'on', 'the', 'general', 'object', 'categorisation', 'cifar100', 'dataset']]
|
[-0.05406438677340366, -0.021630411752971233, -0.038282082334233705, 0.05989367448113811, -0.1503319656179779, -0.2195034201084903, 0.028392641084375465, 0.45134737394797575, -0.26771574501232925, -0.3479632457042006, -7.84395286326955e-05, -0.25871807300622107, -0.15078057268646303, 0.09958335963837138, -0.13951023362256634, 0.04193469646511374, 0.1492547542272005, 0.0619081679220344, -0.052519975574894746, -0.2734326188835155, 0.36772388378365833, 0.07602425372197624, 0.3793350751052023, -0.0018331690032960502, 0.20355057447353841, -0.03411958124014033, -0.07742387694039732, -0.043362320965055115, -0.014072056749202, 0.18257640411774775, 0.37394131355946103, 0.19487455112516291, 0.31488174079935166, -0.35948719277052554, -0.2262694827150435, 0.019275569158256244, 0.13289771500120687, 0.06829989420564825, 0.016673487161766667, -0.3681027190166579, 0.07528451886873361, -0.18678559648847373, 0.05415715067943997, -0.17499937743518004, -0.009716559652310268, -0.08876645385293634, -0.3100637048838814, 0.04752223234909889, 0.07517928321575924, 0.0625768805524797, -0.06673371080593889, -0.16676403937793105, 0.011465343289302697, 0.23051516350750237, -0.008973624001874049, 0.06543031109127685, 0.19751867805874557, -0.2777549635014974, -0.1466206745541162, 0.3443177765247169, -0.052493072647281036, -0.2222482211514121, 0.22764726531258814, -0.029911414310810673, -0.1856508656007469, 0.1305685997228761, 0.2059980857587912, 0.07365588407524547, -0.1711675030636085, -0.0417655837348778, -0.09320826563468072, 0.21555511617831363, 0.06534950159917212, 0.02737126592138877, 0.20108050344049172, 0.2688215053054522, -0.01704819800011861, 0.10450637531555762, -0.15564163760311758, 0.0038822849924753234, -0.20903271588364877, -0.08771977672252543, -0.14133108913554412, -0.03828116923653681, -0.17114278916123093, -0.1526068888207383, 0.4318110189833649, 0.15840502192904346, 0.25954998308899485, 0.08334631467756005, 0.33209703935630575, 0.013281747422204797, 0.19896855686381934, 0.08508100085684163, 0.09985092053023778, -0.03905126383634889, 0.05965596607146239, -0.14086209465660582, 0.08087252852062778, 0.10538927653276474]
|
1,803.09133
|
Social Media Analysis For Organizations: Us Northeastern Public And
State Libraries Case Study
|
Social networking sites such as Twitter have provided a great opportunity for
organizations such as public libraries to disseminate information for public
relations purposes. However, there is a need to analyze vast amounts of social
media data. This study presents a computational approach to explore the content
of tweets posted by nine public libraries in the northeastern United States of
America. In December 2017, this study extracted more than 19,000 tweets from
the Twitter accounts of seven state libraries and two urban public libraries.
Computational methods were applied to collect the tweets and discover
meaningful themes. This paper shows how the libraries have used Twitter to
represent their services and provides a starting point for different
organizations to evaluate the themes of their public tweets.
|
cs.SI cs.CY stat.AP stat.ML
|
social networking sites such as twitter have provided a great opportunity for organizations such as public libraries to disseminate information for public relations purposes however there is a need to analyze vast amounts of social media data this study presents a computational approach to explore the content of tweets posted by nine public libraries in the northeastern united states of america in december 2017 this study extracted more than 19000 tweets from the twitter accounts of seven state libraries and two urban public libraries computational methods were applied to collect the tweets and discover meaningful themes this paper shows how the libraries have used twitter to represent their services and provides a starting point for different organizations to evaluate the themes of their public tweets
|
[['social', 'networking', 'sites', 'such', 'as', 'twitter', 'have', 'provided', 'a', 'great', 'opportunity', 'for', 'organizations', 'such', 'as', 'public', 'libraries', 'to', 'disseminate', 'information', 'for', 'public', 'relations', 'purposes', 'however', 'there', 'is', 'a', 'need', 'to', 'analyze', 'vast', 'amounts', 'of', 'social', 'media', 'data', 'this', 'study', 'presents', 'a', 'computational', 'approach', 'to', 'explore', 'the', 'content', 'of', 'tweets', 'posted', 'by', 'nine', 'public', 'libraries', 'in', 'the', 'northeastern', 'united', 'states', 'of', 'america', 'in', 'december', '2017', 'this', 'study', 'extracted', 'more', 'than', '19000', 'tweets', 'from', 'the', 'twitter', 'accounts', 'of', 'seven', 'state', 'libraries', 'and', 'two', 'urban', 'public', 'libraries', 'computational', 'methods', 'were', 'applied', 'to', 'collect', 'the', 'tweets', 'and', 'discover', 'meaningful', 'themes', 'this', 'paper', 'shows', 'how', 'the', 'libraries', 'have', 'used', 'twitter', 'to', 'represent', 'their', 'services', 'and', 'provides', 'a', 'starting', 'point', 'for', 'different', 'organizations', 'to', 'evaluate', 'the', 'themes', 'of', 'their', 'public', 'tweets']]
|
[-0.06792616549041122, -0.0008927658535540104, -0.09133330211043358, 0.13584520942158998, -0.13863748293742537, -0.10568497185595334, 0.10637977876421065, 0.40884255289658905, -0.21719923831522464, -0.37630224733799694, 0.10823017099592834, -0.41249296700954435, -0.12921003379765897, 0.2101659546941519, -0.0662690338268876, -0.01558199588675052, 0.09815276050847024, 0.012378054037690163, 0.0410509827081114, -0.352037982404232, 0.28944711382687094, 0.012950352847576141, 0.3562708662301302, 0.07358888967335224, 0.04086674884799868, -0.04929009982198477, -0.17713817904144524, -0.062378777908161286, -0.12214583745226264, 0.22265888884512242, 0.4466262783110142, 0.28324487974494694, 0.3826648962162435, -0.4168735254816711, -0.19661432112008334, 0.05361113250255585, 0.12148244630172848, 0.10524724086094647, -0.0358696443164954, -0.3582091503813863, 0.04105766302347183, -0.24947896787896753, -0.10044201239198446, -0.1032751891836524, 0.05001169889047742, 0.02196617629285902, -0.18175113721191882, 0.01914090557396412, -0.06899306133575737, 0.17331311279535294, 0.018851918924599885, -0.11719257090613246, -0.056526639524847266, 0.2910808571279049, 0.10869544431753457, -0.016453429796732963, 0.15436804097983986, -0.1680103893870837, -0.17276939196884633, 0.42015283642709256, -0.005296700275153853, -0.07151392482500524, 0.185687903736718, -0.03131597742810845, -0.17370074985921383, 0.05720054562389851, 0.3055922822095454, 0.059001951687037944, -0.26788334822654725, -0.015536745385732503, -0.0784988913834095, 0.22566388717037625, 0.08286780635267496, 0.011107777685858309, 0.19117388509958982, 0.17816171422228216, 0.03509316824749112, 0.12733781335130334, -0.06913667786121368, -0.09465671322494745, -0.1577037356197834, -0.1405331095699221, -0.12060820313729345, 0.019631412509828805, -0.07280200386757497, -0.13240169558674098, 0.38977233132719996, 0.20222334533929825, 0.09956255868449806, -0.008706732787191867, 0.2568863189816475, -0.1079274267014116, 0.10198335218802095, 0.1475598425231874, 0.12037052537500859, -0.036794577341526746, 0.281468504358083, -0.07685335514880717, 0.10793467966467142, -0.03133431318984367]
|
1,803.09134
|
Characterizing Diseases and disorders in Gay Users' tweets
|
A lack of information exists about the health issues of lesbian, gay,
bisexual, transgender, and queer (LGBTQ) people who are often excluded from
national demographic assessments, health studies, and clinical trials. As a
result, medical experts and researchers lack a holistic understanding of the
health disparities facing these populations. Fortunately, publicly available
social media data such as Twitter data can be utilized to support the decisions
of public health policy makers and managers with respect to LGBTQ people. This
research employs a computational approach to collect tweets from gay users on
health-related topics and model these topics. To determine the nature of
health-related information shared by men who have sex with men on Twitter, we
collected thousands of tweets from 177 active users. We sampled these tweets
using a framework that can be applied to other LGBTQ sub-populations in future
research. We found 11 diseases in 7 categories based on ICD 10 that are in line
with the published studies and official reports.
|
cs.SI cs.CY stat.AP stat.ML
|
a lack of information exists about the health issues of lesbian gay bisexual transgender and queer lgbtq people who are often excluded from national demographic assessments health studies and clinical trials as a result medical experts and researchers lack a holistic understanding of the health disparities facing these populations fortunately publicly available social media data such as twitter data can be utilized to support the decisions of public health policy makers and managers with respect to lgbtq people this research employs a computational approach to collect tweets from gay users on healthrelated topics and model these topics to determine the nature of healthrelated information shared by men who have sex with men on twitter we collected thousands of tweets from 177 active users we sampled these tweets using a framework that can be applied to other lgbtq subpopulations in future research we found 11 diseases in 7 categories based on icd 10 that are in line with the published studies and official reports
|
[['a', 'lack', 'of', 'information', 'exists', 'about', 'the', 'health', 'issues', 'of', 'lesbian', 'gay', 'bisexual', 'transgender', 'and', 'queer', 'lgbtq', 'people', 'who', 'are', 'often', 'excluded', 'from', 'national', 'demographic', 'assessments', 'health', 'studies', 'and', 'clinical', 'trials', 'as', 'a', 'result', 'medical', 'experts', 'and', 'researchers', 'lack', 'a', 'holistic', 'understanding', 'of', 'the', 'health', 'disparities', 'facing', 'these', 'populations', 'fortunately', 'publicly', 'available', 'social', 'media', 'data', 'such', 'as', 'twitter', 'data', 'can', 'be', 'utilized', 'to', 'support', 'the', 'decisions', 'of', 'public', 'health', 'policy', 'makers', 'and', 'managers', 'with', 'respect', 'to', 'lgbtq', 'people', 'this', 'research', 'employs', 'a', 'computational', 'approach', 'to', 'collect', 'tweets', 'from', 'gay', 'users', 'on', 'healthrelated', 'topics', 'and', 'model', 'these', 'topics', 'to', 'determine', 'the', 'nature', 'of', 'healthrelated', 'information', 'shared', 'by', 'men', 'who', 'have', 'sex', 'with', 'men', 'on', 'twitter', 'we', 'collected', 'thousands', 'of', 'tweets', 'from', '177', 'active', 'users', 'we', 'sampled', 'these', 'tweets', 'using', 'a', 'framework', 'that', 'can', 'be', 'applied', 'to', 'other', 'lgbtq', 'subpopulations', 'in', 'future', 'research', 'we', 'found', '11', 'diseases', 'in', '7', 'categories', 'based', 'on', 'icd', '10', 'that', 'are', 'in', 'line', 'with', 'the', 'published', 'studies', 'and', 'official', 'reports']]
|
[-0.03890116068540267, 0.05779268023089443, -0.06405700151837128, 0.11274525360847064, -0.19512234219702382, -0.15707579577638786, 0.13942264204850546, 0.428890636864981, -0.1751597144189605, -0.36647054182824057, 0.13313698665556023, -0.4128536901185346, -0.13748689575200798, 0.19681933259254356, -0.17274607627429753, -0.008991096840108648, 0.12201429311574602, 0.05575653773509651, 0.06895984664696492, -0.3470868519193099, 0.2743447760899945, 0.021864212126659652, 0.3355850028159794, 0.060727246380639636, 0.02584933490703808, -0.01116807449950431, -0.13545038979043442, -0.0012465548741579786, -0.10775962277439471, 0.19667295001138665, 0.46018932449368566, 0.26529889581067934, 0.4185827000500874, -0.3993908379832568, -0.19514280023336114, 0.07480825636210206, 0.10561292211488003, 0.060211022285011774, -0.014552139433563625, -0.41310873904773976, 0.04086878453631331, -0.21755461535342266, -0.0626336084664485, -0.05073047087647798, -0.003441539424488698, 0.025279152438835887, -0.233044832270661, 0.0731515700363217, -0.06642547201228105, 0.19903722981653788, -0.05147993359771883, -0.14590081108585456, -0.03683384789291061, 0.26630028243536596, 0.13320034143566353, 0.0003019073153874534, 0.1842865073272067, -0.15031626936979592, -0.18818434582954627, 0.35146010485392043, 0.037517453838094066, -0.11716876771198186, 0.20462334465072632, -0.078627211151736, -0.16172434539288466, 0.04284979366737367, 0.2733983493587174, 0.054668248953880526, -0.22270933107867197, -0.06895340930890474, -0.05066962213044061, 0.20592770024211335, 0.06414617535778167, -0.034473454891104094, 0.18779152773029278, 0.16076678604721747, -0.010881126325497507, 0.026752682281672338, -0.03447558543004918, -0.06658382770074017, -0.15847758290592145, -0.10860477252063439, -0.08921679191039933, 0.06862890123149688, -0.04882674239110916, -0.10857416353719823, 0.35448490664294346, 0.2021937023382634, 0.10255201548435068, -0.018442471528088707, 0.23709363084032195, -0.07388847032876149, 0.11063471985580914, 0.09721537036078473, 0.0922755759396516, -0.0036827591433549766, 0.20174065612519354, -0.1198477365685044, 0.14214613913712693, -0.05844237209166303]
|
1,803.09135
|
Optimized pair natural orbitals for the coupled cluster methods
|
We present the coupled-cluster singles and doubles method formulated in terms
of truncated pair-natural orbitals (PNO) that are optimized to minimize the
effect of truncation. Compared to the standard ground-state PNO coupled-cluster
approaches, in which truncated PNOs derived from first-order M{\o}ller-Plesset
(MP1) amplitudes are used to compress the CC wave operator, the
iteratively-optimized PNOs ("iPNOs") offer moderate improvement for small PNO
ranks but rapidly increase their effectiveness for large PNO ranks. The error
introduced by PNO truncation in the CCSD energy is reduced by orders of
magnitude in the asymptotic regime, with an insignificant increase in PNO
ranks. The effect of PNO optimization is particularly effective when combined
with Neese's perturbative correction for the PNO incompleteness of the CCSD
energy. The use of the perturbative correction in combination with the PNO
optimization procedure seems to produce the most precise approximation to the
canonical CCSD energies for small and large PNO ranks. For the standard
benchmark set of noncovalent binding energies remarkable improvements with
respect to standard PNO approach range from a factor of 3 with PNO truncation
threshold $\tau_\text{PNO}=10^{-6}$ (with the maximum PNO truncation error in
the binding energy of only 0.1 kcal/mol) to more than 2 orders of magnitude
with $\tau_\text{PNO}=10^{-9}$.
|
physics.chem-ph
|
we present the coupledcluster singles and doubles method formulated in terms of truncated pairnatural orbitals pno that are optimized to minimize the effect of truncation compared to the standard groundstate pno coupledcluster approaches in which truncated pnos derived from firstorder mollerplesset mp1 amplitudes are used to compress the cc wave operator the iterativelyoptimized pnos ipnos offer moderate improvement for small pno ranks but rapidly increase their effectiveness for large pno ranks the error introduced by pno truncation in the ccsd energy is reduced by orders of magnitude in the asymptotic regime with an insignificant increase in pno ranks the effect of pno optimization is particularly effective when combined with neeses perturbative correction for the pno incompleteness of the ccsd energy the use of the perturbative correction in combination with the pno optimization procedure seems to produce the most precise approximation to the canonical ccsd energies for small and large pno ranks for the standard benchmark set of noncovalent binding energies remarkable improvements with respect to standard pno approach range from a factor of 3 with pno truncation threshold tau_textpno106 with the maximum pno truncation error in the binding energy of only 01 kcalmol to more than 2 orders of magnitude with tau_textpno109
|
[['we', 'present', 'the', 'coupledcluster', 'singles', 'and', 'doubles', 'method', 'formulated', 'in', 'terms', 'of', 'truncated', 'pairnatural', 'orbitals', 'pno', 'that', 'are', 'optimized', 'to', 'minimize', 'the', 'effect', 'of', 'truncation', 'compared', 'to', 'the', 'standard', 'groundstate', 'pno', 'coupledcluster', 'approaches', 'in', 'which', 'truncated', 'pnos', 'derived', 'from', 'firstorder', 'mollerplesset', 'mp1', 'amplitudes', 'are', 'used', 'to', 'compress', 'the', 'cc', 'wave', 'operator', 'the', 'iterativelyoptimized', 'pnos', 'ipnos', 'offer', 'moderate', 'improvement', 'for', 'small', 'pno', 'ranks', 'but', 'rapidly', 'increase', 'their', 'effectiveness', 'for', 'large', 'pno', 'ranks', 'the', 'error', 'introduced', 'by', 'pno', 'truncation', 'in', 'the', 'ccsd', 'energy', 'is', 'reduced', 'by', 'orders', 'of', 'magnitude', 'in', 'the', 'asymptotic', 'regime', 'with', 'an', 'insignificant', 'increase', 'in', 'pno', 'ranks', 'the', 'effect', 'of', 'pno', 'optimization', 'is', 'particularly', 'effective', 'when', 'combined', 'with', 'neeses', 'perturbative', 'correction', 'for', 'the', 'pno', 'incompleteness', 'of', 'the', 'ccsd', 'energy', 'the', 'use', 'of', 'the', 'perturbative', 'correction', 'in', 'combination', 'with', 'the', 'pno', 'optimization', 'procedure', 'seems', 'to', 'produce', 'the', 'most', 'precise', 'approximation', 'to', 'the', 'canonical', 'ccsd', 'energies', 'for', 'small', 'and', 'large', 'pno', 'ranks', 'for', 'the', 'standard', 'benchmark', 'set', 'of', 'noncovalent', 'binding', 'energies', 'remarkable', 'improvements', 'with', 'respect', 'to', 'standard', 'pno', 'approach', 'range', 'from', 'a', 'factor', 'of', '3', 'with', 'pno', 'truncation', 'threshold', 'tau_textpno106', 'with', 'the', 'maximum', 'pno', 'truncation', 'error', 'in', 'the', 'binding', 'energy', 'of', 'only', '01', 'kcalmol', 'to', 'more', 'than', '2', 'orders', 'of', 'magnitude', 'with', 'tau_textpno109']]
|
[-0.06152286711689418, 0.06671336363671093, -0.021139465040783872, 0.10588582517099282, 0.02262378830880839, -0.09018229027468787, 0.08159076248899064, 0.31813606049637405, -0.20500959892227427, -0.35971744421291, 0.0034377160321740546, -0.2800451214116409, -0.04950170597784359, 0.1582858550400302, -0.03653977888313179, 0.0563449504700898, 0.07799569905227126, 0.0410056932822193, -0.16717466793132338, -0.2720853540789792, 0.2782340067704873, 0.13397820957708267, 0.24915271066129208, 0.040421494049951434, 0.04246382321449643, 0.012939387441812349, 0.0029945579412089165, 0.025672849982843866, -0.07216157110982452, 0.17407357650904023, 0.2652700458145736, 0.018478735300180103, 0.28936377915610767, -0.3826626682825082, -0.1229094522007342, 0.05331991231829232, 0.13324082788609787, 0.14792963827910302, 0.02167383348650943, -0.23134513090041522, 0.10387380973354864, -0.25111982624084517, -0.13149681634611773, -0.1422247823888474, 0.009386210018122683, 0.028339365506734774, -0.31125766590323145, 0.1483641857456841, -0.028347927143284102, 0.029974767276589587, -0.04772912430082809, -0.23531731909464057, -0.012417088350642244, 0.04676981647074227, 0.07542734523957158, 0.08325686770472296, 0.09860282678427935, -0.1197370195438211, -0.09768772861274073, 0.4145992252184553, -0.058799818628933874, -0.19685504346259167, 0.13369254836199654, -0.12994532616647456, -0.07882396680331427, 0.2199119379724927, 0.1117741999636453, 0.11694770105591766, -0.08714328690739978, 0.08236225655395063, 0.08949541080541426, 0.20499531519409192, 0.09720110735970036, 0.04312898416062627, 0.08279300012331152, 0.14503268332919106, 0.07434827573977563, 0.09628093056024375, -0.10740360834312682, -0.13697434201888853, -0.27085667261758783, -0.08325408663415369, -0.14460142625600328, -0.01219426185447706, -0.1506339375555399, -0.19648212761789255, 0.3698525130558683, 0.14252555441070938, 0.14411749733001356, 0.09155525030551612, 0.27621646751578405, 0.17283710325559976, 0.14047119439679331, 0.049392305602015435, 0.2874309882208021, 0.13688392759234244, -0.020871277898550034, -0.27578134599797505, 0.005766454403412205, 0.12100793225025493]
|
1,803.09136
|
A distance-based tool-set to track inconsistent urban structures through
complex-networks
|
Complex networks can be used for modeling street meshes and urban
agglomerates. With such a model, many aspects of a city can be investigated to
promote a better quality of life to its citizens. Along these lines, this paper
proposes a set of distance-based pattern-discovery algorithmic instruments to
improve urban structures modeled as complex networks, detecting nodes that lack
access from/to points of interest in a given city. Furthermore, we introduce a
greedy algorithm that is able to recommend improvements to the structure of a
city by suggesting where points of interest are to be placed. We contribute to
a thorough process to deal with complex networks, including mathematical
modeling and algorithmic innovation. The set of our contributions introduces a
systematic manner to treat a recurrent problem of broad interest in cities.
|
cs.CE
|
complex networks can be used for modeling street meshes and urban agglomerates with such a model many aspects of a city can be investigated to promote a better quality of life to its citizens along these lines this paper proposes a set of distancebased patterndiscovery algorithmic instruments to improve urban structures modeled as complex networks detecting nodes that lack access fromto points of interest in a given city furthermore we introduce a greedy algorithm that is able to recommend improvements to the structure of a city by suggesting where points of interest are to be placed we contribute to a thorough process to deal with complex networks including mathematical modeling and algorithmic innovation the set of our contributions introduces a systematic manner to treat a recurrent problem of broad interest in cities
|
[['complex', 'networks', 'can', 'be', 'used', 'for', 'modeling', 'street', 'meshes', 'and', 'urban', 'agglomerates', 'with', 'such', 'a', 'model', 'many', 'aspects', 'of', 'a', 'city', 'can', 'be', 'investigated', 'to', 'promote', 'a', 'better', 'quality', 'of', 'life', 'to', 'its', 'citizens', 'along', 'these', 'lines', 'this', 'paper', 'proposes', 'a', 'set', 'of', 'distancebased', 'patterndiscovery', 'algorithmic', 'instruments', 'to', 'improve', 'urban', 'structures', 'modeled', 'as', 'complex', 'networks', 'detecting', 'nodes', 'that', 'lack', 'access', 'fromto', 'points', 'of', 'interest', 'in', 'a', 'given', 'city', 'furthermore', 'we', 'introduce', 'a', 'greedy', 'algorithm', 'that', 'is', 'able', 'to', 'recommend', 'improvements', 'to', 'the', 'structure', 'of', 'a', 'city', 'by', 'suggesting', 'where', 'points', 'of', 'interest', 'are', 'to', 'be', 'placed', 'we', 'contribute', 'to', 'a', 'thorough', 'process', 'to', 'deal', 'with', 'complex', 'networks', 'including', 'mathematical', 'modeling', 'and', 'algorithmic', 'innovation', 'the', 'set', 'of', 'our', 'contributions', 'introduces', 'a', 'systematic', 'manner', 'to', 'treat', 'a', 'recurrent', 'problem', 'of', 'broad', 'interest', 'in', 'cities']]
|
[-0.09861238813205472, 0.030424655128967103, -0.0730064096291841, 0.06728133953313127, -0.10574323269858502, -0.11608547103441967, 0.09759946117437096, 0.407562093574639, -0.2638404380600324, -0.3054835195688687, 0.07397078779412306, -0.2591032793866257, -0.20787372191273074, 0.18694917553189772, -0.16021856263134174, 0.03910461667247955, 0.0765010285047274, -0.013932113286875587, 0.009733679658157452, -0.2457857921138363, 0.2915201793364356, 0.04809314113124522, 0.2861547811785073, 0.06195551868108677, 0.08415313772075163, -0.05893017879139831, -0.04723456024680152, 0.07373086452654755, -0.07893304204275452, 0.21480628870736865, 0.3651108667681008, 0.17965927486172842, 0.3263878174470951, -0.44345965624594963, -0.271862557915018, 0.11297430264415177, 0.15843818547872415, 0.07586738098064395, -0.007908243600648778, -0.30207487805000016, 0.10515668744999801, -0.1804626787664326, -0.13336315231205795, -0.09222043191175197, -0.009456280711327345, 0.02587485886338871, -0.27128350944302704, -0.010505886919057097, 0.01879553806982252, 0.08973343430783685, 0.008985163280491554, -0.08357042822105284, 0.00923188274392133, 0.19613701037579137, 0.02320790933938306, 0.02315039336254806, 0.13277320275865212, -0.11917068942037645, -0.1458231517263041, 0.43700718162368046, 0.013835995564706454, -0.22114409089891796, 0.19412776796886597, -0.08269617683787382, -0.1632239442276022, 0.09469078477109491, 0.2846773317481839, 0.07231997235039185, -0.17414756621570035, 0.0014358301467496816, -0.025055933959661266, 0.13935755067398303, 0.04801371817668999, 0.00376504244556551, 0.20666304388683812, 0.2504829391694933, 0.11027978928288701, 0.1253704310155772, -0.06974112862749522, -0.10520668546775826, -0.19601914491717712, -0.1380184866232044, -0.1510064586115475, 0.031816655649085535, -0.08769821871817646, -0.21378099368814066, 0.4342444299841086, 0.19572720199979785, 0.22061691298469446, 0.037221304603091636, 0.2696468564521749, 0.03379588536336087, 0.07502697462941171, 0.07341317620256362, 0.12876019807610634, 0.04501392914138677, 0.1433817977121256, -0.1073737082619021, 0.0963636519678847, 0.025131017595302056]
|
1,803.09137
|
A stochastic telegraph equation from the six-vertex model
|
A stochastic telegraph equation is defined by adding a random inhomogeneity
to the classical (second order linear hyperbolic) telegraph differential
equation. The inhomogeneities we consider are proportional to the
two-dimensional white noise, and solutions to our equation are two-dimensional
random Gaussian fields. We show that such fields arise naturally as asymptotic
fluctuations of the height function in a certain limit regime of the stochastic
six vertex model in a quadrant. The corresponding law of large numbers -- the
limit shape of the height function -- is described by the (deterministic)
homogeneous telegraph equation.
|
math.PR math-ph math.MP
|
a stochastic telegraph equation is defined by adding a random inhomogeneity to the classical second order linear hyperbolic telegraph differential equation the inhomogeneities we consider are proportional to the twodimensional white noise and solutions to our equation are twodimensional random gaussian fields we show that such fields arise naturally as asymptotic fluctuations of the height function in a certain limit regime of the stochastic six vertex model in a quadrant the corresponding law of large numbers the limit shape of the height function is described by the deterministic homogeneous telegraph equation
|
[['a', 'stochastic', 'telegraph', 'equation', 'is', 'defined', 'by', 'adding', 'a', 'random', 'inhomogeneity', 'to', 'the', 'classical', 'second', 'order', 'linear', 'hyperbolic', 'telegraph', 'differential', 'equation', 'the', 'inhomogeneities', 'we', 'consider', 'are', 'proportional', 'to', 'the', 'twodimensional', 'white', 'noise', 'and', 'solutions', 'to', 'our', 'equation', 'are', 'twodimensional', 'random', 'gaussian', 'fields', 'we', 'show', 'that', 'such', 'fields', 'arise', 'naturally', 'as', 'asymptotic', 'fluctuations', 'of', 'the', 'height', 'function', 'in', 'a', 'certain', 'limit', 'regime', 'of', 'the', 'stochastic', 'six', 'vertex', 'model', 'in', 'a', 'quadrant', 'the', 'corresponding', 'law', 'of', 'large', 'numbers', 'the', 'limit', 'shape', 'of', 'the', 'height', 'function', 'is', 'described', 'by', 'the', 'deterministic', 'homogeneous', 'telegraph', 'equation']]
|
[-0.15684661788067647, 0.154482570419262, -0.055488862232867996, 0.08698208673836684, -0.06338802463589953, -0.09874679361070905, -0.022015419317880175, 0.26091228358212165, -0.33371349440498665, -0.24532561786063425, 0.08882578177720431, -0.31703645681737214, -0.18742742743547802, 0.1607172161847312, -0.043999950317051874, 0.08391398807557729, -0.03340930181074437, 0.0243933988360248, -0.020068912102922717, -0.23837442546929385, 0.33481373864092995, -0.015060183387454395, 0.24941614806488321, -0.08044492995755358, 0.1442231118044519, -0.014580977400048422, -0.01394766220339359, 0.047289545640124234, -0.13365141745788817, 0.005095723427954939, 0.16946763448048752, -0.011721466325100634, 0.2706354128396405, -0.4090829571442945, -0.2627866719184177, 0.12148022248440392, 0.11921905481530312, 0.12969959082061444, -0.015918383906994547, -0.28901846893131733, 0.04622497852983792, -0.13194514479958913, -0.22356171923776536, -0.0009500224905723072, -0.001888308295427443, 0.13818524767654938, -0.2914132634996549, 0.14251302298322155, 0.11947501738617135, -0.019492959460386865, -0.01949252090979736, -0.08848650739681753, -0.01372613714608763, 0.06690611503506591, 0.002391098473978403, 0.0010522132698487449, 0.11308860946139628, -0.14885826160169238, -0.09803003099347864, 0.343752510984464, -0.16887450049974148, -0.28754217911046, 0.10718436453204888, -0.20270880918622344, -0.0720029527521027, 0.1493604362502203, 0.17903021975307837, 0.11448891987107185, -0.18568498257465743, 0.15198437362894285, -0.03338709161463347, 0.12804946003502216, 0.07206291950993486, -0.009166220080230263, 0.14775860771168392, 0.13525470776053575, 0.07926148668463741, 0.17351638651606474, -0.0700485606800642, -0.1782758721447253, -0.34350409796768494, -0.09728151577228046, -0.1982597258392271, 0.13186572957783937, -0.1623799000228026, -0.2409698864660011, 0.367142677798376, 0.11937286717763457, 0.19290679913259798, 0.05740211848271908, 0.2542329487482925, 0.2794851219111409, -0.00943834846327593, 0.05933758948039222, 0.14957334716282375, 0.2269016872825367, 0.1175497317134024, -0.19455972209778757, 0.027693573595280505, 0.0898718284545364]
|
1,803.09138
|
Posterior Concentration for Sparse Deep Learning
|
Spike-and-Slab Deep Learning (SS-DL) is a fully Bayesian alternative to
Dropout for improving generalizability of deep ReLU networks. This new type of
regularization enables provable recovery of smooth input-output maps with
unknown levels of smoothness. Indeed, we show that the posterior distribution
concentrates at the near minimax rate for $\alpha$-H\"older smooth maps,
performing as well as if we knew the smoothness level $\alpha$ ahead of time.
Our result sheds light on architecture design for deep neural networks, namely
the choice of depth, width and sparsity level. These network attributes
typically depend on unknown smoothness in order to be optimal. We obviate this
constraint with the fully Bayes construction. As an aside, we show that SS-DL
does not overfit in the sense that the posterior concentrates on smaller
networks with fewer (up to the optimal number of) nodes and links. Our results
provide new theoretical justifications for deep ReLU networks from a Bayesian
point of view.
|
stat.ML cs.LG
|
spikeandslab deep learning ssdl is a fully bayesian alternative to dropout for improving generalizability of deep relu networks this new type of regularization enables provable recovery of smooth inputoutput maps with unknown levels of smoothness indeed we show that the posterior distribution concentrates at the near minimax rate for alphaholder smooth maps performing as well as if we knew the smoothness level alpha ahead of time our result sheds light on architecture design for deep neural networks namely the choice of depth width and sparsity level these network attributes typically depend on unknown smoothness in order to be optimal we obviate this constraint with the fully bayes construction as an aside we show that ssdl does not overfit in the sense that the posterior concentrates on smaller networks with fewer up to the optimal number of nodes and links our results provide new theoretical justifications for deep relu networks from a bayesian point of view
|
[['spikeandslab', 'deep', 'learning', 'ssdl', 'is', 'a', 'fully', 'bayesian', 'alternative', 'to', 'dropout', 'for', 'improving', 'generalizability', 'of', 'deep', 'relu', 'networks', 'this', 'new', 'type', 'of', 'regularization', 'enables', 'provable', 'recovery', 'of', 'smooth', 'inputoutput', 'maps', 'with', 'unknown', 'levels', 'of', 'smoothness', 'indeed', 'we', 'show', 'that', 'the', 'posterior', 'distribution', 'concentrates', 'at', 'the', 'near', 'minimax', 'rate', 'for', 'alphaholder', 'smooth', 'maps', 'performing', 'as', 'well', 'as', 'if', 'we', 'knew', 'the', 'smoothness', 'level', 'alpha', 'ahead', 'of', 'time', 'our', 'result', 'sheds', 'light', 'on', 'architecture', 'design', 'for', 'deep', 'neural', 'networks', 'namely', 'the', 'choice', 'of', 'depth', 'width', 'and', 'sparsity', 'level', 'these', 'network', 'attributes', 'typically', 'depend', 'on', 'unknown', 'smoothness', 'in', 'order', 'to', 'be', 'optimal', 'we', 'obviate', 'this', 'constraint', 'with', 'the', 'fully', 'bayes', 'construction', 'as', 'an', 'aside', 'we', 'show', 'that', 'ssdl', 'does', 'not', 'overfit', 'in', 'the', 'sense', 'that', 'the', 'posterior', 'concentrates', 'on', 'smaller', 'networks', 'with', 'fewer', 'up', 'to', 'the', 'optimal', 'number', 'of', 'nodes', 'and', 'links', 'our', 'results', 'provide', 'new', 'theoretical', 'justifications', 'for', 'deep', 'relu', 'networks', 'from', 'a', 'bayesian', 'point', 'of', 'view']]
|
[-0.053992204211892623, -0.002104600001363114, -0.06271256795753875, 0.07744243741861635, -0.12528779612733953, -0.17219550132511124, 0.10486124580906284, 0.45066895930757445, -0.3049862436950207, -0.2757654526931865, 0.08088724004375117, -0.22475415516284206, -0.21044120080769063, 0.1734159656680159, -0.13949047594421332, 0.1110074338322926, 0.08445626032809096, 0.0233956954068309, -0.08009196752532115, -0.2916293116962357, 0.34156113493616785, 0.0738318562920716, 0.3064430630074874, 0.012829938230495299, 0.13525200287000305, -0.0033531209213599083, 0.014735324761920398, -0.032252414170802844, -0.11886620892192079, 0.16194798614709607, 0.261854264488624, 0.1945755371373267, 0.35056560411373333, -0.4070011932763361, -0.2528239510298121, 0.11998218800572137, 0.15120816062535009, 0.08393811917292976, 0.006261167669999263, -0.2781075710776232, 0.10313392504448853, -0.10124473222080738, -0.06046343086467635, -0.12941428562325816, -0.05772611235358542, 0.03892678831734003, -0.31973773562649804, 0.061972109697038126, 0.09284761303570122, 0.049335456741673334, -0.03658773857844813, -0.16880058230712047, -0.0004588736055959617, 0.12712898346249976, 0.031833524515311566, 0.057449391612317414, 0.1180803234658895, -0.19465836118005456, -0.09118483563375307, 0.2637067804052945, -0.0672476910182365, -0.21552755936619736, 0.1560317289940412, -0.08055752263434472, -0.18447286824605638, 0.12182284504055016, 0.21545224222655018, 0.0864546608059637, -0.11323013947976213, 0.053702946056071066, -0.05749387564362898, 0.1852626524574589, 0.04454850759732747, 0.040183406605595544, 0.13708474756248534, 0.2362123517950456, 0.12429179965082797, 0.08800742736822295, -0.13290183455983717, -0.07561825991968714, -0.3146883190339131, -0.09444158152215212, -0.20749122522651187, 0.03654956884481268, -0.14312461911186186, -0.1895904093560192, 0.36046803320848175, 0.18813911423447632, 0.24929938727929707, 0.19731702999842743, 0.29531520807574835, 0.08201208494288185, 0.08031315367608782, 0.12098953581204819, 0.23903739040176714, 0.0723786267271686, 0.05923742515545699, -0.12311270941995205, 0.12744648816484597, 0.03815145528004054]
|
1,803.09139
|
On contact graphs of totally separable packings in low dimensions
|
The contact graph of a packing of translates of a convex body in Euclidean
$d$-space $\mathbb E^d$ is the simple graph whose vertices are the members of
the packing, and whose two vertices are connected by an edge if the two members
touch each other. A packing of translates of a convex body is called totally
separable, if any two members can be separated by a hyperplane in $\mathbb E^d$
disjoint from the interior of every packing element. We give upper bounds on
the maximum vertex degree (called separable Hadwiger number) and the maximum
number of edges (called maximum separable contact number) of the contact graph
of a totally separable packing of $n$ translates of an arbitrary smooth convex
body in $\mathbb E^d$ with $d=2,3,4$. In the proofs, linear algebraic and
convexity methods are combined with volumetric and packing density estimates
based on the underlying isoperimetric (resp., reverse isoperimetric)
inequality.
|
math.MG
|
the contact graph of a packing of translates of a convex body in euclidean dspace mathbb ed is the simple graph whose vertices are the members of the packing and whose two vertices are connected by an edge if the two members touch each other a packing of translates of a convex body is called totally separable if any two members can be separated by a hyperplane in mathbb ed disjoint from the interior of every packing element we give upper bounds on the maximum vertex degree called separable hadwiger number and the maximum number of edges called maximum separable contact number of the contact graph of a totally separable packing of n translates of an arbitrary smooth convex body in mathbb ed with d234 in the proofs linear algebraic and convexity methods are combined with volumetric and packing density estimates based on the underlying isoperimetric resp reverse isoperimetric inequality
|
[['the', 'contact', 'graph', 'of', 'a', 'packing', 'of', 'translates', 'of', 'a', 'convex', 'body', 'in', 'euclidean', 'dspace', 'mathbb', 'ed', 'is', 'the', 'simple', 'graph', 'whose', 'vertices', 'are', 'the', 'members', 'of', 'the', 'packing', 'and', 'whose', 'two', 'vertices', 'are', 'connected', 'by', 'an', 'edge', 'if', 'the', 'two', 'members', 'touch', 'each', 'other', 'a', 'packing', 'of', 'translates', 'of', 'a', 'convex', 'body', 'is', 'called', 'totally', 'separable', 'if', 'any', 'two', 'members', 'can', 'be', 'separated', 'by', 'a', 'hyperplane', 'in', 'mathbb', 'ed', 'disjoint', 'from', 'the', 'interior', 'of', 'every', 'packing', 'element', 'we', 'give', 'upper', 'bounds', 'on', 'the', 'maximum', 'vertex', 'degree', 'called', 'separable', 'hadwiger', 'number', 'and', 'the', 'maximum', 'number', 'of', 'edges', 'called', 'maximum', 'separable', 'contact', 'number', 'of', 'the', 'contact', 'graph', 'of', 'a', 'totally', 'separable', 'packing', 'of', 'n', 'translates', 'of', 'an', 'arbitrary', 'smooth', 'convex', 'body', 'in', 'mathbb', 'ed', 'with', 'd234', 'in', 'the', 'proofs', 'linear', 'algebraic', 'and', 'convexity', 'methods', 'are', 'combined', 'with', 'volumetric', 'and', 'packing', 'density', 'estimates', 'based', 'on', 'the', 'underlying', 'isoperimetric', 'resp', 'reverse', 'isoperimetric', 'inequality']]
|
[-0.18315187629739133, 0.1452807081003751, -0.07971025844415029, -0.019584621712565423, -0.09655174046754837, -0.1804408671769003, 0.04912529706489295, 0.32942403353129823, -0.29359234066680073, -0.22806768050727744, 0.11317980886126558, -0.34222037546336653, -0.12024456705742827, 0.11603125569721064, -0.13040584561259796, 0.03581938186660409, 0.06096707404901584, 0.11885072559739153, -0.0524068086516733, -0.2793718021050639, 0.3298472915838162, -0.14733486383532485, 0.15565652772163352, 0.11719948334619402, 0.10262463199906051, 0.09971862409263849, 0.005283795927340786, 0.1611161154306804, -0.20091561881204445, 0.18005543330373863, 0.25207058355522655, 0.17845802765650054, 0.2650061785367628, -0.404073080298452, -0.13352266911882907, 0.1960340413513283, 0.09487525564851239, -0.021165102243733903, 0.010740350315657754, -0.23798616278916598, 0.0694440476829186, -0.09401250675563157, -0.10967505464330315, 0.0533632859090964, 0.08028576908012232, 0.0611064425855875, -0.2454123196688791, 0.016081513706594705, 0.10051451993718122, 0.04708666507290521, -0.04861260759799431, -0.15423017936370645, -0.05013945886244377, 0.05378245816381726, -0.060681081206227346, 0.10694822134760519, 0.11885780073741141, -0.05658872087796529, -0.1273747045174241, 0.37961459670215847, 0.027245321773613492, -0.24856000015512109, 0.17508456882322207, -0.1490194273632369, -0.11518386729527265, 0.17743013962171972, 0.19215194577972095, 0.11621272470025966, -0.10311744475116333, 0.17548235087189823, -0.14724642846500502, 0.10209403322388728, 0.11453321487642824, -0.012479636541878183, 0.1369301953415076, 0.10014471943490207, 0.21592047575861215, 0.20435438085929492, -0.02709213527229925, -0.04348104907665402, -0.3118719064941009, -0.14367611879793307, -0.2866094092465937, 0.060282440185546876, -0.2290604673694664, -0.2353502758212077, 0.35179437285211557, -0.04265946346335113, 0.21612280446415147, 0.13259774835780264, 0.2460749683280786, 0.04644758448315164, 0.030869599596286813, 0.16743487038339178, 0.15592078908492113, 0.18226462210528552, -0.10573902880772948, -0.15582600015526016, 0.05252417588761697, 0.1742929811201369]
|
1,803.0914
|
Computing the Tolman length for solid-liquid interfaces
|
The curvature dependence of interfacial free energy, which is crucial in
quantitatively predicting nucleation kinetics and the stability of bubbles and
droplets, can be described in terms of the Tolman length {\delta}. For
solid-liquid interfaces, however,{\delta} has never been computed directly due
to various theoretical and practical challenges. Here we present a general
method that enables the direct evaluation of the Tolman length from atomistic
simulations of a solid-liquid planar interface in out-of-equilibrium
conditions. This method works by first measuring the surface tension from the
amplitude of thermal capillary fluctuations of a localized version of Gibbs
dividing surface, and bythen computing the free energy difference between the
surface of tension and the equimolar dividing surface. For benchmark purposes,
we computed {\delta}for a model potential, and compared the results to less
rigorous indirect approaches.
|
cond-mat.stat-mech cond-mat.soft
|
the curvature dependence of interfacial free energy which is crucial in quantitatively predicting nucleation kinetics and the stability of bubbles and droplets can be described in terms of the tolman length delta for solidliquid interfaces howeverdelta has never been computed directly due to various theoretical and practical challenges here we present a general method that enables the direct evaluation of the tolman length from atomistic simulations of a solidliquid planar interface in outofequilibrium conditions this method works by first measuring the surface tension from the amplitude of thermal capillary fluctuations of a localized version of gibbs dividing surface and bythen computing the free energy difference between the surface of tension and the equimolar dividing surface for benchmark purposes we computed deltafor a model potential and compared the results to less rigorous indirect approaches
|
[['the', 'curvature', 'dependence', 'of', 'interfacial', 'free', 'energy', 'which', 'is', 'crucial', 'in', 'quantitatively', 'predicting', 'nucleation', 'kinetics', 'and', 'the', 'stability', 'of', 'bubbles', 'and', 'droplets', 'can', 'be', 'described', 'in', 'terms', 'of', 'the', 'tolman', 'length', 'delta', 'for', 'solidliquid', 'interfaces', 'howeverdelta', 'has', 'never', 'been', 'computed', 'directly', 'due', 'to', 'various', 'theoretical', 'and', 'practical', 'challenges', 'here', 'we', 'present', 'a', 'general', 'method', 'that', 'enables', 'the', 'direct', 'evaluation', 'of', 'the', 'tolman', 'length', 'from', 'atomistic', 'simulations', 'of', 'a', 'solidliquid', 'planar', 'interface', 'in', 'outofequilibrium', 'conditions', 'this', 'method', 'works', 'by', 'first', 'measuring', 'the', 'surface', 'tension', 'from', 'the', 'amplitude', 'of', 'thermal', 'capillary', 'fluctuations', 'of', 'a', 'localized', 'version', 'of', 'gibbs', 'dividing', 'surface', 'and', 'bythen', 'computing', 'the', 'free', 'energy', 'difference', 'between', 'the', 'surface', 'of', 'tension', 'and', 'the', 'equimolar', 'dividing', 'surface', 'for', 'benchmark', 'purposes', 'we', 'computed', 'deltafor', 'a', 'model', 'potential', 'and', 'compared', 'the', 'results', 'to', 'less', 'rigorous', 'indirect', 'approaches']]
|
[-0.09444989677017125, 0.1536003881957955, -0.13608692791492033, 0.07418926584426887, -0.02896442574699624, -0.1200611223323414, 0.043383081599425236, 0.3330565927693477, -0.2564225976785215, -0.3255901362317113, 0.04323848746090125, -0.25064329165392196, -0.13728201366387882, 0.2206182425107377, -0.01287208257887799, 0.07950356373778329, 0.04256969318510248, -0.035137193757467544, -0.07820929259581205, -0.17511642697947816, 0.28675032438208853, 0.07432178338774695, 0.3106366242389553, 0.19561311582712312, 0.06764305029780819, -0.03620037027061559, -0.001256879155810636, 0.095854217849242, -0.24269402180468136, 0.10865095794344178, 0.2226416264875577, 0.014038592693395913, 0.2244009613346022, -0.4626568326869836, -0.2676032929896162, 0.0845076312454274, 0.12471143162916773, 0.15491464832493176, -0.05312843147951823, -0.241645714139136, 0.0558291242708667, -0.12648847203415173, -0.12737811784903058, -0.025112868967251137, 0.034020908266449205, 0.007227677894003976, -0.20381933335044708, 0.14379307678542458, 0.018505829053286176, 0.0746047262317286, -0.10919881195116501, -0.10375882776794382, -0.0534014732693322, 0.12016870276375602, 0.06313203042731262, 0.008073370047630027, 0.1754268825161629, -0.1291618699619833, -0.0660451621712687, 0.3819645204079839, -0.07487254890684898, -0.202869893445705, 0.19932736701403672, -0.09637339585102521, -0.05419460405022479, 0.1705570624460681, 0.1313865157094999, 0.11073669290814836, -0.15259805599881265, 0.0799378769051915, 0.03748608252678353, 0.15492214526300532, 0.0970015760905181, -0.06365258302315711, 0.2156268830984258, 0.20394935295558891, 0.021065690576170498, 0.13954514280194416, -0.11870549830178229, -0.09927016159232993, -0.310151629235882, -0.20132405125321104, -0.2184631145792082, -0.004167750952407145, -0.09364944219123572, -0.18993263021290588, 0.3814031508536293, 0.12750452950310248, 0.14261435996741056, 0.04524957756064116, 0.30106696938880934, 0.0835148697790618, 0.0250455517321825, 0.04331164055575545, 0.2230523399829578, 0.11620114053456256, 0.07731316844001412, -0.27753301506253103, 0.08189783337114093, 0.0743343102494971]
|
1,803.09141
|
A Note on the DP-Chromatic Number of Complete Bipartite Graphs
|
DP-coloring (also called correspondence coloring) is a generalization of list
coloring recently introduced by Dvo\v{r}\'{a}k and Postle. Several known bounds
for the list chromatic number of a graph $G$, $\chi_\ell(G)$, also hold for the
DP-chromatic number of $G$, $\chi_{DP}(G)$. On the other hand, there are
several properties of the DP-chromatic number that shows that it differs with
the list chromatic number. In this note we show one such property. It is well
known that $\chi_\ell (K_{k,t}) = k+1$ if and only if $t \geq k^k$. We show
that $\chi_{DP} (K_{k,t}) = k+1$ if $t \geq 1 + (k^k/k!)(\log(k!)+1)$, and we
show that $\chi_{DP} (K_{k,t}) < k+1$ if $t < k^k/k!$.
|
math.CO
|
dpcoloring also called correspondence coloring is a generalization of list coloring recently introduced by dvovrak and postle several known bounds for the list chromatic number of a graph g chi_ellg also hold for the dpchromatic number of g chi_dpg on the other hand there are several properties of the dpchromatic number that shows that it differs with the list chromatic number in this note we show one such property it is well known that chi_ell k_kt k1 if and only if t geq kk we show that chi_dp k_kt k1 if t geq 1 kkklogk1 and we show that chi_dp k_kt k1 if t kkk
|
[['dpcoloring', 'also', 'called', 'correspondence', 'coloring', 'is', 'a', 'generalization', 'of', 'list', 'coloring', 'recently', 'introduced', 'by', 'dvovrak', 'and', 'postle', 'several', 'known', 'bounds', 'for', 'the', 'list', 'chromatic', 'number', 'of', 'a', 'graph', 'g', 'chi_ellg', 'also', 'hold', 'for', 'the', 'dpchromatic', 'number', 'of', 'g', 'chi_dpg', 'on', 'the', 'other', 'hand', 'there', 'are', 'several', 'properties', 'of', 'the', 'dpchromatic', 'number', 'that', 'shows', 'that', 'it', 'differs', 'with', 'the', 'list', 'chromatic', 'number', 'in', 'this', 'note', 'we', 'show', 'one', 'such', 'property', 'it', 'is', 'well', 'known', 'that', 'chi_ell', 'k_kt', 'k1', 'if', 'and', 'only', 'if', 't', 'geq', 'kk', 'we', 'show', 'that', 'chi_dp', 'k_kt', 'k1', 'if', 't', 'geq', '1', 'kkklogk1', 'and', 'we', 'show', 'that', 'chi_dp', 'k_kt', 'k1', 'if', 't', 'kkk']]
|
[-0.18590218623602153, 0.14844890847101366, -0.050217425708871076, 0.034701453859567424, -0.11627993917111124, -0.19596383950239657, 0.044145440194054995, 0.37027703896902575, -0.2557213316109068, -0.3452580474999429, 0.08219746365972638, -0.3256421538512453, -0.20200860164690726, 0.1876533368030692, -0.10411353396841942, -0.028788242582462285, 0.06956372318598027, 0.1535479190879234, 0.051228606024535724, -0.3136779201360498, 0.2605248260735949, -0.08393637861798306, 0.13627473101259605, 0.10512788257663055, 0.06661752128332743, 0.02095325156990992, 0.019104594719771405, 0.09699672535707307, -0.1902890642408292, -0.0037090181658911234, 0.21109204117835748, 0.18983123329292872, 0.22218126639502472, -0.2731870660503017, -0.16895093297871697, 0.21105245054736366, 0.10715392921212138, 0.022567368960837917, -0.05238074812655438, -0.16710599964152617, 0.2049149220422058, -0.14709412869029115, -0.08704915988065376, -0.021497478846940074, 0.16170478205537736, 0.0036898059401624275, -0.25287690349292047, -0.020446085745104505, 0.15456559661300945, 0.01318272620760536, 0.07289240107235342, -0.22340243251643854, -0.06975562678013772, 0.04377875089792922, 0.003971318174891248, 0.09005601705503788, -0.04148646981667469, -0.10962035967783984, -0.1054661822157202, 0.36320429068464455, -0.05247328784040148, -0.13390683632631875, 0.1495860874552584, -0.17730830373279383, -0.2607031281309036, 0.08793294734533617, 0.021896242122580803, 0.1869328606431142, -0.03779975463645441, 0.13460119560390876, -0.18844927921153531, 0.14603505137902084, 0.1533904060361778, 0.053765714320695344, 0.06822815610298721, 0.06905943984373261, 0.13901753769726446, 0.14813159999154085, -0.018485271134459885, 0.07703682439088232, -0.32992672397395467, -0.14643001256713478, -0.22934261696311728, 0.07113320390592412, -0.10540903035489645, -0.1255322129795291, 0.3252481846968726, 0.14321105086272307, 0.18137071162835686, 0.143808331110026, 0.2177066925917706, 0.05176502562100344, 0.03979778588786352, 0.20017233750054447, 0.14631499127844477, 0.1904995617673428, -0.041747759469775575, -0.1846781267310806, 0.018327260009557155, 0.1372005172959347]
|
1,803.09142
|
Bypass attachments in higher-dimensional contact topology
|
We initiate a systematic study of convex hypersurface theory and generalize
the bypass attachment to arbitrary dimensions. We also introduce a new type of
overtwisted object called the overtwisted orange which is middle-dimensional
and contractible.
|
math.SG
|
we initiate a systematic study of convex hypersurface theory and generalize the bypass attachment to arbitrary dimensions we also introduce a new type of overtwisted object called the overtwisted orange which is middledimensional and contractible
|
[['we', 'initiate', 'a', 'systematic', 'study', 'of', 'convex', 'hypersurface', 'theory', 'and', 'generalize', 'the', 'bypass', 'attachment', 'to', 'arbitrary', 'dimensions', 'we', 'also', 'introduce', 'a', 'new', 'type', 'of', 'overtwisted', 'object', 'called', 'the', 'overtwisted', 'orange', 'which', 'is', 'middledimensional', 'and', 'contractible']]
|
[-0.1721229927215193, 0.0953343101377998, -0.09070305840245314, 0.0918491017272962, -0.15061760150960513, -0.1886451690058623, 0.04913699404403035, 0.3527054323681763, -0.2741734286504132, -0.2067339171256338, 0.04879260366516454, -0.22869516273162194, -0.2659280780569783, 0.11375584841838905, -0.20941761865147523, -0.04936723975198609, 0.07935774054910455, 0.011153395154646464, -0.04469669265672564, -0.21890395879080252, 0.4493458503940409, -0.05081620101949998, 0.17618135352219855, 0.13122233170350747, 0.11182420785937991, 0.027296273383711066, -0.008045889809727669, 0.060140447637864525, -0.25717676476176293, 0.19660194144318147, 0.2269465613578047, 0.07634305166346686, 0.20652127909873214, -0.41785058192908764, -0.19170385678964003, 0.16555412762931415, 0.13462835417262145, 0.08465434246630009, -0.061625092104077336, -0.25669634874377933, 0.11653595138341188, -0.16074012898440873, -0.20250061419792473, -0.07255425431898661, 0.0032198152371815275, -0.04738759276723223, -0.18578329187418732, -0.005372843699296937, 0.13315152930361884, 0.08640081511943468, -0.0681994803249836, -0.0024475320641483577, -0.007351475954055786, 0.10115265851574284, -0.022838785758774197, 0.1016046422600214, 0.12318632243467229, -0.04332458435424737, -0.138342236221901, 0.2996427896831717, -0.019113111841891493, -0.2602492072752544, 0.18262199118201222, -0.07555523179471493, -0.21484084469931466, 0.1380861746147275, 0.19234555597816194, 0.2285076993916716, -0.10828647416617189, 0.12345739984552243, -0.09182558831359659, 0.10269029071288449, 0.12616806879107442, -0.04667047251548086, 0.10712096917309931, 0.14767934014754636, 0.13229203644607748, 0.2614872944940414, -0.07944772545514363, -0.058376105661903106, -0.3305434977369649, -0.2380874504734363, -0.07120348212442228, 0.16456324769450084, -0.06470585462687138, -0.28029157327754156, 0.37515157365373203, 0.07969120038407189, 0.2166990529213633, 0.1250962625956163, 0.24420454778841563, -0.032475050006593974, 0.06045365700764316, 0.07977307980347957, 0.13742713294923306, 0.1335745961538383, -0.012445303850940295, -0.11060744669022304, 0.01129861721502883, 0.1711640817379313]
|
1,803.09143
|
Spin squeezing in symmetric multiqubit states with two distinct Majorana
spinors
|
Majorana geometric representation of pure N-qubit states obeying exchange
symmetry is em- ployed to explore spin squeezing properties in the family of
states with two distinct spinors. Dicke states are characterized by two
orthogonal spinors and belong to this family - but they are not spin squeezed.
On the otherhand, those constituted by two non-orthogonal spinors exhibit spin
squeezing.
|
quant-ph
|
majorana geometric representation of pure nqubit states obeying exchange symmetry is em ployed to explore spin squeezing properties in the family of states with two distinct spinors dicke states are characterized by two orthogonal spinors and belong to this family but they are not spin squeezed on the otherhand those constituted by two nonorthogonal spinors exhibit spin squeezing
|
[['majorana', 'geometric', 'representation', 'of', 'pure', 'nqubit', 'states', 'obeying', 'exchange', 'symmetry', 'is', 'em', 'ployed', 'to', 'explore', 'spin', 'squeezing', 'properties', 'in', 'the', 'family', 'of', 'states', 'with', 'two', 'distinct', 'spinors', 'dicke', 'states', 'are', 'characterized', 'by', 'two', 'orthogonal', 'spinors', 'and', 'belong', 'to', 'this', 'family', 'but', 'they', 'are', 'not', 'spin', 'squeezed', 'on', 'the', 'otherhand', 'those', 'constituted', 'by', 'two', 'nonorthogonal', 'spinors', 'exhibit', 'spin', 'squeezing']]
|
[-0.22627515777351398, 0.36748686879230985, -0.03534965441514064, 0.04190953649130875, -0.04812872470838243, -0.22610701386142393, -0.043585636287702824, 0.38364389917716896, -0.19638093776101695, -0.2613520011113122, -0.0053987331499730975, -0.28202822842988473, -0.08425346937167041, 0.1242853703949769, 0.036686278285522914, 0.02858221810311079, -0.009923139803818074, -0.008331293167931766, -0.10341317308785651, -0.21512204382953973, 0.39099422406308865, -0.12107544305637993, 0.32528488126037447, -0.0957391851256473, 0.07883174583347964, 0.0003018554717559239, 0.09607083688425863, -0.0995731248423971, -0.05079616642364397, 0.08088916597249597, 0.2769672008279454, 0.0810710337847985, 0.1115921912714839, -0.3988843560539957, -0.139096695271417, 0.12703281062944183, 0.1191598151746238, 0.1557192709377228, 0.04589180568642593, -0.37219604804854967, -0.046777857050042726, -0.20890417920650337, -0.16555618104557024, -0.18803151419129352, -0.041966285114979435, -0.07682517244769581, -0.1954762530593394, 0.10969319632919185, 0.10445000575895518, 0.035900866266556794, -0.0256026467220087, -0.15699559822678566, -0.11457685361905344, 0.009246036241730225, -0.027876501698207497, -0.09425653618808578, 0.07151192080044862, -0.10004842780321709, -0.2259108497086784, 0.3131709301268184, -0.023712503980716754, -0.3249811599480695, 0.17104566099668114, -0.13254075433159695, -0.11193114727863977, 0.06666318310328342, 0.08427432958229349, 0.06247451854869723, -0.13179892670877022, 0.06435232948218793, -0.08039903637535613, 0.09101982894835287, 0.14635152339228782, 0.19327784154829086, 0.27629753960103826, -0.015090422094639006, 0.08395653928565824, 0.17309093833820702, 0.010395903096148938, -0.1736759737150037, -0.25768261197312126, -0.16502293999756462, -0.29027950724763474, 0.1470472584842355, -0.026267876679726056, -0.1548276673038972, 0.47741579123098277, 0.028850980247531473, 0.12205689859672866, -0.02485066109963147, 0.1483096108001111, 0.08438249396417162, 0.05413880518733941, 0.09658356027773998, 0.2828386229751953, 0.22487011660243675, -0.042743014565123055, -0.25742595213272707, -0.02021498132320442, 0.03887243955476402]
|
1,803.09144
|
A study on resistance matrix of graphs
|
In this article we consider resistance matrix of a connected graph. For
unweighted graph we study some necessary and sufficient conditions for
resistance regular graphs. Also we find some relationship between Laplacian
matrix and resistance matrix in case of weighted graphs where all edge weights
are positive definite matrices of given order.
|
math.CO
|
in this article we consider resistance matrix of a connected graph for unweighted graph we study some necessary and sufficient conditions for resistance regular graphs also we find some relationship between laplacian matrix and resistance matrix in case of weighted graphs where all edge weights are positive definite matrices of given order
|
[['in', 'this', 'article', 'we', 'consider', 'resistance', 'matrix', 'of', 'a', 'connected', 'graph', 'for', 'unweighted', 'graph', 'we', 'study', 'some', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'resistance', 'regular', 'graphs', 'also', 'we', 'find', 'some', 'relationship', 'between', 'laplacian', 'matrix', 'and', 'resistance', 'matrix', 'in', 'case', 'of', 'weighted', 'graphs', 'where', 'all', 'edge', 'weights', 'are', 'positive', 'definite', 'matrices', 'of', 'given', 'order']]
|
[-0.16285460841698715, 0.10843356848748115, 0.03152311759409853, 0.047834168947212256, -0.10845657611319509, -0.16886029968288943, 0.039772679460628964, 0.44844200197034156, -0.26162253979306954, -0.2504333365583219, 0.12197177451050195, -0.3123938823118806, -0.2943145331138602, 0.08282500899468477, -0.09911641142277333, 0.07650294360848, 0.12777527627678445, 0.1209270922968594, -0.07911134203179525, -0.24586706372680894, 0.39879681757436347, -0.04329577662373105, 0.18126903132248956, 0.15722792588460904, 0.04863836514134444, 0.016500285754983243, -0.03660055372165516, 0.11399585787708369, -0.1770186324317295, 0.059172773675527424, 0.2880798978731036, 0.10215514806958918, 0.2280352499622565, -0.472924766345666, -0.11006487637328413, 0.28801773462552005, 0.05871362296434549, 0.046594069715446, -0.002307301136450126, -0.18228115300343445, 0.1549883145803156, -0.12189467781438278, -0.05647741625300394, -0.03602112987293647, 0.0667907535456694, -0.00422557923817434, -0.34378211812760967, 0.08748898620643349, 0.07210054667666554, 0.04318223798719163, -0.03307439221176677, -0.1800334857096179, 0.034267111197830394, 0.1288401342731399, -0.08975392366231133, -0.06425846827243312, 0.011808022471646277, -0.08955468059642814, -0.1088619172358169, 0.28449379024991334, -0.014155561258891024, -0.21656497499833888, 0.07925774992551081, -0.17560022607302436, -0.1545870920123819, 0.008397044667687554, 0.19390722090163484, 0.1123016093714306, -0.13835846384664854, 0.07899942599872772, -0.07971920932714756, 0.06823434037729524, 0.11751920943900657, 0.017724768742202565, 0.07734060488068141, 0.11434437877212006, 0.1931336700396899, 0.18975899243154204, 0.039795094304001674, -0.0206200209661172, -0.31337953255010337, -0.16532828071369574, -0.223196512323249, 0.085120166078783, -0.22450310308788454, -0.2559961531526194, 0.46531269477250486, 0.12123138450372678, 0.2457015227454786, 0.13982106901060504, 0.19135687102635318, 0.0951313577142383, -0.015914878700501643, 0.1467846511827352, 0.07409668177066263, 0.29122883070690125, 0.06144217779868855, -0.15433327636968058, 0.08614239934831858, 0.10388078365045098]
|
1,803.09145
|
SMDP-based Downlink Packet Scheduling Scheme for Solar Energy Assisted
Heterogeneous Networks
|
Renewable energy assisted heterogeneous networks can improve system capacity
and reduce conventional energy consumption. In this paper, we propose a
semi-Markov decision process (SMDP)-based downlink packet scheduling scheme for
solar energy assisted heterogeneous networks (HetNets), where solar radiation
is modeled as a continuous-time Markov chain (CTMC) and the arrivals of
multi-class downlink packets are modeled as Poisson processes. The proposed
downlink packet scheduling scheme can be compatible with the mainstream
wireless packet networks such as long-term evolution (LTE) networks and the
fifth-generation (5G) networks because the SMDP is a real-time admission
control model. To obtain an asymptotically optimal downlink packet scheduling
policy, we solve the semi-Markov decision problem using the relative value
iteration algorithm under average criterion and the value iteration algorithm
under discounted criterion, respectively. The simulation results show that the
average cost of the SMDP-based packet scheduling scheme is less than that of
the greedy packet scheduling scheme.
|
cs.NI
|
renewable energy assisted heterogeneous networks can improve system capacity and reduce conventional energy consumption in this paper we propose a semimarkov decision process smdpbased downlink packet scheduling scheme for solar energy assisted heterogeneous networks hetnets where solar radiation is modeled as a continuoustime markov chain ctmc and the arrivals of multiclass downlink packets are modeled as poisson processes the proposed downlink packet scheduling scheme can be compatible with the mainstream wireless packet networks such as longterm evolution lte networks and the fifthgeneration 5g networks because the smdp is a realtime admission control model to obtain an asymptotically optimal downlink packet scheduling policy we solve the semimarkov decision problem using the relative value iteration algorithm under average criterion and the value iteration algorithm under discounted criterion respectively the simulation results show that the average cost of the smdpbased packet scheduling scheme is less than that of the greedy packet scheduling scheme
|
[['renewable', 'energy', 'assisted', 'heterogeneous', 'networks', 'can', 'improve', 'system', 'capacity', 'and', 'reduce', 'conventional', 'energy', 'consumption', 'in', 'this', 'paper', 'we', 'propose', 'a', 'semimarkov', 'decision', 'process', 'smdpbased', 'downlink', 'packet', 'scheduling', 'scheme', 'for', 'solar', 'energy', 'assisted', 'heterogeneous', 'networks', 'hetnets', 'where', 'solar', 'radiation', 'is', 'modeled', 'as', 'a', 'continuoustime', 'markov', 'chain', 'ctmc', 'and', 'the', 'arrivals', 'of', 'multiclass', 'downlink', 'packets', 'are', 'modeled', 'as', 'poisson', 'processes', 'the', 'proposed', 'downlink', 'packet', 'scheduling', 'scheme', 'can', 'be', 'compatible', 'with', 'the', 'mainstream', 'wireless', 'packet', 'networks', 'such', 'as', 'longterm', 'evolution', 'lte', 'networks', 'and', 'the', 'fifthgeneration', '5g', 'networks', 'because', 'the', 'smdp', 'is', 'a', 'realtime', 'admission', 'control', 'model', 'to', 'obtain', 'an', 'asymptotically', 'optimal', 'downlink', 'packet', 'scheduling', 'policy', 'we', 'solve', 'the', 'semimarkov', 'decision', 'problem', 'using', 'the', 'relative', 'value', 'iteration', 'algorithm', 'under', 'average', 'criterion', 'and', 'the', 'value', 'iteration', 'algorithm', 'under', 'discounted', 'criterion', 'respectively', 'the', 'simulation', 'results', 'show', 'that', 'the', 'average', 'cost', 'of', 'the', 'smdpbased', 'packet', 'scheduling', 'scheme', 'is', 'less', 'than', 'that', 'of', 'the', 'greedy', 'packet', 'scheduling', 'scheme']]
|
[-0.2525540600039971, 0.03106280639730284, -0.010546444952991363, 0.06501257207252353, -0.05603751514777164, -0.24865741338392064, 0.17303397331931125, 0.45290544616511547, -0.30284118747993094, -0.24969538316332004, 0.09689118581858615, -0.2044695783406496, -0.1802629346540827, 0.14599591804309622, -0.14237364759429585, 0.14800641557982042, 0.13083423032485125, 0.028885845061882423, 0.04565422166480267, -0.28135149630189343, 0.25136138331475416, 0.17899781237104656, 0.42081970252046313, -0.0027131006425259183, 0.11492514161609751, 0.0223724409321172, 0.022605664962021686, -0.07740475061173374, -0.06898504220265061, 0.03479536004109635, 0.3343909765212998, 0.2182964281984479, 0.3420255977559734, -0.45132999445588606, -0.31170428397662536, 0.12749806621325882, 0.16409694457841986, 0.029288802528753877, 0.03470878906365534, -0.258693605711734, 0.1165127581004305, -0.2778074880778739, -0.011853153730830731, 0.031370047387050314, -0.11554773424349322, 0.082579021965078, -0.3775464442143267, 0.026147337282718335, -0.04552301649306861, -0.022421310728138966, -0.12423048016451602, -0.07961518065988187, -0.005883115217895122, 0.08786575143686433, 0.02896524443526318, -0.006187015747953509, 0.1533207003675351, -0.06114655395346769, -0.19492384998562015, 0.4015236665821961, -0.004330599498545681, -0.21794576880622757, 0.06973901201303848, 0.023676436312647688, -0.1282286347909453, 0.17269412479111673, 0.2980268338197257, 0.09484521774700969, -0.23587362694151298, -0.007723324826754932, 0.0003378052591673426, 0.1331922813016619, 0.0646250963783697, 0.08818715002161225, 0.08399600956299519, 0.2743799085099552, 0.2027570886751385, 0.12650189723432492, -0.09291463722065846, -0.2183656944213687, -0.18216069588576117, -0.12065339314663229, -0.18396057262764992, 0.05954960672701221, -0.14237208933706358, -0.08594915555236307, 0.3135902908809815, 0.15338418514187577, 0.07077008458106099, 0.21284254402475986, 0.4054469250369112, 0.2346616449956216, -0.005000236193646325, 0.21481338307903325, 0.09691811728643605, 0.05637392837151482, 0.23169186422475488, -0.2524660019663389, 0.10799687582766637, 0.0499241043423378]
|
1,803.09146
|
Replicator equation on networks with degree regular communities
|
The replicator equation is one of the fundamental tools to study evolutionary
dynamics in well-mixed populations. This paper contributes to the literature on
evolutionary graph theory, providing a version of the replicator equation for a
family of connected networks with communities, where nodes in the same
community have the same degree. This replicator equation is applied to the
study of different classes of games, exploring the impact of the graph
structure on the equilibria of the evolutionary dynamics.
|
q-bio.PE physics.soc-ph
|
the replicator equation is one of the fundamental tools to study evolutionary dynamics in wellmixed populations this paper contributes to the literature on evolutionary graph theory providing a version of the replicator equation for a family of connected networks with communities where nodes in the same community have the same degree this replicator equation is applied to the study of different classes of games exploring the impact of the graph structure on the equilibria of the evolutionary dynamics
|
[['the', 'replicator', 'equation', 'is', 'one', 'of', 'the', 'fundamental', 'tools', 'to', 'study', 'evolutionary', 'dynamics', 'in', 'wellmixed', 'populations', 'this', 'paper', 'contributes', 'to', 'the', 'literature', 'on', 'evolutionary', 'graph', 'theory', 'providing', 'a', 'version', 'of', 'the', 'replicator', 'equation', 'for', 'a', 'family', 'of', 'connected', 'networks', 'with', 'communities', 'where', 'nodes', 'in', 'the', 'same', 'community', 'have', 'the', 'same', 'degree', 'this', 'replicator', 'equation', 'is', 'applied', 'to', 'the', 'study', 'of', 'different', 'classes', 'of', 'games', 'exploring', 'the', 'impact', 'of', 'the', 'graph', 'structure', 'on', 'the', 'equilibria', 'of', 'the', 'evolutionary', 'dynamics']]
|
[-0.13715735244421431, 0.04303033805141846, -0.1405228776857257, 0.08469161553642689, -0.06498307459510098, -0.09569622137048729, 0.03792774578771339, 0.3051351164825834, -0.3135041836290978, -0.2946663409567032, 0.05921811258229308, -0.24337111957944357, -0.19070119905070618, 0.07544588605658366, -0.04852175159761921, -0.02172424094990278, 0.11131633276072068, 0.05417948816186534, 0.04310983221213787, -0.26179890240354536, 0.40919939251258397, 0.003573304400421106, 0.23516852122086745, -0.02912225528882864, 0.10608767252415419, -0.045550018745976, -0.00959764111142319, 0.05354059788470085, -0.18469267137921774, 0.14557359708496967, 0.2683256517092769, 0.16740429916013128, 0.3410050290881489, -0.3950579928664061, -0.2469590008766271, 0.16609705292070523, 0.13519718007256204, 0.1505933973388985, -0.0073349811166572645, -0.2712447171171124, 0.07388274799077174, -0.13750096667690043, -0.14570402328927928, 0.013892747294635344, 0.01161128075984426, 0.0644175133202225, -0.19899435490384723, 0.026131002387652796, 0.022209910460962698, 0.0648608364833471, -0.062105187465651676, -0.13016005831125838, -0.03617452562619478, 0.17044070997060493, 0.010736677397149973, -0.011539020480062718, 0.0895198470650193, -0.18823614266987604, -0.16590509451448154, 0.40650563547014595, -0.04841337341051071, -0.19945542498802146, 0.21452908956397992, -0.10852006235374854, -0.1928471174234381, 0.05898065162368883, 0.2135252315336122, 0.13957525799289727, -0.18793182504939465, 0.09984660279960969, -0.07016316599523027, 0.13916179719410884, 0.01641148217738821, -0.0026928879774342743, 0.14262624827619547, 0.2662061277466516, 0.09786023765814324, 0.12448328738817228, 0.02628881687250657, -0.24520711812119073, -0.2043227337133617, -0.11709682377150808, -0.14149745271051636, 0.056014227006250084, -0.1271229138544116, -0.19767227564723447, 0.4818865668076353, 0.1252509467691804, 0.11647991770400833, 0.06535800541631687, 0.2378458091750359, 0.09042283138767697, -0.005727793806447432, 0.07898739559384875, 0.19110457178873894, 0.19991757140423244, 0.12027738650496571, -0.2586129331507553, 0.12626817260080805, 0.08240277633572426]
|
1,803.09147
|
A generalization of an integrability theorem of Darboux
|
In his monograph "Le\c{c}ons sur les syst\`emes orthogonaux et les
coordonn\'ees curvilignes. Principes de g\'eom\'etrie analytique", 1910,
Darboux stated three theorems providing local existence and uniqueness of
solutions to first order systems of the type \[\partial_{x_i}
u_\alpha(x)=f^\alpha_i(x,u(x)),\quad i\in I_\alpha\subseteq\{1,\dots,n\}.\] For
a given point $\bar x\in \mathbb{R}^n$ it is assumed that the values of the
unknown $u_\alpha$ are given locally near $\bar x$ along $\{x\,|\, x_i=\bar x_i
\, \text{for each}\, i\in I_\alpha\}$. The more general of the theorems,
Th\'eor\`eme III, was proved by Darboux only for the cases $n=2$ and $3$.
In this work we formulate and prove a generalization of Darboux's
Th\'eor\`eme III which applies to systems of the form \[{\mathbf
r}_i(u_\alpha)\big|_x = f_i^\alpha (x, u(x)), \quad i\in
I_\alpha\subseteq\{1,\dots,n\}\] where $\mathcal R=\{{\mathbf r}_i\}_{i=1}^n$
is a fixed local frame of vector fields near $\bar x$. The data for $u_\alpha$
are prescribed along a manifold $\Xi_\alpha$ containing $\bar x$ and transverse
to the vector fields $\{{\mathbf r}_i\,|\, i\in I_\alpha\}$. We identify a
certain Stable Configuration Condition (SCC). This is a geometric condition
that depends on both the frame $\mathcal R$ and on the manifolds $\Xi_\alpha$;
it is automatically met in the case considered by Darboux. Assuming the SCC and
the relevant integrability conditions are satisfied, we establish local
existence and uniqueness of a $C^1$-solution via Picard iteration for any
number of independent variables $n$.
|
math.AP math.DG
|
in his monograph leccons sur les systemes orthogonaux et les coordonnees curvilignes principes de geometrie analytique 1910 darboux stated three theorems providing local existence and uniqueness of solutions to first order systems of the type partial_x_i u_alphaxfalpha_ixuxquad iin i_alphasubseteq1dotsn for a given point bar xin mathbbrn it is assumed that the values of the unknown u_alpha are given locally near bar x along x x_ibar x_i textfor each iin i_alpha the more general of the theorems theoreme iii was proved by darboux only for the cases n2 and 3 in this work we formulate and prove a generalization of darbouxs theoreme iii which applies to systems of the form mathbf r_iu_alphabig_x f_ialpha x ux quad iin i_alphasubseteq1dotsn where mathcal rmathbf r_i_i1n is a fixed local frame of vector fields near bar x the data for u_alpha are prescribed along a manifold xi_alpha containing bar x and transverse to the vector fields mathbf r_i iin i_alpha we identify a certain stable configuration condition scc this is a geometric condition that depends on both the frame mathcal r and on the manifolds xi_alpha it is automatically met in the case considered by darboux assuming the scc and the relevant integrability conditions are satisfied we establish local existence and uniqueness of a c1solution via picard iteration for any number of independent variables n
|
[['in', 'his', 'monograph', 'leccons', 'sur', 'les', 'systemes', 'orthogonaux', 'et', 'les', 'coordonnees', 'curvilignes', 'principes', 'de', 'geometrie', 'analytique', '1910', 'darboux', 'stated', 'three', 'theorems', 'providing', 'local', 'existence', 'and', 'uniqueness', 'of', 'solutions', 'to', 'first', 'order', 'systems', 'of', 'the', 'type', 'partial_x_i', 'u_alphaxfalpha_ixuxquad', 'iin', 'i_alphasubseteq1dotsn', 'for', 'a', 'given', 'point', 'bar', 'xin', 'mathbbrn', 'it', 'is', 'assumed', 'that', 'the', 'values', 'of', 'the', 'unknown', 'u_alpha', 'are', 'given', 'locally', 'near', 'bar', 'x', 'along', 'x', 'x_ibar', 'x_i', 'textfor', 'each', 'iin', 'i_alpha', 'the', 'more', 'general', 'of', 'the', 'theorems', 'theoreme', 'iii', 'was', 'proved', 'by', 'darboux', 'only', 'for', 'the', 'cases', 'n2', 'and', '3', 'in', 'this', 'work', 'we', 'formulate', 'and', 'prove', 'a', 'generalization', 'of', 'darbouxs', 'theoreme', 'iii', 'which', 'applies', 'to', 'systems', 'of', 'the', 'form', 'mathbf', 'r_iu_alphabig_x', 'f_ialpha', 'x', 'ux', 'quad', 'iin', 'i_alphasubseteq1dotsn', 'where', 'mathcal', 'rmathbf', 'r_i_i1n', 'is', 'a', 'fixed', 'local', 'frame', 'of', 'vector', 'fields', 'near', 'bar', 'x', 'the', 'data', 'for', 'u_alpha', 'are', 'prescribed', 'along', 'a', 'manifold', 'xi_alpha', 'containing', 'bar', 'x', 'and', 'transverse', 'to', 'the', 'vector', 'fields', 'mathbf', 'r_i', 'iin', 'i_alpha', 'we', 'identify', 'a', 'certain', 'stable', 'configuration', 'condition', 'scc', 'this', 'is', 'a', 'geometric', 'condition', 'that', 'depends', 'on', 'both', 'the', 'frame', 'mathcal', 'r', 'and', 'on', 'the', 'manifolds', 'xi_alpha', 'it', 'is', 'automatically', 'met', 'in', 'the', 'case', 'considered', 'by', 'darboux', 'assuming', 'the', 'scc', 'and', 'the', 'relevant', 'integrability', 'conditions', 'are', 'satisfied', 'we', 'establish', 'local', 'existence', 'and', 'uniqueness', 'of', 'a', 'c1solution', 'via', 'picard', 'iteration', 'for', 'any', 'number', 'of', 'independent', 'variables', 'n']]
|
[-0.20153483786034224, 0.0671237755391934, -0.039792464686776, 0.04759114344089635, -0.06094121968075098, -0.19493590483138934, -0.01511111031464662, 0.298427519045378, -0.2627223810062935, -0.16302122199756391, 0.10459861103233627, -0.3044449670427439, -0.10283662709095583, 0.14348178308982953, -0.11877914818458295, 0.011749561445558618, -0.001321616719597193, 0.06509091224717467, -0.0656036756259866, -0.27781611919218147, 0.3411375234041666, -0.05144726300977491, 0.19861330793564472, -0.016890234912692183, 0.15246511517375547, 0.034625450033320196, 0.021198643117465756, -0.04648180746491788, -0.2111041720037635, 0.05756049149482551, 0.2585557118419148, 0.14579145943226698, 0.2510154977636902, -0.34471502499521206, -0.12856866111232493, 0.1715377005158019, 0.12833084816638932, -0.023614358304527423, 0.006597746381328361, -0.3049903911879313, 0.16193523621281306, -0.07652382951610806, -0.17945277956915956, -0.035995157916515474, 0.08690304286403662, 0.06928557872161732, -0.34146949837349677, 0.06559696343045628, 0.12160905596909323, 0.07400079740749718, -0.08111652837727558, -0.1483208965816486, -0.08510655481546547, 0.030753336237458306, 0.009636735356452934, 0.12859092254423354, 0.05439618103424506, -0.05902997403668516, -0.02978907437531643, 0.3644988275440543, -0.040453569765835466, -0.2179390949867755, 0.13438546052202582, -0.12732396236928314, -0.18930180027298896, 0.0924257015671278, 0.09733437057865815, 0.17091429619002713, -0.09022011765630907, 0.20090899662102565, -0.08796862924346727, 0.08395913260964939, 0.14063170510589293, 0.00514705923354447, 0.11782693281673946, 0.06328567187858826, 0.06849632209944471, 0.02873932174072739, -0.04939208825845182, -0.009305440772850618, -0.3973036927736975, -0.194472969650028, -0.13035027308135547, 0.1350825038553621, -0.10100460698351578, -0.13230406903799927, 0.29714199877566877, 0.05961882974395448, 0.18713596057699342, 0.06181789783295244, 0.16550398696632834, 0.06353680769641078, -0.01821874122081868, 0.12101430657573721, 0.15141192888038937, 0.17310069639315945, 0.11129049593850114, -0.14604651154315268, 0.009170831795492204, 0.18692530482076108]
|
1,803.09148
|
Scalar field condensation behaviors around reflecting shells in Anti-de
Sitter spacetimes
|
We study scalar condensations around asymptotically Anti-de Sitter(AdS)
regular reflecting shells. We show that the charged scalar field can condense
around charged reflecting shells with both Dirichlet and Neumann boundary
conditions. In particular, the radii of the asymptotically AdS hairy shells are
discrete, which is similar to cases in asymptotically flat spacetimes. We also
provide upper bounds for the radii of the hairy Dirichlet reflecting shells and
above the bound, the scalar field cannot condense around the shell.
|
gr-qc astro-ph.HE hep-th
|
we study scalar condensations around asymptotically antide sitterads regular reflecting shells we show that the charged scalar field can condense around charged reflecting shells with both dirichlet and neumann boundary conditions in particular the radii of the asymptotically ads hairy shells are discrete which is similar to cases in asymptotically flat spacetimes we also provide upper bounds for the radii of the hairy dirichlet reflecting shells and above the bound the scalar field cannot condense around the shell
|
[['we', 'study', 'scalar', 'condensations', 'around', 'asymptotically', 'antide', 'sitterads', 'regular', 'reflecting', 'shells', 'we', 'show', 'that', 'the', 'charged', 'scalar', 'field', 'can', 'condense', 'around', 'charged', 'reflecting', 'shells', 'with', 'both', 'dirichlet', 'and', 'neumann', 'boundary', 'conditions', 'in', 'particular', 'the', 'radii', 'of', 'the', 'asymptotically', 'ads', 'hairy', 'shells', 'are', 'discrete', 'which', 'is', 'similar', 'to', 'cases', 'in', 'asymptotically', 'flat', 'spacetimes', 'we', 'also', 'provide', 'upper', 'bounds', 'for', 'the', 'radii', 'of', 'the', 'hairy', 'dirichlet', 'reflecting', 'shells', 'and', 'above', 'the', 'bound', 'the', 'scalar', 'field', 'can', 'not', 'condense', 'around', 'the', 'shell']]
|
[-0.14919958560126304, 0.2015044763212717, -0.07462739261291639, 0.12461411746224695, -0.06621041905600578, -0.16244916591934766, -0.05197548777855272, 0.3683887800360924, -0.09870990257875263, -0.2647388285023007, 0.11577501918094917, -0.32072490255666686, -0.06367236181291976, 0.07436934080493601, -0.02809148641373915, -0.015125506357113017, 0.013623815418893024, 0.0924808168404329, -0.10777133799606015, -0.20873444143069697, 0.4017780399586581, 0.03150128997579406, 0.22487490294100362, 0.055861002423718005, -0.010523432447233154, -0.09137683839218903, 0.07705153572031215, 0.05706748969815992, -0.23551969565909806, 0.0723780661974621, 0.1828625751261399, 0.02716841594657943, 0.17966005810878322, -0.43571528801812404, -0.1895599077821155, 0.13874631265437679, 0.23785107609921996, 0.10847092244060876, -0.0634818125421865, -0.3103878295072649, 0.11412418909559521, -0.1144698234982317, -0.23072731190750115, -0.031644043512642384, -0.0042881050671721935, -0.031105670464944234, -0.2770471239692378, 0.1298913420911118, 0.09881422216001945, -0.05837570084001032, -0.22193044584975402, -0.09643235959442734, -0.0902825646585773, 0.05855149416182237, 0.13965630307027338, -0.048863712671696195, 0.1575089540226456, -0.11744598012794799, -0.010235546161184866, 0.30789780791235877, -0.0937570792540342, -0.2392896991340986, 0.1882772665659461, -0.2548311289659218, -0.05384029265893977, 0.13245009905599717, 0.17720043800676924, 0.2266153093380264, -0.11108162315397323, 0.17723065387027315, -0.06708392412018596, 0.1148845399670963, 0.21626983367826177, 0.018453713370887918, 0.3561644843201848, 0.04320181532220656, 0.06840450038007591, 0.22754255521901046, -0.03746342344675213, -0.1688375064972022, -0.38287951681715776, -0.1670307321216074, -0.10312215175149561, 0.040397845907321, -0.18691007409184357, -0.26932531777810587, 0.27074574395613393, 0.04169696185124826, 0.1608219716721509, 0.05154002123199922, 0.17083589598253557, 0.07074371216040623, 0.029394214825492492, 0.22455191223799617, 0.2749133419386948, 0.15625914800440585, 0.10612160734879443, -0.17569565226595046, -0.11740615378617297, 0.08678152179934934]
|
1,803.09149
|
Global-mean Vertical Tracer Mixing in Planetary Atmospheres I: Theory
and Fast-rotating Planets
|
Most chemistry and cloud formation models for planetary atmospheres adopt a
one-dimensional (1D) diffusion approach to approximate the global-mean vertical
tracer transport. The physical underpinning of the key parameter in this
framework, eddy diffusivity $K_{zz}$, is usually obscure. Here we analytically
and numerically investigate vertical tracer transport in a 3D stratified
atmosphere and predict $K_{zz}$ as a function of the large-scale circulation
strength, horizontal mixing due to eddies and waves and local tracer sources
and sinks. We find that $K_{zz}$ increases with tracer chemical lifetime and
circulation strength but decreases with horizontal eddy mixing efficiency. We
demarcated three $K_{zz}$ regimes in planetary atmospheres. In the first regime
where the tracer lifetime is short compared with the transport timescale and
horizontal tracer distribution under chemical equilibrium ($\chi_0$) is
uniformly distributed across the globe, global-mean vertical tracer mixing
behaves diffusively. But the traditional assumption in current 1D models that
all chemical species are transported via the same eddy diffusivity generally
breaks down. We show that different chemical species in a single atmosphere
should in principle have different eddy diffusion profiles. In the second
regime where tracer is short-lived but $\chi_0$ is non-uniformly distributed, a
significant non-diffusive component might lead to a negative $K_{zz}$ under the
diffusive assumption. In the third regime where the tracer is long-lived,
global-mean vertical tracer transport is also largely influenced by
non-diffusive effects. Numerical simulations of 2D tracer transport on
fast-rotating zonally symmetric planets validate our analytical $K_{zz}$ theory
over a wide parameter space.
|
astro-ph.EP
|
most chemistry and cloud formation models for planetary atmospheres adopt a onedimensional 1d diffusion approach to approximate the globalmean vertical tracer transport the physical underpinning of the key parameter in this framework eddy diffusivity k_zz is usually obscure here we analytically and numerically investigate vertical tracer transport in a 3d stratified atmosphere and predict k_zz as a function of the largescale circulation strength horizontal mixing due to eddies and waves and local tracer sources and sinks we find that k_zz increases with tracer chemical lifetime and circulation strength but decreases with horizontal eddy mixing efficiency we demarcated three k_zz regimes in planetary atmospheres in the first regime where the tracer lifetime is short compared with the transport timescale and horizontal tracer distribution under chemical equilibrium chi_0 is uniformly distributed across the globe globalmean vertical tracer mixing behaves diffusively but the traditional assumption in current 1d models that all chemical species are transported via the same eddy diffusivity generally breaks down we show that different chemical species in a single atmosphere should in principle have different eddy diffusion profiles in the second regime where tracer is shortlived but chi_0 is nonuniformly distributed a significant nondiffusive component might lead to a negative k_zz under the diffusive assumption in the third regime where the tracer is longlived globalmean vertical tracer transport is also largely influenced by nondiffusive effects numerical simulations of 2d tracer transport on fastrotating zonally symmetric planets validate our analytical k_zz theory over a wide parameter space
|
[['most', 'chemistry', 'and', 'cloud', 'formation', 'models', 'for', 'planetary', 'atmospheres', 'adopt', 'a', 'onedimensional', '1d', 'diffusion', 'approach', 'to', 'approximate', 'the', 'globalmean', 'vertical', 'tracer', 'transport', 'the', 'physical', 'underpinning', 'of', 'the', 'key', 'parameter', 'in', 'this', 'framework', 'eddy', 'diffusivity', 'k_zz', 'is', 'usually', 'obscure', 'here', 'we', 'analytically', 'and', 'numerically', 'investigate', 'vertical', 'tracer', 'transport', 'in', 'a', '3d', 'stratified', 'atmosphere', 'and', 'predict', 'k_zz', 'as', 'a', 'function', 'of', 'the', 'largescale', 'circulation', 'strength', 'horizontal', 'mixing', 'due', 'to', 'eddies', 'and', 'waves', 'and', 'local', 'tracer', 'sources', 'and', 'sinks', 'we', 'find', 'that', 'k_zz', 'increases', 'with', 'tracer', 'chemical', 'lifetime', 'and', 'circulation', 'strength', 'but', 'decreases', 'with', 'horizontal', 'eddy', 'mixing', 'efficiency', 'we', 'demarcated', 'three', 'k_zz', 'regimes', 'in', 'planetary', 'atmospheres', 'in', 'the', 'first', 'regime', 'where', 'the', 'tracer', 'lifetime', 'is', 'short', 'compared', 'with', 'the', 'transport', 'timescale', 'and', 'horizontal', 'tracer', 'distribution', 'under', 'chemical', 'equilibrium', 'chi_0', 'is', 'uniformly', 'distributed', 'across', 'the', 'globe', 'globalmean', 'vertical', 'tracer', 'mixing', 'behaves', 'diffusively', 'but', 'the', 'traditional', 'assumption', 'in', 'current', '1d', 'models', 'that', 'all', 'chemical', 'species', 'are', 'transported', 'via', 'the', 'same', 'eddy', 'diffusivity', 'generally', 'breaks', 'down', 'we', 'show', 'that', 'different', 'chemical', 'species', 'in', 'a', 'single', 'atmosphere', 'should', 'in', 'principle', 'have', 'different', 'eddy', 'diffusion', 'profiles', 'in', 'the', 'second', 'regime', 'where', 'tracer', 'is', 'shortlived', 'but', 'chi_0', 'is', 'nonuniformly', 'distributed', 'a', 'significant', 'nondiffusive', 'component', 'might', 'lead', 'to', 'a', 'negative', 'k_zz', 'under', 'the', 'diffusive', 'assumption', 'in', 'the', 'third', 'regime', 'where', 'the', 'tracer', 'is', 'longlived', 'globalmean', 'vertical', 'tracer', 'transport', 'is', 'also', 'largely', 'influenced', 'by', 'nondiffusive', 'effects', 'numerical', 'simulations', 'of', '2d', 'tracer', 'transport', 'on', 'fastrotating', 'zonally', 'symmetric', 'planets', 'validate', 'our', 'analytical', 'k_zz', 'theory', 'over', 'a', 'wide', 'parameter', 'space']]
|
[-0.12199853159907478, 0.22316380539753786, -0.04677498955431023, 0.04369967431137603, -0.009475691643414823, -0.09867662863381874, -0.008173494986864186, 0.36676838635883435, -0.2905835928229759, -0.284903314725564, 0.03615600714124966, -0.2224391762158224, -0.09145165271905621, 0.1682687724932907, 0.013028428899275699, 0.006761994742413574, 0.05981213985696223, -0.08729723648630022, 0.03299832706267726, -0.1447940438671598, 0.24459563305779414, 0.07220928517276255, 0.26395492130564907, 0.040668729533218, 0.05105213090641106, -0.12289310344286657, -0.04501591457765761, 0.01673188700652549, -0.18415184948049515, -0.00889790370848363, 0.17684695961624522, -0.004305937189260513, 0.21665263741099222, -0.46483456519833666, -0.30867962646714553, 0.07803083771018206, 0.23632554070478895, 0.10670648928830112, -0.040760674896662796, -0.18655674850825615, 0.012587248557815102, -0.1426903187284034, -0.15851148384115923, -0.023569027226933135, 0.0592804838632559, 0.051643907729483296, -0.303204553608775, 0.18363534450345026, 0.022347814942013502, 0.1173642287257968, -0.07533238766536227, -0.101294483081343, -0.10056296111239742, 0.10907236258717011, 0.05827065493974622, -0.003104156859472727, 0.2553457908059766, -0.13533164408508447, 0.025759244742765416, 0.4099128851818481, -0.17465081074647984, -0.23209011843958036, 0.25065499209662584, -0.19473528318917302, -0.09100315245343997, 0.13488245999480303, 0.1602271092162142, 0.14239831769657207, -0.14805442605894514, 0.019776381379962574, -0.08390313648520326, 0.15210801216135297, 0.02282107104093018, -0.036788521251239915, 0.2747899909783912, 0.19476529156478742, 0.10328853834038071, 0.06988376995517373, -0.17360383793389864, -0.17845366664639697, -0.20445777626511286, -0.160347516115611, -0.1468055858584386, 0.08217839258571526, -0.112596426164349, -0.19170162139807798, 0.33580510613387377, 0.18486400848165593, 0.15369859809903957, 0.03450529867623709, 0.3255033324836049, 0.10105725178377688, 0.033146743497023796, 0.14180636237852456, 0.2409670687123482, 0.186644307702564, 0.15104790440073418, -0.26593697770809605, 0.14003597933428014, 0.025224961150187727]
|
1,803.0915
|
Non-paraxial relativistic wave packets with orbital angular momentum
|
One of the reasons for the tremendous success of a plane-wave approximation
in particle physics is that the non-paraxial corrections to such observables as
energy, magnetic moment, scattering cross section, and so on are attenuated as
$\lambda_c^2/\sigma_{\perp}^2 \ll 1$ where $\sigma_{\perp}$ is a beam width and
$\lambda_c = \hbar/mc$ is a Compton wavelength. This amounts to less than
$10^{-14}$ for modern electron accelerators and less than $10^{-6}$ for
electron microscopes. Here we show that these corrections are $|\ell|$ times
enhanced for vortex particles with high orbital angular momenta $|\ell|\hbar$,
which can already be as large as $10^3\hbar$. We put forward the relativistic
wave packets, both for vortex bosons and fermions, which transform correctly
under the Lorentz boosts, are localized in a 3D space, and represent a
non-paraxial generalization of the Laguerre-Gaussian beams. We demonstrate that
it is $\sqrt{|\ell|}\, \lambda_c \gg \lambda_c$ that defines a paraxial scale
for such packets, in contrast to those with a non-singular phase (say, the Airy
beams). With current technology, the non-paraxial corrections can reach the
relative values of $10^{-3}$, yield a proportional increase of an invariant
mass of the electron packet, describe a spin-orbit coupling as well as the
quantum coherence phenomena in particle and atomic collisions.
|
quant-ph hep-ph physics.optics
|
one of the reasons for the tremendous success of a planewave approximation in particle physics is that the nonparaxial corrections to such observables as energy magnetic moment scattering cross section and so on are attenuated as lambda_c2sigma_perp2 ll 1 where sigma_perp is a beam width and lambda_c hbarmc is a compton wavelength this amounts to less than 1014 for modern electron accelerators and less than 106 for electron microscopes here we show that these corrections are ell times enhanced for vortex particles with high orbital angular momenta ellhbar which can already be as large as 103hbar we put forward the relativistic wave packets both for vortex bosons and fermions which transform correctly under the lorentz boosts are localized in a 3d space and represent a nonparaxial generalization of the laguerregaussian beams we demonstrate that it is sqrtell lambda_c gg lambda_c that defines a paraxial scale for such packets in contrast to those with a nonsingular phase say the airy beams with current technology the nonparaxial corrections can reach the relative values of 103 yield a proportional increase of an invariant mass of the electron packet describe a spinorbit coupling as well as the quantum coherence phenomena in particle and atomic collisions
|
[['one', 'of', 'the', 'reasons', 'for', 'the', 'tremendous', 'success', 'of', 'a', 'planewave', 'approximation', 'in', 'particle', 'physics', 'is', 'that', 'the', 'nonparaxial', 'corrections', 'to', 'such', 'observables', 'as', 'energy', 'magnetic', 'moment', 'scattering', 'cross', 'section', 'and', 'so', 'on', 'are', 'attenuated', 'as', 'lambda_c2sigma_perp2', 'll', '1', 'where', 'sigma_perp', 'is', 'a', 'beam', 'width', 'and', 'lambda_c', 'hbarmc', 'is', 'a', 'compton', 'wavelength', 'this', 'amounts', 'to', 'less', 'than', '1014', 'for', 'modern', 'electron', 'accelerators', 'and', 'less', 'than', '106', 'for', 'electron', 'microscopes', 'here', 'we', 'show', 'that', 'these', 'corrections', 'are', 'ell', 'times', 'enhanced', 'for', 'vortex', 'particles', 'with', 'high', 'orbital', 'angular', 'momenta', 'ellhbar', 'which', 'can', 'already', 'be', 'as', 'large', 'as', '103hbar', 'we', 'put', 'forward', 'the', 'relativistic', 'wave', 'packets', 'both', 'for', 'vortex', 'bosons', 'and', 'fermions', 'which', 'transform', 'correctly', 'under', 'the', 'lorentz', 'boosts', 'are', 'localized', 'in', 'a', '3d', 'space', 'and', 'represent', 'a', 'nonparaxial', 'generalization', 'of', 'the', 'laguerregaussian', 'beams', 'we', 'demonstrate', 'that', 'it', 'is', 'sqrtell', 'lambda_c', 'gg', 'lambda_c', 'that', 'defines', 'a', 'paraxial', 'scale', 'for', 'such', 'packets', 'in', 'contrast', 'to', 'those', 'with', 'a', 'nonsingular', 'phase', 'say', 'the', 'airy', 'beams', 'with', 'current', 'technology', 'the', 'nonparaxial', 'corrections', 'can', 'reach', 'the', 'relative', 'values', 'of', '103', 'yield', 'a', 'proportional', 'increase', 'of', 'an', 'invariant', 'mass', 'of', 'the', 'electron', 'packet', 'describe', 'a', 'spinorbit', 'coupling', 'as', 'well', 'as', 'the', 'quantum', 'coherence', 'phenomena', 'in', 'particle', 'and', 'atomic', 'collisions']]
|
[-0.11043041604383844, 0.2529103850786271, -0.062952753675905, 0.1231054916513391, -0.03301860824994855, -0.1260458523203998, -0.029675708343941794, 0.3645147702483526, -0.2192110338777154, -0.27160389367394483, 0.013432994826542373, -0.3143467635955268, -0.0364045429478713, 0.21624491871925464, 0.02636261819042827, 0.08074767089949923, 0.03201820940860364, 0.0023935201072400837, -0.06458281376984101, -0.17653157150073928, 0.27334189716838864, 0.07870940811845507, 0.2576834847027408, 0.08109468809093803, 0.11364534324904946, 0.021332422721822134, 0.05526852010089399, -0.020151756186858428, -0.10804058435380613, 0.04264150788652449, 0.21547969568277422, 0.03321921790934059, 0.21290463619940359, -0.42574965907962775, -0.17756132689309329, 0.06583443063766994, 0.20357967643582042, 0.14131643619954623, -0.031794106528097436, -0.2655890049511127, 0.04457392413683947, -0.1804094939590923, -0.15597603760715856, -0.076749179750943, 0.06693833033278135, 0.037735909714957876, -0.29949961572618755, 0.05536888277300882, 0.01780810093948993, 0.004293819587931023, -0.0009706217758170324, -0.09631340100427613, -0.007971425918656303, -0.0034898749351426586, 0.06283086900547821, 0.09363803311003063, 0.1508679795359734, -0.16323422317231664, -0.1042931953856918, 0.4557417511855762, -0.037932358399746076, -0.20925826679543127, 0.11735448053682307, -0.2041491018848063, -0.04226560189491653, 0.18912274092810238, 0.18553305972582806, 0.08756912763406881, -0.08224397488540956, 0.06323662400304167, -0.027917162577160072, 0.15533548097439748, 0.13462477787772203, 0.12165052679615404, 0.21061414052456168, 0.14446927616185504, 0.0522062194875287, 0.05197068760534233, -0.15082715593638768, -0.06052999855276553, -0.30855685834955404, -0.17520934640635835, -0.1791778434262185, 0.09193684713503003, -0.0576765881495927, -0.11503587662705675, 0.34793728824714243, 0.13350301139739965, 0.2162708642716454, 0.010882305255131655, 0.3201689971651854, 0.1568173652751156, 0.09160500097476956, 0.059594036999565725, 0.2752188726471054, 0.13841398529376103, 0.09988073755205426, -0.22321400535234423, -0.01669468170666047, 0.018653298990248736]
|
1,803.09151
|
Natural Gradients in Practice: Non-Conjugate Variational Inference in
Gaussian Process Models
|
The natural gradient method has been used effectively in conjugate Gaussian
process models, but the non-conjugate case has been largely unexplored. We
examine how natural gradients can be used in non-conjugate stochastic settings,
together with hyperparameter learning. We conclude that the natural gradient
can significantly improve performance in terms of wall-clock time. For
ill-conditioned posteriors the benefit of the natural gradient method is
especially pronounced, and we demonstrate a practical setting where ordinary
gradients are unusable. We show how natural gradients can be computed
efficiently and automatically in any parameterization, using automatic
differentiation. Our code is integrated into the GPflow package.
|
stat.ML cs.LG
|
the natural gradient method has been used effectively in conjugate gaussian process models but the nonconjugate case has been largely unexplored we examine how natural gradients can be used in nonconjugate stochastic settings together with hyperparameter learning we conclude that the natural gradient can significantly improve performance in terms of wallclock time for illconditioned posteriors the benefit of the natural gradient method is especially pronounced and we demonstrate a practical setting where ordinary gradients are unusable we show how natural gradients can be computed efficiently and automatically in any parameterization using automatic differentiation our code is integrated into the gpflow package
|
[['the', 'natural', 'gradient', 'method', 'has', 'been', 'used', 'effectively', 'in', 'conjugate', 'gaussian', 'process', 'models', 'but', 'the', 'nonconjugate', 'case', 'has', 'been', 'largely', 'unexplored', 'we', 'examine', 'how', 'natural', 'gradients', 'can', 'be', 'used', 'in', 'nonconjugate', 'stochastic', 'settings', 'together', 'with', 'hyperparameter', 'learning', 'we', 'conclude', 'that', 'the', 'natural', 'gradient', 'can', 'significantly', 'improve', 'performance', 'in', 'terms', 'of', 'wallclock', 'time', 'for', 'illconditioned', 'posteriors', 'the', 'benefit', 'of', 'the', 'natural', 'gradient', 'method', 'is', 'especially', 'pronounced', 'and', 'we', 'demonstrate', 'a', 'practical', 'setting', 'where', 'ordinary', 'gradients', 'are', 'unusable', 'we', 'show', 'how', 'natural', 'gradients', 'can', 'be', 'computed', 'efficiently', 'and', 'automatically', 'in', 'any', 'parameterization', 'using', 'automatic', 'differentiation', 'our', 'code', 'is', 'integrated', 'into', 'the', 'gpflow', 'package']]
|
[-0.011797396325515491, 0.06061768855226438, -0.11107184324358212, 0.12122431202941257, -0.12309646924339825, -0.13313564128417632, -0.020649217871377374, 0.4843506123686191, -0.3371047899311427, -0.30577819123126493, 0.10551482867818363, -0.19170008741300737, -0.19330095106938688, 0.23692458100838237, -0.13715034985158703, 0.08773729676325427, 0.10558060528987115, 0.0038171017099872676, -0.08773927306894692, -0.2859231289383946, 0.26461606558486084, 0.030657675080370195, 0.28078241296813333, 0.02121606543844584, 0.13041454410217335, -0.06471447563167698, -0.008644118148944165, 0.04464944724528359, -0.04879027318088672, 0.126544357604799, 0.2835851715188453, 0.19217077476239883, 0.3154009761159668, -0.42403543813356964, -0.26531848964502686, 0.16439323652867632, 0.23961735029427086, 0.13710695127080572, -0.08667693475473413, -0.23963858535522503, 0.08444785682650485, -0.1547757057786578, -0.03729096082261634, -0.18339588820224278, -0.05639753795440982, 0.010413474394100727, -0.3157820164013912, 0.07736015577551604, 0.05516564623812343, 0.062013278860543475, 0.012218044699621525, -0.15501541332664467, 0.007942950759903703, 0.11513048027743503, 0.01756210621223914, 0.0393639644411955, 0.15917189869255122, -0.08302916988896408, -0.08933290653737576, 0.36692148405542174, -0.12532159304799567, -0.27530978600688205, 0.19707641763944583, -0.0574868155717112, -0.16094011326071503, 0.08571219300427059, 0.23528250364015008, 0.15755851892293385, -0.14837335730271212, 0.13207097885793648, 0.008800379157361418, 0.14602477182080914, 0.03182732729278136, -0.05844264521291203, 0.12670681926440264, 0.13641118097331117, 0.06783569444634832, 0.15771024006345116, -0.06298088335828615, -0.09837035353452263, -0.21071390896150383, -0.16316818022561067, -0.13794932910932764, -0.044905496051184615, -0.1119304320283377, -0.12040882233972891, 0.375045322435032, 0.22923172714815723, 0.18500260541233982, 0.04965739876105644, 0.34146216657418427, 0.15991344415504338, 0.10810425295725022, 0.10645806462513191, 0.19981637106526015, 0.05592765714881001, 0.06535335117028934, -0.19088985712848383, 0.1339764922516107, 0.024576790036061908]
|
1,803.09152
|
Mobile Device Type Substitution
|
Mobile users today interact with a variety of mobile device types including
smartphones, tablets, smartwatches, and others. However research on mobile
device type substitution has been limited in several respects including a lack
of detailed and robust analyses. Therefore, in this work we study mobile device
type substitution through analysis of multidevice usage data from a large
US-based user panel. Specifically, we use regression analysis over paired user
groups to test five device type substitution hypotheses. We find that both
tablets and PCs are partial substitutes for smartphones with tablet and PC
ownership decreasing smartphone usage by about 12.5 and 13 hours/month
respectively. Additionally, we find that tablets and PCs also prompt about 20
and 57 hours/month respectively of additional (non-substituted) usage. We also
illustrate significant inter-user diversity in substituted and additional
usage. Overall, our results can help in understanding the relative positioning
of different mobile device types and in parameterizing higher level mobile
ecosystem models.
|
cs.HC
|
mobile users today interact with a variety of mobile device types including smartphones tablets smartwatches and others however research on mobile device type substitution has been limited in several respects including a lack of detailed and robust analyses therefore in this work we study mobile device type substitution through analysis of multidevice usage data from a large usbased user panel specifically we use regression analysis over paired user groups to test five device type substitution hypotheses we find that both tablets and pcs are partial substitutes for smartphones with tablet and pc ownership decreasing smartphone usage by about 125 and 13 hoursmonth respectively additionally we find that tablets and pcs also prompt about 20 and 57 hoursmonth respectively of additional nonsubstituted usage we also illustrate significant interuser diversity in substituted and additional usage overall our results can help in understanding the relative positioning of different mobile device types and in parameterizing higher level mobile ecosystem models
|
[['mobile', 'users', 'today', 'interact', 'with', 'a', 'variety', 'of', 'mobile', 'device', 'types', 'including', 'smartphones', 'tablets', 'smartwatches', 'and', 'others', 'however', 'research', 'on', 'mobile', 'device', 'type', 'substitution', 'has', 'been', 'limited', 'in', 'several', 'respects', 'including', 'a', 'lack', 'of', 'detailed', 'and', 'robust', 'analyses', 'therefore', 'in', 'this', 'work', 'we', 'study', 'mobile', 'device', 'type', 'substitution', 'through', 'analysis', 'of', 'multidevice', 'usage', 'data', 'from', 'a', 'large', 'usbased', 'user', 'panel', 'specifically', 'we', 'use', 'regression', 'analysis', 'over', 'paired', 'user', 'groups', 'to', 'test', 'five', 'device', 'type', 'substitution', 'hypotheses', 'we', 'find', 'that', 'both', 'tablets', 'and', 'pcs', 'are', 'partial', 'substitutes', 'for', 'smartphones', 'with', 'tablet', 'and', 'pc', 'ownership', 'decreasing', 'smartphone', 'usage', 'by', 'about', '125', 'and', '13', 'hoursmonth', 'respectively', 'additionally', 'we', 'find', 'that', 'tablets', 'and', 'pcs', 'also', 'prompt', 'about', '20', 'and', '57', 'hoursmonth', 'respectively', 'of', 'additional', 'nonsubstituted', 'usage', 'we', 'also', 'illustrate', 'significant', 'interuser', 'diversity', 'in', 'substituted', 'and', 'additional', 'usage', 'overall', 'our', 'results', 'can', 'help', 'in', 'understanding', 'the', 'relative', 'positioning', 'of', 'different', 'mobile', 'device', 'types', 'and', 'in', 'parameterizing', 'higher', 'level', 'mobile', 'ecosystem', 'models']]
|
[-0.12403414345213346, 0.022765701494554615, 0.002313565620063961, 0.02944477497185762, -0.12119331808349529, -0.22653107463333805, 0.12989523984770013, 0.4278529133986343, -0.23406785523651966, -0.38507663496080546, 0.09244463273683902, -0.36763026978663327, -0.1607286501312991, 0.22638203565548357, -0.12460536605454739, -0.007428827568550001, 0.06957826046756917, 0.01926977544049309, -0.04802659007285226, -0.26778255195157336, 0.25285746574299045, 0.032737644885170766, 0.3459310959903644, 0.06682441476590753, 0.01794380490296194, 0.02040563374841393, -0.060528503597847054, 0.006733158358384843, -0.06545998027758725, 0.15655179323428975, 0.2666835738719464, 0.1499660155923384, 0.29259092924064145, -0.4550211868768969, -0.18174398694544208, 0.03838746928815524, 0.16341515787965588, 0.05514302127994597, -0.11247315816052089, -0.295498298142444, 0.16843369463761035, -0.2719674437403582, -0.08070124560580044, -0.06430605242585206, 0.014849031800646093, 0.06892618838797457, -0.21044215514602793, 0.013900402952635709, -0.014873540042300463, 0.18495312491099217, -0.07162512187897409, -0.12884915023800228, -0.01912418265627431, 0.1577551460903525, 0.05844294619383653, -0.08424858043366981, 0.17764431033464897, -0.10894810974857976, -0.11244839921823473, 0.34757186024897285, 1.839437074475474e-05, -0.1371247567631026, 0.23072875090330452, -0.09197092118394083, -0.1311314109313701, 0.08082519379117853, 0.23532929202177344, 0.04525819121158452, -0.17706915739978143, 0.021314700493549735, 0.014447259036340303, 0.2161525538865501, 0.08254200453845809, 0.07089371444633255, 0.16370382255499627, 0.2092498159519844, 0.03886225555725577, 0.05391635889846638, -0.09952407482748415, -0.04749938631702408, -0.217658600166694, -0.20809786814240763, -0.1058270448347094, 0.0454471941701705, -0.11345150584043925, -0.10004809283342987, 0.3597109871190767, 0.1874016668683813, 0.12626782546194826, 0.014864294101444811, 0.3176055706964878, -0.010691638078159567, 0.13569995297070642, 0.057462897423848316, 0.12312149637539012, 0.014910781086277362, 0.1967416379030782, -0.13574474844204673, 0.07656155126743841, -0.06895842363864377]
|
1,803.09153
|
Fast variational Bayes for heavy-tailed PLDA applied to i-vectors and
x-vectors
|
The standard state-of-the-art backend for text-independent speaker
recognizers that use i-vectors or x-vectors, is Gaussian PLDA (G-PLDA),
assisted by a Gaussianization step involving length normalization. G-PLDA can
be trained with both generative or discriminative methods. It has long been
known that heavy-tailed PLDA (HT-PLDA), applied without length normalization,
gives similar accuracy, but at considerable extra computational cost. We have
recently introduced a fast scoring algorithm for a discriminatively trained
HT-PLDA backend. This paper extends that work by introducing a fast,
variational Bayes, generative training algorithm. We compare old and new
backends, with and without length-normalization, with i-vectors and x-vectors,
on SRE'10, SRE'16 and SITW.
|
stat.ML cs.LG
|
the standard stateoftheart backend for textindependent speaker recognizers that use ivectors or xvectors is gaussian plda gplda assisted by a gaussianization step involving length normalization gplda can be trained with both generative or discriminative methods it has long been known that heavytailed plda htplda applied without length normalization gives similar accuracy but at considerable extra computational cost we have recently introduced a fast scoring algorithm for a discriminatively trained htplda backend this paper extends that work by introducing a fast variational bayes generative training algorithm we compare old and new backends with and without lengthnormalization with ivectors and xvectors on sre10 sre16 and sitw
|
[['the', 'standard', 'stateoftheart', 'backend', 'for', 'textindependent', 'speaker', 'recognizers', 'that', 'use', 'ivectors', 'or', 'xvectors', 'is', 'gaussian', 'plda', 'gplda', 'assisted', 'by', 'a', 'gaussianization', 'step', 'involving', 'length', 'normalization', 'gplda', 'can', 'be', 'trained', 'with', 'both', 'generative', 'or', 'discriminative', 'methods', 'it', 'has', 'long', 'been', 'known', 'that', 'heavytailed', 'plda', 'htplda', 'applied', 'without', 'length', 'normalization', 'gives', 'similar', 'accuracy', 'but', 'at', 'considerable', 'extra', 'computational', 'cost', 'we', 'have', 'recently', 'introduced', 'a', 'fast', 'scoring', 'algorithm', 'for', 'a', 'discriminatively', 'trained', 'htplda', 'backend', 'this', 'paper', 'extends', 'that', 'work', 'by', 'introducing', 'a', 'fast', 'variational', 'bayes', 'generative', 'training', 'algorithm', 'we', 'compare', 'old', 'and', 'new', 'backends', 'with', 'and', 'without', 'lengthnormalization', 'with', 'ivectors', 'and', 'xvectors', 'on', 'sre10', 'sre16', 'and', 'sitw']]
|
[0.011643921229706117, 0.0053169753007365, -0.09547713226309479, 0.0783350994208395, -0.14869005216175052, -0.29429510849142315, 0.028468745695944462, 0.4764981001540266, -0.2331430350308015, -0.3218764021070768, 0.060533107728744394, -0.22924042275913925, -0.16700255999934266, 0.21923053312595142, -0.14049730486603398, 0.14083686741798024, 0.1536615386774594, 0.03783258664976768, -0.0810848162750563, -0.3147010970907756, 0.24120967227829188, 0.07723465939804987, 0.33328737926227275, -0.06121281507387381, 0.16982972530666926, 0.012786813193198406, -0.03126326854566507, -0.016415649902715226, -0.01330394880025062, 0.1465559357523241, 0.2607292372808613, 0.19522499305553584, 0.341514339200174, -0.3693297178851384, -0.24083223221165062, 0.08892715954565152, 0.14346293873633398, 0.11058209439494995, -0.036038287276769, -0.34266981712043887, 0.10263697425787797, -0.2145432790158072, 0.0423297325826504, -0.1727815845703725, -0.06096436120475633, -0.004536182196302848, -0.3159801647010626, 0.07366334526879581, 0.13158280152187804, 0.09321819854467506, 0.007036294788122177, -0.17260727396404202, 0.060464914623563265, 0.06889892250036049, 0.047950483451719685, 0.12038610618316917, 0.08255890962865317, -0.12315547191820135, -0.14326622129671954, 0.27796781844355994, -0.13342526794712276, -0.22888341405654722, 0.20223562509724588, 0.05627470973389919, -0.17325476555134914, 0.10211820296491637, 0.1986066074077642, 0.07026349295946685, -0.1816708082333207, 0.05606115506632686, -0.012586326883974099, 0.23293408631544674, 0.10224867159750012, -0.03497661459683017, 0.10740984852350495, 0.2570857094186876, -0.0051565918050744015, 0.1607048055991963, -0.1563528497736299, -0.031199805894772514, -0.18572263874941403, -0.09836716875386885, -0.20449778291330944, 0.008924266459853059, -0.08827848382461158, -0.13826047596662785, 0.3769476895192356, 0.17359219656579875, 0.18676212551824825, 0.2076239272143052, 0.3657795812563049, 0.06121870449207949, 0.1708440515165678, 0.14031209091119695, 0.15204814671905656, 0.01640155106651211, 0.11252413477955593, -0.11464202919307005, 0.13392284485709036, 0.07588079599945834]
|
1,803.09154
|
Unifying large scale and small scale geometry
|
A topology on a set $X$ is the same as a projection (i.e. an idempotent
linear operator) $cl:2^X\to 2^X$ satisfying $A\subset cl(A)$ for all $A\subset
X$. That's a good way to summarize Kuratowski's closure operator.
Basic geometry on a set $X$ is a dot product $\cdot:2^X\times 2^X\to 2^Y$.
Its equivalent form is an orthogonality relation on subsets of $X$. The optimal
case is if the orthogonality relation satisfies a variant of
parallel-perpendicular decomposition from linear algebra.
We show that this concept unifies small scale (topology, proximity spaces,
uniform spaces) and large scale (coarse spaces, large scale spaces). Using
orthogonality relations we define large scale compactifications that generalize
all well-known compactifications: Higson corona, Gromov boundary,
\v{C}ech-Stone compactification, Samuel-Smirnov compactification, and
Freudenthal compactification.
|
math.MG math.GN math.GT
|
a topology on a set x is the same as a projection ie an idempotent linear operator cl2xto 2x satisfying asubset cla for all asubset x thats a good way to summarize kuratowskis closure operator basic geometry on a set x is a dot product cdot2xtimes 2xto 2y its equivalent form is an orthogonality relation on subsets of x the optimal case is if the orthogonality relation satisfies a variant of parallelperpendicular decomposition from linear algebra we show that this concept unifies small scale topology proximity spaces uniform spaces and large scale coarse spaces large scale spaces using orthogonality relations we define large scale compactifications that generalize all wellknown compactifications higson corona gromov boundary vcechstone compactification samuelsmirnov compactification and freudenthal compactification
|
[['a', 'topology', 'on', 'a', 'set', 'x', 'is', 'the', 'same', 'as', 'a', 'projection', 'ie', 'an', 'idempotent', 'linear', 'operator', 'cl2xto', '2x', 'satisfying', 'asubset', 'cla', 'for', 'all', 'asubset', 'x', 'thats', 'a', 'good', 'way', 'to', 'summarize', 'kuratowskis', 'closure', 'operator', 'basic', 'geometry', 'on', 'a', 'set', 'x', 'is', 'a', 'dot', 'product', 'cdot2xtimes', '2xto', '2y', 'its', 'equivalent', 'form', 'is', 'an', 'orthogonality', 'relation', 'on', 'subsets', 'of', 'x', 'the', 'optimal', 'case', 'is', 'if', 'the', 'orthogonality', 'relation', 'satisfies', 'a', 'variant', 'of', 'parallelperpendicular', 'decomposition', 'from', 'linear', 'algebra', 'we', 'show', 'that', 'this', 'concept', 'unifies', 'small', 'scale', 'topology', 'proximity', 'spaces', 'uniform', 'spaces', 'and', 'large', 'scale', 'coarse', 'spaces', 'large', 'scale', 'spaces', 'using', 'orthogonality', 'relations', 'we', 'define', 'large', 'scale', 'compactifications', 'that', 'generalize', 'all', 'wellknown', 'compactifications', 'higson', 'corona', 'gromov', 'boundary', 'vcechstone', 'compactification', 'samuelsmirnov', 'compactification', 'and', 'freudenthal', 'compactification']]
|
[-0.1792521289525888, 0.10960513566900244, -0.06571135706164771, 0.17143354539333597, -0.1352413069918497, -0.10805981780569522, 0.018904383753975615, 0.34186034467127013, -0.3450723232653661, -0.15458417197482455, 0.13837322923872206, -0.2692410375477157, -0.12040506831855856, 0.17454540980263397, -0.18681537825514713, 0.008086534916984443, 0.046262514007349424, 0.023618439467162147, -0.15510601988539863, -0.22766701303597572, 0.4112594292208584, -0.03694890500802515, 0.30336414366904807, 0.006141731887657801, 0.16193249304261473, -0.02395926429452295, 0.04926182688651686, 0.05041336867377225, -0.15499548049721742, 0.10553388648594801, 0.2204764305999996, 0.1272021098715118, 0.22814200272481155, -0.3524917657367694, -0.13866538018820027, 0.14523055117067873, 0.11187892511654167, -0.06420302431573734, 0.02859483949509728, -0.25130288147080976, 0.10442668575252223, -0.15756262000053164, -0.11176819790504937, -0.09406115331897974, 0.08991373844572112, -0.025300659406452607, -0.28801441479187745, -0.04456942897035271, 0.08065531156165127, 0.0840857496075173, -0.05898334792094767, -0.05838723641493891, -0.03847753137557043, 0.04797948586046059, -0.04045726488638892, 0.12390204511869413, 0.11636563591085948, -0.0020994858298367127, -0.07380852438350263, 0.3562449020707709, -0.03290995470303883, -0.24964902805299777, 0.13461359183932853, -0.1854749742266523, -0.16443452684598792, 0.0760431119467681, 0.07836536374579892, 0.1315645847756129, -0.037915232786351546, 0.27073034940936214, -0.19045365501780254, 0.151235764225324, 0.10133839608767094, 0.06843533565919115, 0.11447533832029161, 0.15669811213126358, 0.1724213414156857, 0.10962897262130028, 0.022890888878868684, -0.03664894112879331, -0.3967714063677953, -0.14120463997077864, -0.14482256435813048, 0.17729591124523908, -0.1706674650899019, -0.2098836987040555, 0.3072528246149389, 0.0632293040657209, 0.23969409006655726, 0.09855980344818663, 0.20514570509927332, 0.06062319016399491, 0.06376096898387386, 0.0846345647632216, 0.07557647094592197, 0.20733011740809068, -0.00024330470726912856, -0.1357133631518859, -0.03380708920502733, 0.26181739756566846]
|
1,803.09155
|
The diagonalization method and Brocard's problem
|
In this paper we introduce and develop the method of diagonalization of
functions $f:\mathbb{N}\longrightarrow \mathbb{R}$. We apply this method to
show that the equations of the form $\Gamma_r(n)+k=m^2$ has a finite number of
solutions $n\in \mathbb{N}$ with $n>r$ for any fixed $k,r\in \mathbb{N}$, where
$\Gamma_r(n)=n(n-1)\cdots (n-r)$ denotes the $r^{th}$ truncated Gamma function.
|
math.GM
|
in this paper we introduce and develop the method of diagonalization of functions fmathbbnlongrightarrow mathbbr we apply this method to show that the equations of the form gamma_rnkm2 has a finite number of solutions nin mathbbn with nr for any fixed krin mathbbn where gamma_rnnn1cdots nr denotes the rth truncated gamma function
|
[['in', 'this', 'paper', 'we', 'introduce', 'and', 'develop', 'the', 'method', 'of', 'diagonalization', 'of', 'functions', 'fmathbbnlongrightarrow', 'mathbbr', 'we', 'apply', 'this', 'method', 'to', 'show', 'that', 'the', 'equations', 'of', 'the', 'form', 'gamma_rnkm2', 'has', 'a', 'finite', 'number', 'of', 'solutions', 'nin', 'mathbbn', 'with', 'nr', 'for', 'any', 'fixed', 'krin', 'mathbbn', 'where', 'gamma_rnnn1cdots', 'nr', 'denotes', 'the', 'rth', 'truncated', 'gamma', 'function']]
|
[-0.1591862925157255, 0.07646245693749919, -0.05507787672460687, -0.03698034254282865, -0.014316551392061673, -0.09925128628822918, 0.008685605412786256, 0.30682620600968297, -0.24726933647631383, -0.18542430490939593, 0.030475967532803058, -0.3267384796612421, -0.20164929040498575, 0.1435544592499429, -0.018319948500364412, 0.05762998463243854, 0.028853317641900206, 0.07932809132094286, -0.13568865383823156, -0.21760838157117215, 0.3605007364281586, -0.10210733484400779, 0.20501568858340688, 0.01228956726132607, 0.13557824317593964, 0.025286964387918005, 0.018405223401900078, 0.006234238874547335, -0.24348625204866226, 0.07630153984895774, 0.24820963696253542, 0.1479212174154058, 0.3505209265846987, -0.39901084513688573, -0.17372481728314745, 0.21813940982885507, 0.18213492392429284, 0.007651123460572289, -0.050739203807802835, -0.1869617605923998, 0.19389820910458053, -0.22705749969701378, -0.1546264377527167, -0.07871279622219046, 0.06802683453816845, 0.09351188482298535, -0.35939808408444635, 0.027575874007402027, 0.07321725342878882, 0.012511285747269557, -0.02641802640365703, -0.13711548322925762, 0.0523181312185313, 0.09016756418788312, 0.0029958537589682608, 0.09671423221197055, -0.00301742966153792, -0.0245471440388688, -0.0747677373215176, 0.3843648363551011, -0.09800240803956606, -0.2927938934643658, 0.05000387247157644, -0.2308798857004743, -0.17112262193493696, 0.0467874868677891, 0.1496258496154784, 0.21701641730508026, -0.033737073852015395, 0.2380296434168894, -0.08577219772209622, 0.1431275944092444, 0.05625265372955069, -0.025442095444898824, 0.06615561320997622, 0.11707159865419475, 0.08769031531861698, 0.17126824265840102, -0.06279510388873061, 0.033873455185557205, -0.36545386940849073, -0.16765013559512337, -0.22060725583257723, 0.1108037355374925, -0.116655554793174, -0.24045256015901662, 0.3653795425827634, 0.17732859452312089, 0.17320095115740383, 0.168521124722284, 0.24257890636823615, 0.1977775115519762, 0.027293163142642195, 0.08023789265592184, 0.04351103598518031, 0.1195779096344676, -0.003610736253310223, -0.2063325168279817, -0.015996800944665258, 0.1485467625173683]
|
1,803.09156
|
An Overview of Vulnerabilities of Voice Controlled Systems
|
Over the last few years, a rapidly increasing number of Internet-of-Things
(IoT) systems that adopt voice as the primary user input have emerged. These
systems have been shown to be vulnerable to various types of voice spoofing
attacks. However, how exactly these techniques differ or relate to each other
has not been extensively studied. In this paper, we provide a survey of recent
attack and defense techniques for voice controlled systems and propose a
classification of these techniques. We also discuss the need for a universal
defense strategy that protects a system from various types of attacks.
|
cs.CR cs.AI
|
over the last few years a rapidly increasing number of internetofthings iot systems that adopt voice as the primary user input have emerged these systems have been shown to be vulnerable to various types of voice spoofing attacks however how exactly these techniques differ or relate to each other has not been extensively studied in this paper we provide a survey of recent attack and defense techniques for voice controlled systems and propose a classification of these techniques we also discuss the need for a universal defense strategy that protects a system from various types of attacks
|
[['over', 'the', 'last', 'few', 'years', 'a', 'rapidly', 'increasing', 'number', 'of', 'internetofthings', 'iot', 'systems', 'that', 'adopt', 'voice', 'as', 'the', 'primary', 'user', 'input', 'have', 'emerged', 'these', 'systems', 'have', 'been', 'shown', 'to', 'be', 'vulnerable', 'to', 'various', 'types', 'of', 'voice', 'spoofing', 'attacks', 'however', 'how', 'exactly', 'these', 'techniques', 'differ', 'or', 'relate', 'to', 'each', 'other', 'has', 'not', 'been', 'extensively', 'studied', 'in', 'this', 'paper', 'we', 'provide', 'a', 'survey', 'of', 'recent', 'attack', 'and', 'defense', 'techniques', 'for', 'voice', 'controlled', 'systems', 'and', 'propose', 'a', 'classification', 'of', 'these', 'techniques', 'we', 'also', 'discuss', 'the', 'need', 'for', 'a', 'universal', 'defense', 'strategy', 'that', 'protects', 'a', 'system', 'from', 'various', 'types', 'of', 'attacks']]
|
[-0.14971985398988558, 0.026221854064959225, -0.05955099207877191, 0.044334947154377156, -0.07031506861646458, -0.2391782064883749, 0.04464248834854741, 0.37660835818723615, -0.2564353549987385, -0.3139501371872179, 0.14413098369115368, -0.28378201388398705, -0.2255655829194626, 0.26643229121601536, -0.14155793181361304, 0.11075712867157976, 0.0027823358025286615, 0.04704535754608889, -0.040535335923477855, -0.31759879375164657, 0.3460675918487544, -0.012952133571517836, 0.3218967717659381, 0.051370583383424075, 0.0611624887942807, -0.017047999957192344, -0.033843380197421793, 0.002341462059196123, -0.08551643775447786, 0.0992198563804946, 0.32951923853420106, 0.23100346229375177, 0.34260749033431415, -0.44954919492461015, -0.2801386338188169, 0.13967295262252086, 0.19479312808204866, 0.17866639752593852, -0.0890956730316285, -0.3023660691147766, 0.17746691532389827, -0.31454264268893556, -0.057872531570724604, -0.10430762164184305, 0.04187820966657942, 0.06778194501962435, -0.18764555038999498, -0.07095016540326994, 0.04338564772696532, 0.10745062108257229, -0.018280045237372984, -0.09686511294969079, 0.024459361043499456, 0.20590617493534288, 0.10154933568339833, -0.017509226624844308, 0.1593424771653162, -0.12262721922123786, -0.17125284588252454, 0.33287221237479414, 0.02572233667933219, -0.14303068099447439, 0.24338958999406085, 0.013565451550038205, -0.18846847427548052, 0.09517816407245959, 0.24863845722260164, 0.10774829982751116, -0.18376249080696672, -0.0007693758822459075, -0.01732994004911215, 0.18101966107436984, 0.07414099019616074, 0.07816434584164358, 0.20426278367408157, 0.16878248920145722, 0.0920020028295898, 0.10587858658262346, -0.08880564388963058, -0.04042046478728658, -0.15517348677073559, -0.10701159361903508, -0.11734179017066802, 0.027583719344153164, 0.038052408159386424, -0.1256246045192814, 0.39661522770358115, 0.23334406862592266, 0.18287920301117616, 0.02484295379188027, 0.3722374912005724, 0.04898824235400396, 0.12266828617820344, 0.04927554018987516, 0.24325912771146438, 0.03340389860851556, 0.16446752614250465, -0.11254026590409621, 0.1152263893565816, -0.00586984418668621]
|
1,803.09157
|
Entanglement in Reggeized Scattering using AdS/CFT
|
The eikonalized parton-parton scattering amplitude at large $\sqrt{s}$ and
large impact parameter, is dominated by the exchange of a hyperbolic surface in
walled AdS. Its analytical continuation yields a worldsheet instanton that is
at the origin of the Reggeization of the amplitude and a thermal-like quantum
entropy ${\cal S}_T$. We explicitly construct the entangled density matrix
following from the exchanged surface, and show that its von-Neumann
entanglement entropy ${\cal S}_E$ coincides with the thermal-like entropy, i.e.
${\cal S}_T={\cal S}_E$. The ratio of the entanglement entropy to the
transverse growth of the exchanged surface is similar to the Bekenstein entropy
ratio for a black-hole, with a natural definition of saturation and the on-set
of chaos in high energy collisions. The largest eigenvalues of the entangled
density matrix obey a cascade equation in rapidity, reminiscent of non-linear
QCD evolution of wee-dipoles at low-x and weak coupling. We suggest that the
largest eigenvalues describe the probability distributions of wee-quanta at
low-x and strong coupling that maybe measurable at present and future pp and ep
colliders.
|
hep-ph hep-th nucl-th
|
the eikonalized partonparton scattering amplitude at large sqrts and large impact parameter is dominated by the exchange of a hyperbolic surface in walled ads its analytical continuation yields a worldsheet instanton that is at the origin of the reggeization of the amplitude and a thermallike quantum entropy cal s_t we explicitly construct the entangled density matrix following from the exchanged surface and show that its vonneumann entanglement entropy cal s_e coincides with the thermallike entropy ie cal s_tcal s_e the ratio of the entanglement entropy to the transverse growth of the exchanged surface is similar to the bekenstein entropy ratio for a blackhole with a natural definition of saturation and the onset of chaos in high energy collisions the largest eigenvalues of the entangled density matrix obey a cascade equation in rapidity reminiscent of nonlinear qcd evolution of weedipoles at lowx and weak coupling we suggest that the largest eigenvalues describe the probability distributions of weequanta at lowx and strong coupling that maybe measurable at present and future pp and ep colliders
|
[['the', 'eikonalized', 'partonparton', 'scattering', 'amplitude', 'at', 'large', 'sqrts', 'and', 'large', 'impact', 'parameter', 'is', 'dominated', 'by', 'the', 'exchange', 'of', 'a', 'hyperbolic', 'surface', 'in', 'walled', 'ads', 'its', 'analytical', 'continuation', 'yields', 'a', 'worldsheet', 'instanton', 'that', 'is', 'at', 'the', 'origin', 'of', 'the', 'reggeization', 'of', 'the', 'amplitude', 'and', 'a', 'thermallike', 'quantum', 'entropy', 'cal', 's_t', 'we', 'explicitly', 'construct', 'the', 'entangled', 'density', 'matrix', 'following', 'from', 'the', 'exchanged', 'surface', 'and', 'show', 'that', 'its', 'vonneumann', 'entanglement', 'entropy', 'cal', 's_e', 'coincides', 'with', 'the', 'thermallike', 'entropy', 'ie', 'cal', 's_tcal', 's_e', 'the', 'ratio', 'of', 'the', 'entanglement', 'entropy', 'to', 'the', 'transverse', 'growth', 'of', 'the', 'exchanged', 'surface', 'is', 'similar', 'to', 'the', 'bekenstein', 'entropy', 'ratio', 'for', 'a', 'blackhole', 'with', 'a', 'natural', 'definition', 'of', 'saturation', 'and', 'the', 'onset', 'of', 'chaos', 'in', 'high', 'energy', 'collisions', 'the', 'largest', 'eigenvalues', 'of', 'the', 'entangled', 'density', 'matrix', 'obey', 'a', 'cascade', 'equation', 'in', 'rapidity', 'reminiscent', 'of', 'nonlinear', 'qcd', 'evolution', 'of', 'weedipoles', 'at', 'lowx', 'and', 'weak', 'coupling', 'we', 'suggest', 'that', 'the', 'largest', 'eigenvalues', 'describe', 'the', 'probability', 'distributions', 'of', 'weequanta', 'at', 'lowx', 'and', 'strong', 'coupling', 'that', 'maybe', 'measurable', 'at', 'present', 'and', 'future', 'pp', 'and', 'ep', 'colliders']]
|
[-0.15820025661515938, 0.21669064919580017, -0.13302643283286833, 0.10466090527558754, 0.004764342344415611, -0.09884979818346938, -0.011149423818252761, 0.2689201936536309, -0.2367673685013719, -0.20646279335253426, 0.021775531723748166, -0.3624938415120956, -0.06015269683685, 0.11686212007375159, 0.01908258985543414, 0.09512976221013511, 0.04787057351883082, 0.06993910904213257, -0.0691438927866254, -0.1651790781021008, 0.34220175650080986, 0.07587902702752104, 0.28334709398927904, 0.1435236156471735, 0.12628875554610902, 0.034693349179668494, 0.01170826647926629, 0.007389623988640202, -0.16204904782042986, 0.09216149026040986, 0.23634720700324552, 0.06872031539568357, 0.17355606364091092, -0.3607902040363416, -0.14775606286684437, 0.10761817001059827, 0.11258625079872164, 0.08142970817593428, 0.0010943293601437059, -0.2305944958569471, 0.07426042526825359, -0.21462403139452169, -0.16615469592414003, -0.03415452435711873, 0.06565436287149345, -0.02775623559911829, -0.26418366416814854, 0.16507656911123522, 0.018050902475225436, 0.019389705462436353, 0.0030628133099526167, -0.09241679753934601, -0.11742075682292588, 0.030155567452311516, 0.06998285526525472, 0.04175336674384817, 0.1512087298413882, -0.16002231842759698, -0.08656431605402909, 0.3079727830161401, -0.07342225619586262, -0.1389467307206618, 0.15738846533573592, -0.23347848965428197, -0.10488660712092673, 0.16227398868154227, 0.17228501741829488, 0.10228764166857099, -0.09942361858491539, 0.148474322609912, 0.012607514604749764, 0.16900010744230987, 0.10084207562630522, 0.09316171332711586, 0.20171496626155, 0.11770757401538406, 0.0338579541659148, 0.1513152394151679, -0.05380385515373751, -0.12165715880196035, -0.40141421940574457, -0.1489149257788688, -0.21236274453133522, 0.10954825999904093, -0.15370224373478486, -0.15290719186942253, 0.35155435045630007, 0.08699710451799428, 0.2576474265454436, 0.052844573041016356, 0.240577180807881, 0.17524007134609332, 0.04215043076154219, 0.11100451122093175, 0.2616068561425014, 0.17116299602092855, 0.12191135919041182, -0.3279116059827051, 0.03186732830380547, 0.09424970372023403]
|
1,803.09158
|
Gaussian one-way thermal quantum cryptography with finite-size effects
|
We study the impact of finite-size effects on the security of thermal one-way
quantum cryptography. Our approach considers coherent/squeezed states at the
preparation stage, on the top of which the sender adds trusted thermal noise.
We compute the key rate incorporating finite-size effects, and we obtain the
security threshold at different frequencies. As expected finite-size effects
deteriorate the performance of thermal quantum cryptography. Our analysis is
useful to quantify the impact of this degradation on relevant parameters like
tolerable attenuation, transmission frequencies at which one can achieve
security.
|
quant-ph
|
we study the impact of finitesize effects on the security of thermal oneway quantum cryptography our approach considers coherentsqueezed states at the preparation stage on the top of which the sender adds trusted thermal noise we compute the key rate incorporating finitesize effects and we obtain the security threshold at different frequencies as expected finitesize effects deteriorate the performance of thermal quantum cryptography our analysis is useful to quantify the impact of this degradation on relevant parameters like tolerable attenuation transmission frequencies at which one can achieve security
|
[['we', 'study', 'the', 'impact', 'of', 'finitesize', 'effects', 'on', 'the', 'security', 'of', 'thermal', 'oneway', 'quantum', 'cryptography', 'our', 'approach', 'considers', 'coherentsqueezed', 'states', 'at', 'the', 'preparation', 'stage', 'on', 'the', 'top', 'of', 'which', 'the', 'sender', 'adds', 'trusted', 'thermal', 'noise', 'we', 'compute', 'the', 'key', 'rate', 'incorporating', 'finitesize', 'effects', 'and', 'we', 'obtain', 'the', 'security', 'threshold', 'at', 'different', 'frequencies', 'as', 'expected', 'finitesize', 'effects', 'deteriorate', 'the', 'performance', 'of', 'thermal', 'quantum', 'cryptography', 'our', 'analysis', 'is', 'useful', 'to', 'quantify', 'the', 'impact', 'of', 'this', 'degradation', 'on', 'relevant', 'parameters', 'like', 'tolerable', 'attenuation', 'transmission', 'frequencies', 'at', 'which', 'one', 'can', 'achieve', 'security']]
|
[-0.15464755637962793, 0.094444475422444, -0.09913801098644565, 0.060516829528337854, -0.006856915964321656, -0.194665023972365, 0.10160377652871168, 0.3014599039981311, -0.25470040751282463, -0.2823284529996189, 0.08629563520662487, -0.2854530714367601, -0.11192847223190422, 0.23100171591663224, -0.0968357762427662, 0.1236465239728039, 0.023599953829861162, 0.01632097651335326, -0.031026670793918045, -0.25770666101280687, 0.332715928861448, 0.12384438629801893, 0.36849294414489786, 0.13526728201064875, 0.02609857432120903, 0.03321973305851729, -0.023767532330980015, -0.059435106983239, -0.15220377162437548, 0.05913250045837644, 0.24107419231652535, 0.06034584936622361, 0.28987423183438793, -0.39926450968381355, -0.23028136475741948, 0.08585162648126822, 0.09358801237646151, 0.17098707863690585, -0.019271499751167456, -0.27013876774898643, 0.05963491948998787, -0.19373032041105695, -0.09460538692391393, -0.061210591896352445, -0.07080102075864984, -0.03690912121832794, -0.23834735028107057, 0.07579473718281159, 0.03460710675558816, 0.057715787308883264, 0.05736719921696931, -0.1212904653035697, 6.361164956946264e-05, 0.20850970458493315, -0.0037021650959187273, -0.07711210701646368, 0.24278633563715796, -0.12253125989545052, -0.12313425464724953, 0.3637651857411997, -0.037189686512151224, -0.1644536707634953, 0.14953770544591613, -0.10154431027529592, -0.13261762221174483, 0.10379724146332592, 0.25588005798106844, 0.04234115196529522, -0.09484846743924374, -0.0015220375429304443, 0.07198707613861188, 0.2258828048811252, 0.0712201129539277, 0.17986568158746444, 0.18348011319705454, 0.1598635908766565, 0.02386093410578641, 0.2088034412908283, -0.1352825865429953, -0.11507157718932087, -0.3057746897578578, -0.10641027004087598, -0.1836881040150977, 0.07725051114473237, -0.10847182269720758, -0.13865270536519925, 0.39384789316152985, 0.23758086361075667, 0.09729388917118988, 0.050037463748594746, 0.4017932972108776, 0.11990914577538868, 0.0468983384039761, 0.09550435138887471, 0.2941897480050102, 0.06915488067633388, 0.09116415471494706, -0.30249374228614295, 0.15785538731672039, -0.011047249313295733]
|
1,803.09159
|
Efficient Discovery of Heterogeneous Quantile Treatment Effects in
Randomized Experiments via Anomalous Pattern Detection
|
In the recent literature on estimating heterogeneous treatment effects, each
proposed method makes its own set of restrictive assumptions about the
intervention's effects and which subpopulations to explicitly estimate.
Moreover, the majority of the literature provides no mechanism to identify
which subpopulations are the most affected--beyond manual inspection--and
provides little guarantee on the correctness of the identified subpopulations.
Therefore, we propose Treatment Effect Subset Scan (TESS), a new method for
discovering which subpopulation in a randomized experiment is most
significantly affected by a treatment. We frame this challenge as a pattern
detection problem where we efficiently maximize a nonparametric scan statistic
(a measure of the conditional quantile treatment effect) over subpopulations.
Furthermore, we identify the subpopulation which experiences the largest
distributional change as a result of the intervention, while making minimal
assumptions about the intervention's effects or the underlying data generating
process. In addition to the algorithm, we demonstrate that under the sharp null
hypothesis of no treatment effect, the asymptotic Type I and II error can be
controlled, and provide sufficient conditions for detection consistency--i.e.,
exact identification of the affected subpopulation. Finally, we validate the
efficacy of the method by discovering heterogeneous treatment effects in
simulations and in real-world data from a well-known program evaluation study.
|
stat.ME econ.EM stat.ML
|
in the recent literature on estimating heterogeneous treatment effects each proposed method makes its own set of restrictive assumptions about the interventions effects and which subpopulations to explicitly estimate moreover the majority of the literature provides no mechanism to identify which subpopulations are the most affectedbeyond manual inspectionand provides little guarantee on the correctness of the identified subpopulations therefore we propose treatment effect subset scan tess a new method for discovering which subpopulation in a randomized experiment is most significantly affected by a treatment we frame this challenge as a pattern detection problem where we efficiently maximize a nonparametric scan statistic a measure of the conditional quantile treatment effect over subpopulations furthermore we identify the subpopulation which experiences the largest distributional change as a result of the intervention while making minimal assumptions about the interventions effects or the underlying data generating process in addition to the algorithm we demonstrate that under the sharp null hypothesis of no treatment effect the asymptotic type i and ii error can be controlled and provide sufficient conditions for detection consistencyie exact identification of the affected subpopulation finally we validate the efficacy of the method by discovering heterogeneous treatment effects in simulations and in realworld data from a wellknown program evaluation study
|
[['in', 'the', 'recent', 'literature', 'on', 'estimating', 'heterogeneous', 'treatment', 'effects', 'each', 'proposed', 'method', 'makes', 'its', 'own', 'set', 'of', 'restrictive', 'assumptions', 'about', 'the', 'interventions', 'effects', 'and', 'which', 'subpopulations', 'to', 'explicitly', 'estimate', 'moreover', 'the', 'majority', 'of', 'the', 'literature', 'provides', 'no', 'mechanism', 'to', 'identify', 'which', 'subpopulations', 'are', 'the', 'most', 'affectedbeyond', 'manual', 'inspectionand', 'provides', 'little', 'guarantee', 'on', 'the', 'correctness', 'of', 'the', 'identified', 'subpopulations', 'therefore', 'we', 'propose', 'treatment', 'effect', 'subset', 'scan', 'tess', 'a', 'new', 'method', 'for', 'discovering', 'which', 'subpopulation', 'in', 'a', 'randomized', 'experiment', 'is', 'most', 'significantly', 'affected', 'by', 'a', 'treatment', 'we', 'frame', 'this', 'challenge', 'as', 'a', 'pattern', 'detection', 'problem', 'where', 'we', 'efficiently', 'maximize', 'a', 'nonparametric', 'scan', 'statistic', 'a', 'measure', 'of', 'the', 'conditional', 'quantile', 'treatment', 'effect', 'over', 'subpopulations', 'furthermore', 'we', 'identify', 'the', 'subpopulation', 'which', 'experiences', 'the', 'largest', 'distributional', 'change', 'as', 'a', 'result', 'of', 'the', 'intervention', 'while', 'making', 'minimal', 'assumptions', 'about', 'the', 'interventions', 'effects', 'or', 'the', 'underlying', 'data', 'generating', 'process', 'in', 'addition', 'to', 'the', 'algorithm', 'we', 'demonstrate', 'that', 'under', 'the', 'sharp', 'null', 'hypothesis', 'of', 'no', 'treatment', 'effect', 'the', 'asymptotic', 'type', 'i', 'and', 'ii', 'error', 'can', 'be', 'controlled', 'and', 'provide', 'sufficient', 'conditions', 'for', 'detection', 'consistencyie', 'exact', 'identification', 'of', 'the', 'affected', 'subpopulation', 'finally', 'we', 'validate', 'the', 'efficacy', 'of', 'the', 'method', 'by', 'discovering', 'heterogeneous', 'treatment', 'effects', 'in', 'simulations', 'and', 'in', 'realworld', 'data', 'from', 'a', 'wellknown', 'program', 'evaluation', 'study']]
|
[-0.07636062276558768, 0.024740019381758484, -0.1008531899273044, 0.09886374018831738, -0.11519892972765043, -0.1316137761722191, 0.1424202394772175, 0.369094515066393, -0.20555913545688906, -0.3452824037932955, 0.11027227216069221, -0.2450063215230829, -0.17160762196398732, 0.17658262599862234, -0.09213064985427384, 0.01622393075669214, 0.09336405118708224, 0.009913214928768439, -0.028646003020078165, -0.24904148738977372, 0.29922718340165766, 0.062239243901179485, 0.3151160171632107, 0.020868188284700464, 0.08262804771348943, 0.021802389036119897, -0.08338111138551076, 0.03641544432606429, -0.11534426304045636, 0.0800564238600725, 0.2405095290821776, 0.19823238831104747, 0.3525201305655726, -0.39607466475047426, -0.22135205896498233, 0.14668967817252612, 0.11652003599367305, 0.13282040886320723, -0.06336227151925913, -0.2871359623009887, 0.08207797512238589, -0.14604134459895088, -0.11571801256750226, -0.06182785915192582, -0.011133512849554274, -0.02087816114533994, -0.32813370513601925, 0.09487793814988953, 0.05150566549113422, 0.07272823952485387, -0.07615246175726711, -0.11785161048493475, 0.006492181627454199, 0.11752750776769758, 0.07305269608460709, -0.02551940505052734, 0.15399463865426644, -0.13560546920209662, -0.10089502911860644, 0.34795871059702455, -0.025955431463765253, -0.21548135695390075, 0.17567890925520083, -0.13217060936057903, -0.15019386486999473, 0.0904835533811802, 0.21023585502167835, 0.14582845797378788, -0.20447748228588014, 0.0021343741728011155, -0.019833463813662165, 0.15379543292653455, 0.02611308504014696, 0.03105996077190902, 0.1599548625367164, 0.19766982130971097, 0.0633573550274413, 0.12572880151314095, -0.11766403949906246, -0.06890125542322137, -0.31726136670034727, -0.12334306647615306, -0.1274660476072527, -0.011158450648152069, -0.09169787208648973, -0.1664841361914524, 0.3973209635336317, 0.22147825796313483, 0.16480575587974824, 0.0619441345973196, 0.29826505984380547, 0.062471639608417055, 0.0633245180640598, 0.05560692677196736, 0.19535952152949118, 0.05600555564074859, 0.01325321709794248, -0.24900096899906274, 0.19042599461938473, 0.007858897059443681]
|
1,803.0916
|
Handling Adversarial Concept Drift in Streaming Data
|
Classifiers operating in a dynamic, real world environment, are vulnerable to
adversarial activity, which causes the data distribution to change over time.
These changes are traditionally referred to as concept drift, and several
approaches have been developed in literature to deal with the problem of drift
handling and detection. However, most concept drift handling techniques,
approach it as a domain independent task, to make them applicable to a wide
gamut of reactive systems. These techniques were developed from an adversarial
agnostic perspective, where they are naive and assume that drift is a benign
change, which can be fixed by updating the model. However, this is not the case
when an active adversary is trying to evade the deployed classification system.
In such an environment, the properties of concept drift are unique, as the
drift is intended to degrade the system and at the same time designed to avoid
detection by traditional concept drift detection techniques. This special
category of drift is termed as adversarial drift, and this paper analyzes its
characteristics and impact, in a streaming environment. A novel framework for
dealing with adversarial concept drift is proposed, called the Predict-Detect
streaming framework. Experimental evaluation of the framework, on generated
adversarial drifting data streams, demonstrates that this framework is able to
provide reliable unsupervised indication of drift, and is able to recover from
drifts swiftly. While traditional partially labeled concept drift detection
methodologies fail to detect adversarial drifts, the proposed framework is able
to detect such drifts and operates with <6% labeled data, on average. Also, the
framework provides benefits for active learning over imbalanced data streams,
by innately providing for feature space honeypots, where minority class
adversarial samples may be captured.
|
cs.LG cs.CR stat.ML
|
classifiers operating in a dynamic real world environment are vulnerable to adversarial activity which causes the data distribution to change over time these changes are traditionally referred to as concept drift and several approaches have been developed in literature to deal with the problem of drift handling and detection however most concept drift handling techniques approach it as a domain independent task to make them applicable to a wide gamut of reactive systems these techniques were developed from an adversarial agnostic perspective where they are naive and assume that drift is a benign change which can be fixed by updating the model however this is not the case when an active adversary is trying to evade the deployed classification system in such an environment the properties of concept drift are unique as the drift is intended to degrade the system and at the same time designed to avoid detection by traditional concept drift detection techniques this special category of drift is termed as adversarial drift and this paper analyzes its characteristics and impact in a streaming environment a novel framework for dealing with adversarial concept drift is proposed called the predictdetect streaming framework experimental evaluation of the framework on generated adversarial drifting data streams demonstrates that this framework is able to provide reliable unsupervised indication of drift and is able to recover from drifts swiftly while traditional partially labeled concept drift detection methodologies fail to detect adversarial drifts the proposed framework is able to detect such drifts and operates with 6 labeled data on average also the framework provides benefits for active learning over imbalanced data streams by innately providing for feature space honeypots where minority class adversarial samples may be captured
|
[['classifiers', 'operating', 'in', 'a', 'dynamic', 'real', 'world', 'environment', 'are', 'vulnerable', 'to', 'adversarial', 'activity', 'which', 'causes', 'the', 'data', 'distribution', 'to', 'change', 'over', 'time', 'these', 'changes', 'are', 'traditionally', 'referred', 'to', 'as', 'concept', 'drift', 'and', 'several', 'approaches', 'have', 'been', 'developed', 'in', 'literature', 'to', 'deal', 'with', 'the', 'problem', 'of', 'drift', 'handling', 'and', 'detection', 'however', 'most', 'concept', 'drift', 'handling', 'techniques', 'approach', 'it', 'as', 'a', 'domain', 'independent', 'task', 'to', 'make', 'them', 'applicable', 'to', 'a', 'wide', 'gamut', 'of', 'reactive', 'systems', 'these', 'techniques', 'were', 'developed', 'from', 'an', 'adversarial', 'agnostic', 'perspective', 'where', 'they', 'are', 'naive', 'and', 'assume', 'that', 'drift', 'is', 'a', 'benign', 'change', 'which', 'can', 'be', 'fixed', 'by', 'updating', 'the', 'model', 'however', 'this', 'is', 'not', 'the', 'case', 'when', 'an', 'active', 'adversary', 'is', 'trying', 'to', 'evade', 'the', 'deployed', 'classification', 'system', 'in', 'such', 'an', 'environment', 'the', 'properties', 'of', 'concept', 'drift', 'are', 'unique', 'as', 'the', 'drift', 'is', 'intended', 'to', 'degrade', 'the', 'system', 'and', 'at', 'the', 'same', 'time', 'designed', 'to', 'avoid', 'detection', 'by', 'traditional', 'concept', 'drift', 'detection', 'techniques', 'this', 'special', 'category', 'of', 'drift', 'is', 'termed', 'as', 'adversarial', 'drift', 'and', 'this', 'paper', 'analyzes', 'its', 'characteristics', 'and', 'impact', 'in', 'a', 'streaming', 'environment', 'a', 'novel', 'framework', 'for', 'dealing', 'with', 'adversarial', 'concept', 'drift', 'is', 'proposed', 'called', 'the', 'predictdetect', 'streaming', 'framework', 'experimental', 'evaluation', 'of', 'the', 'framework', 'on', 'generated', 'adversarial', 'drifting', 'data', 'streams', 'demonstrates', 'that', 'this', 'framework', 'is', 'able', 'to', 'provide', 'reliable', 'unsupervised', 'indication', 'of', 'drift', 'and', 'is', 'able', 'to', 'recover', 'from', 'drifts', 'swiftly', 'while', 'traditional', 'partially', 'labeled', 'concept', 'drift', 'detection', 'methodologies', 'fail', 'to', 'detect', 'adversarial', 'drifts', 'the', 'proposed', 'framework', 'is', 'able', 'to', 'detect', 'such', 'drifts', 'and', 'operates', 'with', '6', 'labeled', 'data', 'on', 'average', 'also', 'the', 'framework', 'provides', 'benefits', 'for', 'active', 'learning', 'over', 'imbalanced', 'data', 'streams', 'by', 'innately', 'providing', 'for', 'feature', 'space', 'honeypots', 'where', 'minority', 'class', 'adversarial', 'samples', 'may', 'be', 'captured']]
|
[-0.0680668277310098, 0.06440152365645332, -0.05558143489831707, 0.0644017139191199, -0.12365897661124711, -0.1811410285602075, 0.0075850720576166415, 0.4021099257180169, -0.29839378390403204, -0.33050045935814915, 0.11560599908404205, -0.2693526062665315, -0.16454047678548883, 0.18254929143700124, -0.1693651210682407, 0.06698746108586712, 0.04996941812391131, 0.02979653435554173, 0.009182766521120862, -0.24109878640926818, 0.2985969013169912, 0.07405228350101059, 0.3197402217818152, 0.0004010111494553259, 0.12576800759045803, -0.019026101646394705, -0.05396676893234982, 0.05028652849023436, -0.037421333037486244, 0.09838815436769857, 0.3076141888708261, 0.18156874759697658, 0.3375311776128965, -0.40100706280523984, -0.25275885873868587, 0.11025290058932377, 0.13045649866828715, 0.1258309342388024, -0.08041583461474852, -0.33573738786431684, 0.11126950780075587, -0.20094112160837682, -0.07500860130818714, -0.1101836442828901, -0.000299605110898826, 0.009703986887576463, -0.30507145167305216, 0.011294209274353154, 0.09072165121904366, 0.03600508466551869, -0.061471061382088084, -0.06255425379638066, 0.048924081938115885, 0.15419529219461667, 0.052833895565129095, 0.03155174230936305, 0.17266017978586706, -0.09959957209246703, -0.1315768215903893, 0.3538066045964448, -0.057766131890997344, -0.23453925090371316, 0.24485411241922356, -0.05389905635232696, -0.11112149147767561, 0.1602314375162794, 0.24873686373679985, 0.114487799494345, -0.18535538186060035, 0.024807484358138142, 0.010290738490154947, 0.13708012846043313, 0.023760627395079018, 0.005446721762385604, 0.1723745923758206, 0.2068493285678738, 0.10598917195372104, 0.11555176148492698, -0.13702742776055024, -0.08411249324009883, -0.2459322030596382, -0.08828273800191772, -0.1683612380117125, -0.025911655025902616, -0.015085342830275699, -0.16961096562909167, 0.3560260850675172, 0.2418873164221956, 0.20950604125640265, 0.06061041558300579, 0.35764167595694496, 0.05585954937043192, 0.10858814105941679, 0.08622815849792272, 0.2002979758219608, 0.04267985279111729, 0.13501287370819096, -0.14928952478546834, 0.15213694084299814, -0.0006056663301007763]
|
1,803.09161
|
On the birational geometry of spaces of complete forms I: collineations
and quadrics
|
Moduli spaces of complete collineations are wonderful compactifications of
spaces of linear maps of maximal rank between two fixed vector spaces. We
investigate the birational geometry of moduli spaces of complete collineations
and quadrics from the point of view of Mori theory. We compute their effective,
nef and movable cones, the generators of their Cox rings, and their groups of
pseudo-automorphisms. Furthermore, we give a complete description of both the
Mori chamber and stable base locus decompositions of the effective cone of the
space of complete collineations of the 3-dimensional projective space.
|
math.AG math.RT
|
moduli spaces of complete collineations are wonderful compactifications of spaces of linear maps of maximal rank between two fixed vector spaces we investigate the birational geometry of moduli spaces of complete collineations and quadrics from the point of view of mori theory we compute their effective nef and movable cones the generators of their cox rings and their groups of pseudoautomorphisms furthermore we give a complete description of both the mori chamber and stable base locus decompositions of the effective cone of the space of complete collineations of the 3dimensional projective space
|
[['moduli', 'spaces', 'of', 'complete', 'collineations', 'are', 'wonderful', 'compactifications', 'of', 'spaces', 'of', 'linear', 'maps', 'of', 'maximal', 'rank', 'between', 'two', 'fixed', 'vector', 'spaces', 'we', 'investigate', 'the', 'birational', 'geometry', 'of', 'moduli', 'spaces', 'of', 'complete', 'collineations', 'and', 'quadrics', 'from', 'the', 'point', 'of', 'view', 'of', 'mori', 'theory', 'we', 'compute', 'their', 'effective', 'nef', 'and', 'movable', 'cones', 'the', 'generators', 'of', 'their', 'cox', 'rings', 'and', 'their', 'groups', 'of', 'pseudoautomorphisms', 'furthermore', 'we', 'give', 'a', 'complete', 'description', 'of', 'both', 'the', 'mori', 'chamber', 'and', 'stable', 'base', 'locus', 'decompositions', 'of', 'the', 'effective', 'cone', 'of', 'the', 'space', 'of', 'complete', 'collineations', 'of', 'the', '3dimensional', 'projective', 'space']]
|
[-0.17480991886544, 0.05746307717028843, -0.10678636131848654, 0.1127249543433604, -0.0946392963169669, -0.07683411439496052, 0.017010119555102985, 0.3639876955269795, -0.3028603587755124, -0.1525642740130222, 0.10778362979687264, -0.2398596801288912, -0.15000055314284627, 0.17946292304069453, -0.1565417646045756, -0.005333295891709302, -0.03087333525257671, 0.01928313733483462, -0.19641645797325866, -0.3579778083379927, 0.5121872571610805, -0.013482005507482783, 0.26550193555885926, 0.020809695843364232, 0.19816345715915543, 0.045084104503747884, -0.08712935574231265, 0.023751392018470062, -0.19146933077591594, 0.2048966940391161, 0.30986804413892655, 0.11847522138091533, 0.10518600220751503, -0.40719963510966173, -0.1385399159297104, 0.2539961260095563, 0.07398851940651303, 0.01694948508647149, 0.03761439704660164, -0.24477377768767916, 0.056739505876422576, -0.09984997009261228, -0.22028493787587175, -0.1359720512536233, 0.05264609226698825, 0.03650411927019772, -0.14998892653713244, -0.05951247474940433, 0.08352989812745996, 0.1908645021283756, -0.08891052049685917, -0.0674940847751239, -0.17270598297877965, 0.08037508232012877, -0.018355202886437917, -0.0031616300516559377, 0.12108906330135853, -0.10715822657347536, -0.12149373654519087, 0.4046120115596315, -0.03291901526213421, -0.21032910182586181, 0.12728603661272916, -0.17147912953615838, -0.04651102635999332, 0.16710692305502522, 0.1570317968751466, 0.23092852015100146, 0.03443601860097893, 0.22695880328335435, -0.11649835565755062, -0.017855775864913798, 0.11098999710014576, 0.02165667279927141, 0.16530715332002097, 0.12044432296660608, 0.09545578093915853, 0.09464016335044542, 0.007565417772401934, -0.05406041516487122, -0.43812176973923395, -0.23970535376271151, -0.061913936864584684, 0.1314820517613755, -0.19369147023446756, -0.18979832175967243, 0.40912965487729275, -0.03252289958460176, 0.21983096185747697, 0.08846289701962276, 0.2282764384644511, -0.099909165084524, -0.02636670030440892, 0.03655684136585636, 0.18352044978351129, 0.2488748987266065, -0.04775969286793438, -0.11585520918774621, -0.11653480930797978, 0.22431686929548564]
|
1,803.09162
|
A Dynamic-Adversarial Mining Approach to the Security of Machine
Learning
|
Operating in a dynamic real world environment requires a forward thinking and
adversarial aware design for classifiers, beyond fitting the model to the
training data. In such scenarios, it is necessary to make classifiers - a)
harder to evade, b) easier to detect changes in the data distribution over
time, and c) be able to retrain and recover from model degradation. While most
works in the security of machine learning has concentrated on the evasion
resistance (a) problem, there is little work in the areas of reacting to
attacks (b and c). Additionally, while streaming data research concentrates on
the ability to react to changes to the data distribution, they often take an
adversarial agnostic view of the security problem. This makes them vulnerable
to adversarial activity, which is aimed towards evading the concept drift
detection mechanism itself. In this paper, we analyze the security of machine
learning, from a dynamic and adversarial aware perspective. The existing
techniques of Restrictive one class classifier models, Complex learning models
and Randomization based ensembles, are shown to be myopic as they approach
security as a static task. These methodologies are ill suited for a dynamic
environment, as they leak excessive information to an adversary, who can
subsequently launch attacks which are indistinguishable from the benign data.
Based on empirical vulnerability analysis against a sophisticated adversary, a
novel feature importance hiding approach for classifier design, is proposed.
The proposed design ensures that future attacks on classifiers can be detected
and recovered from. The proposed work presents motivation, by serving as a
blueprint, for future work in the area of Dynamic-Adversarial mining, which
combines lessons learned from Streaming data mining, Adversarial learning and
Cybersecurity.
|
cs.LG cs.CR stat.ML
|
operating in a dynamic real world environment requires a forward thinking and adversarial aware design for classifiers beyond fitting the model to the training data in such scenarios it is necessary to make classifiers a harder to evade b easier to detect changes in the data distribution over time and c be able to retrain and recover from model degradation while most works in the security of machine learning has concentrated on the evasion resistance a problem there is little work in the areas of reacting to attacks b and c additionally while streaming data research concentrates on the ability to react to changes to the data distribution they often take an adversarial agnostic view of the security problem this makes them vulnerable to adversarial activity which is aimed towards evading the concept drift detection mechanism itself in this paper we analyze the security of machine learning from a dynamic and adversarial aware perspective the existing techniques of restrictive one class classifier models complex learning models and randomization based ensembles are shown to be myopic as they approach security as a static task these methodologies are ill suited for a dynamic environment as they leak excessive information to an adversary who can subsequently launch attacks which are indistinguishable from the benign data based on empirical vulnerability analysis against a sophisticated adversary a novel feature importance hiding approach for classifier design is proposed the proposed design ensures that future attacks on classifiers can be detected and recovered from the proposed work presents motivation by serving as a blueprint for future work in the area of dynamicadversarial mining which combines lessons learned from streaming data mining adversarial learning and cybersecurity
|
[['operating', 'in', 'a', 'dynamic', 'real', 'world', 'environment', 'requires', 'a', 'forward', 'thinking', 'and', 'adversarial', 'aware', 'design', 'for', 'classifiers', 'beyond', 'fitting', 'the', 'model', 'to', 'the', 'training', 'data', 'in', 'such', 'scenarios', 'it', 'is', 'necessary', 'to', 'make', 'classifiers', 'a', 'harder', 'to', 'evade', 'b', 'easier', 'to', 'detect', 'changes', 'in', 'the', 'data', 'distribution', 'over', 'time', 'and', 'c', 'be', 'able', 'to', 'retrain', 'and', 'recover', 'from', 'model', 'degradation', 'while', 'most', 'works', 'in', 'the', 'security', 'of', 'machine', 'learning', 'has', 'concentrated', 'on', 'the', 'evasion', 'resistance', 'a', 'problem', 'there', 'is', 'little', 'work', 'in', 'the', 'areas', 'of', 'reacting', 'to', 'attacks', 'b', 'and', 'c', 'additionally', 'while', 'streaming', 'data', 'research', 'concentrates', 'on', 'the', 'ability', 'to', 'react', 'to', 'changes', 'to', 'the', 'data', 'distribution', 'they', 'often', 'take', 'an', 'adversarial', 'agnostic', 'view', 'of', 'the', 'security', 'problem', 'this', 'makes', 'them', 'vulnerable', 'to', 'adversarial', 'activity', 'which', 'is', 'aimed', 'towards', 'evading', 'the', 'concept', 'drift', 'detection', 'mechanism', 'itself', 'in', 'this', 'paper', 'we', 'analyze', 'the', 'security', 'of', 'machine', 'learning', 'from', 'a', 'dynamic', 'and', 'adversarial', 'aware', 'perspective', 'the', 'existing', 'techniques', 'of', 'restrictive', 'one', 'class', 'classifier', 'models', 'complex', 'learning', 'models', 'and', 'randomization', 'based', 'ensembles', 'are', 'shown', 'to', 'be', 'myopic', 'as', 'they', 'approach', 'security', 'as', 'a', 'static', 'task', 'these', 'methodologies', 'are', 'ill', 'suited', 'for', 'a', 'dynamic', 'environment', 'as', 'they', 'leak', 'excessive', 'information', 'to', 'an', 'adversary', 'who', 'can', 'subsequently', 'launch', 'attacks', 'which', 'are', 'indistinguishable', 'from', 'the', 'benign', 'data', 'based', 'on', 'empirical', 'vulnerability', 'analysis', 'against', 'a', 'sophisticated', 'adversary', 'a', 'novel', 'feature', 'importance', 'hiding', 'approach', 'for', 'classifier', 'design', 'is', 'proposed', 'the', 'proposed', 'design', 'ensures', 'that', 'future', 'attacks', 'on', 'classifiers', 'can', 'be', 'detected', 'and', 'recovered', 'from', 'the', 'proposed', 'work', 'presents', 'motivation', 'by', 'serving', 'as', 'a', 'blueprint', 'for', 'future', 'work', 'in', 'the', 'area', 'of', 'dynamicadversarial', 'mining', 'which', 'combines', 'lessons', 'learned', 'from', 'streaming', 'data', 'mining', 'adversarial', 'learning', 'and', 'cybersecurity']]
|
[-0.06007868552713702, 0.014730896046893698, -0.09508496677332359, 0.09333876394986138, -0.13718793476134916, -0.2414137828651318, 0.08529946533248622, 0.3838569048055807, -0.2733263648743405, -0.3312143044697965, 0.11503724924697194, -0.2866586167390529, -0.1810180652863094, 0.1956741392745053, -0.17389844835037077, 0.10700397516999205, 0.05380426073868823, 0.04294906026643402, 0.007816343847746265, -0.27680701390917445, 0.3152460480807139, 0.10445089915528598, 0.34423111686407376, 0.012477996164011611, 0.05514218303415292, -0.008270775763122936, -0.03264938034445034, -0.005100804665176339, -0.04267098759595722, 0.13054249741164134, 0.35188121896940355, 0.24895433503932687, 0.3571115797356154, -0.4135317790157259, -0.2238881434431629, 0.10918490341229915, 0.1212843825590094, 0.1311168539016726, -0.05925659508535148, -0.34562490437354637, 0.09774999675846958, -0.1738052462565541, -0.05882075485111036, -0.1325796810806719, -0.021046154723849, -0.037862486483794824, -0.2851797799211641, -0.029046473390463106, 0.08667165150912982, 0.05947728560134661, -0.041947915390241446, -0.072464476444587, 0.010229407861788458, 0.15073063188683852, 0.0725923462925119, 0.029427385727189052, 0.20171081326861567, -0.1587631384252036, -0.14136072919142537, 0.3638785856243035, -0.022154293523173416, -0.18102391963338796, 0.20169757048140063, 0.006934644276148468, -0.15767047499282966, 0.10664692568670057, 0.2741221998274387, 0.10835761428955229, -0.17741364663439912, 0.016546178415807685, 0.013702262149046138, 0.15807314458494798, 0.021325650265178096, -0.008071122726338111, 0.17894418747752688, 0.2215618874511214, 0.07951215973261758, 0.13351120624820692, -0.10784869205422232, -0.0905586457542322, -0.230279306502885, -0.0867436240176714, -0.17313556616877068, 0.0261099089768342, -0.039164480861462986, -0.1309902737565828, 0.3615379050300063, 0.2577740001409829, 0.19614557126647916, 0.07396312533593687, 0.39311025606380906, -0.005323737742890358, 0.11282397308664242, 0.12766844951963752, 0.22101751457843494, 0.017078951513058497, 0.15620157602688614, -0.12831622293737585, 0.16837407671426177, -0.03567283578420441]
|
1,803.09163
|
Security Theater: On the Vulnerability of Classifiers to Exploratory
Attacks
|
The increasing scale and sophistication of cyberattacks has led to the
adoption of machine learning based classification techniques, at the core of
cybersecurity systems. These techniques promise scale and accuracy, which
traditional rule or signature based methods cannot. However, classifiers
operating in adversarial domains are vulnerable to evasion attacks by an
adversary, who is capable of learning the behavior of the system by employing
intelligently crafted probes. Classification accuracy in such domains provides
a false sense of security, as detection can easily be evaded by carefully
perturbing the input samples. In this paper, a generic data driven framework is
presented, to analyze the vulnerability of classification systems to black box
probing based attacks. The framework uses an exploration exploitation based
strategy, to understand an adversary's point of view of the attack defense
cycle. The adversary assumes a black box model of the defender's classifier and
can launch indiscriminate attacks on it, without information of the defender's
model type, training data or the domain of application. Experimental evaluation
on 10 real world datasets demonstrates that even models having high perceived
accuracy (>90%), by a defender, can be effectively circumvented with a high
evasion rate (>95%, on average). The detailed attack algorithms, adversarial
model and empirical evaluation, serve.
|
cs.LG cs.CR stat.ML
|
the increasing scale and sophistication of cyberattacks has led to the adoption of machine learning based classification techniques at the core of cybersecurity systems these techniques promise scale and accuracy which traditional rule or signature based methods cannot however classifiers operating in adversarial domains are vulnerable to evasion attacks by an adversary who is capable of learning the behavior of the system by employing intelligently crafted probes classification accuracy in such domains provides a false sense of security as detection can easily be evaded by carefully perturbing the input samples in this paper a generic data driven framework is presented to analyze the vulnerability of classification systems to black box probing based attacks the framework uses an exploration exploitation based strategy to understand an adversarys point of view of the attack defense cycle the adversary assumes a black box model of the defenders classifier and can launch indiscriminate attacks on it without information of the defenders model type training data or the domain of application experimental evaluation on 10 real world datasets demonstrates that even models having high perceived accuracy 90 by a defender can be effectively circumvented with a high evasion rate 95 on average the detailed attack algorithms adversarial model and empirical evaluation serve
|
[['the', 'increasing', 'scale', 'and', 'sophistication', 'of', 'cyberattacks', 'has', 'led', 'to', 'the', 'adoption', 'of', 'machine', 'learning', 'based', 'classification', 'techniques', 'at', 'the', 'core', 'of', 'cybersecurity', 'systems', 'these', 'techniques', 'promise', 'scale', 'and', 'accuracy', 'which', 'traditional', 'rule', 'or', 'signature', 'based', 'methods', 'can', 'not', 'however', 'classifiers', 'operating', 'in', 'adversarial', 'domains', 'are', 'vulnerable', 'to', 'evasion', 'attacks', 'by', 'an', 'adversary', 'who', 'is', 'capable', 'of', 'learning', 'the', 'behavior', 'of', 'the', 'system', 'by', 'employing', 'intelligently', 'crafted', 'probes', 'classification', 'accuracy', 'in', 'such', 'domains', 'provides', 'a', 'false', 'sense', 'of', 'security', 'as', 'detection', 'can', 'easily', 'be', 'evaded', 'by', 'carefully', 'perturbing', 'the', 'input', 'samples', 'in', 'this', 'paper', 'a', 'generic', 'data', 'driven', 'framework', 'is', 'presented', 'to', 'analyze', 'the', 'vulnerability', 'of', 'classification', 'systems', 'to', 'black', 'box', 'probing', 'based', 'attacks', 'the', 'framework', 'uses', 'an', 'exploration', 'exploitation', 'based', 'strategy', 'to', 'understand', 'an', 'adversarys', 'point', 'of', 'view', 'of', 'the', 'attack', 'defense', 'cycle', 'the', 'adversary', 'assumes', 'a', 'black', 'box', 'model', 'of', 'the', 'defenders', 'classifier', 'and', 'can', 'launch', 'indiscriminate', 'attacks', 'on', 'it', 'without', 'information', 'of', 'the', 'defenders', 'model', 'type', 'training', 'data', 'or', 'the', 'domain', 'of', 'application', 'experimental', 'evaluation', 'on', '10', 'real', 'world', 'datasets', 'demonstrates', 'that', 'even', 'models', 'having', 'high', 'perceived', 'accuracy', '90', 'by', 'a', 'defender', 'can', 'be', 'effectively', 'circumvented', 'with', 'a', 'high', 'evasion', 'rate', '95', 'on', 'average', 'the', 'detailed', 'attack', 'algorithms', 'adversarial', 'model', 'and', 'empirical', 'evaluation', 'serve']]
|
[-0.1035235811020405, -0.007962291732170071, -0.07733970035794349, 0.08594976961309009, -0.089776931585888, -0.22889410192821769, 0.1325616282708988, 0.34106807242561543, -0.22137372225478286, -0.37410223395856107, 0.13609823241328217, -0.2879354569134145, -0.15644860498107754, 0.20955466813089244, -0.15917339484580761, 0.10255537082211695, 0.06308270214858874, 0.02390367653027429, 0.006641013929660456, -0.3224841515918303, 0.344029039443709, 0.09485742079930892, 0.34441525910211646, 0.026973654882721423, 0.09298413582618578, -0.00696437872675189, 0.0019549315256530034, 0.012580725913282466, -0.036102484594104006, 0.11526295467693773, 0.2986534832476264, 0.230612196277935, 0.3542656716733163, -0.4001122481248157, -0.2275094513191981, 0.12040813952000533, 0.13035216364010738, 0.14514914197924014, -0.04347819124532926, -0.37292754792738797, 0.09991868561840107, -0.21994285774079786, -0.07383270324365312, -0.14060519032679714, -0.0439214753943095, -0.004553433858614037, -0.2751272137834722, -0.01517646785955966, 0.07366021332479473, 0.09701611180137393, -0.03052956107351479, -0.052518145801557975, 0.0033235588889335087, 0.14594639435968393, 0.04464636465302862, 0.02672975654050186, 0.22249714098195883, -0.16289669125574835, -0.18855915385791086, 0.34652191963370726, -0.03768097992271077, -0.18487248871169518, 0.20454712332592453, -0.013019468905269236, -0.09653771711639376, 0.11804628761030805, 0.25371584433190253, 0.11080787860414976, -0.14144198487092097, 0.031693801662889154, 0.042544506427242564, 0.20700315894530344, 0.03379654094766924, -0.0009685838381323405, 0.20870744024070456, 0.24623522455106683, 0.06575433258867062, 0.10845717524430278, -0.10775498380594334, -0.06497898118363486, -0.22289787443885625, -0.07794258741837373, -0.19263105907540426, 0.031083090870895936, -0.08838601608885506, -0.12693725185297824, 0.3576711874729661, 0.22503957535243696, 0.1686567187855911, 0.06033736330137593, 0.3707185178086306, 0.024230872176853033, 0.10092198705707861, 0.10475143376098955, 0.25050230308746296, -0.009867073408753166, 0.08943263069470075, -0.15221928038346413, 0.15727844559430068, 0.0215648479786688]
|
1,803.09164
|
Low-Resource Speech-to-Text Translation
|
Speech-to-text translation has many potential applications for low-resource
languages, but the typical approach of cascading speech recognition with
machine translation is often impossible, since the transcripts needed to train
a speech recognizer are usually not available for low-resource languages.
Recent work has found that neural encoder-decoder models can learn to directly
translate foreign speech in high-resource scenarios, without the need for
intermediate transcription. We investigate whether this approach also works in
settings where both data and computation are limited. To make the approach
efficient, we make several architectural changes, including a change from
character-level to word-level decoding. We find that this choice yields crucial
speed improvements that allow us to train with fewer computational resources,
yet still performs well on frequent words. We explore models trained on between
20 and 160 hours of data, and find that although models trained on less data
have considerably lower BLEU scores, they can still predict words with
relatively high precision and recall---around 50% for a model trained on 50
hours of data, versus around 60% for the full 160 hour model. Thus, they may
still be useful for some low-resource scenarios.
|
cs.CL
|
speechtotext translation has many potential applications for lowresource languages but the typical approach of cascading speech recognition with machine translation is often impossible since the transcripts needed to train a speech recognizer are usually not available for lowresource languages recent work has found that neural encoderdecoder models can learn to directly translate foreign speech in highresource scenarios without the need for intermediate transcription we investigate whether this approach also works in settings where both data and computation are limited to make the approach efficient we make several architectural changes including a change from characterlevel to wordlevel decoding we find that this choice yields crucial speed improvements that allow us to train with fewer computational resources yet still performs well on frequent words we explore models trained on between 20 and 160 hours of data and find that although models trained on less data have considerably lower bleu scores they can still predict words with relatively high precision and recallaround 50 for a model trained on 50 hours of data versus around 60 for the full 160 hour model thus they may still be useful for some lowresource scenarios
|
[['speechtotext', 'translation', 'has', 'many', 'potential', 'applications', 'for', 'lowresource', 'languages', 'but', 'the', 'typical', 'approach', 'of', 'cascading', 'speech', 'recognition', 'with', 'machine', 'translation', 'is', 'often', 'impossible', 'since', 'the', 'transcripts', 'needed', 'to', 'train', 'a', 'speech', 'recognizer', 'are', 'usually', 'not', 'available', 'for', 'lowresource', 'languages', 'recent', 'work', 'has', 'found', 'that', 'neural', 'encoderdecoder', 'models', 'can', 'learn', 'to', 'directly', 'translate', 'foreign', 'speech', 'in', 'highresource', 'scenarios', 'without', 'the', 'need', 'for', 'intermediate', 'transcription', 'we', 'investigate', 'whether', 'this', 'approach', 'also', 'works', 'in', 'settings', 'where', 'both', 'data', 'and', 'computation', 'are', 'limited', 'to', 'make', 'the', 'approach', 'efficient', 'we', 'make', 'several', 'architectural', 'changes', 'including', 'a', 'change', 'from', 'characterlevel', 'to', 'wordlevel', 'decoding', 'we', 'find', 'that', 'this', 'choice', 'yields', 'crucial', 'speed', 'improvements', 'that', 'allow', 'us', 'to', 'train', 'with', 'fewer', 'computational', 'resources', 'yet', 'still', 'performs', 'well', 'on', 'frequent', 'words', 'we', 'explore', 'models', 'trained', 'on', 'between', '20', 'and', '160', 'hours', 'of', 'data', 'and', 'find', 'that', 'although', 'models', 'trained', 'on', 'less', 'data', 'have', 'considerably', 'lower', 'bleu', 'scores', 'they', 'can', 'still', 'predict', 'words', 'with', 'relatively', 'high', 'precision', 'and', 'recallaround', '50', 'for', 'a', 'model', 'trained', 'on', '50', 'hours', 'of', 'data', 'versus', 'around', '60', 'for', 'the', 'full', '160', 'hour', 'model', 'thus', 'they', 'may', 'still', 'be', 'useful', 'for', 'some', 'lowresource', 'scenarios']]
|
[-0.026361483702047623, 0.06743915234244165, -0.02998253376656436, 0.1357076897648198, -0.13575176591611401, -0.23840227399150876, 0.08695861858528675, 0.48457482144395936, -0.2485695336945355, -0.39550526653519796, 0.08848163499347467, -0.26416523578790896, -0.12855639082459325, 0.26495209540785813, -0.1314994726081959, 0.0654845402244837, 0.1701758540986245, 0.07720489240809279, -0.07122791631839533, -0.3146235948437227, 0.22616193176217297, 0.04524563054210521, 0.3376190654813925, 0.03493875706130091, 0.09045530949099198, -0.07893710090146265, -0.015908682616776165, -0.08794644952846323, -0.04089577801922152, 0.1438422621941623, 0.3400936659917422, 0.20484193667948725, 0.29422116693965894, -0.43050263080008844, -0.21955734236106117, 0.11770732587646633, 0.15778167768416398, 0.14409195752266576, -0.01644681401819708, -0.2799230398557941, 0.09933625026307204, -0.18941570621701007, 0.04808594426638223, -0.16466874962443495, 0.020985659323931538, -0.029091655611643258, -0.25836674948901506, 0.04943609308002561, 0.08982027842280987, 0.10789856696650785, -0.03545285068467299, -0.11157466286487061, 0.016768928344565677, 0.15314076007667551, 0.07036502300487722, 0.09382838032701436, 0.11422611170767104, -0.16281837987200543, -0.13184926677109265, 0.4116235064731084, -0.06330543870659157, -0.2204222651447523, 0.25856872461673946, -0.056755464187858096, -0.18222858389480945, 0.09234884187808251, 0.2423822335960508, 0.06733751418268219, -0.18094221202788605, -0.001814253902794883, -0.004654589436268484, 0.27329110718994615, 0.09501240735146452, -0.010598220709925468, 0.18760284709178887, 0.23246625645638985, -0.03289733809091519, 0.0987697684138834, -0.11172091597529317, -0.06419554667890988, -0.1760748040483876, -0.06715011404189754, -0.12278639743270951, -0.0021290788869778154, -0.07023529847928218, -0.12253281745144831, 0.36478909703200674, 0.25455245332117565, 0.18393057877357233, 0.1416530893962422, 0.3092478982167926, 0.0069334682495517524, 0.1561157256165609, 0.10266620986148675, 0.19293415027481933, -0.037557905285873196, 0.13473814878772128, -0.10738552032402134, 0.12566044925834066, -0.04485417996473451]
|
1,803.09165
|
Noise generation for compression algorithms
|
In various Computer Vision and Signal Processing applications, noise is
typically perceived as a drawback of the image capturing system that ought to
be removed. We, on the other hand, claim that image noise, just as texture, is
important for visual perception and, therefore, critical for lossy compression
algorithms that tend to make decompressed images look less realistic by
removing small image details. In this paper we propose a physically and
biologically inspired technique that learns a noise model at the encoding step
of the compression algorithm and then generates the appropriate amount of
additive noise at the decoding step. Our method can significantly increase the
realism of the decompressed image at the cost of few bytes of additional memory
space regardless of the original image size. The implementation of our method
is open-sourced and available at https://github.com/google/pik.
|
cs.CV
|
in various computer vision and signal processing applications noise is typically perceived as a drawback of the image capturing system that ought to be removed we on the other hand claim that image noise just as texture is important for visual perception and therefore critical for lossy compression algorithms that tend to make decompressed images look less realistic by removing small image details in this paper we propose a physically and biologically inspired technique that learns a noise model at the encoding step of the compression algorithm and then generates the appropriate amount of additive noise at the decoding step our method can significantly increase the realism of the decompressed image at the cost of few bytes of additional memory space regardless of the original image size the implementation of our method is opensourced and available at httpsgithubcomgooglepik
|
[['in', 'various', 'computer', 'vision', 'and', 'signal', 'processing', 'applications', 'noise', 'is', 'typically', 'perceived', 'as', 'a', 'drawback', 'of', 'the', 'image', 'capturing', 'system', 'that', 'ought', 'to', 'be', 'removed', 'we', 'on', 'the', 'other', 'hand', 'claim', 'that', 'image', 'noise', 'just', 'as', 'texture', 'is', 'important', 'for', 'visual', 'perception', 'and', 'therefore', 'critical', 'for', 'lossy', 'compression', 'algorithms', 'that', 'tend', 'to', 'make', 'decompressed', 'images', 'look', 'less', 'realistic', 'by', 'removing', 'small', 'image', 'details', 'in', 'this', 'paper', 'we', 'propose', 'a', 'physically', 'and', 'biologically', 'inspired', 'technique', 'that', 'learns', 'a', 'noise', 'model', 'at', 'the', 'encoding', 'step', 'of', 'the', 'compression', 'algorithm', 'and', 'then', 'generates', 'the', 'appropriate', 'amount', 'of', 'additive', 'noise', 'at', 'the', 'decoding', 'step', 'our', 'method', 'can', 'significantly', 'increase', 'the', 'realism', 'of', 'the', 'decompressed', 'image', 'at', 'the', 'cost', 'of', 'few', 'bytes', 'of', 'additional', 'memory', 'space', 'regardless', 'of', 'the', 'original', 'image', 'size', 'the', 'implementation', 'of', 'our', 'method', 'is', 'opensourced', 'and', 'available', 'at', 'httpsgithubcomgooglepik']]
|
[-0.06462925574640288, 0.050493900786514265, -0.0796789211309413, 0.05469379584427352, -0.07310861583296073, -0.17901289013484628, 0.023344900150593016, 0.42321475769263983, -0.292160926386714, -0.35042866044439863, 0.13102817731691918, -0.25070430443751335, -0.18406419079057382, 0.18370280706282896, -0.14627048188317432, 0.07121216948653986, 0.09682596044574124, 0.06443504927795463, -0.0551046524456036, -0.2907000997096953, 0.2807108997222865, 0.08993810400992197, 0.29774670112524587, 0.00042852465348848463, 0.13081655857564514, -0.02083121017547814, -0.05305763930558179, -0.008213572217921393, -0.02510694739086737, 0.13951382475028182, 0.2730431499972559, 0.18312431080266833, 0.3098505294922549, -0.4349610500282397, -0.22704220737031505, 0.06817582369285778, 0.1537841857465351, 0.16024579106401787, -0.0638005125360142, -0.28540203082851084, 0.12630531913770812, -0.11354084308837017, -0.004123549116435495, -0.08797830279175546, 0.014890417919738939, -0.05008935828948905, -0.2754891894377061, 0.046513278608339544, 0.10729980696822061, 0.03552474958794939, -0.02997940820539846, -0.0991646512471017, 0.02515235594830673, 0.14391917587482256, 0.011846171473628793, 0.07961137606643386, 0.21103595802900346, -0.19006480333517667, -0.05050154855767142, 0.40672229131833265, -0.021301467731309524, -0.1985188398415046, 0.1870155161362223, -0.061190801256261494, -0.1398737408479091, 0.1464216121282075, 0.18235900798934873, 0.04627485845890576, -0.12626574879485, 0.017318601882761603, 0.004525559736810026, 0.24008289045470693, 0.09852390285295835, 0.06007562285071633, 0.16061216019039606, 0.20055428114813162, 0.05870325559491876, 0.17993244668766245, -0.14766880690908726, -0.025546844552413826, -0.27730738213217826, -0.12812107372485157, -0.2425688972270089, -0.014891117104213604, -0.11580686871058828, -0.12952954489712257, 0.38137938164133767, 0.26068054921041334, 0.1999310294274975, 0.06916337313103306, 0.40008470705662763, 0.054820132727333666, 0.10133953498341619, 0.04747871737791239, 0.14284866241513866, 0.0003790923166530628, 0.11455852225980293, -0.17336395579342642, 0.09779740659261707, 0.03792965567133723]
|
1,803.09166
|
Go-Smart: Open-Ended, Web-Based Modelling of Minimally Invasive Cancer
Treatments via a Clinical Domain Approach
|
Clinicians benefit from online treatment planning systems, through off-site
accessibility, data sharing and professional interaction. As well as enhancing
clinical value, incorporation of simulation tools affords innovative avenues
for open-ended, multi-disciplinary research collaboration. An extensible system
for clinicians, technicians, manufacturers and researchers to build on a
simulation framework is presented. This is achieved using a domain model that
relates entities from theoretical, engineering and clinical domains, allowing
algorithmic generation of simulation configuration for several open source
solvers.
The platform is applied to Minimally Invasive Cancer Treatments (MICTs),
allowing interventional radiologists to upload patient data, segment patient
images and validate simulated treatments of radiofrequency ablation,
cryoablation, microwave ablation and irreversible electroporation. A
traditional radiology software layout is provided in-browser for clinical use,
with simple, guided simulation, primarily for training and research. Developers
and manufacturers access a web-based system to manage their own simulation
components (equipment, numerical models and clinical protocols) and related
parameters.
This system is tested by interventional radiologists at four centres, using
pseudonymized patient data, as part of the Go-Smart Project
(http://gosmart-project.eu). The simulation technology is released as a set of
open source components http://github.com/go-smart.
|
cs.CY
|
clinicians benefit from online treatment planning systems through offsite accessibility data sharing and professional interaction as well as enhancing clinical value incorporation of simulation tools affords innovative avenues for openended multidisciplinary research collaboration an extensible system for clinicians technicians manufacturers and researchers to build on a simulation framework is presented this is achieved using a domain model that relates entities from theoretical engineering and clinical domains allowing algorithmic generation of simulation configuration for several open source solvers the platform is applied to minimally invasive cancer treatments micts allowing interventional radiologists to upload patient data segment patient images and validate simulated treatments of radiofrequency ablation cryoablation microwave ablation and irreversible electroporation a traditional radiology software layout is provided inbrowser for clinical use with simple guided simulation primarily for training and research developers and manufacturers access a webbased system to manage their own simulation components equipment numerical models and clinical protocols and related parameters this system is tested by interventional radiologists at four centres using pseudonymized patient data as part of the gosmart project httpgosmartprojecteu the simulation technology is released as a set of open source components httpgithubcomgosmart
|
[['clinicians', 'benefit', 'from', 'online', 'treatment', 'planning', 'systems', 'through', 'offsite', 'accessibility', 'data', 'sharing', 'and', 'professional', 'interaction', 'as', 'well', 'as', 'enhancing', 'clinical', 'value', 'incorporation', 'of', 'simulation', 'tools', 'affords', 'innovative', 'avenues', 'for', 'openended', 'multidisciplinary', 'research', 'collaboration', 'an', 'extensible', 'system', 'for', 'clinicians', 'technicians', 'manufacturers', 'and', 'researchers', 'to', 'build', 'on', 'a', 'simulation', 'framework', 'is', 'presented', 'this', 'is', 'achieved', 'using', 'a', 'domain', 'model', 'that', 'relates', 'entities', 'from', 'theoretical', 'engineering', 'and', 'clinical', 'domains', 'allowing', 'algorithmic', 'generation', 'of', 'simulation', 'configuration', 'for', 'several', 'open', 'source', 'solvers', 'the', 'platform', 'is', 'applied', 'to', 'minimally', 'invasive', 'cancer', 'treatments', 'micts', 'allowing', 'interventional', 'radiologists', 'to', 'upload', 'patient', 'data', 'segment', 'patient', 'images', 'and', 'validate', 'simulated', 'treatments', 'of', 'radiofrequency', 'ablation', 'cryoablation', 'microwave', 'ablation', 'and', 'irreversible', 'electroporation', 'a', 'traditional', 'radiology', 'software', 'layout', 'is', 'provided', 'inbrowser', 'for', 'clinical', 'use', 'with', 'simple', 'guided', 'simulation', 'primarily', 'for', 'training', 'and', 'research', 'developers', 'and', 'manufacturers', 'access', 'a', 'webbased', 'system', 'to', 'manage', 'their', 'own', 'simulation', 'components', 'equipment', 'numerical', 'models', 'and', 'clinical', 'protocols', 'and', 'related', 'parameters', 'this', 'system', 'is', 'tested', 'by', 'interventional', 'radiologists', 'at', 'four', 'centres', 'using', 'pseudonymized', 'patient', 'data', 'as', 'part', 'of', 'the', 'gosmart', 'project', 'httpgosmartprojecteu', 'the', 'simulation', 'technology', 'is', 'released', 'as', 'a', 'set', 'of', 'open', 'source', 'components', 'httpgithubcomgosmart']]
|
[-0.03632544005258801, 0.02940358725212095, -0.042625406821314965, 0.031626542303351, -0.1443596159144001, -0.2049312962255137, 0.06901846763012849, 0.4349986128226046, -0.20727316564391496, -0.34600701361369773, 0.12290419218032647, -0.3150268851480966, -0.0977044865474213, 0.30467438553614307, -0.09097674151995729, 0.10177596587461332, 0.16608941588983023, -0.04785794773118478, 0.05246509773301691, -0.2543638782306878, 0.23728079052940423, 0.0899987336008897, 0.3807446579500333, 0.06260494297776803, 0.05997765836246744, 0.0032143164651200836, -0.06559072620394892, -0.025684912112742167, -0.08233278305534285, 0.16471840812083724, 0.39764954492788473, 0.2745765639849789, 0.36031013528060024, -0.4549579282512487, -0.22854492009118282, 0.02911556602162386, 0.1329479529805358, 0.08131223754669174, -0.09478295913084477, -0.3436445420690251, 0.02626641055322072, -0.21363693292288738, -0.10723400369379155, -0.10450427064502313, -0.03838582574364148, -0.011078808270137531, -0.31330634680839037, 0.001783625698694702, -0.06705796810250358, 0.1748996777074072, -0.09039132796402877, -0.08971320684209404, 0.03474475650466691, 0.23595424895612163, 0.028702041774200923, 0.05800152009157515, 0.2147081451003635, -0.14341655709698425, -0.1650874164181849, 0.35294298626461906, 0.07998113770382634, -0.17645734557830497, 0.22256772423025417, -0.013854900192345868, -0.08540014713199923, 0.06497138326740644, 0.2251566741306808, 0.053030489722668134, -0.24640520145532607, 0.0016111490051056263, 0.08262311893345489, 0.1868706289318632, 0.03609194730032873, -0.08505688448698975, 0.19668241787331375, 0.2635172000219171, -0.022709791737081847, 0.15416017335000864, -0.012979277448203846, -0.047240673139233406, -0.23775050767442696, -0.15002072440172182, -0.13447745524099847, -0.002061400969013654, -0.037620438357287095, -0.1661080978402369, 0.3743847420963958, 0.20851329918333344, 0.03477933870638767, 0.004654173524432831, 0.37517509257513515, -0.04000283769505209, 0.10193551210197749, 0.02128732014956848, 0.10749379182954766, 0.03280256201322731, 0.17396547769463894, -0.19052834280390932, 0.10677982677540933, -0.04571236760532567]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.