id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0776 | Decompositions of Bernstein-Sato polynomials and slices | Let $G$ be a linearly reductive group acting on a vector space $V$, and $f$ a
(semi-)invariant polynomial on $V$. In this paper we study systematically
decompositions of the Bernstein-Sato polynomial of $f$ in parallel with some
representation-theoretic properties of the action of $G$ on $V$. We provide a
technique based on a multiplicity one property, that we use to compute the
Bernstein-Sato polynomials of several classical invariants in an elementary
fashion. Furthermore, we derive a "slice method" which shows that the
decomposition of $V$ as a representation of $G$ can induce a decomposition of
the Bernstein-Sato polynomial of $f$ into a product of two Bernstein-Sato
polynomials - that of an ideal and that of a semi-invariant of smaller degree.
Using the slice method, we compute Bernstein-Sato polynomials for a large class
of semi-invariants of quivers.
| math.RT | let g be a linearly reductive group acting on a vector space v and f a semiinvariant polynomial on v in this paper we study systematically decompositions of the bernsteinsato polynomial of f in parallel with some representationtheoretic properties of the action of g on v we provide a technique based on a multiplicity one property that we use to compute the bernsteinsato polynomials of several classical invariants in an elementary fashion furthermore we derive a slice method which shows that the decomposition of v as a representation of g can induce a decomposition of the bernsteinsato polynomial of f into a product of two bernsteinsato polynomials that of an ideal and that of a semiinvariant of smaller degree using the slice method we compute bernsteinsato polynomials for a large class of semiinvariants of quivers | [['let', 'g', 'be', 'a', 'linearly', 'reductive', 'group', 'acting', 'on', 'a', 'vector', 'space', 'v', 'and', 'f', 'a', 'semiinvariant', 'polynomial', 'on', 'v', 'in', 'this', 'paper', 'we', 'study', 'systematically', 'decompositions', 'of', 'the', 'bernsteinsato', 'polynomial', 'of', 'f', 'in', 'parallel', 'with', 'some', 'representationtheoretic', 'properties', 'of', 'the', 'action', 'of', 'g', 'on', 'v', 'we', 'provide', 'a', 'technique', 'based', 'on', 'a', 'multiplicity', 'one', 'property', 'that', 'we', 'use', 'to', 'compute', 'the', 'bernsteinsato', 'polynomials', 'of', 'several', 'classical', 'invariants', 'in', 'an', 'elementary', 'fashion', 'furthermore', 'we', 'derive', 'a', 'slice', 'method', 'which', 'shows', 'that', 'the', 'decomposition', 'of', 'v', 'as', 'a', 'representation', 'of', 'g', 'can', 'induce', 'a', 'decomposition', 'of', 'the', 'bernsteinsato', 'polynomial', 'of', 'f', 'into', 'a', 'product', 'of', 'two', 'bernsteinsato', 'polynomials', 'that', 'of', 'an', 'ideal', 'and', 'that', 'of', 'a', 'semiinvariant', 'of', 'smaller', 'degree', 'using', 'the', 'slice', 'method', 'we', 'compute', 'bernsteinsato', 'polynomials', 'for', 'a', 'large', 'class', 'of', 'semiinvariants', 'of', 'quivers']] | [-0.2067865958782258, 0.05187992804222395, -0.16271497497886972, -0.0029908730553601074, -0.09734802242989342, -0.09542219604675968, -0.009103824625102182, 0.3470190807694086, -0.3403307599308728, -0.20950117081541705, 0.058225314022490274, -0.20777192876708728, -0.1693030717959455, 0.21670090014770352, -0.05455058455743172, -0.04042585954173571, 0.061817894524170296, 0.11249058879760991, -0.13201057270031286, -0.29305488706600885, 0.37553489169588794, -0.059191043802571515, 0.18503733580863035, 0.03094631003698817, 0.13070046887215642, 0.01373930027777398, -0.03092139551278066, 0.024146067566471176, -0.1526849568901256, 0.17326915301382542, 0.23805694489532875, 0.13341332867534625, 0.259397771064606, -0.3571273260370449, -0.09052740116560555, 0.20888044560949007, 0.15620456475902486, 0.009562512772606203, -0.028761271825405183, -0.21668765288260247, 0.12268201225885639, -0.177777234974632, -0.17387922246492019, -0.0839016639524036, 0.07513174613316854, 0.04203691668635993, -0.2935548381741952, -0.012519280964301691, 0.08524483448515335, 0.12917819427395308, -0.01627913862121878, -0.13398869314955342, -0.04217094021193959, 0.04462414986488444, -0.07382920799449225, 0.07036767402422373, 0.06639946670857845, -0.11223824559021052, -0.1393458724823884, 0.36591213018529944, -0.12362643409546258, -0.25377039398860046, 0.1180139743671235, -0.16341174008255754, -0.16773920501409859, 0.08713013389389272, 0.17951760600424474, 0.19638634256466672, -0.04493857035758319, 0.15799361187878444, -0.14831367606918017, 0.07775559197697375, 0.08683391522478175, 0.006859572826781206, 0.12853633629123645, 0.051217049103299224, 0.1001435233142089, 0.18604765470846799, -0.010815070307365171, 0.03484296361329379, -0.3498491711983526, -0.23014939766791132, -0.1787829871962054, 0.11547213884715112, -0.14292174464725477, -0.21728765914147652, 0.4712862324900925, 0.09603123854699165, 0.21296219612230305, 0.11497216996029709, 0.2309735919866297, 0.09545008999174806, 0.06800976296610854, 0.05580355373935567, 0.07167642960363689, 0.21088542653661635, -0.025783244237579682, -0.18276921165072255, -0.007712064019438845, 0.21352698253122745] |
1,802.07761 | A sharp boundedness result for restricted maximal operators of
Vilenkin-Fourier series on martingale Hardy spaces | The restricted maximal operators of partial sums with respect to bounded
Vilenkin systems are investigated. We derive the maximal subspace of positive
numbers, for which this operator is bounded from the Hardy space $%H_{p}$ to
the Lebesgue space $L_{p}$ for all $0<p\leq 1.$ We also prove that the result
is sharp in a particular sense.
| math.CA | the restricted maximal operators of partial sums with respect to bounded vilenkin systems are investigated we derive the maximal subspace of positive numbers for which this operator is bounded from the hardy space h_p to the lebesgue space l_p for all 0pleq 1 we also prove that the result is sharp in a particular sense | [['the', 'restricted', 'maximal', 'operators', 'of', 'partial', 'sums', 'with', 'respect', 'to', 'bounded', 'vilenkin', 'systems', 'are', 'investigated', 'we', 'derive', 'the', 'maximal', 'subspace', 'of', 'positive', 'numbers', 'for', 'which', 'this', 'operator', 'is', 'bounded', 'from', 'the', 'hardy', 'space', 'h_p', 'to', 'the', 'lebesgue', 'space', 'l_p', 'for', 'all', '0pleq', '1', 'we', 'also', 'prove', 'that', 'the', 'result', 'is', 'sharp', 'in', 'a', 'particular', 'sense']] | [-0.1398107004309581, 0.15213609800081362, 0.004255529188297012, 0.09899081038522788, -0.05452690073288977, -0.0897922267544676, 0.004284583362327381, 0.31840438361872325, -0.3469609090508046, -0.11045505021465943, 0.14789463651408866, -0.31360210725529625, -0.10702793511816046, 0.22216067458502947, -0.12026319662955674, 0.09356446518478069, 0.0021469288336282426, 0.10815888287668879, -0.1195016006134789, -0.2727579710158435, 0.4184957330877131, -0.07208164192058823, 0.1838861261409792, 0.05443769750947302, 0.10056549867784435, -0.04161772214045579, -0.01102777805856683, -0.012223174085374922, -0.21444047232732621, 0.17769341976805167, 0.2423583963377909, 0.10108475371433252, 0.3223322556777434, -0.3316395496272228, -0.16888946972110055, 0.2608959777704017, 0.15255612901157953, -0.027998588989827444, 0.016260771364481612, -0.2975618743507022, 0.11134203313426538, -0.11115153562277555, -0.16304408057846806, -0.09048786427487027, 0.057149926166642794, 0.045110201547768985, -0.34103451848707417, 0.0801091827235227, 0.1358655273406343, 0.03390546569346704, -0.15567571152509613, -0.13198398010043258, -0.005168632544915785, 0.0690347567115995, 0.0033934989690103316, 0.10537606093355201, 0.021354702072726054, -0.014066887862811035, -0.09131877837406302, 0.3273860121315176, -0.07242569670462135, -0.267498247528618, 0.09328674646941099, -0.2756321286951954, -0.1195381527597254, 0.06282091520049356, 0.0865559047596021, 0.17012236362153835, -0.06020795923065055, 0.22251179970970208, -0.13563220634717832, 0.10200901661406864, 0.10084575073454868, 0.11408946423537351, 0.001079590352971784, 0.02174244316887449, 0.23784890687939794, 0.1471310889517719, 0.005357726087888957, -0.07993494403463873, -0.3671107033098286, -0.18753383036025545, -0.19842303082219917, 0.05905653155324134, -0.11139840625745075, -0.19233132703229786, 0.317244581725787, 0.08933459030972286, 0.22419645962601698, 0.1576963105133142, 0.175927430679175, 0.16788160843266683, 0.027595970542593436, 0.06104253840802068, 0.17451113575900143, 0.18391343275593086, 0.05616704469377344, -0.13972482567399064, 0.009247999773784116, 0.19472550004879435] |
1,802.07762 | Aggregating the response in time series regression models, applied to
weather-related cardiovascular mortality | In environmental epidemiology studies, health response data (e.g.
hospitalization or mortality) are often noisy because of hospital organization
and other social factors. The noise in the data can hide the true signal
related to the exposure. The signal can be unveiled by performing a temporal
aggregation on health data and then using it as the response in regression
analysis. From aggregated series, a general methodology is introduced to
account for the particularities of an aggregated response in a regression
setting. This methodology can be used with usually applied regression models in
weather-related health studies, such as generalized additive models (GAM) and
distributed lag nonlinear models (DLNM). In particular, the residuals are
modelled using an autoregressive-moving average (ARMA) model to account for the
temporal dependence. The proposed methodology is illustrated by modelling the
influence of temperature on cardiovascular mortality in Canada. A comparison
with classical DLNMs is provided and several aggregation methods are compared.
Results show that there is an increase in the fit quality when the response is
aggregated, and that the estimated relationship focuses more on the outcome
over several days than the classical DLNM. More precisely, among various
investigated aggregation schemes, it was found that an aggregation with an
asymmetric Epanechnikov kernel is more suited for studying the
temperature-mortality relationship.
| stat.AP | in environmental epidemiology studies health response data eg hospitalization or mortality are often noisy because of hospital organization and other social factors the noise in the data can hide the true signal related to the exposure the signal can be unveiled by performing a temporal aggregation on health data and then using it as the response in regression analysis from aggregated series a general methodology is introduced to account for the particularities of an aggregated response in a regression setting this methodology can be used with usually applied regression models in weatherrelated health studies such as generalized additive models gam and distributed lag nonlinear models dlnm in particular the residuals are modelled using an autoregressivemoving average arma model to account for the temporal dependence the proposed methodology is illustrated by modelling the influence of temperature on cardiovascular mortality in canada a comparison with classical dlnms is provided and several aggregation methods are compared results show that there is an increase in the fit quality when the response is aggregated and that the estimated relationship focuses more on the outcome over several days than the classical dlnm more precisely among various investigated aggregation schemes it was found that an aggregation with an asymmetric epanechnikov kernel is more suited for studying the temperaturemortality relationship | [['in', 'environmental', 'epidemiology', 'studies', 'health', 'response', 'data', 'eg', 'hospitalization', 'or', 'mortality', 'are', 'often', 'noisy', 'because', 'of', 'hospital', 'organization', 'and', 'other', 'social', 'factors', 'the', 'noise', 'in', 'the', 'data', 'can', 'hide', 'the', 'true', 'signal', 'related', 'to', 'the', 'exposure', 'the', 'signal', 'can', 'be', 'unveiled', 'by', 'performing', 'a', 'temporal', 'aggregation', 'on', 'health', 'data', 'and', 'then', 'using', 'it', 'as', 'the', 'response', 'in', 'regression', 'analysis', 'from', 'aggregated', 'series', 'a', 'general', 'methodology', 'is', 'introduced', 'to', 'account', 'for', 'the', 'particularities', 'of', 'an', 'aggregated', 'response', 'in', 'a', 'regression', 'setting', 'this', 'methodology', 'can', 'be', 'used', 'with', 'usually', 'applied', 'regression', 'models', 'in', 'weatherrelated', 'health', 'studies', 'such', 'as', 'generalized', 'additive', 'models', 'gam', 'and', 'distributed', 'lag', 'nonlinear', 'models', 'dlnm', 'in', 'particular', 'the', 'residuals', 'are', 'modelled', 'using', 'an', 'autoregressivemoving', 'average', 'arma', 'model', 'to', 'account', 'for', 'the', 'temporal', 'dependence', 'the', 'proposed', 'methodology', 'is', 'illustrated', 'by', 'modelling', 'the', 'influence', 'of', 'temperature', 'on', 'cardiovascular', 'mortality', 'in', 'canada', 'a', 'comparison', 'with', 'classical', 'dlnms', 'is', 'provided', 'and', 'several', 'aggregation', 'methods', 'are', 'compared', 'results', 'show', 'that', 'there', 'is', 'an', 'increase', 'in', 'the', 'fit', 'quality', 'when', 'the', 'response', 'is', 'aggregated', 'and', 'that', 'the', 'estimated', 'relationship', 'focuses', 'more', 'on', 'the', 'outcome', 'over', 'several', 'days', 'than', 'the', 'classical', 'dlnm', 'more', 'precisely', 'among', 'various', 'investigated', 'aggregation', 'schemes', 'it', 'was', 'found', 'that', 'an', 'aggregation', 'with', 'an', 'asymmetric', 'epanechnikov', 'kernel', 'is', 'more', 'suited', 'for', 'studying', 'the', 'temperaturemortality', 'relationship']] | [-0.02959094801973108, 0.047102596955110564, -0.09710312678389961, 0.12486666563975936, -0.06068581979655262, -0.14247714342283352, 0.016908674479816997, 0.4141800565024217, -0.2559443688186418, -0.2897820414043963, 0.15397541780534776, -0.3005340025804582, -0.1872117177882631, 0.23076177056923153, -0.10248412433124723, 0.04504700780158774, 0.040679674366644276, 0.05053163406749566, -0.005968792199356748, -0.28048044934735766, 0.26155807171072365, 0.08269040162974436, 0.3290706101317136, -0.004208664731344297, 0.059165013476740566, 0.03564685891587509, -0.09104622451898953, 0.049802422847244, -0.07294801604830788, 0.11310669399598347, 0.29694605205064967, 0.1423080870149923, 0.3323912771374342, -0.4040927856362292, -0.27123517893432153, 0.1015699371030288, 0.09704021019438404, 0.059774547162288354, -0.018844194998451885, -0.28503802447729476, 0.03161845906426953, -0.17303809085417363, -0.05218445471033365, -0.08352828846712197, 0.0014787980466194096, 0.031070311629169043, -0.31190415480107603, 0.12295205691036591, 0.012693101894997415, 0.11811120962236255, -0.09726803735164659, -0.12210442032387835, -0.023256278672765585, 0.1380267457178672, 0.08015936697511712, -0.009458459070551076, 0.1321383992431774, -0.11565215837188242, -0.11320331572178041, 0.37588486242152397, -0.06088947826432386, -0.20824130695823226, 0.17449811910988675, -0.09054628982696505, -0.12205919944404048, 0.09992776433050278, 0.22136208555228742, 0.05563619868231139, -0.2081208131024531, -0.002387524987404634, -0.006998156523331999, 0.1974662182852626, 0.03932569068024999, -0.0379210042387491, 0.1475117771997161, 0.21651032200482276, 0.03329578584414863, 0.11019079689230282, -0.10809413871971801, -0.09273005033000595, -0.21765036191347809, -0.08334603247986663, -0.14547329835061515, 0.0033328670426271854, -0.11769277269562563, -0.140329419899111, 0.37471978599205613, 0.1690413713604877, 0.17460684559884526, 0.04637485520714628, 0.296994187157335, 0.1210215902521408, 0.0633960182955932, 0.057050093888704266, 0.17876396948427317, 0.0874055386803645, 0.09455840152943329, -0.19639023289284005, 0.17765425361382464, -0.034933598470386296] |
1,802.07763 | Neutrino oscillations: ILL experiment revisited | The ILL experiment, one of the "reactor anomaly" experiments, is re-examined.
ILL's baseline of 8.78 m is the shortest of the short baseline experiments, and
it is the experiment that finds the largest fraction of the electron
anti-neutrinos disappearing -- over 20%. Previous analyses, if they do not
ignore the ILL experiment, use functional forms for chisquare which are either
totally new and unjustified, are the magnitude chi-square (also termed a "rate
analysis"), or utilize a spectral form for chi-square which double counts the
systematic error. We do an analysis which utilizes the standard, conventional
form for chi-square as well as a derived form for a spectral chi-square.
Results for the ILL, Huber, and Daya Bay fluxes are given. We find that the
implications of the ILL experiment in providing evidence for a sterile, fourth
neutrino are significantly enhanced. Moreover, we find that the ILL experiment
provides a set of choices for specific values of the mass squared difference.
The value of the mass square difference for the deepest minimum and its
statistical significance, using the flux independent spectral chi-square and
the Huber or Daya Bay flux are 0.92 eV$^2$ and 2.9 $\sigma$; for the
conventional chi-square and the Daya Bay flux are 0.95 eV$^2$ and 3.0 $\sigma$;
and for the conventional chi-square and Huber flux are 0.90 eV$^2$ and 3.3
$\sigma$. These probabilities are significantly larger than the 1.8 $\sigma$
found for the ILL experiment using a rate analysis.
| hep-ph | the ill experiment one of the reactor anomaly experiments is reexamined ills baseline of 878 m is the shortest of the short baseline experiments and it is the experiment that finds the largest fraction of the electron antineutrinos disappearing over 20 previous analyses if they do not ignore the ill experiment use functional forms for chisquare which are either totally new and unjustified are the magnitude chisquare also termed a rate analysis or utilize a spectral form for chisquare which double counts the systematic error we do an analysis which utilizes the standard conventional form for chisquare as well as a derived form for a spectral chisquare results for the ill huber and daya bay fluxes are given we find that the implications of the ill experiment in providing evidence for a sterile fourth neutrino are significantly enhanced moreover we find that the ill experiment provides a set of choices for specific values of the mass squared difference the value of the mass square difference for the deepest minimum and its statistical significance using the flux independent spectral chisquare and the huber or daya bay flux are 092 ev2 and 29 sigma for the conventional chisquare and the daya bay flux are 095 ev2 and 30 sigma and for the conventional chisquare and huber flux are 090 ev2 and 33 sigma these probabilities are significantly larger than the 18 sigma found for the ill experiment using a rate analysis | [['the', 'ill', 'experiment', 'one', 'of', 'the', 'reactor', 'anomaly', 'experiments', 'is', 'reexamined', 'ills', 'baseline', 'of', '878', 'm', 'is', 'the', 'shortest', 'of', 'the', 'short', 'baseline', 'experiments', 'and', 'it', 'is', 'the', 'experiment', 'that', 'finds', 'the', 'largest', 'fraction', 'of', 'the', 'electron', 'antineutrinos', 'disappearing', 'over', '20', 'previous', 'analyses', 'if', 'they', 'do', 'not', 'ignore', 'the', 'ill', 'experiment', 'use', 'functional', 'forms', 'for', 'chisquare', 'which', 'are', 'either', 'totally', 'new', 'and', 'unjustified', 'are', 'the', 'magnitude', 'chisquare', 'also', 'termed', 'a', 'rate', 'analysis', 'or', 'utilize', 'a', 'spectral', 'form', 'for', 'chisquare', 'which', 'double', 'counts', 'the', 'systematic', 'error', 'we', 'do', 'an', 'analysis', 'which', 'utilizes', 'the', 'standard', 'conventional', 'form', 'for', 'chisquare', 'as', 'well', 'as', 'a', 'derived', 'form', 'for', 'a', 'spectral', 'chisquare', 'results', 'for', 'the', 'ill', 'huber', 'and', 'daya', 'bay', 'fluxes', 'are', 'given', 'we', 'find', 'that', 'the', 'implications', 'of', 'the', 'ill', 'experiment', 'in', 'providing', 'evidence', 'for', 'a', 'sterile', 'fourth', 'neutrino', 'are', 'significantly', 'enhanced', 'moreover', 'we', 'find', 'that', 'the', 'ill', 'experiment', 'provides', 'a', 'set', 'of', 'choices', 'for', 'specific', 'values', 'of', 'the', 'mass', 'squared', 'difference', 'the', 'value', 'of', 'the', 'mass', 'square', 'difference', 'for', 'the', 'deepest', 'minimum', 'and', 'its', 'statistical', 'significance', 'using', 'the', 'flux', 'independent', 'spectral', 'chisquare', 'and', 'the', 'huber', 'or', 'daya', 'bay', 'flux', 'are', '092', 'ev2', 'and', '29', 'sigma', 'for', 'the', 'conventional', 'chisquare', 'and', 'the', 'daya', 'bay', 'flux', 'are', '095', 'ev2', 'and', '30', 'sigma', 'and', 'for', 'the', 'conventional', 'chisquare', 'and', 'huber', 'flux', 'are', '090', 'ev2', 'and', '33', 'sigma', 'these', 'probabilities', 'are', 'significantly', 'larger', 'than', 'the', '18', 'sigma', 'found', 'for', 'the', 'ill', 'experiment', 'using', 'a', 'rate', 'analysis']] | [-0.04965639947845394, 0.14213399526378906, -0.049406485179308644, 0.17431714953844937, -0.030150319678537454, -0.1297839890549809, 0.08190055318550835, 0.32289961461955874, -0.18465364870525677, -0.34794432269292397, 0.12963340450886823, -0.3803461035596651, -0.06344000949372369, 0.22639026909725152, -0.04872049656833004, 0.0710774217470438, 0.08609580722828415, 0.03330642660538116, -0.1264711000774422, -0.20375939206294247, 0.24974625033158887, 0.11557196734169163, 0.2665698492566365, 0.030898388788624272, 0.074911114362275, -0.0446918386543193, -0.07342651564721407, 0.013829541891408016, -0.09743455118179067, 0.05935377618648642, 0.22430137830599364, 0.15161314841077217, 0.20384244972286614, -0.3448058154519694, -0.16177955417110582, 0.16321476536830223, 0.10467719015856293, 0.017370175473317973, -0.02188572649567322, -0.25620565246245103, 0.06166398579207986, -0.18334218636876026, -0.10225958895097997, -0.021876431954829762, -0.012089582089973792, 0.019047470005408365, -0.32255333637288736, 0.17227422620672012, 3.858983456293534e-05, 0.07036972598846862, -0.016987385710011623, -0.27853135136053525, 0.03327407578209018, 0.0598763869929217, 0.07381503421922359, 0.03885103572962736, 0.10348694379223222, -0.08388046567449073, -0.06993362050509337, 0.32874869593423034, -0.07469647201821725, -0.1594316709794447, 0.09939190499079277, -0.1780291373712872, -0.08351606233279264, 0.10470867910223651, 0.09316645770345397, 0.06662296819808468, -0.18283574721507073, 0.013525052527287218, -0.07399182973982898, 0.2006276279559289, 0.08897555928295439, -0.027090923550877735, 0.21716575441437785, 0.19361582750680556, 0.09692415262662092, 0.0037203131576758423, -0.2195398386374942, -0.05307417189133466, -0.33635799643714137, -0.11879886531126861, -0.12321640345147153, 0.058894027540400316, -0.09214977224029369, -0.12315780451232917, 0.37970239797774624, 0.09585048437755891, 0.18856832709467375, 0.09024236271514413, 0.2571550205614901, 0.09560396109234442, 0.06932703098749828, 0.0304220203460276, 0.30133631934945676, 0.11605753770261754, 0.0992562159979677, -0.22455199037397974, 0.04607989774260935, 0.024888162748599774] |
1,802.07764 | Integer Quantum Hall Effect in Graphene Channel with p-n Junction at
Domain Wall in Ferroelectric Substrate | We revealed that 180 degree ferroelectrics domain walls (FDWs) in a
ferroelectric substrate, which induce p-n junctions in a graphene channel, lead
to the nontrivial temperature and gate voltage dependences of the perpendicular
and parallel modes of the integer quantum Hall effect. In particular the number
of perpendicular modes v, corresponding to the p-n junction across the graphene
channel varies with gate voltage increase from small integers to higher
fractional numbers, e.g.v=1, 1.5, 2, ... 5.1,..9.1, 23 in the vicinity of the
transition from ferroelectric to paraelectric phase.These numbers and their
irregular sequence principally differ from the sequence of fractional numbers
v=1.5,2.5,... reported earlier. The origin of the unusual v-numbers is
significantly different numbers of the edge modes, v1 and v2, corresponding to
significantly different concentration of carriers in the left (n1) and right
(n1) domains of p-n junction boundary. The concentrations n1 and n2 are
determined by the gate voltage and polarization contributions, and so their
difference originates from the different direction of spontaneous polarization
in different domains of ferroelectric substrate. The difference between n1 and
n2 disappears with the vanishing of spontaneous polarization in a paraelectric
phase. The phase transition from the ferroelectric to paraelectric phase can
take place either with the temperature increase (temperature-induced phase
transition) or with the decrease of ferroelectric substrate thickness
(thickness-induced phase transition).
| cond-mat.mes-hall | we revealed that 180 degree ferroelectrics domain walls fdws in a ferroelectric substrate which induce pn junctions in a graphene channel lead to the nontrivial temperature and gate voltage dependences of the perpendicular and parallel modes of the integer quantum hall effect in particular the number of perpendicular modes v corresponding to the pn junction across the graphene channel varies with gate voltage increase from small integers to higher fractional numbers egv1 15 2 5191 23 in the vicinity of the transition from ferroelectric to paraelectric phasethese numbers and their irregular sequence principally differ from the sequence of fractional numbers v1525 reported earlier the origin of the unusual vnumbers is significantly different numbers of the edge modes v1 and v2 corresponding to significantly different concentration of carriers in the left n1 and right n1 domains of pn junction boundary the concentrations n1 and n2 are determined by the gate voltage and polarization contributions and so their difference originates from the different direction of spontaneous polarization in different domains of ferroelectric substrate the difference between n1 and n2 disappears with the vanishing of spontaneous polarization in a paraelectric phase the phase transition from the ferroelectric to paraelectric phase can take place either with the temperature increase temperatureinduced phase transition or with the decrease of ferroelectric substrate thickness thicknessinduced phase transition | [['we', 'revealed', 'that', '180', 'degree', 'ferroelectrics', 'domain', 'walls', 'fdws', 'in', 'a', 'ferroelectric', 'substrate', 'which', 'induce', 'pn', 'junctions', 'in', 'a', 'graphene', 'channel', 'lead', 'to', 'the', 'nontrivial', 'temperature', 'and', 'gate', 'voltage', 'dependences', 'of', 'the', 'perpendicular', 'and', 'parallel', 'modes', 'of', 'the', 'integer', 'quantum', 'hall', 'effect', 'in', 'particular', 'the', 'number', 'of', 'perpendicular', 'modes', 'v', 'corresponding', 'to', 'the', 'pn', 'junction', 'across', 'the', 'graphene', 'channel', 'varies', 'with', 'gate', 'voltage', 'increase', 'from', 'small', 'integers', 'to', 'higher', 'fractional', 'numbers', 'egv1', '15', '2', '5191', '23', 'in', 'the', 'vicinity', 'of', 'the', 'transition', 'from', 'ferroelectric', 'to', 'paraelectric', 'phasethese', 'numbers', 'and', 'their', 'irregular', 'sequence', 'principally', 'differ', 'from', 'the', 'sequence', 'of', 'fractional', 'numbers', 'v1525', 'reported', 'earlier', 'the', 'origin', 'of', 'the', 'unusual', 'vnumbers', 'is', 'significantly', 'different', 'numbers', 'of', 'the', 'edge', 'modes', 'v1', 'and', 'v2', 'corresponding', 'to', 'significantly', 'different', 'concentration', 'of', 'carriers', 'in', 'the', 'left', 'n1', 'and', 'right', 'n1', 'domains', 'of', 'pn', 'junction', 'boundary', 'the', 'concentrations', 'n1', 'and', 'n2', 'are', 'determined', 'by', 'the', 'gate', 'voltage', 'and', 'polarization', 'contributions', 'and', 'so', 'their', 'difference', 'originates', 'from', 'the', 'different', 'direction', 'of', 'spontaneous', 'polarization', 'in', 'different', 'domains', 'of', 'ferroelectric', 'substrate', 'the', 'difference', 'between', 'n1', 'and', 'n2', 'disappears', 'with', 'the', 'vanishing', 'of', 'spontaneous', 'polarization', 'in', 'a', 'paraelectric', 'phase', 'the', 'phase', 'transition', 'from', 'the', 'ferroelectric', 'to', 'paraelectric', 'phase', 'can', 'take', 'place', 'either', 'with', 'the', 'temperature', 'increase', 'temperatureinduced', 'phase', 'transition', 'or', 'with', 'the', 'decrease', 'of', 'ferroelectric', 'substrate', 'thickness', 'thicknessinduced', 'phase', 'transition']] | [-0.2021994826201106, 0.22743112893196293, -0.012545240459807008, -0.059101344932144875, -0.024889231021907703, -0.1573338703269783, 0.0924007785593586, 0.38713071017447753, -0.2955906861516099, -0.3092214718948458, 0.015921549828588163, -0.2981612926520947, -0.10543996307707314, 0.14157763689160172, 0.00957023005858586, -0.01872670317229719, -0.0828476681441469, -0.03709369579495462, -0.08322467921855511, -0.166375501164035, 0.26157648789165455, -0.08057731250137805, 0.31874829176574004, 0.06123305722052736, 0.029409862726178265, -0.08083972952080559, 0.10576119761322146, 0.010845678906330716, -0.12321540557526549, 0.011805192713199235, 0.24603070498870633, -0.0841777254057565, 0.15196418599007983, -0.47993207585896697, -0.14741363859013001, 0.06441133257966417, 0.12224301124518197, 0.12812111924987757, -0.029410713786916443, -0.2605014773538319, 0.08309661090008427, -0.09826023980522818, -0.10355448517208553, 0.018315965640489186, 0.054776458371056366, 0.017712429892619914, -0.240669270448035, 0.10775428130857159, 0.06664386893259187, 0.08948592269122949, -0.05174082673424594, -0.18422911637712913, -0.12540318857808816, 0.11659490527075424, 0.06701243647361156, 0.1074234801257534, 0.179888427744959, -0.12026864327120412, -0.12307966660238176, 0.3146548249419326, -0.035008438883532084, -0.10744920546103542, 0.13924027979972328, -0.2764906008471082, -0.027381516370713434, 0.21301098297041118, 0.10991809405299409, 0.11141493364912348, -0.05136758641548733, 0.07701073746848634, 0.08422583648467123, 0.18442807035633824, 0.14007147170916617, 0.07539177010331964, 0.22333090929270974, 0.11917703899350365, 0.03410985164788212, 0.19497903330451766, -0.12167854408111214, -0.059226912307056866, -0.26884488307078863, -0.15515942611322503, -0.19458422431652653, 0.06468799216542219, -0.14121794457285977, -0.1823840756121605, 0.4169403902846867, 0.12778767355512088, 0.18559021171330362, -0.028724628438216757, 0.23365250656329026, 0.1066740411812457, 0.06916759284778942, -0.014819107455784611, 0.2302590264877844, 0.1758744746857871, 0.1399714412933616, -0.30098686525794005, 0.06976712289457775, -0.01871243116193425] |
1,802.07765 | Quantum dynamics in sine-square deformed conformal field theory: Quench
from uniform to non-uniform CFTs | In this work, motivated by the sine-square deformation (SSD) for
(1+1)-dimensional quantum critical systems, we study the non-equilibrium
quantum dynamics of a conformal field theory (CFT) with SSD, which was recently
proposed to have continuous energy spectrum and continuous Virasoro algebra. In
particular, we study the time evolution of entanglement entropy after a quantum
quench from a uniform CFT, which is defined on a finite space of length $L$, to
a sine-square deformed CFT. We find there is a crossover time $t^{\ast}$ that
divides the entanglement evolution into two interesting regions. For $t\ll
t^{\ast}$, the entanglement entropy does not evolve in time; for $t\gg
t^{\ast}$, the entanglement entropy grows as $S_A(t)\simeq \frac{c}{3}\log t$,
which is independent of the lengths of the subsystem and the total system. This
$\log t$ growth with no revival indicates that a sine-square deformed CFT
effectively has an infinite length, in agreement with previous studies based on
the energy spectrum analysis. Furthermore, we study the quench dynamics for a
CFT with M$\ddot{\text{o}}$bius deformation, which interpolates between a
uniform CFT and a sine-square deformed CFT. The entanglement entropy oscillates
in time with period $L_{\text{eff}}=L\cosh(2\theta)$, with $\theta=0$
corresponding to the uniform case and $\theta\to \infty$ corresponding to the
SSD limit. Our field theory calculation is confirmed by a numerical study on a
(1+1)-d critical fermion chain.
| cond-mat.str-el hep-th | in this work motivated by the sinesquare deformation ssd for 11dimensional quantum critical systems we study the nonequilibrium quantum dynamics of a conformal field theory cft with ssd which was recently proposed to have continuous energy spectrum and continuous virasoro algebra in particular we study the time evolution of entanglement entropy after a quantum quench from a uniform cft which is defined on a finite space of length l to a sinesquare deformed cft we find there is a crossover time tast that divides the entanglement evolution into two interesting regions for tll tast the entanglement entropy does not evolve in time for tgg tast the entanglement entropy grows as s_atsimeq fracc3log t which is independent of the lengths of the subsystem and the total system this log t growth with no revival indicates that a sinesquare deformed cft effectively has an infinite length in agreement with previous studies based on the energy spectrum analysis furthermore we study the quench dynamics for a cft with mddottextobius deformation which interpolates between a uniform cft and a sinesquare deformed cft the entanglement entropy oscillates in time with period l_textefflcosh2theta with theta0 corresponding to the uniform case and thetato infty corresponding to the ssd limit our field theory calculation is confirmed by a numerical study on a 11d critical fermion chain | [['in', 'this', 'work', 'motivated', 'by', 'the', 'sinesquare', 'deformation', 'ssd', 'for', '11dimensional', 'quantum', 'critical', 'systems', 'we', 'study', 'the', 'nonequilibrium', 'quantum', 'dynamics', 'of', 'a', 'conformal', 'field', 'theory', 'cft', 'with', 'ssd', 'which', 'was', 'recently', 'proposed', 'to', 'have', 'continuous', 'energy', 'spectrum', 'and', 'continuous', 'virasoro', 'algebra', 'in', 'particular', 'we', 'study', 'the', 'time', 'evolution', 'of', 'entanglement', 'entropy', 'after', 'a', 'quantum', 'quench', 'from', 'a', 'uniform', 'cft', 'which', 'is', 'defined', 'on', 'a', 'finite', 'space', 'of', 'length', 'l', 'to', 'a', 'sinesquare', 'deformed', 'cft', 'we', 'find', 'there', 'is', 'a', 'crossover', 'time', 'tast', 'that', 'divides', 'the', 'entanglement', 'evolution', 'into', 'two', 'interesting', 'regions', 'for', 'tll', 'tast', 'the', 'entanglement', 'entropy', 'does', 'not', 'evolve', 'in', 'time', 'for', 'tgg', 'tast', 'the', 'entanglement', 'entropy', 'grows', 'as', 's_atsimeq', 'fracc3log', 't', 'which', 'is', 'independent', 'of', 'the', 'lengths', 'of', 'the', 'subsystem', 'and', 'the', 'total', 'system', 'this', 'log', 't', 'growth', 'with', 'no', 'revival', 'indicates', 'that', 'a', 'sinesquare', 'deformed', 'cft', 'effectively', 'has', 'an', 'infinite', 'length', 'in', 'agreement', 'with', 'previous', 'studies', 'based', 'on', 'the', 'energy', 'spectrum', 'analysis', 'furthermore', 'we', 'study', 'the', 'quench', 'dynamics', 'for', 'a', 'cft', 'with', 'mddottextobius', 'deformation', 'which', 'interpolates', 'between', 'a', 'uniform', 'cft', 'and', 'a', 'sinesquare', 'deformed', 'cft', 'the', 'entanglement', 'entropy', 'oscillates', 'in', 'time', 'with', 'period', 'l_textefflcosh2theta', 'with', 'theta0', 'corresponding', 'to', 'the', 'uniform', 'case', 'and', 'thetato', 'infty', 'corresponding', 'to', 'the', 'ssd', 'limit', 'our', 'field', 'theory', 'calculation', 'is', 'confirmed', 'by', 'a', 'numerical', 'study', 'on', 'a', '11d', 'critical', 'fermion', 'chain']] | [-0.15261072686777633, 0.21252807729533998, -0.12483107090588207, 0.031827961611474435, 0.01169342511533716, -0.1682556728575657, 0.0018610989927340333, 0.2987100801530738, -0.2128465533382738, -0.1976818534606528, 0.07415192759819939, -0.30659108888793074, -0.10619740140032476, 0.16299890896531744, -0.027494348452870396, 0.09321235663640513, 0.026708450366386048, 0.10471255146511003, -0.1392806028451109, -0.21893708011957982, 0.3105740120055624, 0.06041136565650857, 0.2957554915365023, 0.05338699512932206, 0.08105917415955913, 0.030134005956221198, 0.05648597848542344, 0.04160955902741173, -0.21612616470683352, 0.05218653033148045, 0.23195633480638683, 0.038228106516581754, 0.2150376975627738, -0.39656190091970367, -0.2551178061958211, 0.09245500604134645, 0.15340264255690136, 0.12289315332205984, -0.0023345559314284997, -0.2473496532004553, 0.028209423906633318, -0.18824282892605412, -0.12954378720029108, -0.05040294709876528, 0.07409563607201154, -0.07966555838955122, -0.2434941119646053, 0.12776326758691292, 0.0651511744439393, 0.060690862301815404, -0.050895028636642844, -0.002541846558168774, -0.06613041389468083, 0.08666880690453521, 0.06438402168313477, 0.09579141712399357, 0.1295435841056022, -0.10797812995526974, -0.10129489623027567, 0.27924393415102894, -0.06810723162021175, -0.1767417840381092, 0.16000411614327403, -0.1716863034732605, -0.14240752232139148, 0.09228576034324888, 0.07765483389125492, 0.12014992761852167, -0.08565988337999715, 0.17885177057436624, -0.05938003918103804, 0.19019550379478833, 0.04850428632382199, 0.049380704957716307, 0.22079957584702523, 0.1359491140334693, 0.06667856981533919, 0.22387249777789844, -0.033321013696987846, -0.1856221876664209, -0.3610321903235723, -0.18657235829072577, -0.2314100547336808, 0.12137374447537075, -0.11464912297881957, -0.1754082940022731, 0.3978378492359629, 0.11408803215209726, 0.22863096678868877, 0.0860541038286968, 0.19721638793495666, 0.15205554211148817, 0.07441143172763987, 0.1075906277357853, 0.18602907545342345, 0.14481100262355964, 0.10550641288456429, -0.3029406764947104, -0.04677217441967854, 0.13701741886760377] |
1,802.07766 | Charged Chiral Fermions from M5-Branes | We study M5-branes wrapped on a multi-centred Taub-NUT space. Reducing to
String Theory on the circle fibration leads to D4-branes intersecting with
D6-branes. D-braneology shows that there are additional charged chiral fermions
from the open strings which stretch between the D4-branes and D6-branes. From
the M-theory point of view the appearance of these charged states is mysterious
as the M5-branes are wrapped on a smooth manifold. In this paper we show how
these states arise in the M5-brane worldvolume theory and argue that are
governed by a WZWN-like model where the topological term is five-dimensional.
| hep-th | we study m5branes wrapped on a multicentred taubnut space reducing to string theory on the circle fibration leads to d4branes intersecting with d6branes dbraneology shows that there are additional charged chiral fermions from the open strings which stretch between the d4branes and d6branes from the mtheory point of view the appearance of these charged states is mysterious as the m5branes are wrapped on a smooth manifold in this paper we show how these states arise in the m5brane worldvolume theory and argue that are governed by a wzwnlike model where the topological term is fivedimensional | [['we', 'study', 'm5branes', 'wrapped', 'on', 'a', 'multicentred', 'taubnut', 'space', 'reducing', 'to', 'string', 'theory', 'on', 'the', 'circle', 'fibration', 'leads', 'to', 'd4branes', 'intersecting', 'with', 'd6branes', 'dbraneology', 'shows', 'that', 'there', 'are', 'additional', 'charged', 'chiral', 'fermions', 'from', 'the', 'open', 'strings', 'which', 'stretch', 'between', 'the', 'd4branes', 'and', 'd6branes', 'from', 'the', 'mtheory', 'point', 'of', 'view', 'the', 'appearance', 'of', 'these', 'charged', 'states', 'is', 'mysterious', 'as', 'the', 'm5branes', 'are', 'wrapped', 'on', 'a', 'smooth', 'manifold', 'in', 'this', 'paper', 'we', 'show', 'how', 'these', 'states', 'arise', 'in', 'the', 'm5brane', 'worldvolume', 'theory', 'and', 'argue', 'that', 'are', 'governed', 'by', 'a', 'wzwnlike', 'model', 'where', 'the', 'topological', 'term', 'is', 'fivedimensional']] | [-0.20173978504614645, 0.18553413092208806, -0.06170080508383997, 0.08262908614556035, -0.07415910597429962, -0.1703890862534203, 0.0018289550307697506, 0.3039636263143151, -0.1868898577547522, -0.26270240116664156, 0.07062360112335012, -0.3378140183205726, -0.20680273747852734, 0.08155960126739917, -0.15235718833382733, -0.038908554739268714, 0.01630656642498829, 0.021621395953960957, -0.0672584390818512, -0.24311878489110098, 0.41418195780246486, -0.04326305933782057, 0.27850816228617264, 0.09219524522702541, 0.1018667643669472, -0.02940647970003787, 0.03158386049651971, 0.0187655706255902, -0.12611770398131827, 0.15152479025600377, 0.22373969020742562, 0.04206815710862703, 0.010244258989890417, -0.5082375578261832, -0.22775561083108187, 0.06894563845488974, 0.21396054894793579, 0.15809327274215437, -0.007199212642116172, -0.31706590498847664, 0.052508143372633445, -0.0926483233148853, -0.1408515494887627, -0.0473413114581177, 0.0005538487626660255, -0.048706534316122374, -0.16324639164151683, 0.02200615132272604, 0.02237717584977227, 0.0379746926808229, -0.04354365481944975, -0.03776399159343333, -0.11862319297412591, 0.07702137362612511, 0.18976662806560715, 0.13062314348425516, 0.15042789247868363, -0.1646664890545791, -0.14491265321210509, 0.3241582787445476, -0.06273145908589965, -0.2704967315288721, 0.12656474150016264, -0.07566254549429462, -0.16554031825013538, 0.12166988647352624, 0.1026609188962167, 0.20185670951851994, -0.06845581203058201, 0.2347439739800569, -0.07673991111017042, 0.11422422130858796, 0.13704175235182847, 0.044981618056334154, 0.3529964860688935, 0.15190278375220875, 0.0702272027240245, 0.15456109223586897, -0.0835702562960045, -0.15929602671374557, -0.4266079413874816, -0.10824787814510606, -0.08239281184781062, 0.1980097182695904, -0.12645539198720437, -0.21280468962285468, 0.34934662626455387, 0.04741840096070401, 0.23027946361370624, 0.020291337023629376, 0.17348584680948206, 0.011028246702476135, 0.03899461361179028, 0.049041468800315936, 0.2025833475824085, 0.10570898963769357, 0.03859012043203718, -0.2109321330120707, -0.18942837608397328, 0.1967132285047042] |
1,802.07767 | HQET renormalization group improved Lagrangian at $\mathcal{O}(1/m^3)$
with leading logarithmic accuracy: Spin-dependent case | We obtain the renormalization group improved expressions of the Wilson
coefficients associated to the ${\cal O}(1/m^3)$ spin-dependent heavy quark
effective theory Lagrangian operators, with leading logarithmic approximation,
in the case of zero light quarks. We have employed the Coulomb gauge.
| hep-ph | we obtain the renormalization group improved expressions of the wilson coefficients associated to the cal o1m3 spindependent heavy quark effective theory lagrangian operators with leading logarithmic approximation in the case of zero light quarks we have employed the coulomb gauge | [['we', 'obtain', 'the', 'renormalization', 'group', 'improved', 'expressions', 'of', 'the', 'wilson', 'coefficients', 'associated', 'to', 'the', 'cal', 'o1m3', 'spindependent', 'heavy', 'quark', 'effective', 'theory', 'lagrangian', 'operators', 'with', 'leading', 'logarithmic', 'approximation', 'in', 'the', 'case', 'of', 'zero', 'light', 'quarks', 'we', 'have', 'employed', 'the', 'coulomb', 'gauge']] | [-0.13281343826092779, 0.2338791733956896, -0.13062878786586224, 0.1306192884221673, -0.048894817591644824, -0.1449227130971849, 0.061280463974253505, 0.3161943007260561, -0.1548959701322019, -0.214885859657079, -0.04378219122590963, -0.32657498512417077, -0.10862941523082555, 0.054758396768011156, 0.01588594471104443, 0.1212711394764483, -0.0010544979479163886, 0.06828938993276097, -0.17512920759618283, -0.27343097217381, 0.29918218372622507, -0.032707612961530685, 0.2161183330928907, 0.19090574730653315, 0.06723110057646409, 0.061175571905914695, -0.06992963943630456, -0.057423962745815516, -0.09268665388226509, 0.12770002358593047, 0.18352476341387955, -0.10128906164318323, 0.10848249499686062, -0.43488142509013417, -0.15208059485885314, 0.08882175631588325, 0.1780762264621444, 0.11478677921695635, -0.01745426980778575, -0.26001465611043384, 0.05185655723325908, -0.2602294776123017, -0.23979495176754426, -0.15258239300455897, -0.05003873276291415, -0.073018251452595, -0.3319370552431792, 0.07144339590668096, -0.0734545074403286, 0.038294085883535445, 0.005786619684658945, -0.1699062504223548, -0.020808654464781286, 0.06859155459096655, 0.13798490896006116, 0.06839311196235939, 0.12612626708578317, -0.19092731401324273, -0.08447802084265277, 0.42967793548014016, -0.18663088073953987, -0.2377824917435646, 0.09263824701774866, -0.16175822382792832, -0.11679179311031476, 0.09394072326595052, 0.19803890939801932, 0.1655205611939891, -0.1540409526322037, 0.2279171109665185, -0.05425837582442909, 0.04096614641603082, 0.08290409764740617, 0.08099629106000066, 0.1004499688744545, 0.04461201883386821, 0.030696532555157318, 0.06661601266823709, -0.0071542810430401, -0.13823805548017845, -0.38826601933687926, -0.06526216263882816, -0.05399597086943686, 0.06579998538363725, -0.19831201219931244, -0.16792126020882278, 0.4005946575991402, 0.11853867243044078, 0.16399202210013755, 0.030100402818061412, 0.21667315335944295, 0.24559372260700912, 0.1290419945726171, 0.06436311975121498, 0.25119448988698423, 0.24890397819690407, 0.07879634089767933, -0.33854833046207206, -0.09595522114541381, 0.2650766524253413] |
1,802.07768 | The fundamental Laplacian eigenvalue of the ellipse with Dirichlet
boundary conditions | In this project, I examine the lowest Dirichlet eigenvalue of the Laplacian
within the ellipse as a function of eccentricity. Two existing analytic
expansions of the eigenvalue are extended: Close to the circle (eccentricity
near zero) nine terms are added to the Maclaurin series; and near the infinite
strip (eccentricity near unity) four terms are added to the asymptotic
expansion. In the past, other methods, such as boundary variation techniques,
have been used to work on this problem, but I use a different approach -- which
not only offers independent confirmation of existing results, but extends them.
My starting point is a high precision computation of the eigenvalue for
selected values of eccentricity. These data are then fit to polynomials in
appropriate parameters yielding high-precision coefficients that are fed into
an LLL integer-relation algorithm with forms guided by prior results.
| math.NA | in this project i examine the lowest dirichlet eigenvalue of the laplacian within the ellipse as a function of eccentricity two existing analytic expansions of the eigenvalue are extended close to the circle eccentricity near zero nine terms are added to the maclaurin series and near the infinite strip eccentricity near unity four terms are added to the asymptotic expansion in the past other methods such as boundary variation techniques have been used to work on this problem but i use a different approach which not only offers independent confirmation of existing results but extends them my starting point is a high precision computation of the eigenvalue for selected values of eccentricity these data are then fit to polynomials in appropriate parameters yielding highprecision coefficients that are fed into an lll integerrelation algorithm with forms guided by prior results | [['in', 'this', 'project', 'i', 'examine', 'the', 'lowest', 'dirichlet', 'eigenvalue', 'of', 'the', 'laplacian', 'within', 'the', 'ellipse', 'as', 'a', 'function', 'of', 'eccentricity', 'two', 'existing', 'analytic', 'expansions', 'of', 'the', 'eigenvalue', 'are', 'extended', 'close', 'to', 'the', 'circle', 'eccentricity', 'near', 'zero', 'nine', 'terms', 'are', 'added', 'to', 'the', 'maclaurin', 'series', 'and', 'near', 'the', 'infinite', 'strip', 'eccentricity', 'near', 'unity', 'four', 'terms', 'are', 'added', 'to', 'the', 'asymptotic', 'expansion', 'in', 'the', 'past', 'other', 'methods', 'such', 'as', 'boundary', 'variation', 'techniques', 'have', 'been', 'used', 'to', 'work', 'on', 'this', 'problem', 'but', 'i', 'use', 'a', 'different', 'approach', 'which', 'not', 'only', 'offers', 'independent', 'confirmation', 'of', 'existing', 'results', 'but', 'extends', 'them', 'my', 'starting', 'point', 'is', 'a', 'high', 'precision', 'computation', 'of', 'the', 'eigenvalue', 'for', 'selected', 'values', 'of', 'eccentricity', 'these', 'data', 'are', 'then', 'fit', 'to', 'polynomials', 'in', 'appropriate', 'parameters', 'yielding', 'highprecision', 'coefficients', 'that', 'are', 'fed', 'into', 'an', 'lll', 'integerrelation', 'algorithm', 'with', 'forms', 'guided', 'by', 'prior', 'results']] | [-0.10417827501879547, 0.043805240117881505, -0.11107407428621166, 0.028100344125498625, -0.10324196582930027, -0.11254716067628907, 0.015335357530325975, 0.3597291631124698, -0.2455978136934826, -0.29443508668708196, 0.14942796765303618, -0.30595479627558286, -0.09757579095109933, 0.19573142663643195, -0.042987413078241145, 0.10330673626995648, 0.09655273897046952, 0.06569808633134201, -0.07140999470425742, -0.2629423783147249, 0.2853099369187502, 0.03738570633762772, 0.18596736074128337, 0.0007776584732683673, 0.0549990952165082, -0.03412485809362345, -0.04007688231691988, -0.013441496319474949, -0.16389095476193505, 0.1263240133673695, 0.25959923375647626, 0.06938267381142857, 0.29286916869813984, -0.3831935068592429, -0.16314616991355474, 0.07791395438835025, 0.1925010298365268, 0.07486713083673512, 0.019623577529800706, -0.23560967707358624, 0.07753184056449411, -0.16698089225109722, -0.18708410857420793, -0.07857210228246624, 0.007466218191320481, 0.022901896813351228, -0.2810511162902728, 0.07664185357482536, 0.06694728330425594, 0.05453798797089553, -0.06492734638015753, -0.21531253856390822, 0.0020386489290420127, 0.10407357231335904, 0.06376010108826871, 0.02690751504311608, 0.10150499737389601, -0.0787383598052775, -0.08575438802211505, 0.33305635426760366, -0.06748479506864712, -0.22080094156705815, 0.1556993522748783, -0.16078663909929278, -0.138044591402581, 0.13021457333461908, 0.15435369875943422, 0.09728049958610664, -0.12244234330601235, 0.08509464735676453, -0.008556301920654496, 0.10099652689393185, 0.11646819398637213, 0.0034644408995096665, 0.23428658215140086, 0.0904214314819462, 0.043508602341677506, 0.11015238091594243, -0.08172510028669132, -0.1059966853691562, -0.28974851160107745, -0.0966876549907771, -0.2193113815687273, 0.0044927108170088395, -0.11205269338593032, -0.18369961074431954, 0.3948983823934543, 0.15142463712507617, 0.24471741481481687, 0.052831199371924056, 0.3015707114583178, 0.16391310738770803, 0.06948121661063877, 0.07279562700769283, 0.2492277861507002, 0.11052977548156312, 0.052021438600090536, -0.17505179304356241, 0.03992194876722668, 0.0892245202642474] |
1,802.07769 | Lossless Compression of Angiogram Foreground with Visual Quality
Preservation of Background | By increasing the volume of telemedicine information, the need for medical
image compression has become more important. In angiographic images, a small
ratio of the entire image usually belongs to the vasculature that provides
crucial information for diagnosis. Other parts of the image are diagnostically
less important and can be compressed with higher compression ratio. However,
the quality of those parts affect the visual perception of the image as well.
Existing methods compress foreground and background of angiographic images
using different techniques. In this paper we first utilize convolutional neural
network to segment vessels and then represent a hierarchical block processing
algorithm capable of both eliminating the background redundancies and
preserving the overall visual quality of angiograms.
| cs.CV | by increasing the volume of telemedicine information the need for medical image compression has become more important in angiographic images a small ratio of the entire image usually belongs to the vasculature that provides crucial information for diagnosis other parts of the image are diagnostically less important and can be compressed with higher compression ratio however the quality of those parts affect the visual perception of the image as well existing methods compress foreground and background of angiographic images using different techniques in this paper we first utilize convolutional neural network to segment vessels and then represent a hierarchical block processing algorithm capable of both eliminating the background redundancies and preserving the overall visual quality of angiograms | [['by', 'increasing', 'the', 'volume', 'of', 'telemedicine', 'information', 'the', 'need', 'for', 'medical', 'image', 'compression', 'has', 'become', 'more', 'important', 'in', 'angiographic', 'images', 'a', 'small', 'ratio', 'of', 'the', 'entire', 'image', 'usually', 'belongs', 'to', 'the', 'vasculature', 'that', 'provides', 'crucial', 'information', 'for', 'diagnosis', 'other', 'parts', 'of', 'the', 'image', 'are', 'diagnostically', 'less', 'important', 'and', 'can', 'be', 'compressed', 'with', 'higher', 'compression', 'ratio', 'however', 'the', 'quality', 'of', 'those', 'parts', 'affect', 'the', 'visual', 'perception', 'of', 'the', 'image', 'as', 'well', 'existing', 'methods', 'compress', 'foreground', 'and', 'background', 'of', 'angiographic', 'images', 'using', 'different', 'techniques', 'in', 'this', 'paper', 'we', 'first', 'utilize', 'convolutional', 'neural', 'network', 'to', 'segment', 'vessels', 'and', 'then', 'represent', 'a', 'hierarchical', 'block', 'processing', 'algorithm', 'capable', 'of', 'both', 'eliminating', 'the', 'background', 'redundancies', 'and', 'preserving', 'the', 'overall', 'visual', 'quality', 'of', 'angiograms']] | [-0.03964665400274257, 0.020569592849630065, -0.04500136943335016, 0.05794542688283369, -0.07767169701500645, -0.1302235270332959, -0.025869462737598672, 0.4263070603975883, -0.26216818974950373, -0.3352772940475589, 0.1343938273528957, -0.27622911473338163, -0.17324555732118777, 0.17943336657033518, -0.15394577874332413, 0.09103498715732215, 0.08872080974292774, 0.05836669207773466, -0.05574272440459866, -0.25590960659150386, 0.2944100658237442, 0.07360058495949985, 0.34993183891424257, 0.006704736174617568, 0.09507564822625783, -0.013217150946107939, -0.10441444129941778, 0.010162091855274146, -0.018805586193943433, 0.2004384573461472, 0.3272459305341268, 0.22809706225147486, 0.2757819639120856, -0.4540032965537065, -0.247546872888238, 0.08380250433364357, 0.19005137408733305, 0.0934076924673003, -0.05041834249016411, -0.2939164260577442, 0.12043487525775902, -0.10692666504436578, 0.01867920195317676, -0.0948932631394993, -0.007934952745787226, -0.023637640497917868, -0.259076540331002, 0.08556941331515455, 0.06864713015468615, 0.05835685692329565, -0.06319569711947542, -0.10202792550349592, 0.000667408338556878, 0.2496110601271065, 0.0032912537049597655, 0.08780729421613435, 0.1793035405019346, -0.23781476886425582, -0.03847082785099872, 0.4071623985456605, -0.01307732506424316, -0.20754609877466518, 0.18443902738245094, -0.06023886724142358, -0.13308641275104421, 0.17815982853261453, 0.20333263877198163, 0.07468655309838872, -0.14240377644697824, -0.01638198193982562, 0.021069882923148125, 0.20825559239930067, 0.11050073812421188, 0.04743323831532437, 0.20871689084232745, 0.21780324494864187, 0.03172321075525803, 0.16792856867954487, -0.17180299804283258, 0.016069244879942674, -0.17799699548472706, -0.14772182111588553, -0.1559181360111962, -0.05063926655019068, -0.15145213109526673, -0.1647038877201386, 0.38668473585484886, 0.21426669378868407, 0.21831197156690252, 0.029624519837845083, 0.4076600993991408, 0.017797860928858895, 0.14881076143943092, 0.0308072994558666, 0.1822756960018912, 0.04375539462663667, 0.13132531079662663, -0.15251258181499588, 0.10076763990741128, 0.05685211616791148] |
1,802.0777 | Generalizable Adversarial Examples Detection Based on Bi-model Decision
Mismatch | Modern applications of artificial neural networks have yielded remarkable
performance gains in a wide range of tasks. However, recent studies have
discovered that such modelling strategy is vulnerable to Adversarial Examples,
i.e. examples with subtle perturbations often too small and imperceptible to
humans, but that can easily fool neural networks. Defense techniques against
adversarial examples have been proposed, but ensuring robust performance
against varying or novel types of attacks remains an open problem. In this
work, we focus on the detection setting, in which case attackers become
identifiable while models remain vulnerable. Particularly, we employ the
decision layer of independently trained models as features for posterior
detection. The proposed framework does not require any prior knowledge of
adversarial examples generation techniques, and can be directly employed along
with unmodified off-the-shelf models. Experiments on the standard MNIST and
CIFAR10 datasets deliver empirical evidence that such detection approach
generalizes well across not only different adversarial examples generation
methods but also quality degradation attacks. Non-linear binary classifiers
trained on top of our proposed features can achieve a high detection rate
(>90%) in a set of white-box attacks and maintain such performance when tested
against unseen attacks.
| cs.CV | modern applications of artificial neural networks have yielded remarkable performance gains in a wide range of tasks however recent studies have discovered that such modelling strategy is vulnerable to adversarial examples ie examples with subtle perturbations often too small and imperceptible to humans but that can easily fool neural networks defense techniques against adversarial examples have been proposed but ensuring robust performance against varying or novel types of attacks remains an open problem in this work we focus on the detection setting in which case attackers become identifiable while models remain vulnerable particularly we employ the decision layer of independently trained models as features for posterior detection the proposed framework does not require any prior knowledge of adversarial examples generation techniques and can be directly employed along with unmodified offtheshelf models experiments on the standard mnist and cifar10 datasets deliver empirical evidence that such detection approach generalizes well across not only different adversarial examples generation methods but also quality degradation attacks nonlinear binary classifiers trained on top of our proposed features can achieve a high detection rate 90 in a set of whitebox attacks and maintain such performance when tested against unseen attacks | [['modern', 'applications', 'of', 'artificial', 'neural', 'networks', 'have', 'yielded', 'remarkable', 'performance', 'gains', 'in', 'a', 'wide', 'range', 'of', 'tasks', 'however', 'recent', 'studies', 'have', 'discovered', 'that', 'such', 'modelling', 'strategy', 'is', 'vulnerable', 'to', 'adversarial', 'examples', 'ie', 'examples', 'with', 'subtle', 'perturbations', 'often', 'too', 'small', 'and', 'imperceptible', 'to', 'humans', 'but', 'that', 'can', 'easily', 'fool', 'neural', 'networks', 'defense', 'techniques', 'against', 'adversarial', 'examples', 'have', 'been', 'proposed', 'but', 'ensuring', 'robust', 'performance', 'against', 'varying', 'or', 'novel', 'types', 'of', 'attacks', 'remains', 'an', 'open', 'problem', 'in', 'this', 'work', 'we', 'focus', 'on', 'the', 'detection', 'setting', 'in', 'which', 'case', 'attackers', 'become', 'identifiable', 'while', 'models', 'remain', 'vulnerable', 'particularly', 'we', 'employ', 'the', 'decision', 'layer', 'of', 'independently', 'trained', 'models', 'as', 'features', 'for', 'posterior', 'detection', 'the', 'proposed', 'framework', 'does', 'not', 'require', 'any', 'prior', 'knowledge', 'of', 'adversarial', 'examples', 'generation', 'techniques', 'and', 'can', 'be', 'directly', 'employed', 'along', 'with', 'unmodified', 'offtheshelf', 'models', 'experiments', 'on', 'the', 'standard', 'mnist', 'and', 'cifar10', 'datasets', 'deliver', 'empirical', 'evidence', 'that', 'such', 'detection', 'approach', 'generalizes', 'well', 'across', 'not', 'only', 'different', 'adversarial', 'examples', 'generation', 'methods', 'but', 'also', 'quality', 'degradation', 'attacks', 'nonlinear', 'binary', 'classifiers', 'trained', 'on', 'top', 'of', 'our', 'proposed', 'features', 'can', 'achieve', 'a', 'high', 'detection', 'rate', '90', 'in', 'a', 'set', 'of', 'whitebox', 'attacks', 'and', 'maintain', 'such', 'performance', 'when', 'tested', 'against', 'unseen', 'attacks']] | [-0.059141364536088904, -0.0029744022576967157, -0.0242099644413575, 0.08652811144584781, -0.09467066328253577, -0.2624889184344425, 0.04151354055523564, 0.43786872331767196, -0.21343927040039876, -0.3589419785819446, 0.11968271003268814, -0.28548388692931576, -0.23670293897790884, 0.264410103249021, -0.17278375674753602, 0.1357884337749197, 0.1323470921422128, 0.02011100982962456, -0.02669212882831654, -0.3633772657286627, 0.2955616520852854, 0.05893154602034568, 0.358586145357417, 0.03935201660189488, 0.09695250289728792, -0.07959903865796876, 0.004724626513825334, 0.00967568362257178, -0.021148232943968004, 0.08345193358155092, 0.3294604143247193, 0.19846502198461308, 0.3282984270873465, -0.4253625009459844, -0.28714930303780833, 0.13317292140449344, 0.12878198794407741, 0.1528175398044637, -0.0862398245076316, -0.36704738509727863, 0.14872474814017203, -0.2134408263098738, -0.013202387349766925, -0.19889769619547912, -0.04952541049183805, 0.008386815717767133, -0.2678866354903023, 0.006074097024251519, 0.10789946156947203, 0.07151234432224937, -0.024781697170345663, -0.10004454781663233, 0.00034969419221649517, 0.13741833062126504, 0.05745263908594036, -0.0038255400710782623, 0.1818259238510349, -0.18460313173691342, -0.17828596341592584, 0.32533868255547294, -0.07249281861592528, -0.22936031637819473, 0.2577556056281735, 0.03515524074551046, -0.1645307053686385, 0.10509772421888659, 0.265308658211188, 0.1550454898940042, -0.12353023178695997, 0.010604594837768013, -0.007348880971000177, 0.20400616883872066, 0.06973931118918322, 0.02217507179961612, 0.17904381950052908, 0.21830689893200647, 0.029759060601110287, 0.13006156230757948, -0.12338697249214575, -0.0752710296556479, -0.18479055066296224, -0.014706785994499845, -0.17167175333063875, 0.003225823900682871, -0.057329626087704914, -0.1551963237435147, 0.37362596176328244, 0.26039204980521774, 0.19159263259021883, 0.10517220980885265, 0.3993737507114486, -0.013739603693965567, 0.13829794688237146, 0.11640845997490645, 0.2490287092260997, -0.0026415116274295077, 0.06992234309792635, -0.0935346907200147, 0.19466387641247015, -0.05000345453160328] |
1,802.07771 | The Lattice of subracks is atomic | A rack is a set together with a self-distributive bijective binary operation.
In this paper, we give a positive answer to a question due to Heckenberger,
Shareshian and Welker. Indeed, we prove that the lattice of subracks of a rack
is atomic. Further, by using the atoms, we associate certain quandles to racks.
We also show that the lattice of subracks of a rack is isomorphic to the
lattice of subracks of a quandle. Moreover, we show that the lattice of
subracks of a rack is distributive if and only if its corresponding quandle is
trivial. Finally, applying our corresponding quandles, we provide a coloring of
certain knot diagrams.
| math.CO math.AC | a rack is a set together with a selfdistributive bijective binary operation in this paper we give a positive answer to a question due to heckenberger shareshian and welker indeed we prove that the lattice of subracks of a rack is atomic further by using the atoms we associate certain quandles to racks we also show that the lattice of subracks of a rack is isomorphic to the lattice of subracks of a quandle moreover we show that the lattice of subracks of a rack is distributive if and only if its corresponding quandle is trivial finally applying our corresponding quandles we provide a coloring of certain knot diagrams | [['a', 'rack', 'is', 'a', 'set', 'together', 'with', 'a', 'selfdistributive', 'bijective', 'binary', 'operation', 'in', 'this', 'paper', 'we', 'give', 'a', 'positive', 'answer', 'to', 'a', 'question', 'due', 'to', 'heckenberger', 'shareshian', 'and', 'welker', 'indeed', 'we', 'prove', 'that', 'the', 'lattice', 'of', 'subracks', 'of', 'a', 'rack', 'is', 'atomic', 'further', 'by', 'using', 'the', 'atoms', 'we', 'associate', 'certain', 'quandles', 'to', 'racks', 'we', 'also', 'show', 'that', 'the', 'lattice', 'of', 'subracks', 'of', 'a', 'rack', 'is', 'isomorphic', 'to', 'the', 'lattice', 'of', 'subracks', 'of', 'a', 'quandle', 'moreover', 'we', 'show', 'that', 'the', 'lattice', 'of', 'subracks', 'of', 'a', 'rack', 'is', 'distributive', 'if', 'and', 'only', 'if', 'its', 'corresponding', 'quandle', 'is', 'trivial', 'finally', 'applying', 'our', 'corresponding', 'quandles', 'we', 'provide', 'a', 'coloring', 'of', 'certain', 'knot', 'diagrams']] | [-0.22171340012974147, 0.11303858116158036, -0.09154652976730002, 0.031672450930089475, -0.12717602440848128, -0.12909623073550677, 0.13432978707207624, 0.41548757268748154, -0.35529946898101666, -0.19046981669983767, 0.08931655138453315, -0.24701189822218286, -0.20052892661764535, 0.15058220436779457, -0.16622983900308952, -0.058342586105386084, 0.0976466557284424, 0.1056382683078532, -0.0823778876321339, -0.3161145762044834, 0.380299412380528, -0.017692320599912777, 0.1560751899260891, 0.1296485906227603, 0.10168839788166892, -0.03181613774525873, -0.004478902696982163, 0.06551607346392894, -0.18976388440499192, 0.13050070945857042, 0.23102839180661383, 0.06687563332011325, 0.16201192307725992, -0.3392668342679192, -0.054337408782384536, 0.13675438043332463, 0.09845892099424376, 0.062655921846013, -0.0446789694368976, -0.23667838323301713, 0.18527069670754834, -0.2649988433294887, -0.09507476689652838, -0.09554874050482219, 0.065929223074142, 0.05219609992698245, -0.2269157125388161, -0.056107949937849705, 0.12832610615862344, 0.10789731797685317, -0.025256880983035294, -0.03004502661210066, -0.054521378578293485, 0.09558317593700431, -0.05592235675852228, 0.06797823140829153, 0.054817678082153334, -0.0925821981781564, -0.1919025007737886, 0.4568268104772502, -0.004266696211501717, -0.19271074466133883, 0.13498619620030353, -0.12729781529644008, -0.19393497176570904, 0.11853661941825797, 0.033323090933605075, 0.08291191958454908, -0.06090492137853022, 0.1278325864487678, -0.21987394551925976, 0.15687566060880456, 0.10596594186243388, -0.005428379042706358, 0.14045701478394346, 0.10550515838992705, 0.10052992016452988, 0.24614718156533505, 0.02142422652265074, 0.005879178493702357, -0.2994121539004899, -0.215619176190449, -0.13748518151547248, 0.12443297646657794, -0.03541293665163279, -0.17267043039271043, 0.39933372621313423, 0.1356379934287536, 0.17698756737475402, 0.1144797599985512, 0.2269579210070842, 0.05513474442197732, 0.09850011565594362, 0.04682767408720534, 0.1253910531447944, 0.1794533981928824, -0.016882336463505794, -0.17675328316645475, -0.07904882704061585, 0.2064360526022971] |
1,802.07772 | Dusty galaxies in the Epoch of Reionization: simulations | The recent discovery of dusty galaxies well into the Epoch of Reionization
(redshift $z>6$) poses challenging questions about the properties of the
interstellar medium in these pristine systems. By combining state-of-the-art
hydrodynamic and dust radiative transfer simulations, we address these
questions focusing on the recently discovered dusty galaxy A2744_YD4 ($z=8.38$,
Laporte et al. 2017}). We show that we can reproduce the observed spectral
energy distribution (SED) only using different physical values with respect to
the inferred ones by Laporte et al(2017), i.e. a star formation rate of
$\mathrm{SFR} = 78\;\rm M_\odot \rm yr^{-1}$, a factor $\approx 4$ higher than
deduced from simple Spectral Energy Distribution fitting. In this case we find:
(a) dust attenuation (corresponding to $\tau_V=1.4$) is consistent with a Milky
Way extinction curve; (b) the dust-to-metal ratio is low, $f_\mathrm{d} \sim
0.08$, implying that early dust formation is rather inefficient; (c) the
luminosity-weighted dust temperature is high, $T_d=91\pm 23\, \rm K$, as a
result of the intense ($\approx 100\times$ MW) interstellar radiation field;
(d) due to the high $T_d$, the ALMA Band 7 detection can be explained by a
limited dust mass, $M_d=1.6\times 10^6 $M$_\odot$. Finally, the high dust
temperatures might solve the puzzling low infrared excess recently deduced for
high-$z$ galaxies from the IRX-$\beta$ relation.
| astro-ph.GA | the recent discovery of dusty galaxies well into the epoch of reionization redshift z6 poses challenging questions about the properties of the interstellar medium in these pristine systems by combining stateoftheart hydrodynamic and dust radiative transfer simulations we address these questions focusing on the recently discovered dusty galaxy a2744_yd4 z838 laporte et al 2017 we show that we can reproduce the observed spectral energy distribution sed only using different physical values with respect to the inferred ones by laporte et al2017 ie a star formation rate of mathrmsfr 78rm m_odot rm yr1 a factor approx 4 higher than deduced from simple spectral energy distribution fitting in this case we find a dust attenuation corresponding to tau_v14 is consistent with a milky way extinction curve b the dusttometal ratio is low f_mathrmd sim 008 implying that early dust formation is rather inefficient c the luminosityweighted dust temperature is high t_d91pm 23 rm k as a result of the intense approx 100times mw interstellar radiation field d due to the high t_d the alma band 7 detection can be explained by a limited dust mass m_d16times 106 m_odot finally the high dust temperatures might solve the puzzling low infrared excess recently deduced for highz galaxies from the irxbeta relation | [['the', 'recent', 'discovery', 'of', 'dusty', 'galaxies', 'well', 'into', 'the', 'epoch', 'of', 'reionization', 'redshift', 'z6', 'poses', 'challenging', 'questions', 'about', 'the', 'properties', 'of', 'the', 'interstellar', 'medium', 'in', 'these', 'pristine', 'systems', 'by', 'combining', 'stateoftheart', 'hydrodynamic', 'and', 'dust', 'radiative', 'transfer', 'simulations', 'we', 'address', 'these', 'questions', 'focusing', 'on', 'the', 'recently', 'discovered', 'dusty', 'galaxy', 'a2744_yd4', 'z838', 'laporte', 'et', 'al', '2017', 'we', 'show', 'that', 'we', 'can', 'reproduce', 'the', 'observed', 'spectral', 'energy', 'distribution', 'sed', 'only', 'using', 'different', 'physical', 'values', 'with', 'respect', 'to', 'the', 'inferred', 'ones', 'by', 'laporte', 'et', 'al2017', 'ie', 'a', 'star', 'formation', 'rate', 'of', 'mathrmsfr', '78rm', 'm_odot', 'rm', 'yr1', 'a', 'factor', 'approx', '4', 'higher', 'than', 'deduced', 'from', 'simple', 'spectral', 'energy', 'distribution', 'fitting', 'in', 'this', 'case', 'we', 'find', 'a', 'dust', 'attenuation', 'corresponding', 'to', 'tau_v14', 'is', 'consistent', 'with', 'a', 'milky', 'way', 'extinction', 'curve', 'b', 'the', 'dusttometal', 'ratio', 'is', 'low', 'f_mathrmd', 'sim', '008', 'implying', 'that', 'early', 'dust', 'formation', 'is', 'rather', 'inefficient', 'c', 'the', 'luminosityweighted', 'dust', 'temperature', 'is', 'high', 't_d91pm', '23', 'rm', 'k', 'as', 'a', 'result', 'of', 'the', 'intense', 'approx', '100times', 'mw', 'interstellar', 'radiation', 'field', 'd', 'due', 'to', 'the', 'high', 't_d', 'the', 'alma', 'band', '7', 'detection', 'can', 'be', 'explained', 'by', 'a', 'limited', 'dust', 'mass', 'm_d16times', '106', 'm_odot', 'finally', 'the', 'high', 'dust', 'temperatures', 'might', 'solve', 'the', 'puzzling', 'low', 'infrared', 'excess', 'recently', 'deduced', 'for', 'highz', 'galaxies', 'from', 'the', 'irxbeta', 'relation']] | [-0.05666926345760142, 0.11809524162776712, -0.03529697582032995, 0.10072088346698446, -0.0583895496625583, -0.06335945994551502, 0.03109539688949413, 0.4187745602560503, -0.1577111175538629, -0.38296542313344895, 0.028414176208249743, -0.27617214696565223, -0.012753087230177599, 0.1755300066040004, -0.05088623117347681, -0.010852894714998142, 0.007577281766710108, -0.14765813739058695, -0.05475339766721234, -0.26192044323792135, 0.25909504281190127, 0.12188380840350295, 0.19223907879155258, 0.015919295820727278, 0.06954495805206787, -0.12054060173420171, -0.06996038320256555, -0.04477223692072639, -0.21659432294518183, 0.02482269476839707, 0.21575307580920408, 0.1026143494527787, 0.19501573705885894, -0.33603122195608875, -0.2639678968151392, 0.0807875253553925, 0.17870746656733366, 0.05524947570778189, -0.07334523651324935, -0.22529556907004497, 0.08442029841151552, -0.19149478515656435, -0.15691322658387064, 0.08124877728373553, 0.059609823084705096, -0.011384008452296257, -0.24615982029846503, 0.1904851388932201, 0.005540712519354229, 0.08281653141371202, -0.08830052176351423, -0.13082029182980515, -0.09044705664122764, 0.005467339297200539, -0.0016577215413493451, 0.10939514753003303, 0.2021282962546568, -0.14979388183260808, -0.00037357652217001467, 0.4256688245277926, -0.10446362106619804, 0.040226881767609225, 0.22556060065158565, -0.2141187961945375, -0.1442490921990566, 0.18850225997412234, 0.11640198523061702, 0.11108195680466976, -0.15122811982769574, 0.029248623508700534, -0.041825462804541955, 0.2171991978985123, 0.07276637415258001, 0.04805426206099465, 0.3221077590147543, 0.1093889468729459, -0.01808350781136336, 0.06238163039563177, -0.1570719539753129, -0.0015710676752091085, -0.18803334181702033, -0.07886812353416332, -0.16111884873988228, 0.16808652467516005, -0.1683549240699347, -0.02894697404311349, 0.28566324473497695, 0.13786573820621173, 0.2881236102684535, 0.07339941789349773, 0.3001020434891703, 0.12446680324168329, 0.07733655240692532, 0.14210372557284412, 0.29486592777017784, 0.16514110493251302, 0.08826303276099005, -0.23691410979601227, 0.07778280524627319, -0.004911673533271497] |
1,802.07773 | Counting Motifs with Graph Sampling | Applied researchers often construct a network from a random sample of nodes
in order to infer properties of the parent network. Two of the most widely used
sampling schemes are subgraph sampling, where we sample each vertex
independently with probability $p$ and observe the subgraph induced by the
sampled vertices, and neighborhood sampling, where we additionally observe the
edges between the sampled vertices and their neighbors.
In this paper, we study the problem of estimating the number of motifs as
induced subgraphs under both models from a statistical perspective. We show
that: for any connected $h$ on $k$ vertices, to estimate $s=\mathsf{s}(h,G)$,
the number of copies of $h$ in the parent graph $G$ of maximum degree $d$, with
a multiplicative error of $\epsilon$, (a) For subgraph sampling, the optimal
sampling ratio $p$ is $\Theta_{k}(\max\{ (s\epsilon^2)^{-\frac{1}{k}}, \;
\frac{d^{k-1}}{s\epsilon^{2}} \})$, achieved by Horvitz-Thompson type of
estimators. (b) For neighborhood sampling, we propose a family of estimators,
encompassing and outperforming the Horvitz-Thompson estimator and achieving the
sampling ratio $O_{k}(\min\{ (\frac{d}{s\epsilon^2})^{\frac{1}{k-1}}, \;
\sqrt{\frac{d^{k-2}}{s\epsilon^2}}\})$. This is shown to be optimal for all
motifs with at most $4$ vertices and cliques of all sizes.
The matching minimax lower bounds are established using certain algebraic
properties of subgraph counts. These results quantify how much more informative
neighborhood sampling is than subgraph sampling, as empirically verified by
experiments on both synthetic and real-world data. We also address the issue of
adaptation to the unknown maximum degree, and study specific problems for
parent graphs with additional structures, e.g., trees or planar graphs.
| math.ST cs.DM stat.ML stat.TH | applied researchers often construct a network from a random sample of nodes in order to infer properties of the parent network two of the most widely used sampling schemes are subgraph sampling where we sample each vertex independently with probability p and observe the subgraph induced by the sampled vertices and neighborhood sampling where we additionally observe the edges between the sampled vertices and their neighbors in this paper we study the problem of estimating the number of motifs as induced subgraphs under both models from a statistical perspective we show that for any connected h on k vertices to estimate smathsfshg the number of copies of h in the parent graph g of maximum degree d with a multiplicative error of epsilon a for subgraph sampling the optimal sampling ratio p is theta_kmax sepsilon2frac1k fracdk1sepsilon2 achieved by horvitzthompson type of estimators b for neighborhood sampling we propose a family of estimators encompassing and outperforming the horvitzthompson estimator and achieving the sampling ratio o_kmin fracdsepsilon2frac1k1 sqrtfracdk2sepsilon2 this is shown to be optimal for all motifs with at most 4 vertices and cliques of all sizes the matching minimax lower bounds are established using certain algebraic properties of subgraph counts these results quantify how much more informative neighborhood sampling is than subgraph sampling as empirically verified by experiments on both synthetic and realworld data we also address the issue of adaptation to the unknown maximum degree and study specific problems for parent graphs with additional structures eg trees or planar graphs | [['applied', 'researchers', 'often', 'construct', 'a', 'network', 'from', 'a', 'random', 'sample', 'of', 'nodes', 'in', 'order', 'to', 'infer', 'properties', 'of', 'the', 'parent', 'network', 'two', 'of', 'the', 'most', 'widely', 'used', 'sampling', 'schemes', 'are', 'subgraph', 'sampling', 'where', 'we', 'sample', 'each', 'vertex', 'independently', 'with', 'probability', 'p', 'and', 'observe', 'the', 'subgraph', 'induced', 'by', 'the', 'sampled', 'vertices', 'and', 'neighborhood', 'sampling', 'where', 'we', 'additionally', 'observe', 'the', 'edges', 'between', 'the', 'sampled', 'vertices', 'and', 'their', 'neighbors', 'in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'estimating', 'the', 'number', 'of', 'motifs', 'as', 'induced', 'subgraphs', 'under', 'both', 'models', 'from', 'a', 'statistical', 'perspective', 'we', 'show', 'that', 'for', 'any', 'connected', 'h', 'on', 'k', 'vertices', 'to', 'estimate', 'smathsfshg', 'the', 'number', 'of', 'copies', 'of', 'h', 'in', 'the', 'parent', 'graph', 'g', 'of', 'maximum', 'degree', 'd', 'with', 'a', 'multiplicative', 'error', 'of', 'epsilon', 'a', 'for', 'subgraph', 'sampling', 'the', 'optimal', 'sampling', 'ratio', 'p', 'is', 'theta_kmax', 'sepsilon2frac1k', 'fracdk1sepsilon2', 'achieved', 'by', 'horvitzthompson', 'type', 'of', 'estimators', 'b', 'for', 'neighborhood', 'sampling', 'we', 'propose', 'a', 'family', 'of', 'estimators', 'encompassing', 'and', 'outperforming', 'the', 'horvitzthompson', 'estimator', 'and', 'achieving', 'the', 'sampling', 'ratio', 'o_kmin', 'fracdsepsilon2frac1k1', 'sqrtfracdk2sepsilon2', 'this', 'is', 'shown', 'to', 'be', 'optimal', 'for', 'all', 'motifs', 'with', 'at', 'most', '4', 'vertices', 'and', 'cliques', 'of', 'all', 'sizes', 'the', 'matching', 'minimax', 'lower', 'bounds', 'are', 'established', 'using', 'certain', 'algebraic', 'properties', 'of', 'subgraph', 'counts', 'these', 'results', 'quantify', 'how', 'much', 'more', 'informative', 'neighborhood', 'sampling', 'is', 'than', 'subgraph', 'sampling', 'as', 'empirically', 'verified', 'by', 'experiments', 'on', 'both', 'synthetic', 'and', 'realworld', 'data', 'we', 'also', 'address', 'the', 'issue', 'of', 'adaptation', 'to', 'the', 'unknown', 'maximum', 'degree', 'and', 'study', 'specific', 'problems', 'for', 'parent', 'graphs', 'with', 'additional', 'structures', 'eg', 'trees', 'or', 'planar', 'graphs']] | [-0.10706927109923628, 0.08944185272936131, -0.03011823641596201, 0.05960221658221258, -0.06980624451558777, -0.12514317954541662, 0.1214893284266232, 0.4191182887051331, -0.27945783222381626, -0.3646495689066901, 0.10198241990364307, -0.2970340725325753, -0.14470391433399532, 0.12653433667196903, -0.08955444555361698, 0.04515680278758729, 0.10049126782059792, 0.07538087985290544, -0.008753482506269351, -0.27645217770494523, 0.2906321037805988, 0.018938357196364997, 0.24959650925799454, -0.023176278734297985, 0.09525887062725201, 0.019180507920375824, -0.028090758057533468, 0.07839285247621927, -0.19145811824914313, 0.11426440526208162, 0.26449756988261286, 0.16526620502395886, 0.2827521113126918, -0.3501342232616349, -0.18207376773580294, 0.20729958926281536, 0.12619412972115376, 0.0835404165296091, -0.005666866438923722, -0.24157242143886937, 0.13897117172701307, -0.09692411393671174, -0.04701277163883848, -0.041222805696024094, 0.019577866000479754, 0.04574801013019288, -0.3303555156728981, 0.03413416642239107, 0.055029842614267147, 0.05942827929961093, 0.05075003596505633, -0.1909553589171887, -0.03188057977000995, 0.10188747552767734, 0.006137701997019872, 0.033349948189769385, 0.10669539275808153, -0.13307552771554654, -0.16407847131886077, 0.33781349109250997, -0.01811568230686857, -0.16506230597357446, 0.15642105967549938, -0.14531302766744125, -0.1688621934396004, 0.1100547931007581, 0.18783090220296703, 0.15558536625428915, -0.1539742453981942, 0.0675546692304865, -0.04691986121053313, 0.1134647345572802, 0.10141482822685177, 0.03553770721119679, 0.11067181020024627, 0.16288491004959146, 0.14919651207732565, 0.16634258800981483, -0.0924849851505348, -0.030169606800938463, -0.24655708559853917, -0.07566453664996681, -0.2631932406345145, 0.005503868454216439, -0.19917068272156435, -0.1749175549962667, 0.41000002097537736, 0.1552780918277433, 0.23387227924502313, 0.10902223831096304, 0.2386647388913933, 0.05628539198518964, 0.03831450306401308, 0.15907916282648565, 0.13888961021546964, 0.14305723522053918, -0.04756738870584793, -0.17237191662813225, 0.11716333671220015, 0.07744945435872908] |
1,802.07774 | Looking at cosmic near-infrared background radiation anisotropies | The cosmic infrared background (CIB) contains emissions accumulated over the
entire history of the Universe, including from objects inaccessible to
individual telescopic studies. The near-IR (~1-10 mic) part of the CIB, and its
fluctuations, reflects emissions from nucleosynthetic sources and
gravitationally accreting black holes (BHs). If known galaxies are removed to
sufficient depths the source-subtracted CIB fluctuations at near-IR can reveal
sources present in the first-stars-era and possibly new stellar populations at
more recent times. This review discusses the recent progress in this newly
emerging field which identified, with new data and methodology, significant
source-subtracted CIB fluctuations substantially in excess of what can be
produced by remaining known galaxies. The CIB fluctuations further appear
coherent with unresolved cosmic X-ray background (CXB) indicating a very high
fraction of BHs among the new sources producing the CIB fluctuations. These
observations have led to intensive theoretical efforts to explain the
measurements and their properties. While current experimental configurations
have limitations in decisively probing these theories, their potentially
remarkable implications will be tested in the upcoming CIB measurements with
the ESA's Euclid dark energy mission. We describe the goals and methodologies
of LIBRAE (Looking at Infrared Background Radiation with Euclid), a
NASA-selected project for CIB science with Euclid, which has the potential for
transforming the field into a new area of precision cosmology.
| astro-ph.CO | the cosmic infrared background cib contains emissions accumulated over the entire history of the universe including from objects inaccessible to individual telescopic studies the nearir 110 mic part of the cib and its fluctuations reflects emissions from nucleosynthetic sources and gravitationally accreting black holes bhs if known galaxies are removed to sufficient depths the sourcesubtracted cib fluctuations at nearir can reveal sources present in the firststarsera and possibly new stellar populations at more recent times this review discusses the recent progress in this newly emerging field which identified with new data and methodology significant sourcesubtracted cib fluctuations substantially in excess of what can be produced by remaining known galaxies the cib fluctuations further appear coherent with unresolved cosmic xray background cxb indicating a very high fraction of bhs among the new sources producing the cib fluctuations these observations have led to intensive theoretical efforts to explain the measurements and their properties while current experimental configurations have limitations in decisively probing these theories their potentially remarkable implications will be tested in the upcoming cib measurements with the esas euclid dark energy mission we describe the goals and methodologies of librae looking at infrared background radiation with euclid a nasaselected project for cib science with euclid which has the potential for transforming the field into a new area of precision cosmology | [['the', 'cosmic', 'infrared', 'background', 'cib', 'contains', 'emissions', 'accumulated', 'over', 'the', 'entire', 'history', 'of', 'the', 'universe', 'including', 'from', 'objects', 'inaccessible', 'to', 'individual', 'telescopic', 'studies', 'the', 'nearir', '110', 'mic', 'part', 'of', 'the', 'cib', 'and', 'its', 'fluctuations', 'reflects', 'emissions', 'from', 'nucleosynthetic', 'sources', 'and', 'gravitationally', 'accreting', 'black', 'holes', 'bhs', 'if', 'known', 'galaxies', 'are', 'removed', 'to', 'sufficient', 'depths', 'the', 'sourcesubtracted', 'cib', 'fluctuations', 'at', 'nearir', 'can', 'reveal', 'sources', 'present', 'in', 'the', 'firststarsera', 'and', 'possibly', 'new', 'stellar', 'populations', 'at', 'more', 'recent', 'times', 'this', 'review', 'discusses', 'the', 'recent', 'progress', 'in', 'this', 'newly', 'emerging', 'field', 'which', 'identified', 'with', 'new', 'data', 'and', 'methodology', 'significant', 'sourcesubtracted', 'cib', 'fluctuations', 'substantially', 'in', 'excess', 'of', 'what', 'can', 'be', 'produced', 'by', 'remaining', 'known', 'galaxies', 'the', 'cib', 'fluctuations', 'further', 'appear', 'coherent', 'with', 'unresolved', 'cosmic', 'xray', 'background', 'cxb', 'indicating', 'a', 'very', 'high', 'fraction', 'of', 'bhs', 'among', 'the', 'new', 'sources', 'producing', 'the', 'cib', 'fluctuations', 'these', 'observations', 'have', 'led', 'to', 'intensive', 'theoretical', 'efforts', 'to', 'explain', 'the', 'measurements', 'and', 'their', 'properties', 'while', 'current', 'experimental', 'configurations', 'have', 'limitations', 'in', 'decisively', 'probing', 'these', 'theories', 'their', 'potentially', 'remarkable', 'implications', 'will', 'be', 'tested', 'in', 'the', 'upcoming', 'cib', 'measurements', 'with', 'the', 'esas', 'euclid', 'dark', 'energy', 'mission', 'we', 'describe', 'the', 'goals', 'and', 'methodologies', 'of', 'librae', 'looking', 'at', 'infrared', 'background', 'radiation', 'with', 'euclid', 'a', 'nasaselected', 'project', 'for', 'cib', 'science', 'with', 'euclid', 'which', 'has', 'the', 'potential', 'for', 'transforming', 'the', 'field', 'into', 'a', 'new', 'area', 'of', 'precision', 'cosmology']] | [-0.055580783021112704, 0.15521105234312702, -0.09738600983666384, 0.12637305017968442, -0.08172804218060273, -0.027865050066571494, -0.0074489546611407245, 0.378667470484045, -0.1928821948618727, -0.357890328649895, 0.07930101708064825, -0.35906938109160635, -0.038445622559630396, 0.21580403704144713, -0.04274578096370818, -0.008995402656111455, 0.029902953083717054, -0.11188116915951041, 0.02484213533191105, -0.3085002145475602, 0.28948189761094784, 0.1835201955271653, 0.22539888890267, -0.011068928420268995, 0.08529445923025793, -0.08786754887808577, -0.16129033657086989, 0.009664569136446281, -0.13169503522165601, 0.09991862205788493, 0.29049720621157077, 0.16524399777934437, 0.19425579904651588, -0.401269073235429, -0.2557154482011662, 0.14629989061483142, 0.15072654716872766, 0.078672094944401, -0.07702017371138517, -0.2949151619582132, 0.031058532584454297, -0.1280391979946493, -0.14287390370213765, -0.03533012871893363, 0.0022516414589647737, 0.00536302709925173, -0.16675644881126347, 0.10768876965200606, -0.011526939411130454, 0.053629913105530676, -0.0948216998633126, -0.13616410863032127, -0.038857044875278454, 0.09388125727536835, 0.069644304028871, 0.07704845934511861, 0.18991949512679043, -0.20091776379417897, -0.10827650737300652, 0.35655053632874645, -0.08366621707669086, 0.0004260237328708172, 0.17117686599733367, -0.2527727885472198, -0.2080581020542382, 0.16233817519875424, 0.14857092392008564, 0.06608428079034051, -0.18698215231616994, 0.05140214959805411, 0.08657330453443053, 0.20670455251230263, 0.038322402302750865, 0.13727436520450015, 0.4216636759937153, 0.11899079263590122, 0.04327144916276641, 0.0862449660558202, -0.1835509952853009, 0.011626453639420118, -0.273569990900637, -0.0672583617355829, -0.1318211904343342, 0.12263669491442959, -0.0874501227543095, -0.0956576372390025, 0.35400261467082367, 0.18086821864056507, 0.15995991295675666, 0.0415860194651719, 0.32449788352624315, 0.010272755106526947, 0.10530463961373654, 0.061263055604998416, 0.34415758505875615, 0.11620045490756047, 0.12446119491341373, -0.19257380753489478, 0.012951691648633164, -0.07352457116658409] |
1,802.07775 | The PoGO+ view on Crab off-pulse hard X-ray polarisation | The linear polarisation fraction and angle of the hard X-ray emission from
the Crab provide unique insight into high energy radiation mechanisms,
complementing the usual imaging, timing and spectroscopic approaches. Results
have recently been presented by two missions operating in partially overlapping
energy bands, PoGO+ (18-160 keV) and AstroSat CZTI (100-380 keV). We previously
reported PoGO+ results on the polarisation parameters integrated across the
light-curve and for the entire nebula-dominated off-pulse region. We now
introduce finer phase binning, in light of the AstroSat CZTI claim that the
polarisation fraction varies across the off-pulse region. Since both missions
are operating in a regime where errors on the reconstructed polarisation
parameters are non-Gaussian, we adopt a Bayesian approach to compare results
from each mission. We find no statistically significant variation in off-pulse
polarisation parameters, neither when considering the mission data separately
nor when they are combined. This supports expectations from standard
high-energy emission models.
| astro-ph.HE | the linear polarisation fraction and angle of the hard xray emission from the crab provide unique insight into high energy radiation mechanisms complementing the usual imaging timing and spectroscopic approaches results have recently been presented by two missions operating in partially overlapping energy bands pogo 18160 kev and astrosat czti 100380 kev we previously reported pogo results on the polarisation parameters integrated across the lightcurve and for the entire nebuladominated offpulse region we now introduce finer phase binning in light of the astrosat czti claim that the polarisation fraction varies across the offpulse region since both missions are operating in a regime where errors on the reconstructed polarisation parameters are nongaussian we adopt a bayesian approach to compare results from each mission we find no statistically significant variation in offpulse polarisation parameters neither when considering the mission data separately nor when they are combined this supports expectations from standard highenergy emission models | [['the', 'linear', 'polarisation', 'fraction', 'and', 'angle', 'of', 'the', 'hard', 'xray', 'emission', 'from', 'the', 'crab', 'provide', 'unique', 'insight', 'into', 'high', 'energy', 'radiation', 'mechanisms', 'complementing', 'the', 'usual', 'imaging', 'timing', 'and', 'spectroscopic', 'approaches', 'results', 'have', 'recently', 'been', 'presented', 'by', 'two', 'missions', 'operating', 'in', 'partially', 'overlapping', 'energy', 'bands', 'pogo', '18160', 'kev', 'and', 'astrosat', 'czti', '100380', 'kev', 'we', 'previously', 'reported', 'pogo', 'results', 'on', 'the', 'polarisation', 'parameters', 'integrated', 'across', 'the', 'lightcurve', 'and', 'for', 'the', 'entire', 'nebuladominated', 'offpulse', 'region', 'we', 'now', 'introduce', 'finer', 'phase', 'binning', 'in', 'light', 'of', 'the', 'astrosat', 'czti', 'claim', 'that', 'the', 'polarisation', 'fraction', 'varies', 'across', 'the', 'offpulse', 'region', 'since', 'both', 'missions', 'are', 'operating', 'in', 'a', 'regime', 'where', 'errors', 'on', 'the', 'reconstructed', 'polarisation', 'parameters', 'are', 'nongaussian', 'we', 'adopt', 'a', 'bayesian', 'approach', 'to', 'compare', 'results', 'from', 'each', 'mission', 'we', 'find', 'no', 'statistically', 'significant', 'variation', 'in', 'offpulse', 'polarisation', 'parameters', 'neither', 'when', 'considering', 'the', 'mission', 'data', 'separately', 'nor', 'when', 'they', 'are', 'combined', 'this', 'supports', 'expectations', 'from', 'standard', 'highenergy', 'emission', 'models']] | [-0.05663852149931093, 0.1361809731562001, -0.08405007135355845, 0.10098063635562236, -0.08097125344909728, -0.09870206771418452, 0.06327100006863474, 0.4675596010684967, -0.21374344516855975, -0.34858426166077455, 0.0964885985009217, -0.3207394904767474, -0.03351777505750458, 0.2455458509052793, -0.030628562591737137, 0.03514531837621083, 0.08068426596311232, -0.10231447242491414, -0.0359857164719142, -0.17955270106283328, 0.23599223648818832, 0.11903560590154182, 0.2527594952719907, 0.011389845532054703, 0.0802781509895188, 0.0005711056912938754, -0.08568608932973196, -0.002193552783379952, -0.1213858534367076, 0.03497848993012061, 0.25270283002049837, 0.12733061775021876, 0.16793129943311214, -0.34933747195949155, -0.24792716985568405, 0.1012697440572083, 0.09788205174418788, -0.0005228808801621198, -0.014193917172863925, -0.28785685791323584, -0.0031281754281371832, -0.15636597422106813, -0.1011995459596316, -0.013627786556414018, -0.01797257368763288, 0.016467357451717058, -0.21058382499342163, 0.06500056982661287, -0.015299839015739659, 0.05423837368686994, -0.13972479959018527, -0.14100826920475812, -0.03589218944932024, 0.07722780273101913, 0.03227663179238637, 0.030255521868821234, 0.10615732401687031, -0.08674740476068109, -0.11438757148881754, 0.32387340371807416, -0.0494755105371587, -0.06697786001799007, 0.1536545199714601, -0.23059444490587339, -0.1929361711551125, 0.22148298643529415, 0.16490918767793725, 0.05960011522828912, -0.14224289680928148, 0.074717865580072, 0.009741030069999396, 0.27186208667854467, 0.04369126507701973, 0.09395728611930584, 0.2629772561043501, 0.13729310729618494, 0.022822262588112305, 0.14195833712661018, -0.23746047753530244, -0.045488821264977254, -0.2759483485979338, -0.04490524790870647, -0.12343577407610913, 0.023566352671768983, -0.060988347654153285, -0.10288728936264913, 0.41125986689391236, 0.15427329007536172, 0.17854694842671354, 0.011117176695649201, 0.3761294403175513, 0.08247010627295821, 0.048645612535377344, 0.07254133941605687, 0.3714610394090414, 0.07211309915718933, 0.130679143932648, -0.17362250063723575, 0.06545087799274674, -0.06012415939942002] |
1,802.07776 | Quaternionic hyperbolic lattices of minimal covolume | For any n>1 we determine the uniform and nonuniform lattices of the smallest
covolume in the Lie group Sp(n,1). We explicitly describe them in terms of the
ring of Hurwitz integers in the nonuniform case with n even, respectively, of
the icosian ring in the uniform case for all n>1.
| math.MG math.GT | for any n1 we determine the uniform and nonuniform lattices of the smallest covolume in the lie group spn1 we explicitly describe them in terms of the ring of hurwitz integers in the nonuniform case with n even respectively of the icosian ring in the uniform case for all n1 | [['for', 'any', 'n1', 'we', 'determine', 'the', 'uniform', 'and', 'nonuniform', 'lattices', 'of', 'the', 'smallest', 'covolume', 'in', 'the', 'lie', 'group', 'spn1', 'we', 'explicitly', 'describe', 'them', 'in', 'terms', 'of', 'the', 'ring', 'of', 'hurwitz', 'integers', 'in', 'the', 'nonuniform', 'case', 'with', 'n', 'even', 'respectively', 'of', 'the', 'icosian', 'ring', 'in', 'the', 'uniform', 'case', 'for', 'all', 'n1']] | [-0.22542292840778827, 0.13690871497616172, 0.010766632165759802, 0.04599427927285433, -0.00988356358371675, -0.10020906141027808, 0.0108307602442801, 0.36226638466119765, -0.25126098323613405, -0.20224725342355668, 0.10418319993652403, -0.22650479689240455, -0.10907634217757732, 0.15340506207197904, -0.05347392052412033, -0.0240078629553318, -0.043581342538818714, 0.12981965985149146, -0.07332273029256613, -0.3414581822603941, 0.33720873065292833, -0.04507561449892819, 0.2094131222181022, -0.004633991438895464, 0.04579439473338425, 0.06167381058214232, -0.0066947809979319576, 0.0035737634170800447, -0.1736886748485267, 0.10207453459268435, 0.24863634072244167, 0.012356328740715981, 0.16505237732082606, -0.43668642863631246, -0.12295241685584188, 0.21126646123826504, 0.1540951619297266, 0.05344523860607296, 0.0007278072275221348, -0.18464061637409032, 0.16510989071801305, -0.1691209606267512, -0.20858728535473348, -0.025237575452774764, 0.10182323917746544, 0.07791281741112471, -0.2774129207059741, 0.016510389316827058, 0.11490064639598131, 0.09169314637780189, -0.05642909808084369, -0.13367997780442237, 0.010260543525218964, 0.12061167914420366, -0.04862289620563388, -0.023446016116067767, 0.01975416289642453, -0.11882437746971845, -0.07796289190766402, 0.4181646800041199, -0.08407611878588796, -0.23549951188266277, 0.0923682876303792, -0.24522338449954986, -0.15316841019317506, 0.10729088347405195, 0.0897203255072236, 0.17254859807901085, 0.003238809909671545, 0.22623869024100712, -0.1641229334846139, 0.0984143241494894, 0.11258476310875266, 0.017276933323591946, 0.13205783750861882, 0.0420517632458359, 0.10473238721606322, 0.1855914669856429, -0.015537058949121274, -0.048046098286286, -0.3457708779908717, -0.17325660209171473, -0.16651758746942505, 0.06831487814895809, -0.1796089964636485, -0.1638358748704195, 0.40020885702222586, 0.07580626016482711, 0.17775089152157306, 0.08667834113352, 0.19355490421876312, 0.06502560701221227, 0.051871607825160024, 0.09648891053628177, 0.0980435193516314, 0.17212688639760018, -0.054778592679649594, -0.21567573271691798, -0.07068870443850755, 0.14098622282966972] |
1,802.07777 | On the polar Orlicz-Minkowski problems and the $p$-capacitary
Orlicz-Petty bodies | In this paper, we propose and study the polar Orlicz-Minkowski problems:
under what conditions on a nonzero finite measure $\mu$ and a continuous
function $\varphi:(0,\infty)\rightarrow(0,\infty)$, there exists a convex body
$K\in\mathcal{K}_0$ such that $K$ is an optimizer of the following optimization
problems: \begin{equation*} \inf/\sup \bigg\{\int_{S^{n-1}}\varphi\big( h_L
\big) \,d \mu: L \in \mathcal{K}_{0} \ \text{and}\ |L^\circ|=\omega_{n}\bigg\}.
\end{equation*} The solvability of the polar Orlicz-Minkowski problems is
discussed under different conditions. In particular, under certain conditions
on $\varphi,$ the existence of a solution is proved for a nonzero finite
measure $\mu$ on $S^{n-1}$ which is not concentrated on any hemisphere of
$S^{n-1}.$ Another part of this paper deals with the $p$-capacitary
Orlicz-Petty bodies. In particular, the existence of the $p$-capacitary
Orlicz-Petty bodies is established and the continuity of the $p$-capacitary
Orlicz-Petty bodies is proved.
| math.MG | in this paper we propose and study the polar orliczminkowski problems under what conditions on a nonzero finite measure mu and a continuous function varphi0inftyrightarrow0infty there exists a convex body kinmathcalk_0 such that k is an optimizer of the following optimization problems beginequation infsup biggint_sn1varphibig h_l big d mu l in mathcalk_0 textand lcircomega_nbigg endequation the solvability of the polar orliczminkowski problems is discussed under different conditions in particular under certain conditions on varphi the existence of a solution is proved for a nonzero finite measure mu on sn1 which is not concentrated on any hemisphere of sn1 another part of this paper deals with the pcapacitary orliczpetty bodies in particular the existence of the pcapacitary orliczpetty bodies is established and the continuity of the pcapacitary orliczpetty bodies is proved | [['in', 'this', 'paper', 'we', 'propose', 'and', 'study', 'the', 'polar', 'orliczminkowski', 'problems', 'under', 'what', 'conditions', 'on', 'a', 'nonzero', 'finite', 'measure', 'mu', 'and', 'a', 'continuous', 'function', 'varphi0inftyrightarrow0infty', 'there', 'exists', 'a', 'convex', 'body', 'kinmathcalk_0', 'such', 'that', 'k', 'is', 'an', 'optimizer', 'of', 'the', 'following', 'optimization', 'problems', 'beginequation', 'infsup', 'biggint_sn1varphibig', 'h_l', 'big', 'd', 'mu', 'l', 'in', 'mathcalk_0', 'textand', 'lcircomega_nbigg', 'endequation', 'the', 'solvability', 'of', 'the', 'polar', 'orliczminkowski', 'problems', 'is', 'discussed', 'under', 'different', 'conditions', 'in', 'particular', 'under', 'certain', 'conditions', 'on', 'varphi', 'the', 'existence', 'of', 'a', 'solution', 'is', 'proved', 'for', 'a', 'nonzero', 'finite', 'measure', 'mu', 'on', 'sn1', 'which', 'is', 'not', 'concentrated', 'on', 'any', 'hemisphere', 'of', 'sn1', 'another', 'part', 'of', 'this', 'paper', 'deals', 'with', 'the', 'pcapacitary', 'orliczpetty', 'bodies', 'in', 'particular', 'the', 'existence', 'of', 'the', 'pcapacitary', 'orliczpetty', 'bodies', 'is', 'established', 'and', 'the', 'continuity', 'of', 'the', 'pcapacitary', 'orliczpetty', 'bodies', 'is', 'proved']] | [-0.22029259205982088, 0.07667012817889918, -0.07518904389068484, 0.04448034140840173, -0.03821921388991177, -0.12275847101444379, -0.0220182366874069, 0.3116979229673743, -0.2816748176962137, -0.13830543927848338, 0.15380508602410556, -0.2747083931490779, -0.12499461171030998, 0.1669067179337144, -0.1443754727728665, 0.06003696290403605, 0.052961151085793974, 0.07214032731950283, -0.08949484232626856, -0.2258866591276601, 0.3593793056309223, -0.07703323043882847, 0.19584685435518623, 0.10543653541104868, 0.13304452266171574, -0.011276662550866604, 0.05421223748102784, 0.01048668385669589, -0.23922423688537675, 0.08734295893833041, 0.21080385722965003, 0.13242450581490994, 0.319869139790535, -0.34603695723414424, -0.1651375266071409, 0.20278932578116654, 0.061714445408433675, -0.04674210945959203, -0.06503770099207759, -0.2548177443295717, 0.1508428494622931, -0.059687532678246495, -0.16707055396586656, -0.0025734268557280303, 0.08542100386321545, 0.02273765323869884, -0.3482535326965153, 0.05930632746987976, 0.1199293739888817, 0.07553762308508158, -0.13779754327982663, -0.14811007788404823, 0.026911438159644602, 0.03997619036212564, 0.07009391216561198, 0.08282045980356634, 0.050988250963389874, -0.05546960746869445, -0.04102402781601995, 0.40920611571520565, -0.06041498990356922, -0.28601375702023507, 0.17339430601149797, -0.16936054499447345, -0.15022182572633028, 0.07857454364746809, 0.14823058331478386, 0.20823987991549076, -0.15463082123547792, 0.2035873101190664, -0.15050048916228115, 0.11389140401780605, 0.12039421807974576, -3.6711033433675765e-05, 0.12137617517076432, 0.11551680154725909, 0.1996661833152175, 0.1517820525765419, -0.01985876866802573, -0.05815228758752346, -0.36658067774772646, -0.17533563255518675, -0.1855715677011758, 0.07972830078948755, -0.06161625556612853, -0.16901858201355208, 0.298741824506782, 0.04783541707135737, 0.15315235364437102, 0.05533907342050225, 0.2274127048207447, 0.10095261009037494, -0.002743260381743312, 0.06889086697995662, 0.17747000528872012, 0.1480961575359106, 0.10048198871314526, -0.2208438767939806, 0.07150300265476107, 0.11638112032227219] |
1,802.07778 | Left Ventricle Segmentation in Cardiac MR Images Using Fully
Convolutional Network | Medical image analysis, especially segmenting a specific organ, has an
important role in developing clinical decision support systems. In cardiac
magnetic resonance (MR) imaging, segmenting the left and right ventricles helps
physicians diagnose different heart abnormalities. There are challenges for
this task, including the intensity and shape similarity between left ventricle
and other organs, inaccurate boundaries and presence of noise in most of the
images. In this paper we propose an automated method for segmenting the left
ventricle in cardiac MR images. We first automatically extract the region of
interest, and then employ it as an input of a fully convolutional network. We
train the network accurately despite the small number of left ventricle pixels
in comparison with the whole image. Thresholding on the output map of the fully
convolutional network and selection of regions based on their roundness are
performed in our proposed post-processing phase. The Dice score of our method
reaches 87.24% by applying this algorithm on the York dataset of heart images.
| cs.CV | medical image analysis especially segmenting a specific organ has an important role in developing clinical decision support systems in cardiac magnetic resonance mr imaging segmenting the left and right ventricles helps physicians diagnose different heart abnormalities there are challenges for this task including the intensity and shape similarity between left ventricle and other organs inaccurate boundaries and presence of noise in most of the images in this paper we propose an automated method for segmenting the left ventricle in cardiac mr images we first automatically extract the region of interest and then employ it as an input of a fully convolutional network we train the network accurately despite the small number of left ventricle pixels in comparison with the whole image thresholding on the output map of the fully convolutional network and selection of regions based on their roundness are performed in our proposed postprocessing phase the dice score of our method reaches 8724 by applying this algorithm on the york dataset of heart images | [['medical', 'image', 'analysis', 'especially', 'segmenting', 'a', 'specific', 'organ', 'has', 'an', 'important', 'role', 'in', 'developing', 'clinical', 'decision', 'support', 'systems', 'in', 'cardiac', 'magnetic', 'resonance', 'mr', 'imaging', 'segmenting', 'the', 'left', 'and', 'right', 'ventricles', 'helps', 'physicians', 'diagnose', 'different', 'heart', 'abnormalities', 'there', 'are', 'challenges', 'for', 'this', 'task', 'including', 'the', 'intensity', 'and', 'shape', 'similarity', 'between', 'left', 'ventricle', 'and', 'other', 'organs', 'inaccurate', 'boundaries', 'and', 'presence', 'of', 'noise', 'in', 'most', 'of', 'the', 'images', 'in', 'this', 'paper', 'we', 'propose', 'an', 'automated', 'method', 'for', 'segmenting', 'the', 'left', 'ventricle', 'in', 'cardiac', 'mr', 'images', 'we', 'first', 'automatically', 'extract', 'the', 'region', 'of', 'interest', 'and', 'then', 'employ', 'it', 'as', 'an', 'input', 'of', 'a', 'fully', 'convolutional', 'network', 'we', 'train', 'the', 'network', 'accurately', 'despite', 'the', 'small', 'number', 'of', 'left', 'ventricle', 'pixels', 'in', 'comparison', 'with', 'the', 'whole', 'image', 'thresholding', 'on', 'the', 'output', 'map', 'of', 'the', 'fully', 'convolutional', 'network', 'and', 'selection', 'of', 'regions', 'based', 'on', 'their', 'roundness', 'are', 'performed', 'in', 'our', 'proposed', 'postprocessing', 'phase', 'the', 'dice', 'score', 'of', 'our', 'method', 'reaches', '8724', 'by', 'applying', 'this', 'algorithm', 'on', 'the', 'york', 'dataset', 'of', 'heart', 'images']] | [-0.039800944085028475, -0.007712325534556861, -0.030219112794062624, 0.026623064385891734, -0.05119512159882749, -0.1430145424688462, -0.010250625179983994, 0.4364701186352205, -0.24619115423766055, -0.28575541332886534, 0.13310431408562426, -0.28147467832853335, -0.1956113090074235, 0.19768577868902557, -0.1601649626435374, 0.06058443232124285, 0.10390144168887651, 0.07831763088839447, -0.0014116052799381133, -0.21570490573876447, 0.29227338456861085, 0.007825051133361896, 0.33136675238791036, 0.013384364262115346, 0.14387106245934464, -0.006897741327809011, -0.04852595647637982, -0.01543777019123365, -0.06187244361584506, 0.1575694296568655, 0.30644047076859304, 0.17704008763553802, 0.34125015195799857, -0.4318573833613588, -0.1779291842064661, 0.0900982216471897, 0.17180035919981737, 0.06642077793935086, -0.0579309350485834, -0.3763675725857, 0.0974474320785858, -0.08171303461823277, 0.019388965207681616, -0.09998684877348019, -0.004539197092881517, -0.06421122851031946, -0.28230721752795324, 0.13502258379700902, 0.020678802728425802, 0.12682035766831576, -0.10888114276557888, -0.08906728521886668, 0.010905538188725165, 0.2508216814035777, 0.018536904147434297, 0.08218975899820556, 0.16866180405770315, -0.23114273246383385, -0.07330933739374415, 0.3259331209630501, 0.025734515854997968, -0.21246221905471985, 0.15915644327434142, -0.11666540275952529, -0.10959974683753056, 0.11190478095966505, 0.19103116590938554, 0.13088759208856174, -0.1695025026139508, -0.017258098876393378, -0.013853906435187816, 0.17001136035442624, 0.08973150489931335, -0.0641118081275192, 0.19009148700889655, 0.265909296256013, -0.016753873421537984, 0.14700732229699143, -0.2506823564917573, 0.022760975507525275, -0.2330406082385197, -0.13921108560192275, -0.14522359132335136, -0.06222348958287578, -0.09926633178998245, -0.2135765153457547, 0.4557955825428774, 0.2443927898542514, 0.21750285233961555, 0.035450252163417004, 0.3377505907130132, 0.008630080935800812, 0.08593303332582297, 0.031092023993373803, 0.16513614370146903, 0.06405359162613977, 0.11600834720415949, -0.21344407000181423, 0.09317333969889527, 0.08014284107811386] |
1,802.07779 | Path-Based Function Embedding and its Application to Specification
Mining | Identifying the relationships among program elements is useful for program
understanding, debugging, and analysis. One such relationship is synonymy.
Function synonyms are functions that play a similar role in code, e.g.
functions that perform initialization for different device drivers, or
functions that implement different symmetric-key encryption schemes. Function
synonyms are not necessarily semantically equivalent and can be syntactically
dissimilar; consequently, approaches for identifying code clones or functional
equivalence cannot be used to identify them. This paper presents func2vec, an
algorithm that maps each function to a vector in a vector space such that
function synonyms are grouped together. We compute the function embedding by
training a neural network on sentences generated from random walks over an
encoding of the program as a labeled pushdown system (l-PDS). We demonstrate
that func2vec is effective at identifying function synonyms in the Linux
kernel. Furthermore, we show how function synonyms enable mining error-handling
specifications with high support in Linux file systems and drivers.
| cs.SE | identifying the relationships among program elements is useful for program understanding debugging and analysis one such relationship is synonymy function synonyms are functions that play a similar role in code eg functions that perform initialization for different device drivers or functions that implement different symmetrickey encryption schemes function synonyms are not necessarily semantically equivalent and can be syntactically dissimilar consequently approaches for identifying code clones or functional equivalence cannot be used to identify them this paper presents func2vec an algorithm that maps each function to a vector in a vector space such that function synonyms are grouped together we compute the function embedding by training a neural network on sentences generated from random walks over an encoding of the program as a labeled pushdown system lpds we demonstrate that func2vec is effective at identifying function synonyms in the linux kernel furthermore we show how function synonyms enable mining errorhandling specifications with high support in linux file systems and drivers | [['identifying', 'the', 'relationships', 'among', 'program', 'elements', 'is', 'useful', 'for', 'program', 'understanding', 'debugging', 'and', 'analysis', 'one', 'such', 'relationship', 'is', 'synonymy', 'function', 'synonyms', 'are', 'functions', 'that', 'play', 'a', 'similar', 'role', 'in', 'code', 'eg', 'functions', 'that', 'perform', 'initialization', 'for', 'different', 'device', 'drivers', 'or', 'functions', 'that', 'implement', 'different', 'symmetrickey', 'encryption', 'schemes', 'function', 'synonyms', 'are', 'not', 'necessarily', 'semantically', 'equivalent', 'and', 'can', 'be', 'syntactically', 'dissimilar', 'consequently', 'approaches', 'for', 'identifying', 'code', 'clones', 'or', 'functional', 'equivalence', 'can', 'not', 'be', 'used', 'to', 'identify', 'them', 'this', 'paper', 'presents', 'func2vec', 'an', 'algorithm', 'that', 'maps', 'each', 'function', 'to', 'a', 'vector', 'in', 'a', 'vector', 'space', 'such', 'that', 'function', 'synonyms', 'are', 'grouped', 'together', 'we', 'compute', 'the', 'function', 'embedding', 'by', 'training', 'a', 'neural', 'network', 'on', 'sentences', 'generated', 'from', 'random', 'walks', 'over', 'an', 'encoding', 'of', 'the', 'program', 'as', 'a', 'labeled', 'pushdown', 'system', 'lpds', 'we', 'demonstrate', 'that', 'func2vec', 'is', 'effective', 'at', 'identifying', 'function', 'synonyms', 'in', 'the', 'linux', 'kernel', 'furthermore', 'we', 'show', 'how', 'function', 'synonyms', 'enable', 'mining', 'errorhandling', 'specifications', 'with', 'high', 'support', 'in', 'linux', 'file', 'systems', 'and', 'drivers']] | [-0.09822491578354388, 0.05749199464105242, -0.07758669664335859, 0.14487929063979654, -0.11334308713176258, -0.20139342206856534, 0.0392098068636894, 0.4507082102310126, -0.32174458263358874, -0.30174853396453677, 0.06181829391569374, -0.28774192465386195, -0.18592053330592384, 0.20991670928308206, -0.07159517996108077, 0.08182028356856506, 0.08134536505350547, 0.006573203042042768, -0.0644762709790212, -0.2556404208573127, 0.34844599826154626, 0.005443633931457617, 0.27152559259657266, -0.0034844144262302264, 0.09006260755346943, 0.024018007035479898, -0.0328873641444904, -0.010225679474225813, -0.03899615828181798, 0.10039618046610219, 0.35992012641564675, 0.26473742404620454, 0.30423428548594855, -0.39429637041109006, -0.17161841162593122, 0.10479006299654105, 0.14040998740677477, 0.08290149789054398, -0.010900128948662406, -0.2766424080202724, 0.12911941237439206, -0.1836103371694494, -0.01076680595339958, -0.1372395153157413, 0.01645937437417021, 0.0762984636506647, -0.27618830095513897, -0.03369410661479998, 0.05437015009221657, 0.08187016813309898, -0.036347362476810335, -0.09644958610234153, -0.017233016461750884, 0.1765235853470435, -0.01753963423417555, 0.09845630725798239, 0.14847006702463433, -0.1274810274692169, -0.148142251401849, 0.35130627911870077, -0.02901946302728763, -0.2691006407009699, 0.20626942000417098, -0.03066653911629395, -0.16959343338681823, 0.05441594502301353, 0.20395661418320268, 0.0828263035124156, -0.17707991213270813, 0.024781752431507157, -0.041343334273310606, 0.21354326735410817, 0.06301201729305611, 0.05812442383378934, 0.19940050116259675, 0.1517316659936195, 0.03431100726934375, 0.15232800049736953, 0.017143213388674663, -0.04024107639149875, -0.26915488400419424, -0.1694113954569504, -0.15940722601286544, -0.048341592748954915, -0.09707644257583628, -0.193055754913029, 0.3809895586121566, 0.17694112744811138, 0.18770138909269102, 0.10128912709172887, 0.29950898728677466, 0.08591374100088053, 0.1653839909845287, 0.11499820962239793, 0.07361481280902483, 0.01784775820768373, 0.0781406387983329, -0.12980553921412938, 0.15384586429472563, 0.10467807279368062] |
1,802.0778 | Proving ergodicity via divergence of ergodic sums | A classical fact in ergodic theory is that ergodicity is equivalent to almost
everywhere divergence of ergodic sums of all nonnegative integrable functions
which are not identically zero. We show two methods, one in the measure
preserving case and one in the nonsingular case, which enable one to prove this
criteria by checking it on a dense collection of functions and then extending
it to all nonnegative functions. The first method is then used in a new proof
of a folklore criterion for ergodicity of Poisson suspensions which does not
make any reference to Fock spaces. The second method which involves the double
tail relation is used to show that a large class of nonsingular Bernoulli and
inhomogeneous Markov shifts are ergodic if and only if they are conservative.
In the last section we discuss an extension of the Bernoulli shift result to
other countable groups including $\mathbb{Z}^{d},\ d\geq 2$ and discrete
Heisenberg groups.
| math.DS math.PR | a classical fact in ergodic theory is that ergodicity is equivalent to almost everywhere divergence of ergodic sums of all nonnegative integrable functions which are not identically zero we show two methods one in the measure preserving case and one in the nonsingular case which enable one to prove this criteria by checking it on a dense collection of functions and then extending it to all nonnegative functions the first method is then used in a new proof of a folklore criterion for ergodicity of poisson suspensions which does not make any reference to fock spaces the second method which involves the double tail relation is used to show that a large class of nonsingular bernoulli and inhomogeneous markov shifts are ergodic if and only if they are conservative in the last section we discuss an extension of the bernoulli shift result to other countable groups including mathbbzd dgeq 2 and discrete heisenberg groups | [['a', 'classical', 'fact', 'in', 'ergodic', 'theory', 'is', 'that', 'ergodicity', 'is', 'equivalent', 'to', 'almost', 'everywhere', 'divergence', 'of', 'ergodic', 'sums', 'of', 'all', 'nonnegative', 'integrable', 'functions', 'which', 'are', 'not', 'identically', 'zero', 'we', 'show', 'two', 'methods', 'one', 'in', 'the', 'measure', 'preserving', 'case', 'and', 'one', 'in', 'the', 'nonsingular', 'case', 'which', 'enable', 'one', 'to', 'prove', 'this', 'criteria', 'by', 'checking', 'it', 'on', 'a', 'dense', 'collection', 'of', 'functions', 'and', 'then', 'extending', 'it', 'to', 'all', 'nonnegative', 'functions', 'the', 'first', 'method', 'is', 'then', 'used', 'in', 'a', 'new', 'proof', 'of', 'a', 'folklore', 'criterion', 'for', 'ergodicity', 'of', 'poisson', 'suspensions', 'which', 'does', 'not', 'make', 'any', 'reference', 'to', 'fock', 'spaces', 'the', 'second', 'method', 'which', 'involves', 'the', 'double', 'tail', 'relation', 'is', 'used', 'to', 'show', 'that', 'a', 'large', 'class', 'of', 'nonsingular', 'bernoulli', 'and', 'inhomogeneous', 'markov', 'shifts', 'are', 'ergodic', 'if', 'and', 'only', 'if', 'they', 'are', 'conservative', 'in', 'the', 'last', 'section', 'we', 'discuss', 'an', 'extension', 'of', 'the', 'bernoulli', 'shift', 'result', 'to', 'other', 'countable', 'groups', 'including', 'mathbbzd', 'dgeq', '2', 'and', 'discrete', 'heisenberg', 'groups']] | [-0.09672770196535661, 0.148135714690362, -0.10294341624944241, 0.09655990870820673, -0.0663283775143277, -0.16264571955536383, 0.01606820190745684, 0.3779557675377212, -0.3058589802474364, -0.1562346852983215, 0.13504740594986028, -0.25918646546854796, -0.151706937405692, 0.20588190855447797, -0.08862342378699112, 0.04946290535320129, 0.030977599044608606, 0.09754740870739152, -0.07824360808529951, -0.3014615209744457, 0.3510949589318124, -0.059920075225534955, 0.24704772701438565, 0.053319027964872395, 0.1303822862637035, 0.03400547559034418, -0.039945524619807576, -0.00352357401944963, -0.1253436230635762, 0.09324799246735291, 0.24384974909934226, 0.09818640969808565, 0.27559986362209565, -0.32725081059706773, -0.1904303426068131, 0.2113359746607867, 0.12351135617158339, 0.07563197682006889, 0.0077860151159020695, -0.2706492313081036, 0.12407949701625878, -0.16959620633634268, -0.14719625364372194, -0.08044712723050623, 0.018255343878424014, 0.06518148823169531, -0.2884406042345739, 0.05976734124426428, 0.15869975015037247, 0.026006108246646918, -0.05056998909257546, -0.07401188163921334, -0.00013578752684709314, 0.10907388686855601, 0.03844212525366963, 0.017734498408465804, 0.08007625899846096, -0.04711797204346384, -0.11101389966463646, 0.3783033478085871, -0.07182833804316553, -0.26633328253814537, 0.1825778135340419, -0.17860983469668631, -0.21098910314605462, 0.13701816732608169, 0.10126985088232662, 0.12366144866349973, -0.13059881749841107, 0.12281343704747193, -0.07706307243954923, 0.14234701723053858, 0.061505494720919374, 0.0009489731028579272, 0.1343861206059719, 0.05961093199877794, 0.15801257477141917, 0.13050018885367937, 0.011895414116012247, -0.1226937007140096, -0.33892412792117177, -0.17145382888107139, -0.19751495673085334, 0.1000963189586613, -0.08802974198643623, -0.2285419378381271, 0.3240940151373287, 0.10940034219552158, 0.15987060648879012, 0.11890686487525025, 0.2501233230502187, 0.12059033335513109, 0.017864105119096838, 0.07958457510095912, 0.1504433164856844, 0.18730955466426993, 0.03696476453771609, -0.10014895162966206, 0.031329630813621855, 0.14985015328562298] |
1,802.07781 | Lossless Image Compression Algorithm for Wireless Capsule Endoscopy by
Content-Based Classification of Image Blocks | Recent advances in capsule endoscopy systems have introduced new methods and
capabilities. The capsule endoscopy system, by observing the entire digestive
tract, has significantly improved diagnosing gastrointestinal disorders and
diseases. The system has challenges such as the need to enhance the quality of
the transmitted images, low frame rates of transmission, and battery lifetime
that need to be addressed. One of the important parts of a capsule endoscopy
system is the image compression unit. Better compression of images increases
the frame rate and hence improves the diagnosis process. In this paper a high
precision compression algorithm with high compression ratio is proposed. In
this algorithm we use the similarity between frames to compress the data more
efficiently.
| cs.CV | recent advances in capsule endoscopy systems have introduced new methods and capabilities the capsule endoscopy system by observing the entire digestive tract has significantly improved diagnosing gastrointestinal disorders and diseases the system has challenges such as the need to enhance the quality of the transmitted images low frame rates of transmission and battery lifetime that need to be addressed one of the important parts of a capsule endoscopy system is the image compression unit better compression of images increases the frame rate and hence improves the diagnosis process in this paper a high precision compression algorithm with high compression ratio is proposed in this algorithm we use the similarity between frames to compress the data more efficiently | [['recent', 'advances', 'in', 'capsule', 'endoscopy', 'systems', 'have', 'introduced', 'new', 'methods', 'and', 'capabilities', 'the', 'capsule', 'endoscopy', 'system', 'by', 'observing', 'the', 'entire', 'digestive', 'tract', 'has', 'significantly', 'improved', 'diagnosing', 'gastrointestinal', 'disorders', 'and', 'diseases', 'the', 'system', 'has', 'challenges', 'such', 'as', 'the', 'need', 'to', 'enhance', 'the', 'quality', 'of', 'the', 'transmitted', 'images', 'low', 'frame', 'rates', 'of', 'transmission', 'and', 'battery', 'lifetime', 'that', 'need', 'to', 'be', 'addressed', 'one', 'of', 'the', 'important', 'parts', 'of', 'a', 'capsule', 'endoscopy', 'system', 'is', 'the', 'image', 'compression', 'unit', 'better', 'compression', 'of', 'images', 'increases', 'the', 'frame', 'rate', 'and', 'hence', 'improves', 'the', 'diagnosis', 'process', 'in', 'this', 'paper', 'a', 'high', 'precision', 'compression', 'algorithm', 'with', 'high', 'compression', 'ratio', 'is', 'proposed', 'in', 'this', 'algorithm', 'we', 'use', 'the', 'similarity', 'between', 'frames', 'to', 'compress', 'the', 'data', 'more', 'efficiently']] | [-0.10834780318212783, 0.03721201036555263, -0.042469681735134594, 0.006485286907621378, -0.023341323935593933, -0.14718717776047877, 0.028334477073592573, 0.407083837968162, -0.27822967464279413, -0.2938344932646833, 0.12532044855308616, -0.2370150501274655, -0.1866862905394827, 0.20204779426129454, -0.1808930160676758, 0.11874973859924537, 0.13543015844825432, 0.035290350455942, -0.04841042223036226, -0.274877620773374, 0.23954505366711026, 0.14546091900740424, 0.37070773591279477, 0.04134467144647979, 0.09506893513871469, 0.014979687947222693, -0.01178770444284265, -0.029184659652443778, -0.06411915098379901, 0.19368312342299354, 0.280484553744905, 0.21151529443569672, 0.30860672963974184, -0.4291502177778982, -0.29395468223792237, 0.08045118477625343, 0.18207815685110468, 0.08278557721676671, -0.05997323541980113, -0.278041729148334, 0.11757489778778046, -0.19468098304146886, -0.043382481612169586, -0.06805629606366667, 0.014195161336300593, 0.007675043726140936, -0.27489450889834577, 0.0807931472419992, 0.016312018904484745, 0.05971090497974402, -0.09383398502603428, -0.0436839854482036, 0.05425769665366054, 0.21958611500409678, 0.048659432985626846, 0.11016915860370947, 0.18855936179319635, -0.19475391281482118, -0.0708098822973796, 0.3810690457924691, -0.017801817233920988, -0.17714580045376196, 0.1904928113401541, -0.09504725485960515, -0.07976911146254438, 0.17459132418864304, 0.2191572515373556, 0.09569170007593611, -0.120188963583583, -0.027123230095290076, 0.03431096852908277, 0.17742458049160165, 0.09388525655063298, 0.008217962934341058, 0.15044710175412843, 0.21507840514437765, 0.009122000953469139, 0.14634038062873655, -0.15084480655849233, 0.02036506444032694, -0.17586417895797482, -0.20387963427660558, -0.14729889640166688, -0.04097287408991629, -0.06988218077607691, -0.08010121076427495, 0.38922134426255256, 0.2040125570124668, 0.20878832396239233, 0.010759631631513819, 0.4020646197231821, 0.06375076358592631, 0.14003300267215976, 0.021832993978427515, 0.2179815529797895, 0.07736318146324374, 0.1622799879226547, -0.19911603603321007, 0.07845107351855622, 0.049261924360966325] |
1,802.07782 | Artificial Intelligence and Legal Liability | A recent issue of a popular computing journal asked which laws would apply if
a self-driving car killed a pedestrian. This paper considers the question of
legal liability for artificially intelligent computer systems. It discusses
whether criminal liability could ever apply; to whom it might apply; and, under
civil law, whether an AI program is a product that is subject to product design
legislation or a service to which the tort of negligence applies. The issue of
sales warranties is also considered. A discussion of some of the practical
limitations that AI systems are subject to is also included.
| cs.AI cs.CY | a recent issue of a popular computing journal asked which laws would apply if a selfdriving car killed a pedestrian this paper considers the question of legal liability for artificially intelligent computer systems it discusses whether criminal liability could ever apply to whom it might apply and under civil law whether an ai program is a product that is subject to product design legislation or a service to which the tort of negligence applies the issue of sales warranties is also considered a discussion of some of the practical limitations that ai systems are subject to is also included | [['a', 'recent', 'issue', 'of', 'a', 'popular', 'computing', 'journal', 'asked', 'which', 'laws', 'would', 'apply', 'if', 'a', 'selfdriving', 'car', 'killed', 'a', 'pedestrian', 'this', 'paper', 'considers', 'the', 'question', 'of', 'legal', 'liability', 'for', 'artificially', 'intelligent', 'computer', 'systems', 'it', 'discusses', 'whether', 'criminal', 'liability', 'could', 'ever', 'apply', 'to', 'whom', 'it', 'might', 'apply', 'and', 'under', 'civil', 'law', 'whether', 'an', 'ai', 'program', 'is', 'a', 'product', 'that', 'is', 'subject', 'to', 'product', 'design', 'legislation', 'or', 'a', 'service', 'to', 'which', 'the', 'tort', 'of', 'negligence', 'applies', 'the', 'issue', 'of', 'sales', 'warranties', 'is', 'also', 'considered', 'a', 'discussion', 'of', 'some', 'of', 'the', 'practical', 'limitations', 'that', 'ai', 'systems', 'are', 'subject', 'to', 'is', 'also', 'included']] | [-0.1188355264995171, 0.06691422410043817, -0.09577015303645511, 0.08006415494800218, -0.1667216410100156, -0.20311638880616092, 0.08359477194430003, 0.33270282948351637, -0.2600429637918287, -0.2733087504653222, 0.17075073170447153, -0.284129706924135, -0.1854029810935145, 0.21021744058400924, -0.2180010792704261, 0.057584783318927704, 0.08068538850353917, 0.06367346361203462, 0.04767020960452453, -0.3149526451823625, 0.3357613077197148, 0.048757844162648736, 0.2814005334025287, 0.09553743182498563, 0.052428999221978745, -0.0011356399175996075, -0.03942529116852247, 0.0029051990001177303, -0.0924693581284967, 0.1334105585226599, 0.3123979895964873, 0.22592784110361672, 0.4200899924854843, -0.41397968763295484, -0.16370306815001734, 0.13766805976819324, 0.12281501176410678, 0.05011882236445969, -0.034345187973801275, -0.27625722896630817, 0.062239669127755366, -0.2634867217904907, -0.15146697123685843, -0.048764224648855777, 0.09299138051514723, -0.023931309799378624, -0.2633281581903266, -0.015827045600733017, 0.063902613046408, 0.0766783420908816, -0.010875973382451552, -0.07036024547771227, 0.035120678384911876, 0.1783067299818088, 0.09779462040573055, -0.005754598169302454, 0.17380205892520595, -0.14633740770526002, -0.16069953558415326, 0.4597205054014921, 0.07759915241420422, -0.1891259399565811, 0.16963021686699772, -0.03686394063608569, -0.18384000350131977, 0.012215035897442045, 0.21539346757820066, 0.0583226658604779, -0.2112177822026733, 0.04355386310976892, -0.061441200348187466, 0.16213000508747538, 0.05216954208492321, -0.06343081113597264, 0.21595268572053436, 0.18925471408102584, 0.11622395918571524, 0.10287687529059013, -0.002497308659462296, -0.09019427069899988, -0.22687863530020932, -0.17011618084388272, -0.1328494940808385, 0.10124774263430462, 0.039649656688828944, -0.15937203355133533, 0.3400220904423266, 0.2178127582622122, 0.08344502327013381, 0.0041520917593330445, 0.30738066567336114, 0.08618211196925567, 0.027087027577645317, 0.06451333163078038, 0.1654467172317839, 0.030175457337909207, 0.18888412750497155, -0.13326135167747508, 0.14331388376220794, 0.002336090772735829] |
1,802.07783 | Multi-Terminal Memtransistors from Polycrystalline Monolayer MoS2 | In the last decade, a 2-terminal passive circuit element called a memristor
has been developed for non-volatile resistive random access memory and has more
recently shown promise for neuromorphic computing. Compared to flash memory,
memristors have higher endurance, multi-bit data storage, and faster read/write
times. However, although 2-terminal memristors have demonstrated basic neural
functions, synapses in the human brain outnumber neurons by more than a factor
of 1000, which implies that multiterminal memristors are needed to perform
complex functions such as heterosynaptic plasticity. Previous attempts to move
beyond 2-terminal memristors include the 3-terminal Widrow-Hoff memistor and
field-effect transistors with nanoionic gates or floating gates, albeit without
memristive switching in the transistor. Here, we report the scalable
experimental realization of a multi-terminal hybrid memristor and transistor
(i.e., memtransistor) using polycrystalline monolayer MoS2. Two-dimensional
(2D) MoS2 memtransistors show gate tunability in individual states by 4 orders
of magnitude in addition to large switching ratios with high cycling endurance
and long-term retention of states. In addition to conventional neural learning
behavior of long-term potentiation/depression, 6-terminal MoS2 memtransistors
possess gate-tunable heterosynaptic functionality that is not achievable using
2-terminal memristors. For example, the conductance between a pair of two
floating electrodes (pre-synaptic and post-synaptic neurons) is varied by 10X
by applying voltage pulses to modulatory terminals. In situ scanning probe
microscopy, cryogenic charge transport measurements, and device modeling reveal
that bias-induced MoS2 defect motion drives resistive switching by dynamically
varying Schottky barrier heights.
| cond-mat.mtrl-sci | in the last decade a 2terminal passive circuit element called a memristor has been developed for nonvolatile resistive random access memory and has more recently shown promise for neuromorphic computing compared to flash memory memristors have higher endurance multibit data storage and faster readwrite times however although 2terminal memristors have demonstrated basic neural functions synapses in the human brain outnumber neurons by more than a factor of 1000 which implies that multiterminal memristors are needed to perform complex functions such as heterosynaptic plasticity previous attempts to move beyond 2terminal memristors include the 3terminal widrowhoff memistor and fieldeffect transistors with nanoionic gates or floating gates albeit without memristive switching in the transistor here we report the scalable experimental realization of a multiterminal hybrid memristor and transistor ie memtransistor using polycrystalline monolayer mos2 twodimensional 2d mos2 memtransistors show gate tunability in individual states by 4 orders of magnitude in addition to large switching ratios with high cycling endurance and longterm retention of states in addition to conventional neural learning behavior of longterm potentiationdepression 6terminal mos2 memtransistors possess gatetunable heterosynaptic functionality that is not achievable using 2terminal memristors for example the conductance between a pair of two floating electrodes presynaptic and postsynaptic neurons is varied by 10x by applying voltage pulses to modulatory terminals in situ scanning probe microscopy cryogenic charge transport measurements and device modeling reveal that biasinduced mos2 defect motion drives resistive switching by dynamically varying schottky barrier heights | [['in', 'the', 'last', 'decade', 'a', '2terminal', 'passive', 'circuit', 'element', 'called', 'a', 'memristor', 'has', 'been', 'developed', 'for', 'nonvolatile', 'resistive', 'random', 'access', 'memory', 'and', 'has', 'more', 'recently', 'shown', 'promise', 'for', 'neuromorphic', 'computing', 'compared', 'to', 'flash', 'memory', 'memristors', 'have', 'higher', 'endurance', 'multibit', 'data', 'storage', 'and', 'faster', 'readwrite', 'times', 'however', 'although', '2terminal', 'memristors', 'have', 'demonstrated', 'basic', 'neural', 'functions', 'synapses', 'in', 'the', 'human', 'brain', 'outnumber', 'neurons', 'by', 'more', 'than', 'a', 'factor', 'of', '1000', 'which', 'implies', 'that', 'multiterminal', 'memristors', 'are', 'needed', 'to', 'perform', 'complex', 'functions', 'such', 'as', 'heterosynaptic', 'plasticity', 'previous', 'attempts', 'to', 'move', 'beyond', '2terminal', 'memristors', 'include', 'the', '3terminal', 'widrowhoff', 'memistor', 'and', 'fieldeffect', 'transistors', 'with', 'nanoionic', 'gates', 'or', 'floating', 'gates', 'albeit', 'without', 'memristive', 'switching', 'in', 'the', 'transistor', 'here', 'we', 'report', 'the', 'scalable', 'experimental', 'realization', 'of', 'a', 'multiterminal', 'hybrid', 'memristor', 'and', 'transistor', 'ie', 'memtransistor', 'using', 'polycrystalline', 'monolayer', 'mos2', 'twodimensional', '2d', 'mos2', 'memtransistors', 'show', 'gate', 'tunability', 'in', 'individual', 'states', 'by', '4', 'orders', 'of', 'magnitude', 'in', 'addition', 'to', 'large', 'switching', 'ratios', 'with', 'high', 'cycling', 'endurance', 'and', 'longterm', 'retention', 'of', 'states', 'in', 'addition', 'to', 'conventional', 'neural', 'learning', 'behavior', 'of', 'longterm', 'potentiationdepression', '6terminal', 'mos2', 'memtransistors', 'possess', 'gatetunable', 'heterosynaptic', 'functionality', 'that', 'is', 'not', 'achievable', 'using', '2terminal', 'memristors', 'for', 'example', 'the', 'conductance', 'between', 'a', 'pair', 'of', 'two', 'floating', 'electrodes', 'presynaptic', 'and', 'postsynaptic', 'neurons', 'is', 'varied', 'by', '10x', 'by', 'applying', 'voltage', 'pulses', 'to', 'modulatory', 'terminals', 'in', 'situ', 'scanning', 'probe', 'microscopy', 'cryogenic', 'charge', 'transport', 'measurements', 'and', 'device', 'modeling', 'reveal', 'that', 'biasinduced', 'mos2', 'defect', 'motion', 'drives', 'resistive', 'switching', 'by', 'dynamically', 'varying', 'schottky', 'barrier', 'heights']] | [-0.16351425640621325, 0.13839972191132033, 0.02201967665619161, -0.05796934512698064, -0.012453978683234343, -0.28311071598814785, 0.1110799174101473, 0.4568537215455475, -0.2359270606126286, -0.32002196423550194, -0.005240378239188088, -0.2559893739511235, -0.21061621326828797, 0.26703732346411413, -0.08974692742011915, 0.10324298057896204, 0.015542322777721107, -0.09803213814420737, -0.028768178546188287, -0.2260428870642002, 0.15395816930163747, 0.0461815215058179, 0.34775527373392084, 0.009237446623225497, 0.09740018853808267, -0.07766034839994226, 0.08947086855299019, -0.008381265770289728, -0.0632514604043629, 0.06812091079131605, 0.29339755126115924, -0.04413715539336937, 0.25426381250294167, -0.6002153317706708, -0.24282469644666943, 0.0036805473222261947, 0.1263821877889399, 0.10375345918991948, -0.08827049689306221, -0.2198958601205586, 0.16418358615975684, -0.20074868339519852, -0.008499803179755615, -0.10919738100726221, 0.05751724615215491, 0.05667714660233046, -0.2239204720617869, 0.008084505215350889, 0.04167136613430821, 0.07520944318280388, -0.02248803976476471, -0.10529796849999927, -0.024297666106234767, 0.07680742446177452, -0.06985196422683035, 0.01600530932052459, 0.28027187653570473, -0.13651051504052897, -0.21083150333605516, 0.23628081357540387, -0.014337368542639416, -0.10621081260963279, 0.14851855084849283, -0.137480252647263, -0.025594140397002682, 0.11037384108272102, 0.123326078374695, 0.07150853613295004, -0.1906570405067486, 0.03483088981956204, 0.04767564117996038, 0.2005712926789768, 0.1331970325559696, 0.09798865702424127, 0.20518283534428886, 0.2866670892506233, 0.04959760557683025, 0.14368436220808464, -0.10720286707186864, -0.05676660671209296, -0.16893923145810413, -0.16559610998508736, -0.18866968397289896, 0.15396660639692752, -0.07206930208243041, -0.19526438582546782, 0.39933914363157386, 0.1490932371542972, 0.12573057097585824, 0.04769157729357626, 0.33099305163670933, 0.10588374886757289, 0.21085840661444852, 0.049073836736333296, 0.17971628355797634, 0.16384546463994676, 0.17090199450349325, -0.2382405554024009, 0.1453563752102827, -0.05795376496309908] |
1,802.07784 | LUX Trigger Efficiency | The Large Underground Xenon experiment (LUX) searches for dark matter using a
dual-phase xenon detector. LUX uses a custom-developed trigger system for event
selection. In this paper, the trigger efficiency, which is defined as the
probability that an event of interest is selected for offline analysis, is
studied using raw data obtained from both electron recoil (ER) and nuclear
recoil (NR) calibrations. The measured efficiency exceeds 98\% at a pulse area
of 90 detected photons, which is well below the WIMP analysis threshold on the
S2 pulse area. The efficiency also exceeds 98\% at recoil energies of \mbox{0.2
keV} and above for ER, and \mbox{1.3 keV} and above for NR. The measured
trigger efficiency varies between 99\% and 100\% over the fiducial volume of
the detector.
| physics.ins-det | the large underground xenon experiment lux searches for dark matter using a dualphase xenon detector lux uses a customdeveloped trigger system for event selection in this paper the trigger efficiency which is defined as the probability that an event of interest is selected for offline analysis is studied using raw data obtained from both electron recoil er and nuclear recoil nr calibrations the measured efficiency exceeds 98 at a pulse area of 90 detected photons which is well below the wimp analysis threshold on the s2 pulse area the efficiency also exceeds 98 at recoil energies of mbox02 kev and above for er and mbox13 kev and above for nr the measured trigger efficiency varies between 99 and 100 over the fiducial volume of the detector | [['the', 'large', 'underground', 'xenon', 'experiment', 'lux', 'searches', 'for', 'dark', 'matter', 'using', 'a', 'dualphase', 'xenon', 'detector', 'lux', 'uses', 'a', 'customdeveloped', 'trigger', 'system', 'for', 'event', 'selection', 'in', 'this', 'paper', 'the', 'trigger', 'efficiency', 'which', 'is', 'defined', 'as', 'the', 'probability', 'that', 'an', 'event', 'of', 'interest', 'is', 'selected', 'for', 'offline', 'analysis', 'is', 'studied', 'using', 'raw', 'data', 'obtained', 'from', 'both', 'electron', 'recoil', 'er', 'and', 'nuclear', 'recoil', 'nr', 'calibrations', 'the', 'measured', 'efficiency', 'exceeds', '98', 'at', 'a', 'pulse', 'area', 'of', '90', 'detected', 'photons', 'which', 'is', 'well', 'below', 'the', 'wimp', 'analysis', 'threshold', 'on', 'the', 's2', 'pulse', 'area', 'the', 'efficiency', 'also', 'exceeds', '98', 'at', 'recoil', 'energies', 'of', 'mbox02', 'kev', 'and', 'above', 'for', 'er', 'and', 'mbox13', 'kev', 'and', 'above', 'for', 'nr', 'the', 'measured', 'trigger', 'efficiency', 'varies', 'between', '99', 'and', '100', 'over', 'the', 'fiducial', 'volume', 'of', 'the', 'detector']] | [-0.03672280443471766, 0.15884621349088715, -0.012691191615416639, 0.08705873273579674, 0.025059156202440782, -0.11613352117954844, 0.0800034615874005, 0.3340823114398987, -0.1336381919907346, -0.4271919661757326, 0.04839741530539017, -0.39137812244570663, 0.05800362409753425, 0.25687166190360705, 0.02594257305346189, 0.052786764940397156, 0.07116005318089118, 0.06513013842613286, -0.08352439908213133, -0.20679466523260118, 0.1692894129345434, 0.20204912750951706, 0.29236514773219824, 0.09152382541346483, 0.17843388085490122, 0.03657703208849735, -0.03856842554429726, -0.029834031694448523, -0.12118196534585525, 0.0013844780417369498, 0.2995435230005833, 0.16723701821155695, 0.14329552842912474, -0.3461555483931255, -0.17912141958461894, 0.11800480677535938, 0.1009256376043683, 0.005382759544919545, -0.09826148730128133, -0.31973863419355647, 0.10060255548300882, -0.2348770197866308, -0.06081790053435872, 0.035314433577079925, 0.0113951496840004, 0.04026581605355586, -0.23119244985883275, 0.0998789247877862, 0.004805440358224234, 0.007834961067043966, -0.06490613749784027, -0.12548490188876918, 0.029144671724943984, -0.00774930763403855, 0.0014232047908608952, 0.05823170294470695, 0.28565970876614655, -0.13114216231793585, -0.06335078330049591, 0.3307682942719229, -0.06301008803852563, -0.06728812737480527, 0.1467230991392787, -0.18107373250513187, -0.08589115459096408, 0.25787967355591396, 0.18395142214027263, 0.08496729348741111, -0.13980097844520764, 0.04208082538764669, 0.038682050785169966, 0.24466529963237624, 0.13499643498911493, 0.009064983035357492, 0.21243860966135417, 0.2735843380458743, 0.08527213929881973, 0.06566664959480535, -0.26133204125911896, -0.009495865425936157, -0.352403613635444, -0.1283527650159686, -0.18263586293793313, 0.009043414316575734, -0.05345773661540607, -0.04248533805742139, 0.3722091843974927, 0.08201805274227573, 0.19559437505179836, 0.02270863560636738, 0.319085153555798, 0.08120573395318652, 0.023285677675307998, 0.010472015060874964, 0.34446904468800754, 0.10303036997004622, 0.11964246621561958, -0.19863419977369748, 0.026842043096680316, -0.006717969659685848] |
1,802.07785 | Gate-tunable memristors from monolayer MoS2 | We report here gate-tunable memristors based on monolayer MoS2 grown by
chemical vapor deposition (CVD). These memristors are fabricated in a
field-effect geometry with the channel consisting of polycrystalline MoS2 films
with grain sizes of 3-5 um. The device characteristics show switching ratios up
to 500, with the resistance in individual states being continuously
gate-tunable by over three orders of magnitude. The resistive switching results
from dynamically varying threshold voltage and Schottky barrier heights, whose
underlying physical mechanism appears to be vacancy migration and/or charge
trapping. Top-gated devices achieve reversible tuning of the threshold voltage,
with potential utility in non-volatile memory or neuromorphic architectures.
| physics.app-ph cond-mat.mtrl-sci | we report here gatetunable memristors based on monolayer mos2 grown by chemical vapor deposition cvd these memristors are fabricated in a fieldeffect geometry with the channel consisting of polycrystalline mos2 films with grain sizes of 35 um the device characteristics show switching ratios up to 500 with the resistance in individual states being continuously gatetunable by over three orders of magnitude the resistive switching results from dynamically varying threshold voltage and schottky barrier heights whose underlying physical mechanism appears to be vacancy migration andor charge trapping topgated devices achieve reversible tuning of the threshold voltage with potential utility in nonvolatile memory or neuromorphic architectures | [['we', 'report', 'here', 'gatetunable', 'memristors', 'based', 'on', 'monolayer', 'mos2', 'grown', 'by', 'chemical', 'vapor', 'deposition', 'cvd', 'these', 'memristors', 'are', 'fabricated', 'in', 'a', 'fieldeffect', 'geometry', 'with', 'the', 'channel', 'consisting', 'of', 'polycrystalline', 'mos2', 'films', 'with', 'grain', 'sizes', 'of', '35', 'um', 'the', 'device', 'characteristics', 'show', 'switching', 'ratios', 'up', 'to', '500', 'with', 'the', 'resistance', 'in', 'individual', 'states', 'being', 'continuously', 'gatetunable', 'by', 'over', 'three', 'orders', 'of', 'magnitude', 'the', 'resistive', 'switching', 'results', 'from', 'dynamically', 'varying', 'threshold', 'voltage', 'and', 'schottky', 'barrier', 'heights', 'whose', 'underlying', 'physical', 'mechanism', 'appears', 'to', 'be', 'vacancy', 'migration', 'andor', 'charge', 'trapping', 'topgated', 'devices', 'achieve', 'reversible', 'tuning', 'of', 'the', 'threshold', 'voltage', 'with', 'potential', 'utility', 'in', 'nonvolatile', 'memory', 'or', 'neuromorphic', 'architectures']] | [-0.15197271193252304, 0.1854388864370636, 0.018501984604741804, -0.14950504889174437, 0.022078024863731116, -0.24167217627669182, 0.15930981153752116, 0.5024151789884155, -0.2821361613101684, -0.3514948980882764, -0.009575368710032377, -0.25417318656288374, -0.12794486736171307, 0.2511733759400578, -0.03241736190214466, 0.07390699194421849, -0.031408656863137506, -0.17026672145136848, -0.038856538594700396, -0.23735573176796046, 0.23932270598239624, 0.03447075331524292, 0.37631134739450106, 0.07745811400505212, 0.06248662936895226, -0.1414379165821279, 0.13418932853192717, -0.019027337747572277, -0.16193462240223128, 0.05291624137260861, 0.24990960738908213, -0.1651129565971832, 0.2123479696053367, -0.5276041687466204, -0.2196392096991006, -0.033901622415914275, 0.09408583372491054, 0.10603248918764271, -0.12095437537041456, -0.23001299982178564, 0.15242786566691044, -0.1456116312989392, -0.06483738556212651, -0.018482515986481582, 0.021682501810853586, 0.06976915070733342, -0.2294882989506452, 0.016222404475019384, 0.0051605077751446515, 0.07671162309662367, -0.08492690435335905, -0.17833870548145989, -0.10980120394826652, 0.019392411397487964, -0.060966193973749444, -0.029871721693780273, 0.3832407112349756, -0.09698096007755688, -0.19400477853979772, 0.26268101640072505, -0.02342462844143693, -0.0905276906873601, 0.15050095671736366, -0.17144233310290685, 0.04831691955825171, 0.1520975883893418, 0.13573285075164257, 0.09064783168679032, -0.19961685619245356, 0.04311239347253622, 0.10245541865319516, 0.206125202621199, 0.1711425726825837, 0.11388356269946179, 0.24294065945566848, 0.3036212480197159, 0.0464166467533617, 0.13369546944047145, -0.14188317619846202, -0.03650926041882485, -0.18268412228476685, -0.16739179176203414, -0.17354372368516544, 0.1886803100104981, -0.13641813211576775, -0.22594971655724713, 0.4106712149312863, 0.1454834004935737, 0.1812462915863412, 0.0006712761215357415, 0.2946659765797309, 0.09702216755921164, 0.1890622167736113, 0.011072612148172293, 0.18921224062125055, 0.14704179569917658, 0.18131800174440008, -0.2505245100272497, 0.16539174380579005, -0.08165080347456612] |
1,802.07786 | Reversible Image Watermarking for Health Informatics Systems Using
Distortion Compensation in Wavelet Domain | Reversible image watermarking guaranties restoration of both original cover
and watermark logo from the watermarked image. Capacity and distortion of the
image under reversible watermarking are two important parameters. In this study
a reversible watermarking is investigated with focusing on increasing the
embedding capacity and reducing the distortion in medical images. Integer
wavelet transform is used for embedding where in each iteration, one watermark
bit is embedded in one transform coefficient. We devise a novel approach that
when a coefficient is modified in an iteration, the produced distortion is
compensated in the next iteration. This distortion compensation method would
result in low distortion rate. The proposed method is tested on four types of
medical images including MRI of brain, cardiac MRI, MRI of breast, and
intestinal polyp images. Using a one-level wavelet transform, maximum capacity
of 1.5 BPP is obtained. Experimental results demonstrate that the proposed
method is superior to the state-of-the-art works in terms of capacity and
distortion.
| cs.CV | reversible image watermarking guaranties restoration of both original cover and watermark logo from the watermarked image capacity and distortion of the image under reversible watermarking are two important parameters in this study a reversible watermarking is investigated with focusing on increasing the embedding capacity and reducing the distortion in medical images integer wavelet transform is used for embedding where in each iteration one watermark bit is embedded in one transform coefficient we devise a novel approach that when a coefficient is modified in an iteration the produced distortion is compensated in the next iteration this distortion compensation method would result in low distortion rate the proposed method is tested on four types of medical images including mri of brain cardiac mri mri of breast and intestinal polyp images using a onelevel wavelet transform maximum capacity of 15 bpp is obtained experimental results demonstrate that the proposed method is superior to the stateoftheart works in terms of capacity and distortion | [['reversible', 'image', 'watermarking', 'guaranties', 'restoration', 'of', 'both', 'original', 'cover', 'and', 'watermark', 'logo', 'from', 'the', 'watermarked', 'image', 'capacity', 'and', 'distortion', 'of', 'the', 'image', 'under', 'reversible', 'watermarking', 'are', 'two', 'important', 'parameters', 'in', 'this', 'study', 'a', 'reversible', 'watermarking', 'is', 'investigated', 'with', 'focusing', 'on', 'increasing', 'the', 'embedding', 'capacity', 'and', 'reducing', 'the', 'distortion', 'in', 'medical', 'images', 'integer', 'wavelet', 'transform', 'is', 'used', 'for', 'embedding', 'where', 'in', 'each', 'iteration', 'one', 'watermark', 'bit', 'is', 'embedded', 'in', 'one', 'transform', 'coefficient', 'we', 'devise', 'a', 'novel', 'approach', 'that', 'when', 'a', 'coefficient', 'is', 'modified', 'in', 'an', 'iteration', 'the', 'produced', 'distortion', 'is', 'compensated', 'in', 'the', 'next', 'iteration', 'this', 'distortion', 'compensation', 'method', 'would', 'result', 'in', 'low', 'distortion', 'rate', 'the', 'proposed', 'method', 'is', 'tested', 'on', 'four', 'types', 'of', 'medical', 'images', 'including', 'mri', 'of', 'brain', 'cardiac', 'mri', 'mri', 'of', 'breast', 'and', 'intestinal', 'polyp', 'images', 'using', 'a', 'onelevel', 'wavelet', 'transform', 'maximum', 'capacity', 'of', '15', 'bpp', 'is', 'obtained', 'experimental', 'results', 'demonstrate', 'that', 'the', 'proposed', 'method', 'is', 'superior', 'to', 'the', 'stateoftheart', 'works', 'in', 'terms', 'of', 'capacity', 'and', 'distortion']] | [-0.07934945399591804, 0.0032801163982660014, -0.06225534420718187, 0.0438547067669273, -0.03364441270131688, -0.16546956281347563, 0.02015526193551391, 0.38830502902936637, -0.29643841526681947, -0.23442628215771438, 0.15188561998301847, -0.28976490039015246, -0.18596623430860304, 0.21974801773545127, -0.1739009670992294, 0.10868861725987317, 0.06186682571153268, 0.06439073358621425, -0.04390683161891388, -0.2956416258835907, 0.23660907995925173, 0.037223819871696665, 0.3890551329303369, 0.02297862526432043, 0.10895982946403934, -0.010111537044457856, -0.03206078624997124, -0.0011117483764511984, -0.08165699134351255, 0.12251323815318024, 0.29662004299608274, 0.17898371994624254, 0.2626700627561893, -0.3730502833623978, -0.2520732919117377, 0.06406496412196905, 0.1451924077034547, 0.07941312295437422, -0.1337079520633081, -0.28881557064084046, 0.16558905387130338, -0.0857845131694427, 0.04870609853580688, -0.0912066061084844, -0.04791163401634274, -0.04515288632696951, -0.33079615341932894, 0.10097898757846663, 0.08977414209669479, 0.07885701997709349, -0.10725829280245136, -0.10716706434698225, 0.02286201541505332, 0.1262306025987213, 0.018784029104705877, 0.09416773494584896, 0.1601126691906379, -0.1392230079655752, -0.09058098702064757, 0.37044684315516185, -0.040195017798259014, -0.22231856165980957, 0.11047653195231497, -0.09650997926463496, -0.10769597430414748, 0.18588688638670453, 0.18711065410679564, 0.10541417459084552, -0.14190079236548445, 0.05387217699935947, 0.005581500046775214, 0.21262089349329472, 0.12077936802188274, 0.01359329793350361, 0.0899299012567356, 0.20341099391701636, 0.05570862227142935, 0.23809644592334311, -0.1935755056211924, -0.025907011032719515, -0.20925970453367737, -0.1794441065592867, -0.25147158917370577, -0.05001067137528715, -0.13850399145060996, -0.1356480690612569, 0.4167531320895508, 0.1668240095564873, 0.19152873880727767, 0.016295705482644855, 0.3995144197295578, 0.0817183925032194, 0.1280217048146106, 0.027002928558877617, 0.16043991869046065, 0.07484047347093997, 0.07163302371360408, -0.2016903493105311, 0.06573269357787645, 0.11693854375344075] |
1,802.07787 | On uniqueness of weak solutions of the incompressible Navier-Stokes
equations in 3-dimensional case | In this article we study the uniqueness of the weak solution of the
incompressible Navier-Stokes Equation in the 3-dimensional case with use of
different approach. Here the uniqueness of the obtained by Leray of the weak
solution is proved in the case, when datums from spaces that are densely
contained into spaces of datums for which was proved the existence of the weak
solution. Moreover we investigate the solvability and uniqueness of the weak
solutions of problems associated with investigation of the main problem
| math.AP | in this article we study the uniqueness of the weak solution of the incompressible navierstokes equation in the 3dimensional case with use of different approach here the uniqueness of the obtained by leray of the weak solution is proved in the case when datums from spaces that are densely contained into spaces of datums for which was proved the existence of the weak solution moreover we investigate the solvability and uniqueness of the weak solutions of problems associated with investigation of the main problem | [['in', 'this', 'article', 'we', 'study', 'the', 'uniqueness', 'of', 'the', 'weak', 'solution', 'of', 'the', 'incompressible', 'navierstokes', 'equation', 'in', 'the', '3dimensional', 'case', 'with', 'use', 'of', 'different', 'approach', 'here', 'the', 'uniqueness', 'of', 'the', 'obtained', 'by', 'leray', 'of', 'the', 'weak', 'solution', 'is', 'proved', 'in', 'the', 'case', 'when', 'datums', 'from', 'spaces', 'that', 'are', 'densely', 'contained', 'into', 'spaces', 'of', 'datums', 'for', 'which', 'was', 'proved', 'the', 'existence', 'of', 'the', 'weak', 'solution', 'moreover', 'we', 'investigate', 'the', 'solvability', 'and', 'uniqueness', 'of', 'the', 'weak', 'solutions', 'of', 'problems', 'associated', 'with', 'investigation', 'of', 'the', 'main', 'problem']] | [-0.1412576480014693, 0.005882682846969969, -0.04895616821401442, 0.05762132440715851, -0.01698015308717177, -0.06039310160226056, -0.037195642434415366, 0.27101103755246314, -0.31160580136236693, -0.2213497985198739, 0.17510581257270783, -0.2598760954680897, -0.1289053563738153, 0.18666095625320894, -0.05340728019031563, 0.05959559399412856, 0.10968792854276087, 0.021756771419729506, -0.07552447771775492, -0.23067251340086972, 0.4444708988247883, -0.05481963654580925, 0.26430468560041237, 0.0614404188956888, 0.12625265771722688, -0.008767803182958491, -0.009951581646289145, 0.060882287576705926, -0.1974189091544672, 0.13532321862848698, 0.21906454701508796, 0.07577533149049573, 0.31639410329184364, -0.39948471079003955, -0.1784115279692092, 0.12886524553565928, 0.11389493207735497, 0.08324582753231793, -0.049527655178237526, -0.33157691519729615, 0.17371375358752197, -0.08564652819629937, -0.20284464378242514, -0.04840343959984325, -0.005989289243838617, 0.10230768769369683, -0.2430803105124228, 0.10605016681143925, 0.12461475469172001, 0.012995720774467503, -0.20526870413838574, -0.03868663824340772, -0.013809943948650644, 0.1086490260637393, 0.10642704855196089, -0.004078269234880628, -0.05452617221800167, -0.1452329954814299, -0.06879347045018915, 0.37780773709805326, -0.06896660833375617, -0.23137815607090792, 0.18180190428115783, -0.16065685836310012, -0.12678791098074899, 0.11166738942708998, 0.12140808506713559, 0.18010135746001088, -0.13841210117018254, 0.16541574397498543, -0.13310591798342233, 0.10681486923602365, 0.07637357080446756, 0.003137481870085356, 0.08144923609991868, 0.17602452159848153, 0.13985016619387483, 0.193126774581504, -0.028749141044543302, -0.07915149236491527, -0.34615578861641033, -0.18624129337314071, -0.1507484299973363, 0.09319649494829632, -0.06159152561737019, -0.17846420607973068, 0.37732815698143984, 0.1473033515448194, 0.13117009811546831, 0.05424757773150867, 0.23288105634440268, 0.13117675620153368, -0.0535546892012159, 0.054849781727950485, 0.2700600515568762, 0.1954054546243112, 0.13815939058327958, -0.19931101719460761, 0.029567595914981905, 0.18539213436833096] |
1,802.07788 | Segmentation of Bleeding Regions in Wireless Capsule Endoscopy Images an
Approach for inside Capsule Video Summarization | Wireless capsule endoscopy (WCE) is an effective means of diagnosis of
gastrointestinal disorders. Detection of informative scenes by WCE could reduce
the length of transmitted videos and can help with the diagnosis. In this paper
we propose a simple and efficient method for segmentation of the bleeding
regions in WCE captured images. Suitable color channels are selected and
classified by a multi-layer perceptron (MLP) structure. The MLP structure is
quantized such that the implementation does not require multiplications. The
proposed method is tested by simulation on WCE bleeding image dataset. The
proposed structure is designed considering hardware resource constrains that
exist in WCE systems.
| cs.CV | wireless capsule endoscopy wce is an effective means of diagnosis of gastrointestinal disorders detection of informative scenes by wce could reduce the length of transmitted videos and can help with the diagnosis in this paper we propose a simple and efficient method for segmentation of the bleeding regions in wce captured images suitable color channels are selected and classified by a multilayer perceptron mlp structure the mlp structure is quantized such that the implementation does not require multiplications the proposed method is tested by simulation on wce bleeding image dataset the proposed structure is designed considering hardware resource constrains that exist in wce systems | [['wireless', 'capsule', 'endoscopy', 'wce', 'is', 'an', 'effective', 'means', 'of', 'diagnosis', 'of', 'gastrointestinal', 'disorders', 'detection', 'of', 'informative', 'scenes', 'by', 'wce', 'could', 'reduce', 'the', 'length', 'of', 'transmitted', 'videos', 'and', 'can', 'help', 'with', 'the', 'diagnosis', 'in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'and', 'efficient', 'method', 'for', 'segmentation', 'of', 'the', 'bleeding', 'regions', 'in', 'wce', 'captured', 'images', 'suitable', 'color', 'channels', 'are', 'selected', 'and', 'classified', 'by', 'a', 'multilayer', 'perceptron', 'mlp', 'structure', 'the', 'mlp', 'structure', 'is', 'quantized', 'such', 'that', 'the', 'implementation', 'does', 'not', 'require', 'multiplications', 'the', 'proposed', 'method', 'is', 'tested', 'by', 'simulation', 'on', 'wce', 'bleeding', 'image', 'dataset', 'the', 'proposed', 'structure', 'is', 'designed', 'considering', 'hardware', 'resource', 'constrains', 'that', 'exist', 'in', 'wce', 'systems']] | [-0.11295085444362485, 0.02541352831212862, -0.05331960143387103, 0.044967284787652224, -0.072337684320071, -0.19270238482679886, -0.009578484660148835, 0.44263074532724345, -0.21600377780403227, -0.3189877434633672, 0.09439129054729935, -0.21487271348730877, -0.24051088131426906, 0.18449748222393772, -0.19949848694691005, 0.062495725517062686, 0.1396737553374036, 0.06823686837518696, 0.0014114134694234682, -0.26981277223631667, 0.26308569833278084, 0.06359372917079152, 0.3530109434818419, 0.011112478113948153, 0.09003745531215547, 0.010093391100571562, -0.04225415161972006, 0.006528862411729419, -0.025099623205768203, 0.15771000236586238, 0.319189125936156, 0.19301724141069615, 0.2673930212197145, -0.42627138891615546, -0.26141610469830295, 0.0651701990282163, 0.1839951379896285, 0.056748735127397455, -0.06240151180155898, -0.35388427009232915, 0.15318083583574313, -0.16605159327781832, -0.02744505675554347, -0.10178196360357106, -0.03446677405400596, -0.041427150914947, -0.2863986564597536, 0.09792837034323244, -0.0009426881448374703, 0.07257463859143452, -0.08025573320516671, -0.06439588867495051, 0.005818620091304183, 0.17022654997149053, -0.04036747280854168, 0.03613514920736914, 0.1852836217596912, -0.20850054465476064, -0.09373500747516608, 0.37226700524871165, 0.0042515614141638465, -0.19868980472585043, 0.15989992755035368, 0.00447535609978681, -0.09253612492018594, 0.14249018060330015, 0.21712722722440958, 0.1524532141450506, -0.17836838688582737, -0.02532821764907567, -0.024081019308561318, 0.19610233693562734, 0.048843527790338084, -0.0074125737077198346, 0.19491592903908056, 0.2664062490937515, -0.034362194600712076, 0.12658306033028147, -0.2168441173629477, 0.015491454431097597, -0.22344654615713247, -0.14740021200850606, -0.18896067844112763, -0.03879431761617105, -0.06084138491538537, -0.14140971181712722, 0.4115116582341635, 0.19452258370046577, 0.157587087538559, 0.02613058636779897, 0.36598098890569347, 0.02867913504059498, 0.173978719027498, 0.056561842180179574, 0.18570962433631605, 0.03151849254656834, 0.0872092015745763, -0.1750077513497672, 0.10359258208952199, 0.07385940948286308] |
1,802.07789 | Semantic Segmentation Refinement by Monte Carlo Region Growing of High
Confidence Detections | Despite recent improvements using fully convolutional networks, in general,
the segmentation produced by most state-of-the-art semantic segmentation
methods does not show satisfactory adherence to the object boundaries. We
propose a method to refine the segmentation results generated by such deep
learning models. Our method takes as input the confidence scores generated by a
pixel-dense segmentation network and re-labels pixels with low confidence
levels. The re-labeling approach employs a region growing mechanism that
aggregates these pixels to neighboring areas with high confidence scores and
similar appearance. In order to correct the labels of pixels that were
incorrectly classified with high confidence level by the semantic segmentation
algorithm, we generate multiple region growing steps through a Monte Carlo
sampling of the seeds of the regions. Our method improves the accuracy of a
state-of-the-art fully convolutional semantic segmentation approach on the
publicly available COCO and PASCAL datasets, and it shows significantly better
results on selected sequences of the finely-annotated DAVIS dataset.
| cs.CV | despite recent improvements using fully convolutional networks in general the segmentation produced by most stateoftheart semantic segmentation methods does not show satisfactory adherence to the object boundaries we propose a method to refine the segmentation results generated by such deep learning models our method takes as input the confidence scores generated by a pixeldense segmentation network and relabels pixels with low confidence levels the relabeling approach employs a region growing mechanism that aggregates these pixels to neighboring areas with high confidence scores and similar appearance in order to correct the labels of pixels that were incorrectly classified with high confidence level by the semantic segmentation algorithm we generate multiple region growing steps through a monte carlo sampling of the seeds of the regions our method improves the accuracy of a stateoftheart fully convolutional semantic segmentation approach on the publicly available coco and pascal datasets and it shows significantly better results on selected sequences of the finelyannotated davis dataset | [['despite', 'recent', 'improvements', 'using', 'fully', 'convolutional', 'networks', 'in', 'general', 'the', 'segmentation', 'produced', 'by', 'most', 'stateoftheart', 'semantic', 'segmentation', 'methods', 'does', 'not', 'show', 'satisfactory', 'adherence', 'to', 'the', 'object', 'boundaries', 'we', 'propose', 'a', 'method', 'to', 'refine', 'the', 'segmentation', 'results', 'generated', 'by', 'such', 'deep', 'learning', 'models', 'our', 'method', 'takes', 'as', 'input', 'the', 'confidence', 'scores', 'generated', 'by', 'a', 'pixeldense', 'segmentation', 'network', 'and', 'relabels', 'pixels', 'with', 'low', 'confidence', 'levels', 'the', 'relabeling', 'approach', 'employs', 'a', 'region', 'growing', 'mechanism', 'that', 'aggregates', 'these', 'pixels', 'to', 'neighboring', 'areas', 'with', 'high', 'confidence', 'scores', 'and', 'similar', 'appearance', 'in', 'order', 'to', 'correct', 'the', 'labels', 'of', 'pixels', 'that', 'were', 'incorrectly', 'classified', 'with', 'high', 'confidence', 'level', 'by', 'the', 'semantic', 'segmentation', 'algorithm', 'we', 'generate', 'multiple', 'region', 'growing', 'steps', 'through', 'a', 'monte', 'carlo', 'sampling', 'of', 'the', 'seeds', 'of', 'the', 'regions', 'our', 'method', 'improves', 'the', 'accuracy', 'of', 'a', 'stateoftheart', 'fully', 'convolutional', 'semantic', 'segmentation', 'approach', 'on', 'the', 'publicly', 'available', 'coco', 'and', 'pascal', 'datasets', 'and', 'it', 'shows', 'significantly', 'better', 'results', 'on', 'selected', 'sequences', 'of', 'the', 'finelyannotated', 'davis', 'dataset']] | [-0.0060952424194114525, 0.0049326410308145946, -0.050745480913860774, 0.0690176564526971, -0.058149431132150285, -0.11698464742109466, 0.0746582833235152, 0.472602932107596, -0.20491253375448884, -0.3983972782436281, 0.05368913024013194, -0.29063719693714607, -0.12700325340772858, 0.16710225124664319, -0.14674544386686578, 0.08333815300004342, 0.2087742286086536, 0.028573399190999903, -0.047653388091697335, -0.31660079738149083, 0.2541373287751459, 0.09547046537175984, 0.3708775927527593, 0.014664437720337166, 0.16583625987196007, -0.06726799416542352, -0.05784767125106345, 0.0081343897670591, -0.07154807641862322, 0.19277079752497137, 0.28931273327116985, 0.16682964255251603, 0.3060106589960364, -0.3776959472347815, -0.22832977284978812, 0.039506379885073654, 0.15223141356359404, 0.11072390067522811, -0.025744547818202335, -0.4252834894622748, 0.12017464142692728, -0.16699192333870974, 0.05815904341244067, -0.13155533817674345, -0.05628112506252737, -0.021336885131462716, -0.2816537053963074, 0.09589038290775931, 0.07363436455936888, 0.03279789794648353, -0.062067343287755, -0.14095131486866216, -0.024379559643327806, 0.19131691347604665, -0.013554838304676546, 0.08847177920595128, 0.14331216140029332, -0.20675410570700664, -0.1582429560068517, 0.3067695985500438, -0.06093405187801601, -0.21272728665290067, 0.22534327103625026, -0.0961982849552535, -0.1555887366591308, 0.17344394593666762, 0.1860248840485628, 0.15163577459036157, -0.1234604133761679, -0.02683806608155674, -0.036737671080164805, 0.20120742704379013, 0.047994488005478605, -0.07832820724378017, 0.1841784675951856, 0.26330826371215665, 0.003279589380000312, 0.12641734964787388, -0.20652265722254434, -0.041640347528020635, -0.22352822159621447, -0.07269527163701311, -0.19450589971622834, -0.11392398716168081, -0.13880596654332925, -0.17887674670260495, 0.39365000538647366, 0.26819191215177757, 0.23330199672506216, 0.11184208916025594, 0.3526927821027736, 0.012187928069556037, 0.14715732310418014, 0.09093662607782067, 0.17579157186898953, 0.009407931683549227, 0.06927683705893847, -0.11518944915569125, 0.09224782489278975, 0.12414389177679251] |
1,802.0779 | Spin inversion in graphene spin valves by gate-tunable magnetic
proximity effect at one-dimensional contacts | Graphene has remarkable opportunities for spintronics due to its high
mobility and long spin diffusion length, especially when encapsulated in
hexagonal boron nitride (h-BN). Here, for the first time, we demonstrate
gate-tunable spin transport in such encapsulated graphene-based spin valves
with one-dimensional (1D) ferromagnetic edge contacts. An electrostatic
backgate tunes the Fermi level of graphene to probe different energy levels of
the spin-polarized density of states (DOS) of the 1D ferromagnetic contact,
which interact through a magnetic proximity effect (MPE) that induces
ferromagnetism in graphene. In contrast to conventional spin valves, where
switching between high- and low-resistance configuration requires magnetization
reversal by an applied magnetic field or a high-density spin-polarized current,
we provide an alternative path with the gate-controlled spin inversion in
graphene. The resulting tunable MPE employing a simple ferromagnetic metal
holds promise for spintronic devices and to realize exotic topological states,
from quantum spin Hall and quantum anomalous Hall effects, to Majorana fermions
and skyrmions.
| cond-mat.mes-hall | graphene has remarkable opportunities for spintronics due to its high mobility and long spin diffusion length especially when encapsulated in hexagonal boron nitride hbn here for the first time we demonstrate gatetunable spin transport in such encapsulated graphenebased spin valves with onedimensional 1d ferromagnetic edge contacts an electrostatic backgate tunes the fermi level of graphene to probe different energy levels of the spinpolarized density of states dos of the 1d ferromagnetic contact which interact through a magnetic proximity effect mpe that induces ferromagnetism in graphene in contrast to conventional spin valves where switching between high and lowresistance configuration requires magnetization reversal by an applied magnetic field or a highdensity spinpolarized current we provide an alternative path with the gatecontrolled spin inversion in graphene the resulting tunable mpe employing a simple ferromagnetic metal holds promise for spintronic devices and to realize exotic topological states from quantum spin hall and quantum anomalous hall effects to majorana fermions and skyrmions | [['graphene', 'has', 'remarkable', 'opportunities', 'for', 'spintronics', 'due', 'to', 'its', 'high', 'mobility', 'and', 'long', 'spin', 'diffusion', 'length', 'especially', 'when', 'encapsulated', 'in', 'hexagonal', 'boron', 'nitride', 'hbn', 'here', 'for', 'the', 'first', 'time', 'we', 'demonstrate', 'gatetunable', 'spin', 'transport', 'in', 'such', 'encapsulated', 'graphenebased', 'spin', 'valves', 'with', 'onedimensional', '1d', 'ferromagnetic', 'edge', 'contacts', 'an', 'electrostatic', 'backgate', 'tunes', 'the', 'fermi', 'level', 'of', 'graphene', 'to', 'probe', 'different', 'energy', 'levels', 'of', 'the', 'spinpolarized', 'density', 'of', 'states', 'dos', 'of', 'the', '1d', 'ferromagnetic', 'contact', 'which', 'interact', 'through', 'a', 'magnetic', 'proximity', 'effect', 'mpe', 'that', 'induces', 'ferromagnetism', 'in', 'graphene', 'in', 'contrast', 'to', 'conventional', 'spin', 'valves', 'where', 'switching', 'between', 'high', 'and', 'lowresistance', 'configuration', 'requires', 'magnetization', 'reversal', 'by', 'an', 'applied', 'magnetic', 'field', 'or', 'a', 'highdensity', 'spinpolarized', 'current', 'we', 'provide', 'an', 'alternative', 'path', 'with', 'the', 'gatecontrolled', 'spin', 'inversion', 'in', 'graphene', 'the', 'resulting', 'tunable', 'mpe', 'employing', 'a', 'simple', 'ferromagnetic', 'metal', 'holds', 'promise', 'for', 'spintronic', 'devices', 'and', 'to', 'realize', 'exotic', 'topological', 'states', 'from', 'quantum', 'spin', 'hall', 'and', 'quantum', 'anomalous', 'hall', 'effects', 'to', 'majorana', 'fermions', 'and', 'skyrmions']] | [-0.2210012318946089, 0.23749647555221393, 0.013068250267007121, -0.028020119131394444, -0.03361316872197114, -0.2338807832947962, 0.07999665872490472, 0.43315975579201793, -0.2801144219976464, -0.28853768152392406, -0.07350372940162493, -0.2992058872085088, -0.1413150732153374, 0.21135871350664384, 0.059738287895734, 0.04920577981982344, -0.042624931245638875, -0.11107211230915176, -0.097529855602759, -0.1816292572299398, 0.21606843655329838, -0.00888257318882236, 0.36715798461839416, 0.13368733759352547, 0.06922553781016617, 0.03812651910261506, 0.21984843766779466, 0.024546954084549596, -0.1326854159697467, 0.048207794409171105, 0.2586124749249144, -0.25034915662524854, 0.1766189864961205, -0.5819147200246525, -0.18104732303975066, -0.03238916569122463, 0.12443177770692737, 0.1997808651415821, -0.12086264009937454, -0.3161188931483182, 0.06642243712191369, -0.19417996907749088, -0.12309178997398054, -0.11042932324574158, -0.0014100844911032707, -0.051754762735929646, -0.2322717931679195, 0.07226506689382468, 0.06593651369074656, 0.059846335743215816, -0.046538162750068154, -0.11375914181280099, -0.10582744233328019, 0.06494021689416218, -0.002914935375629052, 0.027497188150504556, 0.2155810930398382, -0.15534677582193807, -0.21648177551995418, 0.31588778348089414, -0.05307970147662956, -0.12798720054850457, 0.18335462880475079, -0.18412999721884632, -0.03481064253682448, 0.09687649913333879, 0.094732052219474, 0.06423829886825032, -0.14658327537426016, 0.09668371904823798, 0.03438340411091425, 0.1086105460204276, 0.05513088246748136, 0.12763998450141897, 0.35177440845073316, 0.2535544387776713, 0.1311436877348668, 0.1230648054717595, -0.17852423452864147, -0.019958205596739605, -0.14025809407044368, -0.2556368755413943, -0.2842886412611148, 0.14965921092428458, -0.050060450038883784, -0.2363911801563564, 0.42464136326341495, 0.1796179162976065, 0.12167261007158857, -0.09454902984531134, 0.28198079524300756, 0.12183602810333109, 0.0837237941409657, 0.013158862668854795, 0.19943359287182807, 0.21899221690926274, 0.1301870238299891, -0.3101198649505497, 0.06793443548973578, -0.06412966376145306] |
1,802.07791 | First Result on the Neutrinoless Double Beta Decay of $^{82}$Se with
CUPID-0 | We report the result of the search for neutrinoless double beta decay of
$^{82}$Se obtained with CUPID-0, the first large array of scintillating
Zn$^{82}$Se cryogenic calorimeters implementing particle identification. We
observe no signal in a 1.83 kg yr $^{82}$Se exposure and we set the most
stringent lower limit on the \onu $^{82}$Se half-life T$^{0\nu}_{1/2}>$
2.4$\times \mathrm{10}^{24}$ yr (90\% credible interval), which corresponds to
an effective Majorana neutrino mass m$_{\beta\beta} <$ (376-770) meV depending
on the nuclear matrix element calculations. The heat-light readout provides a
powerful tool for the rejection of \al\ particles and allows to suppress the
background in the region of interest down to
(3.6$^{+1.9}_{-1.4}$)$\times$10$^{-3}$\ckky, an unprecedented level for this
technique.
| nucl-ex physics.ins-det | we report the result of the search for neutrinoless double beta decay of 82se obtained with cupid0 the first large array of scintillating zn82se cryogenic calorimeters implementing particle identification we observe no signal in a 183 kg yr 82se exposure and we set the most stringent lower limit on the onu 82se halflife t0nu_12 24times mathrm1024 yr 90 credible interval which corresponds to an effective majorana neutrino mass m_betabeta 376770 mev depending on the nuclear matrix element calculations the heatlight readout provides a powerful tool for the rejection of al particles and allows to suppress the background in the region of interest down to 3619_14times103ckky an unprecedented level for this technique | [['we', 'report', 'the', 'result', 'of', 'the', 'search', 'for', 'neutrinoless', 'double', 'beta', 'decay', 'of', '82se', 'obtained', 'with', 'cupid0', 'the', 'first', 'large', 'array', 'of', 'scintillating', 'zn82se', 'cryogenic', 'calorimeters', 'implementing', 'particle', 'identification', 'we', 'observe', 'no', 'signal', 'in', 'a', '183', 'kg', 'yr', '82se', 'exposure', 'and', 'we', 'set', 'the', 'most', 'stringent', 'lower', 'limit', 'on', 'the', 'onu', '82se', 'halflife', 't0nu_12', '24times', 'mathrm1024', 'yr', '90', 'credible', 'interval', 'which', 'corresponds', 'to', 'an', 'effective', 'majorana', 'neutrino', 'mass', 'm_betabeta', '376770', 'mev', 'depending', 'on', 'the', 'nuclear', 'matrix', 'element', 'calculations', 'the', 'heatlight', 'readout', 'provides', 'a', 'powerful', 'tool', 'for', 'the', 'rejection', 'of', 'al', 'particles', 'and', 'allows', 'to', 'suppress', 'the', 'background', 'in', 'the', 'region', 'of', 'interest', 'down', 'to', '3619_14times103ckky', 'an', 'unprecedented', 'level', 'for', 'this', 'technique']] | [-0.05552792717119522, 0.2058055692977407, -0.01589286296898238, 0.05365138080854526, -0.013339598145538279, -0.11831500335970771, 0.11858617623388837, 0.33004844425437607, -0.12963984332756776, -0.3586632624686321, 0.05994792717778794, -0.3028994935378922, 0.038611228408065634, 0.25460656653223646, 0.05677380176912775, 0.05503746509121157, 0.07227922823697885, 0.03320073279787168, -0.07990266929519858, -0.18790622518580652, 0.15592913177282175, 0.1910734350562409, 0.24703759296196642, 0.06305896416828732, 0.12459354905115667, -0.0016608621890299789, -0.04583593599811614, -0.1683083851604122, -0.18073437060773478, 0.05098735121792513, 0.24863347482528084, 0.10739590547909246, 0.17108824735106987, -0.3885614666739635, -0.0689277493973724, 0.12988542898114178, 0.12811024553930195, 0.03046508346984563, -0.0918364055633162, -0.33754441366644106, 0.10444328333816935, -0.2206600296754982, -0.12009411182898645, 0.0033782640054264915, 0.01728292844893637, -0.050406348404135104, -0.3175031538164922, 0.04189365496722955, -0.018198603141843996, -0.003242008891307518, -0.03381503385842003, -0.2092897079723983, 0.10802669379377093, 0.04777190956139119, 0.038820607000178545, 0.02454774916769336, 0.1940960459102154, -0.07875968999486138, -0.061216619501116676, 0.3267686063131082, -0.09602026177339569, -0.10439608162312516, 0.13039222694759336, -0.19145290604487897, -0.16840685373085124, 0.2397406982610472, 0.15534085042287257, 0.11424437909012783, -0.18909902869784664, 0.09594181232985596, 0.012710750982095705, 0.2636129166582756, 0.07768599007922773, 0.05285244686072083, 0.21815454527283104, 0.2920827635250568, 0.10129464229690695, 0.04937571621386804, -0.221310382558764, 0.010476914727864526, -0.3110438366899284, -0.17653529023943104, -0.07569217115475266, 0.09168236102978482, -0.10023464989673268, -0.14567792461097032, 0.3803705667215182, 0.09796087970526314, 0.1279218710575984, 0.005878879345962169, 0.21885664685342077, 0.08373356074278099, 0.06398326982025962, -0.03283118035929347, 0.30894748164149366, 0.1825356282572323, 0.06005435647599608, -0.23024749043876322, 0.0233446384941132, 0.044094707847303044] |
1,802.07792 | Partial Franel sums | Analytical expressions are derived for the position of irreducible fractions
in the Farey sequence $F_N$ of order $N$ for a particular choice of $N$. The
asymptotic behaviour is derived obtaining a lower error bound than in previous
results when these fractions are in the vicinity of $0/1$, $1/2$ or $1/1$.
Franel's famous formulation of Riemann's hypothesis uses the summation of
distances between irreducible fractions and evenly spaced points in $[0,1]$. A
partial Franel sum is defined here as a summation of these distances over a
subset of fractions in $F_N$. The partial Franel sum in the range $[0, i/N]$,
with $N={\rm lcm}(1,2,...,i)$ is shown here to grow as $O(\log(N)\delta_B(\log
N))$, where $\delta_B(x)$ is a decreasing function. Other partial Franel sums
are also explored.
| math.NT | analytical expressions are derived for the position of irreducible fractions in the farey sequence f_n of order n for a particular choice of n the asymptotic behaviour is derived obtaining a lower error bound than in previous results when these fractions are in the vicinity of 01 12 or 11 franels famous formulation of riemanns hypothesis uses the summation of distances between irreducible fractions and evenly spaced points in 01 a partial franel sum is defined here as a summation of these distances over a subset of fractions in f_n the partial franel sum in the range 0 in with nrm lcm12i is shown here to grow as ologndelta_blog n where delta_bx is a decreasing function other partial franel sums are also explored | [['analytical', 'expressions', 'are', 'derived', 'for', 'the', 'position', 'of', 'irreducible', 'fractions', 'in', 'the', 'farey', 'sequence', 'f_n', 'of', 'order', 'n', 'for', 'a', 'particular', 'choice', 'of', 'n', 'the', 'asymptotic', 'behaviour', 'is', 'derived', 'obtaining', 'a', 'lower', 'error', 'bound', 'than', 'in', 'previous', 'results', 'when', 'these', 'fractions', 'are', 'in', 'the', 'vicinity', 'of', '01', '12', 'or', '11', 'franels', 'famous', 'formulation', 'of', 'riemanns', 'hypothesis', 'uses', 'the', 'summation', 'of', 'distances', 'between', 'irreducible', 'fractions', 'and', 'evenly', 'spaced', 'points', 'in', '01', 'a', 'partial', 'franel', 'sum', 'is', 'defined', 'here', 'as', 'a', 'summation', 'of', 'these', 'distances', 'over', 'a', 'subset', 'of', 'fractions', 'in', 'f_n', 'the', 'partial', 'franel', 'sum', 'in', 'the', 'range', '0', 'in', 'with', 'nrm', 'lcm12i', 'is', 'shown', 'here', 'to', 'grow', 'as', 'ologndelta_blog', 'n', 'where', 'delta_bx', 'is', 'a', 'decreasing', 'function', 'other', 'partial', 'franel', 'sums', 'are', 'also', 'explored']] | [-0.17518626542335392, 0.15505413490762354, -0.0440980293044523, 0.03919153581099475, -0.009293419657228123, -0.061998439467504246, 0.0685973875390898, 0.3313649826283966, -0.24862159415296897, -0.2778426366819053, 0.09533425579297536, -0.3178852129367595, -0.09676192579556163, 0.19850096030834818, -0.02078587475757138, 0.017509237108869525, -0.00871915282572017, 0.06575307525115229, -0.10914670257680431, -0.27610156275410236, 0.25836268987725763, -0.066395534088976, 0.19211728856781451, 0.012503576738869442, 0.05774004872450057, -0.0177619734780162, -0.04611409952504044, -0.019239598838221125, -0.1553470419422418, 0.10658309820177574, 0.27729548964680745, 0.09505746653890472, 0.26675943860846785, -0.3285291661985782, -0.10639500196929239, 0.13817518728417383, 0.21785706167790195, 0.002499638408023332, 0.01573920068761506, -0.19924134856575176, 0.11691306801434576, -0.15829341452737034, -0.1294047912316663, -0.004791503615614747, 0.10676864399613828, 0.0966650263852432, -0.3222058983284886, 0.11141429745426848, 0.04414685241909338, 0.0652813000952778, -0.03491737006795632, -0.24251144373507685, -0.0031264252303277746, 0.1285939656499824, 0.02407411654260178, 0.05556265921762385, 0.05365006645022258, -0.08947693466936715, -0.06329036150284174, 0.3690618999584132, -0.065890964125151, -0.2514829615037106, 0.12099320825752842, -0.22683052508896137, -0.1338421768164497, 0.17492950667760201, 0.12770865710614593, 0.17791710099784516, -0.07769115755059111, 0.0939778632542095, -0.09042044127498902, 0.13327423237389377, 0.1383927324747651, 0.05577492210700983, 0.1656788020246044, 0.08270019853581526, 0.051753592986550905, 0.1323796592426815, -0.05137797013050368, -0.09780916070346446, -0.3293548589611442, -0.1552805388488165, -0.1823583573588178, 0.1096063948338147, -0.10496323599693846, -0.16024044154191336, 0.28619481857959966, 0.05280222113737289, 0.24595622130583564, 0.17101134221312128, 0.24412424840471325, 0.1485801575873673, 0.020749760854269276, 0.008415706541796191, 0.14551205924876473, 0.17498215782737844, -0.02094943862615795, -0.1355487581639856, 0.042117144669867865, 0.13043435203584552] |
1,802.07793 | Optimal Multi-User Scheduling of Buffer-Aided Relay Systems | Multi-User scheduling is a challenging problem under the relaying scenarios.
Traditional schemes, which are based on the instantaneous
signal-to-interference-plus-noises ratios (SINRs), cannot solve the inherent
disparities of the qualities between different links. Hence, the system
performance is always limited by the weaker links. In this paper, from the
whole system throughput view, we propose an optimal multi-user scheduling
scheme for the multi-user full-duplex (FD) buffer aided relay systems. We first
formulate the throughput maximization problem. Then, according to the
characteristics of the Karush-Kuhn-Tucker conditions, we obtain the optimal
decision functions and the optimal weighted factors of different links of the
proposed scheme. Simulation results show that the proposed scheme not only
solves the disparities of the qualities between $S_i$-$R$ and $R$-$D_i$ links,
but also that between different $S_{i}$-$R$ or $D_{i}$-$R$ links, which can be
used as guidance in the design of the practical systems.
| cs.IT math.IT | multiuser scheduling is a challenging problem under the relaying scenarios traditional schemes which are based on the instantaneous signaltointerferenceplusnoises ratios sinrs cannot solve the inherent disparities of the qualities between different links hence the system performance is always limited by the weaker links in this paper from the whole system throughput view we propose an optimal multiuser scheduling scheme for the multiuser fullduplex fd buffer aided relay systems we first formulate the throughput maximization problem then according to the characteristics of the karushkuhntucker conditions we obtain the optimal decision functions and the optimal weighted factors of different links of the proposed scheme simulation results show that the proposed scheme not only solves the disparities of the qualities between s_ir and rd_i links but also that between different s_ir or d_ir links which can be used as guidance in the design of the practical systems | [['multiuser', 'scheduling', 'is', 'a', 'challenging', 'problem', 'under', 'the', 'relaying', 'scenarios', 'traditional', 'schemes', 'which', 'are', 'based', 'on', 'the', 'instantaneous', 'signaltointerferenceplusnoises', 'ratios', 'sinrs', 'can', 'not', 'solve', 'the', 'inherent', 'disparities', 'of', 'the', 'qualities', 'between', 'different', 'links', 'hence', 'the', 'system', 'performance', 'is', 'always', 'limited', 'by', 'the', 'weaker', 'links', 'in', 'this', 'paper', 'from', 'the', 'whole', 'system', 'throughput', 'view', 'we', 'propose', 'an', 'optimal', 'multiuser', 'scheduling', 'scheme', 'for', 'the', 'multiuser', 'fullduplex', 'fd', 'buffer', 'aided', 'relay', 'systems', 'we', 'first', 'formulate', 'the', 'throughput', 'maximization', 'problem', 'then', 'according', 'to', 'the', 'characteristics', 'of', 'the', 'karushkuhntucker', 'conditions', 'we', 'obtain', 'the', 'optimal', 'decision', 'functions', 'and', 'the', 'optimal', 'weighted', 'factors', 'of', 'different', 'links', 'of', 'the', 'proposed', 'scheme', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'scheme', 'not', 'only', 'solves', 'the', 'disparities', 'of', 'the', 'qualities', 'between', 's_ir', 'and', 'rd_i', 'links', 'but', 'also', 'that', 'between', 'different', 's_ir', 'or', 'd_ir', 'links', 'which', 'can', 'be', 'used', 'as', 'guidance', 'in', 'the', 'design', 'of', 'the', 'practical', 'systems']] | [-0.22974309356863493, -0.004978824373146906, -0.054362602474522105, 0.043184284446269115, -0.06408425404290131, -0.21886631846099988, 0.12126025155557214, 0.39713374907019694, -0.29462405224658655, -0.2788261059527351, 0.09012247819591208, -0.19967706964521761, -0.21756483131239165, 0.16700688006953193, -0.12835204171370979, 0.07047454081803665, 0.07313782015067696, 0.0023322201392967515, -0.06765290541889173, -0.29044539541740655, 0.33039961194678563, 0.10180656721120254, 0.3985619454933199, 0.07398078057539492, 0.11130086874997598, 0.01393004185126596, 0.009314349809871383, -0.0005038460462151626, -0.11984306958581495, 0.07379061740193464, 0.29746816981531365, 0.1929385599542514, 0.2872686895318854, -0.3950345349484976, -0.2224453408418643, 0.11741838588471144, 0.15806739581388118, 0.04387726907415027, 0.0014747031636431183, -0.25968032692309834, 0.126812556220717, -0.19840757708183268, 0.0015170804329846107, 0.018054627241160144, -0.11699494730982878, 0.07065976222216243, -0.34393572815182344, 0.014204853796195174, -0.002730084581523609, -0.0006313595173119659, -0.08259853812649479, -0.10871992781627136, 0.03145831269802342, 0.2020423495928875, 0.04460147535100474, -0.059315718189013045, 0.06846468115527131, -0.11470494569364516, -0.1589502393838648, 0.4073106493525417, 0.02777957795909278, -0.2698996108104016, 0.1846173533769718, -0.04068233532188329, -0.10768126011301409, 0.14685438466455106, 0.22559161764253127, 0.09889363335497992, -0.1868520184185579, 0.002536165684586207, -0.04875315971095377, 0.15996073979661393, 0.05759143343270743, 0.10288777137437546, 0.1270081092895363, 0.15985930599534595, 0.15626309503814284, 0.1482099531420087, -0.08311927707170622, -0.10633922124963621, -0.23743553527771877, -0.13362621277583842, -0.1644265389030563, -0.01525507745653568, -0.10538844379221751, -0.04839150395086953, 0.34321487903319614, 0.1692036343967988, 0.11779539959347794, 0.10532785010110901, 0.3947379209730827, 0.13332930894512815, 0.039263137305451765, 0.12265171068654933, 0.21992837059849374, 0.06769176255780417, 0.1459426243992811, -0.2625275106992389, 0.09491271591535441, 0.02504747196979506] |
1,802.07794 | Liver Segmentation in Abdominal CT Images by Adaptive 3D Region Growing | Automatic liver segmentation plays an important role in computer-aided
diagnosis and treatment. Manual segmentation of organs is a difficult and
tedious task and so prone to human errors. In this paper, we propose an
adaptive 3D region growing with subject-specific conditions. For this aim we
use the intensity distribution of most probable voxels in prior map along with
location prior. We also incorporate the boundary of target organs to restrict
the region growing. In order to obtain strong edges and high contrast, we
propose an effective contrast enhancement algorithm to facilitate more accurate
segmentation. In this paper, 92.56% Dice score is achieved. We compare our
method with the method of hard thresholding on Deeds prior map and also with
the majority voting on Deeds registration with 13 organs.
| cs.CV | automatic liver segmentation plays an important role in computeraided diagnosis and treatment manual segmentation of organs is a difficult and tedious task and so prone to human errors in this paper we propose an adaptive 3d region growing with subjectspecific conditions for this aim we use the intensity distribution of most probable voxels in prior map along with location prior we also incorporate the boundary of target organs to restrict the region growing in order to obtain strong edges and high contrast we propose an effective contrast enhancement algorithm to facilitate more accurate segmentation in this paper 9256 dice score is achieved we compare our method with the method of hard thresholding on deeds prior map and also with the majority voting on deeds registration with 13 organs | [['automatic', 'liver', 'segmentation', 'plays', 'an', 'important', 'role', 'in', 'computeraided', 'diagnosis', 'and', 'treatment', 'manual', 'segmentation', 'of', 'organs', 'is', 'a', 'difficult', 'and', 'tedious', 'task', 'and', 'so', 'prone', 'to', 'human', 'errors', 'in', 'this', 'paper', 'we', 'propose', 'an', 'adaptive', '3d', 'region', 'growing', 'with', 'subjectspecific', 'conditions', 'for', 'this', 'aim', 'we', 'use', 'the', 'intensity', 'distribution', 'of', 'most', 'probable', 'voxels', 'in', 'prior', 'map', 'along', 'with', 'location', 'prior', 'we', 'also', 'incorporate', 'the', 'boundary', 'of', 'target', 'organs', 'to', 'restrict', 'the', 'region', 'growing', 'in', 'order', 'to', 'obtain', 'strong', 'edges', 'and', 'high', 'contrast', 'we', 'propose', 'an', 'effective', 'contrast', 'enhancement', 'algorithm', 'to', 'facilitate', 'more', 'accurate', 'segmentation', 'in', 'this', 'paper', '9256', 'dice', 'score', 'is', 'achieved', 'we', 'compare', 'our', 'method', 'with', 'the', 'method', 'of', 'hard', 'thresholding', 'on', 'deeds', 'prior', 'map', 'and', 'also', 'with', 'the', 'majority', 'voting', 'on', 'deeds', 'registration', 'with', '13', 'organs']] | [-0.006120944703980058, -0.014006029487632077, -0.034178460871771676, 0.037238505515233555, -0.08815370585034543, -0.12436419059667969, 0.05363494382072531, 0.48318158519714416, -0.18090079721241636, -0.335520142049063, 0.09279389843050012, -0.25999101139314007, -0.18965408313670196, 0.1406891177975922, -0.2264203213021574, 0.08561516955978732, 0.12350239629449788, 0.04864338457264239, -0.019174336370269884, -0.2409308499609324, 0.275011136316607, 0.08220540423644707, 0.31331106515426654, 0.04334294046566356, 0.09149302784862812, 0.026495674774196232, -0.07305614023425733, -0.02788591153876041, -0.13301810907796607, 0.17748028898859047, 0.30822867454844527, 0.12349953327793628, 0.33814320879173465, -0.4120374491503753, -0.18298426541150548, 0.1192412839809549, 0.1739639880870527, 0.10289872841894976, -0.034720548236350623, -0.2811577789616422, 0.08615247457782971, -0.14190260088071227, -0.04126451627962524, -0.09901869812165387, -0.00031862574178376235, -0.07197621527302545, -0.3166542959443177, 0.1272518060670791, 0.03176343889754207, 0.10848185478971573, -0.09829274175899627, -0.08478820778145746, 0.036159192893137515, 0.20430845907321782, 0.033110250824393006, 0.12311498119743192, 0.15110011634533294, -0.2007021972367511, -0.08250105965998955, 0.3397006134837284, 0.013669656377715, -0.22888355488248635, 0.20397673726802168, -0.09301131006213836, -0.1668826377226651, 0.14833330661349464, 0.1965120538006886, 0.1686776866481523, -0.14006376815450494, -0.04285244593529569, 0.028336334186860768, 0.1985040256367938, 0.06161650729336543, -0.05763647036656039, 0.16346660254203016, 0.23175158847880084, 0.0761287778955193, 0.17509576872907928, -0.19517964571241464, -0.01580067778513694, -0.2509538209778839, -0.14953280638007982, -0.12209608510966063, -0.049020687816664577, -0.09036176463212087, -0.20755899729920202, 0.34520855162372754, 0.26165797026533255, 0.20439991603780072, 0.0464607593294204, 0.3325179532257607, 0.033849591695798154, 0.07389862430136418, 0.03955093432477952, 0.19406366301336675, 0.01934536338740145, 0.09981797801810899, -0.19334157458069967, 0.127069256555842, 0.050966892502401606] |
1,802.07795 | Communication Complexity of One-Shot Remote State Preparation | Quantum teleportation uses prior shared entanglement and classical
communication to send an unknown quantum state from one party to another.
Remote state preparation (RSP) is a similar distributed task in which the
sender knows the entire classical description of the state to be sent. (This
may also be viewed as the task of non-oblivious compression of a single sample
from an ensemble of quantum states.) We study the communication complexity of
approximate remote state preparation, in which the goal is to prepare an
approximation of the desired quantum state. Jain [Quant. Inf. & Comp., 2006]
showed that the worst-case communication complexity of approximate RSP can be
bounded from above in terms of the maximum possible information in an encoding.
He also showed that this quantity is a lower bound for communication complexity
of (exact) remote state preparation. In this work, we tightly characterize the
worst-case and average-case communication complexity of remote state
preparation in terms of non-asymptotic information-theoretic quantities. We
also show that the average-case communication complexity of RSP can be much
smaller than the worst-case one. In the process, we show that n bits cannot be
communicated with less than n transmitted bits in LOCC protocols. This
strengthens a result due to Nayak and Salzman [J. ACM, 2006] and may be of
independent interest.
| quant-ph cs.CC cs.IT math.IT | quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum state from one party to another remote state preparation rsp is a similar distributed task in which the sender knows the entire classical description of the state to be sent this may also be viewed as the task of nonoblivious compression of a single sample from an ensemble of quantum states we study the communication complexity of approximate remote state preparation in which the goal is to prepare an approximation of the desired quantum state jain quant inf comp 2006 showed that the worstcase communication complexity of approximate rsp can be bounded from above in terms of the maximum possible information in an encoding he also showed that this quantity is a lower bound for communication complexity of exact remote state preparation in this work we tightly characterize the worstcase and averagecase communication complexity of remote state preparation in terms of nonasymptotic informationtheoretic quantities we also show that the averagecase communication complexity of rsp can be much smaller than the worstcase one in the process we show that n bits cannot be communicated with less than n transmitted bits in locc protocols this strengthens a result due to nayak and salzman j acm 2006 and may be of independent interest | [['quantum', 'teleportation', 'uses', 'prior', 'shared', 'entanglement', 'and', 'classical', 'communication', 'to', 'send', 'an', 'unknown', 'quantum', 'state', 'from', 'one', 'party', 'to', 'another', 'remote', 'state', 'preparation', 'rsp', 'is', 'a', 'similar', 'distributed', 'task', 'in', 'which', 'the', 'sender', 'knows', 'the', 'entire', 'classical', 'description', 'of', 'the', 'state', 'to', 'be', 'sent', 'this', 'may', 'also', 'be', 'viewed', 'as', 'the', 'task', 'of', 'nonoblivious', 'compression', 'of', 'a', 'single', 'sample', 'from', 'an', 'ensemble', 'of', 'quantum', 'states', 'we', 'study', 'the', 'communication', 'complexity', 'of', 'approximate', 'remote', 'state', 'preparation', 'in', 'which', 'the', 'goal', 'is', 'to', 'prepare', 'an', 'approximation', 'of', 'the', 'desired', 'quantum', 'state', 'jain', 'quant', 'inf', 'comp', '2006', 'showed', 'that', 'the', 'worstcase', 'communication', 'complexity', 'of', 'approximate', 'rsp', 'can', 'be', 'bounded', 'from', 'above', 'in', 'terms', 'of', 'the', 'maximum', 'possible', 'information', 'in', 'an', 'encoding', 'he', 'also', 'showed', 'that', 'this', 'quantity', 'is', 'a', 'lower', 'bound', 'for', 'communication', 'complexity', 'of', 'exact', 'remote', 'state', 'preparation', 'in', 'this', 'work', 'we', 'tightly', 'characterize', 'the', 'worstcase', 'and', 'averagecase', 'communication', 'complexity', 'of', 'remote', 'state', 'preparation', 'in', 'terms', 'of', 'nonasymptotic', 'informationtheoretic', 'quantities', 'we', 'also', 'show', 'that', 'the', 'averagecase', 'communication', 'complexity', 'of', 'rsp', 'can', 'be', 'much', 'smaller', 'than', 'the', 'worstcase', 'one', 'in', 'the', 'process', 'we', 'show', 'that', 'n', 'bits', 'can', 'not', 'be', 'communicated', 'with', 'less', 'than', 'n', 'transmitted', 'bits', 'in', 'locc', 'protocols', 'this', 'strengthens', 'a', 'result', 'due', 'to', 'nayak', 'and', 'salzman', 'j', 'acm', '2006', 'and', 'may', 'be', 'of', 'independent', 'interest']] | [-0.15187173734079593, 0.13847215665818766, -0.09112028435860525, 0.02347293693851795, -0.007605466325810858, -0.2091014897929522, 0.13837048168964336, 0.32084794020036533, -0.2904871459582507, -0.3300232765673895, 0.07879744120764712, -0.2299628102516529, -0.09478373820545309, 0.18935850411044242, -0.16491810272874258, 0.09188796741377658, 0.051966191209889684, 0.0770849790511148, -0.025847139561855643, -0.32060202058604875, 0.22760453763707306, 0.08553809853745015, 0.30225966060623877, -0.0010803359643355988, 0.033182159748372284, 0.035467576453335495, 0.024596033593918258, -0.05755258145335209, -0.08964850610433794, 0.10979697218999293, 0.33369452624024704, 0.21268059635693592, 0.27186085562282636, -0.4137362772205485, -0.19848156601971748, 0.13956675898048712, 0.1503299657096564, 0.14568005183985822, 0.012925163204357394, -0.3052307983607959, 0.04399632128982622, -0.1751831356973483, -0.03561308561763334, -0.023239972330977982, 0.00015725098358832786, -0.04396132659493449, -0.27464694800899825, 0.05834158067441889, 0.06124778140540818, 0.01622680847741942, -0.003229665663528526, -0.07226356731893094, 0.027473454085117744, 0.16056391385070562, -0.06094240268736438, 0.06863829536879192, 0.10061887655911475, -0.1166192496132332, -0.19099647790698387, 0.3155815738512238, -0.011998568199793634, -0.16950298944666597, 0.16441700159148837, -0.0819436766590192, -0.1372710717156547, 0.09833353722607281, 0.17606359149251027, 0.10503367382693583, -0.11209545697076856, 0.08093402220293114, -0.06529575252957712, 0.2612478293469785, 0.08713619138993253, 0.13414399611337163, 0.09284538680809402, 0.10137672386367187, 0.12846519623689406, 0.1974037694363968, -0.023548714796986395, -0.15477342838579222, -0.27062967989950604, -0.2361119648669607, -0.306418143600121, 0.09766474459979903, -0.07697753516155313, -0.09104007497651799, 0.3437589557589006, 0.147115909774618, 0.1697717481162225, 0.04222431106636492, 0.31136775060522015, 0.08654656451223766, -0.0110536333930757, 0.18331706439194956, 0.2467362113758295, 0.10779956740187917, 0.07055700358403759, -0.1988225920130194, 0.13149106015982193, 0.019316218643453054] |
1,802.07796 | Continuous Relaxation of MAP Inference: A Nonconvex Perspective | In this paper, we study a nonconvex continuous relaxation of MAP inference in
discrete Markov random fields (MRFs). We show that for arbitrary MRFs, this
relaxation is tight, and a discrete stationary point of it can be easily
reached by a simple block coordinate descent algorithm. In addition, we study
the resolution of this relaxation using popular gradient methods, and further
propose a more effective solution using a multilinear decomposition framework
based on the alternating direction method of multipliers (ADMM). Experiments on
many real-world problems demonstrate that the proposed ADMM significantly
outperforms other nonconvex relaxation based methods, and compares favorably
with state of the art MRF optimization algorithms in different settings.
| cs.CV cs.LG stat.ML | in this paper we study a nonconvex continuous relaxation of map inference in discrete markov random fields mrfs we show that for arbitrary mrfs this relaxation is tight and a discrete stationary point of it can be easily reached by a simple block coordinate descent algorithm in addition we study the resolution of this relaxation using popular gradient methods and further propose a more effective solution using a multilinear decomposition framework based on the alternating direction method of multipliers admm experiments on many realworld problems demonstrate that the proposed admm significantly outperforms other nonconvex relaxation based methods and compares favorably with state of the art mrf optimization algorithms in different settings | [['in', 'this', 'paper', 'we', 'study', 'a', 'nonconvex', 'continuous', 'relaxation', 'of', 'map', 'inference', 'in', 'discrete', 'markov', 'random', 'fields', 'mrfs', 'we', 'show', 'that', 'for', 'arbitrary', 'mrfs', 'this', 'relaxation', 'is', 'tight', 'and', 'a', 'discrete', 'stationary', 'point', 'of', 'it', 'can', 'be', 'easily', 'reached', 'by', 'a', 'simple', 'block', 'coordinate', 'descent', 'algorithm', 'in', 'addition', 'we', 'study', 'the', 'resolution', 'of', 'this', 'relaxation', 'using', 'popular', 'gradient', 'methods', 'and', 'further', 'propose', 'a', 'more', 'effective', 'solution', 'using', 'a', 'multilinear', 'decomposition', 'framework', 'based', 'on', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'experiments', 'on', 'many', 'realworld', 'problems', 'demonstrate', 'that', 'the', 'proposed', 'admm', 'significantly', 'outperforms', 'other', 'nonconvex', 'relaxation', 'based', 'methods', 'and', 'compares', 'favorably', 'with', 'state', 'of', 'the', 'art', 'mrf', 'optimization', 'algorithms', 'in', 'different', 'settings']] | [-0.06908082569685034, -0.001627419387233687, -0.11566772878690211, 0.0644670666786968, -0.08481188690885566, -0.17222462421249565, -0.001913410459376603, 0.47239731379725913, -0.3245004932773677, -0.2561584308005131, 0.11722056801338587, -0.16783583063531565, -0.21036937931418284, 0.21671650530602615, -0.06884536439519343, 0.08887062916062302, 0.10738143973421675, -0.01995894345580726, -0.16047320237618173, -0.2865455703944102, 0.23395325855125446, 0.0020825922959022696, 0.3320896831920018, -0.0001555262091527651, 0.1602520868056328, 0.05048466746082848, 0.02827534270221116, 0.07581731541132605, -0.07115265931622104, 0.16740358057473828, 0.2758361972440538, 0.1739406027654941, 0.3421310214241883, -0.41971999153427714, -0.2180299164207132, 0.11414025863108167, 0.18214238033973956, 0.1155608563541292, -0.05919997266198504, -0.2671136177556069, 0.0832272108585515, -0.13745282625628485, -0.007361872193009198, -0.14969702949754, -0.08730673257404149, 0.06803514057065586, -0.33495868213038454, 0.0861132749026486, 0.06794096887224933, 0.033113728411629934, -0.08661225815261672, -0.1639535224300113, 0.11639615196969595, -0.005938778971196027, 0.08015234507033014, 0.06150790027485372, 0.1459625133581728, -0.058878450086004695, -0.20494586337559126, 0.3196429979005778, -0.09520092251110687, -0.2654666294771674, 0.2023104984640471, -0.020357328110483585, -0.19528316311655683, 0.12233860802056419, 0.2203307273831252, 0.26067386280644583, -0.16435511892678234, 0.11319713182338337, -0.08994643167835904, 0.12676439028330827, 0.012551875791285892, -0.06167355115181423, 0.0890971419405662, 0.1988355603471801, 0.19830039786206358, 0.19062359338528728, -0.07657013205719088, -0.13660318571402952, -0.21243013508685, -0.11439303993373304, -0.23252741484441333, -0.026073237071401096, -0.13738105697350195, -0.14432630687532527, 0.44025128104027594, 0.21076683193730475, 0.17097538164690942, 0.11292667971370188, 0.3389108130657995, 0.10162137227283942, 0.01921358913485263, 0.14223215602724268, 0.1594441251153848, 0.13072822644031262, 0.08520297433862144, -0.24514756086156578, 0.06981915836264421, 0.11203487379490062] |
1,802.07797 | Mass spectrum of $2$-dimensional $\mathcal{N}=(2,2)$ super Yang-Mills
theory on the lattice | In the present work we analyse $\mathcal{N}=(2,2)$ supersymmetric Yang-Mills
(SYM) theory in two dimensions by means of lattice simulations. The theory
arises as dimensional reduction of $\mathcal{N}=1$ SYM theory in four
dimensions. As in other gauge theories with extended supersymmetry, the
classical scalar potential has flat directions which may destabilize numerical
simulations. In addition, the fermion determinant need not be positive and this
sign-problem may cause further problems in a stochastic treatment. We
demonstrate that $\mathcal{N}=(2,2)$ super Yang-Mills theory has actually no
sign problem and that the flat directions are lifted and thus stabilized by
quantum corrections. Only the bare mass of the scalars experience a finite
additive renormalization in this finite theory. On various lattices with
different lattice constants we determine the scalar masses and hopping
parameters for which the supersymmetry violating terms are minimal. By studying
four Ward identities and by monitoring the $\pi$-mass we show that
supersymmetry is indeed restored in the continuum limit. In the second part we
calculate the masses of the low-lying bound states. We find that in the
infinite-volume and supersymmetric continuum limit the Veneziano-Yankielowicz
super-multiplet becomes massless and the Farrar-Gabadadze-Schwetz
super-multiplet decouples from the theory. In addition, we estimate the masses
of the excited mesons in the Veneziano-Yankielowicz multiplet. We observe that
the gluino-glueballs have comparable masses to the excited mesons.
| hep-lat hep-th | in the present work we analyse mathcaln22 supersymmetric yangmills sym theory in two dimensions by means of lattice simulations the theory arises as dimensional reduction of mathcaln1 sym theory in four dimensions as in other gauge theories with extended supersymmetry the classical scalar potential has flat directions which may destabilize numerical simulations in addition the fermion determinant need not be positive and this signproblem may cause further problems in a stochastic treatment we demonstrate that mathcaln22 super yangmills theory has actually no sign problem and that the flat directions are lifted and thus stabilized by quantum corrections only the bare mass of the scalars experience a finite additive renormalization in this finite theory on various lattices with different lattice constants we determine the scalar masses and hopping parameters for which the supersymmetry violating terms are minimal by studying four ward identities and by monitoring the pimass we show that supersymmetry is indeed restored in the continuum limit in the second part we calculate the masses of the lowlying bound states we find that in the infinitevolume and supersymmetric continuum limit the venezianoyankielowicz supermultiplet becomes massless and the farrargabadadzeschwetz supermultiplet decouples from the theory in addition we estimate the masses of the excited mesons in the venezianoyankielowicz multiplet we observe that the gluinoglueballs have comparable masses to the excited mesons | [['in', 'the', 'present', 'work', 'we', 'analyse', 'mathcaln22', 'supersymmetric', 'yangmills', 'sym', 'theory', 'in', 'two', 'dimensions', 'by', 'means', 'of', 'lattice', 'simulations', 'the', 'theory', 'arises', 'as', 'dimensional', 'reduction', 'of', 'mathcaln1', 'sym', 'theory', 'in', 'four', 'dimensions', 'as', 'in', 'other', 'gauge', 'theories', 'with', 'extended', 'supersymmetry', 'the', 'classical', 'scalar', 'potential', 'has', 'flat', 'directions', 'which', 'may', 'destabilize', 'numerical', 'simulations', 'in', 'addition', 'the', 'fermion', 'determinant', 'need', 'not', 'be', 'positive', 'and', 'this', 'signproblem', 'may', 'cause', 'further', 'problems', 'in', 'a', 'stochastic', 'treatment', 'we', 'demonstrate', 'that', 'mathcaln22', 'super', 'yangmills', 'theory', 'has', 'actually', 'no', 'sign', 'problem', 'and', 'that', 'the', 'flat', 'directions', 'are', 'lifted', 'and', 'thus', 'stabilized', 'by', 'quantum', 'corrections', 'only', 'the', 'bare', 'mass', 'of', 'the', 'scalars', 'experience', 'a', 'finite', 'additive', 'renormalization', 'in', 'this', 'finite', 'theory', 'on', 'various', 'lattices', 'with', 'different', 'lattice', 'constants', 'we', 'determine', 'the', 'scalar', 'masses', 'and', 'hopping', 'parameters', 'for', 'which', 'the', 'supersymmetry', 'violating', 'terms', 'are', 'minimal', 'by', 'studying', 'four', 'ward', 'identities', 'and', 'by', 'monitoring', 'the', 'pimass', 'we', 'show', 'that', 'supersymmetry', 'is', 'indeed', 'restored', 'in', 'the', 'continuum', 'limit', 'in', 'the', 'second', 'part', 'we', 'calculate', 'the', 'masses', 'of', 'the', 'lowlying', 'bound', 'states', 'we', 'find', 'that', 'in', 'the', 'infinitevolume', 'and', 'supersymmetric', 'continuum', 'limit', 'the', 'venezianoyankielowicz', 'supermultiplet', 'becomes', 'massless', 'and', 'the', 'farrargabadadzeschwetz', 'supermultiplet', 'decouples', 'from', 'the', 'theory', 'in', 'addition', 'we', 'estimate', 'the', 'masses', 'of', 'the', 'excited', 'mesons', 'in', 'the', 'venezianoyankielowicz', 'multiplet', 'we', 'observe', 'that', 'the', 'gluinoglueballs', 'have', 'comparable', 'masses', 'to', 'the', 'excited', 'mesons']] | [-0.11036523473559029, 0.23851863761788689, -0.04369756195711375, 0.10370319305483493, -0.02062034727318839, -0.13595240304787312, 0.004345975846292511, 0.33856635421626097, -0.1697759635699269, -0.25330454542747943, 0.085136479361751, -0.28882647050364363, -0.16231410336613114, 0.08606154632364069, 0.0016064886046650772, 0.03393481047781107, 0.024867215219558935, 0.031167143056692753, -0.11028137054049715, -0.24758923802662142, 0.3231762371407951, -0.034946098307272085, 0.22414866016645515, 0.09718756685419704, 0.05917730961158048, 0.007141970973547703, 0.010242804447146056, -0.00432292608037797, -0.11517683593082174, 0.10692291499532905, 0.21465161372397806, 0.031085389915184218, 0.15589432489375846, -0.42901268518156443, -0.2228836052466832, 0.09765282685949986, 0.18422647021683514, 0.16032775013368525, -0.01660422666571296, -0.26206196031977386, 0.07029789034491792, -0.17408076883293688, -0.1904278599752611, -0.10388588960470807, -0.028278590472895774, -0.12544620794583164, -0.256932217105236, 0.10349158124573322, -0.01061796191393093, 0.0306496613740509, -0.07133886866831576, -0.11595429086355999, -0.09310244957536613, 0.07169202310011684, 0.13211443027361267, 0.019654847023802626, 0.11366968203876768, -0.1910535937661269, -0.15787725874720665, 0.3950551664274323, -0.10369473056168153, -0.22313990781173831, 0.1664768045758485, -0.14490374803440087, -0.17927450443991386, 0.08637400879631943, 0.13252583755210282, 0.13396911738785885, -0.13200002723729692, 0.2195395794592493, -0.06998629339708848, 0.15674052029324498, 0.09301945675472398, 0.04392561582850576, 0.2235640879797702, 0.0862202400702142, 0.03106844169087708, 0.12707445118978644, -0.01806367016268662, -0.12911304779252045, -0.37589174377933693, -0.13021666309683613, -0.13662456867525413, 0.0849524068256249, -0.11407274987677612, -0.14041689025830426, 0.3658283870916144, 0.14805559455234696, 0.14894981306016206, 0.06100986131964775, 0.21786758563618608, 0.14516291784096835, 0.10549468293030691, 0.054084435833858385, 0.28838290218993473, 0.17113256449532194, 0.07517541091983562, -0.2821667062137158, -0.12781911011042785, 0.14560598347653647] |
1,802.07798 | The Galactic Thick Disc density profile traced with RR Lyrae stars | We used a combination of public RR Lyrae star catalogs and a Bayesian
methodology to derive robust structural parameters of the inner Halo (<25 kpc)
and Thick Disc of the Milky Way. RR Lyrae stars are an unequivocal tracer of
old metal-poor populations, for which accurate distances and extinctions can be
individually estimated and so, are a reliable independent means of tracing the
population of the old high-[\alpha/Fe] disc usually associated to the Thick
Disc. In particular, the chosen RR Lyrae sample spans regions at low galactic
latitude toward the anti-center direction, allowing to probe the outermost
parts of the disc. Our results favour a Thick Disc with short scale height and
short scale length, $h_z=0.65_{-0.05}^{+0.09}$ kpc, $h_R=2.1_{-0.25}^{+0.82}$
kpc, for a model in which the inner Halo has a constant flattening of
$q=0.90_{-0.03}^{+0.05}$ and a power law index of $n=-2.78_{-0.05}^{+0.05}$.
Similar short scales for the Thick Disc are also found when considering an
inner Halo with flattening dependent on radius. We also explored a model in
which the Thick Disc has a flare and, although this is only mildly constrained
by our data, a flare onset in the inner $\sim11$ kpc is highly disfavoured.
| astro-ph.GA | we used a combination of public rr lyrae star catalogs and a bayesian methodology to derive robust structural parameters of the inner halo 25 kpc and thick disc of the milky way rr lyrae stars are an unequivocal tracer of old metalpoor populations for which accurate distances and extinctions can be individually estimated and so are a reliable independent means of tracing the population of the old highalphafe disc usually associated to the thick disc in particular the chosen rr lyrae sample spans regions at low galactic latitude toward the anticenter direction allowing to probe the outermost parts of the disc our results favour a thick disc with short scale height and short scale length h_z065_005009 kpc h_r21_025082 kpc for a model in which the inner halo has a constant flattening of q090_003005 and a power law index of n278_005005 similar short scales for the thick disc are also found when considering an inner halo with flattening dependent on radius we also explored a model in which the thick disc has a flare and although this is only mildly constrained by our data a flare onset in the inner sim11 kpc is highly disfavoured | [['we', 'used', 'a', 'combination', 'of', 'public', 'rr', 'lyrae', 'star', 'catalogs', 'and', 'a', 'bayesian', 'methodology', 'to', 'derive', 'robust', 'structural', 'parameters', 'of', 'the', 'inner', 'halo', '25', 'kpc', 'and', 'thick', 'disc', 'of', 'the', 'milky', 'way', 'rr', 'lyrae', 'stars', 'are', 'an', 'unequivocal', 'tracer', 'of', 'old', 'metalpoor', 'populations', 'for', 'which', 'accurate', 'distances', 'and', 'extinctions', 'can', 'be', 'individually', 'estimated', 'and', 'so', 'are', 'a', 'reliable', 'independent', 'means', 'of', 'tracing', 'the', 'population', 'of', 'the', 'old', 'highalphafe', 'disc', 'usually', 'associated', 'to', 'the', 'thick', 'disc', 'in', 'particular', 'the', 'chosen', 'rr', 'lyrae', 'sample', 'spans', 'regions', 'at', 'low', 'galactic', 'latitude', 'toward', 'the', 'anticenter', 'direction', 'allowing', 'to', 'probe', 'the', 'outermost', 'parts', 'of', 'the', 'disc', 'our', 'results', 'favour', 'a', 'thick', 'disc', 'with', 'short', 'scale', 'height', 'and', 'short', 'scale', 'length', 'h_z065_005009', 'kpc', 'h_r21_025082', 'kpc', 'for', 'a', 'model', 'in', 'which', 'the', 'inner', 'halo', 'has', 'a', 'constant', 'flattening', 'of', 'q090_003005', 'and', 'a', 'power', 'law', 'index', 'of', 'n278_005005', 'similar', 'short', 'scales', 'for', 'the', 'thick', 'disc', 'are', 'also', 'found', 'when', 'considering', 'an', 'inner', 'halo', 'with', 'flattening', 'dependent', 'on', 'radius', 'we', 'also', 'explored', 'a', 'model', 'in', 'which', 'the', 'thick', 'disc', 'has', 'a', 'flare', 'and', 'although', 'this', 'is', 'only', 'mildly', 'constrained', 'by', 'our', 'data', 'a', 'flare', 'onset', 'in', 'the', 'inner', 'sim11', 'kpc', 'is', 'highly', 'disfavoured']] | [-0.05574974012913452, 0.10437025759556012, -0.1030295749746361, 0.09209532886069562, -0.1290424768187988, -0.06692353372069958, 0.04610511415490979, 0.42669765712007096, -0.2232127045759147, -0.34363586340883845, 0.04726877644854156, -0.23635147933627626, 0.004732948791627821, 0.22440497605987875, -0.06117756042237345, -0.0360166785981212, 0.026348534919395063, -0.08556050349664139, -0.026470790764218884, -0.2544319792981505, 0.25575005401318013, 0.08097561437170953, 0.1064248661094002, -0.08921723196981475, 0.057721935372530044, -0.11284608462653858, -0.0688938811053767, -0.004770898917003682, -0.1686085043327981, 0.09664760838556839, 0.2174405865910414, 0.06985801238789512, 0.22970305483138778, -0.3560206679184232, -0.21633777136571314, 0.026539312915778473, 0.25340962607511563, 0.0387934415705355, -0.05389791711518468, -0.2202952103493245, 0.08968844798172972, -0.18331707435856132, -0.22406700623319728, 0.09720810547863182, 0.09968964629193866, 0.010924000743972628, -0.24606247518309637, 0.16864211012174277, 0.04877288968449361, 0.11331639749635207, -0.07839930675675676, -0.11929126825967902, -0.05597476727623296, 0.08038553287026987, 0.06299965718001323, 0.08997752807519742, 0.22023300844501997, -0.0963786103100957, 0.011053088855758113, 0.35194782621570325, -0.0748682816629298, -0.047416499759511725, 0.20168232619884963, -0.19556899597427171, -0.1309818173489092, 0.10244570264935886, 0.15279511993897982, 0.15849625381084287, -0.1569715563346491, 0.0577855157388656, -0.06805130730468878, 0.2639549832349937, 0.07488955213492246, 0.020798648482090547, 0.3396157873965996, 0.13482981387060136, 0.08961388772647631, 0.07219821925912248, -0.23471462833358123, -0.075778078553757, -0.2656464380359179, -0.07074095460909456, -0.08577514840044866, 0.04805761636479905, -0.18690761592075242, -0.17070174944636068, 0.3563165893582137, 0.06865971011697854, 0.25540110462063337, 0.05021902085955892, 0.317776196292528, 0.05197216797816126, 0.1365881069109922, 0.173006779467687, 0.2910207437571922, 0.18987495884924244, 0.04321655854092617, -0.2072784425274126, 0.10179444816833558, -0.015419831560728582] |
1,802.07799 | Comment on "Quantizing strings in de Sitter space" | Trying to quantize the string in a de Sitter spacetime, Miao Li, Wei Song and
Yushu Song presents a solution for the string equation of motion
(JHEP04(2007)042) that is not correct. This reopens the problem by them
addressed.
| hep-th | trying to quantize the string in a de sitter spacetime miao li wei song and yushu song presents a solution for the string equation of motion jhep042007042 that is not correct this reopens the problem by them addressed | [['trying', 'to', 'quantize', 'the', 'string', 'in', 'a', 'de', 'sitter', 'spacetime', 'miao', 'li', 'wei', 'song', 'and', 'yushu', 'song', 'presents', 'a', 'solution', 'for', 'the', 'string', 'equation', 'of', 'motion', 'jhep042007042', 'that', 'is', 'not', 'correct', 'this', 'reopens', 'the', 'problem', 'by', 'them', 'addressed']] | [-0.14869233461407325, 0.061784647327537336, -0.10518055935244774, 0.11143309263409013, -0.16409567422750923, -0.2079387686163601, 0.039650000631809235, 0.2582602687697444, -0.22986537740669316, -0.3112769838836458, 0.03145733322728322, -0.27729145396086907, -0.16127276725860107, 0.08775121819538374, -0.20674496247536606, 0.06524141227257335, 0.023438692222245865, 0.005252352294822534, 0.004604223371845567, -0.3385229522569312, 0.34315927067978513, 0.12135242355159587, 0.24217973121752343, -0.0283859647396538, 0.12471536320582446, -0.003531180826636652, -0.06339852827497655, 0.00798504256332914, -0.20468276653850304, 0.11026426696723017, 0.29517234592801994, 0.17616829928010702, 0.23132003222902617, -0.370484001442997, -0.24556762660439643, 0.03309890992629031, 0.15369170112535357, 0.2278162561253541, -0.04747636629165047, -0.3417080144604875, 0.10172658925876021, -0.12616348385603893, -0.12178271076279795, -0.02697411769380172, 0.08756983590622743, -0.0939331649699145, -0.1393970067017815, 0.048085566299657025, 0.07934916205704212, -0.08080286646468772, -0.10475760202906612, -0.02635487430315051, 0.0175234895820419, 0.08500586463034981, 0.05759796910893379, 0.14804665287697893, 0.010706478212442663, -0.1228692755038436, -0.12075622578979367, 0.3854537445327474, -0.1084174268051154, -0.2707843991196973, 0.09463947465539807, -0.06666939709490786, -0.13204084649785525, 0.07005337907725738, 0.01903810626309779, 0.1392590697440836, -0.17951455652817255, 0.22071021006073957, -0.027648862942846283, 0.14003266347572207, 0.1973853385231147, -0.09252690615701592, 0.1830882326596313, 0.06140459165908396, 0.02927873211188449, 0.05362089609520303, 0.017125095531001635, -0.07580959046673444, -0.2884008052028043, -0.18754538448734415, -0.14652526896033022, 0.08037790938760736, -0.023418698233096318, -0.1499901617773705, 0.3447099442386793, 0.1318682715969367, 0.23328696698364285, -0.01607295500838922, 0.20915524123443496, 0.07410874747438356, -0.0814212659218659, 0.10043560513036533, 0.22877060321884024, 0.12130973622616795, 0.24399643344804645, -0.26430877565871924, -0.040042004172897175, 0.23105935765326852] |
1,802.078 | Liver segmentation in CT images using three dimensional to two
dimensional fully convolutional network | The need for CT scan analysis is growing for pre-diagnosis and therapy of
abdominal organs. Automatic organ segmentation of abdominal CT scan can help
radiologists analyze the scans faster and segment organ images with fewer
errors. However, existing methods are not efficient enough to perform the
segmentation process for victims of accidents and emergencies situations. In
this paper we propose an efficient liver segmentation with our 3D to 2D fully
connected network (3D-2D-FCN). The segmented mask is enhanced by means of
conditional random field on the organ's border. Consequently, we segment a
target liver in less than a minute with Dice score of 93.52.
| cs.CV | the need for ct scan analysis is growing for prediagnosis and therapy of abdominal organs automatic organ segmentation of abdominal ct scan can help radiologists analyze the scans faster and segment organ images with fewer errors however existing methods are not efficient enough to perform the segmentation process for victims of accidents and emergencies situations in this paper we propose an efficient liver segmentation with our 3d to 2d fully connected network 3d2dfcn the segmented mask is enhanced by means of conditional random field on the organs border consequently we segment a target liver in less than a minute with dice score of 9352 | [['the', 'need', 'for', 'ct', 'scan', 'analysis', 'is', 'growing', 'for', 'prediagnosis', 'and', 'therapy', 'of', 'abdominal', 'organs', 'automatic', 'organ', 'segmentation', 'of', 'abdominal', 'ct', 'scan', 'can', 'help', 'radiologists', 'analyze', 'the', 'scans', 'faster', 'and', 'segment', 'organ', 'images', 'with', 'fewer', 'errors', 'however', 'existing', 'methods', 'are', 'not', 'efficient', 'enough', 'to', 'perform', 'the', 'segmentation', 'process', 'for', 'victims', 'of', 'accidents', 'and', 'emergencies', 'situations', 'in', 'this', 'paper', 'we', 'propose', 'an', 'efficient', 'liver', 'segmentation', 'with', 'our', '3d', 'to', '2d', 'fully', 'connected', 'network', '3d2dfcn', 'the', 'segmented', 'mask', 'is', 'enhanced', 'by', 'means', 'of', 'conditional', 'random', 'field', 'on', 'the', 'organs', 'border', 'consequently', 'we', 'segment', 'a', 'target', 'liver', 'in', 'less', 'than', 'a', 'minute', 'with', 'dice', 'score', 'of', '9352']] | [0.013665908921308798, 0.05782563495802923, 0.007478424013384338, 0.04820819665603037, -0.058598661076422164, -0.18424025864240903, 0.035989403965412774, 0.4722411348187767, -0.15814600526852515, -0.29985367240908656, 0.15670065671087974, -0.32815856595514614, -0.13348396287019393, 0.1897563682032695, -0.2104315086475854, 0.08784930207269284, 0.16087057377275044, 0.044086783312857876, -0.019651183565215037, -0.23423973278332394, 0.20861435416538848, 0.04167621865760065, 0.32557654071563075, 0.021318734849540933, 0.10405611295523733, -0.0021919116142739372, -0.023775385719841544, 0.010269343761446913, -0.08905013283551896, 0.17655416046725858, 0.34498720922172793, 0.18366033934255682, 0.31860054669521964, -0.4711298594178939, -0.2325418141661483, 0.11633745399620203, 0.18978553955687336, 0.09923794477029695, -0.013400601915951854, -0.3158711909917771, 0.13357132174146985, -0.12432953052534111, 0.0085575522909176, -0.10366840567439795, -0.01074955119012213, -0.05949725505095699, -0.3255308723389126, 0.1430432821117631, -0.01880912928281406, 0.12931782757700647, -0.09329019216097241, -0.051639036865434744, 0.01487075507265597, 0.22109177482576625, 0.010931961495797738, 0.13773136220203297, 0.2114484409250102, -0.22936951209230402, -0.11291805446346842, 0.32266959755961755, 0.07221665740783385, -0.21584119647741318, 0.1554492044052645, -0.10919197525340811, -0.0665162518344711, 0.2037144241474786, 0.20795900560011274, 0.17559161685515665, -0.15224703250778387, -0.09217391060653947, 0.04031290997100036, 0.20216081300479116, 0.07362608615200496, -0.13628535457317112, 0.1400347299041968, 0.25571543653721657, 0.026037692129092054, 0.15670645662845628, -0.25240792453207656, 0.02472900035022532, -0.21902044240421462, -0.18335946684576643, -0.12985965699518046, -0.038389661560570866, -0.0798871534481222, -0.23260927524019792, 0.39781000499514124, 0.21497331657085242, 0.1479419991012337, 0.05551589858600671, 0.3784718023595011, -0.031248265377797402, 0.1365104681242583, 0.001073796428667689, 0.14935924318953625, -0.0343933608179496, 0.08945338542288332, -0.17476591247233372, 0.12830530261186865, 0.07078408118274099] |
1,802.07801 | A New Hybrid Half-Duplex/Full-Duplex Relaying System with Antenna
Diversity | The hybrid half-duplex/full-duplex (HD/FD) relaying scheme is an effective
paradigm to overcome the negative effects of the self-interference incurred by
the full-duplex (FD) mode. However, traditional hybrid HD/FD scheme does not
consider the diversity gain incurred by the multiple antennas of the FD node
when the system works in the HD mode, leading to the waste of the system
resources. In this paper, we propose a new hybrid HD/FD relaying scheme, which
utilizes both the antennas of the FD relay node for reception and transmission
when the system works in the HD mode. With multiple antennas, the maximum ratio
combining/maximum ratio transmission is adopted to process the signals at the
relay node. Based on this scheme, we derive the exact closed-form system outage
probability and conduct various numerical simulations. The results show that
the proposed scheme remarkably improves the system outage performance over the
traditional scheme, and demonstrate that the proposed scheme can more
effectively alleviate the adverse effects of the residual self-interference.
| cs.IT math.IT | the hybrid halfduplexfullduplex hdfd relaying scheme is an effective paradigm to overcome the negative effects of the selfinterference incurred by the fullduplex fd mode however traditional hybrid hdfd scheme does not consider the diversity gain incurred by the multiple antennas of the fd node when the system works in the hd mode leading to the waste of the system resources in this paper we propose a new hybrid hdfd relaying scheme which utilizes both the antennas of the fd relay node for reception and transmission when the system works in the hd mode with multiple antennas the maximum ratio combiningmaximum ratio transmission is adopted to process the signals at the relay node based on this scheme we derive the exact closedform system outage probability and conduct various numerical simulations the results show that the proposed scheme remarkably improves the system outage performance over the traditional scheme and demonstrate that the proposed scheme can more effectively alleviate the adverse effects of the residual selfinterference | [['the', 'hybrid', 'halfduplexfullduplex', 'hdfd', 'relaying', 'scheme', 'is', 'an', 'effective', 'paradigm', 'to', 'overcome', 'the', 'negative', 'effects', 'of', 'the', 'selfinterference', 'incurred', 'by', 'the', 'fullduplex', 'fd', 'mode', 'however', 'traditional', 'hybrid', 'hdfd', 'scheme', 'does', 'not', 'consider', 'the', 'diversity', 'gain', 'incurred', 'by', 'the', 'multiple', 'antennas', 'of', 'the', 'fd', 'node', 'when', 'the', 'system', 'works', 'in', 'the', 'hd', 'mode', 'leading', 'to', 'the', 'waste', 'of', 'the', 'system', 'resources', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'hybrid', 'hdfd', 'relaying', 'scheme', 'which', 'utilizes', 'both', 'the', 'antennas', 'of', 'the', 'fd', 'relay', 'node', 'for', 'reception', 'and', 'transmission', 'when', 'the', 'system', 'works', 'in', 'the', 'hd', 'mode', 'with', 'multiple', 'antennas', 'the', 'maximum', 'ratio', 'combiningmaximum', 'ratio', 'transmission', 'is', 'adopted', 'to', 'process', 'the', 'signals', 'at', 'the', 'relay', 'node', 'based', 'on', 'this', 'scheme', 'we', 'derive', 'the', 'exact', 'closedform', 'system', 'outage', 'probability', 'and', 'conduct', 'various', 'numerical', 'simulations', 'the', 'results', 'show', 'that', 'the', 'proposed', 'scheme', 'remarkably', 'improves', 'the', 'system', 'outage', 'performance', 'over', 'the', 'traditional', 'scheme', 'and', 'demonstrate', 'that', 'the', 'proposed', 'scheme', 'can', 'more', 'effectively', 'alleviate', 'the', 'adverse', 'effects', 'of', 'the', 'residual', 'selfinterference']] | [-0.26342628852041716, -0.007784129688742623, -0.03747740812760628, -0.028510367284856508, -0.0462155371191509, -0.24364580103357172, 0.1561513973096742, 0.34638440502048645, -0.2502339091281303, -0.2437169141550031, 0.03773985495345299, -0.24919985766223643, -0.2132215750242733, 0.13038041719298718, -0.1081056064253466, 0.05816814237860618, 0.07761343599751269, 0.0329382029235547, 0.0005507182335642017, -0.2511371738222761, 0.3069443003860889, 0.16763551059512444, 0.4140895737197112, 0.046594328344742086, 0.10140541073453704, 0.005193433268743073, -0.007865492283240145, -0.05514141718029148, -0.06898985495120732, 0.043696016781779444, 0.28207194552768344, 0.16701584915561532, 0.2832036253156853, -0.41313154547026865, -0.3008206942187691, 0.08281644630349344, 0.18596322983460226, 0.09404776557161829, -0.020895882420271294, -0.2596835931590586, 0.13301243517622582, -0.2776279727537415, -0.03696279924500872, 0.02117746622865031, -0.12270735993544445, 0.04635580595766688, -0.35828131605457103, 0.020875644650745758, 0.007690400873989235, -0.0033209220424328966, -0.030372840582312627, -0.12633944008525255, 0.037218485147560036, 0.12988768235088993, 0.024645161348428105, -0.04507017991057149, 0.06754789843775884, -0.04800295717669306, -0.11419268019704355, 0.3721616567503431, -0.038077530719880244, -0.2315246418842839, 0.14749198667791294, -0.09198947393415886, -0.0566827276100715, 0.18148915152594355, 0.22611985727569756, 0.09214321851807956, -0.16862913025460452, -0.0006898139918907143, 0.03344808884804355, 0.16879237204629147, 0.04868475696428415, 0.11151430422992066, 0.11304881045577565, 0.18508370549785963, 0.11882956558263597, 0.11720659394308718, -0.17972458588149123, -0.08878017154203895, -0.19304010177636233, -0.1277932490209221, -0.20901307971579638, -0.04590624410730577, -0.10867524963530875, -0.052133931384571355, 0.3538465502218138, 0.156100954299212, 0.09879577264511659, 0.1083028885847774, 0.46401596400472855, 0.1584362836208275, 0.06500987096885104, 0.11978410689999568, 0.24782347573142752, 0.06317839116421471, 0.13047074618171556, -0.33207739890196625, 0.061920658196610065, 0.014346581699763552] |
1,802.07802 | Protecting Sensory Data against Sensitive Inferences | There is growing concern about how personal data are used when users grant
applications direct access to the sensors of their mobile devices. In fact,
high resolution temporal data generated by motion sensors reflect directly the
activities of a user and indirectly physical and demographic attributes. In
this paper, we propose a feature learning architecture for mobile devices that
provides flexible and negotiable privacy-preserving sensor data transmission by
appropriately transforming raw sensor data. The objective is to move from the
current binary setting of granting or not permission to an application, toward
a model that allows users to grant each application permission over a limited
range of inferences according to the provided services. The internal structure
of each component of the proposed architecture can be flexibly changed and the
trade-off between privacy and utility can be negotiated between the constraints
of the user and the underlying application. We validated the proposed
architecture in an activity recognition application using two real-world
datasets, with the objective of recognizing an activity without disclosing
gender as an example of private information. Results show that the proposed
framework maintains the usefulness of the transformed data for activity
recognition, with an average loss of only around three percentage points, while
reducing the possibility of gender classification to around 50\%, the target
random guess, from more than 90\% when using raw sensor data. We also present
and distribute MotionSense, a new dataset for activity and attribute
recognition collected from motion sensors.
| cs.LG | there is growing concern about how personal data are used when users grant applications direct access to the sensors of their mobile devices in fact high resolution temporal data generated by motion sensors reflect directly the activities of a user and indirectly physical and demographic attributes in this paper we propose a feature learning architecture for mobile devices that provides flexible and negotiable privacypreserving sensor data transmission by appropriately transforming raw sensor data the objective is to move from the current binary setting of granting or not permission to an application toward a model that allows users to grant each application permission over a limited range of inferences according to the provided services the internal structure of each component of the proposed architecture can be flexibly changed and the tradeoff between privacy and utility can be negotiated between the constraints of the user and the underlying application we validated the proposed architecture in an activity recognition application using two realworld datasets with the objective of recognizing an activity without disclosing gender as an example of private information results show that the proposed framework maintains the usefulness of the transformed data for activity recognition with an average loss of only around three percentage points while reducing the possibility of gender classification to around 50 the target random guess from more than 90 when using raw sensor data we also present and distribute motionsense a new dataset for activity and attribute recognition collected from motion sensors | [['there', 'is', 'growing', 'concern', 'about', 'how', 'personal', 'data', 'are', 'used', 'when', 'users', 'grant', 'applications', 'direct', 'access', 'to', 'the', 'sensors', 'of', 'their', 'mobile', 'devices', 'in', 'fact', 'high', 'resolution', 'temporal', 'data', 'generated', 'by', 'motion', 'sensors', 'reflect', 'directly', 'the', 'activities', 'of', 'a', 'user', 'and', 'indirectly', 'physical', 'and', 'demographic', 'attributes', 'in', 'this', 'paper', 'we', 'propose', 'a', 'feature', 'learning', 'architecture', 'for', 'mobile', 'devices', 'that', 'provides', 'flexible', 'and', 'negotiable', 'privacypreserving', 'sensor', 'data', 'transmission', 'by', 'appropriately', 'transforming', 'raw', 'sensor', 'data', 'the', 'objective', 'is', 'to', 'move', 'from', 'the', 'current', 'binary', 'setting', 'of', 'granting', 'or', 'not', 'permission', 'to', 'an', 'application', 'toward', 'a', 'model', 'that', 'allows', 'users', 'to', 'grant', 'each', 'application', 'permission', 'over', 'a', 'limited', 'range', 'of', 'inferences', 'according', 'to', 'the', 'provided', 'services', 'the', 'internal', 'structure', 'of', 'each', 'component', 'of', 'the', 'proposed', 'architecture', 'can', 'be', 'flexibly', 'changed', 'and', 'the', 'tradeoff', 'between', 'privacy', 'and', 'utility', 'can', 'be', 'negotiated', 'between', 'the', 'constraints', 'of', 'the', 'user', 'and', 'the', 'underlying', 'application', 'we', 'validated', 'the', 'proposed', 'architecture', 'in', 'an', 'activity', 'recognition', 'application', 'using', 'two', 'realworld', 'datasets', 'with', 'the', 'objective', 'of', 'recognizing', 'an', 'activity', 'without', 'disclosing', 'gender', 'as', 'an', 'example', 'of', 'private', 'information', 'results', 'show', 'that', 'the', 'proposed', 'framework', 'maintains', 'the', 'usefulness', 'of', 'the', 'transformed', 'data', 'for', 'activity', 'recognition', 'with', 'an', 'average', 'loss', 'of', 'only', 'around', 'three', 'percentage', 'points', 'while', 'reducing', 'the', 'possibility', 'of', 'gender', 'classification', 'to', 'around', '50', 'the', 'target', 'random', 'guess', 'from', 'more', 'than', '90', 'when', 'using', 'raw', 'sensor', 'data', 'we', 'also', 'present', 'and', 'distribute', 'motionsense', 'a', 'new', 'dataset', 'for', 'activity', 'and', 'attribute', 'recognition', 'collected', 'from', 'motion', 'sensors']] | [-0.10120076557320501, 0.01671585640487972, -0.053600607806607824, 0.010405842002592368, -0.12368770432371048, -0.16610701185739274, 0.09059493286571553, 0.4181964714893326, -0.2794708459496253, -0.3864795124625841, 0.09361094343159808, -0.30849577086301444, -0.13875696221807274, 0.20407012814977837, -0.14631484095927005, 0.04224126010274691, 0.08660881883280788, 0.08786510709297571, -0.00904626416525355, -0.2722864400867541, 0.3005090376847029, 0.06420371458585922, 0.3490780458063148, 0.04066586897156581, 0.10527136354465727, 0.026150233146289954, -0.034933583413292904, -0.016613398389029654, -0.03555098696610744, 0.18140802675103118, 0.30506334072668795, 0.22608600243535124, 0.3188402368945794, -0.4342090048110534, -0.18435019746982328, 0.0582318080822964, 0.125632610633862, 0.0650268534286194, -0.07981736214052734, -0.35592042621648623, 0.11089783665099384, -0.2073119446163836, -0.05332290742978925, -0.07917345859639255, 0.005961055541602672, 0.008177089785875316, -0.2979467950098757, 0.009572565359989979, 0.013305494111460545, 0.10957508997171504, -0.0929552615789549, -0.05611625562494797, -0.031162571520333797, 0.23570423584585673, 0.04455874197917067, -0.013456384161268764, 0.1780182404554767, -0.15914791424896707, -0.13527196573300493, 0.3663246418318784, -0.007386009778299008, -0.19399629931115073, 0.16920846822353486, -0.07067648545597438, -0.10989476410713718, 0.09960383582484636, 0.22604570856462558, 0.07531560054087222, -0.20168548928458271, -0.018451011622776833, -0.0020707178101089206, 0.2118387888204843, 0.05001853281103166, 0.02801219077681195, 0.20110275770763678, 0.20447378610011666, 0.07655185605725082, 0.11700849729846903, -0.12031559837951397, -0.04832630938900167, -0.22046392049531188, -0.12657882608166693, -0.21025467535994427, 0.007704980300661318, -0.10931457749770575, -0.08553152237903833, 0.3954483698708592, 0.22402736095811238, 0.20628750372731697, 0.04862426779397721, 0.3447362895472427, 0.038857037975230546, 0.10578273659391874, 0.08777870854684784, 0.1542463585923123, 0.0026729650136251997, 0.1637373840452628, -0.157701205593484, 0.12301789813793797, -0.04555682219189319] |
1,802.07803 | Climbing the rotational ladder to chirality | Molecular chirality is conventionally understood as space-inversion-symmetry
breaking in the equilibrium structure of molecules. Less well known is that
achiral molecules can be made chiral through extreme rotational excitation.
Here, we theoretically demonstrate a clear strategy for generating
rotationally-induced chirality (RIC): An optical centrifuge rotationally
excites the phosphine molecule (PH$_3$) into chiral cluster states that
correspond to clockwise ($R$-enantiomer) or anticlockwise ($L$-enantiomer)
rotation about axes almost coinciding with single P-H bonds. Application of a
strong dc electric field during the centrifuge pulse favors the production of
one rotating enantiomeric form over the other, creating dynamically chiral
molecules with $permanently$ oriented rotational angular momentum. This
essential step toward characterizing RIC promises a fresh perspective on
chirality as a fundamental aspect of nature.
| physics.chem-ph physics.atm-clus physics.atom-ph | molecular chirality is conventionally understood as spaceinversionsymmetry breaking in the equilibrium structure of molecules less well known is that achiral molecules can be made chiral through extreme rotational excitation here we theoretically demonstrate a clear strategy for generating rotationallyinduced chirality ric an optical centrifuge rotationally excites the phosphine molecule ph_3 into chiral cluster states that correspond to clockwise renantiomer or anticlockwise lenantiomer rotation about axes almost coinciding with single ph bonds application of a strong dc electric field during the centrifuge pulse favors the production of one rotating enantiomeric form over the other creating dynamically chiral molecules with permanently oriented rotational angular momentum this essential step toward characterizing ric promises a fresh perspective on chirality as a fundamental aspect of nature | [['molecular', 'chirality', 'is', 'conventionally', 'understood', 'as', 'spaceinversionsymmetry', 'breaking', 'in', 'the', 'equilibrium', 'structure', 'of', 'molecules', 'less', 'well', 'known', 'is', 'that', 'achiral', 'molecules', 'can', 'be', 'made', 'chiral', 'through', 'extreme', 'rotational', 'excitation', 'here', 'we', 'theoretically', 'demonstrate', 'a', 'clear', 'strategy', 'for', 'generating', 'rotationallyinduced', 'chirality', 'ric', 'an', 'optical', 'centrifuge', 'rotationally', 'excites', 'the', 'phosphine', 'molecule', 'ph_3', 'into', 'chiral', 'cluster', 'states', 'that', 'correspond', 'to', 'clockwise', 'renantiomer', 'or', 'anticlockwise', 'lenantiomer', 'rotation', 'about', 'axes', 'almost', 'coinciding', 'with', 'single', 'ph', 'bonds', 'application', 'of', 'a', 'strong', 'dc', 'electric', 'field', 'during', 'the', 'centrifuge', 'pulse', 'favors', 'the', 'production', 'of', 'one', 'rotating', 'enantiomeric', 'form', 'over', 'the', 'other', 'creating', 'dynamically', 'chiral', 'molecules', 'with', 'permanently', 'oriented', 'rotational', 'angular', 'momentum', 'this', 'essential', 'step', 'toward', 'characterizing', 'ric', 'promises', 'a', 'fresh', 'perspective', 'on', 'chirality', 'as', 'a', 'fundamental', 'aspect', 'of', 'nature']] | [-0.1965328896994371, 0.24098115052026006, -0.06516587780788541, -0.01079392068036753, -0.06907624584796318, -0.15910531346433623, 0.053900983555526555, 0.45866083312716527, -0.2486590002503116, -0.27014092367016157, 0.020680680749661652, -0.18937403079067058, -0.08907553397308467, 0.10905707975744933, 0.014844381159676586, -0.02035089373841124, -0.020032677128595317, -0.0043166847149762565, 0.005907929522158988, -0.11286684562515278, 0.22312419513493018, 0.02543281611465549, 0.28161847194404166, 0.04910349518936759, 0.0746865570663585, -0.014662502483480562, 0.08451716976400102, -0.034667749121643096, -0.08763308195316852, 0.09198442429562605, 0.1874871830598025, -0.007973201655766975, 0.1644665853064152, -0.4685633821152466, -0.18640181268229922, 0.05873545797608824, 0.19959019806524106, 0.17794247545791253, -0.08242031123567574, -0.262832146016358, 0.014931174050385163, -0.12168281577464382, -0.22363602252029893, -0.09883479127991882, 0.061933051740506, -0.008986683862315397, -0.23110933817964505, 0.1002883445076897, 0.06710559639475956, 0.12208113156582655, -0.09646931513788778, -0.1196430297884143, -0.13138497820700187, 0.07825011791369357, 0.04746893005500107, 0.08218535545313636, 0.22468967352583372, -0.12119243197908657, -0.10598009379217559, 0.4241554067328067, -0.06189861264271204, -0.14872568281430562, 0.15696110398808527, -0.12711942912043878, -0.1391671643211601, 0.18402304378795928, 0.11675787941450096, 0.11267836027979945, -0.10981552431535496, -0.028410974487472894, -0.04433944662322559, 0.19183083281603688, 0.14648788889585915, 0.06354013524586492, 0.3438668087839102, 0.13945682419432423, 0.07414806151952026, 0.15184438947965076, -0.11348871132003743, -0.12141863572395455, -0.2169225019653391, -0.1439188258925658, -0.18325909423657646, 0.11319892771021163, -0.013165681441393445, -0.11960428914497212, 0.36525911055071186, 0.05026716932307108, 0.1823377219212273, -0.0524220582263266, 0.3191265381943687, 0.032166866615209413, 0.08782513381250329, 0.02449906067093992, 0.2846720378561798, 0.19866628505257986, 0.08253748424378839, -0.2649872891557545, 0.07883877350610358, 0.002469404726841692] |
1,802.07804 | Low complexity convolutional neural network for vessel segmentation in
portable retinal diagnostic devices | Retinal vessel information is helpful in retinal disease screening and
diagnosis. Retinal vessel segmentation provides useful information about
vessels and can be used by physicians during intraocular surgery and retinal
diagnostic operations. Convolutional neural networks (CNNs) are powerful tools
for classification and segmentation of medical images. Complexity of CNNs makes
it difficult to implement them in portable devices such as binocular indirect
ophthalmoscopes. In this paper a simplification approach is proposed for CNNs
based on combination of quantization and pruning. Fully connected layers are
quantized and convolutional layers are pruned to have a simple and efficient
network structure. Experiments on images of the STARE dataset show that our
simplified network is able to segment retinal vessels with acceptable accuracy
and low complexity.
| cs.CV | retinal vessel information is helpful in retinal disease screening and diagnosis retinal vessel segmentation provides useful information about vessels and can be used by physicians during intraocular surgery and retinal diagnostic operations convolutional neural networks cnns are powerful tools for classification and segmentation of medical images complexity of cnns makes it difficult to implement them in portable devices such as binocular indirect ophthalmoscopes in this paper a simplification approach is proposed for cnns based on combination of quantization and pruning fully connected layers are quantized and convolutional layers are pruned to have a simple and efficient network structure experiments on images of the stare dataset show that our simplified network is able to segment retinal vessels with acceptable accuracy and low complexity | [['retinal', 'vessel', 'information', 'is', 'helpful', 'in', 'retinal', 'disease', 'screening', 'and', 'diagnosis', 'retinal', 'vessel', 'segmentation', 'provides', 'useful', 'information', 'about', 'vessels', 'and', 'can', 'be', 'used', 'by', 'physicians', 'during', 'intraocular', 'surgery', 'and', 'retinal', 'diagnostic', 'operations', 'convolutional', 'neural', 'networks', 'cnns', 'are', 'powerful', 'tools', 'for', 'classification', 'and', 'segmentation', 'of', 'medical', 'images', 'complexity', 'of', 'cnns', 'makes', 'it', 'difficult', 'to', 'implement', 'them', 'in', 'portable', 'devices', 'such', 'as', 'binocular', 'indirect', 'ophthalmoscopes', 'in', 'this', 'paper', 'a', 'simplification', 'approach', 'is', 'proposed', 'for', 'cnns', 'based', 'on', 'combination', 'of', 'quantization', 'and', 'pruning', 'fully', 'connected', 'layers', 'are', 'quantized', 'and', 'convolutional', 'layers', 'are', 'pruned', 'to', 'have', 'a', 'simple', 'and', 'efficient', 'network', 'structure', 'experiments', 'on', 'images', 'of', 'the', 'stare', 'dataset', 'show', 'that', 'our', 'simplified', 'network', 'is', 'able', 'to', 'segment', 'retinal', 'vessels', 'with', 'acceptable', 'accuracy', 'and', 'low', 'complexity']] | [-0.02006071168315512, 0.009526206755795139, -0.03198074942747177, 0.07426317870301341, -0.12532069974517343, -0.22415646138670278, 0.004625594044250459, 0.4936477016842316, -0.2256083897553569, -0.3128298559526274, 0.11763070048745106, -0.2571091935392623, -0.27650544018877193, 0.22302722885496606, -0.21079434210834794, 0.1202301566743038, 0.20787202845777825, 0.031991316386583174, 0.027998538495403184, -0.28542097249791826, 0.23169806405270765, 0.048462127216067935, 0.3859579676592892, 0.052112509361814614, 0.13103534714203358, -0.06276752217287922, -0.03289543126501943, -0.0005012633883171091, -0.051420187367203794, 0.19158862725723813, 0.3814425818575931, 0.17524802304558024, 0.2721402794988595, -0.5152239198365907, -0.24633471506516919, 0.039256751032696255, 0.18043208751954476, 0.10998349264468556, 0.014204225564483275, -0.35043550623303726, 0.12925090937353748, -0.11406184111775691, 0.04051669252748228, -0.1677898853278357, -0.026255309897328705, -0.06937078683259935, -0.26976461458252743, 0.05662505485479189, -0.0074534074346581086, 0.09139240036472247, -0.023396115855545706, -0.06544314372576465, -0.015482639858291354, 0.2345522546655814, -0.04614051528590585, 0.08663998732404891, 0.18406652332830034, -0.24015238730829547, -0.07262120974126987, 0.2957473028843745, 0.024108607525944955, -0.2180841740139968, 0.20357119540630048, 0.01108596362327495, -0.11927900384064795, 0.1370776013417308, 0.21459962018142062, 0.09582650627987074, -0.1673684991316, -0.07972136269345656, -0.0018467999348216807, 0.19055182599146997, 0.08480772715300507, -0.007994381583888422, 0.1824954373661952, 0.33286814348510474, 0.00041254990530192605, 0.1461406216431363, -0.20753929904716914, 0.02250048397147397, -0.17438773489518722, -0.15508727863246252, -0.14456944480299766, -0.023000521491058478, -0.10613113277195375, -0.16772164442106957, 0.421191098008782, 0.1921006402439507, 0.1614831729507274, 0.10093592342050854, 0.4000781978488215, -0.03076404412007652, 0.2018184511285383, 0.038165454987498106, 0.16727944132525566, 0.0928296893924063, 0.11480655004958283, -0.14680552974435662, 0.10121805767320897, 0.1014336162284767] |
1,802.07805 | The Signpost Platform for City-Scale Sensing | City-scale sensing holds the promise of enabling a deeper understanding of
our urban environments. However, a city-scale deployment requires physical
installation, power management, and communications---all challenging tasks
standing between a good idea and a realized one. This indicates the need for a
platform that enables easy deployment and experimentation for applications
operating at city scale. To address these challenges, we present Signpost, a
modular, energy-harvesting platform for city-scale sensing. Signpost simplifies
deployment by eliminating the need for connection to wired infrastructure and
instead harvesting energy from an integrated solar panel. The platform
furnishes the key resources necessary to support multiple, pluggable sensor
modules while providing fair, safe, and reliable sharing in the face of dynamic
energy constraints. We deploy Signpost with several sensor modules, showing the
viability of an energy-harvesting, multi-tenant, sensing system, and evaluate
its ability to support sensing applications. We believe Signpost reduces the
difficulty inherent in city-scale deployments, enables new experimentation, and
provides improved insights into urban health.
| cs.CY | cityscale sensing holds the promise of enabling a deeper understanding of our urban environments however a cityscale deployment requires physical installation power management and communicationsall challenging tasks standing between a good idea and a realized one this indicates the need for a platform that enables easy deployment and experimentation for applications operating at city scale to address these challenges we present signpost a modular energyharvesting platform for cityscale sensing signpost simplifies deployment by eliminating the need for connection to wired infrastructure and instead harvesting energy from an integrated solar panel the platform furnishes the key resources necessary to support multiple pluggable sensor modules while providing fair safe and reliable sharing in the face of dynamic energy constraints we deploy signpost with several sensor modules showing the viability of an energyharvesting multitenant sensing system and evaluate its ability to support sensing applications we believe signpost reduces the difficulty inherent in cityscale deployments enables new experimentation and provides improved insights into urban health | [['cityscale', 'sensing', 'holds', 'the', 'promise', 'of', 'enabling', 'a', 'deeper', 'understanding', 'of', 'our', 'urban', 'environments', 'however', 'a', 'cityscale', 'deployment', 'requires', 'physical', 'installation', 'power', 'management', 'and', 'communicationsall', 'challenging', 'tasks', 'standing', 'between', 'a', 'good', 'idea', 'and', 'a', 'realized', 'one', 'this', 'indicates', 'the', 'need', 'for', 'a', 'platform', 'that', 'enables', 'easy', 'deployment', 'and', 'experimentation', 'for', 'applications', 'operating', 'at', 'city', 'scale', 'to', 'address', 'these', 'challenges', 'we', 'present', 'signpost', 'a', 'modular', 'energyharvesting', 'platform', 'for', 'cityscale', 'sensing', 'signpost', 'simplifies', 'deployment', 'by', 'eliminating', 'the', 'need', 'for', 'connection', 'to', 'wired', 'infrastructure', 'and', 'instead', 'harvesting', 'energy', 'from', 'an', 'integrated', 'solar', 'panel', 'the', 'platform', 'furnishes', 'the', 'key', 'resources', 'necessary', 'to', 'support', 'multiple', 'pluggable', 'sensor', 'modules', 'while', 'providing', 'fair', 'safe', 'and', 'reliable', 'sharing', 'in', 'the', 'face', 'of', 'dynamic', 'energy', 'constraints', 'we', 'deploy', 'signpost', 'with', 'several', 'sensor', 'modules', 'showing', 'the', 'viability', 'of', 'an', 'energyharvesting', 'multitenant', 'sensing', 'system', 'and', 'evaluate', 'its', 'ability', 'to', 'support', 'sensing', 'applications', 'we', 'believe', 'signpost', 'reduces', 'the', 'difficulty', 'inherent', 'in', 'cityscale', 'deployments', 'enables', 'new', 'experimentation', 'and', 'provides', 'improved', 'insights', 'into', 'urban', 'health']] | [-0.1708956804475747, 0.016072759535927617, -0.0385410100716399, 0.009553691979817813, -0.13217036325368098, -0.18576494927547174, 0.0953079229206196, 0.40178627891291396, -0.23302686500246636, -0.34301245915703477, 0.1208758031934849, -0.1980275790585438, -0.16346652230713515, 0.2545404368778691, -0.15146876600920223, 0.10819201910599077, 0.09247562311211369, -0.05118028194119688, 0.012635222004610114, -0.1940363317844458, 0.26001451175252444, 0.11899428413598798, 0.37775076135440033, 0.1273938747239299, 0.10470392054121476, 0.021119348381034797, -0.03683236859214958, -0.07595145196501107, -0.037428292226331907, 0.19907371513727412, 0.37064343232195823, 0.21725459600274916, 0.352658839157084, -0.49097692020004613, -0.23049063235375797, 0.07813517621834762, 0.14285538390104194, 0.014321153152559418, -0.11479519903659821, -0.27471409678692, 0.08858201842958806, -0.21842085222597235, -0.161878747944138, -0.10141809483757243, -0.030675124534172937, -0.02917209416445985, -0.3183278595271986, -0.04313506624021102, -0.02320518247433938, 0.0675840410811361, -0.08877614635639475, -0.0628008432999195, 0.042161824136564975, 0.23460873062140308, -0.053001088154269384, -0.0446238919019379, 0.18418373554304707, -0.15303874760970756, -0.10339888697781134, 0.42863872001180425, 0.04397077539106249, -0.11624538126634434, 0.2377021060543484, -0.009880470673670061, -0.16475505180715116, 0.08740615185452043, 0.20310319117961625, 0.011743110726820305, -0.18518496043107008, 0.048663265002323895, 0.04157816732185893, 0.16391735063516535, 0.022610938965226524, 0.09370229440100956, 0.2717100305104395, 0.28768210688140244, 0.1544577954831766, 0.12222734220558777, -0.07277802999597043, -0.07193728994461708, -0.20594166528353525, -0.17885443229570228, -0.15275381091341841, 0.03843967101420276, -0.09789415718050805, -0.09950944129377604, 0.37102055195719, 0.2383186223785742, 0.12858720301373977, 0.06282928737346083, 0.3883357772603631, -0.016427498597477098, 0.12325417912506964, 0.11305465927525801, 0.15020954996580257, 0.030427296277775896, 0.21907729216763983, -0.16748314722644864, 0.04518462353225914, -0.0718484126322437] |
1,802.07806 | "Gas-dynamic" expansion of a fast-electron flux in a plasma | The one-dimensional flight of a fast electron flux in plasma is investigated
taking into account generation and absorption of plasma waves. The transition
from the kinetic description to the gas dynamics is made. The closed set of gas
dynamic equations for electrons and plasmons is derived and a solution is
obtained in the case of monoenergetic injection of fast electrons. This
solution represents the beam-plasma structure, which propagates in plasma with
a constant velocity.
| physics.plasm-ph | the onedimensional flight of a fast electron flux in plasma is investigated taking into account generation and absorption of plasma waves the transition from the kinetic description to the gas dynamics is made the closed set of gas dynamic equations for electrons and plasmons is derived and a solution is obtained in the case of monoenergetic injection of fast electrons this solution represents the beamplasma structure which propagates in plasma with a constant velocity | [['the', 'onedimensional', 'flight', 'of', 'a', 'fast', 'electron', 'flux', 'in', 'plasma', 'is', 'investigated', 'taking', 'into', 'account', 'generation', 'and', 'absorption', 'of', 'plasma', 'waves', 'the', 'transition', 'from', 'the', 'kinetic', 'description', 'to', 'the', 'gas', 'dynamics', 'is', 'made', 'the', 'closed', 'set', 'of', 'gas', 'dynamic', 'equations', 'for', 'electrons', 'and', 'plasmons', 'is', 'derived', 'and', 'a', 'solution', 'is', 'obtained', 'in', 'the', 'case', 'of', 'monoenergetic', 'injection', 'of', 'fast', 'electrons', 'this', 'solution', 'represents', 'the', 'beamplasma', 'structure', 'which', 'propagates', 'in', 'plasma', 'with', 'a', 'constant', 'velocity']] | [-0.14153435999823333, 0.20100270976891388, -0.0415433422611976, 0.03394277929171064, -0.002546773732614678, -0.09572781431740401, -0.01953486167523708, 0.35086324252188206, -0.2570064904709422, -0.25075762698779236, 0.010352785908302443, -0.2852775743734595, 0.0020384199766291153, 0.2061032044978158, 0.07721667590777616, 0.02299428337908073, 0.053084988615827985, -0.036319663200678455, -0.015085688748120054, -0.10904136405490036, 0.2569823605260132, 0.09208042053757487, 0.2630305214206109, 0.07312496930260111, 0.16083772861826662, -0.031869071453960764, 0.0016641719770189877, 0.028054944189215027, -0.11535492137792627, 0.05452788915686511, 0.1714546400739031, 0.053564389314930384, 0.2299206305477718, -0.4857912812180616, -0.2917637539448569, -0.012745189106066685, 0.16815374805466146, 0.12420161533943452, -0.09990804815488691, -0.2668381528897412, -0.022288601996528136, -0.1574111596202931, -0.17301959707401693, 0.007065314749205434, 0.033351647201925516, 0.04213276059316421, -0.3061314919449049, 0.08109265122235425, 0.0516646032699862, -0.032835268377754336, -0.11855207295534578, -0.025689880036421725, -0.02609359791087037, 0.06397977343609405, 0.06417385816913904, 0.041241442904228695, 0.18195466526290024, -0.14241815989245535, -0.006062010315725127, 0.44676686702547846, -0.08580943510389409, -0.16936225366048716, 0.16876278368038805, -0.22095205038282517, -0.03688749653992016, 0.26496707159723787, 0.15926363759648962, 0.0768598511412337, -0.17103260534428488, 0.06593173604877037, -0.05255237763521035, 0.1253029140985942, 0.059279294017500976, -0.005271159433382186, 0.24001795169268106, 0.21441974278816298, 0.023782442411961587, 0.1461970374944645, -0.11845956201904227, -0.05763909763127968, -0.2727058713852957, -0.17739003427276337, -0.1573565165398995, 0.07483223045395838, -0.02834810796638202, -0.20282737858517952, 0.44753877493880084, 0.09162055286956397, 0.13958942586228856, -0.04294574698527671, 0.33583728828769477, 0.19607252173139117, -0.027847102783444162, 0.13450982509734663, 0.2505453878107506, 0.19029873942427739, 0.12250880054449914, -0.25084041017170594, 0.02136631657973536, 0.09824444811690498] |
1,802.07807 | A Guide to Comparing the Performance of VA Algorithms | The literature comparing the performance of algorithms for assigning cause of
death using verbal autopsy data is fractious and does not reach a consensus on
which algorithms perform best, or even how to do the comparison. This
manuscript explains the challenges and suggests a way forward. A universal
challenge is the lack of standard training and testing data. This limits
meaningful comparisons between algorithms, and further, limits the ability of
any algorithm to classify verbal autopsy deaths by cause in a way that is
widely generalizable across regions and through time. Verbal autopsy algorithms
utilize a variety of information to describe the relationship between verbal
autopsy symptoms and causes of death - called symptom-cause information (SCI).
A crowd sourced, public archive of SCI managed by the World Health Organization
(WHO) is suggested as a way to address the lack of SCI for developing, testing,
and comparing verbal autopsy coding algorithms, and additionally, as a way to
ensure that algorithm-assigned causes of death are as accurate and comparable
across regions and through time as possible.
| stat.AP | the literature comparing the performance of algorithms for assigning cause of death using verbal autopsy data is fractious and does not reach a consensus on which algorithms perform best or even how to do the comparison this manuscript explains the challenges and suggests a way forward a universal challenge is the lack of standard training and testing data this limits meaningful comparisons between algorithms and further limits the ability of any algorithm to classify verbal autopsy deaths by cause in a way that is widely generalizable across regions and through time verbal autopsy algorithms utilize a variety of information to describe the relationship between verbal autopsy symptoms and causes of death called symptomcause information sci a crowd sourced public archive of sci managed by the world health organization who is suggested as a way to address the lack of sci for developing testing and comparing verbal autopsy coding algorithms and additionally as a way to ensure that algorithmassigned causes of death are as accurate and comparable across regions and through time as possible | [['the', 'literature', 'comparing', 'the', 'performance', 'of', 'algorithms', 'for', 'assigning', 'cause', 'of', 'death', 'using', 'verbal', 'autopsy', 'data', 'is', 'fractious', 'and', 'does', 'not', 'reach', 'a', 'consensus', 'on', 'which', 'algorithms', 'perform', 'best', 'or', 'even', 'how', 'to', 'do', 'the', 'comparison', 'this', 'manuscript', 'explains', 'the', 'challenges', 'and', 'suggests', 'a', 'way', 'forward', 'a', 'universal', 'challenge', 'is', 'the', 'lack', 'of', 'standard', 'training', 'and', 'testing', 'data', 'this', 'limits', 'meaningful', 'comparisons', 'between', 'algorithms', 'and', 'further', 'limits', 'the', 'ability', 'of', 'any', 'algorithm', 'to', 'classify', 'verbal', 'autopsy', 'deaths', 'by', 'cause', 'in', 'a', 'way', 'that', 'is', 'widely', 'generalizable', 'across', 'regions', 'and', 'through', 'time', 'verbal', 'autopsy', 'algorithms', 'utilize', 'a', 'variety', 'of', 'information', 'to', 'describe', 'the', 'relationship', 'between', 'verbal', 'autopsy', 'symptoms', 'and', 'causes', 'of', 'death', 'called', 'symptomcause', 'information', 'sci', 'a', 'crowd', 'sourced', 'public', 'archive', 'of', 'sci', 'managed', 'by', 'the', 'world', 'health', 'organization', 'who', 'is', 'suggested', 'as', 'a', 'way', 'to', 'address', 'the', 'lack', 'of', 'sci', 'for', 'developing', 'testing', 'and', 'comparing', 'verbal', 'autopsy', 'coding', 'algorithms', 'and', 'additionally', 'as', 'a', 'way', 'to', 'ensure', 'that', 'algorithmassigned', 'causes', 'of', 'death', 'are', 'as', 'accurate', 'and', 'comparable', 'across', 'regions', 'and', 'through', 'time', 'as', 'possible']] | [-0.03509143336183008, 0.0410346415167784, -0.07667642323135891, 0.09103483452927322, -0.13733768382876674, -0.13362814979079893, 0.10989343496861265, 0.394525472951286, -0.2375798257834771, -0.34480234830475903, 0.12589277102790006, -0.2571492361808744, -0.18456476573585806, 0.2368203173220322, -0.15316863069858622, 0.01809564263505094, 0.08795166816630894, 0.04738675762954004, -0.010842365118579063, -0.25295163495876993, 0.2684200772111688, 0.04517955560346737, 0.33065070501145194, 0.034775164465913, 0.07543743659249123, -0.04571133794584859, -0.09410684505025582, 0.01855925110661808, -0.0787144992614391, 0.13652272195664836, 0.3186247738557594, 0.23959637174848467, 0.3475922915427124, -0.41081659789471064, -0.1911057170590057, 0.13922698076485712, 0.1685933153501109, 0.10448063921717489, -0.00942740220343694, -0.32780108408701114, 0.08097993180717286, -0.17735249909627088, -0.06073746846660095, -0.09493494595483165, 0.04219751799485975, 0.0028420628486749006, -0.2832336981274078, 0.10900843009688234, 0.038781940800083035, 0.10469637394827955, -0.004515614000368206, -0.04334371573949123, 0.022924230055993096, 0.2293739898582263, 0.06246945773155483, 0.05332781410748687, 0.11332565765786806, -0.1384109114522717, -0.1667541569509708, 0.40347351411576654, -0.011965901657651342, -0.14873673015202205, 0.24116718691708658, -0.07056909510865808, -0.09733424477060051, 0.06457197411398417, 0.19171617081909276, 0.03939459275125581, -0.19219476938357247, 0.009674747471067616, 0.015153483717757113, 0.1663887334686211, 0.06786908659782699, 0.018306101168341495, 0.17298607056111318, 0.17644502267186693, 0.019398361171924453, 0.07607701436671264, -0.05916107862722129, -0.07092739753185442, -0.24728841423330938, -0.15773284868260173, -0.12351333469234627, -0.020791335635294672, -0.04295691787778838, -0.14556380265447147, 0.38268708554918274, 0.2100363460424192, 0.16523019578855705, 0.052487038855564175, 0.2979764812564313, -0.0005434403565767057, 0.07947447709191371, 0.11500127594918012, 0.17242042246028125, 0.06082443583701901, 0.10628195124787881, -0.21620130674803958, 0.1514795608277542, -0.012186830804292934] |
1,802.07808 | Field effect enhancement in buffered quantum nanowire networks | III-V semiconductor nanowires have shown great potential in various quantum
transport experiments. However, realizing a scalable high-quality
nanowire-based platform that could lead to quantum information applications has
been challenging. Here, we study the potential of selective area growth by
molecular beam epitaxy of InAs nanowire networks grown on GaAs-based buffer
layers. The buffered geometry allows for substantial elastic strain relaxation
and a strong enhancement of field effect mobility. We show that the networks
possess strong spin-orbit interaction and long phase coherence lengths with a
temperature dependence indicating ballistic transport. With these findings, and
the compatibility of the growth method with hybrid epitaxy, we conclude that
the material platform fulfills the requirements for a wide range of quantum
experiments and applications.
| cond-mat.mtrl-sci cond-mat.mes-hall | iiiv semiconductor nanowires have shown great potential in various quantum transport experiments however realizing a scalable highquality nanowirebased platform that could lead to quantum information applications has been challenging here we study the potential of selective area growth by molecular beam epitaxy of inas nanowire networks grown on gaasbased buffer layers the buffered geometry allows for substantial elastic strain relaxation and a strong enhancement of field effect mobility we show that the networks possess strong spinorbit interaction and long phase coherence lengths with a temperature dependence indicating ballistic transport with these findings and the compatibility of the growth method with hybrid epitaxy we conclude that the material platform fulfills the requirements for a wide range of quantum experiments and applications | [['iiiv', 'semiconductor', 'nanowires', 'have', 'shown', 'great', 'potential', 'in', 'various', 'quantum', 'transport', 'experiments', 'however', 'realizing', 'a', 'scalable', 'highquality', 'nanowirebased', 'platform', 'that', 'could', 'lead', 'to', 'quantum', 'information', 'applications', 'has', 'been', 'challenging', 'here', 'we', 'study', 'the', 'potential', 'of', 'selective', 'area', 'growth', 'by', 'molecular', 'beam', 'epitaxy', 'of', 'inas', 'nanowire', 'networks', 'grown', 'on', 'gaasbased', 'buffer', 'layers', 'the', 'buffered', 'geometry', 'allows', 'for', 'substantial', 'elastic', 'strain', 'relaxation', 'and', 'a', 'strong', 'enhancement', 'of', 'field', 'effect', 'mobility', 'we', 'show', 'that', 'the', 'networks', 'possess', 'strong', 'spinorbit', 'interaction', 'and', 'long', 'phase', 'coherence', 'lengths', 'with', 'a', 'temperature', 'dependence', 'indicating', 'ballistic', 'transport', 'with', 'these', 'findings', 'and', 'the', 'compatibility', 'of', 'the', 'growth', 'method', 'with', 'hybrid', 'epitaxy', 'we', 'conclude', 'that', 'the', 'material', 'platform', 'fulfills', 'the', 'requirements', 'for', 'a', 'wide', 'range', 'of', 'quantum', 'experiments', 'and', 'applications']] | [-0.18763142575723274, 0.1439228968656001, -0.056815968927306434, -0.042253582583847066, -0.0231479915479819, -0.1983773306865866, 0.03445149629648465, 0.47103205632884054, -0.2707022231305018, -0.3197882098301003, 0.023268039906785512, -0.2660021673210091, -0.17932903427814986, 0.2650373034295626, 0.02561765176554521, 0.14000672953746593, 0.06047376750066178, -0.12435224933239321, -0.08325746321934276, -0.20583762910876732, 0.2616352909555038, 0.06923430108872708, 0.4190646326712643, 0.17790460259420798, 0.0890821550123898, -0.021397758465415487, 0.13584536845834616, 0.0303463155675369, -0.18426798857490212, 0.10627540126248884, 0.22707187598619688, -0.05195823287552533, 0.2712431944538063, -0.5006089437326106, -0.29224433359728813, -0.004566077523243924, 0.13148490609795166, 0.15058525978820397, -0.18644688097313822, -0.25859172934045394, 0.08546821684576571, -0.15298786226194352, -0.07777819775801617, -0.09024644884484587, -0.011026562675639676, 0.030684019452989257, -0.23409445596237977, 0.030587365508351165, 0.025235831260215492, 0.050749837741993056, -0.02181357984324374, -0.07990674596124639, -0.011297800876006174, 0.08612570741679519, -0.012566992935414115, -0.010540995254026105, 0.2103685997853366, -0.13248637820749234, -0.1448029948786522, 0.3564858264755458, -0.06800050035041447, -0.10201347108231858, 0.18902126401662828, -0.14051407638859625, -0.07589176226562509, 0.12486429967684672, 0.18561945914601286, 0.08381738203461282, -0.15217199785013993, 0.08821079951594583, 0.023764435633590136, 0.1796652304707095, 0.053691676852758975, 0.15717819686591003, 0.24772761709367236, 0.2660167525910462, 0.03915115378525418, 0.12536224558328588, -0.12397572454647161, -0.08515230785124003, -0.18307486485379437, -0.215492748352699, -0.19712491608224808, 0.11050050686268757, -0.07659437536058249, -0.17448087097218376, 0.3700677425600588, 0.1614182599199315, 0.13694289236251886, -0.01745487560207645, 0.2564882545848377, 0.07083287744317204, 0.1379100077203475, 0.0017877131467685103, 0.23798835006697724, 0.16602238183259033, 0.12281985396596913, -0.27279283448588104, 0.09865091894559251, -0.10255647238809615] |
1,802.07809 | Communication Melting in Graphs and Complex Networks | Complex networks are the representative graphs of interactions in many
complex systems. Usually, these interactions are abstractions of the
communication/diffusion channels between the units of the system. Real complex
networks, e.g. traffic networks, reveal different operation phases governed by
the dynamical stress of the system. Here we show how, communicability, a
topological descriptor that reveals the efficiency of the network functionality
in terms of these diffusive paths, could be used to reveal the transitions
mentioned. By considering a vibrational model of nodes and edges in a
graph/network at a given temperature (stress), we show that the communicability
function plays the role of the thermal Green's function of a network of
harmonic oscillators. After, we prove analytically the existence of a universal
phase transition in the communicability structure of every simple graph. This
transition resembles the melting process occurring in solids. For instance,
regular-like graphs resembling crystals, melts at lower temperatures and
display a sharper transition between connected to disconnected structures than
the random spatial graphs, which resemble amorphous solids. Finally, we study
computationally this graph melting process in some real-world networks and
observe that the rate of melting of graphs changes either as an exponential or
as a power-law with the inverse temperature. At the local level we discover
that the main driver for node melting is the eigenvector centrality of the
corresponding node, particularly when the critical value of the inverse
temperature approaches zero. These universal results sheds light on many
dynamical diffusive-like processes on networks that present transitions as
traffic jams, communication lost or failure cascades.
| physics.soc-ph math.CO nlin.PS | complex networks are the representative graphs of interactions in many complex systems usually these interactions are abstractions of the communicationdiffusion channels between the units of the system real complex networks eg traffic networks reveal different operation phases governed by the dynamical stress of the system here we show how communicability a topological descriptor that reveals the efficiency of the network functionality in terms of these diffusive paths could be used to reveal the transitions mentioned by considering a vibrational model of nodes and edges in a graphnetwork at a given temperature stress we show that the communicability function plays the role of the thermal greens function of a network of harmonic oscillators after we prove analytically the existence of a universal phase transition in the communicability structure of every simple graph this transition resembles the melting process occurring in solids for instance regularlike graphs resembling crystals melts at lower temperatures and display a sharper transition between connected to disconnected structures than the random spatial graphs which resemble amorphous solids finally we study computationally this graph melting process in some realworld networks and observe that the rate of melting of graphs changes either as an exponential or as a powerlaw with the inverse temperature at the local level we discover that the main driver for node melting is the eigenvector centrality of the corresponding node particularly when the critical value of the inverse temperature approaches zero these universal results sheds light on many dynamical diffusivelike processes on networks that present transitions as traffic jams communication lost or failure cascades | [['complex', 'networks', 'are', 'the', 'representative', 'graphs', 'of', 'interactions', 'in', 'many', 'complex', 'systems', 'usually', 'these', 'interactions', 'are', 'abstractions', 'of', 'the', 'communicationdiffusion', 'channels', 'between', 'the', 'units', 'of', 'the', 'system', 'real', 'complex', 'networks', 'eg', 'traffic', 'networks', 'reveal', 'different', 'operation', 'phases', 'governed', 'by', 'the', 'dynamical', 'stress', 'of', 'the', 'system', 'here', 'we', 'show', 'how', 'communicability', 'a', 'topological', 'descriptor', 'that', 'reveals', 'the', 'efficiency', 'of', 'the', 'network', 'functionality', 'in', 'terms', 'of', 'these', 'diffusive', 'paths', 'could', 'be', 'used', 'to', 'reveal', 'the', 'transitions', 'mentioned', 'by', 'considering', 'a', 'vibrational', 'model', 'of', 'nodes', 'and', 'edges', 'in', 'a', 'graphnetwork', 'at', 'a', 'given', 'temperature', 'stress', 'we', 'show', 'that', 'the', 'communicability', 'function', 'plays', 'the', 'role', 'of', 'the', 'thermal', 'greens', 'function', 'of', 'a', 'network', 'of', 'harmonic', 'oscillators', 'after', 'we', 'prove', 'analytically', 'the', 'existence', 'of', 'a', 'universal', 'phase', 'transition', 'in', 'the', 'communicability', 'structure', 'of', 'every', 'simple', 'graph', 'this', 'transition', 'resembles', 'the', 'melting', 'process', 'occurring', 'in', 'solids', 'for', 'instance', 'regularlike', 'graphs', 'resembling', 'crystals', 'melts', 'at', 'lower', 'temperatures', 'and', 'display', 'a', 'sharper', 'transition', 'between', 'connected', 'to', 'disconnected', 'structures', 'than', 'the', 'random', 'spatial', 'graphs', 'which', 'resemble', 'amorphous', 'solids', 'finally', 'we', 'study', 'computationally', 'this', 'graph', 'melting', 'process', 'in', 'some', 'realworld', 'networks', 'and', 'observe', 'that', 'the', 'rate', 'of', 'melting', 'of', 'graphs', 'changes', 'either', 'as', 'an', 'exponential', 'or', 'as', 'a', 'powerlaw', 'with', 'the', 'inverse', 'temperature', 'at', 'the', 'local', 'level', 'we', 'discover', 'that', 'the', 'main', 'driver', 'for', 'node', 'melting', 'is', 'the', 'eigenvector', 'centrality', 'of', 'the', 'corresponding', 'node', 'particularly', 'when', 'the', 'critical', 'value', 'of', 'the', 'inverse', 'temperature', 'approaches', 'zero', 'these', 'universal', 'results', 'sheds', 'light', 'on', 'many', 'dynamical', 'diffusivelike', 'processes', 'on', 'networks', 'that', 'present', 'transitions', 'as', 'traffic', 'jams', 'communication', 'lost', 'or', 'failure', 'cascades']] | [-0.17138004815115337, 0.1565448702585359, -0.0795875114207233, 0.05800446884166497, -0.00622138837968445, -0.12435328355149623, 0.06582480060349533, 0.38649664904038034, -0.2911861033750411, -0.26804396982580164, 0.06411603250692993, -0.29209865043111916, -0.22354487874925658, 0.14891296419213573, -0.0025513868082830218, 0.04718873367924787, 0.04332869147504988, 0.053396582493607445, -0.04028648289431481, -0.1872787054927439, 0.336196908369917, 0.02347273887805496, 0.2790993868358839, 0.09168527090508882, 0.059295250171730256, -0.022046843342526528, 0.040459330628557194, 0.034548293042688805, -0.11694994881540896, 0.07365904231300394, 0.256239802710683, 0.07077736002556138, 0.22805956872959227, -0.4364405656427078, -0.2664472019192962, 0.13382827587097754, 0.11952780019816922, 0.08400542159149865, 0.0034350630408696513, -0.2550555977821785, 0.060605216671709074, -0.1256048055845838, -0.09978381072892173, -0.06526708961301393, 0.023581863409053203, 0.04797907344768628, -0.23274246957365982, 0.09185285612638198, 0.07604234561515276, 0.07310916125470435, -0.02119666094808379, -0.0909092557717999, -0.06880674066369925, 0.12956246037313857, -0.0009563721180106432, -0.01735137055701837, 0.17701035534491008, -0.1546534573612191, -0.13683357061763884, 0.3846176970797203, -0.011658887138849773, -0.1150592010294301, 0.20627872013044815, -0.12237011544875925, -0.14807395148725186, 0.15555814521954348, 0.19979954617105222, 0.09186319708629377, -0.13262349171778015, 0.00757700744368578, -0.010070635143537001, 0.1422376921337011, 0.06296522874776492, 0.030105358656452325, 0.19583155302664243, 0.2106855411457572, 0.061563200007033345, 0.1807264411909839, -0.04140423627294861, -0.11437858838645981, -0.25502214303189447, -0.1399835258648017, -0.21718834087991876, 0.035522833490990655, -0.15750786940756767, -0.19569461487219145, 0.4252369156386341, 0.14636303996259586, 0.2317005002246952, 0.07308494975085547, 0.2472422332249234, 0.10791644477421337, 0.06572615745765473, 0.09303631780384057, 0.19439843328973616, 0.1263342620370047, 0.13100837600863166, -0.20723450595353538, 0.10505711058053235, 0.045246086969830325] |
1,802.0781 | Manipulating and Measuring Model Interpretability | With machine learning models being increasingly used to aid decision making
even in high-stakes domains, there has been a growing interest in developing
interpretable models. Although many supposedly interpretable models have been
proposed, there have been relatively few experimental studies investigating
whether these models achieve their intended effects, such as making people more
closely follow a model's predictions when it is beneficial for them to do so or
enabling them to detect when a model has made a mistake. We present a sequence
of pre-registered experiments (N=3,800) in which we showed participants
functionally identical models that varied only in two factors commonly thought
to make machine learning models more or less interpretable: the number of
features and the transparency of the model (i.e., whether the model internals
are clear or black box). Predictably, participants who saw a clear model with
few features could better simulate the model's predictions. However, we did not
find that participants more closely followed its predictions. Furthermore,
showing participants a clear model meant that they were less able to detect and
correct for the model's sizable mistakes, seemingly due to information
overload. These counterintuitive findings emphasize the importance of testing
over intuition when developing interpretable models.
| cs.AI cs.CY | with machine learning models being increasingly used to aid decision making even in highstakes domains there has been a growing interest in developing interpretable models although many supposedly interpretable models have been proposed there have been relatively few experimental studies investigating whether these models achieve their intended effects such as making people more closely follow a models predictions when it is beneficial for them to do so or enabling them to detect when a model has made a mistake we present a sequence of preregistered experiments n3800 in which we showed participants functionally identical models that varied only in two factors commonly thought to make machine learning models more or less interpretable the number of features and the transparency of the model ie whether the model internals are clear or black box predictably participants who saw a clear model with few features could better simulate the models predictions however we did not find that participants more closely followed its predictions furthermore showing participants a clear model meant that they were less able to detect and correct for the models sizable mistakes seemingly due to information overload these counterintuitive findings emphasize the importance of testing over intuition when developing interpretable models | [['with', 'machine', 'learning', 'models', 'being', 'increasingly', 'used', 'to', 'aid', 'decision', 'making', 'even', 'in', 'highstakes', 'domains', 'there', 'has', 'been', 'a', 'growing', 'interest', 'in', 'developing', 'interpretable', 'models', 'although', 'many', 'supposedly', 'interpretable', 'models', 'have', 'been', 'proposed', 'there', 'have', 'been', 'relatively', 'few', 'experimental', 'studies', 'investigating', 'whether', 'these', 'models', 'achieve', 'their', 'intended', 'effects', 'such', 'as', 'making', 'people', 'more', 'closely', 'follow', 'a', 'models', 'predictions', 'when', 'it', 'is', 'beneficial', 'for', 'them', 'to', 'do', 'so', 'or', 'enabling', 'them', 'to', 'detect', 'when', 'a', 'model', 'has', 'made', 'a', 'mistake', 'we', 'present', 'a', 'sequence', 'of', 'preregistered', 'experiments', 'n3800', 'in', 'which', 'we', 'showed', 'participants', 'functionally', 'identical', 'models', 'that', 'varied', 'only', 'in', 'two', 'factors', 'commonly', 'thought', 'to', 'make', 'machine', 'learning', 'models', 'more', 'or', 'less', 'interpretable', 'the', 'number', 'of', 'features', 'and', 'the', 'transparency', 'of', 'the', 'model', 'ie', 'whether', 'the', 'model', 'internals', 'are', 'clear', 'or', 'black', 'box', 'predictably', 'participants', 'who', 'saw', 'a', 'clear', 'model', 'with', 'few', 'features', 'could', 'better', 'simulate', 'the', 'models', 'predictions', 'however', 'we', 'did', 'not', 'find', 'that', 'participants', 'more', 'closely', 'followed', 'its', 'predictions', 'furthermore', 'showing', 'participants', 'a', 'clear', 'model', 'meant', 'that', 'they', 'were', 'less', 'able', 'to', 'detect', 'and', 'correct', 'for', 'the', 'models', 'sizable', 'mistakes', 'seemingly', 'due', 'to', 'information', 'overload', 'these', 'counterintuitive', 'findings', 'emphasize', 'the', 'importance', 'of', 'testing', 'over', 'intuition', 'when', 'developing', 'interpretable', 'models']] | [-0.027816419960900524, 0.09908676558834074, -0.11954065910441071, 0.1403521679624934, -0.12456905008521839, -0.2493740366023015, 0.045546757405385115, 0.45507085254639923, -0.21400683556800948, -0.35074620944770735, 0.08224761418895281, -0.29987448352814916, -0.18511219914001062, 0.2155486784235401, -0.09827449964300902, 0.06021423788826641, 0.09410358085437448, 0.061897352936878876, -0.010157478421612938, -0.29627956964435925, 0.24836779814962318, 0.08040360988693396, 0.2763264581675749, 0.020135486375624734, 0.04528192825259725, -0.06804888143938914, -0.058379097832612525, 0.039938858369173456, -0.07514966266394572, 0.11755299164232653, 0.3246624473033455, 0.15288443417386643, 0.34042868750104355, -0.45592989497373454, -0.2520059411476563, 0.14661915418013333, 0.14491882794957853, 0.13474657473999108, -0.0416799831886667, -0.2622697395717154, 0.08731857116507301, -0.1880109782030001, -0.07434250322877238, -0.1419202376358286, 0.03715409559253884, -0.039094443261873765, -0.24188409618133605, 0.017048832442115375, 0.073392960218357, 0.06949264869730376, -0.017821903089552782, -0.11231988860556304, 0.0018440747628859818, 0.16162946530083666, 0.09546782786960259, 0.01824874794473357, 0.11441293556533343, -0.1904111396996351, -0.13754632748574505, 0.38110757843783155, 0.015055177353051065, -0.19103168068107348, 0.27761161558437697, -0.10177526139799299, -0.14037741356805417, 0.0799859832906768, 0.17790529070113173, 0.08414263012889192, -0.15553938825350036, -0.04321570612253837, -0.033799812267885435, 0.23231222381348482, 0.027558550766280773, -0.025874417637891355, 0.2503169343137561, 0.16837946351865615, -0.03405630239080778, 0.06600689562037587, -0.0061841280057431955, -0.10723173260763662, -0.19837638192772677, -0.08213325689579525, -0.08591879036361773, 0.021586128928884046, -0.02523851118985933, -0.16820911340527797, 0.349759932860133, 0.24725821520665184, 0.20276868962752984, 0.042695708234148595, 0.27441138827508715, 0.045840841418789725, 0.14305204124629833, 0.08360607154906058, 0.2473181879461448, 0.05740779751663719, 0.0873537701384946, -0.09396720130476824, 0.17708070170199827, -0.05397710682070772] |
1,802.07811 | Universal Quadratic Forms and Indecomposables over Biquadratic Fields | The aim of this article is to study (additively) indecomposable algebraic
integers $\mathcal O_K$ of biquadratic number fields $K$ and universal totally
positive quadratic forms with coefficients in $\mathcal O_K$. There are given
sufficient conditions for an indecomposable element of a quadratic subfield to
remain indecomposable in the biquadratic number field $K$. Furthermore,
estimates are proven which enable algorithmization of the method of escalation
over $K$. These are used to prove, over two particular biquadratic number
fields $\mathbb{Q}(\sqrt{2}, \sqrt{3})$ and $\mathbb{Q}(\sqrt{6}, \sqrt{19})$,
a lower bound on the number of variables of a universal quadratic forms,
verifying Kitaoka's conjecture.
| math.NT | the aim of this article is to study additively indecomposable algebraic integers mathcal o_k of biquadratic number fields k and universal totally positive quadratic forms with coefficients in mathcal o_k there are given sufficient conditions for an indecomposable element of a quadratic subfield to remain indecomposable in the biquadratic number field k furthermore estimates are proven which enable algorithmization of the method of escalation over k these are used to prove over two particular biquadratic number fields mathbbqsqrt2 sqrt3 and mathbbqsqrt6 sqrt19 a lower bound on the number of variables of a universal quadratic forms verifying kitaokas conjecture | [['the', 'aim', 'of', 'this', 'article', 'is', 'to', 'study', 'additively', 'indecomposable', 'algebraic', 'integers', 'mathcal', 'o_k', 'of', 'biquadratic', 'number', 'fields', 'k', 'and', 'universal', 'totally', 'positive', 'quadratic', 'forms', 'with', 'coefficients', 'in', 'mathcal', 'o_k', 'there', 'are', 'given', 'sufficient', 'conditions', 'for', 'an', 'indecomposable', 'element', 'of', 'a', 'quadratic', 'subfield', 'to', 'remain', 'indecomposable', 'in', 'the', 'biquadratic', 'number', 'field', 'k', 'furthermore', 'estimates', 'are', 'proven', 'which', 'enable', 'algorithmization', 'of', 'the', 'method', 'of', 'escalation', 'over', 'k', 'these', 'are', 'used', 'to', 'prove', 'over', 'two', 'particular', 'biquadratic', 'number', 'fields', 'mathbbqsqrt2', 'sqrt3', 'and', 'mathbbqsqrt6', 'sqrt19', 'a', 'lower', 'bound', 'on', 'the', 'number', 'of', 'variables', 'of', 'a', 'universal', 'quadratic', 'forms', 'verifying', 'kitaokas', 'conjecture']] | [-0.2857235846354773, 0.13809038021886647, -0.03921536194699767, 0.001775987446308136, -0.08296301815609791, -0.16084927480765862, -0.019481850503698776, 0.3100137876444741, -0.3372990794479847, -0.23874942358877313, 0.05577480677564285, -0.23991984382614887, -0.13918169578230988, 0.2339441350612201, -0.03401266175665354, 0.013222715288008514, -0.03314764012435549, 0.13723185772174282, -0.030770365550721948, -0.4063753094916281, 0.32377750083411994, -0.07851905614921921, 0.16064667916415554, 0.06904888678538172, 0.0980825491837765, -0.00605374707987434, 0.01568948849300413, 0.001130714149851548, -0.17845780873965275, 0.13698877648107316, 0.36023264111656894, 0.08430822389935584, 0.25654747242990295, -0.37212758954418335, -0.10409206567871335, 0.2604177886816232, 0.12784544211003537, 0.008695388216476299, -0.01730783662979344, -0.18150373782570425, 0.1379940425229602, -0.14786047598249033, -0.12539356150419304, -0.12691048937604615, 0.08301332911329443, 0.007372113491261476, -0.3308562650296249, 0.01123833070067983, 0.10562330792990428, 0.17963376253059035, -0.07932672651092473, -0.2012507672458397, -0.017892461078927707, 0.026590705265928254, 0.020031313625115312, 0.039313679287749294, 0.027171073652999967, -0.09902505561660387, -0.0905180827043583, 0.29890641995558614, -0.07094231007718727, -0.1887195867927451, 0.13985381147236023, -0.13875527576984545, -0.11496862197711476, 0.17620522567120037, 0.14218310410352913, 0.1587631106278614, -0.06026689430796786, 0.20475973111797907, -0.1412131113294316, 0.10697136066461864, 0.07880070410962951, 0.03901582342621527, 0.15782898384097374, 0.011166275927404825, 0.09185707071599991, 0.15947350406234986, 0.04768991871540876, -0.038980514786549306, -0.32539710712276004, -0.17908704896812866, -0.16045724822110252, 0.11107476204756256, -0.11942678122799598, -0.186423116314568, 0.37125649271826994, 0.08868710247701721, 0.17849817329184398, 0.13056263386541486, 0.2058280986145531, 0.08211275592728175, 0.058683322877378055, 0.07843091834434553, 0.10349303127119416, 0.25302861147364114, -0.048770843963383846, -0.17089203860806793, 0.02282764656273158, 0.1393765037830331] |
1,802.07812 | Permanental processes with kernels that are not equivalent to a
symmetric matrix | Kernels of $\alpha$-permanental processes of the form
\[ v(x,y)=u(x,y)+f(y),\qquad x,y\in S, \]
in which $u(x,y)$ is symmetric, and $f$ is an excessive function for the
Borel right process with potential densities $u(x,y)$, are considered.
Conditions are given that determine whether $\{v(x,y);x,y\in S\}$ is
symmetrizable or asymptotically symmetrizable.
| math.PR | kernels of alphapermanental processes of the form vxyuxyfyqquad xyin s in which uxy is symmetric and f is an excessive function for the borel right process with potential densities uxy are considered conditions are given that determine whether vxyxyin s is symmetrizable or asymptotically symmetrizable | [['kernels', 'of', 'alphapermanental', 'processes', 'of', 'the', 'form', 'vxyuxyfyqquad', 'xyin', 's', 'in', 'which', 'uxy', 'is', 'symmetric', 'and', 'f', 'is', 'an', 'excessive', 'function', 'for', 'the', 'borel', 'right', 'process', 'with', 'potential', 'densities', 'uxy', 'are', 'considered', 'conditions', 'are', 'given', 'that', 'determine', 'whether', 'vxyxyin', 's', 'is', 'symmetrizable', 'or', 'asymptotically', 'symmetrizable']] | [-0.1626295391903367, 0.16198179950202587, -0.023666149698371112, 0.030443743980148884, -0.06599012251975837, -0.2074074022645174, -0.028901417089929413, 0.40195036012419433, -0.2962648849501166, -0.13284284764424312, 0.10428665628992455, -0.30459719038633415, -0.07013972055405206, 0.1393692294666327, -0.03681002020142799, 0.015359935827206734, 0.008329853236805214, 0.1126590177503436, -0.06409490102804591, -0.2460102290348258, 0.3519938357362556, -0.04202872334957816, 0.20361648720884046, 0.04813240458755646, 0.0878914363552318, -0.04697680323882852, 0.020827028142331644, -0.07200835174664336, -0.16042475981267607, -0.011186435168912245, 0.27703348231003727, 0.13517579002045962, 0.24657923827857472, -0.3677990394536146, -0.1440270395169771, 0.23204998630857052, 0.10911899337241816, -0.09512381565074848, -0.017314035423793072, -0.2274035013085881, 0.16126273038558836, -0.12962073286951975, -0.1756675610708636, -0.03422028831271238, 0.15658824763878054, 0.07456367124998292, -0.429238508087258, 0.09187180878118027, 0.12690482513849125, -0.017685087570963903, -0.035761966175118155, -0.16305834200059952, -0.07737835384038992, 0.09310182434679984, -0.04818548207498849, 0.07254227430581353, 0.05761472969640826, -0.07908659609207927, -0.08031264793257727, 0.37188257640877437, -0.027332868762747493, -0.311201415782751, 0.16086122588536075, -0.2039853054921814, -0.064936189110889, 0.11756548528061357, 0.08725559639982707, 0.17289515896592028, -0.1730164008128435, 0.2275768225609195, -0.05345158534514349, 0.031531780966297655, 0.0953871971429434, -0.010620740079862434, 0.1594166249134253, 0.07126379638996928, 0.10692244420521134, 0.0882780424557453, 0.025983712083638408, -0.032919532857662026, -0.3754844859588978, -0.16543574299836575, -0.17899384401565374, 0.12114277766878057, -0.06347727992126534, -0.21793969467195662, 0.2748353491147417, 0.05607981102671041, 0.20050632875672605, 0.03821454524484918, 0.1355898158061643, 0.19997082620339338, 0.026737679857327494, 0.08101468166163148, 0.05229209987230079, 0.15373533797926855, -0.04406994148049244, -0.17669979728173552, 0.09528638409493967, 0.12123982248784498] |
1,802.07813 | An upper bound for the representation dimension of group algebras with
an elementary abelian Sylow $p$-subgroup | Linckelmann showed in 2011 that a group algebra is separably equivalent to
the group algebra of its Sylow p-subgroups. In this article we use this
relationship, together with Mackey decomposition, to demonstrate that a group
algebra of a group with an elementary abelian Sylow $p$-subgroup $P$, has
representation dimension at most $|P|$.
| math.RT | linckelmann showed in 2011 that a group algebra is separably equivalent to the group algebra of its sylow psubgroups in this article we use this relationship together with mackey decomposition to demonstrate that a group algebra of a group with an elementary abelian sylow psubgroup p has representation dimension at most p | [['linckelmann', 'showed', 'in', '2011', 'that', 'a', 'group', 'algebra', 'is', 'separably', 'equivalent', 'to', 'the', 'group', 'algebra', 'of', 'its', 'sylow', 'psubgroups', 'in', 'this', 'article', 'we', 'use', 'this', 'relationship', 'together', 'with', 'mackey', 'decomposition', 'to', 'demonstrate', 'that', 'a', 'group', 'algebra', 'of', 'a', 'group', 'with', 'an', 'elementary', 'abelian', 'sylow', 'psubgroup', 'p', 'has', 'representation', 'dimension', 'at', 'most', 'p']] | [-0.18031252146913454, 0.0762320086832915, -0.20146038547570172, 0.00029382792686542065, -0.1824985755374655, -0.12169447011099412, 0.0027794397487573754, 0.39503809114774835, -0.3482553184036918, -0.22251195686224562, 0.07462772831338672, -0.23688600534716478, -0.13076202044948543, 0.12444049114576326, -0.20565249994755364, -0.12248342934113819, 0.05189231374802498, 0.1917669724386472, -0.0742745461130443, -0.29057607661413315, 0.3522085490135046, -0.032575367197680935, 0.2620543624283388, -0.04351405194029212, 0.10424588000974976, 0.06075247480139996, 0.00013805832713842392, -0.02728245516594213, -0.10096333090964785, 0.0756033778978655, 0.37458441657229113, 0.0205992501309643, 0.24680721107198714, -0.3334856364459623, -0.10249946612076691, 0.22153645209394968, 0.1550330756805264, -0.027752153002298795, -0.0879046911185679, -0.2549862233527864, 0.16918312968650404, -0.3218730373594623, -0.11748264626098368, -0.056051065505016595, 0.19767167669935867, -0.10648937483962911, -0.2130575971588349, -0.04395886000174169, 0.07026805463605203, 0.22043939996868944, -0.03485059198842814, -0.1179237926665407, -0.03703684006065417, 0.027542395586631477, -0.03368214327089775, 0.06391871419663613, 0.10534226327525595, -0.05021496245171875, -0.16201219814292228, 0.3908864018919233, -0.051826905889006764, -0.15521700538766497, 0.15744545904453844, -0.23266065584567303, -0.2520087197637902, 0.12269289127121177, 0.06879675071328305, 0.08897909419521546, -0.015128658959068932, 0.2650167759722815, -0.23160661071037444, 0.11864396896607314, 0.02669799180987936, -0.08378007635474205, 0.01930162330301335, 0.10280738231869271, 0.03318643553827245, 0.09012083193430534, 0.13756289777274316, 0.1285200086243164, -0.34812637891333836, -0.22095604667629232, -0.12663446272759196, 0.10949594120924863, -0.04805472332428998, -0.12677356519270688, 0.41385970250345194, 0.11429267996796764, 0.0814040586209068, 0.10797575429583398, 0.13257449969219473, 0.022617971900707252, 0.09413882772115847, 0.11934680429896197, 0.07215063373307483, 0.3384674479468511, -0.11868545551820156, -0.19118780521855044, -0.05172633249402189, 0.25955836390718245] |
1,802.07814 | Learning to Explain: An Information-Theoretic Perspective on Model
Interpretation | We introduce instancewise feature selection as a methodology for model
interpretation. Our method is based on learning a function to extract a subset
of features that are most informative for each given example. This feature
selector is trained to maximize the mutual information between selected
features and the response variable, where the conditional distribution of the
response variable given the input is the model to be explained. We develop an
efficient variational approximation to the mutual information, and show the
effectiveness of our method on a variety of synthetic and real data sets using
both quantitative metrics and human evaluation.
| cs.LG cs.AI stat.ML | we introduce instancewise feature selection as a methodology for model interpretation our method is based on learning a function to extract a subset of features that are most informative for each given example this feature selector is trained to maximize the mutual information between selected features and the response variable where the conditional distribution of the response variable given the input is the model to be explained we develop an efficient variational approximation to the mutual information and show the effectiveness of our method on a variety of synthetic and real data sets using both quantitative metrics and human evaluation | [['we', 'introduce', 'instancewise', 'feature', 'selection', 'as', 'a', 'methodology', 'for', 'model', 'interpretation', 'our', 'method', 'is', 'based', 'on', 'learning', 'a', 'function', 'to', 'extract', 'a', 'subset', 'of', 'features', 'that', 'are', 'most', 'informative', 'for', 'each', 'given', 'example', 'this', 'feature', 'selector', 'is', 'trained', 'to', 'maximize', 'the', 'mutual', 'information', 'between', 'selected', 'features', 'and', 'the', 'response', 'variable', 'where', 'the', 'conditional', 'distribution', 'of', 'the', 'response', 'variable', 'given', 'the', 'input', 'is', 'the', 'model', 'to', 'be', 'explained', 'we', 'develop', 'an', 'efficient', 'variational', 'approximation', 'to', 'the', 'mutual', 'information', 'and', 'show', 'the', 'effectiveness', 'of', 'our', 'method', 'on', 'a', 'variety', 'of', 'synthetic', 'and', 'real', 'data', 'sets', 'using', 'both', 'quantitative', 'metrics', 'and', 'human', 'evaluation']] | [-0.02835751504637301, -0.023104965503880522, -0.12023783013224602, 0.08312828148482368, -0.121623873594217, -0.12924381541088223, 0.060252962969243526, 0.41739112192764877, -0.2766318820568267, -0.3124114764621481, 0.08864264029543847, -0.2898148773610592, -0.2047962482413277, 0.20141712065553294, -0.07567597750574351, 0.06207265291945077, 0.06581510388990865, 0.067404380813241, -0.0231118797021918, -0.24934972934657706, 0.31590273095294835, 0.03707203968428075, 0.33654273189604283, 0.022906487500295045, 0.15610820453497581, 0.03734361815266311, -0.04707473548594862, 0.01986924963304773, -0.0834666808302427, 0.19054321734234692, 0.257130509193521, 0.22877997466363012, 0.3190963191539049, -0.3347406237060204, -0.22084317533299327, 0.09589415221475064, 0.07381552630744409, 0.09813437634846195, -0.026155170539859683, -0.3020007092412561, 0.09043900979217141, -0.13739196847687707, -0.019271285764407366, -0.15435171380639076, -0.004887115815654397, 0.02213787693530321, -0.3743552436400205, 0.03778935712762177, 0.03354952265450265, 0.07165168313775211, -0.07782936284085736, -0.10320117801427842, -0.012150850087637081, 0.14709442145656795, 0.01375672812690027, 0.04718261728179641, 0.13315704316832125, -0.12553424844925756, -0.11451404650229961, 0.34902317900210617, -0.07872432513628155, -0.2697897772304714, 0.1672426118212752, -0.06191768006421625, -0.10234193243551999, 0.06921191727742552, 0.22524393113330007, 0.14715452598989942, -0.17080077862367035, -0.025642811350990086, -0.05875907423906028, 0.1901399266673252, -0.028825802714563906, 0.03216051256749779, 0.17330847062752583, 0.2214151548501104, 0.021779960617423058, 0.17259313470800408, -0.1373954555206001, -0.0738946426846087, -0.31892817239277066, -0.12426329754292965, -0.2474807778187096, -0.036293429369106886, -0.12455904278845992, -0.17924774289829656, 0.4122888938896358, 0.22108444038312883, 0.26493076686398126, 0.07329904171638191, 0.31781370647251606, 0.11213136206497439, 0.04776114416308701, 0.05658588013611734, 0.17227504801936447, 0.06490182326815556, 0.02835590177215636, -0.19479767984477803, 0.11986533429007977, 0.06225074670976028] |
1,802.07815 | A Compact Low-Cost Low-Maintenance Open Architecture Mask Aligner for
Fabrication of Multilayer Microfluidics Devices | A custom-built mask aligner (CBMA), which fundamentally covers all the key
features of a commercial mask aligner, while being low cost, light weight, and
having low power consumption and high accuracy is constructed. The CBMA is
comprised of a custom high fidelity LED light source, vacuum chuck and mask
holder, high-precision translation and rotation stages, and high resolution
digital microscopes. The total cost of the system is under $7,500, which is
over ten times cheaper than a comparable commercial system. It produces a
collimated ultraviolet illumination of 1.8-2.0 mW cm-2 over an area of a
standard 4-inch wafer, at the plane of the photoresist exposure; and the
alignment accuracy is characterized to be < 3 microns, which is sufficient for
most microfluidic applications. Moreover, this manuscript provides detailed
descriptions of the procedures needed to fabricate multilayered master molds
using our CBMA. Finally, the capabilities of the CBMA are demonstrated by
fabricating two and three-layer masters for micro-scale devices, commonly
encountered in biomicrofluidics applications. The former is a flow-free
chemical gradient generator and the latter is an addressable microfluidic
stencil. Scanning electron microscopy is used to confirm that the master molds
contain the intended features of different heights.
| physics.app-ph physics.ins-det | a custombuilt mask aligner cbma which fundamentally covers all the key features of a commercial mask aligner while being low cost light weight and having low power consumption and high accuracy is constructed the cbma is comprised of a custom high fidelity led light source vacuum chuck and mask holder highprecision translation and rotation stages and high resolution digital microscopes the total cost of the system is under 7500 which is over ten times cheaper than a comparable commercial system it produces a collimated ultraviolet illumination of 1820 mw cm2 over an area of a standard 4inch wafer at the plane of the photoresist exposure and the alignment accuracy is characterized to be 3 microns which is sufficient for most microfluidic applications moreover this manuscript provides detailed descriptions of the procedures needed to fabricate multilayered master molds using our cbma finally the capabilities of the cbma are demonstrated by fabricating two and threelayer masters for microscale devices commonly encountered in biomicrofluidics applications the former is a flowfree chemical gradient generator and the latter is an addressable microfluidic stencil scanning electron microscopy is used to confirm that the master molds contain the intended features of different heights | [['a', 'custombuilt', 'mask', 'aligner', 'cbma', 'which', 'fundamentally', 'covers', 'all', 'the', 'key', 'features', 'of', 'a', 'commercial', 'mask', 'aligner', 'while', 'being', 'low', 'cost', 'light', 'weight', 'and', 'having', 'low', 'power', 'consumption', 'and', 'high', 'accuracy', 'is', 'constructed', 'the', 'cbma', 'is', 'comprised', 'of', 'a', 'custom', 'high', 'fidelity', 'led', 'light', 'source', 'vacuum', 'chuck', 'and', 'mask', 'holder', 'highprecision', 'translation', 'and', 'rotation', 'stages', 'and', 'high', 'resolution', 'digital', 'microscopes', 'the', 'total', 'cost', 'of', 'the', 'system', 'is', 'under', '7500', 'which', 'is', 'over', 'ten', 'times', 'cheaper', 'than', 'a', 'comparable', 'commercial', 'system', 'it', 'produces', 'a', 'collimated', 'ultraviolet', 'illumination', 'of', '1820', 'mw', 'cm2', 'over', 'an', 'area', 'of', 'a', 'standard', '4inch', 'wafer', 'at', 'the', 'plane', 'of', 'the', 'photoresist', 'exposure', 'and', 'the', 'alignment', 'accuracy', 'is', 'characterized', 'to', 'be', '3', 'microns', 'which', 'is', 'sufficient', 'for', 'most', 'microfluidic', 'applications', 'moreover', 'this', 'manuscript', 'provides', 'detailed', 'descriptions', 'of', 'the', 'procedures', 'needed', 'to', 'fabricate', 'multilayered', 'master', 'molds', 'using', 'our', 'cbma', 'finally', 'the', 'capabilities', 'of', 'the', 'cbma', 'are', 'demonstrated', 'by', 'fabricating', 'two', 'and', 'threelayer', 'masters', 'for', 'microscale', 'devices', 'commonly', 'encountered', 'in', 'biomicrofluidics', 'applications', 'the', 'former', 'is', 'a', 'flowfree', 'chemical', 'gradient', 'generator', 'and', 'the', 'latter', 'is', 'an', 'addressable', 'microfluidic', 'stencil', 'scanning', 'electron', 'microscopy', 'is', 'used', 'to', 'confirm', 'that', 'the', 'master', 'molds', 'contain', 'the', 'intended', 'features', 'of', 'different', 'heights']] | [-0.09572338980392159, 0.08353764496725076, -0.0553562580163773, -0.009032040503183283, -0.04237106519741649, -0.17091486419157423, 0.006907680819288722, 0.40939891082954777, -0.22932857937316323, -0.3366967895999551, 0.10710391238002952, -0.2821323604265362, -0.08879368836252191, 0.26315446227270456, -0.10544278375329162, 0.07340445275689696, 0.044738589992420266, -0.056890627669324116, -0.049211205262330734, -0.2502243627233988, 0.21581615227365808, 0.09642999760864168, 0.3214772005959116, 0.028430073206089725, 0.17323935221335804, -0.020789173760537787, -0.0054723745234161805, -0.030537511879751057, -0.07791803652060142, 0.12821186169908147, 0.23461473274846398, 0.08315187544782751, 0.25396757027537553, -0.42009376722493585, -0.2109071976329997, 0.02479034054276687, 0.10318242936615937, 0.07507078675373179, -0.06060056822835324, -0.2266737181674113, 0.10977882533766252, -0.15252570444285946, -0.11986943428545947, -0.04717528048156252, -0.012697208903192245, 0.026404360832212034, -0.2509239615666075, 0.01251350748880776, -0.007438330613460737, 0.10201593325593383, -0.010100924805753034, -0.09923182320589027, -0.022334516443283364, 0.10269993420968734, -0.0532802813614421, 0.051036471594605094, 0.19158126348053517, -0.13943436068060241, -0.06466701236126234, 0.3763460829738796, -0.02785410775214052, -0.13907657283329472, 0.18701865211412425, -0.09473198753320757, -0.05586671335478649, 0.19972207836360314, 0.13659799022758476, 0.12524539233694218, -0.19070531501729981, 0.027520278644251165, 0.01931066566972619, 0.2442999455781375, 0.1205126684346265, 0.04645860484037932, 0.20223186442090832, 0.23707764552541308, 0.04895061371156696, 0.1280966425241336, -0.15163097418508656, -0.026994447805918753, -0.24392727096613073, -0.17687012097491048, -0.1724513732244923, 0.04829607248311075, -0.07994552975857735, -0.13797659172974142, 0.3944508691711985, 0.13768283401366285, 0.14181792033841045, 0.02419422058323782, 0.3655340416241706, 0.05250349603431328, 0.13796290892209934, 0.02000637169322479, 0.19679530557561858, 0.07961748806086426, 0.14343007510292738, -0.16527314255639344, 0.055687003806935496, -0.017611598233529126] |
1,802.07816 | The Gemini/HST galaxy cluster project: Redshift 0.2-1.0 cluster sample,
X-ray data and optical photometry catalog | The Gemini/HST Galaxy Cluster Project (GCP) covers 14 z=0.2-1.0 clusters with
X-ray luminosity of L_500 >= 10^44 ergs/s in the 0.1-2.4 keV band. In this
paper we provide homogeneously calibrated X-ray luminosities, masses and radii,
and we present the complete catalog of the ground-based photometry for the GCP
clusters. The clusters were observed with Gemini North or South in three or
four of the optical passbands g', r', i' and z'. The photometric catalog
includes consistently calibrated total magnitudes, colors, and geometrical
parameters. The photometry reaches ~25 mag in the passband closest to rest
frame B-band. We summarize comparisons of our photometry with data from the
Sloan Digital Sky Survey. We describe the sample selection for our
spectroscopic observations, and establish the calibrations to obtain rest frame
magnitudes and colors. Finally, we derive the color-magnitude relations for the
clusters and briefly discuss these in the context of evolution with redshift.
Consistent with our results based on spectroscopic data, the color-magnitude
relations support passive evolution of the red-sequence galaxies. The absence
of change in the slope with redshift, constrains the allowable age variation
along the red sequence to <0.05 dex between the brightest cluster galaxies and
those four magnitudes fainter. The paper serves as the main reference for the
GCP cluster and galaxy selection, X-ray data and ground-based photometry.
| astro-ph.GA | the geminihst galaxy cluster project gcp covers 14 z0210 clusters with xray luminosity of l_500 1044 ergss in the 0124 kev band in this paper we provide homogeneously calibrated xray luminosities masses and radii and we present the complete catalog of the groundbased photometry for the gcp clusters the clusters were observed with gemini north or south in three or four of the optical passbands g r i and z the photometric catalog includes consistently calibrated total magnitudes colors and geometrical parameters the photometry reaches 25 mag in the passband closest to rest frame bband we summarize comparisons of our photometry with data from the sloan digital sky survey we describe the sample selection for our spectroscopic observations and establish the calibrations to obtain rest frame magnitudes and colors finally we derive the colormagnitude relations for the clusters and briefly discuss these in the context of evolution with redshift consistent with our results based on spectroscopic data the colormagnitude relations support passive evolution of the redsequence galaxies the absence of change in the slope with redshift constrains the allowable age variation along the red sequence to 005 dex between the brightest cluster galaxies and those four magnitudes fainter the paper serves as the main reference for the gcp cluster and galaxy selection xray data and groundbased photometry | [['the', 'geminihst', 'galaxy', 'cluster', 'project', 'gcp', 'covers', '14', 'z0210', 'clusters', 'with', 'xray', 'luminosity', 'of', 'l_500', '1044', 'ergss', 'in', 'the', '0124', 'kev', 'band', 'in', 'this', 'paper', 'we', 'provide', 'homogeneously', 'calibrated', 'xray', 'luminosities', 'masses', 'and', 'radii', 'and', 'we', 'present', 'the', 'complete', 'catalog', 'of', 'the', 'groundbased', 'photometry', 'for', 'the', 'gcp', 'clusters', 'the', 'clusters', 'were', 'observed', 'with', 'gemini', 'north', 'or', 'south', 'in', 'three', 'or', 'four', 'of', 'the', 'optical', 'passbands', 'g', 'r', 'i', 'and', 'z', 'the', 'photometric', 'catalog', 'includes', 'consistently', 'calibrated', 'total', 'magnitudes', 'colors', 'and', 'geometrical', 'parameters', 'the', 'photometry', 'reaches', '25', 'mag', 'in', 'the', 'passband', 'closest', 'to', 'rest', 'frame', 'bband', 'we', 'summarize', 'comparisons', 'of', 'our', 'photometry', 'with', 'data', 'from', 'the', 'sloan', 'digital', 'sky', 'survey', 'we', 'describe', 'the', 'sample', 'selection', 'for', 'our', 'spectroscopic', 'observations', 'and', 'establish', 'the', 'calibrations', 'to', 'obtain', 'rest', 'frame', 'magnitudes', 'and', 'colors', 'finally', 'we', 'derive', 'the', 'colormagnitude', 'relations', 'for', 'the', 'clusters', 'and', 'briefly', 'discuss', 'these', 'in', 'the', 'context', 'of', 'evolution', 'with', 'redshift', 'consistent', 'with', 'our', 'results', 'based', 'on', 'spectroscopic', 'data', 'the', 'colormagnitude', 'relations', 'support', 'passive', 'evolution', 'of', 'the', 'redsequence', 'galaxies', 'the', 'absence', 'of', 'change', 'in', 'the', 'slope', 'with', 'redshift', 'constrains', 'the', 'allowable', 'age', 'variation', 'along', 'the', 'red', 'sequence', 'to', '005', 'dex', 'between', 'the', 'brightest', 'cluster', 'galaxies', 'and', 'those', 'four', 'magnitudes', 'fainter', 'the', 'paper', 'serves', 'as', 'the', 'main', 'reference', 'for', 'the', 'gcp', 'cluster', 'and', 'galaxy', 'selection', 'xray', 'data', 'and', 'groundbased', 'photometry']] | [-0.004287013619889243, 0.05702737164426131, -0.07143624255611788, 0.07941974988067738, -0.1257281085682286, -0.018394669734611076, 0.09096116599925119, 0.49846598808117176, -0.12301870003720308, -0.38765003293975847, 0.07320800816698197, -0.36865317674722814, 0.006196029062333521, 0.19661343852294103, -0.07557109410419614, -0.03291468387244329, 0.09273387479042197, -0.10057757258903952, -0.06457070813153244, -0.3371664704073624, 0.2690354433395655, 0.01820383666615401, 0.20042188851428883, -0.1153777330740428, 0.06227251888555367, -0.011637651752079687, -0.17213961219174728, -0.03194788731806289, -0.2149796766628112, 0.02891965302067899, 0.24986391583637846, 0.1467072161132886, 0.19244345792350337, -0.2647490594963571, -0.12317453209345104, 0.060173706722355655, 0.18500639292226959, 0.007191461845985635, -0.031294195503447086, -0.2716041861599835, 0.040606274896125366, -0.15594391076056252, -0.18187369743988674, 0.09690412592297326, 0.03572023358471769, 0.07223353892444603, -0.19461786761812325, 0.14646024271107627, -0.047854385774342284, 0.14404959128933534, -0.1806694551162885, -0.1396465109358649, -0.08350149190486816, 0.11643121319754299, -0.04898801642096674, 0.10068898440943816, 0.11653550179280375, -0.1187291758677875, -0.016386022911437096, 0.40663773344544274, -0.050759206054150664, 0.0714031696021467, 0.1682114895263661, -0.1836889014935576, -0.18848341931631865, 0.051240581371362774, 0.14216699200566463, 0.07504354504984267, -0.22315653863959528, 0.01091763303316872, 0.019778158954529237, 0.2341270268238085, 0.011793856325555026, 0.11000811139967674, 0.27883431264778713, 0.10039225633176739, 0.03348855347445552, 0.09611302431702855, -0.3181530751367336, 0.027108562135991686, -0.3008534365638335, -0.04930221047982024, -0.10573903414686876, 0.05033701243874733, -0.1832981196993668, -0.1143136290765758, 0.3756019146447735, 0.14005948574398108, 0.21555201416569097, 0.14321651838372207, 0.31791639597313953, 0.05013521013498169, 0.12663405157908936, 0.09038464454633574, 0.3337759191861316, 0.16874879550120112, 0.07662317685824219, -0.21789134009998756, -0.021746603928695214, 0.023881018476148697] |
1,802.07817 | Formalizing and Implementing Distributed Ledger Objects | Despite the hype about blockchains and distributed ledgers, no formal
abstraction of these objects has been proposed. To face this issue, in this
paper we provide a proper formulation of a distributed ledger object. In brief,
we define a ledger object as a sequence of records, and we provide the
operations and the properties that such an object should support.
Implementation of a ledger object on top of multiple (possibly geographically
dispersed) computing devices gives rise to the distributed ledger object. In
contrast to the centralized object, distribution allows operations to be
applied concurrently on the ledger, introducing challenges on the consistency
of the ledger in each participant. We provide the definitions of three well
known consistency guarantees in terms of the operations supported by the ledger
object: (1) atomic consistency (linearizability), (2) sequential consistency,
and (3) eventual consistency. We then provide implementations of distributed
ledgers on asynchronous message passing crash-prone systems using an Atomic
Broadcast service, and show that they provide eventual, sequential or atomic
consistency semantics. We conclude with a variation of the ledger - the
validated ledger - which requires that each record in the ledger satisfies a
particular validation rule.
| cs.DC | despite the hype about blockchains and distributed ledgers no formal abstraction of these objects has been proposed to face this issue in this paper we provide a proper formulation of a distributed ledger object in brief we define a ledger object as a sequence of records and we provide the operations and the properties that such an object should support implementation of a ledger object on top of multiple possibly geographically dispersed computing devices gives rise to the distributed ledger object in contrast to the centralized object distribution allows operations to be applied concurrently on the ledger introducing challenges on the consistency of the ledger in each participant we provide the definitions of three well known consistency guarantees in terms of the operations supported by the ledger object 1 atomic consistency linearizability 2 sequential consistency and 3 eventual consistency we then provide implementations of distributed ledgers on asynchronous message passing crashprone systems using an atomic broadcast service and show that they provide eventual sequential or atomic consistency semantics we conclude with a variation of the ledger the validated ledger which requires that each record in the ledger satisfies a particular validation rule | [['despite', 'the', 'hype', 'about', 'blockchains', 'and', 'distributed', 'ledgers', 'no', 'formal', 'abstraction', 'of', 'these', 'objects', 'has', 'been', 'proposed', 'to', 'face', 'this', 'issue', 'in', 'this', 'paper', 'we', 'provide', 'a', 'proper', 'formulation', 'of', 'a', 'distributed', 'ledger', 'object', 'in', 'brief', 'we', 'define', 'a', 'ledger', 'object', 'as', 'a', 'sequence', 'of', 'records', 'and', 'we', 'provide', 'the', 'operations', 'and', 'the', 'properties', 'that', 'such', 'an', 'object', 'should', 'support', 'implementation', 'of', 'a', 'ledger', 'object', 'on', 'top', 'of', 'multiple', 'possibly', 'geographically', 'dispersed', 'computing', 'devices', 'gives', 'rise', 'to', 'the', 'distributed', 'ledger', 'object', 'in', 'contrast', 'to', 'the', 'centralized', 'object', 'distribution', 'allows', 'operations', 'to', 'be', 'applied', 'concurrently', 'on', 'the', 'ledger', 'introducing', 'challenges', 'on', 'the', 'consistency', 'of', 'the', 'ledger', 'in', 'each', 'participant', 'we', 'provide', 'the', 'definitions', 'of', 'three', 'well', 'known', 'consistency', 'guarantees', 'in', 'terms', 'of', 'the', 'operations', 'supported', 'by', 'the', 'ledger', 'object', '1', 'atomic', 'consistency', 'linearizability', '2', 'sequential', 'consistency', 'and', '3', 'eventual', 'consistency', 'we', 'then', 'provide', 'implementations', 'of', 'distributed', 'ledgers', 'on', 'asynchronous', 'message', 'passing', 'crashprone', 'systems', 'using', 'an', 'atomic', 'broadcast', 'service', 'and', 'show', 'that', 'they', 'provide', 'eventual', 'sequential', 'or', 'atomic', 'consistency', 'semantics', 'we', 'conclude', 'with', 'a', 'variation', 'of', 'the', 'ledger', 'the', 'validated', 'ledger', 'which', 'requires', 'that', 'each', 'record', 'in', 'the', 'ledger', 'satisfies', 'a', 'particular', 'validation', 'rule']] | [-0.21750175792355245, 0.0077820824470412235, -0.09356141434636811, 0.034147447506863195, -0.07252436827063018, -0.1570118660965818, 0.10692762442704407, 0.4032302092273312, -0.2772667548609509, -0.318446904939871, 0.13799397784168832, -0.23462173507027728, -0.07656247424104852, 0.12966416258071453, -0.15520876939505493, 0.07084450240229974, 0.079626427514692, 0.03441513193517191, -0.007368887938961659, -0.2995724527524241, 0.28323878555481014, 0.03161778209929859, 0.28487292434147093, 0.02192815863963915, 0.14030614073878192, 0.038146266192901145, -0.045848518331088904, -0.005271125968041209, -0.04668849513226784, 0.17204083304477535, 0.2602816497759098, 0.2352338930783541, 0.2846160870831227, -0.47302263088446733, -0.09727646638445246, 0.06041873100002704, 0.14181839169941668, 0.0771206374332299, -0.07904750369683218, -0.30987674017524114, 0.13552439711687234, -0.25505619132733653, -0.07141357096520551, -0.08435542459968322, -0.007482487222053654, 0.04635550948781505, -0.2591101196206485, -0.002271504929619065, 0.09874249316029211, 0.08940937618050764, -0.05461057425304716, -0.04069340647644518, 0.02303768856957807, 0.1500823199403385, 0.005566695905145025, -0.010312667061953107, 0.1525513473073564, -0.09472656749373225, -0.1697045041267605, 0.3838963595432385, 0.0042100923067967715, -0.16560126526261834, 0.209101783934481, -0.019718248720285676, -0.21283634430847087, 0.04326040687495455, 0.13404905112414175, 0.08989740585457184, -0.184767217215267, 0.06585632853330026, -0.05159807294148777, 0.19055399106582627, 0.06232024135715619, 0.09952139841637593, 0.22807119287002328, 0.18997408127446155, 0.11518508689672065, 0.13267478148372902, -0.04477246469953874, -0.12373962291894713, -0.2856981813083621, -0.19201345013395135, -0.14346987029663674, -0.01544594370170671, -0.09574873584362346, -0.19533911088850195, 0.36499828193336725, 0.21330454037039695, 0.1798093887870588, 0.06915309321023717, 0.3697350689750844, 0.0345443398715967, 0.08102895048432401, 0.12325828651834551, 0.16253430897389384, 0.059211238121254915, 0.14464605006893785, -0.10520182951586321, 0.15862165966488342, 0.02665901669388404] |
1,802.07818 | Deep Chandra Observations of ESO 428-G014: II. Spectral Properties and
Morphology of the Large-Scale Extended X-ray Emission | We present a deep Chandra spectral and spatial study of the kpc-scale diffuse
X-ray emission of the Compton thick (CT) AGN ESO428-G014. The entire spectrum
is best fit with composite photoionization + thermal models. The diffuse
emission is more extended at the lower energies (<3 keV). The smaller extent of
the hard continuum and Fe K{\alpha} profiles imply that the optically thicker
clouds responsible for this scattering may be relatively more prevalent closer
to the nucleus. These clouds must not prevent soft ionizing X-rays from the AGN
escaping to larger radii, in order to have photoionized ISM at larger radii.
This suggests that at smaller radii there may be a larger population of
molecular clouds to scatter the hard X-rays, as in the Milky Way. The diffuse
emission is also significantly extended in the cross-cone direction, where the
AGN emission would be mostly obscured by the torus in the standard AGN model.
Our results suggest that the transmission of the obscuring region in the
cross-cone direction is ~10% than in the cone-direction. In the 0.3-1.5 keV
band, the ratio of cross-cone to cone photons increases to ~84\%, suggesting an
additional soft diffuse emission component, disjoint from the AGN. This could
be due to hot ISM trapped in the potential of the galaxy. The luminosity of
this component ~5 10^38 erg s^-1 is roughly consistent with the thermal
component suggested by the spectral fits in the 170-900 pc annulus.
| astro-ph.HE | we present a deep chandra spectral and spatial study of the kpcscale diffuse xray emission of the compton thick ct agn eso428g014 the entire spectrum is best fit with composite photoionization thermal models the diffuse emission is more extended at the lower energies 3 kev the smaller extent of the hard continuum and fe kalpha profiles imply that the optically thicker clouds responsible for this scattering may be relatively more prevalent closer to the nucleus these clouds must not prevent soft ionizing xrays from the agn escaping to larger radii in order to have photoionized ism at larger radii this suggests that at smaller radii there may be a larger population of molecular clouds to scatter the hard xrays as in the milky way the diffuse emission is also significantly extended in the crosscone direction where the agn emission would be mostly obscured by the torus in the standard agn model our results suggest that the transmission of the obscuring region in the crosscone direction is 10 than in the conedirection in the 0315 kev band the ratio of crosscone to cone photons increases to 84 suggesting an additional soft diffuse emission component disjoint from the agn this could be due to hot ism trapped in the potential of the galaxy the luminosity of this component 5 1038 erg s1 is roughly consistent with the thermal component suggested by the spectral fits in the 170900 pc annulus | [['we', 'present', 'a', 'deep', 'chandra', 'spectral', 'and', 'spatial', 'study', 'of', 'the', 'kpcscale', 'diffuse', 'xray', 'emission', 'of', 'the', 'compton', 'thick', 'ct', 'agn', 'eso428g014', 'the', 'entire', 'spectrum', 'is', 'best', 'fit', 'with', 'composite', 'photoionization', 'thermal', 'models', 'the', 'diffuse', 'emission', 'is', 'more', 'extended', 'at', 'the', 'lower', 'energies', '3', 'kev', 'the', 'smaller', 'extent', 'of', 'the', 'hard', 'continuum', 'and', 'fe', 'kalpha', 'profiles', 'imply', 'that', 'the', 'optically', 'thicker', 'clouds', 'responsible', 'for', 'this', 'scattering', 'may', 'be', 'relatively', 'more', 'prevalent', 'closer', 'to', 'the', 'nucleus', 'these', 'clouds', 'must', 'not', 'prevent', 'soft', 'ionizing', 'xrays', 'from', 'the', 'agn', 'escaping', 'to', 'larger', 'radii', 'in', 'order', 'to', 'have', 'photoionized', 'ism', 'at', 'larger', 'radii', 'this', 'suggests', 'that', 'at', 'smaller', 'radii', 'there', 'may', 'be', 'a', 'larger', 'population', 'of', 'molecular', 'clouds', 'to', 'scatter', 'the', 'hard', 'xrays', 'as', 'in', 'the', 'milky', 'way', 'the', 'diffuse', 'emission', 'is', 'also', 'significantly', 'extended', 'in', 'the', 'crosscone', 'direction', 'where', 'the', 'agn', 'emission', 'would', 'be', 'mostly', 'obscured', 'by', 'the', 'torus', 'in', 'the', 'standard', 'agn', 'model', 'our', 'results', 'suggest', 'that', 'the', 'transmission', 'of', 'the', 'obscuring', 'region', 'in', 'the', 'crosscone', 'direction', 'is', '10', 'than', 'in', 'the', 'conedirection', 'in', 'the', '0315', 'kev', 'band', 'the', 'ratio', 'of', 'crosscone', 'to', 'cone', 'photons', 'increases', 'to', '84', 'suggesting', 'an', 'additional', 'soft', 'diffuse', 'emission', 'component', 'disjoint', 'from', 'the', 'agn', 'this', 'could', 'be', 'due', 'to', 'hot', 'ism', 'trapped', 'in', 'the', 'potential', 'of', 'the', 'galaxy', 'the', 'luminosity', 'of', 'this', 'component', '5', '1038', 'erg', 's1', 'is', 'roughly', 'consistent', 'with', 'the', 'thermal', 'component', 'suggested', 'by', 'the', 'spectral', 'fits', 'in', 'the', '170900', 'pc', 'annulus']] | [-0.010971292131085029, 0.1320009515190403, -0.04293371744235938, 0.12616382559731681, -0.061654002041100185, -0.065520215624983, 0.02385419923713074, 0.47557122159670007, -0.19400104973267052, -0.3137134157200443, 0.03185103002767217, -0.3202013726465087, 0.04953870412081163, 0.17242247948987766, -0.00712475988263403, -0.07148424928606627, -0.027239709119114313, -0.11849755408202714, -0.01449356404767233, -0.2012409332287597, 0.2861373121642131, 0.11439177175535464, 0.16502021120345972, 0.06794358574184019, -0.004179910385976249, -0.08559610623967874, -0.022329274096347867, -0.02934915486802446, -0.07302809093649712, 0.10637924470245204, 0.24463148297083456, 0.07438440063591809, 0.1910680839157802, -0.3844625689881913, -0.26067214515728954, 0.08874688273434468, 0.23563336793412554, -0.004162304991103233, 0.0023025572472103336, -0.23171500277487522, 0.050440710270529654, -0.1818001057397812, -0.1957012700947358, 0.10035583997799202, 0.026540508559171824, -0.026621097933619896, -0.1913477498720935, 0.1404168205522744, 0.03361975189565899, 0.03674279198526068, -0.11354440168398333, -0.09468487812344857, -0.04461051889873566, 0.014941450652289898, 0.05835586749165854, 0.0804575491448904, 0.23233241644945551, -0.13529552608787854, -0.02393417181546225, 0.40675364386765883, -0.04097127403173487, 0.005181447231270214, 0.21821428482083882, -0.2205683952480421, -0.14638027626131858, 0.30128599503176645, 0.12673926823277107, 0.100526644313272, -0.12223401605845131, -0.00283269252469565, -0.07493302672209734, 0.280383762160435, 0.009249359194902664, 0.04623148011624506, 0.29963408655467183, 0.08370015053623454, 0.05067677386996752, 0.14970090702830002, -0.2218610065018243, -0.009642964312212265, -0.25274617878640904, -0.07566121156770796, -0.12653229668528396, 0.11007580903483842, -0.15089434322076256, -0.11199525713306317, 0.31853425620678577, 0.12403112844801806, 0.2332745181921711, 0.009247546227762792, 0.34349163656997334, 0.11387988812825148, 0.11858248876685158, 0.16108262988917055, 0.34482821909155936, 0.1379771579988301, 0.07335830101535279, -0.2268705645147612, 0.06352296066272291, -0.018986334330699545] |
1,802.07819 | A Note on Coherent States for Virasoro Orbits | There are two sets of orbits of the Virasoro group which admit a K\"ahler
structure. We consider the construction of coherent states for the orbit
$\widehat{{\rm diff}\,S^1}$/$SL(2, {\mathbb R})$ which furnishes unitary
representations of the group. The procedure is analogous to geometric
quantization using a holomorphic polarization. We also give an explicit formula
for the K\"ahler potential for this orbit and comment on normalization of the
coherent states. We further explore some of the properties of these states,
including the definition of symbols corresponding to operators and their star
products. Some comments which touch upon the possibility of applying this to
gravity in (2+1) dimensions are also given.
| hep-th | there are two sets of orbits of the virasoro group which admit a kahler structure we consider the construction of coherent states for the orbit widehatrm diffs1sl2 mathbb r which furnishes unitary representations of the group the procedure is analogous to geometric quantization using a holomorphic polarization we also give an explicit formula for the kahler potential for this orbit and comment on normalization of the coherent states we further explore some of the properties of these states including the definition of symbols corresponding to operators and their star products some comments which touch upon the possibility of applying this to gravity in 21 dimensions are also given | [['there', 'are', 'two', 'sets', 'of', 'orbits', 'of', 'the', 'virasoro', 'group', 'which', 'admit', 'a', 'kahler', 'structure', 'we', 'consider', 'the', 'construction', 'of', 'coherent', 'states', 'for', 'the', 'orbit', 'widehatrm', 'diffs1sl2', 'mathbb', 'r', 'which', 'furnishes', 'unitary', 'representations', 'of', 'the', 'group', 'the', 'procedure', 'is', 'analogous', 'to', 'geometric', 'quantization', 'using', 'a', 'holomorphic', 'polarization', 'we', 'also', 'give', 'an', 'explicit', 'formula', 'for', 'the', 'kahler', 'potential', 'for', 'this', 'orbit', 'and', 'comment', 'on', 'normalization', 'of', 'the', 'coherent', 'states', 'we', 'further', 'explore', 'some', 'of', 'the', 'properties', 'of', 'these', 'states', 'including', 'the', 'definition', 'of', 'symbols', 'corresponding', 'to', 'operators', 'and', 'their', 'star', 'products', 'some', 'comments', 'which', 'touch', 'upon', 'the', 'possibility', 'of', 'applying', 'this', 'to', 'gravity', 'in', '21', 'dimensions', 'are', 'also', 'given']] | [-0.18180606446324665, 0.1070949001256518, -0.10799861818151636, 0.05076836368447674, -0.08904613300104773, -0.0986836374972329, 0.05036348780338591, 0.3532759860923914, -0.24326989362799675, -0.22781636957166213, 0.11500825647756492, -0.2501213288796352, -0.15626756168867104, 0.1993818053993109, -0.08231268818794846, 0.019276465852875437, 0.04466479924011314, 0.09095589831475795, -0.1351549088014899, -0.2708684311250538, 0.42719213339004003, 0.013870268520490031, 0.1969397324442028, 0.05332246825869291, 0.10398993514060417, 0.014992822788516495, -0.03774828528637223, -0.054472777243947314, -0.13835743936126896, 0.16469385732611572, 0.22082810377414885, 0.10093004314368155, 0.17504653022581032, -0.3984915566343431, -0.16900841896743166, 0.1260643989961838, 0.09721656229453614, 0.11474214763289195, -0.04082846205581467, -0.3120950363471965, 0.07709663406789094, -0.176996776198742, -0.156187169793471, -0.12323350312675689, 0.06146503572360935, -0.018941240178455956, -0.2246828221690963, 0.02865294152033019, 0.10347957513077516, 0.04559759935799325, -0.09222922437589302, -0.10689612720857992, -0.040667331516394546, 0.11536914694001114, 0.03475382223520776, 0.014651731157100925, 0.10174433680721254, -0.099960600002016, -0.12102343866636402, 0.3656009135541515, -0.032442777223937284, -0.2341679470073954, 0.14585340637539593, -0.14242468058418867, -0.1606555415021482, 0.058395969973024084, 0.12899229059291778, 0.13461856316409518, -0.08782601106322205, 0.1410527490416681, -0.06886968349115313, 0.07645646198413326, 0.1119184940966351, 0.07698784716466495, 0.2063746777619888, 0.056848199193792366, 0.08003482051959662, 0.13662455193524328, -0.030852666065949844, -0.06225275024162414, -0.3762056704645402, -0.17093484359385366, -0.0974291436979112, 0.10648713242175563, -0.10448736776614118, -0.18841442941888192, 0.4354928402822012, 0.10633377599416771, 0.2224887167582306, 0.07404109885346005, 0.19200494284001746, 0.1055648565884227, 0.0582577710662246, 0.05304315375059704, 0.19876094161865746, 0.1820782931504127, -0.004785790958955327, -0.19571100076590883, -0.06349367387679831, 0.12650461783458558] |
1,802.0782 | Spectra of Hydrogen-Poor Superluminous Supernovae from the Palomar
Transient Factory | Most Type I superluminous supernovae (SLSNe-I) reported to date have been
identified by their high peak luminosities and spectra lacking obvious signs of
hydrogen. We demonstrate that these events can be distinguished from
normal-luminosity SNe (including Type Ic events) solely from their spectra over
a wide range of light-curve phases. We use this distinction to select 19
SLSNe-I and 4 possible SLSNe-I from the Palomar Transient Factory archive
(including 7 previously published objects). We present 127 new spectra of these
objects and combine these with 39 previously published spectra, and we use
these to discuss the average spectral properties of SLSNe-I at different
spectral phases. We find that Mn II most probably contributes to the
ultraviolet spectral features after maximum light, and we give a detailed study
of the O II features that often characterize the early-time optical spectra of
SLSNe-I. We discuss the velocity distribution of O II, finding that for some
SLSNe-I this can be confined to a narrow range compared to relatively large
systematic velocity shifts. Mg II and Fe II favor higher velocities than O II
and C II, and we briefly discuss how this may constrain power-source models. We
tentatively group objects by how well they match either SN 2011ke or PTF12dam
and discuss the possibility that physically distinct events may have been
previously grouped together under the SLSN-I label.
| astro-ph.HE astro-ph.SR | most type i superluminous supernovae slsnei reported to date have been identified by their high peak luminosities and spectra lacking obvious signs of hydrogen we demonstrate that these events can be distinguished from normalluminosity sne including type ic events solely from their spectra over a wide range of lightcurve phases we use this distinction to select 19 slsnei and 4 possible slsnei from the palomar transient factory archive including 7 previously published objects we present 127 new spectra of these objects and combine these with 39 previously published spectra and we use these to discuss the average spectral properties of slsnei at different spectral phases we find that mn ii most probably contributes to the ultraviolet spectral features after maximum light and we give a detailed study of the o ii features that often characterize the earlytime optical spectra of slsnei we discuss the velocity distribution of o ii finding that for some slsnei this can be confined to a narrow range compared to relatively large systematic velocity shifts mg ii and fe ii favor higher velocities than o ii and c ii and we briefly discuss how this may constrain powersource models we tentatively group objects by how well they match either sn 2011ke or ptf12dam and discuss the possibility that physically distinct events may have been previously grouped together under the slsni label | [['most', 'type', 'i', 'superluminous', 'supernovae', 'slsnei', 'reported', 'to', 'date', 'have', 'been', 'identified', 'by', 'their', 'high', 'peak', 'luminosities', 'and', 'spectra', 'lacking', 'obvious', 'signs', 'of', 'hydrogen', 'we', 'demonstrate', 'that', 'these', 'events', 'can', 'be', 'distinguished', 'from', 'normalluminosity', 'sne', 'including', 'type', 'ic', 'events', 'solely', 'from', 'their', 'spectra', 'over', 'a', 'wide', 'range', 'of', 'lightcurve', 'phases', 'we', 'use', 'this', 'distinction', 'to', 'select', '19', 'slsnei', 'and', '4', 'possible', 'slsnei', 'from', 'the', 'palomar', 'transient', 'factory', 'archive', 'including', '7', 'previously', 'published', 'objects', 'we', 'present', '127', 'new', 'spectra', 'of', 'these', 'objects', 'and', 'combine', 'these', 'with', '39', 'previously', 'published', 'spectra', 'and', 'we', 'use', 'these', 'to', 'discuss', 'the', 'average', 'spectral', 'properties', 'of', 'slsnei', 'at', 'different', 'spectral', 'phases', 'we', 'find', 'that', 'mn', 'ii', 'most', 'probably', 'contributes', 'to', 'the', 'ultraviolet', 'spectral', 'features', 'after', 'maximum', 'light', 'and', 'we', 'give', 'a', 'detailed', 'study', 'of', 'the', 'o', 'ii', 'features', 'that', 'often', 'characterize', 'the', 'earlytime', 'optical', 'spectra', 'of', 'slsnei', 'we', 'discuss', 'the', 'velocity', 'distribution', 'of', 'o', 'ii', 'finding', 'that', 'for', 'some', 'slsnei', 'this', 'can', 'be', 'confined', 'to', 'a', 'narrow', 'range', 'compared', 'to', 'relatively', 'large', 'systematic', 'velocity', 'shifts', 'mg', 'ii', 'and', 'fe', 'ii', 'favor', 'higher', 'velocities', 'than', 'o', 'ii', 'and', 'c', 'ii', 'and', 'we', 'briefly', 'discuss', 'how', 'this', 'may', 'constrain', 'powersource', 'models', 'we', 'tentatively', 'group', 'objects', 'by', 'how', 'well', 'they', 'match', 'either', 'sn', '2011ke', 'or', 'ptf12dam', 'and', 'discuss', 'the', 'possibility', 'that', 'physically', 'distinct', 'events', 'may', 'have', 'been', 'previously', 'grouped', 'together', 'under', 'the', 'slsni', 'label']] | [-0.031333482541093555, 0.09237232412655234, -0.04508105669850232, 0.11862698153997478, -0.11215630445528675, -0.1575917880709476, 0.07568487797146412, 0.474052996175135, -0.20579643282926063, -0.3503016095686083, 0.08072325010754604, -0.3133099310788083, -0.07002045830023719, 0.18719889087652838, -0.053004437989403484, -0.06964430249786961, 0.06868940855267348, -0.06725172484545289, -0.08807799487919044, -0.25046633713908056, 0.30343538455073593, 0.039745597747733466, 0.20870671903102045, -0.034500054464736314, 0.014641951796334438, -0.08176560956682707, -0.09014985975568174, 0.021234017649984307, -0.15895442387510877, 0.07535020096307758, 0.22535477713797453, 0.16308090655733035, 0.1608738585937399, -0.3614266342567364, -0.22649360648256744, 0.12480666098889669, 0.1988427760556701, 0.08846855196715878, -0.0387271639653943, -0.26932102819403364, 0.10033371265983389, -0.1769368530834211, -0.15264740009553027, -0.014463505791584114, 0.06309885175915451, 0.08668741846754979, -0.16794559092634265, 0.09082270998021101, 0.0017607122106972645, 0.09722605063831685, -0.08607375254667876, -0.13956151849882328, -0.0323097594910897, 0.05057065413429964, 0.022240599808765592, -0.04540306761932165, 0.07655228570162377, -0.12033022827046382, -0.09446511579979514, 0.39161447490993384, -0.06510694774880067, 0.03422432123297439, 0.2787332885285372, -0.1625256703009982, -0.16059969052429068, 0.1674215294785697, 0.1425733658703262, 0.11575089570613124, -0.16581761238974338, -0.01623612723805153, 0.013313853201563345, 0.15653331046672286, 0.028015316959034215, 0.12210517103557249, 0.23876751354173967, 0.062456810500825174, -0.04285007932743578, 0.0644188800161738, -0.21390661853575357, 0.044108945093702875, -0.3026315157138113, -0.11483249341993518, -0.09389012372268045, 0.08016279638065277, -0.08075279808703649, -0.10601137097304066, 0.3882686518434737, 0.12469500450308325, 0.2552695720349564, 0.00604092717162325, 0.1935310188706058, 0.0755160019254765, 0.09986328272209796, 0.08943106906870296, 0.3220407852536195, 0.09404858311025745, 0.1295182037556351, -0.20653386624542544, 0.06054386228054493, 0.005935785808859536] |
1,802.07821 | A conditionally integrable Schr\"odinger potential of a bi-confluent
Heun class | We present a bi-confluent Heun potential for the Schr\"odinger equation
involving inverse fractional powers and a repulsive centrifugal-barrier term
the strength of which is fixed to a constant. This is an infinite potential
well defined on the positive half-axis. Each of the fundamental solutions for
this conditionally integrable potential is written as an irreducible linear
combination of two Hermite functions of a shifted and scaled argument. We
present the general solution of the problem, derive the exact energy spectrum
equation and construct a highly accurate approximation for the bound-state
energy levels.
| quant-ph | we present a biconfluent heun potential for the schrodinger equation involving inverse fractional powers and a repulsive centrifugalbarrier term the strength of which is fixed to a constant this is an infinite potential well defined on the positive halfaxis each of the fundamental solutions for this conditionally integrable potential is written as an irreducible linear combination of two hermite functions of a shifted and scaled argument we present the general solution of the problem derive the exact energy spectrum equation and construct a highly accurate approximation for the boundstate energy levels | [['we', 'present', 'a', 'biconfluent', 'heun', 'potential', 'for', 'the', 'schrodinger', 'equation', 'involving', 'inverse', 'fractional', 'powers', 'and', 'a', 'repulsive', 'centrifugalbarrier', 'term', 'the', 'strength', 'of', 'which', 'is', 'fixed', 'to', 'a', 'constant', 'this', 'is', 'an', 'infinite', 'potential', 'well', 'defined', 'on', 'the', 'positive', 'halfaxis', 'each', 'of', 'the', 'fundamental', 'solutions', 'for', 'this', 'conditionally', 'integrable', 'potential', 'is', 'written', 'as', 'an', 'irreducible', 'linear', 'combination', 'of', 'two', 'hermite', 'functions', 'of', 'a', 'shifted', 'and', 'scaled', 'argument', 'we', 'present', 'the', 'general', 'solution', 'of', 'the', 'problem', 'derive', 'the', 'exact', 'energy', 'spectrum', 'equation', 'and', 'construct', 'a', 'highly', 'accurate', 'approximation', 'for', 'the', 'boundstate', 'energy', 'levels']] | [-0.15553821226543127, 0.04741605154219239, -0.07019075791661938, 0.09720310567386656, -0.08832607116394987, -0.14797865704426336, 0.0027344620993567837, 0.2942708421498537, -0.29899369314468155, -0.2186837724306517, 0.10042138127610087, -0.2896750962982575, -0.13459249211268293, 0.17162812466267496, 0.03542899427314599, 0.07389110835889975, 0.03372165956017044, 0.05910596461035311, -0.09150720296634568, -0.1896797445602715, 0.3661995497532189, 0.02466057519842353, 0.19095091132654085, 0.08637543274607096, 0.1760849988915854, 0.005926417574907343, 0.006053072271040744, -0.03876443836424086, -0.13458461554255335, 0.1302260346283826, 0.2348835474656274, 0.0403718137440996, 0.3111290873338779, -0.36596694911519684, -0.18406993659834067, 0.14041403410956263, 0.16097131295957498, 0.10266224451544177, -0.05913350199892496, -0.254133501700643, 5.1246254911853206e-05, -0.17218357065382103, -0.2305985359268056, -0.06906245067301724, 0.05940546859055758, 0.08589767058276468, -0.3162788666991724, 0.12109927413726432, 0.043818564786730956, -0.012445338680926296, -0.1447919931055771, -0.14687821032453535, 0.03389672119843049, 0.06524986673870849, 0.011866195717205603, 0.026658872064823907, 0.02632101037953463, -0.1291962248635375, -0.07115938522749476, 0.38383636633969015, -0.10118869547214773, -0.306476443571349, 0.10556130558252334, -0.08666886209717227, -0.09157564273983654, 0.10031511244984964, 0.1472545261391335, 0.16068548921288717, -0.15337585320489275, 0.14848381845707384, -0.018510107944409052, 0.15399250123235914, 0.08326962572625941, -0.004502775532374572, 0.15813588398612208, 0.09065103480178449, 0.08645117570542626, 0.15861623086449173, 0.012133318167697225, -0.10316739592235535, -0.35762830608420904, -0.14960183642478014, -0.2037232739229997, 0.1045353179383609, -0.11782706820667954, -0.2509377770488047, 0.4428858884299795, 0.05033960062234352, 0.16251043123710487, 0.10735070278169587, 0.25642907744946164, 0.3119482421820673, -0.00021383902316706048, 0.036835530974591774, 0.17713885207970936, 0.1439581706059269, 0.08414296958492035, -0.23005091745095949, -0.03503572770601345, 0.14373023945631253] |
1,802.07822 | Co-evolution of galaxies and Active Galactic Nuclei | Supermassive black holes (SMBHs) have been found to be ubiquitous in the
nuclei of early-type galaxies and of bulges of spirals. There are evidences of
a tight correlation between the SMBH masses, the velocity dispersions of stars
in the spheroidal components galaxies and other galaxy properties. Also the
evolution of the luminosity density due to nuclear activity is similar to that
due to star formation. All that suggests an evolutionary connection between
Active Galactic Nuclei (AGNs) and their host galaxies. After a review of these
evidences this lecture discusses how AGNs can affect the host galaxies. Other
feedback processes advocated to account for the differences between the halo
and the stellar mass functions are also briefly introduced.
| astro-ph.GA astro-ph.CO | supermassive black holes smbhs have been found to be ubiquitous in the nuclei of earlytype galaxies and of bulges of spirals there are evidences of a tight correlation between the smbh masses the velocity dispersions of stars in the spheroidal components galaxies and other galaxy properties also the evolution of the luminosity density due to nuclear activity is similar to that due to star formation all that suggests an evolutionary connection between active galactic nuclei agns and their host galaxies after a review of these evidences this lecture discusses how agns can affect the host galaxies other feedback processes advocated to account for the differences between the halo and the stellar mass functions are also briefly introduced | [['supermassive', 'black', 'holes', 'smbhs', 'have', 'been', 'found', 'to', 'be', 'ubiquitous', 'in', 'the', 'nuclei', 'of', 'earlytype', 'galaxies', 'and', 'of', 'bulges', 'of', 'spirals', 'there', 'are', 'evidences', 'of', 'a', 'tight', 'correlation', 'between', 'the', 'smbh', 'masses', 'the', 'velocity', 'dispersions', 'of', 'stars', 'in', 'the', 'spheroidal', 'components', 'galaxies', 'and', 'other', 'galaxy', 'properties', 'also', 'the', 'evolution', 'of', 'the', 'luminosity', 'density', 'due', 'to', 'nuclear', 'activity', 'is', 'similar', 'to', 'that', 'due', 'to', 'star', 'formation', 'all', 'that', 'suggests', 'an', 'evolutionary', 'connection', 'between', 'active', 'galactic', 'nuclei', 'agns', 'and', 'their', 'host', 'galaxies', 'after', 'a', 'review', 'of', 'these', 'evidences', 'this', 'lecture', 'discusses', 'how', 'agns', 'can', 'affect', 'the', 'host', 'galaxies', 'other', 'feedback', 'processes', 'advocated', 'to', 'account', 'for', 'the', 'differences', 'between', 'the', 'halo', 'and', 'the', 'stellar', 'mass', 'functions', 'are', 'also', 'briefly', 'introduced']] | [-0.053384488225620016, 0.12377767603852861, -0.08590141511880435, 0.1947853944829514, -0.09981512813629885, -0.010452089791432915, 0.014544958423854958, 0.4405984770124539, -0.10314219221313539, -0.3446628022620566, 0.0005929728504270315, -0.30739543658609575, -0.08515513478977303, 0.18773543300966805, -0.017837054336952984, -0.049259155103140786, -0.020616016012385614, -0.11654111589543903, -0.08609978313374723, -0.3074653295443879, 0.3595153415718904, 0.0760179529659068, 0.1470969328417992, -0.03160734461126929, 0.055765099902080104, -0.11125567182898521, -0.0795152961777953, -0.03350670093523227, -0.16701869633703983, 0.03389816205057069, 0.2900419666025883, 0.14745717505430883, 0.24825340612098956, -0.4070448816682284, -0.1774076142977191, 0.10512062571306005, 0.24098250413568229, 0.05780296834806601, -0.18364926009701613, -0.2473973904091578, 0.05844043598024764, -0.20280127741623288, -0.1555034752883431, 0.05268974924603334, 0.0985633888004276, 0.09617961856753789, -0.15054350486522716, 0.1833277462118974, 0.07940184653728691, 0.035735765376534216, -0.12267359915989427, -0.07527437764737341, -0.09713197387177816, 0.1110980787441835, 0.11532742409712166, 0.04339892367044321, 0.25755839083447224, -0.14445283161038452, -0.05655032083835915, 0.4215032063567868, 0.048155667817490734, -0.010066366380351221, 0.27040092155146295, -0.22048219146095535, -0.18466844452588826, 0.04567624250044807, 0.21913503502837867, 0.0856110938410792, -0.17055760991847158, -0.0034511024709472544, 0.0009553861062034455, 0.2085368881941351, -0.012395479183039095, 0.10590186337634432, 0.39738876899927217, 0.0710671102691792, 0.012054690119497474, 0.04350560853401056, -0.1275855576675226, -0.05238131034729254, -0.19328604790214926, -0.10571466990483877, -0.10816536373836903, 0.06451481852768005, -0.14133476955034077, -0.08423604325462992, 0.34556784689760744, 0.055362743848902926, 0.2648109083469862, 0.0530704733175345, 0.26129234869110335, 0.05633659239731029, 0.13241450555232537, 0.12768333214016742, 0.38226811417466044, 0.24926716972015098, 0.0375446014595815, -0.29525180303881693, 0.07388562253381833, 0.019172820813842435] |
1,802.07823 | A new extension of Hurwitz-Lerch Zeta function | The main objective of this paper is to introduce a new extension of
Hurwitz-Lerch Zeta function in terms of extended beta function. We then
investigate its important properties such as integral representations,
differential formulas, Mellin transform and certain generating relations. Also,
some important special cases of the main results are pointed out.
| math.CA | the main objective of this paper is to introduce a new extension of hurwitzlerch zeta function in terms of extended beta function we then investigate its important properties such as integral representations differential formulas mellin transform and certain generating relations also some important special cases of the main results are pointed out | [['the', 'main', 'objective', 'of', 'this', 'paper', 'is', 'to', 'introduce', 'a', 'new', 'extension', 'of', 'hurwitzlerch', 'zeta', 'function', 'in', 'terms', 'of', 'extended', 'beta', 'function', 'we', 'then', 'investigate', 'its', 'important', 'properties', 'such', 'as', 'integral', 'representations', 'differential', 'formulas', 'mellin', 'transform', 'and', 'certain', 'generating', 'relations', 'also', 'some', 'important', 'special', 'cases', 'of', 'the', 'main', 'results', 'are', 'pointed', 'out']] | [-0.12176766954004191, 0.021777593736680083, -0.11855174493617736, 0.18094877902275094, -0.11013809530637585, -0.07240114002846755, -0.002104222181235225, 0.33577069267630577, -0.3124750753094514, -0.22653829575014803, 0.12098384494311176, -0.2235577882025749, -0.2845369686300938, 0.23236958023447257, -0.06500484412306552, 0.07904221947515347, 0.007087002830723157, 0.04590196579766388, -0.11713941859153028, -0.23988575271169582, 0.39784967836637336, 0.017853045567440298, 0.1786138615078436, 0.05338221532292664, 0.1095900324491175, 0.05599965087066476, -0.09750446353931554, -0.03897849232372699, -0.17571019872915572, 0.12571002319096947, 0.267527266477163, 0.11227242131896603, 0.27808897028444335, -0.33675635428741, -0.14188607246614993, 0.1295720121751611, 0.16617823253349903, -0.026582986317897357, -0.025381017870341357, -0.23126702171822006, 0.07022195270893952, -0.16506712505808815, -0.1667140701902099, -0.12178552608328083, 0.0337919108927823, 0.11261988176892583, -0.25310766075451213, 0.019304291420737103, 0.08259562252519223, 0.03465878338409731, -0.08281316876169652, -0.19115872450996763, 0.0457803128967778, 0.12097584567247675, 0.09933667421752873, 0.03819371256619119, 0.06446871422052097, -0.14633925722535843, -0.0686300700225939, 0.3574827598909346, -0.04243380321153941, -0.22330647764297631, 0.12850174156035513, -0.15745012920636398, -0.22701152049613973, 0.044161944455341794, 0.12926954874553934, 0.18294350645289972, -0.16427461969522902, 0.10679168524466849, -0.09101190777996984, 0.07243549225341457, 0.09886742068920285, 0.06671377912593576, 0.16332748281554535, 0.08846628458167498, 0.012937432716940887, 0.2700639070557932, -0.031926234933332756, -0.06309412254128031, -0.416260266246704, -0.24938723138452937, -0.11430440647438025, 0.04615053167351736, -0.0899919070784213, -0.16982472204388335, 0.42235325190883416, 0.1571690830258796, 0.18275963297436157, 0.07438473247636396, 0.26484258968132335, 0.22487502240423615, 0.08293484945674069, -0.034364285243030354, 0.10805332643940346, 0.19935830387895784, 0.03766300277605366, -0.14626650700273996, 0.03313812864227937, 0.1435406425376781] |
1,802.07824 | Exploring conservative islands using correlated and uncorrelated noise | In this work, noise is used to analyze the penetration of regular islands in
conservative dynamical systems. For this purpose we use the standard map
choosing nonlinearity parameters for which a mixed phase space is present. The
random variable which simulates noise assumes three distributions, namely
equally distributed, normal or Gaussian, and power-law (obtained from the same
standard map but for other parameters). To investigate the penetration process
and explore distinct dynamical behaviors which may occur, we use recurrence
time statistics (RTS), Lyapunov exponents (LEs) and the occupation rate of the
phase space. Our main findings are as follows: (i) the standard deviations of
the distributions are the most relevant quantity to induce the penetration;
(ii) the penetration of islands induce power-law decays in the RTS as a
consequence of enhanced trapping; (iii) for the power-law correlated noise an
algebraic decay of the RTS is observed, even though sticky motion is absent;
and (iv) although strong noise intensities induce an ergodic-like behavior with
exponential decays of RTS, the largest Lyapunov exponent is reminiscent of the
regular islands.
| nlin.CD | in this work noise is used to analyze the penetration of regular islands in conservative dynamical systems for this purpose we use the standard map choosing nonlinearity parameters for which a mixed phase space is present the random variable which simulates noise assumes three distributions namely equally distributed normal or gaussian and powerlaw obtained from the same standard map but for other parameters to investigate the penetration process and explore distinct dynamical behaviors which may occur we use recurrence time statistics rts lyapunov exponents les and the occupation rate of the phase space our main findings are as follows i the standard deviations of the distributions are the most relevant quantity to induce the penetration ii the penetration of islands induce powerlaw decays in the rts as a consequence of enhanced trapping iii for the powerlaw correlated noise an algebraic decay of the rts is observed even though sticky motion is absent and iv although strong noise intensities induce an ergodiclike behavior with exponential decays of rts the largest lyapunov exponent is reminiscent of the regular islands | [['in', 'this', 'work', 'noise', 'is', 'used', 'to', 'analyze', 'the', 'penetration', 'of', 'regular', 'islands', 'in', 'conservative', 'dynamical', 'systems', 'for', 'this', 'purpose', 'we', 'use', 'the', 'standard', 'map', 'choosing', 'nonlinearity', 'parameters', 'for', 'which', 'a', 'mixed', 'phase', 'space', 'is', 'present', 'the', 'random', 'variable', 'which', 'simulates', 'noise', 'assumes', 'three', 'distributions', 'namely', 'equally', 'distributed', 'normal', 'or', 'gaussian', 'and', 'powerlaw', 'obtained', 'from', 'the', 'same', 'standard', 'map', 'but', 'for', 'other', 'parameters', 'to', 'investigate', 'the', 'penetration', 'process', 'and', 'explore', 'distinct', 'dynamical', 'behaviors', 'which', 'may', 'occur', 'we', 'use', 'recurrence', 'time', 'statistics', 'rts', 'lyapunov', 'exponents', 'les', 'and', 'the', 'occupation', 'rate', 'of', 'the', 'phase', 'space', 'our', 'main', 'findings', 'are', 'as', 'follows', 'i', 'the', 'standard', 'deviations', 'of', 'the', 'distributions', 'are', 'the', 'most', 'relevant', 'quantity', 'to', 'induce', 'the', 'penetration', 'ii', 'the', 'penetration', 'of', 'islands', 'induce', 'powerlaw', 'decays', 'in', 'the', 'rts', 'as', 'a', 'consequence', 'of', 'enhanced', 'trapping', 'iii', 'for', 'the', 'powerlaw', 'correlated', 'noise', 'an', 'algebraic', 'decay', 'of', 'the', 'rts', 'is', 'observed', 'even', 'though', 'sticky', 'motion', 'is', 'absent', 'and', 'iv', 'although', 'strong', 'noise', 'intensities', 'induce', 'an', 'ergodiclike', 'behavior', 'with', 'exponential', 'decays', 'of', 'rts', 'the', 'largest', 'lyapunov', 'exponent', 'is', 'reminiscent', 'of', 'the', 'regular', 'islands']] | [-0.1291660241622183, 0.17050301195349213, -0.09699930105947674, 0.13562434454589148, -0.010906392779782687, -0.16804096672557672, 0.016517219674315745, 0.3017684313117416, -0.2990737159106365, -0.2515212160372044, 0.07913153942366588, -0.2892043367343939, -0.13418465462384357, 0.19631132036894772, -0.04093161721235025, 0.03351045557796642, -0.008633073100999082, 0.0035921038959785706, -0.01912560256718958, -0.2069339151296891, 0.324482079217142, 0.04443240665572848, 0.2985258682020598, -0.03683581036162999, 0.04438625143362093, 0.0003301739629547475, -0.03421725901396219, 0.028815759577733163, -0.13560949122575297, 0.03675798366456635, 0.17327154589564367, 0.06899637105811576, 0.22335859735385846, -0.3879833026818068, -0.2067632724473116, 0.14084030640453604, 0.16325553249315186, 0.08352645719226576, -0.01608340118059331, -0.27215841739033325, 0.06115430599804652, -0.11937413583075533, -0.13286476633327324, -0.05439136578769839, 0.03960026755316004, 0.06372928904602304, -0.33186312923260497, 0.1146167998167944, 0.07817222956287817, 0.063813862467111, -0.03894765743996296, -0.09422651657605764, -0.006767887710251629, 0.12640097032111705, 0.06127103044908615, -0.01275672254515654, 0.15454832110919012, -0.10507136603848914, -0.095404359133188, 0.34406497936148595, -0.0921596304242536, -0.15049921676495487, 0.1920215027817225, -0.17233469832220277, -0.11704869867213029, 0.15535154729676406, 0.1623136767812368, 0.059112919802319704, -0.1350715395568286, 0.07172093176714403, 0.0341122099777189, 0.18635948276736558, 0.040810846197445176, 0.06379222419536489, 0.16882890941164755, 0.16675232532026382, 0.04491202990487639, 0.13679761721622358, -0.1242305613820057, -0.1534947772341975, -0.2904208853951324, -0.1325075177496857, -0.1698090034184483, 0.04290642983934218, -0.09907522819387743, -0.22044311502243336, 0.3871064113678626, 0.13202367069023413, 0.21386060112098096, 0.08327938201784625, 0.24740302712146173, 0.17337029212546445, 0.02459800514618808, 0.058297583869634406, 0.22341403212019448, 0.08171342616101022, 0.10963219978799255, -0.207918061139483, 0.11335738473650762, 0.009850272681237867] |
1,802.07825 | Gauge Invariant Noether's Theorem in Yang-Mills Theory | The gauge invariant definition of the spin dependent gluon distribution
function from first principle is necessary to study the proton spin crisis at
high energy colliders. In this paper we derive the gauge invariant Noether's
theorem in Yang-Mills theory by using combined Lorentz transformation plus
local non-abelian gauge transformation. We find that the definition of the
gauge invariant spin (or orbital) angular momentum of the Yang-Mills field does
not exist in Yang-Mills theory although the definition of the gauge invariant
spin (or orbital) angular momentum of the quark exists. We show that the gauge
invariant definition of the spin angular momentum of the Yang-Mills field in
the literature is not correct because of the non-vanishing boundary surface
term in Yang-Mills theory. We also find that the Belinfante-Rosenfeld tensor in
Yang-Mills theory is not required to obtain the symmetric and gauge invariant
energy-momentum tensor of the quark and the Yang-Mills field.
| hep-ph nucl-th | the gauge invariant definition of the spin dependent gluon distribution function from first principle is necessary to study the proton spin crisis at high energy colliders in this paper we derive the gauge invariant noethers theorem in yangmills theory by using combined lorentz transformation plus local nonabelian gauge transformation we find that the definition of the gauge invariant spin or orbital angular momentum of the yangmills field does not exist in yangmills theory although the definition of the gauge invariant spin or orbital angular momentum of the quark exists we show that the gauge invariant definition of the spin angular momentum of the yangmills field in the literature is not correct because of the nonvanishing boundary surface term in yangmills theory we also find that the belinfanterosenfeld tensor in yangmills theory is not required to obtain the symmetric and gauge invariant energymomentum tensor of the quark and the yangmills field | [['the', 'gauge', 'invariant', 'definition', 'of', 'the', 'spin', 'dependent', 'gluon', 'distribution', 'function', 'from', 'first', 'principle', 'is', 'necessary', 'to', 'study', 'the', 'proton', 'spin', 'crisis', 'at', 'high', 'energy', 'colliders', 'in', 'this', 'paper', 'we', 'derive', 'the', 'gauge', 'invariant', 'noethers', 'theorem', 'in', 'yangmills', 'theory', 'by', 'using', 'combined', 'lorentz', 'transformation', 'plus', 'local', 'nonabelian', 'gauge', 'transformation', 'we', 'find', 'that', 'the', 'definition', 'of', 'the', 'gauge', 'invariant', 'spin', 'or', 'orbital', 'angular', 'momentum', 'of', 'the', 'yangmills', 'field', 'does', 'not', 'exist', 'in', 'yangmills', 'theory', 'although', 'the', 'definition', 'of', 'the', 'gauge', 'invariant', 'spin', 'or', 'orbital', 'angular', 'momentum', 'of', 'the', 'quark', 'exists', 'we', 'show', 'that', 'the', 'gauge', 'invariant', 'definition', 'of', 'the', 'spin', 'angular', 'momentum', 'of', 'the', 'yangmills', 'field', 'in', 'the', 'literature', 'is', 'not', 'correct', 'because', 'of', 'the', 'nonvanishing', 'boundary', 'surface', 'term', 'in', 'yangmills', 'theory', 'we', 'also', 'find', 'that', 'the', 'belinfanterosenfeld', 'tensor', 'in', 'yangmills', 'theory', 'is', 'not', 'required', 'to', 'obtain', 'the', 'symmetric', 'and', 'gauge', 'invariant', 'energymomentum', 'tensor', 'of', 'the', 'quark', 'and', 'the', 'yangmills', 'field']] | [-0.15954233278209964, 0.2641720402116577, -0.15442685849033297, 0.10759598554577679, -0.10612369203319152, -0.07375595972679246, -0.042518503877023855, 0.3194309143473705, -0.18688477044769874, -0.2665892325527966, 0.00860127669526264, -0.20566232797379294, -0.1355259787943214, 0.04694776600692421, -0.019788193684071302, 0.05663791852071881, 0.0018929930838445823, 0.06533391129225492, -0.1794203171421153, -0.2173654607993861, 0.36807120172306895, -0.004886780033508936, 0.27984504447008174, 0.12672219998203219, 0.18390542754282554, 0.07951260311994701, -0.06524140496427815, -0.0173125494706134, -0.11987343649375058, 0.06051795798974732, 0.2026576583312514, 0.030873676650226115, 0.11746895779545108, -0.39631230471034845, -0.15995218873334427, 0.08935593711212278, 0.09925522981832424, 0.15479007756803184, 0.008171956202325721, -0.2424518821419527, 0.060463680864001314, -0.2163473675896724, -0.17861282482665652, -0.12904323651765784, 0.0028547334290730457, -0.09967095807970812, -0.256974006385232, 0.13208103022067613, 0.06737585305546721, 0.06779907141191265, -0.07045853381666044, -0.08954199923202395, -0.1373512619206061, 0.008973225053632633, 0.16890781224550058, 0.14164245898369698, 0.1515122298283192, -0.21207246975818028, -0.12149558443576097, 0.3876654630651077, -0.1017266957461834, -0.267969641960226, 0.10843953538065156, -0.2040756998443976, -0.18052070272155107, 0.08523003564216197, 0.12326857855621104, 0.14392877822120984, -0.1454310616416236, 0.2047160379611887, -0.08173149897328888, 0.12843638761201873, 0.09776265076672037, 0.07927532852627336, 0.24491339962308606, 0.021671284140708545, 0.10664097647493084, 0.08749974182806909, -0.03135640107250462, -0.1445804068321983, -0.4165869280323386, -0.16947529163211583, -0.19586260683213672, 0.13964148965538092, -0.09458573957420109, -0.15233715352912744, 0.3752397064430018, 0.1449036681915944, 0.10900316862932717, 0.04190857820756112, 0.2387881233007647, 0.15900735275819897, 0.0997348047948132, 0.07043395589105785, 0.26353190957258144, 0.25021963196185726, 0.11630247846245766, -0.29980233847900917, -0.11580776123950878, 0.17153578913460174] |
1,802.07826 | $\mathcal{O}(\alpha^2)$ ISR effects with a full electroweak one-loop
correction for a top pair-production at the ILC | Precise predictions for an $e^+e^-\rightarrow t\bar{t}$ cross section are
presented at an energy region from 400 GeV to 800 GeV. Cross sections are
estimated including the beam-polarization effects with full
$\mathcal{O}(\alpha)$, and also with effects of the initial-state photon
emission. A radiator technique is used for the initial-state photon emission up
to two-loop order. A weak correction is defined as the full electroweak
corrections without the initial-state photonic corrections. As a result, it is
obtained that the total cross section of a top quark pair-production receives
the weak corrections of $+4\%$ over the trivial initial state corrections at a
centre of mass energy of 500 GeV. Among the initial state contributions, a
contribution from two-loop diagrams gives less than $0.11\%$ correction over
the one-loop ones at the center of mass energies of from $400$ GeV to $800$
GeV. In addition, an effect of a running coupling constant is also discussed.
| hep-ph | precise predictions for an eerightarrow tbart cross section are presented at an energy region from 400 gev to 800 gev cross sections are estimated including the beampolarization effects with full mathcaloalpha and also with effects of the initialstate photon emission a radiator technique is used for the initialstate photon emission up to twoloop order a weak correction is defined as the full electroweak corrections without the initialstate photonic corrections as a result it is obtained that the total cross section of a top quark pairproduction receives the weak corrections of 4 over the trivial initial state corrections at a centre of mass energy of 500 gev among the initial state contributions a contribution from twoloop diagrams gives less than 011 correction over the oneloop ones at the center of mass energies of from 400 gev to 800 gev in addition an effect of a running coupling constant is also discussed | [['precise', 'predictions', 'for', 'an', 'eerightarrow', 'tbart', 'cross', 'section', 'are', 'presented', 'at', 'an', 'energy', 'region', 'from', '400', 'gev', 'to', '800', 'gev', 'cross', 'sections', 'are', 'estimated', 'including', 'the', 'beampolarization', 'effects', 'with', 'full', 'mathcaloalpha', 'and', 'also', 'with', 'effects', 'of', 'the', 'initialstate', 'photon', 'emission', 'a', 'radiator', 'technique', 'is', 'used', 'for', 'the', 'initialstate', 'photon', 'emission', 'up', 'to', 'twoloop', 'order', 'a', 'weak', 'correction', 'is', 'defined', 'as', 'the', 'full', 'electroweak', 'corrections', 'without', 'the', 'initialstate', 'photonic', 'corrections', 'as', 'a', 'result', 'it', 'is', 'obtained', 'that', 'the', 'total', 'cross', 'section', 'of', 'a', 'top', 'quark', 'pairproduction', 'receives', 'the', 'weak', 'corrections', 'of', '4', 'over', 'the', 'trivial', 'initial', 'state', 'corrections', 'at', 'a', 'centre', 'of', 'mass', 'energy', 'of', '500', 'gev', 'among', 'the', 'initial', 'state', 'contributions', 'a', 'contribution', 'from', 'twoloop', 'diagrams', 'gives', 'less', 'than', '011', 'correction', 'over', 'the', 'oneloop', 'ones', 'at', 'the', 'center', 'of', 'mass', 'energies', 'of', 'from', '400', 'gev', 'to', '800', 'gev', 'in', 'addition', 'an', 'effect', 'of', 'a', 'running', 'coupling', 'constant', 'is', 'also', 'discussed']] | [-0.05450082486870405, 0.20845161772428014, -0.07443450334725664, 0.1601799472747683, -0.018400450568371172, -0.07330950283001633, 0.022116184540893008, 0.34866026291411195, -0.18170289777144288, -0.3248157668108708, -0.010642419679359152, -0.38154929546301797, 0.0800153917145459, 0.22150066961696835, 0.08702739943018115, 0.042765178270762996, 0.08428932333227572, 0.04212638697643208, -0.061830309193093805, -0.20076553318758913, 0.30858846899472026, 0.1162753745432218, 0.18982089944605735, 0.20647999452077, 0.09940690048438991, 0.022094685874954365, -0.02084485698966372, -0.08665216393493766, -0.12013214896769996, 0.03509279347068611, 0.19354591937989601, -0.028113802991832464, 0.15432249173371984, -0.2831388234517118, -0.10876913735449265, 0.08667381405642868, 0.09887694175223877, 0.12791770068466063, -0.031334013735950496, -0.27913581392409015, 0.10222807464083569, -0.263890489435836, -0.14757047750480823, 0.006506203136238076, 0.010917211035829063, -0.11116618356798719, -0.3159814425087815, 0.07255803828476147, -0.06035731828008972, 0.005850604632181809, 0.001481338022839303, -0.17377044896488922, -0.09331048117175499, 0.04859639232003149, 0.07116872613355768, 0.08890247564050276, 0.20221019530006304, -0.1629973499115319, -0.15145918799426733, 0.4220570226218676, -0.08666329015167071, -0.11996177061392158, 0.09051520196133411, -0.1724777572081993, -0.08377497921222758, 0.2706473401103844, 0.19568832556798355, 0.09884694576808001, -0.16925068480281422, 0.11439753951928297, 0.066879690746658, 0.20346047049200774, 0.09649667062565384, 0.05826473672367982, 0.1769680901299287, 0.1439912320277185, 0.025935885377678294, 0.0990846855956561, -0.15080609639181486, -0.06993282007853557, -0.4371981043493588, -0.06598205336263316, -0.06013961037583399, 0.09838944268506646, -0.10902751352465727, -0.10004536688074644, 0.36007592800204585, 0.11052445562918914, 0.2555279102894843, 0.050062534643099614, 0.35927897797984965, 0.14476439601940183, 0.12061870260470416, 0.06561528266901338, 0.3381288504140489, 0.18391916855869678, 0.11686030743899911, -0.18767337467452674, -0.010677964206247422, 0.0310223236604439] |
1,802.07827 | Method to identify parent Hamiltonians for trial states | We describe a general method to identify exact, local parent Hamiltonians for
trial states like quantum Hall or spin liquid states, which we have used
extensively during the past decade. It can be used to identify exact parent
Hamiltonians, either directly or via the construction of simpler annihilation
operators from which a parent Hamiltonian respecting all the required
symmetries can be constructed. Most remarkably, however, the method provides
approximate parent Hamiltonians whenever an exact solution is not available
within the space of presumed interaction terms.
| cond-mat.str-el | we describe a general method to identify exact local parent hamiltonians for trial states like quantum hall or spin liquid states which we have used extensively during the past decade it can be used to identify exact parent hamiltonians either directly or via the construction of simpler annihilation operators from which a parent hamiltonian respecting all the required symmetries can be constructed most remarkably however the method provides approximate parent hamiltonians whenever an exact solution is not available within the space of presumed interaction terms | [['we', 'describe', 'a', 'general', 'method', 'to', 'identify', 'exact', 'local', 'parent', 'hamiltonians', 'for', 'trial', 'states', 'like', 'quantum', 'hall', 'or', 'spin', 'liquid', 'states', 'which', 'we', 'have', 'used', 'extensively', 'during', 'the', 'past', 'decade', 'it', 'can', 'be', 'used', 'to', 'identify', 'exact', 'parent', 'hamiltonians', 'either', 'directly', 'or', 'via', 'the', 'construction', 'of', 'simpler', 'annihilation', 'operators', 'from', 'which', 'a', 'parent', 'hamiltonian', 'respecting', 'all', 'the', 'required', 'symmetries', 'can', 'be', 'constructed', 'most', 'remarkably', 'however', 'the', 'method', 'provides', 'approximate', 'parent', 'hamiltonians', 'whenever', 'an', 'exact', 'solution', 'is', 'not', 'available', 'within', 'the', 'space', 'of', 'presumed', 'interaction', 'terms']] | [-0.07102710772031809, 0.15536630437041715, -0.10521298227283885, 0.09454223915304551, -0.09219052423175206, -0.1536863566869322, 0.009272633336813134, 0.3473524026572704, -0.2694021472666303, -0.3070047657279407, 0.0870733825092697, -0.24478088827146327, -0.1265172010013724, 0.17235566963825155, 0.024952369914664065, 0.06311297598157954, 0.04129659226712058, 0.06991511966814012, -0.16370170736027992, -0.2420286532929715, 0.27299652353805653, 0.013675021373338122, 0.24910219920908702, -0.024133728315834612, 0.05267015888410456, 0.041068994911277995, 0.08193004791109534, -0.006154773209367276, -0.13462778799893224, 0.08378174502594286, 0.2850167976260897, 0.09363468203912763, 0.1878164509201751, -0.47893442627699934, -0.18972161862252773, 0.12721006770563476, 0.17837764435612102, 0.20850899238961146, -0.016032612479894476, -0.32691108628230936, 0.029574544103268315, -0.22321454486535752, -0.17773826921030003, -0.15188502746031565, -0.008657779456938014, -0.049597837318844325, -0.2415805160177543, 0.06572176799835527, 0.005940284733386601, -0.0032427654464674345, -0.0883992125677383, -0.11052671410554253, -0.07602302300579408, 0.11831754552857841, 0.02730549156172749, 0.035504359198624595, 0.1156513943172553, -0.07303639714989592, -0.1392500894746798, 0.39341969528399845, -0.01511468907325145, -0.21022039676249465, 0.2052595857256914, -0.09477982390671968, -0.1212111727663261, 0.14928142060251798, 0.11676173874670091, 0.15167341886690872, -0.21046219072030747, 0.1044329586548402, -0.03834337549393668, 0.12877527659430224, -0.00032859691144788967, 0.08634476686129347, 0.22115589185234377, 0.06362618860952994, 0.06985901381875224, 0.12347167983568985, -0.03186617294216857, -0.14627129625638619, -0.25827201445970466, -0.1467182703963344, -0.2428004809696337, 0.0679133676980307, -0.007025612644193804, -0.16136306922280175, 0.41417165502138875, 0.14558383765466074, 0.15951157878426944, -0.0025832164731314955, 0.22579500463736407, 0.1395150374292451, 0.12864472592139944, 0.10338349459583268, 0.23953007648096364, 0.08044851699241382, -0.00607105912092854, -0.2052511371925528, 0.1160280191065634, 0.10949244990068323] |
1,802.07828 | Quantum Divide-and-Conquer Anchoring for Separable Non-negative Matrix
Factorization | It is NP-complete to find non-negative factors $W$ and $H$ with fixed rank
$r$ from a non-negative matrix $X$ by minimizing $\|X-WH^\top\|_F^2$. Although
the separability assumption (all data points are in the conical hull of the
extreme rows) enables polynomial-time algorithms, the computational cost is not
affordable for big data. This paper investigates how the power of quantum
computation can be capitalized to solve the non-negative matrix factorization
with the separability assumption (SNMF) by devising a quantum algorithm based
on the divide-and-conquer anchoring (DCA) scheme. The design of quantum DCA
(QDCA) is challenging. In the divide step, the random projections in DCA is
completed by a quantum algorithm for linear operations, which achieves the
exponential speedup. We then devise a heuristic post-selection procedure which
extracts the information of anchors stored in the quantum states efficiently.
Under a plausible assumption, QDCA performs efficiently, achieves the quantum
speedup, and is beneficial for high dimensional problems.
| quant-ph | it is npcomplete to find nonnegative factors w and h with fixed rank r from a nonnegative matrix x by minimizing xwhtop_f2 although the separability assumption all data points are in the conical hull of the extreme rows enables polynomialtime algorithms the computational cost is not affordable for big data this paper investigates how the power of quantum computation can be capitalized to solve the nonnegative matrix factorization with the separability assumption snmf by devising a quantum algorithm based on the divideandconquer anchoring dca scheme the design of quantum dca qdca is challenging in the divide step the random projections in dca is completed by a quantum algorithm for linear operations which achieves the exponential speedup we then devise a heuristic postselection procedure which extracts the information of anchors stored in the quantum states efficiently under a plausible assumption qdca performs efficiently achieves the quantum speedup and is beneficial for high dimensional problems | [['it', 'is', 'npcomplete', 'to', 'find', 'nonnegative', 'factors', 'w', 'and', 'h', 'with', 'fixed', 'rank', 'r', 'from', 'a', 'nonnegative', 'matrix', 'x', 'by', 'minimizing', 'xwhtop_f2', 'although', 'the', 'separability', 'assumption', 'all', 'data', 'points', 'are', 'in', 'the', 'conical', 'hull', 'of', 'the', 'extreme', 'rows', 'enables', 'polynomialtime', 'algorithms', 'the', 'computational', 'cost', 'is', 'not', 'affordable', 'for', 'big', 'data', 'this', 'paper', 'investigates', 'how', 'the', 'power', 'of', 'quantum', 'computation', 'can', 'be', 'capitalized', 'to', 'solve', 'the', 'nonnegative', 'matrix', 'factorization', 'with', 'the', 'separability', 'assumption', 'snmf', 'by', 'devising', 'a', 'quantum', 'algorithm', 'based', 'on', 'the', 'divideandconquer', 'anchoring', 'dca', 'scheme', 'the', 'design', 'of', 'quantum', 'dca', 'qdca', 'is', 'challenging', 'in', 'the', 'divide', 'step', 'the', 'random', 'projections', 'in', 'dca', 'is', 'completed', 'by', 'a', 'quantum', 'algorithm', 'for', 'linear', 'operations', 'which', 'achieves', 'the', 'exponential', 'speedup', 'we', 'then', 'devise', 'a', 'heuristic', 'postselection', 'procedure', 'which', 'extracts', 'the', 'information', 'of', 'anchors', 'stored', 'in', 'the', 'quantum', 'states', 'efficiently', 'under', 'a', 'plausible', 'assumption', 'qdca', 'performs', 'efficiently', 'achieves', 'the', 'quantum', 'speedup', 'and', 'is', 'beneficial', 'for', 'high', 'dimensional', 'problems']] | [-0.11422767051961273, 0.060169128463603554, -0.10504141983265679, 0.04479336203696827, -0.06684345216645549, -0.22500337867687145, 0.07681428137623394, 0.3805673041505118, -0.30283058162778614, -0.27719182389477887, 0.10728911403256158, -0.23591196890920402, -0.16738759047506999, 0.15732624649225424, -0.08397334267986784, 0.1331965817542126, 0.10477493723543982, 0.029173526943971715, -0.08814492134881827, -0.3253161387393872, 0.28245762187133855, 0.042351291777255634, 0.2963012070953846, 0.02855714369371223, 0.1399609519370521, 0.021195412093463043, 0.004691922602554162, 0.02065196299663512, -0.059698043975513426, 0.12331662152855036, 0.30285926710814237, 0.21066310831345617, 0.32706942582968623, -0.4098440569204589, -0.13577660582804432, 0.14423850218920659, 0.11647710751897344, 0.10808949975296855, -0.028014749217933666, -0.24534760085244975, 0.13202068621913593, -0.1007315865168736, -0.06393497762115051, -0.10511826692459483, -0.019187318151040623, -0.04765518841644128, -0.33620678772218526, 0.06668776303374518, 0.04689286580076441, 0.013114212127402426, 0.019067052497218052, -0.11931318332751592, 0.08074606678448618, 0.07496862660472592, -0.03478183337952942, 0.028891373925919953, 0.13644990377128124, -0.08060311126120116, -0.17301768192245315, 0.39355150911336145, -0.0007342113414779306, -0.23392247805992764, 0.11012415180138002, -0.05718055154196918, -0.14915426600569237, 0.14920563723891975, 0.15607873417514687, 0.11458569795223109, -0.1271918105085691, 0.15562506041373125, -0.06854886803155144, 0.1605289672346165, 0.040561316471236446, 0.013421649613107245, 0.11882811146477858, 0.14903062891059865, 0.13750630484583476, 0.16779668454934532, -0.05700612400192767, -0.10783958434748153, -0.2541953859028096, -0.16930436075975497, -0.2652309577950897, 0.05762307701797302, -0.140673201821531, -0.1554161842043201, 0.3704157048767229, 0.1320435614088395, 0.1772291764554878, 0.0968924258936507, 0.34057971452673275, 0.10698686741680528, 0.06534823101828806, 0.14370245955510957, 0.14854902270715684, 0.11376016424192736, 0.04331587555585429, -0.2235439887115111, 0.09009192572751393, 0.09542615241060655] |
1,802.07829 | Phase transition for infinite systems of spiking neurons | We prove the existence of a phase transition for a stochastic model of
interacting neurons. The spiking activity of each neuron is represented by a
point process having rate $1 $ whenever its membrane potential is larger than a
threshold value. This membrane potential evolves in time and integrates the
spikes of all {\it presynaptic neurons} since the last spiking time of the
neuron. When a neuron spikes, its membrane potential is reset to $0$ and
simultaneously, a constant value is added to the membrane potentials of its
postsynaptic neurons. Moreover, each neuron is exposed to a leakage effect
leading to an abrupt loss of potential occurring at random times driven by an
independent Poisson point process of rate $\gamma > 0 .$ For this process we
prove the existence of a value $\gamma_c$ such that the system has one or two
extremal invariant measures according to whether $\gamma > \gamma_c $ or not.
| math.PR | we prove the existence of a phase transition for a stochastic model of interacting neurons the spiking activity of each neuron is represented by a point process having rate 1 whenever its membrane potential is larger than a threshold value this membrane potential evolves in time and integrates the spikes of all it presynaptic neurons since the last spiking time of the neuron when a neuron spikes its membrane potential is reset to 0 and simultaneously a constant value is added to the membrane potentials of its postsynaptic neurons moreover each neuron is exposed to a leakage effect leading to an abrupt loss of potential occurring at random times driven by an independent poisson point process of rate gamma 0 for this process we prove the existence of a value gamma_c such that the system has one or two extremal invariant measures according to whether gamma gamma_c or not | [['we', 'prove', 'the', 'existence', 'of', 'a', 'phase', 'transition', 'for', 'a', 'stochastic', 'model', 'of', 'interacting', 'neurons', 'the', 'spiking', 'activity', 'of', 'each', 'neuron', 'is', 'represented', 'by', 'a', 'point', 'process', 'having', 'rate', '1', 'whenever', 'its', 'membrane', 'potential', 'is', 'larger', 'than', 'a', 'threshold', 'value', 'this', 'membrane', 'potential', 'evolves', 'in', 'time', 'and', 'integrates', 'the', 'spikes', 'of', 'all', 'it', 'presynaptic', 'neurons', 'since', 'the', 'last', 'spiking', 'time', 'of', 'the', 'neuron', 'when', 'a', 'neuron', 'spikes', 'its', 'membrane', 'potential', 'is', 'reset', 'to', '0', 'and', 'simultaneously', 'a', 'constant', 'value', 'is', 'added', 'to', 'the', 'membrane', 'potentials', 'of', 'its', 'postsynaptic', 'neurons', 'moreover', 'each', 'neuron', 'is', 'exposed', 'to', 'a', 'leakage', 'effect', 'leading', 'to', 'an', 'abrupt', 'loss', 'of', 'potential', 'occurring', 'at', 'random', 'times', 'driven', 'by', 'an', 'independent', 'poisson', 'point', 'process', 'of', 'rate', 'gamma', '0', 'for', 'this', 'process', 'we', 'prove', 'the', 'existence', 'of', 'a', 'value', 'gamma_c', 'such', 'that', 'the', 'system', 'has', 'one', 'or', 'two', 'extremal', 'invariant', 'measures', 'according', 'to', 'whether', 'gamma', 'gamma_c', 'or', 'not']] | [-0.13796356026608272, 0.1565038507396821, -0.03747257732492465, 0.011188700412905086, -0.021144930370177, -0.21019691382941083, 0.10080267029233127, 0.3764174392184355, -0.29873734042548494, -0.20434747433802425, 0.0715691637358747, -0.3040872426366046, -0.2157319519018767, 0.13325896492109152, -0.05620534240499439, 0.02598866050783232, 0.023702036673765654, 0.13817621095437282, 0.021260606895369672, -0.21313022159902542, 0.2737389880876313, 0.04146001070125291, 0.2204684341098213, 0.014199347071577764, 0.1588831773252795, -0.05531139229736822, 0.06261130269060548, -0.0431510045159637, -0.10012346474421968, 0.04312601591766681, 0.20899336825237427, 0.095049432361209, 0.3354847830964015, -0.4435481603738646, -0.2391579548934562, 0.19016449818318873, 0.11132532718490602, 0.09085802387933703, -0.018978838127531462, -0.23815039595614043, 0.10584799787139007, -0.13055737877745907, -0.12396984478465013, 0.02118508119429868, 0.10063142550721664, 0.06845461011195443, -0.3119973314257226, 0.09724261985166661, 0.08747861475915017, 0.004308249357612741, -0.058127334711748184, -0.046574438449414134, -0.047211951885572416, 0.1501772456809069, 0.050194096115719365, 0.07995698363645215, 0.2375118456118359, -0.14777381886609348, -0.10517405687000027, 0.2863649511959829, -0.05958601009249515, -0.1890217444715684, 0.15102526433640878, -0.1461405575450435, -0.07363702650627296, 0.17531525018006164, 0.13036725438831237, 0.061418022313108354, -0.1723498819016378, 0.05146848637807564, 0.05757005726481044, 0.20084465355276374, 0.08576396137988507, -0.03740054273965375, 0.20043803922732004, 0.21975180610620584, 0.08507847353416001, 0.14832726665209953, -0.08635848219312678, -0.08407373057253309, -0.3118963970758971, -0.10683549774323134, -0.19083231065075396, 0.10720831209775326, -0.12146663162587742, -0.19236635011792708, 0.45164602688019906, 0.10188564488776779, 0.25595564549576316, 0.0965633301217509, 0.22187994770868213, 0.18392277222701767, 0.056260483519130405, 0.04238694503703373, 0.17128615577598946, 0.11875081867692154, 0.0936046658808853, -0.20703047744761027, 0.09885479717034122, 0.023818633625371344] |
1,802.0783 | Proper Semirings and Proper Convex Functors | Esik and Maletti introduced the notion of a proper semiring and proved that
some important (classes of) semirings -- Noetherian semirings, natural numbers
-- are proper. Properness matters as the equivalence problem for weighted
automata over a semiring which is proper and finitely and effectively presented
is decidable. Milius generalised the notion of properness from a semiring to a
functor. As a consequence, a semiring is proper if and only if its associated
"cubic functor" is proper. Moreover, properness of a functor renders soundness
and completeness proofs for axiomatizations of equivalent behaviour.
In this paper we provide a method for proving properness of functors, and
instantiate it to cover both the known cases and several novel ones: (1)
properness of the semirings of positive rationals and positive reals, via
properness of the corresponding cubic functors; and (2) properness of two
functors on (positive) convex algebras. The latter functors are important for
axiomatizing trace equivalence of probabilistic transition systems. Our proofs
rely on results that stretch all the way back to Hilbert and Minkowski.
| cs.LO | esik and maletti introduced the notion of a proper semiring and proved that some important classes of semirings noetherian semirings natural numbers are proper properness matters as the equivalence problem for weighted automata over a semiring which is proper and finitely and effectively presented is decidable milius generalised the notion of properness from a semiring to a functor as a consequence a semiring is proper if and only if its associated cubic functor is proper moreover properness of a functor renders soundness and completeness proofs for axiomatizations of equivalent behaviour in this paper we provide a method for proving properness of functors and instantiate it to cover both the known cases and several novel ones 1 properness of the semirings of positive rationals and positive reals via properness of the corresponding cubic functors and 2 properness of two functors on positive convex algebras the latter functors are important for axiomatizing trace equivalence of probabilistic transition systems our proofs rely on results that stretch all the way back to hilbert and minkowski | [['esik', 'and', 'maletti', 'introduced', 'the', 'notion', 'of', 'a', 'proper', 'semiring', 'and', 'proved', 'that', 'some', 'important', 'classes', 'of', 'semirings', 'noetherian', 'semirings', 'natural', 'numbers', 'are', 'proper', 'properness', 'matters', 'as', 'the', 'equivalence', 'problem', 'for', 'weighted', 'automata', 'over', 'a', 'semiring', 'which', 'is', 'proper', 'and', 'finitely', 'and', 'effectively', 'presented', 'is', 'decidable', 'milius', 'generalised', 'the', 'notion', 'of', 'properness', 'from', 'a', 'semiring', 'to', 'a', 'functor', 'as', 'a', 'consequence', 'a', 'semiring', 'is', 'proper', 'if', 'and', 'only', 'if', 'its', 'associated', 'cubic', 'functor', 'is', 'proper', 'moreover', 'properness', 'of', 'a', 'functor', 'renders', 'soundness', 'and', 'completeness', 'proofs', 'for', 'axiomatizations', 'of', 'equivalent', 'behaviour', 'in', 'this', 'paper', 'we', 'provide', 'a', 'method', 'for', 'proving', 'properness', 'of', 'functors', 'and', 'instantiate', 'it', 'to', 'cover', 'both', 'the', 'known', 'cases', 'and', 'several', 'novel', 'ones', '1', 'properness', 'of', 'the', 'semirings', 'of', 'positive', 'rationals', 'and', 'positive', 'reals', 'via', 'properness', 'of', 'the', 'corresponding', 'cubic', 'functors', 'and', '2', 'properness', 'of', 'two', 'functors', 'on', 'positive', 'convex', 'algebras', 'the', 'latter', 'functors', 'are', 'important', 'for', 'axiomatizing', 'trace', 'equivalence', 'of', 'probabilistic', 'transition', 'systems', 'our', 'proofs', 'rely', 'on', 'results', 'that', 'stretch', 'all', 'the', 'way', 'back', 'to', 'hilbert', 'and', 'minkowski']] | [-0.13693928169292013, 0.027420550589586663, -0.09590927115915453, 0.1332780592410606, -0.15539584852864638, -0.1431668352773961, 0.047616150482859027, 0.3564979263334809, -0.4112334996708395, -0.1848039641565479, 0.09295033340219079, -0.22133488396887996, -0.11909201364306843, 0.20361053831327489, -0.19036664233049927, -0.005175454131505617, 0.05804992981172879, 0.055755811459761495, -0.07745565915589823, -0.27438420114819617, 0.40821722318582676, -0.043950188277042744, 0.21744362086961594, 0.07883635619107415, 0.1357621976352461, -0.006421755799366271, -0.033653364741407774, 0.04568143976955659, -0.11833908084466684, 0.11318901185329784, 0.3273882986868129, 0.16542888211141177, 0.2810843882452258, -0.36935640715939155, -0.09233885939397356, 0.17574710779042696, 0.09624854787526761, 0.004638839306939832, -0.003807046534219647, -0.2950699254130835, 0.12854084281528178, -0.17240788161425907, -0.06211836173589451, -0.1247006540912587, 0.08440168464063283, 0.04360450772459016, -0.256345851653639, -0.033844742480227175, 0.18997171532143564, 0.14018321072627954, -0.08342365762561231, -0.09939613579224577, -0.06622967270463158, 0.047897263435537324, -0.02870309520718258, 0.010911820394069176, 0.09911896505612222, -0.07524960565736846, -0.1404997413046658, 0.40174270258011185, -0.05056795428868902, -0.20077933383119456, 0.1436969807234538, -0.07403466233791893, -0.14348053162205307, 0.12605295634335456, 0.0026703735539580094, 0.17006719915525, -0.06384965271743781, 0.17406860666027676, -0.1642246337059666, 0.07474194662645459, 0.1525444779161583, 0.09065970121608938, 0.09971420028630425, 0.08131858038661234, 0.11820851099499337, 0.1443827993263874, 0.09398991477312794, -0.05564289983800229, -0.36666387327234534, -0.199158450648846, -0.07113014636150397, 0.07336100064327612, -0.1115408568387091, -0.18324094437925584, 0.3747918580658734, 0.14149724702515146, 0.11386887777925414, 0.21712581166819506, 0.2724332466050435, 0.0338807576438686, 0.06749129358213395, 0.0004801224040634492, 0.1272704910060651, 0.285800124052912, 0.0022288427599157917, -0.0826132983996478, 0.0390911699820529, 0.21486231130136943] |
1,802.07831 | Helical Magnetic Fields in Molecular Clouds? A New Method to Determine
the Line-of-Sight Magnetic Field Structure in Molecular Clouds | Magnetic fields pervade in the interstellar medium (ISM) and are believed to
be important in the process of star formation, yet probing magnetic fields in
star formation regions is challenging. We propose a new method to use Faraday
rotation measurements in small scale star forming regions to find the direction
and magnitude of the component of magnetic field along the line-of-sight. We
test the proposed method in four relatively nearby regions of Orion A, Orion B,
Perseus, and California. We use rotation measure data from the literature. We
adopt a simple approach based on relative measurements to estimate the rotation
measure due to the molecular clouds over the Galactic contribution. We then use
a chemical evolution code along with extinction maps of each cloud to find the
electron column density of the molecular cloud at the position of each rotation
measure data point. Combining the rotation measures produced by the molecular
clouds and the electron column density, we calculate the line-of-sight magnetic
field strength and direction. In California and Orion A, we find clear evidence
that the magnetic fields at one side of these filamentary structures are
pointing towards us and are pointing away from us at the other side. Even
though the magnetic fields in Perseus might seem to suggest the same behavior,
not enough data points are available to draw such conclusions. In Orion B, as
well, there are not enough data points available to detect such behavior. This
behavior is consistent with a helical magnetic field morphology. In the
vicinity of available Zeeman measurements in OMC-1, OMC-B, and the dark cloud
Barnard 1, we find magnetic field values of $-23\pm38~\mu$G, $-129\pm28~\mu$G,
and $32\pm101~\mu$G, respectively, which are in agreement with the Zeeman
Measurements.
| astro-ph.GA | magnetic fields pervade in the interstellar medium ism and are believed to be important in the process of star formation yet probing magnetic fields in star formation regions is challenging we propose a new method to use faraday rotation measurements in small scale star forming regions to find the direction and magnitude of the component of magnetic field along the lineofsight we test the proposed method in four relatively nearby regions of orion a orion b perseus and california we use rotation measure data from the literature we adopt a simple approach based on relative measurements to estimate the rotation measure due to the molecular clouds over the galactic contribution we then use a chemical evolution code along with extinction maps of each cloud to find the electron column density of the molecular cloud at the position of each rotation measure data point combining the rotation measures produced by the molecular clouds and the electron column density we calculate the lineofsight magnetic field strength and direction in california and orion a we find clear evidence that the magnetic fields at one side of these filamentary structures are pointing towards us and are pointing away from us at the other side even though the magnetic fields in perseus might seem to suggest the same behavior not enough data points are available to draw such conclusions in orion b as well there are not enough data points available to detect such behavior this behavior is consistent with a helical magnetic field morphology in the vicinity of available zeeman measurements in omc1 omcb and the dark cloud barnard 1 we find magnetic field values of 23pm38mug 129pm28mug and 32pm101mug respectively which are in agreement with the zeeman measurements | [['magnetic', 'fields', 'pervade', 'in', 'the', 'interstellar', 'medium', 'ism', 'and', 'are', 'believed', 'to', 'be', 'important', 'in', 'the', 'process', 'of', 'star', 'formation', 'yet', 'probing', 'magnetic', 'fields', 'in', 'star', 'formation', 'regions', 'is', 'challenging', 'we', 'propose', 'a', 'new', 'method', 'to', 'use', 'faraday', 'rotation', 'measurements', 'in', 'small', 'scale', 'star', 'forming', 'regions', 'to', 'find', 'the', 'direction', 'and', 'magnitude', 'of', 'the', 'component', 'of', 'magnetic', 'field', 'along', 'the', 'lineofsight', 'we', 'test', 'the', 'proposed', 'method', 'in', 'four', 'relatively', 'nearby', 'regions', 'of', 'orion', 'a', 'orion', 'b', 'perseus', 'and', 'california', 'we', 'use', 'rotation', 'measure', 'data', 'from', 'the', 'literature', 'we', 'adopt', 'a', 'simple', 'approach', 'based', 'on', 'relative', 'measurements', 'to', 'estimate', 'the', 'rotation', 'measure', 'due', 'to', 'the', 'molecular', 'clouds', 'over', 'the', 'galactic', 'contribution', 'we', 'then', 'use', 'a', 'chemical', 'evolution', 'code', 'along', 'with', 'extinction', 'maps', 'of', 'each', 'cloud', 'to', 'find', 'the', 'electron', 'column', 'density', 'of', 'the', 'molecular', 'cloud', 'at', 'the', 'position', 'of', 'each', 'rotation', 'measure', 'data', 'point', 'combining', 'the', 'rotation', 'measures', 'produced', 'by', 'the', 'molecular', 'clouds', 'and', 'the', 'electron', 'column', 'density', 'we', 'calculate', 'the', 'lineofsight', 'magnetic', 'field', 'strength', 'and', 'direction', 'in', 'california', 'and', 'orion', 'a', 'we', 'find', 'clear', 'evidence', 'that', 'the', 'magnetic', 'fields', 'at', 'one', 'side', 'of', 'these', 'filamentary', 'structures', 'are', 'pointing', 'towards', 'us', 'and', 'are', 'pointing', 'away', 'from', 'us', 'at', 'the', 'other', 'side', 'even', 'though', 'the', 'magnetic', 'fields', 'in', 'perseus', 'might', 'seem', 'to', 'suggest', 'the', 'same', 'behavior', 'not', 'enough', 'data', 'points', 'are', 'available', 'to', 'draw', 'such', 'conclusions', 'in', 'orion', 'b', 'as', 'well', 'there', 'are', 'not', 'enough', 'data', 'points', 'available', 'to', 'detect', 'such', 'behavior', 'this', 'behavior', 'is', 'consistent', 'with', 'a', 'helical', 'magnetic', 'field', 'morphology', 'in', 'the', 'vicinity', 'of', 'available', 'zeeman', 'measurements', 'in', 'omc1', 'omcb', 'and', 'the', 'dark', 'cloud', 'barnard', '1', 'we', 'find', 'magnetic', 'field', 'values', 'of', '23pm38mug', '129pm28mug', 'and', '32pm101mug', 'respectively', 'which', 'are', 'in', 'agreement', 'with', 'the', 'zeeman', 'measurements']] | [-0.120475435849164, 0.10196236578923289, -0.07286717006572095, 0.04963208705059994, -0.07525102147878913, -0.05853734297588388, 0.042635709387863395, 0.4342018113706884, -0.23944309550771253, -0.3301232105081245, 0.05430002090996761, -0.2545627946691965, -0.056136055159493554, 0.17304221476723186, 0.009305686272536121, -0.04657334029989183, 0.026461044590326947, -0.007558130224987705, -0.032062445026888674, -0.18913728211056838, 0.3169414973428334, 0.048204574903002624, 0.24153566949096014, 0.03119295083145442, 0.05083839951917443, -0.10266577082212179, -0.04342126116915556, 0.029265730144635002, -0.142694650578452, 0.08573304676513761, 0.20745524215541805, 0.08843890266257647, 0.20574023131881028, -0.4229260807147654, -0.1986024366845824, 0.06253754174224105, 0.16499165393945717, 0.11058625015239579, -0.05958171444152709, -0.2751442498388266, 0.06254560204642888, -0.11418097892285613, -0.17949120698867901, -0.0265979487125785, 0.02329981738611976, 0.0479121588570732, -0.26397856674902803, 0.08860352593457518, -0.031566072488281326, 0.1251478660188854, -0.10836948508569089, -0.10719196571433234, -0.033392784293422816, 0.11540054112467318, 0.04590939598817136, 0.1295027561830456, 0.21508895414732265, -0.1550140322535713, -0.045801476285431623, 0.39180038969638986, -0.07659974072817911, -0.09169807006005079, 0.2274744229936422, -0.25270050717517734, -0.18317572610101454, 0.14541684551946688, 0.15783393275808025, 0.09086291926657761, -0.11990958111513128, 0.007496470449371363, -0.04067045374147037, 0.15091672975263803, 0.039197563061165855, 0.033597245835383246, 0.28991815321863335, 0.08222098884858801, 0.07806082705559468, 0.12463767579537104, -0.25289798441700956, -0.09622355164741282, -0.23673283992321942, -0.12957792731625065, -0.14654990195319906, 0.03524518559582853, -0.07899951736737512, -0.12555104333674225, 0.328660188778055, 0.1796437824025644, 0.23748918825899684, -0.03146864490059877, 0.3357615220456573, 0.04995722822895526, 0.11424803361213796, 0.14393585329453604, 0.2590631440387926, 0.1964363669239157, 0.11439607452619423, -0.21728855530728067, 0.07998426587758353, -0.029958550484347226] |
1,802.07832 | Comparative study of finite element methods using the Time-Accuracy-Size
(TAS) spectrum analysis | We present a performance analysis appropriate for comparing algorithms using
different numerical discretizations. By taking into account the total
time-to-solution, numerical accuracy with respect to an error norm, and the
computation rate, a cost-benefit analysis can be performed to determine which
algorithm and discretization are particularly suited for an application. This
work extends the performance spectrum model in Chang et. al. 2017 for
interpretation of hardware and algorithmic tradeoffs in numerical PDE
simulation. As a proof-of-concept, popular finite element software packages are
used to illustrate this analysis for Poisson's equation.
| cs.MS cs.PF | we present a performance analysis appropriate for comparing algorithms using different numerical discretizations by taking into account the total timetosolution numerical accuracy with respect to an error norm and the computation rate a costbenefit analysis can be performed to determine which algorithm and discretization are particularly suited for an application this work extends the performance spectrum model in chang et al 2017 for interpretation of hardware and algorithmic tradeoffs in numerical pde simulation as a proofofconcept popular finite element software packages are used to illustrate this analysis for poissons equation | [['we', 'present', 'a', 'performance', 'analysis', 'appropriate', 'for', 'comparing', 'algorithms', 'using', 'different', 'numerical', 'discretizations', 'by', 'taking', 'into', 'account', 'the', 'total', 'timetosolution', 'numerical', 'accuracy', 'with', 'respect', 'to', 'an', 'error', 'norm', 'and', 'the', 'computation', 'rate', 'a', 'costbenefit', 'analysis', 'can', 'be', 'performed', 'to', 'determine', 'which', 'algorithm', 'and', 'discretization', 'are', 'particularly', 'suited', 'for', 'an', 'application', 'this', 'work', 'extends', 'the', 'performance', 'spectrum', 'model', 'in', 'chang', 'et', 'al', '2017', 'for', 'interpretation', 'of', 'hardware', 'and', 'algorithmic', 'tradeoffs', 'in', 'numerical', 'pde', 'simulation', 'as', 'a', 'proofofconcept', 'popular', 'finite', 'element', 'software', 'packages', 'are', 'used', 'to', 'illustrate', 'this', 'analysis', 'for', 'poissons', 'equation']] | [-0.06121353017580178, -0.06983435084338352, -0.10157031534892869, 0.04347727458872315, -0.06592835146519872, -0.13212131470079638, 0.021033085667942132, 0.4004815396749311, -0.2417917090209408, -0.3658611266440453, 0.12913828685931447, -0.23216199869703916, -0.13291890149315197, 0.2728711540784894, -0.09101325971455985, 0.14151545831312737, 0.1355054323044088, -0.08100192068248159, -0.08746315978674425, -0.27389307075904473, 0.22763438086387597, 0.14483492317506008, 0.281173897938182, 0.05039185660166873, 0.058402976755880645, -0.03594989926140341, -0.0824308219158815, 0.050241470378306174, -0.1409658790100366, 0.11047177648482223, 0.28731217190571545, 0.13601688308020432, 0.30843396606958573, -0.39431225755769345, -0.2096778843862315, 0.04949378804303706, 0.1679535014451378, 0.07928393081787767, -0.05293825858583053, -0.27826838099087275, 0.10050243582162592, -0.2019885318353772, -0.1025984946379645, -0.1493253028485924, -0.01226748147358497, 0.024602972739376127, -0.32800246777219905, 0.057208290903104676, 0.0028563704652090865, 0.07829618905153539, -0.044969775900244716, -0.1596533324259023, 0.04006894334322876, 0.1102077334239665, 0.020649623813935453, -0.01517972092454632, 0.07042419519016727, -0.041215481562539936, -0.14729977607106168, 0.39035974324991307, -0.04603286240663793, -0.2548669309568747, 0.16721239402476284, 0.002401522779837251, -0.13338868298774792, 0.1126687423636516, 0.2288885743253761, 0.10329796163779166, -0.1396060827265804, 0.10461483058687816, 0.023002895868072908, 0.1885271468044569, 0.03170323576778174, -0.029117030464112757, 0.08005152574171209, 0.2403606591746211, 0.038313157075188224, 0.12719280895026813, -0.024609363580950432, -0.11760861859980246, -0.3054472495594786, -0.18987226584512326, -0.1631999210971925, -0.022668494013810738, -0.1167210322644678, -0.13218914422517022, 0.3619421474635601, 0.1934154621894575, 0.13732470798616608, 0.088533691845886, 0.37193241130250193, 0.12972162670016082, -0.013909779672717882, 0.11483021654809515, 0.19107549163875068, 0.12267883797952285, 0.10273364329089721, -0.24783366679524382, 0.03594007218877474, 0.1048151508335852] |
1,802.07833 | Variational Inference for Policy Gradient | Inspired by the seminal work on Stein Variational Inference and Stein
Variational Policy Gradient, we derived a method to generate samples from the
posterior variational parameter distribution by \textit{explicitly} minimizing
the KL divergence to match the target distribution in an amortize fashion.
Consequently, we applied this varational inference technique into vanilla
policy gradient, TRPO and PPO with Bayesian Neural Network parameterizations
for reinforcement learning problems.
| cs.LG cs.AI stat.ML | inspired by the seminal work on stein variational inference and stein variational policy gradient we derived a method to generate samples from the posterior variational parameter distribution by textitexplicitly minimizing the kl divergence to match the target distribution in an amortize fashion consequently we applied this varational inference technique into vanilla policy gradient trpo and ppo with bayesian neural network parameterizations for reinforcement learning problems | [['inspired', 'by', 'the', 'seminal', 'work', 'on', 'stein', 'variational', 'inference', 'and', 'stein', 'variational', 'policy', 'gradient', 'we', 'derived', 'a', 'method', 'to', 'generate', 'samples', 'from', 'the', 'posterior', 'variational', 'parameter', 'distribution', 'by', 'textitexplicitly', 'minimizing', 'the', 'kl', 'divergence', 'to', 'match', 'the', 'target', 'distribution', 'in', 'an', 'amortize', 'fashion', 'consequently', 'we', 'applied', 'this', 'varational', 'inference', 'technique', 'into', 'vanilla', 'policy', 'gradient', 'trpo', 'and', 'ppo', 'with', 'bayesian', 'neural', 'network', 'parameterizations', 'for', 'reinforcement', 'learning', 'problems']] | [0.0675836687404958, -0.04157145590949175, -0.14664202649146318, 0.10971559419126678, -0.15067585092037916, -0.14428549442469837, 0.12159843521103972, 0.4673422435446391, -0.36487843343869797, -0.34284264260222985, 0.025733756601795672, -0.21391398605284473, -0.16977683951457342, 0.1653470169930231, -0.1568681632005979, 0.13286677987447806, 0.09214394383265503, -0.05789858320846208, -0.09344079470380194, -0.2477438086791644, 0.3005774172673386, 0.048530554605854884, 0.3606918738593185, -0.07918674390142162, 0.19581144481009458, -0.003613248700276017, 0.03207525850406715, -0.002844031369830999, -0.16077204093721414, 0.2185896857390328, 0.2763345068900861, 0.21863903134085594, 0.40513093967641156, -0.39170203854640323, -0.26948299448168467, 0.12648621899267984, 0.12999380323740226, 0.08045116266501802, -0.018283882128473903, -0.36020084157113047, 0.008333321512928085, -0.17022055791070065, 0.006994547529353036, -0.1818520383140634, -0.10524549491940037, 0.006899469967244104, -0.34927207024561036, 0.08056539013641813, 0.0571103079747113, 0.030324013046328983, -0.052931813877962884, -0.21302378740547862, 0.05019126211049124, 0.04052281782533678, 0.08664719793494673, 0.14299782643479014, 0.1390436769034418, -0.15476560237030276, -0.11121609100761513, 0.19216428544845374, -0.0963498607697335, -0.25616967935292495, 0.09330679960770621, 0.040259814436828335, -0.17657674970622692, 0.08529005257324093, 0.23288231354118102, 0.2038928327549781, -0.21761777583095762, 0.05948587030076259, -0.0161206529952497, 0.07673623018883287, 0.02573087193544895, -0.16753757514414333, 0.05157166491780016, 0.18554814082999077, 0.16075122289891755, 0.14018424687951447, -0.1363180653554284, -0.21256367803092988, -0.21791528462476673, -0.08796605250487725, -0.23242232203483582, -0.001870590809082228, -0.13073651613030096, -0.15278757579388128, 0.32487119400193765, 0.1512750097373057, 0.2164865676646254, 0.1807577364619762, 0.3016179171169088, 0.09138362040920626, 0.04990934653739844, 0.17977407641176665, 0.18414492651613223, 0.12231078284925648, 0.08628324414640369, -0.17187373643918408, 0.15198634204173844, 0.1119710114888019] |
1,802.07834 | Learning to Gather without Communication | A standard belief on emerging collective behavior is that it emerges from
simple individual rules. Most of the mathematical research on such collective
behavior starts from imperative individual rules, like always go to the center.
But how could an (optimal) individual rule emerge during a short period within
the group lifetime, especially if communication is not available. We argue that
such rules can actually emerge in a group in a short span of time via
collective (multi-agent) reinforcement learning, i.e learning via rewards and
punishments. We consider the gathering problem: several agents (social animals,
swarming robots...) must gather around a same position, which is not determined
in advance. They must do so without communication on their planned decision,
just by looking at the position of other agents. We present the first
experimental evidence that a gathering behavior can be learned without
communication in a partially observable environment. The learned behavior has
the same properties as a self-stabilizing distributed algorithm, as processes
can gather from any initial state (and thus tolerate any transient failure).
Besides, we show that it is possible to tolerate the brutal loss of up to 90\%
of agents without significant impact on the behavior.
| q-bio.PE cs.DC cs.LG cs.MA stat.ML | a standard belief on emerging collective behavior is that it emerges from simple individual rules most of the mathematical research on such collective behavior starts from imperative individual rules like always go to the center but how could an optimal individual rule emerge during a short period within the group lifetime especially if communication is not available we argue that such rules can actually emerge in a group in a short span of time via collective multiagent reinforcement learning ie learning via rewards and punishments we consider the gathering problem several agents social animals swarming robots must gather around a same position which is not determined in advance they must do so without communication on their planned decision just by looking at the position of other agents we present the first experimental evidence that a gathering behavior can be learned without communication in a partially observable environment the learned behavior has the same properties as a selfstabilizing distributed algorithm as processes can gather from any initial state and thus tolerate any transient failure besides we show that it is possible to tolerate the brutal loss of up to 90 of agents without significant impact on the behavior | [['a', 'standard', 'belief', 'on', 'emerging', 'collective', 'behavior', 'is', 'that', 'it', 'emerges', 'from', 'simple', 'individual', 'rules', 'most', 'of', 'the', 'mathematical', 'research', 'on', 'such', 'collective', 'behavior', 'starts', 'from', 'imperative', 'individual', 'rules', 'like', 'always', 'go', 'to', 'the', 'center', 'but', 'how', 'could', 'an', 'optimal', 'individual', 'rule', 'emerge', 'during', 'a', 'short', 'period', 'within', 'the', 'group', 'lifetime', 'especially', 'if', 'communication', 'is', 'not', 'available', 'we', 'argue', 'that', 'such', 'rules', 'can', 'actually', 'emerge', 'in', 'a', 'group', 'in', 'a', 'short', 'span', 'of', 'time', 'via', 'collective', 'multiagent', 'reinforcement', 'learning', 'ie', 'learning', 'via', 'rewards', 'and', 'punishments', 'we', 'consider', 'the', 'gathering', 'problem', 'several', 'agents', 'social', 'animals', 'swarming', 'robots', 'must', 'gather', 'around', 'a', 'same', 'position', 'which', 'is', 'not', 'determined', 'in', 'advance', 'they', 'must', 'do', 'so', 'without', 'communication', 'on', 'their', 'planned', 'decision', 'just', 'by', 'looking', 'at', 'the', 'position', 'of', 'other', 'agents', 'we', 'present', 'the', 'first', 'experimental', 'evidence', 'that', 'a', 'gathering', 'behavior', 'can', 'be', 'learned', 'without', 'communication', 'in', 'a', 'partially', 'observable', 'environment', 'the', 'learned', 'behavior', 'has', 'the', 'same', 'properties', 'as', 'a', 'selfstabilizing', 'distributed', 'algorithm', 'as', 'processes', 'can', 'gather', 'from', 'any', 'initial', 'state', 'and', 'thus', 'tolerate', 'any', 'transient', 'failure', 'besides', 'we', 'show', 'that', 'it', 'is', 'possible', 'to', 'tolerate', 'the', 'brutal', 'loss', 'of', 'up', 'to', '90', 'of', 'agents', 'without', 'significant', 'impact', 'on', 'the', 'behavior']] | [-0.14100610858968785, 0.15505682554299563, -0.12053482201621693, 0.06033894993532638, -0.13922430528918764, -0.15538931427154748, 0.11604739005351203, 0.4418962805527191, -0.3071762475777219, -0.28880452335254303, 0.10943046959381797, -0.2600479524363681, -0.17266537672201843, 0.15653911467965428, -0.08720701214382283, 0.01247232784292552, 0.07684480126646967, 0.12097544413589432, -0.004004726927138884, -0.24170619430171733, 0.26268935052448705, 0.041634404733966145, 0.26549657633253915, 0.011771193405301287, 0.10620494877806094, 0.03855195406559609, 0.02849136211547107, 0.024415387318181204, -0.049266027638406214, 0.07553070065326667, 0.3066077266115374, 0.20215185147327214, 0.3427135771291737, -0.45442266902900513, -0.19799302330212243, 0.14012952749782862, 0.17084240998486577, 0.13866129764627552, -0.01723076437120113, -0.2827952691746242, 0.08315958906801862, -0.18423541696141782, -0.10785023302923023, -0.07117620468740045, -0.004219155183043047, 0.016849477476378914, -0.21593185732386969, 0.007052029476519958, 0.06319727638953833, 0.05851786665684605, -0.0553130801267175, -0.06857420261098346, -0.006603508920593159, 0.20269501513475316, 0.027972432867467856, -0.005184953368232268, 0.18004064945513523, -0.1547572160149135, -0.16149284256158897, 0.40220932824995725, -0.024849599977803942, -0.15901315784324693, 0.20425747764098273, -0.10847235672402805, -0.14747808993023437, 0.12158857519516182, 0.21198901304795506, 0.09342137920471655, -0.1716793052530682, 0.009124248362439424, -0.03309650170536438, 0.1910190559725093, 0.03146046817628903, 0.03181673253314371, 0.20591498662476537, 0.1764738826378991, 0.09554652556502805, 0.08625197571289825, -0.020601105968453708, -0.14076597103996788, -0.27132618174353984, -0.09382678236727257, -0.17293234459753268, 0.08512407544480878, -0.0626790038128868, -0.10815864559002977, 0.32780481009096435, 0.17530864582108666, 0.20810207741398265, 0.0866792531344841, 0.2786709021323072, 0.05674050791841473, 0.10372807908672331, 0.10722064785068372, 0.25320140530974583, -0.02533516433293255, 0.11651007209190635, -0.19212147637936972, 0.18145963448208524, -0.014326585028887853] |
1,802.07835 | Hydrodynamic assembly of active colloids: chiral spinners and dynamic
crystals | Active colloids self-organise to a variety of collective states, ranging from
highly motile 'molecules' to complex 3D structures. Using large-scale
simulations, we show that hydrodynamic interactions, together with a
gravity-like aligning field, lead to tunable self-assembly of active colloidal
spheres near a surface. The observed structures depend on the hydrodynamic
characteristics: particles driven at the front, pullers, form small chiral
spinners consisting of two or three particles, whereas those driven at the
rear, pushers, assemble to large dynamic aggregates. The rotational motion of
the puller spinners, arises from spontaneous breaking of the internal
chirality. Our results show that the fluid flow mediates chiral transfer
between neighboring spinners. Finally we show that the chirality of the
individual spinners controls the topology of the self-assembly in solution:
homochiral samples assemble into a hexagonally symmetric 2D crystal lattice
while racemic mixtures show reduced hexatic order with diffusion-like dynamics.
| cond-mat.soft physics.flu-dyn | active colloids selforganise to a variety of collective states ranging from highly motile molecules to complex 3d structures using largescale simulations we show that hydrodynamic interactions together with a gravitylike aligning field lead to tunable selfassembly of active colloidal spheres near a surface the observed structures depend on the hydrodynamic characteristics particles driven at the front pullers form small chiral spinners consisting of two or three particles whereas those driven at the rear pushers assemble to large dynamic aggregates the rotational motion of the puller spinners arises from spontaneous breaking of the internal chirality our results show that the fluid flow mediates chiral transfer between neighboring spinners finally we show that the chirality of the individual spinners controls the topology of the selfassembly in solution homochiral samples assemble into a hexagonally symmetric 2d crystal lattice while racemic mixtures show reduced hexatic order with diffusionlike dynamics | [['active', 'colloids', 'selforganise', 'to', 'a', 'variety', 'of', 'collective', 'states', 'ranging', 'from', 'highly', 'motile', 'molecules', 'to', 'complex', '3d', 'structures', 'using', 'largescale', 'simulations', 'we', 'show', 'that', 'hydrodynamic', 'interactions', 'together', 'with', 'a', 'gravitylike', 'aligning', 'field', 'lead', 'to', 'tunable', 'selfassembly', 'of', 'active', 'colloidal', 'spheres', 'near', 'a', 'surface', 'the', 'observed', 'structures', 'depend', 'on', 'the', 'hydrodynamic', 'characteristics', 'particles', 'driven', 'at', 'the', 'front', 'pullers', 'form', 'small', 'chiral', 'spinners', 'consisting', 'of', 'two', 'or', 'three', 'particles', 'whereas', 'those', 'driven', 'at', 'the', 'rear', 'pushers', 'assemble', 'to', 'large', 'dynamic', 'aggregates', 'the', 'rotational', 'motion', 'of', 'the', 'puller', 'spinners', 'arises', 'from', 'spontaneous', 'breaking', 'of', 'the', 'internal', 'chirality', 'our', 'results', 'show', 'that', 'the', 'fluid', 'flow', 'mediates', 'chiral', 'transfer', 'between', 'neighboring', 'spinners', 'finally', 'we', 'show', 'that', 'the', 'chirality', 'of', 'the', 'individual', 'spinners', 'controls', 'the', 'topology', 'of', 'the', 'selfassembly', 'in', 'solution', 'homochiral', 'samples', 'assemble', 'into', 'a', 'hexagonally', 'symmetric', '2d', 'crystal', 'lattice', 'while', 'racemic', 'mixtures', 'show', 'reduced', 'hexatic', 'order', 'with', 'diffusionlike', 'dynamics']] | [-0.15524457524016758, 0.26705604200411975, -0.04644688947310928, -0.0374845256450875, -0.0492852875545364, -0.12772901777563425, -0.029039764474948934, 0.39067605843382147, -0.29279816750766197, -0.2897729973870747, -0.00783837929705222, -0.2810296471595989, -0.17648742688851882, 0.08897983500059566, 0.06414961340708722, -0.007899949415426316, 0.026099773815929376, -0.0565586990548362, -0.0006137168885947302, -0.11938608162875833, 0.25787022599051224, -0.03767413133755326, 0.30735099169843155, -0.0071135500140873525, 0.1416954379753563, -0.028274414377640292, 0.06862990352614172, 0.05565260190131335, -0.16116759735234845, 0.10989976961783872, 0.16915710077235668, -0.07102697691237875, 0.17894820758494837, -0.5275986149393279, -0.2200616522081967, 0.06247807702948821, 0.18147815742915305, 0.1731269586590472, -0.10315643565825604, -0.30409493215125183, 0.05330719157475336, -0.12666677649229252, -0.1561306585011811, -0.08063065765168646, -0.010157843392366415, 0.07927271744902728, -0.2416402041815735, 0.08375415746604317, 0.0796725815964927, 0.06134921912031634, -0.10924517737605191, -0.05191390549057517, -0.1177177193269519, 0.13029984618328383, 0.03414669547486922, -0.027612709825665785, 0.2690429962786107, -0.18240326037309293, -0.1082576094773309, 0.4353134133050154, -0.010356212365200165, -0.2154227497698418, 0.2836634861241127, -0.1503208914193614, -0.07093228024494802, 0.24111203441460585, 0.2099463014120782, 0.10677657486742427, -0.07320690061254748, -0.014701165290999001, -0.05509383852497257, 0.2017786632669319, 0.0901498489659922, -0.033688496390421846, 0.2911632338089162, 0.2031330798592033, 0.022764785916159123, 0.16688081126194448, -0.07569861275481124, -0.1733745620923181, -0.20186418823512464, -0.13505700156092643, -0.17733660869236137, 0.039066503007478756, -0.10021699261691036, -0.18801204325823948, 0.3336594363754808, 0.0704527330384108, 0.20882247120206213, 0.01017211211748935, 0.22540075044340357, -0.04348042691688471, 0.0800170395426966, 0.02415185133798112, 0.2620794319900973, 0.11267066165355259, 0.09284594427505187, -0.29757166250351946, 0.017922194831972493, 0.05471918196658251] |
1,802.07836 | Open manifolds with non-homeomorphic positively curved souls | We extend two known existence results to simply connected manifolds with
positive sectional curvature: we show that there exist pairs of simply
connected positively-curved manifolds that are tangentially homotopy equivalent
but not homeomorphic, and we deduce that an open manifold may admit a pair of
non-homeomorphic simply connected and positively-curved souls. Examples of such
pairs are given by explicit pairs of Eschenburg spaces. To deduce the second
statement from the first, we extend our earlier work on the stable converse
soul question and show that it has a positive answer for a class of spaces that
includes all Eschenburg spaces.
| math.DG | we extend two known existence results to simply connected manifolds with positive sectional curvature we show that there exist pairs of simply connected positivelycurved manifolds that are tangentially homotopy equivalent but not homeomorphic and we deduce that an open manifold may admit a pair of nonhomeomorphic simply connected and positivelycurved souls examples of such pairs are given by explicit pairs of eschenburg spaces to deduce the second statement from the first we extend our earlier work on the stable converse soul question and show that it has a positive answer for a class of spaces that includes all eschenburg spaces | [['we', 'extend', 'two', 'known', 'existence', 'results', 'to', 'simply', 'connected', 'manifolds', 'with', 'positive', 'sectional', 'curvature', 'we', 'show', 'that', 'there', 'exist', 'pairs', 'of', 'simply', 'connected', 'positivelycurved', 'manifolds', 'that', 'are', 'tangentially', 'homotopy', 'equivalent', 'but', 'not', 'homeomorphic', 'and', 'we', 'deduce', 'that', 'an', 'open', 'manifold', 'may', 'admit', 'a', 'pair', 'of', 'nonhomeomorphic', 'simply', 'connected', 'and', 'positivelycurved', 'souls', 'examples', 'of', 'such', 'pairs', 'are', 'given', 'by', 'explicit', 'pairs', 'of', 'eschenburg', 'spaces', 'to', 'deduce', 'the', 'second', 'statement', 'from', 'the', 'first', 'we', 'extend', 'our', 'earlier', 'work', 'on', 'the', 'stable', 'converse', 'soul', 'question', 'and', 'show', 'that', 'it', 'has', 'a', 'positive', 'answer', 'for', 'a', 'class', 'of', 'spaces', 'that', 'includes', 'all', 'eschenburg', 'spaces']] | [-0.16701438111020253, 0.08443341132850037, -0.041691620936617255, 0.1187989539373666, -0.12261285342974589, -0.16959045183379204, -0.010985785759985447, 0.42149852284230294, -0.23891318776702974, -0.21123748546931892, 0.09707182383863255, -0.29075895445887, -0.18196212576702236, 0.24116365455091, -0.14790180512238293, -0.06287979962304234, 0.09857614167034626, 0.08117603182909079, -0.04527950446587056, -0.32183556323871015, 0.5024592119082808, -0.13864178525749593, 0.1889455562706644, 0.12391931500285863, 0.12710274229291826, -0.041068867486901584, -0.02200638283393346, 0.07615273643750697, -0.18698970366684078, 0.13399099971633405, 0.27042928026989105, 0.10660628467332572, 0.20076059298822657, -0.34094461213797334, -0.1910535832028836, 0.19699268479947932, 0.13635651698336004, 0.029401441195514053, -0.040256453640176916, -0.29856607610359787, 0.14605558618437497, -0.09858428395353258, -0.1484441349701956, -0.11553200593218207, 0.027614184967242182, 0.01207754049450159, -0.1987936742277816, -0.0023980105109512807, 0.18706021902617068, -0.0003447908442467451, -0.1016948543000035, -0.07600121902301908, -0.06373686365084723, 0.13443861497333273, 0.0018087963542257057, 0.06911624949192628, 0.050664706137031314, 0.012586580244824291, -0.14911131281405687, 0.29197813561651853, -0.06364972947631031, -0.26923823652789, 0.1804095203243196, -0.1263116197218187, -0.1746580186067149, 0.1325147821754217, 0.0882861728966236, 0.18387961923144758, -0.03629655845230445, 0.12303931191388984, -0.14230066315270962, 0.10006231396342628, 0.118199010360986, -0.015243901242502033, 0.14104814448393882, 0.0643292338354513, 0.1556978435674682, 0.1192741246172227, 0.06730729425558821, -0.043103158427984456, -0.3509921920672059, -0.18464162565767764, -0.15078027593146545, 0.15477798620486283, -0.039605632815073476, -0.18696474282536657, 0.32127477454952896, 0.04674784762435593, 0.22640186779666693, 0.15073550420813261, 0.21602012576535345, -0.007823227954795585, 0.03564616701565683, 0.11745697577483952, 0.2005734766833484, 0.1807711471267976, -0.01887784816790372, -0.06144726405356778, -0.01650629243347794, 0.12961297584231943] |
1,802.07837 | Equivelar toroids with few flag-orbits | An $(n+1)$-toroid is a quotient of a tessellation of the $n$-dimensional
Euclidean space with a lattice group. Toroids are generalizations of maps in
the torus on higher dimensions and also provide examples of abstract polytopes.
Equivelar toroids are those that are induced by regular tessellations. In this
paper we present a classification of equivelar $(n+1)$-toroids with at most $n$
flag-orbits; in particular, we discuss a classification of $2$-orbit toroids of
arbitrary dimension.
| math.CO | an n1toroid is a quotient of a tessellation of the ndimensional euclidean space with a lattice group toroids are generalizations of maps in the torus on higher dimensions and also provide examples of abstract polytopes equivelar toroids are those that are induced by regular tessellations in this paper we present a classification of equivelar n1toroids with at most n flagorbits in particular we discuss a classification of 2orbit toroids of arbitrary dimension | [['an', 'n1toroid', 'is', 'a', 'quotient', 'of', 'a', 'tessellation', 'of', 'the', 'ndimensional', 'euclidean', 'space', 'with', 'a', 'lattice', 'group', 'toroids', 'are', 'generalizations', 'of', 'maps', 'in', 'the', 'torus', 'on', 'higher', 'dimensions', 'and', 'also', 'provide', 'examples', 'of', 'abstract', 'polytopes', 'equivelar', 'toroids', 'are', 'those', 'that', 'are', 'induced', 'by', 'regular', 'tessellations', 'in', 'this', 'paper', 'we', 'present', 'a', 'classification', 'of', 'equivelar', 'n1toroids', 'with', 'at', 'most', 'n', 'flagorbits', 'in', 'particular', 'we', 'discuss', 'a', 'classification', 'of', '2orbit', 'toroids', 'of', 'arbitrary', 'dimension']] | [-0.12470138128306987, 0.11350209581302108, -0.03378826410145215, 0.033268951540947826, -0.04217980450451158, -0.08572301095135618, -0.045888862398830985, 0.40101239320052706, -0.20707597817881437, -0.21213892539558205, 0.16779099569649206, -0.31228532287818583, -0.18208722999332932, 0.18728876294757146, -0.1394039709255963, -0.025056442237405132, 0.016661953572453796, 0.07144134809926111, -0.12171649738160921, -0.31081805779915844, 0.393198655364846, -0.003799450212576683, 0.18829152140550423, -0.0008808309954685577, 0.10560784590147111, -0.03795638843776955, -0.01027810890092582, 0.0975497947610152, -0.18045529915221065, 0.18937282262882893, 0.24097781955008057, 0.05599981213352927, 0.1580950548480926, -0.37496650097486767, -0.20620681681548772, 0.1514789855674557, 0.14987068495078795, 0.09129357980935415, -0.0455112088744974, -0.24397862743100393, 0.10605696717655097, -0.13257499912456758, -0.17073406548360767, -0.07890671230278963, 0.055460712845450726, 0.03764633817490244, -0.21582937103601685, -0.0007444523836728995, 0.12817674975140372, 0.14902855941107956, -0.05840591442825246, -0.09926587202842685, -0.06475296962763304, 0.07716741808858849, -0.06441919383106996, 0.05382898543704895, 0.05472930773174849, -0.09400355390381014, -0.17556218466842952, 0.40989294949838, 0.005256314950900665, -0.2857196130452381, 0.18909127122142178, -0.1837939744801733, -0.17944933858065718, 0.11730890050260485, 0.2046627002714229, 0.15966788285236427, -0.06746484507955071, 0.13764823950148877, -0.14321418778727885, 0.06328823520343049, 0.10743944759251199, 0.014900817677540623, 0.17102919028316071, 0.17534233897964915, 0.0948254686402346, 0.24306997629827348, -0.05058197425577142, -0.03358647355512864, -0.3321052714372459, -0.16717619884867166, -0.14788881369421017, 0.07450080864077462, -0.15872019844149085, -0.1760300856920472, 0.3645518955072739, 0.038566355127841234, 0.23305075124338054, 0.08157356616836783, 0.21346963688299275, 0.030158028505958508, 0.050313908370562654, 0.07950839982705488, 0.12585506262257695, 0.11740505842802425, -0.02235429679327037, -0.09794797079529667, -0.0654383998674651, 0.17449146868877005] |
1,802.07838 | Mutual Assent or Unilateral Nomination? A Performance Comparison of
Intersection and Union Rules for Integrating Self-reports of Social
Relationships | Data collection designs for social network studies frequently involve asking
both parties to a potential relationship to report on the presence of absence
of that relationship, resulting in two measurements per potential tie. When
inferring the underlying network, is it better to estimate the tie as present
only when both parties report it as present or do so when either reports it?
Employing several data sets in which network structure can be well-determined
from large numbers of informant reports, we examine the performance of these
two simple rules. Our analysis shows better results for mutual assent across
all data sets examined. A theoretical analysis of estimator performance shows
that the best rule depends on both underlying error rates and the sparsity of
the underlying network, with sparsity driving the superiority of mutual assent
in typical social network settings.
| stat.ME | data collection designs for social network studies frequently involve asking both parties to a potential relationship to report on the presence of absence of that relationship resulting in two measurements per potential tie when inferring the underlying network is it better to estimate the tie as present only when both parties report it as present or do so when either reports it employing several data sets in which network structure can be welldetermined from large numbers of informant reports we examine the performance of these two simple rules our analysis shows better results for mutual assent across all data sets examined a theoretical analysis of estimator performance shows that the best rule depends on both underlying error rates and the sparsity of the underlying network with sparsity driving the superiority of mutual assent in typical social network settings | [['data', 'collection', 'designs', 'for', 'social', 'network', 'studies', 'frequently', 'involve', 'asking', 'both', 'parties', 'to', 'a', 'potential', 'relationship', 'to', 'report', 'on', 'the', 'presence', 'of', 'absence', 'of', 'that', 'relationship', 'resulting', 'in', 'two', 'measurements', 'per', 'potential', 'tie', 'when', 'inferring', 'the', 'underlying', 'network', 'is', 'it', 'better', 'to', 'estimate', 'the', 'tie', 'as', 'present', 'only', 'when', 'both', 'parties', 'report', 'it', 'as', 'present', 'or', 'do', 'so', 'when', 'either', 'reports', 'it', 'employing', 'several', 'data', 'sets', 'in', 'which', 'network', 'structure', 'can', 'be', 'welldetermined', 'from', 'large', 'numbers', 'of', 'informant', 'reports', 'we', 'examine', 'the', 'performance', 'of', 'these', 'two', 'simple', 'rules', 'our', 'analysis', 'shows', 'better', 'results', 'for', 'mutual', 'assent', 'across', 'all', 'data', 'sets', 'examined', 'a', 'theoretical', 'analysis', 'of', 'estimator', 'performance', 'shows', 'that', 'the', 'best', 'rule', 'depends', 'on', 'both', 'underlying', 'error', 'rates', 'and', 'the', 'sparsity', 'of', 'the', 'underlying', 'network', 'with', 'sparsity', 'driving', 'the', 'superiority', 'of', 'mutual', 'assent', 'in', 'typical', 'social', 'network', 'settings']] | [-0.1198649674559525, 0.0022634040341591058, -0.04420844163151755, 0.07665126840668339, -0.09100436903468832, -0.1454078362431323, 0.10986143555424675, 0.41454824381440447, -0.2501914904763301, -0.35008836105006974, 0.10816773426115, -0.28469900525701436, -0.1968244930423047, 0.1989917919584685, -0.059428218812884195, 0.024257478506668755, 0.11058295197258501, 0.05931970154515643, -0.03148123050661947, -0.27913866740941623, 0.3299111418689237, 0.0537862458900697, 0.34511907582265744, 0.03928297189481057, 0.06054191161335135, 0.029837782498098153, -0.04499389273721887, 0.026457993840069874, -0.08558497100739919, 0.13006338313140947, 0.2508134776118981, 0.19679780249767329, 0.30671366659310256, -0.41808287295229407, -0.2119970311599689, 0.11170807542225374, 0.11470834330480167, 0.0821918894467619, -0.011886496824023408, -0.26277951214739215, 0.07637006540080883, -0.1422448396375673, -0.03205703504753056, -0.11528766346716599, -0.018023375659654645, 0.052867104297679296, -0.2940029136088265, 0.08518901760217504, 0.0360268727214872, 0.08937493565262876, -0.03323546479341399, -0.1342317182638183, -0.009374533923329327, 0.17816369170706847, 0.07818208427499115, -0.01356967801288904, 0.12441441182897467, -0.12986163415041738, -0.14666132163931278, 0.35514433374223503, -0.03298064960720207, -0.19035625655838437, 0.20755038030303852, -0.1621514691201889, -0.138546190423675, 0.06938706677528503, 0.19640599290057476, 0.04568828492209423, -0.16301053862685955, -0.017329001381227314, -0.06741076263774565, 0.2102780405809914, 0.022967724308398538, 0.056981017580255866, 0.14664905024962366, 0.19117471296002791, 0.055006941836124854, 0.10841841903680503, -0.09123389333135624, -0.10492060961458238, -0.25222670724885404, -0.09379181641059509, -0.19520567850955506, 0.007211493554295621, -0.1312091310264541, -0.13149697279415862, 0.36926985687265795, 0.18625921358698574, 0.22077741598110626, 0.057769608622091226, 0.3118492996023185, 0.023423054851119177, 0.06579458507695708, 0.07358605339549536, 0.24422970910867056, 0.07160782754637193, 0.0791066918063207, -0.18987195430309983, 0.14447013745624301, -0.017606462058408753] |
1,802.07839 | CoVeR: Learning Covariate-Specific Vector Representations with Tensor
Decompositions | Word embedding is a useful approach to capture co-occurrence structures in
large text corpora. However, in addition to the text data itself, we often have
additional covariates associated with individual corpus documents---e.g. the
demographic of the author, time and venue of publication---and we would like
the embedding to naturally capture this information. We propose CoVeR, a new
tensor decomposition model for vector embeddings with covariates. CoVeR jointly
learns a \emph{base} embedding for all the words as well as a weighted diagonal
matrix to model how each covariate affects the base embedding. To obtain author
or venue-specific embedding, for example, we can then simply multiply the base
embedding by the associated transformation matrix. The main advantages of our
approach are data efficiency and interpretability of the covariate
transformation. Our experiments demonstrate that our joint model learns
substantially better covariate-specific embeddings compared to the standard
approach of learning a separate embedding for each covariate using only the
relevant subset of data, as well as other related methods. Furthermore, CoVeR
encourages the embeddings to be "topic-aligned" in that the dimensions have
specific independent meanings. This allows our covariate-specific embeddings to
be compared by topic, enabling downstream differential analysis. We empirically
evaluate the benefits of our algorithm on datasets, and demonstrate how it can
be used to address many natural questions about covariate effects.
Accompanying code to this paper can be found at
http://github.com/kjtian/CoVeR.
| cs.CL | word embedding is a useful approach to capture cooccurrence structures in large text corpora however in addition to the text data itself we often have additional covariates associated with individual corpus documentseg the demographic of the author time and venue of publicationand we would like the embedding to naturally capture this information we propose cover a new tensor decomposition model for vector embeddings with covariates cover jointly learns a emphbase embedding for all the words as well as a weighted diagonal matrix to model how each covariate affects the base embedding to obtain author or venuespecific embedding for example we can then simply multiply the base embedding by the associated transformation matrix the main advantages of our approach are data efficiency and interpretability of the covariate transformation our experiments demonstrate that our joint model learns substantially better covariatespecific embeddings compared to the standard approach of learning a separate embedding for each covariate using only the relevant subset of data as well as other related methods furthermore cover encourages the embeddings to be topicaligned in that the dimensions have specific independent meanings this allows our covariatespecific embeddings to be compared by topic enabling downstream differential analysis we empirically evaluate the benefits of our algorithm on datasets and demonstrate how it can be used to address many natural questions about covariate effects accompanying code to this paper can be found at httpgithubcomkjtiancover | [['word', 'embedding', 'is', 'a', 'useful', 'approach', 'to', 'capture', 'cooccurrence', 'structures', 'in', 'large', 'text', 'corpora', 'however', 'in', 'addition', 'to', 'the', 'text', 'data', 'itself', 'we', 'often', 'have', 'additional', 'covariates', 'associated', 'with', 'individual', 'corpus', 'documentseg', 'the', 'demographic', 'of', 'the', 'author', 'time', 'and', 'venue', 'of', 'publicationand', 'we', 'would', 'like', 'the', 'embedding', 'to', 'naturally', 'capture', 'this', 'information', 'we', 'propose', 'cover', 'a', 'new', 'tensor', 'decomposition', 'model', 'for', 'vector', 'embeddings', 'with', 'covariates', 'cover', 'jointly', 'learns', 'a', 'emphbase', 'embedding', 'for', 'all', 'the', 'words', 'as', 'well', 'as', 'a', 'weighted', 'diagonal', 'matrix', 'to', 'model', 'how', 'each', 'covariate', 'affects', 'the', 'base', 'embedding', 'to', 'obtain', 'author', 'or', 'venuespecific', 'embedding', 'for', 'example', 'we', 'can', 'then', 'simply', 'multiply', 'the', 'base', 'embedding', 'by', 'the', 'associated', 'transformation', 'matrix', 'the', 'main', 'advantages', 'of', 'our', 'approach', 'are', 'data', 'efficiency', 'and', 'interpretability', 'of', 'the', 'covariate', 'transformation', 'our', 'experiments', 'demonstrate', 'that', 'our', 'joint', 'model', 'learns', 'substantially', 'better', 'covariatespecific', 'embeddings', 'compared', 'to', 'the', 'standard', 'approach', 'of', 'learning', 'a', 'separate', 'embedding', 'for', 'each', 'covariate', 'using', 'only', 'the', 'relevant', 'subset', 'of', 'data', 'as', 'well', 'as', 'other', 'related', 'methods', 'furthermore', 'cover', 'encourages', 'the', 'embeddings', 'to', 'be', 'topicaligned', 'in', 'that', 'the', 'dimensions', 'have', 'specific', 'independent', 'meanings', 'this', 'allows', 'our', 'covariatespecific', 'embeddings', 'to', 'be', 'compared', 'by', 'topic', 'enabling', 'downstream', 'differential', 'analysis', 'we', 'empirically', 'evaluate', 'the', 'benefits', 'of', 'our', 'algorithm', 'on', 'datasets', 'and', 'demonstrate', 'how', 'it', 'can', 'be', 'used', 'to', 'address', 'many', 'natural', 'questions', 'about', 'covariate', 'effects', 'accompanying', 'code', 'to', 'this', 'paper', 'can', 'be', 'found', 'at', 'httpgithubcomkjtiancover']] | [0.00167721764701936, 0.03129356050863862, -0.07075529900069039, 0.1080251185151024, -0.15864095971402195, -0.13757334254785544, 0.056439000923290024, 0.41810362140027185, -0.33252618341810175, -0.31418508680537344, 0.08330915175637023, -0.3073194349009363, -0.1736497208527807, 0.1755358822294511, -0.11372242102192508, 0.027475054661432904, 0.09917672394399737, 0.08247447929655512, -0.057881816676300435, -0.2887926007103589, 0.34080525057597294, 0.03478816212879287, 0.3134192844397492, 0.015370389802588357, 0.11702521974790013, -0.006878125324017471, -0.07061243961979118, 0.026863783854577276, -0.06316342738385881, 0.1706402409532004, 0.3318259989687552, 0.2049365846866729, 0.2746700879724489, -0.37335087895807295, -0.25993719881193506, 0.09917160585729612, 0.15690106705038084, 0.11565980981265764, 0.002952562659047544, -0.3135535859026843, 0.08467956006630427, -0.17723446301288076, 0.007679419745173719, -0.17016999470587407, -0.0302183428261843, 0.01159213784771661, -0.29259145861802, 0.03396525175734294, 0.0908893742865055, 0.004020734387837972, -0.05108234047294698, -0.1233307801414695, 0.018802318232547906, 0.170574908848438, 0.06547640821120392, 0.05697728451600091, 0.10892003674267067, -0.09209973330787358, -0.12230458872392774, 0.3761925003180901, -0.07214079733627538, -0.2676385299488902, 0.16294973540223306, -0.08472227527035607, -0.1475525425064067, 0.05514371949558457, 0.22658969524006048, 0.07902403460712068, -0.14279718816487325, 0.04636309159712659, -0.06596507910432087, 0.1893680798717671, 0.056388331785177194, -0.0030132281293885573, 0.15414097321116263, 0.20518053972058825, 0.03227607230526498, 0.13273403814709228, -0.08164135291913731, -0.0463617752554516, -0.25527944539984065, -0.1487932783903347, -0.16066136613126017, -0.009508111109025776, -0.14234784918326315, -0.12807399485260249, 0.43161417183362777, 0.22146218334538087, 0.25314567626583284, 0.06742663402110338, 0.3027955076326099, 0.038022996875871386, 0.11509797328048282, 0.05825043107796874, 0.11733649837680989, 0.0550091252848506, 0.06650146851316094, -0.14796095515911778, 0.10132853052578866, 0.05746224340568814] |
1,802.0784 | CECT: Computationally Efficient Congestion-avoidance and Traffic
Engineering in Software-defined Cloud Data Centers | The proliferation of cloud data center applications and network function
virtualization (NFV) boosts dynamic and QoS dependent traffic into the data
centers network. Currently, lots of network routing protocols are requirement
agnostic, while other QoS-aware protocols are computationally complex and
inefficient for small flows. In this paper, a computationally efficient
congestion avoidance scheme, called CECT, for software-defined cloud data
centers is proposed. The proposed algorithm, CECT, not only minimizes network
congestion but also reallocates the resources based on the flow requirements.
To this end, we use a routing architecture to reconfigure the network resources
triggered by two events: 1) the elapsing of a predefined time interval, or, 2)
the occurrence of congestion. Moreover, a forwarding table entries compression
technique is used to reduce the computational complexity of CECT. In this way,
we mathematically formulate an optimization problem and define a genetic
algorithm to solve the proposed optimization problem. We test the proposed
algorithm on real-world network traffic. Our results show that CECT is
computationally fast and the solution is feasible in all cases. In order to
evaluate our algorithm in term of throughput, CECT is compared with ECMP (where
the shortest path algorithm is used as the cost function). Simulation results
confirm that the throughput obtained by running CECT is improved up to 3x
compared to ECMP while packet loss is decreased up to 2x.
| cs.NI | the proliferation of cloud data center applications and network function virtualization nfv boosts dynamic and qos dependent traffic into the data centers network currently lots of network routing protocols are requirement agnostic while other qosaware protocols are computationally complex and inefficient for small flows in this paper a computationally efficient congestion avoidance scheme called cect for softwaredefined cloud data centers is proposed the proposed algorithm cect not only minimizes network congestion but also reallocates the resources based on the flow requirements to this end we use a routing architecture to reconfigure the network resources triggered by two events 1 the elapsing of a predefined time interval or 2 the occurrence of congestion moreover a forwarding table entries compression technique is used to reduce the computational complexity of cect in this way we mathematically formulate an optimization problem and define a genetic algorithm to solve the proposed optimization problem we test the proposed algorithm on realworld network traffic our results show that cect is computationally fast and the solution is feasible in all cases in order to evaluate our algorithm in term of throughput cect is compared with ecmp where the shortest path algorithm is used as the cost function simulation results confirm that the throughput obtained by running cect is improved up to 3x compared to ecmp while packet loss is decreased up to 2x | [['the', 'proliferation', 'of', 'cloud', 'data', 'center', 'applications', 'and', 'network', 'function', 'virtualization', 'nfv', 'boosts', 'dynamic', 'and', 'qos', 'dependent', 'traffic', 'into', 'the', 'data', 'centers', 'network', 'currently', 'lots', 'of', 'network', 'routing', 'protocols', 'are', 'requirement', 'agnostic', 'while', 'other', 'qosaware', 'protocols', 'are', 'computationally', 'complex', 'and', 'inefficient', 'for', 'small', 'flows', 'in', 'this', 'paper', 'a', 'computationally', 'efficient', 'congestion', 'avoidance', 'scheme', 'called', 'cect', 'for', 'softwaredefined', 'cloud', 'data', 'centers', 'is', 'proposed', 'the', 'proposed', 'algorithm', 'cect', 'not', 'only', 'minimizes', 'network', 'congestion', 'but', 'also', 'reallocates', 'the', 'resources', 'based', 'on', 'the', 'flow', 'requirements', 'to', 'this', 'end', 'we', 'use', 'a', 'routing', 'architecture', 'to', 'reconfigure', 'the', 'network', 'resources', 'triggered', 'by', 'two', 'events', '1', 'the', 'elapsing', 'of', 'a', 'predefined', 'time', 'interval', 'or', '2', 'the', 'occurrence', 'of', 'congestion', 'moreover', 'a', 'forwarding', 'table', 'entries', 'compression', 'technique', 'is', 'used', 'to', 'reduce', 'the', 'computational', 'complexity', 'of', 'cect', 'in', 'this', 'way', 'we', 'mathematically', 'formulate', 'an', 'optimization', 'problem', 'and', 'define', 'a', 'genetic', 'algorithm', 'to', 'solve', 'the', 'proposed', 'optimization', 'problem', 'we', 'test', 'the', 'proposed', 'algorithm', 'on', 'realworld', 'network', 'traffic', 'our', 'results', 'show', 'that', 'cect', 'is', 'computationally', 'fast', 'and', 'the', 'solution', 'is', 'feasible', 'in', 'all', 'cases', 'in', 'order', 'to', 'evaluate', 'our', 'algorithm', 'in', 'term', 'of', 'throughput', 'cect', 'is', 'compared', 'with', 'ecmp', 'where', 'the', 'shortest', 'path', 'algorithm', 'is', 'used', 'as', 'the', 'cost', 'function', 'simulation', 'results', 'confirm', 'that', 'the', 'throughput', 'obtained', 'by', 'running', 'cect', 'is', 'improved', 'up', 'to', '3x', 'compared', 'to', 'ecmp', 'while', 'packet', 'loss', 'is', 'decreased', 'up', 'to', '2x']] | [-0.17523663949188112, -0.006766803774098662, -0.03711794682229603, 0.06321706370519158, -0.07933421731494102, -0.17544705025544058, 0.10524491187295228, 0.4442944110238126, -0.2867920660501113, -0.3212700195893246, 0.10479974918780499, -0.23092898904620338, -0.18642079592245864, 0.19467213661638588, -0.14051493409663504, 0.13217088528160406, 0.11171216227272193, -0.008308895007108472, -0.004631128735127277, -0.2943105566934849, 0.2540589432158283, 0.0815658119868853, 0.36008241599691765, 0.0769309113480371, 0.10073373633193634, -0.033457837479155775, -0.0016486295171489473, 0.0019176397083405, -0.056489796807324764, 0.13179662603943143, 0.27549997053782654, 0.2298974253457605, 0.30496140773798935, -0.450681531718666, -0.22165002076404303, 0.10000146988750203, 0.16329225088598573, 0.07084520753414836, -0.01811993937008083, -0.2581340568472764, 0.1436806268570113, -0.21070953822761243, -0.0598254544030559, -0.0684808771880593, -0.016122455351121192, 0.013371172368871547, -0.3056219349361657, 0.00039937142498404555, -0.05087041429942474, -0.025466730327545, -0.036788401175207194, -0.06078924165090679, 0.021552132396858985, 0.11683571205893324, 0.014722148214267301, 0.07966339423260901, 0.1500607483612839, -0.10878857130822846, -0.1561055216713742, 0.40630006120980916, 0.02652240673601877, -0.1868305066558865, 0.14923045009761285, 0.0018547903699592488, -0.13549671767603805, 0.16918610654621652, 0.22519329171544605, 0.09866936493199319, -0.17315685674735246, 0.007982334231980661, -0.010460180857210486, 0.16931103776732925, 0.051230467561254045, 0.03025806484090156, 0.06471434451451127, 0.249282873248116, 0.1763194460046569, 0.14437176752237843, -0.0805499436797358, -0.11898166627075366, -0.18720213139230119, -0.13630636188255657, -0.21406661455330322, -0.026165684404402003, -0.11187075667027914, -0.11513095382958584, 0.3664429474110063, 0.19310856609133356, 0.17532236887823924, 0.13866414097719826, 0.4178003611939078, 0.07641881917671915, 0.11453296206647272, 0.1863713107096763, 0.14126051490269934, 0.0012660058761996748, 0.160477460488307, -0.22454410482272838, 0.10112462821936267, 0.03773757057414124] |
1,802.07841 | Topological insulator materials for advanced optoelectronic devices | Topological insulators are quantum materials that have an insulating bulk
state and a topologically protected metallic surface state with spin and
momentum helical locking and a Dirac-like band structure. Unique and
fascinating electronic properties, such as the quantum spin Hall effect,
quantum anomalous Hall effect, and topological magnetoelectric effect, as well
as magnetic monopole images and Majorana fermions, have been observed in the
topological insulator materials. With these unique properties, topological
insulator materials have great potential applications in spintronics and
quantum information processing, as well as magnetoelectric devices with higher
efficiency and lower energy consumption. On the other hand, topological
insulator materials also exhibit a number of excellent optical properties,
including Kerr and Faraday rotation, ultrahigh bulk refractive index,
near-infrared frequency transparency, unusual electromagnetic scattering, and
ultra-broadband surface plasmon resonances. Specifically, Dirac plasmon
excitations have been observed in Bi2Se3 micro-ribbon arrays at THz
frequencies. Ultraviolet and visible frequency plasmonics have been observed in
nanoslit and nanocone arrays of Bi1.5Sb0.5Te1.8Se1.2 crystals. High
transparency has been observed in Bi2Se3 nanoplates. An ultrahigh refractive
index has been observed in bulk Bi1.5Sb0.5Te1.8Se1.2 crystals as well as in
Sb2Te3 thin films. These excellent optical properties mean that topological
insulator materials are suitable for various optoelectronic devices, including
plasmonic solar cells, ultrathin holograms, plasmonic and Fresnel lens,
broadband photodetectors, and nanoscale waveguides. In this chapter, we focus
on the excellent electronic and optical properties of topological insulator
materials and their wide applications in advanced optoelectronic devices.
| physics.optics cond-mat.mes-hall | topological insulators are quantum materials that have an insulating bulk state and a topologically protected metallic surface state with spin and momentum helical locking and a diraclike band structure unique and fascinating electronic properties such as the quantum spin hall effect quantum anomalous hall effect and topological magnetoelectric effect as well as magnetic monopole images and majorana fermions have been observed in the topological insulator materials with these unique properties topological insulator materials have great potential applications in spintronics and quantum information processing as well as magnetoelectric devices with higher efficiency and lower energy consumption on the other hand topological insulator materials also exhibit a number of excellent optical properties including kerr and faraday rotation ultrahigh bulk refractive index nearinfrared frequency transparency unusual electromagnetic scattering and ultrabroadband surface plasmon resonances specifically dirac plasmon excitations have been observed in bi2se3 microribbon arrays at thz frequencies ultraviolet and visible frequency plasmonics have been observed in nanoslit and nanocone arrays of bi15sb05te18se12 crystals high transparency has been observed in bi2se3 nanoplates an ultrahigh refractive index has been observed in bulk bi15sb05te18se12 crystals as well as in sb2te3 thin films these excellent optical properties mean that topological insulator materials are suitable for various optoelectronic devices including plasmonic solar cells ultrathin holograms plasmonic and fresnel lens broadband photodetectors and nanoscale waveguides in this chapter we focus on the excellent electronic and optical properties of topological insulator materials and their wide applications in advanced optoelectronic devices | [['topological', 'insulators', 'are', 'quantum', 'materials', 'that', 'have', 'an', 'insulating', 'bulk', 'state', 'and', 'a', 'topologically', 'protected', 'metallic', 'surface', 'state', 'with', 'spin', 'and', 'momentum', 'helical', 'locking', 'and', 'a', 'diraclike', 'band', 'structure', 'unique', 'and', 'fascinating', 'electronic', 'properties', 'such', 'as', 'the', 'quantum', 'spin', 'hall', 'effect', 'quantum', 'anomalous', 'hall', 'effect', 'and', 'topological', 'magnetoelectric', 'effect', 'as', 'well', 'as', 'magnetic', 'monopole', 'images', 'and', 'majorana', 'fermions', 'have', 'been', 'observed', 'in', 'the', 'topological', 'insulator', 'materials', 'with', 'these', 'unique', 'properties', 'topological', 'insulator', 'materials', 'have', 'great', 'potential', 'applications', 'in', 'spintronics', 'and', 'quantum', 'information', 'processing', 'as', 'well', 'as', 'magnetoelectric', 'devices', 'with', 'higher', 'efficiency', 'and', 'lower', 'energy', 'consumption', 'on', 'the', 'other', 'hand', 'topological', 'insulator', 'materials', 'also', 'exhibit', 'a', 'number', 'of', 'excellent', 'optical', 'properties', 'including', 'kerr', 'and', 'faraday', 'rotation', 'ultrahigh', 'bulk', 'refractive', 'index', 'nearinfrared', 'frequency', 'transparency', 'unusual', 'electromagnetic', 'scattering', 'and', 'ultrabroadband', 'surface', 'plasmon', 'resonances', 'specifically', 'dirac', 'plasmon', 'excitations', 'have', 'been', 'observed', 'in', 'bi2se3', 'microribbon', 'arrays', 'at', 'thz', 'frequencies', 'ultraviolet', 'and', 'visible', 'frequency', 'plasmonics', 'have', 'been', 'observed', 'in', 'nanoslit', 'and', 'nanocone', 'arrays', 'of', 'bi15sb05te18se12', 'crystals', 'high', 'transparency', 'has', 'been', 'observed', 'in', 'bi2se3', 'nanoplates', 'an', 'ultrahigh', 'refractive', 'index', 'has', 'been', 'observed', 'in', 'bulk', 'bi15sb05te18se12', 'crystals', 'as', 'well', 'as', 'in', 'sb2te3', 'thin', 'films', 'these', 'excellent', 'optical', 'properties', 'mean', 'that', 'topological', 'insulator', 'materials', 'are', 'suitable', 'for', 'various', 'optoelectronic', 'devices', 'including', 'plasmonic', 'solar', 'cells', 'ultrathin', 'holograms', 'plasmonic', 'and', 'fresnel', 'lens', 'broadband', 'photodetectors', 'and', 'nanoscale', 'waveguides', 'in', 'this', 'chapter', 'we', 'focus', 'on', 'the', 'excellent', 'electronic', 'and', 'optical', 'properties', 'of', 'topological', 'insulator', 'materials', 'and', 'their', 'wide', 'applications', 'in', 'advanced', 'optoelectronic', 'devices']] | [-0.176903919588464, 0.2429282507326813, -0.0371461736484586, -0.0011648982341284863, -0.10652710606130616, -0.20046992637799121, 0.011034891562303528, 0.5010866809946796, -0.20797187602729536, -0.336331222964994, 0.015383538990378535, -0.3555666199730088, -0.22297936495257697, 0.2536993534071371, -0.003972072605392896, 0.16569003493680914, -0.07539454161887989, -0.14498200591575974, -0.06155346671779019, -0.13443855761627976, 0.20361586270543436, -0.005649502299153634, 0.3777394875030344, 0.08997638124613634, 0.047591472713975236, -0.048481912727584134, 0.17028359964024276, 0.012880394908521945, -0.1381685631275104, 0.0578177382802096, 0.3105447822400796, -0.19487156721103627, 0.15579143436722612, -0.48259004174809284, -0.29137380121974277, -0.031036030518316694, 0.12702956676463753, 0.11128076379342626, -0.17897708893870004, -0.3169883493780314, 0.07369755103330439, -0.15785970409827618, -0.0938150042210206, -0.10620761392638087, 0.014313278237144308, -0.01979345900666279, -0.11935245216833816, 0.01115879753184951, 0.006558137076111355, 0.13755680087100094, -0.0946014837856031, -0.128702070529107, -0.12590128772959966, 0.05789257248591942, -0.0052242757364486655, -0.03999469539169998, 0.18621635850092086, -0.17750294919727214, -0.19209950314980234, 0.39079547850584884, -0.04139106308336219, -0.07163447190153722, 0.18579439482661353, -0.20858335418452043, -0.009396167382753144, 0.1646091921099772, 0.15865527713637373, 0.07654370690773551, -0.08898697339391219, 0.11029931379986617, 0.0034343820278688025, 0.16354504415260937, 0.08228476293540249, 0.31053707986526813, 0.3469836289334732, 0.20358988809554526, 0.029006575646538597, 0.1289035234331095, -0.12581064242015902, 0.0923509289578457, -0.1537356881191954, -0.26117423896988234, -0.28413078487695503, 0.10193061576186059, -0.06686272614697372, -0.251018921933913, 0.42514421336042385, 0.11383649746227699, 0.08094916729508744, -0.13197645648566927, 0.2811602101835888, 0.08778183257721442, 0.10400898813095409, -0.029614429312884265, 0.31149976227316073, 0.21144267788234478, 0.16782215256541047, -0.24732750996093575, 0.015640445415435047, -0.024853711730490127] |
1,802.07842 | Convergent Actor-Critic Algorithms Under Off-Policy Training and
Function Approximation | We present the first class of policy-gradient algorithms that work with both
state-value and policy function-approximation, and are guaranteed to converge
under off-policy training. Our solution targets problems in reinforcement
learning where the action representation adds to the-curse-of-dimensionality;
that is, with continuous or large action sets, thus making it infeasible to
estimate state-action value functions (Q functions). Using state-value
functions helps to lift the curse and as a result naturally turn our
policy-gradient solution into classical Actor-Critic architecture whose Actor
uses state-value function for the update. Our algorithms, Gradient Actor-Critic
and Emphatic Actor-Critic, are derived based on the exact gradient of averaged
state-value function objective and thus are guaranteed to converge to its
optimal solution, while maintaining all the desirable properties of classical
Actor-Critic methods with no additional hyper-parameters. To our knowledge,
this is the first time that convergent off-policy learning methods have been
extended to classical Actor-Critic methods with function approximation.
| cs.AI | we present the first class of policygradient algorithms that work with both statevalue and policy functionapproximation and are guaranteed to converge under offpolicy training our solution targets problems in reinforcement learning where the action representation adds to thecurseofdimensionality that is with continuous or large action sets thus making it infeasible to estimate stateaction value functions q functions using statevalue functions helps to lift the curse and as a result naturally turn our policygradient solution into classical actorcritic architecture whose actor uses statevalue function for the update our algorithms gradient actorcritic and emphatic actorcritic are derived based on the exact gradient of averaged statevalue function objective and thus are guaranteed to converge to its optimal solution while maintaining all the desirable properties of classical actorcritic methods with no additional hyperparameters to our knowledge this is the first time that convergent offpolicy learning methods have been extended to classical actorcritic methods with function approximation | [['we', 'present', 'the', 'first', 'class', 'of', 'policygradient', 'algorithms', 'that', 'work', 'with', 'both', 'statevalue', 'and', 'policy', 'functionapproximation', 'and', 'are', 'guaranteed', 'to', 'converge', 'under', 'offpolicy', 'training', 'our', 'solution', 'targets', 'problems', 'in', 'reinforcement', 'learning', 'where', 'the', 'action', 'representation', 'adds', 'to', 'thecurseofdimensionality', 'that', 'is', 'with', 'continuous', 'or', 'large', 'action', 'sets', 'thus', 'making', 'it', 'infeasible', 'to', 'estimate', 'stateaction', 'value', 'functions', 'q', 'functions', 'using', 'statevalue', 'functions', 'helps', 'to', 'lift', 'the', 'curse', 'and', 'as', 'a', 'result', 'naturally', 'turn', 'our', 'policygradient', 'solution', 'into', 'classical', 'actorcritic', 'architecture', 'whose', 'actor', 'uses', 'statevalue', 'function', 'for', 'the', 'update', 'our', 'algorithms', 'gradient', 'actorcritic', 'and', 'emphatic', 'actorcritic', 'are', 'derived', 'based', 'on', 'the', 'exact', 'gradient', 'of', 'averaged', 'statevalue', 'function', 'objective', 'and', 'thus', 'are', 'guaranteed', 'to', 'converge', 'to', 'its', 'optimal', 'solution', 'while', 'maintaining', 'all', 'the', 'desirable', 'properties', 'of', 'classical', 'actorcritic', 'methods', 'with', 'no', 'additional', 'hyperparameters', 'to', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'time', 'that', 'convergent', 'offpolicy', 'learning', 'methods', 'have', 'been', 'extended', 'to', 'classical', 'actorcritic', 'methods', 'with', 'function', 'approximation']] | [-0.014689845976730188, -0.011595365939040978, -0.1441024502335737, 0.06611725848556185, -0.14915522030865153, -0.1598249841822932, 0.06897839851968456, 0.4802176665219789, -0.31256000902193287, -0.29377137039788065, 0.09237008431305488, -0.22989775663396964, -0.1899842457321938, 0.16039907020671915, -0.10110650384177765, 0.12997976084821858, 0.08615877606129894, 0.020207186251257857, -0.08697392566905668, -0.2975017190352082, 0.29431994184541205, 0.030306559045178195, 0.2739296163447822, -0.03153019098138126, 0.18652620129209632, -0.02728736977092922, 0.03906186124232287, -0.00949568897485733, -0.0634443356259241, 0.14466898891453941, 0.29294934490540375, 0.21682946254654478, 0.3850863151811063, -0.37632280319929123, -0.17532907291005054, 0.1632104189724972, 0.15988042809379596, 0.06794461662415414, -0.02599371538264677, -0.2910170183579127, 0.10956408995921568, -0.13383375807510067, -0.049959104703739286, -0.1761398924111078, -0.043873192922522626, 0.06642816977536616, -0.3657106204455097, 0.011720582121051848, 0.07938034365419298, -0.026385481075073283, -0.12128687369714801, -0.15537544678586224, 0.041996759527052445, 0.12128054499160498, 0.09831040370898943, 0.11921132316812873, 0.1285204934111486, -0.12061803753642986, -0.14123462907969953, 0.30932799915472664, -0.06764103100945552, -0.23576147140314183, 0.19082181099724646, -0.0350143225180606, -0.12216771140694618, 0.1121435042625914, 0.1936797155874471, 0.19699726589024066, -0.14011241352185608, 0.08607154919727085, -0.035439510953923066, 0.1343658141201983, -0.005374795598909259, 0.006284072727430612, 0.0587555877926449, 0.14674147319048644, 0.14963280476474514, 0.13154743227055102, -0.0050497017146941894, -0.19104688214448592, -0.25132547387232385, -0.10437014314966897, -0.17804899267929916, -0.00339502885316809, -0.11844153708108934, -0.19730007295807203, 0.34248467194537324, 0.205673330007509, 0.18889901410167417, 0.206439966019243, 0.34796838271431624, 0.1404763687766778, 0.09698590813825528, 0.1548103890940547, 0.2151929028177013, 0.05777627224723498, 0.08411550651149204, -0.20952512725101163, 0.13680974221749542, 0.13296740628002832] |
1,802.07843 | Concise Complexity Analyses for Trust-Region Methods | Concise complexity analyses are presented for simple trust region algorithms
for solving unconstrained optimization problems. In contrast to a traditional
trust region algorithm, the algorithms considered in this paper require certain
control over the choice of trust region radius after any successful iteration.
The analyses highlight the essential algorithm components required to obtain
certain complexity bounds. In addition, a new update strategy for the trust
region radius is proposed that offers a second-order complexity bound.
| math.OC | concise complexity analyses are presented for simple trust region algorithms for solving unconstrained optimization problems in contrast to a traditional trust region algorithm the algorithms considered in this paper require certain control over the choice of trust region radius after any successful iteration the analyses highlight the essential algorithm components required to obtain certain complexity bounds in addition a new update strategy for the trust region radius is proposed that offers a secondorder complexity bound | [['concise', 'complexity', 'analyses', 'are', 'presented', 'for', 'simple', 'trust', 'region', 'algorithms', 'for', 'solving', 'unconstrained', 'optimization', 'problems', 'in', 'contrast', 'to', 'a', 'traditional', 'trust', 'region', 'algorithm', 'the', 'algorithms', 'considered', 'in', 'this', 'paper', 'require', 'certain', 'control', 'over', 'the', 'choice', 'of', 'trust', 'region', 'radius', 'after', 'any', 'successful', 'iteration', 'the', 'analyses', 'highlight', 'the', 'essential', 'algorithm', 'components', 'required', 'to', 'obtain', 'certain', 'complexity', 'bounds', 'in', 'addition', 'a', 'new', 'update', 'strategy', 'for', 'the', 'trust', 'region', 'radius', 'is', 'proposed', 'that', 'offers', 'a', 'secondorder', 'complexity', 'bound']] | [-0.12673366654664278, -0.04077363521636774, -0.0677872483432293, 0.09052150384833416, -0.11347605980932712, -0.2006362200466295, 0.12133427314615498, 0.37749816332012415, -0.22888389439632495, -0.32692247512439887, 0.10973590539768338, -0.17026349999631443, -0.15801865939050913, 0.1979370418501397, -0.12025986393447965, 0.10205031398683787, 0.07395906499276558, 0.04749809689819813, -0.07422162706032395, -0.2925462681489686, 0.26030881827076274, 0.070911919636031, 0.2776588051641981, 0.06353544505933921, 0.07719711591800053, 0.00034874696905414263, -0.017062937344113984, 0.04580967862159014, -0.17778487043193308, 0.14910163977183402, 0.33919790383428333, 0.23456591853871941, 0.3859493577852845, -0.3611014280964931, -0.17764774208888412, 0.11948550305018822, 0.21173438993903498, 0.09486824167271456, -0.05369744392732779, -0.23417548646529515, 0.06138031446064512, -0.14197303117563329, -0.10922341902429859, -0.08084264288345973, -0.058006589636206626, -0.0241951255997022, -0.32688623188839605, 0.016423037331551312, 0.02722180004697293, 0.018329582860072455, -0.028219417327394088, -0.1418013545870781, 0.10364475693553686, 0.09682010479892293, -0.0002838727614531914, 0.0042000804158548516, 0.16140157221506038, -0.10891831837284069, -0.13441084989657004, 0.3350317635635535, 0.03934449545418223, -0.19784242431322732, 0.13255770822366078, -0.03325744115592291, -0.1883699518380066, 0.19516010410462817, 0.2102233245848523, 0.13448726496348778, -0.13705822405715784, 0.1197846757248044, -0.033584215183897564, 0.1963887671381235, 0.021320023220032455, 0.049125854751716054, 0.1080122450646013, 0.19407371076444785, 0.17722822462121257, 0.11808772444104156, -0.022871828097850086, -0.1565720131372412, -0.3042806665102641, -0.12487779279317086, -0.1348211572226137, -0.13251517898092668, -0.15510690877834957, -0.1273300115003561, 0.35962432106335956, 0.16616031783322494, 0.18375443134612093, 0.12121478059018652, 0.37204631671309474, 0.09411338903009892, 0.07565553188323974, 0.1540752568561584, 0.250238470317175, 0.08843455192943414, 0.1389009922478969, -0.20598458020326993, 0.14883584385737778, 0.12746323735142748] |
1,802.07844 | Fast Ewald summation for Green's functions of Stokes flow in a
half-space | Recently, Gimbutas et al derived an elegant representation for the Green's
functions of Stokes flow in a half-space. We present a fast summation method
for sums involving these half-space Green's functions (stokeslets, stresslets
and rotlets) that consolidates and builds on the work by Klinteberg et al for
the corresponding free-space Green's functions. The fast method is based on two
main ingredients: The Ewald decomposition and subsequent use of FFTs. The Ewald
decomposition recasts the sum into a sum of two exponentially decaying series:
one in real-space (short-range interactions) and one in Fourier-space
(long-range interactions) with the convergence of each series controlled by a
common parameter. The evaluation of short-range interactions is accelerated by
restricting computations to neighbours within a specified distance, while the
use of FFTs accelerates the computations in Fourier-space thus accelerating the
overall sum. We demonstrate that while the method incurs extra costs for the
half-space in comparison to the free-space evaluation, greater computational
savings is also achieved when compared to their respective direct sums.
| math.NA physics.comp-ph | recently gimbutas et al derived an elegant representation for the greens functions of stokes flow in a halfspace we present a fast summation method for sums involving these halfspace greens functions stokeslets stresslets and rotlets that consolidates and builds on the work by klinteberg et al for the corresponding freespace greens functions the fast method is based on two main ingredients the ewald decomposition and subsequent use of ffts the ewald decomposition recasts the sum into a sum of two exponentially decaying series one in realspace shortrange interactions and one in fourierspace longrange interactions with the convergence of each series controlled by a common parameter the evaluation of shortrange interactions is accelerated by restricting computations to neighbours within a specified distance while the use of ffts accelerates the computations in fourierspace thus accelerating the overall sum we demonstrate that while the method incurs extra costs for the halfspace in comparison to the freespace evaluation greater computational savings is also achieved when compared to their respective direct sums | [['recently', 'gimbutas', 'et', 'al', 'derived', 'an', 'elegant', 'representation', 'for', 'the', 'greens', 'functions', 'of', 'stokes', 'flow', 'in', 'a', 'halfspace', 'we', 'present', 'a', 'fast', 'summation', 'method', 'for', 'sums', 'involving', 'these', 'halfspace', 'greens', 'functions', 'stokeslets', 'stresslets', 'and', 'rotlets', 'that', 'consolidates', 'and', 'builds', 'on', 'the', 'work', 'by', 'klinteberg', 'et', 'al', 'for', 'the', 'corresponding', 'freespace', 'greens', 'functions', 'the', 'fast', 'method', 'is', 'based', 'on', 'two', 'main', 'ingredients', 'the', 'ewald', 'decomposition', 'and', 'subsequent', 'use', 'of', 'ffts', 'the', 'ewald', 'decomposition', 'recasts', 'the', 'sum', 'into', 'a', 'sum', 'of', 'two', 'exponentially', 'decaying', 'series', 'one', 'in', 'realspace', 'shortrange', 'interactions', 'and', 'one', 'in', 'fourierspace', 'longrange', 'interactions', 'with', 'the', 'convergence', 'of', 'each', 'series', 'controlled', 'by', 'a', 'common', 'parameter', 'the', 'evaluation', 'of', 'shortrange', 'interactions', 'is', 'accelerated', 'by', 'restricting', 'computations', 'to', 'neighbours', 'within', 'a', 'specified', 'distance', 'while', 'the', 'use', 'of', 'ffts', 'accelerates', 'the', 'computations', 'in', 'fourierspace', 'thus', 'accelerating', 'the', 'overall', 'sum', 'we', 'demonstrate', 'that', 'while', 'the', 'method', 'incurs', 'extra', 'costs', 'for', 'the', 'halfspace', 'in', 'comparison', 'to', 'the', 'freespace', 'evaluation', 'greater', 'computational', 'savings', 'is', 'also', 'achieved', 'when', 'compared', 'to', 'their', 'respective', 'direct', 'sums']] | [-0.10270580905630733, 0.06652402440377045, -0.07857429107164286, 0.03666046758140014, -0.06560108386911452, -0.07332987679507244, 0.05073044239825597, 0.3668356939529379, -0.26312742489248964, -0.2495481574371683, 0.0483918253057213, -0.2743153852833943, -0.13095238677042564, 0.21086407758605977, 0.017432882319289175, 0.06400293273159839, 0.06697019725529985, -0.043686217876772085, -0.09981242208318276, -0.2626354595222934, 0.2751834651765724, 0.04135960659407305, 0.27512804987191253, 0.061427414043326724, 0.09200621488306558, 0.08350227624636539, -0.07494015712008784, -0.011296481794367234, -0.0773770603874282, 0.1574177989016541, 0.18457661198565004, 0.0807888441662671, 0.316278958772168, -0.4574634959243915, -0.18700351936065338, 0.04412542620363335, 0.19079265643024082, 0.06577805633176909, -0.013087904344623287, -0.2555613491571311, 0.0392872272292152, -0.18259098977838276, -0.09264780176859913, -0.11674469530328431, 0.023543389858395766, 0.06762805517240794, -0.31896313521446606, 0.10728264587779643, 0.043135941212037295, 0.03339446407714577, -0.03628982511969904, -0.14435507248748433, 0.04551141126589341, 0.09789200550118095, 0.02743953431270325, 0.04167244704158017, 0.0792413685075713, -0.11181928330298627, -0.09960068205484386, 0.35011076277517006, -0.0564108289933453, -0.23971587872189104, 0.18892778862606396, -0.09934411320524911, -0.07676169191854018, 0.15299387264319442, 0.14919423351459432, 0.12572212870881866, -0.1365336159629585, 0.08525212645975196, -0.012721568238780354, 0.12310103111138399, 0.09819197136993435, -0.012263171538484819, 0.12192363689907572, 0.10874091408102575, 0.06999423591081391, 0.16296363952710774, -0.027863023732877055, -0.11802286843162482, -0.29626335230740636, -0.17839866331637358, -0.2628477178260007, -0.006282064115459268, -0.12600860418628365, -0.18060322360728276, 0.38845405762620044, 0.1126897610526419, 0.17850060810962917, 0.09919697244397618, 0.3667652917292082, 0.1410553840976773, 0.07654252342287113, 0.08857583863886469, 0.21740957429547877, 0.12481193220609743, 0.06241301138687766, -0.2153914430460921, 0.02180921040672922, 0.1736898292251157] |
1,802.07845 | Detecting Small, Densely Distributed Objects with Filter-Amplifier
Networks and Loss Boosting | Detecting small, densely distributed objects is a significant challenge:
small objects often contain less distinctive information compared to larger
ones, and finer-grained precision of bounding box boundaries are required. In
this paper, we propose two techniques for addressing this problem. First, we
estimate the likelihood that each pixel belongs to an object boundary rather
than predicting coordinates of bounding boxes (as YOLO, Faster-RCNN and SSD
do), by proposing a new architecture called Filter-Amplifier Networks (FANs).
Second, we introduce a technique called Loss Boosting (LB) which attempts to
soften the loss imbalance problem on each image. We test our algorithm on the
problem of detecting electrical components on a new, realistic, diverse dataset
of printed circuit boards (PCBs), as well as the problem of detecting vehicles
in the Vehicle Detection in Aerial Imagery (VEDAI) dataset.
Experiments show that our method works significantly better than current
state-of-the-art algorithms with respect to accuracy, recall and average IoU.
| cs.CV | detecting small densely distributed objects is a significant challenge small objects often contain less distinctive information compared to larger ones and finergrained precision of bounding box boundaries are required in this paper we propose two techniques for addressing this problem first we estimate the likelihood that each pixel belongs to an object boundary rather than predicting coordinates of bounding boxes as yolo fasterrcnn and ssd do by proposing a new architecture called filteramplifier networks fans second we introduce a technique called loss boosting lb which attempts to soften the loss imbalance problem on each image we test our algorithm on the problem of detecting electrical components on a new realistic diverse dataset of printed circuit boards pcbs as well as the problem of detecting vehicles in the vehicle detection in aerial imagery vedai dataset experiments show that our method works significantly better than current stateoftheart algorithms with respect to accuracy recall and average iou | [['detecting', 'small', 'densely', 'distributed', 'objects', 'is', 'a', 'significant', 'challenge', 'small', 'objects', 'often', 'contain', 'less', 'distinctive', 'information', 'compared', 'to', 'larger', 'ones', 'and', 'finergrained', 'precision', 'of', 'bounding', 'box', 'boundaries', 'are', 'required', 'in', 'this', 'paper', 'we', 'propose', 'two', 'techniques', 'for', 'addressing', 'this', 'problem', 'first', 'we', 'estimate', 'the', 'likelihood', 'that', 'each', 'pixel', 'belongs', 'to', 'an', 'object', 'boundary', 'rather', 'than', 'predicting', 'coordinates', 'of', 'bounding', 'boxes', 'as', 'yolo', 'fasterrcnn', 'and', 'ssd', 'do', 'by', 'proposing', 'a', 'new', 'architecture', 'called', 'filteramplifier', 'networks', 'fans', 'second', 'we', 'introduce', 'a', 'technique', 'called', 'loss', 'boosting', 'lb', 'which', 'attempts', 'to', 'soften', 'the', 'loss', 'imbalance', 'problem', 'on', 'each', 'image', 'we', 'test', 'our', 'algorithm', 'on', 'the', 'problem', 'of', 'detecting', 'electrical', 'components', 'on', 'a', 'new', 'realistic', 'diverse', 'dataset', 'of', 'printed', 'circuit', 'boards', 'pcbs', 'as', 'well', 'as', 'the', 'problem', 'of', 'detecting', 'vehicles', 'in', 'the', 'vehicle', 'detection', 'in', 'aerial', 'imagery', 'vedai', 'dataset', 'experiments', 'show', 'that', 'our', 'method', 'works', 'significantly', 'better', 'than', 'current', 'stateoftheart', 'algorithms', 'with', 'respect', 'to', 'accuracy', 'recall', 'and', 'average', 'iou']] | [-0.0830042780790892, 0.028651268057942884, -0.018702501957639565, 0.06619607317230962, -0.09239176854953851, -0.18099718895783418, 0.045295958064064334, 0.41043430421915317, -0.20881270897556461, -0.3809523211622434, 0.08646260023884036, -0.30293325282438516, -0.15095167901569345, 0.20724992563086714, -0.1865691397844333, 0.08918142899432603, 0.13573318672536877, 0.03406981722713491, -0.06383748726730594, -0.25345970929320294, 0.2742939553355944, 0.0523381207223519, 0.30278252901545927, 0.01176352641131315, 0.1426082506320847, -0.045590633237308345, -0.025201921375602288, 0.04542693266267675, -0.06261938694132921, 0.1849598111615218, 0.24536541676349646, 0.16367013724155577, 0.2971346926619755, -0.40292919615855793, -0.20581221464850935, 0.11615787801831912, 0.1543272707513929, 0.10428292292788065, -0.033677375746823945, -0.33235608937304006, 0.11345295438899056, -0.1786401030551216, -0.019987554601363203, -0.07342005252010292, -0.011690460163734708, -0.011439822952025662, -0.24396584135498486, 0.04746109174010557, 0.0619511418980455, 0.049853824928183764, -0.04912334412117215, -0.13781525530651503, 0.059065551089969, 0.14174096833372768, -0.014746893933834203, 0.06808088531830268, 0.1483402379691065, -0.19118182336473288, -0.14405211885429287, 0.38248921451737095, -0.038121996842533215, -0.22234545874185296, 0.1836479826544235, -0.06395450904105601, -0.12095340877296586, 0.11866804463727997, 0.2498682052950113, 0.17554389179860747, -0.15162752748290503, -0.05528881507765904, -0.06632883659810485, 0.18392192425352394, 0.07413036770261885, -0.013432465761510375, 0.1729499930333273, 0.2522768238376753, 0.11920515239786386, 0.16777738445481055, -0.17225585486572478, -0.031260147334679085, -0.22278238160176556, -0.13015879344292522, -0.18871893063857179, -0.046683776770639264, -0.07373180941899621, -0.17415190306781286, 0.3950969388014546, 0.24803315066835946, 0.2223821031066644, 0.09845686999523975, 0.3887333560467156, 0.015281589644895623, 0.11415676440468386, 0.09127118048909443, 0.17500417729005754, -0.004198225487474036, 0.08532960155637923, -0.15518328215218502, 0.06821573646799996, 0.07658190259046463] |
1,802.07846 | Cross-Modality Synthesis from CT to PET using FCN and GAN Networks for
Improved Automated Lesion Detection | In this work we present a novel system for generation of virtual PET images
using CT scans. We combine a fully convolutional network (FCN) with a
conditional generative adversarial network (GAN) to generate simulated PET data
from given input CT data. The synthesized PET can be used for false-positive
reduction in lesion detection solutions. Clinically, such solutions may enable
lesion detection and drug treatment evaluation in a CT-only environment, thus
reducing the need for the more expensive and radioactive PET/CT scan. Our
dataset includes 60 PET/CT scans from Sheba Medical center. We used 23 scans
for training and 37 for testing. Different schemes to achieve the synthesized
output were qualitatively compared. Quantitative evaluation was conducted using
an existing lesion detection software, combining the synthesized PET as a false
positive reduction layer for the detection of malignant lesions in the liver.
Current results look promising showing a 28% reduction in the average false
positive per case from 2.9 to 2.1. The suggested solution is comprehensive and
can be expanded to additional body organs, and different modalities.
| cs.CV cs.AI | in this work we present a novel system for generation of virtual pet images using ct scans we combine a fully convolutional network fcn with a conditional generative adversarial network gan to generate simulated pet data from given input ct data the synthesized pet can be used for falsepositive reduction in lesion detection solutions clinically such solutions may enable lesion detection and drug treatment evaluation in a ctonly environment thus reducing the need for the more expensive and radioactive petct scan our dataset includes 60 petct scans from sheba medical center we used 23 scans for training and 37 for testing different schemes to achieve the synthesized output were qualitatively compared quantitative evaluation was conducted using an existing lesion detection software combining the synthesized pet as a false positive reduction layer for the detection of malignant lesions in the liver current results look promising showing a 28 reduction in the average false positive per case from 29 to 21 the suggested solution is comprehensive and can be expanded to additional body organs and different modalities | [['in', 'this', 'work', 'we', 'present', 'a', 'novel', 'system', 'for', 'generation', 'of', 'virtual', 'pet', 'images', 'using', 'ct', 'scans', 'we', 'combine', 'a', 'fully', 'convolutional', 'network', 'fcn', 'with', 'a', 'conditional', 'generative', 'adversarial', 'network', 'gan', 'to', 'generate', 'simulated', 'pet', 'data', 'from', 'given', 'input', 'ct', 'data', 'the', 'synthesized', 'pet', 'can', 'be', 'used', 'for', 'falsepositive', 'reduction', 'in', 'lesion', 'detection', 'solutions', 'clinically', 'such', 'solutions', 'may', 'enable', 'lesion', 'detection', 'and', 'drug', 'treatment', 'evaluation', 'in', 'a', 'ctonly', 'environment', 'thus', 'reducing', 'the', 'need', 'for', 'the', 'more', 'expensive', 'and', 'radioactive', 'petct', 'scan', 'our', 'dataset', 'includes', '60', 'petct', 'scans', 'from', 'sheba', 'medical', 'center', 'we', 'used', '23', 'scans', 'for', 'training', 'and', '37', 'for', 'testing', 'different', 'schemes', 'to', 'achieve', 'the', 'synthesized', 'output', 'were', 'qualitatively', 'compared', 'quantitative', 'evaluation', 'was', 'conducted', 'using', 'an', 'existing', 'lesion', 'detection', 'software', 'combining', 'the', 'synthesized', 'pet', 'as', 'a', 'false', 'positive', 'reduction', 'layer', 'for', 'the', 'detection', 'of', 'malignant', 'lesions', 'in', 'the', 'liver', 'current', 'results', 'look', 'promising', 'showing', 'a', '28', 'reduction', 'in', 'the', 'average', 'false', 'positive', 'per', 'case', 'from', '29', 'to', '21', 'the', 'suggested', 'solution', 'is', 'comprehensive', 'and', 'can', 'be', 'expanded', 'to', 'additional', 'body', 'organs', 'and', 'different', 'modalities']] | [0.02863215525626558, -0.0030711666063168728, -0.02041863551598856, 0.061738479411799524, -0.03633362850463339, -0.1859948086417173, 0.04594249867207917, 0.4113184988241771, -0.18197943059454574, -0.3517302924073997, 0.11034697585039366, -0.3119839115801599, -0.12916489784611154, 0.21822405176306808, -0.1463278385960422, 0.11519190814043663, 0.1467681031877539, -0.010074628669575885, -0.03620512615327306, -0.26799239167386946, 0.22490345283368623, 0.03480229835325702, 0.35742172063595945, 0.02936186146355052, 0.11546986049774435, -0.03335120747616547, -0.051410778899323835, 0.01411495764134987, -0.04905523153707043, 0.13902347874105106, 0.35298186373340246, 0.22199228878571897, 0.28179951446751755, -0.42918026831600514, -0.23595707658571244, 0.09859090677366175, 0.13884654091691181, 0.12855588639658158, -0.09647202655586384, -0.3532108055687263, 0.1383649628186577, -0.1575369813155243, 0.008842923921993238, -0.09963688595306086, -0.04271157772009978, -0.046714983187714894, -0.33493917183843497, 0.09127996573974004, -0.027604460512855273, 0.11695250892347989, -0.1462155365045236, -0.12445003595992644, 0.013049107538696763, 0.18127588862981434, 0.0023797167205497965, 0.09997807001432768, 0.18754286604268403, -0.1748675828844432, -0.12977301443381042, 0.3065185071472293, -0.027730330507720596, -0.18160317919565627, 0.181244768166845, -0.07744049895875926, -0.10998489058726392, 0.20832590760406236, 0.21815819334474273, 0.15053750314059314, -0.18565083133597354, -0.07335479167757031, 0.035013268380586444, 0.2183682564512195, 0.0852910135497992, -0.08319424196071494, 0.13435199476200446, 0.24315425691639084, -0.026892061575433647, 0.18962097604459302, -0.25584164550163296, 0.02401198253996306, -0.23859353545496517, -0.18118338448787644, -0.1359121988503391, 0.04544752523511777, -0.06868528729616116, -0.1331595553609746, 0.41354299921157034, 0.18605975510957973, 0.1749215338007151, 0.059347344319210335, 0.31883920829785967, -0.0024667816670161896, 0.14370433342958874, -0.008726170299917289, 0.1993536394646113, -1.2032511033888522e-05, 0.12884069553672753, -0.15794939971020466, 0.09948260200627405, 0.01455448577769272] |
1,802.07847 | New class of quasinormal modes of neutron stars in scalar-tensor gravity | Detection of the characteristic spectrum of pulsating neutron stars can be a
powerful tool not only to probe the nuclear equation of state, but also to test
modifications to general relativity. However, the shift in the oscillation
spectrum induced by modified theories of gravity is often small and degenerate
with our ignorance of the equation of state. In this Letter, we show that the
coupling to additional degrees of freedom present in modified theories of
gravity can give rise to new families of modes, with no counterpart in general
relativity, which could be sufficiently well resolved in frequency space as to
allow for a clear detection. We present a realization of this idea by
performing a thorough study of radial oscillations of neutron stars in massless
scalar-tensor theories of gravity. We anticipate astrophysical scenarios where
the presence of this class of quasinormal modes could be probed with
electromagnetic and gravitational wave measurements.
| gr-qc | detection of the characteristic spectrum of pulsating neutron stars can be a powerful tool not only to probe the nuclear equation of state but also to test modifications to general relativity however the shift in the oscillation spectrum induced by modified theories of gravity is often small and degenerate with our ignorance of the equation of state in this letter we show that the coupling to additional degrees of freedom present in modified theories of gravity can give rise to new families of modes with no counterpart in general relativity which could be sufficiently well resolved in frequency space as to allow for a clear detection we present a realization of this idea by performing a thorough study of radial oscillations of neutron stars in massless scalartensor theories of gravity we anticipate astrophysical scenarios where the presence of this class of quasinormal modes could be probed with electromagnetic and gravitational wave measurements | [['detection', 'of', 'the', 'characteristic', 'spectrum', 'of', 'pulsating', 'neutron', 'stars', 'can', 'be', 'a', 'powerful', 'tool', 'not', 'only', 'to', 'probe', 'the', 'nuclear', 'equation', 'of', 'state', 'but', 'also', 'to', 'test', 'modifications', 'to', 'general', 'relativity', 'however', 'the', 'shift', 'in', 'the', 'oscillation', 'spectrum', 'induced', 'by', 'modified', 'theories', 'of', 'gravity', 'is', 'often', 'small', 'and', 'degenerate', 'with', 'our', 'ignorance', 'of', 'the', 'equation', 'of', 'state', 'in', 'this', 'letter', 'we', 'show', 'that', 'the', 'coupling', 'to', 'additional', 'degrees', 'of', 'freedom', 'present', 'in', 'modified', 'theories', 'of', 'gravity', 'can', 'give', 'rise', 'to', 'new', 'families', 'of', 'modes', 'with', 'no', 'counterpart', 'in', 'general', 'relativity', 'which', 'could', 'be', 'sufficiently', 'well', 'resolved', 'in', 'frequency', 'space', 'as', 'to', 'allow', 'for', 'a', 'clear', 'detection', 'we', 'present', 'a', 'realization', 'of', 'this', 'idea', 'by', 'performing', 'a', 'thorough', 'study', 'of', 'radial', 'oscillations', 'of', 'neutron', 'stars', 'in', 'massless', 'scalartensor', 'theories', 'of', 'gravity', 'we', 'anticipate', 'astrophysical', 'scenarios', 'where', 'the', 'presence', 'of', 'this', 'class', 'of', 'quasinormal', 'modes', 'could', 'be', 'probed', 'with', 'electromagnetic', 'and', 'gravitational', 'wave', 'measurements']] | [-0.14271730811512834, 0.17037794713274038, -0.1108815302753723, 0.06682710048794673, -0.14066245612431025, -0.12267293922578622, 0.012106697420485465, 0.28813761307576086, -0.20909153471687827, -0.33030885543772265, 0.048453239310459285, -0.23481243587478898, -0.12214395358674474, 0.20628373374998582, -0.03222092452434529, 0.002714858629348639, 0.056820828270007805, 0.04006134738722865, -0.07047121221426335, -0.17855463801472643, 0.3444255346671286, 0.08002988377733058, 0.18822589255624303, 0.02091268703684603, 0.050457667274474115, -0.037103190962960456, -0.002337292032806497, 0.039834131385424895, -0.11961150592483855, 0.0661573193195325, 0.263186216725061, 0.1277299210671213, 0.20325193630139293, -0.4151234765794422, -0.28099798991063024, 0.09948207127347, 0.15539021284540036, 0.1815078713047306, -0.06192591359630521, -0.3020246720208027, 0.045085947067395625, -0.1796342741673518, -0.18744192538648158, -0.09895754982043352, 0.0076727338233276415, -0.019937644270708245, -0.25011627859815855, 0.10373142245972351, 0.04310901711869519, 0.00669524193079652, -0.0651241653418095, -0.04387798405858982, 0.010238629186795535, 0.05124297133481473, 0.09254054494637162, 0.025485175853215258, 0.07766621000758421, -0.1460588798554933, -0.1069498187831701, 0.42021621442645, -0.14361448084328962, -0.1935790433658679, 0.18999188395192554, -0.21785377011033952, -0.15875482360378987, 0.09076358820924438, 0.1737125435795047, 0.18487324319951431, -0.14587415584997201, 0.06064721104293743, 0.0030784033344006226, 0.17623221547355092, 0.08076279655736136, 0.10375632108480204, 0.3103723481518069, 0.13306445251203658, 0.017701988724231916, 0.11124800492191418, -0.08805105954065527, -0.04690087529046363, -0.3454996133437625, -0.14312628241513217, -0.1334342182427032, 0.0827611261464833, -0.05358012373864384, -0.16348687232484257, 0.4058301772303438, 0.13090136341098083, 0.11663810570270901, 0.009031370154269481, 0.2615451445300622, 0.1119509231556501, 0.07163425859701085, 0.03609963679321625, 0.33742536896055464, 0.17204803741371602, 0.058486610003073064, -0.2519922876411951, -0.013109982111353403, 0.00018169070704300938] |
1,802.07848 | Influence of surface stoichiometry and quantum confinement on the
electronic structure of small diameter InxGa1-xAs nanowires | Electronic structures for InxGa1-xAs nanowires with [100], [110], and [111]
orientations and critical dimensions of approximately 2 nm are treated within
the framework of density functional theory. Explicit band structures are
calculated and properties relevant to nanoelectronic design are extracted
including band gaps, effective masses, and density of states. The properties of
these III-V nanowires are compared to silicon nanowires of comparable
dimensions as a reference system. In nonpolar semiconductors, quantum
confinement and surface chemistry are known to play a key role in the
determination of nanowire electronic structure. InxGa1-xAs nanowires have in
addition effects due to alloy stoichiometry on the cation sublattice and due to
the polar nature of the cleaved nanowire surfaces. The impact of these
additional factors on the electronic structure for these polar semiconductor
nanowires is shown to be significant and necessary for accurate treatment of
electronic structure properties.
| cond-mat.mes-hall | electronic structures for inxga1xas nanowires with 100 110 and 111 orientations and critical dimensions of approximately 2 nm are treated within the framework of density functional theory explicit band structures are calculated and properties relevant to nanoelectronic design are extracted including band gaps effective masses and density of states the properties of these iiiv nanowires are compared to silicon nanowires of comparable dimensions as a reference system in nonpolar semiconductors quantum confinement and surface chemistry are known to play a key role in the determination of nanowire electronic structure inxga1xas nanowires have in addition effects due to alloy stoichiometry on the cation sublattice and due to the polar nature of the cleaved nanowire surfaces the impact of these additional factors on the electronic structure for these polar semiconductor nanowires is shown to be significant and necessary for accurate treatment of electronic structure properties | [['electronic', 'structures', 'for', 'inxga1xas', 'nanowires', 'with', '100', '110', 'and', '111', 'orientations', 'and', 'critical', 'dimensions', 'of', 'approximately', '2', 'nm', 'are', 'treated', 'within', 'the', 'framework', 'of', 'density', 'functional', 'theory', 'explicit', 'band', 'structures', 'are', 'calculated', 'and', 'properties', 'relevant', 'to', 'nanoelectronic', 'design', 'are', 'extracted', 'including', 'band', 'gaps', 'effective', 'masses', 'and', 'density', 'of', 'states', 'the', 'properties', 'of', 'these', 'iiiv', 'nanowires', 'are', 'compared', 'to', 'silicon', 'nanowires', 'of', 'comparable', 'dimensions', 'as', 'a', 'reference', 'system', 'in', 'nonpolar', 'semiconductors', 'quantum', 'confinement', 'and', 'surface', 'chemistry', 'are', 'known', 'to', 'play', 'a', 'key', 'role', 'in', 'the', 'determination', 'of', 'nanowire', 'electronic', 'structure', 'inxga1xas', 'nanowires', 'have', 'in', 'addition', 'effects', 'due', 'to', 'alloy', 'stoichiometry', 'on', 'the', 'cation', 'sublattice', 'and', 'due', 'to', 'the', 'polar', 'nature', 'of', 'the', 'cleaved', 'nanowire', 'surfaces', 'the', 'impact', 'of', 'these', 'additional', 'factors', 'on', 'the', 'electronic', 'structure', 'for', 'these', 'polar', 'semiconductor', 'nanowires', 'is', 'shown', 'to', 'be', 'significant', 'and', 'necessary', 'for', 'accurate', 'treatment', 'of', 'electronic', 'structure', 'properties']] | [-0.12274003152733903, 0.14350280077098967, -0.002710638795751375, 0.0197021875903336, 0.015855956050873428, -0.1307676583007499, 0.033499721221957955, 0.47935183555981914, -0.2265502404343415, -0.36263162418678924, 0.0283725425736145, -0.28466338133178914, -0.13168458920623455, 0.18973952479712614, 0.04076062214977622, 0.08175877783320505, 0.0031054054298991717, -0.0870672390174277, -0.10766244013109928, -0.19523373519646825, 0.2682860257963722, 0.06742688057003086, 0.32043493445311394, 0.12509225209738564, 0.0014994757549537645, -0.028043757861975084, 0.10145224743177528, 0.006716771111530545, -0.16414914756909116, 0.15371873683965329, 0.27531062708711707, -0.12695357185573533, 0.17138337360050243, -0.509142448500424, -0.2181722472806077, -0.05753180345478044, 0.10928822228590587, 0.1370484471529514, -0.06747470113084085, -0.2603664654209376, 0.12681015132897097, -0.09913718314691597, -0.10628385146610908, -0.08216316149394204, 0.005866028410805898, 0.003096834476385917, -0.1831926193794112, 0.07212039864670088, 0.027989006490557345, 0.0777324658356138, -0.11629602351141247, -0.19577218630836327, -0.09058571805838835, 0.10430171573208971, 0.0017751561993915406, 0.005345905206159695, 0.23130132164154854, -0.09784619519942915, -0.11303968364828741, 0.42761051324619487, 4.120939736860198e-05, -0.12632951540286308, 0.17183842511613157, -0.144090670499612, -0.056416006652976976, 0.1464705290044886, 0.18052644939064147, 0.09869868218104218, -0.13207321239340647, 0.097421154155562, 0.06220581436731651, 0.1723577887767444, 0.07101392756066435, 0.1760765117612648, 0.2432846148478818, 0.17244431262484172, 0.010340939303599559, 0.08486295091818653, -0.11641849475828084, -0.055060471837910324, -0.20261434101584283, -0.22102773681979454, -0.1904242678306886, 0.060999151488800266, -0.08602258719601978, -0.23139868237438832, 0.4114928006526682, 0.0941321766280758, 0.1381511940177973, -0.07799545943189959, 0.17443906216250432, 0.033061152105089406, 0.11286733033773783, 0.018100803711458103, 0.23566951800847646, 0.22795309570546335, 0.03141426071654875, -0.23584820233428708, 0.11319047281310171, -0.0222159744829747] |
1,802.07849 | Clones in Graphs | Finding structural similarities in graph data, like social networks, is a
far-ranging task in data mining and knowledge discovery. A (conceptually)
simple reduction would be to compute the automorphism group of a graph.
However, this approach is ineffective in data mining since real world data does
not exhibit enough structural regularity. Here we step in with a novel approach
based on mappings that preserve the maximal cliques. For this we exploit the
well known correspondence between bipartite graphs and the data structure
formal context $(G,M,I)$ from Formal Concept Analysis. From there we utilize
the notion of clone items. The investigation of these is still an open problem
to which we add new insights with this work. Furthermore, we produce a
substantial experimental investigation of real world data. We conclude with
demonstrating the generalization of clone items to permutations.
| cs.SI | finding structural similarities in graph data like social networks is a farranging task in data mining and knowledge discovery a conceptually simple reduction would be to compute the automorphism group of a graph however this approach is ineffective in data mining since real world data does not exhibit enough structural regularity here we step in with a novel approach based on mappings that preserve the maximal cliques for this we exploit the well known correspondence between bipartite graphs and the data structure formal context gmi from formal concept analysis from there we utilize the notion of clone items the investigation of these is still an open problem to which we add new insights with this work furthermore we produce a substantial experimental investigation of real world data we conclude with demonstrating the generalization of clone items to permutations | [['finding', 'structural', 'similarities', 'in', 'graph', 'data', 'like', 'social', 'networks', 'is', 'a', 'farranging', 'task', 'in', 'data', 'mining', 'and', 'knowledge', 'discovery', 'a', 'conceptually', 'simple', 'reduction', 'would', 'be', 'to', 'compute', 'the', 'automorphism', 'group', 'of', 'a', 'graph', 'however', 'this', 'approach', 'is', 'ineffective', 'in', 'data', 'mining', 'since', 'real', 'world', 'data', 'does', 'not', 'exhibit', 'enough', 'structural', 'regularity', 'here', 'we', 'step', 'in', 'with', 'a', 'novel', 'approach', 'based', 'on', 'mappings', 'that', 'preserve', 'the', 'maximal', 'cliques', 'for', 'this', 'we', 'exploit', 'the', 'well', 'known', 'correspondence', 'between', 'bipartite', 'graphs', 'and', 'the', 'data', 'structure', 'formal', 'context', 'gmi', 'from', 'formal', 'concept', 'analysis', 'from', 'there', 'we', 'utilize', 'the', 'notion', 'of', 'clone', 'items', 'the', 'investigation', 'of', 'these', 'is', 'still', 'an', 'open', 'problem', 'to', 'which', 'we', 'add', 'new', 'insights', 'with', 'this', 'work', 'furthermore', 'we', 'produce', 'a', 'substantial', 'experimental', 'investigation', 'of', 'real', 'world', 'data', 'we', 'conclude', 'with', 'demonstrating', 'the', 'generalization', 'of', 'clone', 'items', 'to', 'permutations']] | [-0.09649532958122807, 0.009510038716763265, -0.10473403281977643, 0.07632634208024736, -0.17833269849095656, -0.1129145247598543, 0.09823250429083903, 0.39523706239634665, -0.31185606827594986, -0.3306660593851753, 0.11128509797972451, -0.3009898370617758, -0.21663624191811928, 0.17075752809076852, -0.1299249223548163, 0.023774496259410745, 0.11826589314496495, 0.053299583767986165, -0.03945353635809506, -0.24236012652450564, 0.3451436531748555, 0.018120627636022433, 0.3062100086219447, 0.07944340591548361, 0.0709199769054607, -0.006580723149270035, -0.07656222101186226, 0.026937976152217692, -0.12826152162254573, 0.1575036246504169, 0.32400986428736994, 0.22026525280249398, 0.268005786640772, -0.407656817993932, -0.1636243515101302, 0.15630580974233244, 0.1184313945553225, 0.13551114081064294, -0.0778272312018089, -0.2673169401595774, 0.1009060985820395, -0.14736936696926536, -0.07033497426469905, -0.1364751405064084, 0.0066665132948453875, -0.03780175279741567, -0.24756982291760127, 0.016055002332786502, 0.09657229278051038, 0.11544444398548323, -0.022670225606407916, -0.054706893726319504, 0.02495782365060776, 0.1363654664542148, 0.02852300692356421, 0.014394436630528366, 0.07694635828754501, -0.11171591786863418, -0.15921710200094874, 0.37838671814677294, -0.014190847094616165, -0.17884999006797653, 0.1787844435623982, -0.11526590646109611, -0.2340043777383972, 0.07388211283967763, 0.1815411890114563, 0.08915569949591451, -0.16593445277396604, 0.062247125896712954, -0.10090836255635688, 0.1775249766339413, 0.0431837968096353, 0.03018092287474892, 0.14856973934945636, 0.22471799040753124, 0.08179997379783595, 0.15183982732149004, -0.016980079088724502, -0.07628959293166797, -0.247629878634209, -0.14268028698321703, -0.19879489461553917, 0.04728168441563511, -0.10364520006481578, -0.19122455446589467, 0.3880086714347851, 0.19588059215954895, 0.21582806075457484, 0.07090954171524019, 0.2756791842099198, 0.015087906669393398, 0.1148653064948925, 0.09300608887375954, 0.15684153560373554, 0.09145600976341445, 0.08258081042963633, -0.14751038316087256, 0.0764488496208577, 0.017450391227190477] |
1,802.0785 | Gravitational interactions of stars with supermassive black hole
binaries. I. Tidal disruption events | Stars approaching supermassive black holes (SMBHs) in the centers of galaxies
can be torn apart by strong tidal forces. We study the physics of tidal
disruption by a binary SMBH as a function of the binary mass ratio $q = M_2 /
M_1$ and separation $a$, exploring a large set of points in the parameter range
$q \in [0.01, 1]$ and $a/r_{t1} \in [10, 1000]$. We simulate encounters in
which field stars approach the binary from the loss cone on parabolic, low
angular momentum orbits. We present the rate of disruption and the orbital
properties of the disrupted stars, and examine the fallback dynamics of the
post-disruption debris in the "frozen-in" approximation. We conclude by
calculating the time-dependent disruption rate over the lifetime of the binary.
Throughout, we use a primary mass $M_1 = 10^6 M_\odot$ as our central example.
We find that the tidal disruption rate is a factor of $\sim 2 - 7$ times larger
than the rate for an isolated BH, and is independent of $q$ for $q \gtrsim
0.2$. In the "frozen-in" model, disruptions from close, nearly equal mass
binaries can produce intense tidal fallbacks: for binaries with $q \gtrsim 0.2$
and $a/r_{t1} \sim 100$, roughly $\sim 18 - 40 \%$ of disruptions will have
short rise times ($t_\textrm{rise} \sim 1 - 10$ d) and highly super-Eddington
peak return rates ($\dot{M}_\textrm{peak} / \dot{M}_\textrm{Edd} \sim 2 \times
10^2 - 3 \times 10^3$).
| astro-ph.HE | stars approaching supermassive black holes smbhs in the centers of galaxies can be torn apart by strong tidal forces we study the physics of tidal disruption by a binary smbh as a function of the binary mass ratio q m_2 m_1 and separation a exploring a large set of points in the parameter range q in 001 1 and ar_t1 in 10 1000 we simulate encounters in which field stars approach the binary from the loss cone on parabolic low angular momentum orbits we present the rate of disruption and the orbital properties of the disrupted stars and examine the fallback dynamics of the postdisruption debris in the frozenin approximation we conclude by calculating the timedependent disruption rate over the lifetime of the binary throughout we use a primary mass m_1 106 m_odot as our central example we find that the tidal disruption rate is a factor of sim 2 7 times larger than the rate for an isolated bh and is independent of q for q gtrsim 02 in the frozenin model disruptions from close nearly equal mass binaries can produce intense tidal fallbacks for binaries with q gtrsim 02 and ar_t1 sim 100 roughly sim 18 40 of disruptions will have short rise times t_textrmrise sim 1 10 d and highly supereddington peak return rates dotm_textrmpeak dotm_textrmedd sim 2 times 102 3 times 103 | [['stars', 'approaching', 'supermassive', 'black', 'holes', 'smbhs', 'in', 'the', 'centers', 'of', 'galaxies', 'can', 'be', 'torn', 'apart', 'by', 'strong', 'tidal', 'forces', 'we', 'study', 'the', 'physics', 'of', 'tidal', 'disruption', 'by', 'a', 'binary', 'smbh', 'as', 'a', 'function', 'of', 'the', 'binary', 'mass', 'ratio', 'q', 'm_2', 'm_1', 'and', 'separation', 'a', 'exploring', 'a', 'large', 'set', 'of', 'points', 'in', 'the', 'parameter', 'range', 'q', 'in', '001', '1', 'and', 'ar_t1', 'in', '10', '1000', 'we', 'simulate', 'encounters', 'in', 'which', 'field', 'stars', 'approach', 'the', 'binary', 'from', 'the', 'loss', 'cone', 'on', 'parabolic', 'low', 'angular', 'momentum', 'orbits', 'we', 'present', 'the', 'rate', 'of', 'disruption', 'and', 'the', 'orbital', 'properties', 'of', 'the', 'disrupted', 'stars', 'and', 'examine', 'the', 'fallback', 'dynamics', 'of', 'the', 'postdisruption', 'debris', 'in', 'the', 'frozenin', 'approximation', 'we', 'conclude', 'by', 'calculating', 'the', 'timedependent', 'disruption', 'rate', 'over', 'the', 'lifetime', 'of', 'the', 'binary', 'throughout', 'we', 'use', 'a', 'primary', 'mass', 'm_1', '106', 'm_odot', 'as', 'our', 'central', 'example', 'we', 'find', 'that', 'the', 'tidal', 'disruption', 'rate', 'is', 'a', 'factor', 'of', 'sim', '2', '7', 'times', 'larger', 'than', 'the', 'rate', 'for', 'an', 'isolated', 'bh', 'and', 'is', 'independent', 'of', 'q', 'for', 'q', 'gtrsim', '02', 'in', 'the', 'frozenin', 'model', 'disruptions', 'from', 'close', 'nearly', 'equal', 'mass', 'binaries', 'can', 'produce', 'intense', 'tidal', 'fallbacks', 'for', 'binaries', 'with', 'q', 'gtrsim', '02', 'and', 'ar_t1', 'sim', '100', 'roughly', 'sim', '18', '40', 'of', 'disruptions', 'will', 'have', 'short', 'rise', 'times', 't_textrmrise', 'sim', '1', '10', 'd', 'and', 'highly', 'supereddington', 'peak', 'return', 'rates', 'dotm_textrmpeak', 'dotm_textrmedd', 'sim', '2', 'times', '102', '3', 'times', '103']] | [-0.178941576732154, 0.1862735705626249, 0.011815419323674964, 0.1198248996987214, -0.0004366734939547281, -0.0503511549446656, 0.061620672973245805, 0.3224146570694291, -0.18790171605564351, -0.36646223337098754, 0.0652901856855561, -0.3075871671722755, -0.017309054054901407, 0.23585580765033706, -0.021208205558486046, -0.028356337854512272, 0.07344585491083057, -0.010224207192216894, -0.11115462584020697, -0.2411265687045654, 0.28484617497106146, 0.054489227319431253, 0.09244637219108877, -0.025639385163017055, 0.060031861264882316, -0.02115930337458849, 0.026967426812554377, -0.06441803040547608, -0.20584489784653986, -0.0017514791744192263, 0.17719831706521974, 0.11919287105358381, 0.2657945591733028, -0.3684222773054606, -0.14575056090784508, 0.06385926961924089, 0.18677702337098878, 0.03211012765569233, -0.07043787556630875, -0.20677614938025257, 0.16284686582146118, -0.3076413589786755, -0.15126364328582428, 0.049826673528061534, 0.13492788282081872, 0.026138336885427084, -0.2761520238475225, 0.18240895866768275, 0.08927215367336483, 0.012333166115491638, -0.10818528299793027, -0.08411389888565549, -0.04083124473395998, 0.03051663244067274, 0.1036570438150131, 0.12421973694718498, 0.20690441224091935, -0.11308742197845721, -0.032316274797687165, 0.3999529655946933, -0.06363807145983658, -0.044111415954534286, 0.20738123455485202, -0.2477360381218036, -0.07041666693922251, 0.18300182324922665, 0.21291176073792564, 0.17290709202590807, -0.11809240574463865, 0.004925018072531799, 0.03592593736980296, 0.2164112679002916, 0.09615076546097907, 0.02673076330663055, 0.34762098053175267, 0.14575382095984946, 0.017097577457927268, 0.05914178106994937, -0.1911004761558414, -0.03371628072551068, -0.21796292586386945, -0.08051273326191427, -0.12992560889359092, 0.17703501739416996, -0.20199309471670415, -0.054359830094172674, 0.31726741454483964, 0.10272066098557811, 0.2882530564964829, 0.047814855779251465, 0.24793412079026186, 0.09771247807321533, 0.09346876150561809, 0.1412928916857108, 0.3081500433823642, 0.14521186108957992, 0.026012408205232165, -0.20163140450003747, 0.016727661431611123, -0.00871802671134] |
1,802.07851 | Data Privacy for a $\rho$-Recoverable Function | A user's data is represented by a finite-valued random variable. Given a
function of the data, a querier is required to recover, with at least a
prescribed probability, the value of the function based on a query response
provided by the user. The user devises the query response, subject to the
recoverability requirement, so as to maximize privacy of the data from the
querier. Privacy is measured by the probability of error incurred by the
querier in estimating the data from the query response. We analyze single and
multiple independent query responses, with each response satisfying the
recoverability requirement, that provide maximum privacy to the user. In the
former setting, we also consider privacy for a predicate of the user's data.
Achievability schemes with explicit randomization mechanisms for query
responses are given and their privacy compared with converse upper bounds.
| cs.IT math.IT | a users data is represented by a finitevalued random variable given a function of the data a querier is required to recover with at least a prescribed probability the value of the function based on a query response provided by the user the user devises the query response subject to the recoverability requirement so as to maximize privacy of the data from the querier privacy is measured by the probability of error incurred by the querier in estimating the data from the query response we analyze single and multiple independent query responses with each response satisfying the recoverability requirement that provide maximum privacy to the user in the former setting we also consider privacy for a predicate of the users data achievability schemes with explicit randomization mechanisms for query responses are given and their privacy compared with converse upper bounds | [['a', 'users', 'data', 'is', 'represented', 'by', 'a', 'finitevalued', 'random', 'variable', 'given', 'a', 'function', 'of', 'the', 'data', 'a', 'querier', 'is', 'required', 'to', 'recover', 'with', 'at', 'least', 'a', 'prescribed', 'probability', 'the', 'value', 'of', 'the', 'function', 'based', 'on', 'a', 'query', 'response', 'provided', 'by', 'the', 'user', 'the', 'user', 'devises', 'the', 'query', 'response', 'subject', 'to', 'the', 'recoverability', 'requirement', 'so', 'as', 'to', 'maximize', 'privacy', 'of', 'the', 'data', 'from', 'the', 'querier', 'privacy', 'is', 'measured', 'by', 'the', 'probability', 'of', 'error', 'incurred', 'by', 'the', 'querier', 'in', 'estimating', 'the', 'data', 'from', 'the', 'query', 'response', 'we', 'analyze', 'single', 'and', 'multiple', 'independent', 'query', 'responses', 'with', 'each', 'response', 'satisfying', 'the', 'recoverability', 'requirement', 'that', 'provide', 'maximum', 'privacy', 'to', 'the', 'user', 'in', 'the', 'former', 'setting', 'we', 'also', 'consider', 'privacy', 'for', 'a', 'predicate', 'of', 'the', 'users', 'data', 'achievability', 'schemes', 'with', 'explicit', 'randomization', 'mechanisms', 'for', 'query', 'responses', 'are', 'given', 'and', 'their', 'privacy', 'compared', 'with', 'converse', 'upper', 'bounds']] | [-0.13386338241398335, -0.007268827568207468, -0.04017570660715657, 0.07307713573515814, -0.10247363863246782, -0.1843693987100518, 0.17228194173824574, 0.3241941650797214, -0.28847246618409245, -0.3301220225436347, 0.09260596925076763, -0.33533834599158063, -0.08844988415949047, 0.14720974532163902, -0.14126665167443986, 0.12186186728067697, 0.0069336913259966035, 0.11553804098283373, -0.0257089008577168, -0.3114699825029155, 0.3334993979328179, 0.08227332047785499, 0.28223543228980685, 0.01893101181568844, 0.09382483048248105, 0.050816134992055596, -0.04060139857798017, 0.0032185494899749758, -0.12558223826869966, 0.1179870285459661, 0.3094414137869275, 0.2439324059876526, 0.33308079823452447, -0.39696086730941066, -0.13580825575253194, 0.07277876413427294, 0.05963283966079221, 0.06618085361218878, -0.07470224617864005, -0.3104718199398901, 0.1174762350823065, -0.13204444130782836, -0.009024891263938377, -0.014469850010105543, -0.017988671881279776, 0.058773969842254054, -0.3939783939426499, 0.01378992278873089, 0.02882000698841044, 0.07335955724307236, -0.04779239148899381, -0.0456094399693289, -0.012120866379700602, 0.16750792499764688, 0.06428490644320846, 0.03030062274940844, 0.11728096397793186, -0.12490611655770668, -0.1518168697499537, 0.37152773632801006, -0.0321740221498268, -0.252645718545786, 0.08165293142332562, -0.1406484476240751, -0.09282349479451243, 0.1370978201606444, 0.20639846991481525, 0.07613069005310535, -0.19081688946379083, 0.052474847957325564, -0.0486463073973677, 0.18976016189969544, 0.061152887622094046, 0.08852458388677666, 0.1378352354613266, 0.15122437766736507, 0.10959363572432526, 0.1533350616784966, -0.050222704607793794, -0.03031796645040491, -0.2991364505645054, -0.10801207082778481, -0.23005671200475522, -0.0001921038475951978, -0.13088934231428928, -0.1157747076682946, 0.3785440149783556, 0.17454577570648067, 0.225640363279464, 0.16562344227318784, 0.35945631436604475, 0.15528280546007278, 0.059074157388282145, 0.11956082160385059, 0.15091231159998902, 0.045581193427538635, 0.10941649017789001, -0.17698871065929, 0.20857727106860174, 0.0023699693315263307] |
1,802.07852 | An Affordable Bio-Sensing and Activity Tagging Platform for HCI Research | We present a novel multi-modal bio-sensing platform capable of integrating
multiple data streams for use in real-time applications. The system is composed
of a central compute module and a companion headset. The compute node collects,
time-stamps and transmits the data while also providing an interface for a wide
range of sensors including electroencephalogram, photoplethysmogram,
electrocardiogram, and eye gaze among others. The companion headset contains
the gaze tracking cameras. By integrating many of the measurements systems into
an accessible package, we are able to explore previously unanswerable questions
ranging from open-environment interactions to emotional response studies.
Though some of the integrated sensors are designed from the ground-up to fit
into a compact form factor, we validate the accuracy of the sensors and find
that they perform similarly to, and in some cases better than, alternatives.
| cs.HC | we present a novel multimodal biosensing platform capable of integrating multiple data streams for use in realtime applications the system is composed of a central compute module and a companion headset the compute node collects timestamps and transmits the data while also providing an interface for a wide range of sensors including electroencephalogram photoplethysmogram electrocardiogram and eye gaze among others the companion headset contains the gaze tracking cameras by integrating many of the measurements systems into an accessible package we are able to explore previously unanswerable questions ranging from openenvironment interactions to emotional response studies though some of the integrated sensors are designed from the groundup to fit into a compact form factor we validate the accuracy of the sensors and find that they perform similarly to and in some cases better than alternatives | [['we', 'present', 'a', 'novel', 'multimodal', 'biosensing', 'platform', 'capable', 'of', 'integrating', 'multiple', 'data', 'streams', 'for', 'use', 'in', 'realtime', 'applications', 'the', 'system', 'is', 'composed', 'of', 'a', 'central', 'compute', 'module', 'and', 'a', 'companion', 'headset', 'the', 'compute', 'node', 'collects', 'timestamps', 'and', 'transmits', 'the', 'data', 'while', 'also', 'providing', 'an', 'interface', 'for', 'a', 'wide', 'range', 'of', 'sensors', 'including', 'electroencephalogram', 'photoplethysmogram', 'electrocardiogram', 'and', 'eye', 'gaze', 'among', 'others', 'the', 'companion', 'headset', 'contains', 'the', 'gaze', 'tracking', 'cameras', 'by', 'integrating', 'many', 'of', 'the', 'measurements', 'systems', 'into', 'an', 'accessible', 'package', 'we', 'are', 'able', 'to', 'explore', 'previously', 'unanswerable', 'questions', 'ranging', 'from', 'openenvironment', 'interactions', 'to', 'emotional', 'response', 'studies', 'though', 'some', 'of', 'the', 'integrated', 'sensors', 'are', 'designed', 'from', 'the', 'groundup', 'to', 'fit', 'into', 'a', 'compact', 'form', 'factor', 'we', 'validate', 'the', 'accuracy', 'of', 'the', 'sensors', 'and', 'find', 'that', 'they', 'perform', 'similarly', 'to', 'and', 'in', 'some', 'cases', 'better', 'than', 'alternatives']] | [-0.10345280522837731, 0.03566643871919294, -0.07234733074394062, 0.02399580468182081, -0.09793414022507411, -0.18960480172803304, 0.008417861495881264, 0.41085740630129786, -0.23150187775254585, -0.3274231870077494, 0.10865303742195151, -0.3438088295953278, -0.14901231822410696, 0.2624839952677712, -0.0944225545237331, 0.04128425410437517, 0.09271407882679478, 0.059648602807026045, -0.017550075334790898, -0.19710441076641383, 0.2674303578555976, 0.04686065770237517, 0.2460457004774782, -0.0014913087794767286, 0.14343762389625794, 0.03642345143349043, -0.0626958674520142, -0.017350123002084127, -0.07370408564392185, 0.1534890136086291, 0.30880036840348374, 0.17103656499884687, 0.25748612707186685, -0.4250420907974467, -0.20309635343492255, 0.05614246695855618, 0.1371277651462452, 0.06895286689470417, -0.08534288548521306, -0.351714818262236, 0.11465294499394897, -0.19641894780281455, -0.07699095603092608, -0.09374378367390175, 0.026702221083853925, 0.022241031910779474, -0.2909122961748363, 0.007758257898136175, -0.019651910370649926, 0.09317495255850088, -0.09278004400824245, -0.08190805892743647, 0.0404481966244547, 0.23376305591331661, -0.01628976248911953, 0.006146368807832941, 0.18164880245335793, -0.17053400466539828, -0.10308321586922091, 0.3768926880889593, -0.0012178675091477054, -0.1648457687474171, 0.23871337086718558, -0.08445713298633359, -0.10758261149048917, 0.12145276217112191, 0.23690718252656462, 0.102409114700539, -0.2078795908999286, -0.006643155892116991, 0.00291619753409037, 0.19903461453749946, 0.0349139906413489, 0.029047474059402327, 0.22751561818378313, 0.18291675121544448, 0.037723875784882364, 0.13705134464609892, -0.12675246994424247, -0.023254190890216513, -0.22026364420955524, -0.153857470878673, -0.14826856188202991, -0.030304157598770427, -0.05254468918002046, -0.10740619982571754, 0.4122856003319831, 0.22529153700014645, 0.2015267665238869, 0.04851423270774557, 0.3367319892097573, 0.0337779454412499, 0.11812461231296, 0.07736907726069703, 0.18466598005778037, 0.04192802305263292, 0.13560889393994516, -0.13192252831925688, 0.03755165855015131, -0.03347433804310298] |
1,802.07853 | An outflow in the Seyfert ESO 362-G18 revealed by Gemini-GMOS/IFU
Observations | We present two-dimensional stellar and gaseous kinematics of the inner 0.7
$\times$ 1.2 kpc$^{2}$ of the Seyfert galaxy ESO 362-G18, derived from optical
spectra obtained with the GMOS/IFU on the Gemini South telescope at a spatial
resolution of $\approx$170 pc and spectral resolution of 36 km s$^{-1}$. ESO
362-G18 is a strongly perturbed galaxy of morphological type Sa or S0/a, with a
minor merger approaching along the NE direction. Previous studies have shown
that the [OIII] emission shows a fan-shaped extension of $\approx$ 10\arcsec\
to the SE. We detect the [OIII] doublet, [NII] and H${\alpha}$ emission lines
throughout our field of view. The stellar kinematics is dominated by circular
motions in the galaxy plane, with a kinematic position angle of
$\approx$137$^{\circ}$. The gas kinematics is also dominated by rotation, with
kinematic position angles ranging from 122$^{\circ}$ to 139$^{\circ}$. A
double-Gaussian fit to the [OIII]$\lambda$5007 and H${\alpha}$ lines, which
have the highest signal to noise ratios of the emission lines, reveal two
kinematic components: (1) a component at lower radial velocities which we
interpret as gas rotating in the galactic disk; and (2) a component with line
of sight velocities 100-250 km s$^{-1}$ higher than the systemic velocity,
interpreted as originating in the outflowing gas within the AGN ionization
cone. We estimate a mass outflow rate of 7.4 $\times$ 10$^{-2}$ M$_{\odot}$
yr$^{-1}$ in the SE ionization cone (this rate doubles if we assume a biconical
configuration), and a mass accretion rate on the supermassive black hole (SMBH)
of 2.2 $\times$ 10$^{-2}$ M$_{\odot}$ yr$^{-1}$. The total ionized gas mass
within $\sim$84 pc of the nucleus is 3.3 $\times$ 10$^{5}$ M$_{\odot}$; infall
velocities of $\sim$34 km s$^{-1}$ in this gas would be required to feed both
the outflow and SMBH accretion.
| astro-ph.GA | we present twodimensional stellar and gaseous kinematics of the inner 07 times 12 kpc2 of the seyfert galaxy eso 362g18 derived from optical spectra obtained with the gmosifu on the gemini south telescope at a spatial resolution of approx170 pc and spectral resolution of 36 km s1 eso 362g18 is a strongly perturbed galaxy of morphological type sa or s0a with a minor merger approaching along the ne direction previous studies have shown that the oiii emission shows a fanshaped extension of approx 10arcsec to the se we detect the oiii doublet nii and halpha emission lines throughout our field of view the stellar kinematics is dominated by circular motions in the galaxy plane with a kinematic position angle of approx137circ the gas kinematics is also dominated by rotation with kinematic position angles ranging from 122circ to 139circ a doublegaussian fit to the oiiilambda5007 and halpha lines which have the highest signal to noise ratios of the emission lines reveal two kinematic components 1 a component at lower radial velocities which we interpret as gas rotating in the galactic disk and 2 a component with line of sight velocities 100250 km s1 higher than the systemic velocity interpreted as originating in the outflowing gas within the agn ionization cone we estimate a mass outflow rate of 74 times 102 m_odot yr1 in the se ionization cone this rate doubles if we assume a biconical configuration and a mass accretion rate on the supermassive black hole smbh of 22 times 102 m_odot yr1 the total ionized gas mass within sim84 pc of the nucleus is 33 times 105 m_odot infall velocities of sim34 km s1 in this gas would be required to feed both the outflow and smbh accretion | [['we', 'present', 'twodimensional', 'stellar', 'and', 'gaseous', 'kinematics', 'of', 'the', 'inner', '07', 'times', '12', 'kpc2', 'of', 'the', 'seyfert', 'galaxy', 'eso', '362g18', 'derived', 'from', 'optical', 'spectra', 'obtained', 'with', 'the', 'gmosifu', 'on', 'the', 'gemini', 'south', 'telescope', 'at', 'a', 'spatial', 'resolution', 'of', 'approx170', 'pc', 'and', 'spectral', 'resolution', 'of', '36', 'km', 's1', 'eso', '362g18', 'is', 'a', 'strongly', 'perturbed', 'galaxy', 'of', 'morphological', 'type', 'sa', 'or', 's0a', 'with', 'a', 'minor', 'merger', 'approaching', 'along', 'the', 'ne', 'direction', 'previous', 'studies', 'have', 'shown', 'that', 'the', 'oiii', 'emission', 'shows', 'a', 'fanshaped', 'extension', 'of', 'approx', '10arcsec', 'to', 'the', 'se', 'we', 'detect', 'the', 'oiii', 'doublet', 'nii', 'and', 'halpha', 'emission', 'lines', 'throughout', 'our', 'field', 'of', 'view', 'the', 'stellar', 'kinematics', 'is', 'dominated', 'by', 'circular', 'motions', 'in', 'the', 'galaxy', 'plane', 'with', 'a', 'kinematic', 'position', 'angle', 'of', 'approx137circ', 'the', 'gas', 'kinematics', 'is', 'also', 'dominated', 'by', 'rotation', 'with', 'kinematic', 'position', 'angles', 'ranging', 'from', '122circ', 'to', '139circ', 'a', 'doublegaussian', 'fit', 'to', 'the', 'oiiilambda5007', 'and', 'halpha', 'lines', 'which', 'have', 'the', 'highest', 'signal', 'to', 'noise', 'ratios', 'of', 'the', 'emission', 'lines', 'reveal', 'two', 'kinematic', 'components', '1', 'a', 'component', 'at', 'lower', 'radial', 'velocities', 'which', 'we', 'interpret', 'as', 'gas', 'rotating', 'in', 'the', 'galactic', 'disk', 'and', '2', 'a', 'component', 'with', 'line', 'of', 'sight', 'velocities', '100250', 'km', 's1', 'higher', 'than', 'the', 'systemic', 'velocity', 'interpreted', 'as', 'originating', 'in', 'the', 'outflowing', 'gas', 'within', 'the', 'agn', 'ionization', 'cone', 'we', 'estimate', 'a', 'mass', 'outflow', 'rate', 'of', '74', 'times', '102', 'm_odot', 'yr1', 'in', 'the', 'se', 'ionization', 'cone', 'this', 'rate', 'doubles', 'if', 'we', 'assume', 'a', 'biconical', 'configuration', 'and', 'a', 'mass', 'accretion', 'rate', 'on', 'the', 'supermassive', 'black', 'hole', 'smbh', 'of', '22', 'times', '102', 'm_odot', 'yr1', 'the', 'total', 'ionized', 'gas', 'mass', 'within', 'sim84', 'pc', 'of', 'the', 'nucleus', 'is', '33', 'times', '105', 'm_odot', 'infall', 'velocities', 'of', 'sim34', 'km', 's1', 'in', 'this', 'gas', 'would', 'be', 'required', 'to', 'feed', 'both', 'the', 'outflow', 'and', 'smbh', 'accretion']] | [-0.08354172583397788, 0.0612794860429539, -0.009827670794829988, 0.05453645929677837, -0.05222340920335499, -0.06926049869017381, -0.0049261676065885185, 0.4618355173111093, -0.12867638913081272, -0.3050710559283432, 0.058348017456502706, -0.2817824979590481, 0.07896176270401235, 0.1842057633307648, 0.0021359465354563374, -0.07901926215823837, 0.021969712578707883, -0.10114406678384465, -0.09367369251619828, -0.2042964026112091, 0.26951097981971606, 0.07845699993746454, 0.13104109599238686, -0.011879375025506433, 0.12335383193240615, -0.12564314162897827, -0.04668589098447436, -0.038775951846649774, -0.17984168065761383, 0.04332109571173134, 0.2073561233819642, 0.11720858252925896, 0.19806280072631413, -0.2991431194717032, -0.16486025354906655, -0.0007782670750952603, 0.23136022138785114, 0.005391553638241531, -0.02104358307204389, -0.29628626704379396, 0.032511963348084115, -0.22764997114427388, -0.22191026632657698, 0.15706318126942373, 0.06105126453555401, 0.023881672732858805, -0.21946184963902884, 0.1955711608963994, 0.00873053069839156, 0.1195596711489519, -0.09669153551385853, -0.08683692069495456, -0.11570314832742473, 0.005489363711686773, 0.03960327452105846, 0.12382978818363004, 0.27380694024052404, -0.10681900018826126, -0.008307056621599354, 0.4108127796989784, -0.1097829435595103, 0.0029327292714202615, 0.21503769426582087, -0.27419298947176063, -0.1446181260016665, 0.2433837838356563, 0.16717602243369217, 0.10219738095296188, -0.11065383270186813, -0.02669578793585268, -0.07008747361526874, 0.2594979350602156, 0.07030494069361962, 0.04625724778248185, 0.3324674532520013, 0.03599607681022271, 0.05140839936311271, 0.037591195193307246, -0.3240684083793639, -0.032513797438393034, -0.2191996060414934, -0.11340862254023944, -0.07409763781500882, 0.14063848185254949, -0.17121731636421797, -0.06087852941791266, 0.3086228164697164, 0.07380646972711762, 0.29002832946808715, 0.044093089219868965, 0.31596308535357054, 0.0785839683323151, 0.09730879747127019, 0.1626765089125879, 0.3301585866040305, 0.22401924807284224, 0.08940992164098772, -0.2497704072757379, 0.03325092269826615, 0.03350042677239368] |
1,802.07854 | Driver Hand Localization and Grasp Analysis: A Vision-based Real-time
Approach | Extracting hand regions and their grasp information from images robustly in
real-time is critical for occupants' safety and in-vehicular infotainment
applications. It must however, be noted that naturalistic driving scenes suffer
from rapidly changing illumination and occlusion. This is aggravated by the
fact that hands are highly deformable objects, and change in appearance
frequently. This work addresses the task of accurately localizing driver hands
and classifying the grasp state of each hand. We use a fast ConvNet to first
detect likely hand regions. Next, a pixel-based skin classifier that takes into
account the global illumination changes is used to refine the hand detections
and remove false positives. This step generates a pixel-level mask for each
hand. Finally, we study each such masked regions and detect if the driver is
grasping the wheel, or in some cases a mobile phone. Through evaluation we
demonstrate that our method can outperform state-of-the-art pixel based hand
detectors, while running faster (at 35 fps) than other deep ConvNet based
frameworks even for grasp analysis. Hand mask cues are shown to be crucial when
analyzing a set of driver hand gestures (wheel/mobile phone grasp and no-grasp)
in naturalistic driving settings. The proposed detection and localization
pipeline hence can act as a general framework for real-time hand detection and
gesture classification.
| cs.CV | extracting hand regions and their grasp information from images robustly in realtime is critical for occupants safety and invehicular infotainment applications it must however be noted that naturalistic driving scenes suffer from rapidly changing illumination and occlusion this is aggravated by the fact that hands are highly deformable objects and change in appearance frequently this work addresses the task of accurately localizing driver hands and classifying the grasp state of each hand we use a fast convnet to first detect likely hand regions next a pixelbased skin classifier that takes into account the global illumination changes is used to refine the hand detections and remove false positives this step generates a pixellevel mask for each hand finally we study each such masked regions and detect if the driver is grasping the wheel or in some cases a mobile phone through evaluation we demonstrate that our method can outperform stateoftheart pixel based hand detectors while running faster at 35 fps than other deep convnet based frameworks even for grasp analysis hand mask cues are shown to be crucial when analyzing a set of driver hand gestures wheelmobile phone grasp and nograsp in naturalistic driving settings the proposed detection and localization pipeline hence can act as a general framework for realtime hand detection and gesture classification | [['extracting', 'hand', 'regions', 'and', 'their', 'grasp', 'information', 'from', 'images', 'robustly', 'in', 'realtime', 'is', 'critical', 'for', 'occupants', 'safety', 'and', 'invehicular', 'infotainment', 'applications', 'it', 'must', 'however', 'be', 'noted', 'that', 'naturalistic', 'driving', 'scenes', 'suffer', 'from', 'rapidly', 'changing', 'illumination', 'and', 'occlusion', 'this', 'is', 'aggravated', 'by', 'the', 'fact', 'that', 'hands', 'are', 'highly', 'deformable', 'objects', 'and', 'change', 'in', 'appearance', 'frequently', 'this', 'work', 'addresses', 'the', 'task', 'of', 'accurately', 'localizing', 'driver', 'hands', 'and', 'classifying', 'the', 'grasp', 'state', 'of', 'each', 'hand', 'we', 'use', 'a', 'fast', 'convnet', 'to', 'first', 'detect', 'likely', 'hand', 'regions', 'next', 'a', 'pixelbased', 'skin', 'classifier', 'that', 'takes', 'into', 'account', 'the', 'global', 'illumination', 'changes', 'is', 'used', 'to', 'refine', 'the', 'hand', 'detections', 'and', 'remove', 'false', 'positives', 'this', 'step', 'generates', 'a', 'pixellevel', 'mask', 'for', 'each', 'hand', 'finally', 'we', 'study', 'each', 'such', 'masked', 'regions', 'and', 'detect', 'if', 'the', 'driver', 'is', 'grasping', 'the', 'wheel', 'or', 'in', 'some', 'cases', 'a', 'mobile', 'phone', 'through', 'evaluation', 'we', 'demonstrate', 'that', 'our', 'method', 'can', 'outperform', 'stateoftheart', 'pixel', 'based', 'hand', 'detectors', 'while', 'running', 'faster', 'at', '35', 'fps', 'than', 'other', 'deep', 'convnet', 'based', 'frameworks', 'even', 'for', 'grasp', 'analysis', 'hand', 'mask', 'cues', 'are', 'shown', 'to', 'be', 'crucial', 'when', 'analyzing', 'a', 'set', 'of', 'driver', 'hand', 'gestures', 'wheelmobile', 'phone', 'grasp', 'and', 'nograsp', 'in', 'naturalistic', 'driving', 'settings', 'the', 'proposed', 'detection', 'and', 'localization', 'pipeline', 'hence', 'can', 'act', 'as', 'a', 'general', 'framework', 'for', 'realtime', 'hand', 'detection', 'and', 'gesture', 'classification']] | [-0.039525033969526564, 0.0407396625927298, -0.06935539451923355, 0.06684489468088427, -0.12678484892679098, -0.2509399891857339, 0.022492676093638437, 0.4247507044061456, -0.2075141438959553, -0.34247381366648766, 0.13767681224271655, -0.2852037660898377, -0.20158417853043537, 0.22418384022651325, -0.17678471763161416, 0.03527962061508453, 0.14166535737590408, 0.05093455742517451, -0.020494895217514155, -0.23102349219053, 0.27252797466452355, 0.022890177209293778, 0.290740739721102, 0.03526718140566581, 0.1299924147249428, 0.011409738986810037, -0.03408819071087494, 0.01567658284171077, 0.004812313515428269, 0.12446584624328506, 0.2926097483778337, 0.1573404602060245, 0.28350289295568076, -0.42845784984353297, -0.231537598580614, 0.09367750815932972, 0.1496137016198053, 0.12056248633186596, -0.04658769848503893, -0.3946084090253725, 0.11208447144599631, -0.14413086997613064, -0.033021020890819784, -0.10074277481125703, 0.027801650894788216, 0.00042651944715784476, -0.2827786558600393, 0.00392457864462521, 0.057917249532864555, 0.06301849138843915, -0.08050749282119796, -0.043565709889044915, 0.0013650076173878504, 0.22681615870066518, 0.03945497356197041, 0.0677342919587764, 0.25038798058401124, -0.22959427360553988, -0.08914934064894212, 0.39571324481962705, -0.00010624305376143827, -0.18261194718509632, 0.22642705442805616, -0.09914430659176465, -0.16597023407955003, 0.11250253960727451, 0.20837122151399698, 0.15623388682571152, -0.14146985568663265, -0.04338256986416384, 0.01913643709890751, 0.21936173629968972, 0.10335969499242052, -0.01380877291321324, 0.223086303045077, 0.20381743480552444, 0.09279591648538492, 0.11241101701430897, -0.19818227100301367, -0.008375294154009097, -0.2106459038299157, -0.10904541832160419, -0.14316090398670156, -0.07051038074050152, -0.05557927184335707, -0.105607312223583, 0.3928998773522183, 0.2855706482440374, 0.19238318552104933, 0.0508704643481288, 0.4044056699681535, 0.04231163358623612, 0.11759688421525939, 0.08642923923726589, 0.21060064262262973, -0.06633788049122195, 0.08932288656371452, -0.15617417366208755, 0.1271302258696864, 0.06769535585991898] |
1,802.07855 | RT-DAP: A Real-Time Data Analytics Platform for Large-scale Industrial
Process Monitoring and Control | In most process control systems nowadays, process measurements are
periodically collected and archived in historians. Analytics applications
process the data, and provide results offline or in a time period that is
considerably slow in comparison to the performance of the manufacturing
process. Along with the proliferation of Internet-of-Things (IoT) and the
introduction of "pervasive sensors" technology in process industries,
increasing number of sensors and actuators are installed in process plants for
pervasive sensing and control, and the volume of produced process data is
growing exponentially. To digest these data and meet the ever-growing
requirements to increase production efficiency and improve product quality,
there needs to be a way to both improve the performance of the analytics system
and scale the system to closely monitor a much larger set of plant resources.
In this paper, we present a real-time data analytics platform, called RT-DAP,
to support large-scale continuous data analytics in process industries. RT-DAP
is designed to be able to stream, store, process and visualize a large volume
of realtime data flows collected from heterogeneous plant resources, and
feedback to the control system and operators in a realtime manner. A prototype
of the platform is implemented on Microsoft Azure. Our extensive experiments
validate the design methodologies of RT-DAP and demonstrate its efficiency in
both component and system levels.
| cs.NI cs.PF | in most process control systems nowadays process measurements are periodically collected and archived in historians analytics applications process the data and provide results offline or in a time period that is considerably slow in comparison to the performance of the manufacturing process along with the proliferation of internetofthings iot and the introduction of pervasive sensors technology in process industries increasing number of sensors and actuators are installed in process plants for pervasive sensing and control and the volume of produced process data is growing exponentially to digest these data and meet the evergrowing requirements to increase production efficiency and improve product quality there needs to be a way to both improve the performance of the analytics system and scale the system to closely monitor a much larger set of plant resources in this paper we present a realtime data analytics platform called rtdap to support largescale continuous data analytics in process industries rtdap is designed to be able to stream store process and visualize a large volume of realtime data flows collected from heterogeneous plant resources and feedback to the control system and operators in a realtime manner a prototype of the platform is implemented on microsoft azure our extensive experiments validate the design methodologies of rtdap and demonstrate its efficiency in both component and system levels | [['in', 'most', 'process', 'control', 'systems', 'nowadays', 'process', 'measurements', 'are', 'periodically', 'collected', 'and', 'archived', 'in', 'historians', 'analytics', 'applications', 'process', 'the', 'data', 'and', 'provide', 'results', 'offline', 'or', 'in', 'a', 'time', 'period', 'that', 'is', 'considerably', 'slow', 'in', 'comparison', 'to', 'the', 'performance', 'of', 'the', 'manufacturing', 'process', 'along', 'with', 'the', 'proliferation', 'of', 'internetofthings', 'iot', 'and', 'the', 'introduction', 'of', 'pervasive', 'sensors', 'technology', 'in', 'process', 'industries', 'increasing', 'number', 'of', 'sensors', 'and', 'actuators', 'are', 'installed', 'in', 'process', 'plants', 'for', 'pervasive', 'sensing', 'and', 'control', 'and', 'the', 'volume', 'of', 'produced', 'process', 'data', 'is', 'growing', 'exponentially', 'to', 'digest', 'these', 'data', 'and', 'meet', 'the', 'evergrowing', 'requirements', 'to', 'increase', 'production', 'efficiency', 'and', 'improve', 'product', 'quality', 'there', 'needs', 'to', 'be', 'a', 'way', 'to', 'both', 'improve', 'the', 'performance', 'of', 'the', 'analytics', 'system', 'and', 'scale', 'the', 'system', 'to', 'closely', 'monitor', 'a', 'much', 'larger', 'set', 'of', 'plant', 'resources', 'in', 'this', 'paper', 'we', 'present', 'a', 'realtime', 'data', 'analytics', 'platform', 'called', 'rtdap', 'to', 'support', 'largescale', 'continuous', 'data', 'analytics', 'in', 'process', 'industries', 'rtdap', 'is', 'designed', 'to', 'be', 'able', 'to', 'stream', 'store', 'process', 'and', 'visualize', 'a', 'large', 'volume', 'of', 'realtime', 'data', 'flows', 'collected', 'from', 'heterogeneous', 'plant', 'resources', 'and', 'feedback', 'to', 'the', 'control', 'system', 'and', 'operators', 'in', 'a', 'realtime', 'manner', 'a', 'prototype', 'of', 'the', 'platform', 'is', 'implemented', 'on', 'microsoft', 'azure', 'our', 'extensive', 'experiments', 'validate', 'the', 'design', 'methodologies', 'of', 'rtdap', 'and', 'demonstrate', 'its', 'efficiency', 'in', 'both', 'component', 'and', 'system', 'levels']] | [-0.11992732620543259, 0.07307594693544824, -0.052517210011526594, -0.013107400560161903, -0.08207910400514881, -0.1222987852567884, 0.06709912031178668, 0.383983125140722, -0.2834659322633833, -0.34644747255069597, 0.18472074670395233, -0.3305018733838715, -0.10932050015743015, 0.24685287117112584, -0.11584848076564341, 0.11810487037345398, 0.11876739501847976, 0.012338875967409454, 0.052079133770277314, -0.2638946288020655, 0.2512927274123126, 0.08838672251419126, 0.37645262721089073, 0.05474238663489076, 0.07256831732698746, -0.03620864921394298, -0.06022068455145793, -0.028290724827616135, -0.05301905976258211, 0.15785933123935822, 0.3212018131379313, 0.21808001503760363, 0.2971146858623466, -0.47231735941451813, -0.1737442331792023, 0.08960434771679376, 0.1452259488472466, 0.020975948152591555, -0.08804747684051879, -0.29228391429551015, 0.09889668667064508, -0.22091082210570986, -0.09167103760571044, -0.09447607296317266, 0.03246811447313167, 0.02152283931529952, -0.2971374936957633, -0.011562870971779103, -0.02608801572758507, 0.07300441649373329, -0.05362240781523137, -0.028891199948652413, -0.00881011079147046, 0.18161990677064482, 0.005239992297210512, 0.010980265502053986, 0.2088508159694721, -0.14502651872615488, -0.1372566637175355, 0.3692356238339079, -0.009436074219438062, -0.1427132634806537, 0.21085959366492688, -0.09877514188212218, -0.11940353153775606, 0.1086020400328669, 0.29144954078826485, 0.05764553674672675, -0.21609443857673608, 0.03919958732088744, 0.08570086936496439, 0.19375970823076566, -0.009018957449664031, 0.02549896918962525, 0.16335128093769233, 0.26137288644360507, 0.07601962955416425, 0.14059772345608676, -0.03761065943050735, -0.09314837054272229, -0.19375683771111585, -0.1759213501858967, -0.16492382346433565, -0.03816020609714383, -0.0591877792214316, -0.14675894338414416, 0.33978893258930765, 0.21109081948313363, 0.1821684215844433, 0.0032417062607761216, 0.37200172636915463, 0.05616859740354732, 0.12733898876608546, 0.07515983187061336, 0.15188945349722174, 0.028305851461683414, 0.24127015764374407, -0.1645212444618413, 0.07108980214678197, -0.05154391232779258] |
1,802.07856 | xView: Objects in Context in Overhead Imagery | We introduce a new large-scale dataset for the advancement of object
detection techniques and overhead object detection research. This satellite
imagery dataset enables research progress pertaining to four key computer
vision frontiers. We utilize a novel process for geospatial category detection
and bounding box annotation with three stages of quality control. Our data is
collected from WorldView-3 satellites at 0.3m ground sample distance, providing
higher resolution imagery than most public satellite imagery datasets. We
compare xView to other object detection datasets in both natural and overhead
imagery domains and then provide a baseline analysis using the Single Shot
MultiBox Detector. xView is one of the largest and most diverse publicly
available object-detection datasets to date, with over 1 million objects across
60 classes in over 1,400 km^2 of imagery.
| cs.CV | we introduce a new largescale dataset for the advancement of object detection techniques and overhead object detection research this satellite imagery dataset enables research progress pertaining to four key computer vision frontiers we utilize a novel process for geospatial category detection and bounding box annotation with three stages of quality control our data is collected from worldview3 satellites at 03m ground sample distance providing higher resolution imagery than most public satellite imagery datasets we compare xview to other object detection datasets in both natural and overhead imagery domains and then provide a baseline analysis using the single shot multibox detector xview is one of the largest and most diverse publicly available objectdetection datasets to date with over 1 million objects across 60 classes in over 1400 km2 of imagery | [['we', 'introduce', 'a', 'new', 'largescale', 'dataset', 'for', 'the', 'advancement', 'of', 'object', 'detection', 'techniques', 'and', 'overhead', 'object', 'detection', 'research', 'this', 'satellite', 'imagery', 'dataset', 'enables', 'research', 'progress', 'pertaining', 'to', 'four', 'key', 'computer', 'vision', 'frontiers', 'we', 'utilize', 'a', 'novel', 'process', 'for', 'geospatial', 'category', 'detection', 'and', 'bounding', 'box', 'annotation', 'with', 'three', 'stages', 'of', 'quality', 'control', 'our', 'data', 'is', 'collected', 'from', 'worldview3', 'satellites', 'at', '03m', 'ground', 'sample', 'distance', 'providing', 'higher', 'resolution', 'imagery', 'than', 'most', 'public', 'satellite', 'imagery', 'datasets', 'we', 'compare', 'xview', 'to', 'other', 'object', 'detection', 'datasets', 'in', 'both', 'natural', 'and', 'overhead', 'imagery', 'domains', 'and', 'then', 'provide', 'a', 'baseline', 'analysis', 'using', 'the', 'single', 'shot', 'multibox', 'detector', 'xview', 'is', 'one', 'of', 'the', 'largest', 'and', 'most', 'diverse', 'publicly', 'available', 'objectdetection', 'datasets', 'to', 'date', 'with', 'over', '1', 'million', 'objects', 'across', '60', 'classes', 'in', 'over', '1400', 'km2', 'of', 'imagery']] | [-0.06525368842267198, -0.035491939655912574, -0.04117523756212904, 0.013743034122470021, -0.11066409219347406, -0.13258479150317726, -0.000559383406653069, 0.42073210931994254, -0.1954792070082476, -0.4371712527645286, 0.1401624458230799, -0.3656230055908054, -0.07145532344657113, 0.2872492950064043, -0.1378180988394888, 0.05246571813188439, 0.19343497234513052, 0.009434404228386484, -0.020203348334689508, -0.2660240008990513, 0.2721699368012196, 0.04965342795185279, 0.34981430947664194, 0.004254407151165651, 0.13236675294956513, -0.047638712560001295, -0.10188980192106101, -0.04183812694009248, -0.08173741251357569, 0.17921611449492048, 0.34524587767191406, 0.24647566649946384, 0.26628174496818247, -0.38130591205089104, -0.20185393597057555, 0.0659794733714989, 0.14061046389542753, 0.07498138606877092, -0.0787191120434727, -0.38164093554405554, 0.06828443939684803, -0.19829915375430573, -0.0006199778617883567, -0.0536314141800176, 0.056290333086508326, -0.07169404824526282, -0.21221264782070648, 0.051765307847745134, -0.044166929023049306, 0.16782961236640404, -0.05906253686043783, -0.10036840200700681, 0.04144445714155154, 0.20866464209939295, -0.010835625102345148, 0.06595159478820278, 0.16634438846176636, -0.20987100845195528, -0.1576381072627555, 0.36574669305991847, -0.05562616650297514, -0.1148675657181002, 0.264308099183836, -0.12017787244985811, -0.17187137606015312, 0.14476853160158498, 0.2281529773499642, 0.1459783807367785, -0.1652190946333576, -0.01992731499058209, -0.04147481964355393, 0.219006531056948, 0.07033725330984453, 0.020152311025412928, 0.20108123733007233, 0.2869201207504375, 0.07148710051296803, 0.14280108480352283, -0.284377793666863, -0.025885217741233646, -0.19157213308790233, -0.10851264132361393, -0.15756655675795628, -0.03042349862789706, -0.08116699877734845, -0.0698153910725523, 0.3876887333826744, 0.2612441051824135, 0.17578618285187986, 0.07871411698829434, 0.3950359162990935, -0.07747895181000786, 0.13757308275671676, 0.05721447911037103, 0.14879191905220068, -0.03908276814036071, 0.13383706755666935, -0.09400167572039209, -0.003818116307229502, 0.002015831461903872] |
1,802.07857 | Tutorial: Magnetic resonance with nitrogen-vacancy centers in
diamond---microwave engineering, materials science, and magnetometry | This tutorial article provides a concise and pedagogical overview on
negatively-charged nitrogen-vacancy (NV) centers in diamond. The research on
the NV centers has attracted enormous attention for its application to quantum
sensing, encompassing the areas of not only physics and applied physics but
also chemistry, biology and life sciences. Nonetheless, its key technical
aspects can be understood from the viewpoint of magnetic resonance. We focus on
three facets of this ever-expanding research field, to which our viewpoint is
especially relevant: microwave engineering, materials science, and
magnetometry. In explaining these aspects, we provide a technical basis and
up-to-date technologies for the research on the NV centers.
| cond-mat.mtrl-sci quant-ph | this tutorial article provides a concise and pedagogical overview on negativelycharged nitrogenvacancy nv centers in diamond the research on the nv centers has attracted enormous attention for its application to quantum sensing encompassing the areas of not only physics and applied physics but also chemistry biology and life sciences nonetheless its key technical aspects can be understood from the viewpoint of magnetic resonance we focus on three facets of this everexpanding research field to which our viewpoint is especially relevant microwave engineering materials science and magnetometry in explaining these aspects we provide a technical basis and uptodate technologies for the research on the nv centers | [['this', 'tutorial', 'article', 'provides', 'a', 'concise', 'and', 'pedagogical', 'overview', 'on', 'negativelycharged', 'nitrogenvacancy', 'nv', 'centers', 'in', 'diamond', 'the', 'research', 'on', 'the', 'nv', 'centers', 'has', 'attracted', 'enormous', 'attention', 'for', 'its', 'application', 'to', 'quantum', 'sensing', 'encompassing', 'the', 'areas', 'of', 'not', 'only', 'physics', 'and', 'applied', 'physics', 'but', 'also', 'chemistry', 'biology', 'and', 'life', 'sciences', 'nonetheless', 'its', 'key', 'technical', 'aspects', 'can', 'be', 'understood', 'from', 'the', 'viewpoint', 'of', 'magnetic', 'resonance', 'we', 'focus', 'on', 'three', 'facets', 'of', 'this', 'everexpanding', 'research', 'field', 'to', 'which', 'our', 'viewpoint', 'is', 'especially', 'relevant', 'microwave', 'engineering', 'materials', 'science', 'and', 'magnetometry', 'in', 'explaining', 'these', 'aspects', 'we', 'provide', 'a', 'technical', 'basis', 'and', 'uptodate', 'technologies', 'for', 'the', 'research', 'on', 'the', 'nv', 'centers']] | [-0.026301112877471108, 0.08683007586126526, -0.02660795373265587, 0.027082857093773782, -0.0882882585682507, -0.13890392523968503, 0.019967463251114603, 0.41824729698044916, -0.2308280866947912, -0.32002883322891734, 0.11946882556547367, -0.28406919982461704, -0.15100013030072054, 0.2567019096570134, -0.10479598442269933, -0.009525436509977139, 0.06632965742832138, 0.03013615069184674, -0.01120897947278406, -0.22288998329701523, 0.2449766120208161, 0.0541596525160241, 0.39084748640390377, 0.14177351343401132, 0.07835746379569172, 0.012389693387030136, -0.012348608752446515, -0.007173966323690755, -0.15177681746759586, 0.2520795642176554, 0.3643026630349812, 0.1811589817915644, 0.31836278428367915, -0.46000462055561087, -0.23543155963665674, 0.05863532118410582, 0.14966655177330332, 0.19095186674856537, -0.17624024102641714, -0.2781041065452709, -0.018446405604481696, -0.10176980040213536, -0.11598318007669323, -0.09004482984365451, 0.024675179362696198, -0.03958558019782816, -0.14339436934373917, -0.025209717765461565, 0.0488044760478217, 0.1568985256133601, -0.03541139927914455, -0.16524427842703604, 0.07391638661557365, 0.12900045566881696, 0.007495347213088756, 0.05440788765748342, 0.25068621982687284, -0.15480717039844466, -0.15464875340639125, 0.4201539800635406, 0.04538322621069494, -0.08093812554365112, 0.22743854565279825, -0.1427957968919405, -0.20564299954456233, 0.008513145042317254, 0.2182102105181132, 0.10344112790411426, -0.17618678855665382, 0.14133709584573462, 0.036557889528506034, 0.11699679782392368, 0.01375072216171594, 0.1175648437724227, 0.2902995531912893, 0.2104470347719533, 0.058596912177190895, 0.10379750363506554, -0.047896367138517755, -0.12166741171940451, -0.24599156851569812, -0.16804575087679993, -0.18349918902940338, 0.09174493480531964, 0.003674637841842403, -0.13762856744274143, 0.44926042963883706, 0.19192843968048692, 0.12138144687882492, -0.14884292343964, 0.30863210083473297, -0.00737660429329567, 0.08152058755180665, -0.012595161210213389, 0.2255772735125252, 0.1887022687831805, 0.17509549801193533, -0.19749840652082293, 0.01670866171785054, -0.03136573895989429] |
1,802.07858 | MPST: A Corpus of Movie Plot Synopses with Tags | Social tagging of movies reveals a wide range of heterogeneous information
about movies, like the genre, plot structure, soundtracks, metadata, visual and
emotional experiences. Such information can be valuable in building automatic
systems to create tags for movies. Automatic tagging systems can help
recommendation engines to improve the retrieval of similar movies as well as
help viewers to know what to expect from a movie in advance. In this paper, we
set out to the task of collecting a corpus of movie plot synopses and tags. We
describe a methodology that enabled us to build a fine-grained set of around 70
tags exposing heterogeneous characteristics of movie plots and the multi-label
associations of these tags with some 14K movie plot synopses. We investigate
how these tags correlate with movies and the flow of emotions throughout
different types of movies. Finally, we use this corpus to explore the
feasibility of inferring tags from plot synopses. We expect the corpus will be
useful in other tasks where analysis of narratives is relevant.
| cs.CL | social tagging of movies reveals a wide range of heterogeneous information about movies like the genre plot structure soundtracks metadata visual and emotional experiences such information can be valuable in building automatic systems to create tags for movies automatic tagging systems can help recommendation engines to improve the retrieval of similar movies as well as help viewers to know what to expect from a movie in advance in this paper we set out to the task of collecting a corpus of movie plot synopses and tags we describe a methodology that enabled us to build a finegrained set of around 70 tags exposing heterogeneous characteristics of movie plots and the multilabel associations of these tags with some 14k movie plot synopses we investigate how these tags correlate with movies and the flow of emotions throughout different types of movies finally we use this corpus to explore the feasibility of inferring tags from plot synopses we expect the corpus will be useful in other tasks where analysis of narratives is relevant | [['social', 'tagging', 'of', 'movies', 'reveals', 'a', 'wide', 'range', 'of', 'heterogeneous', 'information', 'about', 'movies', 'like', 'the', 'genre', 'plot', 'structure', 'soundtracks', 'metadata', 'visual', 'and', 'emotional', 'experiences', 'such', 'information', 'can', 'be', 'valuable', 'in', 'building', 'automatic', 'systems', 'to', 'create', 'tags', 'for', 'movies', 'automatic', 'tagging', 'systems', 'can', 'help', 'recommendation', 'engines', 'to', 'improve', 'the', 'retrieval', 'of', 'similar', 'movies', 'as', 'well', 'as', 'help', 'viewers', 'to', 'know', 'what', 'to', 'expect', 'from', 'a', 'movie', 'in', 'advance', 'in', 'this', 'paper', 'we', 'set', 'out', 'to', 'the', 'task', 'of', 'collecting', 'a', 'corpus', 'of', 'movie', 'plot', 'synopses', 'and', 'tags', 'we', 'describe', 'a', 'methodology', 'that', 'enabled', 'us', 'to', 'build', 'a', 'finegrained', 'set', 'of', 'around', '70', 'tags', 'exposing', 'heterogeneous', 'characteristics', 'of', 'movie', 'plots', 'and', 'the', 'multilabel', 'associations', 'of', 'these', 'tags', 'with', 'some', '14k', 'movie', 'plot', 'synopses', 'we', 'investigate', 'how', 'these', 'tags', 'correlate', 'with', 'movies', 'and', 'the', 'flow', 'of', 'emotions', 'throughout', 'different', 'types', 'of', 'movies', 'finally', 'we', 'use', 'this', 'corpus', 'to', 'explore', 'the', 'feasibility', 'of', 'inferring', 'tags', 'from', 'plot', 'synopses', 'we', 'expect', 'the', 'corpus', 'will', 'be', 'useful', 'in', 'other', 'tasks', 'where', 'analysis', 'of', 'narratives', 'is', 'relevant']] | [-0.028710518284317324, 0.021478120238958474, -0.09151158203156443, 0.13980964799685514, -0.2075176522033015, -0.13350602938684034, 0.10808904069982579, 0.4326364147312501, -0.2608847805901485, -0.39144237687920824, 0.02317399719647844, -0.41152925433810145, -0.16444944759063862, 0.20675885014900225, -0.10969986615236849, -0.0036783627494621804, 0.11251109376111451, 0.10503040753469309, -0.043745339227675956, -0.23621240558568388, 0.31410495497505453, 0.03023951728006496, 0.3114567815873991, 0.04419151246547699, 0.04223780062953558, -0.01703178098918322, -0.124427298598868, -0.008173017453073578, -0.09908001545824364, 0.15101108355036771, 0.39720321808503395, 0.277610840012922, 0.2823199837098775, -0.3628058325499296, -0.1779980681836605, 0.03110012515406946, 0.1811261270666899, 0.084166051328237, -0.04633072615765473, -0.3631927565342801, 0.09351872695021003, -0.20082182979539914, 4.132885335232405e-06, -0.1517127847107237, 0.023519125854706065, 0.058569025029154384, -0.20941504367579267, 0.042968501430004837, 0.015842974210938658, 0.11713076504221295, -0.03693562624295523, -0.0677666969364509, 0.024364357123918393, 0.27817794930408984, 0.0337385065812508, 0.017849726627772563, 0.19022291465114582, -0.19897070495028268, -0.13277691991123206, 0.4283089258434141, -0.06161289767067715, -0.18931923230206046, 0.20370883007451673, -0.08648184934521423, -0.14347986970096827, 0.050742902445113834, 0.27132271190913504, 0.0913843754610485, -0.2058734476186253, -0.10123733177041526, -0.09784098894691423, 0.2553299501976546, 0.08279858653241878, 0.028908950386924998, 0.22292978366946473, 0.22994938950766536, -0.05619192973518854, 0.13238250520525446, -0.0791461945977062, -0.004557590241379598, -0.18243531068129576, -0.18224109383026027, -0.11350309387780726, 0.01292007953983129, -0.09973829672363696, -0.14883585188209134, 0.40384734011501733, 0.27959081882282216, 0.1970655704177368, -0.0018166437430088135, 0.25191810019588207, -0.056000863902976136, 0.08341163675136426, 0.043739926540772155, 0.07757958613476469, -0.0488567963899935, 0.24028353223796275, -0.11634440761990845, 0.07604297572089469, -0.003018406855271143] |
1,802.07859 | Modeling Spatiotemporal Factors Associated With Sentiment on Twitter:
Synthesis and Suggestions for Improving the Identification of Localized
Deviations | Background: Studies examining how sentiment on social media varies depending
on timing and location appear to produce inconsistent results, making it hard
to design systems that use sentiment to detect localized events for public
health applications.
Objective: The aim of this study was to measure how common timing and
location confounders explain variation in sentiment on Twitter.
Methods: Using a dataset of 16.54 million English-language tweets from 100
cities posted between July 13 and November 30, 2017, we estimated the positive
and negative sentiment for each of the cities using a dictionary-based
sentiment analysis and constructed models to explain the differences in
sentiment using time of day, day of week, weather, city, and interaction type
(conversations or broadcasting) as factors and found that all factors were
independently associated with sentiment.
Results: In the full multivariable model of positive (Pearson r in test data
0.236; 95\% CI 0.231-0.241) and negative (Pearson r in test data 0.306; 95\% CI
0.301-0.310) sentiment, the city and time of day explained more of the variance
than weather and day of week. Models that account for these confounders produce
a different distribution and ranking of important events compared with models
that do not account for these confounders.
Conclusions: In public health applications that aim to detect localized
events by aggregating sentiment across populations of Twitter users, it is
worthwhile accounting for baseline differences before looking for unexpected
changes.
| cs.SI cs.CL | background studies examining how sentiment on social media varies depending on timing and location appear to produce inconsistent results making it hard to design systems that use sentiment to detect localized events for public health applications objective the aim of this study was to measure how common timing and location confounders explain variation in sentiment on twitter methods using a dataset of 1654 million englishlanguage tweets from 100 cities posted between july 13 and november 30 2017 we estimated the positive and negative sentiment for each of the cities using a dictionarybased sentiment analysis and constructed models to explain the differences in sentiment using time of day day of week weather city and interaction type conversations or broadcasting as factors and found that all factors were independently associated with sentiment results in the full multivariable model of positive pearson r in test data 0236 95 ci 02310241 and negative pearson r in test data 0306 95 ci 03010310 sentiment the city and time of day explained more of the variance than weather and day of week models that account for these confounders produce a different distribution and ranking of important events compared with models that do not account for these confounders conclusions in public health applications that aim to detect localized events by aggregating sentiment across populations of twitter users it is worthwhile accounting for baseline differences before looking for unexpected changes | [['background', 'studies', 'examining', 'how', 'sentiment', 'on', 'social', 'media', 'varies', 'depending', 'on', 'timing', 'and', 'location', 'appear', 'to', 'produce', 'inconsistent', 'results', 'making', 'it', 'hard', 'to', 'design', 'systems', 'that', 'use', 'sentiment', 'to', 'detect', 'localized', 'events', 'for', 'public', 'health', 'applications', 'objective', 'the', 'aim', 'of', 'this', 'study', 'was', 'to', 'measure', 'how', 'common', 'timing', 'and', 'location', 'confounders', 'explain', 'variation', 'in', 'sentiment', 'on', 'twitter', 'methods', 'using', 'a', 'dataset', 'of', '1654', 'million', 'englishlanguage', 'tweets', 'from', '100', 'cities', 'posted', 'between', 'july', '13', 'and', 'november', '30', '2017', 'we', 'estimated', 'the', 'positive', 'and', 'negative', 'sentiment', 'for', 'each', 'of', 'the', 'cities', 'using', 'a', 'dictionarybased', 'sentiment', 'analysis', 'and', 'constructed', 'models', 'to', 'explain', 'the', 'differences', 'in', 'sentiment', 'using', 'time', 'of', 'day', 'day', 'of', 'week', 'weather', 'city', 'and', 'interaction', 'type', 'conversations', 'or', 'broadcasting', 'as', 'factors', 'and', 'found', 'that', 'all', 'factors', 'were', 'independently', 'associated', 'with', 'sentiment', 'results', 'in', 'the', 'full', 'multivariable', 'model', 'of', 'positive', 'pearson', 'r', 'in', 'test', 'data', '0236', '95', 'ci', '02310241', 'and', 'negative', 'pearson', 'r', 'in', 'test', 'data', '0306', '95', 'ci', '03010310', 'sentiment', 'the', 'city', 'and', 'time', 'of', 'day', 'explained', 'more', 'of', 'the', 'variance', 'than', 'weather', 'and', 'day', 'of', 'week', 'models', 'that', 'account', 'for', 'these', 'confounders', 'produce', 'a', 'different', 'distribution', 'and', 'ranking', 'of', 'important', 'events', 'compared', 'with', 'models', 'that', 'do', 'not', 'account', 'for', 'these', 'confounders', 'conclusions', 'in', 'public', 'health', 'applications', 'that', 'aim', 'to', 'detect', 'localized', 'events', 'by', 'aggregating', 'sentiment', 'across', 'populations', 'of', 'twitter', 'users', 'it', 'is', 'worthwhile', 'accounting', 'for', 'baseline', 'differences', 'before', 'looking', 'for', 'unexpected', 'changes']] | [-0.05072589663803861, 0.05134156420320758, -0.061408162149398225, 0.17005749349684818, -0.09578127299799867, -0.1729390558037583, 0.11042573079922358, 0.42798572182655337, -0.1877798258377563, -0.3550109350719773, 0.11883512372454709, -0.37656837758486683, -0.12320133355830837, 0.1997951564667544, -0.07640906773183657, -0.011108366842381655, 0.09924547393229263, 0.03747038787392818, 0.002579344006295761, -0.315419834283302, 0.27789288975865295, 0.07197431710589192, 0.3024918212433872, 0.04886477345539986, 0.06626193918510462, -0.020025116130304724, -0.15047935645865357, -0.007614815741291513, -0.06449580655902062, 0.11658739484621987, 0.3472628729654389, 0.18553940181863374, 0.31171085440918156, -0.3841669667593163, -0.19760859502155495, 0.08291146437758985, 0.09280207157337471, 0.02335382146601383, 0.019956755357903287, -0.3450828473853028, 0.05620288449623015, -0.20005571936236938, -0.05149359248538056, -0.06465175528150133, 0.09832008565857035, 0.010040606128598523, -0.24349602284719762, 0.1496267485715773, 0.014189814591942273, 0.14919493525876137, -0.07011885252659736, -0.1301334426900291, -0.01900700198273863, 0.2101268547495989, 0.13944588023207516, -0.007425685933507655, 0.1409189978827034, -0.1105037502043516, -0.16795400359627347, 0.36100687438055223, -0.0815187514823502, -0.11994679362877556, 0.16579491287247156, -0.13727974782738347, -0.17415097098514112, 0.07662579203935584, 0.28100916813228927, 0.06488464017621363, -0.17788494472422273, -0.06761988251667429, -0.025706439241564467, 0.2691420798777076, 0.11154613089444035, -0.06156302301223268, 0.20668031195097644, 0.14991628579142421, 0.019315049505752066, 0.043091402288890725, -0.13315515444214132, -0.06061082578102208, -0.20112735474856733, -0.09642444576298737, -0.12286897178830417, 0.03740870283123197, -0.1281574689593981, -0.1257921565040622, 0.42927471299291303, 0.22805612226195238, 0.16216090157344612, 0.04384165150404442, 0.23093081707053859, 0.014499645414458506, 0.05299246915180803, 0.07653543737934619, 0.16481171369795566, -0.004662546796886169, 0.19311938075065288, -0.13684406688806358, 0.1375856358575655, -0.03031336669810116] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.