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.02567 | On two-spectra inverse problems | We consider a two-spectra inverse problem for the one-dimensional
Schr\"{o}dinger equation with boundary conditions containing rational
Herglotz--Nevanlinna functions of the eigenvalue parameter and provide a
complete solution of this problem.
| math.SP math-ph math.CA math.FA math.MP | we consider a twospectra inverse problem for the onedimensional schrodinger equation with boundary conditions containing rational herglotznevanlinna functions of the eigenvalue parameter and provide a complete solution of this problem | [['we', 'consider', 'a', 'twospectra', 'inverse', 'problem', 'for', 'the', 'onedimensional', 'schrodinger', 'equation', 'with', 'boundary', 'conditions', 'containing', 'rational', 'herglotznevanlinna', 'functions', 'of', 'the', 'eigenvalue', 'parameter', 'and', 'provide', 'a', 'complete', 'solution', 'of', 'this', 'problem']] | [-0.14668491293365757, -0.0010902640409767629, -0.05398375435421864, 0.05115042339311913, -0.1268404816587766, -0.15635241310422618, -0.014069188137849171, 0.3027420605222384, -0.2947712292894721, -0.19447465147823095, 0.15783185500962038, -0.29665087920924027, -0.1479960243217647, 0.14427242974440257, 0.02010009450217088, 0.17302365781118473, 0.10923847928643227, 0.04795571186211115, -0.10121076488867402, -0.17302029617906858, 0.4211653123299281, -0.09634287332495053, 0.161661698607107, 0.07563922215873996, 0.1582867432385683, 0.023961060959845782, 0.050176351067299646, -0.004382468077043692, -0.2242031832380841, 0.09783342273440213, 0.2590716343993942, 0.08979525733739138, 0.3134009227156639, -0.41550870463252065, -0.21960923178121447, 0.201088312578698, 0.09827305004000664, 0.06634482890367507, -0.05246552106303473, -0.26769480059544243, 0.03779159403250863, -0.0923704090140139, -0.2574502483010292, 0.02660995622475942, 0.02157999309711158, 0.011913474214573701, -0.38052303151537975, 0.16216919487342238, 0.04163804681350788, 0.028688841545954347, -0.17421464752405882, -0.08865972831845284, 0.056382562452927235, 0.03295422671362758, -0.0425938020964774, -0.038133188616484404, -0.028714411690210304, -0.1279375802958384, -0.0896714893480142, 0.38786499689643583, -0.021668403098980587, -0.36080454910794896, 0.0591051625708739, -0.09060287571822603, -0.09096454720323284, 0.09160093118747076, 0.16426941788134475, 0.21190603449940681, -0.14556756569072604, 0.20285905704949983, -0.12702767295995726, 0.11398944974159046, 0.0561016189865768, -0.04099228661507368, 0.09858929508676131, 0.14523560013622044, 0.17445307572682697, 0.24080562740564346, 0.044092443639722964, -0.08700378745173415, -0.3376491648455461, -0.165732848426948, -0.14265171606093646, 0.12752535082399846, -0.1072762883573887, -0.30238979682326317, 0.4329275541007519, 0.08319460144266486, 0.20798406843096018, 0.086987255855153, 0.2135631449520588, 0.26872383890052637, -0.062897144506375, 0.04401898082966606, 0.11751338467001915, 0.15228591219056398, 0.08197691636936118, -0.24342072646444043, -0.05929243269686898, 0.1884922284632921] |
1,803.02568 | Flow-induced Density Fluctuation assisted Nucleation in Polyethylene | The nucleation process of polyethylene under quiescent and shear flow
conditions are comparatively studied with all_atom molecular dynamical
simulations. At both conditions, nucleation are demonstrated to be two_step
processes, which, however, proceed via different intermediate orders. Quiescent
nucleation is assisted by local structure order coupling conformational and
local rotational symmetric orderings, while flow_induced nucleation is promoted
by density fluctuation, which is a coupling effect of conformational and
orientation orderings. Flow drives the transformation from flexible chains to
rigid conformational ordered segments and circumvents the entropic penalty,
which is the most peculiar and rate_limited step in polymer crystallization.
Current work suggests that flow accelerates nucleation in orders of magnitude
is not simply due to flow_induced entropic reduction of melt as early models
proposed, which is mainly attributed to the different kinetic pathway via
conformational/orientational ordering_density fluctuation_nucleation.
| cond-mat.soft | the nucleation process of polyethylene under quiescent and shear flow conditions are comparatively studied with all_atom molecular dynamical simulations at both conditions nucleation are demonstrated to be two_step processes which however proceed via different intermediate orders quiescent nucleation is assisted by local structure order coupling conformational and local rotational symmetric orderings while flow_induced nucleation is promoted by density fluctuation which is a coupling effect of conformational and orientation orderings flow drives the transformation from flexible chains to rigid conformational ordered segments and circumvents the entropic penalty which is the most peculiar and rate_limited step in polymer crystallization current work suggests that flow accelerates nucleation in orders of magnitude is not simply due to flow_induced entropic reduction of melt as early models proposed which is mainly attributed to the different kinetic pathway via conformationalorientational ordering_density fluctuation_nucleation | [['the', 'nucleation', 'process', 'of', 'polyethylene', 'under', 'quiescent', 'and', 'shear', 'flow', 'conditions', 'are', 'comparatively', 'studied', 'with', 'all_atom', 'molecular', 'dynamical', 'simulations', 'at', 'both', 'conditions', 'nucleation', 'are', 'demonstrated', 'to', 'be', 'two_step', 'processes', 'which', 'however', 'proceed', 'via', 'different', 'intermediate', 'orders', 'quiescent', 'nucleation', 'is', 'assisted', 'by', 'local', 'structure', 'order', 'coupling', 'conformational', 'and', 'local', 'rotational', 'symmetric', 'orderings', 'while', 'flow_induced', 'nucleation', 'is', 'promoted', 'by', 'density', 'fluctuation', 'which', 'is', 'a', 'coupling', 'effect', 'of', 'conformational', 'and', 'orientation', 'orderings', 'flow', 'drives', 'the', 'transformation', 'from', 'flexible', 'chains', 'to', 'rigid', 'conformational', 'ordered', 'segments', 'and', 'circumvents', 'the', 'entropic', 'penalty', 'which', 'is', 'the', 'most', 'peculiar', 'and', 'rate_limited', 'step', 'in', 'polymer', 'crystallization', 'current', 'work', 'suggests', 'that', 'flow', 'accelerates', 'nucleation', 'in', 'orders', 'of', 'magnitude', 'is', 'not', 'simply', 'due', 'to', 'flow_induced', 'entropic', 'reduction', 'of', 'melt', 'as', 'early', 'models', 'proposed', 'which', 'is', 'mainly', 'attributed', 'to', 'the', 'different', 'kinetic', 'pathway', 'via', 'conformationalorientational', 'ordering_density', 'fluctuation_nucleation']] | [-0.10292614405190088, 0.25213205192685423, -0.1114077134842537, 0.020096732175698268, -0.05957732042050224, -0.1037400717064225, 0.023162765113094192, 0.3840844275385845, -0.3073385696662003, -0.2865889788069946, 0.06521800779884197, -0.19492699466939048, -0.12354142628573468, 0.1148777178701336, 0.025029079130608735, 0.014632656903548797, 0.0012775322754214715, -0.050339748342264824, -0.02942405998391488, -0.2212633372332138, 0.2524168116524522, 0.06060712776095496, 0.35404455982969973, 0.053854675590900306, 0.08868318157798545, -0.03970760925614283, 0.02228870875510116, 0.052724278509968844, -0.19563923263034322, 0.06556491073272301, 0.23561440212927656, -0.0037275916038770375, 0.22087011691439515, -0.47578262663849696, -0.25785253893819593, 0.06660895511933317, 0.1493574143057381, 0.15097852342571388, -0.031891361075108794, -0.231553286974003, 0.059499448649291915, -0.1326271106203006, -0.05238938688449621, -0.08988114422018545, 0.02035971632681963, 0.031197652523680848, -0.2691261232830011, 0.18331310675876727, 0.07350710212087119, 0.06921833456955909, -0.07243624248717889, -0.047808610826160565, -0.10841878055499529, 0.0526489438644911, 0.11163031244737566, 0.041660837013747426, 0.2625957574460685, -0.12868625147077511, -0.09095043975192554, 0.3952138873594483, -0.0027682848117042947, -0.14654912062238637, 0.25540588032197586, -0.11016886007392734, -0.10277089580350857, 0.23378290099597823, 0.08834925015258976, 0.1341509977905593, -0.15693890524149953, 0.02620362256989103, 0.11011624951043907, 0.14225984984315843, 0.10458585237130874, -0.026795194539292827, 0.21770508173398498, 0.1943617310873636, 0.07511701093121308, 0.18480313433550563, -0.07234731615396349, -0.185420693913988, -0.21892492000864247, -0.14373080810443975, -0.17659107374493033, 0.05961964399689959, -0.10549116601714201, -0.13792388394885646, 0.3322188478131874, 0.08284580856781658, 0.17866287767560787, 0.006840055504095132, 0.24920509039886354, 0.055156832363815814, 0.08710481755721464, 0.03130174256809877, 0.22798604208345372, 0.15809948756689512, 0.05630949353175898, -0.27705578517542756, 0.17218672631191104, 0.08126778294438658] |
1,803.02569 | Baseline-dependent sampling and windowing for radio interferometry: data
compression, field-of-interest shaping and outer field suppression | Traditional radio interferometric correlators produce regular-gridded samples
of the true $uv$-distribution by averaging the signal over constant, discrete
time-frequency intervals. This regular sampling and averaging then translate to
be irregular-gridded samples in the $uv$-space, and results in a
baseline-length-dependent loss of amplitude and phase coherence, which is
dependent on the distance from the image phase centre. The effect is often
referred to as "decorrelation" in the $uv$-space, which is equivalent in the
source domain to "smearing". This work discusses and implements a
regular-gridded sampling scheme in the $uv$-space (baseline-dependent sampling)
and windowing that allow for data compression, field-of-interest shaping and
source suppression. The baseline-dependent sampling requires irregular-gridded
sampling in the time-frequency space i.e. the time-frequency interval becomes
baseline-dependent. Analytic models and simulations are used to show that
decorrelation remains constant across all the baselines when applying
baseline-dependent sampling and windowing. Simulations using MeerKAT telescope
and the European Very Long Baseline Interferometry Network show that both data
compression, field-of-interest shaping and outer field-of-interest suppression
are achieved.
| astro-ph.IM | traditional radio interferometric correlators produce regulargridded samples of the true uvdistribution by averaging the signal over constant discrete timefrequency intervals this regular sampling and averaging then translate to be irregulargridded samples in the uvspace and results in a baselinelengthdependent loss of amplitude and phase coherence which is dependent on the distance from the image phase centre the effect is often referred to as decorrelation in the uvspace which is equivalent in the source domain to smearing this work discusses and implements a regulargridded sampling scheme in the uvspace baselinedependent sampling and windowing that allow for data compression fieldofinterest shaping and source suppression the baselinedependent sampling requires irregulargridded sampling in the timefrequency space ie the timefrequency interval becomes baselinedependent analytic models and simulations are used to show that decorrelation remains constant across all the baselines when applying baselinedependent sampling and windowing simulations using meerkat telescope and the european very long baseline interferometry network show that both data compression fieldofinterest shaping and outer fieldofinterest suppression are achieved | [['traditional', 'radio', 'interferometric', 'correlators', 'produce', 'regulargridded', 'samples', 'of', 'the', 'true', 'uvdistribution', 'by', 'averaging', 'the', 'signal', 'over', 'constant', 'discrete', 'timefrequency', 'intervals', 'this', 'regular', 'sampling', 'and', 'averaging', 'then', 'translate', 'to', 'be', 'irregulargridded', 'samples', 'in', 'the', 'uvspace', 'and', 'results', 'in', 'a', 'baselinelengthdependent', 'loss', 'of', 'amplitude', 'and', 'phase', 'coherence', 'which', 'is', 'dependent', 'on', 'the', 'distance', 'from', 'the', 'image', 'phase', 'centre', 'the', 'effect', 'is', 'often', 'referred', 'to', 'as', 'decorrelation', 'in', 'the', 'uvspace', 'which', 'is', 'equivalent', 'in', 'the', 'source', 'domain', 'to', 'smearing', 'this', 'work', 'discusses', 'and', 'implements', 'a', 'regulargridded', 'sampling', 'scheme', 'in', 'the', 'uvspace', 'baselinedependent', 'sampling', 'and', 'windowing', 'that', 'allow', 'for', 'data', 'compression', 'fieldofinterest', 'shaping', 'and', 'source', 'suppression', 'the', 'baselinedependent', 'sampling', 'requires', 'irregulargridded', 'sampling', 'in', 'the', 'timefrequency', 'space', 'ie', 'the', 'timefrequency', 'interval', 'becomes', 'baselinedependent', 'analytic', 'models', 'and', 'simulations', 'are', 'used', 'to', 'show', 'that', 'decorrelation', 'remains', 'constant', 'across', 'all', 'the', 'baselines', 'when', 'applying', 'baselinedependent', 'sampling', 'and', 'windowing', 'simulations', 'using', 'meerkat', 'telescope', 'and', 'the', 'european', 'very', 'long', 'baseline', 'interferometry', 'network', 'show', 'that', 'both', 'data', 'compression', 'fieldofinterest', 'shaping', 'and', 'outer', 'fieldofinterest', 'suppression', 'are', 'achieved']] | [-0.08538895353979473, 0.11524146896898278, -0.1262077983796784, 0.0991034904683782, -0.06303129333756724, -0.09432366798461983, 0.046568579208501173, 0.4611246428282568, -0.28753539234247505, -0.2724666146432641, 0.1488099532456682, -0.21295003366287588, -0.08858197252119675, 0.2089723565574712, -0.06767028439189629, 0.04645685366876189, 0.10000500244633206, -0.04557293217406614, -0.07332221791587488, -0.2084167009371819, 0.2583519305635548, 0.11253202300659328, 0.33367619443239654, -0.014960249475900482, 0.12031691511302202, 0.030588566472039284, -0.09740612418361523, -0.019137628597050683, -0.05477185916727952, 0.0560079383028308, 0.2696773929622527, 0.1299796052036936, 0.23711706498497218, -0.3573392801771655, -0.23859703676693095, 0.09842226239003288, 0.16227616411018767, 0.1043164906364356, -0.03117195486805677, -0.2841886993403892, 0.05030220099095161, -0.13234700261375065, -0.028148836520670344, -0.056661418685982436, -0.017812277008808632, 0.044256937332779356, -0.3337141475962393, 0.08799541601545101, 0.034417195292482584, 0.039194305881318996, -0.015004725060747855, -0.08418748929874047, 0.036004855246985996, 0.11402936373839488, 0.009592343029513393, 0.10080652680458888, 0.09006408985364456, -0.09118401524230088, -0.07316645711906394, 0.3523410043954474, -0.06356035125824043, -0.18716971630101684, 0.14233656440797093, -0.14308211096978318, -0.09834506084378106, 0.14014396058547796, 0.17265147404121411, 0.08089282563792353, -0.11439682725506158, 0.03362313586172982, 0.018189123093660147, 0.198886802973542, 0.1270120925593641, 0.07053741025181967, 0.14686934969903398, 0.15564222123514884, 0.09107304182132038, 0.14592427745206668, -0.19906062292119595, -0.09580778192623325, -0.2530990947219514, -0.06115229051185291, -0.2092689128611647, -0.007087678940851042, -0.11517478047292416, -0.14354401730211838, 0.37798220597715215, 0.17096708141525024, 0.18175998412119518, 0.0910468940509984, 0.33814336354814983, 0.07308479639153881, 0.09989867160834794, 0.06942759187886222, 0.20108926460240623, 0.09978547423298957, 0.08390203144609248, -0.19940435038381638, 0.043984636557493476, 0.019829745931586006] |
1,803.0257 | An ontological investigation of unimaginable events | We show that, under mild assumptions, some unimaginable events - which we
refer to as Black Swan events - must necessarily occur. It follows as a
corollary of our theorem that any computational model of decision-making under
uncertainty is incomplete in the sense that not all events that occur can be
taken into account. In the context of decision theory we argue that this
constitutes a stronger sense of uncertainty than Knightian uncertainty.
| q-fin.RM math.LO | we show that under mild assumptions some unimaginable events which we refer to as black swan events must necessarily occur it follows as a corollary of our theorem that any computational model of decisionmaking under uncertainty is incomplete in the sense that not all events that occur can be taken into account in the context of decision theory we argue that this constitutes a stronger sense of uncertainty than knightian uncertainty | [['we', 'show', 'that', 'under', 'mild', 'assumptions', 'some', 'unimaginable', 'events', 'which', 'we', 'refer', 'to', 'as', 'black', 'swan', 'events', 'must', 'necessarily', 'occur', 'it', 'follows', 'as', 'a', 'corollary', 'of', 'our', 'theorem', 'that', 'any', 'computational', 'model', 'of', 'decisionmaking', 'under', 'uncertainty', 'is', 'incomplete', 'in', 'the', 'sense', 'that', 'not', 'all', 'events', 'that', 'occur', 'can', 'be', 'taken', 'into', 'account', 'in', 'the', 'context', 'of', 'decision', 'theory', 'we', 'argue', 'that', 'this', 'constitutes', 'a', 'stronger', 'sense', 'of', 'uncertainty', 'than', 'knightian', 'uncertainty']] | [-0.10954656627711276, 0.1130503736252726, -0.13702756276642772, 0.1693245377522749, -0.0879342109555195, -0.10924400473800554, 0.07172314667070782, 0.363029777190425, -0.24587668969072926, -0.2740119958532528, 0.11697801710499948, -0.23047691884673607, -0.17524891223391176, 0.2065747153558309, -0.1800690251599315, -0.04714108400151763, 0.11700131904176424, 0.06231448187453436, -0.030488623475039403, -0.24162202433381283, 0.30607097986823234, 0.008542362233282814, 0.23907242918675634, 0.034848386446394444, 0.11630474337258599, 0.03237615367660011, 0.03062238479295457, 0.08892482407653415, -0.11330591064058392, 0.05469476219109246, 0.28157620147710116, 0.19139456119335874, 0.31096160926029714, -0.4256390572696085, -0.26047546764783247, 0.16417437356004727, 0.09308962682655579, 0.08806362541385887, 0.0032903631758863026, -0.2553750329559118, 0.11937878212340595, -0.19350895477117788, -0.10635299271654705, -0.05064419027365429, 0.000486843609316668, -0.0365610588079607, -0.2951026342376332, 0.1065527786071163, 0.18565857036590155, 0.001717798962769374, -0.06066249564296605, -0.07249427149334634, -0.04342195720569244, 0.10928081720411567, 0.11762013342264305, -0.00025452434701818817, 0.14403560553336334, -0.0759709657228906, -0.13514898467192452, 0.42280752405944005, -0.040275394310887815, -0.19007764531719223, 0.1434045898872362, -0.16928653931245208, -0.2289708866803369, 0.09951506870221609, 0.14768729995096652, 0.07569197570564042, -0.15822393746233324, 0.04493596354453549, -0.10123285985040203, 0.1838862041509907, 0.06903549345393836, 0.07860993500143079, 0.16216361083247713, 0.13179105652545306, 0.08986977782939941, 0.08716587942506804, -0.027232814921249807, -0.0997327242610635, -0.3939993945803021, -0.12855611257517421, -0.10499412571834268, 0.1297772296831015, -0.04792403457292788, -0.14573924101784197, 0.24227378619703607, 0.24609434359352772, 0.19312197073243073, 0.07463373868352353, 0.23641393026730545, 0.15327941510058993, 0.07457471435601024, 0.07888559676365743, 0.2344425066696434, 0.048199081098214844, 0.026198784223901973, -0.09136423271831492, 0.1545080436183743, 0.015002068237099849] |
1,803.02571 | A Comprehensive Analysis of Spitzer Supernovae | The mid-infrared (mid-IR) wavelength regime offers several advantages for
following the late-time evolution of supernovae (SNe). First, the peaks of the
SN spectral energy distributions shift toward longer wavelengths following the
photospheric phase. Second, mid-IR observations suffer less from effects of
interstellar extinction. Third, and perhaps most important, the mid-IR traces
dust formation and circumstellar interaction at late-times (>100 days) after
the radioactive ejecta component fades. The Spitzer Space Telescope has
provided substantial mid-IR observations of SNe since its launch in 2003. More
than 200 SNe have been targeted, but there are even more SNe that have been
observed serendipitously. Here we present the results of a comprehensive study
based on archival Spitzer/IRAC images of more than 1100 SN positions; from this
sample, 119 SNe of various subclasses have been detected, including 45 SNe with
previously unpublished mid-IR photometry. The photometry reveal significant
amounts of warm dust in some cases. We perform an in-depth analysis to
constrain the origin and heating mechanism of the dust, and present the
resulting statistics.
| astro-ph.HE astro-ph.SR | the midinfrared midir wavelength regime offers several advantages for following the latetime evolution of supernovae sne first the peaks of the sn spectral energy distributions shift toward longer wavelengths following the photospheric phase second midir observations suffer less from effects of interstellar extinction third and perhaps most important the midir traces dust formation and circumstellar interaction at latetimes 100 days after the radioactive ejecta component fades the spitzer space telescope has provided substantial midir observations of sne since its launch in 2003 more than 200 sne have been targeted but there are even more sne that have been observed serendipitously here we present the results of a comprehensive study based on archival spitzerirac images of more than 1100 sn positions from this sample 119 sne of various subclasses have been detected including 45 sne with previously unpublished midir photometry the photometry reveal significant amounts of warm dust in some cases we perform an indepth analysis to constrain the origin and heating mechanism of the dust and present the resulting statistics | [['the', 'midinfrared', 'midir', 'wavelength', 'regime', 'offers', 'several', 'advantages', 'for', 'following', 'the', 'latetime', 'evolution', 'of', 'supernovae', 'sne', 'first', 'the', 'peaks', 'of', 'the', 'sn', 'spectral', 'energy', 'distributions', 'shift', 'toward', 'longer', 'wavelengths', 'following', 'the', 'photospheric', 'phase', 'second', 'midir', 'observations', 'suffer', 'less', 'from', 'effects', 'of', 'interstellar', 'extinction', 'third', 'and', 'perhaps', 'most', 'important', 'the', 'midir', 'traces', 'dust', 'formation', 'and', 'circumstellar', 'interaction', 'at', 'latetimes', '100', 'days', 'after', 'the', 'radioactive', 'ejecta', 'component', 'fades', 'the', 'spitzer', 'space', 'telescope', 'has', 'provided', 'substantial', 'midir', 'observations', 'of', 'sne', 'since', 'its', 'launch', 'in', '2003', 'more', 'than', '200', 'sne', 'have', 'been', 'targeted', 'but', 'there', 'are', 'even', 'more', 'sne', 'that', 'have', 'been', 'observed', 'serendipitously', 'here', 'we', 'present', 'the', 'results', 'of', 'a', 'comprehensive', 'study', 'based', 'on', 'archival', 'spitzerirac', 'images', 'of', 'more', 'than', '1100', 'sn', 'positions', 'from', 'this', 'sample', '119', 'sne', 'of', 'various', 'subclasses', 'have', 'been', 'detected', 'including', '45', 'sne', 'with', 'previously', 'unpublished', 'midir', 'photometry', 'the', 'photometry', 'reveal', 'significant', 'amounts', 'of', 'warm', 'dust', 'in', 'some', 'cases', 'we', 'perform', 'an', 'indepth', 'analysis', 'to', 'constrain', 'the', 'origin', 'and', 'heating', 'mechanism', 'of', 'the', 'dust', 'and', 'present', 'the', 'resulting', 'statistics']] | [-0.010571109374081167, 0.07598561555470737, -0.09649100748493392, 0.08448109651559635, -0.13409917277886588, -0.09977889941347873, 0.053563083058414875, 0.4843788178911542, -0.14277460701174705, -0.30289356949437846, 0.07476791227647268, -0.34505933062447347, -0.03769271681633066, 0.21011809516930952, -0.03438042910527335, -0.054742153181680756, 0.10298955205225331, -0.18669112408670652, -0.03934292690417565, -0.3236213271384151, 0.2711023352273247, 0.11045659703805166, 0.1829633134061142, -0.02550274084924775, 0.03480623499456081, -0.1506749426918652, -0.14280312610790133, -0.08408499584433336, -0.1530445255464549, 0.03609210839768981, 0.2134354269491536, 0.14511598396142397, 0.23094672341283193, -0.3927843450292558, -0.3074951191268423, 0.12783020206124468, 0.1809414531025515, 0.05171182533890447, -0.05266641765783253, -0.25529892646762375, 0.03126593323010157, -0.1715466400498853, -0.14452911133275312, 0.0546933751046548, 0.08556814907625428, 0.0139573977315141, -0.17488741225028848, 0.1042495498625452, -0.007379896610098726, 0.16059814999427866, -0.14059367402360828, -0.12885058206259548, -0.07070690460694844, 0.02951944131294594, 0.025457961735425187, 0.018051453872912508, 0.09767104949911727, -0.1316155637792476, -0.013921065938056391, 0.4199522789567709, -0.055880827754770185, 0.1123559797566165, 0.21203477840240606, -0.19844667412998046, -0.1619057221995557, 0.2321882977232556, 0.12304426407824982, 0.12562908446690177, -0.1798407652114025, -0.028323143234421665, 0.015220525488257409, 0.20464560821625022, 0.070579773964196, 0.182811712010024, 0.270095197451027, 0.13195378241704447, -0.008141770508989473, 0.11878537997048731, -0.2971195228620405, -0.007340642223682474, -0.24755664401112454, -0.08124140475547928, -0.13522130472256857, 0.12350039390148596, -0.158896902523702, -0.08974208917249651, 0.3556196048890021, 0.13419861554661217, 0.20308432137210142, 0.014404361704638338, 0.30181273725157715, 0.03569195176584317, 0.11553986328106154, 0.11275638684712569, 0.38315704155744135, 0.11879511087694589, 0.16330900049549255, -0.1906260652674759, 0.0948285786435008, -0.030678872455952362] |
1,803.02572 | Quantum informational properties of the Landau-Streater channel | We study the Landau--Streater quantum channel $\Phi:
\mathcal{B}(\mathcal{H}_d) \mapsto \mathcal{B}(\mathcal{H}_d)$, whose Kraus
operators are proportional to the irreducible unitary representation of $SU(2)$
generators of dimension $d$. We establish $SU(2)$ covariance for all $d$ and
$U(3)$ covariance for $d=3$. Using the theory of angular momentum, we
explicitly find the spectrum and the minimal output entropy of $\Phi$. Negative
eigenvalues in the spectrum of $\Phi$ indicate that the channel cannot be
obtained as a result of Hermitian Markovian quantum dynamics. Degradability and
antidegradability of the Landau--Streater channel is fully analyzed. We
calculate classical and entanglement-assisted capacities of $\Phi$. Quantum
capacity of $\Phi$ vanishes if $d=2,3$ and is strictly positive if $d \geqslant
4$. We show that the channel $\Phi \otimes \Phi$ does not annihilate
entanglement and preserves entanglement of some states with Schmidt rank $2$ if
$d \geqslant 3$.
| quant-ph | we study the landaustreater quantum channel phi mathcalbmathcalh_d mapsto mathcalbmathcalh_d whose kraus operators are proportional to the irreducible unitary representation of su2 generators of dimension d we establish su2 covariance for all d and u3 covariance for d3 using the theory of angular momentum we explicitly find the spectrum and the minimal output entropy of phi negative eigenvalues in the spectrum of phi indicate that the channel cannot be obtained as a result of hermitian markovian quantum dynamics degradability and antidegradability of the landaustreater channel is fully analyzed we calculate classical and entanglementassisted capacities of phi quantum capacity of phi vanishes if d23 and is strictly positive if d geqslant 4 we show that the channel phi otimes phi does not annihilate entanglement and preserves entanglement of some states with schmidt rank 2 if d geqslant 3 | [['we', 'study', 'the', 'landaustreater', 'quantum', 'channel', 'phi', 'mathcalbmathcalh_d', 'mapsto', 'mathcalbmathcalh_d', 'whose', 'kraus', 'operators', 'are', 'proportional', 'to', 'the', 'irreducible', 'unitary', 'representation', 'of', 'su2', 'generators', 'of', 'dimension', 'd', 'we', 'establish', 'su2', 'covariance', 'for', 'all', 'd', 'and', 'u3', 'covariance', 'for', 'd3', 'using', 'the', 'theory', 'of', 'angular', 'momentum', 'we', 'explicitly', 'find', 'the', 'spectrum', 'and', 'the', 'minimal', 'output', 'entropy', 'of', 'phi', 'negative', 'eigenvalues', 'in', 'the', 'spectrum', 'of', 'phi', 'indicate', 'that', 'the', 'channel', 'can', 'not', 'be', 'obtained', 'as', 'a', 'result', 'of', 'hermitian', 'markovian', 'quantum', 'dynamics', 'degradability', 'and', 'antidegradability', 'of', 'the', 'landaustreater', 'channel', 'is', 'fully', 'analyzed', 'we', 'calculate', 'classical', 'and', 'entanglementassisted', 'capacities', 'of', 'phi', 'quantum', 'capacity', 'of', 'phi', 'vanishes', 'if', 'd23', 'and', 'is', 'strictly', 'positive', 'if', 'd', 'geqslant', '4', 'we', 'show', 'that', 'the', 'channel', 'phi', 'otimes', 'phi', 'does', 'not', 'annihilate', 'entanglement', 'and', 'preserves', 'entanglement', 'of', 'some', 'states', 'with', 'schmidt', 'rank', '2', 'if', 'd', 'geqslant', '3']] | [-0.18991894919578153, 0.20960744884587937, -0.07329428369012564, 0.04281364932982946, 0.00803285938124659, -0.24482418474074064, -0.004848973271297986, 0.3253265061214177, -0.2575948966611455, -0.1791790234300294, 0.055337480745459, -0.2979016374212815, -0.13370033742950313, 0.11313390479694162, -0.028513336401265948, 0.06668842544973787, 0.03307925072436068, 0.13620678353498675, -0.11707043606065103, -0.24647121638087416, 0.33163890518845796, -0.021328646556731425, 0.202439961417182, 0.07977533528456159, 0.1079181546463506, 0.021368643255911268, 0.002219038355205931, -0.05690555848396703, -0.16553230798938365, 0.04704223801564328, 0.21691738544970252, 0.1345966163616099, 0.163441927394649, -0.35480195062874414, -0.14054294280124022, 0.20924145564760097, 0.13755703008987372, 0.036556328584287145, 0.036202956308999945, -0.27433830498259015, 0.1291772681323172, -0.18277597570541634, -0.10882659680418559, -0.09821809449844729, 0.06729179513102064, -0.07469698804979727, -0.33596763727185663, 0.11043196480457129, 0.10261858020971681, 0.04505979536629435, -0.007592696939775748, -0.15663588144677454, -0.08186553987333857, 0.1097782839970566, -0.019400294533054998, 0.04632209550759602, 0.11271775545163164, -0.12431537340144946, -0.09329367077730444, 0.31124666506605253, -0.08428211300373216, -0.2637845227606039, 0.09799749181439071, -0.22733392246300355, -0.11715547544812199, 0.08838542969549881, 0.11696746469294625, 0.09444057895413621, -0.06320623707359851, 0.21253330585522465, -0.07189635739230843, 0.18043899326237725, 0.047381797815853756, 0.10321026468482702, 0.10261127471736174, -0.0003895199155685172, 0.08779162862694322, 0.15546930572209158, -0.02489635637946559, -0.10431930042000544, -0.3871394821873574, -0.2116039997529683, -0.22644025962122147, 0.15956200832703477, -0.10481424482279533, -0.0896026626917353, 0.35438757847104946, 0.037581814134601196, 0.1937826244619244, 0.10105220305580478, 0.2230287037977476, 0.12319924628775594, 0.028253618898843206, 0.16668475822045176, 0.17249218466515312, 0.2143416453236297, 0.03440613970299488, -0.2611406195158167, -0.03528141765681499, 0.07836290503115352] |
1,803.02573 | A note on Andrews' partitions with parts separated by parity | In this note we give three identities for partitions with parts separated by
parity, which were recently introduced by Andrews.
| math.NT | in this note we give three identities for partitions with parts separated by parity which were recently introduced by andrews | [['in', 'this', 'note', 'we', 'give', 'three', 'identities', 'for', 'partitions', 'with', 'parts', 'separated', 'by', 'parity', 'which', 'were', 'recently', 'introduced', 'by', 'andrews']] | [-0.13362217331305146, 0.1937061755452305, -0.10008766908431425, 0.009180765476776287, -0.048401832953095435, -0.1475320864468813, -0.01754881367087364, 0.28509617927484215, -0.21230903137475252, -0.4282654646784067, 0.060316064109792934, -0.277320915274322, -0.18716386603191495, 0.11324314549565315, -0.07116020880639554, -0.009599042870104314, -0.050500200130045414, -0.0780872041825205, -0.021887395693920553, -0.39757265681400894, 0.43741717264056207, -0.0433427769690752, 0.14008543635718523, 0.04280709018930793, 0.07089829719625414, 0.04782733810134232, -0.09558415971696377, 0.04715223703533411, -0.1448958626948297, 0.13057188568636774, 0.2851462159305811, 0.08859404996037483, 0.2191559578292072, -0.4289309695363045, -0.09863074293825776, 0.07580371473450213, 0.13958568510133773, 0.03693038487690501, -0.10943969767540693, -0.3669072937220335, 0.10767006818205119, -0.16605230513960123, -0.07604894959367811, -0.10558557151816786, 0.12444669613614678, 0.02948461091145873, -0.24748456925153733, 0.05738149839453399, 0.0813646312977653, 0.0916165138129145, 0.019192064041271807, -0.21899098763242364, 0.10073118316940963, 0.08687363637145609, 0.07812962154857814, -0.029531290754675865, -0.09063481981866062, 0.02088839152129367, -0.19530361560173332, 0.23715708255767823, 0.08741009896621108, -0.23198194224387408, 0.09825803730636835, -0.0876907472498715, -0.22908992420416324, 0.0767137106275186, 0.02293793132994324, 0.09817671552300453, -0.1999927680939436, 0.044347911095246675, -0.13986965389922262, 0.03559604790061712, 0.25363666759803893, -0.006666264124214649, 0.18503069980069994, -0.023183201858773827, 0.0013531882781535388, 0.3098258148878813, 0.0003895174711942673, -0.04337907480075955, -0.25838832622393965, -0.1500008990522474, -0.16187252863310278, 0.03232009708881378, 0.015084601542912423, -0.07600301401689649, 0.4346022479236126, 0.07987645729444921, 0.23466618962120264, 0.09111267719999887, 0.23714184599230065, 0.1306959408801049, 0.13129513177555055, 0.026302068633958696, 0.1657177294837311, 0.13711843102937565, 0.11365933596680407, -0.060101986117661, 0.03571058730594814, 0.2503533103968948] |
1,803.02574 | Generation of electron vortex states in ionization by intense and short
laser pulses | The generation of electron vortex states in ionization by intense and short
laser pulses is analyzed under the scope of the lowest-order Born
approximation. For near infrared laser fields and nonrelativistic intensities
of the order of $10^{16}$~W/cm$^2$, we show that one has to modify the
nonrelativistic treatment of ionization by accounting for recoil and mass
relativistic corrections. By using the corrected quasi-relativistic theory, the
requirements for the observation of electron vortex states with non-negligible
probability and large topological charge are determined.
| physics.atom-ph quant-ph | the generation of electron vortex states in ionization by intense and short laser pulses is analyzed under the scope of the lowestorder born approximation for near infrared laser fields and nonrelativistic intensities of the order of 1016wcm2 we show that one has to modify the nonrelativistic treatment of ionization by accounting for recoil and mass relativistic corrections by using the corrected quasirelativistic theory the requirements for the observation of electron vortex states with nonnegligible probability and large topological charge are determined | [['the', 'generation', 'of', 'electron', 'vortex', 'states', 'in', 'ionization', 'by', 'intense', 'and', 'short', 'laser', 'pulses', 'is', 'analyzed', 'under', 'the', 'scope', 'of', 'the', 'lowestorder', 'born', 'approximation', 'for', 'near', 'infrared', 'laser', 'fields', 'and', 'nonrelativistic', 'intensities', 'of', 'the', 'order', 'of', '1016wcm2', 'we', 'show', 'that', 'one', 'has', 'to', 'modify', 'the', 'nonrelativistic', 'treatment', 'of', 'ionization', 'by', 'accounting', 'for', 'recoil', 'and', 'mass', 'relativistic', 'corrections', 'by', 'using', 'the', 'corrected', 'quasirelativistic', 'theory', 'the', 'requirements', 'for', 'the', 'observation', 'of', 'electron', 'vortex', 'states', 'with', 'nonnegligible', 'probability', 'and', 'large', 'topological', 'charge', 'are', 'determined']] | [-0.08528528913739138, 0.22454034315887839, -0.04931499178055674, 0.1027535552289919, 0.062440253677777946, -0.09540349099552259, 0.028467914239445235, 0.36898907835129646, -0.16569813507376238, -0.30323648287449034, -0.017938867678458335, -0.2701471102889627, 0.005001116776838899, 0.19116174162190874, 0.030920249706832693, 0.06314649113337509, 0.014507418510038405, -0.01708767088712193, -0.0601193509035511, -0.1680665917810984, 0.345591162009805, 0.09603473769966513, 0.24620459458092228, 0.10734832574016764, 0.09426112091168762, 0.056760763633064926, -0.01793420245521702, 0.0161777054934646, -0.11638398665572822, 0.07449348303925944, 0.20021972747927066, 0.00917771723907208, 0.2421290734302602, -0.48333758420776574, -0.2197974552633241, -0.018053675582632423, 0.10121156924287789, 0.1624200572958216, -0.08380312486551703, -0.30364048851188274, 0.03446790485177189, -0.18236873556161298, -0.18640916716540232, -0.08625298294937238, 0.043193702382268384, 0.08505853270180523, -0.2695089905813802, 0.06231891215429641, 0.013031691512151156, -0.014153072924818844, -0.07029846379882657, -0.06560744094895199, -0.03591942808125168, 0.04013105435296893, 0.05909296722093131, 0.026029818551614882, 0.17635019600202212, -0.18367215058533476, -0.10547130226623266, 0.43354356767376884, -0.10195824988913955, -0.09553387466112326, 0.10514975903206505, -0.23475334486574867, -0.07093368172063493, 0.24134863992221653, 0.11853187055094168, 0.11675277280737646, -0.11921358804684132, 0.081874159394647, 0.025070225435774772, 0.11591612892225385, 0.12694254482048564, 0.0969571751280455, 0.23612015672842973, 0.12053022497566417, -0.0013798028929159045, 0.06647064939024858, -0.17845693057752215, -0.08353599522961304, -0.32071108667878434, -0.10081651084256009, -0.1864960618549958, 0.05457892225822434, -0.01900046386217582, -0.13163470765575766, 0.3959689387702383, 0.14388911153073422, 0.08170184788396, -0.036321239965036514, 0.32021399969235065, 0.2238886091974564, 0.05035485252737999, 0.04931859909556806, 0.3112743510893779, 0.18469564307888503, 0.055101739017118234, -0.29833080170792525, 0.0012521550059318542, 0.07581026748521254] |
1,803.02575 | Scalable Stochastic Kriging with Markovian Covariances | Stochastic kriging is a popular technique for simulation metamodeling due to
its exibility and analytical tractability. Its computational bottleneck is the
inversion of a covariance matrix, which takes $O(n^3)$ time in general and
becomes prohibitive for large n, where n is the number of design points.
Moreover, the covariance matrix is often ill-conditioned for large n, and thus
the inversion is prone to numerical instability, resulting in erroneous
parameter estimation and prediction. These two numerical issues preclude the
use of stochastic kriging at a large scale. This paper presents a novel
approach to address them. We construct a class of covariance functions, called
Markovian covariance functions (MCFs), which have two properties: (i) the
associated covariance matrices can be inverted analytically, and (ii) the
inverse matrices are sparse. With the use of MCFs, the inversion-related
computational time is reduced to $O(n^2)$ in general, and can be further
reduced by orders of magnitude with additional assumptions on the simulation
errors and design points. The analytical invertibility also enhance the
numerical stability dramatically. The key in our approach is that we identify a
general functional form of covariance functions that can induce sparsity in the
corresponding inverse matrices. We also establish a connection between MCFs and
linear ordinary differential equations. Such a connection provides a flexible,
principled approach to constructing a wide class of MCFs. Extensive numerical
experiments demonstrate that stochastic kriging with MCFs can handle
large-scale problems in an both computationally efficient and numerically
stable manner.
| stat.ME | stochastic kriging is a popular technique for simulation metamodeling due to its exibility and analytical tractability its computational bottleneck is the inversion of a covariance matrix which takes on3 time in general and becomes prohibitive for large n where n is the number of design points moreover the covariance matrix is often illconditioned for large n and thus the inversion is prone to numerical instability resulting in erroneous parameter estimation and prediction these two numerical issues preclude the use of stochastic kriging at a large scale this paper presents a novel approach to address them we construct a class of covariance functions called markovian covariance functions mcfs which have two properties i the associated covariance matrices can be inverted analytically and ii the inverse matrices are sparse with the use of mcfs the inversionrelated computational time is reduced to on2 in general and can be further reduced by orders of magnitude with additional assumptions on the simulation errors and design points the analytical invertibility also enhance the numerical stability dramatically the key in our approach is that we identify a general functional form of covariance functions that can induce sparsity in the corresponding inverse matrices we also establish a connection between mcfs and linear ordinary differential equations such a connection provides a flexible principled approach to constructing a wide class of mcfs extensive numerical experiments demonstrate that stochastic kriging with mcfs can handle largescale problems in an both computationally efficient and numerically stable manner | [['stochastic', 'kriging', 'is', 'a', 'popular', 'technique', 'for', 'simulation', 'metamodeling', 'due', 'to', 'its', 'exibility', 'and', 'analytical', 'tractability', 'its', 'computational', 'bottleneck', 'is', 'the', 'inversion', 'of', 'a', 'covariance', 'matrix', 'which', 'takes', 'on3', 'time', 'in', 'general', 'and', 'becomes', 'prohibitive', 'for', 'large', 'n', 'where', 'n', 'is', 'the', 'number', 'of', 'design', 'points', 'moreover', 'the', 'covariance', 'matrix', 'is', 'often', 'illconditioned', 'for', 'large', 'n', 'and', 'thus', 'the', 'inversion', 'is', 'prone', 'to', 'numerical', 'instability', 'resulting', 'in', 'erroneous', 'parameter', 'estimation', 'and', 'prediction', 'these', 'two', 'numerical', 'issues', 'preclude', 'the', 'use', 'of', 'stochastic', 'kriging', 'at', 'a', 'large', 'scale', 'this', 'paper', 'presents', 'a', 'novel', 'approach', 'to', 'address', 'them', 'we', 'construct', 'a', 'class', 'of', 'covariance', 'functions', 'called', 'markovian', 'covariance', 'functions', 'mcfs', 'which', 'have', 'two', 'properties', 'i', 'the', 'associated', 'covariance', 'matrices', 'can', 'be', 'inverted', 'analytically', 'and', 'ii', 'the', 'inverse', 'matrices', 'are', 'sparse', 'with', 'the', 'use', 'of', 'mcfs', 'the', 'inversionrelated', 'computational', 'time', 'is', 'reduced', 'to', 'on2', 'in', 'general', 'and', 'can', 'be', 'further', 'reduced', 'by', 'orders', 'of', 'magnitude', 'with', 'additional', 'assumptions', 'on', 'the', 'simulation', 'errors', 'and', 'design', 'points', 'the', 'analytical', 'invertibility', 'also', 'enhance', 'the', 'numerical', 'stability', 'dramatically', 'the', 'key', 'in', 'our', 'approach', 'is', 'that', 'we', 'identify', 'a', 'general', 'functional', 'form', 'of', 'covariance', 'functions', 'that', 'can', 'induce', 'sparsity', 'in', 'the', 'corresponding', 'inverse', 'matrices', 'we', 'also', 'establish', 'a', 'connection', 'between', 'mcfs', 'and', 'linear', 'ordinary', 'differential', 'equations', 'such', 'a', 'connection', 'provides', 'a', 'flexible', 'principled', 'approach', 'to', 'constructing', 'a', 'wide', 'class', 'of', 'mcfs', 'extensive', 'numerical', 'experiments', 'demonstrate', 'that', 'stochastic', 'kriging', 'with', 'mcfs', 'can', 'handle', 'largescale', 'problems', 'in', 'an', 'both', 'computationally', 'efficient', 'and', 'numerically', 'stable', 'manner']] | [-0.09363146862513366, 0.051975873609443786, -0.05671577695891292, 0.09207876708498416, -0.09427063582932631, -0.136463465288841, 0.03475663460716375, 0.37572919687739126, -0.3028490816840879, -0.29425900413581924, 0.14369122002469262, -0.22480388149813607, -0.21913997972970484, 0.17672168659314574, -0.06171679442533801, 0.11053440874632171, 0.07372543912518907, -0.04389427287011587, -0.1458613194233964, -0.2354311708575536, 0.2832506881507474, 0.07218470108223918, 0.2728026249147032, 0.0018941447265262222, 0.10416245129373339, -0.022732888965449706, -0.05453236286354504, 0.025929528976735033, -0.08107986813168584, 0.13857719991854373, 0.3000365068499811, 0.13352131352035534, 0.3272006236698954, -0.43739375026720295, -0.17826057528624686, 0.12496114647736459, 0.1463410139536349, 0.10941784538485784, -0.04602714745881641, -0.24405372561886907, 0.10890351947101883, -0.14807030711411173, -0.11658822345487972, -0.14670610257880493, -0.004148962763770495, -0.006716994977835949, -0.3590874729999973, 0.08066010609371664, 0.030548730354426512, 0.024421405204315, 0.00801972751582325, -0.11095109216328959, 0.0461677350611675, 0.07640535821524974, 0.03548528440157419, -0.03450162214209774, 0.07479141172933787, -0.08326402038945184, -0.07903198563252334, 0.34381981333526074, -0.019510075258313383, -0.2803669565452125, 0.17785432215189798, -0.09101340912067842, -0.13102101133235658, 0.14253010420864562, 0.21029785376256754, 0.1103147779181293, -0.13380532240909007, 0.13408366377813236, -0.045806652029838274, 0.15786317727574503, 0.006712480972294883, -0.00037470215543723234, 0.11594470145196152, 0.16752732789370042, 0.11241926387845397, 0.1396965811425751, -0.0692063275318154, -0.10602781951806887, -0.2843507569658842, -0.14560041796902784, -0.19989256055090468, 0.038392645517618534, -0.1673122700322357, -0.18741574389821708, 0.38863427751820245, 0.1763770029019687, 0.19570998408843154, 0.10678845805253971, 0.3126300956858437, 0.17128435435557332, 0.04980585203647859, 0.07919461184867309, 0.18065831933789522, 0.14043027147592752, 0.052028237403190306, -0.22468219126225927, 0.08632740143632876, 0.053725910377822844] |
1,803.02576 | Compact Representations of Event Sequences | We introduce a new technique for the efficient management of large sequences
of multidimensional data, which takes advantage of regularities that arise in
real-world datasets and supports different types of aggregation queries. More
importantly, our representation is flexible in the sense that the relevant
dimensions and queries may be used to guide the construction process, easily
providing a space-time tradeoff depending on the relevant queries in the
domain. We provide two alternative representations for sequences of
multidimensional data and describe the techniques to efficiently store the
datasets and to perform aggregation queries over the compressed representation.
We perform experimental evaluation on realistic datasets, showing the space
efficiency and query capabilities of our proposal.
| cs.DS | we introduce a new technique for the efficient management of large sequences of multidimensional data which takes advantage of regularities that arise in realworld datasets and supports different types of aggregation queries more importantly our representation is flexible in the sense that the relevant dimensions and queries may be used to guide the construction process easily providing a spacetime tradeoff depending on the relevant queries in the domain we provide two alternative representations for sequences of multidimensional data and describe the techniques to efficiently store the datasets and to perform aggregation queries over the compressed representation we perform experimental evaluation on realistic datasets showing the space efficiency and query capabilities of our proposal | [['we', 'introduce', 'a', 'new', 'technique', 'for', 'the', 'efficient', 'management', 'of', 'large', 'sequences', 'of', 'multidimensional', 'data', 'which', 'takes', 'advantage', 'of', 'regularities', 'that', 'arise', 'in', 'realworld', 'datasets', 'and', 'supports', 'different', 'types', 'of', 'aggregation', 'queries', 'more', 'importantly', 'our', 'representation', 'is', 'flexible', 'in', 'the', 'sense', 'that', 'the', 'relevant', 'dimensions', 'and', 'queries', 'may', 'be', 'used', 'to', 'guide', 'the', 'construction', 'process', 'easily', 'providing', 'a', 'spacetime', 'tradeoff', 'depending', 'on', 'the', 'relevant', 'queries', 'in', 'the', 'domain', 'we', 'provide', 'two', 'alternative', 'representations', 'for', 'sequences', 'of', 'multidimensional', 'data', 'and', 'describe', 'the', 'techniques', 'to', 'efficiently', 'store', 'the', 'datasets', 'and', 'to', 'perform', 'aggregation', 'queries', 'over', 'the', 'compressed', 'representation', 'we', 'perform', 'experimental', 'evaluation', 'on', 'realistic', 'datasets', 'showing', 'the', 'space', 'efficiency', 'and', 'query', 'capabilities', 'of', 'our', 'proposal']] | [-0.08459535934765623, 0.01258650261381295, -0.09156619416615736, 0.10620557689023283, -0.11530296711778615, -0.11817389078833888, 0.08812267780798462, 0.40655980862479296, -0.2777380899328376, -0.33007601447469365, 0.0996290598800241, -0.24593456733180621, -0.14054617477350134, 0.25818660820677747, -0.07353964986988401, 0.053556318537010685, 0.12549810197237318, 0.0070715693293852255, -0.04044734002956379, -0.3033770216624788, 0.3239341534332133, 0.04047077154097831, 0.3278931748715386, 0.025011647377262074, 0.09487247246367016, 0.01823360644346845, -0.07420937507413328, -0.006221399432618946, -0.11541809414915712, 0.2088828471950791, 0.3115414231356266, 0.24497266252632294, 0.2397945186646606, -0.43291310058593485, -0.21095797375634734, 0.07020176759203978, 0.15953438122451832, 0.1069945110366381, -0.033656056761866296, -0.31301625523782145, 0.08110207885882892, -0.1324237670782393, -0.016750841675556998, -0.2060390531303839, 0.014848495528629395, 0.002010375145921665, -0.35424940671310223, 0.019735574413222812, 0.05435575681235806, 0.021289604551167088, -0.04067532039057892, -0.06014631838595445, 0.0717594276874664, 0.16650616020722464, 0.0072342050197406515, -0.007475171674998988, 0.11281888200118478, -0.09442560565946377, -0.17366575334423048, 0.38498450647545074, -0.022354867807960352, -0.2388427958255057, 0.21801642010573594, -0.07548315914562054, -0.15162935132671773, 0.10761563150434697, 0.22074792328068113, 0.13986983316521928, -0.11875424539027489, 0.07188463167120512, -0.04834602612680632, 0.19080865827689886, 0.0576219771827975, 0.05604101881483751, 0.15736213507773603, 0.23692291745899524, 0.040139190687806206, 0.16988619511629727, -0.0821729722202022, -0.10266244766483726, -0.24494102112619223, -0.17112477792378522, -0.17345648539557526, -0.046720981435124986, -0.1788429824084989, -0.16007442480628997, 0.382086431966122, 0.2542292730114217, 0.20402311989460634, 0.07610615321014703, 0.3050872569046585, 0.026111597539362524, 0.10040353450602728, 0.06612730296988008, 0.0934495381419588, -0.020534633271462096, 0.14074982156610297, -0.14957750933471473, 0.05918250084994773, 0.006681650778097389] |
1,803.02577 | The Bronstein hypercube of quantum gravity | We argue for enlarging the traditional view of quantum gravity, based on
"quantizing GR", to include explicitly the non-spatiotemporal nature of the
fundamental building blocks suggested by several modern quantum gravity
approaches (and some semi-classical arguments), and to focus more on the issue
of the emergence of continuum spacetime and geometry from their collective
dynamics. We also discuss some recent developments in quantum gravity research,
aiming at realising these ideas, in the context of group field theory, random
tensor models, simplicial quantum gravity, loop quantum gravity, spin foam
models.
| physics.hist-ph gr-qc hep-th | we argue for enlarging the traditional view of quantum gravity based on quantizing gr to include explicitly the nonspatiotemporal nature of the fundamental building blocks suggested by several modern quantum gravity approaches and some semiclassical arguments and to focus more on the issue of the emergence of continuum spacetime and geometry from their collective dynamics we also discuss some recent developments in quantum gravity research aiming at realising these ideas in the context of group field theory random tensor models simplicial quantum gravity loop quantum gravity spin foam models | [['we', 'argue', 'for', 'enlarging', 'the', 'traditional', 'view', 'of', 'quantum', 'gravity', 'based', 'on', 'quantizing', 'gr', 'to', 'include', 'explicitly', 'the', 'nonspatiotemporal', 'nature', 'of', 'the', 'fundamental', 'building', 'blocks', 'suggested', 'by', 'several', 'modern', 'quantum', 'gravity', 'approaches', 'and', 'some', 'semiclassical', 'arguments', 'and', 'to', 'focus', 'more', 'on', 'the', 'issue', 'of', 'the', 'emergence', 'of', 'continuum', 'spacetime', 'and', 'geometry', 'from', 'their', 'collective', 'dynamics', 'we', 'also', 'discuss', 'some', 'recent', 'developments', 'in', 'quantum', 'gravity', 'research', 'aiming', 'at', 'realising', 'these', 'ideas', 'in', 'the', 'context', 'of', 'group', 'field', 'theory', 'random', 'tensor', 'models', 'simplicial', 'quantum', 'gravity', 'loop', 'quantum', 'gravity', 'spin', 'foam', 'models']] | [-0.12065095940913503, 0.1637222162562977, -0.11648172794401729, 0.08782869507297036, -0.09495408960691329, -0.16219886085751017, -0.010620089236050425, 0.28937319413826834, -0.22522139758541343, -0.2677711907962567, 0.0859921344927397, -0.2187184633142995, -0.2366695323896207, 0.1905550660167852, -0.09647884788619501, 0.05895550304165717, -0.026479528233241498, 0.01641163702928618, -0.08096272889210769, -0.2515550157411045, 0.35730406366225875, 0.07523291202633527, 0.3037128398466981, 0.037365110996545534, 0.073848623210457, 0.001613540968627491, -0.06272705818076482, 0.04894854487809405, -0.1508833425566868, 0.16731697500662437, 0.23961347203253405, 0.10674942411440477, 0.25675498424202536, -0.5276858500529373, -0.32442809733447064, 0.0021720038768783044, 0.0900267506230183, 0.20344778780270828, -0.043277792879308344, -0.32020707564491235, 0.020061763652255028, -0.16645415246570378, -0.12578818284686696, -0.07441994456804535, -0.011622593103740574, -0.10284465749151586, -0.09728418807028218, 0.016663734438460257, 0.063641764553201, 0.05092451597951102, -0.006559397768244942, -0.10210806561445587, 0.05358930506345847, 0.1065807062243059, 0.04845157482666539, 0.014550710205522397, 0.16305613839538413, -0.18983613423417123, -0.20593778354840436, 0.4108684634727039, -0.04737034043966887, -0.207966411099089, 0.18982477138457254, -0.14596927817387695, -0.19456768602530441, -0.005968016304148968, 0.13085857785851016, 0.11297467817667495, -0.10068597911407104, 0.17275658911002506, 0.03738163911287537, 0.07313191708637758, 0.029731681654125118, 0.11655964534939005, 0.3428273471176959, 0.1117187776717912, -0.007525112464228708, 0.07847056719422173, -0.04479256748179958, -0.22779045146209806, -0.33693195498558914, -0.1441014420575975, -0.14361941645947401, 0.09494017928922444, -0.1311482564447084, -0.15159610847241423, 0.3527160282717662, 0.2076847397021196, 0.10483416202517352, 0.03791382529490282, 0.25364259626255947, 0.06414690829834409, 0.041931502361457505, 0.0442535986632025, 0.2435759831372952, 0.2327275214994096, 0.07640320230850929, -0.23756660210502364, -0.07478287263140292, 0.12447969893809785] |
1,803.02578 | Generating Goal-Directed Visuomotor Plans Based on Learning Using a
Predictive Coding-type Deep Visuomotor Recurrent Neural Network Model | The current paper presents how a predictive coding type deep recurrent neural
networks can generate vision-based goal-directed plans based on prior learning
experience by examining experiment results using a real arm robot. The proposed
deep recurrent neural network learns to predict visuo-proprioceptive sequences
by extracting an adequate predictive model from various visuomotor experiences
related to object-directed behaviors. The predictive model was developed in
terms of mapping from intention state space to expected visuo-proprioceptive
sequences space through iterative learning. Our arm robot experiments adopted
with three different tasks with different levels of difficulty showed that the
error minimization principle in the predictive coding framework applied to
inference of the optimal intention states for given goal states can generate
goal-directed plans even for unlearned goal states with generalization. It was,
however, shown that sufficient generalization requires relatively large number
of learning trajectories. The paper discusses possible countermeasure to
overcome this problem.
| cs.CV | the current paper presents how a predictive coding type deep recurrent neural networks can generate visionbased goaldirected plans based on prior learning experience by examining experiment results using a real arm robot the proposed deep recurrent neural network learns to predict visuoproprioceptive sequences by extracting an adequate predictive model from various visuomotor experiences related to objectdirected behaviors the predictive model was developed in terms of mapping from intention state space to expected visuoproprioceptive sequences space through iterative learning our arm robot experiments adopted with three different tasks with different levels of difficulty showed that the error minimization principle in the predictive coding framework applied to inference of the optimal intention states for given goal states can generate goaldirected plans even for unlearned goal states with generalization it was however shown that sufficient generalization requires relatively large number of learning trajectories the paper discusses possible countermeasure to overcome this problem | [['the', 'current', 'paper', 'presents', 'how', 'a', 'predictive', 'coding', 'type', 'deep', 'recurrent', 'neural', 'networks', 'can', 'generate', 'visionbased', 'goaldirected', 'plans', 'based', 'on', 'prior', 'learning', 'experience', 'by', 'examining', 'experiment', 'results', 'using', 'a', 'real', 'arm', 'robot', 'the', 'proposed', 'deep', 'recurrent', 'neural', 'network', 'learns', 'to', 'predict', 'visuoproprioceptive', 'sequences', 'by', 'extracting', 'an', 'adequate', 'predictive', 'model', 'from', 'various', 'visuomotor', 'experiences', 'related', 'to', 'objectdirected', 'behaviors', 'the', 'predictive', 'model', 'was', 'developed', 'in', 'terms', 'of', 'mapping', 'from', 'intention', 'state', 'space', 'to', 'expected', 'visuoproprioceptive', 'sequences', 'space', 'through', 'iterative', 'learning', 'our', 'arm', 'robot', 'experiments', 'adopted', 'with', 'three', 'different', 'tasks', 'with', 'different', 'levels', 'of', 'difficulty', 'showed', 'that', 'the', 'error', 'minimization', 'principle', 'in', 'the', 'predictive', 'coding', 'framework', 'applied', 'to', 'inference', 'of', 'the', 'optimal', 'intention', 'states', 'for', 'given', 'goal', 'states', 'can', 'generate', 'goaldirected', 'plans', 'even', 'for', 'unlearned', 'goal', 'states', 'with', 'generalization', 'it', 'was', 'however', 'shown', 'that', 'sufficient', 'generalization', 'requires', 'relatively', 'large', 'number', 'of', 'learning', 'trajectories', 'the', 'paper', 'discusses', 'possible', 'countermeasure', 'to', 'overcome', 'this', 'problem']] | [-0.04351646739854226, 0.0331681728422228, -0.08348975226446684, 0.08783937073422822, -0.12040101741818157, -0.19571533300788016, 0.05975754535599687, 0.43980201872418057, -0.2752324144129415, -0.3518130349976992, 0.0438068533018137, -0.22147312105910197, -0.2497129554835123, 0.19618490658939589, -0.18309734772097924, 0.14327896243225582, 0.12173305543743677, 0.04787795105949044, -0.019962248284247, -0.25434537751071556, 0.2990046919864678, 0.061965909509249406, 0.36710874869085447, -0.029992195459812677, 0.1718652207070861, -0.006187012261786574, -0.007461481766989203, -0.028145099613686546, -0.06178597172903529, 0.182110389727215, 0.34904109232750646, 0.22361769694897876, 0.34354297246003673, -0.4464133980595884, -0.22864778346155543, 0.10446190339752247, 0.13996908993057505, 0.1002893497462611, -0.030699088213795394, -0.35289035953984066, 0.07848622935282923, -0.18691210093203228, -0.043194555476106504, -0.1420174603967147, -0.04255917449827885, -0.014088018147614659, -0.2923115642514785, -0.027479795473187255, 0.04711319848177703, 0.045532961622410696, -0.07792427741632973, -0.09518674912160842, 0.05375351527520154, 0.17939812803288568, 0.03586840984801686, 0.08924991859286721, 0.1500614009910842, -0.16092117755544824, -0.20110746105579105, 0.3243528643207675, -0.030813045595218806, -0.2133520367151013, 0.18882399927226928, -0.028187678881442628, -0.13534675811801256, 0.10187800294354658, 0.2344688871305914, 0.10618487751816173, -0.17955578936301675, -0.01733112007983633, -0.018106831417016283, 0.17440634038821617, 0.016607278361334465, -0.044944577290349313, 0.18759082174054473, 0.25660279664412344, 0.05807553006436776, 0.14552468362711118, -0.08688150105425282, -0.12160353036794018, -0.22366883250494562, -0.056600346932788634, -0.17173431331065256, -0.017487519486756944, -0.058581624073102266, -0.08324451270773597, 0.4066654721816146, 0.22101504170977687, 0.16656669198749335, 0.1409648859533607, 0.3009436517211332, 0.03171721269963372, 0.07537965087780125, 0.09013685289254361, 0.17965606537118955, 0.03737531586965496, 0.12084635409425844, -0.20501339762012247, 0.14393380624745544, 0.05589815549476928] |
1,803.02579 | Concurrent Spatial and Channel Squeeze & Excitation in Fully
Convolutional Networks | Fully convolutional neural networks (F-CNNs) have set the state-of-the-art in
image segmentation for a plethora of applications. Architectural innovations
within F-CNNs have mainly focused on improving spatial encoding or network
connectivity to aid gradient flow. In this paper, we explore an alternate
direction of recalibrating the feature maps adaptively, to boost meaningful
features, while suppressing weak ones. We draw inspiration from the recently
proposed squeeze & excitation (SE) module for channel recalibration of feature
maps for image classification. Towards this end, we introduce three variants of
SE modules for image segmentation, (i) squeezing spatially and exciting
channel-wise (cSE), (ii) squeezing channel-wise and exciting spatially (sSE)
and (iii) concurrent spatial and channel squeeze & excitation (scSE). We
effectively incorporate these SE modules within three different
state-of-the-art F-CNNs (DenseNet, SD-Net, U-Net) and observe consistent
improvement of performance across all architectures, while minimally effecting
model complexity. Evaluations are performed on two challenging applications:
whole brain segmentation on MRI scans (Multi-Atlas Labelling Challenge Dataset)
and organ segmentation on whole body contrast enhanced CT scans (Visceral
Dataset).
| cs.CV | fully convolutional neural networks fcnns have set the stateoftheart in image segmentation for a plethora of applications architectural innovations within fcnns have mainly focused on improving spatial encoding or network connectivity to aid gradient flow in this paper we explore an alternate direction of recalibrating the feature maps adaptively to boost meaningful features while suppressing weak ones we draw inspiration from the recently proposed squeeze excitation se module for channel recalibration of feature maps for image classification towards this end we introduce three variants of se modules for image segmentation i squeezing spatially and exciting channelwise cse ii squeezing channelwise and exciting spatially sse and iii concurrent spatial and channel squeeze excitation scse we effectively incorporate these se modules within three different stateoftheart fcnns densenet sdnet unet and observe consistent improvement of performance across all architectures while minimally effecting model complexity evaluations are performed on two challenging applications whole brain segmentation on mri scans multiatlas labelling challenge dataset and organ segmentation on whole body contrast enhanced ct scans visceral dataset | [['fully', 'convolutional', 'neural', 'networks', 'fcnns', 'have', 'set', 'the', 'stateoftheart', 'in', 'image', 'segmentation', 'for', 'a', 'plethora', 'of', 'applications', 'architectural', 'innovations', 'within', 'fcnns', 'have', 'mainly', 'focused', 'on', 'improving', 'spatial', 'encoding', 'or', 'network', 'connectivity', 'to', 'aid', 'gradient', 'flow', 'in', 'this', 'paper', 'we', 'explore', 'an', 'alternate', 'direction', 'of', 'recalibrating', 'the', 'feature', 'maps', 'adaptively', 'to', 'boost', 'meaningful', 'features', 'while', 'suppressing', 'weak', 'ones', 'we', 'draw', 'inspiration', 'from', 'the', 'recently', 'proposed', 'squeeze', 'excitation', 'se', 'module', 'for', 'channel', 'recalibration', 'of', 'feature', 'maps', 'for', 'image', 'classification', 'towards', 'this', 'end', 'we', 'introduce', 'three', 'variants', 'of', 'se', 'modules', 'for', 'image', 'segmentation', 'i', 'squeezing', 'spatially', 'and', 'exciting', 'channelwise', 'cse', 'ii', 'squeezing', 'channelwise', 'and', 'exciting', 'spatially', 'sse', 'and', 'iii', 'concurrent', 'spatial', 'and', 'channel', 'squeeze', 'excitation', 'scse', 'we', 'effectively', 'incorporate', 'these', 'se', 'modules', 'within', 'three', 'different', 'stateoftheart', 'fcnns', 'densenet', 'sdnet', 'unet', 'and', 'observe', 'consistent', 'improvement', 'of', 'performance', 'across', 'all', 'architectures', 'while', 'minimally', 'effecting', 'model', 'complexity', 'evaluations', 'are', 'performed', 'on', 'two', 'challenging', 'applications', 'whole', 'brain', 'segmentation', 'on', 'mri', 'scans', 'multiatlas', 'labelling', 'challenge', 'dataset', 'and', 'organ', 'segmentation', 'on', 'whole', 'body', 'contrast', 'enhanced', 'ct', 'scans', 'visceral', 'dataset']] | [-0.04506669893375868, -0.01730129179968733, 0.005869742459479786, 0.013656897876775388, -0.06678852012667519, -0.21270033007641956, -0.0030224715922986703, 0.4976266213202265, -0.2722505721313185, -0.3084339191696259, 0.06597028744128704, -0.25473873592780893, -0.155377839505948, 0.16516432308553328, -0.12190378087772046, 0.06844089950156569, 0.14907179736482673, -0.024807007575528863, -0.05480968677741889, -0.24522632938401895, 0.2945374040745474, 0.038082616546979316, 0.39918294545130795, 0.002035077559326351, 0.14655690608110786, -0.031124189845975158, -0.06576352049017975, -0.01857031228686559, -0.07128363373167895, 0.16553905020473447, 0.3023786810612493, 0.17756277411355026, 0.2957764893533254, -0.43699674908424446, -0.27318379995633557, 0.05440475685059054, 0.21623307454796542, 0.10172536494017485, -0.051023676186888176, -0.3408901379526367, 0.06563040746318055, -0.14972177148967453, 0.06509376904574504, -0.12570130729706153, -0.02962080665902626, -0.046010864032163784, -0.27056593968692794, 0.07089347343825729, 0.06451092031646587, 0.10947760882285926, -0.08470234671640678, -0.1317073982264075, 0.0026882818263553126, 0.1645236024564165, -0.04134787379739222, 0.09475110760289272, 0.16612238539334595, -0.2359913874854273, -0.11574501862967133, 0.2544167779016477, -0.023633067376950215, -0.20398361208854165, 0.1890326968742777, -0.05570419940866045, -0.1642060147270494, 0.1317985135753303, 0.21871992084473238, 0.08415042625784257, -0.14705632851712583, -0.0163197513503028, 0.021788416995209527, 0.1804533876125982, 0.1067548696469714, 0.032205088951999666, 0.17798160132814264, 0.25306468089586454, 0.02427380249185278, 0.14418411741485082, -0.19770212610907986, -0.0512638810592202, -0.1741482314320292, -0.127530098314116, -0.11929136523549837, -0.05550894713871038, -0.11145951840754449, -0.13011814264743177, 0.4696045455759799, 0.2238781085684234, 0.19046647041022072, 0.073817017516941, 0.3229089524850426, -0.03378637915967272, 0.14452491633831, 0.05491905060965987, 0.19612166575519863, 0.04877108383714359, 0.12126286955792788, -0.16142951619822377, 0.04919840220758725, 0.0638520118336816] |
1,803.0258 | Bursty Human Dynamics | Bursty dynamics is a common temporal property of various complex systems in
Nature but it also characterises the dynamics of human actions and
interactions. At the phenomenological level it is a feature of all systems that
evolve heterogeneously over time by alternating between periods of low and high
event frequencies. In such systems, bursts are identified as periods in which
the events occur with a rapid pace within a short time-interval while these
periods are separated by long periods of time with low frequency of events. As
such dynamical patterns occur in a wide range of natural phenomena, their
observation, characterisation, and modelling have been a long standing
challenge in several fields of research. However, due to some recent
developments in communication and data collection techniques it has become
possible to follow digital traces of actions and interactions of humans from
the individual up to the societal level. This led to several new observations
of bursty phenomena in the new but largely unexplored area of human dynamics,
which called for the renaissance to study these systems using research concepts
and methodologies, including data analytics and modelling. As a result, a large
amount of new insight and knowledge as well as innovations have been
accumulated in the field, which provided us a timely opportunity to write this
brief monograph to make an up-to-date review and summary of the observations,
appropriate measures, modelling, and applications of heterogeneous bursty
patterns occurring in the dynamics of human behaviour.
| physics.soc-ph cs.CY cs.SI physics.data-an | bursty dynamics is a common temporal property of various complex systems in nature but it also characterises the dynamics of human actions and interactions at the phenomenological level it is a feature of all systems that evolve heterogeneously over time by alternating between periods of low and high event frequencies in such systems bursts are identified as periods in which the events occur with a rapid pace within a short timeinterval while these periods are separated by long periods of time with low frequency of events as such dynamical patterns occur in a wide range of natural phenomena their observation characterisation and modelling have been a long standing challenge in several fields of research however due to some recent developments in communication and data collection techniques it has become possible to follow digital traces of actions and interactions of humans from the individual up to the societal level this led to several new observations of bursty phenomena in the new but largely unexplored area of human dynamics which called for the renaissance to study these systems using research concepts and methodologies including data analytics and modelling as a result a large amount of new insight and knowledge as well as innovations have been accumulated in the field which provided us a timely opportunity to write this brief monograph to make an uptodate review and summary of the observations appropriate measures modelling and applications of heterogeneous bursty patterns occurring in the dynamics of human behaviour | [['bursty', 'dynamics', 'is', 'a', 'common', 'temporal', 'property', 'of', 'various', 'complex', 'systems', 'in', 'nature', 'but', 'it', 'also', 'characterises', 'the', 'dynamics', 'of', 'human', 'actions', 'and', 'interactions', 'at', 'the', 'phenomenological', 'level', 'it', 'is', 'a', 'feature', 'of', 'all', 'systems', 'that', 'evolve', 'heterogeneously', 'over', 'time', 'by', 'alternating', 'between', 'periods', 'of', 'low', 'and', 'high', 'event', 'frequencies', 'in', 'such', 'systems', 'bursts', 'are', 'identified', 'as', 'periods', 'in', 'which', 'the', 'events', 'occur', 'with', 'a', 'rapid', 'pace', 'within', 'a', 'short', 'timeinterval', 'while', 'these', 'periods', 'are', 'separated', 'by', 'long', 'periods', 'of', 'time', 'with', 'low', 'frequency', 'of', 'events', 'as', 'such', 'dynamical', 'patterns', 'occur', 'in', 'a', 'wide', 'range', 'of', 'natural', 'phenomena', 'their', 'observation', 'characterisation', 'and', 'modelling', 'have', 'been', 'a', 'long', 'standing', 'challenge', 'in', 'several', 'fields', 'of', 'research', 'however', 'due', 'to', 'some', 'recent', 'developments', 'in', 'communication', 'and', 'data', 'collection', 'techniques', 'it', 'has', 'become', 'possible', 'to', 'follow', 'digital', 'traces', 'of', 'actions', 'and', 'interactions', 'of', 'humans', 'from', 'the', 'individual', 'up', 'to', 'the', 'societal', 'level', 'this', 'led', 'to', 'several', 'new', 'observations', 'of', 'bursty', 'phenomena', 'in', 'the', 'new', 'but', 'largely', 'unexplored', 'area', 'of', 'human', 'dynamics', 'which', 'called', 'for', 'the', 'renaissance', 'to', 'study', 'these', 'systems', 'using', 'research', 'concepts', 'and', 'methodologies', 'including', 'data', 'analytics', 'and', 'modelling', 'as', 'a', 'result', 'a', 'large', 'amount', 'of', 'new', 'insight', 'and', 'knowledge', 'as', 'well', 'as', 'innovations', 'have', 'been', 'accumulated', 'in', 'the', 'field', 'which', 'provided', 'us', 'a', 'timely', 'opportunity', 'to', 'write', 'this', 'brief', 'monograph', 'to', 'make', 'an', 'uptodate', 'review', 'and', 'summary', 'of', 'the', 'observations', 'appropriate', 'measures', 'modelling', 'and', 'applications', 'of', 'heterogeneous', 'bursty', 'patterns', 'occurring', 'in', 'the', 'dynamics', 'of', 'human', 'behaviour']] | [-0.13782088111391383, 0.1468196821606696, -0.09425733531643941, 0.07813272186408018, -0.08942884691135927, -0.08865267025797292, 0.04720273208861682, 0.3796431819739423, -0.2778436390665879, -0.35469647481671124, 0.13837080132779206, -0.26401560060292495, -0.16599914176985012, 0.23660944321299673, -0.06493195955599582, 0.038758592626660086, 0.07047226035310963, 0.025960367501209506, -0.015091919537956185, -0.22208065542508848, 0.2657288185117545, 0.06515589375506903, 0.26282746846535715, 0.03814811408653336, 0.09761933298289134, -0.022706284244987565, -0.07734521423642081, 0.0014359251296407252, -0.0944496436860972, 0.10433528138339886, 0.3102130435567471, 0.16000004582341806, 0.31293816406463015, -0.454148381658387, -0.2686885394648359, 0.07724419542679899, 0.12714634430985974, 0.10015858833276815, -0.05586872992800457, -0.2835768238931406, 0.05814768782851179, -0.19406020532163684, -0.11822539779975949, -0.07234083808821122, 0.09267216197026085, 0.062303413328052434, -0.20439636349471926, 0.049192804674647525, 0.06661447173174849, 0.11744637901467256, -0.041933628711391426, -0.04586892569872749, 0.028402839451894684, 0.19997642215600878, 0.10430177956648728, 0.022166118153407178, 0.08552977372892201, -0.15775489671151993, -0.13946428405145778, 0.379597562544628, -0.028118770410684623, -0.11176066396788495, 0.2692247574960958, -0.15288756562198405, -0.16246340697684677, 0.15056213381371963, 0.23437118020908693, 0.09572944447176805, -0.19508108763991794, 0.017164229315879267, 0.026143827675994425, 0.14320602382296604, 0.040062679087582855, 0.09892219183804299, 0.2549001731390714, 0.21803506974466755, 0.01606812510166134, 0.054282794168341114, -0.05493313692639903, -0.13708273356911138, -0.22701467452265445, -0.11009159527903187, -0.11691985907439585, 0.04679175313766359, -0.01933092291437788, -0.16060821289486696, 0.4053850268265691, 0.15374921328105703, 0.23473220501575986, 0.024051845618084714, 0.2633217892339491, 0.06072595013357073, 0.10155883901771616, 0.024309031638606895, 0.17976494369082263, 0.08654401321383956, 0.14374624768159444, -0.14957883425169533, 0.08232995736666528, -0.03909885081115225] |
1,803.02581 | Regularity of fractional maximal functions through Fourier multipliers | We prove endpoint bounds for derivatives of fractional maximal functions with
either smooth convolution kernel or lacunary set of radii in dimensions $n \geq
2$. We also show that the spherical fractional maximal function maps $L^{p}$
into a first order Sobolev space in dimensions $n \geq 5$.
| math.CA | we prove endpoint bounds for derivatives of fractional maximal functions with either smooth convolution kernel or lacunary set of radii in dimensions n geq 2 we also show that the spherical fractional maximal function maps lp into a first order sobolev space in dimensions n geq 5 | [['we', 'prove', 'endpoint', 'bounds', 'for', 'derivatives', 'of', 'fractional', 'maximal', 'functions', 'with', 'either', 'smooth', 'convolution', 'kernel', 'or', 'lacunary', 'set', 'of', 'radii', 'in', 'dimensions', 'n', 'geq', '2', 'we', 'also', 'show', 'that', 'the', 'spherical', 'fractional', 'maximal', 'function', 'maps', 'lp', 'into', 'a', 'first', 'order', 'sobolev', 'space', 'in', 'dimensions', 'n', 'geq', '5']] | [-0.11873487110913514, 0.13376184976956945, -0.016111979062886948, 0.10622459971048731, -0.04193583031759617, -0.12173505423669802, -0.022173129740428735, 0.36797411470337116, -0.27316654352669384, -0.20408151191758347, 0.13553963247389395, -0.3131846995390159, -0.12168736288700491, 0.1719822919025938, -0.030512516145307096, 0.10774247720837593, -0.028813196465055993, 0.038473829523006334, -0.1670812685191235, -0.2888840117239136, 0.3790594594592744, -0.15548000968200096, 0.12660661476485907, 0.03870203485712409, 0.09519696268352106, -0.03310115083536886, -0.022398110924962352, -0.04452321978664878, -0.2297386525731665, 0.12257374093887653, 0.22847036101875154, 0.060055743541291104, 0.2812722539231974, -0.39362556023642103, -0.19872049868423888, 0.24048377000825835, 0.1772220980851574, -0.07996891476610239, 0.024048782652243972, -0.24334703068783942, 0.13243091883177452, -0.11305839596118064, -0.22114437057616862, -0.08239210182999043, 0.13320927803424445, 0.043623192575165726, -0.37598393413614717, 0.09939789608990318, 0.15506190850221097, 0.03460310811692096, -0.09777156373565184, -0.20809006546326775, 0.007964423258214238, 0.036881704889039725, -0.045285690754176454, 0.07222907113386913, 0.002292240969836712, -0.09889569082000155, -0.11114717411630332, 0.2574478856466235, -0.10882006275735082, -0.28870648688616907, 0.08358522724518751, -0.32318677570908627, -0.14839130863943634, 0.09253362244232854, 0.17225568094588023, 0.19920938981181763, -0.03631763160228729, 0.18741192335778095, -0.04883266664407355, 0.2070187333020124, 0.1783582540823424, 0.04855996133521833, 0.040061602824704445, 0.061435536322917074, 0.23478979159622115, 0.16751919417305194, -0.045716817238110496, -0.011154451982138004, -0.4063731444642899, -0.19477388522330116, -0.2190477264886524, 0.1058203315243442, -0.2574806330586843, -0.1269132290803332, 0.2983562464310609, 0.030710979493612303, 0.20264838564586132, 0.1826513193032526, 0.1974845705752043, 0.14537485057588398, 0.05408347989531591, 0.14709681567755786, 0.054396087244311546, 0.10056011801327955, 0.004725310951471329, -0.09542254899783888, -0.06417663335958694, 0.24336479287198248] |
1,803.02582 | Characterization of some special rings via linkage | Some descriptions of linked ideals in a commutative Notherian ring $R$ are
provided in terms of the Associated prime ideals of $R$. Then, among other
things, we make some characterization of Cohen-Macaulay, Gorenstein and regular
local rings in terms of their linked ideals.
| math.AC | some descriptions of linked ideals in a commutative notherian ring r are provided in terms of the associated prime ideals of r then among other things we make some characterization of cohenmacaulay gorenstein and regular local rings in terms of their linked ideals | [['some', 'descriptions', 'of', 'linked', 'ideals', 'in', 'a', 'commutative', 'notherian', 'ring', 'r', 'are', 'provided', 'in', 'terms', 'of', 'the', 'associated', 'prime', 'ideals', 'of', 'r', 'then', 'among', 'other', 'things', 'we', 'make', 'some', 'characterization', 'of', 'cohenmacaulay', 'gorenstein', 'and', 'regular', 'local', 'rings', 'in', 'terms', 'of', 'their', 'linked', 'ideals']] | [-0.24308491242659647, -0.057557144202291965, -0.025767934920136317, 0.07211223125544398, -0.048568775649940554, -0.21222607703706206, -0.14438561811436748, 0.31922818880614845, -0.41625653718446576, -0.11236579497453085, 0.13766879481425898, -0.30643504476824474, -0.06348205173691344, 0.1887406571659931, -0.16813790479804888, -0.08165420150535918, 0.00922364262907311, 0.14158712669687215, -0.04459913609939259, -0.3832470543336037, 0.40597540207293836, 0.03189889415232248, 0.1407056822073321, 0.022946820832615674, -0.0005160699636393855, -0.03371625334067747, -0.15154457136685417, 0.1121722582543572, -0.25636893240085173, 0.18640319123690904, 0.364184026281501, 0.111802919767797, 0.2174834094421808, -0.44695236763462076, 0.037238004357489043, 0.24644393235618292, 0.17352620072576197, -0.10206408309208792, 0.004842647844059176, -0.18169232111337574, 0.14717433710994068, -0.2696565146622963, -0.18711446061037307, -0.13073146286918674, 0.1105097018420523, 0.14294695321383866, -0.2622277664323879, 0.0032896917356654656, 0.1361333889410246, 0.24213152549900982, -0.04581516725552637, -0.07435520953866978, -0.08789705571740172, 0.009609910518710697, -0.08347017850813478, -0.0945317447726983, 0.08730098909460181, -0.15605682409693336, -0.14346235900640833, 0.357982084588256, 0.02052234983894714, -0.17845324990556163, 0.18931914062434158, -0.2519645124327305, -0.10467454686024508, 0.09715483588881271, -0.03713810032363548, 0.15007649366418982, -0.04262780837801307, 0.1903141237088739, -0.16286255343448977, -0.026366279547124408, 0.13830478724395467, 0.18599219888795254, 0.2394579882018788, 0.048596746613119926, 0.02234848005071737, 0.14346257278961022, 0.06401843391223486, 0.03596713993871628, -0.3483973069246425, -0.17212317247203615, -0.14179116999730468, 0.08979947579114936, -0.145331319475338, -0.15533975191241087, 0.47153890217372846, 0.13561028302755468, 0.16707479784828286, 0.04554957946285952, 0.18462916472276977, -0.08564111308822799, 0.08496172750520326, 0.07092937755636698, 0.07930723438174789, 0.262124691938245, -0.03522945050864892, -0.1018459766475094, 0.03358093721705467, 0.18514555019088264] |
1,803.02583 | On the Efficiency of Nash Equilibria in Aggregative Charging Games | Several works have recently suggested to model the problem of coordinating
the charging needs of a fleet of electric vehicles as a game, and have proposed
distributed algorithms to coordinate the vehicles towards a Nash equilibrium of
such game. However, Nash equilibria have been shown to posses desirable
system-level properties only in simplified cases. In this work, we use the
concept of price of anarchy to analyze the inefficiency of Nash equilibria when
compared to the social optimum solution. More precisely, we show that i) for
linear price functions depending on all the charging instants, the price of
anarchy converges to one as the population of vehicles grows; ii) for price
functions that depend only on the instantaneous demand, the price of anarchy
converges to one if the price function takes the form of a positive pure
monomial; iii) for general classes of price functions, the asymptotic price of
anarchy can be bounded. For finite populations, we additionaly provide a bound
on the price of anarchy as a function of the number vehicles in the system. We
support the theoretical findings by means of numerical simulations.
| cs.SY cs.GT math.OC | several works have recently suggested to model the problem of coordinating the charging needs of a fleet of electric vehicles as a game and have proposed distributed algorithms to coordinate the vehicles towards a nash equilibrium of such game however nash equilibria have been shown to posses desirable systemlevel properties only in simplified cases in this work we use the concept of price of anarchy to analyze the inefficiency of nash equilibria when compared to the social optimum solution more precisely we show that i for linear price functions depending on all the charging instants the price of anarchy converges to one as the population of vehicles grows ii for price functions that depend only on the instantaneous demand the price of anarchy converges to one if the price function takes the form of a positive pure monomial iii for general classes of price functions the asymptotic price of anarchy can be bounded for finite populations we additionaly provide a bound on the price of anarchy as a function of the number vehicles in the system we support the theoretical findings by means of numerical simulations | [['several', 'works', 'have', 'recently', 'suggested', 'to', 'model', 'the', 'problem', 'of', 'coordinating', 'the', 'charging', 'needs', 'of', 'a', 'fleet', 'of', 'electric', 'vehicles', 'as', 'a', 'game', 'and', 'have', 'proposed', 'distributed', 'algorithms', 'to', 'coordinate', 'the', 'vehicles', 'towards', 'a', 'nash', 'equilibrium', 'of', 'such', 'game', 'however', 'nash', 'equilibria', 'have', 'been', 'shown', 'to', 'posses', 'desirable', 'systemlevel', 'properties', 'only', 'in', 'simplified', 'cases', 'in', 'this', 'work', 'we', 'use', 'the', 'concept', 'of', 'price', 'of', 'anarchy', 'to', 'analyze', 'the', 'inefficiency', 'of', 'nash', 'equilibria', 'when', 'compared', 'to', 'the', 'social', 'optimum', 'solution', 'more', 'precisely', 'we', 'show', 'that', 'i', 'for', 'linear', 'price', 'functions', 'depending', 'on', 'all', 'the', 'charging', 'instants', 'the', 'price', 'of', 'anarchy', 'converges', 'to', 'one', 'as', 'the', 'population', 'of', 'vehicles', 'grows', 'ii', 'for', 'price', 'functions', 'that', 'depend', 'only', 'on', 'the', 'instantaneous', 'demand', 'the', 'price', 'of', 'anarchy', 'converges', 'to', 'one', 'if', 'the', 'price', 'function', 'takes', 'the', 'form', 'of', 'a', 'positive', 'pure', 'monomial', 'iii', 'for', 'general', 'classes', 'of', 'price', 'functions', 'the', 'asymptotic', 'price', 'of', 'anarchy', 'can', 'be', 'bounded', 'for', 'finite', 'populations', 'we', 'additionaly', 'provide', 'a', 'bound', 'on', 'the', 'price', 'of', 'anarchy', 'as', 'a', 'function', 'of', 'the', 'number', 'vehicles', 'in', 'the', 'system', 'we', 'support', 'the', 'theoretical', 'findings', 'by', 'means', 'of', 'numerical', 'simulations']] | [-0.12284316273324157, 0.03308668751920503, -0.10351181109385785, 0.08105435344247869, -0.04426084780034118, -0.14747647365294797, 0.1466108025402151, 0.36868685975630755, -0.260861213519288, -0.27772175794046733, 0.10148539147602635, -0.2686716292894656, -0.13377110428997988, 0.13965588776014184, -0.11705871310140958, 0.061414198739634406, 0.03253406072373412, 0.019962156033900728, 0.04030491447236429, -0.29325392865325495, 0.31384135639327526, 0.04608483865897181, 0.27107971622758814, 0.07143837420309904, 0.0972572644416403, -0.054671152781504855, 0.04331247512281181, 0.05861989931918777, -0.1314081668003959, 0.09294621806318862, 0.2645571949285886, 0.17545888690723566, 0.35428963983131034, -0.453731203511838, -0.16168161161664513, 0.1800177554857807, 0.08603843019634325, 0.0554361163065218, -0.0093505420051271, -0.21261336174117582, 0.08986787285445438, -0.22978406936250706, -0.1325833530250376, -0.06721097549426079, 0.019208876719017342, 0.11345162429885629, -0.3372467043959806, -0.015040075491553033, 0.028463777480146255, 0.03689729638638035, -0.057247429929663654, -0.13484750366995052, -0.0566191937716838, 0.15234610475665483, 0.1083823907262926, -0.07028433845831603, 0.13790668845076554, -0.14943109637111304, -0.17683203620410534, 0.40045189295184386, -0.08055229772818626, -0.20993553146579733, 0.14020216771431507, -0.13437840679375035, -0.10969291701449722, 0.10904738112817199, 0.19799233680611017, 0.1517480362547181, -0.11203417218434537, 0.07765479034697888, -0.10281662771888879, 0.151830700108461, 0.07531847031061006, 0.034872979644538275, 0.14969361868188766, 0.19159755049528734, 0.22276590372590968, 0.12351322478692357, 0.0008667932275021749, -0.19364433529816807, -0.2621496907906026, -0.14787700609710838, -0.18365960666767112, 0.07980786599669486, -0.11979162094353195, -0.15075129452358646, 0.40777124765314043, 0.1197902026200687, 0.1192203597340893, 0.12404849968590242, 0.2919629415377013, 0.15169938530845528, -0.03342525235136911, 0.13647825611374712, 0.23072270176408471, 0.02224219211762751, 0.13739696806747345, -0.2148496724473643, 0.15970548480669017, 0.059596671441414076] |
1,803.02584 | New Nuclear Magnetic Moment of $^{209}$Bi - Resolving the Bismuth
Hyperfine Puzzle | A recent measurement of the hyperfine splitting in the ground state of
Li-like $^{209}$Bi$^{80+}$ has established a "hyperfine puzzle" -- the
experimental result exhibits a 7$\sigma$ deviation from the theoretical
prediction [J. Ullmann et al., Nat. Commun. 8, 15484 (2017); J. P. Karr, Nat.
Phys. 13, 533 (2017)]. We provide evidence that the discrepancy is caused by an
inaccurate value of the tabulated nuclear magnetic moment ($\mu_I$) of
$^{209}$Bi. We perform relativistic density functional theory and relativistic
coupled cluster calculations of the shielding constant that should be used to
extract the value of $\mu_I(^{209}{\rm Bi})$ and combine it with nuclear
magnetic resonance measurements of Bi(NO$_3$)$_3$ in nitric acid solutions and
of the hexafluoridobismuthate(V) BiF$_6^-$ ion in acetonitrile. The result
clearly reveals that $\mu_I(^{209}{\rm Bi})$ is much smaller than the tabulated
value used previously. Applying the new magnetic moment shifts the theoretical
prediction into agreement with experiment and resolves the hyperfine puzzle.
| physics.atom-ph physics.chem-ph | a recent measurement of the hyperfine splitting in the ground state of lilike 209bi80 has established a hyperfine puzzle the experimental result exhibits a 7sigma deviation from the theoretical prediction j ullmann et al nat commun 8 15484 2017 j p karr nat phys 13 533 2017 we provide evidence that the discrepancy is caused by an inaccurate value of the tabulated nuclear magnetic moment mu_i of 209bi we perform relativistic density functional theory and relativistic coupled cluster calculations of the shielding constant that should be used to extract the value of mu_i209rm bi and combine it with nuclear magnetic resonance measurements of bino_3_3 in nitric acid solutions and of the hexafluoridobismuthatev bif_6 ion in acetonitrile the result clearly reveals that mu_i209rm bi is much smaller than the tabulated value used previously applying the new magnetic moment shifts the theoretical prediction into agreement with experiment and resolves the hyperfine puzzle | [['a', 'recent', 'measurement', 'of', 'the', 'hyperfine', 'splitting', 'in', 'the', 'ground', 'state', 'of', 'lilike', '209bi80', 'has', 'established', 'a', 'hyperfine', 'puzzle', 'the', 'experimental', 'result', 'exhibits', 'a', '7sigma', 'deviation', 'from', 'the', 'theoretical', 'prediction', 'j', 'ullmann', 'et', 'al', 'nat', 'commun', '8', '15484', '2017', 'j', 'p', 'karr', 'nat', 'phys', '13', '533', '2017', 'we', 'provide', 'evidence', 'that', 'the', 'discrepancy', 'is', 'caused', 'by', 'an', 'inaccurate', 'value', 'of', 'the', 'tabulated', 'nuclear', 'magnetic', 'moment', 'mu_i', 'of', '209bi', 'we', 'perform', 'relativistic', 'density', 'functional', 'theory', 'and', 'relativistic', 'coupled', 'cluster', 'calculations', 'of', 'the', 'shielding', 'constant', 'that', 'should', 'be', 'used', 'to', 'extract', 'the', 'value', 'of', 'mu_i209rm', 'bi', 'and', 'combine', 'it', 'with', 'nuclear', 'magnetic', 'resonance', 'measurements', 'of', 'bino_3_3', 'in', 'nitric', 'acid', 'solutions', 'and', 'of', 'the', 'hexafluoridobismuthatev', 'bif_6', 'ion', 'in', 'acetonitrile', 'the', 'result', 'clearly', 'reveals', 'that', 'mu_i209rm', 'bi', 'is', 'much', 'smaller', 'than', 'the', 'tabulated', 'value', 'used', 'previously', 'applying', 'the', 'new', 'magnetic', 'moment', 'shifts', 'the', 'theoretical', 'prediction', 'into', 'agreement', 'with', 'experiment', 'and', 'resolves', 'the', 'hyperfine', 'puzzle']] | [-0.07448991933941013, 0.12445754816477954, -0.04798350282362662, 0.014371120754124908, -0.011629904316376068, -0.11221283916448657, 0.053824439951212194, 0.34397079732217306, -0.1694805031357747, -0.38787628888773423, -0.01345335085756637, -0.31764151060229373, -0.042220066654004365, 0.14337566221204018, 0.013600622685367448, 0.02745731035530399, 0.04665518246474676, -0.015170444599991444, -0.056809619901792355, -0.19436449587859292, 0.24580937267455738, 0.11007532707945858, 0.2515722378403653, 0.10613872366310614, 0.038745068673354886, -0.0010283144818256712, -0.002500801835493702, 0.03027304946186228, -0.1879220965177208, 0.11277386154526742, 0.23498333850228745, 0.04853177293100291, 0.2116658633232065, -0.40833004732202327, -0.17788190979465274, 0.035347621409325965, 0.06395089138014656, 0.15911526232311088, -0.06149053744674246, -0.3017992710746411, 0.04546727928876256, -0.17486798647991642, -0.1300051467789874, -0.08183102262814322, 0.06502886681442356, -0.017697095280810673, -0.3044648380245134, 0.16422704047161257, 0.03740034776920867, 0.08661892532306108, -0.11402686961163352, -0.23948631329565412, -0.006230151321182752, 0.04777764147082861, 0.024413292951976473, 0.12823884857223472, 0.12772745564709315, -0.06265141525849079, -0.13195210627357787, 0.3600725185889233, -0.08873892656720272, -0.061441905307017604, 0.1295406579415107, -0.15352470947093227, -0.15348100664818454, 0.14841970481858072, 0.06585309833301128, 0.09223065941235593, -0.10983957109015642, 0.07968693247756972, -0.0672158474052493, 0.2096516707417777, 0.079399818831007, -0.009507013663147114, 0.14989853041091314, 0.12709993206792408, -0.013233596213265426, 0.048049881890316705, -0.15246942067137248, -0.07011706370273411, -0.2477471686498676, -0.14230520434082589, -0.19003575730797215, 0.08782534492072752, -0.01870986181206212, -0.07756483081215669, 0.34533060322024134, 0.1363021590643459, 0.19474280081663486, -0.07797706127651811, 0.22109111183736888, 0.1055819233677337, 0.031470402721121594, 0.08550992938803069, 0.32142599808543715, 0.2262201789724511, 0.11374403101702531, -0.2929611844253183, 0.05984040129260393, 0.02497157764769832] |
1,803.02585 | Single-molecular and Ensemble-level Oscillations of Cyanobacterial
Circadian Clock | When three cyanobacterial proteins, KaiA, KaiB, and KaiC, are incubated with
ATP in vitro, the phosphorylation level of KaiC hexamers shows stable
oscillation with approximately 24 h period. In order to understand this KaiABC
clockwork, we need to analyze both the macroscopic synchronization of a large
number of KaiC hexamers and the microscopic reactions and structural changes in
individual KaiC molecules. In the present paper, we explain two coarse-grained
theoretical models, the many-molecule (MM) model and the single-molecule (SM)
model, to bridge the gap between macroscopic and microscopic understandings. In
the simulation results with these models, ATP hydrolysis drives oscillation of
individual KaiC hexamers and ATP hydrolysis is necessary for synchronizing
oscillations of a large number of KaiC hexamers. Sensitive temperature
dependence of the lifetime of the ADP bound state in the CI domain of KaiC
hexamers makes the oscillation period temperature insensitive. ATPase activity
is correlated to the frequency of phosphorylation oscillation in the single
molecule of KaiC hexamer, which should be the origin of the observed
ensemble-level correlation between the ATPase activity and the frequency of
phosphorylation oscillation. Thus, the simulation results with the MM and SM
models suggest that ATP hydrolysis randomly occurring in each CI domain of
individual KaiC hexamers is a key process for oscillatory behaviors of the
ensemble of many KaiC hexamers.
| q-bio.MN cond-mat.dis-nn q-bio.SC | when three cyanobacterial proteins kaia kaib and kaic are incubated with atp in vitro the phosphorylation level of kaic hexamers shows stable oscillation with approximately 24 h period in order to understand this kaiabc clockwork we need to analyze both the macroscopic synchronization of a large number of kaic hexamers and the microscopic reactions and structural changes in individual kaic molecules in the present paper we explain two coarsegrained theoretical models the manymolecule mm model and the singlemolecule sm model to bridge the gap between macroscopic and microscopic understandings in the simulation results with these models atp hydrolysis drives oscillation of individual kaic hexamers and atp hydrolysis is necessary for synchronizing oscillations of a large number of kaic hexamers sensitive temperature dependence of the lifetime of the adp bound state in the ci domain of kaic hexamers makes the oscillation period temperature insensitive atpase activity is correlated to the frequency of phosphorylation oscillation in the single molecule of kaic hexamer which should be the origin of the observed ensemblelevel correlation between the atpase activity and the frequency of phosphorylation oscillation thus the simulation results with the mm and sm models suggest that atp hydrolysis randomly occurring in each ci domain of individual kaic hexamers is a key process for oscillatory behaviors of the ensemble of many kaic hexamers | [['when', 'three', 'cyanobacterial', 'proteins', 'kaia', 'kaib', 'and', 'kaic', 'are', 'incubated', 'with', 'atp', 'in', 'vitro', 'the', 'phosphorylation', 'level', 'of', 'kaic', 'hexamers', 'shows', 'stable', 'oscillation', 'with', 'approximately', '24', 'h', 'period', 'in', 'order', 'to', 'understand', 'this', 'kaiabc', 'clockwork', 'we', 'need', 'to', 'analyze', 'both', 'the', 'macroscopic', 'synchronization', 'of', 'a', 'large', 'number', 'of', 'kaic', 'hexamers', 'and', 'the', 'microscopic', 'reactions', 'and', 'structural', 'changes', 'in', 'individual', 'kaic', 'molecules', 'in', 'the', 'present', 'paper', 'we', 'explain', 'two', 'coarsegrained', 'theoretical', 'models', 'the', 'manymolecule', 'mm', 'model', 'and', 'the', 'singlemolecule', 'sm', 'model', 'to', 'bridge', 'the', 'gap', 'between', 'macroscopic', 'and', 'microscopic', 'understandings', 'in', 'the', 'simulation', 'results', 'with', 'these', 'models', 'atp', 'hydrolysis', 'drives', 'oscillation', 'of', 'individual', 'kaic', 'hexamers', 'and', 'atp', 'hydrolysis', 'is', 'necessary', 'for', 'synchronizing', 'oscillations', 'of', 'a', 'large', 'number', 'of', 'kaic', 'hexamers', 'sensitive', 'temperature', 'dependence', 'of', 'the', 'lifetime', 'of', 'the', 'adp', 'bound', 'state', 'in', 'the', 'ci', 'domain', 'of', 'kaic', 'hexamers', 'makes', 'the', 'oscillation', 'period', 'temperature', 'insensitive', 'atpase', 'activity', 'is', 'correlated', 'to', 'the', 'frequency', 'of', 'phosphorylation', 'oscillation', 'in', 'the', 'single', 'molecule', 'of', 'kaic', 'hexamer', 'which', 'should', 'be', 'the', 'origin', 'of', 'the', 'observed', 'ensemblelevel', 'correlation', 'between', 'the', 'atpase', 'activity', 'and', 'the', 'frequency', 'of', 'phosphorylation', 'oscillation', 'thus', 'the', 'simulation', 'results', 'with', 'the', 'mm', 'and', 'sm', 'models', 'suggest', 'that', 'atp', 'hydrolysis', 'randomly', 'occurring', 'in', 'each', 'ci', 'domain', 'of', 'individual', 'kaic', 'hexamers', 'is', 'a', 'key', 'process', 'for', 'oscillatory', 'behaviors', 'of', 'the', 'ensemble', 'of', 'many', 'kaic', 'hexamers']] | [-0.1608700277147614, 0.2248494327030948, 0.004468523399528424, 0.04613635099925419, 0.03246194824155574, -0.15756996960908926, 0.12163835736643096, 0.33166283750137604, -0.25063762713625276, -0.30217665692774254, 0.0012338277627500372, -0.27053835606971466, -0.15771634147476848, 0.137283819635749, -0.0003187789081343783, -0.023390762488690948, 0.06588514793211372, 0.03915375577277341, 0.10632753727632925, -0.14148701891439772, 0.18513969942465971, 0.0759983394671992, 0.28301692220442204, 0.06481858176059611, 0.08338359906765368, -0.07705017263731928, 0.05501372498217671, -0.09849322225349537, -0.14584022342868083, 0.14737135398502962, 0.2337332611430511, 0.06756837882844885, 0.24651339547623188, -0.4712968630408612, -0.1703587062084148, 0.09183116200798695, 0.14058859252857916, 0.149837578132582, 0.015600853167122354, -0.22854141318111107, 0.025099869951800177, -0.14027782180880563, -0.07562731189488801, -0.07349501320784656, 0.03180363408499184, 0.09928397484948226, -0.2521225416759422, 0.17082997764259952, 0.020654821618878785, 0.1293496598399868, -0.13349304753120717, -0.1084542723176061, -0.10775044692547804, 0.14814531202377312, 0.06689552891849425, 0.01556100954641823, 0.2378778398878565, -0.0798794062105392, -0.1185844733159233, 0.325444759271287, -0.06299593108930462, -0.11355274775249183, 0.21831010884996246, -0.1540476257716297, -0.16802415616664534, 0.1612190803162617, 0.10640812043630339, 0.04911469971470603, -0.16076375588641445, -0.012887734411403947, 0.01581343159895527, 0.2626880918364596, 0.08209646201303758, -0.02323080720636276, 0.19167139331400052, 0.2747091594688304, -0.0030491355298740636, 0.09034206296748229, -0.09221650716803814, -0.15313844170545254, -0.23601803439455704, -0.129260915716968, -0.1181795351055596, 0.041041491455996594, -0.0520428964871392, -0.15421938156247686, 0.4269351152737343, 0.086196582409801, 0.1871464002253744, 0.04633818852123505, 0.20977720447523315, 0.0009986631948193279, 0.06483585266954449, -0.03994223710209336, 0.19218181149495783, 0.10663896859324443, 0.09733146373737911, -0.3559815409238698, 0.12953928549594562, 0.017291600002112602] |
1,803.02586 | Single module identifiability in linear dynamic networks | A recent development in data-driven modelling addresses the problem of
identifying dynamic models of interconnected systems, represented as linear
dynamic networks. For these networks the notion network identifiability has
been introduced recently, which reflects the property that different network
models can be distinguished from each other. Network identifiability is
extended to cover the uniqueness of a single module in the network model.
Conditions for single module identifiability are derived and formulated in
terms of path-based topological properties of the network models.
| cs.SY | a recent development in datadriven modelling addresses the problem of identifying dynamic models of interconnected systems represented as linear dynamic networks for these networks the notion network identifiability has been introduced recently which reflects the property that different network models can be distinguished from each other network identifiability is extended to cover the uniqueness of a single module in the network model conditions for single module identifiability are derived and formulated in terms of pathbased topological properties of the network models | [['a', 'recent', 'development', 'in', 'datadriven', 'modelling', 'addresses', 'the', 'problem', 'of', 'identifying', 'dynamic', 'models', 'of', 'interconnected', 'systems', 'represented', 'as', 'linear', 'dynamic', 'networks', 'for', 'these', 'networks', 'the', 'notion', 'network', 'identifiability', 'has', 'been', 'introduced', 'recently', 'which', 'reflects', 'the', 'property', 'that', 'different', 'network', 'models', 'can', 'be', 'distinguished', 'from', 'each', 'other', 'network', 'identifiability', 'is', 'extended', 'to', 'cover', 'the', 'uniqueness', 'of', 'a', 'single', 'module', 'in', 'the', 'network', 'model', 'conditions', 'for', 'single', 'module', 'identifiability', 'are', 'derived', 'and', 'formulated', 'in', 'terms', 'of', 'pathbased', 'topological', 'properties', 'of', 'the', 'network', 'models']] | [-0.14941249387683692, 0.006809269147062743, -0.036571224185603636, 0.050589922282350375, -0.04942458759659878, -0.1893313216206468, -0.03517779431961201, 0.36964171697144155, -0.3548504487024965, -0.2846926287000562, 0.11571084819647863, -0.1861859881951485, -0.21591135877885936, 0.15549640290519615, -0.09892117080888078, 0.11690363470740893, 0.07395364565165415, 0.03453019083575288, -0.04884929861585943, -0.21568279447217967, 0.3459765384502617, 0.03731088999106928, 0.3202202472099919, 0.014213683566561452, 0.12307555091647822, -0.003877709872652719, -0.0315572297959416, 0.092682076564898, -0.0828724744975643, 0.1464149239918585, 0.2879070625873552, 0.20133098756124115, 0.30050352526207763, -0.4201751432531042, -0.3429139652461917, 0.14482340750135023, 0.09766759971202707, 0.07177259426213295, 0.04629682954170822, -0.3144915044583656, 0.10761647468524767, -0.20360176193953297, -0.05765223508861698, -0.08053686433000329, -0.027728520356762557, 0.020191833371135556, -0.2786214983602411, 0.0329294129487495, 0.06492925195000422, 0.04781449332051439, -0.08135345954172037, -0.10137685310141539, -0.07110148190842643, 0.15422522731378308, -0.024348149701297558, -0.02206045439765777, 0.09460528292779431, -0.17237302525267925, -0.1739009737373433, 0.35133491539292866, -0.019163464288008802, -0.22241048993151866, 0.18953805269937915, -0.008489612168000068, -0.2114998221564118, 0.08629723987254648, 0.22429247647035222, 0.08564323194922856, -0.2101235500717231, 0.05512045990649818, -0.11268827828498167, 0.12128679732573622, 0.008479274999074362, 0.042291198983604526, 0.19584467597765687, 0.2840992850194007, 0.044472966320168825, 0.15004344167759825, -0.032326365585358424, -0.09335209392471078, -0.2307091004870556, -0.07984560362586499, -0.16182158708020491, -0.0251891049383967, -0.10131720974908447, -0.1660661004702158, 0.4663066409620238, 0.15522223427592788, 0.18684223456377233, 0.07629310815267402, 0.2546224800329425, 0.09425412239018184, 0.09631606545529248, 0.047986312217458534, 0.20811458175748954, 0.15329014184528295, 0.12340893651600238, -0.11838033720908434, 0.17657210362391018, 0.10766086510934487] |
1,803.02587 | The kaonic atoms research program at DA{\Phi}NE: from SIDDHARTA to
SIDDHARTA-2 | The interaction of antikaons with nucleons and nuclei in the low-energy
regime represents an active research field in hadron physics with still many
important open questions. The investigation of light kaonic atoms, in which one
electron is replaced by a negatively charged kaon, is a unique tool to provide
precise information on this interaction; the energy shift and the broadening of
the low-lying states of such atoms, induced by the kaon-nucleus hadronic
interaction, can be determined with high precision from the atomic X-ray
spectroscopy, and this experimental method provides unique information to
understand the low energy kaon-nucleus interaction at the production threshold.
The lightest atomic systems, like the kaonic hydrogen and the kaonic deuterium
deliver, in a model-independent way, the isospin-dependent kaon-nucleon
scattering lengths. The most precise kaonic hydrogen measurement to-date,
together with an exploratory measurement of kaonic deuterium, were carried out
in 2009 by the SIDDHARTA collaboration at the DA{\Phi}NE electron-positron
collider of LNF-INFN, combining the excellent quality kaon beam delivered by
the collider with new experimental techniques, as fast and very precise X-ray
detectors, like the Silicon Drift Detectors. The SIDDHARTA results triggered
new theoretical work, which achieved major progress in the understanding of the
low-energy strong interaction with strangeness reflected by the
antikaon-nucleon scattering lengths calculated with the antikaon-proton
amplitudes constrained by the SIDDHARTA data. The most important open question
is the experimental determination of the hadronic energy shift and width of
kaonic deuterium; presently, a major upgrade of the setup, SIDDHARTA-2, is
being realized to reach this goal. In this paper, the results obtained in 2009
and the proposed SIDDHARTA-2 upgrades are presented.
| nucl-ex | the interaction of antikaons with nucleons and nuclei in the lowenergy regime represents an active research field in hadron physics with still many important open questions the investigation of light kaonic atoms in which one electron is replaced by a negatively charged kaon is a unique tool to provide precise information on this interaction the energy shift and the broadening of the lowlying states of such atoms induced by the kaonnucleus hadronic interaction can be determined with high precision from the atomic xray spectroscopy and this experimental method provides unique information to understand the low energy kaonnucleus interaction at the production threshold the lightest atomic systems like the kaonic hydrogen and the kaonic deuterium deliver in a modelindependent way the isospindependent kaonnucleon scattering lengths the most precise kaonic hydrogen measurement todate together with an exploratory measurement of kaonic deuterium were carried out in 2009 by the siddharta collaboration at the daphine electronpositron collider of lnfinfn combining the excellent quality kaon beam delivered by the collider with new experimental techniques as fast and very precise xray detectors like the silicon drift detectors the siddharta results triggered new theoretical work which achieved major progress in the understanding of the lowenergy strong interaction with strangeness reflected by the antikaonnucleon scattering lengths calculated with the antikaonproton amplitudes constrained by the siddharta data the most important open question is the experimental determination of the hadronic energy shift and width of kaonic deuterium presently a major upgrade of the setup siddharta2 is being realized to reach this goal in this paper the results obtained in 2009 and the proposed siddharta2 upgrades are presented | [['the', 'interaction', 'of', 'antikaons', 'with', 'nucleons', 'and', 'nuclei', 'in', 'the', 'lowenergy', 'regime', 'represents', 'an', 'active', 'research', 'field', 'in', 'hadron', 'physics', 'with', 'still', 'many', 'important', 'open', 'questions', 'the', 'investigation', 'of', 'light', 'kaonic', 'atoms', 'in', 'which', 'one', 'electron', 'is', 'replaced', 'by', 'a', 'negatively', 'charged', 'kaon', 'is', 'a', 'unique', 'tool', 'to', 'provide', 'precise', 'information', 'on', 'this', 'interaction', 'the', 'energy', 'shift', 'and', 'the', 'broadening', 'of', 'the', 'lowlying', 'states', 'of', 'such', 'atoms', 'induced', 'by', 'the', 'kaonnucleus', 'hadronic', 'interaction', 'can', 'be', 'determined', 'with', 'high', 'precision', 'from', 'the', 'atomic', 'xray', 'spectroscopy', 'and', 'this', 'experimental', 'method', 'provides', 'unique', 'information', 'to', 'understand', 'the', 'low', 'energy', 'kaonnucleus', 'interaction', 'at', 'the', 'production', 'threshold', 'the', 'lightest', 'atomic', 'systems', 'like', 'the', 'kaonic', 'hydrogen', 'and', 'the', 'kaonic', 'deuterium', 'deliver', 'in', 'a', 'modelindependent', 'way', 'the', 'isospindependent', 'kaonnucleon', 'scattering', 'lengths', 'the', 'most', 'precise', 'kaonic', 'hydrogen', 'measurement', 'todate', 'together', 'with', 'an', 'exploratory', 'measurement', 'of', 'kaonic', 'deuterium', 'were', 'carried', 'out', 'in', '2009', 'by', 'the', 'siddharta', 'collaboration', 'at', 'the', 'daphine', 'electronpositron', 'collider', 'of', 'lnfinfn', 'combining', 'the', 'excellent', 'quality', 'kaon', 'beam', 'delivered', 'by', 'the', 'collider', 'with', 'new', 'experimental', 'techniques', 'as', 'fast', 'and', 'very', 'precise', 'xray', 'detectors', 'like', 'the', 'silicon', 'drift', 'detectors', 'the', 'siddharta', 'results', 'triggered', 'new', 'theoretical', 'work', 'which', 'achieved', 'major', 'progress', 'in', 'the', 'understanding', 'of', 'the', 'lowenergy', 'strong', 'interaction', 'with', 'strangeness', 'reflected', 'by', 'the', 'antikaonnucleon', 'scattering', 'lengths', 'calculated', 'with', 'the', 'antikaonproton', 'amplitudes', 'constrained', 'by', 'the', 'siddharta', 'data', 'the', 'most', 'important', 'open', 'question', 'is', 'the', 'experimental', 'determination', 'of', 'the', 'hadronic', 'energy', 'shift', 'and', 'width', 'of', 'kaonic', 'deuterium', 'presently', 'a', 'major', 'upgrade', 'of', 'the', 'setup', 'siddharta2', 'is', 'being', 'realized', 'to', 'reach', 'this', 'goal', 'in', 'this', 'paper', 'the', 'results', 'obtained', 'in', '2009', 'and', 'the', 'proposed', 'siddharta2', 'upgrades', 'are', 'presented']] | [-0.04010876461590423, 0.21777853492353746, -0.05874338611099113, 0.08098519500782643, -0.00534561190043429, -0.12456418214281811, 0.042122855935249254, 0.3474403384235281, -0.20444399281667502, -0.32518250656951414, 0.002444973435599525, -0.34138293123166813, 0.005500789539174254, 0.18339163798110603, 0.06370096546212646, 0.11925918139653854, 0.12092887808540766, 0.013644000502321623, -0.020258845806058804, -0.19712954639243593, 0.2942559561181001, 0.1731904518293371, 0.2391065367763596, 0.17003406943706095, 0.03505242707626194, 0.03938124898586534, -0.06098907344529923, -0.052582733996152965, -0.11774023990952094, 0.16064259450168425, 0.28129951793451435, 0.08456075851651455, 0.17755851286106317, -0.4154708453907484, -0.15371783317024715, 0.07045060253870163, 0.1326907141588425, 0.11736103677789547, -0.09610595620855254, -0.33200905198945585, -0.009397614408543515, -0.17028176679128879, -0.17961387577137553, -0.05581718068561146, 0.002152690828053099, 0.0031226111463922308, -0.23428439075841492, 0.020495829247708496, -0.03965127725273203, 0.04484553787510674, -0.06837623069129352, -0.17147123708417708, 0.04065764620129887, 0.0532905282032557, 0.03037400468938837, 0.09680812319310003, 0.17436957907953993, -0.14763647442879646, -0.10162244763276085, 0.39761037137481925, -0.05352681090081937, -0.08961459528425046, 0.15813149116811678, -0.1782195777947405, -0.16101017965290948, 0.17547820886961163, 0.15053616259142028, 0.04508890279330649, -0.19356667459242158, 0.08178674706371232, -0.026971055038931564, 0.1933988262457192, 0.08868530234917157, 0.08970716843885698, 0.21411335672412937, 0.25119901657948285, 0.009500161684914738, 0.06170710728764604, -0.09400890708928998, -0.039827188947395585, -0.30029932921052094, -0.10351631235654284, -0.12078881229596086, 0.04796575268387402, -0.0001898971487460763, -0.08173755604136539, 0.35871198163385315, 0.0828191150343956, 0.20701245313835911, -0.092994265303828, 0.3377515793899669, 0.07942522454462399, 0.043785638998908555, 0.015004499097984052, 0.34181481994657, 0.18315743977953225, 0.13152599616433122, -0.3000805972041597, 0.06602445558016364, 0.012442751643177877] |
1,803.02588 | Phase-coherent solitonic Josephson heat oscillator | Since its recent foundation, phase-coherent caloritronics has sparkled
continuous interest giving rise to numerous concrete applications. This
research field deals with the coherent manipulation of heat currents in
mesoscopic superconducting devices by mastering the Josephson phase difference.
Here, we introduce a new generation of devices for fast caloritronics able to
control local heat power and temperature through manipulation of Josephson
vortices, i.e., solitons. Although most salient features concerning Josephson
vortices in long Josephson junctions were comprehensively hitherto explored,
little is known about soliton-sustained coherent thermal transport. We
demonstrate that the soliton configuration determines the temperature profile
in the junction, so that, in correspondence of each magnetically induced
soliton, both the flowing thermal power and the temperature significantly
enhance. Finally, we thoroughly discuss a fast solitonic Josephson heat
oscillator, whose frequency is in tune with the oscillation frequency of the
magnetic drive. Notably, the proposed heat oscillator can effectively find
application as a tunable thermal source for nanoscale heat engines and coherent
thermal machines.
| cond-mat.mes-hall cond-mat.supr-con | since its recent foundation phasecoherent caloritronics has sparkled continuous interest giving rise to numerous concrete applications this research field deals with the coherent manipulation of heat currents in mesoscopic superconducting devices by mastering the josephson phase difference here we introduce a new generation of devices for fast caloritronics able to control local heat power and temperature through manipulation of josephson vortices ie solitons although most salient features concerning josephson vortices in long josephson junctions were comprehensively hitherto explored little is known about solitonsustained coherent thermal transport we demonstrate that the soliton configuration determines the temperature profile in the junction so that in correspondence of each magnetically induced soliton both the flowing thermal power and the temperature significantly enhance finally we thoroughly discuss a fast solitonic josephson heat oscillator whose frequency is in tune with the oscillation frequency of the magnetic drive notably the proposed heat oscillator can effectively find application as a tunable thermal source for nanoscale heat engines and coherent thermal machines | [['since', 'its', 'recent', 'foundation', 'phasecoherent', 'caloritronics', 'has', 'sparkled', 'continuous', 'interest', 'giving', 'rise', 'to', 'numerous', 'concrete', 'applications', 'this', 'research', 'field', 'deals', 'with', 'the', 'coherent', 'manipulation', 'of', 'heat', 'currents', 'in', 'mesoscopic', 'superconducting', 'devices', 'by', 'mastering', 'the', 'josephson', 'phase', 'difference', 'here', 'we', 'introduce', 'a', 'new', 'generation', 'of', 'devices', 'for', 'fast', 'caloritronics', 'able', 'to', 'control', 'local', 'heat', 'power', 'and', 'temperature', 'through', 'manipulation', 'of', 'josephson', 'vortices', 'ie', 'solitons', 'although', 'most', 'salient', 'features', 'concerning', 'josephson', 'vortices', 'in', 'long', 'josephson', 'junctions', 'were', 'comprehensively', 'hitherto', 'explored', 'little', 'is', 'known', 'about', 'solitonsustained', 'coherent', 'thermal', 'transport', 'we', 'demonstrate', 'that', 'the', 'soliton', 'configuration', 'determines', 'the', 'temperature', 'profile', 'in', 'the', 'junction', 'so', 'that', 'in', 'correspondence', 'of', 'each', 'magnetically', 'induced', 'soliton', 'both', 'the', 'flowing', 'thermal', 'power', 'and', 'the', 'temperature', 'significantly', 'enhance', 'finally', 'we', 'thoroughly', 'discuss', 'a', 'fast', 'solitonic', 'josephson', 'heat', 'oscillator', 'whose', 'frequency', 'is', 'in', 'tune', 'with', 'the', 'oscillation', 'frequency', 'of', 'the', 'magnetic', 'drive', 'notably', 'the', 'proposed', 'heat', 'oscillator', 'can', 'effectively', 'find', 'application', 'as', 'a', 'tunable', 'thermal', 'source', 'for', 'nanoscale', 'heat', 'engines', 'and', 'coherent', 'thermal', 'machines']] | [-0.20712603913924807, 0.19220878237593966, -0.011373543891952269, 0.016710313172855724, -0.11310403488783373, -0.17128670560540976, 0.06819520186831209, 0.39624301176288246, -0.27260686038708726, -0.2567948838695884, 0.05635038663469324, -0.26317940479615864, -0.11116620092825205, 0.29844185837147824, -0.01062454983525921, 0.04280182013301075, -0.017908740953260595, 0.007806842747132903, -0.021514885135449146, -0.1256362819594308, 0.26589904808910725, 0.03439992686617188, 0.37275441633221224, 0.08772264697221051, 0.09574865371299286, -0.07242825120273563, 0.03340164762576697, 0.010773922236245355, -0.15301039287531934, 0.05472113350751223, 0.2681063834224241, -0.03908640484865985, 0.21853960137368744, -0.5027761738862336, -0.2586680154753044, 0.09763575214746209, 0.15857642321372376, 0.16343454414289474, -0.07126448386963917, -0.27366331264514615, 0.01761138114940237, -0.16316059905206381, -0.10414149244096746, -0.13860066328485163, 0.03881770050523941, 0.06479976513641483, -0.16862018573684273, 0.05769271238773118, 0.0819007642689322, 0.0388878332565964, -0.023494351724411337, -0.04164033736509018, -0.02808645001848309, 0.07056834406426384, -0.01587059656244323, -0.00561870201519564, 0.203357175659075, -0.18778898645290115, -0.13813983437455732, 0.28967584382144757, -0.07282913176315538, -0.11280923111530963, 0.15974725373980395, -0.1229606472691636, -0.043429856251833245, 0.11103935940995996, 0.12419190230480406, 0.09110120407889172, -0.18787846353999482, 0.03685939388046398, 0.012187599164238314, 0.16333528973282901, 0.09313499983285128, 0.1110431042752792, 0.31414966241393333, 0.24377809549009222, 0.06797255314944059, 0.20557747930748227, -0.10642198430745069, -0.08845208668621418, -0.24255635437015213, -0.15793825457746416, -0.18389978798474244, 0.0817884330186464, -0.021519262993001855, -0.18621608115916635, 0.4450972534969081, 0.19579072085922056, 0.13968834408305952, -0.0716413388022992, 0.32286197377115855, 0.14003978421793745, 0.05880716548841677, 0.06944819938471931, 0.2434094425601264, 0.20056794391209146, 0.21041813556300362, -0.3209233757386553, 0.010378736198483104, -0.015305760072222278] |
1,803.02589 | Performing Mathematical Operations using High-Index Acoustic
Metamaterials | The recent breakthrough in metamaterial-based optical computing devices
[Science 343, 160 (2014)] has inspired a quest for similar systems in
acoustics, performing mathematical operations on sound waves. So far, acoustic
analog computing has been demonstrated using thin planar metamaterials,
carrying out the operator of choice in Fourier domain. These so-called
filtering metasurfaces, however, are always accompanied with additional Fourier
transform sub-blocks, enlarging the computing system and preventing its
applicability in miniaturized architectures. Here, employing a simple
high-index acoustic slab waveguide, we demonstrate a highly compact and
potentially integrable acoustic computing system. The system directly performs
mathematical operation in spatial domain and is therefore free of any Fourier
bulk lens. Such compact computing system is highly promising for various
applications including high throughput image processing, ultrafast equation
solving, and real time signal processing.
| physics.app-ph | the recent breakthrough in metamaterialbased optical computing devices science 343 160 2014 has inspired a quest for similar systems in acoustics performing mathematical operations on sound waves so far acoustic analog computing has been demonstrated using thin planar metamaterials carrying out the operator of choice in fourier domain these socalled filtering metasurfaces however are always accompanied with additional fourier transform subblocks enlarging the computing system and preventing its applicability in miniaturized architectures here employing a simple highindex acoustic slab waveguide we demonstrate a highly compact and potentially integrable acoustic computing system the system directly performs mathematical operation in spatial domain and is therefore free of any fourier bulk lens such compact computing system is highly promising for various applications including high throughput image processing ultrafast equation solving and real time signal processing | [['the', 'recent', 'breakthrough', 'in', 'metamaterialbased', 'optical', 'computing', 'devices', 'science', '343', '160', '2014', 'has', 'inspired', 'a', 'quest', 'for', 'similar', 'systems', 'in', 'acoustics', 'performing', 'mathematical', 'operations', 'on', 'sound', 'waves', 'so', 'far', 'acoustic', 'analog', 'computing', 'has', 'been', 'demonstrated', 'using', 'thin', 'planar', 'metamaterials', 'carrying', 'out', 'the', 'operator', 'of', 'choice', 'in', 'fourier', 'domain', 'these', 'socalled', 'filtering', 'metasurfaces', 'however', 'are', 'always', 'accompanied', 'with', 'additional', 'fourier', 'transform', 'subblocks', 'enlarging', 'the', 'computing', 'system', 'and', 'preventing', 'its', 'applicability', 'in', 'miniaturized', 'architectures', 'here', 'employing', 'a', 'simple', 'highindex', 'acoustic', 'slab', 'waveguide', 'we', 'demonstrate', 'a', 'highly', 'compact', 'and', 'potentially', 'integrable', 'acoustic', 'computing', 'system', 'the', 'system', 'directly', 'performs', 'mathematical', 'operation', 'in', 'spatial', 'domain', 'and', 'is', 'therefore', 'free', 'of', 'any', 'fourier', 'bulk', 'lens', 'such', 'compact', 'computing', 'system', 'is', 'highly', 'promising', 'for', 'various', 'applications', 'including', 'high', 'throughput', 'image', 'processing', 'ultrafast', 'equation', 'solving', 'and', 'real', 'time', 'signal', 'processing']] | [-0.15832003745405623, 0.08090771932973329, -0.06849342935619819, -0.030872824634019653, -0.15157958314838735, -0.17163793017353976, -0.015183547367059597, 0.4396190952454962, -0.27198689167077345, -0.2870252179828557, 0.15602889804215397, -0.2642511048664649, -0.20739667302449094, 0.3114235765568799, -0.05740319220631412, 0.16621986831093885, 0.05677900493681205, -0.06720601537293105, -0.05420591189370801, -0.1554763545149895, 0.218391136268055, 0.047544068609898786, 0.3520823686690578, 0.005963199547929407, 0.11784215472906714, 0.027145825033640547, -0.04395688104683138, -0.02515181899158933, -0.02806860578482773, 0.13524194598148548, 0.2932678172629411, 0.10043791546151183, 0.2644565274205172, -0.469954102293052, -0.28188861667347903, 0.07082214345890944, 0.18083985739521627, 0.10833828541393759, -0.12882274916487266, -0.2887880378120551, 0.04760060183506346, -0.1306410963668234, -0.09913996510923342, -0.11831168356619662, 0.048307399872238886, -0.019286116992589086, -0.18906196292047037, 0.01620432949328626, 0.043894320941586615, 0.07349543295673687, -0.03921617626331157, -0.09753727808129042, 0.051986062972432454, 0.07145558575707996, -0.1088997252306647, 0.011477373199974836, 0.15858923848436185, -0.12410513169456724, -0.12321312823615065, 0.3947095696913135, -0.013892978883108519, -0.19025142676422768, 0.20016106485678448, -0.1187438772758469, -0.07615877476619613, 0.1360197348985821, 0.183116377391288, 0.08609298515401667, -0.14868288839264124, 0.10906845713422324, 0.031567547156803565, 0.17255502365614203, 0.14341949234420265, 0.10862649467449184, 0.2379893382259814, 0.24751658530934065, 0.03430005991355178, 0.1332753244434681, -0.06723768537234388, -0.02391225286533661, -0.20176551680461588, -0.1620367301141166, -0.2615113833453506, 0.017894349875859916, -0.07531481256283411, -0.18489132907107528, 0.37045316285256186, 0.12783289364200423, 0.09035845213061706, -0.008016434591616306, 0.35780451579414535, 0.14479676844679157, 0.10678286527664485, 0.09030838179486719, 0.22567673289626272, 0.14525157090093038, 0.17844654311204178, -0.18080708201777076, -0.03980533420337562, 0.011759979939652663] |
1,803.0259 | GPSP: Graph Partition and Space Projection based Approach for
Heterogeneous Network Embedding | In this paper, we propose GPSP, a novel Graph Partition and Space Projection
based approach, to learn the representation of a heterogeneous network that
consists of multiple types of nodes and links. Concretely, we first partition
the heterogeneous network into homogeneous and bipartite subnetworks. Then, the
projective relations hidden in bipartite subnetworks are extracted by learning
the projective embedding vectors. Finally, we concatenate the projective
vectors from bipartite subnetworks with the ones learned from homogeneous
subnetworks to form the final representation of the heterogeneous network.
Extensive experiments are conducted on a real-life dataset. The results
demonstrate that GPSP outperforms the state-of-the-art baselines in two key
network mining tasks: node classification and clustering.
| cs.SI cs.AI | in this paper we propose gpsp a novel graph partition and space projection based approach to learn the representation of a heterogeneous network that consists of multiple types of nodes and links concretely we first partition the heterogeneous network into homogeneous and bipartite subnetworks then the projective relations hidden in bipartite subnetworks are extracted by learning the projective embedding vectors finally we concatenate the projective vectors from bipartite subnetworks with the ones learned from homogeneous subnetworks to form the final representation of the heterogeneous network extensive experiments are conducted on a reallife dataset the results demonstrate that gpsp outperforms the stateoftheart baselines in two key network mining tasks node classification and clustering | [['in', 'this', 'paper', 'we', 'propose', 'gpsp', 'a', 'novel', 'graph', 'partition', 'and', 'space', 'projection', 'based', 'approach', 'to', 'learn', 'the', 'representation', 'of', 'a', 'heterogeneous', 'network', 'that', 'consists', 'of', 'multiple', 'types', 'of', 'nodes', 'and', 'links', 'concretely', 'we', 'first', 'partition', 'the', 'heterogeneous', 'network', 'into', 'homogeneous', 'and', 'bipartite', 'subnetworks', 'then', 'the', 'projective', 'relations', 'hidden', 'in', 'bipartite', 'subnetworks', 'are', 'extracted', 'by', 'learning', 'the', 'projective', 'embedding', 'vectors', 'finally', 'we', 'concatenate', 'the', 'projective', 'vectors', 'from', 'bipartite', 'subnetworks', 'with', 'the', 'ones', 'learned', 'from', 'homogeneous', 'subnetworks', 'to', 'form', 'the', 'final', 'representation', 'of', 'the', 'heterogeneous', 'network', 'extensive', 'experiments', 'are', 'conducted', 'on', 'a', 'reallife', 'dataset', 'the', 'results', 'demonstrate', 'that', 'gpsp', 'outperforms', 'the', 'stateoftheart', 'baselines', 'in', 'two', 'key', 'network', 'mining', 'tasks', 'node', 'classification', 'and', 'clustering']] | [-0.12668239195746453, 0.017082273689183324, -0.04434289563531903, 0.007999631012154913, -0.08289847876029936, -0.14930928652280603, 0.03909933130912991, 0.4281200000846928, -0.2991707597012547, -0.256849874784662, 0.039527076259467074, -0.30472873644056647, -0.2507056601345539, 0.10922704239121893, -0.052997332758439535, 0.039957656526133756, 0.18030531713739037, 0.08061684490795332, -0.06955483628182926, -0.313521309940155, 0.43431879758453845, -0.04508699840781363, 0.3726601813496514, -0.018699743209237403, 0.14466240030967376, 0.0089185973206027, -0.05642316561848433, 0.04030440333907873, -0.05821804041109069, 0.19729371915613725, 0.33850844052027573, 0.2275654364715923, 0.25740215189077637, -0.44519738626920363, -0.211799470750107, 0.15240464167330753, 0.13558337884023786, 0.0841357396915555, 0.0541637457261624, -0.37749095190401105, 0.06974004805088044, -0.16114992278374055, 0.05918869075196033, -0.12439242877404798, -0.051919288526881824, 0.0072486413642764095, -0.29051768922839655, 0.015510057087522, 0.04890598056160591, 0.02633425502783873, -0.04370227490805767, -0.10540025520074943, -0.021286597674373877, 0.16939158300784501, -0.06006209584037689, 0.023572679846124215, 0.11097709642807868, -0.15038906242910094, -0.18994942787950012, 0.32860978887501086, -0.015899564887248828, -0.21980832731351257, 0.18231531730747189, -0.026296385779807512, -0.19947266393256458, 0.07141184855083173, 0.25302267620678653, 0.09274723826145584, -0.15799114052417942, -0.020371914860284463, -0.1373261290856383, 0.14920942989093336, 0.04344283994075588, -0.006885329322804781, 0.14659093250943855, 0.2601942070167173, 0.04096365614201535, 0.21006179838335481, -0.10960046214432541, -0.07472249628891321, -0.2384049823449459, -0.10998336627910082, -0.24165079717270352, 0.001790664412758567, -0.19132499723557636, -0.11671079421820733, 0.47496504352047025, 0.14864476351067424, 0.2378276521763341, 0.12724361424757677, 0.31892379647628827, -0.05192307442934676, 0.07571489082395354, 0.1432589107955044, 0.1127655136144974, 0.07231107925869186, 0.05604822529395195, -0.1296251908029345, 0.061267345352098344, 0.10584398111836477] |
1,803.02591 | Edge currents as a probe of the strongly spin-polarized topological
noncentrosymmetric superconductors | Recently the influence of antisymmetric spin-orbit coupling has been studied
in novel topological superconductors such as half-Heuslers and artificial
hetero-structures. We investigate the effect of Rashba and/or Dresselhaus
spin-orbit couplings on the band structure and topological properties of a
two-dimensional noncentrosymetric superconductor. For this goal, the
topological helical edge modes are analyzed for different spin-orbit couplings
as well as for several superconducting pairing symmetries. To explore the
transport properties, we examine the response of the spin-polarized edge states
to an exchange field in a superconductor-ferromagnet heterostructure. The
broken chiral symmetry causes the uni-directional currents at opposite edges.
| cond-mat.supr-con cond-mat.str-el | recently the influence of antisymmetric spinorbit coupling has been studied in novel topological superconductors such as halfheuslers and artificial heterostructures we investigate the effect of rashba andor dresselhaus spinorbit couplings on the band structure and topological properties of a twodimensional noncentrosymetric superconductor for this goal the topological helical edge modes are analyzed for different spinorbit couplings as well as for several superconducting pairing symmetries to explore the transport properties we examine the response of the spinpolarized edge states to an exchange field in a superconductorferromagnet heterostructure the broken chiral symmetry causes the unidirectional currents at opposite edges | [['recently', 'the', 'influence', 'of', 'antisymmetric', 'spinorbit', 'coupling', 'has', 'been', 'studied', 'in', 'novel', 'topological', 'superconductors', 'such', 'as', 'halfheuslers', 'and', 'artificial', 'heterostructures', 'we', 'investigate', 'the', 'effect', 'of', 'rashba', 'andor', 'dresselhaus', 'spinorbit', 'couplings', 'on', 'the', 'band', 'structure', 'and', 'topological', 'properties', 'of', 'a', 'twodimensional', 'noncentrosymetric', 'superconductor', 'for', 'this', 'goal', 'the', 'topological', 'helical', 'edge', 'modes', 'are', 'analyzed', 'for', 'different', 'spinorbit', 'couplings', 'as', 'well', 'as', 'for', 'several', 'superconducting', 'pairing', 'symmetries', 'to', 'explore', 'the', 'transport', 'properties', 'we', 'examine', 'the', 'response', 'of', 'the', 'spinpolarized', 'edge', 'states', 'to', 'an', 'exchange', 'field', 'in', 'a', 'superconductorferromagnet', 'heterostructure', 'the', 'broken', 'chiral', 'symmetry', 'causes', 'the', 'unidirectional', 'currents', 'at', 'opposite', 'edges']] | [-0.30864089995156974, 0.21007982428651908, 0.012354139500530437, 0.05833720642961756, -0.09858247385515521, -0.16537672706181183, 0.020639097601815592, 0.40756576717831194, -0.2714261196476097, -0.2733155910197335, -0.05392165698867757, -0.3051163003353092, -0.16301050512508178, 0.10224122781073675, 0.07252550709623999, 0.052922641955471285, -0.11692129058549956, -0.07840799084806349, -0.10721042352573325, -0.1892914698085709, 0.33287354157073423, -0.04688353250579288, 0.3578142032735438, 0.11974509910699756, -0.0038814771918017263, 0.01774582749446078, 0.1671894483467137, 0.012774062905615816, -0.15057192754466087, 0.02372804526081988, 0.21305871190755474, -0.20266398068876393, 0.16897352017258527, -0.5135375593478481, -0.2253308141565261, -0.01695561866411784, 0.12788294219232435, 0.1793798502185382, -0.0816075326159383, -0.33500584680587053, 0.04848527780268341, -0.20721962729779383, -0.11601443418476265, -0.11068117513787001, 0.010774146820040187, -0.04609304247120841, -0.2292789213127738, 0.015970320557244122, 0.06280485093520838, 0.10581842720663796, -0.05628446670016274, -0.11596265745659669, -0.14420015611055229, 0.06434929066260035, 0.08675894258582655, 0.001291248185831743, 0.10883893144273316, -0.19283401255718977, -0.18753193806818066, 0.3670162972412072, -0.0755896142218262, -0.15147685332340188, 0.1696208417415619, -0.10667079305858351, -0.09185342686153793, 0.051660677699449785, 0.178659081585162, 0.06016620511945803, -0.13002309223581202, 0.12998463872039187, -0.03293353948780956, 0.0677851816326438, 0.007590790798227924, 0.16237366991723926, 0.3141788422362879, 0.16430602894009402, 0.07997058306743081, 0.15495050102375293, -0.12636921168935564, -0.030755839208723046, -0.21516602595026293, -0.18021836962725502, -0.25730074696669664, 0.06358382227820887, 0.002994312883250435, -0.19415804831078276, 0.48541536174404126, 0.14069055109090792, 0.17920144034239152, -0.10456813947530463, 0.2375963804855322, 0.09764909365791634, 0.1184491401509149, 0.005613328190520406, 0.3037568601430394, 0.22986850686356775, 0.049829639072413556, -0.3567161076158906, 0.054177737823920324, 0.019246386689095136] |
1,803.02592 | Foundations of Temporal Text Networks | Three fundamental elements to understand human information networks are the
individuals (actors) in the network, the information they exchange, that is
often observable online as text content (emails, social media posts, etc.), and
the time when these exchanges happen. An extremely large amount of research has
addressed some of these aspects either in isolation or as combinations of two
of them. There are also more and more works studying systems where all three
elements are present, but typically using ad hoc models and algorithms that
cannot be easily transfered to other contexts. To address this heterogeneity,
in this article we present a simple, expressive and extensible model for
temporal text networks, that we claim can be used as a common ground across
different types of networks and analysis tasks, and we show how simple
procedures to produce views of the model allow the direct application of
analysis methods already developed in other domains, from traditional data
mining to multilayer network mining.
| cs.SI physics.soc-ph | three fundamental elements to understand human information networks are the individuals actors in the network the information they exchange that is often observable online as text content emails social media posts etc and the time when these exchanges happen an extremely large amount of research has addressed some of these aspects either in isolation or as combinations of two of them there are also more and more works studying systems where all three elements are present but typically using ad hoc models and algorithms that cannot be easily transfered to other contexts to address this heterogeneity in this article we present a simple expressive and extensible model for temporal text networks that we claim can be used as a common ground across different types of networks and analysis tasks and we show how simple procedures to produce views of the model allow the direct application of analysis methods already developed in other domains from traditional data mining to multilayer network mining | [['three', 'fundamental', 'elements', 'to', 'understand', 'human', 'information', 'networks', 'are', 'the', 'individuals', 'actors', 'in', 'the', 'network', 'the', 'information', 'they', 'exchange', 'that', 'is', 'often', 'observable', 'online', 'as', 'text', 'content', 'emails', 'social', 'media', 'posts', 'etc', 'and', 'the', 'time', 'when', 'these', 'exchanges', 'happen', 'an', 'extremely', 'large', 'amount', 'of', 'research', 'has', 'addressed', 'some', 'of', 'these', 'aspects', 'either', 'in', 'isolation', 'or', 'as', 'combinations', 'of', 'two', 'of', 'them', 'there', 'are', 'also', 'more', 'and', 'more', 'works', 'studying', 'systems', 'where', 'all', 'three', 'elements', 'are', 'present', 'but', 'typically', 'using', 'ad', 'hoc', 'models', 'and', 'algorithms', 'that', 'can', 'not', 'be', 'easily', 'transfered', 'to', 'other', 'contexts', 'to', 'address', 'this', 'heterogeneity', 'in', 'this', 'article', 'we', 'present', 'a', 'simple', 'expressive', 'and', 'extensible', 'model', 'for', 'temporal', 'text', 'networks', 'that', 'we', 'claim', 'can', 'be', 'used', 'as', 'a', 'common', 'ground', 'across', 'different', 'types', 'of', 'networks', 'and', 'analysis', 'tasks', 'and', 'we', 'show', 'how', 'simple', 'procedures', 'to', 'produce', 'views', 'of', 'the', 'model', 'allow', 'the', 'direct', 'application', 'of', 'analysis', 'methods', 'already', 'developed', 'in', 'other', 'domains', 'from', 'traditional', 'data', 'mining', 'to', 'multilayer', 'network', 'mining']] | [-0.0855805151089796, 0.07098217399003642, -0.056506824336175654, 0.11014889679880767, -0.12088116356689069, -0.1682657680336248, 0.04215905750112861, 0.45772497293849784, -0.2947378455787713, -0.3230047641080563, 0.1317174423394012, -0.2977817456157487, -0.19761074745573426, 0.18788482662847977, -0.06927874543485635, 0.015135950992389777, 0.08851454312407216, 0.05076809358110444, -0.003908310613715676, -0.2752391332473008, 0.3271764609962702, 0.0007749710398737663, 0.30336321813893724, 0.04833320461006628, 0.0333871617575498, -0.01767118442458687, -0.06219280411397325, 0.044696549469616584, -0.06504416460940078, 0.17349967183502116, 0.3608720198464855, 0.21295126869225908, 0.2953207142375134, -0.47959238931214737, -0.23702496209937826, 0.13067862976854092, 0.17504969751749785, 0.12695718742044712, -0.007911000585644852, -0.2850165760121596, 0.08997648759216162, -0.19482620470053344, -0.03139188605717119, -0.14054347307386775, 0.0038484976293496143, 0.028915955271157954, -0.23947202951365645, 0.016534858534506373, 0.05930604063762053, 0.08153753347671878, -0.0017782053148465945, -0.10162047172298679, 0.01618631378988977, 0.2080325741634523, 0.08272050981363857, -0.03616117515434499, 0.13256321966153695, -0.1545940100008415, -0.1494200376011891, 0.40037865262984496, -0.01351469607282154, -0.21009560163351304, 0.2462210836805932, -0.04683737526504024, -0.17417930075783788, 0.047194699158915034, 0.2235683251005586, 0.10881414818347512, -0.2165399940364116, -0.020961908138512324, -0.02972766646057551, 0.18928445201298152, 0.052801240491393356, 0.03465681689515434, 0.18430204930812993, 0.1726816275809535, 0.02200619035894856, 0.07511091616254782, -0.03433114869601271, -0.08234745773118864, -0.2132538435836955, -0.12086119139739485, -0.14718135166410243, 0.000685207065813571, -0.0840123259867714, -0.1448648081097844, 0.3654529009313311, 0.19889500084977, 0.19419940950544437, 0.016195820029185407, 0.3245336994195334, 0.03040462611372479, 0.11515249409655362, 0.07447432762767867, 0.16333671169658048, 0.02174794497428301, 0.16972050655426252, -0.08669244341500518, 0.11254958200475408, -0.01573716631061455] |
1,803.02593 | wARP-Path: Implications of adapting the Ethernet-based ARP-Path bridging
protocol to a wireless environment | The ARP-Path protocol has flourished as a promise for wired networks,
creating shortest paths with the simplicity of pure bridging and competing
directly with TRILL and SPB. After analyzing different alternatives of ARP-Path
and creating the All-Path family, the idea of migrating the protocol to
wireless networks appeared to be a good alternative to protocols such as a
AODV. In this article, we check the implications of adapting ARP-Path to a
wireless environment, and we prove that good ideas for wired networks might not
be directly applicable to wireless networks, as not only the media differs, but
also the characterization of these networks varies.
| cs.NI | the arppath protocol has flourished as a promise for wired networks creating shortest paths with the simplicity of pure bridging and competing directly with trill and spb after analyzing different alternatives of arppath and creating the allpath family the idea of migrating the protocol to wireless networks appeared to be a good alternative to protocols such as a aodv in this article we check the implications of adapting arppath to a wireless environment and we prove that good ideas for wired networks might not be directly applicable to wireless networks as not only the media differs but also the characterization of these networks varies | [['the', 'arppath', 'protocol', 'has', 'flourished', 'as', 'a', 'promise', 'for', 'wired', 'networks', 'creating', 'shortest', 'paths', 'with', 'the', 'simplicity', 'of', 'pure', 'bridging', 'and', 'competing', 'directly', 'with', 'trill', 'and', 'spb', 'after', 'analyzing', 'different', 'alternatives', 'of', 'arppath', 'and', 'creating', 'the', 'allpath', 'family', 'the', 'idea', 'of', 'migrating', 'the', 'protocol', 'to', 'wireless', 'networks', 'appeared', 'to', 'be', 'a', 'good', 'alternative', 'to', 'protocols', 'such', 'as', 'a', 'aodv', 'in', 'this', 'article', 'we', 'check', 'the', 'implications', 'of', 'adapting', 'arppath', 'to', 'a', 'wireless', 'environment', 'and', 'we', 'prove', 'that', 'good', 'ideas', 'for', 'wired', 'networks', 'might', 'not', 'be', 'directly', 'applicable', 'to', 'wireless', 'networks', 'as', 'not', 'only', 'the', 'media', 'differs', 'but', 'also', 'the', 'characterization', 'of', 'these', 'networks', 'varies']] | [-0.15888511063304991, 0.05713211736885957, -0.05140225745475335, 0.04389225701729143, -0.08670589199868366, -0.21007981074485674, 0.08598982611246117, 0.4112382051941839, -0.2769190114515933, -0.2774214148069325, 0.08451749395140565, -0.2453151729355738, -0.18863746977763848, 0.21823061837190852, -0.10664424000000491, 0.049657254063895026, 0.06698015896327685, -0.008596828858395225, -0.01963025201971019, -0.2340665829268474, 0.2921026571828548, 0.06450809209914968, 0.32277193339993654, 0.08825799974655842, 0.05025740431675923, 0.01102524578743117, -0.017106553743078002, 0.01789007182639924, -0.0969687390700802, 0.14617514069128817, 0.28578263687566646, 0.17377827214122324, 0.2817988978942983, -0.43601770044385807, -0.29881600019277876, 0.17242172535834382, 0.16191093679698346, 0.1361310091773862, -0.022100578390007602, -0.27921008055541413, 0.13625649960024408, -0.22682756289514233, -0.11100981463180873, -0.04174746997943781, 0.007277224468320464, 0.07015330513297281, -0.2567318553405642, -0.03895776801391107, 0.04056640885752237, 0.009958161845875597, -0.019401135754961413, -0.06817624467488342, -0.0020843667715100696, 0.1855083616920611, 0.02277694797161424, 0.03383502792973903, 0.10361902857000388, -0.1330728334605296, -0.1596872755755824, 0.3814761089177992, -0.015534122831649283, -0.14445379362622437, 0.2357752543367735, -0.009257089500360697, -0.13537333770067367, 0.03343912417711057, 0.15123374940086048, 0.09396766869560928, -0.17723760241642594, -0.013502743635417043, -0.021336266562993665, 0.1175664417328114, 0.07834230116523296, 0.09291971874088772, 0.17792209999147549, 0.2076610374508552, 0.0905852688847164, 0.105657490832704, -0.03416100835192551, -0.13181622107558458, -0.19784582009340085, -0.1727170983184744, -0.20402000204081314, 0.046543148260629164, -0.08514575720527345, -0.1579402730578683, 0.39151829658347426, 0.1593627386446138, 0.16293874460733632, 0.09040000985910013, 0.317941555407495, 0.01635747872749615, 0.11118093376201622, 0.11048274893015261, 0.22550287005012332, 0.11430241315833574, 0.17936948977085282, -0.0989188333064571, 0.10658410667595498, -0.011711206276266999] |
1,803.02594 | The Electron in the Maze | This chapter presents a physical method to solve a maze using an electric
circuit. The temperature increase due to Joule heating is observed with a
thermal camera and the correct path is instantaneously enlightened. Various
mazes are simulated with Kirchhoff's circuit laws. Finally, the physical
mechanisms explaining how the electric current chooses the correct path are
discussed.
| physics.pop-ph | this chapter presents a physical method to solve a maze using an electric circuit the temperature increase due to joule heating is observed with a thermal camera and the correct path is instantaneously enlightened various mazes are simulated with kirchhoffs circuit laws finally the physical mechanisms explaining how the electric current chooses the correct path are discussed | [['this', 'chapter', 'presents', 'a', 'physical', 'method', 'to', 'solve', 'a', 'maze', 'using', 'an', 'electric', 'circuit', 'the', 'temperature', 'increase', 'due', 'to', 'joule', 'heating', 'is', 'observed', 'with', 'a', 'thermal', 'camera', 'and', 'the', 'correct', 'path', 'is', 'instantaneously', 'enlightened', 'various', 'mazes', 'are', 'simulated', 'with', 'kirchhoffs', 'circuit', 'laws', 'finally', 'the', 'physical', 'mechanisms', 'explaining', 'how', 'the', 'electric', 'current', 'chooses', 'the', 'correct', 'path', 'are', 'discussed']] | [-0.12433840438168038, 0.1589366281346373, -0.06739991607569289, 0.02924261723538828, -0.10836610680021215, -0.1782541233278288, 0.03132634590330877, 0.3963214115876901, -0.28346152420629533, -0.37307703187852576, 0.0543908222431415, -0.25770055010849446, -0.15417481880438955, 0.22259075295898997, -0.10654104351098731, 0.04125687580457643, 0.012819617365797361, -0.00381955102478203, 0.016428339981326933, -0.20709121683939247, 0.24033100365685592, 0.09657700854075844, 0.294349701584954, 0.08770984960229773, 0.13442745770474798, -0.04781392121099328, -0.02201430110685658, 0.061117530375588355, -0.08313680272712781, 0.0492613675366891, 0.223504980286714, 0.0811411133852967, 0.23486287530773042, -0.5195880589124403, -0.20473572593835884, 0.06859505245167959, 0.08791617400282503, 0.14717015382229237, -0.06825279699957096, -0.2040051829086192, 0.06088592842417328, -0.12332238964409682, -0.16002093935221956, -0.013009615152616772, 0.017619993750071318, 0.034048778903588914, -0.25032415334135294, 0.010185506145812963, 0.017374073147054827, 0.010926222657425362, -0.08816434225688378, -0.07950593969833694, 0.01232867703258403, 0.13474922546332604, 0.014703359652980509, 0.04488980204781942, 0.24935980554539383, -0.13362020895849064, -0.15278448618687035, 0.3737248554825783, 0.03771299074236467, -0.15789469815749807, 0.14688402486213467, -0.07693279413669779, -0.031617891517255386, 0.13561519358731938, 0.10484192144583192, 0.05592469275487881, -0.2552494115702677, 0.032587607381987925, -0.0020803296775148625, 0.12665234079274038, 0.03776332387994779, -0.03014494800580698, 0.25106325935855256, 0.20800685921781942, 0.029761421869982752, 0.18011562521324345, -0.07629820965884025, -0.10618920888947814, -0.3183241423807646, -0.1336445150602805, -0.14168870331425415, 0.07405963665070503, -0.06217627278748663, -0.1460492327204791, 0.3862829794780466, 0.26114982369829687, 0.16048453963900866, 0.045777177662801066, 0.39942793482751177, 0.1954379705957284, 0.02980880858887216, 0.08066394410439227, 0.21410926691207446, 0.14314031040524705, 0.17261579348460623, -0.28153948057769684, 0.08543117042108063, 0.02662284952882481] |
1,803.02595 | Ni Foam Assisted Synthesis of High Quality Hexagonal Boron Nitride with
Large Domain Size and Controllable Thickness | The scalable synthesis of two-dimensional (2D) hexagonal boron nitride (h-BN)
is of great interest for its numerous applications in novel electronic devices.
Highly-crystalline h-BN films, with single-crystal sizes up to hundreds of
microns, are demonstrated via a novel Ni foam assisted technique reported here
for the first time. The nucleation density of h-BN domains can be significantly
reduced due to the high boron solubility, as well as the large specific surface
area of the Ni foam. The crystalline structure of the h-BN domains is found to
be well aligned with, and therefore strongly dependent upon, the underlying Pt
lattice orientation. Growth-time dependent experiments confirm the presence of
a surface mediated self-limiting growth mechanism for monolayer h-BN on the Pt
substrate. However, utilizing remote catalysis from the Ni foam, bilayer h-BN
films can be synthesized breaking the self-limiting effect. This work provides
further understanding of the mechanisms involved in the growth of h-BN and
proposes a facile synthesis technique that may be applied to further
applications in which control over the crystal alignment, and the numbers of
layers is crucial.
| cond-mat.mtrl-sci | the scalable synthesis of twodimensional 2d hexagonal boron nitride hbn is of great interest for its numerous applications in novel electronic devices highlycrystalline hbn films with singlecrystal sizes up to hundreds of microns are demonstrated via a novel ni foam assisted technique reported here for the first time the nucleation density of hbn domains can be significantly reduced due to the high boron solubility as well as the large specific surface area of the ni foam the crystalline structure of the hbn domains is found to be well aligned with and therefore strongly dependent upon the underlying pt lattice orientation growthtime dependent experiments confirm the presence of a surface mediated selflimiting growth mechanism for monolayer hbn on the pt substrate however utilizing remote catalysis from the ni foam bilayer hbn films can be synthesized breaking the selflimiting effect this work provides further understanding of the mechanisms involved in the growth of hbn and proposes a facile synthesis technique that may be applied to further applications in which control over the crystal alignment and the numbers of layers is crucial | [['the', 'scalable', 'synthesis', 'of', 'twodimensional', '2d', 'hexagonal', 'boron', 'nitride', 'hbn', 'is', 'of', 'great', 'interest', 'for', 'its', 'numerous', 'applications', 'in', 'novel', 'electronic', 'devices', 'highlycrystalline', 'hbn', 'films', 'with', 'singlecrystal', 'sizes', 'up', 'to', 'hundreds', 'of', 'microns', 'are', 'demonstrated', 'via', 'a', 'novel', 'ni', 'foam', 'assisted', 'technique', 'reported', 'here', 'for', 'the', 'first', 'time', 'the', 'nucleation', 'density', 'of', 'hbn', 'domains', 'can', 'be', 'significantly', 'reduced', 'due', 'to', 'the', 'high', 'boron', 'solubility', 'as', 'well', 'as', 'the', 'large', 'specific', 'surface', 'area', 'of', 'the', 'ni', 'foam', 'the', 'crystalline', 'structure', 'of', 'the', 'hbn', 'domains', 'is', 'found', 'to', 'be', 'well', 'aligned', 'with', 'and', 'therefore', 'strongly', 'dependent', 'upon', 'the', 'underlying', 'pt', 'lattice', 'orientation', 'growthtime', 'dependent', 'experiments', 'confirm', 'the', 'presence', 'of', 'a', 'surface', 'mediated', 'selflimiting', 'growth', 'mechanism', 'for', 'monolayer', 'hbn', 'on', 'the', 'pt', 'substrate', 'however', 'utilizing', 'remote', 'catalysis', 'from', 'the', 'ni', 'foam', 'bilayer', 'hbn', 'films', 'can', 'be', 'synthesized', 'breaking', 'the', 'selflimiting', 'effect', 'this', 'work', 'provides', 'further', 'understanding', 'of', 'the', 'mechanisms', 'involved', 'in', 'the', 'growth', 'of', 'hbn', 'and', 'proposes', 'a', 'facile', 'synthesis', 'technique', 'that', 'may', 'be', 'applied', 'to', 'further', 'applications', 'in', 'which', 'control', 'over', 'the', 'crystal', 'alignment', 'and', 'the', 'numbers', 'of', 'layers', 'is', 'crucial']] | [-0.08541570461794651, 0.160767787784924, -0.018324213496179142, -0.05783056916035921, -0.04196514646435062, -0.13292276541953593, 0.0835638261986164, 0.44862687880215185, -0.2995052318418336, -0.31447053388849405, 0.053888655738549285, -0.2451056087693053, -0.17533233413816784, 0.21481573036374796, 0.0011993879426187009, 0.06898871046298685, -0.0010458900294988678, -0.13193494715895293, -0.05670926691911947, -0.230692788870911, 0.23672311097707893, 0.08161714389067394, 0.41151328164210355, 0.1384176306002721, 0.025457344645780793, -0.016141214358929044, 0.09094894781258753, 0.018844535703812674, -0.16895833503857308, 0.1497822538138566, 0.22308421466666994, -0.08574688322894443, 0.21058062600688696, -0.5060205575329869, -0.24290822502264878, -0.02334912393106085, 0.1456311402052348, 0.16337656005733028, -0.1446881183466267, -0.24439373692455754, 0.10904974923299081, -0.1260122158067573, -0.08885105038719436, -0.06462182412368737, -0.011728815450215336, 0.0005725891292723042, -0.22002192047945213, 0.05985583322975534, 0.04386224326013138, 0.05038872146011027, -0.08901289530306743, -0.10545107155509838, -0.14420240062152903, 0.08315716514539162, 0.02609479968603491, 0.01900421923256657, 0.2356694791193926, -0.09431778381217606, -0.12005970706074928, 0.41393722001505034, -0.0198348826582261, -0.1291009145736527, 0.1961129122306436, -0.14863778590558233, -0.09182214830070734, 0.1533667816089864, 0.1533428861159868, 0.1577789812202283, -0.14999467240295927, 0.08452434682979228, 0.01574679280126342, 0.21557060555748517, 0.1070292078630915, 0.05859797070420274, 0.2553333452369055, 0.27975603676756866, 0.0505741448125284, 0.16138587512201472, -0.10461352260265332, -0.006114643413751396, -0.16461570640395426, -0.23408521137336333, -0.23332384898683078, 0.08439249939316612, -0.11874687876998712, -0.22845251305196224, 0.3651553715338533, 0.10549786773955337, 0.1705690791249652, -0.060294156657987055, 0.22751382904995776, 0.04801557649298456, 0.15470844783998106, -0.05753328981338424, 0.22358234377127936, 0.15776649903404014, 0.11837080410312799, -0.21280601104915017, 0.13096835925453082, -0.027398607186094093] |
1,803.02596 | Revisiting differentially private linear regression: optimal and
adaptive prediction & estimation in unbounded domain | We revisit the problem of linear regression under a differential privacy
constraint. By consolidating existing pieces in the literature, we clarify the
correct dependence of the feature, label and coefficient domains in the
optimization error and estimation error, hence revealing the delicate price of
differential privacy in statistical estimation and statistical learning.
Moreover, we propose simple modifications of two existing DP algorithms: (a)
posterior sampling, (b) sufficient statistics perturbation, and show that they
can be upgraded into **adaptive** algorithms that are able to exploit
data-dependent quantities and behave nearly optimally **for every instance**.
Extensive experiments are conducted on both simulated data and real data, which
conclude that both AdaOPS and AdaSSP outperform the existing techniques on
nearly all 36 data sets that we test on.
| stat.ML cs.LG stat.ME | we revisit the problem of linear regression under a differential privacy constraint by consolidating existing pieces in the literature we clarify the correct dependence of the feature label and coefficient domains in the optimization error and estimation error hence revealing the delicate price of differential privacy in statistical estimation and statistical learning moreover we propose simple modifications of two existing dp algorithms a posterior sampling b sufficient statistics perturbation and show that they can be upgraded into adaptive algorithms that are able to exploit datadependent quantities and behave nearly optimally for every instance extensive experiments are conducted on both simulated data and real data which conclude that both adaops and adassp outperform the existing techniques on nearly all 36 data sets that we test on | [['we', 'revisit', 'the', 'problem', 'of', 'linear', 'regression', 'under', 'a', 'differential', 'privacy', 'constraint', 'by', 'consolidating', 'existing', 'pieces', 'in', 'the', 'literature', 'we', 'clarify', 'the', 'correct', 'dependence', 'of', 'the', 'feature', 'label', 'and', 'coefficient', 'domains', 'in', 'the', 'optimization', 'error', 'and', 'estimation', 'error', 'hence', 'revealing', 'the', 'delicate', 'price', 'of', 'differential', 'privacy', 'in', 'statistical', 'estimation', 'and', 'statistical', 'learning', 'moreover', 'we', 'propose', 'simple', 'modifications', 'of', 'two', 'existing', 'dp', 'algorithms', 'a', 'posterior', 'sampling', 'b', 'sufficient', 'statistics', 'perturbation', 'and', 'show', 'that', 'they', 'can', 'be', 'upgraded', 'into', 'adaptive', 'algorithms', 'that', 'are', 'able', 'to', 'exploit', 'datadependent', 'quantities', 'and', 'behave', 'nearly', 'optimally', 'for', 'every', 'instance', 'extensive', 'experiments', 'are', 'conducted', 'on', 'both', 'simulated', 'data', 'and', 'real', 'data', 'which', 'conclude', 'that', 'both', 'adaops', 'and', 'adassp', 'outperform', 'the', 'existing', 'techniques', 'on', 'nearly', 'all', '36', 'data', 'sets', 'that', 'we', 'test', 'on']] | [-0.08262807323514082, -0.0055302884107894775, -0.10638572162062657, 0.1328828825513128, -0.08260717616620951, -0.16844902105811166, 0.0744667212077515, 0.41324837834430417, -0.2859241471860588, -0.33063889515578626, 0.14157978977678662, -0.29199733063048583, -0.15222151227090963, 0.21393595456441, -0.11095273139606404, 0.12757994392432453, 0.09960442952853363, 0.00904108685861546, -0.08658644257632, -0.31127627252987244, 0.3126158234019711, 0.04154904204897764, 0.3211286368257389, -0.003173796068668759, 0.12473405578374348, 0.014063120246069824, -0.07154284038474949, 0.05573979837960011, -0.14442981910116676, 0.13093244246816702, 0.289794742856629, 0.189156405502794, 0.2895323918844626, -0.40485138224501244, -0.16546919430810503, 0.10760965636681492, 0.12182160277355925, 0.09045676431501269, -0.04868668613754728, -0.2757334233038279, 0.0757710979700115, -0.10375219194703107, 0.014674355628960804, -0.16640512400677776, -0.06275653296975585, 0.01632805178093353, -0.32845108682001994, 0.07051072539042348, 0.07029527610894747, 0.05067378040251693, -0.04857071256643631, -0.1506114550601176, 0.014382580094554318, 0.10605102073688938, 0.049782220243923064, -0.02625368691117662, 0.12586279299840847, -0.09753039349069274, -0.16195488347846076, 0.3265137419528593, -0.05899373918574879, -0.23765572828308837, 0.16288253348472156, -0.10183671562803712, -0.1641839301853433, 0.10006210424490576, 0.23906753681660667, 0.0809279735147105, -0.15867767988787435, 0.07586222591978399, -0.048968392887107304, 0.17131669399124094, 0.03772788211453434, 0.01648544682553265, 0.12737751921934143, 0.144496865269569, 0.09491364962640937, 0.08750545415872087, -0.11590599902428506, -0.09267020201295371, -0.2691330308533781, -0.10949754694143568, -0.16592055457791813, -0.03661078723276231, -0.11596407391411552, -0.13666936312896782, 0.3558570403847995, 0.21820736984245298, 0.21287076176727207, 0.098507391289823, 0.3382779126911144, 0.06752602768658729, 0.04942830252826471, 0.11217430384348835, 0.2195782274153553, 0.06090009890731454, 0.07727596824382985, -0.1965645963148161, 0.1038909778756097, -0.01358740893003296] |
1,803.02597 | Order Reconstruction for Nematics on Squares with Isotropic Inclusions:
A Landau-de Gennes Study | We prove the existence of a well order reconstruction solution (WORS) type
Landau-de Gennes critical point on a square domain with an isotropic concentric
square inclusion, with tangent boundary conditions on the outer square edges.
There are two geometrical parameters - the outer square edge length $\lambda$,
and the aspect ratio $\rho$, which is the ratio of the inner and outer square
edge lengths. The WORS exists for all geometrical parameters and for all
temperatures; we prove that the WORS is globally stable for either $\lambda$
small enough or for $\rho$ sufficiently close to unity. We study three
different types of critical points in this model setting: critical points with
the minimal two degrees of freedom consistent with the imposed boundary
conditions, critical points with three degrees of freedom and critical points
with five degrees of freedom. In the two-dimensional case, we use
$\Gamma$-convergence techniques to identify the energy-minimizing competitors.
We decompose the second variation of the Landau-de Gennes energy into three
separate components to study the effects of different types of perturbations on
the WORS solution and find that it is most susceptible to in-plane
perturbations. In the three-dimensional setting, we numerically find up to $28$
critical points for moderately large values of $\rho$ and we find two critical
points with the full five degrees of freedom for very small values of $\rho$,
with an escaped profile around the isotropic square inclusion.
| math.AP math-ph math.MP | we prove the existence of a well order reconstruction solution wors type landaude gennes critical point on a square domain with an isotropic concentric square inclusion with tangent boundary conditions on the outer square edges there are two geometrical parameters the outer square edge length lambda and the aspect ratio rho which is the ratio of the inner and outer square edge lengths the wors exists for all geometrical parameters and for all temperatures we prove that the wors is globally stable for either lambda small enough or for rho sufficiently close to unity we study three different types of critical points in this model setting critical points with the minimal two degrees of freedom consistent with the imposed boundary conditions critical points with three degrees of freedom and critical points with five degrees of freedom in the twodimensional case we use gammaconvergence techniques to identify the energyminimizing competitors we decompose the second variation of the landaude gennes energy into three separate components to study the effects of different types of perturbations on the wors solution and find that it is most susceptible to inplane perturbations in the threedimensional setting we numerically find up to 28 critical points for moderately large values of rho and we find two critical points with the full five degrees of freedom for very small values of rho with an escaped profile around the isotropic square inclusion | [['we', 'prove', 'the', 'existence', 'of', 'a', 'well', 'order', 'reconstruction', 'solution', 'wors', 'type', 'landaude', 'gennes', 'critical', 'point', 'on', 'a', 'square', 'domain', 'with', 'an', 'isotropic', 'concentric', 'square', 'inclusion', 'with', 'tangent', 'boundary', 'conditions', 'on', 'the', 'outer', 'square', 'edges', 'there', 'are', 'two', 'geometrical', 'parameters', 'the', 'outer', 'square', 'edge', 'length', 'lambda', 'and', 'the', 'aspect', 'ratio', 'rho', 'which', 'is', 'the', 'ratio', 'of', 'the', 'inner', 'and', 'outer', 'square', 'edge', 'lengths', 'the', 'wors', 'exists', 'for', 'all', 'geometrical', 'parameters', 'and', 'for', 'all', 'temperatures', 'we', 'prove', 'that', 'the', 'wors', 'is', 'globally', 'stable', 'for', 'either', 'lambda', 'small', 'enough', 'or', 'for', 'rho', 'sufficiently', 'close', 'to', 'unity', 'we', 'study', 'three', 'different', 'types', 'of', 'critical', 'points', 'in', 'this', 'model', 'setting', 'critical', 'points', 'with', 'the', 'minimal', 'two', 'degrees', 'of', 'freedom', 'consistent', 'with', 'the', 'imposed', 'boundary', 'conditions', 'critical', 'points', 'with', 'three', 'degrees', 'of', 'freedom', 'and', 'critical', 'points', 'with', 'five', 'degrees', 'of', 'freedom', 'in', 'the', 'twodimensional', 'case', 'we', 'use', 'gammaconvergence', 'techniques', 'to', 'identify', 'the', 'energyminimizing', 'competitors', 'we', 'decompose', 'the', 'second', 'variation', 'of', 'the', 'landaude', 'gennes', 'energy', 'into', 'three', 'separate', 'components', 'to', 'study', 'the', 'effects', 'of', 'different', 'types', 'of', 'perturbations', 'on', 'the', 'wors', 'solution', 'and', 'find', 'that', 'it', 'is', 'most', 'susceptible', 'to', 'inplane', 'perturbations', 'in', 'the', 'threedimensional', 'setting', 'we', 'numerically', 'find', 'up', 'to', '28', 'critical', 'points', 'for', 'moderately', 'large', 'values', 'of', 'rho', 'and', 'we', 'find', 'two', 'critical', 'points', 'with', 'the', 'full', 'five', 'degrees', 'of', 'freedom', 'for', 'very', 'small', 'values', 'of', 'rho', 'with', 'an', 'escaped', 'profile', 'around', 'the', 'isotropic', 'square', 'inclusion']] | [-0.19367123126245006, 0.13740509838893997, -0.029126109734000958, 0.01104239304449634, -0.02873272498355022, -0.1197711759375344, 0.02389739665748744, 0.32398459210726915, -0.2514637694960051, -0.27700480238679026, 0.11127879453375374, -0.30598444366378, -0.11688421404386613, 0.12276235203347008, 0.006785976642277092, 0.03581643164529694, 0.014431579623588136, 0.046676328438605134, -0.0896747924607239, -0.23592686911659508, 0.3502392425429646, -0.015321893537224367, 0.24514617218138202, 0.03570436423138619, 0.0837107361454902, 0.011350127712799364, 0.053289869559350715, 0.057451205655274076, -0.22817974842730798, 0.07450038342533938, 0.2076244220896052, 0.011712051362024042, 0.23268864753431287, -0.38974303070552135, -0.18310364954783742, 0.12725549014405638, 0.11348373344938817, 0.07391589241662336, 0.032619722392249466, -0.21742132686556254, 0.10671982765679472, -0.09768690027754176, -0.21778234366953758, -0.04695404919490603, 0.030691570654543567, 0.01720737049091158, -0.2809141589617678, 0.0736079085598186, 0.032099794271775395, 0.08448132640955135, -0.08779887456731902, -0.1673684403308314, -0.04915098224642109, 0.11218982328488171, 0.057925306728756024, -0.0003776773784042673, 0.0942292257356618, -0.14170092312871993, -0.03495037780396223, 0.3635780317347561, -0.04192303719876157, -0.22639387597105112, 0.21256010524189933, -0.15647098394351658, -0.09116964394443444, 0.15851554771732732, 0.133832948232182, 0.11490574959617365, -0.09767137651516382, 0.08073384725892162, -0.03431006552398622, 0.17958747782678733, 0.07752721647306442, 0.020998304525133352, 0.21086105903819333, 0.11766005656631776, 0.12846173580350423, 0.15443828678840435, -0.14065437375242693, -0.12815740510845428, -0.33832849814267507, -0.11902310277921437, -0.16021275142376343, 0.021512328627005476, -0.16873024387151137, -0.18899968278128654, 0.38588867739148053, 0.1174692713549152, 0.22941877954872325, 0.03911850734760359, 0.2432099053578989, 0.08990260989882919, 0.05943317407469169, 0.1256277642999615, 0.24620043247554788, 0.11133014996875286, 0.012927613871428987, -0.2074622445332603, -0.029555318048143566, 0.07374768751946374] |
1,803.02598 | Ising distribution as a latent variable model | During the past decades, the Ising distribution has attracted interest in
many applied disciplines, as the maximum entropy distribution associated to any
set of correlated binary (`spin') variables with observed means and
covariances. However, numerically speaking, the Ising distribution is
unpractical, so alternative models are often preferred to handle correlated
binary data. One popular alternative, especially in life sciences, is the Cox
distribution (or the closely related dichotomized Gaussian distribution and
log-normal Cox point process), where the spins are generated independently
conditioned on the drawing of a latent variable with a multivariate normal
distribution. This article explores the conditions for a principled replacement
of the Ising distribution by a Cox distribution. It shows that the Ising
distribution itself can be treated as a latent variable model, and it explores
when this latent variable has a quasi-normal distribution. A variational
approach to this question reveals a formal link with classic mean-field
methods, especially Opper and Winther's adaptive TAP approximation. This link
is confirmed by weak coupling (Plefka) expansions of the different
approximations and then by numerical tests. Overall, this study suggests that
an Ising distribution can be replaced by a Cox distribution in practical
applications, precisely when its parameters lie in the `mean-field domain'.
| cond-mat.dis-nn q-bio.NC stat.ML | during the past decades the ising distribution has attracted interest in many applied disciplines as the maximum entropy distribution associated to any set of correlated binary spin variables with observed means and covariances however numerically speaking the ising distribution is unpractical so alternative models are often preferred to handle correlated binary data one popular alternative especially in life sciences is the cox distribution or the closely related dichotomized gaussian distribution and lognormal cox point process where the spins are generated independently conditioned on the drawing of a latent variable with a multivariate normal distribution this article explores the conditions for a principled replacement of the ising distribution by a cox distribution it shows that the ising distribution itself can be treated as a latent variable model and it explores when this latent variable has a quasinormal distribution a variational approach to this question reveals a formal link with classic meanfield methods especially opper and winthers adaptive tap approximation this link is confirmed by weak coupling plefka expansions of the different approximations and then by numerical tests overall this study suggests that an ising distribution can be replaced by a cox distribution in practical applications precisely when its parameters lie in the meanfield domain | [['during', 'the', 'past', 'decades', 'the', 'ising', 'distribution', 'has', 'attracted', 'interest', 'in', 'many', 'applied', 'disciplines', 'as', 'the', 'maximum', 'entropy', 'distribution', 'associated', 'to', 'any', 'set', 'of', 'correlated', 'binary', 'spin', 'variables', 'with', 'observed', 'means', 'and', 'covariances', 'however', 'numerically', 'speaking', 'the', 'ising', 'distribution', 'is', 'unpractical', 'so', 'alternative', 'models', 'are', 'often', 'preferred', 'to', 'handle', 'correlated', 'binary', 'data', 'one', 'popular', 'alternative', 'especially', 'in', 'life', 'sciences', 'is', 'the', 'cox', 'distribution', 'or', 'the', 'closely', 'related', 'dichotomized', 'gaussian', 'distribution', 'and', 'lognormal', 'cox', 'point', 'process', 'where', 'the', 'spins', 'are', 'generated', 'independently', 'conditioned', 'on', 'the', 'drawing', 'of', 'a', 'latent', 'variable', 'with', 'a', 'multivariate', 'normal', 'distribution', 'this', 'article', 'explores', 'the', 'conditions', 'for', 'a', 'principled', 'replacement', 'of', 'the', 'ising', 'distribution', 'by', 'a', 'cox', 'distribution', 'it', 'shows', 'that', 'the', 'ising', 'distribution', 'itself', 'can', 'be', 'treated', 'as', 'a', 'latent', 'variable', 'model', 'and', 'it', 'explores', 'when', 'this', 'latent', 'variable', 'has', 'a', 'quasinormal', 'distribution', 'a', 'variational', 'approach', 'to', 'this', 'question', 'reveals', 'a', 'formal', 'link', 'with', 'classic', 'meanfield', 'methods', 'especially', 'opper', 'and', 'winthers', 'adaptive', 'tap', 'approximation', 'this', 'link', 'is', 'confirmed', 'by', 'weak', 'coupling', 'plefka', 'expansions', 'of', 'the', 'different', 'approximations', 'and', 'then', 'by', 'numerical', 'tests', 'overall', 'this', 'study', 'suggests', 'that', 'an', 'ising', 'distribution', 'can', 'be', 'replaced', 'by', 'a', 'cox', 'distribution', 'in', 'practical', 'applications', 'precisely', 'when', 'its', 'parameters', 'lie', 'in', 'the', 'meanfield', 'domain']] | [-0.07134087275817995, 0.11242744020749135, -0.11883799955045682, 0.11623399596842184, -0.09809598938036378, -0.16408397629396013, 0.04081288959092166, 0.38335075785894646, -0.29198165213928956, -0.26376576118613826, 0.09887641845478465, -0.25286230710588653, -0.14691788273619139, 0.15425573970135856, -0.06964882123422357, 0.08045014088004043, 0.036160991304683136, 0.021455762377654265, -0.05063354946663695, -0.26136501286049735, 0.30112810319946276, 0.06306534870712105, 0.3219923304617497, -0.04745147204243274, 0.09612617542388581, 0.05286023410101707, -0.03458144580876215, 0.020987953939982276, -0.09258384877243275, 0.09132575380182502, 0.26225834764565914, 0.11214551985687991, 0.3129815463262546, -0.36257330855552916, -0.27768103985835124, 0.11921896271454861, 0.14996989930018617, 0.06801347765670444, -0.008380619871273342, -0.25230310539747264, 0.02663334948241268, -0.1975095187553601, -0.12806009100133434, -0.0657975028342761, 0.022636381720220394, 0.06276806094280288, -0.31804130487097887, 0.09687781209093842, 0.06928570065036471, 0.08298232840226576, -0.008819333610175601, -0.12134154457691135, 0.00257056455201663, 0.08509356906841564, 0.08941448395561755, 0.05001084635951695, 0.11629657538208331, -0.1285944351002039, -0.119839546120827, 0.3474046124265262, -0.04132632625382624, -0.23832653114793473, 0.18082400728224565, -0.13512013723041014, -0.1487592266743431, 0.09677826684938817, 0.13409961827126987, 0.11658162381131165, -0.1881354614081712, 0.08355526049767786, -0.041882065784112354, 0.12239738567665999, 0.015240474864563877, -0.05696906842008097, 0.22177914410396157, 0.16337677784319413, 0.02228289056485196, 0.16611409015287323, -0.09116119006702689, -0.17490019572271717, -0.24072141025565785, -0.12981436387111323, -0.2641781604592919, 0.059404729418272136, -0.11480512451615339, -0.19651317795609483, 0.39380396075407276, 0.16965072093494604, 0.21868870430856502, 0.04776002625510613, 0.25402491005819916, 0.1292032166644222, 0.009071620552348766, 0.0736369652590613, 0.14409126743379205, 0.152963705983308, 0.052205731276201435, -0.15566504748173907, 0.1616917181308243, 0.009149220128921737] |
1,803.02599 | Antiphase Fermi-surface modulations accompanying displacement excitation
in a parent compound of iron-based superconductors | We investigate the transient electronic structure of BaFe2As2, a parent
compound of iron-based superconductors, by time- and angle-resolved
photoemission spectroscopy. In order to probe the entire Brillouin zone, we
utilize extreme ultraviolet photons and observe photoemission intensity
oscillation with the frequency of the A1g phonon which is antiphase between the
zone-centered hole Fermi surfaces (FSs) and zone-cornered electron FSs. We
attribute the antiphase behavior to the warping in one of the zone-centered
hole FSs accompanying the displacement of the pnictogen height, and find that
this displacement is the same direction as that induced by substitution of P
for As, where superconductivity is induced by a structural modification without
carrier doping in this system.
| cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el | we investigate the transient electronic structure of bafe2as2 a parent compound of ironbased superconductors by time and angleresolved photoemission spectroscopy in order to probe the entire brillouin zone we utilize extreme ultraviolet photons and observe photoemission intensity oscillation with the frequency of the a1g phonon which is antiphase between the zonecentered hole fermi surfaces fss and zonecornered electron fss we attribute the antiphase behavior to the warping in one of the zonecentered hole fss accompanying the displacement of the pnictogen height and find that this displacement is the same direction as that induced by substitution of p for as where superconductivity is induced by a structural modification without carrier doping in this system | [['we', 'investigate', 'the', 'transient', 'electronic', 'structure', 'of', 'bafe2as2', 'a', 'parent', 'compound', 'of', 'ironbased', 'superconductors', 'by', 'time', 'and', 'angleresolved', 'photoemission', 'spectroscopy', 'in', 'order', 'to', 'probe', 'the', 'entire', 'brillouin', 'zone', 'we', 'utilize', 'extreme', 'ultraviolet', 'photons', 'and', 'observe', 'photoemission', 'intensity', 'oscillation', 'with', 'the', 'frequency', 'of', 'the', 'a1g', 'phonon', 'which', 'is', 'antiphase', 'between', 'the', 'zonecentered', 'hole', 'fermi', 'surfaces', 'fss', 'and', 'zonecornered', 'electron', 'fss', 'we', 'attribute', 'the', 'antiphase', 'behavior', 'to', 'the', 'warping', 'in', 'one', 'of', 'the', 'zonecentered', 'hole', 'fss', 'accompanying', 'the', 'displacement', 'of', 'the', 'pnictogen', 'height', 'and', 'find', 'that', 'this', 'displacement', 'is', 'the', 'same', 'direction', 'as', 'that', 'induced', 'by', 'substitution', 'of', 'p', 'for', 'as', 'where', 'superconductivity', 'is', 'induced', 'by', 'a', 'structural', 'modification', 'without', 'carrier', 'doping', 'in', 'this', 'system']] | [-0.17301771892899914, 0.2175640485365875, -0.05613766408350784, 0.047262272370322274, -0.04067559285405358, -0.11283264906212155, 0.15746033855456126, 0.4161099808822785, -0.2948515127146883, -0.26020386416140745, -0.02150376411009347, -0.359325976684756, -0.12283128030997302, 0.17190410511518298, 0.031623650791256556, 0.01367913675494492, -0.062149142214496224, -0.047726336215938706, -0.15323900780224772, -0.16405923265431607, 0.3485577039952789, 0.0579057899012696, 0.31600360914931763, 0.050085210357792675, 0.027007153889696513, 0.03721791372975401, 0.12057833460026554, 0.0003383839107950085, -0.13975914720569044, 0.07306800939451412, 0.30357336204698576, -0.1032472018102583, 0.19928750593057235, -0.3986171983747876, -0.25013392387024524, -0.030726844008313492, 0.12617752270931046, 0.12748630674988298, -0.0647464455687441, -0.2542883413594349, 0.037603621637182574, -0.11046376490100686, -0.1391936964438563, -0.066268603462439, -0.03257750887964254, 0.0004253341394360177, -0.18811221658636765, 0.12313499116239005, 0.05525415069340462, 0.09759976817128647, -0.1319073956505495, -0.034847185035427435, -0.10112446282957015, 0.04424220959065549, 0.10879156389793414, 0.05722883734103691, 0.13928400842373126, -0.05789801800295079, -0.11005322330830884, 0.35317209200833793, -0.060965201382974295, -0.03998061986307481, 0.11822383609874773, -0.26970918135235217, -0.04300591449802076, 0.16457131383400078, 0.08998939120543323, 0.10354784016297865, -0.10969527565040542, 0.09129451679681162, -0.013345256659834246, 0.22279570293280163, 0.12531624206375064, 0.1122991953660468, 0.21856371643454103, 0.17976698733816324, 0.06424500672645601, 0.11250040174594947, -0.208004447469388, 0.03382613900300514, -0.2127419826865662, -0.16475648174361726, -0.2014492634001986, 0.05795787213303681, -0.04427209112275575, -0.19864140999769525, 0.4237210808039111, 0.11336584609567321, 0.2291070358831868, -0.09601152239130377, 0.22814304322465823, 0.10046026009825125, 0.07571274019262221, 0.03645786525885342, 0.2512479300411152, 0.09725113808235619, 0.08773722516239754, -0.3924484156679163, 0.09074877083808783, 0.049212356520001777] |
1,803.026 | The non-unital version of Connes' theorem on the Hochschild class of the
Chern character | We offer a short proof of Connes' Hochschild class of the Chern character
formula for non-unital semifinite spectral triples. The proof is simple due to
its reliance on the authors' extensive work on a refined version of the local
index formula, and the consequent understanding of the passage from generalised
residues of zeta functions to representations in terms of singular traces.
| math.KT | we offer a short proof of connes hochschild class of the chern character formula for nonunital semifinite spectral triples the proof is simple due to its reliance on the authors extensive work on a refined version of the local index formula and the consequent understanding of the passage from generalised residues of zeta functions to representations in terms of singular traces | [['we', 'offer', 'a', 'short', 'proof', 'of', 'connes', 'hochschild', 'class', 'of', 'the', 'chern', 'character', 'formula', 'for', 'nonunital', 'semifinite', 'spectral', 'triples', 'the', 'proof', 'is', 'simple', 'due', 'to', 'its', 'reliance', 'on', 'the', 'authors', 'extensive', 'work', 'on', 'a', 'refined', 'version', 'of', 'the', 'local', 'index', 'formula', 'and', 'the', 'consequent', 'understanding', 'of', 'the', 'passage', 'from', 'generalised', 'residues', 'of', 'zeta', 'functions', 'to', 'representations', 'in', 'terms', 'of', 'singular', 'traces']] | [-0.13873131448006043, 0.0011629749120014613, -0.16272229544024486, 0.09652625798576007, -0.12141993076952755, -0.08665658299215749, 0.07679115786965264, 0.30056161717435376, -0.2832221120489059, -0.2517613908581314, 0.07753531302928497, -0.23384575541970914, -0.1636689728522887, 0.21330432673213912, -0.14626368959663344, 0.003907365357068169, 0.09334707485328687, 0.056856998748176533, -0.13270424910988965, -0.21065227842324827, 0.4062950467675558, 0.04535268659352279, 0.21063228522915942, 0.14844981206916882, 0.05356042697781422, 0.05637788615326901, -0.10102589890269227, -0.07950202778714602, -0.13503870332888404, 0.21934580179045862, 0.22166005990727514, 0.057777318866831844, 0.22058490307650483, -0.3673703140716572, -0.14215750257927376, 0.13447277344473194, 0.07936942717823826, 0.03446648175232723, 0.03812833696786986, -0.3150520495856639, 0.10292217612541357, -0.24548482265873034, -0.14355742342037256, -0.07658877694162494, 0.056454935969907, 0.005422981257443545, -0.230472639737437, 0.07154408665221246, 0.14322267400986347, 0.13700997241635304, -0.09923361892407363, -0.07494791945228811, -0.007665716852137789, 0.09407594770987014, 0.04204342707793121, -0.024278189941141448, 0.10308785018221032, -0.10369908663093066, -0.14629223124414195, 0.329231172254248, -0.07857546553809623, -0.17815668750783337, 0.14793267659842968, -0.12022768135839065, -0.16915517653811907, 0.11878704783491424, 0.07227475519795887, 0.19606449406929924, -0.021588768611555217, 0.15053454184900877, -0.0638543348454061, 0.10687947587575763, 0.10488107628723392, 0.07567562461929915, 0.17148664940270733, 0.04951709146290773, 0.023129228471976813, 0.18082327404838117, -0.009119709755187153, -0.0829509374777191, -0.31652179189392776, -0.23948372507345725, -0.22778479709885405, 0.14677750299394618, -0.1297136440443268, -0.2302157189926041, 0.4673367108477921, 0.08631489443455319, 0.18978970430669237, 0.1394125563016192, 0.2469729306939684, 0.15415480514591345, 0.08720995599526118, -0.01660107482285773, 0.09987085298864079, 0.2316740075981275, 0.07267377437016026, -0.14339780104041222, 0.061030727047778545, 0.2722188866865195] |
1,803.02601 | Fast in-database cross-matching of high-cadence, high-density source
lists with an up-to-date sky model | Coming high-cadence wide-field optical telescopes will image hundreds of
thousands of sources per minute. Besides inspecting the near real-time data
streams for transient and variability events, the accumulated data archive is a
wealthy laboratory for making complementary scientific discoveries.
The goal of this work is to optimise column-oriented database techniques to
enable the construction of a full-source and light-curve database for
large-scale surveys, that is accessible by the astronomical community.
We adopted LOFAR's Transients Pipeline as the baseline and modified it to
enable the processing of optical images that have much higher source densities.
The pipeline adds new source lists to the archive database, while
cross-matching them with the known cataloged sources in order to build a full
light-curve archive. We investigated several techniques of indexing and
partitioning the largest tables, allowing for faster positional source look-ups
in the cross matching algorithms. We monitored all query run times in long-term
pipeline runs where we processed a subset of IPHAS data that have image source
density peaks over $170,000$ per field of view ($500,000$ deg$^{-2}$).
Our analysis demonstrates that horizontal table partitions of declination
widths of one-degree control the query run times. Usage of an index strategy
where the partitions are densily sorted according to source declination yields
another improvement. Most queries run in sublinear time and a few (<20%) run in
linear time, because of dependencies on input source-list and result-set size.
We observed that for this logical database partitioning schema the limiting
cadence the pipeline achieved with processing IPHAS data is 25 seconds.
| astro-ph.IM cs.DB | coming highcadence widefield optical telescopes will image hundreds of thousands of sources per minute besides inspecting the near realtime data streams for transient and variability events the accumulated data archive is a wealthy laboratory for making complementary scientific discoveries the goal of this work is to optimise columnoriented database techniques to enable the construction of a fullsource and lightcurve database for largescale surveys that is accessible by the astronomical community we adopted lofars transients pipeline as the baseline and modified it to enable the processing of optical images that have much higher source densities the pipeline adds new source lists to the archive database while crossmatching them with the known cataloged sources in order to build a full lightcurve archive we investigated several techniques of indexing and partitioning the largest tables allowing for faster positional source lookups in the cross matching algorithms we monitored all query run times in longterm pipeline runs where we processed a subset of iphas data that have image source density peaks over 170000 per field of view 500000 deg2 our analysis demonstrates that horizontal table partitions of declination widths of onedegree control the query run times usage of an index strategy where the partitions are densily sorted according to source declination yields another improvement most queries run in sublinear time and a few 20 run in linear time because of dependencies on input sourcelist and resultset size we observed that for this logical database partitioning schema the limiting cadence the pipeline achieved with processing iphas data is 25 seconds | [['coming', 'highcadence', 'widefield', 'optical', 'telescopes', 'will', 'image', 'hundreds', 'of', 'thousands', 'of', 'sources', 'per', 'minute', 'besides', 'inspecting', 'the', 'near', 'realtime', 'data', 'streams', 'for', 'transient', 'and', 'variability', 'events', 'the', 'accumulated', 'data', 'archive', 'is', 'a', 'wealthy', 'laboratory', 'for', 'making', 'complementary', 'scientific', 'discoveries', 'the', 'goal', 'of', 'this', 'work', 'is', 'to', 'optimise', 'columnoriented', 'database', 'techniques', 'to', 'enable', 'the', 'construction', 'of', 'a', 'fullsource', 'and', 'lightcurve', 'database', 'for', 'largescale', 'surveys', 'that', 'is', 'accessible', 'by', 'the', 'astronomical', 'community', 'we', 'adopted', 'lofars', 'transients', 'pipeline', 'as', 'the', 'baseline', 'and', 'modified', 'it', 'to', 'enable', 'the', 'processing', 'of', 'optical', 'images', 'that', 'have', 'much', 'higher', 'source', 'densities', 'the', 'pipeline', 'adds', 'new', 'source', 'lists', 'to', 'the', 'archive', 'database', 'while', 'crossmatching', 'them', 'with', 'the', 'known', 'cataloged', 'sources', 'in', 'order', 'to', 'build', 'a', 'full', 'lightcurve', 'archive', 'we', 'investigated', 'several', 'techniques', 'of', 'indexing', 'and', 'partitioning', 'the', 'largest', 'tables', 'allowing', 'for', 'faster', 'positional', 'source', 'lookups', 'in', 'the', 'cross', 'matching', 'algorithms', 'we', 'monitored', 'all', 'query', 'run', 'times', 'in', 'longterm', 'pipeline', 'runs', 'where', 'we', 'processed', 'a', 'subset', 'of', 'iphas', 'data', 'that', 'have', 'image', 'source', 'density', 'peaks', 'over', '170000', 'per', 'field', 'of', 'view', '500000', 'deg2', 'our', 'analysis', 'demonstrates', 'that', 'horizontal', 'table', 'partitions', 'of', 'declination', 'widths', 'of', 'onedegree', 'control', 'the', 'query', 'run', 'times', 'usage', 'of', 'an', 'index', 'strategy', 'where', 'the', 'partitions', 'are', 'densily', 'sorted', 'according', 'to', 'source', 'declination', 'yields', 'another', 'improvement', 'most', 'queries', 'run', 'in', 'sublinear', 'time', 'and', 'a', 'few', '20', 'run', 'in', 'linear', 'time', 'because', 'of', 'dependencies', 'on', 'input', 'sourcelist', 'and', 'resultset', 'size', 'we', 'observed', 'that', 'for', 'this', 'logical', 'database', 'partitioning', 'schema', 'the', 'limiting', 'cadence', 'the', 'pipeline', 'achieved', 'with', 'processing', 'iphas', 'data', 'is', '25', 'seconds']] | [-0.1003962218950677, 0.02690095533817437, -0.0571438956697772, 0.05654530393134105, -0.1283715451191888, -0.10372769711001134, 0.10562897102065028, 0.42672062116819787, -0.2618232923286199, -0.40549753035745206, 0.13386474425168857, -0.3377497896570174, -0.008411270869613822, 0.2509227929640547, -0.04564099233463941, 0.054484666588883644, 0.14777655101268072, -0.014379510311855085, -0.0241688703459528, -0.32563552490075626, 0.18961302474230635, 0.09722012439761236, 0.25441205114463855, -0.06378980738062605, 0.09008082463331818, 0.0004259082637133589, -0.14697528350541733, -0.020628541856439482, -0.0882501992818436, 0.10726911549881264, 0.31110230964456365, 0.2439196476466078, 0.24270188736087417, -0.3919828472347314, -0.14786458712901857, 0.06935132385660112, 0.15574879680279702, 0.061253301410627854, -0.02233940654246886, -0.2936985363517758, 0.08389506736850047, -0.1569145701104864, -0.08216430238110432, -0.040839050920003936, 0.08179672506073883, 0.0336901490737506, -0.24019056016512483, 0.021275028973201892, -0.007205071723630348, 0.1074863885011268, -0.07278250242245803, -0.09654413677559075, 0.010115436799137805, 0.1455144498541773, -0.014822670202461105, 0.08853197444148689, 0.11772439532924399, -0.12549745887091227, -0.11156022114135637, 0.380709913236449, -0.04752068802578917, -0.05764504375522474, 0.12283574686739575, -0.12502152417263246, -0.18456078697166653, 0.1740684017114178, 0.19955810579003774, 0.10035021235309244, -0.1951443747481873, 0.01299005604592111, -0.006360858614348706, 0.26483174674101617, 0.09355159980185568, 0.06590021328362396, 0.20928102540060048, 0.18676913323890107, 0.0631476538274363, 0.14349589519067277, -0.23507978478402541, -0.03466986347823793, -0.2465524328988513, -0.09657392972364624, -0.158762791508946, -0.005987569236612148, -0.11714769633956702, -0.13332830997605055, 0.40517654680309306, 0.2012066734784034, 0.14745798079014952, 0.06547373592245033, 0.3235091932110518, 0.008733779130748425, 0.15647706310580153, 0.08273076066799254, 0.1671674292686718, 0.0210312342074555, 0.16810417089999033, -0.11791407158950797, 0.05482117320407197, -0.01198996840389464] |
1,803.02602 | Randomized linear algebra for model reduction. Part I: Galerkin methods
and error estimation | We propose a probabilistic way for reducing the cost of classical
projection-based model order reduction methods for parameter-dependent linear
equations. A reduced order model is here approximated from its random sketch,
which is a set of low-dimensional random projections of the reduced
approximation space and the spaces of associated residuals. This approach
exploits the fact that the residuals associated with approximations in
low-dimensional spaces are also contained in low-dimensional spaces. We provide
conditions on the dimension of the random sketch for the resulting reduced
order model to be quasi-optimal with high probability. Our approach can be used
for reducing both complexity and memory requirements. The provided algorithms
are well suited for any modern computational environment. Major operations,
except solving linear systems of equations, are embarrassingly parallel. Our
version of proper orthogonal decomposition can be computed on multiple
workstations with a communication cost independent of the dimension of the full
order model. The reduced order model can even be constructed in a so-called
streaming environment, i.e., under extreme memory constraints. In addition, we
provide an efficient way for estimating the error of the reduced order model,
which is not only more efficient than the classical approach but is also less
sensitive to round-off errors. Finally, the methodology is validated on
benchmark problems.
| math.NA cs.NA | we propose a probabilistic way for reducing the cost of classical projectionbased model order reduction methods for parameterdependent linear equations a reduced order model is here approximated from its random sketch which is a set of lowdimensional random projections of the reduced approximation space and the spaces of associated residuals this approach exploits the fact that the residuals associated with approximations in lowdimensional spaces are also contained in lowdimensional spaces we provide conditions on the dimension of the random sketch for the resulting reduced order model to be quasioptimal with high probability our approach can be used for reducing both complexity and memory requirements the provided algorithms are well suited for any modern computational environment major operations except solving linear systems of equations are embarrassingly parallel our version of proper orthogonal decomposition can be computed on multiple workstations with a communication cost independent of the dimension of the full order model the reduced order model can even be constructed in a socalled streaming environment ie under extreme memory constraints in addition we provide an efficient way for estimating the error of the reduced order model which is not only more efficient than the classical approach but is also less sensitive to roundoff errors finally the methodology is validated on benchmark problems | [['we', 'propose', 'a', 'probabilistic', 'way', 'for', 'reducing', 'the', 'cost', 'of', 'classical', 'projectionbased', 'model', 'order', 'reduction', 'methods', 'for', 'parameterdependent', 'linear', 'equations', 'a', 'reduced', 'order', 'model', 'is', 'here', 'approximated', 'from', 'its', 'random', 'sketch', 'which', 'is', 'a', 'set', 'of', 'lowdimensional', 'random', 'projections', 'of', 'the', 'reduced', 'approximation', 'space', 'and', 'the', 'spaces', 'of', 'associated', 'residuals', 'this', 'approach', 'exploits', 'the', 'fact', 'that', 'the', 'residuals', 'associated', 'with', 'approximations', 'in', 'lowdimensional', 'spaces', 'are', 'also', 'contained', 'in', 'lowdimensional', 'spaces', 'we', 'provide', 'conditions', 'on', 'the', 'dimension', 'of', 'the', 'random', 'sketch', 'for', 'the', 'resulting', 'reduced', 'order', 'model', 'to', 'be', 'quasioptimal', 'with', 'high', 'probability', 'our', 'approach', 'can', 'be', 'used', 'for', 'reducing', 'both', 'complexity', 'and', 'memory', 'requirements', 'the', 'provided', 'algorithms', 'are', 'well', 'suited', 'for', 'any', 'modern', 'computational', 'environment', 'major', 'operations', 'except', 'solving', 'linear', 'systems', 'of', 'equations', 'are', 'embarrassingly', 'parallel', 'our', 'version', 'of', 'proper', 'orthogonal', 'decomposition', 'can', 'be', 'computed', 'on', 'multiple', 'workstations', 'with', 'a', 'communication', 'cost', 'independent', 'of', 'the', 'dimension', 'of', 'the', 'full', 'order', 'model', 'the', 'reduced', 'order', 'model', 'can', 'even', 'be', 'constructed', 'in', 'a', 'socalled', 'streaming', 'environment', 'ie', 'under', 'extreme', 'memory', 'constraints', 'in', 'addition', 'we', 'provide', 'an', 'efficient', 'way', 'for', 'estimating', 'the', 'error', 'of', 'the', 'reduced', 'order', 'model', 'which', 'is', 'not', 'only', 'more', 'efficient', 'than', 'the', 'classical', 'approach', 'but', 'is', 'also', 'less', 'sensitive', 'to', 'roundoff', 'errors', 'finally', 'the', 'methodology', 'is', 'validated', 'on', 'benchmark', 'problems']] | [-0.09079725702096801, 0.06808307819501265, -0.0678705330140849, 0.08475299879039033, -0.06521431244004924, -0.12892586916632137, 0.03531968291579653, 0.3632616316105164, -0.30037925591012593, -0.30444513929354566, 0.1527760276312706, -0.2226432133179105, -0.15228491171673647, 0.23222763163050839, -0.09173796276762747, 0.094759193550568, 0.08980997429026281, 0.02597089246455006, -0.11574078664918523, -0.3049633966105597, 0.2723874110889608, 0.050775995153615965, 0.2590156237129122, -0.0435534524369954, 0.11271560676900727, -0.01390473238717747, -0.0305518540630991, 0.062391712533456815, -0.06837370053339353, 0.1829622507986935, 0.24921112035299647, 0.12184069527588841, 0.2828613477405955, -0.4290814336060471, -0.2107722611073846, 0.12229529562901696, 0.13272456204854127, 0.12868167343218392, -0.0033716532726296537, -0.25727207110797484, 0.1142595115154143, -0.15583364698170768, -0.10505964825596326, -0.14260022744748266, -0.04008757402034591, -0.001827696468504543, -0.31630533475702477, 0.06773124530914756, 0.07207012636712819, 0.01975897154373545, -0.046800294795550264, -0.11695320063968016, 0.01754208904982355, 0.10706743751917369, -0.02247775748639116, 0.03441114660564333, 0.08683799614250369, -0.09498666518729763, -0.12112011126533892, 0.4296042025309956, -0.04117304713072716, -0.27206540941779384, 0.17606001129700533, -0.07954825611864504, -0.1138705587990017, 0.13412921860266777, 0.22637436951188397, 0.11644476507371071, -0.1367743334190046, 0.12591852719059116, -0.011943127471684386, 0.1760190594775858, 0.013514825034780666, 0.0404722275393375, 0.11205648762390229, 0.19121604946097667, 0.12112466183654363, 0.12910873004813542, -0.05984283183531403, -0.11247783282168113, -0.29775486925150096, -0.1401006181115258, -0.19320720566935415, -0.008821602830135316, -0.14962762375282215, -0.1704785958179648, 0.36696797160881955, 0.1768761361486795, 0.16460929585453035, 0.09138817977495668, 0.34426147958608033, 0.17620294742012824, 0.05414556691167055, 0.10837551315372448, 0.1605883327854016, 0.10483716803898602, 0.04132090472964949, -0.18488041700500668, 0.10363562405992176, 0.09032381685689021] |
1,803.02603 | Gaussian Process Latent Variable Alignment Learning | We present a model that can automatically learn alignments between
high-dimensional data in an unsupervised manner. Our proposed method casts
alignment learning in a framework where both alignment and data are modelled
simultaneously. Further, we automatically infer groupings of different types of
sequences within the same dataset. We derive a probabilistic model built on
non-parametric priors that allows for flexible warps while at the same time
providing means to specify interpretable constraints. We demonstrate the
efficacy of our approach with superior quantitative performance to the
state-of-the-art approaches and provide examples to illustrate the versatility
of our model in automatic inference of sequence groupings, absent from previous
approaches, as well as easy specification of high level priors for different
modalities of data.
| stat.ML cs.LG | we present a model that can automatically learn alignments between highdimensional data in an unsupervised manner our proposed method casts alignment learning in a framework where both alignment and data are modelled simultaneously further we automatically infer groupings of different types of sequences within the same dataset we derive a probabilistic model built on nonparametric priors that allows for flexible warps while at the same time providing means to specify interpretable constraints we demonstrate the efficacy of our approach with superior quantitative performance to the stateoftheart approaches and provide examples to illustrate the versatility of our model in automatic inference of sequence groupings absent from previous approaches as well as easy specification of high level priors for different modalities of data | [['we', 'present', 'a', 'model', 'that', 'can', 'automatically', 'learn', 'alignments', 'between', 'highdimensional', 'data', 'in', 'an', 'unsupervised', 'manner', 'our', 'proposed', 'method', 'casts', 'alignment', 'learning', 'in', 'a', 'framework', 'where', 'both', 'alignment', 'and', 'data', 'are', 'modelled', 'simultaneously', 'further', 'we', 'automatically', 'infer', 'groupings', 'of', 'different', 'types', 'of', 'sequences', 'within', 'the', 'same', 'dataset', 'we', 'derive', 'a', 'probabilistic', 'model', 'built', 'on', 'nonparametric', 'priors', 'that', 'allows', 'for', 'flexible', 'warps', 'while', 'at', 'the', 'same', 'time', 'providing', 'means', 'to', 'specify', 'interpretable', 'constraints', 'we', 'demonstrate', 'the', 'efficacy', 'of', 'our', 'approach', 'with', 'superior', 'quantitative', 'performance', 'to', 'the', 'stateoftheart', 'approaches', 'and', 'provide', 'examples', 'to', 'illustrate', 'the', 'versatility', 'of', 'our', 'model', 'in', 'automatic', 'inference', 'of', 'sequence', 'groupings', 'absent', 'from', 'previous', 'approaches', 'as', 'well', 'as', 'easy', 'specification', 'of', 'high', 'level', 'priors', 'for', 'different', 'modalities', 'of', 'data']] | [-0.015542595746613316, -0.03970987910935405, -0.10887372379445216, 0.09120758442392896, -0.12069248002838374, -0.14663982490647184, 0.056661020332277746, 0.45409654545759365, -0.27827357459035973, -0.3794221557500726, 0.03879412147505132, -0.22221826199138603, -0.1471402782981461, 0.20260573781195504, -0.10092709994921076, 0.06201565152992425, 0.08998059130404606, 0.002174450594725949, -0.07888057380375907, -0.23464803294517284, 0.28120243963823954, 0.04287700167633901, 0.35229282612981627, -0.023924317815117845, 0.1486019080549032, -0.0062377440342910526, -0.04479769219510634, 0.008384422422194284, -0.08871751224435961, 0.1825971756811631, 0.3107945229896644, 0.22970769752956127, 0.2968527350174494, -0.4059681491156624, -0.2237101611931431, 0.050412863668069734, 0.1648432599464316, 0.12953564954713787, -0.04072115783606586, -0.3357960427226114, 0.09004546697289983, -0.1544045096923297, -0.020836190328248277, -0.19484436776766106, -0.06402088413861665, 0.01696551099279126, -0.33347222814312366, 0.07408150337436352, 0.0753951297066567, 0.058944041686794485, -0.09678530813943333, -0.10974909874325818, -0.004030922709671734, 0.1784488866221129, 0.04796344154295011, -0.0037657421355016436, 0.10229890093145784, -0.11595328366922691, -0.1572499456776937, 0.3483618219567786, -0.08337456398943732, -0.24194207102876186, 0.23481907839655938, -0.057891735630032935, -0.18250519107288318, 0.06612092039109138, 0.22148624896880023, 0.13514144560860947, -0.17298064127656793, 0.018972040976643994, -0.021361122261886755, 0.19620053597902956, 0.009660165516413317, -0.007521175286801886, 0.20026860902257157, 0.25030178599028796, 0.016042075701027125, 0.15562594531696627, -0.11450443800330963, -0.0631756484085186, -0.26393218038311184, -0.08384406248353853, -0.15299528697890438, -0.08972075537293533, -0.1497398802906194, -0.1551158342926334, 0.4087810487431582, 0.27502202259353553, 0.2505658542283249, 0.14026621812261825, 0.35306908924532826, 0.018629611705522214, 0.08775988324018087, 0.0508369843837274, 0.1718114403077432, 0.014904313212768599, 0.03696136040158939, -0.16055888372227117, 0.09982432085589683, -0.016166388211109915] |
1,803.02604 | On certain semigroups of partial contractions of a finite chain | Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{P}_{n}$ be the
semigroup of partial transformations on $[n]$. Let
$\mathcal{CP}_{n}=\{\alpha\in \mathcal{P}_{n}: (for ~all~x,y\in
Dom~\alpha)~|x\alpha-y\alpha|\leq|x-y|\}$ be the subsemigroup of partial
contraction mappings on $[n]$. We have shown that the semigroup
$\mathcal{CP}_{n}$ and some of its subsemigroups are nonregular left abundant
semigroups for all $n$ but not right abundant for $n\geq 4$.
| math.GR | let n12ldotsn be a finite chain and let mathcalp_n be the semigroup of partial transformations on n let mathcalcp_nalphain mathcalp_n for allxyin domalphaxalphayalphaleqxy be the subsemigroup of partial contraction mappings on n we have shown that the semigroup mathcalcp_n and some of its subsemigroups are nonregular left abundant semigroups for all n but not right abundant for ngeq 4 | [['let', 'n12ldotsn', 'be', 'a', 'finite', 'chain', 'and', 'let', 'mathcalp_n', 'be', 'the', 'semigroup', 'of', 'partial', 'transformations', 'on', 'n', 'let', 'mathcalcp_nalphain', 'mathcalp_n', 'for', 'allxyin', 'domalphaxalphayalphaleqxy', 'be', 'the', 'subsemigroup', 'of', 'partial', 'contraction', 'mappings', 'on', 'n', 'we', 'have', 'shown', 'that', 'the', 'semigroup', 'mathcalcp_n', 'and', 'some', 'of', 'its', 'subsemigroups', 'are', 'nonregular', 'left', 'abundant', 'semigroups', 'for', 'all', 'n', 'but', 'not', 'right', 'abundant', 'for', 'ngeq', '4']] | [-0.13053648517949082, 0.19275434918113446, 0.015115092353274425, 0.020255026930387606, -0.06746953434163802, -0.1702862256615047, -0.035742743028605584, 0.3736468093437061, -0.3606885335195744, -0.11279130970912152, 0.19074422989465428, -0.41691481975609795, -0.02834863066591584, 0.19982677843143934, -0.05223863302697346, -0.027834182148676757, 0.01207561580170142, 0.15117357789310054, -0.05493038108065855, -0.2508543621475008, 0.31157022675401286, -0.08978131975521121, 0.10140139908783072, 0.058558927718223186, 0.10197408472825038, -0.05400107278929729, 0.017938729048820965, -0.02614015752139191, -0.16237657411463596, 0.056659902560344914, 0.3211359706168112, 0.17906955209675066, 0.2330628078626959, -0.43863749726299656, -0.13444110314900937, 0.28374389820454415, 0.20123264687789374, -0.11202641091260471, -0.02460324240995473, -0.2850834826955147, 0.21120737827987524, -0.14352821395323986, -0.0931032719090581, -0.10433747978031374, 0.16644159501843286, 0.020056430805932012, -0.3550809713227576, -0.03173597691286551, 0.16590763697106586, 0.11547937289109095, 0.019686698164022937, -0.14496357678517438, -0.09527571741981726, 0.06886692278969445, -0.0928044275364332, 0.03741302732541634, 0.026749490204741034, 0.02166834148463973, -0.08672928628756811, 0.3546731406659411, -0.02264709507621694, -0.2635216150400147, 0.09188100158057191, -0.25489838934389125, -0.14580912243476823, 0.11687749208424959, 0.08503733147262481, 0.2120155367934913, -0.05174216851101894, 0.2588709890005064, -0.13889018599793576, 0.11045646056402147, 0.07734619799119077, -0.006222780148515053, 0.10186088141799382, 0.06503023015000253, 0.1260242258125034, 0.11441710028642167, 0.1189946962700209, 0.04904712193335096, -0.3545801962088597, -0.1613267446426969, -0.12274554489678785, 0.19336570169533635, -0.14398464842815883, -0.17774356158374677, 0.31004797595373373, 0.08587973083017698, 0.15613112843742497, 0.15074228899749487, 0.10085953484501756, 0.07820237140383637, 0.007129959916295647, 0.10299018053174541, -0.06909489589733105, 0.2291972347649566, -0.09429369812929317, -0.18657966297969483, 0.07622348107887726, 0.18959046687865466] |
1,803.02605 | Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss | An $l$-link binary CEO problem is considered in this paper. We present a
practical encoding and decoding scheme for this problem employing the
graph-based codes. A successive coding scheme is proposed for converting an
$l$-link binary CEO problem to the $(2l-1)$ single binary Wyner-Ziv (WZ)
problems. By using the compound LDGM-LDPC codes, the theoretical bound of each
binary WZ is asymptotically achievable. Our proposed decoder successively
decodes the received data by employing the well-known Sum-Product (SP)
algorithm and leverages them to reconstruct the source. The sum-rate distortion
performance of our proposed coding scheme is compared with the theoretical
bounds under the logarithmic loss (log-loss) criterion.
| cs.IT math.IT | an llink binary ceo problem is considered in this paper we present a practical encoding and decoding scheme for this problem employing the graphbased codes a successive coding scheme is proposed for converting an llink binary ceo problem to the 2l1 single binary wynerziv wz problems by using the compound ldgmldpc codes the theoretical bound of each binary wz is asymptotically achievable our proposed decoder successively decodes the received data by employing the wellknown sumproduct sp algorithm and leverages them to reconstruct the source the sumrate distortion performance of our proposed coding scheme is compared with the theoretical bounds under the logarithmic loss logloss criterion | [['an', 'llink', 'binary', 'ceo', 'problem', 'is', 'considered', 'in', 'this', 'paper', 'we', 'present', 'a', 'practical', 'encoding', 'and', 'decoding', 'scheme', 'for', 'this', 'problem', 'employing', 'the', 'graphbased', 'codes', 'a', 'successive', 'coding', 'scheme', 'is', 'proposed', 'for', 'converting', 'an', 'llink', 'binary', 'ceo', 'problem', 'to', 'the', '2l1', 'single', 'binary', 'wynerziv', 'wz', 'problems', 'by', 'using', 'the', 'compound', 'ldgmldpc', 'codes', 'the', 'theoretical', 'bound', 'of', 'each', 'binary', 'wz', 'is', 'asymptotically', 'achievable', 'our', 'proposed', 'decoder', 'successively', 'decodes', 'the', 'received', 'data', 'by', 'employing', 'the', 'wellknown', 'sumproduct', 'sp', 'algorithm', 'and', 'leverages', 'them', 'to', 'reconstruct', 'the', 'source', 'the', 'sumrate', 'distortion', 'performance', 'of', 'our', 'proposed', 'coding', 'scheme', 'is', 'compared', 'with', 'the', 'theoretical', 'bounds', 'under', 'the', 'logarithmic', 'loss', 'logloss', 'criterion']] | [-0.1567193760527569, -0.028978978721956154, -0.08825885480070866, 0.0652124434415685, -0.06369375592115724, -0.25600454380319826, 0.12081343577570029, 0.39683901609002964, -0.33073544146004813, -0.24705120353299437, 0.07919754911535103, -0.2396607713918518, -0.19256045669317245, 0.1870169869162938, -0.13986632675474997, 0.14438155855874993, 0.0794641956035952, 0.06591336546664678, -0.12331430845468946, -0.375761568582463, 0.2797357344059545, 0.16533665329181743, 0.3251077250658887, -0.02005082876387604, 0.12262700749237658, 0.06692594854902585, 0.0061675814405373, -0.08520696984911427, -0.11403165864351306, 0.13195876591698746, 0.2844747856883242, 0.2088621037343101, 0.258366010278391, -0.3179249746218613, -0.26517692060001846, 0.02943891730810543, 0.13416186982349862, 0.13945159675481106, -0.1087107366782803, -0.2500535000739529, 0.14945169377764597, -0.19330042869856273, 0.06916578641179406, 0.0370047835551781, -0.10621689566528623, -0.01578375047922713, -0.36808290659874965, 0.041553584078905505, 0.08388710553640301, -0.042422789621429105, -0.07737263874376862, -0.16348091049065577, 0.08291095616838452, 0.0951883825835166, 0.016144316779105987, 0.09023251108264604, 0.0057920278682943105, -0.04177165332304549, -0.1797544043330313, 0.35795746858738076, -0.01168066966211767, -0.23200885795997184, 0.09555960501300044, 0.019297183717338785, -0.1038721305526142, 0.17219507466386824, 0.2129800413165567, 0.1265400801061933, -0.15059089641995474, 0.05342074686173096, -0.05351343852223702, 0.19355633444360737, 0.08988789865946017, 0.07914141130642695, 0.11389479233015293, 0.1853100881161331, 0.04086483580973542, 0.2546496988066192, -0.15169570934354074, -0.09305108290672012, -0.24284120745255014, -0.08134013202631375, -0.21979693254654847, -0.045377218589476014, -0.14016765897649394, -0.0987446513919847, 0.3317305134325438, 0.08857218475415579, 0.13488831749023164, 0.13555018844318042, 0.36242285576983563, 0.11706119709991787, 0.010641921763715236, 0.1836163358563937, 0.20590871466251398, 0.166813396493841, 0.02571912291482344, -0.23758119300179617, 0.09148785528428491, 0.11657971001311558] |
1,803.02606 | Frequency-dependent Alfv\'en-wave propagation in the solar wind: Onset
and suppression of parametric decay instability | Using numerical simulations, we investigate the onset and suppression of
parametric decay instability (PDI) in the solar wind, focusing on the
suppression effect by the wind acceleration and expansion. We also discuss the
role of PDI in generating the density fluctuation in the solar wind and the
cross-helicity evolution up to $1 {\rm \ au}$. Numerical simulations from the
coronal base to 1 au are conducted in a self-consistent manner; we take into
account the feedback of wave energy and pressure in the background.
Monochromatic waves with various injection frequencies $f_0$ are injected to
discuss the suppression of PDI, while broadband waves are applied to compare
the numerical results with observation. We find, via the simulations with
monochromatic waves, that high-frequency ($f_0 \gtrsim10^{-3} {\rm \ Hz}$)
Alfv\'en waves are subject to PDI. Meanwhile, the maximum growth rate of the
PDI of low-frequency ($f_0 \lesssim10^{-4} {\rm \ Hz}$) Alfv\'en waves becomes
negative due to acceleration and expansion effects. Medium-frequency ($f_0
\approx 10^{-3.5} {\rm \ Hz}$) Alfv\'en waves have a positive growth rate but
do not show the signature of PDI up to 1 au because the growth rate is too
small. The medium-frequency waves experience neither PDI nor reflection so they
propagate through the solar wind most efficiently. This is called the
frequency-filtering mechanism of the solar wind. The simulations with broadband
waves indicate that the observed trend of the density fluctuation is well
explained by the evolution of PDI while the observed cross-helicity evolution
is in agreement with low-frequency wave propagation.
| astro-ph.SR | using numerical simulations we investigate the onset and suppression of parametric decay instability pdi in the solar wind focusing on the suppression effect by the wind acceleration and expansion we also discuss the role of pdi in generating the density fluctuation in the solar wind and the crosshelicity evolution up to 1 rm au numerical simulations from the coronal base to 1 au are conducted in a selfconsistent manner we take into account the feedback of wave energy and pressure in the background monochromatic waves with various injection frequencies f_0 are injected to discuss the suppression of pdi while broadband waves are applied to compare the numerical results with observation we find via the simulations with monochromatic waves that highfrequency f_0 gtrsim103 rm hz alfven waves are subject to pdi meanwhile the maximum growth rate of the pdi of lowfrequency f_0 lesssim104 rm hz alfven waves becomes negative due to acceleration and expansion effects mediumfrequency f_0 approx 1035 rm hz alfven waves have a positive growth rate but do not show the signature of pdi up to 1 au because the growth rate is too small the mediumfrequency waves experience neither pdi nor reflection so they propagate through the solar wind most efficiently this is called the frequencyfiltering mechanism of the solar wind the simulations with broadband waves indicate that the observed trend of the density fluctuation is well explained by the evolution of pdi while the observed crosshelicity evolution is in agreement with lowfrequency wave propagation | [['using', 'numerical', 'simulations', 'we', 'investigate', 'the', 'onset', 'and', 'suppression', 'of', 'parametric', 'decay', 'instability', 'pdi', 'in', 'the', 'solar', 'wind', 'focusing', 'on', 'the', 'suppression', 'effect', 'by', 'the', 'wind', 'acceleration', 'and', 'expansion', 'we', 'also', 'discuss', 'the', 'role', 'of', 'pdi', 'in', 'generating', 'the', 'density', 'fluctuation', 'in', 'the', 'solar', 'wind', 'and', 'the', 'crosshelicity', 'evolution', 'up', 'to', '1', 'rm', 'au', 'numerical', 'simulations', 'from', 'the', 'coronal', 'base', 'to', '1', 'au', 'are', 'conducted', 'in', 'a', 'selfconsistent', 'manner', 'we', 'take', 'into', 'account', 'the', 'feedback', 'of', 'wave', 'energy', 'and', 'pressure', 'in', 'the', 'background', 'monochromatic', 'waves', 'with', 'various', 'injection', 'frequencies', 'f_0', 'are', 'injected', 'to', 'discuss', 'the', 'suppression', 'of', 'pdi', 'while', 'broadband', 'waves', 'are', 'applied', 'to', 'compare', 'the', 'numerical', 'results', 'with', 'observation', 'we', 'find', 'via', 'the', 'simulations', 'with', 'monochromatic', 'waves', 'that', 'highfrequency', 'f_0', 'gtrsim103', 'rm', 'hz', 'alfven', 'waves', 'are', 'subject', 'to', 'pdi', 'meanwhile', 'the', 'maximum', 'growth', 'rate', 'of', 'the', 'pdi', 'of', 'lowfrequency', 'f_0', 'lesssim104', 'rm', 'hz', 'alfven', 'waves', 'becomes', 'negative', 'due', 'to', 'acceleration', 'and', 'expansion', 'effects', 'mediumfrequency', 'f_0', 'approx', '1035', 'rm', 'hz', 'alfven', 'waves', 'have', 'a', 'positive', 'growth', 'rate', 'but', 'do', 'not', 'show', 'the', 'signature', 'of', 'pdi', 'up', 'to', '1', 'au', 'because', 'the', 'growth', 'rate', 'is', 'too', 'small', 'the', 'mediumfrequency', 'waves', 'experience', 'neither', 'pdi', 'nor', 'reflection', 'so', 'they', 'propagate', 'through', 'the', 'solar', 'wind', 'most', 'efficiently', 'this', 'is', 'called', 'the', 'frequencyfiltering', 'mechanism', 'of', 'the', 'solar', 'wind', 'the', 'simulations', 'with', 'broadband', 'waves', 'indicate', 'that', 'the', 'observed', 'trend', 'of', 'the', 'density', 'fluctuation', 'is', 'well', 'explained', 'by', 'the', 'evolution', 'of', 'pdi', 'while', 'the', 'observed', 'crosshelicity', 'evolution', 'is', 'in', 'agreement', 'with', 'lowfrequency', 'wave', 'propagation']] | [-0.17120550037456328, 0.19224772201207413, -0.024600642822243696, 0.07346401841529243, -0.06386435400823329, -0.027165536780092047, -0.014616319435039096, 0.34948931908333386, -0.2583708704313892, -0.2906598048587519, 0.08207314206113116, -0.2895344386503812, -0.08146473123101382, 0.2357642393813817, 0.04372438261374392, 0.01778672505558158, 0.06314796382727904, -0.034512759165505204, -0.002679529280886357, -0.13236522804983566, 0.26427731402473886, 0.13025021271560552, 0.24492121225874114, 0.02995652651056511, 0.06127253286370144, -0.09439244477657556, -0.018387705521734726, -0.0483997786920177, -0.16416976007019365, 0.03130865845511236, 0.20217196894544592, 0.09650523988179847, 0.24290131368651624, -0.4643802922408331, -0.2627148202135856, 0.023164271073684673, 0.16846165501032728, 0.07215408507045509, -0.06797270150583075, -0.205435340871989, 0.08154826928630501, -0.16487254774977825, -0.12235825579723238, 0.01974273864198779, 0.01754051633368481, 0.0701756048948534, -0.29286979930475354, 0.15989894011023367, 0.03464547697903316, 0.03446077961262649, -0.09311509506807215, -0.05358236351966616, -0.09991722311247216, 0.043550832535904964, 0.11431935984580739, 0.04657083472598541, 0.14611083126865418, -0.09924075438080704, -0.04055445300646096, 0.38531504286717194, -0.11962387555399985, -0.12963803978807226, 0.1865371174001082, -0.2775194022857264, -0.043849456879287596, 0.19351792774102614, 0.17357043177504622, 0.07498397844146967, -0.06321955335371923, 0.0135365598447, 0.022231828499556048, 0.19162899047530035, 0.11532377414817059, 0.026734323547205393, 0.25147552032977705, 0.142649178815309, -0.004569256838176369, 0.07151263183914125, -0.16846797969173338, -0.00654991632478872, -0.2775307508352084, -0.08391454550972383, -0.1093554361086865, 0.07818786359907458, -0.06844013527468011, -0.1343824307306961, 0.3779772922502664, 0.17078658057437315, 0.1674415047007908, 0.01925987491149425, 0.30326179257874203, 0.18476172444236472, 0.04420233630136079, 0.12528044709413336, 0.3258178222591315, 0.18135698586399476, 0.11378250077434975, -0.2843689845668576, 0.05539303524249301, -0.01341117190091106] |
1,803.02607 | Spheroidal and conical shapes of ferrofluid-filled capsules in magnetic
fields | We investigate the deformation of soft spherical elastic capsules filled with
a ferrofluid in external uniform magnetic fields at fixed volume by a
combination of numerical and analytical approaches. We develop a numerical
iterative solution strategy based on nonlinear elastic shape equations to
calculate the stretched capsule shape numerically and a coupled finite element
and boundary element method to solve the corresponding magnetostatic problem,
and employ analytical linear response theory, approximative energy
minimization, and slender-body theory. The observed deformation behavior is
qualitatively similar to the deformation of ferrofluid droplets in uniform
magnetic fields. Homogeneous magnetic fields elongate the capsule, and a
discontinuous shape transition from a spheroidal shape to a conical shape takes
place at a critical field strength. We investigate how capsule elasticity
modifies this hysteretic shape transition. We show that conical capsule shapes
are possible but involve diverging stretch factors at the tips, which gives
rise to rupture for real capsule materials. In a slender-body approximation we
find that the critical susceptibility above which conical shapes occur for
ferrofluid capsules is the same as for droplets. At small fields capsules
remain spheroidal, and we characterize the deformation of spheroidal capsules
both analytically and numerically. Finally, we determine whether wrinkling of a
spheroidal capsule occurs during elongation in a magnetic field and how it
modifies the stretching behavior. We find the nontrivial dependence between the
extent of the wrinkled region and capsule elongation. Our results can be
helpful in order to quantitatively determine capsule or ferrofluid material
properties from magnetic deformation experiments. All results also apply to
elastic capsules filled with a dielectric liquid in an external uniform
electric field.
| cond-mat.soft physics.flu-dyn | we investigate the deformation of soft spherical elastic capsules filled with a ferrofluid in external uniform magnetic fields at fixed volume by a combination of numerical and analytical approaches we develop a numerical iterative solution strategy based on nonlinear elastic shape equations to calculate the stretched capsule shape numerically and a coupled finite element and boundary element method to solve the corresponding magnetostatic problem and employ analytical linear response theory approximative energy minimization and slenderbody theory the observed deformation behavior is qualitatively similar to the deformation of ferrofluid droplets in uniform magnetic fields homogeneous magnetic fields elongate the capsule and a discontinuous shape transition from a spheroidal shape to a conical shape takes place at a critical field strength we investigate how capsule elasticity modifies this hysteretic shape transition we show that conical capsule shapes are possible but involve diverging stretch factors at the tips which gives rise to rupture for real capsule materials in a slenderbody approximation we find that the critical susceptibility above which conical shapes occur for ferrofluid capsules is the same as for droplets at small fields capsules remain spheroidal and we characterize the deformation of spheroidal capsules both analytically and numerically finally we determine whether wrinkling of a spheroidal capsule occurs during elongation in a magnetic field and how it modifies the stretching behavior we find the nontrivial dependence between the extent of the wrinkled region and capsule elongation our results can be helpful in order to quantitatively determine capsule or ferrofluid material properties from magnetic deformation experiments all results also apply to elastic capsules filled with a dielectric liquid in an external uniform electric field | [['we', 'investigate', 'the', 'deformation', 'of', 'soft', 'spherical', 'elastic', 'capsules', 'filled', 'with', 'a', 'ferrofluid', 'in', 'external', 'uniform', 'magnetic', 'fields', 'at', 'fixed', 'volume', 'by', 'a', 'combination', 'of', 'numerical', 'and', 'analytical', 'approaches', 'we', 'develop', 'a', 'numerical', 'iterative', 'solution', 'strategy', 'based', 'on', 'nonlinear', 'elastic', 'shape', 'equations', 'to', 'calculate', 'the', 'stretched', 'capsule', 'shape', 'numerically', 'and', 'a', 'coupled', 'finite', 'element', 'and', 'boundary', 'element', 'method', 'to', 'solve', 'the', 'corresponding', 'magnetostatic', 'problem', 'and', 'employ', 'analytical', 'linear', 'response', 'theory', 'approximative', 'energy', 'minimization', 'and', 'slenderbody', 'theory', 'the', 'observed', 'deformation', 'behavior', 'is', 'qualitatively', 'similar', 'to', 'the', 'deformation', 'of', 'ferrofluid', 'droplets', 'in', 'uniform', 'magnetic', 'fields', 'homogeneous', 'magnetic', 'fields', 'elongate', 'the', 'capsule', 'and', 'a', 'discontinuous', 'shape', 'transition', 'from', 'a', 'spheroidal', 'shape', 'to', 'a', 'conical', 'shape', 'takes', 'place', 'at', 'a', 'critical', 'field', 'strength', 'we', 'investigate', 'how', 'capsule', 'elasticity', 'modifies', 'this', 'hysteretic', 'shape', 'transition', 'we', 'show', 'that', 'conical', 'capsule', 'shapes', 'are', 'possible', 'but', 'involve', 'diverging', 'stretch', 'factors', 'at', 'the', 'tips', 'which', 'gives', 'rise', 'to', 'rupture', 'for', 'real', 'capsule', 'materials', 'in', 'a', 'slenderbody', 'approximation', 'we', 'find', 'that', 'the', 'critical', 'susceptibility', 'above', 'which', 'conical', 'shapes', 'occur', 'for', 'ferrofluid', 'capsules', 'is', 'the', 'same', 'as', 'for', 'droplets', 'at', 'small', 'fields', 'capsules', 'remain', 'spheroidal', 'and', 'we', 'characterize', 'the', 'deformation', 'of', 'spheroidal', 'capsules', 'both', 'analytically', 'and', 'numerically', 'finally', 'we', 'determine', 'whether', 'wrinkling', 'of', 'a', 'spheroidal', 'capsule', 'occurs', 'during', 'elongation', 'in', 'a', 'magnetic', 'field', 'and', 'how', 'it', 'modifies', 'the', 'stretching', 'behavior', 'we', 'find', 'the', 'nontrivial', 'dependence', 'between', 'the', 'extent', 'of', 'the', 'wrinkled', 'region', 'and', 'capsule', 'elongation', 'our', 'results', 'can', 'be', 'helpful', 'in', 'order', 'to', 'quantitatively', 'determine', 'capsule', 'or', 'ferrofluid', 'material', 'properties', 'from', 'magnetic', 'deformation', 'experiments', 'all', 'results', 'also', 'apply', 'to', 'elastic', 'capsules', 'filled', 'with', 'a', 'dielectric', 'liquid', 'in', 'an', 'external', 'uniform', 'electric', 'field']] | [-0.11399227611972294, 0.15491303108720414, -0.11501838011938625, 0.02436044414027687, -0.08680559540377085, -0.10920682256333393, -0.019439471680224217, 0.43917147600439094, -0.27417238304783276, -0.2647469367469383, 0.025912359124049544, -0.2369618212685635, -0.19959731951160048, 0.14554857906912938, -0.023576847838931218, 0.04268412582913063, -0.00048097224504003007, 0.014083457492958631, -0.07230572574329476, -0.1534305231016803, 0.2694459384516899, 0.017411378935680507, 0.33102899151974496, 0.04681146031802321, 0.09259889928307866, -0.023126593699018948, 0.08310121980347976, 0.10323333618406386, -0.20546625662584078, 0.06775850939394294, 0.20913721941672678, -0.03573961803909542, 0.19653561829702715, -0.5188237090227349, -0.21781020929991368, 0.048337042701131636, 0.13727320673810214, 0.13583353347131275, -0.04999458060790596, -0.23308442334379878, 0.06592905013718921, -0.13855050268971336, -0.2097394904443939, -0.10110097643455346, 0.03057074915874162, 0.06284336810250685, -0.26395567414536386, 0.09394918816459255, 0.04953001487254409, 0.056562258177643085, -0.160314263833508, -0.04588187037884667, -0.009026139546306013, 0.10218299679007944, 0.08462950276048256, 0.02558176499740753, 0.23609267270219997, -0.1695501202909874, -0.012986853780616694, 0.36814741525331657, -0.03412864131769647, -0.19627646430880105, 0.1579329494182433, -0.13731380482462005, -0.052378211051871744, 0.20648652215563862, 0.2160922228135306, 0.10466772282661052, -0.07346077570416776, 0.03608953806002903, -0.011286738927465798, 0.15594262163742442, 0.11758304227614343, -0.09402451275184585, 0.2121230850676659, 0.17049989230394694, 0.028421292975854225, 0.2109413484476139, -0.11118490766816364, -0.07638801396003927, -0.29892881363424095, -0.12811705305471302, -0.1504380506935024, 0.03081022406931678, -0.11582848865732574, -0.2296142477088529, 0.3666033661474106, 0.0690086827874596, 0.20420975634154634, 0.01230547804302945, 0.27093044029311636, 0.05275659849935957, 0.047646717646724554, 0.054953195676173176, 0.29408039289227655, 0.15350939530356894, 0.11502090035860403, -0.26407536980524193, 0.02833276143816482, 0.06778639293451041] |
1,803.02608 | Multiferroicity of CuCrO2 tested by ESR | We have carried out the ESR study of the multiferroic triangular
antiferromagnet CuCrO2 in the presence of an electric field. The shift of ESR
spectra by the electric field was observed; the observed value of the shift
exceeds that one in materials with linear magnetoelectric coupling. It was
shown that the low-frequency dynamics of magnetically ordered CuCrO2 is defined
by joint oscillations of the spin plane and electric polarization. The results
demonstrate qualitative and quantitative agreement with theoretical
expectations of a phenomenological model (V.I. Marchenko (2014)).
| cond-mat.str-el | we have carried out the esr study of the multiferroic triangular antiferromagnet cucro2 in the presence of an electric field the shift of esr spectra by the electric field was observed the observed value of the shift exceeds that one in materials with linear magnetoelectric coupling it was shown that the lowfrequency dynamics of magnetically ordered cucro2 is defined by joint oscillations of the spin plane and electric polarization the results demonstrate qualitative and quantitative agreement with theoretical expectations of a phenomenological model vi marchenko 2014 | [['we', 'have', 'carried', 'out', 'the', 'esr', 'study', 'of', 'the', 'multiferroic', 'triangular', 'antiferromagnet', 'cucro2', 'in', 'the', 'presence', 'of', 'an', 'electric', 'field', 'the', 'shift', 'of', 'esr', 'spectra', 'by', 'the', 'electric', 'field', 'was', 'observed', 'the', 'observed', 'value', 'of', 'the', 'shift', 'exceeds', 'that', 'one', 'in', 'materials', 'with', 'linear', 'magnetoelectric', 'coupling', 'it', 'was', 'shown', 'that', 'the', 'lowfrequency', 'dynamics', 'of', 'magnetically', 'ordered', 'cucro2', 'is', 'defined', 'by', 'joint', 'oscillations', 'of', 'the', 'spin', 'plane', 'and', 'electric', 'polarization', 'the', 'results', 'demonstrate', 'qualitative', 'and', 'quantitative', 'agreement', 'with', 'theoretical', 'expectations', 'of', 'a', 'phenomenological', 'model', 'vi', 'marchenko', '2014']] | [-0.1702007081692627, 0.15617734443570275, -0.032926657832725796, -0.01437057830463705, -0.06554006594558094, -0.08488995535299182, 0.02589716331296882, 0.39254247968973116, -0.2203306965150892, -0.29829588428486226, 0.021425786474178178, -0.31827363857003144, -0.12772433050409998, 0.19358567195825366, 0.06518586661103506, 0.020200156893711105, -0.0255165281272385, 0.02079525066073984, -0.04665262484381538, -0.1748558874025421, 0.23360472563437598, 0.05415653420049091, 0.31909630453582244, 0.032461589776239426, 0.06158901849588336, 0.016206910535909756, 0.07970986303028672, 0.07816360249768856, -0.13251217705878526, 0.06782681593498172, 0.2175999785513552, -0.03175234762128702, 0.16195754507599874, -0.4022020357336069, -0.20694886752252661, 0.019499247124808473, 0.0878455596238234, 0.10718236267999855, -0.07651883920351434, -0.3138032893455306, 0.020911535822114972, -0.13551084926557663, -0.12606287153632662, -0.1146950306977297, -0.006292828112342503, 0.03449239515493689, -0.2730606236646688, 0.09172087624062632, 0.09195797817326735, 0.14228266089894745, -0.11860988175951291, -0.14475938095169705, -0.06839851856361641, 0.03969645395680049, 0.09032867259351364, 0.07326994927567539, 0.12625760144315834, -0.08537618621783115, -0.16728920205279665, 0.33841248411078784, -0.09501494658937634, -0.07857194960355586, 0.08055020154313032, -0.2656557538524963, -0.07840428039767282, 0.16262511763894974, 0.09168784900535938, 0.08461211669410384, -0.13129310117666285, 0.10482882403871478, -0.09006556883714227, 0.18178625222901965, 0.00656572773207932, 0.004658321935875033, 0.27138122651985913, 0.16740005902761898, -0.010915338221482586, 0.16560801786511356, -0.11682250694003563, -0.07854556331281053, -0.23557489551603794, -0.09799822561746073, -0.20042252048530595, 0.045000206099736484, -0.058563547825838745, -0.15788316865401547, 0.41939850637775866, 0.16950678861115215, 0.16413065456503698, -0.07175933719655975, 0.24719605545599965, 0.15899136627829352, 0.03192422609386403, 0.00627784704421322, 0.3435974450738624, 0.24533184048676387, 0.17618723117291582, -0.3380613516810415, 0.05860784871308783, -0.007357975443673515] |
1,803.02609 | Experimental Determination of Configurational Entropy in a
Two-Dimensional Liquid under Random Pinning | A quasi two-dimensional colloidal suspension is studied under the influence
of immobilisation (pinning) of a random fraction of its particles. We introduce
a novel experimental method to perform random pinning and, with the support of
numerical simulation, we find that increasing the pinning concentration
smoothly arrests the system, with a cross-over from a regime of high mobility
and high entropy to a regime of low mobility and low entropy. At the local
level, we study fluctuations in area fraction and concentration of pins and map
them to entropic structural signatures and local mobility, obtaining a measure
for the local entropic fluctuations of the experimental system.
| cond-mat.soft | a quasi twodimensional colloidal suspension is studied under the influence of immobilisation pinning of a random fraction of its particles we introduce a novel experimental method to perform random pinning and with the support of numerical simulation we find that increasing the pinning concentration smoothly arrests the system with a crossover from a regime of high mobility and high entropy to a regime of low mobility and low entropy at the local level we study fluctuations in area fraction and concentration of pins and map them to entropic structural signatures and local mobility obtaining a measure for the local entropic fluctuations of the experimental system | [['a', 'quasi', 'twodimensional', 'colloidal', 'suspension', 'is', 'studied', 'under', 'the', 'influence', 'of', 'immobilisation', 'pinning', 'of', 'a', 'random', 'fraction', 'of', 'its', 'particles', 'we', 'introduce', 'a', 'novel', 'experimental', 'method', 'to', 'perform', 'random', 'pinning', 'and', 'with', 'the', 'support', 'of', 'numerical', 'simulation', 'we', 'find', 'that', 'increasing', 'the', 'pinning', 'concentration', 'smoothly', 'arrests', 'the', 'system', 'with', 'a', 'crossover', 'from', 'a', 'regime', 'of', 'high', 'mobility', 'and', 'high', 'entropy', 'to', 'a', 'regime', 'of', 'low', 'mobility', 'and', 'low', 'entropy', 'at', 'the', 'local', 'level', 'we', 'study', 'fluctuations', 'in', 'area', 'fraction', 'and', 'concentration', 'of', 'pins', 'and', 'map', 'them', 'to', 'entropic', 'structural', 'signatures', 'and', 'local', 'mobility', 'obtaining', 'a', 'measure', 'for', 'the', 'local', 'entropic', 'fluctuations', 'of', 'the', 'experimental', 'system']] | [-0.15219737093540883, 0.18005349652930386, -0.1023452727257141, 0.009086618427231553, 0.01980894911768181, -0.12449935603709449, 0.12280722455443105, 0.32915732310641377, -0.269870330065134, -0.28815320833098323, 0.05140233145294977, -0.3305572166684128, -0.13264958150684833, 0.14650469211684097, -0.021895086800768262, 0.06940026753304882, -0.012229241670242377, 0.009231736972218468, -0.04793972306929174, -0.19666609915549912, 0.2570401791882302, 0.09216497472176949, 0.3429788351879411, 0.11398135708101714, 0.12960927382643733, 9.418977646245843e-05, 0.04389044496984709, 0.12314626686275006, -0.1803623256121812, 0.12346820652130104, 0.1799848078439633, -0.004801844557126363, 0.26511129459720995, -0.39183765353546257, -0.25029112229877637, 0.08761022701593382, 0.10945379389006467, 0.13141017617613432, -0.10586879572698048, -0.26748446325461067, 0.11044953563915831, -0.16441011370292732, -0.1337799336872108, -0.09007396618613885, 0.015248221655686697, 0.06864144963301008, -0.26787170898169277, 0.14717545959034137, 0.04151712827207077, 0.09291973757069735, -0.08474907486677347, -0.0229285811451042, -0.024046282714144104, 0.11315210109931373, 0.044179671786592475, 0.005576623598435184, 0.2201848329399668, -0.16415670899053414, -0.051873392700439405, 0.34370306403864, -0.06472168353696664, -0.1773058399358498, 0.24615635783189818, -0.18374140346866277, -0.11002232889156965, 0.15107785529856171, 0.19828024010750508, 0.06651153002998658, -0.10072145544524704, 0.03818588410448726, -0.003489901717486126, 0.16779142996030194, 0.005968466472058069, 0.03170979631222075, 0.2207025764731779, 0.19079877271183898, 0.10911123791620844, 0.20139440331785452, -0.14073863700059952, -0.09270881548346509, -0.25396827744940914, -0.16734090449643277, -0.20867865137046293, 0.05324006141385152, -0.11683107637051893, -0.19589714599507196, 0.36463370931645234, 0.14970278401992151, 0.26101786659232207, 0.08598040746791022, 0.23125480273184146, 0.10530695031130953, 0.007379919850444864, 0.036792161364463116, 0.19183662366565493, 0.1251271295228175, 0.12548134112065393, -0.2595820340926626, 0.05387397469908354, 0.03250386821593912] |
1,803.0261 | Submanifolds of Generalized Sasakian-space-forms with respect to certain
connections | The present paper deals with some results of submanifolds of generalized
Sasakian-space-forms in \cite{ALEGRE3} with respect to semisymmetric metric
connection, semisymmetric non-metric connection, Schouten-van Kampen connection
and Tanaka-webster connection.
| math.DG | the present paper deals with some results of submanifolds of generalized sasakianspaceforms in citealegre3 with respect to semisymmetric metric connection semisymmetric nonmetric connection schoutenvan kampen connection and tanakawebster connection | [['the', 'present', 'paper', 'deals', 'with', 'some', 'results', 'of', 'submanifolds', 'of', 'generalized', 'sasakianspaceforms', 'in', 'citealegre3', 'with', 'respect', 'to', 'semisymmetric', 'metric', 'connection', 'semisymmetric', 'nonmetric', 'connection', 'schoutenvan', 'kampen', 'connection', 'and', 'tanakawebster', 'connection']] | [-0.30929052041444394, 0.04640425562891843, -0.024042922338204726, 0.12595932451742037, -0.2713831329186048, -0.20179211634344288, -0.06854566113906913, 0.41304159856268335, -0.22415372715996845, -0.2346952307374782, 0.04773739866297027, -0.34069050745373325, -0.33972855577511446, 0.04809540007097114, -0.24985211409096206, 0.0008313337207904883, 0.07999219944966691, 0.08203006276328649, -0.20472534310205706, -0.19476506832454885, 0.5348545956824508, 0.13360017419576511, 0.19834183346080994, 0.08112279658338853, 0.15077133237251214, -0.04002151609997132, -0.1436875819261851, 0.057333103541168384, -0.22679588770759956, 0.2043637201589133, 0.23771881990666902, 0.07399384873653096, 0.13502800704113074, -0.37634158646687865, -0.13011293863278947, 0.1734721894775118, 0.052170550928817, -0.12432765501580434, -0.022903156633089696, -0.35728170563067707, 0.03591879932069527, -0.14049646860387707, -0.23596745889101708, -0.10036245939720954, -0.018630087043025663, 0.027496016318244592, -0.04736524527626378, 0.09582353815702456, 0.09346410667889618, 0.03400250364627157, -0.06216570668454681, -0.004444258187764457, 0.008610447735658713, -3.7767974260662284e-05, 0.06653719189177666, 0.12958745666713054, -0.12910065656927014, -0.014414937900645393, -0.21443204832861998, 0.30215379622365746, -0.08380520533371184, -0.32415891871122376, 0.14262612536549568, -0.04886681912466884, -0.21653906209394336, -0.04047964493344937, 0.11057259697866227, 0.08168222422578506, -0.10877467469046158, 0.18760147619052855, -0.0026212164999118875, -0.048636381181755235, 0.16708209585132344, 0.04843975570318954, 0.1323923571035266, 0.07784711286824729, 0.1026428465931011, 0.19521132538128377, 0.1052828316709825, -0.21079828157754882, -0.3668801805802754, -0.2525573042886598, -0.05965094660807933, 0.132971119809164, -0.2283701898491667, -0.20989929522121592, 0.3267310188374332, -0.034106858008142026, 0.2002827936916479, 0.2488368609920144, 0.13320477293538197, -0.10180080555645483, -0.08286196402540165, 0.1038702449628285, 0.25678523815024945, 0.48192749824374914, 0.08930658455938101, -0.08794829033182136, -0.07897525317301708, 0.1646668470930308] |
1,803.02611 | Magnetoresistance in Hybrid Pt/CoFe2O4 Bilayers Controlled by Competing
Spin Accumulation and Interfacial Chemical Reconstruction | Pure spin currents hold promises for an energy-friendlier spintronics. They
can be generated by a flow of charge along a non-magnetic metal having a large
spin-orbit coupling. It produces a spin accumulation at its surfaces,
controllable by the magnetization of an adjacent ferromagnetic layer.
Paramagnetic metals typically used are close to a ferromagnetic instability and
thus magnetic proximity effects can contribute to the observed
angular-dependent magnetoresistance (ADMR). As interface phenomena govern the
spin conductance across the metal/ferromagnetic-insulator heterostructures,
unraveling these distinct contributions is pivotal to full understanding of
spin current conductance. We report here x-ray absorption and magnetic circular
dichroism (XMCD) at Pt-M and (Co,Fe)-L absorption edges and atomically-resolved
energy loss electron spectroscopy (EELS) data of Pt/CoFe2O4 bilayers where
CoFe2O4 layers have been capped by Pt grown at different temperatures. It turns
out that the ADMR differs dramatically, being either dominated by spin Hall
magnetoresistance (SMR) associated to spin Hall effect or anisotropic
magnetoresistance (AMR). The XMCD and EELS data indicate that the Pt layer
grown at room temperature does not display any magnetic moment, whereas when
grown at higher temperature it is magnetic due to interfacial Pt-(Co,Fe)
alloying. These results allow disentangling spin accumulation from interfacial
chemical reconstructions and for tailoring the angular dependent
magnetoresistance.
| cond-mat.mtrl-sci | pure spin currents hold promises for an energyfriendlier spintronics they can be generated by a flow of charge along a nonmagnetic metal having a large spinorbit coupling it produces a spin accumulation at its surfaces controllable by the magnetization of an adjacent ferromagnetic layer paramagnetic metals typically used are close to a ferromagnetic instability and thus magnetic proximity effects can contribute to the observed angulardependent magnetoresistance admr as interface phenomena govern the spin conductance across the metalferromagneticinsulator heterostructures unraveling these distinct contributions is pivotal to full understanding of spin current conductance we report here xray absorption and magnetic circular dichroism xmcd at ptm and cofel absorption edges and atomicallyresolved energy loss electron spectroscopy eels data of ptcofe2o4 bilayers where cofe2o4 layers have been capped by pt grown at different temperatures it turns out that the admr differs dramatically being either dominated by spin hall magnetoresistance smr associated to spin hall effect or anisotropic magnetoresistance amr the xmcd and eels data indicate that the pt layer grown at room temperature does not display any magnetic moment whereas when grown at higher temperature it is magnetic due to interfacial ptcofe alloying these results allow disentangling spin accumulation from interfacial chemical reconstructions and for tailoring the angular dependent magnetoresistance | [['pure', 'spin', 'currents', 'hold', 'promises', 'for', 'an', 'energyfriendlier', 'spintronics', 'they', 'can', 'be', 'generated', 'by', 'a', 'flow', 'of', 'charge', 'along', 'a', 'nonmagnetic', 'metal', 'having', 'a', 'large', 'spinorbit', 'coupling', 'it', 'produces', 'a', 'spin', 'accumulation', 'at', 'its', 'surfaces', 'controllable', 'by', 'the', 'magnetization', 'of', 'an', 'adjacent', 'ferromagnetic', 'layer', 'paramagnetic', 'metals', 'typically', 'used', 'are', 'close', 'to', 'a', 'ferromagnetic', 'instability', 'and', 'thus', 'magnetic', 'proximity', 'effects', 'can', 'contribute', 'to', 'the', 'observed', 'angulardependent', 'magnetoresistance', 'admr', 'as', 'interface', 'phenomena', 'govern', 'the', 'spin', 'conductance', 'across', 'the', 'metalferromagneticinsulator', 'heterostructures', 'unraveling', 'these', 'distinct', 'contributions', 'is', 'pivotal', 'to', 'full', 'understanding', 'of', 'spin', 'current', 'conductance', 'we', 'report', 'here', 'xray', 'absorption', 'and', 'magnetic', 'circular', 'dichroism', 'xmcd', 'at', 'ptm', 'and', 'cofel', 'absorption', 'edges', 'and', 'atomicallyresolved', 'energy', 'loss', 'electron', 'spectroscopy', 'eels', 'data', 'of', 'ptcofe2o4', 'bilayers', 'where', 'cofe2o4', 'layers', 'have', 'been', 'capped', 'by', 'pt', 'grown', 'at', 'different', 'temperatures', 'it', 'turns', 'out', 'that', 'the', 'admr', 'differs', 'dramatically', 'being', 'either', 'dominated', 'by', 'spin', 'hall', 'magnetoresistance', 'smr', 'associated', 'to', 'spin', 'hall', 'effect', 'or', 'anisotropic', 'magnetoresistance', 'amr', 'the', 'xmcd', 'and', 'eels', 'data', 'indicate', 'that', 'the', 'pt', 'layer', 'grown', 'at', 'room', 'temperature', 'does', 'not', 'display', 'any', 'magnetic', 'moment', 'whereas', 'when', 'grown', 'at', 'higher', 'temperature', 'it', 'is', 'magnetic', 'due', 'to', 'interfacial', 'ptcofe', 'alloying', 'these', 'results', 'allow', 'disentangling', 'spin', 'accumulation', 'from', 'interfacial', 'chemical', 'reconstructions', 'and', 'for', 'tailoring', 'the', 'angular', 'dependent', 'magnetoresistance']] | [-0.15246396627747408, 0.22499220202677528, -0.026991132095843407, -0.012984824989286095, -0.07312632789881439, -0.17711564882354128, 0.029005278096970004, 0.43160835862860525, -0.2939511544101682, -0.3279240508303215, -0.025131938181411805, -0.3549300020458038, -0.09897988063795031, 0.21658445335117787, 0.07919761883940647, -0.012168095990874813, -0.03536338887885121, -0.11493405145575698, -0.10774934708802399, -0.18406784873557194, 0.26445355014368377, 0.03506384406579972, 0.32639632280339664, 0.143110922877769, 0.05360309472238405, 0.0075570765875814724, 0.13750834135185364, 0.0895661986156339, -0.11780302622852591, 0.001206940927515083, 0.2710568472941286, -0.18919740840078028, 0.14033012753029786, -0.4821781249772204, -0.19911820521649656, -0.020927528654787652, 0.1273993734422481, 0.16396695628559382, -0.09929587079977414, -0.23262040613975266, 0.06950538417285235, -0.10018228110050469, -0.09012127934613882, -0.11701954761058977, -0.042175453045580645, -0.06055202870860253, -0.2674244836071912, 0.11451583322930602, 0.1027652012183686, 0.12077847619726563, -0.07660343125520164, -0.16891820339421457, -0.18052570616577449, 0.05720326043754738, 0.05486515586063875, 0.061761161340123945, 0.2271881882898915, -0.0873164293058862, -0.14629553473614487, 0.27912716990760944, -0.030159513278470124, -0.06511792790555017, 0.16308293775176988, -0.2542450614596284, -0.0412910878030113, 0.19171426912751233, 0.12126967857020104, 0.11341917983704077, -0.14501181101384122, 0.054788308284397576, 0.02547040908818714, 0.17427879400346152, 0.10138450740458499, 0.07120031854691039, 0.3507241911167224, 0.1731838704689664, 0.03552077176011315, 0.09080342708286912, -0.17055368904136167, 0.018720672647975903, -0.13352630442552416, -0.16709897587753575, -0.23691739277835788, 0.1454467991688133, -0.0705959943276173, -0.1969011783286339, 0.36135241140998753, 0.17037063013845224, 0.16626360094506698, -0.08677118008574217, 0.2841736866843582, 0.10565335790933303, 0.13379980477453718, 0.033451136441366505, 0.2413990587736065, 0.2198461098400507, 0.18469438601243723, -0.33572114296464967, 0.16727990890382835, -0.056815134843400485] |
1,803.02612 | Single View Stereo Matching | Previous monocular depth estimation methods take a single view and directly
regress the expected results. Though recent advances are made by applying
geometrically inspired loss functions during training, the inference procedure
does not explicitly impose any geometrical constraint. Therefore these models
purely rely on the quality of data and the effectiveness of learning to
generalize. This either leads to suboptimal results or the demand of huge
amount of expensive ground truth labelled data to generate reasonable results.
In this paper, we show for the first time that the monocular depth estimation
problem can be reformulated as two sub-problems, a view synthesis procedure
followed by stereo matching, with two intriguing properties, namely i)
geometrical constraints can be explicitly imposed during inference; ii) demand
on labelled depth data can be greatly alleviated. We show that the whole
pipeline can still be trained in an end-to-end fashion and this new formulation
plays a critical role in advancing the performance. The resulting model
outperforms all the previous monocular depth estimation methods as well as the
stereo block matching method in the challenging KITTI dataset by only using a
small number of real training data. The model also generalizes well to other
monocular depth estimation benchmarks. We also discuss the implications and the
advantages of solving monocular depth estimation using stereo methods.
| cs.CV | previous monocular depth estimation methods take a single view and directly regress the expected results though recent advances are made by applying geometrically inspired loss functions during training the inference procedure does not explicitly impose any geometrical constraint therefore these models purely rely on the quality of data and the effectiveness of learning to generalize this either leads to suboptimal results or the demand of huge amount of expensive ground truth labelled data to generate reasonable results in this paper we show for the first time that the monocular depth estimation problem can be reformulated as two subproblems a view synthesis procedure followed by stereo matching with two intriguing properties namely i geometrical constraints can be explicitly imposed during inference ii demand on labelled depth data can be greatly alleviated we show that the whole pipeline can still be trained in an endtoend fashion and this new formulation plays a critical role in advancing the performance the resulting model outperforms all the previous monocular depth estimation methods as well as the stereo block matching method in the challenging kitti dataset by only using a small number of real training data the model also generalizes well to other monocular depth estimation benchmarks we also discuss the implications and the advantages of solving monocular depth estimation using stereo methods | [['previous', 'monocular', 'depth', 'estimation', 'methods', 'take', 'a', 'single', 'view', 'and', 'directly', 'regress', 'the', 'expected', 'results', 'though', 'recent', 'advances', 'are', 'made', 'by', 'applying', 'geometrically', 'inspired', 'loss', 'functions', 'during', 'training', 'the', 'inference', 'procedure', 'does', 'not', 'explicitly', 'impose', 'any', 'geometrical', 'constraint', 'therefore', 'these', 'models', 'purely', 'rely', 'on', 'the', 'quality', 'of', 'data', 'and', 'the', 'effectiveness', 'of', 'learning', 'to', 'generalize', 'this', 'either', 'leads', 'to', 'suboptimal', 'results', 'or', 'the', 'demand', 'of', 'huge', 'amount', 'of', 'expensive', 'ground', 'truth', 'labelled', 'data', 'to', 'generate', 'reasonable', 'results', 'in', 'this', 'paper', 'we', 'show', 'for', 'the', 'first', 'time', 'that', 'the', 'monocular', 'depth', 'estimation', 'problem', 'can', 'be', 'reformulated', 'as', 'two', 'subproblems', 'a', 'view', 'synthesis', 'procedure', 'followed', 'by', 'stereo', 'matching', 'with', 'two', 'intriguing', 'properties', 'namely', 'i', 'geometrical', 'constraints', 'can', 'be', 'explicitly', 'imposed', 'during', 'inference', 'ii', 'demand', 'on', 'labelled', 'depth', 'data', 'can', 'be', 'greatly', 'alleviated', 'we', 'show', 'that', 'the', 'whole', 'pipeline', 'can', 'still', 'be', 'trained', 'in', 'an', 'endtoend', 'fashion', 'and', 'this', 'new', 'formulation', 'plays', 'a', 'critical', 'role', 'in', 'advancing', 'the', 'performance', 'the', 'resulting', 'model', 'outperforms', 'all', 'the', 'previous', 'monocular', 'depth', 'estimation', 'methods', 'as', 'well', 'as', 'the', 'stereo', 'block', 'matching', 'method', 'in', 'the', 'challenging', 'kitti', 'dataset', 'by', 'only', 'using', 'a', 'small', 'number', 'of', 'real', 'training', 'data', 'the', 'model', 'also', 'generalizes', 'well', 'to', 'other', 'monocular', 'depth', 'estimation', 'benchmarks', 'we', 'also', 'discuss', 'the', 'implications', 'and', 'the', 'advantages', 'of', 'solving', 'monocular', 'depth', 'estimation', 'using', 'stereo', 'methods']] | [-0.046052804924891014, 0.0383927228089775, -0.05079299641434052, 0.024205106409258006, -0.12363167746906696, -0.15510803769655904, 0.025165586703894703, 0.4228950633993587, -0.2924998360728922, -0.3816556523850162, 0.12433985844769511, -0.22997115131291618, -0.172318027733529, 0.2311061242657546, -0.17636880628798965, 0.10868996987333908, 0.1845508971528369, 0.008933793019486188, -0.11452527583924375, -0.28217022333611746, 0.27234379972829076, 0.03000699979798173, 0.32484091353958927, 0.03656563293489237, 0.11586339388489036, 0.02528956896316449, -0.034981850422553994, 0.056269131914158846, -0.07827684920731007, 0.1525538033762333, 0.2568336955777055, 0.21265550817508885, 0.2618964624028945, -0.4502503905222163, -0.24292828120862045, 0.1058590068065557, 0.17569387539650402, 0.12429012184692247, -0.02456692536576106, -0.3338846153223432, 0.02606222045946918, -0.13661518273016757, -0.025511923046516522, -0.10546461600286688, -0.058756656989815734, -0.030558294436115394, -0.30413532796721426, 0.04964618491248146, 0.04794009851424822, 0.06421730769068552, -0.07830763870017594, -0.1197716564214724, 0.008520035620366786, 0.16797727072710164, 0.03979435019583488, 0.05041918218401926, 0.11559135627756882, -0.18362082760702725, -0.11439409277086417, 0.362197240333884, -0.05472398546930995, -0.21791242011543793, 0.16983228817170118, -0.03906120007432791, -0.16187778314841644, 0.11903794896939109, 0.1797234708602081, 0.12297378917555174, -0.14652557386630452, 0.05421419475283388, -0.06297403165624232, 0.18050052589749754, 0.0362250424013795, -0.013180752177261383, 0.17805059469135454, 0.21460058290429826, 0.05301729801072297, 0.12946810346651472, -0.15333942802245235, -0.051476219915763434, -0.24791133912786636, -0.08133865267248644, -0.2175814096278335, -0.044980847252002264, -0.09774308020119182, -0.1373778932732165, 0.3533794139270469, 0.2623481576230102, 0.2527233143873547, 0.10008621419825423, 0.4058381817325057, 0.08386679821109082, 0.08393445300058491, 0.06489448748852988, 0.23455782038103876, -0.0020774239770776255, 0.09350043150042678, -0.17522639948295318, 0.10226039983887947, 0.08990045662106697] |
1,803.02613 | Correct by Construction Resource-based Process Composition | The need for rigorous process composition is encountered in many situations
pertaining to the development and analysis of complex systems. We discuss the
use of Classical Linear Logic (CLL) for correct-by-construction resource-based
process composition. Abstract processes are specified as CLL sequents
describing the types of input and output resources. The proofs-as-processes
paradigm and its recent evolutions enable the composition of such processes via
logical inference, with mathematical guarantees when it comes to concurrent
execution, deadlock freedom, and systematic resource accounting. We introduce
algorithms to automate the necessary inference steps for binary compositions of
processes in parallel, conditionally, and in sequence. We combine decision
procedures and heuristics to achieve intuitive and practically useful
compositions in an applied setting. Our work is implemented within the formal
setting of the HOL Light proof assistant and incorporated in the WorkflowFM
prototype to facilitate diagrammatic, correct-by-construction process
workflows.
| cs.LO | the need for rigorous process composition is encountered in many situations pertaining to the development and analysis of complex systems we discuss the use of classical linear logic cll for correctbyconstruction resourcebased process composition abstract processes are specified as cll sequents describing the types of input and output resources the proofsasprocesses paradigm and its recent evolutions enable the composition of such processes via logical inference with mathematical guarantees when it comes to concurrent execution deadlock freedom and systematic resource accounting we introduce algorithms to automate the necessary inference steps for binary compositions of processes in parallel conditionally and in sequence we combine decision procedures and heuristics to achieve intuitive and practically useful compositions in an applied setting our work is implemented within the formal setting of the hol light proof assistant and incorporated in the workflowfm prototype to facilitate diagrammatic correctbyconstruction process workflows | [['the', 'need', 'for', 'rigorous', 'process', 'composition', 'is', 'encountered', 'in', 'many', 'situations', 'pertaining', 'to', 'the', 'development', 'and', 'analysis', 'of', 'complex', 'systems', 'we', 'discuss', 'the', 'use', 'of', 'classical', 'linear', 'logic', 'cll', 'for', 'correctbyconstruction', 'resourcebased', 'process', 'composition', 'abstract', 'processes', 'are', 'specified', 'as', 'cll', 'sequents', 'describing', 'the', 'types', 'of', 'input', 'and', 'output', 'resources', 'the', 'proofsasprocesses', 'paradigm', 'and', 'its', 'recent', 'evolutions', 'enable', 'the', 'composition', 'of', 'such', 'processes', 'via', 'logical', 'inference', 'with', 'mathematical', 'guarantees', 'when', 'it', 'comes', 'to', 'concurrent', 'execution', 'deadlock', 'freedom', 'and', 'systematic', 'resource', 'accounting', 'we', 'introduce', 'algorithms', 'to', 'automate', 'the', 'necessary', 'inference', 'steps', 'for', 'binary', 'compositions', 'of', 'processes', 'in', 'parallel', 'conditionally', 'and', 'in', 'sequence', 'we', 'combine', 'decision', 'procedures', 'and', 'heuristics', 'to', 'achieve', 'intuitive', 'and', 'practically', 'useful', 'compositions', 'in', 'an', 'applied', 'setting', 'our', 'work', 'is', 'implemented', 'within', 'the', 'formal', 'setting', 'of', 'the', 'hol', 'light', 'proof', 'assistant', 'and', 'incorporated', 'in', 'the', 'workflowfm', 'prototype', 'to', 'facilitate', 'diagrammatic', 'correctbyconstruction', 'process', 'workflows']] | [-0.0740041776043396, 0.056136711217493564, -0.0869850260940387, 0.08421107579218684, -0.12193043878077404, -0.13753534925124006, 0.10542317090229072, 0.3952768631477622, -0.31259830828742885, -0.3127930749683304, 0.10048818029793548, -0.18029245506998495, -0.12097571451210332, 0.20579148994606808, -0.11167864312734851, 0.11929087787049208, 0.07184465008239585, -0.036423436217406326, -0.019464977967168094, -0.231272553126757, 0.28813054663102733, 0.03396598092471877, 0.2610183757356639, 0.0006662014680287094, 0.08616610435795383, 0.09036578648518903, -0.04969770818988376, -0.0476038414747157, -0.08337210319731517, 0.13862164628011645, 0.35416111520471727, 0.2548298198987353, 0.279074186449276, -0.48320894000113856, -0.17278752568448688, 0.05269367232793242, 0.1302185693973715, 0.09461667150397726, -0.0041754003845366604, -0.27008810934713046, 0.053657929171933565, -0.1723782655391644, -0.08613123022290674, -0.1518519948400121, -0.0036639122747327366, 0.009052385009679916, -0.28072010917285234, -0.012223199954428148, 0.14568176539160693, 0.09596456357353063, -0.025109123095955886, -0.10683094451851244, 0.03590316040167281, 0.15639365718023793, -0.006757842664770346, -0.031541914101161646, 0.1472456798565092, -0.08345739223089413, -0.19164030248603076, 0.3810917898114269, 0.0020002679608709423, -0.19268560523154044, 0.23323203535529236, -0.023923702828638944, -0.2049213320574994, 0.07325221272515701, 0.18711894171986174, 0.12754850827961672, -0.21216030748850412, 0.10173412849664265, 0.08636713399162106, 0.17033578774888491, 0.04759968366929667, 0.03598322943909794, 0.183595070915944, 0.21721584804633515, 0.021071100709480994, 0.1544607104568458, 0.041649895722041544, -0.1603215020963202, -0.3054160050294818, -0.20497563084693138, -0.06959706358611584, -0.03748158269466053, -0.06910909822331213, -0.17563937852945152, 0.34397605024872624, 0.2146322692530593, 0.12361590067545573, 0.10317345116624331, 0.31833721018323663, 0.11238182922709627, 0.06424580896950281, 0.053018066472314454, 0.12590325777484962, 0.12667510417745786, 0.15800550221696708, -0.16069960467028596, 0.13683347576809718, 0.032995020893091954] |
1,803.02614 | The plasmonic resonances of a bowtie antenna | Metallic bowtie-shaped nanostructures are very interesting objects in optics,
due to their capability of localizing and enhancing electromagnetic fields in
the vicinity of their central neck. In this article, we investigate the
electrostatic plasmonic resonances of two-dimensional bowtie-shaped domains by
looking at the spectrum of their Poincar\'e variational operator. In
particular, we show that the latter only consists of essential spectrum and
fills the whole interval $[0,1]$. This behavior is very different from what
occurs in the counterpart situation of a bowtie domain with only
close-to-touching wings, a case where the essential spectrum of the Poincar\'e
variational operator is reduced to an interval strictly contained in $[0,1]$.
We provide an explanation for this difference by showing that the spectrum of
the Poincar\'e variational operator of bowtie-shaped domains with
close-to-touching wings has eigenvalues which densify and eventually fill the
remaining intervals as the distance between the two wings tends to zero.
| math.AP | metallic bowtieshaped nanostructures are very interesting objects in optics due to their capability of localizing and enhancing electromagnetic fields in the vicinity of their central neck in this article we investigate the electrostatic plasmonic resonances of twodimensional bowtieshaped domains by looking at the spectrum of their poincare variational operator in particular we show that the latter only consists of essential spectrum and fills the whole interval 01 this behavior is very different from what occurs in the counterpart situation of a bowtie domain with only closetotouching wings a case where the essential spectrum of the poincare variational operator is reduced to an interval strictly contained in 01 we provide an explanation for this difference by showing that the spectrum of the poincare variational operator of bowtieshaped domains with closetotouching wings has eigenvalues which densify and eventually fill the remaining intervals as the distance between the two wings tends to zero | [['metallic', 'bowtieshaped', 'nanostructures', 'are', 'very', 'interesting', 'objects', 'in', 'optics', 'due', 'to', 'their', 'capability', 'of', 'localizing', 'and', 'enhancing', 'electromagnetic', 'fields', 'in', 'the', 'vicinity', 'of', 'their', 'central', 'neck', 'in', 'this', 'article', 'we', 'investigate', 'the', 'electrostatic', 'plasmonic', 'resonances', 'of', 'twodimensional', 'bowtieshaped', 'domains', 'by', 'looking', 'at', 'the', 'spectrum', 'of', 'their', 'poincare', 'variational', 'operator', 'in', 'particular', 'we', 'show', 'that', 'the', 'latter', 'only', 'consists', 'of', 'essential', 'spectrum', 'and', 'fills', 'the', 'whole', 'interval', '01', 'this', 'behavior', 'is', 'very', 'different', 'from', 'what', 'occurs', 'in', 'the', 'counterpart', 'situation', 'of', 'a', 'bowtie', 'domain', 'with', 'only', 'closetotouching', 'wings', 'a', 'case', 'where', 'the', 'essential', 'spectrum', 'of', 'the', 'poincare', 'variational', 'operator', 'is', 'reduced', 'to', 'an', 'interval', 'strictly', 'contained', 'in', '01', 'we', 'provide', 'an', 'explanation', 'for', 'this', 'difference', 'by', 'showing', 'that', 'the', 'spectrum', 'of', 'the', 'poincare', 'variational', 'operator', 'of', 'bowtieshaped', 'domains', 'with', 'closetotouching', 'wings', 'has', 'eigenvalues', 'which', 'densify', 'and', 'eventually', 'fill', 'the', 'remaining', 'intervals', 'as', 'the', 'distance', 'between', 'the', 'two', 'wings', 'tends', 'to', 'zero']] | [-0.12422612449775139, 0.10001429308225246, -0.053195454155405365, 0.05847081781908249, -0.05577801964711398, -0.1021293602262934, 0.009910566043108701, 0.3974147305637598, -0.25922843389213085, -0.2588032222360683, 0.09215748840322097, -0.2826696119333307, -0.13843355117055278, 0.16610224508990845, -0.04917739078402519, -0.004564628810767317, 0.04448118148371577, 0.03005209372553509, -0.04891154976678081, -0.14793065649534887, 0.3414506882429123, 0.041149708240603405, 0.23499897594718883, 0.0721490520145744, 0.05509283878840506, 0.0053158138878643514, 0.029538183038433394, 0.006323064491152763, -0.11322202902646192, 0.15165377150910597, 0.25924822201331454, 0.03701418723755827, 0.2785127616239091, -0.3880224485322833, -0.17461419350622842, 0.1154919007141143, 0.19501636398024857, 0.061676416486346475, -0.03327873401188602, -0.2887305243204658, 0.0856440361814263, -0.11805531999561936, -0.17540185902888575, -0.005986290834844112, 0.03676776387030259, 0.007002463891015698, -0.20779289376611512, 0.08505973540556927, 0.10542122165750091, 0.06711746590832869, -0.05446254018073281, -0.07499447119732698, -0.01815419355329747, 0.13083601344376802, 0.042391134714707734, -0.004575382076824705, 0.10489690034960707, -0.13115419863567998, -0.06382671160623431, 0.3742640676287313, -0.038468824353379505, -0.17024159708370765, 0.19103926146092515, -0.22149492078615973, -0.06430921141058206, 0.1538654349092394, 0.12540165955860477, 0.13340309626422822, -0.12815534207969903, 0.11729930860805325, -0.03214364034278939, 0.14053184245402614, 0.10599793705157935, 0.04478063782521834, 0.20193390747532247, 0.1239941783513253, 0.09165622702489297, 0.1700872459169477, -0.09540210731948416, -0.0812997032655403, -0.30343487874604763, -0.15871260035783052, -0.19229818225372583, 0.02498544242233038, -0.06309726923742952, -0.18430490472974875, 0.40526588885113596, 0.10236864339948322, 0.2280222064148014, 0.017979492794256657, 0.24800759106874465, 0.1286922597256489, 0.07083887503327181, 0.045163992289453746, 0.24864988984229663, 0.1372646188767006, 0.12085992056876421, -0.19438267613295465, -0.004808590061341723, 0.04060621668274204] |
1,803.02615 | A Novel Canonical Duality Theory for Solving 3-D Topology Optimization
Problems | This paper demonstrates a mathematically correct and computationally powerful
method for solving 3D topology optimization problems. This method is based on
canonical duality theory (CDT) developed by Gao in nonconvex mechanics and
global optimization. It shows that the so-called NP-hard knapsack problem in
topology optimization can be solved deterministically in polynomial time via a
canonical penalty-duality (CPD) method to obtain precise 0-1 global optimal
solution at each volume evolution. The relation between this CPD method and
Gao's pure complementary energy principle is revealed for the first time. A CPD
algorithm is proposed for 3-D topology optimization of linear elastic
structures. Its novelty is demonstrated by benchmark problems. Results show
that without using any artificial technique, the CPD method can provide
mechanically sound optimal design, also it is much more powerful than the
well-known BESO and SIMP methods. Additionally, computational complexity and
conceptual/mathematical mistakes in topology optimization modeling and popular
methods are explicitly addressed.
| math.OC | this paper demonstrates a mathematically correct and computationally powerful method for solving 3d topology optimization problems this method is based on canonical duality theory cdt developed by gao in nonconvex mechanics and global optimization it shows that the socalled nphard knapsack problem in topology optimization can be solved deterministically in polynomial time via a canonical penaltyduality cpd method to obtain precise 01 global optimal solution at each volume evolution the relation between this cpd method and gaos pure complementary energy principle is revealed for the first time a cpd algorithm is proposed for 3d topology optimization of linear elastic structures its novelty is demonstrated by benchmark problems results show that without using any artificial technique the cpd method can provide mechanically sound optimal design also it is much more powerful than the wellknown beso and simp methods additionally computational complexity and conceptualmathematical mistakes in topology optimization modeling and popular methods are explicitly addressed | [['this', 'paper', 'demonstrates', 'a', 'mathematically', 'correct', 'and', 'computationally', 'powerful', 'method', 'for', 'solving', '3d', 'topology', 'optimization', 'problems', 'this', 'method', 'is', 'based', 'on', 'canonical', 'duality', 'theory', 'cdt', 'developed', 'by', 'gao', 'in', 'nonconvex', 'mechanics', 'and', 'global', 'optimization', 'it', 'shows', 'that', 'the', 'socalled', 'nphard', 'knapsack', 'problem', 'in', 'topology', 'optimization', 'can', 'be', 'solved', 'deterministically', 'in', 'polynomial', 'time', 'via', 'a', 'canonical', 'penaltyduality', 'cpd', 'method', 'to', 'obtain', 'precise', '01', 'global', 'optimal', 'solution', 'at', 'each', 'volume', 'evolution', 'the', 'relation', 'between', 'this', 'cpd', 'method', 'and', 'gaos', 'pure', 'complementary', 'energy', 'principle', 'is', 'revealed', 'for', 'the', 'first', 'time', 'a', 'cpd', 'algorithm', 'is', 'proposed', 'for', '3d', 'topology', 'optimization', 'of', 'linear', 'elastic', 'structures', 'its', 'novelty', 'is', 'demonstrated', 'by', 'benchmark', 'problems', 'results', 'show', 'that', 'without', 'using', 'any', 'artificial', 'technique', 'the', 'cpd', 'method', 'can', 'provide', 'mechanically', 'sound', 'optimal', 'design', 'also', 'it', 'is', 'much', 'more', 'powerful', 'than', 'the', 'wellknown', 'beso', 'and', 'simp', 'methods', 'additionally', 'computational', 'complexity', 'and', 'conceptualmathematical', 'mistakes', 'in', 'topology', 'optimization', 'modeling', 'and', 'popular', 'methods', 'are', 'explicitly', 'addressed']] | [-0.059991711151772174, -0.03277276817856258, -0.1402715533270231, 0.12017889563024878, -0.0972432378483446, -0.1922600611027232, 0.03476731802067278, 0.39276268020100696, -0.32348138021341966, -0.3321402773083384, 0.09475462735128148, -0.18337889140055172, -0.24105807924244896, 0.2172587151014197, -0.07679194880658638, 0.12281340114292873, 0.1041268034789123, -0.042399257937512105, -0.09438597815613703, -0.25929743693804513, 0.23682535760025003, 0.06762430622352679, 0.2946299182474736, 0.03365710820071399, 0.1268655440745581, 0.010027250393728824, -0.005044040548933768, 0.0876224411645365, -0.10365923718554289, 0.12394752759504818, 0.28535703681145125, 0.18079888500812413, 0.28980998901993427, -0.41342145104671973, -0.22133311774508146, 0.09884291734564804, 0.11840062766369604, 0.10208477720152587, -0.052824912053294704, -0.23384634663939083, 0.10700102927340165, -0.09555426747752599, -0.08331928345969093, -0.12390023878603977, 0.0005836869914721893, -0.046700883857020495, -0.2794800870439136, 0.08343512788977885, 0.03934375444384243, 0.027035573148168623, -0.07210475983677163, -0.10261184176871259, 0.026375114156460194, 0.019372957985309, 0.004554233538472449, 0.044393272500632235, 0.0841785938460625, -0.06225865547649415, -0.16515762084447105, 0.38278652966561677, -0.016611682570184808, -0.26361618358886946, 0.1778307127732612, -0.01621908801213354, -0.15854266944102405, 0.16301075734296128, 0.14325844666803422, 0.20187227163114585, -0.1686523015944802, 0.11029515852370471, -0.05013190273970586, 0.16747455295837044, 0.03666502665146254, -0.04444745708736407, 0.14543904862397253, 0.20945061074790397, 0.14148773209155097, 0.14386841277078738, -0.03149113527385788, -0.1221384355112126, -0.2127190549562281, -0.14665233192193372, -0.20264071600180805, 0.007494441031380312, -0.1094720703697117, -0.11128723917614766, 0.3500214232144093, 0.14035234814142122, 0.11886609950421476, 0.07979758955403476, 0.3629048425508173, 0.11464778569949742, 0.018583844795725064, 0.11257011824789898, 0.23563349898904562, 0.13670267841907366, 0.11722136571188457, -0.22870488183903753, 0.06536905921836335, 0.14465526261636497] |
1,803.02616 | Supersingular Hecke modules as Galois representations | Let $F$ be a local field of mixed characteristic, let $k$ be a finite
extension of its residue field, let ${\mathcal H}$ be the pro-$p$-Iwahori Hecke
$k$-algebra attached to ${\rm GL}_{d+1}(F)$ for some $d\ge1$. We construct an
exact and fully faithful functor from the category of supersingular ${\mathcal
H}$-modules to the category of ${\rm Gal}(\overline{F}/F)$-representations over
$k$. More generally, for a certain $k$-algebra ${\mathcal H}^{\sharp}$
surjecting onto ${\mathcal H}$ we define the notion of $\sharp$-supersingular
modules and construct an exact and fully faithful functor from the category of
$\sharp$-supersingular ${\mathcal H}^{\sharp}$-modules to the category of ${\rm
Gal}(\overline{F}/F)$-representations over $k$.
| math.NT math.RT | let f be a local field of mixed characteristic let k be a finite extension of its residue field let mathcal h be the propiwahori hecke kalgebra attached to rm gl_d1f for some dge1 we construct an exact and fully faithful functor from the category of supersingular mathcal hmodules to the category of rm galoverlineffrepresentations over k more generally for a certain kalgebra mathcal hsharp surjecting onto mathcal h we define the notion of sharpsupersingular modules and construct an exact and fully faithful functor from the category of sharpsupersingular mathcal hsharpmodules to the category of rm galoverlineffrepresentations over k | [['let', 'f', 'be', 'a', 'local', 'field', 'of', 'mixed', 'characteristic', 'let', 'k', 'be', 'a', 'finite', 'extension', 'of', 'its', 'residue', 'field', 'let', 'mathcal', 'h', 'be', 'the', 'propiwahori', 'hecke', 'kalgebra', 'attached', 'to', 'rm', 'gl_d1f', 'for', 'some', 'dge1', 'we', 'construct', 'an', 'exact', 'and', 'fully', 'faithful', 'functor', 'from', 'the', 'category', 'of', 'supersingular', 'mathcal', 'hmodules', 'to', 'the', 'category', 'of', 'rm', 'galoverlineffrepresentations', 'over', 'k', 'more', 'generally', 'for', 'a', 'certain', 'kalgebra', 'mathcal', 'hsharp', 'surjecting', 'onto', 'mathcal', 'h', 'we', 'define', 'the', 'notion', 'of', 'sharpsupersingular', 'modules', 'and', 'construct', 'an', 'exact', 'and', 'fully', 'faithful', 'functor', 'from', 'the', 'category', 'of', 'sharpsupersingular', 'mathcal', 'hsharpmodules', 'to', 'the', 'category', 'of', 'rm', 'galoverlineffrepresentations', 'over', 'k']] | [-0.16991203842597635, 0.05853701343249458, -0.0867258580503883, -0.020212263252668002, -0.08687920798803424, -0.17480037091197548, -0.07928263837123638, 0.3405509004471721, -0.4559700529572073, -0.14685677296922103, 0.034440397284924984, -0.2149309369103451, -0.01665660513790099, 0.1926914651131073, -0.16476672835351264, -0.13354946439126303, 0.02855556499172043, 0.21339016508024472, -0.0875182730749577, -0.23050413227507047, 0.4021263089399416, -0.04638329160573718, 0.17972311849583064, -0.0014863602182531095, 0.08567272999661636, -0.014983739760182389, 0.058852645517378066, -0.015922479589909805, -0.22048491721583918, 0.1357589019974182, 0.3663155595557048, 0.0979510768019891, 0.2262298766533834, -0.36681441171606494, -0.06196210747277671, 0.31036985139516027, 0.15559107429542385, -0.06326557506530822, 0.04270750403344749, -0.32382101396477403, 0.20101377694447944, -0.25678289186332254, -0.06689189575039424, -0.0769467473050559, 0.1603250790126417, -0.07356434706393834, -0.3669317299602451, -0.07191386347595644, 0.062132972824786394, 0.18817080835719685, -0.08585475100803056, -0.09427255058947664, -0.16168364561367576, 0.023334892190337835, -0.13389116179730212, 0.1284341672640089, 0.09187233150210027, -0.0936910594956806, -0.062251311409604417, 0.3499984560882325, -0.15119222130953938, -0.18322555606437663, 0.08969427791045426, -0.19456696444815333, -0.07631079656082196, 0.1715734136280614, 0.04946435485444554, 0.2059847411013894, 0.009726721291931776, 0.2875500381137449, -0.18461144483228634, 0.04572041072770135, 0.0027338024535840683, 0.012827607577891795, 0.1347887392775002, 0.04730541817843914, 0.03893749034646284, 0.12330574515291008, 0.020365578895127707, 0.06478336082955638, -0.40369474327007493, -0.20379250212879543, -0.05586334319969455, 0.21133529495161313, -0.08547256794290561, -0.15718188255534069, 0.37540268541856125, 0.12083888721683032, 0.21306276120882542, 0.19056437592339384, 0.1470936262995455, 0.05939967183212003, 0.08175999973644758, 0.05727389080265721, -0.004387709453822226, 0.3247307386699614, -0.12466978305531154, -0.13819645621025792, -0.03946315084205388, 0.21276322450836774] |
1,803.02617 | A BGK model for high temperature rarefied gas flows | High temperature gases, for instance in hypersonic reentry flows, show
complex phenomena like excitation of rotational and vibrational energy modes,
and even chemical reactions. For flows in the continuous regime, simulation
codes use analytic or tabulated constitutive laws for pressure and temperature.
In this paper, we propose a BGK model which is consistent with any arbitrary
constitutive laws, and which is designed to make high temperature gas flow
simulations in the rarefied regime. A Chapman-Enskog analysis gives the
corresponding transport coefficients. Our approach is illustrated by a
numerical comparison with a compressible Navier-Stokes solver with rotational
and vibrational non equilibrium. The BGK approach gives a deterministic solver
with a computational cost which is close to that of a simple monoatomic gas.
| physics.comp-ph physics.class-ph physics.flu-dyn | high temperature gases for instance in hypersonic reentry flows show complex phenomena like excitation of rotational and vibrational energy modes and even chemical reactions for flows in the continuous regime simulation codes use analytic or tabulated constitutive laws for pressure and temperature in this paper we propose a bgk model which is consistent with any arbitrary constitutive laws and which is designed to make high temperature gas flow simulations in the rarefied regime a chapmanenskog analysis gives the corresponding transport coefficients our approach is illustrated by a numerical comparison with a compressible navierstokes solver with rotational and vibrational non equilibrium the bgk approach gives a deterministic solver with a computational cost which is close to that of a simple monoatomic gas | [['high', 'temperature', 'gases', 'for', 'instance', 'in', 'hypersonic', 'reentry', 'flows', 'show', 'complex', 'phenomena', 'like', 'excitation', 'of', 'rotational', 'and', 'vibrational', 'energy', 'modes', 'and', 'even', 'chemical', 'reactions', 'for', 'flows', 'in', 'the', 'continuous', 'regime', 'simulation', 'codes', 'use', 'analytic', 'or', 'tabulated', 'constitutive', 'laws', 'for', 'pressure', 'and', 'temperature', 'in', 'this', 'paper', 'we', 'propose', 'a', 'bgk', 'model', 'which', 'is', 'consistent', 'with', 'any', 'arbitrary', 'constitutive', 'laws', 'and', 'which', 'is', 'designed', 'to', 'make', 'high', 'temperature', 'gas', 'flow', 'simulations', 'in', 'the', 'rarefied', 'regime', 'a', 'chapmanenskog', 'analysis', 'gives', 'the', 'corresponding', 'transport', 'coefficients', 'our', 'approach', 'is', 'illustrated', 'by', 'a', 'numerical', 'comparison', 'with', 'a', 'compressible', 'navierstokes', 'solver', 'with', 'rotational', 'and', 'vibrational', 'non', 'equilibrium', 'the', 'bgk', 'approach', 'gives', 'a', 'deterministic', 'solver', 'with', 'a', 'computational', 'cost', 'which', 'is', 'close', 'to', 'that', 'of', 'a', 'simple', 'monoatomic', 'gas']] | [-0.11473693629853766, 0.13245961545824173, -0.12796915447616503, 0.005512541143631578, -0.03116007555422396, -0.18891812968337215, 0.014885259839352067, 0.31699862794504186, -0.25465440871732786, -0.2607532358489746, 0.06018956590536212, -0.25516565506200284, -0.08736264661593317, 0.20733037677570437, 0.007738245824305726, 0.10845539199326895, 0.06907384573435796, -0.055189673596423516, -0.05844533615331897, -0.1503932115098477, 0.2696236656422627, 0.0885453666815311, 0.2644501404051692, 0.04334291493643291, 0.13240566067320625, -0.08877006092268497, 0.013881402128676244, 0.03924245734637495, -0.1733572367400875, 0.055089873077024606, 0.27308851579388926, -0.028669227253306995, 0.24268643534934717, -0.4523988025847915, -0.3044526803207176, 0.030419565835382696, 0.11815331666345501, 0.164949498263434, -0.051404011092333446, -0.18085823655282415, 0.010746106698778112, -0.193911760460493, -0.1662487429826451, -0.14597405855974938, 0.015398062276846368, 0.05296488689674326, -0.3121990199116143, 0.15256786870448813, 0.04205343148801938, 0.10490978393734486, -0.13027091109586403, -0.06772911406607052, -0.029945112520459394, 0.022403486029722166, 0.02566498819226784, 0.005220453478088064, 0.14221343220873497, -0.10749951715981357, -0.04086704500989357, 0.47722291721662213, -0.06460113767226619, -0.22811911364416937, 0.26728729430724646, -0.13109570475726212, -0.08023103881215538, 0.19538286043531147, 0.17316040008767578, 0.09976300646547105, -0.13745308444211798, 0.03842384405655417, -0.04450793773674768, 0.1577732106824675, 0.0440346943522411, -0.054482947638612396, 0.17566116541346982, 0.18977061485917854, 0.028025344668883706, 0.13102606820204288, -0.049402822465212506, -0.11390540437880627, -0.2771226397661631, -0.16990085719692066, -0.17033223607692838, 0.03825768109984419, -0.1014755951727246, -0.17848984397609124, 0.33597508586235036, 0.1245212612812184, 0.13882319063471615, 0.08516440021108898, 0.35364507923810934, 0.16048995009527256, -0.015196571222791248, 0.16565713470451504, 0.20042565084362696, 0.17964997460626927, 0.1467233165167272, -0.27722672659380376, 0.03011949352866177, 0.1020764328081407] |
1,803.02618 | Time-reversal symmetry breaking in superconductors through loop
super-current order | We propose a superconducting instability where microscopic supercurrent loops
form spontaneously within a unit cell at the superconducting transition
temperature with only uniform, onsite and intra-orbital singlet pairing. As a
result of the circulating currents time-reversal symmetry is spontaneously
broken in the superconducting state. Using Ginzburg-Landau theory, we describe
in detail how these currents emerge in a toy model. We discuss the
crystallographic symmetry requirements to realize such a state and show that
they are met by the Re6X (X=Zr, Hf, Ti) family of time-reversal symmetry
breaking, but otherwise seemingly conventional, superconductors. We estimate an
upper bound for the resulting internal fields and find it to be consistent with
recent muon-spin relaxation experiments.
| cond-mat.supr-con | we propose a superconducting instability where microscopic supercurrent loops form spontaneously within a unit cell at the superconducting transition temperature with only uniform onsite and intraorbital singlet pairing as a result of the circulating currents timereversal symmetry is spontaneously broken in the superconducting state using ginzburglandau theory we describe in detail how these currents emerge in a toy model we discuss the crystallographic symmetry requirements to realize such a state and show that they are met by the re6x xzr hf ti family of timereversal symmetry breaking but otherwise seemingly conventional superconductors we estimate an upper bound for the resulting internal fields and find it to be consistent with recent muonspin relaxation experiments | [['we', 'propose', 'a', 'superconducting', 'instability', 'where', 'microscopic', 'supercurrent', 'loops', 'form', 'spontaneously', 'within', 'a', 'unit', 'cell', 'at', 'the', 'superconducting', 'transition', 'temperature', 'with', 'only', 'uniform', 'onsite', 'and', 'intraorbital', 'singlet', 'pairing', 'as', 'a', 'result', 'of', 'the', 'circulating', 'currents', 'timereversal', 'symmetry', 'is', 'spontaneously', 'broken', 'in', 'the', 'superconducting', 'state', 'using', 'ginzburglandau', 'theory', 'we', 'describe', 'in', 'detail', 'how', 'these', 'currents', 'emerge', 'in', 'a', 'toy', 'model', 'we', 'discuss', 'the', 'crystallographic', 'symmetry', 'requirements', 'to', 'realize', 'such', 'a', 'state', 'and', 'show', 'that', 'they', 'are', 'met', 'by', 'the', 're6x', 'xzr', 'hf', 'ti', 'family', 'of', 'timereversal', 'symmetry', 'breaking', 'but', 'otherwise', 'seemingly', 'conventional', 'superconductors', 'we', 'estimate', 'an', 'upper', 'bound', 'for', 'the', 'resulting', 'internal', 'fields', 'and', 'find', 'it', 'to', 'be', 'consistent', 'with', 'recent', 'muonspin', 'relaxation', 'experiments']] | [-0.20959642667315034, 0.2609150781865018, -0.022570566519529427, 0.06966425187524042, -0.06446849551035225, -0.1793596575277791, 0.08773769672656531, 0.3764869240362064, -0.2413389365330139, -0.2701235008446799, 0.03602657702140277, -0.27287626636513906, -0.11787269023989211, 0.09841502650566067, 0.03260755990673455, 0.0041137166294252635, -0.08059081711378115, -0.00913033080619893, -0.12067028388576416, -0.197260174301586, 0.29902149553527124, -0.04516107068879397, 0.35267210989591796, 0.05612071473504849, 0.03691323355867228, -0.048309142810467165, 0.16084916302185906, -0.0029621492722071707, -0.1394548837086274, 0.024249078572860787, 0.23559567365737166, -0.024943916534539312, 0.12969248656216742, -0.5266498708265966, -0.2163870644373154, 0.05746708461291356, 0.12923165979113296, 0.18304070987090068, -0.09262762736761943, -0.3066107468787647, 0.04346370685379952, -0.19793209442286752, -0.158902278687622, -0.1536830597241143, -0.048552632493998056, -0.058574444123743366, -0.2625918342798416, 0.10296432264606535, 0.08195934735808155, 0.10646362552584573, -0.05803634150028562, -0.05613233807837657, -0.09031772767359923, -0.004027972430256861, 0.08685383636059539, 0.058675871712953916, 0.12173554091194612, -0.1275705402575633, -0.12017272476389605, 0.34921054561345954, -0.023205723139523928, -0.14714854647172615, 0.13990532031831598, -0.13822108321307627, -0.14148895148537122, 0.09973160078802071, 0.09938676462375692, 0.056909403805288354, -0.1299998509431524, 0.0890361238504868, -0.05038361803079689, 0.1590588251648504, 0.02170231289138818, 0.0574980756230486, 0.23541601757252856, 0.18111028528697456, 0.0705923763494606, 0.13542284435970942, -0.07145052379096992, -0.09811210808610278, -0.3456017710933728, -0.14683120154586504, -0.185786295680113, 0.06600322306413935, 0.006024174652468771, -0.14247678471396544, 0.39475885448337067, 0.1403901439022905, 0.21313700017136789, -0.022693193683932935, 0.22309578422989165, 0.12871550766015258, 0.11495916630623729, 0.06591193507171868, 0.2285184102365747, 0.14516564822718334, 0.07028959497776148, -0.29768868882508415, 0.007512688579611547, 0.0376625123483661] |
1,803.02619 | Active Matter Alters the Growth Dynamics of Coffee Rings | How particles are deposited at the edge of evaporating droplets, i.e. the
{\em coffee ring} effect, plays a crucial role in phenomena as diverse as
thin-film deposition, self-assembly, and biofilm formation. Recently,
microorganisms have been shown to passively exploit and alter these deposition
dynamics to increase their survival chances under harshening conditions. Here,
we show that, as the droplet evaporation rate slows down, bacterial mobility
starts playing a major role in determining the growth dynamics of the edge of
drying droplets. Such motility-induced dynamics can influence several
biophysical phenomena, from the formation of biofilms to the spreading of
pathogens in humid environments and on surfaces subject to periodic drying.
Analogous dynamics in other active matter systems can be exploited for
technological applications in printing, coating, and self-assembly, where the
standard coffee-ring effect is often a nuisance.
| cond-mat.soft | how particles are deposited at the edge of evaporating droplets ie the em coffee ring effect plays a crucial role in phenomena as diverse as thinfilm deposition selfassembly and biofilm formation recently microorganisms have been shown to passively exploit and alter these deposition dynamics to increase their survival chances under harshening conditions here we show that as the droplet evaporation rate slows down bacterial mobility starts playing a major role in determining the growth dynamics of the edge of drying droplets such motilityinduced dynamics can influence several biophysical phenomena from the formation of biofilms to the spreading of pathogens in humid environments and on surfaces subject to periodic drying analogous dynamics in other active matter systems can be exploited for technological applications in printing coating and selfassembly where the standard coffeering effect is often a nuisance | [['how', 'particles', 'are', 'deposited', 'at', 'the', 'edge', 'of', 'evaporating', 'droplets', 'ie', 'the', 'em', 'coffee', 'ring', 'effect', 'plays', 'a', 'crucial', 'role', 'in', 'phenomena', 'as', 'diverse', 'as', 'thinfilm', 'deposition', 'selfassembly', 'and', 'biofilm', 'formation', 'recently', 'microorganisms', 'have', 'been', 'shown', 'to', 'passively', 'exploit', 'and', 'alter', 'these', 'deposition', 'dynamics', 'to', 'increase', 'their', 'survival', 'chances', 'under', 'harshening', 'conditions', 'here', 'we', 'show', 'that', 'as', 'the', 'droplet', 'evaporation', 'rate', 'slows', 'down', 'bacterial', 'mobility', 'starts', 'playing', 'a', 'major', 'role', 'in', 'determining', 'the', 'growth', 'dynamics', 'of', 'the', 'edge', 'of', 'drying', 'droplets', 'such', 'motilityinduced', 'dynamics', 'can', 'influence', 'several', 'biophysical', 'phenomena', 'from', 'the', 'formation', 'of', 'biofilms', 'to', 'the', 'spreading', 'of', 'pathogens', 'in', 'humid', 'environments', 'and', 'on', 'surfaces', 'subject', 'to', 'periodic', 'drying', 'analogous', 'dynamics', 'in', 'other', 'active', 'matter', 'systems', 'can', 'be', 'exploited', 'for', 'technological', 'applications', 'in', 'printing', 'coating', 'and', 'selfassembly', 'where', 'the', 'standard', 'coffeering', 'effect', 'is', 'often', 'a', 'nuisance']] | [-0.08255654827225953, 0.24493827226537246, -0.11341564745676738, 0.02893370405546631, -0.03351227849618428, -0.10961765103318073, -0.01117855624847666, 0.36386788658521796, -0.27605211021447623, -0.31917346382030737, 0.09626583795977274, -0.2538497645131968, -0.22730266322485274, 0.17207859356508212, -0.08373825100198802, 0.05620753103349772, 0.0017158990857111618, -0.0742409191749714, 0.07761945901783528, -0.2256857344397792, 0.246070941299614, 0.08917827846102969, 0.3182109192669116, 0.09521164927002111, 0.07253817505444642, -0.021330176693973718, 0.05768230786823012, 0.007366565401079478, -0.22357255465515966, 0.011129859119170794, 0.24627373909267286, 0.034139230669717545, 0.28358228582612893, -0.5360827818650891, -0.3088576300138677, 0.10403791723289975, 0.21407600767841495, 0.13208700998306827, -0.14496018425216553, -0.22072478008491023, 0.0186436124154608, -0.14139008487540264, -0.14201955438626032, -0.0235208990017849, 0.04593942273684122, 0.054440696874236756, -0.22008599373037685, 0.07200971602427739, 0.059247405447617724, 0.053946486122354316, -0.049885448753074914, -0.05986839717392017, -0.09801456532958482, 0.1708436139928246, 0.05619008179443578, -0.04884590238367242, 0.35168746814511165, -0.18715691597511372, -0.07658879105691556, 0.4124755504368632, -0.03260486055665684, -0.16491500221276914, 0.27073115273551257, -0.13935590271182635, -0.08373612094825754, 0.1840932068794414, 0.24777832242349784, 0.09892533988070985, -0.13632746470954132, -0.012698197280298229, 0.023151270022477816, 0.12307620184728876, 0.14077692361272595, 0.021863262910671807, 0.2716807991766405, 0.29559404081492513, 0.03219417910182124, 0.13095981708374219, -0.06610118029811592, -0.12783279176111575, -0.15490066925132717, -0.17731896432599537, -0.12402369739418781, 0.06887350345237388, -0.06961587133808751, -0.17546630248974973, 0.3368607279258194, 0.13531206833884224, 0.1616306628721456, -0.047214574289197724, 0.2190823300120731, -0.03353848085755965, 0.055573819813973926, -0.010960010290835742, 0.22705584374187446, 0.10343111341094804, 0.12415763194569283, -0.2666255225599916, 0.2001306135310895, 0.006011565864146515] |
1,803.0262 | Mimicking dark matter and dark energy in a mimetic model compatible with
GW170817 | The recent observation of the the gravitational wave event GW170817 and of
its electromagnetic counterpart GRB170817A, from a binary neutron star merger,
has established that the speed of gravitational waves deviates from the speed
of light by less than one part in $10^{15}$. As a consequence, many extensions
of General Relativity are inevitably ruled out. Among these we find the most
relevant sectors of Horndeski gravity. In its original formulation, mimetic
gravity is able to mimic cosmological dark matter, has tensorial perturbations
that travel exactly at the speed of light but has vanishing scalar
perturbations and this fact persists if we combine mimetic with Horndeski
gravity. In this work, we show that implementing the mimetic gravity action
with higher-order terms that break the Horndeski structure yields a
cosmological model that satisfies the constraint on the speed of gravitational
waves and mimics both dark energy and dark matter with a non-vanishing speed of
sound. In this way, we are able to reproduce the $\Lambda$CDM cosmological
model without introducing particle cold dark matter.
| gr-qc astro-ph.CO hep-th | the recent observation of the the gravitational wave event gw170817 and of its electromagnetic counterpart grb170817a from a binary neutron star merger has established that the speed of gravitational waves deviates from the speed of light by less than one part in 1015 as a consequence many extensions of general relativity are inevitably ruled out among these we find the most relevant sectors of horndeski gravity in its original formulation mimetic gravity is able to mimic cosmological dark matter has tensorial perturbations that travel exactly at the speed of light but has vanishing scalar perturbations and this fact persists if we combine mimetic with horndeski gravity in this work we show that implementing the mimetic gravity action with higherorder terms that break the horndeski structure yields a cosmological model that satisfies the constraint on the speed of gravitational waves and mimics both dark energy and dark matter with a nonvanishing speed of sound in this way we are able to reproduce the lambdacdm cosmological model without introducing particle cold dark matter | [['the', 'recent', 'observation', 'of', 'the', 'the', 'gravitational', 'wave', 'event', 'gw170817', 'and', 'of', 'its', 'electromagnetic', 'counterpart', 'grb170817a', 'from', 'a', 'binary', 'neutron', 'star', 'merger', 'has', 'established', 'that', 'the', 'speed', 'of', 'gravitational', 'waves', 'deviates', 'from', 'the', 'speed', 'of', 'light', 'by', 'less', 'than', 'one', 'part', 'in', '1015', 'as', 'a', 'consequence', 'many', 'extensions', 'of', 'general', 'relativity', 'are', 'inevitably', 'ruled', 'out', 'among', 'these', 'we', 'find', 'the', 'most', 'relevant', 'sectors', 'of', 'horndeski', 'gravity', 'in', 'its', 'original', 'formulation', 'mimetic', 'gravity', 'is', 'able', 'to', 'mimic', 'cosmological', 'dark', 'matter', 'has', 'tensorial', 'perturbations', 'that', 'travel', 'exactly', 'at', 'the', 'speed', 'of', 'light', 'but', 'has', 'vanishing', 'scalar', 'perturbations', 'and', 'this', 'fact', 'persists', 'if', 'we', 'combine', 'mimetic', 'with', 'horndeski', 'gravity', 'in', 'this', 'work', 'we', 'show', 'that', 'implementing', 'the', 'mimetic', 'gravity', 'action', 'with', 'higherorder', 'terms', 'that', 'break', 'the', 'horndeski', 'structure', 'yields', 'a', 'cosmological', 'model', 'that', 'satisfies', 'the', 'constraint', 'on', 'the', 'speed', 'of', 'gravitational', 'waves', 'and', 'mimics', 'both', 'dark', 'energy', 'and', 'dark', 'matter', 'with', 'a', 'nonvanishing', 'speed', 'of', 'sound', 'in', 'this', 'way', 'we', 'are', 'able', 'to', 'reproduce', 'the', 'lambdacdm', 'cosmological', 'model', 'without', 'introducing', 'particle', 'cold', 'dark', 'matter']] | [-0.1574999182716513, 0.13885555262759067, -0.1318720110599496, 0.11406472935722542, -0.15972530253623662, -0.11864105125682221, -0.057784803734536754, 0.29203533753344235, -0.2135520632717791, -0.31994261052895184, 0.02877963995778857, -0.27668075236813194, -0.1188655798553645, 0.17174084827219468, -0.012709280835431918, 0.010804297544105708, 0.02567524897963985, 0.07526903188574993, -0.05832190257333742, -0.23611362196426097, 0.32422920022968593, 0.0866162268777122, 0.16521436038116613, 0.0033672602019376224, 0.13007695759150978, -0.048541813474747605, -0.03850009397478306, 0.013909579490921432, -0.13061957742052313, 0.030513110292846698, 0.1750254644064317, 0.15071255052584762, 0.21082527158994294, -0.44238663497462605, -0.3219483809774382, 0.1508446773391609, 0.11121988845498938, 0.17681057894059826, -0.08534444159792726, -0.2946931224742534, 0.05995665931626909, -0.22244527825965868, -0.15287634329761415, -0.03330668420340234, -0.0009760975542244071, -0.030119021401375706, -0.17247678892454132, 0.14404744231441652, 0.0106477328352848, -0.08129847633406623, -0.06810261006194727, -0.04535918829728419, -0.043124283040323626, -0.013036610283589328, 0.15650406369002678, 0.0531718492431686, 0.14429262248875455, -0.18412641110851793, -0.05362783250880934, 0.48277951185509826, -0.17346000299036396, -0.16823041436469388, 0.1808540376069362, -0.18300460848946407, -0.14196017478206005, 0.10103980089096647, 0.12456961735886962, 0.09311305363907625, -0.1175874225765995, 0.1385357211948487, -0.004917658844942973, 0.181407970166629, 0.1486470386391364, 0.061821436301508256, 0.35423902628061016, 0.13791289463828518, 0.04481672261377295, 0.06365415971099511, -0.06583757105226253, -0.07711470116213051, -0.3566656288900549, -0.12737230063798669, -0.1286193039431645, 0.016811515319236685, -0.13823415654088841, -0.14022024506526012, 0.3879527048213266, 0.17514333059760737, 0.08136952282283565, 0.1029065370733975, 0.2898291538943324, 0.07266529986487799, 0.0628771035675346, 0.09603511750676304, 0.38575090681153695, 0.1576084200774826, 0.09830722622900155, -0.23705382290846336, -0.0248023513575188, 0.020924984755223256] |
1,803.02621 | Partition games | We introduce CUT, the class of 2-player partition games. These are NIM type
games, played on a finite number of heaps of beans. The rules are given by a
set of positive integers, which specifies the number of allowed splits a player
can perform on a single heap. In normal play, the player with the last move
wins, and the famous Sprague-Grundy theory provides a solution. We prove that
several rulesets have a periodic or an arithmetic periodic Sprague-Grundy
sequence (i.e. they can be partitioned into a finite number of arithmetic
progressions of the same common difference). This is achieved directly for some
infinite classes of games, and moreover we develop a computational testing
condition, demonstrated to solve a variety of additional games. Similar results
have previously appeared for various classes of games of take-and-break, for
example octal and hexadecimal; see e.g. Winning Ways by Berlekamp, Conway and
Guy (1982). In this context, our contribution consists of a systematic study of
the subclass `break-without-take'.
| math.CO cs.DM | we introduce cut the class of 2player partition games these are nim type games played on a finite number of heaps of beans the rules are given by a set of positive integers which specifies the number of allowed splits a player can perform on a single heap in normal play the player with the last move wins and the famous spraguegrundy theory provides a solution we prove that several rulesets have a periodic or an arithmetic periodic spraguegrundy sequence ie they can be partitioned into a finite number of arithmetic progressions of the same common difference this is achieved directly for some infinite classes of games and moreover we develop a computational testing condition demonstrated to solve a variety of additional games similar results have previously appeared for various classes of games of takeandbreak for example octal and hexadecimal see eg winning ways by berlekamp conway and guy 1982 in this context our contribution consists of a systematic study of the subclass breakwithouttake | [['we', 'introduce', 'cut', 'the', 'class', 'of', '2player', 'partition', 'games', 'these', 'are', 'nim', 'type', 'games', 'played', 'on', 'a', 'finite', 'number', 'of', 'heaps', 'of', 'beans', 'the', 'rules', 'are', 'given', 'by', 'a', 'set', 'of', 'positive', 'integers', 'which', 'specifies', 'the', 'number', 'of', 'allowed', 'splits', 'a', 'player', 'can', 'perform', 'on', 'a', 'single', 'heap', 'in', 'normal', 'play', 'the', 'player', 'with', 'the', 'last', 'move', 'wins', 'and', 'the', 'famous', 'spraguegrundy', 'theory', 'provides', 'a', 'solution', 'we', 'prove', 'that', 'several', 'rulesets', 'have', 'a', 'periodic', 'or', 'an', 'arithmetic', 'periodic', 'spraguegrundy', 'sequence', 'ie', 'they', 'can', 'be', 'partitioned', 'into', 'a', 'finite', 'number', 'of', 'arithmetic', 'progressions', 'of', 'the', 'same', 'common', 'difference', 'this', 'is', 'achieved', 'directly', 'for', 'some', 'infinite', 'classes', 'of', 'games', 'and', 'moreover', 'we', 'develop', 'a', 'computational', 'testing', 'condition', 'demonstrated', 'to', 'solve', 'a', 'variety', 'of', 'additional', 'games', 'similar', 'results', 'have', 'previously', 'appeared', 'for', 'various', 'classes', 'of', 'games', 'of', 'takeandbreak', 'for', 'example', 'octal', 'and', 'hexadecimal', 'see', 'eg', 'winning', 'ways', 'by', 'berlekamp', 'conway', 'and', 'guy', '1982', 'in', 'this', 'context', 'our', 'contribution', 'consists', 'of', 'a', 'systematic', 'study', 'of', 'the', 'subclass', 'breakwithouttake']] | [-0.14658938068034197, 0.10066583608559197, -0.12338333596032756, 0.08529718284262344, -0.06913906019640925, -0.1812286021268386, 0.09124092096577824, 0.34034910549145236, -0.268571237096402, -0.31521257661558966, 0.08108979358102833, -0.2535209571885198, -0.13442181238910345, 0.1508687742293042, -0.13088736135762669, 0.016229185589767395, 0.061132087648190836, 0.07077480811211798, 0.018873352361239354, -0.3197465204327643, 0.3344354603847742, -0.08057721386617625, 0.18392140611166846, 0.02479042844519157, 0.10301298259277425, 0.011003300481487387, -0.02738436178971128, 0.09900623108950202, -0.12775595536345744, 0.09248250130891662, 0.2719318198477044, 0.1503746292660197, 0.3767677816895791, -0.4099123180602436, -0.13691940824185025, 0.15866159174424585, 0.11262988733847404, 0.09868573772873339, -0.05421723734966859, -0.238984411113815, 0.1030440565484668, -0.17829867479618478, -0.09289958256865954, -0.040976164764782164, 0.03212555438096141, 0.051621262180291255, -0.26883715443474093, -0.060687635201719346, 0.1006921280871065, 0.0809578984964317, -0.008924452051158167, -0.17606951619417946, 0.03307278653000263, 0.16113570741992903, -0.02114347906504401, -0.005742842842462576, 0.047736285539468994, -0.11429137934321239, -0.19624304427495112, 0.3742942975821077, -0.021361610300287052, -0.17650466595695893, 0.13689196608201773, -0.06098887827649804, -0.1672804421130108, 0.0996399932400105, 0.1222535978893485, 0.14472375838747134, -0.07785620792182507, 0.08328691538693499, -0.17079228310440495, 0.16233072149348848, 0.15330169581014802, 0.016254582939623497, 0.17513477395254154, 0.12797529677814448, 0.08100607141242995, 0.1882263038998734, -0.004069237231081466, -0.13032870470074776, -0.300787937183531, -0.15482678836826694, -0.12042130281240392, 0.05215745417700856, -0.07227891529184467, -0.2172293064750754, 0.4066448065130339, 0.07369408733031804, 0.13465738205406613, 0.115784930962822, 0.20649560385119217, 0.10272731752406855, 0.05691934470769972, 0.0433225136158275, 0.13750712111118726, 0.10244457312876841, 0.05919696858877109, -0.1684721045707709, 0.08721071130734075, 0.13227230363186265] |
1,803.02622 | 3D Human Pose Estimation in RGBD Images for Robotic Task Learning | We propose an approach to estimate 3D human pose in real world units from a
single RGBD image and show that it exceeds performance of monocular 3D pose
estimation approaches from color as well as pose estimation exclusively from
depth. Our approach builds on robust human keypoint detectors for color images
and incorporates depth for lifting into 3D. We combine the system with our
learning from demonstration framework to instruct a service robot without the
need of markers. Experiments in real world settings demonstrate that our
approach enables a PR2 robot to imitate manipulation actions observed from a
human teacher.
| cs.CV cs.RO | we propose an approach to estimate 3d human pose in real world units from a single rgbd image and show that it exceeds performance of monocular 3d pose estimation approaches from color as well as pose estimation exclusively from depth our approach builds on robust human keypoint detectors for color images and incorporates depth for lifting into 3d we combine the system with our learning from demonstration framework to instruct a service robot without the need of markers experiments in real world settings demonstrate that our approach enables a pr2 robot to imitate manipulation actions observed from a human teacher | [['we', 'propose', 'an', 'approach', 'to', 'estimate', '3d', 'human', 'pose', 'in', 'real', 'world', 'units', 'from', 'a', 'single', 'rgbd', 'image', 'and', 'show', 'that', 'it', 'exceeds', 'performance', 'of', 'monocular', '3d', 'pose', 'estimation', 'approaches', 'from', 'color', 'as', 'well', 'as', 'pose', 'estimation', 'exclusively', 'from', 'depth', 'our', 'approach', 'builds', 'on', 'robust', 'human', 'keypoint', 'detectors', 'for', 'color', 'images', 'and', 'incorporates', 'depth', 'for', 'lifting', 'into', '3d', 'we', 'combine', 'the', 'system', 'with', 'our', 'learning', 'from', 'demonstration', 'framework', 'to', 'instruct', 'a', 'service', 'robot', 'without', 'the', 'need', 'of', 'markers', 'experiments', 'in', 'real', 'world', 'settings', 'demonstrate', 'that', 'our', 'approach', 'enables', 'a', 'pr2', 'robot', 'to', 'imitate', 'manipulation', 'actions', 'observed', 'from', 'a', 'human', 'teacher']] | [0.04002386461943388, -0.020032904494873948, -0.07379493686370552, -0.022690305307041855, -0.09618492503184825, -0.1888426590524614, 0.011347883623093366, 0.4823100000619888, -0.22726965825371737, -0.4100352424941957, 0.032508106605382635, -0.28268287049606444, -0.24166557634307537, 0.2364804352633655, -0.23390327792614699, 0.10553099449723959, 0.18658798004500568, 0.06368420687271283, -0.021661121665965767, -0.1937478778255172, 0.26678053599782287, -0.05211886721663177, 0.322121651917696, 0.004193215672858059, 0.19474885711446405, 0.05046464066952467, -0.010789761354681104, -0.01569629871752113, -0.02642661017438513, 0.19138268184211482, 0.28629088556393983, 0.22812675050925463, 0.2586884324019775, -0.44628325931727886, -0.24162512317299842, 0.01976975637488067, 0.10607675795443355, 0.15511834008619188, -0.059481657213764264, -0.4458791308570653, 0.05707706208107993, -0.16451380860060452, -0.018142443774268033, -0.12923711125738918, -0.036831695650471376, -0.08708710194565356, -0.3310949075594544, 0.007022903531324118, 0.009255953471874818, 0.10934515389613807, -0.11840560908429325, -0.0623109498701524, 0.03706193664576858, 0.2784684362076223, 0.001583992373198271, 0.06444865901488811, 0.21357550363987685, -0.23015830940566956, -0.1692110182112083, 0.39714105329709126, -0.03213578990427777, -0.20851113809272648, 0.2066709889366757, -0.07244430039543659, -0.08829133239109069, 0.08922109192237258, 0.25830094863194974, 0.13374328220263124, -0.11777289792546071, 0.017946997716790064, -0.08616950614377857, 0.21956226204521953, 0.0021529021090827883, -0.06034157196059823, 0.21264308016980066, 0.2472751281224191, 0.08489607349038124, 0.11927843053708784, -0.18497991560725496, -0.05517228979617357, -0.22813324419781567, -0.12437451469479129, -0.21194106146693228, -0.012417938257567585, -0.08346760258049471, -0.14485311910975723, 0.36847562064416706, 0.3158012897055596, 0.2504248716775328, 0.13441575745819137, 0.4340315844118595, -0.025827935583656654, 0.13350824743509293, 0.0270671324711293, 0.16091261587571354, -0.06120199201628566, 0.11435905240941793, -0.17936191111104563, 0.07282031220616773, 0.05698401879519224] |
1,803.02623 | TRLG: Fragile blind quad watermarking for image tamper detection and
recovery by providing compact digests with quality optimized using LWT and GA | In this paper, an efficient fragile blind quad watermarking scheme for image
tamper detection and recovery based on lifting wavelet transform and genetic
algorithm is proposed. TRLG generates four compact digests with super quality
based on lifting wavelet transform and halftoning technique by distinguishing
the types of image blocks. In other words, for each 2*2 non-overlap blocks,
four chances for recovering destroyed blocks are considered. A special
parameter estimation technique based on genetic algorithm is performed to
improve and optimize the quality of digests and watermarked image. Furthermore,
CCS map is used to determine the mapping block for embedding information,
encrypting and confusing the embedded information. In order to improve the
recovery rate, Mirror-aside and Partner-block are proposed. The experiments
that have been conducted to evaluate the performance of TRLG proved the
superiority in terms of quality of the watermarked and recovered image, tamper
localization and security compared with state-of-the-art methods. The results
indicate that the PSNR and SSIM of the watermarked image are about 46 dB and
approximately one, respectively. Also, the mean of PSNR and SSIM of several
recovered images which has been destroyed about 90% is reached to 24 dB and
0.86, respectively.
| cs.CR cs.CV cs.MM | in this paper an efficient fragile blind quad watermarking scheme for image tamper detection and recovery based on lifting wavelet transform and genetic algorithm is proposed trlg generates four compact digests with super quality based on lifting wavelet transform and halftoning technique by distinguishing the types of image blocks in other words for each 22 nonoverlap blocks four chances for recovering destroyed blocks are considered a special parameter estimation technique based on genetic algorithm is performed to improve and optimize the quality of digests and watermarked image furthermore ccs map is used to determine the mapping block for embedding information encrypting and confusing the embedded information in order to improve the recovery rate mirroraside and partnerblock are proposed the experiments that have been conducted to evaluate the performance of trlg proved the superiority in terms of quality of the watermarked and recovered image tamper localization and security compared with stateoftheart methods the results indicate that the psnr and ssim of the watermarked image are about 46 db and approximately one respectively also the mean of psnr and ssim of several recovered images which has been destroyed about 90 is reached to 24 db and 086 respectively | [['in', 'this', 'paper', 'an', 'efficient', 'fragile', 'blind', 'quad', 'watermarking', 'scheme', 'for', 'image', 'tamper', 'detection', 'and', 'recovery', 'based', 'on', 'lifting', 'wavelet', 'transform', 'and', 'genetic', 'algorithm', 'is', 'proposed', 'trlg', 'generates', 'four', 'compact', 'digests', 'with', 'super', 'quality', 'based', 'on', 'lifting', 'wavelet', 'transform', 'and', 'halftoning', 'technique', 'by', 'distinguishing', 'the', 'types', 'of', 'image', 'blocks', 'in', 'other', 'words', 'for', 'each', '22', 'nonoverlap', 'blocks', 'four', 'chances', 'for', 'recovering', 'destroyed', 'blocks', 'are', 'considered', 'a', 'special', 'parameter', 'estimation', 'technique', 'based', 'on', 'genetic', 'algorithm', 'is', 'performed', 'to', 'improve', 'and', 'optimize', 'the', 'quality', 'of', 'digests', 'and', 'watermarked', 'image', 'furthermore', 'ccs', 'map', 'is', 'used', 'to', 'determine', 'the', 'mapping', 'block', 'for', 'embedding', 'information', 'encrypting', 'and', 'confusing', 'the', 'embedded', 'information', 'in', 'order', 'to', 'improve', 'the', 'recovery', 'rate', 'mirroraside', 'and', 'partnerblock', 'are', 'proposed', 'the', 'experiments', 'that', 'have', 'been', 'conducted', 'to', 'evaluate', 'the', 'performance', 'of', 'trlg', 'proved', 'the', 'superiority', 'in', 'terms', 'of', 'quality', 'of', 'the', 'watermarked', 'and', 'recovered', 'image', 'tamper', 'localization', 'and', 'security', 'compared', 'with', 'stateoftheart', 'methods', 'the', 'results', 'indicate', 'that', 'the', 'psnr', 'and', 'ssim', 'of', 'the', 'watermarked', 'image', 'are', 'about', '46', 'db', 'and', 'approximately', 'one', 'respectively', 'also', 'the', 'mean', 'of', 'psnr', 'and', 'ssim', 'of', 'several', 'recovered', 'images', 'which', 'has', 'been', 'destroyed', 'about', '90', 'is', 'reached', 'to', '24', 'db', 'and', '086', 'respectively']] | [-0.07070560367143723, -0.041199760482944235, -0.06326555336272577, 0.05328575602349398, -0.019822156635200372, -0.163746755043879, 0.03502045079039817, 0.4193619899839784, -0.24880016652302098, -0.3261758893180134, 0.18556063669772507, -0.2822795738405451, -0.15869294323541303, 0.22021358621016893, -0.13572497774142298, 0.09677773465955397, 0.05652699755106975, 0.06578588463222938, -0.10205466253197908, -0.329990209856381, 0.2389571797272462, 0.06688848231957915, 0.3647091255649381, 0.018176357469807652, 0.11998552873410517, -0.0008684039185027359, -0.09328222336868446, -0.02806749476197486, -0.05428353342275235, 0.12372530561818469, 0.2701154975123548, 0.19486722386985397, 0.2275146536885586, -0.36232194416030933, -0.18785610474939554, 0.07949689357216509, 0.1606304359617449, 0.040189109474037345, -0.07485606648151588, -0.34902313224301906, 0.18700009793246863, -0.1185285832543741, 0.014373659267827557, -0.09856119361696376, -0.019363942919274752, -0.026495298040875543, -0.29673953528375324, 0.06731386130059036, 0.057391325834032614, 0.05814652960786285, -0.04857068169682558, -0.15060121829931936, 0.010656033206032589, 0.1805833163210385, 0.005712548290224125, 0.0732940186826454, 0.15564792765993238, -0.11626040384328462, -0.11044278968135283, 0.3792041265017663, -0.06548418040680797, -0.19018260510104787, 0.16421692909231447, -0.059535827548340116, -0.10424703887899038, 0.17392316062432656, 0.16208283665279546, 0.08792659402752179, -0.12169780837818205, -0.0045362935907178326, -0.0014731538734243561, 0.22355497406048622, 0.14888969054663903, 0.07115679740733565, 0.10861560767443734, 0.16646219950780505, 0.040123999571126966, 0.16034059846560922, -0.17455072633250288, -0.023530188722361345, -0.17666677557766283, -0.16562928258887646, -0.20139238178186739, -0.04624356706578207, -0.12132151363425692, -0.10181133987741002, 0.41711281715779097, 0.20475707485942016, 0.17591770103778495, 0.05778449344325054, 0.3525747225406424, 0.057697698720100256, 0.09000346098158236, 0.06323524853845204, 0.2051772822693844, 0.09771685807815327, 0.03841157863098488, -0.1723619073879187, 0.05959510091755268, 0.08129393097018085] |
1,803.02624 | Smaller Universes for Uniform Sampling of 0,1-matrices with fixed row
and column sums | An important problem arising in the study of complex networks, for instance
in community detection and motif finding, is the sampling of graphs with fixed
degree sequence. The equivalent problem of generating random 0,1 matrices with
fixed row and column sums is frequently used as a quantitative tool in ecology.
It has however proven very challenging to design sampling algorithms that are
both fast and unbiased.
This article focusses on Markov chain approaches for sampling, where a
close-to-random graph is produced by applying a large number N of small changes
to a given graph. Examples are the switch chain and Curveball chain, which are
both commonly used by practitioners as they are easy to implement and known to
sample unbiased when N is large enough. Within theoretical research, much
effort has gone into proving bounds on N. However, existing theoretical bounds
are impractically large for most applications while experiments suggest that
much fewer steps are needed to obtain a good sample.
The contribution of this article is twofold. Firstly it is a step towards
better understanding of the discrepancy between experimental observations and
theoretically proven bounds. In particular, we argue that while existing Markov
chain algorithms run on the set of all labelled graphs with a given degree
sequence, node labels are unimportant in practice and are usually ignored in
determining experimental bounds. We prove that ignoring node labels corresponds
to projecting a Markov chain onto equivalence classes of isomorphic graphs and
that the resulting projected Markov chain converges to its stationary
distribution at least as fast as the original Markov chain. Often convergence
is much faster, as we show in examples, explaining part of the difference
between theory and experiments...
| math.CO | an important problem arising in the study of complex networks for instance in community detection and motif finding is the sampling of graphs with fixed degree sequence the equivalent problem of generating random 01 matrices with fixed row and column sums is frequently used as a quantitative tool in ecology it has however proven very challenging to design sampling algorithms that are both fast and unbiased this article focusses on markov chain approaches for sampling where a closetorandom graph is produced by applying a large number n of small changes to a given graph examples are the switch chain and curveball chain which are both commonly used by practitioners as they are easy to implement and known to sample unbiased when n is large enough within theoretical research much effort has gone into proving bounds on n however existing theoretical bounds are impractically large for most applications while experiments suggest that much fewer steps are needed to obtain a good sample the contribution of this article is twofold firstly it is a step towards better understanding of the discrepancy between experimental observations and theoretically proven bounds in particular we argue that while existing markov chain algorithms run on the set of all labelled graphs with a given degree sequence node labels are unimportant in practice and are usually ignored in determining experimental bounds we prove that ignoring node labels corresponds to projecting a markov chain onto equivalence classes of isomorphic graphs and that the resulting projected markov chain converges to its stationary distribution at least as fast as the original markov chain often convergence is much faster as we show in examples explaining part of the difference between theory and experiments | [['an', 'important', 'problem', 'arising', 'in', 'the', 'study', 'of', 'complex', 'networks', 'for', 'instance', 'in', 'community', 'detection', 'and', 'motif', 'finding', 'is', 'the', 'sampling', 'of', 'graphs', 'with', 'fixed', 'degree', 'sequence', 'the', 'equivalent', 'problem', 'of', 'generating', 'random', '01', 'matrices', 'with', 'fixed', 'row', 'and', 'column', 'sums', 'is', 'frequently', 'used', 'as', 'a', 'quantitative', 'tool', 'in', 'ecology', 'it', 'has', 'however', 'proven', 'very', 'challenging', 'to', 'design', 'sampling', 'algorithms', 'that', 'are', 'both', 'fast', 'and', 'unbiased', 'this', 'article', 'focusses', 'on', 'markov', 'chain', 'approaches', 'for', 'sampling', 'where', 'a', 'closetorandom', 'graph', 'is', 'produced', 'by', 'applying', 'a', 'large', 'number', 'n', 'of', 'small', 'changes', 'to', 'a', 'given', 'graph', 'examples', 'are', 'the', 'switch', 'chain', 'and', 'curveball', 'chain', 'which', 'are', 'both', 'commonly', 'used', 'by', 'practitioners', 'as', 'they', 'are', 'easy', 'to', 'implement', 'and', 'known', 'to', 'sample', 'unbiased', 'when', 'n', 'is', 'large', 'enough', 'within', 'theoretical', 'research', 'much', 'effort', 'has', 'gone', 'into', 'proving', 'bounds', 'on', 'n', 'however', 'existing', 'theoretical', 'bounds', 'are', 'impractically', 'large', 'for', 'most', 'applications', 'while', 'experiments', 'suggest', 'that', 'much', 'fewer', 'steps', 'are', 'needed', 'to', 'obtain', 'a', 'good', 'sample', 'the', 'contribution', 'of', 'this', 'article', 'is', 'twofold', 'firstly', 'it', 'is', 'a', 'step', 'towards', 'better', 'understanding', 'of', 'the', 'discrepancy', 'between', 'experimental', 'observations', 'and', 'theoretically', 'proven', 'bounds', 'in', 'particular', 'we', 'argue', 'that', 'while', 'existing', 'markov', 'chain', 'algorithms', 'run', 'on', 'the', 'set', 'of', 'all', 'labelled', 'graphs', 'with', 'a', 'given', 'degree', 'sequence', 'node', 'labels', 'are', 'unimportant', 'in', 'practice', 'and', 'are', 'usually', 'ignored', 'in', 'determining', 'experimental', 'bounds', 'we', 'prove', 'that', 'ignoring', 'node', 'labels', 'corresponds', 'to', 'projecting', 'a', 'markov', 'chain', 'onto', 'equivalence', 'classes', 'of', 'isomorphic', 'graphs', 'and', 'that', 'the', 'resulting', 'projected', 'markov', 'chain', 'converges', 'to', 'its', 'stationary', 'distribution', 'at', 'least', 'as', 'fast', 'as', 'the', 'original', 'markov', 'chain', 'often', 'convergence', 'is', 'much', 'faster', 'as', 'we', 'show', 'in', 'examples', 'explaining', 'part', 'of', 'the', 'difference', 'between', 'theory', 'and', 'experiments']] | [-0.07670366587865698, 0.11322637474560386, -0.023992529158879602, 0.09753661894085651, -0.08188594356345545, -0.15897810523331699, 0.049412890050942744, 0.43614126914846046, -0.26723674554751986, -0.3263620685852532, 0.1486116726138529, -0.27457315649038977, -0.128609529440707, 0.19981701482320205, -0.05854175587777328, 0.0681786304400053, 0.11578601247756523, 0.04351313789375126, -0.02918239363893268, -0.25179349805132784, 0.2554492627748654, 0.06271089265522148, 0.2722694670906224, 0.013786254172945128, 0.09649267163643215, -0.01846852966617527, -0.034540049701380277, 0.029945458741193372, -0.1091790512501705, 0.12568219984015222, 0.31017449232250716, 0.1505869725428056, 0.29907496504323977, -0.4112045247437761, -0.16348450907888556, 0.1717625192736575, 0.1772708387993459, 0.13544450262852478, -0.02813853655783792, -0.24143441890815406, 0.11571701447807885, -0.12230736895757478, -0.06990099966226677, -0.09174543502075332, 0.026858892501331867, 0.024121159888038944, -0.2818274581397418, 0.007864463003768054, 0.08926356682682776, 0.05928918262112087, 0.043134376531816086, -0.15678104490507394, 0.009223329047173528, 0.13190633298332355, 0.07279409385103333, 0.053892595268553126, 0.08808319279924035, -0.1056248008539634, -0.1156815855356399, 0.36119454796758615, -0.02525125527380234, -0.19827861855987328, 0.20067014186476756, -0.10224851292316868, -0.2012574707507156, 0.12508787557536769, 0.1558045419435075, 0.1409998261619226, -0.1340311848548611, 0.07943706812948222, -0.05611420731875114, 0.1520249113606821, 0.030235097740244653, 0.01003314325602592, 0.16141272401936085, 0.18177310639771999, 0.12562618839687534, 0.16690648324355217, -0.04342924191233968, -0.1351267696325002, -0.2535229568402948, -0.12374127381314923, -0.24043801474493062, 0.028300537461265256, -0.10111188490612091, -0.17253754153914216, 0.35410671438023983, 0.16995089841545255, 0.21882341918618683, 0.11404381265290015, 0.28023157867137344, 0.09759269241128225, 0.038571951987146996, 0.08917556970575657, 0.15666725785039098, 0.14785323853637758, 0.022353843662754766, -0.14140834655180307, 0.13454079481473724, 0.0688600934088754] |
1,803.02625 | A new Multifractional Process with Random Exponent | A first type of Multifractional Process with Random Exponent (MPRE) was
constructed several years ago in (Ayache, Taqqu, 2005) by replacing in a
wavelet series representation of Fractional Brownian Motion (FBM) the Hurst
parameter by a random variable depending on the time variable. In the present
article, we propose another approach for constructing another type of MPRE. It
consists in substituting to the Hurst parameter, in a stochastic integral
representation of the high-frequency part of FBM, a random variable depending
on the integration variable. The MPRE obtained in this way offers, among other
things, the advantages to have a representation through classical It\^o
integral and to be less difficult to simulate than the first type of MPRE,
previously introduced in (Ayache, Taqqu, 2005). Yet, the study of H\"older
regularity of this new MPRE is a significantly more challenging problem than in
the case of the previous one. Actually, it requires to develop a new
methodology relying on an extensive use of the Haar basis.
| math.PR | a first type of multifractional process with random exponent mpre was constructed several years ago in ayache taqqu 2005 by replacing in a wavelet series representation of fractional brownian motion fbm the hurst parameter by a random variable depending on the time variable in the present article we propose another approach for constructing another type of mpre it consists in substituting to the hurst parameter in a stochastic integral representation of the highfrequency part of fbm a random variable depending on the integration variable the mpre obtained in this way offers among other things the advantages to have a representation through classical ito integral and to be less difficult to simulate than the first type of mpre previously introduced in ayache taqqu 2005 yet the study of holder regularity of this new mpre is a significantly more challenging problem than in the case of the previous one actually it requires to develop a new methodology relying on an extensive use of the haar basis | [['a', 'first', 'type', 'of', 'multifractional', 'process', 'with', 'random', 'exponent', 'mpre', 'was', 'constructed', 'several', 'years', 'ago', 'in', 'ayache', 'taqqu', '2005', 'by', 'replacing', 'in', 'a', 'wavelet', 'series', 'representation', 'of', 'fractional', 'brownian', 'motion', 'fbm', 'the', 'hurst', 'parameter', 'by', 'a', 'random', 'variable', 'depending', 'on', 'the', 'time', 'variable', 'in', 'the', 'present', 'article', 'we', 'propose', 'another', 'approach', 'for', 'constructing', 'another', 'type', 'of', 'mpre', 'it', 'consists', 'in', 'substituting', 'to', 'the', 'hurst', 'parameter', 'in', 'a', 'stochastic', 'integral', 'representation', 'of', 'the', 'highfrequency', 'part', 'of', 'fbm', 'a', 'random', 'variable', 'depending', 'on', 'the', 'integration', 'variable', 'the', 'mpre', 'obtained', 'in', 'this', 'way', 'offers', 'among', 'other', 'things', 'the', 'advantages', 'to', 'have', 'a', 'representation', 'through', 'classical', 'ito', 'integral', 'and', 'to', 'be', 'less', 'difficult', 'to', 'simulate', 'than', 'the', 'first', 'type', 'of', 'mpre', 'previously', 'introduced', 'in', 'ayache', 'taqqu', '2005', 'yet', 'the', 'study', 'of', 'holder', 'regularity', 'of', 'this', 'new', 'mpre', 'is', 'a', 'significantly', 'more', 'challenging', 'problem', 'than', 'in', 'the', 'case', 'of', 'the', 'previous', 'one', 'actually', 'it', 'requires', 'to', 'develop', 'a', 'new', 'methodology', 'relying', 'on', 'an', 'extensive', 'use', 'of', 'the', 'haar', 'basis']] | [-0.06709300044557738, 0.06430249616992446, -0.1211860645917335, 0.015476046437836375, -0.12390259986852648, -0.11482597251313387, 0.06235356321813902, 0.3545943801632015, -0.2653765115296332, -0.25840381482934077, 0.12273527976557068, -0.22710853586223248, -0.17040014696142794, 0.2389862229479704, -0.12335186472188159, 0.054029345631644854, 0.012275464849819133, 0.020630046842398303, -0.03289238103415545, -0.2630941600591319, 0.29008209252184847, 0.030149316301614774, 0.21248737806397514, -0.10832435515050481, 0.11376015470709606, 0.029783616501201943, -0.11810459551208358, -0.01980021743035716, -0.13086219261849028, 0.16171883693228975, 0.1772275316108745, 0.03578007293342635, 0.34770903478535575, -0.3717956434219803, -0.2500059955949305, 0.09953026367328698, 0.12338310491457644, 0.03897625988167597, -0.0035138264900568886, -0.31593344476863333, 0.05057778639900612, -0.17219540636089245, -0.14140108613320057, -0.0590837978106276, 0.09762590805710317, 0.009840691386915108, -0.2786997355884168, 0.11384950606038839, 0.06631240307171715, 0.04989680921993923, -0.04137443274681218, -0.11566027508844144, 0.04357672023030407, 0.05304621468956878, 0.04476878388835225, 0.04260322203570068, 0.06959967855534448, -0.09171207446928659, -0.16170037075559177, 0.3335220953222455, -0.0762167031066494, -0.23988791971989884, 0.1691606143182825, -0.1477747239887987, -0.1781203117244309, 0.1314150584583375, 0.12615420387081075, 0.14540905107903043, -0.19933062829304396, 0.09769333827148885, -0.034656028117041854, 0.1413847649279732, 0.08036156305361812, -0.002265301692049678, 0.07369095143271474, 0.19438468738708917, 0.08524010356703046, 0.1625045992419118, -0.0888310399931492, -0.11315082805231214, -0.26139661222242, -0.20395315085287866, -0.21055599352026858, 0.0699027677821904, -0.11491800361110974, -0.16892753827113022, 0.40337260965990446, 0.17240490244876128, 0.17310739467601952, 0.040960349625249096, 0.22294569151581084, 0.15172816114358195, 0.026499222027047013, 0.05428736123381319, 0.1890630402528431, 0.10934034309338597, 0.14869752935156588, -0.12410722985450554, 0.0843701157548533, 0.13238526741042733] |
1,803.02626 | Inferring health conditions from fMRI-graph data | Automated classification methods for disease diagnosis are currently in the
limelight, especially for imaging data. Classification does not fully meet a
clinician's needs, however: in order to combine the results of multiple tests
and decide on a course of treatment, a clinician needs the likelihood of a
given health condition rather than binary classification yielded by such
methods. We illustrate how likelihoods can be derived step by step from first
principles and approximations, and how they can be assessed and selected,
illustrating our approach using fMRI data from a publicly available data set
containing schizophrenic and healthy control subjects. We start from the basic
assumption of partial exchangeability, and then the notion of sufficient
statistics and the "method of translation" (Edgeworth, 1898) combined with
conjugate priors. This method can be used to construct a likelihood that can be
used to compare different data-reduction algorithms. Despite the
simplifications and possibly unrealistic assumptions used to illustrate the
method, we obtain classification results comparable to previous, more realistic
studies about schizophrenia, whilst yielding likelihoods that can naturally be
combined with the results of other diagnostic tests.
| q-bio.QM q-bio.NC stat.AP | automated classification methods for disease diagnosis are currently in the limelight especially for imaging data classification does not fully meet a clinicians needs however in order to combine the results of multiple tests and decide on a course of treatment a clinician needs the likelihood of a given health condition rather than binary classification yielded by such methods we illustrate how likelihoods can be derived step by step from first principles and approximations and how they can be assessed and selected illustrating our approach using fmri data from a publicly available data set containing schizophrenic and healthy control subjects we start from the basic assumption of partial exchangeability and then the notion of sufficient statistics and the method of translation edgeworth 1898 combined with conjugate priors this method can be used to construct a likelihood that can be used to compare different datareduction algorithms despite the simplifications and possibly unrealistic assumptions used to illustrate the method we obtain classification results comparable to previous more realistic studies about schizophrenia whilst yielding likelihoods that can naturally be combined with the results of other diagnostic tests | [['automated', 'classification', 'methods', 'for', 'disease', 'diagnosis', 'are', 'currently', 'in', 'the', 'limelight', 'especially', 'for', 'imaging', 'data', 'classification', 'does', 'not', 'fully', 'meet', 'a', 'clinicians', 'needs', 'however', 'in', 'order', 'to', 'combine', 'the', 'results', 'of', 'multiple', 'tests', 'and', 'decide', 'on', 'a', 'course', 'of', 'treatment', 'a', 'clinician', 'needs', 'the', 'likelihood', 'of', 'a', 'given', 'health', 'condition', 'rather', 'than', 'binary', 'classification', 'yielded', 'by', 'such', 'methods', 'we', 'illustrate', 'how', 'likelihoods', 'can', 'be', 'derived', 'step', 'by', 'step', 'from', 'first', 'principles', 'and', 'approximations', 'and', 'how', 'they', 'can', 'be', 'assessed', 'and', 'selected', 'illustrating', 'our', 'approach', 'using', 'fmri', 'data', 'from', 'a', 'publicly', 'available', 'data', 'set', 'containing', 'schizophrenic', 'and', 'healthy', 'control', 'subjects', 'we', 'start', 'from', 'the', 'basic', 'assumption', 'of', 'partial', 'exchangeability', 'and', 'then', 'the', 'notion', 'of', 'sufficient', 'statistics', 'and', 'the', 'method', 'of', 'translation', 'edgeworth', '1898', 'combined', 'with', 'conjugate', 'priors', 'this', 'method', 'can', 'be', 'used', 'to', 'construct', 'a', 'likelihood', 'that', 'can', 'be', 'used', 'to', 'compare', 'different', 'datareduction', 'algorithms', 'despite', 'the', 'simplifications', 'and', 'possibly', 'unrealistic', 'assumptions', 'used', 'to', 'illustrate', 'the', 'method', 'we', 'obtain', 'classification', 'results', 'comparable', 'to', 'previous', 'more', 'realistic', 'studies', 'about', 'schizophrenia', 'whilst', 'yielding', 'likelihoods', 'that', 'can', 'naturally', 'be', 'combined', 'with', 'the', 'results', 'of', 'other', 'diagnostic', 'tests']] | [0.00573094072688086, 0.008077160328056643, -0.1283353442743502, 0.10051459790515342, -0.12047693689475905, -0.16476159157038062, 0.06812282633087267, 0.4076131225978355, -0.22291612690390988, -0.3456363654110194, 0.16335527369971362, -0.2552776009790966, -0.13774717463399258, 0.25111562363762674, -0.12226413412388895, 0.07845239123187023, 0.14054342316936885, 0.03803379062176402, -0.07717232574082789, -0.3032221215334339, 0.2806626280910931, 0.0417693661668343, 0.29633861724439947, -0.0006674191471738893, 0.06214122486852944, -0.017947051760643883, -0.08193030603143484, 0.043316252357224666, -0.11217252049594163, 0.1415202458277141, 0.31214523617091683, 0.21829980633939144, 0.3125954321814609, -0.4387618592156853, -0.2036023362771267, 0.1008525836791034, 0.14425833848727448, 0.12669021764924734, -0.0049211137742472075, -0.31575616261390005, 0.09461331071301562, -0.1539377568994491, -0.07785936566390977, -0.15595447959358005, -0.08374070597028797, 0.011651723599188599, -0.33131826925218677, 0.07380718196604828, 0.017514810704020528, 0.08529555741722995, -0.06417724586987635, -0.1240964796765621, -0.013057689914032002, 0.15269832896791358, 0.049501849058506596, 0.015898795609484564, 0.11642657813381994, -0.122140241490392, -0.13776304145964482, 0.36507467831907375, -0.02254487846412154, -0.21272836160169192, 0.2197758694716266, -0.08617923131640084, -0.16725542557379994, 0.10088756843533651, 0.19885848354181793, 0.10931825496337778, -0.19968585676355846, -0.010060596010072635, 0.021483552457683318, 0.18325708534751758, 0.03410909078058486, -0.05307676782068171, 0.1620834350097375, 0.16246470343067101, 0.006119778471403435, 0.0953155769009138, -0.0987473125989381, -0.03665683343446727, -0.2709235240825544, -0.11863233858708018, -0.16145019452062134, 0.009372468261549801, -0.0820486996505127, -0.12257961011771622, 0.3723102115766435, 0.2262968338308398, 0.156810557479904, 0.06636857793824187, 0.3033574223009452, 0.06328234053701938, 0.08685562019732582, 0.036410362693822126, 0.1843996590061897, 0.08850232928261655, 0.03700369790634089, -0.1483136176174924, 0.12102023752589451, 0.003970709891450373] |
1,803.02627 | Inferencing Based on Unsupervised Learning of Disentangled
Representations | Combining Generative Adversarial Networks (GANs) with encoders that learn to
encode data points has shown promising results in learning data representations
in an unsupervised way. We propose a framework that combines an encoder and a
generator to learn disentangled representations which encode meaningful
information about the data distribution without the need for any labels. While
current approaches focus mostly on the generative aspects of GANs, our
framework can be used to perform inference on both real and generated data
points. Experiments on several data sets show that the encoder learns
interpretable, disentangled representations which encode descriptive properties
and can be used to sample images that exhibit specific characteristics.
| cs.CV cs.AI cs.NE | combining generative adversarial networks gans with encoders that learn to encode data points has shown promising results in learning data representations in an unsupervised way we propose a framework that combines an encoder and a generator to learn disentangled representations which encode meaningful information about the data distribution without the need for any labels while current approaches focus mostly on the generative aspects of gans our framework can be used to perform inference on both real and generated data points experiments on several data sets show that the encoder learns interpretable disentangled representations which encode descriptive properties and can be used to sample images that exhibit specific characteristics | [['combining', 'generative', 'adversarial', 'networks', 'gans', 'with', 'encoders', 'that', 'learn', 'to', 'encode', 'data', 'points', 'has', 'shown', 'promising', 'results', 'in', 'learning', 'data', 'representations', 'in', 'an', 'unsupervised', 'way', 'we', 'propose', 'a', 'framework', 'that', 'combines', 'an', 'encoder', 'and', 'a', 'generator', 'to', 'learn', 'disentangled', 'representations', 'which', 'encode', 'meaningful', 'information', 'about', 'the', 'data', 'distribution', 'without', 'the', 'need', 'for', 'any', 'labels', 'while', 'current', 'approaches', 'focus', 'mostly', 'on', 'the', 'generative', 'aspects', 'of', 'gans', 'our', 'framework', 'can', 'be', 'used', 'to', 'perform', 'inference', 'on', 'both', 'real', 'and', 'generated', 'data', 'points', 'experiments', 'on', 'several', 'data', 'sets', 'show', 'that', 'the', 'encoder', 'learns', 'interpretable', 'disentangled', 'representations', 'which', 'encode', 'descriptive', 'properties', 'and', 'can', 'be', 'used', 'to', 'sample', 'images', 'that', 'exhibit', 'specific', 'characteristics']] | [0.01610555984532564, -0.001559174729293402, -0.13821278925536684, 0.12505168956866125, -0.16332497352872183, -0.19709273040536102, -0.00882651646518045, 0.48689641741414863, -0.3048058376751012, -0.3151963223159934, 0.030581256152665312, -0.3080416931684508, -0.1855224535403842, 0.18940175524740308, -0.1394607186903832, 0.0610319335375809, 0.14941325500021102, 0.06456031516427174, -0.06936158252776498, -0.27179742843145505, 0.3458945518704476, 0.013075115137595546, 0.3832314813906258, -0.05650233927493294, 0.19433065923469797, -0.048046395833673025, -0.01273987957931779, -0.036612147456724885, -0.05220128608898786, 0.2077831694062937, 0.36619840365731054, 0.2556383272857164, 0.2612981653742113, -0.4575062611188682, -0.2715454092507975, 0.11329932788524914, 0.12575910537055246, 0.12373359624244687, -0.046304199524456635, -0.3802572687466939, 0.11459996331379646, -0.11681417887168075, 0.07684882030460155, -0.2587166437620504, -0.0835781255510584, -0.04084686074390818, -0.3350856763879872, -0.03585432501966824, 0.10474402885463657, 0.043088926994069306, -0.060198312840872896, -0.08132602043311905, -0.03704633773951274, 0.20311153484335928, 0.015641424934276275, 0.07092155905384398, 0.10865164699498564, -0.1676991812397588, -0.1776882314502641, 0.31625636955895636, -0.050856586606069294, -0.24818366443462395, 0.17767027680464606, -0.02835808252846753, -0.16895686580661545, 0.07848278161879906, 0.2660418438705771, 0.10758267712123969, -0.18081559810390765, -0.0007622437136618559, -0.05950401456276369, 0.20296516248857155, 0.0011446937310716344, 0.035389778299119184, 0.20233973988635828, 0.18839396004289113, -0.0158588161467816, 0.1319094400257907, -0.12421574996982666, -0.05451975423083813, -0.21698610096548995, -0.03698438846212984, -0.2303331337752752, -0.023265860560867522, -0.11423766952726443, -0.112613048460507, 0.399896431102038, 0.26853297956741123, 0.296861481671739, 0.11857328602949295, 0.32431678262892766, 0.02129527454423994, 0.14738980911594504, 0.1491578686033824, 0.11844909846506736, 0.05084645152264447, 0.06920149564717172, -0.10490817232574853, 0.13375345058523602, 0.0024297072323625564] |
1,803.02628 | Exploring out-of-equilibrium quantum magnetism and thermalization in a
spin-3 many-body dipolar lattice system | Understanding quantum thermalization through entanglement build-up in
isolated quantum systems addresses fundamental questions on how unitary
dynamics connects to statistical physics. Here, we study the spin dynamics and
approach towards local thermal equilibrium of a macroscopic ensemble of S = 3
spins prepared in a pure coherent spin state, tilted compared to the magnetic
field, under the effect of magnetic dipole-dipole interactions. The experiment
uses a unit filled array of 104 chromium atoms in a three dimensional optical
lattice, realizing the spin-3 XXZ Heisenberg model. The buildup of quantum
correlation during the dynamics, especially as the angle approaches pi/2, is
supported by comparison with an improved numerical quantum phase-space method
and further confirmed by the observation that our isolated system thermalizes
under its own dynamics, reaching a steady state consistent with the one
extracted from a thermal ensemble with a temperature dictated from the system's
energy. This indicates a scenario of quantum thermalization which is tied to
the growth of entanglement entropy. Although direct experimental measurements
of the Renyi entropy in our macroscopic system are unfeasible, the excellent
agreement with the theory, which can compute this entropy, does indicate
entanglement build-up.
| cond-mat.quant-gas | understanding quantum thermalization through entanglement buildup in isolated quantum systems addresses fundamental questions on how unitary dynamics connects to statistical physics here we study the spin dynamics and approach towards local thermal equilibrium of a macroscopic ensemble of s 3 spins prepared in a pure coherent spin state tilted compared to the magnetic field under the effect of magnetic dipoledipole interactions the experiment uses a unit filled array of 104 chromium atoms in a three dimensional optical lattice realizing the spin3 xxz heisenberg model the buildup of quantum correlation during the dynamics especially as the angle approaches pi2 is supported by comparison with an improved numerical quantum phasespace method and further confirmed by the observation that our isolated system thermalizes under its own dynamics reaching a steady state consistent with the one extracted from a thermal ensemble with a temperature dictated from the systems energy this indicates a scenario of quantum thermalization which is tied to the growth of entanglement entropy although direct experimental measurements of the renyi entropy in our macroscopic system are unfeasible the excellent agreement with the theory which can compute this entropy does indicate entanglement buildup | [['understanding', 'quantum', 'thermalization', 'through', 'entanglement', 'buildup', 'in', 'isolated', 'quantum', 'systems', 'addresses', 'fundamental', 'questions', 'on', 'how', 'unitary', 'dynamics', 'connects', 'to', 'statistical', 'physics', 'here', 'we', 'study', 'the', 'spin', 'dynamics', 'and', 'approach', 'towards', 'local', 'thermal', 'equilibrium', 'of', 'a', 'macroscopic', 'ensemble', 'of', 's', '3', 'spins', 'prepared', 'in', 'a', 'pure', 'coherent', 'spin', 'state', 'tilted', 'compared', 'to', 'the', 'magnetic', 'field', 'under', 'the', 'effect', 'of', 'magnetic', 'dipoledipole', 'interactions', 'the', 'experiment', 'uses', 'a', 'unit', 'filled', 'array', 'of', '104', 'chromium', 'atoms', 'in', 'a', 'three', 'dimensional', 'optical', 'lattice', 'realizing', 'the', 'spin3', 'xxz', 'heisenberg', 'model', 'the', 'buildup', 'of', 'quantum', 'correlation', 'during', 'the', 'dynamics', 'especially', 'as', 'the', 'angle', 'approaches', 'pi2', 'is', 'supported', 'by', 'comparison', 'with', 'an', 'improved', 'numerical', 'quantum', 'phasespace', 'method', 'and', 'further', 'confirmed', 'by', 'the', 'observation', 'that', 'our', 'isolated', 'system', 'thermalizes', 'under', 'its', 'own', 'dynamics', 'reaching', 'a', 'steady', 'state', 'consistent', 'with', 'the', 'one', 'extracted', 'from', 'a', 'thermal', 'ensemble', 'with', 'a', 'temperature', 'dictated', 'from', 'the', 'systems', 'energy', 'this', 'indicates', 'a', 'scenario', 'of', 'quantum', 'thermalization', 'which', 'is', 'tied', 'to', 'the', 'growth', 'of', 'entanglement', 'entropy', 'although', 'direct', 'experimental', 'measurements', 'of', 'the', 'renyi', 'entropy', 'in', 'our', 'macroscopic', 'system', 'are', 'unfeasible', 'the', 'excellent', 'agreement', 'with', 'the', 'theory', 'which', 'can', 'compute', 'this', 'entropy', 'does', 'indicate', 'entanglement', 'buildup']] | [-0.14588019620676182, 0.21424424185633573, -0.10125463440873365, 0.03165017377805749, 0.045813038576345305, -0.1429787074264727, 0.028269870646028337, 0.32543446534117193, -0.24386911148597534, -0.2690726655860137, 0.04207012507525322, -0.3037069218404787, -0.07817919244744669, 0.19433996309158638, 0.033500192298178216, 0.07113179007918868, 0.07417409592798274, 0.04282554364273031, -0.09035072122872072, -0.21354787966702132, 0.28618566030812587, 0.08514557251596432, 0.31344456390208125, 0.04033759224755493, 0.09398009570707616, 0.018437587256898712, 0.046940436250971336, 0.03482736943069061, -0.13358736527048964, 0.09670867943204939, 0.2064328729567167, 0.037046373073673367, 0.2238766999915242, -0.4508036917859786, -0.21990589138708616, 0.06593629365884944, 0.13229669707744554, 0.158768865974669, -0.06032516790958317, -0.28561924631266217, -0.020568454588493823, -0.17397570171589521, -0.16511524952473242, -0.09143465326265678, -0.023000500132452303, -0.05240825555183141, -0.23965490332951672, 0.15151193318796638, 0.06892367482651025, 0.07174407149616041, -0.06621362371569328, -0.03144762641076292, -0.022862672787404767, 0.09372099225323549, -0.007814090111366424, 0.04272933088757686, 0.19357034526520261, -0.12930220565808428, -0.15584653281196217, 0.35931695949188186, -0.07027127186179553, -0.13909361230479064, 0.19309278773205157, -0.1679682950685291, -0.10052764648326526, 0.10472371911286915, 0.10269920943353913, 0.08419708104461039, -0.12897339949972536, 0.056903738988636945, -0.01726162029724372, 0.20391033875241288, -0.0007702734443898264, 0.06743175972243128, 0.29216694561580786, 0.1762933359812259, 0.023291413916740566, 0.18677682036742274, -0.05305923721507976, -0.19385685677591122, -0.2719481907196735, -0.16546028024719195, -0.2402123075235929, 0.13945729593550296, -0.0654278770643654, -0.13041228651755343, 0.3913244125972453, 0.17212258877667697, 0.17594416861569412, -0.010668214213250107, 0.27534141467001877, 0.07570409722270836, 0.02278562515826994, 0.053539038166452786, 0.2620352086856177, 0.19223383634939398, 0.0960485297353252, -0.3350367684064335, 0.027707429243692835, 0.03158521387530001] |
1,803.02629 | The primordial magnetic field in our cosmic backyard | We reconstruct the 3D structure of magnetic fields, which were seeded by
density perturbations during the radiation dominated epoch of the Universe and
later on were evolved by structure formation. To achieve this goal, we rely on
three dimensional initial density fields inferred from the 2M++ galaxy
compilation via the Bayesian $\texttt{BORG}$ algorithm. Using those, we
estimate the magnetogenesis by the so called Harrison mechanism. This effect
produced magnetic fields exploiting the different photon drag on electrons and
ions in vortical motions, which are exited due to second order perturbation
effects in the Early Universe. Subsequently we study the evolution of these
seed fields through the non-linear cosmic structure formation by virtue of a
MHD simulation to obtain a 3D estimate for the structure of this primordial
magnetic field component today. At recombination we obtain a reliable lower
limit on the large scale magnetic field strength around $10^{-23} \mathrm{G}$,
with a power spectrum peaking at about $ 2\, \mathrm{Mpc}^{-1}h$ in comoving
scales. At present we expect this evolved primordial field to have strengthts
above $\approx 10^{-27}\, \mathrm{G}$ and $\approx 10^{-29}\, \mathrm{G}$ in
clusters of galaxies and voids, respectively. We also calculate the
corresponding Faraday rotation measure map and show the magnetic field
morphology and strength for specific objects of the Local Universe.
| astro-ph.CO | we reconstruct the 3d structure of magnetic fields which were seeded by density perturbations during the radiation dominated epoch of the universe and later on were evolved by structure formation to achieve this goal we rely on three dimensional initial density fields inferred from the 2m galaxy compilation via the bayesian textttborg algorithm using those we estimate the magnetogenesis by the so called harrison mechanism this effect produced magnetic fields exploiting the different photon drag on electrons and ions in vortical motions which are exited due to second order perturbation effects in the early universe subsequently we study the evolution of these seed fields through the nonlinear cosmic structure formation by virtue of a mhd simulation to obtain a 3d estimate for the structure of this primordial magnetic field component today at recombination we obtain a reliable lower limit on the large scale magnetic field strength around 1023 mathrmg with a power spectrum peaking at about 2 mathrmmpc1h in comoving scales at present we expect this evolved primordial field to have strengthts above approx 1027 mathrmg and approx 1029 mathrmg in clusters of galaxies and voids respectively we also calculate the corresponding faraday rotation measure map and show the magnetic field morphology and strength for specific objects of the local universe | [['we', 'reconstruct', 'the', '3d', 'structure', 'of', 'magnetic', 'fields', 'which', 'were', 'seeded', 'by', 'density', 'perturbations', 'during', 'the', 'radiation', 'dominated', 'epoch', 'of', 'the', 'universe', 'and', 'later', 'on', 'were', 'evolved', 'by', 'structure', 'formation', 'to', 'achieve', 'this', 'goal', 'we', 'rely', 'on', 'three', 'dimensional', 'initial', 'density', 'fields', 'inferred', 'from', 'the', '2m', 'galaxy', 'compilation', 'via', 'the', 'bayesian', 'textttborg', 'algorithm', 'using', 'those', 'we', 'estimate', 'the', 'magnetogenesis', 'by', 'the', 'so', 'called', 'harrison', 'mechanism', 'this', 'effect', 'produced', 'magnetic', 'fields', 'exploiting', 'the', 'different', 'photon', 'drag', 'on', 'electrons', 'and', 'ions', 'in', 'vortical', 'motions', 'which', 'are', 'exited', 'due', 'to', 'second', 'order', 'perturbation', 'effects', 'in', 'the', 'early', 'universe', 'subsequently', 'we', 'study', 'the', 'evolution', 'of', 'these', 'seed', 'fields', 'through', 'the', 'nonlinear', 'cosmic', 'structure', 'formation', 'by', 'virtue', 'of', 'a', 'mhd', 'simulation', 'to', 'obtain', 'a', '3d', 'estimate', 'for', 'the', 'structure', 'of', 'this', 'primordial', 'magnetic', 'field', 'component', 'today', 'at', 'recombination', 'we', 'obtain', 'a', 'reliable', 'lower', 'limit', 'on', 'the', 'large', 'scale', 'magnetic', 'field', 'strength', 'around', '1023', 'mathrmg', 'with', 'a', 'power', 'spectrum', 'peaking', 'at', 'about', '2', 'mathrmmpc1h', 'in', 'comoving', 'scales', 'at', 'present', 'we', 'expect', 'this', 'evolved', 'primordial', 'field', 'to', 'have', 'strengthts', 'above', 'approx', '1027', 'mathrmg', 'and', 'approx', '1029', 'mathrmg', 'in', 'clusters', 'of', 'galaxies', 'and', 'voids', 'respectively', 'we', 'also', 'calculate', 'the', 'corresponding', 'faraday', 'rotation', 'measure', 'map', 'and', 'show', 'the', 'magnetic', 'field', 'morphology', 'and', 'strength', 'for', 'specific', 'objects', 'of', 'the', 'local', 'universe']] | [-0.10618783081792152, 0.17374206393959377, -0.05865103274789782, 0.08675299926835578, -0.0552246221531487, -0.0029001123083827016, -0.024659734079390407, 0.36993486693469235, -0.22322262308667773, -0.3774914336569894, 0.07420048578597534, -0.22921978076472163, -0.05029074544850468, 0.17445386226665086, 0.054923158938226364, -0.04672603497433906, -0.011246510626873575, 0.014953474796269663, -0.018742375047272965, -0.22969621220881192, 0.34407408848458615, 0.10370176760345483, 0.2415051388066226, -0.012240620036699021, 0.09016933198122737, -0.06619245467635874, -0.03625269379699603, 0.023877105868170753, -0.16561421033447216, 0.07175705275221844, 0.14939433891490458, 0.08462874964998963, 0.22498448748508684, -0.4476990830780079, -0.2121689970618508, 0.07453797981116413, 0.16774266823631478, 0.1297807016828581, -0.07252047270370755, -0.28105422695919585, 0.10522602360847835, -0.1356776131679698, -0.1171535317463657, -0.03508370883691196, 0.0223131980567884, -0.006701136714232584, -0.26813732654577155, 0.13680557730199674, -0.0015471439319998564, 0.06424446573677975, -0.10096544519854853, -0.06262939762718116, -0.03306529857554079, 0.07020390028125033, 0.038511659587339424, 0.0688674876213414, 0.20427657580876257, -0.1538616325039164, -0.04924466686497908, 0.35965132213739426, -0.11153497087574439, -0.06243137567183182, 0.15750855068528416, -0.22187837095966992, -0.15427747855182344, 0.15732443829787932, 0.1954257263837812, 0.12558271876164676, -0.10918181379383896, 0.07146184474044485, 0.03196439897510572, 0.18001631960438458, 0.0894329816779086, 0.009882459196537989, 0.2796486799623101, 0.10644629082861894, 0.027438725462371413, 0.10333854580844323, -0.14303547901867064, -0.009828321662588188, -0.2547949794545555, -0.10250906413868786, -0.16324584693996677, 0.10004328386667811, -0.11521192421969317, -0.13824466313011585, 0.39436674088826223, 0.1744625566988571, 0.2061772159521262, 0.00891314954955865, 0.2864378661615774, 0.08928420500776085, 0.06818454678768131, 0.1313538475501096, 0.3010839023716891, 0.19420198239878608, 0.09964993087263653, -0.22581928687479655, 0.013725762496156117, 0.038753785654709924] |
1,803.0263 | Quantitative analysis of the potential role of basal cell hyperplasia in
the relationship between clonal expansion and radon concentration | Applying the two-stage clonal expansion model to epidemiology of lung cancer
among uranium miners, it has been revealed that radon acts as a promoting agent
facilitating the clonal expansion of already mutated cells. Clonal expansion
rate increases non-linearly by radon concentration showing a plateau above a
given exposure rate. The underlying mechanisms remain unclear. Earlier we
proposed that progenitor cell hyperplasia may be induced upon chronic radon
exposure. The objective of the present study is to test whether the induction
of hyperplasia may provide a quantitative explanation for the plateau in clonal
expansion rate. For this purpose, numerical epithelium models were prepared
with different number of basal cells. Cell nucleus hits were computed by an
own-developed Monte-Carlo code. Surviving fractions were estimated based on the
number of cell nucleus hits. Cell division rate was computed supposing
equilibrium between cell death and cell division. It was also supposed that
clonal expansion rate is proportional to cell division rate, and therefore the
relative increase in cell division rate and clonal expansion rate are the same
functions of exposure rate. While the simulation results highly depend on model
parameters with high uncertainty, a parameter set has been found resulting in a
cell division rate exposure rate relationship corresponding to the plateau in
clonal expansion rate. Due to the high uncertainty of the applied parameters,
however, further studies are required to decide whether the induction of
hyperplasia is responsible for the non-linear increase in clonal expansion rate
or not. Nevertheless the present study exemplifies how computational modelling
can contribute to the integration of observational and experimental radiation
protection research.
| q-bio.TO physics.bio-ph | applying the twostage clonal expansion model to epidemiology of lung cancer among uranium miners it has been revealed that radon acts as a promoting agent facilitating the clonal expansion of already mutated cells clonal expansion rate increases nonlinearly by radon concentration showing a plateau above a given exposure rate the underlying mechanisms remain unclear earlier we proposed that progenitor cell hyperplasia may be induced upon chronic radon exposure the objective of the present study is to test whether the induction of hyperplasia may provide a quantitative explanation for the plateau in clonal expansion rate for this purpose numerical epithelium models were prepared with different number of basal cells cell nucleus hits were computed by an owndeveloped montecarlo code surviving fractions were estimated based on the number of cell nucleus hits cell division rate was computed supposing equilibrium between cell death and cell division it was also supposed that clonal expansion rate is proportional to cell division rate and therefore the relative increase in cell division rate and clonal expansion rate are the same functions of exposure rate while the simulation results highly depend on model parameters with high uncertainty a parameter set has been found resulting in a cell division rate exposure rate relationship corresponding to the plateau in clonal expansion rate due to the high uncertainty of the applied parameters however further studies are required to decide whether the induction of hyperplasia is responsible for the nonlinear increase in clonal expansion rate or not nevertheless the present study exemplifies how computational modelling can contribute to the integration of observational and experimental radiation protection research | [['applying', 'the', 'twostage', 'clonal', 'expansion', 'model', 'to', 'epidemiology', 'of', 'lung', 'cancer', 'among', 'uranium', 'miners', 'it', 'has', 'been', 'revealed', 'that', 'radon', 'acts', 'as', 'a', 'promoting', 'agent', 'facilitating', 'the', 'clonal', 'expansion', 'of', 'already', 'mutated', 'cells', 'clonal', 'expansion', 'rate', 'increases', 'nonlinearly', 'by', 'radon', 'concentration', 'showing', 'a', 'plateau', 'above', 'a', 'given', 'exposure', 'rate', 'the', 'underlying', 'mechanisms', 'remain', 'unclear', 'earlier', 'we', 'proposed', 'that', 'progenitor', 'cell', 'hyperplasia', 'may', 'be', 'induced', 'upon', 'chronic', 'radon', 'exposure', 'the', 'objective', 'of', 'the', 'present', 'study', 'is', 'to', 'test', 'whether', 'the', 'induction', 'of', 'hyperplasia', 'may', 'provide', 'a', 'quantitative', 'explanation', 'for', 'the', 'plateau', 'in', 'clonal', 'expansion', 'rate', 'for', 'this', 'purpose', 'numerical', 'epithelium', 'models', 'were', 'prepared', 'with', 'different', 'number', 'of', 'basal', 'cells', 'cell', 'nucleus', 'hits', 'were', 'computed', 'by', 'an', 'owndeveloped', 'montecarlo', 'code', 'surviving', 'fractions', 'were', 'estimated', 'based', 'on', 'the', 'number', 'of', 'cell', 'nucleus', 'hits', 'cell', 'division', 'rate', 'was', 'computed', 'supposing', 'equilibrium', 'between', 'cell', 'death', 'and', 'cell', 'division', 'it', 'was', 'also', 'supposed', 'that', 'clonal', 'expansion', 'rate', 'is', 'proportional', 'to', 'cell', 'division', 'rate', 'and', 'therefore', 'the', 'relative', 'increase', 'in', 'cell', 'division', 'rate', 'and', 'clonal', 'expansion', 'rate', 'are', 'the', 'same', 'functions', 'of', 'exposure', 'rate', 'while', 'the', 'simulation', 'results', 'highly', 'depend', 'on', 'model', 'parameters', 'with', 'high', 'uncertainty', 'a', 'parameter', 'set', 'has', 'been', 'found', 'resulting', 'in', 'a', 'cell', 'division', 'rate', 'exposure', 'rate', 'relationship', 'corresponding', 'to', 'the', 'plateau', 'in', 'clonal', 'expansion', 'rate', 'due', 'to', 'the', 'high', 'uncertainty', 'of', 'the', 'applied', 'parameters', 'however', 'further', 'studies', 'are', 'required', 'to', 'decide', 'whether', 'the', 'induction', 'of', 'hyperplasia', 'is', 'responsible', 'for', 'the', 'nonlinear', 'increase', 'in', 'clonal', 'expansion', 'rate', 'or', 'not', 'nevertheless', 'the', 'present', 'study', 'exemplifies', 'how', 'computational', 'modelling', 'can', 'contribute', 'to', 'the', 'integration', 'of', 'observational', 'and', 'experimental', 'radiation', 'protection', 'research']] | [-0.08297463607177082, 0.13789338614024568, -0.042477098840401704, 0.054186530494145256, -0.05273397042875524, -0.11742572112636866, 0.12467126880955855, 0.34934649602545315, -0.2630093005639289, -0.23527274581614288, 0.11241840368761173, -0.23698638576597936, -0.14604135223569095, 0.18067637935834654, -0.1015694850992242, -0.0214466275387112, 0.05774471078643039, 0.03522816972172498, 0.044552913149042674, -0.30143854169970535, 0.20915732496051173, 0.1506887044348387, 0.3638279401120874, 0.02302546651464416, 0.11297066587951232, -0.05566351013751983, -0.056767090357783614, -0.007336379393977536, -0.13631992086379108, 0.05297871600575463, 0.25516314605298857, 0.1919580563494905, 0.29585632221124164, -0.45752111406093743, -0.2363539967967275, 0.12186938243173769, 0.1880584208823469, 0.10811018595334397, -0.06450698200338097, -0.1715735888512537, 0.07471422520933574, -0.18012849348738338, -0.12311393244652374, -0.013478764533911917, 0.012787796982923861, 0.04896563563648449, -0.30022471569034015, 0.14913161594416702, -0.01379274640652456, 0.07081169632940808, -0.11474209092116464, -0.1252383046755285, -0.018342593360902163, 0.15358091237563218, 0.09531513483715102, 0.046487360891081735, 0.19953845836712528, -0.09788874705643111, -0.10343734476588327, 0.3337110903874308, -0.022549788317657218, -0.17090819761241702, 0.19722423480936524, -0.19452851133643312, -0.06473687015860571, 0.1804977605784326, 0.15622445503531984, 0.06500821335287059, -0.17967699089962424, 0.005174109467947291, 0.0318369447715778, 0.19936666335155623, 0.13593907061184643, -0.028394092422924146, 0.1778698827075652, 0.20163579220675412, 0.0020415935613334914, 0.12574573782860005, -0.11621235568467951, -0.10746726321733811, -0.23091962560085283, -0.15457444554671051, -0.11675003197072356, 0.038290800180193124, -0.08204698906907155, -0.1585509840638913, 0.36090686402608163, 0.0810073166221352, 0.16164483330436324, 0.024807002906031397, 0.2371250496644555, 0.0899015073753231, 0.10112634912189661, -0.024865893119678014, 0.19354576612760976, 0.10240732705852044, 0.07320501709049991, -0.3159011541508583, 0.18791115816566162, 0.07230198329709696] |
1,803.02631 | Resonance eigenfunction hypothesis for chaotic systems | A hypothesis about the average phase-space distribution of resonance
eigenfunctions in chaotic systems with escape through an opening is proposed.
Eigenfunctions with decay rate $\gamma$ are described by a classical measure
that $(i)$ is conditionally invariant with classical decay rate $\gamma$ and
$(ii)$ is uniformly distributed on sets with the same temporal distance to the
quantum resolved chaotic saddle. This explains the localization of
fast-decaying resonance eigenfunctions classically. It is found to occur in the
phase-space region having the largest distance to the chaotic saddle. We
discuss the dependence on the decay rate $\gamma$ and the semiclassical limit.
The hypothesis is numerically demonstrated for the standard map.
| nlin.CD quant-ph | a hypothesis about the average phasespace distribution of resonance eigenfunctions in chaotic systems with escape through an opening is proposed eigenfunctions with decay rate gamma are described by a classical measure that i is conditionally invariant with classical decay rate gamma and ii is uniformly distributed on sets with the same temporal distance to the quantum resolved chaotic saddle this explains the localization of fastdecaying resonance eigenfunctions classically it is found to occur in the phasespace region having the largest distance to the chaotic saddle we discuss the dependence on the decay rate gamma and the semiclassical limit the hypothesis is numerically demonstrated for the standard map | [['a', 'hypothesis', 'about', 'the', 'average', 'phasespace', 'distribution', 'of', 'resonance', 'eigenfunctions', 'in', 'chaotic', 'systems', 'with', 'escape', 'through', 'an', 'opening', 'is', 'proposed', 'eigenfunctions', 'with', 'decay', 'rate', 'gamma', 'are', 'described', 'by', 'a', 'classical', 'measure', 'that', 'i', 'is', 'conditionally', 'invariant', 'with', 'classical', 'decay', 'rate', 'gamma', 'and', 'ii', 'is', 'uniformly', 'distributed', 'on', 'sets', 'with', 'the', 'same', 'temporal', 'distance', 'to', 'the', 'quantum', 'resolved', 'chaotic', 'saddle', 'this', 'explains', 'the', 'localization', 'of', 'fastdecaying', 'resonance', 'eigenfunctions', 'classically', 'it', 'is', 'found', 'to', 'occur', 'in', 'the', 'phasespace', 'region', 'having', 'the', 'largest', 'distance', 'to', 'the', 'chaotic', 'saddle', 'we', 'discuss', 'the', 'dependence', 'on', 'the', 'decay', 'rate', 'gamma', 'and', 'the', 'semiclassical', 'limit', 'the', 'hypothesis', 'is', 'numerically', 'demonstrated', 'for', 'the', 'standard', 'map']] | [-0.1519421230931984, 0.15121694005469283, -0.11625861931835936, 0.11453757698377856, 0.008760478016789829, -0.13429474586046466, 0.031102542885117858, 0.3311350021650579, -0.3078284573471435, -0.21287789881211994, 0.062841836904898, -0.29111924042455223, -0.08721569040137404, 0.21018626354471562, -0.02024157931750736, 0.10097303053445213, 0.07499633433741178, 0.08990982343729968, -0.04125335352347346, -0.18201837494586395, 0.32163461028907236, 0.08918561957336997, 0.24842267342468846, 0.008575364808055841, 0.05625072168839103, -0.017268296762012712, 0.0058997320185337114, -0.0569665361822487, -0.14433150653430601, 0.08756493001514784, 0.1564477421604445, 0.10576756826871744, 0.2215466601338899, -0.3286721129318543, -0.19135037228186555, 0.13990739820890616, 0.19013214115244903, 0.056558662337886395, -0.02240375586280547, -0.33158446302654865, 0.09484656078514651, -0.08407753894854093, -0.17630026436293342, -0.031334233357109754, 0.05389158432937671, 0.030627230304145367, -0.2592696240955146, 0.1503449152202006, 0.03944558419600547, 0.03676809601607584, -0.024675858085191696, -0.044190785682229235, -0.004304237002245734, 0.0779674408139191, 0.06744170591679062, 0.013888443662419427, 0.15645382747872272, -0.048801303173145544, -0.1106791489487775, 0.32894007393341756, -0.07500271844703739, -0.2135976354491453, 0.1802623574143258, -0.23321907024691316, -0.06722840047049745, 0.18235199325543908, 0.11396237612466946, 0.10211005085800713, -0.14001266055122435, 0.13209074621517744, -0.011371316588440232, 0.1639622639729772, 0.07419269145945105, 0.034130136478065606, 0.197744572744052, 0.13646307264707078, 0.06853867682985196, 0.10960830894307555, -0.14123315916605572, -0.18771506476033234, -0.32077038873021846, -0.11539201843595812, -0.19989483006664108, 0.07643536545301431, -0.07878366256732207, -0.18353933706078854, 0.38521439851061484, 0.07842999850247473, 0.2512405764651006, 0.07728190063368355, 0.24739068780512175, 0.20625759565454221, 0.03426909890726522, 0.10800577018183664, 0.27379008599504756, 0.1388822896688933, 0.03761811617970745, -0.25318079921808617, 0.03730199239695462, 0.06130517803722227] |
1,803.02632 | Extracting Action Sequences from Texts Based on Deep Reinforcement
Learning | Extracting action sequences from natural language texts is challenging, as it
requires commonsense inferences based on world knowledge. Although there has
been work on extracting action scripts, instructions, navigation actions, etc.,
they require that either the set of candidate actions be provided in advance,
or that action descriptions are restricted to a specific form, e.g.,
description templates. In this paper, we aim to extract action sequences from
texts in free natural language, i.e., without any restricted templates,
provided the candidate set of actions is unknown. We propose to extract action
sequences from texts based on the deep reinforcement learning framework.
Specifically, we view "selecting" or "eliminating" words from texts as
"actions", and the texts associated with actions as "states". We then build
Q-networks to learn the policy of extracting actions and extract plans from the
labeled texts. We demonstrate the effectiveness of our approach on several
datasets with comparison to state-of-the-art approaches, including online
experiments interacting with humans.
| cs.AI cs.CL | extracting action sequences from natural language texts is challenging as it requires commonsense inferences based on world knowledge although there has been work on extracting action scripts instructions navigation actions etc they require that either the set of candidate actions be provided in advance or that action descriptions are restricted to a specific form eg description templates in this paper we aim to extract action sequences from texts in free natural language ie without any restricted templates provided the candidate set of actions is unknown we propose to extract action sequences from texts based on the deep reinforcement learning framework specifically we view selecting or eliminating words from texts as actions and the texts associated with actions as states we then build qnetworks to learn the policy of extracting actions and extract plans from the labeled texts we demonstrate the effectiveness of our approach on several datasets with comparison to stateoftheart approaches including online experiments interacting with humans | [['extracting', 'action', 'sequences', 'from', 'natural', 'language', 'texts', 'is', 'challenging', 'as', 'it', 'requires', 'commonsense', 'inferences', 'based', 'on', 'world', 'knowledge', 'although', 'there', 'has', 'been', 'work', 'on', 'extracting', 'action', 'scripts', 'instructions', 'navigation', 'actions', 'etc', 'they', 'require', 'that', 'either', 'the', 'set', 'of', 'candidate', 'actions', 'be', 'provided', 'in', 'advance', 'or', 'that', 'action', 'descriptions', 'are', 'restricted', 'to', 'a', 'specific', 'form', 'eg', 'description', 'templates', 'in', 'this', 'paper', 'we', 'aim', 'to', 'extract', 'action', 'sequences', 'from', 'texts', 'in', 'free', 'natural', 'language', 'ie', 'without', 'any', 'restricted', 'templates', 'provided', 'the', 'candidate', 'set', 'of', 'actions', 'is', 'unknown', 'we', 'propose', 'to', 'extract', 'action', 'sequences', 'from', 'texts', 'based', 'on', 'the', 'deep', 'reinforcement', 'learning', 'framework', 'specifically', 'we', 'view', 'selecting', 'or', 'eliminating', 'words', 'from', 'texts', 'as', 'actions', 'and', 'the', 'texts', 'associated', 'with', 'actions', 'as', 'states', 'we', 'then', 'build', 'qnetworks', 'to', 'learn', 'the', 'policy', 'of', 'extracting', 'actions', 'and', 'extract', 'plans', 'from', 'the', 'labeled', 'texts', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach', 'on', 'several', 'datasets', 'with', 'comparison', 'to', 'stateoftheart', 'approaches', 'including', 'online', 'experiments', 'interacting', 'with', 'humans']] | [-0.022053957984582345, 0.050433272089149, -0.08131914115525617, 0.07533498551723064, -0.1870316327637934, -0.13271996648274834, 0.07538911285942798, 0.45761109349801193, -0.25385251125509417, -0.3529795776445513, 0.09515905647046416, -0.3296810067258775, -0.17498026834506117, 0.2089718293750075, -0.13150553919796396, 0.023553240728930017, 0.1373815783461603, 0.13523750284486274, -0.026630567923141054, -0.232735246316017, 0.34488623500713206, -0.005736528638097505, 0.2935518239318287, -0.02660691940308183, 0.14504867369792412, -0.005279431548013788, -0.07535224176333227, -0.018565998256097466, -0.05148609223397216, 0.19244102144995529, 0.3403395503004895, 0.2569944177315087, 0.2710502950026642, -0.42814960703253746, -0.19646725718880992, 0.10224048658627781, 0.10193475947560245, 0.1464511091369418, -0.038178914594994506, -0.37582278337117425, 0.08910957886616382, -0.15399556136041692, 0.03116018946365088, -0.1776163928576191, 0.004939215213555513, -0.02349027009280045, -0.2608345361143539, -0.03674890710994354, 0.06797391538732225, 0.11554226057922255, -0.08253021197337539, -0.08923768223251534, 0.04870897149401894, 0.23797322965604312, 0.0794919936452061, 0.06285674684044398, 0.1651879552651574, -0.17700568768578948, -0.17792522885079223, 0.4345648506114, -0.05542251646306507, -0.25295723449509544, 0.23179327814745468, -0.0309475133242675, -0.15799631940531014, 0.0639454361855913, 0.2104706946020663, 0.16694620058096685, -0.18189629090690537, 0.03614559033598244, -0.05051896145826654, 0.20351167096567777, 0.09581306404316256, 0.01709362444220276, 0.21129274325919797, 0.20108156245278455, -0.02549112475583259, 0.1130403343557168, -0.033205544676622845, -0.07718838836490825, -0.2431262012193852, -0.06376979576388397, -0.16964633768141457, 0.03696574621223785, -0.04424614660847855, -0.15595621116508368, 0.3635845985366739, 0.25677619382742384, 0.17498900988905491, 0.11546799853367472, 0.2955391351251474, 0.007455814800916322, 0.11289439834226984, 0.07200262191575728, 0.08260457843683566, -0.015317388135303237, 0.05867143081283032, -0.1275118430265921, 0.0929634748837215, 0.08672736128615334] |
1,803.02633 | Magnetic-field-induced crossover from the inverse Faraday effect to the
optical orientation in EuTe | A time-resolved optical pump-probe technique has been applied for studying
the ultrafast dynamics in the magnetic semiconductor EuTe near the absorption
band gap. We show that application of external magnetic field up to 6 T results
in crossover from the inverse Faraday effect taking place on the femtosecond
time scale to the optical orientation phenomenon with an evolution in the
picosecond time domain. We propose a model which includes both these processes
possessing different spectral and temporal properties. The circularly polarized
optical pumping induces the optical electronic transition $4f^75d^0 \rightarrow
4f^65d^1$ forming the absorption band gap in EuTe. The observed crossover is
related to a strong magnetic-field shift of the band gap in EuTe at low
temperatures. It was found that manipulation of spin states on intrinsic defect
levels takes place on a time scale of 19 ps in the applied magnetic field of 6
T.
| cond-mat.mtrl-sci | a timeresolved optical pumpprobe technique has been applied for studying the ultrafast dynamics in the magnetic semiconductor eute near the absorption band gap we show that application of external magnetic field up to 6 t results in crossover from the inverse faraday effect taking place on the femtosecond time scale to the optical orientation phenomenon with an evolution in the picosecond time domain we propose a model which includes both these processes possessing different spectral and temporal properties the circularly polarized optical pumping induces the optical electronic transition 4f75d0 rightarrow 4f65d1 forming the absorption band gap in eute the observed crossover is related to a strong magneticfield shift of the band gap in eute at low temperatures it was found that manipulation of spin states on intrinsic defect levels takes place on a time scale of 19 ps in the applied magnetic field of 6 t | [['a', 'timeresolved', 'optical', 'pumpprobe', 'technique', 'has', 'been', 'applied', 'for', 'studying', 'the', 'ultrafast', 'dynamics', 'in', 'the', 'magnetic', 'semiconductor', 'eute', 'near', 'the', 'absorption', 'band', 'gap', 'we', 'show', 'that', 'application', 'of', 'external', 'magnetic', 'field', 'up', 'to', '6', 't', 'results', 'in', 'crossover', 'from', 'the', 'inverse', 'faraday', 'effect', 'taking', 'place', 'on', 'the', 'femtosecond', 'time', 'scale', 'to', 'the', 'optical', 'orientation', 'phenomenon', 'with', 'an', 'evolution', 'in', 'the', 'picosecond', 'time', 'domain', 'we', 'propose', 'a', 'model', 'which', 'includes', 'both', 'these', 'processes', 'possessing', 'different', 'spectral', 'and', 'temporal', 'properties', 'the', 'circularly', 'polarized', 'optical', 'pumping', 'induces', 'the', 'optical', 'electronic', 'transition', '4f75d0', 'rightarrow', '4f65d1', 'forming', 'the', 'absorption', 'band', 'gap', 'in', 'eute', 'the', 'observed', 'crossover', 'is', 'related', 'to', 'a', 'strong', 'magneticfield', 'shift', 'of', 'the', 'band', 'gap', 'in', 'eute', 'at', 'low', 'temperatures', 'it', 'was', 'found', 'that', 'manipulation', 'of', 'spin', 'states', 'on', 'intrinsic', 'defect', 'levels', 'takes', 'place', 'on', 'a', 'time', 'scale', 'of', '19', 'ps', 'in', 'the', 'applied', 'magnetic', 'field', 'of', '6', 't']] | [-0.1470864611522605, 0.18143541681810246, -0.06252795857855947, 0.03050530054477147, -0.021233189225313254, -0.09858354491492112, 0.05539396475715977, 0.4932017971813265, -0.30196135026764953, -0.3155468546707804, 0.03974544856626178, -0.2516164851323184, -0.08041848983460416, 0.1944177596128106, 0.07724133693651918, 0.00489856536660227, -0.05162941127329961, -0.02847311245608984, -0.06034945184526603, -0.1258830827735235, 0.27594883283988264, 0.020672621836032096, 0.3218445898770976, 0.09665953258970855, 0.0818403383794551, 0.010017262445116002, 0.06314962485339493, -0.010231506862005012, -0.11372564352788889, 0.042448606498510344, 0.2288853901748856, -0.07336039217221292, 0.22358328382122433, -0.42217319628172034, -0.2266280235441324, 0.030125789614329632, 0.11429544066130701, 0.14827862040692708, -0.07349458331009373, -0.282900173527499, 0.018753970481662288, -0.0889714031945914, -0.09469609784234005, -0.04810491169337183, 0.04540962298536518, -0.02621832112264302, -0.23865255217323364, 0.07636521751475003, 0.06142527395988711, 0.10546285206348532, -0.11345116529264487, -0.0634887117646738, -0.04522143794585847, 0.09268926051057254, 0.009241148605522338, 0.06294151553690124, 0.15542152870006654, -0.11136520499389412, -0.1297206889074813, 0.35334413322723573, -0.12474780300463964, -0.01871208829783831, 0.17326179423253052, -0.23503731264564623, -0.07996961542650954, 0.20582237879474027, 0.1626668185053859, 0.12823582410217366, -0.09173594295377067, 0.0972508867932144, 0.011514074374038804, 0.2205152037139568, 0.07003928140814726, 0.09459573864781608, 0.23005261316656186, 0.21085649599586354, 0.03074968926699108, 0.14273108072585375, -0.19092277466794863, -0.029597662811283953, -0.21461177608903703, -0.10898894544031161, -0.19107359787125866, 0.11200020972076648, -0.047787352600809956, -0.13066882002426106, 0.4442925700018855, 0.14885262657965845, 0.18988193548446158, -0.03982894669914256, 0.2432711215385805, 0.168731355480203, 0.09134272180704607, 0.019055788539036358, 0.2799168968793108, 0.16464430928075066, 0.16384096814565258, -0.3117426982644247, 0.022813299560867664, -0.01725542622928818] |
1,803.02634 | Properties of the chemostat model with aggregated biomass | We revisit the well-known chemostat model, considering that bacteria can be
attached together in aggregates or flocs. We distinguish explicitly free and
attached compartments in the model and give sufficient conditions for
coexistence of these two forms. We then study the case of fast attachment and
detachment and shows how it is related to density-dependent growth functions.
Finally, we give some insights concerning the cases of multi-specific flocs and
different removal rates.
| math.DS q-bio.PE | we revisit the wellknown chemostat model considering that bacteria can be attached together in aggregates or flocs we distinguish explicitly free and attached compartments in the model and give sufficient conditions for coexistence of these two forms we then study the case of fast attachment and detachment and shows how it is related to densitydependent growth functions finally we give some insights concerning the cases of multispecific flocs and different removal rates | [['we', 'revisit', 'the', 'wellknown', 'chemostat', 'model', 'considering', 'that', 'bacteria', 'can', 'be', 'attached', 'together', 'in', 'aggregates', 'or', 'flocs', 'we', 'distinguish', 'explicitly', 'free', 'and', 'attached', 'compartments', 'in', 'the', 'model', 'and', 'give', 'sufficient', 'conditions', 'for', 'coexistence', 'of', 'these', 'two', 'forms', 'we', 'then', 'study', 'the', 'case', 'of', 'fast', 'attachment', 'and', 'detachment', 'and', 'shows', 'how', 'it', 'is', 'related', 'to', 'densitydependent', 'growth', 'functions', 'finally', 'we', 'give', 'some', 'insights', 'concerning', 'the', 'cases', 'of', 'multispecific', 'flocs', 'and', 'different', 'removal', 'rates']] | [-0.09401838223017017, 0.13334349766176876, -0.08480912012139886, 0.09047831872537156, -0.01702436374198698, -0.18384978963508153, 0.03263845785953839, 0.36876236389614114, -0.2816643066586218, -0.24551286515583035, 0.08046609325609891, -0.27774276102984874, -0.21090392573264388, 0.16462320636000327, -0.0688867451406648, -0.04909493311793661, 0.044013483646574994, 0.0087206665505196, 0.020762858390939276, -0.24537406129841233, 0.34508869726158364, 0.012910911642854482, 0.2553588938309063, 0.11544124416114998, 0.08275718398024919, -0.009373063482278565, -0.01489018428821484, 0.019072999776205544, -0.24443493896661225, 0.10046510880281755, 0.1818956342447077, 0.11429075651447958, 0.1940051435138768, -0.5071937462551074, -0.18132262105043506, 0.1094278817419225, 0.1340974344491539, 0.12660793616423305, -0.04793628810537638, -0.19944438005102352, 0.052190903557831764, -0.1768125093076378, -0.14664824958890676, -0.1010282274702905, -0.0032432562750305087, 0.10007720764703446, -0.269310266422239, 0.1083578630940805, 0.07541158599910182, 0.01194554118728134, -0.14707450663119975, -0.08460411334633303, -0.004799018692697438, 0.17091537303369964, 0.06243568458135279, -0.08348165025186896, 0.12815474485322623, -0.12549044281034402, -0.07354003464570269, 0.3425939930471736, -0.03157261936535114, -0.2315817644268694, 0.294782444467427, -0.12842717194851017, -0.13002485164087002, 0.0834579803443081, 0.18410468864923632, 0.08509762542532154, -0.13716285708557133, 0.016320431718937267, -0.0431069311436633, 0.10886440677961833, 0.13298888815383256, -0.03431396293257114, 0.1401970055951199, 0.13545233601520598, 0.04186531037426698, 0.2134833089781033, -0.049268112117818126, -0.11929524640067363, -0.2921317153147907, -0.17443024139838215, -0.06962023498687211, 0.04875823596007073, -0.07489833936343646, -0.13253633814378524, 0.40459812732583933, 0.12221470857563783, 0.23552618237395942, 0.052825262278161, 0.20759051859798566, 0.0701222227792859, 0.03325471194775801, 0.011488777191811045, 0.15752988512845853, 0.1337475582603103, 0.027113667184250876, -0.2001619122292794, 0.09922386348267204, 0.05059602143059314] |
1,803.02635 | Energetic gamma-ray emission from solar flares | Recent advances in the $\gamma$-ray observations of solar flares by the
\textit{Fermi} satellite, demand revisions in the hadronic $\gamma$-ray flux
computation below 1 GeV. In this work we utilize recently updated pion
production cross sections, along with an accurate description of low energy
nuclear interactions. Applying these new interaction descriptions to model the
\textit{Fermi} Large Area Telescope (LAT) solar flare data, we infer the
primary particle spectral parameters. Application of this new cross section
description leads to significantly different spectral parameters compared to
those obtained previously. Furthermore, the inclusion of nuclei in these
calculations leads to a primary spectrum that is generally harder than that
required from proton only considerations. Lastly, the flare data at lower MeV
energies, detected by the \textit{Fermi} Gamma-ray Burst Monitor (GBM), is
demonstrated to provide additional low-energy spectral information.
| astro-ph.HE | recent advances in the gammaray observations of solar flares by the textitfermi satellite demand revisions in the hadronic gammaray flux computation below 1 gev in this work we utilize recently updated pion production cross sections along with an accurate description of low energy nuclear interactions applying these new interaction descriptions to model the textitfermi large area telescope lat solar flare data we infer the primary particle spectral parameters application of this new cross section description leads to significantly different spectral parameters compared to those obtained previously furthermore the inclusion of nuclei in these calculations leads to a primary spectrum that is generally harder than that required from proton only considerations lastly the flare data at lower mev energies detected by the textitfermi gammaray burst monitor gbm is demonstrated to provide additional lowenergy spectral information | [['recent', 'advances', 'in', 'the', 'gammaray', 'observations', 'of', 'solar', 'flares', 'by', 'the', 'textitfermi', 'satellite', 'demand', 'revisions', 'in', 'the', 'hadronic', 'gammaray', 'flux', 'computation', 'below', '1', 'gev', 'in', 'this', 'work', 'we', 'utilize', 'recently', 'updated', 'pion', 'production', 'cross', 'sections', 'along', 'with', 'an', 'accurate', 'description', 'of', 'low', 'energy', 'nuclear', 'interactions', 'applying', 'these', 'new', 'interaction', 'descriptions', 'to', 'model', 'the', 'textitfermi', 'large', 'area', 'telescope', 'lat', 'solar', 'flare', 'data', 'we', 'infer', 'the', 'primary', 'particle', 'spectral', 'parameters', 'application', 'of', 'this', 'new', 'cross', 'section', 'description', 'leads', 'to', 'significantly', 'different', 'spectral', 'parameters', 'compared', 'to', 'those', 'obtained', 'previously', 'furthermore', 'the', 'inclusion', 'of', 'nuclei', 'in', 'these', 'calculations', 'leads', 'to', 'a', 'primary', 'spectrum', 'that', 'is', 'generally', 'harder', 'than', 'that', 'required', 'from', 'proton', 'only', 'considerations', 'lastly', 'the', 'flare', 'data', 'at', 'lower', 'mev', 'energies', 'detected', 'by', 'the', 'textitfermi', 'gammaray', 'burst', 'monitor', 'gbm', 'is', 'demonstrated', 'to', 'provide', 'additional', 'lowenergy', 'spectral', 'information']] | [-0.02337504868002942, 0.1894613650477354, -0.04207357607734973, 0.18660393747876383, -0.10583340293669607, -0.08502463790120682, 0.045106886032927056, 0.4014121530084078, -0.16158884888473177, -0.4162159142598732, -0.025857095129669768, -0.33455085797485573, -0.015590909628697963, 0.2577844854564156, -0.028518888734258476, 0.03617342881191132, 0.14282245646359454, -0.024539345807401088, -0.0645802027820401, -0.19916230328242057, 0.2686774232494297, 0.2087402921030993, 0.23280345901513277, 0.08121768394902126, 0.04411026059629034, -0.022023701850922582, -0.07990882819329055, -0.05926010529719182, -0.14649677763959312, 0.16228487080574702, 0.25872110407981924, 0.09109124014981147, 0.1297556543444742, -0.4076312979433074, -0.2535563735048106, 0.10216864229895786, 0.1313367812866484, 0.014527541333322984, -0.02904623598659606, -0.2827699372524034, 0.028758967177136177, -0.23732840255903664, -0.15404612624169842, -0.02406207810559157, 0.007996920560514416, 0.03165840733633029, -0.20390449921555345, 0.04538252769531543, -0.025238808452971835, 0.05344869720408781, -0.13304093406264628, -0.09768119899889649, -0.008108395562722668, 0.0629039759045717, 0.11602485312388709, 0.06093257601605728, 0.15708121873869269, -0.11319859512845304, -0.11307770183740823, 0.3426957476272512, -0.020548636066478002, -0.021723712118144438, 0.14399934197261707, -0.1849332038910865, -0.2319197704348324, 0.25664508253780766, 0.17202674108209895, 0.04364678954337237, -0.20733401133790055, 0.054248151840483975, 0.01941131406686088, 0.21961644218379714, 0.032611063693705665, 0.04510208177936277, 0.18357519071146067, 0.16290186961709674, 0.05170297750563764, 0.07773015438231515, -0.2368373707173142, -0.03934213371665926, -0.30735736358354787, -0.05601513648738845, -0.1497603701010569, 0.0931494925136386, -0.054411932638387624, -0.08094994186548822, 0.41340681797227086, 0.12876224060501182, 0.23589848572867853, 0.011407905192211715, 0.3389397737111396, 0.09729294397576309, 0.08506427843596286, 0.09442478956293258, 0.3488537466167403, 0.11136051147147569, 0.14399603117472812, -0.17023490312502287, 0.028776553224028546, 0.03546543538208995] |
1,803.02636 | Topological invariants in dissipative extensions of the
Su-Schrieffer-Heeger model | We investigate dissipative extensions of the Su-Schrieffer-Heeger model with
regard to different approaches of modeling dissipation. In doing so, we use two
distinct frameworks to describe the gain and loss of particles, one uses
Lindblad operators within the scope of Lindblad master equations, the other
uses complex potentials as an effective description of dissipation. The
reservoirs are chosen in such a way that the non-Hermitian complex potentials
are $\mathcal{PT}$-symmetric. From the effective theory we extract a state
which has similar properties as the non-equilibrium steady state following from
Lindblad master equations with respect to lattice site occupation. We find
considerable similarities in the spectra of the effective Hamiltonian and the
corresponding Liouvillean. Further, we generalize the concept of the Zak phase
to the dissipative scenario in terms of the Lindblad description and relate it
to the topological phases of the underlying Hermitian Hamiltonian.
| quant-ph | we investigate dissipative extensions of the suschriefferheeger model with regard to different approaches of modeling dissipation in doing so we use two distinct frameworks to describe the gain and loss of particles one uses lindblad operators within the scope of lindblad master equations the other uses complex potentials as an effective description of dissipation the reservoirs are chosen in such a way that the nonhermitian complex potentials are mathcalptsymmetric from the effective theory we extract a state which has similar properties as the nonequilibrium steady state following from lindblad master equations with respect to lattice site occupation we find considerable similarities in the spectra of the effective hamiltonian and the corresponding liouvillean further we generalize the concept of the zak phase to the dissipative scenario in terms of the lindblad description and relate it to the topological phases of the underlying hermitian hamiltonian | [['we', 'investigate', 'dissipative', 'extensions', 'of', 'the', 'suschriefferheeger', 'model', 'with', 'regard', 'to', 'different', 'approaches', 'of', 'modeling', 'dissipation', 'in', 'doing', 'so', 'we', 'use', 'two', 'distinct', 'frameworks', 'to', 'describe', 'the', 'gain', 'and', 'loss', 'of', 'particles', 'one', 'uses', 'lindblad', 'operators', 'within', 'the', 'scope', 'of', 'lindblad', 'master', 'equations', 'the', 'other', 'uses', 'complex', 'potentials', 'as', 'an', 'effective', 'description', 'of', 'dissipation', 'the', 'reservoirs', 'are', 'chosen', 'in', 'such', 'a', 'way', 'that', 'the', 'nonhermitian', 'complex', 'potentials', 'are', 'mathcalptsymmetric', 'from', 'the', 'effective', 'theory', 'we', 'extract', 'a', 'state', 'which', 'has', 'similar', 'properties', 'as', 'the', 'nonequilibrium', 'steady', 'state', 'following', 'from', 'lindblad', 'master', 'equations', 'with', 'respect', 'to', 'lattice', 'site', 'occupation', 'we', 'find', 'considerable', 'similarities', 'in', 'the', 'spectra', 'of', 'the', 'effective', 'hamiltonian', 'and', 'the', 'corresponding', 'liouvillean', 'further', 'we', 'generalize', 'the', 'concept', 'of', 'the', 'zak', 'phase', 'to', 'the', 'dissipative', 'scenario', 'in', 'terms', 'of', 'the', 'lindblad', 'description', 'and', 'relate', 'it', 'to', 'the', 'topological', 'phases', 'of', 'the', 'underlying', 'hermitian', 'hamiltonian']] | [-0.1261979385891317, 0.1124594667373865, -0.10434054598290395, 0.05847188095738004, -0.04605378276160495, -0.12981947882009762, -0.003696946828573994, 0.33020471738508117, -0.2788976404125561, -0.26301259727101656, 0.017148898588819104, -0.3037261144238544, -0.17312935760270778, 0.14904142198986473, -0.027336017168420074, 0.06799551956616082, 0.02977010724623199, 0.04835200548119895, -0.10640101556640144, -0.1694524972650737, 0.34972338623308635, 0.001593862416001258, 0.20148368070384007, 0.015641204109154903, 0.07637970000049556, -0.009210954322577356, 0.03553935658134572, -0.03522375690705189, -0.1524595280125077, 0.09827995466042336, 0.21210267285041354, 0.055906657018809466, 0.2292986044829542, -0.46507246826182713, -0.23003119210243694, 0.07562650820579041, 0.14026318191407391, 0.16610432650578058, 0.009098947315209813, -0.29447506896018255, -0.0048714492964994655, -0.20805849532850765, -0.1817750929223074, -0.11139257709166829, 0.014048540024445035, 0.028948759304366068, -0.2184427110348027, 0.07278230643714778, 0.08640093951310207, 0.022765829346722343, -0.08745252156802746, -0.07267754696882688, -0.04329086676031559, 0.12020372353181556, -0.013897258369089267, -0.023495983866440667, 0.13213558089626315, -0.11620151853169335, -0.11174395494163036, 0.3932542309060797, -0.0930921520933613, -0.2245631553900226, 0.2259685897180433, -0.12088462656172126, -0.10030353051721008, 0.09535458159691595, 0.14278909250592384, 0.08211360898249867, -0.2068006999243598, 0.11404969558238631, -0.009262760860155095, 0.09651584838601676, 0.012571995149828962, 0.07224127733298427, 0.17511890399093916, 0.12887327576225455, 0.05082688872682881, 0.1590302818315592, -0.009134591938081112, -0.20468270287269374, -0.3115863530160664, -0.1335035398719715, -0.1889121757667199, 0.05529722930550888, -0.06581811331689986, -0.15555527040057562, 0.4697563076535097, 0.19061849061057778, 0.20054826459528266, 0.005661279918020266, 0.24865112908940007, 0.17399324610067363, 0.06804442427192743, 0.06544549189104171, 0.22801394093703556, 0.18521622331304985, 0.07871596889335897, -0.2827073416828953, -0.011733449277487564, 0.0678854222976036] |
1,803.02637 | Proof of the absence of local conserved quantities in the XYZ chain with
a magnetic field | We rigorously prove that the spin-1/2 XYZ chain with a magnetic field has no
local conserved quantity. Any nontrivial conserved quantity of this model is
shown to be a sum of operators supported by contiguous sites with at least half
of the entire system. We establish that the absence of local conserved quantity
in concrete models is provable in a rigorous form.
| cond-mat.stat-mech cond-mat.str-el hep-th math-ph math.MP quant-ph | we rigorously prove that the spin12 xyz chain with a magnetic field has no local conserved quantity any nontrivial conserved quantity of this model is shown to be a sum of operators supported by contiguous sites with at least half of the entire system we establish that the absence of local conserved quantity in concrete models is provable in a rigorous form | [['we', 'rigorously', 'prove', 'that', 'the', 'spin12', 'xyz', 'chain', 'with', 'a', 'magnetic', 'field', 'has', 'no', 'local', 'conserved', 'quantity', 'any', 'nontrivial', 'conserved', 'quantity', 'of', 'this', 'model', 'is', 'shown', 'to', 'be', 'a', 'sum', 'of', 'operators', 'supported', 'by', 'contiguous', 'sites', 'with', 'at', 'least', 'half', 'of', 'the', 'entire', 'system', 'we', 'establish', 'that', 'the', 'absence', 'of', 'local', 'conserved', 'quantity', 'in', 'concrete', 'models', 'is', 'provable', 'in', 'a', 'rigorous', 'form']] | [-0.23397011661173536, 0.13365428281887884, -0.040130557045490754, 0.0623491314003214, -0.015595061633165085, -0.11855537601326022, 0.03423193275868412, 0.33158042390019665, -0.24208643127443089, -0.23983447911262873, 0.068039117452328, -0.2985177326331576, -0.10323227193927573, 0.12566164353366702, 0.01696554846280525, 0.01814753577233322, 0.03842689835601636, 0.11809308284277757, -0.05484584193947094, -0.22872127391277783, 0.2933877365318157, 0.001817696746588955, 0.2450295751463742, 0.06518359399671035, 0.1372502179846408, -0.00706579333787123, 0.03718774106668969, 0.05462493846613553, -0.14743282083509257, 0.10065747226091785, 0.19315578886421608, 0.10292481034318166, 0.25024967009742416, -0.42021379089583794, -0.19359542765925009, 0.18088216537369356, 0.15708810906676995, 0.11539458524015161, -0.013008301953725036, -0.22618600675055095, 0.10701338353476697, -0.17392223199919588, -0.18264696279150103, -0.10169779380873567, 0.025010912463204155, 0.0007199851435519034, -0.2882084884162572, 0.13535120152688074, 0.056719167698775566, 0.11635069962170336, -0.07782241763667233, -0.08417884059693484, -0.058102867979135726, 0.11197989784188629, 0.07336480233390184, 0.07746792403650621, 0.08230279193770501, -0.08313384351335586, -0.11521866445940349, 0.310202676502447, -0.08170584495735145, -0.2707162350791717, 0.13732839037754363, -0.18474919335435955, -0.16661905910399172, 0.11072536936450389, 0.057344336010095094, 0.12216930864979664, -0.21696187001502804, 0.12155973852702207, -0.13334103769833042, 0.20025598332886735, -0.01534301930317475, 0.04973283866533048, 0.24586832664546468, 0.11853135688110225, 0.12775661730237545, 0.17894556717158505, 0.02305330097254726, -0.1339800655240974, -0.3588078079084235, -0.2120026832356328, -0.2528511504492452, 0.08520444942217681, -0.0691661371383816, -0.1931386982976091, 0.384873770308801, 0.14611992878500982, 0.17577390643137117, 0.03945812460545811, 0.22815466395789577, 0.16602596063016645, 0.10304052289575338, 0.10397884548611698, 0.21237789148900418, 0.12979846751512658, 0.0441466415331008, -0.16082277083619229, 0.06950239342967829, 0.0976584154751993] |
1,803.02638 | Mode localization phenomenon in microbeams due to surface roughness | This is the first study on the mode localization phenomenon in microbeams due
to surface roughness. A new model for microbeams with rough surfaces is
developed. The natural frequencies and mode shapes of cantilever, simple
supported, and clamped-clamped microbeams are determined depending on the beam
surface roughness. A parametric study is presented demonstrating two prospects:
surface roughness may lead to a zero-frequency mode or a mode localization. As
for the first prospect, it is demonstrated that surface roughness may add more
softness to a specific mode of vibration and reduce its natural frequency
causing a rigid-body mode. As for the second prospect, surface roughness may
inhibit the propagation of vibration energy throughout the beam length leading
to a mode localization. It is revealed that a mode localization is accompanied
with an increase in the natural frequency of the microbeam. It is revealed that
the description of the beam vibration according to one of these two prospects
depends on the beam size, parameters of the surface roughness, and the boundary
conditions.
| physics.app-ph | this is the first study on the mode localization phenomenon in microbeams due to surface roughness a new model for microbeams with rough surfaces is developed the natural frequencies and mode shapes of cantilever simple supported and clampedclamped microbeams are determined depending on the beam surface roughness a parametric study is presented demonstrating two prospects surface roughness may lead to a zerofrequency mode or a mode localization as for the first prospect it is demonstrated that surface roughness may add more softness to a specific mode of vibration and reduce its natural frequency causing a rigidbody mode as for the second prospect surface roughness may inhibit the propagation of vibration energy throughout the beam length leading to a mode localization it is revealed that a mode localization is accompanied with an increase in the natural frequency of the microbeam it is revealed that the description of the beam vibration according to one of these two prospects depends on the beam size parameters of the surface roughness and the boundary conditions | [['this', 'is', 'the', 'first', 'study', 'on', 'the', 'mode', 'localization', 'phenomenon', 'in', 'microbeams', 'due', 'to', 'surface', 'roughness', 'a', 'new', 'model', 'for', 'microbeams', 'with', 'rough', 'surfaces', 'is', 'developed', 'the', 'natural', 'frequencies', 'and', 'mode', 'shapes', 'of', 'cantilever', 'simple', 'supported', 'and', 'clampedclamped', 'microbeams', 'are', 'determined', 'depending', 'on', 'the', 'beam', 'surface', 'roughness', 'a', 'parametric', 'study', 'is', 'presented', 'demonstrating', 'two', 'prospects', 'surface', 'roughness', 'may', 'lead', 'to', 'a', 'zerofrequency', 'mode', 'or', 'a', 'mode', 'localization', 'as', 'for', 'the', 'first', 'prospect', 'it', 'is', 'demonstrated', 'that', 'surface', 'roughness', 'may', 'add', 'more', 'softness', 'to', 'a', 'specific', 'mode', 'of', 'vibration', 'and', 'reduce', 'its', 'natural', 'frequency', 'causing', 'a', 'rigidbody', 'mode', 'as', 'for', 'the', 'second', 'prospect', 'surface', 'roughness', 'may', 'inhibit', 'the', 'propagation', 'of', 'vibration', 'energy', 'throughout', 'the', 'beam', 'length', 'leading', 'to', 'a', 'mode', 'localization', 'it', 'is', 'revealed', 'that', 'a', 'mode', 'localization', 'is', 'accompanied', 'with', 'an', 'increase', 'in', 'the', 'natural', 'frequency', 'of', 'the', 'microbeam', 'it', 'is', 'revealed', 'that', 'the', 'description', 'of', 'the', 'beam', 'vibration', 'according', 'to', 'one', 'of', 'these', 'two', 'prospects', 'depends', 'on', 'the', 'beam', 'size', 'parameters', 'of', 'the', 'surface', 'roughness', 'and', 'the', 'boundary', 'conditions']] | [-0.14221989754245015, 0.19466264819639037, -0.1075147231520318, 0.003933116551214719, -0.07686023008598782, -0.13037480410352786, 0.02634862963493694, 0.3739310409490238, -0.2688880043405601, -0.2705416838583701, 0.0838630847290487, -0.2378673868472962, -0.14619685727965964, 0.26705881475799664, -0.0664573328295613, 0.06061192916891099, 0.047891677940702614, 0.009651856472277466, 0.0019091443254557602, -0.12006783367627684, 0.2922681090079577, 0.10396053143177757, 0.3353465797612444, 0.11080086521585197, 0.05622296943603193, 0.003623988612226265, 0.018631918405127876, -0.0015444750271425994, -0.14750223800686346, 0.0934367946417564, 0.1734738436253632, -0.002499967986060416, 0.24272620256079416, -0.428056664271828, -0.23347139146148144, 0.03330828049767982, 0.11643615132745574, 0.13715844177367056, -0.02775480123827412, -0.2422009024015792, 0.06367598079035387, -0.09641879849026308, -0.1866743319777443, -0.018405496041454812, 0.018164045462275253, -0.0026862888843478525, -0.23665748350048327, 0.06528451667879434, 0.059401354860678754, 0.08103841514710118, -0.05804582270040341, -0.07536762342514361, -0.07139746571671875, 0.08129779173759744, 0.09134940043817658, 0.02226183044121546, 0.18222626407137688, -0.1219446524306584, -0.06278104497092392, 0.3890258678176906, -0.04264160511905656, -0.20570991543910863, 0.21560674446141895, -0.15745713658791774, -0.012100326080861337, 0.18318819461856037, 0.17180936159292126, 0.07271014721482061, -0.11065008338020348, -0.001630235423662645, 0.04981242347686716, 0.22803177206010064, 0.1364794316674199, 0.02078843540888663, 0.21629228691625244, 0.24149634860291638, 0.0900867550086011, 0.1487620691275772, -0.1706439625690965, 0.009684146666789756, -0.28156408189850696, -0.1531083124498015, -0.18056987914777198, -0.006302025277331909, -0.034592686574015874, -0.19862433181089514, 0.44230415571261855, 0.0694419704412747, 0.18200291001292712, 0.00520780458498527, 0.268598640644375, 0.13838529927957366, 0.0715760340256726, -0.010125209470553433, 0.2849068844526568, 0.12556942197672255, 0.04489431080737096, -0.28972158133315934, 0.05325622606255552, 0.015284809563308955] |
1,803.02639 | Garside combinatorics for Thompson's monoid $F^+$ and a hybrid with the
braid monoid $B\_\infty^+$ | On the model of simple braids, defined to be the left divisors of Garside's
elements $\Delta\_n$ in the monoid $B\_\infty^+$ , we investigate simple
elements in Thompson's monoid $F^+$ and in a larger monoid $H^+$ that is a
hybrid of $B\_\infty^+$ and $F^+$ : in both cases, we count how many simple
elements left divide the right lcm of the first n -- 1 atoms, and characterize
their normal forms in terms of forbidden factors. In the case of $H^+$, a
generalized Pascal triangle appears.
| math.GR math.CO | on the model of simple braids defined to be the left divisors of garsides elements delta_n in the monoid b_infty we investigate simple elements in thompsons monoid f and in a larger monoid h that is a hybrid of b_infty and f in both cases we count how many simple elements left divide the right lcm of the first n 1 atoms and characterize their normal forms in terms of forbidden factors in the case of h a generalized pascal triangle appears | [['on', 'the', 'model', 'of', 'simple', 'braids', 'defined', 'to', 'be', 'the', 'left', 'divisors', 'of', 'garsides', 'elements', 'delta_n', 'in', 'the', 'monoid', 'b_infty', 'we', 'investigate', 'simple', 'elements', 'in', 'thompsons', 'monoid', 'f', 'and', 'in', 'a', 'larger', 'monoid', 'h', 'that', 'is', 'a', 'hybrid', 'of', 'b_infty', 'and', 'f', 'in', 'both', 'cases', 'we', 'count', 'how', 'many', 'simple', 'elements', 'left', 'divide', 'the', 'right', 'lcm', 'of', 'the', 'first', 'n', '1', 'atoms', 'and', 'characterize', 'their', 'normal', 'forms', 'in', 'terms', 'of', 'forbidden', 'factors', 'in', 'the', 'case', 'of', 'h', 'a', 'generalized', 'pascal', 'triangle', 'appears']] | [-0.14371303467806884, 0.1449713922650894, 0.0017796513715350047, 0.0423915370416447, -0.041039810078672884, -0.1224592277814248, 0.0314727874398913, 0.3590044172071829, -0.3566596513080252, -0.18396148506960855, 0.043959903283748866, -0.31277116346059414, -0.1314113071932253, 0.15869085055991736, -0.11466904644422778, -0.061833204701542854, 0.0020730708578101747, 0.11924343601028185, -0.10240060373538787, -0.24957962427288294, 0.31418778166947203, -0.058485701096687104, 0.18205260735277723, 0.014559053009512221, 0.04182522594588014, -0.04754399488362052, -0.014553430280080291, -0.011685514867699899, -0.15497927957474575, 0.10142542742101884, 0.2429086232029765, 0.11358954577434172, 0.199018626223977, -0.4042224203259116, -0.06415234989892668, 0.1822586012947396, 0.15493718825178449, -0.054146284487371035, -0.0192523061754977, -0.2329263096240849, 0.09756540351479155, -0.19385391083068965, -0.11928258999818708, -0.015508643004556311, 0.09680656455570787, 0.017832544575468068, -0.28279165614668916, 0.00454474017364768, 0.13865878527257136, 0.08433929038029618, 0.019321298625649568, -0.16103648678286048, -0.008339228188028423, 0.11539624494687858, -0.0472036990345592, -0.0325541297405413, 0.06289941279278648, -0.13047985360878178, -0.09339314265312945, 0.43263086617538116, -0.06622581325028455, -0.21480866008801613, 0.11924393097983628, -0.2055016974009937, -0.14668059580754944, 0.0965881886687584, 0.08324196469038725, 0.17587152479227813, -0.059319475733834066, 0.2029508689749225, -0.17154697203872407, 0.08950337901620603, 0.13970103054648128, -0.03285791703908727, 0.09491510512648015, 0.09512372711309935, 0.04016324490799977, 0.13467912726734607, 0.013011846637421446, 0.008692641998073312, -0.3231370109360574, -0.226232002148541, -0.1328581478389934, 0.06101413853995349, -0.10443045504951265, -0.21451703660053814, 0.4072356236894138, 0.09008313856292062, 0.20845368933841224, 0.052484478551621846, 0.19903688150935056, 0.06682238566672156, 0.0693313775601138, 0.042882830256641635, 0.07250620588864677, 0.20895343744082423, -0.06283622284465265, -0.1788524580869551, 0.011017918439082256, 0.1691657023095503] |
1,803.0264 | Two-zone diffusion of electrons and positrons from Geminga explains the
positron anomaly | The recent HAWC observations of very-high-energy $\gamma$-ray halo around
Geminga and Monogem indicate a very slow diffusion of cosmic rays, which
results in tiny contribution of positrons from these two pulsars to the local
flux. This makes the cosmic positron excess anomaly observed by PAMELA and
AMS-02 even more puzzling. However, from the Boron-to-Carbon ratio data one can
infer that the average diffusion coefficient in the Galaxy should be much
larger. In this work we propose a two-zone diffusion model that the diffusion
is slow only in a small region around the source, outside of which the
propagation is as fast as usual. We find that such a scenario can naturally
explain the positron excess data with parameters even more reasonable than that
in the conventional one-zone diffusion model. The reason is that during the
life time of Geminga ($\sim 300$ kyr) the electrons/positrons have propagated
too far away with a fast diffusion and lead to a low local flux. The slow
diffusion region in the two-zone model helps to confine the electrons/positrons
for a long time and lead to an enhancement of the local flux. So under the
constraint of the HAWC observations, pulsars are still the probable origin of
the cosmic-ray positron excess.
| astro-ph.HE hep-ph | the recent hawc observations of veryhighenergy gammaray halo around geminga and monogem indicate a very slow diffusion of cosmic rays which results in tiny contribution of positrons from these two pulsars to the local flux this makes the cosmic positron excess anomaly observed by pamela and ams02 even more puzzling however from the borontocarbon ratio data one can infer that the average diffusion coefficient in the galaxy should be much larger in this work we propose a twozone diffusion model that the diffusion is slow only in a small region around the source outside of which the propagation is as fast as usual we find that such a scenario can naturally explain the positron excess data with parameters even more reasonable than that in the conventional onezone diffusion model the reason is that during the life time of geminga sim 300 kyr the electronspositrons have propagated too far away with a fast diffusion and lead to a low local flux the slow diffusion region in the twozone model helps to confine the electronspositrons for a long time and lead to an enhancement of the local flux so under the constraint of the hawc observations pulsars are still the probable origin of the cosmicray positron excess | [['the', 'recent', 'hawc', 'observations', 'of', 'veryhighenergy', 'gammaray', 'halo', 'around', 'geminga', 'and', 'monogem', 'indicate', 'a', 'very', 'slow', 'diffusion', 'of', 'cosmic', 'rays', 'which', 'results', 'in', 'tiny', 'contribution', 'of', 'positrons', 'from', 'these', 'two', 'pulsars', 'to', 'the', 'local', 'flux', 'this', 'makes', 'the', 'cosmic', 'positron', 'excess', 'anomaly', 'observed', 'by', 'pamela', 'and', 'ams02', 'even', 'more', 'puzzling', 'however', 'from', 'the', 'borontocarbon', 'ratio', 'data', 'one', 'can', 'infer', 'that', 'the', 'average', 'diffusion', 'coefficient', 'in', 'the', 'galaxy', 'should', 'be', 'much', 'larger', 'in', 'this', 'work', 'we', 'propose', 'a', 'twozone', 'diffusion', 'model', 'that', 'the', 'diffusion', 'is', 'slow', 'only', 'in', 'a', 'small', 'region', 'around', 'the', 'source', 'outside', 'of', 'which', 'the', 'propagation', 'is', 'as', 'fast', 'as', 'usual', 'we', 'find', 'that', 'such', 'a', 'scenario', 'can', 'naturally', 'explain', 'the', 'positron', 'excess', 'data', 'with', 'parameters', 'even', 'more', 'reasonable', 'than', 'that', 'in', 'the', 'conventional', 'onezone', 'diffusion', 'model', 'the', 'reason', 'is', 'that', 'during', 'the', 'life', 'time', 'of', 'geminga', 'sim', '300', 'kyr', 'the', 'electronspositrons', 'have', 'propagated', 'too', 'far', 'away', 'with', 'a', 'fast', 'diffusion', 'and', 'lead', 'to', 'a', 'low', 'local', 'flux', 'the', 'slow', 'diffusion', 'region', 'in', 'the', 'twozone', 'model', 'helps', 'to', 'confine', 'the', 'electronspositrons', 'for', 'a', 'long', 'time', 'and', 'lead', 'to', 'an', 'enhancement', 'of', 'the', 'local', 'flux', 'so', 'under', 'the', 'constraint', 'of', 'the', 'hawc', 'observations', 'pulsars', 'are', 'still', 'the', 'probable', 'origin', 'of', 'the', 'cosmicray', 'positron', 'excess']] | [-0.06303378277026662, 0.19288735483814223, -0.05212038296087441, 0.1582631076884842, -0.10029284996434865, -0.08788101603163452, 0.030841518450164942, 0.385494990657061, -0.27209414283676847, -0.36098114675501497, 0.03537578656701598, -0.2972576633277463, -0.02610703443358766, 0.21473079419626695, -0.021575628339437904, -0.033382218126519925, 0.07897990980276429, -0.003789514253233991, -0.00795601462922627, -0.19722085738009432, 0.21406994554236894, 0.18272148150178355, 0.21368583188982818, 0.05910051632984882, 0.09301469019932172, -0.09375593188877512, -0.01668012458717496, -0.027787534438255358, -0.059632550002531454, 0.07457606713315926, 0.19870105135572574, 0.1062707940389107, 0.1764827574171671, -0.45563956020036483, -0.2964292286736209, 0.14156718139036945, 0.18318530918871304, 0.04598314729405612, -0.05216426855682895, -0.25946156937719844, 0.06119098630620212, -0.19587810978111697, -0.1631522361995516, 0.030223616787300605, 0.0061203519859146785, 0.006505853327831663, -0.22282144791651062, 0.14526453944911227, 0.04761700530241175, -0.009598191082477569, -0.1147612704918152, -0.0800751713945008, 0.029218223150365236, 0.024340915177926057, 0.14870167509255158, 0.04817343492929756, 0.16287850824954192, -0.14536652573861364, -0.06951890103973267, 0.38303302010385004, -0.09615670579589233, -0.08344836303646244, 0.17952479398241494, -0.2384028545903076, -0.15131561858579518, 0.22815131009442777, 0.14552510627886145, 0.0828476178323532, -0.20251597825710366, 0.04527640371802036, -0.0472893031881895, 0.16219471484996242, 0.011481999643374144, 0.0006467193059151901, 0.2540487620161801, 0.16234577898753852, 0.08660188591584744, 0.060607223890199347, -0.24006914414192845, -0.040946116761826884, -0.2775444836333031, -0.11212008055469884, -0.15279601483390007, 0.11153947804577467, -0.09748183835678302, -0.13041056271847593, 0.3762901798322252, 0.1588691046734045, 0.2613915074270264, 0.01860556552504621, 0.306955650675951, 0.08945771806799557, 0.07718691437891344, 0.12936291305302847, 0.32685048684205226, 0.10045215768353423, 0.1485100798149843, -0.20872910302473097, 0.11994300407709599, -0.042368976735487215] |
1,803.02641 | Compensated integrability. Applications to the Vlasov--Poisson equation
and other models in mathematical physics | We extend our analysis of divergence-free positive symmetric tensors (DPT)
begun in a previous paper. On the one hand, we refine the statements and give
more direct proofs. Next, we study the most singular DPTs, and use them to
prove that the determinant is the only quantity that enjoys an improved
integrability. Curiously, these singularities are intimately related to the
Minkowski's Problem for convex bodys with prescribed Gaussian curvature. We
then cover a list of models of mathematical physics that display a
divergence-free symmetric tensor ; the most interesting one is probably that of
nonlinear Maxwell's equations in a relativistic frame. The case of the wave
equation is the occasion to highlight the role of the positivity assumption.
Last, but not least, we show that the Vlasov--Poisson equation for a plasma is
eligible for our theory.
| math.AP math.RT physics.class-ph | we extend our analysis of divergencefree positive symmetric tensors dpt begun in a previous paper on the one hand we refine the statements and give more direct proofs next we study the most singular dpts and use them to prove that the determinant is the only quantity that enjoys an improved integrability curiously these singularities are intimately related to the minkowskis problem for convex bodys with prescribed gaussian curvature we then cover a list of models of mathematical physics that display a divergencefree symmetric tensor the most interesting one is probably that of nonlinear maxwells equations in a relativistic frame the case of the wave equation is the occasion to highlight the role of the positivity assumption last but not least we show that the vlasovpoisson equation for a plasma is eligible for our theory | [['we', 'extend', 'our', 'analysis', 'of', 'divergencefree', 'positive', 'symmetric', 'tensors', 'dpt', 'begun', 'in', 'a', 'previous', 'paper', 'on', 'the', 'one', 'hand', 'we', 'refine', 'the', 'statements', 'and', 'give', 'more', 'direct', 'proofs', 'next', 'we', 'study', 'the', 'most', 'singular', 'dpts', 'and', 'use', 'them', 'to', 'prove', 'that', 'the', 'determinant', 'is', 'the', 'only', 'quantity', 'that', 'enjoys', 'an', 'improved', 'integrability', 'curiously', 'these', 'singularities', 'are', 'intimately', 'related', 'to', 'the', 'minkowskis', 'problem', 'for', 'convex', 'bodys', 'with', 'prescribed', 'gaussian', 'curvature', 'we', 'then', 'cover', 'a', 'list', 'of', 'models', 'of', 'mathematical', 'physics', 'that', 'display', 'a', 'divergencefree', 'symmetric', 'tensor', 'the', 'most', 'interesting', 'one', 'is', 'probably', 'that', 'of', 'nonlinear', 'maxwells', 'equations', 'in', 'a', 'relativistic', 'frame', 'the', 'case', 'of', 'the', 'wave', 'equation', 'is', 'the', 'occasion', 'to', 'highlight', 'the', 'role', 'of', 'the', 'positivity', 'assumption', 'last', 'but', 'not', 'least', 'we', 'show', 'that', 'the', 'vlasovpoisson', 'equation', 'for', 'a', 'plasma', 'is', 'eligible', 'for', 'our', 'theory']] | [-0.13446537776444867, 0.057542911321205016, -0.11830581735810955, 0.077735560996182, -0.14425308614003438, -0.13263214765530493, -0.03598247891705897, 0.3093694086635002, -0.24819838662881888, -0.1969451503276273, 0.1286880545887268, -0.2828841300163832, -0.18865049214412768, 0.1806018940207583, -0.061500984165683836, 0.0296845107011635, 0.06605836135093812, 0.06711073201839571, -0.0958881078167232, -0.270058675420781, 0.3746255951260941, 0.007137434934783313, 0.20347622049351533, 0.08157632328845836, 0.11910763798557499, -0.015547095114986103, -0.029909131951906063, 0.015595983920825852, -0.13524398880625893, 0.1161059823775388, 0.23183346949380293, 0.12514164837560168, 0.28842946604170183, -0.42497740368600245, -0.21006991245300957, 0.09863607583877941, 0.10312747582793236, 0.12470458864268881, -0.03873672409951083, -0.24412083898808945, 0.09159019812510383, -0.12517417972148567, -0.18283613886408231, -0.0750679648205362, 0.016494665005140834, 0.002062098176597997, -0.24618719673922493, 0.08719671301681686, 0.1287504546827188, 0.013213785993004287, -0.09200710220158928, -0.11002109083864424, 0.0011891491021271106, 0.06892691631973893, 0.07484777043573558, 0.03568914665547372, 0.07124658941325766, -0.12917000675504958, -0.08979236201072732, 0.38902771338579, -0.035326116918413725, -0.2432452601880801, 0.1675488303794905, -0.17011661152355373, -0.17805600732185498, 0.10227995792714258, 0.13935234039607974, 0.15821236518936024, -0.11910548686498293, 0.08533950843589587, -0.1057863001503628, 0.14255036104091065, 0.07734682080853317, 0.0025451948279859842, 0.15857208108322488, 0.08240694327762833, 0.10260467194020748, 0.11936833811578927, -0.011720985600388506, -0.11314102577183534, -0.365067501331645, -0.189583966611988, -0.17451614393611198, 0.06852783260271988, -0.08563738141976365, -0.1778230554872641, 0.40295402721536383, 0.17650721679545112, 0.12987016154565262, 0.06096035004765899, 0.26332519923647246, 0.13846657655753747, 0.028746233701154037, 0.0833982993538181, 0.2621687278772394, 0.1892021003489693, 0.10237457663234738, -0.1840546939763482, 0.036826215436061224, 0.1282246975383411] |
1,803.02642 | Learning Spectral-Spatial-Temporal Features via a Recurrent
Convolutional Neural Network for Change Detection in Multispectral Imagery | Change detection is one of the central problems in earth observation and was
extensively investigated over recent decades. In this paper, we propose a novel
recurrent convolutional neural network (ReCNN) architecture, which is trained
to learn a joint spectral-spatial-temporal feature representation in a unified
framework for change detection in multispectral images. To this end, we bring
together a convolutional neural network (CNN) and a recurrent neural network
(RNN) into one end-to-end network. The former is able to generate rich
spectral-spatial feature representations, while the latter effectively analyzes
temporal dependency in bi-temporal images. In comparison with previous
approaches to change detection, the proposed network architecture possesses
three distinctive properties: 1) It is end-to-end trainable, in contrast to
most existing methods whose components are separately trained or computed; 2)
it naturally harnesses spatial information that has been proven to be
beneficial to change detection task; 3) it is capable of adaptively learning
the temporal dependency between multitemporal images, unlike most of algorithms
that use fairly simple operation like image differencing or stacking. As far as
we know, this is the first time that a recurrent convolutional network
architecture has been proposed for multitemporal remote sensing image analysis.
The proposed network is validated on real multispectral data sets. Both visual
and quantitative analysis of experimental results demonstrates competitive
performance in the proposed mode.
| cs.CV | change detection is one of the central problems in earth observation and was extensively investigated over recent decades in this paper we propose a novel recurrent convolutional neural network recnn architecture which is trained to learn a joint spectralspatialtemporal feature representation in a unified framework for change detection in multispectral images to this end we bring together a convolutional neural network cnn and a recurrent neural network rnn into one endtoend network the former is able to generate rich spectralspatial feature representations while the latter effectively analyzes temporal dependency in bitemporal images in comparison with previous approaches to change detection the proposed network architecture possesses three distinctive properties 1 it is endtoend trainable in contrast to most existing methods whose components are separately trained or computed 2 it naturally harnesses spatial information that has been proven to be beneficial to change detection task 3 it is capable of adaptively learning the temporal dependency between multitemporal images unlike most of algorithms that use fairly simple operation like image differencing or stacking as far as we know this is the first time that a recurrent convolutional network architecture has been proposed for multitemporal remote sensing image analysis the proposed network is validated on real multispectral data sets both visual and quantitative analysis of experimental results demonstrates competitive performance in the proposed mode | [['change', 'detection', 'is', 'one', 'of', 'the', 'central', 'problems', 'in', 'earth', 'observation', 'and', 'was', 'extensively', 'investigated', 'over', 'recent', 'decades', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'recurrent', 'convolutional', 'neural', 'network', 'recnn', 'architecture', 'which', 'is', 'trained', 'to', 'learn', 'a', 'joint', 'spectralspatialtemporal', 'feature', 'representation', 'in', 'a', 'unified', 'framework', 'for', 'change', 'detection', 'in', 'multispectral', 'images', 'to', 'this', 'end', 'we', 'bring', 'together', 'a', 'convolutional', 'neural', 'network', 'cnn', 'and', 'a', 'recurrent', 'neural', 'network', 'rnn', 'into', 'one', 'endtoend', 'network', 'the', 'former', 'is', 'able', 'to', 'generate', 'rich', 'spectralspatial', 'feature', 'representations', 'while', 'the', 'latter', 'effectively', 'analyzes', 'temporal', 'dependency', 'in', 'bitemporal', 'images', 'in', 'comparison', 'with', 'previous', 'approaches', 'to', 'change', 'detection', 'the', 'proposed', 'network', 'architecture', 'possesses', 'three', 'distinctive', 'properties', '1', 'it', 'is', 'endtoend', 'trainable', 'in', 'contrast', 'to', 'most', 'existing', 'methods', 'whose', 'components', 'are', 'separately', 'trained', 'or', 'computed', '2', 'it', 'naturally', 'harnesses', 'spatial', 'information', 'that', 'has', 'been', 'proven', 'to', 'be', 'beneficial', 'to', 'change', 'detection', 'task', '3', 'it', 'is', 'capable', 'of', 'adaptively', 'learning', 'the', 'temporal', 'dependency', 'between', 'multitemporal', 'images', 'unlike', 'most', 'of', 'algorithms', 'that', 'use', 'fairly', 'simple', 'operation', 'like', 'image', 'differencing', 'or', 'stacking', 'as', 'far', 'as', 'we', 'know', 'this', 'is', 'the', 'first', 'time', 'that', 'a', 'recurrent', 'convolutional', 'network', 'architecture', 'has', 'been', 'proposed', 'for', 'multitemporal', 'remote', 'sensing', 'image', 'analysis', 'the', 'proposed', 'network', 'is', 'validated', 'on', 'real', 'multispectral', 'data', 'sets', 'both', 'visual', 'and', 'quantitative', 'analysis', 'of', 'experimental', 'results', 'demonstrates', 'competitive', 'performance', 'in', 'the', 'proposed', 'mode']] | [-0.06483091856884561, -0.03355762140493687, -0.0819758769540971, 0.04997043470431068, -0.10598639384354358, -0.2125113027629583, -0.03433433111058548, 0.4924963039726648, -0.2792671750858851, -0.3045147271065645, 0.07787846338395114, -0.25356045686618583, -0.24276772927924498, 0.15554391586574723, -0.12994821872094384, 0.0945610800849967, 0.13401240380597831, 0.06420463536436495, -0.057776821176542745, -0.2648670231778872, 0.27308137890655276, 0.0490717591577503, 0.37129623255029015, -0.0030184677614911236, 0.15174544071108867, -0.03708827318108032, -0.04402926566449236, -0.023867946508825337, -0.012254201169156301, 0.16992944979308744, 0.325060940092455, 0.1906815893856647, 0.29831622357982035, -0.42506579094519625, -0.29110618969514596, 0.09321829362519375, 0.16462239290382416, 0.08162057442966951, -0.019098132586672256, -0.32924360062578295, 0.11453360859910663, -0.17368365732366092, 0.05481085394930146, -0.1253331813548764, -0.0029632154847899256, -0.05365576970201734, -0.27723832643425017, 0.019262388564665382, 0.08195131997360963, 0.05044479204286485, -0.05196350487055402, -0.06736878439205694, 0.018197374522566933, 0.1705940832922418, -2.1760637944215508e-05, 0.07712092073198373, 0.11690586484032024, -0.1523306286129909, -0.12082762010214791, 0.3165851743623655, -0.07149079521016545, -0.19205175147957454, 0.19792601394575499, -0.0327552374469363, -0.19914373924283812, 0.11537348571739513, 0.22293673344615625, 0.09890584732601461, -0.18798054235064549, -0.01798942947486994, -0.060609221725818195, 0.20354554914714149, 0.04590899076049118, 0.010303071659636688, 0.18029214537672733, 0.32210804077639293, 0.025642508726701783, 0.14358359341430968, -0.18932047844694325, -0.05865273093932295, -0.16152766568439514, -0.09593799744427553, -0.2166949406655061, -0.043145597134142705, -0.06998806723828596, -0.1227229103012373, 0.4574668232997939, 0.22130177730107553, 0.2289583926816305, 0.10461635586165623, 0.3825910600267997, 0.02375481956527828, 0.17965495090434097, 0.08505287619502194, 0.21562290130306427, 0.04291943288950428, 0.15528087484061326, -0.13534823370263932, 0.09497859320107882, 0.07213348094331415] |
1,803.02643 | Quasiperiods of biinfinite Sturmian words | We study the notion of quasiperiodicity, in the sense of "coverability", for
biinfinite words. All previous work about quasiperiodicity focused on right
infinite words, but the passage to the biinfinite case could help to prove
stronger results about quasiperiods of Sturmian words. We demonstrate this by
showing that all biinfinite Sturmian words have infinitely many quasiperiods,
which is not quite (but almost) true in the right infinite case, and giving a
characterization of those quasiperiods.
The main difference between right infinite and the biinfinite words is that,
in the latter case, we might have several quasiperiods of the same length. This
is not possible with right infinite words because a quasiperiod has to be a
prefix of the word. We study in depth the relations between quasiperiods of the
same length in a given biinfinite quasiperiodic word. This study gives enough
information to allow to determine the set of quasiperiods of an arbitrary word.
| cs.DM | we study the notion of quasiperiodicity in the sense of coverability for biinfinite words all previous work about quasiperiodicity focused on right infinite words but the passage to the biinfinite case could help to prove stronger results about quasiperiods of sturmian words we demonstrate this by showing that all biinfinite sturmian words have infinitely many quasiperiods which is not quite but almost true in the right infinite case and giving a characterization of those quasiperiods the main difference between right infinite and the biinfinite words is that in the latter case we might have several quasiperiods of the same length this is not possible with right infinite words because a quasiperiod has to be a prefix of the word we study in depth the relations between quasiperiods of the same length in a given biinfinite quasiperiodic word this study gives enough information to allow to determine the set of quasiperiods of an arbitrary word | [['we', 'study', 'the', 'notion', 'of', 'quasiperiodicity', 'in', 'the', 'sense', 'of', 'coverability', 'for', 'biinfinite', 'words', 'all', 'previous', 'work', 'about', 'quasiperiodicity', 'focused', 'on', 'right', 'infinite', 'words', 'but', 'the', 'passage', 'to', 'the', 'biinfinite', 'case', 'could', 'help', 'to', 'prove', 'stronger', 'results', 'about', 'quasiperiods', 'of', 'sturmian', 'words', 'we', 'demonstrate', 'this', 'by', 'showing', 'that', 'all', 'biinfinite', 'sturmian', 'words', 'have', 'infinitely', 'many', 'quasiperiods', 'which', 'is', 'not', 'quite', 'but', 'almost', 'true', 'in', 'the', 'right', 'infinite', 'case', 'and', 'giving', 'a', 'characterization', 'of', 'those', 'quasiperiods', 'the', 'main', 'difference', 'between', 'right', 'infinite', 'and', 'the', 'biinfinite', 'words', 'is', 'that', 'in', 'the', 'latter', 'case', 'we', 'might', 'have', 'several', 'quasiperiods', 'of', 'the', 'same', 'length', 'this', 'is', 'not', 'possible', 'with', 'right', 'infinite', 'words', 'because', 'a', 'quasiperiod', 'has', 'to', 'be', 'a', 'prefix', 'of', 'the', 'word', 'we', 'study', 'in', 'depth', 'the', 'relations', 'between', 'quasiperiods', 'of', 'the', 'same', 'length', 'in', 'a', 'given', 'biinfinite', 'quasiperiodic', 'word', 'this', 'study', 'gives', 'enough', 'information', 'to', 'allow', 'to', 'determine', 'the', 'set', 'of', 'quasiperiods', 'of', 'an', 'arbitrary', 'word']] | [-0.15702929717561157, 0.16246079151035217, -0.07094690968681659, 0.12085649645101133, -0.10983786301977642, -0.11719241552054882, 0.05710122254737592, 0.39572243184431805, -0.32952676820810645, -0.2259228040294891, 0.09463136595622455, -0.31816368547340784, -0.10465145056958419, 0.22709507598653556, -0.09094093096527187, 0.02955655935038994, 0.07025099778396694, 0.1723396933332158, -0.07148194693553551, -0.2815529011468125, 0.2846901375345293, -0.03446310112712445, 0.19049567529363196, 0.025056943950521483, 0.09905123973700714, -0.009514303330646514, -0.053709410899016374, -0.02718069905100705, -0.13055811732353162, 0.11660258104879555, 0.27717034857381473, 0.1093611567169307, 0.2585323800925504, -0.37153301959216306, -0.18496133046611757, 0.17758293920529208, 0.1964925466129532, 0.10728251779007471, 0.01657770202546562, -0.24741808660237674, 0.14705163726050938, -0.13978654518383313, -0.09619764314795082, -0.001636347666914974, 0.1130232978551709, 0.04986014347916542, -0.18601144870286565, 0.02152954760104321, 0.1921055356990062, 0.06423001974373573, -0.03480727389430652, -0.06255211509377151, 0.044126173158368254, 0.15874430396920675, 0.09914824585641989, 3.180829520857373e-05, -0.011044761807016738, -0.061387112057259816, -0.13164964513989263, 0.3793107795396021, -0.06992844486149488, -0.2169739286439469, 0.19348054650759736, -0.22940962669415424, -0.1387005520118219, 0.1074729144796971, 0.08415107980942015, 0.07026631088153303, -0.11463684079618278, 0.08439448950570319, -0.15182454161370149, 0.21775508551955125, 0.22006153170240123, 0.07226630115228427, 0.17568494733302042, 0.10442642392227788, 0.07086389727078608, 0.1470901541746004, 0.0029998721944942295, -0.05923482860694035, -0.2809351370851328, -0.15099208047250648, -0.1198396349232039, 0.04652891342596955, -0.09434547321549647, -0.2312132241673066, 0.4159276711137651, 0.1884425209121561, 0.2248339745374442, 0.11101616012588651, 0.1925139014984106, 0.09167566323925382, 0.07182028361100268, 0.07202004157641734, 0.12293004147502799, 0.10870785866984976, 0.03272022828520215, -0.16353008020351725, 0.10101342376611837, 0.1311563459624137] |
1,803.02644 | Relational Quantum Mechanics and Probability | We present a derivation of the third postulate of Relational Quantum
Mechanics (RQM) from the properties of conditional probabilities.The first two
RQM postulates are based on the information that can be extracted from
interaction of different systems, and the third postulate defines the
properties of the probability function. Here we demonstrate that from a
rigorous definition of the conditional probability for the possible outcomes of
different measurements, the third postulate is unnecessary and the Born's rule
naturally emerges from the first two postulates by applying the Gleason's
theorem. We demonstrate in addition that the probability function is uniquely
defined for classical and quantum phenomena. The presence or not of
interference terms is demonstrated to be related to the precise formulation of
the conditional probability where distributive property on its arguments cannot
be taken for granted. In the particular case of Young's slits experiment, the
two possible argument formulations correspond to the possibility or not to
determine the particle passage through a particular path.
| quant-ph physics.hist-ph | we present a derivation of the third postulate of relational quantum mechanics rqm from the properties of conditional probabilitiesthe first two rqm postulates are based on the information that can be extracted from interaction of different systems and the third postulate defines the properties of the probability function here we demonstrate that from a rigorous definition of the conditional probability for the possible outcomes of different measurements the third postulate is unnecessary and the borns rule naturally emerges from the first two postulates by applying the gleasons theorem we demonstrate in addition that the probability function is uniquely defined for classical and quantum phenomena the presence or not of interference terms is demonstrated to be related to the precise formulation of the conditional probability where distributive property on its arguments cannot be taken for granted in the particular case of youngs slits experiment the two possible argument formulations correspond to the possibility or not to determine the particle passage through a particular path | [['we', 'present', 'a', 'derivation', 'of', 'the', 'third', 'postulate', 'of', 'relational', 'quantum', 'mechanics', 'rqm', 'from', 'the', 'properties', 'of', 'conditional', 'probabilitiesthe', 'first', 'two', 'rqm', 'postulates', 'are', 'based', 'on', 'the', 'information', 'that', 'can', 'be', 'extracted', 'from', 'interaction', 'of', 'different', 'systems', 'and', 'the', 'third', 'postulate', 'defines', 'the', 'properties', 'of', 'the', 'probability', 'function', 'here', 'we', 'demonstrate', 'that', 'from', 'a', 'rigorous', 'definition', 'of', 'the', 'conditional', 'probability', 'for', 'the', 'possible', 'outcomes', 'of', 'different', 'measurements', 'the', 'third', 'postulate', 'is', 'unnecessary', 'and', 'the', 'borns', 'rule', 'naturally', 'emerges', 'from', 'the', 'first', 'two', 'postulates', 'by', 'applying', 'the', 'gleasons', 'theorem', 'we', 'demonstrate', 'in', 'addition', 'that', 'the', 'probability', 'function', 'is', 'uniquely', 'defined', 'for', 'classical', 'and', 'quantum', 'phenomena', 'the', 'presence', 'or', 'not', 'of', 'interference', 'terms', 'is', 'demonstrated', 'to', 'be', 'related', 'to', 'the', 'precise', 'formulation', 'of', 'the', 'conditional', 'probability', 'where', 'distributive', 'property', 'on', 'its', 'arguments', 'can', 'not', 'be', 'taken', 'for', 'granted', 'in', 'the', 'particular', 'case', 'of', 'youngs', 'slits', 'experiment', 'the', 'two', 'possible', 'argument', 'formulations', 'correspond', 'to', 'the', 'possibility', 'or', 'not', 'to', 'determine', 'the', 'particle', 'passage', 'through', 'a', 'particular', 'path']] | [-0.08692690985494413, 0.12269829673281202, -0.14602476298991887, 0.07144948506393567, -0.07675131689471427, -0.10932774951487231, 0.07962417655461611, 0.30995590071353857, -0.3025442677310045, -0.27532116615104896, 0.05662856550038752, -0.2469443765160359, -0.1671214807761456, 0.18265895984218417, -0.07278246153860234, 0.05382999389016704, 0.040988682120741325, 0.07618113457756631, -0.0731478956395166, -0.20396693173990202, 0.3580233756012849, 0.014135924337911734, 0.2776240685517597, 0.0713657142417334, 0.12502050023144567, 0.05513664623408184, -0.029479204859881678, 0.045529976789982406, -0.1110649649931837, 0.09569033651549849, 0.18518545570446926, 0.18595723292727503, 0.2686910755029577, -0.43815392902566613, -0.17390243001739306, 0.09899803673837082, 0.07688263654308908, 0.11319489570397404, 0.013713457737335124, -0.2873949488507801, 0.05259086665885946, -0.1620324892420436, -0.13428417646091867, -0.045002708894320606, -0.02010430499448504, 0.015807126034508272, -0.2727027085346907, 0.08803914157970825, 0.09649424765693264, 0.01484437309851173, -0.040271568236704004, -0.06545944371959908, 0.009378853248306578, 0.12788803823166556, 0.02764886278413419, -0.01135932259687274, 0.11024026986657202, -0.09451205535660401, -0.18005073406273625, 0.4006688884385159, -0.014389887333567615, -0.21316960591685735, 0.15458473693608005, -0.15365374040007135, -0.1453423381824492, 0.07176700885553325, 0.08763759167282129, 0.1183052542423001, -0.1655480856293001, 0.05341285755293604, -0.05000898952773012, 0.14814072549257404, 0.054243094244960446, 0.06760282532534807, 0.2237044627494068, 0.09425001802562845, 0.013775128185566218, 0.12610152266145416, -0.06186841261727404, -0.14764656880484792, -0.36600064342852934, -0.19557788692689015, -0.24061741569205158, 0.06205368654949211, -0.05966936962000891, -0.13415194969578573, 0.3524420923863015, 0.1709509842662695, 0.18185413582821838, 0.06503894600440159, 0.27302813512827356, 0.15919916792054936, 0.053184337436901465, 0.0035729072016715273, 0.2847902396196739, 0.14902801030355453, 0.044549701541113707, -0.17442957689254288, 0.10021422405732922, 0.07948466280669522] |
1,803.02645 | Upgrade of the T2K near detector ND280: effect on oscillation and
cross-section analysis | The T2K neutrino oscillation experiment established the $\nu_\mu \rightarrow
\nu_e$ appearance with only $10\%$ of the original beam request of
$7.8\times10^{21}$ $30$ GeV protons on target (POT). In view of the J-PARC
program of upgrades of the beam intensity, the T2K-II proposal for
$20\times10^{21}$ POT aimed at establishing CP violation at $3\sigma$ level for
a significant fraction of the possible $\delta_{CP}$ values. The Hyper-K
proposal consists of a further increase by a factor $10$ of the far detector
mass. Facing the potential increase of statistics by two orders of magnitude,
it is of great importance to undertake a vigorous program of near detector
upgrade, with the aim of reducing the overall statistical and systematic
uncertainties at the appropriate level of better than $4\%$. The design and
performance of the proposed upgraded near-detector will be reported in these
proceedings.
| physics.ins-det hep-ex | the t2k neutrino oscillation experiment established the nu_mu rightarrow nu_e appearance with only 10 of the original beam request of 78times1021 30 gev protons on target pot in view of the jparc program of upgrades of the beam intensity the t2kii proposal for 20times1021 pot aimed at establishing cp violation at 3sigma level for a significant fraction of the possible delta_cp values the hyperk proposal consists of a further increase by a factor 10 of the far detector mass facing the potential increase of statistics by two orders of magnitude it is of great importance to undertake a vigorous program of near detector upgrade with the aim of reducing the overall statistical and systematic uncertainties at the appropriate level of better than 4 the design and performance of the proposed upgraded neardetector will be reported in these proceedings | [['the', 't2k', 'neutrino', 'oscillation', 'experiment', 'established', 'the', 'nu_mu', 'rightarrow', 'nu_e', 'appearance', 'with', 'only', '10', 'of', 'the', 'original', 'beam', 'request', 'of', '78times1021', '30', 'gev', 'protons', 'on', 'target', 'pot', 'in', 'view', 'of', 'the', 'jparc', 'program', 'of', 'upgrades', 'of', 'the', 'beam', 'intensity', 'the', 't2kii', 'proposal', 'for', '20times1021', 'pot', 'aimed', 'at', 'establishing', 'cp', 'violation', 'at', '3sigma', 'level', 'for', 'a', 'significant', 'fraction', 'of', 'the', 'possible', 'delta_cp', 'values', 'the', 'hyperk', 'proposal', 'consists', 'of', 'a', 'further', 'increase', 'by', 'a', 'factor', '10', 'of', 'the', 'far', 'detector', 'mass', 'facing', 'the', 'potential', 'increase', 'of', 'statistics', 'by', 'two', 'orders', 'of', 'magnitude', 'it', 'is', 'of', 'great', 'importance', 'to', 'undertake', 'a', 'vigorous', 'program', 'of', 'near', 'detector', 'upgrade', 'with', 'the', 'aim', 'of', 'reducing', 'the', 'overall', 'statistical', 'and', 'systematic', 'uncertainties', 'at', 'the', 'appropriate', 'level', 'of', 'better', 'than', '4', 'the', 'design', 'and', 'performance', 'of', 'the', 'proposed', 'upgraded', 'neardetector', 'will', 'be', 'reported', 'in', 'these', 'proceedings']] | [-0.0755648740015372, 0.16039152356485525, -0.016063356295008244, 0.06367062686649323, -0.015623682825308707, -0.09136728898242667, 0.10289612039923668, 0.29908260700327377, -0.16582371926762993, -0.388260870344109, 0.0625679740483907, -0.3248845915172111, -0.0008169236834402437, 0.18054841635921212, -0.0016539414659039013, 0.08775974164066914, 0.11758290943172243, -0.0020440424068106544, -0.10375916263890556, -0.24107466550561152, 0.24021906877557436, 0.19633858056256065, 0.2827595177649831, 0.07239811112414356, 0.10442842547954233, -0.038791159038535424, -0.07521324370194364, -0.055369579473820825, -0.09205114530330455, 0.07350891990656103, 0.27415934265418734, 0.15703320088203462, 0.23227731673805802, -0.38919576115354343, -0.1172787325905153, 0.1280530169054314, 0.09315422607792748, 0.022155401490076825, -0.029409952964461236, -0.3236632557551342, 0.07543560729569031, -0.1948280182874037, -0.1802124441428869, 0.03384442717112877, -0.01868521365923462, -0.03303908711316547, -0.2528297431766987, 0.027395090622896398, 0.01465944501881798, 0.07829792668215102, 0.030056582153257398, -0.220567413378093, 0.03010221472768872, 0.061386164567536775, 0.08025020590155489, 0.09382999837269179, 0.13750658553542086, -0.15208799302215792, -0.09645119338572301, 0.3756277943926829, -0.03962297524482926, -0.09497381661225249, 0.11241278271018355, -0.22707798715887798, -0.1105413904706775, 0.21083912038830696, 0.18143676368140235, 0.016928063515849686, -0.16472761497867328, 0.019861565356970663, 0.005402416105520118, 0.18148100620342625, 0.09875076631325538, 0.003822433175864043, 0.2427610399839641, 0.29756782760076156, 0.13095976464036438, 0.05937349518881766, -0.18470136283689903, -0.01039968163025117, -0.3731618135141347, -0.11607509136061978, -0.07914250418371349, 0.0402405071279241, -0.03541731586037376, -0.02403110404740329, 0.4373814058938512, 0.15112422165909298, 0.1636207710744606, 0.0019144645046994641, 0.30949717593827736, 0.05447997511795687, 0.0717779068841116, -0.01863422353958918, 0.3201254521186153, 0.0696922167411281, 0.1490123948522119, -0.2703691360885622, 0.06828866785530138, 0.009225729821870724] |
1,803.02646 | Anisotropic electronic transport and Rashba effect of the
two-dimensional electron system in (110) SrTiO$_3$-based heterostructures | The two-dimensional electron system in (110)Al$_2$O$_{3-\delta}$/SrTiO$_3$
heterostructures displays anisotropic electronic transport. Largest and lowest
conductivity and electron mobility $\mu$ are observed along the $[001]$ and
$[1\bar{1}0]$ direction, respectively. The anisotropy of the sheet resistance
and $\mu$ likewise leads to a distinct anisotropic normal magnetotransport (MR)
for T < 30K. However, at temperatures T<5K and magnetic field B<2T MR is
dominated by weak antilocalization.Despite the rather strong anisotropy of the
Fermi surfaces, the in-plane anisotropic magnetoresistance (AMR) displays
two-fold non-crystalline anisotropy. However, the AMR-amplitude is found to be
anisotropic with respect to the current direction, leading to a 60% larger AMR
amplitude for current I along the $[001]$ direction compared to I parallel to
$[1\bar{1}0]$. Tight binding calulations evidence an anisotropic Rashba-induced
band splitting with dominant linear k-dependence. In combination with
semiclassical Boltzmann theory the non-crystalline AMR is well described,
despite the anisotropic Fermi surface.
| cond-mat.str-el | the twodimensional electron system in 110al_2o_3deltasrtio_3 heterostructures displays anisotropic electronic transport largest and lowest conductivity and electron mobility mu are observed along the 001 and 1bar10 direction respectively the anisotropy of the sheet resistance and mu likewise leads to a distinct anisotropic normal magnetotransport mr for t 30k however at temperatures t5k and magnetic field b2t mr is dominated by weak antilocalizationdespite the rather strong anisotropy of the fermi surfaces the inplane anisotropic magnetoresistance amr displays twofold noncrystalline anisotropy however the amramplitude is found to be anisotropic with respect to the current direction leading to a 60 larger amr amplitude for current i along the 001 direction compared to i parallel to 1bar10 tight binding calulations evidence an anisotropic rashbainduced band splitting with dominant linear kdependence in combination with semiclassical boltzmann theory the noncrystalline amr is well described despite the anisotropic fermi surface | [['the', 'twodimensional', 'electron', 'system', 'in', '110al_2o_3deltasrtio_3', 'heterostructures', 'displays', 'anisotropic', 'electronic', 'transport', 'largest', 'and', 'lowest', 'conductivity', 'and', 'electron', 'mobility', 'mu', 'are', 'observed', 'along', 'the', '001', 'and', '1bar10', 'direction', 'respectively', 'the', 'anisotropy', 'of', 'the', 'sheet', 'resistance', 'and', 'mu', 'likewise', 'leads', 'to', 'a', 'distinct', 'anisotropic', 'normal', 'magnetotransport', 'mr', 'for', 't', '30k', 'however', 'at', 'temperatures', 't5k', 'and', 'magnetic', 'field', 'b2t', 'mr', 'is', 'dominated', 'by', 'weak', 'antilocalizationdespite', 'the', 'rather', 'strong', 'anisotropy', 'of', 'the', 'fermi', 'surfaces', 'the', 'inplane', 'anisotropic', 'magnetoresistance', 'amr', 'displays', 'twofold', 'noncrystalline', 'anisotropy', 'however', 'the', 'amramplitude', 'is', 'found', 'to', 'be', 'anisotropic', 'with', 'respect', 'to', 'the', 'current', 'direction', 'leading', 'to', 'a', '60', 'larger', 'amr', 'amplitude', 'for', 'current', 'i', 'along', 'the', '001', 'direction', 'compared', 'to', 'i', 'parallel', 'to', '1bar10', 'tight', 'binding', 'calulations', 'evidence', 'an', 'anisotropic', 'rashbainduced', 'band', 'splitting', 'with', 'dominant', 'linear', 'kdependence', 'in', 'combination', 'with', 'semiclassical', 'boltzmann', 'theory', 'the', 'noncrystalline', 'amr', 'is', 'well', 'described', 'despite', 'the', 'anisotropic', 'fermi', 'surface']] | [-0.19726577168372128, 0.19609172422465884, -0.0013906673191481137, 0.011744387626614687, -0.09510391743720642, -0.16047436467904067, -0.02774507090050195, 0.41159322067563026, -0.3013420681469142, -0.30019950116859817, -0.040552346070762725, -0.32325742367122856, -0.06067105831461959, 0.20906355361221357, 0.06283493342052679, -0.03097829701010986, -0.0229983741084912, -0.05615149510932887, -0.10281391464356732, -0.1865805927589203, 0.28331349088610813, 0.08457659913692624, 0.3811222235040207, 0.08089365984113621, 0.05354456142189779, -0.010379006199738278, 0.08234550046202327, 0.12056996114552021, -0.16521848092920013, 0.04755136620120278, 0.20970647219801322, -0.20262630200013518, 0.13522502764868216, -0.3932686824218503, -0.1490430841954159, -0.046240433616497156, 0.13631179134827107, 0.1379907322615119, -0.04715457939143692, -0.21101006592091706, 0.08460106734585549, -0.08147466414208923, -0.15372578826999025, -0.06310590028629771, 0.013551634185049417, -0.03152647716591933, -0.2310375200983669, 0.21033663409263162, 0.06493985730173465, 0.10881037268388484, -0.11766283382728164, -0.17699944621334518, -0.09352674934447609, 0.00014572246998016322, 0.1049183571062583, 0.14116699660579407, 0.13378985035960794, -0.11199799964670092, -0.08136351723889156, 0.3706388951279223, -0.08815405718632974, -0.11426040905394724, 0.17021512100473046, -0.21807659621949174, -0.04145407124389229, 0.1825933916685504, 0.11484200592219297, 0.0508544537234619, -0.1129137527297384, 0.09430213823179656, 0.03319356374808454, 0.14402185749661708, 0.04222207926213741, 0.00225791985036007, 0.25923263521731965, 0.14934290698729455, 0.060178913874551654, 0.0778190430536467, -0.1741456100866864, -0.013789708336948285, -0.17946060452876347, -0.1712297952829561, -0.19763283320103905, 0.10895636413562378, -0.11878744118678566, -0.2200167629934315, 0.38726589257629324, 0.1245076147007889, 0.19587383135221897, -0.0327353881721917, 0.2538988642926727, 0.1120451363867947, 0.0739955518993416, 0.10564493204666568, 0.2518585167130888, 0.17615445510517538, 0.14143530259441053, -0.29869855816442786, 0.08148814057931304, -0.0380925410227584] |
1,803.02647 | Mean field repulsive Kuramoto models: Phase locking and spatial signs | The phenomenon of self-synchronization in populations of oscillatory units
appears naturally in neurosciences. However, in some situations, the formation
of a coherent state is damaging. In this article we study a repulsive
mean-field Kuramoto model that describes the time evolution of n points on the
unit circle, which are transformed into incoherent phase-locked states. It has
been recently shown that such systems can be reduced to a three-dimensional
system of ordinary differential equations, whose mathematical structure is
strongly related to hyperbolic geometry. The orbits of the Kuramoto dynamical
system are then described by a ow of M\"obius transformations. We show this
underlying dynamic performs statistical inference by computing dynamically
M-estimates of scatter matrices. We also describe the limiting phase-locked
states for random initial conditions using Tyler's transformation matrix.
Moreover, we show the repulsive Kuramoto model performs dynamically not only
robust covariance matrix estimation, but also data processing: the initial
configuration of the n points is transformed by the dynamic into a limiting
phase-locked state that surprisingly equals the spatial signs from
nonparametric statistics. That makes the sign empirical covariance matrix to
equal 1 2 id2, the variance-covariance matrix of a random vector that is
uniformly distributed on the unit circle.
| nlin.AO math.DS math.PR math.ST q-bio.NC stat.TH | the phenomenon of selfsynchronization in populations of oscillatory units appears naturally in neurosciences however in some situations the formation of a coherent state is damaging in this article we study a repulsive meanfield kuramoto model that describes the time evolution of n points on the unit circle which are transformed into incoherent phaselocked states it has been recently shown that such systems can be reduced to a threedimensional system of ordinary differential equations whose mathematical structure is strongly related to hyperbolic geometry the orbits of the kuramoto dynamical system are then described by a ow of mobius transformations we show this underlying dynamic performs statistical inference by computing dynamically mestimates of scatter matrices we also describe the limiting phaselocked states for random initial conditions using tylers transformation matrix moreover we show the repulsive kuramoto model performs dynamically not only robust covariance matrix estimation but also data processing the initial configuration of the n points is transformed by the dynamic into a limiting phaselocked state that surprisingly equals the spatial signs from nonparametric statistics that makes the sign empirical covariance matrix to equal 1 2 id2 the variancecovariance matrix of a random vector that is uniformly distributed on the unit circle | [['the', 'phenomenon', 'of', 'selfsynchronization', 'in', 'populations', 'of', 'oscillatory', 'units', 'appears', 'naturally', 'in', 'neurosciences', 'however', 'in', 'some', 'situations', 'the', 'formation', 'of', 'a', 'coherent', 'state', 'is', 'damaging', 'in', 'this', 'article', 'we', 'study', 'a', 'repulsive', 'meanfield', 'kuramoto', 'model', 'that', 'describes', 'the', 'time', 'evolution', 'of', 'n', 'points', 'on', 'the', 'unit', 'circle', 'which', 'are', 'transformed', 'into', 'incoherent', 'phaselocked', 'states', 'it', 'has', 'been', 'recently', 'shown', 'that', 'such', 'systems', 'can', 'be', 'reduced', 'to', 'a', 'threedimensional', 'system', 'of', 'ordinary', 'differential', 'equations', 'whose', 'mathematical', 'structure', 'is', 'strongly', 'related', 'to', 'hyperbolic', 'geometry', 'the', 'orbits', 'of', 'the', 'kuramoto', 'dynamical', 'system', 'are', 'then', 'described', 'by', 'a', 'ow', 'of', 'mobius', 'transformations', 'we', 'show', 'this', 'underlying', 'dynamic', 'performs', 'statistical', 'inference', 'by', 'computing', 'dynamically', 'mestimates', 'of', 'scatter', 'matrices', 'we', 'also', 'describe', 'the', 'limiting', 'phaselocked', 'states', 'for', 'random', 'initial', 'conditions', 'using', 'tylers', 'transformation', 'matrix', 'moreover', 'we', 'show', 'the', 'repulsive', 'kuramoto', 'model', 'performs', 'dynamically', 'not', 'only', 'robust', 'covariance', 'matrix', 'estimation', 'but', 'also', 'data', 'processing', 'the', 'initial', 'configuration', 'of', 'the', 'n', 'points', 'is', 'transformed', 'by', 'the', 'dynamic', 'into', 'a', 'limiting', 'phaselocked', 'state', 'that', 'surprisingly', 'equals', 'the', 'spatial', 'signs', 'from', 'nonparametric', 'statistics', 'that', 'makes', 'the', 'sign', 'empirical', 'covariance', 'matrix', 'to', 'equal', '1', '2', 'id2', 'the', 'variancecovariance', 'matrix', 'of', 'a', 'random', 'vector', 'that', 'is', 'uniformly', 'distributed', 'on', 'the', 'unit', 'circle']] | [-0.15441692487427955, 0.15265039920376325, -0.10315830152055913, 0.06940789890754032, -0.03382544363287263, -0.1508332997514871, 0.020059658160044732, 0.37280344805942295, -0.292998206256491, -0.233274412020835, 0.10596294516589885, -0.25016470701578797, -0.21310739814720336, 0.15022788951337226, -0.06668887541269013, 0.07013076751980808, 0.06736117927591555, 0.04738083138100185, -0.08117343537917772, -0.23524514709461256, 0.3221644556317151, -0.003608128325469633, 0.28140090296428705, -0.06136530277146092, 0.11670588229340619, 0.01117170476541859, 0.007671315122358314, 0.0252863367061229, -0.06417154529031475, 0.08026276953019969, 0.2162157716592259, 0.11097507150527838, 0.272832681497456, -0.4046869545557241, -0.21617837818620267, 0.12315994899616993, 0.15858032248797826, 0.10001580237619223, -0.004375136922459918, -0.28157495493689394, 0.05588220544721014, -0.13949194137035079, -0.1452753626760189, -0.087749713254714, 0.03696235541216842, 0.023903045066791452, -0.2922632069243282, 0.09541175138279805, 0.0935045962610069, 0.01799614093121347, -0.05671911784471129, -0.09064544094656243, -0.03123684092799211, 0.10710608383907408, 0.00246820835590868, -0.014930514629284417, 0.12939506222320787, -0.08265803284690383, -0.07896155396086776, 0.3631355799687792, -0.053176102274677825, -0.24174215722191159, 0.15059060675452401, -0.15175587369770224, -0.13838936033981605, 0.12758197862085718, 0.1779790831496939, 0.07507415246990645, -0.1590766363298104, 0.09971424064546473, -0.07752766175401496, 0.1973235456684801, 0.03184033688227997, -0.009066713178277615, 0.17200803547517288, 0.1553127521569443, 0.08968485845720872, 0.14936199252219898, -0.04843526225930183, -0.1617378656652665, -0.2615867284496301, -0.09624510853148847, -0.22307275837151586, 0.06674352855939036, -0.11660150378174967, -0.1956553220772009, 0.4065657581235446, 0.12731582327422933, 0.20796960811762505, 0.04932768543115723, 0.26801401421652365, 0.13689959896277945, 0.040354121200291054, 0.07280356423980813, 0.19082008914781579, 0.1597067936962405, 0.07405582694430372, -0.22659600330586896, 0.06373746744175698, 0.07900593492633022] |
1,803.02648 | Testing Topological Protection of Edge States in Hexagonal Quantum Spin
Hall Candidate Materials | We analyze the detailed structure of topological edge mode protection
occuring in hexagonal quantum spin Hall (QSH) materials. We focus on
bismuthene, antimonene, and arsenene on a SiC substrate, which, due to their
large bulk gap, may offer new opportunities for room-temperature QSH
applications. While time reversal symmetry is responsible for the principal
symmetry protected character of QSH states, the hexagonal edge terminations
yield further aspects of crystal symmetry which affect the topological
protection. We show that armchair QSH edge states remain gapless under an
in-plane magnetic field in the direction along the edge, a hallmark of their
topological crystalline protection. In contrast, an out-of-plane magnetic field
opens a gap of the order of a few meV within realistic ranges of parameters. We
use these intriguing signatures of armchair QSH edge states to predict
experimentally testable fingerprints of their additional topological
crystalline character and their helicity emerging in tunneling spectroscopy and
ballistic magnetotransport.
| cond-mat.mes-hall cond-mat.mtrl-sci | we analyze the detailed structure of topological edge mode protection occuring in hexagonal quantum spin hall qsh materials we focus on bismuthene antimonene and arsenene on a sic substrate which due to their large bulk gap may offer new opportunities for roomtemperature qsh applications while time reversal symmetry is responsible for the principal symmetry protected character of qsh states the hexagonal edge terminations yield further aspects of crystal symmetry which affect the topological protection we show that armchair qsh edge states remain gapless under an inplane magnetic field in the direction along the edge a hallmark of their topological crystalline protection in contrast an outofplane magnetic field opens a gap of the order of a few mev within realistic ranges of parameters we use these intriguing signatures of armchair qsh edge states to predict experimentally testable fingerprints of their additional topological crystalline character and their helicity emerging in tunneling spectroscopy and ballistic magnetotransport | [['we', 'analyze', 'the', 'detailed', 'structure', 'of', 'topological', 'edge', 'mode', 'protection', 'occuring', 'in', 'hexagonal', 'quantum', 'spin', 'hall', 'qsh', 'materials', 'we', 'focus', 'on', 'bismuthene', 'antimonene', 'and', 'arsenene', 'on', 'a', 'sic', 'substrate', 'which', 'due', 'to', 'their', 'large', 'bulk', 'gap', 'may', 'offer', 'new', 'opportunities', 'for', 'roomtemperature', 'qsh', 'applications', 'while', 'time', 'reversal', 'symmetry', 'is', 'responsible', 'for', 'the', 'principal', 'symmetry', 'protected', 'character', 'of', 'qsh', 'states', 'the', 'hexagonal', 'edge', 'terminations', 'yield', 'further', 'aspects', 'of', 'crystal', 'symmetry', 'which', 'affect', 'the', 'topological', 'protection', 'we', 'show', 'that', 'armchair', 'qsh', 'edge', 'states', 'remain', 'gapless', 'under', 'an', 'inplane', 'magnetic', 'field', 'in', 'the', 'direction', 'along', 'the', 'edge', 'a', 'hallmark', 'of', 'their', 'topological', 'crystalline', 'protection', 'in', 'contrast', 'an', 'outofplane', 'magnetic', 'field', 'opens', 'a', 'gap', 'of', 'the', 'order', 'of', 'a', 'few', 'mev', 'within', 'realistic', 'ranges', 'of', 'parameters', 'we', 'use', 'these', 'intriguing', 'signatures', 'of', 'armchair', 'qsh', 'edge', 'states', 'to', 'predict', 'experimentally', 'testable', 'fingerprints', 'of', 'their', 'additional', 'topological', 'crystalline', 'character', 'and', 'their', 'helicity', 'emerging', 'in', 'tunneling', 'spectroscopy', 'and', 'ballistic', 'magnetotransport']] | [-0.2653948670265332, 0.24620092807058397, -0.04918790027328761, -0.0006856337772511871, -0.0760210199866313, -0.1960055320249761, 0.10707944765948733, 0.42204289211362017, -0.30410093742307104, -0.27343653346369273, 0.011877856366458087, -0.27867589281031896, -0.15930984519784236, 0.14928271482376004, 0.02045824616124817, 0.08130223464732077, -0.014727392580110604, -0.09276643646820114, -0.0927149847353766, -0.16456088822888928, 0.25451471264553227, -0.017734239411272498, 0.38471690758916677, 0.12205127566376416, -0.025279820714072854, 0.004834793520226977, 0.13296776828569135, 0.0040874051179712505, -0.18424766270461487, 0.06563734423918528, 0.24855969633505332, -0.16144323081167694, 0.15467746716047473, -0.5190775033963078, -0.17857985168975454, -0.01827517141180198, 0.111909652238383, 0.1983969458241892, -0.12239891514821234, -0.32434848883323175, 0.13055302142135167, -0.14092180325826204, -0.1269543116540934, -0.11078131197361288, -0.007017778509655614, -0.13675220497599286, -0.1654795233538417, 0.07940927236432246, 0.058826250368059656, 0.1196633049049506, -0.10322164230693887, -0.11943511958188359, -0.16028922861076744, 0.08511257370982588, 0.050643696691658274, -0.017221716474559084, 0.16793079532034622, -0.17377725717142906, -0.22240029591336555, 0.3925219869691562, 0.00048682130903638656, -0.07332559466495915, 0.17642870083073872, -0.1600998676126348, -0.10787156382210407, 0.13454218059047765, 0.12736280738099118, 0.05971147618226074, -0.04031815589367552, 0.09182660484700189, -0.014167421263813047, 0.12086612880960398, 0.039256103271375, 0.19484105795390563, 0.33413309420099835, 0.1738691848202067, 0.11666243712058644, 0.14828630820148034, -0.1467934901585644, -0.008372592888894229, -0.23403123369610873, -0.2564857145284418, -0.23336491508016002, 0.08497228258246788, -0.04271977206091381, -0.22559497790910255, 0.5089462719662906, 0.15205915571491727, 0.15651191330402237, -0.08837731644432091, 0.2178274975949594, 0.05827573770839794, 0.09239813095579545, 0.03589703599478002, 0.24866460034550697, 0.16044452289131536, 0.06263732430951219, -0.2866032863875814, 0.08542752633437369, -0.047257668892639916] |
1,803.02649 | Saturation and negative temperature coefficient of electrical
resistivity in liquid iron-sulfur alloys at high densities from first
principles calculations | We report results on electronic transport properties of liquid Fe-S alloys at
conditions of planetary cores, computed by first-principle techniques in the
Kubo-Greenwood formalism. We describe a combined effect of resistivity
saturation due to temperature, compression, and chemistry by comparing the
electron mean free path from the Drude response of optical conductivity to the
mean interatomic distance. At high compression and high sulfur concentration
the Ioffe-Regel condition is satisfied, and the temperature coefficient of
resistivity changes sign from positive to negative. We show that this happens
due to a decrease of the $d$-density of states at the Fermi level in response
to thermal broadening.
| cond-mat.mtrl-sci | we report results on electronic transport properties of liquid fes alloys at conditions of planetary cores computed by firstprinciple techniques in the kubogreenwood formalism we describe a combined effect of resistivity saturation due to temperature compression and chemistry by comparing the electron mean free path from the drude response of optical conductivity to the mean interatomic distance at high compression and high sulfur concentration the iofferegel condition is satisfied and the temperature coefficient of resistivity changes sign from positive to negative we show that this happens due to a decrease of the ddensity of states at the fermi level in response to thermal broadening | [['we', 'report', 'results', 'on', 'electronic', 'transport', 'properties', 'of', 'liquid', 'fes', 'alloys', 'at', 'conditions', 'of', 'planetary', 'cores', 'computed', 'by', 'firstprinciple', 'techniques', 'in', 'the', 'kubogreenwood', 'formalism', 'we', 'describe', 'a', 'combined', 'effect', 'of', 'resistivity', 'saturation', 'due', 'to', 'temperature', 'compression', 'and', 'chemistry', 'by', 'comparing', 'the', 'electron', 'mean', 'free', 'path', 'from', 'the', 'drude', 'response', 'of', 'optical', 'conductivity', 'to', 'the', 'mean', 'interatomic', 'distance', 'at', 'high', 'compression', 'and', 'high', 'sulfur', 'concentration', 'the', 'iofferegel', 'condition', 'is', 'satisfied', 'and', 'the', 'temperature', 'coefficient', 'of', 'resistivity', 'changes', 'sign', 'from', 'positive', 'to', 'negative', 'we', 'show', 'that', 'this', 'happens', 'due', 'to', 'a', 'decrease', 'of', 'the', 'ddensity', 'of', 'states', 'at', 'the', 'fermi', 'level', 'in', 'response', 'to', 'thermal', 'broadening']] | [-0.10169173266667013, 0.1937689900335569, -0.07748698213030226, 0.008643797348038508, -0.012997157421733182, -0.0961021317455631, 0.10659704635886905, 0.37337872865968025, -0.296672191685782, -0.2860189361247019, 0.009909369805917287, -0.3276099585928023, -0.10723791296522205, 0.1649004709548675, -0.005627624708442734, 0.05623848413905272, -0.007416653724458928, -0.018550539201197144, -0.138387353345304, -0.21246250690175936, 0.2915647025936498, 0.1038768797969589, 0.3240342049752004, 0.1710875326243695, 0.07259006934383741, 0.0028311883618768593, 0.06345047300027755, 0.0768412467217646, -0.17018457184174343, 0.042346048662553724, 0.23351303599058434, -0.06655559547317143, 0.20040405864039293, -0.4403935146267311, -0.2289715386062968, -0.01510576156523222, 0.055600995336695075, 0.1258549600517234, -0.0321106803211688, -0.1926786737032951, 0.05000870873650106, -0.14213028683801754, -0.1582980024485061, -0.07410460492022909, 0.014655976851757329, -0.012655379179285284, -0.24854400718602568, 0.18928574563827938, 0.0007567170541733503, 0.11641189233005907, -0.1399021792727021, -0.1665058663705937, -0.03803210754323608, 0.041699439202112935, 0.03845689964006082, 0.011412377747127231, 0.22681070528946853, -0.16108720603873594, -0.04107572429571659, 0.3665545583666804, -0.11117943273319934, -0.08183949119288278, 0.19335075385438708, -0.20876835990482226, -0.062342934928332955, 0.20113555933886135, 0.1462440527886009, 0.06778258372259398, -0.12108672258909792, 0.03494157006823046, 0.0502139140959256, 0.16168869899299282, 0.07809930973319122, 0.03456188800583522, 0.20670040362592074, 0.1339398592065733, 0.01928330741625709, 0.1522800039629846, -0.1374296860639543, -0.0067211860889354, -0.23024764854478866, -0.16079820766393682, -0.23320204041262443, 0.07815213749507585, -0.07235315787259494, -0.1749191209035836, 0.3818593331827567, 0.1802282355218687, 0.1872654863489935, 0.006290532335137518, 0.25993932053769153, 0.17197277472139552, 0.0655715164835923, 0.06340458790789573, 0.23118218918926475, 0.19717127893258854, 0.14586540776788473, -0.36383061500404995, 0.10958402665206589, 0.029899967467197433] |
1,803.0265 | An H$\alpha$ Imaging Survey of the Low-surface-brightness Galaxies
Selected from the Fall Sky Region of the 40$\%$ ALFALFA \ion{H}{1} Survey | We present the observed H$\alpha$ flux and derived star formation rates
(SFRs) for a fall sample of low$-$surface$-$brightness galaxies (LSBGs). The
sample is selected from the fall sky region of the 40$\%$ ALFALFA {\ion{H}{1}}
survey $-$ SDSS DR7 photometric data, and all the $H\alpha$ images were
obtained using the 2.16 m telescope, operated by the National Astronomy
Observatories, Chinese Academy of Sciences. A total of 111 LSBGs were observed
and $H\alpha$ flux was measured in 92 of them. Though almost all the LSBGs in
our sample are {\ion{H}{1}}$-$rich, their SFRs derived from the extinction and
filter$-$transmission$-$corrected $H\alpha$ flux, are less than
1$M_{\sun}$$yr^{-1}$.
LSBGs and star forming galaxies have similar {\ion{H}{1}} surface densities,
but LSBGs have much lower SFRs and SFR surface densities than star$-$forming
galaxies. Our results show that LSBGs deviate from the Kennicutt-Schmidt law
significantly, which indicate that they have low star formation efficiency. The
SFRs of LSBGs are close to average SFRs in Hubble time and support the previous
arguments that most of the LSBGs are stable systems and they tend to seldom
contain strong interactions or major mergers during their star formation
histories.
| astro-ph.GA | we present the observed halpha flux and derived star formation rates sfrs for a fall sample of lowsurfacebrightness galaxies lsbgs the sample is selected from the fall sky region of the 40 alfalfa ionh1 survey sdss dr7 photometric data and all the halpha images were obtained using the 216 m telescope operated by the national astronomy observatories chinese academy of sciences a total of 111 lsbgs were observed and halpha flux was measured in 92 of them though almost all the lsbgs in our sample are ionh1rich their sfrs derived from the extinction and filtertransmissioncorrected halpha flux are less than 1m_sunyr1 lsbgs and star forming galaxies have similar ionh1 surface densities but lsbgs have much lower sfrs and sfr surface densities than starforming galaxies our results show that lsbgs deviate from the kennicuttschmidt law significantly which indicate that they have low star formation efficiency the sfrs of lsbgs are close to average sfrs in hubble time and support the previous arguments that most of the lsbgs are stable systems and they tend to seldom contain strong interactions or major mergers during their star formation histories | [['we', 'present', 'the', 'observed', 'halpha', 'flux', 'and', 'derived', 'star', 'formation', 'rates', 'sfrs', 'for', 'a', 'fall', 'sample', 'of', 'lowsurfacebrightness', 'galaxies', 'lsbgs', 'the', 'sample', 'is', 'selected', 'from', 'the', 'fall', 'sky', 'region', 'of', 'the', '40', 'alfalfa', 'ionh1', 'survey', 'sdss', 'dr7', 'photometric', 'data', 'and', 'all', 'the', 'halpha', 'images', 'were', 'obtained', 'using', 'the', '216', 'm', 'telescope', 'operated', 'by', 'the', 'national', 'astronomy', 'observatories', 'chinese', 'academy', 'of', 'sciences', 'a', 'total', 'of', '111', 'lsbgs', 'were', 'observed', 'and', 'halpha', 'flux', 'was', 'measured', 'in', '92', 'of', 'them', 'though', 'almost', 'all', 'the', 'lsbgs', 'in', 'our', 'sample', 'are', 'ionh1rich', 'their', 'sfrs', 'derived', 'from', 'the', 'extinction', 'and', 'filtertransmissioncorrected', 'halpha', 'flux', 'are', 'less', 'than', '1m_sunyr1', 'lsbgs', 'and', 'star', 'forming', 'galaxies', 'have', 'similar', 'ionh1', 'surface', 'densities', 'but', 'lsbgs', 'have', 'much', 'lower', 'sfrs', 'and', 'sfr', 'surface', 'densities', 'than', 'starforming', 'galaxies', 'our', 'results', 'show', 'that', 'lsbgs', 'deviate', 'from', 'the', 'kennicuttschmidt', 'law', 'significantly', 'which', 'indicate', 'that', 'they', 'have', 'low', 'star', 'formation', 'efficiency', 'the', 'sfrs', 'of', 'lsbgs', 'are', 'close', 'to', 'average', 'sfrs', 'in', 'hubble', 'time', 'and', 'support', 'the', 'previous', 'arguments', 'that', 'most', 'of', 'the', 'lsbgs', 'are', 'stable', 'systems', 'and', 'they', 'tend', 'to', 'seldom', 'contain', 'strong', 'interactions', 'or', 'major', 'mergers', 'during', 'their', 'star', 'formation', 'histories']] | [-0.014099245995876718, 0.0880769941505495, -0.07805465591801485, 0.1638184843596409, -0.06735304036500075, -0.01641131788914368, 0.07604031858244235, 0.5162177845467251, -0.046648598243456824, -0.383767509075639, 0.053227927783314796, -0.33609713159071714, -0.014574783219659066, 0.23028628360531242, -0.0831966218706489, -0.059441686573996115, 0.07511626945163768, -0.12045906989958015, -0.03293832393547336, -0.40116629963817463, 0.2751970580308238, 0.07110843040908758, 0.2625314423937228, -0.07936048719796587, 0.010907116999778036, -0.17974195350217378, -0.13275904101984842, -0.023095887191440134, -0.19906709391644045, 0.030614157094732745, 0.29871921192798356, 0.1486710974662616, 0.222723571708999, -0.3554810036638138, -0.18828072175281224, 0.05394491576333786, 0.18786522826425486, 0.016527517947526955, -0.09023212129506027, -0.286751553826904, 0.05840127028852374, -0.17736500617280437, -0.08862630223374364, 0.11358700797107624, 0.05951031120199771, 0.08809322657212001, -0.16332236521270965, 0.20251204751708268, 0.002582255382459242, 0.14418508828320836, -0.1603037083203582, -0.14687979750969743, -0.17028522122572023, 0.10770372623081349, -0.008472779675215421, 0.10074392432387877, 0.24815255267530228, -0.16529369289260154, 0.021688981030320565, 0.39157973470903196, -0.027963773813898224, 0.07141800473986583, 0.2712300986967531, -0.2792197730274523, -0.16226159145410818, 0.16249793741975496, 0.15665429361819566, 0.11267668019186552, -0.16420193900773813, -0.04154266667111577, -0.021545267963249768, 0.19082517025398685, 0.060438507655507547, 0.07697565562685359, 0.3057947851369505, 0.040906140088886635, 0.05293412975184005, 0.05350987636164383, -0.24860735497438058, -0.02849283846668326, -0.1720079705937878, -0.06604799817080845, -0.12670623364853212, 0.08942416530348114, -0.11631061915234038, -0.07112795801239681, 0.2973985797444174, 0.06624907294127087, 0.21734097576444292, 0.16865372921757216, 0.2573606131309234, 0.07255217428498256, 0.19214348311044768, 0.12604040417380138, 0.32973590165192446, 0.16320362285797863, 0.09118689554692297, -0.18298162598352224, 0.08152143695842025, -0.006224103705640268] |
1,803.02651 | Borel Kernels and their Approximation, Categorically | This paper introduces a categorical framework to study the exact and
approximate semantics of probabilistic programs. We construct a dagger
symmetric monoidal category of Borel kernels where the dagger-structure is
given by Bayesian inversion. We show functorial bridges between this category
and categories of Banach lattices which formalize the move from kernel-based
semantics to predicate transformer (backward) or state transformer (forward)
semantics. These bridges are related by natural transformations, and we show in
particular that the Radon-Nikodym and Riesz representation theorems - two
pillars of probability theory - define natural transformations.
With the mathematical infrastructure in place, we present a generic and
endogenous approach to approximating kernels on standard Borel spaces which
exploits the involutive structure of our category of kernels. The approximation
can be formulated in several equivalent ways by using the functorial bridges
and natural transformations described above. Finally, we show that for sensible
discretization schemes, every Borel kernel can be approximated by kernels on
finite spaces, and that these approximations converge for a natural choice of
topology.
We illustrate the theory by showing two examples of how approximation can
effectively be used in practice: Bayesian inference and the Kleene star
operation of ProbNetKAT.
| cs.LO cs.FL | this paper introduces a categorical framework to study the exact and approximate semantics of probabilistic programs we construct a dagger symmetric monoidal category of borel kernels where the daggerstructure is given by bayesian inversion we show functorial bridges between this category and categories of banach lattices which formalize the move from kernelbased semantics to predicate transformer backward or state transformer forward semantics these bridges are related by natural transformations and we show in particular that the radonnikodym and riesz representation theorems two pillars of probability theory define natural transformations with the mathematical infrastructure in place we present a generic and endogenous approach to approximating kernels on standard borel spaces which exploits the involutive structure of our category of kernels the approximation can be formulated in several equivalent ways by using the functorial bridges and natural transformations described above finally we show that for sensible discretization schemes every borel kernel can be approximated by kernels on finite spaces and that these approximations converge for a natural choice of topology we illustrate the theory by showing two examples of how approximation can effectively be used in practice bayesian inference and the kleene star operation of probnetkat | [['this', 'paper', 'introduces', 'a', 'categorical', 'framework', 'to', 'study', 'the', 'exact', 'and', 'approximate', 'semantics', 'of', 'probabilistic', 'programs', 'we', 'construct', 'a', 'dagger', 'symmetric', 'monoidal', 'category', 'of', 'borel', 'kernels', 'where', 'the', 'daggerstructure', 'is', 'given', 'by', 'bayesian', 'inversion', 'we', 'show', 'functorial', 'bridges', 'between', 'this', 'category', 'and', 'categories', 'of', 'banach', 'lattices', 'which', 'formalize', 'the', 'move', 'from', 'kernelbased', 'semantics', 'to', 'predicate', 'transformer', 'backward', 'or', 'state', 'transformer', 'forward', 'semantics', 'these', 'bridges', 'are', 'related', 'by', 'natural', 'transformations', 'and', 'we', 'show', 'in', 'particular', 'that', 'the', 'radonnikodym', 'and', 'riesz', 'representation', 'theorems', 'two', 'pillars', 'of', 'probability', 'theory', 'define', 'natural', 'transformations', 'with', 'the', 'mathematical', 'infrastructure', 'in', 'place', 'we', 'present', 'a', 'generic', 'and', 'endogenous', 'approach', 'to', 'approximating', 'kernels', 'on', 'standard', 'borel', 'spaces', 'which', 'exploits', 'the', 'involutive', 'structure', 'of', 'our', 'category', 'of', 'kernels', 'the', 'approximation', 'can', 'be', 'formulated', 'in', 'several', 'equivalent', 'ways', 'by', 'using', 'the', 'functorial', 'bridges', 'and', 'natural', 'transformations', 'described', 'above', 'finally', 'we', 'show', 'that', 'for', 'sensible', 'discretization', 'schemes', 'every', 'borel', 'kernel', 'can', 'be', 'approximated', 'by', 'kernels', 'on', 'finite', 'spaces', 'and', 'that', 'these', 'approximations', 'converge', 'for', 'a', 'natural', 'choice', 'of', 'topology', 'we', 'illustrate', 'the', 'theory', 'by', 'showing', 'two', 'examples', 'of', 'how', 'approximation', 'can', 'effectively', 'be', 'used', 'in', 'practice', 'bayesian', 'inference', 'and', 'the', 'kleene', 'star', 'operation', 'of', 'probnetkat']] | [-0.05419625736347163, 0.05102108382358134, -0.10572166721592295, 0.15085380525784228, -0.11075718770131777, -0.12996055459883546, 0.06386939872483303, 0.43109392898803855, -0.3664128305245712, -0.2203859403521942, 0.07104912220013034, -0.19728988145652693, -0.17422981641600344, 0.15235925738342646, -0.15843730898443706, 0.043502050837371596, 0.07145074620201142, 0.026873782870644423, -0.10821540616669842, -0.2098321997128678, 0.3926535198100664, -0.02157459489595859, 0.2614217110296682, 0.01564857877858485, 0.1395985257951784, -0.019182729325762413, -0.04338687793906643, 0.03107788087136638, -0.11876659539953892, 0.15175629561462975, 0.333069761900154, 0.1635539216348911, 0.28721699420027336, -0.4286723965602514, -0.1467782735843887, 0.10740943320446594, 0.09419784265681329, 0.032165208552756536, 0.003974300296494612, -0.34606446285244713, 0.08346213782543963, -0.20254125620764463, -0.051465313037172195, -0.16136893250743034, -0.005291970859286544, 0.039609819335785786, -0.2821655282874379, -0.030062614605940608, 0.1467491879086903, 0.05992642175309707, -0.04697823892178622, -0.06463691352509503, -0.0025582385136036522, 0.0605621181676946, -0.018550647901602747, 0.005560882805745296, 0.11003530654516988, -0.056635443253896245, -0.1737455062934926, 0.355171183881789, -0.0813841534035951, -0.25914985696191617, 0.1745998658411147, -0.10105213191640114, -0.15668381122785374, 0.06062930120502652, 0.11435512115773527, 0.13029110659435006, -0.12141554066314184, 0.1612941964380241, -0.0866886128359619, 0.10466556531109321, 0.11372557440965674, 0.02309216751591568, 0.15567483325848366, 0.14186297408835913, 0.06482978225709783, 0.16080417852050147, 0.010403137810895018, -0.15712086254805616, -0.3390307390936916, -0.156978774918943, -0.10633209622296182, 0.02649279739321668, -0.12347393212906312, -0.19286833944069368, 0.368372851570132, 0.17324023541796546, 0.16610000157424784, 0.14986239945747615, 0.25919128432170213, 0.12835565131999688, 0.0474717200473144, 0.0672365123734187, 0.12176470744207626, 0.17604104106053903, 0.03674522466195139, -0.1108964669730495, 0.057178984029421225, 0.17350344295695502] |
1,803.02652 | Solving large-scale general phase retrieval problems via a sequence of
convex relaxations | We present a convex relaxation-based algorithm for large-scale general phase
retrieval problems. General phase retrieval problems include i.a. the
estimation of the phase of the optical field in the pupil plane based on
intensity measurements of a point source recorded in the image (focal) plane.
The non-convex problem of finding the complex field that generates the correct
intensity is reformulated into a rank constraint problem. The nuclear norm is
used to obtain the convex relaxation of the phase retrieval problem. A new
iterative method, indicated as Convex Optimization-based Phase Retrieval
(COPR), is presented, with each iteration consisting of solving a convex
problem. In the noise-free case and for a class of phase retrieval problems the
solutions of the minimization problems converge linearly or faster towards a
correct solution. Since the solutions to nuclear norm minimization problems can
be computed using semidefinite programming, and this tends to be an expensive
optimization in terms of scalability, we provide a fast ADMM algorithm that
exploits the problem structure. The performance of the COPR algorithm is
demonstrated in a realistic numerical simulation study, demonstrating its
improvements in reliability and speed with respect to state-of-the-art methods.
| math.OC eess.SP | we present a convex relaxationbased algorithm for largescale general phase retrieval problems general phase retrieval problems include ia the estimation of the phase of the optical field in the pupil plane based on intensity measurements of a point source recorded in the image focal plane the nonconvex problem of finding the complex field that generates the correct intensity is reformulated into a rank constraint problem the nuclear norm is used to obtain the convex relaxation of the phase retrieval problem a new iterative method indicated as convex optimizationbased phase retrieval copr is presented with each iteration consisting of solving a convex problem in the noisefree case and for a class of phase retrieval problems the solutions of the minimization problems converge linearly or faster towards a correct solution since the solutions to nuclear norm minimization problems can be computed using semidefinite programming and this tends to be an expensive optimization in terms of scalability we provide a fast admm algorithm that exploits the problem structure the performance of the copr algorithm is demonstrated in a realistic numerical simulation study demonstrating its improvements in reliability and speed with respect to stateoftheart methods | [['we', 'present', 'a', 'convex', 'relaxationbased', 'algorithm', 'for', 'largescale', 'general', 'phase', 'retrieval', 'problems', 'general', 'phase', 'retrieval', 'problems', 'include', 'ia', 'the', 'estimation', 'of', 'the', 'phase', 'of', 'the', 'optical', 'field', 'in', 'the', 'pupil', 'plane', 'based', 'on', 'intensity', 'measurements', 'of', 'a', 'point', 'source', 'recorded', 'in', 'the', 'image', 'focal', 'plane', 'the', 'nonconvex', 'problem', 'of', 'finding', 'the', 'complex', 'field', 'that', 'generates', 'the', 'correct', 'intensity', 'is', 'reformulated', 'into', 'a', 'rank', 'constraint', 'problem', 'the', 'nuclear', 'norm', 'is', 'used', 'to', 'obtain', 'the', 'convex', 'relaxation', 'of', 'the', 'phase', 'retrieval', 'problem', 'a', 'new', 'iterative', 'method', 'indicated', 'as', 'convex', 'optimizationbased', 'phase', 'retrieval', 'copr', 'is', 'presented', 'with', 'each', 'iteration', 'consisting', 'of', 'solving', 'a', 'convex', 'problem', 'in', 'the', 'noisefree', 'case', 'and', 'for', 'a', 'class', 'of', 'phase', 'retrieval', 'problems', 'the', 'solutions', 'of', 'the', 'minimization', 'problems', 'converge', 'linearly', 'or', 'faster', 'towards', 'a', 'correct', 'solution', 'since', 'the', 'solutions', 'to', 'nuclear', 'norm', 'minimization', 'problems', 'can', 'be', 'computed', 'using', 'semidefinite', 'programming', 'and', 'this', 'tends', 'to', 'be', 'an', 'expensive', 'optimization', 'in', 'terms', 'of', 'scalability', 'we', 'provide', 'a', 'fast', 'admm', 'algorithm', 'that', 'exploits', 'the', 'problem', 'structure', 'the', 'performance', 'of', 'the', 'copr', 'algorithm', 'is', 'demonstrated', 'in', 'a', 'realistic', 'numerical', 'simulation', 'study', 'demonstrating', 'its', 'improvements', 'in', 'reliability', 'and', 'speed', 'with', 'respect', 'to', 'stateoftheart', 'methods']] | [-0.10545991424338094, -0.02163348865019904, -0.0789249586757573, 0.04992580783267619, -0.07481245605937802, -0.14019536135703445, 0.016625087943529248, 0.3919785013915133, -0.3257242615714117, -0.27793082509777467, 0.16134590089380269, -0.25425060588352766, -0.1560987924353747, 0.21573908277540887, -0.0928898454017072, 0.12307735955282287, 0.09833144836088337, 0.005741850471908778, -0.16678675137818716, -0.26954531565027695, 0.2576831277329278, 0.019662148989342824, 0.2678851147869691, 0.04031790383702154, 0.13198354773755586, 0.003983750908571498, 0.006634945872796591, 0.05622078946338247, -0.06900357855793407, 0.12551661855454935, 0.3114866945121398, 0.2156377167036885, 0.3055527429305825, -0.4002808649290018, -0.2034659537501515, 0.13641807753789834, 0.1472290245047401, 0.10284182524047397, -0.0872796764110693, -0.26043605817624776, 0.05765554785639757, -0.07629399162731947, -0.08210865600113437, -0.07095836155688164, -0.054342394614611905, 0.00455085314420993, -0.3409449483194664, 0.06575338440952162, 0.02987042541317543, 0.01825372452438666, -0.10393880508044272, -0.11510846351775976, 0.0776499027716459, 0.051481762680436964, 0.033021955521747706, 0.10543078923272708, 0.10311393631454656, -0.11787306012157055, -0.1319999941452234, 0.4210082936598353, -0.01844532154599037, -0.2313863401049896, 0.12518126198593232, -0.05239319285900189, -0.10883435882903912, 0.18543873657842005, 0.23330399740216934, 0.20154826706487847, -0.11557294226839163, 0.08111509449056857, -0.03804669596708168, 0.18274837693094187, 0.01860744928911565, -0.010409248659569553, 0.13418138667044263, 0.20364468521808113, 0.1724996029956158, 0.20716053828789247, -0.08225158307573231, -0.11476850291349427, -0.23973840204555363, -0.11880365260211485, -0.20799449876211978, -0.04618237540125847, -0.12971200635042301, -0.17720076552636566, 0.4087569552951704, 0.138499098280494, 0.16499559931141675, 0.07066602497386239, 0.3584372003478979, 0.1286512974873875, 0.017541109175278395, 0.09108517632607824, 0.230889039229917, 0.12773240763181573, 0.12647228703770058, -0.26653583677948783, 0.05394032348326787, 0.11337735643240786] |
1,803.02653 | On the Expressiveness and Monitoring of Metric Temporal Logic | It is known that Metric Temporal Logic (MTL) is strictly less expressive than
the Monadic First-Order Logic of Order and Metric (FO[<, +1]) when interpreted
over timed words; this remains true even when the time domain is bounded a
priori. In this work, we present an extension of MTL with the same expressive
power as FO[<, +1] over bounded timed words (and also, trivially, over
time-bounded signals). We then show that expressive completeness also holds in
the general (time-unbounded) case if we allow the use of rational constants $q
\in \mathbb{Q}$ in formulas. This extended version of MTL therefore yields a
definitive real-time analogue of Kamp's theorem. As an application, we propose
a trace-length independent monitoring procedure for our extension of MTL, the
first such procedure in a dense real-time setting.
| cs.LO | it is known that metric temporal logic mtl is strictly less expressive than the monadic firstorder logic of order and metric fo 1 when interpreted over timed words this remains true even when the time domain is bounded a priori in this work we present an extension of mtl with the same expressive power as fo 1 over bounded timed words and also trivially over timebounded signals we then show that expressive completeness also holds in the general timeunbounded case if we allow the use of rational constants q in mathbbq in formulas this extended version of mtl therefore yields a definitive realtime analogue of kamps theorem as an application we propose a tracelength independent monitoring procedure for our extension of mtl the first such procedure in a dense realtime setting | [['it', 'is', 'known', 'that', 'metric', 'temporal', 'logic', 'mtl', 'is', 'strictly', 'less', 'expressive', 'than', 'the', 'monadic', 'firstorder', 'logic', 'of', 'order', 'and', 'metric', 'fo', '1', 'when', 'interpreted', 'over', 'timed', 'words', 'this', 'remains', 'true', 'even', 'when', 'the', 'time', 'domain', 'is', 'bounded', 'a', 'priori', 'in', 'this', 'work', 'we', 'present', 'an', 'extension', 'of', 'mtl', 'with', 'the', 'same', 'expressive', 'power', 'as', 'fo', '1', 'over', 'bounded', 'timed', 'words', 'and', 'also', 'trivially', 'over', 'timebounded', 'signals', 'we', 'then', 'show', 'that', 'expressive', 'completeness', 'also', 'holds', 'in', 'the', 'general', 'timeunbounded', 'case', 'if', 'we', 'allow', 'the', 'use', 'of', 'rational', 'constants', 'q', 'in', 'mathbbq', 'in', 'formulas', 'this', 'extended', 'version', 'of', 'mtl', 'therefore', 'yields', 'a', 'definitive', 'realtime', 'analogue', 'of', 'kamps', 'theorem', 'as', 'an', 'application', 'we', 'propose', 'a', 'tracelength', 'independent', 'monitoring', 'procedure', 'for', 'our', 'extension', 'of', 'mtl', 'the', 'first', 'such', 'procedure', 'in', 'a', 'dense', 'realtime', 'setting']] | [-0.09690187461611043, 0.048043571389325385, -0.0648730665214302, 0.12413027200328056, -0.1364282421666638, -0.14959638768648223, 0.05273759034967642, 0.41217074098513107, -0.31189582847390873, -0.24345830894371337, 0.10432421738668092, -0.22256179086055405, -0.13255432354964952, 0.21868177842395742, -0.14416563700351687, 0.05062647327390868, 0.006166690599548724, 0.13816154944212283, -0.041758911274445726, -0.24234203740506788, 0.27811377850729363, -0.03389603677097448, 0.18977813165663748, 0.04536413433492299, 0.09568445249135758, 0.06696432608345798, 0.042211378213422475, 0.06749210825781951, -0.0779508891766539, 0.11631993634505342, 0.34012357574389424, 0.1967684465713502, 0.297319166145699, -0.3700252400870009, -0.1977028522230757, 0.17003418874923254, 0.12940027950604108, 0.06531911314638375, 0.00604205080326069, -0.25691155319159864, 0.12049133447743411, -0.22397333792186985, -0.06873989037360793, -0.10241182867524236, 0.06071868845326609, -0.01368418656101869, -0.2725255227315622, 0.01981353717486107, 0.23658947474792485, 0.09460893358544324, -0.08334537354016373, -0.05167344531365634, 0.0672928595197091, 0.06444310994553488, -0.0146117352450974, 0.044975571189970934, 0.03533896036778194, -0.06241765533674999, -0.16522500226851697, 0.3544130099182876, -0.11137666261735528, -0.207603254261636, 0.11513456715769026, -0.12414823643603297, -0.17780132466013898, 0.06460868913586461, 0.11740113033862538, 0.2034104816514508, -0.08518704366730345, 0.1300653900369973, -0.09113516755647554, 0.2784682512806743, 0.11740967240130398, 0.054078868690015415, 0.13719338288913344, 0.19164019114475034, 0.09904353884987302, 0.1979685777134096, 0.019814964340523232, -0.061567000611576925, -0.3252449440314117, -0.15131875668930309, -0.0885403043655462, 0.011833936459738617, -0.10482327238265822, -0.1678452110459465, 0.37504041934198185, 0.18219529181473362, 0.12298736548007921, 0.24671907346811175, 0.3606180662772972, 0.15646412706114496, 0.06155373231154079, 0.08499985426130105, 0.15126881713784018, 0.11073753237724304, 0.111486963268059, -0.13174165649224043, 0.09170095360108702, 0.07537372973851332] |
1,803.02654 | A General Mass Transference Principle | In this paper we prove a general form of the Mass Transference Principle for
$\limsup$ sets defined via neighbourhoods of sets satisfying a certain local
scaling property. Such sets include self-similar sets satisfying the open set
condition and smooth compact manifolds embedded in $\mathbb{R}^n$. Our main
result is applicable in locally compact metric spaces and allows one to
transfer Hausdorff $g$-measure statements to Hausdorff $f$-measure statements.
This work extends previous results of this type in several distinct directions.
| math.NT math.MG | in this paper we prove a general form of the mass transference principle for limsup sets defined via neighbourhoods of sets satisfying a certain local scaling property such sets include selfsimilar sets satisfying the open set condition and smooth compact manifolds embedded in mathbbrn our main result is applicable in locally compact metric spaces and allows one to transfer hausdorff gmeasure statements to hausdorff fmeasure statements this work extends previous results of this type in several distinct directions | [['in', 'this', 'paper', 'we', 'prove', 'a', 'general', 'form', 'of', 'the', 'mass', 'transference', 'principle', 'for', 'limsup', 'sets', 'defined', 'via', 'neighbourhoods', 'of', 'sets', 'satisfying', 'a', 'certain', 'local', 'scaling', 'property', 'such', 'sets', 'include', 'selfsimilar', 'sets', 'satisfying', 'the', 'open', 'set', 'condition', 'and', 'smooth', 'compact', 'manifolds', 'embedded', 'in', 'mathbbrn', 'our', 'main', 'result', 'is', 'applicable', 'in', 'locally', 'compact', 'metric', 'spaces', 'and', 'allows', 'one', 'to', 'transfer', 'hausdorff', 'gmeasure', 'statements', 'to', 'hausdorff', 'fmeasure', 'statements', 'this', 'work', 'extends', 'previous', 'results', 'of', 'this', 'type', 'in', 'several', 'distinct', 'directions']] | [-0.15219321745770195, 0.049648466893137455, -0.056918355027356975, 0.1236448511093234, -0.07501043376918787, -0.09323216942497171, 0.038228048431054235, 0.33726543369583595, -0.28278866199513847, -0.18660045351880866, 0.08582540516120692, -0.2804068990131222, -0.08353170744764309, 0.2543544504397477, -0.17466925411150816, 0.07887176266656472, 0.07569858506739809, 0.026182336893935617, -0.06861980148973182, -0.2807362468746037, 0.46666416306144154, -0.11607839866804007, 0.2769462750532115, 0.08261278968973038, 0.09160973626272514, -0.03229418245311349, -0.0131705222496142, 0.08649942350502197, -0.19245689825560802, 0.1772264584642238, 0.2651863652027737, 0.1625862958190294, 0.2654261566632881, -0.3282380925539212, -0.18856040990123382, 0.1832162951252077, 0.10034706813689226, 0.007392713620972175, -0.013894138875632333, -0.3073029351922182, 0.13936731985841805, -0.09820856700818507, -0.21265986531328124, -0.08375471043519866, 0.03412734864291568, 0.01845320520731501, -0.2998630233371678, 0.039684027463245466, 0.17029444504385957, 0.046829998517074645, -0.12532343594312595, -0.07154675619527459, 0.02164034069611285, 0.1007749751353493, 0.00855888060043351, 0.1050456473723245, 0.09179544069756491, 0.056312328977629736, -0.12067144798885028, 0.34484647092624354, -0.03413214191842156, -0.28337254898491293, 0.21634959551887825, -0.16495756672408718, -0.21014008502093837, 0.05646465702627141, 0.1329401153862142, 0.1441822679629788, -0.1408201673378547, 0.16656359637197918, -0.11097150857154375, 0.07643503773187359, 0.1460433087956447, 0.07866827576221205, 0.10789745980396102, 0.14340381115937653, 0.17037843711053333, 0.13477295438030687, 0.04095215172482989, -0.05214222984683987, -0.3627809865328555, -0.14813374109470692, -0.1520668099222418, 0.1306812412236841, -0.14217217134584922, -0.20500255696690425, 0.3166599669941486, 0.09190504257686627, 0.20506642871082592, 0.16904949431474775, 0.22046944450658673, 0.03660662676441298, 0.016087412284925964, 0.11676297035330954, 0.11332295783676016, 0.15714395593087643, 0.02688579463089506, -0.05658702570228623, -0.0010904429647593927, 0.16496207796108836] |
1,803.02655 | Law equivalence of Ornstein--Uhlenbeck processes driven by a L\'evy
process | We demonstrate that two Ornstein--Uhlenbeck processes, that is, solutions to
certain stochastic differential equations that are driven by a L\'evy process L
have equivalent laws as long as the eigenvalues of the covariance operator
associated to the Wiener part of L are strictly positive. Moreover, we show
that in the case where the underlying L\'evy process is a purely jump process,
which means that neither it has a Wiener part nor the drift, the absolute
continuity of the law of one solution with respect to another forces equality
of the solutions almost surely.
| math.PR math.FA | we demonstrate that two ornsteinuhlenbeck processes that is solutions to certain stochastic differential equations that are driven by a levy process l have equivalent laws as long as the eigenvalues of the covariance operator associated to the wiener part of l are strictly positive moreover we show that in the case where the underlying levy process is a purely jump process which means that neither it has a wiener part nor the drift the absolute continuity of the law of one solution with respect to another forces equality of the solutions almost surely | [['we', 'demonstrate', 'that', 'two', 'ornsteinuhlenbeck', 'processes', 'that', 'is', 'solutions', 'to', 'certain', 'stochastic', 'differential', 'equations', 'that', 'are', 'driven', 'by', 'a', 'levy', 'process', 'l', 'have', 'equivalent', 'laws', 'as', 'long', 'as', 'the', 'eigenvalues', 'of', 'the', 'covariance', 'operator', 'associated', 'to', 'the', 'wiener', 'part', 'of', 'l', 'are', 'strictly', 'positive', 'moreover', 'we', 'show', 'that', 'in', 'the', 'case', 'where', 'the', 'underlying', 'levy', 'process', 'is', 'a', 'purely', 'jump', 'process', 'which', 'means', 'that', 'neither', 'it', 'has', 'a', 'wiener', 'part', 'nor', 'the', 'drift', 'the', 'absolute', 'continuity', 'of', 'the', 'law', 'of', 'one', 'solution', 'with', 'respect', 'to', 'another', 'forces', 'equality', 'of', 'the', 'solutions', 'almost', 'surely']] | [-0.10283817755345065, 0.1245348961242745, -0.10861975957028648, 0.06456915411554194, -0.09185516511300398, -0.12910513902804063, -0.009165924473074816, 0.3656675364141182, -0.3279992191381352, -0.18793559917912228, 0.17195648601233599, -0.3092212523183515, -0.17515946936703497, 0.17035988042311323, -0.05862654724548901, 0.06426111149090913, 0.022216542243396722, 0.051046124499251125, 0.013142492449391753, -0.20942162724352012, 0.3686396904059395, 0.015867645321514016, 0.20720008213663854, -0.033721321828222725, 0.17144064969753706, -0.06067912123836978, -0.04379684066960728, 0.008872023292927331, -0.10670724728901092, 0.055415047492872, 0.1934275267976186, 0.05269215578433647, 0.3191603573980511, -0.3629060161640487, -0.17598905257620318, 0.17354878813268676, 0.13492825850237272, 0.013385421279767749, -0.013636253894336762, -0.2599239225414211, 0.10480863297788767, -0.13688076033146793, -0.16452323788306325, -0.034252743845084505, 0.0759100690033407, 0.07007279737241646, -0.3134430194453847, 0.09911613766058919, 0.18697383797537254, -0.005638832181331611, -0.07288294890144419, -0.0890693343294564, -0.04162405374189539, 0.09014041056375831, 0.06562014903669165, -0.029437993464100184, 0.12767874914652078, -0.07556397773285387, -0.13866261411858824, 0.32790991893258464, -0.11035753132134515, -0.2973999272411068, 0.16779684261869518, -0.20072556655072876, -0.0868599636740582, 0.15153906905963535, 0.08462497025167429, 0.10743528223630625, -0.19515224124595362, 0.1545309511423912, -0.0186025895358574, 0.12131589999477509, 0.05349439301437909, -0.004665193313191976, 0.10416819570305687, 0.09663640456123938, 0.18883903535153035, 0.1130628012401122, 0.002154530701352664, -0.1661450759387545, -0.3836235460895364, -0.17912605973661586, -0.20615433843465902, 0.11197592207322633, -0.099101777272349, -0.22656468967456492, 0.3207217480884665, 0.11832632588082424, 0.1934448690404014, 0.0941665708800898, 0.22921385547967368, 0.24055999411039694, 0.011436074371299437, 0.054176392021178396, 0.18613602737745932, 0.17543848149318209, 0.1256848482955848, -0.18078666617993705, 0.11192746721308237, 0.0859740770732363] |
1,803.02656 | Study of the $B_{s}$ ${\to}$ ${\phi}f_{0}(980)$ ${\to}$
${\phi}\,{\pi}^{+}{\pi}^{-}$ decay with perturbative QCD approach | The rare cascade $B_{s}$ ${\to}$ ${\phi}f_{0}(980)$ ${\to}$
${\phi}\,{\pi}^{+}{\pi}^{-}$ decay is studied with the perturbative QCD
approach based on the formula for the quasi two-body decay, where the two-pion
pair originates from the $S$-wave resonant $f_{0}(980)$ state. It is found that
with the introduction of the nonperturbative two-pion distribution amplitudes
and the Flatt\'{e} parameterization of the scalar form factor for the
$f_{0}(980)$ resonance, the branching ratio in the mass range 400 MeV $<$
$m({\pi}^{+}{\pi}^{-})$ $<$ 1600 MeV is ${\cal B}_{\rm theo}(B_{s}^{0}\,
{\to}\,{\phi}\,f_{0}(980)\,{\to}\,{\phi}\,{\pi}^{+}\,{\pi}^{-})$ $=$
$[1.31_{-0.31}^{+0.40}(a_{{\pi}{\pi}}){}_{-0.16}^{+0.19}(m_{b})
{}_{-0.09}^{+0.10}(\text{CKM})]{\times}10^{-6}$, where the uncertainties come
from the parameter $a_{{\pi}{\pi}}$ of the two-pion distribution amplitudes,
the $b$ quark mass $m_{b}$, the Cabibbo-Kobayashi-Maskawa (CKM) factors,
respectively. This result agrees with the recent LHCb measurement within
uncertainties, ${\cal B}_{\rm exp}(B_{s}^{0}\,{\to}\,{\phi}\,
f_{0}(980)\,{\to}\,{\phi}\,{\pi}^{+}\,{\pi}^{-})$ $=$
$(1.12{\pm}0.16^{+0.09}_{-0.08}{\pm}0.11){\times}10^{-6}$, where the errors are
statistical, systematic and from the normalization, respectively.
| hep-ph | the rare cascade b_s to phif_0980 to phipipi decay is studied with the perturbative qcd approach based on the formula for the quasi twobody decay where the twopion pair originates from the swave resonant f_0980 state it is found that with the introduction of the nonperturbative twopion distribution amplitudes and the flatte parameterization of the scalar form factor for the f_0980 resonance the branching ratio in the mass range 400 mev mpipi 1600 mev is cal b_rm theob_s0 tophif_0980tophipipi 131_031040a_pipi_016019m_b _009010textckmtimes106 where the uncertainties come from the parameter a_pipi of the twopion distribution amplitudes the b quark mass m_b the cabibbokobayashimaskawa ckm factors respectively this result agrees with the recent lhcb measurement within uncertainties cal b_rm expb_s0tophi f_0980tophipipi 112pm016009_008pm011times106 where the errors are statistical systematic and from the normalization respectively | [['the', 'rare', 'cascade', 'b_s', 'to', 'phif_0980', 'to', 'phipipi', 'decay', 'is', 'studied', 'with', 'the', 'perturbative', 'qcd', 'approach', 'based', 'on', 'the', 'formula', 'for', 'the', 'quasi', 'twobody', 'decay', 'where', 'the', 'twopion', 'pair', 'originates', 'from', 'the', 'swave', 'resonant', 'f_0980', 'state', 'it', 'is', 'found', 'that', 'with', 'the', 'introduction', 'of', 'the', 'nonperturbative', 'twopion', 'distribution', 'amplitudes', 'and', 'the', 'flatte', 'parameterization', 'of', 'the', 'scalar', 'form', 'factor', 'for', 'the', 'f_0980', 'resonance', 'the', 'branching', 'ratio', 'in', 'the', 'mass', 'range', '400', 'mev', 'mpipi', '1600', 'mev', 'is', 'cal', 'b_rm', 'theob_s0', 'tophif_0980tophipipi', '131_031040a_pipi_016019m_b', '_009010textckmtimes106', 'where', 'the', 'uncertainties', 'come', 'from', 'the', 'parameter', 'a_pipi', 'of', 'the', 'twopion', 'distribution', 'amplitudes', 'the', 'b', 'quark', 'mass', 'm_b', 'the', 'cabibbokobayashimaskawa', 'ckm', 'factors', 'respectively', 'this', 'result', 'agrees', 'with', 'the', 'recent', 'lhcb', 'measurement', 'within', 'uncertainties', 'cal', 'b_rm', 'expb_s0tophi', 'f_0980tophipipi', '112pm016009_008pm011times106', 'where', 'the', 'errors', 'are', 'statistical', 'systematic', 'and', 'from', 'the', 'normalization', 'respectively']] | [-0.08417485140827831, 0.24549365691717498, -0.06562964325724555, 0.09428090290243406, -0.03393531730831485, -0.08924331116944181, 0.05298094422179313, 0.2847598795740565, -0.1916081644671638, -0.2547050275000905, -0.05802525035856092, -0.33543710860862463, 0.00915320734070106, 0.13090269413030098, 0.09005146683578587, 0.1175394362639174, 0.08258756233594758, 0.048375333416899126, -0.111458238359533, -0.12747004130962958, 0.32541337301415846, 0.0067589616630041646, 0.210370807223453, 0.13220665388748296, -0.0456734801496356, -0.008331328092627844, -0.02045719047685054, -0.13842557969672437, -0.17258835311678156, 0.03594186945148736, 0.1916988383923765, 0.0585971187669322, 0.11536486550765343, -0.26153932180070927, -0.07837845308875496, 0.10782834152837308, 0.15976055179460913, 0.07212323507040062, 0.04774023378017735, -0.3630768303828668, 0.0729974682696841, -0.2161877607957514, -0.09086118526141013, -0.0371352182316386, 0.05229649208640018, -0.08924949306163414, -0.38232310525765106, 0.1593340367602169, -0.06935828039615054, 0.0161795120855624, 0.03031448821786383, -0.2795549357802538, 0.004572469871953006, 0.03587589920633126, 0.1469060148262565, 0.12770139664981114, 0.19218241103178213, -0.13267985756955425, -0.0819123970077196, 0.4034532712366478, -0.07302773336991514, -0.1252241471093456, 0.050333531313645076, -0.20267732457588772, -0.14039117859653388, 0.17826174533625772, 0.14394918317552502, 0.038327042509855566, -0.18453554034787267, 0.12939524541181813, -0.014989505691284483, 0.20132225300454773, 0.08279679113929737, 0.052688983819362795, 0.1623289133922374, 0.16440042127924395, -0.058333664562953406, 0.018809094932699992, -0.13823581391691483, -0.11159336070091394, -0.408870442223943, -0.03492199524097945, -0.09898245242551308, 0.08659249303231309, -0.11084867309954995, -0.11383248430345792, 0.3470826527115327, 0.07736219177099544, 0.2942888411608609, 0.03387693829126348, 0.31404228951812774, 0.14935315067471922, 0.07690088319099578, 0.07304471649791398, 0.34687218999813413, 0.2561103538190321, 0.0966040803973894, -0.3149100189301193, 0.01971971414202039, 0.041260394775732] |
1,803.02657 | ASAP: Accelerated Short-Read Alignment on Programmable Hardware | The proliferation of high-throughput sequencing machines ensures rapid
generation of up to billions of short nucleotide fragments in a short period of
time. This massive amount of sequence data can quickly overwhelm today's
storage and compute infrastructure. This paper explores the use of hardware
acceleration to significantly improve the runtime of short-read alignment, a
crucial step in preprocessing sequenced genomes. We focus on the Levenshtein
distance (edit-distance) computation kernel and propose the ASAP accelerator,
which utilizes the intrinsic delay of circuits for edit-distance computation
elements as a proxy for computation. Our design is implemented on an Xilinx
Virtex 7 FPGA in an IBM POWER8 system that uses the CAPI interface for cache
coherence across the CPU and FPGA. Our design is $200\times$ faster than the
equivalent C implementation of the kernel running on the host processor and
$2.2\times$ faster for an end-to-end alignment tool for 120-150 base-pair
short-read sequences. Further the design represents a $3760\times$ improvement
over the CPU in performance/Watt terms.
| cs.DC cs.AR | the proliferation of highthroughput sequencing machines ensures rapid generation of up to billions of short nucleotide fragments in a short period of time this massive amount of sequence data can quickly overwhelm todays storage and compute infrastructure this paper explores the use of hardware acceleration to significantly improve the runtime of shortread alignment a crucial step in preprocessing sequenced genomes we focus on the levenshtein distance editdistance computation kernel and propose the asap accelerator which utilizes the intrinsic delay of circuits for editdistance computation elements as a proxy for computation our design is implemented on an xilinx virtex 7 fpga in an ibm power8 system that uses the capi interface for cache coherence across the cpu and fpga our design is 200times faster than the equivalent c implementation of the kernel running on the host processor and 22times faster for an endtoend alignment tool for 120150 basepair shortread sequences further the design represents a 3760times improvement over the cpu in performancewatt terms | [['the', 'proliferation', 'of', 'highthroughput', 'sequencing', 'machines', 'ensures', 'rapid', 'generation', 'of', 'up', 'to', 'billions', 'of', 'short', 'nucleotide', 'fragments', 'in', 'a', 'short', 'period', 'of', 'time', 'this', 'massive', 'amount', 'of', 'sequence', 'data', 'can', 'quickly', 'overwhelm', 'todays', 'storage', 'and', 'compute', 'infrastructure', 'this', 'paper', 'explores', 'the', 'use', 'of', 'hardware', 'acceleration', 'to', 'significantly', 'improve', 'the', 'runtime', 'of', 'shortread', 'alignment', 'a', 'crucial', 'step', 'in', 'preprocessing', 'sequenced', 'genomes', 'we', 'focus', 'on', 'the', 'levenshtein', 'distance', 'editdistance', 'computation', 'kernel', 'and', 'propose', 'the', 'asap', 'accelerator', 'which', 'utilizes', 'the', 'intrinsic', 'delay', 'of', 'circuits', 'for', 'editdistance', 'computation', 'elements', 'as', 'a', 'proxy', 'for', 'computation', 'our', 'design', 'is', 'implemented', 'on', 'an', 'xilinx', 'virtex', '7', 'fpga', 'in', 'an', 'ibm', 'power8', 'system', 'that', 'uses', 'the', 'capi', 'interface', 'for', 'cache', 'coherence', 'across', 'the', 'cpu', 'and', 'fpga', 'our', 'design', 'is', '200times', 'faster', 'than', 'the', 'equivalent', 'c', 'implementation', 'of', 'the', 'kernel', 'running', 'on', 'the', 'host', 'processor', 'and', '22times', 'faster', 'for', 'an', 'endtoend', 'alignment', 'tool', 'for', '120150', 'basepair', 'shortread', 'sequences', 'further', 'the', 'design', 'represents', 'a', '3760times', 'improvement', 'over', 'the', 'cpu', 'in', 'performancewatt', 'terms']] | [-0.17301601727303934, 0.0447233278299791, -0.022551254468271508, 0.02107268922991352, -0.029640891549934167, -0.15883913511934225, 0.07160427961425739, 0.40663938970537855, -0.2607669176359195, -0.3564465712675883, 0.08968044489593012, -0.2201591239514528, -0.08025660906132544, 0.2577571108646225, -0.07965683357269882, 0.06466539725734037, 0.14119838334247561, 0.009361633255321068, -0.040141126170965435, -0.29051902859282563, 0.17793959149566946, 0.11939652902074158, 0.30405225958966187, 0.027670595957897604, 0.10464361288395593, 0.00047764040500624104, -0.026520994382190112, -0.11945284929388436, -0.04519684105130182, 0.1815397090278566, 0.2489072342053987, 0.2172929850727087, 0.293323904229328, -0.4750939156394452, -0.11952719148248434, 0.07264890127553372, 0.18480506544583478, 0.0877799053232593, -0.04129542543159914, -0.22552929015946574, 0.13637281197516132, -0.20483837265564944, -0.0184087518196975, -0.05499748742440715, 0.05706646575272316, 0.016138609540939798, -0.2412060510894662, -0.0006872030848171562, 0.005283098854124546, 0.06287613687454723, 0.016721580520970745, -0.11309767071725219, 0.06171154398180079, 0.1299014160875231, -0.030033334878680762, 0.11229639912999119, 0.16886654564259515, -0.08351600120513467, -0.1433936381887179, 0.35265251419041305, -0.03973341405117026, -0.13645110219949858, 0.15611546000873205, 0.0011087386621511542, -0.14597920876112766, 0.11059827085118741, 0.2214684034261154, 0.07159438940288965, -0.16756522585637867, 0.059443477700187944, 0.07190791440953034, 0.27335130422143267, 0.08185168332856847, 0.05573220835395887, 0.14576908347662537, 0.286059988552006, 0.0813324305912829, 0.1612873139907606, -0.10543848574598087, -0.09387044335908286, -0.23882100085029379, -0.2290597656799946, -0.1893789792486132, 0.012990824889857321, -0.13171101283332973, -0.1669274005049374, 0.4026744469010737, 0.16844794387288858, 0.13106245305389166, 0.16049592751060118, 0.3634003307612147, 0.019876762858621076, 0.20872079847440544, 0.11967359004484024, 0.11782847975264303, 0.0229055975767551, 0.157329789672076, -0.2532735779299401, 0.09681716995255556, 0.04041111121623544] |
1,803.02658 | A priori bounds and multiplicity of solutions for an indefinite elliptic
problem with critical growth in the gradient | Let $\Omega \subset \mathbb R^N$, $N \geq 2$, be a smooth bounded domain. We
consider a boundary value problem of the form $$-\Delta u = c_{\lambda}(x) u +
\mu(x) |\nabla u|^2 + h(x), \quad u \in H^1_0(\Omega)\cap L^{\infty}(\Omega)$$
where $c_{\lambda}$ depends on a parameter $\lambda \in \mathbb R$, the
coefficients $c_{\lambda}$ and $h$ belong to $L^q(\Omega)$ with $q>N/2$ and
$\mu \in L^{\infty}(\Omega)$. Under suitable assumptions, but without imposing
a sign condition on any of these coefficients, we obtain an a priori upper
bound on the solutions. Our proof relies on a new boundary weak Harnack
inequality. This inequality, which is of independent interest, is established
in the general framework of the $p$-Laplacian. With this a priori bound at
hand, we show the existence and multiplicity of solutions.
| math.AP | let omega subset mathbb rn n geq 2 be a smooth bounded domain we consider a boundary value problem of the form delta u c_lambdax u mux nabla u2 hx quad u in h1_0omegacap linftyomega where c_lambda depends on a parameter lambda in mathbb r the coefficients c_lambda and h belong to lqomega with qn2 and mu in linftyomega under suitable assumptions but without imposing a sign condition on any of these coefficients we obtain an a priori upper bound on the solutions our proof relies on a new boundary weak harnack inequality this inequality which is of independent interest is established in the general framework of the plaplacian with this a priori bound at hand we show the existence and multiplicity of solutions | [['let', 'omega', 'subset', 'mathbb', 'rn', 'n', 'geq', '2', 'be', 'a', 'smooth', 'bounded', 'domain', 'we', 'consider', 'a', 'boundary', 'value', 'problem', 'of', 'the', 'form', 'delta', 'u', 'c_lambdax', 'u', 'mux', 'nabla', 'u2', 'hx', 'quad', 'u', 'in', 'h1_0omegacap', 'linftyomega', 'where', 'c_lambda', 'depends', 'on', 'a', 'parameter', 'lambda', 'in', 'mathbb', 'r', 'the', 'coefficients', 'c_lambda', 'and', 'h', 'belong', 'to', 'lqomega', 'with', 'qn2', 'and', 'mu', 'in', 'linftyomega', 'under', 'suitable', 'assumptions', 'but', 'without', 'imposing', 'a', 'sign', 'condition', 'on', 'any', 'of', 'these', 'coefficients', 'we', 'obtain', 'an', 'a', 'priori', 'upper', 'bound', 'on', 'the', 'solutions', 'our', 'proof', 'relies', 'on', 'a', 'new', 'boundary', 'weak', 'harnack', 'inequality', 'this', 'inequality', 'which', 'is', 'of', 'independent', 'interest', 'is', 'established', 'in', 'the', 'general', 'framework', 'of', 'the', 'plaplacian', 'with', 'this', 'a', 'priori', 'bound', 'at', 'hand', 'we', 'show', 'the', 'existence', 'and', 'multiplicity', 'of', 'solutions']] | [-0.19795952020626095, 0.05830477601052882, -0.02828974246362885, -0.01813141765606199, -0.11398548321543081, -0.215868690498023, 0.023328914949219796, 0.2953810419571856, -0.2964805983262317, -0.18661956470309488, 0.1308254775245704, -0.30342329780931676, -0.06384429950154416, 0.173499056944556, -0.07896071829412493, 0.03725266755152974, 0.035620874066221254, 0.11832542458714376, -0.07892767670273315, -0.2053702928223497, 0.36590973933738086, -0.17089867319971805, 0.17539336889110987, 0.12109129885427519, 0.08558037489907996, -0.03149514199392269, 0.06480685054444738, -0.04039034190505082, -0.293897045601625, 0.075534556330944, 0.1847515114312691, 0.08131253989191581, 0.30780272106940465, -0.37174556887288007, -0.15918812536138802, 0.22867766216457372, 0.1240728632960048, -0.048731452557295864, -0.024529635986020308, -0.3131811099817916, 0.11353558570995266, -0.046976020373779556, -0.18533790448770648, -0.01463639353131575, 0.09423777362662217, 0.048382256645709276, -0.4410522623708652, 0.1147619430595378, 0.10469106997780112, 0.023424395399248874, -0.10025222067751231, -0.16392475761559552, -0.01800913224935592, 0.0149742265554866, 0.012868389741690349, 0.15564999811073404, 0.020494087319445586, -0.08642423858550648, 0.004141384424010832, 0.32350621095317744, -0.12026923345852523, -0.3292775031389488, 0.09417104753552966, -0.19154966199740528, -0.16864351929736235, 0.03865859703716611, 0.12851666713569074, 0.20819331156587484, -0.08188242019124088, 0.29552164458859365, -0.11448826804858513, 0.1814890262941199, 0.11309876832209768, 0.022388217270828695, 0.0362300495767305, 0.08699698504736467, 0.1798559560613226, 0.08867427743802357, -0.00791567409290902, 0.008322567878020626, -0.4217596009726666, -0.1202239134140508, -0.184988597926173, 0.1743602639687578, -0.15182570098007883, -0.16312679148189002, 0.28512320595215107, 0.06132577085537055, 0.21529534609327394, 0.0721043301741555, 0.17925919697529846, 0.15711740578521013, -0.01114028312581321, 0.11785738942994466, 0.11470465971938064, 0.1304893225765667, 0.06596802593389105, -0.1792196715832688, 0.052251507714015225, 0.1664207511032967] |
1,803.02659 | Communicating Concurrent Processes | Process algebra CSP only permits a process to engage in one event on a moment
and records this single event into the traces of the process. CSP cannot
process events simultaneously, it treat the events occurred simultaneously as
one single event. We modify CSP to process the events occurred simultaneously,
which is called communicating concurrent processes (CCP).
| cs.LO | process algebra csp only permits a process to engage in one event on a moment and records this single event into the traces of the process csp cannot process events simultaneously it treat the events occurred simultaneously as one single event we modify csp to process the events occurred simultaneously which is called communicating concurrent processes ccp | [['process', 'algebra', 'csp', 'only', 'permits', 'a', 'process', 'to', 'engage', 'in', 'one', 'event', 'on', 'a', 'moment', 'and', 'records', 'this', 'single', 'event', 'into', 'the', 'traces', 'of', 'the', 'process', 'csp', 'can', 'not', 'process', 'events', 'simultaneously', 'it', 'treat', 'the', 'events', 'occurred', 'simultaneously', 'as', 'one', 'single', 'event', 'we', 'modify', 'csp', 'to', 'process', 'the', 'events', 'occurred', 'simultaneously', 'which', 'is', 'called', 'communicating', 'concurrent', 'processes', 'ccp']] | [-0.10708028884154969, 0.07236239804227933, -0.0681457482278347, 0.17310029898692, -0.15684961850337428, -0.12311310419042049, 0.13919325230406307, 0.39892521519856206, -0.3559528465286411, -0.3128131926059723, 0.10028974657099501, -0.30841905107432654, -0.04862391659668807, 0.1329444427211801, -0.06952100454283686, 0.0071687931275187895, 0.134218509698383, 0.07122566584690378, 0.04081839433839095, -0.23601712257569207, 0.28082696078666325, 0.07873667869716883, 0.25250788158255405, -0.04481822781361126, 0.18640201456909036, 0.10526225906154461, -0.019140814944844823, -0.06339397377752025, -0.004012381609786174, -0.023059573642716838, 0.267071961264672, 0.2490782620754607, 0.23482623783839418, -0.4783441750332713, -0.22062769283315745, 0.13557338107634206, 0.12304839450095234, 0.03875775072284059, -0.01996529446152071, -0.2754453795737234, 0.041211513336747885, -0.17942111839636646, -0.04062469780509328, 0.06068110661902305, 0.02350635049415046, -0.04202329866780803, -0.34477518057322193, 0.031919113697548365, 0.13848575218259518, -0.0625300205409013, 0.02395845975341468, 0.04973992083928194, -0.018052944463902508, 0.12554304496031896, 0.023595617467372935, -0.011910432355542636, 0.16967261878869913, -0.06533601073596369, -0.21674185842757338, 0.36426781426215993, 0.016483216345759815, -0.10405938340158298, 0.19659357145428658, -0.17203078602023167, -0.20446204471177068, 0.19531867158567084, 0.2202584226455154, 0.1662920255792038, -0.2578563419379422, 0.011339125318797948, 0.026173853989819, 0.16080745669274493, 0.04048626853056766, -0.050444900927310486, 0.22351079748879218, 0.18850898803693467, 0.017233109503085244, 0.13310322204428116, -0.07742544688717944, -0.12387702068121269, -0.2671815937963025, -0.16593873786643662, -0.09255422398062615, 0.00923780913907304, -0.016507167136045733, -0.1546384760596115, 0.38478737911370037, 0.17027849081807353, 0.23071459549125925, -0.03541026428012691, 0.25216528659301074, 0.1513945657322344, 0.17294892504939746, 0.007594009371602844, 0.12861630018672038, 0.020579268288766515, 0.15922217245277917, -0.11724395178141, 0.18718713358975947, 0.050605387467056] |
1,803.0266 | Synthesizing Power and Area Efficient Image Processing Pipelines on
FPGAs using Customized Bit-widths | High-level synthesis (HLS) has received significant attention in recent
years, improving programmability for FPGAs. PolyMage is a domain-specific
language (DSL) for image processing pipelines that also has a HLS backend to
translate the input DSL into an equivalent circuit that can be synthesized on
FPGAs, while leveraging an HLS suite. The data at each stage of a pipeline is
stored using a fixed-point data type (alpha,beta) where alpha and beta denote
the number of integral and fractional bits. The power and area savings while
performing arithmetic operations on fixed-point data type is known to be
significant over using floating point. In this paper, we first propose an
interval-arithmetic based range analysis (alpha-analysis) algorithm to estimate
the number of bits required to store the integral part of the data at each
stage of an image processing pipeline. The analysis algorithm uses the
homogeneity of pixel signals at each stage to cluster them and perform a
combined range analysis. Secondly, we propose a software architecture for
easily deploying any kind of interval/affine arithmetic based range analyses in
the DSL compiler. Thirdly, we propose a new range analysis technique using
Satisfiability Modulo Theory (SMT) solvers, and show that the range estimates
obtained through it are very close to the lower bounds obtained through
profile-driven analysis.We evaluated our bitwidth analysis algorithms on four
image processing benchmarks listed in the order of increasing complexity:
Unsharp Mask, Down-Up Sampling, Harris Corner Detection and Horn-Schunck
Optical Flow. For example, on Optical Flow, the interval analysis based
approach showed an 1.4x and 1.14x improvement on area and power metrics over
floating-point representation respectively; whereas the SMT solver based
approach showed 2.49x and 1.58x improvement on area and power metrics when
compared to interval analysis.
| cs.AR | highlevel synthesis hls has received significant attention in recent years improving programmability for fpgas polymage is a domainspecific language dsl for image processing pipelines that also has a hls backend to translate the input dsl into an equivalent circuit that can be synthesized on fpgas while leveraging an hls suite the data at each stage of a pipeline is stored using a fixedpoint data type alphabeta where alpha and beta denote the number of integral and fractional bits the power and area savings while performing arithmetic operations on fixedpoint data type is known to be significant over using floating point in this paper we first propose an intervalarithmetic based range analysis alphaanalysis algorithm to estimate the number of bits required to store the integral part of the data at each stage of an image processing pipeline the analysis algorithm uses the homogeneity of pixel signals at each stage to cluster them and perform a combined range analysis secondly we propose a software architecture for easily deploying any kind of intervalaffine arithmetic based range analyses in the dsl compiler thirdly we propose a new range analysis technique using satisfiability modulo theory smt solvers and show that the range estimates obtained through it are very close to the lower bounds obtained through profiledriven analysiswe evaluated our bitwidth analysis algorithms on four image processing benchmarks listed in the order of increasing complexity unsharp mask downup sampling harris corner detection and hornschunck optical flow for example on optical flow the interval analysis based approach showed an 14x and 114x improvement on area and power metrics over floatingpoint representation respectively whereas the smt solver based approach showed 249x and 158x improvement on area and power metrics when compared to interval analysis | [['highlevel', 'synthesis', 'hls', 'has', 'received', 'significant', 'attention', 'in', 'recent', 'years', 'improving', 'programmability', 'for', 'fpgas', 'polymage', 'is', 'a', 'domainspecific', 'language', 'dsl', 'for', 'image', 'processing', 'pipelines', 'that', 'also', 'has', 'a', 'hls', 'backend', 'to', 'translate', 'the', 'input', 'dsl', 'into', 'an', 'equivalent', 'circuit', 'that', 'can', 'be', 'synthesized', 'on', 'fpgas', 'while', 'leveraging', 'an', 'hls', 'suite', 'the', 'data', 'at', 'each', 'stage', 'of', 'a', 'pipeline', 'is', 'stored', 'using', 'a', 'fixedpoint', 'data', 'type', 'alphabeta', 'where', 'alpha', 'and', 'beta', 'denote', 'the', 'number', 'of', 'integral', 'and', 'fractional', 'bits', 'the', 'power', 'and', 'area', 'savings', 'while', 'performing', 'arithmetic', 'operations', 'on', 'fixedpoint', 'data', 'type', 'is', 'known', 'to', 'be', 'significant', 'over', 'using', 'floating', 'point', 'in', 'this', 'paper', 'we', 'first', 'propose', 'an', 'intervalarithmetic', 'based', 'range', 'analysis', 'alphaanalysis', 'algorithm', 'to', 'estimate', 'the', 'number', 'of', 'bits', 'required', 'to', 'store', 'the', 'integral', 'part', 'of', 'the', 'data', 'at', 'each', 'stage', 'of', 'an', 'image', 'processing', 'pipeline', 'the', 'analysis', 'algorithm', 'uses', 'the', 'homogeneity', 'of', 'pixel', 'signals', 'at', 'each', 'stage', 'to', 'cluster', 'them', 'and', 'perform', 'a', 'combined', 'range', 'analysis', 'secondly', 'we', 'propose', 'a', 'software', 'architecture', 'for', 'easily', 'deploying', 'any', 'kind', 'of', 'intervalaffine', 'arithmetic', 'based', 'range', 'analyses', 'in', 'the', 'dsl', 'compiler', 'thirdly', 'we', 'propose', 'a', 'new', 'range', 'analysis', 'technique', 'using', 'satisfiability', 'modulo', 'theory', 'smt', 'solvers', 'and', 'show', 'that', 'the', 'range', 'estimates', 'obtained', 'through', 'it', 'are', 'very', 'close', 'to', 'the', 'lower', 'bounds', 'obtained', 'through', 'profiledriven', 'analysiswe', 'evaluated', 'our', 'bitwidth', 'analysis', 'algorithms', 'on', 'four', 'image', 'processing', 'benchmarks', 'listed', 'in', 'the', 'order', 'of', 'increasing', 'complexity', 'unsharp', 'mask', 'downup', 'sampling', 'harris', 'corner', 'detection', 'and', 'hornschunck', 'optical', 'flow', 'for', 'example', 'on', 'optical', 'flow', 'the', 'interval', 'analysis', 'based', 'approach', 'showed', 'an', '14x', 'and', '114x', 'improvement', 'on', 'area', 'and', 'power', 'metrics', 'over', 'floatingpoint', 'representation', 'respectively', 'whereas', 'the', 'smt', 'solver', 'based', 'approach', 'showed', '249x', 'and', '158x', 'improvement', 'on', 'area', 'and', 'power', 'metrics', 'when', 'compared', 'to', 'interval', 'analysis']] | [-0.08870155127684438, -0.02729244371407747, -0.07442145020697653, 0.018122904593088268, -0.07787875416538408, -0.15855701479520048, 0.07623705107741238, 0.3989940420607619, -0.25686004022826897, -0.3666149376437575, 0.14747668453033239, -0.2589787671652933, -0.10677389993009367, 0.28337193019087276, -0.07854577479884028, 0.0946100012342509, 0.10438612092446575, 0.03276920159961561, -0.09031637330242435, -0.25954150857143504, 0.24461517167172483, 0.0585620502831154, 0.29816966383854815, -0.00028161856255704356, 0.11075787462200636, 0.005144712204734485, -0.04685867793430778, -0.018626613508222298, -0.07669678239581508, 0.14118995995421002, 0.2794601183433059, 0.1882354179797794, 0.28225448992316976, -0.41067191351565624, -0.17876172695462475, 0.08144878482739824, 0.14045394652633256, 0.05720752956722045, -0.05745237627618289, -0.2707884236836412, 0.127977643010547, -0.15885728884715333, -0.004829114731100779, -0.10094329351300581, -0.0021296923055470415, 0.0038639035457277864, -0.274044272195678, -0.02348809432345576, 0.05149709875945763, 0.10598534589806925, -0.02510333965001728, -0.1349346845804657, 0.03098735207980532, 0.11041419026761075, -0.013156818540593255, 0.08088209395760863, 0.1514680902273344, -0.09906231175341826, -0.1290212991141704, 0.34278056347295377, -0.06076291285573728, -0.17096530913465446, 0.12312619810369814, -0.05571230062522248, -0.1936414631510881, 0.1309729673487458, 0.21701234098570588, 0.08135261334695883, -0.12429469216584293, 0.08921099054075504, 0.008572363004248629, 0.2758625731958906, 0.07533662187083254, 0.0040006613447314205, 0.1740235041853668, 0.21429723416001112, 0.05325262993824498, 0.17059643264512755, -0.11430755803308543, -0.052801260564436195, -0.26911055486658453, -0.1500252464479069, -0.17688835261216032, -0.026771215005217813, -0.11352243336903575, -0.13545892806014373, 0.37969520571224363, 0.1660534197174173, 0.13192810291527873, 0.127931626451846, 0.3628015254580793, 0.1060251421933513, 0.1353422888391067, 0.105362964670531, 0.13815104998531333, 0.06499602112294872, 0.14115550169657823, -0.15722480002084688, 0.020285134854239134, 0.0849322721722626] |
1,803.02661 | Sketching for Principal Component Regression | Principal component regression (PCR) is a useful method for regularizing
linear regression. Although conceptually simple, straightforward
implementations of PCR have high computational costs and so are inappropriate
when learning with large scale data. In this paper, we propose efficient
algorithms for computing approximate PCR solutions that are, on one hand, high
quality approximations to the true PCR solutions (when viewed as minimizer of a
constrained optimization problem), and on the other hand entertain rigorous
risk bounds (when viewed as statistical estimators). In particular, we propose
an input sparsity time algorithms for approximate PCR. We also consider
computing an approximate PCR in the streaming model, and kernel PCR. Empirical
results demonstrate the excellent performance of our proposed methods.
| math.NA cs.DS cs.LG cs.NA | principal component regression pcr is a useful method for regularizing linear regression although conceptually simple straightforward implementations of pcr have high computational costs and so are inappropriate when learning with large scale data in this paper we propose efficient algorithms for computing approximate pcr solutions that are on one hand high quality approximations to the true pcr solutions when viewed as minimizer of a constrained optimization problem and on the other hand entertain rigorous risk bounds when viewed as statistical estimators in particular we propose an input sparsity time algorithms for approximate pcr we also consider computing an approximate pcr in the streaming model and kernel pcr empirical results demonstrate the excellent performance of our proposed methods | [['principal', 'component', 'regression', 'pcr', 'is', 'a', 'useful', 'method', 'for', 'regularizing', 'linear', 'regression', 'although', 'conceptually', 'simple', 'straightforward', 'implementations', 'of', 'pcr', 'have', 'high', 'computational', 'costs', 'and', 'so', 'are', 'inappropriate', 'when', 'learning', 'with', 'large', 'scale', 'data', 'in', 'this', 'paper', 'we', 'propose', 'efficient', 'algorithms', 'for', 'computing', 'approximate', 'pcr', 'solutions', 'that', 'are', 'on', 'one', 'hand', 'high', 'quality', 'approximations', 'to', 'the', 'true', 'pcr', 'solutions', 'when', 'viewed', 'as', 'minimizer', 'of', 'a', 'constrained', 'optimization', 'problem', 'and', 'on', 'the', 'other', 'hand', 'entertain', 'rigorous', 'risk', 'bounds', 'when', 'viewed', 'as', 'statistical', 'estimators', 'in', 'particular', 'we', 'propose', 'an', 'input', 'sparsity', 'time', 'algorithms', 'for', 'approximate', 'pcr', 'we', 'also', 'consider', 'computing', 'an', 'approximate', 'pcr', 'in', 'the', 'streaming', 'model', 'and', 'kernel', 'pcr', 'empirical', 'results', 'demonstrate', 'the', 'excellent', 'performance', 'of', 'our', 'proposed', 'methods']] | [-0.026417150952192582, -0.03686827722450312, -0.08621806843986368, 0.12121280020055099, -0.10049576965423349, -0.20308125564533994, 0.04431999831273356, 0.41417088305466193, -0.28826518694305014, -0.2874703925644231, 0.16350352060165194, -0.21736640920942155, -0.17682674415727967, 0.24135896829394704, -0.11298677058587982, 0.1575476387117663, 0.11379897059140424, 0.02404380050034095, -0.056710017254002966, -0.2528645344193961, 0.24000664615732992, 0.09705636883552513, 0.3276846417520418, 0.02479382701074848, 0.14363782753885335, -0.007616876624524593, -0.0030920366223296547, 0.013884131633477587, -0.0911423336144494, 0.17524257661977735, 0.34507216507584876, 0.16805737198959303, 0.36426309236667603, -0.4217601430753612, -0.19491238372686964, 0.142668091356217, 0.2039673091429803, 0.10764979948409092, -0.062011414010507554, -0.20353672690052763, 0.08923472762784451, -0.14461880799733165, -0.07094795558139937, -0.15604434782464024, -0.06100387535352483, 0.024329941727730453, -0.3282322187263232, 0.10839710429755565, 0.037194694635661274, 0.04556243090579907, -0.02997903294988677, -0.16777463919586605, 0.094442983605684, 0.06841262442862782, 0.09681714024458431, -0.01253514895693232, 0.13045186332116523, -0.1217955066006567, -0.1484421185251628, 0.3596100943704319, -0.08536174678856619, -0.2525861817024027, 0.1724026159594297, -0.009163593483340537, -0.19703850985612148, 0.09947158129583313, 0.21732704925677207, 0.13170717005880597, -0.13168367910242149, 0.09429097144404808, -0.027547918061096955, 0.13834214220858282, 0.03722108306032884, -0.012059110165056255, 0.08908979373816879, 0.20774845243431628, 0.12468724833347668, 0.1368804464706729, -0.06585742729819483, -0.05398004000576643, -0.25262078173203856, -0.13182476890456474, -0.20271320956257674, -0.03794680786533998, -0.16841459131770287, -0.21098145809020594, 0.3362854385955466, 0.1822707680746531, 0.19928085903933623, 0.13183638155380759, 0.39638675529605305, 0.1419913588424062, 0.03973313950750436, 0.12902875180340284, 0.2099826352065827, 0.07319580587661928, 0.03394231215342242, -0.1783501208266323, 0.10475285559430973, 0.041965588270567164] |
1,803.02662 | Double inverse nanotapers for efficient light coupling to integrated
photonic devices | Efficient light coupling into integrated photonic devices is of key
importance to a wide variety of applications. "Inverse nanotapers" are widely
used, in which the waveguide width is reduced to match an incident mode. Here,
we demonstrate novel, "double inverse" tapers, in which we taper both the
waveguide height, as well as the width. We demonstrate that in comparison to
regular inverse tapers, the double inverse tapers have excellent
polarization-independent coupling. In addition, the optimum coupling is
achieved with much larger taper dimension, enabling the use of photolithography
instead of electron beam lithography, relevant for applications at near-IR and
visible wavelengths. The low coupling loss makes them particularly suitable for
nonlinear photonics, e.g. supercontinuum and soliton micro-comb generation.
| physics.app-ph physics.optics | efficient light coupling into integrated photonic devices is of key importance to a wide variety of applications inverse nanotapers are widely used in which the waveguide width is reduced to match an incident mode here we demonstrate novel double inverse tapers in which we taper both the waveguide height as well as the width we demonstrate that in comparison to regular inverse tapers the double inverse tapers have excellent polarizationindependent coupling in addition the optimum coupling is achieved with much larger taper dimension enabling the use of photolithography instead of electron beam lithography relevant for applications at nearir and visible wavelengths the low coupling loss makes them particularly suitable for nonlinear photonics eg supercontinuum and soliton microcomb generation | [['efficient', 'light', 'coupling', 'into', 'integrated', 'photonic', 'devices', 'is', 'of', 'key', 'importance', 'to', 'a', 'wide', 'variety', 'of', 'applications', 'inverse', 'nanotapers', 'are', 'widely', 'used', 'in', 'which', 'the', 'waveguide', 'width', 'is', 'reduced', 'to', 'match', 'an', 'incident', 'mode', 'here', 'we', 'demonstrate', 'novel', 'double', 'inverse', 'tapers', 'in', 'which', 'we', 'taper', 'both', 'the', 'waveguide', 'height', 'as', 'well', 'as', 'the', 'width', 'we', 'demonstrate', 'that', 'in', 'comparison', 'to', 'regular', 'inverse', 'tapers', 'the', 'double', 'inverse', 'tapers', 'have', 'excellent', 'polarizationindependent', 'coupling', 'in', 'addition', 'the', 'optimum', 'coupling', 'is', 'achieved', 'with', 'much', 'larger', 'taper', 'dimension', 'enabling', 'the', 'use', 'of', 'photolithography', 'instead', 'of', 'electron', 'beam', 'lithography', 'relevant', 'for', 'applications', 'at', 'nearir', 'and', 'visible', 'wavelengths', 'the', 'low', 'coupling', 'loss', 'makes', 'them', 'particularly', 'suitable', 'for', 'nonlinear', 'photonics', 'eg', 'supercontinuum', 'and', 'soliton', 'microcomb', 'generation']] | [-0.06732419577143076, 0.11232515953797394, -0.007247395908175889, 0.03418587854672697, -0.08998384171804824, -0.20663521673640836, -0.00418915570382092, 0.5327678036134121, -0.28124340566938694, -0.28536425142596333, 0.08205810477325724, -0.25083533093980437, -0.12423615495800593, 0.29585990817601776, -0.01151684421051483, 0.1419472958600559, 0.02134347363706615, -0.08543981019786354, -0.025625862009523406, -0.12569523802874571, 0.23524226911239704, 0.09655241218742804, 0.3634816399751768, 0.08356584330539267, 0.10261240661917728, 0.043942917026362334, 0.025687460195652004, -0.056197489276370506, -0.10954417711967589, 0.13152361657249473, 0.2718930364906062, -0.013864425166857318, 0.24716355855639835, -0.3858473067787492, -0.21897554862455038, 0.05712370510544565, 0.20144432204836185, 0.10747546353574716, -0.08590241973840837, -0.20872764673746996, 0.07298123347277011, -0.11533798869715024, -0.13633453003631538, -0.033496378873616964, 0.014343734771423674, 0.00275172937614054, -0.29379668693705385, -0.018348096674051673, -0.001996086589731592, 0.020821287912332405, 0.03466705410675663, -0.08000284709431965, -0.02056785979726494, 0.04012160825886432, -0.05410653279928522, -0.0244995831054146, 0.1530230886542625, -0.14352870048063224, -0.10097397870770893, 0.362531879747097, -0.09737156664506706, -0.10760938716259137, 0.14925099548812704, -0.09677079416853641, 0.033563387623625034, 0.16115487279307286, 0.2027511295696752, 0.09960174764964287, -0.09176827185013789, 0.06630281658998051, 0.03353376634679419, 0.22494368235406986, 0.16219957235616522, 0.13022841293348977, 0.20001822033743138, 0.2316697788566856, 0.07782520800118603, 0.17363250073266484, -0.13421925790514205, -0.037046214800438515, -0.2684869986753595, -0.15637397943104034, -0.17406980297207572, 0.0419621252912586, -0.1166115248794332, -0.17517671565193746, 0.3929343976127773, 0.13682209470672374, 0.17038161140250957, -0.011379107728332154, 0.3386871649931043, 0.16526967163347656, 0.15396910943327693, -0.004830641480620509, 0.31341240576357915, 0.17536402185905284, 0.09983886553021937, -0.2307380695839144, -0.035842113911126884, -0.03651820934156619] |
1,803.02663 | Highly thermally stable sub-20nm magnetic random-access memory based on
perpendicular shape anisotropy | A new approach to increase the downsize scalability of perpendicular STT-MRAM
is presented. It consists in significantly increasing the thickness of the
storage layer in out-of-plane magnetized tunnel junctions (pMTJ) as compared to
conventional pMTJ in order to induce a perpendicular shape anisotropy (PSA) in
this layer. This PSA is obtained by depositing a thick ferromagnetic (FM) layer
on top of an MgO/FeCoB based magnetic tunnel junction (MTJ) so that the
thickness of the storage layer becomes of the order or larger than the diameter
of the MTJ pillar. In contrast to conventional spin transfer torque magnetic
random access memory (STT-MRAM) wherein the demagnetizing energy opposes the
interfacial perpendicular magnetic anisotropy (iPMA), in these novel memory
cells, both PSA and iPMA contributions favor out-of-plane orientation of the
storage layer magnetization. Using thicker storage layers in these PSA-STT-MRAM
has several advantages. Thanks to the PSA, very high and easily tunable thermal
stability factors can be achieved, even down to sub-10 nm diameters. Moreover,
low damping material can be used for the thick FM material thus leading to a
reduction of the write current. The paper describes this new PSA-STT-MRAM
concept, practical realization of such memory arrays, magnetic characterization
demonstrating thermal stability factor above 200 for MTJs as small as 8nm in
diameter and possibility to maintain thermal stability factor above 60 down to
4nm diameter.
| cond-mat.mtrl-sci | a new approach to increase the downsize scalability of perpendicular sttmram is presented it consists in significantly increasing the thickness of the storage layer in outofplane magnetized tunnel junctions pmtj as compared to conventional pmtj in order to induce a perpendicular shape anisotropy psa in this layer this psa is obtained by depositing a thick ferromagnetic fm layer on top of an mgofecob based magnetic tunnel junction mtj so that the thickness of the storage layer becomes of the order or larger than the diameter of the mtj pillar in contrast to conventional spin transfer torque magnetic random access memory sttmram wherein the demagnetizing energy opposes the interfacial perpendicular magnetic anisotropy ipma in these novel memory cells both psa and ipma contributions favor outofplane orientation of the storage layer magnetization using thicker storage layers in these psasttmram has several advantages thanks to the psa very high and easily tunable thermal stability factors can be achieved even down to sub10 nm diameters moreover low damping material can be used for the thick fm material thus leading to a reduction of the write current the paper describes this new psasttmram concept practical realization of such memory arrays magnetic characterization demonstrating thermal stability factor above 200 for mtjs as small as 8nm in diameter and possibility to maintain thermal stability factor above 60 down to 4nm diameter | [['a', 'new', 'approach', 'to', 'increase', 'the', 'downsize', 'scalability', 'of', 'perpendicular', 'sttmram', 'is', 'presented', 'it', 'consists', 'in', 'significantly', 'increasing', 'the', 'thickness', 'of', 'the', 'storage', 'layer', 'in', 'outofplane', 'magnetized', 'tunnel', 'junctions', 'pmtj', 'as', 'compared', 'to', 'conventional', 'pmtj', 'in', 'order', 'to', 'induce', 'a', 'perpendicular', 'shape', 'anisotropy', 'psa', 'in', 'this', 'layer', 'this', 'psa', 'is', 'obtained', 'by', 'depositing', 'a', 'thick', 'ferromagnetic', 'fm', 'layer', 'on', 'top', 'of', 'an', 'mgofecob', 'based', 'magnetic', 'tunnel', 'junction', 'mtj', 'so', 'that', 'the', 'thickness', 'of', 'the', 'storage', 'layer', 'becomes', 'of', 'the', 'order', 'or', 'larger', 'than', 'the', 'diameter', 'of', 'the', 'mtj', 'pillar', 'in', 'contrast', 'to', 'conventional', 'spin', 'transfer', 'torque', 'magnetic', 'random', 'access', 'memory', 'sttmram', 'wherein', 'the', 'demagnetizing', 'energy', 'opposes', 'the', 'interfacial', 'perpendicular', 'magnetic', 'anisotropy', 'ipma', 'in', 'these', 'novel', 'memory', 'cells', 'both', 'psa', 'and', 'ipma', 'contributions', 'favor', 'outofplane', 'orientation', 'of', 'the', 'storage', 'layer', 'magnetization', 'using', 'thicker', 'storage', 'layers', 'in', 'these', 'psasttmram', 'has', 'several', 'advantages', 'thanks', 'to', 'the', 'psa', 'very', 'high', 'and', 'easily', 'tunable', 'thermal', 'stability', 'factors', 'can', 'be', 'achieved', 'even', 'down', 'to', 'sub10', 'nm', 'diameters', 'moreover', 'low', 'damping', 'material', 'can', 'be', 'used', 'for', 'the', 'thick', 'fm', 'material', 'thus', 'leading', 'to', 'a', 'reduction', 'of', 'the', 'write', 'current', 'the', 'paper', 'describes', 'this', 'new', 'psasttmram', 'concept', 'practical', 'realization', 'of', 'such', 'memory', 'arrays', 'magnetic', 'characterization', 'demonstrating', 'thermal', 'stability', 'factor', 'above', '200', 'for', 'mtjs', 'as', 'small', 'as', '8nm', 'in', 'diameter', 'and', 'possibility', 'to', 'maintain', 'thermal', 'stability', 'factor', 'above', '60', 'down', 'to', '4nm', 'diameter']] | [-0.17203606816846453, 0.15785635006567517, 0.031200154604215907, -0.03285497634142178, -0.07517140205911271, -0.1456521040436782, 0.04775053305077243, 0.4076138496346831, -0.31268945192178227, -0.3643175058394296, 0.028445780314728362, -0.24000585053252166, -0.029623847594591003, 0.2169382085281607, -0.024579317077194855, 0.0151702580326577, -0.012628451653662644, -0.0494602044712599, -0.029078869701928745, -0.18536572982971747, 0.21308888530903006, 0.08810273196003889, 0.3579476085453205, 0.08670514221962321, 0.04403570775563518, -0.04435891108523595, 0.1188176442511788, 0.05427574870265918, -0.1235474214293278, 0.07062385226153348, 0.20764569666892604, -0.10809337348383788, 0.2095176496534485, -0.5032409993106643, -0.1793079073091684, -0.0252332103961747, 0.15699132517847705, 0.10634428127743219, -0.023064231253377924, -0.19885020772607565, 0.1412576670571311, -0.17852413329533962, -0.13696429664354143, -0.07731538362531033, -0.0024556715879164056, -0.007650839160600481, -0.27946472310856596, 0.04426634281695093, 0.10635369825846681, 0.06031153052109697, -0.04996229623089285, -0.15677132370927452, -0.05743266582982317, 0.06421886779236093, 0.03672046085168952, 0.07115899307066448, 0.22446209138055165, -0.12466798599949744, -0.0799775338183119, 0.29410322044538034, -0.047549553984496, -0.14860583083559525, 0.1434279898477646, -0.14128285382563868, -0.011053742224257014, 0.1664240308122956, 0.17492273770119637, 0.08866478005819103, -0.1442607260510096, 0.04048904451713302, 0.05707992861030377, 0.2224464979220488, 0.13026035313184062, 0.06460480489470405, 0.21262216340478288, 0.27552446438909667, 0.06586086001995628, 0.18957642788284343, -0.17749089480390493, -0.04300067320436273, -0.18117677900497908, -0.18637540351522908, -0.18462570118143745, 0.087042068694673, -0.1314561477569001, -0.17728144872389293, 0.36983864190116456, 0.18149354060490927, 0.17328893106439275, -0.03056026641577142, 0.34637943195013254, 0.062459213539562505, 0.17142449193272621, 0.04674697159385504, 0.2703882207643224, 0.19435354236398555, 0.1680761424156935, -0.24101865674224449, 0.10917820373803087, -0.05083209653406247] |
1,803.02664 | The Radius and Entropy of a Magnetized, Rotating Fully-convective Star:
Analysis With Depth-dependent Mixing Length Theories | Some low-mass stars appear to have larger radii than predicted by standard 1D
structure models; prior work has suggested that inefficient convective heat
transport, due to rotation and/or magnetism, may ultimately be responsible. We
examine this issue using 1D stellar models constructed using Modules for
Experiments in Stellar Astrophysics (MESA). First, we consider standard models
that do not explicitly include rotational/magnetic effects, with convective
inhibition modeled by decreasing a depth-independent mixing length theory (MLT)
parameter $\alpha_{\text{MLT}}$ (following Cox et al. 1981; Chabrier et al.
2007). We provide formulae linking changes in $\alpha_{\text{MLT}}$ to changes
in the interior specific entropy, and hence to the stellar radius. Next, we
modify the MLT formulation in MESA to mimic explicitly the influence of
rotation and magnetism, using formulations suggested by Stevenson (1979) and
MacDonald & Mullan (2014) respectively. We find rapid rotation in these models
has a negligible impact on stellar structure, primarily because a star's
adiabat, and hence its radius, is predominantly affected by layers near the
surface; convection is rapid and largely uninfluenced by rotation there.
Magnetic fields, if they influenced convective transport in the manner
described by MacDonald & Mullan (2014), could lead to more noticeable radius
inflation. Finally, we show that these non-standard effects on stellar
structure can be fabricated using a depth-dependent $\alpha_{\text{MLT}}$: a
non-magnetic, non-rotating model can be produced that is virtually
indistinguishable from one that explicitly parameterizes rotation and/or
magnetism using the two formulations above. We provide formulae linking the
radially-variable $\alpha_{\text{MLT}}$ to these putative MLT reformulations.
| astro-ph.SR | some lowmass stars appear to have larger radii than predicted by standard 1d structure models prior work has suggested that inefficient convective heat transport due to rotation andor magnetism may ultimately be responsible we examine this issue using 1d stellar models constructed using modules for experiments in stellar astrophysics mesa first we consider standard models that do not explicitly include rotationalmagnetic effects with convective inhibition modeled by decreasing a depthindependent mixing length theory mlt parameter alpha_textmlt following cox et al 1981 chabrier et al 2007 we provide formulae linking changes in alpha_textmlt to changes in the interior specific entropy and hence to the stellar radius next we modify the mlt formulation in mesa to mimic explicitly the influence of rotation and magnetism using formulations suggested by stevenson 1979 and macdonald mullan 2014 respectively we find rapid rotation in these models has a negligible impact on stellar structure primarily because a stars adiabat and hence its radius is predominantly affected by layers near the surface convection is rapid and largely uninfluenced by rotation there magnetic fields if they influenced convective transport in the manner described by macdonald mullan 2014 could lead to more noticeable radius inflation finally we show that these nonstandard effects on stellar structure can be fabricated using a depthdependent alpha_textmlt a nonmagnetic nonrotating model can be produced that is virtually indistinguishable from one that explicitly parameterizes rotation andor magnetism using the two formulations above we provide formulae linking the radiallyvariable alpha_textmlt to these putative mlt reformulations | [['some', 'lowmass', 'stars', 'appear', 'to', 'have', 'larger', 'radii', 'than', 'predicted', 'by', 'standard', '1d', 'structure', 'models', 'prior', 'work', 'has', 'suggested', 'that', 'inefficient', 'convective', 'heat', 'transport', 'due', 'to', 'rotation', 'andor', 'magnetism', 'may', 'ultimately', 'be', 'responsible', 'we', 'examine', 'this', 'issue', 'using', '1d', 'stellar', 'models', 'constructed', 'using', 'modules', 'for', 'experiments', 'in', 'stellar', 'astrophysics', 'mesa', 'first', 'we', 'consider', 'standard', 'models', 'that', 'do', 'not', 'explicitly', 'include', 'rotationalmagnetic', 'effects', 'with', 'convective', 'inhibition', 'modeled', 'by', 'decreasing', 'a', 'depthindependent', 'mixing', 'length', 'theory', 'mlt', 'parameter', 'alpha_textmlt', 'following', 'cox', 'et', 'al', '1981', 'chabrier', 'et', 'al', '2007', 'we', 'provide', 'formulae', 'linking', 'changes', 'in', 'alpha_textmlt', 'to', 'changes', 'in', 'the', 'interior', 'specific', 'entropy', 'and', 'hence', 'to', 'the', 'stellar', 'radius', 'next', 'we', 'modify', 'the', 'mlt', 'formulation', 'in', 'mesa', 'to', 'mimic', 'explicitly', 'the', 'influence', 'of', 'rotation', 'and', 'magnetism', 'using', 'formulations', 'suggested', 'by', 'stevenson', '1979', 'and', 'macdonald', 'mullan', '2014', 'respectively', 'we', 'find', 'rapid', 'rotation', 'in', 'these', 'models', 'has', 'a', 'negligible', 'impact', 'on', 'stellar', 'structure', 'primarily', 'because', 'a', 'stars', 'adiabat', 'and', 'hence', 'its', 'radius', 'is', 'predominantly', 'affected', 'by', 'layers', 'near', 'the', 'surface', 'convection', 'is', 'rapid', 'and', 'largely', 'uninfluenced', 'by', 'rotation', 'there', 'magnetic', 'fields', 'if', 'they', 'influenced', 'convective', 'transport', 'in', 'the', 'manner', 'described', 'by', 'macdonald', 'mullan', '2014', 'could', 'lead', 'to', 'more', 'noticeable', 'radius', 'inflation', 'finally', 'we', 'show', 'that', 'these', 'nonstandard', 'effects', 'on', 'stellar', 'structure', 'can', 'be', 'fabricated', 'using', 'a', 'depthdependent', 'alpha_textmlt', 'a', 'nonmagnetic', 'nonrotating', 'model', 'can', 'be', 'produced', 'that', 'is', 'virtually', 'indistinguishable', 'from', 'one', 'that', 'explicitly', 'parameterizes', 'rotation', 'andor', 'magnetism', 'using', 'the', 'two', 'formulations', 'above', 'we', 'provide', 'formulae', 'linking', 'the', 'radiallyvariable', 'alpha_textmlt', 'to', 'these', 'putative', 'mlt', 'reformulations']] | [-0.06319192911609932, 0.18385041545163433, -0.052898129291181276, 0.10326779306235882, -0.09649609454256308, -0.10597497322826127, 0.0337374765140561, 0.3732720147894044, -0.24739710619006822, -0.3523858297479952, 0.06843406246214105, -0.21420201910583953, -0.1474344008072181, 0.20411995053811877, -0.11004375622937138, -0.008304306813487329, 0.055815395457708895, -0.09044558263352573, -0.07847716233397765, -0.24079231659283604, 0.2985039753631151, 0.09139422249859123, 0.18896388364302721, 0.01632383790499402, 0.028587225450858723, -0.0760387949768057, -0.05696516070475639, 0.029476758840349997, -0.18476705855694794, 0.038834140364450265, 0.1949674610237944, 0.08339932650834989, 0.1982389737566085, -0.4558696841188835, -0.26894291303909906, 0.06883642259167462, 0.15811449268878233, 0.11051732392194188, -0.05640636515318335, -0.2223550549450868, 0.04783596857287637, -0.2004088935020145, -0.11978050814638656, -0.05556126916402481, 0.0516789941158812, -0.005327376054327299, -0.25039299742325316, 0.11823852399621552, 0.08302534218452591, 0.07313128030571209, -0.07975251130746465, -0.11961060245540296, -0.10394065102327585, 0.0691596058015598, 0.03606800866271634, 0.03269891220909672, 0.13978837253109408, -0.09159357122777832, -0.06939575846076988, 0.3441073401978739, -0.09859212086782308, -0.15222286294986745, 0.18628966124970617, -0.151313918509248, -0.10653687715795405, 0.08199425246774757, 0.16249497534803728, 0.11876557462629143, -0.13507636645841942, 0.06102357194757177, -0.03867839333578581, 0.16575467905854974, 0.09891157196285733, -0.04338306621354967, 0.28445411780167645, 0.11218798312555422, -0.02856632259795518, 0.055650926607507624, -0.11725286640060263, -0.09948599327789105, -0.2135027321793775, -0.08088116696373204, -0.112836522883092, 0.04291461719957425, -0.05177968255464485, -0.1551449885023985, 0.3329754092241259, 0.17114521045294803, 0.1813158332748808, 0.0027094197410302678, 0.24524117067902979, 0.11817248853120377, 0.11130379862625273, 0.14381834482773548, 0.2986610260593555, 0.19371717519030293, 0.08739255684770064, -0.2543767715723356, 0.11276769666621136, 0.08105248911306262] |
1,803.02665 | A Neural Network Approach to Missing Marker Reconstruction in Human
Motion Capture | Optical motion capture systems have become a widely used technology in
various fields, such as augmented reality, robotics, movie production, etc.
Such systems use a large number of cameras to triangulate the position of
optical markers.The marker positions are estimated with high accuracy. However,
especially when tracking articulated bodies, a fraction of the markers in each
timestep is missing from the reconstruction. In this paper, we propose to use a
neural network approach to learn how human motion is temporally and spatially
correlated, and reconstruct missing markers positions through this model. We
experiment with two different models, one LSTM-based and one time-window-based.
Both methods produce state-of-the-art results, while working online, as opposed
to most of the alternative methods, which require the complete sequence to be
known. The implementation is publicly available at
https://github.com/Svito-zar/NN-for-Missing-Marker-Reconstruction .
| cs.LG | optical motion capture systems have become a widely used technology in various fields such as augmented reality robotics movie production etc such systems use a large number of cameras to triangulate the position of optical markersthe marker positions are estimated with high accuracy however especially when tracking articulated bodies a fraction of the markers in each timestep is missing from the reconstruction in this paper we propose to use a neural network approach to learn how human motion is temporally and spatially correlated and reconstruct missing markers positions through this model we experiment with two different models one lstmbased and one timewindowbased both methods produce stateoftheart results while working online as opposed to most of the alternative methods which require the complete sequence to be known the implementation is publicly available at httpsgithubcomsvitozarnnformissingmarkerreconstruction | [['optical', 'motion', 'capture', 'systems', 'have', 'become', 'a', 'widely', 'used', 'technology', 'in', 'various', 'fields', 'such', 'as', 'augmented', 'reality', 'robotics', 'movie', 'production', 'etc', 'such', 'systems', 'use', 'a', 'large', 'number', 'of', 'cameras', 'to', 'triangulate', 'the', 'position', 'of', 'optical', 'markersthe', 'marker', 'positions', 'are', 'estimated', 'with', 'high', 'accuracy', 'however', 'especially', 'when', 'tracking', 'articulated', 'bodies', 'a', 'fraction', 'of', 'the', 'markers', 'in', 'each', 'timestep', 'is', 'missing', 'from', 'the', 'reconstruction', 'in', 'this', 'paper', 'we', 'propose', 'to', 'use', 'a', 'neural', 'network', 'approach', 'to', 'learn', 'how', 'human', 'motion', 'is', 'temporally', 'and', 'spatially', 'correlated', 'and', 'reconstruct', 'missing', 'markers', 'positions', 'through', 'this', 'model', 'we', 'experiment', 'with', 'two', 'different', 'models', 'one', 'lstmbased', 'and', 'one', 'timewindowbased', 'both', 'methods', 'produce', 'stateoftheart', 'results', 'while', 'working', 'online', 'as', 'opposed', 'to', 'most', 'of', 'the', 'alternative', 'methods', 'which', 'require', 'the', 'complete', 'sequence', 'to', 'be', 'known', 'the', 'implementation', 'is', 'publicly', 'available', 'at', 'httpsgithubcomsvitozarnnformissingmarkerreconstruction']] | [-0.04538693574275105, 0.05350553044655289, -0.0642736961097958, 0.06945391740166368, -0.08538040861379928, -0.17616436545952008, -0.032500383501442576, 0.44753248008111346, -0.2607043199833312, -0.36392404619031227, 0.11665770447401043, -0.28843251737371944, -0.15463289058265778, 0.18480422268800725, -0.10918576832717428, 0.07363673330177195, 0.1302599759127658, 0.05679819160141051, -0.01076153445487412, -0.23058511814675653, 0.25388236008584497, 0.023539516838410726, 0.2797619902600463, -0.026104714156379206, 0.1312934234057768, 0.019126124314677258, -0.04707583989365958, 0.027714906334697913, -0.04656119420072243, 0.1802150253313952, 0.3028777854458055, 0.158645733152158, 0.29546555620976367, -0.4341072579845786, -0.21466192393205485, 0.10418102244506232, 0.15127170611566937, 0.14575914045025667, -0.04260740011679725, -0.2927355939594026, 0.05255512770695182, -0.18244217291313153, -0.07795511907562076, -0.08690743312170246, -0.005317694801264084, 0.03432103839496939, -0.25394810950383545, 0.04576724758909012, -0.03143520619728056, 0.07595477274869783, -0.06400796215300664, -0.09899035042796571, 0.008275314616576697, 0.21563730516332166, 0.020753822032398044, 0.07628698860151836, 0.14490518010794542, -0.16600779034555532, -0.1389234863866407, 0.413493255371801, -0.04073255536719583, -0.2492147016267364, 0.2591732957149641, -0.08977738190800524, -0.1364471496691784, 0.12476031401624474, 0.22737478784357126, 0.14357590255900643, -0.1791049750527376, -0.03183395623883161, 0.001184417952138644, 0.17728522905650046, 0.039640308153600645, 0.04357277135221431, 0.2196511995477172, 0.21849586098060872, 0.03282987963444052, 0.09619113613242426, -0.14876611411858062, -0.06696805728312868, -0.2288329118504547, -0.11673020767406202, -0.17425687082398397, -0.03519086839917761, -0.03783225651367012, -0.18732417596396633, 0.3499839935021905, 0.24684303100220858, 0.22980514610042937, 0.042462806316997066, 0.37438648651139095, 0.028934258653316648, 0.11311446046456694, 0.057165275725464405, 0.19718697340800784, 0.0376988103469977, 0.12792854144130475, -0.13633703660094537, 0.08715653673817332, 0.026489927818497214] |
1,803.02666 | Smart Routing for Improved PLC Backhauling of the Radio Access Network | Transmission line theory enables the bottom up study of networks based on
wireline infrastructures. This technique is here applied to a simulator that
brings together powerline communication networks with small radio cells ones in
a hybrid paradigm: this allows to implement a study of channel capacity and
communication quality based on the geometrical properties of the network and
the type of cables employed to enable connectivity. Results are shown regarding
how deterministic properties related to performance in the network can be
retrieved and used to enable a smart routing algorithm.
| cs.NI | transmission line theory enables the bottom up study of networks based on wireline infrastructures this technique is here applied to a simulator that brings together powerline communication networks with small radio cells ones in a hybrid paradigm this allows to implement a study of channel capacity and communication quality based on the geometrical properties of the network and the type of cables employed to enable connectivity results are shown regarding how deterministic properties related to performance in the network can be retrieved and used to enable a smart routing algorithm | [['transmission', 'line', 'theory', 'enables', 'the', 'bottom', 'up', 'study', 'of', 'networks', 'based', 'on', 'wireline', 'infrastructures', 'this', 'technique', 'is', 'here', 'applied', 'to', 'a', 'simulator', 'that', 'brings', 'together', 'powerline', 'communication', 'networks', 'with', 'small', 'radio', 'cells', 'ones', 'in', 'a', 'hybrid', 'paradigm', 'this', 'allows', 'to', 'implement', 'a', 'study', 'of', 'channel', 'capacity', 'and', 'communication', 'quality', 'based', 'on', 'the', 'geometrical', 'properties', 'of', 'the', 'network', 'and', 'the', 'type', 'of', 'cables', 'employed', 'to', 'enable', 'connectivity', 'results', 'are', 'shown', 'regarding', 'how', 'deterministic', 'properties', 'related', 'to', 'performance', 'in', 'the', 'network', 'can', 'be', 'retrieved', 'and', 'used', 'to', 'enable', 'a', 'smart', 'routing', 'algorithm']] | [-0.1700076439456704, 0.022244879758606353, -0.07699053641926083, 0.005779039298714553, -0.10317301293058942, -0.19729018143067759, 0.11931482071134572, 0.4173283971225222, -0.26247465958197913, -0.29330041706562043, 0.08972097784022076, -0.2139928552039136, -0.23244058604921317, 0.24794361293315886, -0.12649513917147284, 0.09510581953864959, 0.05435969205573201, 0.01474222480578141, -0.003083591491708325, -0.21926417503919865, 0.28118601723884545, 0.09144513171373142, 0.37854311206998925, 0.0800065582514637, 0.03629391706652112, -0.026803619036864904, -0.03495817259988851, 0.024260287054090036, -0.10684164830058257, 0.19825427759076572, 0.25327663648252685, 0.15431795940320525, 0.2524273514644139, -0.4873496427097254, -0.2494792600058847, 0.06700416847856508, 0.1363662689174008, 0.07608306041155528, -0.008903551370733315, -0.27434531247450245, 0.13082169906637217, -0.18894810990637376, -0.10272515243721297, -0.07309402485067645, -0.08865600810903641, 0.06803589917512404, -0.2653518496909075, -0.03578596061302556, -0.024608325171801778, -0.0038590336321956582, 0.009205216973269773, -0.03986989513246549, 0.02812244552705023, 0.19575452989795142, -0.046226416321264376, -0.014311966427744158, 0.1301187539887097, -0.09772617960245245, -0.16801482204658288, 0.394308194787138, -0.0197621775066687, -0.19768782877880667, 0.19964137558579548, -0.018146018417448635, -0.12333406832897001, 0.11315266495156619, 0.2713183758314699, 0.05520933344378136, -0.19479765072464944, 0.02092246202713189, 0.022579732495877476, 0.20073423135197824, 0.019338614472912418, 0.08695246414281428, 0.14922830479271296, 0.22800983974917066, 0.09014074620273378, 0.16084633721168048, -0.10085880167316645, -0.09819496674463153, -0.18311946280300617, -0.13761044127556185, -0.17078583966940641, 0.042259536693907446, -0.05273386542636824, -0.1277599284008223, 0.40672209571219153, 0.19230297938920557, 0.16690027026666535, 0.08115537295945817, 0.3492302850690774, 0.029090731223631237, 0.1282895337169369, 0.10657399577709535, 0.19799375308470593, 0.16732482607993815, 0.19644864766030676, -0.185283614263042, 0.07555251790003645, 0.031946504843977486] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.