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.0006 | Current fluctuations in boundary-driven quantum spin chains | Boundary-driven spin chains are paradigmatic non-equilibrium systems in both
classical and quantum settings. In general it may not be possible to
distinguish classical from quantum transport through monitoring the mean
current, as both ballistic as well as diffusive regimes occur in either
setting. Here we show that genuine quantum features become manifest in large
fluctuations which allow a discrimination between classical and quantum
transport: in the classical case, realizations that are characterized by
atypically large boundary activity are associated with larger than typical
currents, i.e. an enhanced number of events at the boundaries goes together
with a large current. Conversely, in the quantum case the Zeno effect leads to
the suppression of current in trajectories with large activity at the boundary.
We analyze how these different dynamical regimes are reflected in the structure
of rare fluctuations. We show furthermore that realizations supporting a large
current are generated via weak long-range correlations within the spin chain,
typically associated with hyperuniformity.
| cond-mat.stat-mech quant-ph | boundarydriven spin chains are paradigmatic nonequilibrium systems in both classical and quantum settings in general it may not be possible to distinguish classical from quantum transport through monitoring the mean current as both ballistic as well as diffusive regimes occur in either setting here we show that genuine quantum features become manifest in large fluctuations which allow a discrimination between classical and quantum transport in the classical case realizations that are characterized by atypically large boundary activity are associated with larger than typical currents ie an enhanced number of events at the boundaries goes together with a large current conversely in the quantum case the zeno effect leads to the suppression of current in trajectories with large activity at the boundary we analyze how these different dynamical regimes are reflected in the structure of rare fluctuations we show furthermore that realizations supporting a large current are generated via weak longrange correlations within the spin chain typically associated with hyperuniformity | [['boundarydriven', 'spin', 'chains', 'are', 'paradigmatic', 'nonequilibrium', 'systems', 'in', 'both', 'classical', 'and', 'quantum', 'settings', 'in', 'general', 'it', 'may', 'not', 'be', 'possible', 'to', 'distinguish', 'classical', 'from', 'quantum', 'transport', 'through', 'monitoring', 'the', 'mean', 'current', 'as', 'both', 'ballistic', 'as', 'well', 'as', 'diffusive', 'regimes', 'occur', 'in', 'either', 'setting', 'here', 'we', 'show', 'that', 'genuine', 'quantum', 'features', 'become', 'manifest', 'in', 'large', 'fluctuations', 'which', 'allow', 'a', 'discrimination', 'between', 'classical', 'and', 'quantum', 'transport', 'in', 'the', 'classical', 'case', 'realizations', 'that', 'are', 'characterized', 'by', 'atypically', 'large', 'boundary', 'activity', 'are', 'associated', 'with', 'larger', 'than', 'typical', 'currents', 'ie', 'an', 'enhanced', 'number', 'of', 'events', 'at', 'the', 'boundaries', 'goes', 'together', 'with', 'a', 'large', 'current', 'conversely', 'in', 'the', 'quantum', 'case', 'the', 'zeno', 'effect', 'leads', 'to', 'the', 'suppression', 'of', 'current', 'in', 'trajectories', 'with', 'large', 'activity', 'at', 'the', 'boundary', 'we', 'analyze', 'how', 'these', 'different', 'dynamical', 'regimes', 'are', 'reflected', 'in', 'the', 'structure', 'of', 'rare', 'fluctuations', 'we', 'show', 'furthermore', 'that', 'realizations', 'supporting', 'a', 'large', 'current', 'are', 'generated', 'via', 'weak', 'longrange', 'correlations', 'within', 'the', 'spin', 'chain', 'typically', 'associated', 'with', 'hyperuniformity']] | [-0.14058949822360803, 0.24221802794943056, -0.042027942145114426, 0.09682856742644085, 0.005081659247337273, -0.14883395819851555, -0.0031173120248395034, 0.34196732462085083, -0.30017355022331077, -0.2754825796849979, 0.09501136396279407, -0.2926018375013047, -0.14745645012425365, 0.22940728408958083, -0.022505124258433918, 0.01636901571936671, 0.039502196090073334, 0.02439714028242296, -0.05857525710946347, -0.1687635807130111, 0.29923757020407504, 0.018833073927236006, 0.28913651339698043, 0.02465511250687447, 0.04471872704478461, 0.002167761390267303, 0.027043623739923788, 0.09160609025824464, -0.09875365278646811, 0.03065925817233774, 0.24017759596887953, 0.006432335730056343, 0.21785897992510325, -0.47098750644802767, -0.22915883737165224, 0.11064848171711061, 0.14695256446018148, 0.16863580910802334, -0.03401016576637356, -0.29222349823985555, 0.0633695503849091, -0.16450781290823557, -0.11165657094181897, -0.09349481270607538, -0.0049694340186246305, 0.04120142014298893, -0.23483759709143331, 0.14685628638725798, 0.06081347741496328, 0.06851922129075858, 0.004410570019522225, -0.04730196305881577, -0.01422652575983988, 0.14426074594950433, 0.037050030349443354, -0.02077823307412038, 0.14355083792206813, -0.17331300293968158, -0.16529369394663931, 0.3388262352065634, -0.07449866482688175, -0.18487770537078474, 0.28436255285446094, -0.20668198738273513, -0.11099226007226316, 0.12024496190554504, 0.15400448216875112, 0.09570122483836592, -0.1265856823096866, 0.04370510747506863, 0.006841948708378762, 0.11458377528836096, 0.00814227443393437, 0.10373806570540914, 0.2553008919312332, 0.14614030582912313, 0.07115116422489262, 0.1503815844799824, -0.09919530201753464, -0.197054531273312, -0.3087667927801984, -0.1352699479474774, -0.1691986309663164, 0.09428295080336586, -0.06514079185219558, -0.16533128939768146, 0.3493539436058428, 0.18532424284795243, 0.2320024523318089, 0.012571756856123559, 0.24803266101428922, 0.13557503959120093, 0.06785604597761957, 0.07832006564065111, 0.24198301874522893, 0.11683391924484768, 0.0725993141356223, -0.24275127573395675, 0.07764661138432112, -0.01942715066362102] |
1,802.00061 | Call-by-name Gradual Type Theory | We present gradual type theory, a logic and type theory for call-by-name
gradual typing. We define the central constructions of gradual typing (the
dynamic type, type casts and type error) in a novel way, by universal
properties relative to new judgments for gradual type and term dynamism, which
were developed in blame calculi and to state the "gradual guarantee" theorem of
gradual typing. Combined with the ordinary extensionality ($\eta$) principles
that type theory provides, we show that most of the standard operational
behavior of casts is uniquely determined by the gradual guarantee. This
provides a semantic justification for the definitions of casts, and shows that
non-standard definitions of casts must violate these principles. Our type
theory is the internal language of a certain class of preorder categories
called equipments. We give a general construction of an equipment interpreting
gradual type theory from a 2-category representing non-gradual types and
programs, which is a semantic analogue of Findler and Felleisen's definitions
of contracts, and use it to build some concrete domain-theoretic models of
gradual typing.
| cs.PL | we present gradual type theory a logic and type theory for callbyname gradual typing we define the central constructions of gradual typing the dynamic type type casts and type error in a novel way by universal properties relative to new judgments for gradual type and term dynamism which were developed in blame calculi and to state the gradual guarantee theorem of gradual typing combined with the ordinary extensionality eta principles that type theory provides we show that most of the standard operational behavior of casts is uniquely determined by the gradual guarantee this provides a semantic justification for the definitions of casts and shows that nonstandard definitions of casts must violate these principles our type theory is the internal language of a certain class of preorder categories called equipments we give a general construction of an equipment interpreting gradual type theory from a 2category representing nongradual types and programs which is a semantic analogue of findler and felleisens definitions of contracts and use it to build some concrete domaintheoretic models of gradual typing | [['we', 'present', 'gradual', 'type', 'theory', 'a', 'logic', 'and', 'type', 'theory', 'for', 'callbyname', 'gradual', 'typing', 'we', 'define', 'the', 'central', 'constructions', 'of', 'gradual', 'typing', 'the', 'dynamic', 'type', 'type', 'casts', 'and', 'type', 'error', 'in', 'a', 'novel', 'way', 'by', 'universal', 'properties', 'relative', 'to', 'new', 'judgments', 'for', 'gradual', 'type', 'and', 'term', 'dynamism', 'which', 'were', 'developed', 'in', 'blame', 'calculi', 'and', 'to', 'state', 'the', 'gradual', 'guarantee', 'theorem', 'of', 'gradual', 'typing', 'combined', 'with', 'the', 'ordinary', 'extensionality', 'eta', 'principles', 'that', 'type', 'theory', 'provides', 'we', 'show', 'that', 'most', 'of', 'the', 'standard', 'operational', 'behavior', 'of', 'casts', 'is', 'uniquely', 'determined', 'by', 'the', 'gradual', 'guarantee', 'this', 'provides', 'a', 'semantic', 'justification', 'for', 'the', 'definitions', 'of', 'casts', 'and', 'shows', 'that', 'nonstandard', 'definitions', 'of', 'casts', 'must', 'violate', 'these', 'principles', 'our', 'type', 'theory', 'is', 'the', 'internal', 'language', 'of', 'a', 'certain', 'class', 'of', 'preorder', 'categories', 'called', 'equipments', 'we', 'give', 'a', 'general', 'construction', 'of', 'an', 'equipment', 'interpreting', 'gradual', 'type', 'theory', 'from', 'a', '2category', 'representing', 'nongradual', 'types', 'and', 'programs', 'which', 'is', 'a', 'semantic', 'analogue', 'of', 'findler', 'and', 'felleisens', 'definitions', 'of', 'contracts', 'and', 'use', 'it', 'to', 'build', 'some', 'concrete', 'domaintheoretic', 'models', 'of', 'gradual', 'typing']] | [-0.10394440691235887, 0.046022013269129976, -0.11608877627931666, 0.10939484104367926, -0.16459610448543763, -0.161810782275076, 0.12543236348049736, 0.3198342164653505, -0.30268317941633094, -0.31174698541330736, 0.043362403472582266, -0.20681699043746257, -0.15770291010368626, 0.1639564370077921, -0.17543944340134257, -0.03054481463948113, 0.03337348199335772, 0.035671132961883706, -0.13831094616000691, -0.15493897453957606, 0.3602559833034743, 0.0018308806493012018, 0.2831995187443681, 0.03240740354995915, 0.08278738705408868, 0.02630519094668142, -0.040125508119926115, 0.07477548216512903, -0.11632819797011697, 0.14654820149379977, 0.2547649158997406, 0.23655151921259457, 0.2846964337067072, -0.42417509475354714, -0.18530733437872313, 0.03958445671285221, 0.048550580928730235, 0.09761856651734994, -0.029605662241729714, -0.29544595457331907, 0.09263841543335814, -0.23995925215354494, -0.1337319854484481, -0.09031738875925184, 0.03449674514338894, 0.0283762535180485, -0.23447174793258202, 0.04430014946021486, 0.18623778113417988, 0.11097171931895752, -0.0791686775317134, -0.04897989699857981, 4.337849718150358e-05, 0.07708436139144523, 0.018785838076985594, -0.011395131890272159, 0.109782764851251, -0.09981471939326458, -0.1759182025798932, 0.34973243252525843, -0.04012206228731503, -0.1255982530627841, 0.21868166263854175, -0.030526551916155706, -0.1776759102642753, 0.08715259689068812, 0.0865214002186021, 0.10651736212677734, -0.13964225978828793, 0.06915559073799117, -0.01970271255041278, 0.20333324445866394, 0.07637412452442181, 0.08092638715285386, 0.1731561606852771, 0.18455287828489186, 0.006565426003870143, 0.13422878480213152, -0.01039206057375427, -0.10451876871601873, -0.37832979187585936, -0.18835779952395, -0.023886688433988237, 0.04673041276590422, -0.09545804133035005, -0.20179639400394503, 0.36461169942590776, 0.13131886390904182, 0.14095997150315967, 0.13204452239361397, 0.22839053096872386, 0.11817592641590488, 0.0976095701416218, 0.00435242434248848, 0.1859793539254095, 0.12065176631535166, 0.1321968037992456, -0.1363432272296767, 0.12455955285546479, 0.16671086987345154] |
1,802.00062 | Polarization and dilepton angular distribution in pion-nucleon
collisions | We study hadronic polarization and the related anisotropy of the dilepton
angular distribution for the reaction $\pi N \to Ne^+e^-$. We employ consistent
effective interactions for baryon resonances up to spin-5/2 to compute their
contribution to the anisotropy coefficient. We show that the spin and parity of
the intermediate baryon resonance is reflected in the angular dependence of the
anisotropy coefficient. We present results for the anisotropy coefficient
including the $N(1520)$ and $N(1440)$ resonances, which are essential at the
collision energy of the recent data obtained by the HADES collaboration on this
reaction. We conclude that the anisotropy coefficient provides useful
constraints for unraveling the resonance contributions to this process.
| hep-ph nucl-th | we study hadronic polarization and the related anisotropy of the dilepton angular distribution for the reaction pi n to nee we employ consistent effective interactions for baryon resonances up to spin52 to compute their contribution to the anisotropy coefficient we show that the spin and parity of the intermediate baryon resonance is reflected in the angular dependence of the anisotropy coefficient we present results for the anisotropy coefficient including the n1520 and n1440 resonances which are essential at the collision energy of the recent data obtained by the hades collaboration on this reaction we conclude that the anisotropy coefficient provides useful constraints for unraveling the resonance contributions to this process | [['we', 'study', 'hadronic', 'polarization', 'and', 'the', 'related', 'anisotropy', 'of', 'the', 'dilepton', 'angular', 'distribution', 'for', 'the', 'reaction', 'pi', 'n', 'to', 'nee', 'we', 'employ', 'consistent', 'effective', 'interactions', 'for', 'baryon', 'resonances', 'up', 'to', 'spin52', 'to', 'compute', 'their', 'contribution', 'to', 'the', 'anisotropy', 'coefficient', 'we', 'show', 'that', 'the', 'spin', 'and', 'parity', 'of', 'the', 'intermediate', 'baryon', 'resonance', 'is', 'reflected', 'in', 'the', 'angular', 'dependence', 'of', 'the', 'anisotropy', 'coefficient', 'we', 'present', 'results', 'for', 'the', 'anisotropy', 'coefficient', 'including', 'the', 'n1520', 'and', 'n1440', 'resonances', 'which', 'are', 'essential', 'at', 'the', 'collision', 'energy', 'of', 'the', 'recent', 'data', 'obtained', 'by', 'the', 'hades', 'collaboration', 'on', 'this', 'reaction', 'we', 'conclude', 'that', 'the', 'anisotropy', 'coefficient', 'provides', 'useful', 'constraints', 'for', 'unraveling', 'the', 'resonance', 'contributions', 'to', 'this', 'process']] | [-0.13276058110747146, 0.17281267367388037, -0.0787832279192199, 0.08128803720949443, -0.07977075915444981, -0.04186540877615864, 0.01032807192849842, 0.3212275075302883, -0.2512991284274242, -0.29184909647499974, -0.03938069808487357, -0.33880507668310944, -0.05926263981964439, 0.14785132433541798, 0.11915946177799594, 0.05498023796826601, 0.0497029528550973, 0.03065982127392834, 0.0012988447486846284, -0.17090724742315203, 0.3448069410906597, 0.10641637429256331, 0.238917361961847, 0.16841988027603788, 0.08698576597433368, 0.04265031330922449, -0.02146357908760282, -0.037815382924269544, -0.20551699715393956, 0.11563345428386873, 0.2362740830602971, 0.012913151040927252, 0.08458558036522432, -0.3456559220498258, -0.14403556011384352, 0.08488170944831588, 0.16179343021305448, 0.16586324692259288, -0.05700626762435687, -0.25819221315058793, 0.06439259067939763, -0.14016468277709052, -0.1618191299907101, -0.11046106918630275, 0.029825303144752978, -0.014909591070715, -0.337318980558352, 0.15244400145523038, 0.04230583951840262, 0.04532725985415957, -0.06647327955896881, -0.21615371714261444, -0.02385952136775648, 0.08827827316285534, 0.0888807053124765, 0.02861925705219619, 0.13934544852342118, -0.12030685965649106, -0.09868827056647701, 0.351239884797145, -0.08363723004744812, -0.16097867449914868, 0.11547820550569503, -0.206196845730301, -0.1633290795651688, 0.13911942663517865, 0.20835194806991653, 0.0667733538083584, -0.14894880595278334, 0.06996410662276585, 0.032804212418638845, 0.13674837484617125, 0.05593590720726008, 0.05333610126240687, 0.16621933315287937, 0.1322315372949974, 0.01093536312268539, 0.10594881792679768, -0.12238202271348035, -0.04987593216144226, -0.29614737406796354, -0.11354823041791944, -0.1751423471564935, 0.053448222105560654, -0.06989053127485519, -0.06736928271976385, 0.41253423971885983, 0.13407482509924606, 0.2798110857193189, -0.0012227857136167587, 0.2880058836699887, 0.12839178381942806, 0.06993366227358241, 0.0405121358725327, 0.30730438107116653, 0.1871435969475318, 0.16107539767240683, -0.3609919687733054, 0.06061828076437285, -0.01807873687622222] |
1,802.00063 | Transient gain from $N_2^+$ in light filaments | We perform high resolution spectroscopy of $N_2^+$ emission in light
filaments using a controlled pump at 795 followed by a second harmonic weak
probe. Our result suggests that transient gain is achieved by resonant
stimulated Raman scattering.
| physics.optics physics.atom-ph | we perform high resolution spectroscopy of n_2 emission in light filaments using a controlled pump at 795 followed by a second harmonic weak probe our result suggests that transient gain is achieved by resonant stimulated raman scattering | [['we', 'perform', 'high', 'resolution', 'spectroscopy', 'of', 'n_2', 'emission', 'in', 'light', 'filaments', 'using', 'a', 'controlled', 'pump', 'at', '795', 'followed', 'by', 'a', 'second', 'harmonic', 'weak', 'probe', 'our', 'result', 'suggests', 'that', 'transient', 'gain', 'is', 'achieved', 'by', 'resonant', 'stimulated', 'raman', 'scattering']] | [-0.10300140061440903, 0.2031488229608717, -0.07117313459968648, -0.008675982530631527, 0.025199398989915044, -0.15413829150634842, 0.12074906280818018, 0.4894831316243555, -0.26000505001158325, -0.2678327036681711, 0.012622067600966909, -0.27030205293684395, -0.06753750298977704, 0.2686143302534883, 0.06408533199715453, 0.015454028493951302, 0.030789530282286374, -0.13334161667404948, 0.07041761788187197, -0.15445153294382868, 0.2552369988359813, 0.0973935470463255, 0.2679578875367706, 0.07846686485651377, 0.12614937867918932, 0.020464585502506107, -0.042517410440219415, -0.09447754828913792, -0.07022758663377907, 0.07640291546546929, 0.2312835853584614, -0.010096555355483212, 0.24239829494743734, -0.43030429324386893, -0.25152565508678154, 0.003455462701920722, 0.18372970643277103, 0.09682851798228316, -0.09538092363525082, -0.2954392574123434, 0.020648394912682676, -0.07537656136461206, -0.16248777335056583, -0.07368724829693502, -0.059690388674671586, 0.00026446107674289396, -0.3034860468091997, 0.11264490545098041, 0.005995008021567923, 0.1271952659716024, 0.008053015042851502, 0.04023139280694965, -0.036588506225647556, -0.006100998555838659, -0.050754092750139534, 0.042167971703551105, 0.20043464403951894, -0.1016530273985621, -0.1144564982088333, 0.3224153314446527, -0.22511577895666296, 0.009564079595981417, 0.14099064940032927, -0.2295925502438803, -0.09683156743444302, 0.30272662448319226, 0.08603409592162918, 0.17242246916567958, -0.08737557679666458, -0.05480614846345742, 0.019372011597796873, 0.28342589167122906, 0.21375145780778415, 0.07457662375039749, 0.2218074523214553, 0.2181869828695985, -0.0021460813445013925, 0.19279097322676633, -0.15274521758830226, 0.07780409681082175, -0.21139745377759273, -0.05780932063085807, -0.21399433070139304, 0.11297237436362617, -0.024224761609189415, -0.001920313058370674, 0.34069490946225217, 0.06266299786197173, 0.20378018638773546, -0.03442751533175643, 0.3602778909576906, 0.18078563041745913, 0.00900533765151694, -0.05179869101659672, 0.3755542780901935, 0.1982703633178529, 0.13871764703779607, -0.2934399008746196, -0.04783854680135846, -0.016647570986753783] |
1,802.00064 | Impact of low-$x$ resummation on QCD analysis of HERA data | Fits to the final combined HERA deep-inelastic scattering cross-section data
within the conventional DGLAP framework of QCD have shown some tension at low
$x$ and low $Q^2$. A resolution of this tension incorporating
$\ln(1/x)$-resummation terms into the HERAPDF fits is investigated using the
xFitter program. The kinematic region where this resummation is important is
delineated. Such high-energy resummation not only gives a better description of
the data, particularly of the longitudinal structure function $F_L$, it also
results in a gluon PDF which is steeply rising at low $x$ for low scales, $Q^2
\simeq 2.5$ GeV$^2$, contrary to the fixed-order NLO and NNLO gluon PDF.
| hep-ph | fits to the final combined hera deepinelastic scattering crosssection data within the conventional dglap framework of qcd have shown some tension at low x and low q2 a resolution of this tension incorporating ln1xresummation terms into the herapdf fits is investigated using the xfitter program the kinematic region where this resummation is important is delineated such highenergy resummation not only gives a better description of the data particularly of the longitudinal structure function f_l it also results in a gluon pdf which is steeply rising at low x for low scales q2 simeq 25 gev2 contrary to the fixedorder nlo and nnlo gluon pdf | [['fits', 'to', 'the', 'final', 'combined', 'hera', 'deepinelastic', 'scattering', 'crosssection', 'data', 'within', 'the', 'conventional', 'dglap', 'framework', 'of', 'qcd', 'have', 'shown', 'some', 'tension', 'at', 'low', 'x', 'and', 'low', 'q2', 'a', 'resolution', 'of', 'this', 'tension', 'incorporating', 'ln1xresummation', 'terms', 'into', 'the', 'herapdf', 'fits', 'is', 'investigated', 'using', 'the', 'xfitter', 'program', 'the', 'kinematic', 'region', 'where', 'this', 'resummation', 'is', 'important', 'is', 'delineated', 'such', 'highenergy', 'resummation', 'not', 'only', 'gives', 'a', 'better', 'description', 'of', 'the', 'data', 'particularly', 'of', 'the', 'longitudinal', 'structure', 'function', 'f_l', 'it', 'also', 'results', 'in', 'a', 'gluon', 'pdf', 'which', 'is', 'steeply', 'rising', 'at', 'low', 'x', 'for', 'low', 'scales', 'q2', 'simeq', '25', 'gev2', 'contrary', 'to', 'the', 'fixedorder', 'nlo', 'and', 'nnlo', 'gluon', 'pdf']] | [-0.04359908297192305, 0.14296142657929398, -0.17410321541817733, 0.17329441815913085, -0.04573800532572261, -0.057914157103050895, 0.0039825823375032945, 0.3711257692679618, -0.17849785232807971, -0.22467365983005577, 0.0218101851178731, -0.31637006363768166, 0.047782271467510934, 0.13394863015601358, 0.043155128063658905, 0.10291301641721749, 0.06188861307805603, -0.04275665844076322, -0.08662064769531339, -0.22252074872975428, 0.2830417642541664, 0.10483114921840504, 0.2691117055280116, 0.18325043069560407, 0.11338947625441965, 0.054992542986405414, -0.07793640381502874, -0.030382139047662033, -0.14948645041966177, 0.030930747088153385, 0.32274704023933454, 0.04427847962428644, 0.12211940542668176, -0.31890892644313357, -0.13034956538778486, -0.008654405460105215, 0.18002784010068087, 0.07733671251770326, 0.02145294049411144, -0.2137252006734025, 0.08954168812290413, -0.2533878612883606, -0.13811745284604432, -0.12229164212589487, -0.025493214982878237, -0.06835939034986879, -0.33414965564920796, 0.10380229849150197, -0.05415505121995523, 0.013916436845020762, 0.019329840353536375, -0.23470005000606903, -0.08234186930066535, 0.015068727785052315, 0.12423871862656861, 0.2169065611138578, 0.13156231499652296, -0.2391835228648507, -0.06036463922830027, 0.37297154727925375, 0.013100582455257767, -0.1319960029976605, 0.09375143723869786, -0.2987585779351806, -0.1650063477691661, 0.22463704104924087, 0.1991212676252121, 0.07626684783908168, -0.1617744708602154, 0.16387974557656687, -0.013581064249416, 0.21367139686622377, 0.0802734085421973, 0.03299978429234578, 0.14022779285690737, 0.23038132080030674, -0.05703904197858737, 0.02788641533669699, -0.1022667386230009, -0.06628518549779665, -0.4177793566752406, -0.023127039887680157, -0.06856447500764455, 0.06406173145738137, -0.1588218191690015, -0.12257360563883603, 0.32631685885881045, 0.1011460933820045, 0.2953335060218114, 0.06722215985431725, 0.3908778695588552, 0.14974296238110626, 0.11581331882535399, 0.07240935894253764, 0.23874697986299634, 0.15016321099399435, 0.15745970147471983, -0.19554185011487418, 0.04380841734050547, 0.009692764217124401] |
1,802.00065 | The origin of Mooij correlations in disordered metals | Sufficiently disordered metals display systematic deviations from the
behavior predicted by semi-classical Boltzmann transport theory. Here the
scattering events from impurities or thermal excitations can no longer be
considered as additive independent processes, as asserted by Matthiessen's rule
following from this picture. In the intermediate region between the regime of
good conduction and that of insulation, one typically finds a change of sign of
the temperature coefficient of resistivity (TCR), even at elevated temperature
spanning ambient conditions, a phenomenology that was first identified by Mooij
in 1973. Traditional weak coupling approaches to identify relevant corrections
to the Boltzmann picture focused on long distance interference effects such as
"weak localization", which are especially important in low dimensions (1D, 2D)
and close to the zero temperature limit. Here we formulate a strong-coupling
approach to tackle the interplay of strong disorder and lattice deformations
(phonons) in bulk three-dimensional metals at high temperatures. We identify a
polaronic mechanism of strong disorder renormalization, which describes how a
lattice locally responds to the relevant impurity potential. This mechanism,
which quantitatively captures the Mooij regime, is physically distinct and
unrelated to Anderson localization, but realizes early seminal ideas of
Anderson himself, concerning the interplay of disorder and lattice
deformations.
| cond-mat.str-el | sufficiently disordered metals display systematic deviations from the behavior predicted by semiclassical boltzmann transport theory here the scattering events from impurities or thermal excitations can no longer be considered as additive independent processes as asserted by matthiessens rule following from this picture in the intermediate region between the regime of good conduction and that of insulation one typically finds a change of sign of the temperature coefficient of resistivity tcr even at elevated temperature spanning ambient conditions a phenomenology that was first identified by mooij in 1973 traditional weak coupling approaches to identify relevant corrections to the boltzmann picture focused on long distance interference effects such as weak localization which are especially important in low dimensions 1d 2d and close to the zero temperature limit here we formulate a strongcoupling approach to tackle the interplay of strong disorder and lattice deformations phonons in bulk threedimensional metals at high temperatures we identify a polaronic mechanism of strong disorder renormalization which describes how a lattice locally responds to the relevant impurity potential this mechanism which quantitatively captures the mooij regime is physically distinct and unrelated to anderson localization but realizes early seminal ideas of anderson himself concerning the interplay of disorder and lattice deformations | [['sufficiently', 'disordered', 'metals', 'display', 'systematic', 'deviations', 'from', 'the', 'behavior', 'predicted', 'by', 'semiclassical', 'boltzmann', 'transport', 'theory', 'here', 'the', 'scattering', 'events', 'from', 'impurities', 'or', 'thermal', 'excitations', 'can', 'no', 'longer', 'be', 'considered', 'as', 'additive', 'independent', 'processes', 'as', 'asserted', 'by', 'matthiessens', 'rule', 'following', 'from', 'this', 'picture', 'in', 'the', 'intermediate', 'region', 'between', 'the', 'regime', 'of', 'good', 'conduction', 'and', 'that', 'of', 'insulation', 'one', 'typically', 'finds', 'a', 'change', 'of', 'sign', 'of', 'the', 'temperature', 'coefficient', 'of', 'resistivity', 'tcr', 'even', 'at', 'elevated', 'temperature', 'spanning', 'ambient', 'conditions', 'a', 'phenomenology', 'that', 'was', 'first', 'identified', 'by', 'mooij', 'in', '1973', 'traditional', 'weak', 'coupling', 'approaches', 'to', 'identify', 'relevant', 'corrections', 'to', 'the', 'boltzmann', 'picture', 'focused', 'on', 'long', 'distance', 'interference', 'effects', 'such', 'as', 'weak', 'localization', 'which', 'are', 'especially', 'important', 'in', 'low', 'dimensions', '1d', '2d', 'and', 'close', 'to', 'the', 'zero', 'temperature', 'limit', 'here', 'we', 'formulate', 'a', 'strongcoupling', 'approach', 'to', 'tackle', 'the', 'interplay', 'of', 'strong', 'disorder', 'and', 'lattice', 'deformations', 'phonons', 'in', 'bulk', 'threedimensional', 'metals', 'at', 'high', 'temperatures', 'we', 'identify', 'a', 'polaronic', 'mechanism', 'of', 'strong', 'disorder', 'renormalization', 'which', 'describes', 'how', 'a', 'lattice', 'locally', 'responds', 'to', 'the', 'relevant', 'impurity', 'potential', 'this', 'mechanism', 'which', 'quantitatively', 'captures', 'the', 'mooij', 'regime', 'is', 'physically', 'distinct', 'and', 'unrelated', 'to', 'anderson', 'localization', 'but', 'realizes', 'early', 'seminal', 'ideas', 'of', 'anderson', 'himself', 'concerning', 'the', 'interplay', 'of', 'disorder', 'and', 'lattice', 'deformations']] | [-0.130312247076164, 0.20911496012277975, -0.07980655352723333, 0.09974229148079614, -0.03559443563116844, -0.1910544382431314, 0.10097136070645221, 0.3315445010522657, -0.2856424031413211, -0.2577059736180276, 0.029144022858120722, -0.30697942078851237, -0.1555730115050579, 0.13929513555900702, -0.009359105475956348, 0.007649304543501965, -0.01131382574889772, -0.029330915666823876, -0.06168699715779818, -0.19693958319234892, 0.2872809436181468, 0.08081173324279746, 0.32573592788217093, 0.11308742282649337, 0.038830057974895554, 0.018693363985581562, 0.040382957530881065, 0.06653416503478984, -0.1400403083683312, 0.026860072428480455, 0.26093154792480244, -0.06813371393200394, 0.23337143759409168, -0.4220880452580381, -0.27090927392779157, 0.020421639140142073, 0.13068110525889304, 0.17292324196729386, -0.020310583797002228, -0.2591832339634547, 0.03245848554675237, -0.13812242906268613, -0.14845922862719582, -0.07648663114212306, 0.033815102954856166, -0.03675905207176647, -0.2514746204804684, 0.15686919346467895, 0.07432739826675394, 0.06586804691619139, -0.05929821381220907, -0.0800179654990535, -0.02013733267950097, 0.10547348115441048, 0.07808646033713963, 0.018138231732652034, 0.14787461039250588, -0.1432595094458412, -0.0917365498602215, 0.39137590993287985, -0.06803354211289915, -0.0948645576366712, 0.24356783522606487, -0.16305608803747534, -0.08475663487126331, 0.16167553229543316, 0.12800201332446715, 0.08539379876807775, -0.1601419544866364, 0.09083299477118423, -0.012230379880396741, 0.13615790807692757, 0.05177525012975208, 0.07773817896481032, 0.23240404086427227, 0.16000072943452415, 0.001562644485476436, 0.11609472473334097, -0.06153479116475486, -0.09424140272053456, -0.26681266624554256, -0.08011580471613325, -0.20779265091975802, 0.10310069120853291, -0.06430252202713602, -0.20146567663950107, 0.3557674605837368, 0.19673914543213553, 0.20726406482039111, -0.016552622649601965, 0.22631032862712047, 0.10692815705592108, 0.0451440637525503, 0.03408934242388298, 0.2551561491984625, 0.14603086345538607, 0.09994109593145088, -0.2743401599386338, 0.054057351484120185, 0.08631462865223241] |
1,802.00066 | Dynamics of Driver's Gaze: Explorations in Behavior Modeling & Maneuver
Prediction | The study and modeling of driver's gaze dynamics is important because, if and
how the driver is monitoring the driving environment is vital for driver
assistance in manual mode, for take-over requests in highly automated mode and
for semantic perception of the surround in fully autonomous mode. We developed
a machine vision based framework to classify driver's gaze into context rich
zones of interest and model driver's gaze behavior by representing gaze
dynamics over a time period using gaze accumulation, glance duration and glance
frequencies. As a use case, we explore the driver's gaze dynamic patterns
during maneuvers executed in freeway driving, namely, left lane change
maneuver, right lane change maneuver and lane keeping. It is shown that
condensing gaze dynamics into durations and frequencies leads to recurring
patterns based on driver activities. Furthermore, modeling these patterns show
predictive powers in maneuver detection up to a few hundred milliseconds a
priori.
| cs.CV | the study and modeling of drivers gaze dynamics is important because if and how the driver is monitoring the driving environment is vital for driver assistance in manual mode for takeover requests in highly automated mode and for semantic perception of the surround in fully autonomous mode we developed a machine vision based framework to classify drivers gaze into context rich zones of interest and model drivers gaze behavior by representing gaze dynamics over a time period using gaze accumulation glance duration and glance frequencies as a use case we explore the drivers gaze dynamic patterns during maneuvers executed in freeway driving namely left lane change maneuver right lane change maneuver and lane keeping it is shown that condensing gaze dynamics into durations and frequencies leads to recurring patterns based on driver activities furthermore modeling these patterns show predictive powers in maneuver detection up to a few hundred milliseconds a priori | [['the', 'study', 'and', 'modeling', 'of', 'drivers', 'gaze', 'dynamics', 'is', 'important', 'because', 'if', 'and', 'how', 'the', 'driver', 'is', 'monitoring', 'the', 'driving', 'environment', 'is', 'vital', 'for', 'driver', 'assistance', 'in', 'manual', 'mode', 'for', 'takeover', 'requests', 'in', 'highly', 'automated', 'mode', 'and', 'for', 'semantic', 'perception', 'of', 'the', 'surround', 'in', 'fully', 'autonomous', 'mode', 'we', 'developed', 'a', 'machine', 'vision', 'based', 'framework', 'to', 'classify', 'drivers', 'gaze', 'into', 'context', 'rich', 'zones', 'of', 'interest', 'and', 'model', 'drivers', 'gaze', 'behavior', 'by', 'representing', 'gaze', 'dynamics', 'over', 'a', 'time', 'period', 'using', 'gaze', 'accumulation', 'glance', 'duration', 'and', 'glance', 'frequencies', 'as', 'a', 'use', 'case', 'we', 'explore', 'the', 'drivers', 'gaze', 'dynamic', 'patterns', 'during', 'maneuvers', 'executed', 'in', 'freeway', 'driving', 'namely', 'left', 'lane', 'change', 'maneuver', 'right', 'lane', 'change', 'maneuver', 'and', 'lane', 'keeping', 'it', 'is', 'shown', 'that', 'condensing', 'gaze', 'dynamics', 'into', 'durations', 'and', 'frequencies', 'leads', 'to', 'recurring', 'patterns', 'based', 'on', 'driver', 'activities', 'furthermore', 'modeling', 'these', 'patterns', 'show', 'predictive', 'powers', 'in', 'maneuver', 'detection', 'up', 'to', 'a', 'few', 'hundred', 'milliseconds', 'a', 'priori']] | [-0.13347732129472845, 0.11870007431720513, -0.09203957974145942, 0.03526959567259849, -0.11673284279466267, -0.19510697444210087, 0.049250801908783615, 0.46837469728182485, -0.2602834696449734, -0.3006844280521996, 0.11728822922810915, -0.22817559796848044, -0.1719148855360336, 0.21957606772448102, -0.13573990229961297, 0.0286239455608244, 0.09250056410566071, 0.03053926850749266, 0.0616343819346612, -0.1472766931008375, 0.22479236552615306, 0.024609655781729235, 0.2912351009590144, -0.005616190611995411, 0.1256852504667758, 0.02409141400939976, -0.04250578206153555, -0.0640815422617343, -0.04794600766348932, 0.0595806574677148, 0.32757019081202315, 0.1549086573916111, 0.33714860753581816, -0.46244233143546726, -0.22846503280695304, 0.0757923253336983, 0.1635700078994893, 0.05769169855005546, -0.05223624110749972, -0.36145357566651276, 0.05713696792623065, -0.1812388841309492, -0.11003783352006942, -0.06315032539839875, 0.10883540656133894, 0.00927308268709392, -0.24353869760174626, 0.03185589889847729, 0.05653788643235353, 0.14041462154528558, -0.08975972049709237, 0.028410328083381748, -0.009638680959280752, 0.2780306242184331, 0.10205445223293631, 0.038297953329277254, 0.2199456541095891, -0.19757683600132533, -0.12785433769297003, 0.4038766102960938, -0.006104442614765949, -0.1698062424517132, 0.21024612368497725, -0.11779490999248347, -0.11008963937445587, 0.1092034921578952, 0.23193053263224142, 0.12062145870746366, -0.151209382463666, -0.08705176249268273, 0.04693390176144262, 0.22617022929996844, 0.07712430049918148, -0.0415532975819961, 0.23622550763535183, 0.24739395146140988, 0.09167136008148112, 0.08863792322199816, -0.130724331109618, -0.12608602894655127, -0.22166894674177792, -0.0977258619155414, -0.05433177172968824, -0.048271552670268274, -0.03797759466107999, -0.060019440724420364, 0.46388403003085527, 0.2250101315659403, 0.17588792756101154, 0.060878934597732214, 0.3449055211655549, 0.057836289296315256, 0.06068015269696518, 0.08316110939231534, 0.16137537367361296, -0.027635331011210747, 0.16847074885362304, -0.21650291687580725, 0.16413318285323827, 0.07135647141593601] |
1,802.00067 | On the separability of unitarily invariant random quantum states - the
unbalanced regime | We study entanglement-related properties of random quantum states which are
unitarily invariant, in the sense that their distribution is left unchanged by
conjugation with arbitrary unitary operators. In the large matrix size limit,
the distribution of these random quantum states is characterized by their
limiting spectrum, a compactly supported probability distribution. We prove
several results characterizing entanglement and the PPT property of random
bipartite unitarily invariant quantum states in terms of the limiting spectral
distribution, in the unbalanced asymptotical regime where one of the two
subsystems is fixed, while the other one grows in size.
| math-ph math.MP math.PR quant-ph | we study entanglementrelated properties of random quantum states which are unitarily invariant in the sense that their distribution is left unchanged by conjugation with arbitrary unitary operators in the large matrix size limit the distribution of these random quantum states is characterized by their limiting spectrum a compactly supported probability distribution we prove several results characterizing entanglement and the ppt property of random bipartite unitarily invariant quantum states in terms of the limiting spectral distribution in the unbalanced asymptotical regime where one of the two subsystems is fixed while the other one grows in size | [['we', 'study', 'entanglementrelated', 'properties', 'of', 'random', 'quantum', 'states', 'which', 'are', 'unitarily', 'invariant', 'in', 'the', 'sense', 'that', 'their', 'distribution', 'is', 'left', 'unchanged', 'by', 'conjugation', 'with', 'arbitrary', 'unitary', 'operators', 'in', 'the', 'large', 'matrix', 'size', 'limit', 'the', 'distribution', 'of', 'these', 'random', 'quantum', 'states', 'is', 'characterized', 'by', 'their', 'limiting', 'spectrum', 'a', 'compactly', 'supported', 'probability', 'distribution', 'we', 'prove', 'several', 'results', 'characterizing', 'entanglement', 'and', 'the', 'ppt', 'property', 'of', 'random', 'bipartite', 'unitarily', 'invariant', 'quantum', 'states', 'in', 'terms', 'of', 'the', 'limiting', 'spectral', 'distribution', 'in', 'the', 'unbalanced', 'asymptotical', 'regime', 'where', 'one', 'of', 'the', 'two', 'subsystems', 'is', 'fixed', 'while', 'the', 'other', 'one', 'grows', 'in', 'size']] | [-0.15613907893237314, 0.2705593387204173, -0.08438328678327564, 0.056549301247210484, 0.07163471227609798, -0.15050302349325073, -0.0036473027332440803, 0.3369181447809464, -0.26523859536177236, -0.20817080956736678, 0.09356652191276417, -0.29920514494572814, -0.1140704861744062, 0.11593073293272602, -0.054091653806206424, 0.16373140214893378, 0.04770355023639767, 0.06475957581087162, -0.0865163973226261, -0.24467736781623803, 0.39170268390229657, -0.004212912886501535, 0.29715973111359695, 0.026147290221170374, 0.06240730764050233, 0.028611953737900445, -0.005390173353646931, -0.00766281923769336, -0.08749147406817524, 0.0844009231120397, 0.2373404054461341, 0.10756410823791827, 0.2433873822618472, -0.36358883885764764, -0.15093574098458415, 0.13986128188767716, 0.1259284730559509, 0.06947721402822553, -0.002373891502716824, -0.3246500779776589, 0.11061440526850913, -0.16605311641959766, -0.1763409534567281, -0.056369177430966186, 0.038949382589443735, 0.02378215569892506, -0.24856836501705018, 0.08262247448591026, 0.12232173945950835, 0.03201331061213032, -0.003352020357392336, -0.0797030508763304, -0.023244023212770883, 0.15676788383923274, -0.0018316523392537707, -0.05496241215763516, 0.14222575870685672, -0.13371142398958144, -0.0913251546530151, 0.3390473253044643, -0.06906069540663769, -0.2559672277224691, 0.13894251768697838, -0.19928504742289843, -0.1374937843776455, 0.07140071949382362, 0.08512780092362511, 0.12517177437088992, -0.11668360621521348, 0.156491790711267, -0.0801748371830112, 0.12250207740029222, 0.0647035727718551, 0.16599280834688168, 0.15022979837989336, 0.030040598523459937, 0.1360610596933647, 0.19926155799031747, -0.020568661547363983, -0.18280938181437945, -0.2933786646806096, -0.15295349121289817, -0.2943613053054402, 0.11685242718085646, -0.12935152117049592, -0.18954699245330534, 0.43823873043844574, 0.07930308525989714, 0.24515205077630908, 0.09278626049452118, 0.20979099861885372, 0.15982855580453026, 0.006357431710746727, 0.10421696505754402, 0.16079908172403903, 0.18617010934670505, -0.013396111030229613, -0.21169516412345202, 0.07633426992320701, 0.05689028647581213] |
1,802.00068 | The Supersymmetric WKB Formalism is Not Exact for All Additive Shape
Invariant Potentials | Following the verification of the conjecture made by Comtet, Bandrauk and
Campbell that the supersymmetry-inspired semiclassical method known as SWKB is
exact for the conventional additive shape invariant potentials, it was widely
believed that SWKB yields exact results for all additive shape invariant
potentials. In this paper we present a concrete example of an additive shape
invariant potential for which the SWKB method fails to produce exact results.
| quant-ph hep-th | following the verification of the conjecture made by comtet bandrauk and campbell that the supersymmetryinspired semiclassical method known as swkb is exact for the conventional additive shape invariant potentials it was widely believed that swkb yields exact results for all additive shape invariant potentials in this paper we present a concrete example of an additive shape invariant potential for which the swkb method fails to produce exact results | [['following', 'the', 'verification', 'of', 'the', 'conjecture', 'made', 'by', 'comtet', 'bandrauk', 'and', 'campbell', 'that', 'the', 'supersymmetryinspired', 'semiclassical', 'method', 'known', 'as', 'swkb', 'is', 'exact', 'for', 'the', 'conventional', 'additive', 'shape', 'invariant', 'potentials', 'it', 'was', 'widely', 'believed', 'that', 'swkb', 'yields', 'exact', 'results', 'for', 'all', 'additive', 'shape', 'invariant', 'potentials', 'in', 'this', 'paper', 'we', 'present', 'a', 'concrete', 'example', 'of', 'an', 'additive', 'shape', 'invariant', 'potential', 'for', 'which', 'the', 'swkb', 'method', 'fails', 'to', 'produce', 'exact', 'results']] | [-0.07397218897883127, 0.037659686748781104, -0.1380186925378086, 0.13899874755306474, -0.04372375185337307, -0.16389387913409675, -0.028496401448761904, 0.3500677221107171, -0.21835635393969158, -0.2700919380216901, 0.06363024482496583, -0.21042451032770992, -0.22982454633534843, 0.23324441731865728, -0.10421001111893956, 0.14314849129808482, 0.036359240054222405, 0.04995539578706471, -0.058554408611354435, -0.24378539335483046, 0.29287552120469845, 0.055119050055075045, 0.2593649788273137, 0.07522858836368393, 0.08521081929776206, 0.02645877773748405, -0.01066621206005785, 0.016189053418364987, -0.16847921464242105, 0.12473258944645302, 0.22555969980781648, 0.058713775142026484, 0.17852161318730952, -0.35344603410296477, -0.19449149364424842, 0.1017367409215545, 0.12173795138847139, 0.15240933010597893, -0.08689095765185445, -0.2761491482326789, 0.12570571636697694, -0.17884464660631633, -0.18685500180251452, -0.12967819587063434, 0.07242738492369874, 0.010356717617876494, -0.29454598061517995, 0.08024910616396523, 0.13795610383820178, -0.017307361351576313, -0.08107561795318972, -0.12604487070869377, 0.043902559956507894, 0.0944458975373253, 0.044822573394222714, 0.055379940127370075, 0.0731913934030862, -0.08582283355948973, -0.11740796149138417, 0.365380936441248, -0.08141826322118043, -0.20864933378883263, 0.15150734508382296, -0.04599199091682016, -0.1534618846238104, 0.13285179355584864, 0.0541661708066657, 0.10885232520018663, -0.16559564737853275, 0.15349839050096892, -0.07509566444570004, 0.13582003359907002, 0.07083398248277493, -0.02263829105797766, 0.12031476760505518, 0.061514804084131965, 0.03780337966589341, 0.15576148202031184, -0.03385227234728301, -0.11676882399913313, -0.3006100936500884, -0.11836001828292024, -0.18256511478928097, 0.06407959135457762, -0.04624702529473501, -0.22885315487189078, 0.3689836354286813, 0.1346845202036758, 0.15821280408261426, 0.10516614619983054, 0.29810854169859813, 0.12086568423720605, 0.0027707216621779686, 0.02920838833244434, 0.20803568470500297, 0.1440104489986187, 0.02285762619115968, -0.17353553769748603, 0.0607728544594859, 0.11922579273970714] |
1,802.00069 | Leveraging Adiabatic Quantum Computation for Election Forecasting | Accurate, reliable sampling from fully-connected graphs with arbitrary
correlations is a difficult problem. Such sampling requires knowledge of the
probabilities of observing every possible state of a graph. As graph size
grows, the number of model states becomes intractably large and efficient
computation requires full sampling be replaced with heuristics and algorithms
that are only approximations of full sampling. This work investigates the
potential impact of adiabatic quantum computation for sampling purposes,
building on recent successes training Boltzmann machines using a quantum
device. We investigate the use case of quantum computation to train Boltzmann
machines for predicting the 2016 Presidential election.
| quant-ph cs.ET cs.LG | accurate reliable sampling from fullyconnected graphs with arbitrary correlations is a difficult problem such sampling requires knowledge of the probabilities of observing every possible state of a graph as graph size grows the number of model states becomes intractably large and efficient computation requires full sampling be replaced with heuristics and algorithms that are only approximations of full sampling this work investigates the potential impact of adiabatic quantum computation for sampling purposes building on recent successes training boltzmann machines using a quantum device we investigate the use case of quantum computation to train boltzmann machines for predicting the 2016 presidential election | [['accurate', 'reliable', 'sampling', 'from', 'fullyconnected', 'graphs', 'with', 'arbitrary', 'correlations', 'is', 'a', 'difficult', 'problem', 'such', 'sampling', 'requires', 'knowledge', 'of', 'the', 'probabilities', 'of', 'observing', 'every', 'possible', 'state', 'of', 'a', 'graph', 'as', 'graph', 'size', 'grows', 'the', 'number', 'of', 'model', 'states', 'becomes', 'intractably', 'large', 'and', 'efficient', 'computation', 'requires', 'full', 'sampling', 'be', 'replaced', 'with', 'heuristics', 'and', 'algorithms', 'that', 'are', 'only', 'approximations', 'of', 'full', 'sampling', 'this', 'work', 'investigates', 'the', 'potential', 'impact', 'of', 'adiabatic', 'quantum', 'computation', 'for', 'sampling', 'purposes', 'building', 'on', 'recent', 'successes', 'training', 'boltzmann', 'machines', 'using', 'a', 'quantum', 'device', 'we', 'investigate', 'the', 'use', 'case', 'of', 'quantum', 'computation', 'to', 'train', 'boltzmann', 'machines', 'for', 'predicting', 'the', '2016', 'presidential', 'election']] | [-0.10650050407621346, 0.11955667970388538, -0.06054000409854816, 0.08039672316817364, -0.10443675797893712, -0.18283090008293637, 0.11803207759016959, 0.38726489596290165, -0.2519336322387035, -0.3486814024387905, 0.09609493258695054, -0.2312922192055105, -0.11525861214901699, 0.18279955582462692, -0.06837074236286168, 0.15038597927253583, 0.17793947177948338, 0.02826799697583855, -0.042426924565276775, -0.28971380929723106, 0.2646145205691199, 0.0783674088733197, 0.2935231237644606, -0.00882389210164547, 0.11514464230046119, 0.08017624165438632, -0.03622854460436519, -0.008379939344186004, -0.09845249237192133, 0.13442231222841944, 0.27354966897729527, 0.18267168244346976, 0.3616176610904755, -0.4471831426314323, -0.19822123071344772, 0.1699974328690983, 0.1126708170574269, 0.20364154412959803, -0.005069805231950439, -0.24111438233700425, 0.05484316596244969, -0.18054937066436552, -0.06126538902465807, -0.14277286617325083, 0.02276391808939452, 0.0002475726466607487, -0.29838091799629723, 0.03782209147938924, 0.029705423232407706, 0.04358152666424244, 0.03136764351960899, -0.11555629133219177, 0.0625414509040368, 0.1383304159147757, -0.045592620465120685, 0.01281507569134678, 0.123671585038687, -0.16863415358671088, -0.20895176118073783, 0.38097347610510224, 0.024650508685424777, -0.16872946805514322, 0.15522355381583813, -0.05187489159202369, -0.14752641831994942, 0.09903586896062636, 0.20060289511918136, 0.1258848454010221, -0.09383804866546157, 0.10350354665101939, -0.002236490073327971, 0.14120728985434122, 0.046916136365974005, 0.03269614560511148, 0.1556216808736767, 0.23646950946733503, 0.061802057899756006, 0.14942465684178405, -0.08209409169843512, -0.15163867665733682, -0.2347597271840245, -0.14904535913279182, -0.2949224768925716, 0.06073716255642547, -0.09606414180367696, -0.20148060929103948, 0.3784358426951573, 0.1880847416808921, 0.19418393689701058, 0.12712492647184298, 0.34275038874625124, 0.07673278188051674, 0.040611678245707904, 0.15602744326438053, 0.14708016393129889, 0.13172421505730045, 0.08391721768415358, -0.16830466437559244, 0.1149069668626007, 0.04452614044069801] |
1,802.0007 | Non-scattering Metasurface-bound Cavities for Field Localization,
Enhancement, and Suppression | We propose and analyse metasurface-bound invisible (non-scattering) partially
open cavities where the inside field distribution can be engineered. It is
demonstrated both theoretically and experimentally that the cavities exhibit
unidirectional invisibility at the operating frequency with enhanced or
suppressed field at different positions inside the cavity volume. Several
examples of applications of the designed cavities are proposed and analyzed, in
particular, cloaking sensors and obstacles, enhancement of emission, and
"invisible waveguides". The non-scattering mode excited in the proposed cavity
is driven by the incident wave and resembles an ideal bound state in the
continuum of electromagnetic frequency spectrum. In contrast to known bound
states in the continuum, the mode can stay localized in the cavity infinitely
long, provided that the incident wave illuminates the cavity.
| physics.app-ph | we propose and analyse metasurfacebound invisible nonscattering partially open cavities where the inside field distribution can be engineered it is demonstrated both theoretically and experimentally that the cavities exhibit unidirectional invisibility at the operating frequency with enhanced or suppressed field at different positions inside the cavity volume several examples of applications of the designed cavities are proposed and analyzed in particular cloaking sensors and obstacles enhancement of emission and invisible waveguides the nonscattering mode excited in the proposed cavity is driven by the incident wave and resembles an ideal bound state in the continuum of electromagnetic frequency spectrum in contrast to known bound states in the continuum the mode can stay localized in the cavity infinitely long provided that the incident wave illuminates the cavity | [['we', 'propose', 'and', 'analyse', 'metasurfacebound', 'invisible', 'nonscattering', 'partially', 'open', 'cavities', 'where', 'the', 'inside', 'field', 'distribution', 'can', 'be', 'engineered', 'it', 'is', 'demonstrated', 'both', 'theoretically', 'and', 'experimentally', 'that', 'the', 'cavities', 'exhibit', 'unidirectional', 'invisibility', 'at', 'the', 'operating', 'frequency', 'with', 'enhanced', 'or', 'suppressed', 'field', 'at', 'different', 'positions', 'inside', 'the', 'cavity', 'volume', 'several', 'examples', 'of', 'applications', 'of', 'the', 'designed', 'cavities', 'are', 'proposed', 'and', 'analyzed', 'in', 'particular', 'cloaking', 'sensors', 'and', 'obstacles', 'enhancement', 'of', 'emission', 'and', 'invisible', 'waveguides', 'the', 'nonscattering', 'mode', 'excited', 'in', 'the', 'proposed', 'cavity', 'is', 'driven', 'by', 'the', 'incident', 'wave', 'and', 'resembles', 'an', 'ideal', 'bound', 'state', 'in', 'the', 'continuum', 'of', 'electromagnetic', 'frequency', 'spectrum', 'in', 'contrast', 'to', 'known', 'bound', 'states', 'in', 'the', 'continuum', 'the', 'mode', 'can', 'stay', 'localized', 'in', 'the', 'cavity', 'infinitely', 'long', 'provided', 'that', 'the', 'incident', 'wave', 'illuminates', 'the', 'cavity']] | [-0.17429742357701122, 0.19386698730440619, -0.01978532351823824, 0.005851390733075659, -0.026070781840732502, -0.15382920077911788, -0.0034772622804608074, 0.45436019291199986, -0.22571034758478956, -0.2756194374373844, 0.08392692353734146, -0.2849404160684395, -0.10014052844734021, 0.19559870337158622, 0.010191829679834266, 0.07258669960485291, -0.0022237886479424852, 0.01320128181138106, 0.05140516964433294, -0.11993742352651973, 0.2942467092258495, 0.044704736570917794, 0.3322121606230916, 0.06455956228948649, 0.08020718393832325, -0.03037609966967495, 0.05145480800344939, -0.017130729047611596, -0.07819026780763975, 0.06568065269487805, 0.2508265688234279, 0.028496793041291137, 0.2264633100600012, -0.46543184005760496, -0.20787755578696246, 0.054761413880060575, 0.21335183407720779, 0.11419301748936696, -0.06405434274629149, -0.31917849325785236, 0.017106749012225097, -0.1037123569572765, -0.20939273977907555, 0.004865755013475615, -0.006028121181448261, 0.0015592321588267241, -0.23386176789720212, 0.019790414111470925, 0.051778094014040224, -0.008344467428903426, -0.05840383431941812, -0.026965444505725418, -0.017915930045062617, 0.06849360551812776, -0.002413625727527805, -0.009218293662753797, 0.17075707538489013, -0.1567998373460385, -0.09110764466904878, 0.3454883918917227, -0.09510697475484302, -0.17075951929174124, 0.19978587262167205, -0.19495074762099032, 0.026855966718416783, 0.20598610431977338, 0.17695946815694052, 0.07490861775999468, -0.0868447750685699, 0.05373689167731021, -0.043880900660775705, 0.17578452693640195, 0.1592677658960794, 0.11541850748096383, 0.21988531900569797, 0.13541296056111254, 0.02080112553038259, 0.20798429794048123, -0.11372921421688291, -0.04689966076834788, -0.2909866879589014, -0.08633957453346211, -0.21447374867866822, -0.013728801648539957, -0.03199140620692502, -0.15619462076386798, 0.3798782703477979, 0.1303830289456997, 0.1492001654302341, -0.053172945089998744, 0.30640821926476014, 0.1355100474545672, 0.08214156169654621, 0.11618575567920361, 0.36593089814508156, 0.13814513284089644, 0.07433987312739895, -0.26596805532631884, -0.021658943406486462, -0.053239619894509] |
1,802.00071 | Conditions for Parametric and Free-Carrier Oscillation in Silicon Ring
Cavities | We model optical parametric oscillation in ring cavities with two-photon
absorption, focusing on silicon at 1.55$\mu$m. Oscillation is possible if
free-carrier absorption can be mitigated; this can be achieved using carrier
sweep-out in a reverse-biased p-i-n junction to reduce the carrier lifetime. By
varying the pump power, detuning, and reverse-bias voltage, it is possible to
generate frequency combs in cavities with both normal and anomalous dispersion
at a wide range of wavelengths including 1.55$\mu$m. Furthermore, a
free-carrier self-pulsing instability leads to rich dynamics when the carrier
lifetime is sufficiently long.
| physics.optics | we model optical parametric oscillation in ring cavities with twophoton absorption focusing on silicon at 155mum oscillation is possible if freecarrier absorption can be mitigated this can be achieved using carrier sweepout in a reversebiased pin junction to reduce the carrier lifetime by varying the pump power detuning and reversebias voltage it is possible to generate frequency combs in cavities with both normal and anomalous dispersion at a wide range of wavelengths including 155mum furthermore a freecarrier selfpulsing instability leads to rich dynamics when the carrier lifetime is sufficiently long | [['we', 'model', 'optical', 'parametric', 'oscillation', 'in', 'ring', 'cavities', 'with', 'twophoton', 'absorption', 'focusing', 'on', 'silicon', 'at', '155mum', 'oscillation', 'is', 'possible', 'if', 'freecarrier', 'absorption', 'can', 'be', 'mitigated', 'this', 'can', 'be', 'achieved', 'using', 'carrier', 'sweepout', 'in', 'a', 'reversebiased', 'pin', 'junction', 'to', 'reduce', 'the', 'carrier', 'lifetime', 'by', 'varying', 'the', 'pump', 'power', 'detuning', 'and', 'reversebias', 'voltage', 'it', 'is', 'possible', 'to', 'generate', 'frequency', 'combs', 'in', 'cavities', 'with', 'both', 'normal', 'and', 'anomalous', 'dispersion', 'at', 'a', 'wide', 'range', 'of', 'wavelengths', 'including', '155mum', 'furthermore', 'a', 'freecarrier', 'selfpulsing', 'instability', 'leads', 'to', 'rich', 'dynamics', 'when', 'the', 'carrier', 'lifetime', 'is', 'sufficiently', 'long']] | [-0.1530669512330658, 0.21546744777717525, -0.019143544592791134, -0.01602076673362818, -0.04660559193645086, -0.21990575735043322, 0.06473066880910967, 0.49091912425226636, -0.28551298692408533, -0.253562560180823, 0.05680080564925447, -0.25207680379971864, -0.05997020879553424, 0.27827314078135207, -0.028122053750687177, 0.01672115337310566, -0.018746216719349226, -0.08187581093774901, 0.02216902234358713, -0.13984685850122736, 0.23989908202654786, 0.04784466403329538, 0.3235490183552934, 0.07527401247837891, 0.07381931034744614, -0.04152774214744568, 0.09296495169401169, -0.026757527080674966, -0.11155808629571563, 0.011360392212453815, 0.2867548199034192, -0.05097729698237446, 0.2365603992715478, -0.3963642856520083, -0.2566481363364599, 0.08726506664210723, 0.17380316946396812, 0.16911423566958142, -0.03371908993156265, -0.24756453205417428, 0.05967299109842214, -0.16442828866549664, -0.13066762241845328, -0.02186107167767154, 0.025804379168483944, 0.05349762489851047, -0.28274404398269126, 0.07775812164440545, -0.005318674729723069, 0.02431919401925471, 0.008248147533999549, -0.00852509769028984, -0.0530136732229342, 0.026117920607794075, -0.04227445551789262, -0.022772217388006135, 0.1871326661264498, -0.1075663197986109, -0.060624119225475524, 0.32936492961663233, -0.1471343451179564, -0.08069963150968154, 0.14303851625364689, -0.2342974904872891, 0.041667368149177895, 0.21723952285117573, 0.1478782319256829, 0.040287900881634815, -0.10838988358365087, 0.04292549174149624, 0.03617600089766913, 0.26587319974528834, 0.1994465615082946, 0.15023579934818876, 0.24237825686319006, 0.2413663426388262, 0.047918160761926426, 0.10688982068612758, -0.14121069602616546, 0.03404968689946044, -0.20905079559112588, -0.034378991338113944, -0.156655022315681, 0.10407922434517079, -0.0616354199123129, -0.11597279519256619, 0.43895049972666633, 0.11903329852761493, 0.1500381022070845, -0.03372802479813496, 0.31134572773137026, 0.22004606894527873, 0.11140909976222449, -0.007236350995178024, 0.2867540870172282, 0.15636032718595946, 0.09964150298490293, -0.3166369067453262, 0.01346553580628501, -0.07032448723653538] |
1,802.00072 | Asymmetric emission of the [OIII]$\lambda$5007 profile in narrow-line
Seyfert 1 galaxies | Many active galactic nuclei (AGN) and particularly narrow-line Seyfert 1
(NLS1) galaxies, usually exhibit blueshifts and blue wings in several emission
lines, which are mainly associated with outflows and strong winds. In order to
study the radial velocity difference between the narrow component of H$\beta$
and the core component of [OIII]$\lambda$5007 and the asymmetric emission of
this forbidden line, we investigate a sample of NLS1 galaxies . One of the aims
of this paper is to analyze the blue wings of the [OIII]$\lambda$5007 profiles
and their relation with the central engine. We have obtained and studied
medium-resolution spectra (190 km s$^{-1}$ FWHM at H$\beta$) of a sample of 28
NLS1 galaxies in the optical range 4300 - 5200\AA. We performed Gaussian
decomposition to the H$\beta$ and [OIII]$\lambda\lambda$4959,5007 emission
profiles in order to study the distinct components of these lines. A new blue
outlier galaxy is found, in which the center of the core component of [OIII] is
blueshifted by 405 km s$^{-1}$ relative to the center of the narrow component
of H$\beta$ line. We confirmed a previously known correlation between the
blueshift and the full width half maximum (FWHM) of the core component of
[OIII]$\lambda$5007 line. We also corroborated the correlation between the
latter and the velocity of the centroid of the blue wing. On the other hand, by
studying the radial velocity difference between the blue end of the asymmetric
emission and the centroid of the core component of [OIII], we found a
correlation between it and the central black hole mass and, therefore, with the
luminosity of the broad component of H$\beta$. Finally, we found a moderate
correlation between the luminosity of the [OIII] blue wing and the black hole
mass.
| astro-ph.GA | many active galactic nuclei agn and particularly narrowline seyfert 1 nls1 galaxies usually exhibit blueshifts and blue wings in several emission lines which are mainly associated with outflows and strong winds in order to study the radial velocity difference between the narrow component of hbeta and the core component of oiiilambda5007 and the asymmetric emission of this forbidden line we investigate a sample of nls1 galaxies one of the aims of this paper is to analyze the blue wings of the oiiilambda5007 profiles and their relation with the central engine we have obtained and studied mediumresolution spectra 190 km s1 fwhm at hbeta of a sample of 28 nls1 galaxies in the optical range 4300 5200aa we performed gaussian decomposition to the hbeta and oiiilambdalambda49595007 emission profiles in order to study the distinct components of these lines a new blue outlier galaxy is found in which the center of the core component of oiii is blueshifted by 405 km s1 relative to the center of the narrow component of hbeta line we confirmed a previously known correlation between the blueshift and the full width half maximum fwhm of the core component of oiiilambda5007 line we also corroborated the correlation between the latter and the velocity of the centroid of the blue wing on the other hand by studying the radial velocity difference between the blue end of the asymmetric emission and the centroid of the core component of oiii we found a correlation between it and the central black hole mass and therefore with the luminosity of the broad component of hbeta finally we found a moderate correlation between the luminosity of the oiii blue wing and the black hole mass | [['many', 'active', 'galactic', 'nuclei', 'agn', 'and', 'particularly', 'narrowline', 'seyfert', '1', 'nls1', 'galaxies', 'usually', 'exhibit', 'blueshifts', 'and', 'blue', 'wings', 'in', 'several', 'emission', 'lines', 'which', 'are', 'mainly', 'associated', 'with', 'outflows', 'and', 'strong', 'winds', 'in', 'order', 'to', 'study', 'the', 'radial', 'velocity', 'difference', 'between', 'the', 'narrow', 'component', 'of', 'hbeta', 'and', 'the', 'core', 'component', 'of', 'oiiilambda5007', 'and', 'the', 'asymmetric', 'emission', 'of', 'this', 'forbidden', 'line', 'we', 'investigate', 'a', 'sample', 'of', 'nls1', 'galaxies', 'one', 'of', 'the', 'aims', 'of', 'this', 'paper', 'is', 'to', 'analyze', 'the', 'blue', 'wings', 'of', 'the', 'oiiilambda5007', 'profiles', 'and', 'their', 'relation', 'with', 'the', 'central', 'engine', 'we', 'have', 'obtained', 'and', 'studied', 'mediumresolution', 'spectra', '190', 'km', 's1', 'fwhm', 'at', 'hbeta', 'of', 'a', 'sample', 'of', '28', 'nls1', 'galaxies', 'in', 'the', 'optical', 'range', '4300', '5200aa', 'we', 'performed', 'gaussian', 'decomposition', 'to', 'the', 'hbeta', 'and', 'oiiilambdalambda49595007', 'emission', 'profiles', 'in', 'order', 'to', 'study', 'the', 'distinct', 'components', 'of', 'these', 'lines', 'a', 'new', 'blue', 'outlier', 'galaxy', 'is', 'found', 'in', 'which', 'the', 'center', 'of', 'the', 'core', 'component', 'of', 'oiii', 'is', 'blueshifted', 'by', '405', 'km', 's1', 'relative', 'to', 'the', 'center', 'of', 'the', 'narrow', 'component', 'of', 'hbeta', 'line', 'we', 'confirmed', 'a', 'previously', 'known', 'correlation', 'between', 'the', 'blueshift', 'and', 'the', 'full', 'width', 'half', 'maximum', 'fwhm', 'of', 'the', 'core', 'component', 'of', 'oiiilambda5007', 'line', 'we', 'also', 'corroborated', 'the', 'correlation', 'between', 'the', 'latter', 'and', 'the', 'velocity', 'of', 'the', 'centroid', 'of', 'the', 'blue', 'wing', 'on', 'the', 'other', 'hand', 'by', 'studying', 'the', 'radial', 'velocity', 'difference', 'between', 'the', 'blue', 'end', 'of', 'the', 'asymmetric', 'emission', 'and', 'the', 'centroid', 'of', 'the', 'core', 'component', 'of', 'oiii', 'we', 'found', 'a', 'correlation', 'between', 'it', 'and', 'the', 'central', 'black', 'hole', 'mass', 'and', 'therefore', 'with', 'the', 'luminosity', 'of', 'the', 'broad', 'component', 'of', 'hbeta', 'finally', 'we', 'found', 'a', 'moderate', 'correlation', 'between', 'the', 'luminosity', 'of', 'the', 'oiii', 'blue', 'wing', 'and', 'the', 'black', 'hole', 'mass']] | [-0.05667258488524745, 0.043291204051343304, -0.022044511854953507, 0.08832017990911306, -0.07441739791513709, -0.10517994047961202, 0.01765296908693713, 0.5143628846257394, -0.1286445652413119, -0.2955261572791111, 0.043719638850344376, -0.3115744101682353, 0.005086909107916932, 0.17807423566332173, 0.018645823648981617, -0.05003255137550608, -0.0065690250458275345, -0.08449472305514051, -0.05498049397819454, -0.15765781560332723, 0.345414724301222, 0.039263389883662354, 0.2115105403375106, 0.03361153101972785, 0.05662733795340057, -0.0982662116838845, -0.0813588244108039, 0.024672819102627103, -0.10089290808070968, 0.1133925976377524, 0.20289657826392887, 0.12173049092736904, 0.259719862622537, -0.2564500439180342, -0.14948488954534203, 0.09297189749211812, 0.22208548804498163, 0.012808589159935262, -0.020012024328323063, -0.3014629117703708, 0.040918704882940256, -0.1730369878137398, -0.18610900683076623, 0.13331000467603263, 0.09038275656094807, 0.06383663666968191, -0.16787294412671433, 0.1489422945114096, 0.0526043004448763, 0.13484814518804122, -0.06553308215834121, -0.08883342430993146, -0.10294805254681148, 0.05764454141842513, 0.05289227962643041, -0.0015401899329058534, 0.19557483480195928, -0.11743706582631497, -0.018175333426781397, 0.39660999787394685, -0.0857541255664919, 0.04693201149803888, 0.20978442629636845, -0.21383091017315528, -0.13095375984303118, 0.18607052334905785, 0.14830921955897183, 0.1219032100118859, -0.08717124854559179, -0.034568644633240754, -0.050225350992535354, 0.26039101690504685, 0.028641025275588566, 0.06916385203409564, 0.2757717375394978, 0.020776119850430094, 0.03817800401224323, 0.12397848814290872, -0.2928224785373135, -0.038824494515489326, -0.2670013740993506, -0.11433066961229564, -0.09885657940132815, 0.04766732151537232, -0.13828944706109855, -0.1403338079824646, 0.40159961558858537, 0.07427512770112657, 0.2860524168592676, 0.044751847075841976, 0.29615156227901734, 0.13260187082874234, 0.09694501118870366, 0.11081247493880304, 0.34017099311999527, 0.24263931235325029, 0.11277866389377049, -0.29661242791627174, 0.02527763449514013, 0.007559769892952408] |
1,802.00073 | Using the CIFIST grid of CO5BOLD 3D model atmospheres to study the
effects of stellar granulation on photometric colours. II. The role of
convection accross the H-R diagram | We studied the influence of convection on the spectral energy distributions,
photometric magnitudes, and colour indices of different types of stars across
the H-R diagram. The 3D hydrodynamical CO5BOLD, averaged <3D>, and 1D
hydrostatic LHD model atmospheres were used to compute spectral energy
distributions of stars on the main sequence (MS), main sequence turn-off (TO),
subgiant branch (SGB), and red giant branch (RGB), in each case at two
different effective temperatures and two metallicities, [M/H]=0.0 and -2.0.
Using the obtained spectral energy distributions, we calculated photometric
magnitudes and colour indices in the broad-band Johnson-Cousins $UBVRI$ and
2MASS $JHK_{\rm s}$, and the medium-band Str\"{o}mgren $uvby$ photometric
systems. The 3D-1D differences in photometric magnitudes and colour indices are
small in both photometric systems and typically do not exceed $\pm0.03$ mag.
Only in the case of the coolest giants located on the upper RGB are the
differences in the $U$ and $u$ bands able reach $\approx-0.2$ mag at [M/H]=0.0
and $\approx-0.1$ mag at [M/H]=-2.0. Generally, the 3D-1D differences are
largest in the blue-UV part of the spectrum and decrease towards longer
wavelengths. They are also sensitive to the effective temperature and are
significantly smaller in hotter stars. Metallicity also plays a role and leads
to slightly larger 3D-1D differences at [M/H]=0.0. All these patterns are
caused by a complex interplay between the radiation field, opacities, and
horizontal temperature fluctuations that occur due to convective motions in
stellar atmospheres. Although small, the 3D-1D differences in the magnitudes
and colour indices are nevertheless comparable to or larger than typical
photometric uncertainties and may therefore cause non-negligible systematic
differences in the estimated effective temperatures.
| astro-ph.SR | we studied the influence of convection on the spectral energy distributions photometric magnitudes and colour indices of different types of stars across the hr diagram the 3d hydrodynamical co5bold averaged 3d and 1d hydrostatic lhd model atmospheres were used to compute spectral energy distributions of stars on the main sequence ms main sequence turnoff to subgiant branch sgb and red giant branch rgb in each case at two different effective temperatures and two metallicities mh00 and 20 using the obtained spectral energy distributions we calculated photometric magnitudes and colour indices in the broadband johnsoncousins ubvri and 2mass jhk_rm s and the mediumband stromgren uvby photometric systems the 3d1d differences in photometric magnitudes and colour indices are small in both photometric systems and typically do not exceed pm003 mag only in the case of the coolest giants located on the upper rgb are the differences in the u and u bands able reach approx02 mag at mh00 and approx01 mag at mh20 generally the 3d1d differences are largest in the blueuv part of the spectrum and decrease towards longer wavelengths they are also sensitive to the effective temperature and are significantly smaller in hotter stars metallicity also plays a role and leads to slightly larger 3d1d differences at mh00 all these patterns are caused by a complex interplay between the radiation field opacities and horizontal temperature fluctuations that occur due to convective motions in stellar atmospheres although small the 3d1d differences in the magnitudes and colour indices are nevertheless comparable to or larger than typical photometric uncertainties and may therefore cause nonnegligible systematic differences in the estimated effective temperatures | [['we', 'studied', 'the', 'influence', 'of', 'convection', 'on', 'the', 'spectral', 'energy', 'distributions', 'photometric', 'magnitudes', 'and', 'colour', 'indices', 'of', 'different', 'types', 'of', 'stars', 'across', 'the', 'hr', 'diagram', 'the', '3d', 'hydrodynamical', 'co5bold', 'averaged', '3d', 'and', '1d', 'hydrostatic', 'lhd', 'model', 'atmospheres', 'were', 'used', 'to', 'compute', 'spectral', 'energy', 'distributions', 'of', 'stars', 'on', 'the', 'main', 'sequence', 'ms', 'main', 'sequence', 'turnoff', 'to', 'subgiant', 'branch', 'sgb', 'and', 'red', 'giant', 'branch', 'rgb', 'in', 'each', 'case', 'at', 'two', 'different', 'effective', 'temperatures', 'and', 'two', 'metallicities', 'mh00', 'and', '20', 'using', 'the', 'obtained', 'spectral', 'energy', 'distributions', 'we', 'calculated', 'photometric', 'magnitudes', 'and', 'colour', 'indices', 'in', 'the', 'broadband', 'johnsoncousins', 'ubvri', 'and', '2mass', 'jhk_rm', 's', 'and', 'the', 'mediumband', 'stromgren', 'uvby', 'photometric', 'systems', 'the', '3d1d', 'differences', 'in', 'photometric', 'magnitudes', 'and', 'colour', 'indices', 'are', 'small', 'in', 'both', 'photometric', 'systems', 'and', 'typically', 'do', 'not', 'exceed', 'pm003', 'mag', 'only', 'in', 'the', 'case', 'of', 'the', 'coolest', 'giants', 'located', 'on', 'the', 'upper', 'rgb', 'are', 'the', 'differences', 'in', 'the', 'u', 'and', 'u', 'bands', 'able', 'reach', 'approx02', 'mag', 'at', 'mh00', 'and', 'approx01', 'mag', 'at', 'mh20', 'generally', 'the', '3d1d', 'differences', 'are', 'largest', 'in', 'the', 'blueuv', 'part', 'of', 'the', 'spectrum', 'and', 'decrease', 'towards', 'longer', 'wavelengths', 'they', 'are', 'also', 'sensitive', 'to', 'the', 'effective', 'temperature', 'and', 'are', 'significantly', 'smaller', 'in', 'hotter', 'stars', 'metallicity', 'also', 'plays', 'a', 'role', 'and', 'leads', 'to', 'slightly', 'larger', '3d1d', 'differences', 'at', 'mh00', 'all', 'these', 'patterns', 'are', 'caused', 'by', 'a', 'complex', 'interplay', 'between', 'the', 'radiation', 'field', 'opacities', 'and', 'horizontal', 'temperature', 'fluctuations', 'that', 'occur', 'due', 'to', 'convective', 'motions', 'in', 'stellar', 'atmospheres', 'although', 'small', 'the', '3d1d', 'differences', 'in', 'the', 'magnitudes', 'and', 'colour', 'indices', 'are', 'nevertheless', 'comparable', 'to', 'or', 'larger', 'than', 'typical', 'photometric', 'uncertainties', 'and', 'may', 'therefore', 'cause', 'nonnegligible', 'systematic', 'differences', 'in', 'the', 'estimated', 'effective', 'temperatures']] | [-0.020574092071802257, 0.17088093376699348, -0.06544257903909449, 0.13766042846289755, -0.041021554598779375, -0.06228203292581628, 0.07157469025175366, 0.46612310585037653, -0.156604080594322, -0.38365298802894887, 0.05570867099780103, -0.33308409953684504, -0.024614249650604412, 0.1936559206784404, -0.1181590912875137, -0.041710209258848975, 0.09439659225315711, -0.07855868749902584, -0.07317928162684886, -0.24293134075245446, 0.2775972860434385, -0.043698885888139256, 0.1996836197621592, -0.03510572006161422, -0.033764191493113986, -0.10674996202405014, -0.09354932757038902, -0.006878466265442878, -0.16523305607978414, 0.015641863327542905, 0.22091383270749043, 0.01314374952014091, 0.18444789710957227, -0.33157702466236677, -0.1811748276844294, 0.10073602109549762, 0.2023503722435336, 0.035898598764133434, 0.013650248458334454, -0.20604693288471787, 0.08638097693337433, -0.1233246273173492, -0.13607346016128283, 0.0465414395634912, 0.08059065507719669, 0.02803098497766334, -0.2385555508949641, 0.12764444884289414, 0.0012946547766619209, 0.17054587583404657, -0.11800918387902427, -0.2290425740109423, -0.1485499885730765, 0.16074324301669873, -0.01501696053744683, 0.0391660904600424, 0.10686755193564207, -0.1321351859916641, 0.05454193944078453, 0.4081022348845683, -0.124858510332391, -0.034523782957998565, 0.21650124479340627, -0.185855603427409, -0.11089300764064346, 0.12305632484347018, 0.15023965995763985, 0.11706358997095655, -0.15756932387055494, -0.009071351088489643, 0.0913471003795397, 0.18381114671208354, 0.07303536039214137, 0.08790406933464388, 0.2784127964746336, 0.07010330740143475, 0.007109769964903426, 0.03560844890220758, -0.24599291637206255, -0.06671037769410759, -0.22198288979481406, -0.04850764686863786, -0.09880116890460851, 0.008886678832891109, -0.1881003470337948, -0.16567199130424423, 0.3813469447909008, 0.17633798407215223, 0.1853237087237162, 0.04189498168700844, 0.31770151683238834, 0.12512514460397495, 0.12599117885024022, 0.11676777548194904, 0.31774459859884496, 0.1796028990161244, 0.1128189636145913, -0.25567314036732625, 0.04157734461651712, 0.02963555338375493] |
1,802.00074 | Stochastic Differential Equations with Critical Drifts | We establish the well-posedness of SDE with the additive noise when a
singular drift belongs to the critical spaces. We prove that if the drift
belongs to the Orlicz-critical space $L^{q,1}([0,T],L^p_x)$ for $p,q\in
(1,\infty)$ satisfying $\frac{2}{q}+\frac{d}{p} =1$, then the corresponding SDE
admits a unique strong solution. We also derive the Sobolev regularity of a
solution under the Orlicz-critical condition.
| math.PR math.AP | we establish the wellposedness of sde with the additive noise when a singular drift belongs to the critical spaces we prove that if the drift belongs to the orliczcritical space lq10tlp_x for pqin 1infty satisfying frac2qfracdp 1 then the corresponding sde admits a unique strong solution we also derive the sobolev regularity of a solution under the orliczcritical condition | [['we', 'establish', 'the', 'wellposedness', 'of', 'sde', 'with', 'the', 'additive', 'noise', 'when', 'a', 'singular', 'drift', 'belongs', 'to', 'the', 'critical', 'spaces', 'we', 'prove', 'that', 'if', 'the', 'drift', 'belongs', 'to', 'the', 'orliczcritical', 'space', 'lq10tlp_x', 'for', 'pqin', '1infty', 'satisfying', 'frac2qfracdp', '1', 'then', 'the', 'corresponding', 'sde', 'admits', 'a', 'unique', 'strong', 'solution', 'we', 'also', 'derive', 'the', 'sobolev', 'regularity', 'of', 'a', 'solution', 'under', 'the', 'orliczcritical', 'condition']] | [-0.13049075122583997, 0.026635416298681363, -0.09322857702658935, 0.10608029573817145, -0.08802438812669028, -0.15655831615863877, 0.009032466550442306, 0.3085592451420697, -0.35647834711708126, -0.1017635483125394, 0.1725411308326081, -0.2834827781231566, -0.11960115854374387, 0.14029504628428682, -0.1217006359080022, 0.0807511689056727, 0.05516914262182333, 0.07916850058192557, -0.09944688695990904, -0.2325355932751501, 0.4313638460399075, -0.09142067743973299, 0.2052092120559378, -0.003644453062125566, 0.21144584105773406, -0.04190452532334761, 0.08198222590779716, -0.015151347923198376, -0.2778286567684104, 0.04804939057000659, 0.18603043158707971, 0.05762869073501365, 0.3592643149874427, -0.3384120705452832, -0.1645806788466871, 0.21690061591904272, 0.073218161477284, 0.011188360625369983, -0.05655236347917129, -0.30679905635558746, 0.16194263890554958, -0.04745043495839292, -0.23826520801945167, -0.0709311092780395, 0.04933243816379796, 0.08489412497729062, -0.4366769454695962, 0.07271016923742453, 0.1334496575323018, -0.019935508190908214, -0.19064874884418465, -0.04490176644176245, -0.02351760554381392, 0.061283927273788404, 0.05614437364380468, 0.06717082602183588, 0.02363004138354551, -0.09420038603923538, -0.03682955373925242, 0.33772507024166937, -0.12117180506783452, -0.30444281832738357, 0.14141329758885232, -0.21354403896892274, -0.14099207586524162, 0.14778154235841198, 0.09529949822886423, 0.08038868418979374, -0.11223081114664886, 0.23705351429737426, -0.07990095083686438, 0.13879066483032973, 0.09030575076626106, 0.03380834826860916, 0.01369550907984376, 0.15769061112183738, 0.26006500571966173, 0.14710993526334112, -0.09092585413124074, -0.0375754145429131, -0.40942757793448187, -0.19123856755481525, -0.14218378795141523, 0.16173288940706038, -0.1468776544471356, -0.2093310977078297, 0.3284777350893075, 0.19001764040440322, 0.14206753496757962, 0.1421639437194575, 0.16841154010458426, 0.212519112017683, -0.05260034107010473, 0.13739960519596933, 0.1833170316436074, 0.1534676303240386, 0.11989632538435134, -0.16995533263649454, 0.07126820846037431, 0.16039483283053746] |
1,802.00075 | Photoemission Investigation of Oxygen Intercalated Epitaxial Graphene on
Ru(0001) | We study the formation of epitaxial graphene on Ru(0001) using fast x-ray
photoelectron spectroscopy during the growth process. The assignment of
different C 1s and Ru 3d core level components and their evolution during the
growth process gives a detailed insight into the graphene formation and the
strongly varying graphene-Ru interaction strength within the large moire unit
cell. Subsequent intercalation of oxygen can be achieved at elevated
temperature and the core level spectra show a conversion of the strongly
corrugated to quasi free-standing graphene, characterised by a single narrow C
1s component. This conversion and the accompanying flattening of the graphene
layer is also confirmed by x-ray photoelectron diffraction. The effect of
oxygen intercalation on the electronic structure is studied using
angle-resolved photoemission of the valence band states. For graphene/Ru(0001),
the strong graphene-substrate hybridisation disrupts the {\pi}-band dispersion
but oxygen intercalation fully restores the {\pi}-band with a strong p-doping
that shifts the Dirac point 785 meV above the Fermi level. The doping of the
system is highly tunable, as the additional exposure to rubidium can convert
the carrier filling to n-type with the Dirac point 970 meV below the Fermi
level.
| cond-mat.mtrl-sci | we study the formation of epitaxial graphene on ru0001 using fast xray photoelectron spectroscopy during the growth process the assignment of different c 1s and ru 3d core level components and their evolution during the growth process gives a detailed insight into the graphene formation and the strongly varying grapheneru interaction strength within the large moire unit cell subsequent intercalation of oxygen can be achieved at elevated temperature and the core level spectra show a conversion of the strongly corrugated to quasi freestanding graphene characterised by a single narrow c 1s component this conversion and the accompanying flattening of the graphene layer is also confirmed by xray photoelectron diffraction the effect of oxygen intercalation on the electronic structure is studied using angleresolved photoemission of the valence band states for grapheneru0001 the strong graphenesubstrate hybridisation disrupts the piband dispersion but oxygen intercalation fully restores the piband with a strong pdoping that shifts the dirac point 785 mev above the fermi level the doping of the system is highly tunable as the additional exposure to rubidium can convert the carrier filling to ntype with the dirac point 970 mev below the fermi level | [['we', 'study', 'the', 'formation', 'of', 'epitaxial', 'graphene', 'on', 'ru0001', 'using', 'fast', 'xray', 'photoelectron', 'spectroscopy', 'during', 'the', 'growth', 'process', 'the', 'assignment', 'of', 'different', 'c', '1s', 'and', 'ru', '3d', 'core', 'level', 'components', 'and', 'their', 'evolution', 'during', 'the', 'growth', 'process', 'gives', 'a', 'detailed', 'insight', 'into', 'the', 'graphene', 'formation', 'and', 'the', 'strongly', 'varying', 'grapheneru', 'interaction', 'strength', 'within', 'the', 'large', 'moire', 'unit', 'cell', 'subsequent', 'intercalation', 'of', 'oxygen', 'can', 'be', 'achieved', 'at', 'elevated', 'temperature', 'and', 'the', 'core', 'level', 'spectra', 'show', 'a', 'conversion', 'of', 'the', 'strongly', 'corrugated', 'to', 'quasi', 'freestanding', 'graphene', 'characterised', 'by', 'a', 'single', 'narrow', 'c', '1s', 'component', 'this', 'conversion', 'and', 'the', 'accompanying', 'flattening', 'of', 'the', 'graphene', 'layer', 'is', 'also', 'confirmed', 'by', 'xray', 'photoelectron', 'diffraction', 'the', 'effect', 'of', 'oxygen', 'intercalation', 'on', 'the', 'electronic', 'structure', 'is', 'studied', 'using', 'angleresolved', 'photoemission', 'of', 'the', 'valence', 'band', 'states', 'for', 'grapheneru0001', 'the', 'strong', 'graphenesubstrate', 'hybridisation', 'disrupts', 'the', 'piband', 'dispersion', 'but', 'oxygen', 'intercalation', 'fully', 'restores', 'the', 'piband', 'with', 'a', 'strong', 'pdoping', 'that', 'shifts', 'the', 'dirac', 'point', '785', 'mev', 'above', 'the', 'fermi', 'level', 'the', 'doping', 'of', 'the', 'system', 'is', 'highly', 'tunable', 'as', 'the', 'additional', 'exposure', 'to', 'rubidium', 'can', 'convert', 'the', 'carrier', 'filling', 'to', 'ntype', 'with', 'the', 'dirac', 'point', '970', 'mev', 'below', 'the', 'fermi', 'level']] | [-0.1242258372336724, 0.1986969575298166, -0.01455272597652909, 0.017625937299089855, 0.016850230869481734, -0.13238123282300016, 0.1635141497575923, 0.4350652253990503, -0.29947696895779746, -0.31117788685093584, -0.03866219110664373, -0.32944140941100686, -0.08183078768074904, 0.12781157596281878, 0.0632407408612045, -0.01388343621143385, 0.03789426889270544, -0.11036105203613834, -0.10576852117443004, -0.18932430898206995, 0.29037772579069593, 0.1189894387400464, 0.3297187464507787, 0.14093003627157918, 0.02793836538728915, 0.015574948995766278, 0.10749788268126155, -0.033008631377627974, -0.11727512508625391, 0.09594250136441061, 0.20163777273325983, -0.09307599091706308, 0.22346037015637482, -0.4396464662626386, -0.22521670080329242, -0.08050974481494019, 0.13274433977264716, 0.10548394731932173, -0.07908815535790238, -0.26722967187923036, 0.05415952975592135, -0.1109017303507579, -0.1143609131563847, -0.031105594677654537, -0.030353960180410037, -0.011736196852411682, -0.20163740543556694, 0.0942340587975004, 0.018335158021287306, 0.07420456327105823, -0.14844294683517595, -0.11164894821306103, -0.16558428587833127, 0.059755378625796815, 0.003933638864576718, 0.045414532568477294, 0.22816892746394793, -0.07802620811638152, -0.05054729107620293, 0.392216645440969, -0.0714709819331275, -0.04081075197747468, 0.17254393482825867, -0.22849211369910719, -0.07356498715418734, 0.2246826738094617, 0.07911345193309612, 0.06671023909492713, -0.1199188677989265, 0.07412925918960307, 0.005144466773459786, 0.24636069052074547, 0.12483295895477856, 0.05134980103773016, 0.25250875936625033, 0.227589369581179, 0.031456773787833396, 0.10369070973186019, -0.18011226988409793, 0.03351842501372295, -0.2045935311158629, -0.17515826462155307, -0.18091451829225805, 0.09081804206760256, -0.05257809983258516, -0.2050621510605867, 0.4281514026518715, 0.05123921101790314, 0.19792341632082275, -0.07678316963444415, 0.24803766772445096, 0.1519520191469622, 0.06927476547119257, -0.006178453612129057, 0.2372772776056081, 0.1505964502814765, 0.0947130972274432, -0.317908726649751, 0.08772768329730944, -0.007239348062706229] |
1,802.00076 | Cubic anisotropy in high homogeneity thin (Ga,Mn)As layers | Historically, comprehensive studies of dilute ferromagnetic semiconductors,
e.g., $p$-type (Cd,Mn)Te and (Ga,Mn)As, paved the way for a quantitative
theoretical description of effects associated with spin-orbit interactions in
solids, such as crystalline magnetic anisotropy. In particular, the theory was
successful in explaining {\em uniaxial} magnetic anisotropies associated with
biaxial strain and non-random formation of magnetic dimers in epitaxial
(Ga,Mn)As layers. However, the situation appears much less settled in the case
of the {\em cubic} term: the theory predicts switchings of the easy axis
between in-plane $\langle 100\rangle$ and $\langle 110\rangle$ directions as a
function of the hole concentration, whereas only the $\langle 100\rangle$
orientation has been found experimentally. Here, we report on the observation
of such switchings by magnetization and ferromagnetic resonance studies on a
series of high-crystalline quality (Ga,Mn)As films. We describe our findings by
the mean-field $p$-$d$ Zener model augmented with three new ingredients. The
first one is a scattering broadening of the hole density of states, which
reduces significantly the amplitude of the alternating carrier-induced
contribution. This opens the way for the two other ingredients, namely the
so-far disregarded single-ion magnetic anisotropy and disorder-driven
non-uniformities of the carrier density, both favoring the $\langle 100\rangle$
direction of the apparent easy axis. However, according to our results, when
the disorder gets reduced a switching to the $\langle 110\rangle$ orientation
is possible in a certain temperature and hole concentration range.
| cond-mat.mtrl-sci | historically comprehensive studies of dilute ferromagnetic semiconductors eg ptype cdmnte and gamnas paved the way for a quantitative theoretical description of effects associated with spinorbit interactions in solids such as crystalline magnetic anisotropy in particular the theory was successful in explaining em uniaxial magnetic anisotropies associated with biaxial strain and nonrandom formation of magnetic dimers in epitaxial gamnas layers however the situation appears much less settled in the case of the em cubic term the theory predicts switchings of the easy axis between inplane langle 100rangle and langle 110rangle directions as a function of the hole concentration whereas only the langle 100rangle orientation has been found experimentally here we report on the observation of such switchings by magnetization and ferromagnetic resonance studies on a series of highcrystalline quality gamnas films we describe our findings by the meanfield pd zener model augmented with three new ingredients the first one is a scattering broadening of the hole density of states which reduces significantly the amplitude of the alternating carrierinduced contribution this opens the way for the two other ingredients namely the sofar disregarded singleion magnetic anisotropy and disorderdriven nonuniformities of the carrier density both favoring the langle 100rangle direction of the apparent easy axis however according to our results when the disorder gets reduced a switching to the langle 110rangle orientation is possible in a certain temperature and hole concentration range | [['historically', 'comprehensive', 'studies', 'of', 'dilute', 'ferromagnetic', 'semiconductors', 'eg', 'ptype', 'cdmnte', 'and', 'gamnas', 'paved', 'the', 'way', 'for', 'a', 'quantitative', 'theoretical', 'description', 'of', 'effects', 'associated', 'with', 'spinorbit', 'interactions', 'in', 'solids', 'such', 'as', 'crystalline', 'magnetic', 'anisotropy', 'in', 'particular', 'the', 'theory', 'was', 'successful', 'in', 'explaining', 'em', 'uniaxial', 'magnetic', 'anisotropies', 'associated', 'with', 'biaxial', 'strain', 'and', 'nonrandom', 'formation', 'of', 'magnetic', 'dimers', 'in', 'epitaxial', 'gamnas', 'layers', 'however', 'the', 'situation', 'appears', 'much', 'less', 'settled', 'in', 'the', 'case', 'of', 'the', 'em', 'cubic', 'term', 'the', 'theory', 'predicts', 'switchings', 'of', 'the', 'easy', 'axis', 'between', 'inplane', 'langle', '100rangle', 'and', 'langle', '110rangle', 'directions', 'as', 'a', 'function', 'of', 'the', 'hole', 'concentration', 'whereas', 'only', 'the', 'langle', '100rangle', 'orientation', 'has', 'been', 'found', 'experimentally', 'here', 'we', 'report', 'on', 'the', 'observation', 'of', 'such', 'switchings', 'by', 'magnetization', 'and', 'ferromagnetic', 'resonance', 'studies', 'on', 'a', 'series', 'of', 'highcrystalline', 'quality', 'gamnas', 'films', 'we', 'describe', 'our', 'findings', 'by', 'the', 'meanfield', 'pd', 'zener', 'model', 'augmented', 'with', 'three', 'new', 'ingredients', 'the', 'first', 'one', 'is', 'a', 'scattering', 'broadening', 'of', 'the', 'hole', 'density', 'of', 'states', 'which', 'reduces', 'significantly', 'the', 'amplitude', 'of', 'the', 'alternating', 'carrierinduced', 'contribution', 'this', 'opens', 'the', 'way', 'for', 'the', 'two', 'other', 'ingredients', 'namely', 'the', 'sofar', 'disregarded', 'singleion', 'magnetic', 'anisotropy', 'and', 'disorderdriven', 'nonuniformities', 'of', 'the', 'carrier', 'density', 'both', 'favoring', 'the', 'langle', '100rangle', 'direction', 'of', 'the', 'apparent', 'easy', 'axis', 'however', 'according', 'to', 'our', 'results', 'when', 'the', 'disorder', 'gets', 'reduced', 'a', 'switching', 'to', 'the', 'langle', '110rangle', 'orientation', 'is', 'possible', 'in', 'a', 'certain', 'temperature', 'and', 'hole', 'concentration', 'range']] | [-0.17330251567539545, 0.19132969337015152, -0.02974005229490311, 0.03403114858941224, -0.05371175730895055, -0.10337054649604843, 0.03118790519779156, 0.3994225161231793, -0.25591707893998544, -0.2943670718819352, 0.002834254736897715, -0.2854061877240607, -0.11582575065008234, 0.18499201670668922, 0.04609188339632135, -0.0006996999482477182, -0.040532309658980616, -0.01961117767598153, -0.089380440480135, -0.20225717190636747, 0.24571657742183706, 0.02921008775950197, 0.32447198534122945, 0.09071245535048084, 0.040677191254584806, 0.04606956436417245, 0.09162509736294548, 0.04999407406677691, -0.16592453737955606, 0.06803635827530168, 0.2174379798653127, -0.07838594224947308, 0.22199018877979956, -0.43957890844658803, -0.19458334548503525, 0.006473326028259308, 0.1482646654200053, 0.1509199822663632, -0.07724312730817728, -0.2614028275808475, 0.03626791731347654, -0.14054838292353802, -0.1409114100725243, -0.06782548031199105, 0.027345022130854584, 0.00496939315972237, -0.2579776634142546, 0.13845383276368425, 0.10102175301545414, 0.08378292411349289, -0.10119869080045375, -0.12894137806602216, -0.06751822639795903, 0.04737096345968638, 0.11526405840362586, 0.09209354052303784, 0.15670164530750122, -0.12070700794707559, -0.11832126446799457, 0.36293331717075616, -0.045762428453727216, -0.11083074732302696, 0.1336888621679687, -0.19966748264810202, -0.10542594057123847, 0.11759914507631931, 0.10168686567288987, 0.10651797914607941, -0.11578689137068547, 0.09110558152110969, -0.002606949747515548, 0.1701591856565261, 0.032510905381569866, 0.030135321714751945, 0.2365496010895361, 0.1719477742255804, 0.04273844706997471, 0.11810069173506028, -0.122572943321613, -0.04910948508334338, -0.21478571553955572, -0.16237084181665795, -0.20369314055061663, 0.07434593437529545, -0.10310559110726708, -0.19760833699215336, 0.4021245988551527, 0.1437767917175957, 0.1921884909255855, -0.033475416887596476, 0.254481752897335, 0.07542210255658638, 0.05992312800637528, 0.007516597722362923, 0.2709541264809096, 0.20220215034695635, 0.11367033915022355, -0.26467212675733637, 0.14295197982063287, -0.01232480985345319] |
1,802.00077 | Progress on nonuniqueness of solutions to the vacuum Einstein conformal
constraint equations with positive Yamabe invariant | In this article, we make a generalization of classical fixed point theorems
by using the concept of half-continuity and then apply it to improve the
nonuniqueness result for solutions to the vacuum Einstein conformal equations
shown by the author in arxiv.org/abs/1507.01081
| math.AP math-ph math.MP | in this article we make a generalization of classical fixed point theorems by using the concept of halfcontinuity and then apply it to improve the nonuniqueness result for solutions to the vacuum einstein conformal equations shown by the author in arxivorgabs150701081 | [['in', 'this', 'article', 'we', 'make', 'a', 'generalization', 'of', 'classical', 'fixed', 'point', 'theorems', 'by', 'using', 'the', 'concept', 'of', 'halfcontinuity', 'and', 'then', 'apply', 'it', 'to', 'improve', 'the', 'nonuniqueness', 'result', 'for', 'solutions', 'to', 'the', 'vacuum', 'einstein', 'conformal', 'equations', 'shown', 'by', 'the', 'author', 'in', 'arxivorgabs150701081']] | [-0.02804900098962184, 0.032072386799905546, -0.11684730255570358, 0.06311603648385081, -0.07723751478494169, -0.09307349586668305, 0.04525764128909661, 0.2500100003030056, -0.2573461711215667, -0.25875156949489164, 0.12505779706407338, -0.254558288731063, -0.20833718614318433, 0.18839588813865796, -0.12352719532851225, 0.09410478405129069, 0.038308751984284475, 0.03464017758289209, -0.09676268469924346, -0.2872382095322395, 0.42446134810168773, 0.03867916003442728, 0.2587804834430034, 0.08931643794028041, 0.14100895242956588, 0.015578240048713408, -0.05272254849282595, 0.03757627800372668, -0.18554119487555745, 0.1005734976572104, 0.2650402738796308, 0.10271700109856632, 0.2672969727562024, -0.3793690238052454, -0.192984055990401, 0.09582468808795779, 0.09572232376115444, 0.16489108116962972, -0.013258768239607796, -0.31871890852180046, 0.1565213750522488, -0.156940603401894, -0.23473476955237296, -0.0826070568530271, -0.023488697297393512, 0.01616262229016194, -0.20881083791550153, 0.03174948026067936, 0.134737448551907, 0.004646848363709302, -0.0901690436861454, -0.02874500556395222, 0.050130456554679535, 0.07725659374577495, 0.11962849981724642, 0.055196582208363675, 0.03176720004576521, -0.11157898016823217, -0.12485012136256465, 0.3662387817524947, -0.12039459274651912, -0.2834915566043212, 0.12250980925865662, -0.11493714996732962, -0.16087150869843286, 0.06657874495841754, 0.10349767151264808, 0.14461768385118398, -0.16411301616627055, 0.13706674030235705, -0.04907411532715345, 0.074187063209814, 0.15277056314815313, -0.01817916450687708, 0.15146504294795868, 0.074407577359428, 0.10251933386406073, 0.20086862858480367, 0.03306922613858031, -0.10214560931452955, -0.32732785411943227, -0.19572375528514385, -0.18164461970520326, 0.10070472915107623, -0.06307064756140626, -0.1410962003902592, 0.36962586662803704, 0.2144516229548175, 0.16241126170811745, 0.06662206034152171, 0.23982943140734464, 0.1268798612917845, 0.03605263245602449, 0.06796813562798959, 0.29032566485544425, 0.18552241953185353, 0.1565620227663133, -0.15798528878412282, -0.06480978481853619, 0.19882412753903714] |
1,802.00078 | Mayer-Vietoris sequences and equivariant K-theory rings of toric
varieties | We apply a Mayer-Vietoris sequence argument to identify the Atiyah-Segal
equivariant complex K-theory rings of certain toric varieties with rings of
integral piecewise Laurent polynomials on the associated fans. We provide
necessary and sufficient conditions for this identification to hold for toric
varieties of complex dimension 2, including smooth and singular cases. We prove
that it always holds for smooth toric varieties, regardless of whether or not
the fan is polytopal or complete. Finally, we introduce the notion of fans with
"distant singular cones," and prove that the identification holds for them. The
identification has already been made by Hararda, Holm, Ray and Williams in the
case of divisive weighted projective spaces, in addition to enlarging the class
of toric varieties for which the identification holds, this work provides an
example in which the identification fails. We make every effort to ensure that
our work is rich in examples.
| math.KT math.AG | we apply a mayervietoris sequence argument to identify the atiyahsegal equivariant complex ktheory rings of certain toric varieties with rings of integral piecewise laurent polynomials on the associated fans we provide necessary and sufficient conditions for this identification to hold for toric varieties of complex dimension 2 including smooth and singular cases we prove that it always holds for smooth toric varieties regardless of whether or not the fan is polytopal or complete finally we introduce the notion of fans with distant singular cones and prove that the identification holds for them the identification has already been made by hararda holm ray and williams in the case of divisive weighted projective spaces in addition to enlarging the class of toric varieties for which the identification holds this work provides an example in which the identification fails we make every effort to ensure that our work is rich in examples | [['we', 'apply', 'a', 'mayervietoris', 'sequence', 'argument', 'to', 'identify', 'the', 'atiyahsegal', 'equivariant', 'complex', 'ktheory', 'rings', 'of', 'certain', 'toric', 'varieties', 'with', 'rings', 'of', 'integral', 'piecewise', 'laurent', 'polynomials', 'on', 'the', 'associated', 'fans', 'we', 'provide', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'this', 'identification', 'to', 'hold', 'for', 'toric', 'varieties', 'of', 'complex', 'dimension', '2', 'including', 'smooth', 'and', 'singular', 'cases', 'we', 'prove', 'that', 'it', 'always', 'holds', 'for', 'smooth', 'toric', 'varieties', 'regardless', 'of', 'whether', 'or', 'not', 'the', 'fan', 'is', 'polytopal', 'or', 'complete', 'finally', 'we', 'introduce', 'the', 'notion', 'of', 'fans', 'with', 'distant', 'singular', 'cones', 'and', 'prove', 'that', 'the', 'identification', 'holds', 'for', 'them', 'the', 'identification', 'has', 'already', 'been', 'made', 'by', 'hararda', 'holm', 'ray', 'and', 'williams', 'in', 'the', 'case', 'of', 'divisive', 'weighted', 'projective', 'spaces', 'in', 'addition', 'to', 'enlarging', 'the', 'class', 'of', 'toric', 'varieties', 'for', 'which', 'the', 'identification', 'holds', 'this', 'work', 'provides', 'an', 'example', 'in', 'which', 'the', 'identification', 'fails', 'we', 'make', 'every', 'effort', 'to', 'ensure', 'that', 'our', 'work', 'is', 'rich', 'in', 'examples']] | [-0.14659208547625993, -0.003001649815937649, -0.07237115898169577, 0.10333530140121945, -0.09673835933869201, -0.1633753177200167, -0.030302395903335482, 0.3598399292292212, -0.29003381610508205, -0.19987209677708814, 0.12856929899489106, -0.19622587247765813, -0.18265911558882106, 0.2122579945087735, -0.19119725190575007, -0.00865018305312087, 0.057217392455345975, 0.03824722311145632, -0.09305800498161163, -0.3563573245992302, 0.4362717750167625, -0.0010882325759912666, 0.23100352215555472, 0.08470457709847472, 0.1061066971506571, 0.045933018369298126, -0.026210088935693272, -0.004360244236485832, -0.15170261713378627, 0.13731991946248878, 0.3292523218520187, 0.1288346793158731, 0.2030932576697622, -0.37397659657663834, -0.15395136086138067, 0.23224629785840376, 0.11378393748246536, 0.07566792769294635, -0.023944106064673915, -0.2373410695896333, 0.12095599485611594, -0.12358481123197093, -0.23338610165897203, -0.1318234140635468, 0.03772569006478817, 0.047933013949266357, -0.2684725013693694, -0.014897007281212387, 0.15538826342860892, 0.12888216142341294, -0.05650477880388624, -0.0541884125622518, -0.03844972800564121, 0.09060977204589525, -0.041001190937980006, 0.02046708339774931, 0.05827091144031304, -0.095775464744735, -0.12894972137999847, 0.3606915168615209, -0.0008342262507712066, -0.22714760125067235, 0.1923443836012912, -0.15074268718740927, -0.19113321243659467, 0.13809546927065663, 0.0781466582903286, 0.15760308398622894, -0.031074517472596788, 0.11904722143663093, -0.12803353159059142, 0.05040517649172831, 0.11309858205778575, 0.002725267946418073, 0.13124259229044657, 0.08983922045287751, 0.09617594595781427, 0.16274097998551018, -0.030197257840513515, -0.04210982024095437, -0.33653078175376394, -0.21096888483451628, -0.09941286182131719, 0.14489332389417245, -0.07901221231480343, -0.2014830022156742, 0.3878562306494427, 0.1003821095690836, 0.1826827169672863, 0.11565026209368748, 0.24434580251171784, 0.01076830417819233, 0.031932325535013364, 0.057788331395115806, 0.17254809999360224, 0.19234191526413416, 0.019954313250334078, -0.1091369460494182, 0.03605807769250729, 0.18155348874515276] |
1,802.00079 | Generalizations of Banach and Kannan Fixed point theorems in b_{v}(s)
metric spaces | Generalizations of a metric space is one of the most important research areas
in mathematics. In literature ,there are several generalized metric spaces. The
latest generalized metric space is b_{v}(s) metric space which is introduced by
Mitrovic and Radenovic in 2017. In this paper, we prove Kannan fixed point
theorem and generalize Banach fixed point theorem for weakly contractive
mappings in b_{v}(s) metric spaces. Our results extend and generalize some
corresponding result.
| math.GM | generalizations of a metric space is one of the most important research areas in mathematics in literature there are several generalized metric spaces the latest generalized metric space is b_vs metric space which is introduced by mitrovic and radenovic in 2017 in this paper we prove kannan fixed point theorem and generalize banach fixed point theorem for weakly contractive mappings in b_vs metric spaces our results extend and generalize some corresponding result | [['generalizations', 'of', 'a', 'metric', 'space', 'is', 'one', 'of', 'the', 'most', 'important', 'research', 'areas', 'in', 'mathematics', 'in', 'literature', 'there', 'are', 'several', 'generalized', 'metric', 'spaces', 'the', 'latest', 'generalized', 'metric', 'space', 'is', 'b_vs', 'metric', 'space', 'which', 'is', 'introduced', 'by', 'mitrovic', 'and', 'radenovic', 'in', '2017', 'in', 'this', 'paper', 'we', 'prove', 'kannan', 'fixed', 'point', 'theorem', 'and', 'generalize', 'banach', 'fixed', 'point', 'theorem', 'for', 'weakly', 'contractive', 'mappings', 'in', 'b_vs', 'metric', 'spaces', 'our', 'results', 'extend', 'and', 'generalize', 'some', 'corresponding', 'result']] | [-0.07854613229553674, 0.08544658235451338, -0.07416893055164059, 0.12420911390767236, -0.09824643585778459, -0.10993848265555332, 0.017217204828982726, 0.3413424273874138, -0.2658842929497912, -0.18956833075679524, 0.1264654057228308, -0.2975733839893635, -0.23152043124739552, 0.2289422984484216, -0.21848201838200648, 0.0365264884370025, 0.049309003907977274, 0.021827075892770793, -0.11182639110361187, -0.3049546134015414, 0.4521932967046512, -0.011042315188244405, 0.25285843294113874, 0.06880845457420383, 0.09673242634293479, 0.03726909569346569, -0.0964325697318664, 0.026073138831711282, -0.17624993457026045, 0.11340778621412079, 0.33139687975947285, 0.1516505896513888, 0.31566698796732323, -0.2822292343988805, -0.23295408136926224, 0.17175948697234122, 0.04019743418583358, 0.009636699363038364, -0.019475370086401596, -0.3256650643134621, 0.07155798081780823, -0.1229359659326958, -0.12758425097177986, -0.10172579907090731, 0.020252354856265684, -0.003286305067299957, -0.21615062654674264, -0.013562226864758511, 0.1726027807010941, 0.04020598680305649, -0.12210295328044031, -0.09912537128179216, 0.028915232745930552, 0.06333839528682367, 0.021961052354398956, 0.17711843091102553, 0.05738499494348193, 0.004951048580090135, -0.15789009412934243, 0.3353998758633372, -0.039556719388970187, -0.26105659108766366, 0.138865690074966, -0.13500317580289614, -0.22181417304419085, 0.008462353058579102, 0.1401588308074, 0.16668757422446784, -0.11439186591707484, 0.22353172031785426, -0.10873214585680357, 0.0364522674345595, 0.14860753074262134, 0.04799584797124418, 0.0910408690991536, 0.10694315229726195, 0.1594681074632935, 0.16113471193567022, 0.036715207490283, -0.13487142774204292, -0.31661853139144436, -0.1652989734987348, -0.1580527997378942, 0.01929683024457223, -0.1576820740233992, -0.14309903554303546, 0.31494403402911314, 0.12012613550300749, 0.18231138118713255, 0.08295863870905161, 0.19352043489925563, 0.05640027378390635, -0.019434171959980796, 0.12258341148312032, 0.21460036919853964, 0.18096202690954463, 0.09866702224744457, -0.009011425832155305, -0.03803522474276767, 0.22730052354417637] |
1,802.0008 | Graphon games: A statistical framework for network games and
interventions | In this paper, we present a unifying framework for analyzing equilibria and
designing interventions for large network games sampled from a stochastic
network formation process represented by a graphon. We first introduce a new
class of infinite population games, termed graphon games, where a continuum of
heterogeneous agents interact according to a graphon. After studying properties
of equilibria in graphon games, we show that graphon equilibria can approximate
equilibria of large network games sampled from the graphon. We next show that,
under some regularity assumptions, the graphon approach enables the design of
asymptotically optimal interventions via the solution of an optimization
problem with much lower dimension than the one based on the entire network
structure. We illustrate our framework on a synthetic dataset of rural villages
and show that the graphon intervention can be computed efficiently and based
solely on aggregated relational data.
| cs.GT | in this paper we present a unifying framework for analyzing equilibria and designing interventions for large network games sampled from a stochastic network formation process represented by a graphon we first introduce a new class of infinite population games termed graphon games where a continuum of heterogeneous agents interact according to a graphon after studying properties of equilibria in graphon games we show that graphon equilibria can approximate equilibria of large network games sampled from the graphon we next show that under some regularity assumptions the graphon approach enables the design of asymptotically optimal interventions via the solution of an optimization problem with much lower dimension than the one based on the entire network structure we illustrate our framework on a synthetic dataset of rural villages and show that the graphon intervention can be computed efficiently and based solely on aggregated relational data | [['in', 'this', 'paper', 'we', 'present', 'a', 'unifying', 'framework', 'for', 'analyzing', 'equilibria', 'and', 'designing', 'interventions', 'for', 'large', 'network', 'games', 'sampled', 'from', 'a', 'stochastic', 'network', 'formation', 'process', 'represented', 'by', 'a', 'graphon', 'we', 'first', 'introduce', 'a', 'new', 'class', 'of', 'infinite', 'population', 'games', 'termed', 'graphon', 'games', 'where', 'a', 'continuum', 'of', 'heterogeneous', 'agents', 'interact', 'according', 'to', 'a', 'graphon', 'after', 'studying', 'properties', 'of', 'equilibria', 'in', 'graphon', 'games', 'we', 'show', 'that', 'graphon', 'equilibria', 'can', 'approximate', 'equilibria', 'of', 'large', 'network', 'games', 'sampled', 'from', 'the', 'graphon', 'we', 'next', 'show', 'that', 'under', 'some', 'regularity', 'assumptions', 'the', 'graphon', 'approach', 'enables', 'the', 'design', 'of', 'asymptotically', 'optimal', 'interventions', 'via', 'the', 'solution', 'of', 'an', 'optimization', 'problem', 'with', 'much', 'lower', 'dimension', 'than', 'the', 'one', 'based', 'on', 'the', 'entire', 'network', 'structure', 'we', 'illustrate', 'our', 'framework', 'on', 'a', 'synthetic', 'dataset', 'of', 'rural', 'villages', 'and', 'show', 'that', 'the', 'graphon', 'intervention', 'can', 'be', 'computed', 'efficiently', 'and', 'based', 'solely', 'on', 'aggregated', 'relational', 'data']] | [-0.08541229988572065, 0.0302961137825729, -0.12418536166334851, 0.11275173686703488, -0.058844845593822276, -0.13560449892420556, 0.09617588167661684, 0.4142697889462009, -0.30042102202851245, -0.27399960527574263, 0.12441811974687905, -0.21277439596222622, -0.22399797545537561, 0.12830327005024636, -0.13609574050349477, 0.060955365032113934, 0.14116106629111133, 0.017173175612086807, 0.04371677777873209, -0.2514221568533278, 0.366072160191834, 0.0031660206834101803, 0.2576247063250496, 0.0025182804332922336, 0.14711033639911614, 0.015583593964941436, 0.0029211856060094767, 0.11052972689335896, -0.13991618734189934, 0.15779158883073557, 0.28764855503137193, 0.2290489748104026, 0.3868781955655456, -0.43169009755854004, -0.22683485748304927, 0.15401934621321572, 0.11263857575412677, 0.10642722850645912, -0.03853895405056672, -0.3205063627134045, 0.08352397815682568, -0.19476331866808705, -0.05568693135865033, -0.07240155858306827, -0.05237137635687848, 0.045620072922845194, -0.35303139064413774, 0.026687694596243906, 0.014572977977381512, 0.0607236048232738, -0.08477089110553473, -0.10856535795394663, -0.02574424030604427, 0.1287129717981573, -0.017020932542220396, -0.03781572842996542, 0.13612901693913382, -0.13207101920404687, -0.1991757296670515, 0.3496858613480898, -0.08102046799493084, -0.18019039124263436, 0.14534894952068586, -0.08450448676175275, -0.18190037875299478, 0.09836262026541195, 0.25272410474001217, 0.19808892549139323, -0.18793506923634754, 0.06852701181501893, -0.10958488944631356, 0.17085751606040744, 0.0066298722774702145, -0.01387494030389023, 0.13975047357412954, 0.21378831407446022, 0.17895659415858922, 0.1745909012038378, -0.007831888030758584, -0.17432182851423333, -0.2551564791832458, -0.08978915625492802, -0.2028225329672019, 0.05861246940953384, -0.16043390159731669, -0.1950820686289116, 0.3977125280803734, 0.1826765223543023, 0.14774395150321346, 0.1624782624348373, 0.24794605912289003, 0.06277999547359019, -0.009338670884018074, 0.13978875547295788, 0.15665064726152678, 0.05386851308541698, 0.0816878380638163, -0.1451764602582068, 0.14356334972801013, 0.07669889753997013] |
1,802.00081 | A whirling plane of satellite galaxies around Centaurus A challenges
cold dark matter cosmology | The Milky Way and Andromeda galaxy are each surrounded by a thin plane of
satellite galaxies that may be corotating. Cosmological simulations predict
that most satellite galaxy systems are close to isotropic with random motions,
so those two well-studied systems are often interpreted as rare statistical
outliers. We test this assumption using the kinematics of satellite galaxies
around the Centaurus A galaxy. Our statistical analysis reveals evidence for
corotation in a narrow plane: of the 16 Centaurus A's satellites with kinematic
data, 14 follow a coherent velocity pattern aligned with the long axis of their
spatial distribution. In standard cosmology simulations, < 0.5% of Centaurus
A-like systems show such behavior. Corotating satellite systems may be common
in the Universe, challenging small-scale structure formation in the prevailing
cosmological paradigm.
| astro-ph.GA astro-ph.CO | the milky way and andromeda galaxy are each surrounded by a thin plane of satellite galaxies that may be corotating cosmological simulations predict that most satellite galaxy systems are close to isotropic with random motions so those two wellstudied systems are often interpreted as rare statistical outliers we test this assumption using the kinematics of satellite galaxies around the centaurus a galaxy our statistical analysis reveals evidence for corotation in a narrow plane of the 16 centaurus as satellites with kinematic data 14 follow a coherent velocity pattern aligned with the long axis of their spatial distribution in standard cosmology simulations 05 of centaurus alike systems show such behavior corotating satellite systems may be common in the universe challenging smallscale structure formation in the prevailing cosmological paradigm | [['the', 'milky', 'way', 'and', 'andromeda', 'galaxy', 'are', 'each', 'surrounded', 'by', 'a', 'thin', 'plane', 'of', 'satellite', 'galaxies', 'that', 'may', 'be', 'corotating', 'cosmological', 'simulations', 'predict', 'that', 'most', 'satellite', 'galaxy', 'systems', 'are', 'close', 'to', 'isotropic', 'with', 'random', 'motions', 'so', 'those', 'two', 'wellstudied', 'systems', 'are', 'often', 'interpreted', 'as', 'rare', 'statistical', 'outliers', 'we', 'test', 'this', 'assumption', 'using', 'the', 'kinematics', 'of', 'satellite', 'galaxies', 'around', 'the', 'centaurus', 'a', 'galaxy', 'our', 'statistical', 'analysis', 'reveals', 'evidence', 'for', 'corotation', 'in', 'a', 'narrow', 'plane', 'of', 'the', '16', 'centaurus', 'as', 'satellites', 'with', 'kinematic', 'data', '14', 'follow', 'a', 'coherent', 'velocity', 'pattern', 'aligned', 'with', 'the', 'long', 'axis', 'of', 'their', 'spatial', 'distribution', 'in', 'standard', 'cosmology', 'simulations', '05', 'of', 'centaurus', 'alike', 'systems', 'show', 'such', 'behavior', 'corotating', 'satellite', 'systems', 'may', 'be', 'common', 'in', 'the', 'universe', 'challenging', 'smallscale', 'structure', 'formation', 'in', 'the', 'prevailing', 'cosmological', 'paradigm']] | [-0.14453223216398728, 0.057615534783758984, -0.09580564163038581, 0.12865080418501518, -0.11794302021483268, -0.06078521048789477, -0.046314826279174624, 0.4306979181142304, -0.2069267904959751, -0.34699037232560903, 0.025196040063861787, -0.27421513028208194, -0.059380930514756854, 0.2185216898567916, -0.004886863166539687, 0.0021458932626662467, 0.06429129005886439, -0.07828660566345091, -0.0319101898573471, -0.2299499304022816, 0.274927928105114, 0.08657073106352739, 0.19716418477317948, -0.16008416091011266, 0.021593360858236064, -0.06871142659306996, -0.06381415253446444, 0.011863345800950302, -0.12637210549664313, 0.008513804745134405, 0.24771240891111412, 0.10464733934642263, 0.24258584507345038, -0.38860368084045144, -0.21757969532462615, 0.06480490403821854, 0.24477412205901708, 0.06679021857502893, -0.11260746236465226, -0.3325047313169701, 0.07939765567517304, -0.17727156810638472, -0.21784654559611571, 0.06032659621601264, 0.01746782636834587, 0.049219961606303424, -0.17321511318514812, 0.18665683295075436, 0.030760793050193764, 0.10367221649604168, -0.06920980726090062, -0.04926643412886554, -0.04202892465194262, 0.08530393786779715, 0.0475053703027418, 0.06378945126014901, 0.23419460476060786, -0.10619408734495177, -0.0788221765478237, 0.4799413818015358, -0.04191292250459266, -0.07270913048258681, 0.24654970996954487, -0.24458196508289337, -0.21317820282154312, 0.06483682409464199, 0.16233057711332097, 0.04905715938538357, -0.16573095378167121, 0.024194068656262654, -0.09970895438381713, 0.175634357359583, 0.0381135314475657, 0.03595099381689536, 0.38276576596920886, 0.12430308025154307, 0.06603089553179352, 0.05476662244965821, -0.2036056714865753, -0.10522988595904445, -0.20398736289724356, -0.06937007551030146, -0.1471328010074941, 0.033349782783046775, -0.15239819887588735, -0.14332538388493493, 0.2918284858070959, 0.10797666942283207, 0.26535097508522587, 0.01015383963964469, 0.3342806488334194, 0.010069467177739235, 0.08751335963570168, 0.1182412986641779, 0.30332666864310665, 0.13229184838444522, 0.05913930601730492, -0.17148970609794803, 0.0548346835193953, -0.04534928975846824] |
1,802.00082 | Henge: Intent-driven Multi-Tenant Stream Processing | We present Henge, a system to support intent-based multi-tenancy in modern
stream processing applications. Henge supports multi-tenancy as a first-class
citizen: everyone inside an organization can now submit their stream processing
jobs to a single, shared, consolidated cluster. Additionally, Henge allows each
tenant (job) to specify its own intents (i.e., requirements) as a Service Level
Objective (SLO) that captures latency and/or throughput. In a multi-tenant
cluster, the Henge scheduler adapts continually to meet jobs' SLOs in spite of
limited cluster resources, and under dynamic input workloads. SLOs are soft and
are based on utility functions. Henge continually tracks SLO satisfaction, and
when jobs miss their SLOs, it wisely navigates the state space to perform
resource allocations in real time, maximizing total system utility achieved by
all jobs in the system. Henge is integrated in Apache Storm and we present
experimental results using both production topologies and real datasets.
| cs.DC | we present henge a system to support intentbased multitenancy in modern stream processing applications henge supports multitenancy as a firstclass citizen everyone inside an organization can now submit their stream processing jobs to a single shared consolidated cluster additionally henge allows each tenant job to specify its own intents ie requirements as a service level objective slo that captures latency andor throughput in a multitenant cluster the henge scheduler adapts continually to meet jobs slos in spite of limited cluster resources and under dynamic input workloads slos are soft and are based on utility functions henge continually tracks slo satisfaction and when jobs miss their slos it wisely navigates the state space to perform resource allocations in real time maximizing total system utility achieved by all jobs in the system henge is integrated in apache storm and we present experimental results using both production topologies and real datasets | [['we', 'present', 'henge', 'a', 'system', 'to', 'support', 'intentbased', 'multitenancy', 'in', 'modern', 'stream', 'processing', 'applications', 'henge', 'supports', 'multitenancy', 'as', 'a', 'firstclass', 'citizen', 'everyone', 'inside', 'an', 'organization', 'can', 'now', 'submit', 'their', 'stream', 'processing', 'jobs', 'to', 'a', 'single', 'shared', 'consolidated', 'cluster', 'additionally', 'henge', 'allows', 'each', 'tenant', 'job', 'to', 'specify', 'its', 'own', 'intents', 'ie', 'requirements', 'as', 'a', 'service', 'level', 'objective', 'slo', 'that', 'captures', 'latency', 'andor', 'throughput', 'in', 'a', 'multitenant', 'cluster', 'the', 'henge', 'scheduler', 'adapts', 'continually', 'to', 'meet', 'jobs', 'slos', 'in', 'spite', 'of', 'limited', 'cluster', 'resources', 'and', 'under', 'dynamic', 'input', 'workloads', 'slos', 'are', 'soft', 'and', 'are', 'based', 'on', 'utility', 'functions', 'henge', 'continually', 'tracks', 'slo', 'satisfaction', 'and', 'when', 'jobs', 'miss', 'their', 'slos', 'it', 'wisely', 'navigates', 'the', 'state', 'space', 'to', 'perform', 'resource', 'allocations', 'in', 'real', 'time', 'maximizing', 'total', 'system', 'utility', 'achieved', 'by', 'all', 'jobs', 'in', 'the', 'system', 'henge', 'is', 'integrated', 'in', 'apache', 'storm', 'and', 'we', 'present', 'experimental', 'results', 'using', 'both', 'production', 'topologies', 'and', 'real', 'datasets']] | [-0.19817216161833573, 0.02900335176093142, -0.06713816832603156, 0.04727007567998953, -0.13070288029455304, -0.16759064946027874, 0.15024583434864622, 0.44264204190993633, -0.2728418568149209, -0.36701305542845986, 0.09241325999106709, -0.2748534517895432, -0.06094584924269568, 0.1558733960217167, -0.15483888106757296, 0.09472257284584418, 0.11791009391418884, 0.05068418602427669, 0.04455136342251019, -0.3372002510681144, 0.22937076039945808, 0.07605538679588889, 0.3226856050109868, 0.018976855023710586, 0.05224629230557381, 0.025799193896189634, -0.003192228711889805, -0.02743065626870973, -0.0216869854024038, 0.08117967666869329, 0.31410174254749623, 0.29510622695591804, 0.33694363049407666, -0.4658529338288448, -0.11374879347607242, 0.05309611157438642, 0.13610209451635946, -0.04202761378906576, -0.030746924560131644, -0.2789257541865211, 0.10721389112075337, -0.22432046212771958, -0.03410372922410937, -0.07594005731123223, 0.0016783427516300533, 0.06422047554892865, -0.26747716860405196, -0.03528990304550609, -0.0669698038380719, 0.02197898691992049, -0.1157097128700509, -0.06979555375260502, -0.03406106736951482, 0.1970998019106274, 0.0001713235947504841, 0.03381927575419714, 0.22279872811349058, -0.14130484323785011, -0.15376749998776595, 0.4370639354770852, 0.018450901895522367, -0.15217522947067344, 0.18868750543962862, -0.041746167230067424, -0.18745308992377407, 0.0791694611425801, 0.25602535924809744, 0.021229679623895603, -0.20983364858329878, 0.050068532246891784, 0.007901166609765307, 0.19161729055387597, 0.0659336360089632, 0.06315296090119896, 0.19910721298672157, 0.2163332791140026, 0.10498307627072004, 0.1510195106887762, 0.0007545513012824027, -0.1261374812629829, -0.1969710947596468, -0.14973923485062235, -0.17590495452954988, -0.03338754165137338, -0.06555270197094541, -0.11697749057595895, 0.32857604208422, 0.15814109379425645, 0.15121014627653198, 0.14615859430459505, 0.3667420989053475, 0.05361855308355361, 0.13394034344929498, 0.18668962943027853, 0.07395217442506298, -0.053247555572778694, 0.22159764061467974, -0.16932257342252982, 0.10569641875052774, -0.0641858566904793] |
1,802.00083 | On the Lichnerowicz conjecture for CR manifolds with mixed signature | We construct examples of nondegenerate CR manifolds with Levi form of
signature $(p,q)$, $2\leq p\leq q$, which are compact, not locally CR flat, and
admit essential CR vector fields. We also construct an example of a noncompact
nondegenerate CR manifold with signature $(1,n-1)$ which is not locally CR flat
and admits an essential CR vector fields. These provide counterexamples to the
analogue of the Lichnerowicz conjecture for CR manifolds with mixed signature.
| math.DG math.CV | we construct examples of nondegenerate cr manifolds with levi form of signature pq 2leq pleq q which are compact not locally cr flat and admit essential cr vector fields we also construct an example of a noncompact nondegenerate cr manifold with signature 1n1 which is not locally cr flat and admits an essential cr vector fields these provide counterexamples to the analogue of the lichnerowicz conjecture for cr manifolds with mixed signature | [['we', 'construct', 'examples', 'of', 'nondegenerate', 'cr', 'manifolds', 'with', 'levi', 'form', 'of', 'signature', 'pq', '2leq', 'pleq', 'q', 'which', 'are', 'compact', 'not', 'locally', 'cr', 'flat', 'and', 'admit', 'essential', 'cr', 'vector', 'fields', 'we', 'also', 'construct', 'an', 'example', 'of', 'a', 'noncompact', 'nondegenerate', 'cr', 'manifold', 'with', 'signature', '1n1', 'which', 'is', 'not', 'locally', 'cr', 'flat', 'and', 'admits', 'an', 'essential', 'cr', 'vector', 'fields', 'these', 'provide', 'counterexamples', 'to', 'the', 'analogue', 'of', 'the', 'lichnerowicz', 'conjecture', 'for', 'cr', 'manifolds', 'with', 'mixed', 'signature']] | [-0.21261675205702582, 0.09336763979364252, 0.00018328267873989211, 0.12376470587817796, -0.1265640601826211, -0.24664963296123055, -0.1076824929461711, 0.3955104058194492, -0.22439472967137894, -0.20008029673287334, 0.05268698719899274, -0.24705618914514263, -0.15346232384197517, 0.2031063530561773, -0.033088349323305816, -0.0796907734669124, -0.0148568438372523, 0.10315542370638771, -0.10966151541409393, -0.2740555741668989, 0.5113439943848385, 0.018439693596317537, 0.2269782884719057, 0.06847640440618205, 0.0916685666048175, -0.03776974068831704, 0.045857620302639485, -0.0016838264806816976, -0.15047478933249497, 0.13371120705010575, 0.28405475950179, 0.09787455302042265, 0.1156432880088687, -0.3721244720412263, -0.2510043299666399, 0.25032772954242927, 0.11753676610856524, 0.007421974312617547, -0.10023629968054593, -0.25691770288782817, 0.19363165613807118, -0.09580702610158671, -0.24813652392994198, -0.10982296334501977, 0.00017441016259706684, -0.019859802243041083, -0.26655506787291317, 0.02521287020863383, 0.22651994139434667, 0.0647379491581685, -0.16518981421702644, -0.05899502692692396, -0.10973201371962205, 0.03634483541180897, -0.02439334263261925, 0.08147687851063286, 0.021151983010996547, 0.037469443069615714, -0.14471414927781248, 0.33590271402823013, -0.11497560823853645, -0.2887956729779641, 0.1646985762894878, -0.1255263127548258, -0.1466310450923629, 0.15813258313573897, 0.14814190939068794, 0.15577111201774743, -0.04391670757387248, 0.22571558977263825, -0.05678221754108866, 0.05515469593228772, 0.04899495482418893, 0.025587298700379, 0.13780792694564703, 0.024318973999470472, 0.18366905786873153, 0.04036943567269999, -0.02918083120473764, 0.021107283905924607, -0.3571187197748158, -0.24738883696004954, -0.14920458790665078, 0.2550311068840124, -0.11829348669683289, -0.23077604897682452, 0.3053189305064734, -0.08923787486694185, 0.20620905899300446, 0.024050332919513393, 0.19015376158576044, 0.05405379511972165, -0.026944409279773634, 0.21279276886101192, 0.13767200190987852, 0.23749258920239905, 0.026115951024823718, -0.07550644677960211, -0.10189784536810799, 0.1381814531568024] |
1,802.00084 | NC Algorithms for Computing a Perfect Matching and a Maximum Flow in
One-Crossing-Minor-Free Graphs | In 1988, Vazirani gave an NC algorithm for computing the number of perfect
matchings in $K_{3,3}$-minor-free graphs by building on Kasteleyn's scheme for
planar graphs, and stated that this "opens up the possibility of obtaining an
NC algorithm for finding a perfect matching in $K_{3,3}$-free graphs." In this
paper, we finally settle this 30-year-old open problem. Building on recent NC
algorithms for planar and bounded-genus perfect matching by Anari and Vazirani
and later by Sankowski, we obtain NC algorithms for perfect matching in any
minor-closed graph family that forbids a one-crossing graph. This family
includes several well-studied graph families including the $K_{3,3}$-minor-free
graphs and $K_5$-minor-free graphs. Graphs in these families not only have
unbounded genus, but can have genus as high as $O(n)$. Our method applies as
well to several other problems related to perfect matching. In particular, we
obtain NC algorithms for the following problems in any family of graphs (or
networks) with a one-crossing forbidden minor:
$\bullet$ Determining whether a given graph has a perfect matching and if so,
finding one.
$\bullet$ Finding a minimum weight perfect matching in the graph, assuming
that the edge weights are polynomially bounded.
$\bullet$ Finding a maximum $st$-flow in the network, with arbitrary
capacities.
The main new idea enabling our results is the definition and use of
matching-mimicking networks, small replacement networks that behave the same,
with respect to matching problems involving a fixed set of terminals, as the
larger network they replace.
| cs.DS | in 1988 vazirani gave an nc algorithm for computing the number of perfect matchings in k_33minorfree graphs by building on kasteleyns scheme for planar graphs and stated that this opens up the possibility of obtaining an nc algorithm for finding a perfect matching in k_33free graphs in this paper we finally settle this 30yearold open problem building on recent nc algorithms for planar and boundedgenus perfect matching by anari and vazirani and later by sankowski we obtain nc algorithms for perfect matching in any minorclosed graph family that forbids a onecrossing graph this family includes several wellstudied graph families including the k_33minorfree graphs and k_5minorfree graphs graphs in these families not only have unbounded genus but can have genus as high as on our method applies as well to several other problems related to perfect matching in particular we obtain nc algorithms for the following problems in any family of graphs or networks with a onecrossing forbidden minor bullet determining whether a given graph has a perfect matching and if so finding one bullet finding a minimum weight perfect matching in the graph assuming that the edge weights are polynomially bounded bullet finding a maximum stflow in the network with arbitrary capacities the main new idea enabling our results is the definition and use of matchingmimicking networks small replacement networks that behave the same with respect to matching problems involving a fixed set of terminals as the larger network they replace | [['in', '1988', 'vazirani', 'gave', 'an', 'nc', 'algorithm', 'for', 'computing', 'the', 'number', 'of', 'perfect', 'matchings', 'in', 'k_33minorfree', 'graphs', 'by', 'building', 'on', 'kasteleyns', 'scheme', 'for', 'planar', 'graphs', 'and', 'stated', 'that', 'this', 'opens', 'up', 'the', 'possibility', 'of', 'obtaining', 'an', 'nc', 'algorithm', 'for', 'finding', 'a', 'perfect', 'matching', 'in', 'k_33free', 'graphs', 'in', 'this', 'paper', 'we', 'finally', 'settle', 'this', '30yearold', 'open', 'problem', 'building', 'on', 'recent', 'nc', 'algorithms', 'for', 'planar', 'and', 'boundedgenus', 'perfect', 'matching', 'by', 'anari', 'and', 'vazirani', 'and', 'later', 'by', 'sankowski', 'we', 'obtain', 'nc', 'algorithms', 'for', 'perfect', 'matching', 'in', 'any', 'minorclosed', 'graph', 'family', 'that', 'forbids', 'a', 'onecrossing', 'graph', 'this', 'family', 'includes', 'several', 'wellstudied', 'graph', 'families', 'including', 'the', 'k_33minorfree', 'graphs', 'and', 'k_5minorfree', 'graphs', 'graphs', 'in', 'these', 'families', 'not', 'only', 'have', 'unbounded', 'genus', 'but', 'can', 'have', 'genus', 'as', 'high', 'as', 'on', 'our', 'method', 'applies', 'as', 'well', 'to', 'several', 'other', 'problems', 'related', 'to', 'perfect', 'matching', 'in', 'particular', 'we', 'obtain', 'nc', 'algorithms', 'for', 'the', 'following', 'problems', 'in', 'any', 'family', 'of', 'graphs', 'or', 'networks', 'with', 'a', 'onecrossing', 'forbidden', 'minor', 'bullet', 'determining', 'whether', 'a', 'given', 'graph', 'has', 'a', 'perfect', 'matching', 'and', 'if', 'so', 'finding', 'one', 'bullet', 'finding', 'a', 'minimum', 'weight', 'perfect', 'matching', 'in', 'the', 'graph', 'assuming', 'that', 'the', 'edge', 'weights', 'are', 'polynomially', 'bounded', 'bullet', 'finding', 'a', 'maximum', 'stflow', 'in', 'the', 'network', 'with', 'arbitrary', 'capacities', 'the', 'main', 'new', 'idea', 'enabling', 'our', 'results', 'is', 'the', 'definition', 'and', 'use', 'of', 'matchingmimicking', 'networks', 'small', 'replacement', 'networks', 'that', 'behave', 'the', 'same', 'with', 'respect', 'to', 'matching', 'problems', 'involving', 'a', 'fixed', 'set', 'of', 'terminals', 'as', 'the', 'larger', 'network', 'they', 'replace']] | [-0.1358552222479678, 0.06988263070731288, -0.033202479691438684, 0.038889343689758486, -0.0850133452147323, -0.15820627474361876, 0.05188934878727499, 0.3906485142564634, -0.25686767254179965, -0.3607296953009306, 0.10096699404045163, -0.2563844859832898, -0.16063929589436157, 0.18041157630796079, -0.12812410464393906, 0.08039504919045916, 0.0919699685324152, 0.05504416725113212, 8.469008850321794e-05, -0.2742178938212116, 0.310046574739196, -0.009299044539996732, 0.2266937415775222, 0.08266317738646951, 0.06968752151381825, 0.04688541669117209, 0.004284182671108283, 0.09183135819330346, -0.15875337944077425, 0.11548174840681895, 0.2670332909741167, 0.1594497346377466, 0.23015686444511327, -0.38531084953962513, -0.19505531415343286, 0.18807193905231542, 0.11554105730526014, 0.13463447974063456, -0.040176761182859386, -0.20613369789207353, 0.13804128595123377, -0.12017404064536094, -0.08373097953929877, -0.007716271940929194, 0.033174726902507244, 0.016808551936992443, -0.2745523720087173, -0.011223105581787724, 0.11512216612318298, -0.004603172108181753, 0.02825569199145927, -0.15360104686794027, 0.03725651955392095, 0.10605744168957851, -0.08476812954468187, 0.0625950107719594, -0.000730900433457767, -0.14575534020890094, -0.22344636671089876, 0.3675184731199503, -0.026756318310557012, -0.15891938334098085, 0.13856425003687037, -0.06414348261896521, -0.19848195003384414, 0.08241479064551337, 0.1401810968799206, 0.16624857991506967, -0.09326854200820284, 0.11216736316394721, -0.13359904693982874, 0.1010256775766417, 0.17779940154287033, 0.020635814655785605, 0.12892639029111402, 0.1336435473271801, 0.1648290692246519, 0.17852847324562995, 0.04177292483606531, -0.058792096118365104, -0.24688989916079057, -0.10475534686314253, -0.20144846167822833, 0.024571112969291185, -0.17190033833279206, -0.24000966676976532, 0.38176359112408137, 0.10418844108450381, 0.19646194226515945, 0.13180120850059515, 0.25173146594703816, 0.04970726526280487, 0.04927134047999668, 0.1856594131604652, 0.16890035910667697, 0.15864968673073843, 0.0187681805715935, -0.13369887798811153, 0.07226859335654202, 0.10492433196650382] |
1,802.00085 | Explicit bounds for primes in arithmetic progressions | We derive explicit upper bounds for various functions counting primes in
arithmetic progressions. By way of example, if $q$ and $a$ are integers with
$\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of
the logarithms of the primes $p \equiv a \pmod{q}$ with $p \leq x$, we show
that $$ \bigg| \theta (x; q, a) - \frac{x}{\phi (q)} \bigg| < \frac1{160}
\frac{x}{\log x}, $$ for all $x \ge 8 \cdot 10^9$ (with sharper constants
obtained for individual such moduli $q$). We establish inequalities of the same
shape for the other standard prime-counting functions $\pi(x;q,a)$ and
$\psi(x;q,a)$, as well as inequalities for the $n$th prime congruent to $a\pmod
q$ when $q\le1200$. For moduli $q>10^5$, we find even stronger explicit
inequalities, but only for much larger values of $x$. Along the way, we also
derive an improved explicit lower bound for $L(1,\chi)$ for quadratic
characters $\chi$, and an improved explicit upper bound for exceptional zeros.
| math.NT | we derive explicit upper bounds for various functions counting primes in arithmetic progressions by way of example if q and a are integers with gcdaq1 and 3 leq q leq 105 and thetaxqa denotes the sum of the logarithms of the primes p equiv a pmodq with p leq x we show that bigg theta x q a fracxphi q bigg frac1160 fracxlog x for all x ge 8 cdot 109 with sharper constants obtained for individual such moduli q we establish inequalities of the same shape for the other standard primecounting functions pixqa and psixqa as well as inequalities for the nth prime congruent to apmod q when qle1200 for moduli q105 we find even stronger explicit inequalities but only for much larger values of x along the way we also derive an improved explicit lower bound for l1chi for quadratic characters chi and an improved explicit upper bound for exceptional zeros | [['we', 'derive', 'explicit', 'upper', 'bounds', 'for', 'various', 'functions', 'counting', 'primes', 'in', 'arithmetic', 'progressions', 'by', 'way', 'of', 'example', 'if', 'q', 'and', 'a', 'are', 'integers', 'with', 'gcdaq1', 'and', '3', 'leq', 'q', 'leq', '105', 'and', 'thetaxqa', 'denotes', 'the', 'sum', 'of', 'the', 'logarithms', 'of', 'the', 'primes', 'p', 'equiv', 'a', 'pmodq', 'with', 'p', 'leq', 'x', 'we', 'show', 'that', 'bigg', 'theta', 'x', 'q', 'a', 'fracxphi', 'q', 'bigg', 'frac1160', 'fracxlog', 'x', 'for', 'all', 'x', 'ge', '8', 'cdot', '109', 'with', 'sharper', 'constants', 'obtained', 'for', 'individual', 'such', 'moduli', 'q', 'we', 'establish', 'inequalities', 'of', 'the', 'same', 'shape', 'for', 'the', 'other', 'standard', 'primecounting', 'functions', 'pixqa', 'and', 'psixqa', 'as', 'well', 'as', 'inequalities', 'for', 'the', 'nth', 'prime', 'congruent', 'to', 'apmod', 'q', 'when', 'qle1200', 'for', 'moduli', 'q105', 'we', 'find', 'even', 'stronger', 'explicit', 'inequalities', 'but', 'only', 'for', 'much', 'larger', 'values', 'of', 'x', 'along', 'the', 'way', 'we', 'also', 'derive', 'an', 'improved', 'explicit', 'lower', 'bound', 'for', 'l1chi', 'for', 'quadratic', 'characters', 'chi', 'and', 'an', 'improved', 'explicit', 'upper', 'bound', 'for', 'exceptional', 'zeros']] | [-0.19262359891483258, 0.13349222535681612, -0.03929449820881584, 0.11051189228561958, -0.015010291861717878, -0.18685087033333508, 0.08044419458412842, 0.31049302095119413, -0.24307377069773203, -0.30818107074466405, 0.046939938378715386, -0.3091620347066153, -0.0799149959206556, 0.25553670469231, -0.027681694589429408, 0.04431002260890956, -0.044715691899024954, 0.09847473845238218, -0.11501356502491478, -0.2938867012743612, 0.2602404663526072, -0.08709979699798734, 0.1561055590706953, 0.0658543980051134, 0.08133427765081964, 0.03226784940154569, 0.0767394018051139, -0.09005564351792673, -0.2681788221221182, 0.12212435236968402, 0.24926780489103467, 0.08386374730616808, 0.2086270167500196, -0.3548878764975942, -0.08385249517065145, 0.2143238924752065, 0.1957978347892168, -0.055788611961730024, 0.005841104137535031, -0.19995756518108318, 0.16881690460895943, -0.1278967209588233, -0.16501031171316533, -0.08538230096707372, 0.16256818180979304, 0.05651160612910029, -0.3869144697893864, 0.07987094910896377, 0.10609216382333732, 0.09629520788242903, -0.030014155083335936, -0.29993614229071586, 0.012446370989719808, 0.045016329190607274, 0.019894349514632613, 0.08207453798339073, 0.022265038247742515, -0.12389120440363784, -0.046678244595642425, 0.30411074602523364, -0.06939133026635563, -0.18774510581499418, 0.030525284938866627, -0.21358055212673405, -0.15969632122653057, 0.1076402579311508, 0.11150787551446843, 0.18228368732662922, 0.01374801974128098, 0.20033608795249067, -0.1053182100782775, 0.17239709169528372, 0.14794648576188027, 0.04439687776234555, 0.06298520506636517, -0.002761726900054192, 0.08781334195235693, 0.12284393200211893, -0.020559893077793153, 0.06194462234113441, -0.3889546391138857, -0.18754087003794298, -0.15347090153325652, 0.1564070649934316, -0.20162308417098215, -0.09449016074948893, 0.2579495035791518, 0.043478143266150474, 0.23598861495309, 0.15206740863268842, 0.20545010623597615, 0.12263511495414581, 0.017082994754231105, 0.0854648746757743, 0.11722513197172382, 0.13444725241877037, -0.05156469058459373, -0.11191737433624882, 0.01328337293533558, 0.1342738313424225] |
1,802.00086 | Optimizing Non-decomposable Measures with Deep Networks | We present a class of algorithms capable of directly training deep neural
networks with respect to large families of task-specific performance measures
such as the F-measure and the Kullback-Leibler divergence that are structured
and non-decomposable. This presents a departure from standard deep learning
techniques that typically use squared or cross-entropy loss functions (that are
decomposable) to train neural networks. We demonstrate that directly training
with task-specific loss functions yields much faster and more stable
convergence across problems and datasets. Our proposed algorithms and
implementations have several novel features including (i) convergence to first
order stationary points despite optimizing complex objective functions; (ii)
use of fewer training samples to achieve a desired level of convergence, (iii)
a substantial reduction in training time, and (iv) a seamless integration of
our implementation into existing symbolic gradient frameworks. We implement our
techniques on a variety of deep architectures including multi-layer perceptrons
and recurrent neural networks and show that on a variety of benchmark and real
data sets, our algorithms outperform traditional approaches to training deep
networks, as well as some recent approaches to task-specific training of neural
networks.
| stat.ML cs.LG | we present a class of algorithms capable of directly training deep neural networks with respect to large families of taskspecific performance measures such as the fmeasure and the kullbackleibler divergence that are structured and nondecomposable this presents a departure from standard deep learning techniques that typically use squared or crossentropy loss functions that are decomposable to train neural networks we demonstrate that directly training with taskspecific loss functions yields much faster and more stable convergence across problems and datasets our proposed algorithms and implementations have several novel features including i convergence to first order stationary points despite optimizing complex objective functions ii use of fewer training samples to achieve a desired level of convergence iii a substantial reduction in training time and iv a seamless integration of our implementation into existing symbolic gradient frameworks we implement our techniques on a variety of deep architectures including multilayer perceptrons and recurrent neural networks and show that on a variety of benchmark and real data sets our algorithms outperform traditional approaches to training deep networks as well as some recent approaches to taskspecific training of neural networks | [['we', 'present', 'a', 'class', 'of', 'algorithms', 'capable', 'of', 'directly', 'training', 'deep', 'neural', 'networks', 'with', 'respect', 'to', 'large', 'families', 'of', 'taskspecific', 'performance', 'measures', 'such', 'as', 'the', 'fmeasure', 'and', 'the', 'kullbackleibler', 'divergence', 'that', 'are', 'structured', 'and', 'nondecomposable', 'this', 'presents', 'a', 'departure', 'from', 'standard', 'deep', 'learning', 'techniques', 'that', 'typically', 'use', 'squared', 'or', 'crossentropy', 'loss', 'functions', 'that', 'are', 'decomposable', 'to', 'train', 'neural', 'networks', 'we', 'demonstrate', 'that', 'directly', 'training', 'with', 'taskspecific', 'loss', 'functions', 'yields', 'much', 'faster', 'and', 'more', 'stable', 'convergence', 'across', 'problems', 'and', 'datasets', 'our', 'proposed', 'algorithms', 'and', 'implementations', 'have', 'several', 'novel', 'features', 'including', 'i', 'convergence', 'to', 'first', 'order', 'stationary', 'points', 'despite', 'optimizing', 'complex', 'objective', 'functions', 'ii', 'use', 'of', 'fewer', 'training', 'samples', 'to', 'achieve', 'a', 'desired', 'level', 'of', 'convergence', 'iii', 'a', 'substantial', 'reduction', 'in', 'training', 'time', 'and', 'iv', 'a', 'seamless', 'integration', 'of', 'our', 'implementation', 'into', 'existing', 'symbolic', 'gradient', 'frameworks', 'we', 'implement', 'our', 'techniques', 'on', 'a', 'variety', 'of', 'deep', 'architectures', 'including', 'multilayer', 'perceptrons', 'and', 'recurrent', 'neural', 'networks', 'and', 'show', 'that', 'on', 'a', 'variety', 'of', 'benchmark', 'and', 'real', 'data', 'sets', 'our', 'algorithms', 'outperform', 'traditional', 'approaches', 'to', 'training', 'deep', 'networks', 'as', 'well', 'as', 'some', 'recent', 'approaches', 'to', 'taskspecific', 'training', 'of', 'neural', 'networks']] | [-0.02023016077937032, -0.045763251662719995, -0.0380634826762379, 0.08910570299849496, -0.09448076202154523, -0.18401175712326379, 0.04100889393315731, 0.49357693069412006, -0.28119884742140444, -0.3021336673602649, 0.06137517823789613, -0.2619920270315007, -0.24122936610365286, 0.2364867607868054, -0.11676798793031713, 0.1541452384933465, 0.1726768437504728, -0.014394785869745132, -0.14480890395782847, -0.33347445322863717, 0.32127333302101446, 0.008690318861424559, 0.3647151799346118, -0.015120062387406664, 0.15110170237375828, -0.07438658020858027, 0.024290740407077068, 0.006500981859457882, -0.028121400671056028, 0.21156762708889562, 0.2883311596613013, 0.2491593930070572, 0.3660597335142286, -0.42010960570010153, -0.2589395409184204, 0.1378122823500788, 0.13354638846668304, 0.10503643191662812, -0.01487671895341444, -0.293727449079439, 0.10398269432303293, -0.15505858216151272, 0.026503174950409193, -0.22298591131465914, -0.05766320260970489, 0.07329675213448987, -0.3218589671520496, 0.01654584174874522, 0.08331836894301334, 0.07102920768944465, -0.014609325978317824, -0.1727285207522547, 0.018346527916551364, 0.11008845526932577, 0.03524338295518765, 0.07155737048600239, 0.12789966019234902, -0.17450930155546698, -0.18846881799475776, 0.29953585702257796, -0.08177610673326695, -0.21291889539988124, 0.25100396666675806, 0.011865760910871399, -0.1416949156023886, 0.10424476408946287, 0.29220603949532076, 0.12559230076705874, -0.1476824278690164, 0.00010375190322520211, 0.00751539505765085, 0.14651512361951577, 0.03353368348705218, 0.020488962315974513, 0.11707668504095636, 0.2613622444433808, 0.05797035234560178, 0.141204755826671, -0.10322143145300366, -0.10682596444941896, -0.23570375086780151, -0.09313074845546077, -0.1910874190861764, 0.0041627788874472535, -0.1338347246706373, -0.20078406996427753, 0.4024001244739022, 0.191152728990267, 0.23065710354358485, 0.2053998430554044, 0.36544232526490383, 0.012628662134217017, 0.16979410359889027, 0.13231013544693426, 0.18679201962130837, 0.0369145040294034, 0.13104785634103513, -0.13439455980171813, 0.07864941279663269, 0.02739642105623953] |
1,802.00087 | L^1 metric geometry of big cohomology classes | Suppose $(X,\omega)$ is a compact K\"ahler manifold of dimension $n$, and
$\theta$ is closed $(1,1)$-form representing a big cohomology class. We
introduce a metric $d_1$ on the finite energy space $\mathcal{E}^1(X,\theta)$,
making it a complete geodesic metric space. This construction is potentially
more rigid compared to its analog from the K\"ahler case, as it only relies on
pluripotential theory, with no reference to infinite dimensional $L^1$ Finsler
geometry. Lastly, by adapting the results of Ross and Witt Nystr\"om to the big
case, we show that one can construct geodesic rays in this space in a flexible
manner.
| math.DG math.CV | suppose xomega is a compact kahler manifold of dimension n and theta is closed 11form representing a big cohomology class we introduce a metric d_1 on the finite energy space mathcale1xtheta making it a complete geodesic metric space this construction is potentially more rigid compared to its analog from the kahler case as it only relies on pluripotential theory with no reference to infinite dimensional l1 finsler geometry lastly by adapting the results of ross and witt nystrom to the big case we show that one can construct geodesic rays in this space in a flexible manner | [['suppose', 'xomega', 'is', 'a', 'compact', 'kahler', 'manifold', 'of', 'dimension', 'n', 'and', 'theta', 'is', 'closed', '11form', 'representing', 'a', 'big', 'cohomology', 'class', 'we', 'introduce', 'a', 'metric', 'd_1', 'on', 'the', 'finite', 'energy', 'space', 'mathcale1xtheta', 'making', 'it', 'a', 'complete', 'geodesic', 'metric', 'space', 'this', 'construction', 'is', 'potentially', 'more', 'rigid', 'compared', 'to', 'its', 'analog', 'from', 'the', 'kahler', 'case', 'as', 'it', 'only', 'relies', 'on', 'pluripotential', 'theory', 'with', 'no', 'reference', 'to', 'infinite', 'dimensional', 'l1', 'finsler', 'geometry', 'lastly', 'by', 'adapting', 'the', 'results', 'of', 'ross', 'and', 'witt', 'nystrom', 'to', 'the', 'big', 'case', 'we', 'show', 'that', 'one', 'can', 'construct', 'geodesic', 'rays', 'in', 'this', 'space', 'in', 'a', 'flexible', 'manner']] | [-0.150901614092921, 0.08522194597753696, -0.09748671212097786, 0.09853117103557452, -0.16457528022874612, -0.135168335584846, -0.01976103322643515, 0.37480583075618296, -0.2695347563906883, -0.18801648693624884, 0.0976427429850446, -0.2614400178960447, -0.17826411002170062, 0.21028681753644682, -0.15827832074137405, -0.010865618977428918, 0.07531682411111736, 0.10774334552115761, -0.0962559138351935, -0.26064788279230316, 0.43303432120592333, 0.017905102928731747, 0.23005915065732552, 0.0053350376450301456, 0.152066282404121, -0.00667327773286767, -0.0071178783706879285, 0.032419525386709815, -0.13592689312925663, 0.1546029586267347, 0.2798535143956542, 0.10840508480760036, 0.2253115137621838, -0.35060609347419813, -0.23464644750947627, 0.19507660189992748, 0.09266641218952525, 0.05608211123762885, -0.022741779884654534, -0.2853876728089138, 0.10326234441890847, -0.1288491876621265, -0.17844155428610975, -0.11220229843941827, 0.03682461645697307, -0.06447674974333495, -0.221382059903893, -0.04017044179878818, 0.0821548046854635, 0.031411566868579634, -0.06762967449928207, -0.06098766724850672, -0.031199282355373725, 0.025284474117749294, 0.006910805185422457, 0.12349436436488759, 0.08954547576528664, 0.00408602648917622, -0.06208638552000897, 0.38075530511074857, -0.10655947650472324, -0.3112020963356675, 0.14528675603408678, -0.1352612651559563, -0.1314834336444619, 0.10313379842409631, 0.1181012957119189, 0.19206173359028375, -0.061503444119201355, 0.23192181888225605, -0.06612575995677616, 0.10643396939849481, 0.11701785553790008, -0.026771671409126913, 0.1228158188071878, 0.15972374513027413, 0.15076763130976664, 0.11915360342391068, -0.028652847030874302, -0.09937430049103568, -0.352782730027684, -0.21695428782337936, -0.17715634551495896, 0.18078629828232806, -0.16340655864496512, -0.20553262605487058, 0.33006335611086496, 0.012704674520136905, 0.22218156277085654, 0.09482974933537965, 0.2884255551277117, 0.01659145595173565, 0.029066175544964306, 0.1201835689280415, 0.1479782690415353, 0.1537136166516575, 0.04564639234255689, -0.10702909786050441, -0.05462866840146793, 0.16272040968760848] |
1,802.00088 | Improved Image Segmentation via Cost Minimization of Multiple Hypotheses | Image segmentation is an important component of many image understanding
systems. It aims to group pixels in a spatially and perceptually coherent
manner. Typically, these algorithms have a collection of parameters that
control the degree of over-segmentation produced. It still remains a challenge
to properly select such parameters for human-like perceptual grouping. In this
work, we exploit the diversity of segments produced by different choices of
parameters. We scan the segmentation parameter space and generate a collection
of image segmentation hypotheses (from highly over-segmented to
under-segmented). These are fed into a cost minimization framework that
produces the final segmentation by selecting segments that: (1) better describe
the natural contours of the image, and (2) are more stable and persistent among
all the segmentation hypotheses. We compare our algorithm's performance with
state-of-the-art algorithms, showing that we can achieve improved results. We
also show that our framework is robust to the choice of segmentation kernel
that produces the initial set of hypotheses.
| cs.CV | image segmentation is an important component of many image understanding systems it aims to group pixels in a spatially and perceptually coherent manner typically these algorithms have a collection of parameters that control the degree of oversegmentation produced it still remains a challenge to properly select such parameters for humanlike perceptual grouping in this work we exploit the diversity of segments produced by different choices of parameters we scan the segmentation parameter space and generate a collection of image segmentation hypotheses from highly oversegmented to undersegmented these are fed into a cost minimization framework that produces the final segmentation by selecting segments that 1 better describe the natural contours of the image and 2 are more stable and persistent among all the segmentation hypotheses we compare our algorithms performance with stateoftheart algorithms showing that we can achieve improved results we also show that our framework is robust to the choice of segmentation kernel that produces the initial set of hypotheses | [['image', 'segmentation', 'is', 'an', 'important', 'component', 'of', 'many', 'image', 'understanding', 'systems', 'it', 'aims', 'to', 'group', 'pixels', 'in', 'a', 'spatially', 'and', 'perceptually', 'coherent', 'manner', 'typically', 'these', 'algorithms', 'have', 'a', 'collection', 'of', 'parameters', 'that', 'control', 'the', 'degree', 'of', 'oversegmentation', 'produced', 'it', 'still', 'remains', 'a', 'challenge', 'to', 'properly', 'select', 'such', 'parameters', 'for', 'humanlike', 'perceptual', 'grouping', 'in', 'this', 'work', 'we', 'exploit', 'the', 'diversity', 'of', 'segments', 'produced', 'by', 'different', 'choices', 'of', 'parameters', 'we', 'scan', 'the', 'segmentation', 'parameter', 'space', 'and', 'generate', 'a', 'collection', 'of', 'image', 'segmentation', 'hypotheses', 'from', 'highly', 'oversegmented', 'to', 'undersegmented', 'these', 'are', 'fed', 'into', 'a', 'cost', 'minimization', 'framework', 'that', 'produces', 'the', 'final', 'segmentation', 'by', 'selecting', 'segments', 'that', '1', 'better', 'describe', 'the', 'natural', 'contours', 'of', 'the', 'image', 'and', '2', 'are', 'more', 'stable', 'and', 'persistent', 'among', 'all', 'the', 'segmentation', 'hypotheses', 'we', 'compare', 'our', 'algorithms', 'performance', 'with', 'stateoftheart', 'algorithms', 'showing', 'that', 'we', 'can', 'achieve', 'improved', 'results', 'we', 'also', 'show', 'that', 'our', 'framework', 'is', 'robust', 'to', 'the', 'choice', 'of', 'segmentation', 'kernel', 'that', 'produces', 'the', 'initial', 'set', 'of', 'hypotheses']] | [-0.062372262468825115, 0.04586886671020682, -0.09832723825912243, 0.06568285099262922, -0.06884890471134077, -0.12491351871241657, 0.005161458619067785, 0.4814184026663783, -0.2621145414088929, -0.3529164466960063, 0.06654054019014416, -0.24334773852976052, -0.15845760179144688, 0.20994679485711287, -0.13766013696766313, 0.055950031141346356, 0.15586656072534294, 0.02318931100948614, -0.030336429307503777, -0.2850481227696317, 0.3062156044472442, 0.03447682148068206, 0.30571370375043944, -0.023751952758632927, 0.13166117772705993, -0.03553992903896801, -0.04426660197556353, 0.033680701560784516, -0.0807134409378533, 0.18889806499015013, 0.2984603858968747, 0.20213372177743125, 0.29471185297336217, -0.37660570997955667, -0.2109194603285887, 0.10160466833439152, 0.14893654014445906, 0.09147775762439149, -0.053767283273287524, -0.29861822555064216, 0.1415439018226996, -0.09950896715032377, -0.009288824274667404, -0.14614289735572752, -0.006326612483405467, -0.01585105449106228, -0.30901136627104486, 0.027798161906177038, 0.09435891744361476, 0.001964384572688086, -0.09346726992161675, -0.10126261727345533, 0.006948809877459733, 0.18361079028321417, 0.02155125607097955, 0.07152897416198123, 0.15283724859228018, -0.19695925749157434, -0.10648535164775995, 0.36901738014329905, -0.008086087047444575, -0.2329993700058018, 0.2105802520406696, -0.06470184579620478, -0.1573586497293293, 0.1485125112505454, 0.1772375094393889, 0.11308996972727513, -0.14193355797719703, -0.018020945538198517, -0.056122228454537806, 0.19729981158783882, 0.055853534851562955, 0.006318126955954065, 0.17740655227845428, 0.2215924363278743, 0.07014447142576517, 0.1349075103761429, -0.13053311862976952, -0.0366914096850691, -0.26051114020032995, -0.11478874466891559, -0.14485671645859197, -0.05007305028760489, -0.10523984463169363, -0.16360540293836556, 0.43398914715486037, 0.22719004949988247, 0.24550922594542773, 0.056074758310679276, 0.3403794594495645, 0.03737999446795882, 0.08205942143305386, 0.06683803224971271, 0.18115765032572262, 0.011349229795167094, 0.01626923154898972, -0.15660077145575024, 0.07464196360172154, 0.055945586585937616] |
1,802.00089 | Fujii's development on Chebyshev's conjecture | Chebyshev presented a conjecture after observing the apparent bias towards
primes congruent to $3\pmod 4$. His conjecture is equivalent to a version of
the Generalised Riemann Hypothesis. Fujii strengthened this conjecture; we
strengthen it still further using detailed computations of zeroes of Dirichlet
$L$-functions.
| math.NT | chebyshev presented a conjecture after observing the apparent bias towards primes congruent to 3pmod 4 his conjecture is equivalent to a version of the generalised riemann hypothesis fujii strengthened this conjecture we strengthen it still further using detailed computations of zeroes of dirichlet lfunctions | [['chebyshev', 'presented', 'a', 'conjecture', 'after', 'observing', 'the', 'apparent', 'bias', 'towards', 'primes', 'congruent', 'to', '3pmod', '4', 'his', 'conjecture', 'is', 'equivalent', 'to', 'a', 'version', 'of', 'the', 'generalised', 'riemann', 'hypothesis', 'fujii', 'strengthened', 'this', 'conjecture', 'we', 'strengthen', 'it', 'still', 'further', 'using', 'detailed', 'computations', 'of', 'zeroes', 'of', 'dirichlet', 'lfunctions']] | [-0.19624167190737685, 0.004130265484987335, -0.18078880105167627, 0.14352130678492936, -0.09933026075701822, -0.20081266276115042, 0.09800840727984905, 0.2489162114533511, -0.25527957871302287, -0.2777473505438221, 0.08317108179273253, -0.22661049002040687, -0.11864814831113274, 0.1638324364056726, -0.14344899646200496, 0.05735274705908854, 0.07786447675475343, -0.029084972582164813, -0.0936831301607361, -0.43186473016711796, 0.2994052452373911, 0.06132677193223075, 0.1759429962601809, 0.14420345455767924, 0.01466207127933475, 0.022484662297012455, -0.034603111213073134, -0.0731259267353876, -0.15802116349170153, 0.1338101531820774, 0.2525865104292858, 0.09920003345574845, 0.29987135072323406, -0.4002127722752365, -0.10592902964840918, 0.1633288411381231, 0.12818973845886913, -0.0012595618186010556, 0.027685652232982895, -0.29483451330187643, 0.12442356832748787, -0.12320002651011402, -0.29390321248634294, -0.007269260642880743, 0.04606388824653219, -0.05388622343360277, -0.22874204473919235, 0.12737680283713748, 0.16619398654438555, 0.13249829031007143, -0.0606708891520446, -0.1628617664629763, 0.04404245083093305, -0.024901364273814994, 0.08917996003699293, 0.06447872628500177, 0.004919783582656898, -0.0451899934083816, -0.1090647163695063, 0.2746117892251773, 0.012616328852759167, -0.15725601377727633, 0.0605602606559511, -0.15701129181649198, -0.27476994926374493, 0.1025203047637743, 0.008985409830612216, 0.11777786487205462, -0.027643386465073985, 0.09825401881244034, -0.1869324056685648, 0.13653856586791913, 0.2193276197014546, -0.1614414532033896, 0.21409735614328052, 0.02320807698098096, 0.0204705936326222, 0.19332337779500944, -0.0053176334212449465, -0.025278927366757256, -0.32916636286642065, -0.2471119271252643, -0.18567602640806316, 0.15753921554212205, -0.08323698715222153, -0.15040491048288954, 0.34263774371621286, 0.15307183798656546, 0.09349472680002112, 0.1950756762473082, 0.19620807812845503, 0.11386863353916189, 0.043655639556659895, 0.04248475020391528, 0.130042327567935, 0.25094944568858907, 0.023846080995016648, -0.11267004700758579, -0.010457438236864453, 0.1762341894209385] |
1,802.0009 | Dirac field in the background of a planar defect | We study massless Dirac fermions in the background of a specific planar
topologically nontrivial configuration in the three-dimensional spacetime. The
results show the presence of massive bound states, phase shifts and the
consequent differential cross section for the scattering of fermions in the
weak coupling regime. Despite the nontrivial topology of the background field,
no fermionic zero mode is found.
| hep-th | we study massless dirac fermions in the background of a specific planar topologically nontrivial configuration in the threedimensional spacetime the results show the presence of massive bound states phase shifts and the consequent differential cross section for the scattering of fermions in the weak coupling regime despite the nontrivial topology of the background field no fermionic zero mode is found | [['we', 'study', 'massless', 'dirac', 'fermions', 'in', 'the', 'background', 'of', 'a', 'specific', 'planar', 'topologically', 'nontrivial', 'configuration', 'in', 'the', 'threedimensional', 'spacetime', 'the', 'results', 'show', 'the', 'presence', 'of', 'massive', 'bound', 'states', 'phase', 'shifts', 'and', 'the', 'consequent', 'differential', 'cross', 'section', 'for', 'the', 'scattering', 'of', 'fermions', 'in', 'the', 'weak', 'coupling', 'regime', 'despite', 'the', 'nontrivial', 'topology', 'of', 'the', 'background', 'field', 'no', 'fermionic', 'zero', 'mode', 'is', 'found']] | [-0.2623886441346258, 0.24069311861724904, -0.030100294994190334, 0.07444048407681597, -0.03462477022161086, -0.09394929004677882, 0.03168694571359083, 0.2889596262325843, -0.16765251002119233, -0.2659755203407258, -0.009872714443675552, -0.3176677180454135, -0.15368998753838242, 0.12490131882950664, 0.04793719865071277, 0.03281004949628065, 0.0415668558018903, 0.08377554760469745, -0.08543066337394217, -0.20054166941942336, 0.39278617286278555, 0.00030209252533192434, 0.3341974798589945, 0.09247747166082262, 0.04510527950090667, 0.031049099339482685, 0.00492986363824457, 0.00725915739312768, -0.10531229356614252, 0.015244446449408618, 0.19492870496275524, -0.04879688419944917, 0.1146277508387963, -0.4164644845140477, -0.19677210793209574, 0.0780419754756925, 0.1437121639959514, 0.1567272124501566, -0.1054686410818249, -0.3392890655901283, 0.026061380507114033, -0.11700842112768442, -0.1952124561648816, -0.04635319543691973, -0.01881301771500148, -0.11140748653948927, -0.21599121266820778, 0.09463534814616044, 0.0836299149862801, 0.015331144770607352, -0.06228962200208722, -0.06184719121083617, -0.10613165406199793, 0.07125131442056348, 0.0839049069948184, -0.0013550976718155047, 0.07628604012231031, -0.22947324644774197, -0.12702736208836238, 0.3678956938131402, -0.13355793071289856, -0.21777509913469353, 0.19049033376698693, -0.2162639094594245, -0.0963942007200482, 0.18894868468244871, 0.14753272500820458, 0.12746831009086843, -0.11114428346045316, 0.2130198089396193, -0.03799407068484773, 0.1496158824302256, 0.06104560592987885, 0.08211736959055997, 0.25847695316188035, 0.10878630954151353, 0.08147294162772596, 0.14030868347811823, -0.1012128551568215, -0.1202806571071657, -0.3372661610444387, -0.18648284884402527, -0.14637942281697178, 0.0512766378679468, -0.09582325639178937, -0.2345823026727885, 0.39322718082306285, 0.08891191434061814, 0.17627067822031678, -0.026645029134427508, 0.2664204705506563, 0.1616890898362423, 0.03174728093824039, 0.05210362627791862, 0.330890837792928, 0.18974542391176025, 0.07486207803400854, -0.28088242434508476, -0.07761020829590658, 0.035432737801844874] |
1,802.00091 | Multiplicities of Eigenvalues of the Diffusion Operator with Random
Jumps from the Boundary | This paper deals with a non-self-adjoint differential operator which is
associated with a diffusion process with random jumps from the boundary. Our
main result is that the algebraic multiplicity of an eigenvalue is equal to its
order as a zero of the characteristic function $\Delta(\lambda) $. This can be
used to determine the multiplicities of eigenvalues for concrete operators.
| math.SP | this paper deals with a nonselfadjoint differential operator which is associated with a diffusion process with random jumps from the boundary our main result is that the algebraic multiplicity of an eigenvalue is equal to its order as a zero of the characteristic function deltalambda this can be used to determine the multiplicities of eigenvalues for concrete operators | [['this', 'paper', 'deals', 'with', 'a', 'nonselfadjoint', 'differential', 'operator', 'which', 'is', 'associated', 'with', 'a', 'diffusion', 'process', 'with', 'random', 'jumps', 'from', 'the', 'boundary', 'our', 'main', 'result', 'is', 'that', 'the', 'algebraic', 'multiplicity', 'of', 'an', 'eigenvalue', 'is', 'equal', 'to', 'its', 'order', 'as', 'a', 'zero', 'of', 'the', 'characteristic', 'function', 'deltalambda', 'this', 'can', 'be', 'used', 'to', 'determine', 'the', 'multiplicities', 'of', 'eigenvalues', 'for', 'concrete', 'operators']] | [-0.11323003903641526, 0.11357927878998453, -0.11351555698262207, 0.04316873802991754, -0.08734924407627691, -0.09377452537642214, -0.057400518913897844, 0.295981435297892, -0.3156790130546895, -0.2178292447893784, 0.1326636866794835, -0.3131279659874994, -0.13030888872413798, 0.15291879694820543, -0.10528530864494628, 0.07905968273327493, 0.07004283368587494, 0.14085624296346616, -0.05385794677241738, -0.17948033901509539, 0.42663626103051777, 0.034071530183327606, 0.15005697200781312, 0.06792140308896015, 0.08500038619667034, -0.027475052830313557, 0.004946996257158703, 0.008570307319791153, -0.11144982641705829, 0.14148998338375882, 0.2754661685883485, 0.021360474542297166, 0.2664874451363395, -0.3426314303009161, -0.14931675578178516, 0.17382527425371366, 0.15422196736045438, 0.06590107696156965, 0.010782979027336013, -0.2376441983987802, 0.14575597075424318, -0.15614634691255874, -0.2128023656952227, -0.014522918933552915, 0.004115803504426931, 0.030910172788747425, -0.3444064931526523, 0.07838573826252129, 0.08853337870798363, 0.05828701149158437, -0.04466866834514678, -0.13284352564469687, -0.008131310082811477, 0.1165147513102997, 0.05032164603823009, 0.004457065835595131, 0.05849537559271116, -0.05553701981613091, -0.12946927798751356, 0.34584465804349246, -0.05714726746122449, -0.2377535201737593, 0.15174886730403223, -0.16467292916736212, -0.07550662445257707, 0.13777836253224263, 0.15164011032802277, 0.15969235405068974, -0.1367807932165933, 0.11690293043723395, -0.05477561831980109, 0.1327194395507204, 0.03454810756676156, -0.02289540359975192, 0.1200501137445199, 0.10915958601178537, 0.1392284830357751, 0.1616540898002909, -0.016654050905972013, -0.07692070100617049, -0.3780538200818259, -0.20227975411147908, -0.21850541805655793, 0.12187561945556181, -0.11139772521685166, -0.22510676893630419, 0.44309679630758436, 0.12662152371947363, 0.2797020640031531, 0.08116556450539943, 0.26917577261137293, 0.26484605331969413, 0.04981785683424999, 0.023714129178752673, 0.12216152851309242, 0.22708010060536066, 0.11893009477905159, -0.2288793738939446, 0.06471143785767772, 0.10105985233656548] |
1,802.00092 | Keyshuffling Attack for Persistent Early Code Execution in the Nintendo
3DS Secure Bootchain | We demonstrate an attack on the secure bootchain of the Nintendo 3DS in order
to gain early code execution. The attack utilizes the block shuffling
vulnerability of the ECB cipher mode to rearrange keys in the Nintendo 3DS's
encrypted keystore. Because the shuffled keys will deterministically decrypt
the encrypted firmware binary to incorrect plaintext data and execute it, and
because the device's memory contents are kept between hard reboots, it is
possible to reliably reach a branching instruction to a payload in memory. This
payload, due to its execution by a privileged processor and its early
execution, is able to extract the hash of hardware secrets necessary to decrypt
the device's encrypted keystore and set up a persistent exploit of the system.
| cs.CR | we demonstrate an attack on the secure bootchain of the nintendo 3ds in order to gain early code execution the attack utilizes the block shuffling vulnerability of the ecb cipher mode to rearrange keys in the nintendo 3dss encrypted keystore because the shuffled keys will deterministically decrypt the encrypted firmware binary to incorrect plaintext data and execute it and because the devices memory contents are kept between hard reboots it is possible to reliably reach a branching instruction to a payload in memory this payload due to its execution by a privileged processor and its early execution is able to extract the hash of hardware secrets necessary to decrypt the devices encrypted keystore and set up a persistent exploit of the system | [['we', 'demonstrate', 'an', 'attack', 'on', 'the', 'secure', 'bootchain', 'of', 'the', 'nintendo', '3ds', 'in', 'order', 'to', 'gain', 'early', 'code', 'execution', 'the', 'attack', 'utilizes', 'the', 'block', 'shuffling', 'vulnerability', 'of', 'the', 'ecb', 'cipher', 'mode', 'to', 'rearrange', 'keys', 'in', 'the', 'nintendo', '3dss', 'encrypted', 'keystore', 'because', 'the', 'shuffled', 'keys', 'will', 'deterministically', 'decrypt', 'the', 'encrypted', 'firmware', 'binary', 'to', 'incorrect', 'plaintext', 'data', 'and', 'execute', 'it', 'and', 'because', 'the', 'devices', 'memory', 'contents', 'are', 'kept', 'between', 'hard', 'reboots', 'it', 'is', 'possible', 'to', 'reliably', 'reach', 'a', 'branching', 'instruction', 'to', 'a', 'payload', 'in', 'memory', 'this', 'payload', 'due', 'to', 'its', 'execution', 'by', 'a', 'privileged', 'processor', 'and', 'its', 'early', 'execution', 'is', 'able', 'to', 'extract', 'the', 'hash', 'of', 'hardware', 'secrets', 'necessary', 'to', 'decrypt', 'the', 'devices', 'encrypted', 'keystore', 'and', 'set', 'up', 'a', 'persistent', 'exploit', 'of', 'the', 'system']] | [-0.2076918808808033, 0.03634673107575136, -0.125459760433445, 0.048165751156460844, -0.09739788200728133, -0.25072412620274687, 0.14699270614645737, 0.3659722589624998, -0.3526864846786245, -0.3270124858484054, 0.15493593925439045, -0.2700699460971305, -0.04851603866594597, 0.16208583118123376, -0.16076511090509912, 0.13095465233115655, 0.043612998228671394, 0.050578467450383253, 0.019666226995157667, -0.36711619389601624, 0.22259220961704212, 0.10844946701206967, 0.2799022020413898, -0.021707835326639887, 0.08201909159274343, -0.0006987271317018148, -0.03018765462339561, -0.1441248733884631, -0.008776689967156475, 0.09473707624830496, 0.2903522185615113, 0.21735780839370483, 0.24992697620684776, -0.4817706513274302, -0.05683291357649395, 0.06999738670439802, 0.11387780669859698, 0.1290955869242167, -0.003914834192205762, -0.3011875719072807, 0.18270424004787436, -0.2445452522016807, -0.016494454805784993, -0.10458291782082146, 0.02395278004069741, -0.016702872334828235, -0.24097192066952458, -0.09078725325301863, 0.03753734076829452, -0.020997401215454452, 0.041257573236685455, 0.02144119229951762, -0.01282874655085974, 0.20705325596639487, 0.004402210040447803, 0.04217592429401528, 0.20532846721844414, -0.07802935486508167, -0.11344984400137845, 0.4093520248420218, 0.0366525608045248, -0.1318129576429472, 0.12514789443628258, -0.03227026093727312, -0.09454831128350945, 0.1271627641036215, 0.23224173576380006, 0.03132912026754079, -0.1556032379834443, 0.004309983468319998, 0.027913682917968776, 0.3163771045067881, 0.10338198261048931, 0.08767961508108892, 0.19650507639520443, 0.14397795608219427, 0.02824450398468946, 0.197447882933367, -0.07530669107611299, -0.0777633852752236, -0.2230544759748647, -0.19305434961739576, -0.2318877785147713, 0.0029103891510102483, -0.06515557838665545, -0.1355049569462227, 0.3760115815979293, 0.2498020157058779, 0.13530808217568785, 0.07256607974990884, 0.4334968762526002, -0.04239940680013711, 0.17897462209439877, 0.17078625404825196, 0.12668039675197032, 0.05121494303298239, 0.1711811470783228, -0.18984349083919555, 0.17856053382050818, -0.019137492813329156] |
1,802.00093 | Cross-domain CNN for Hyperspectral Image Classification | In this paper, we address the dataset scarcity issue with the hyperspectral
image classification. As only a few thousands of pixels are available for
training, it is difficult to effectively learn high-capacity Convolutional
Neural Networks (CNNs). To cope with this problem, we propose a novel
cross-domain CNN containing the shared parameters which can co-learn across
multiple hyperspectral datasets. The network also contains the non-shared
portions designed to handle the dataset specific spectral characteristics and
the associated classification tasks. Our approach is the first attempt to learn
a CNN for multiple hyperspectral datasets, in an end-to-end fashion. Moreover,
we have experimentally shown that the proposed network trained on three of the
widely used datasets outperform all the baseline networks which are trained on
single dataset.
| cs.CV | in this paper we address the dataset scarcity issue with the hyperspectral image classification as only a few thousands of pixels are available for training it is difficult to effectively learn highcapacity convolutional neural networks cnns to cope with this problem we propose a novel crossdomain cnn containing the shared parameters which can colearn across multiple hyperspectral datasets the network also contains the nonshared portions designed to handle the dataset specific spectral characteristics and the associated classification tasks our approach is the first attempt to learn a cnn for multiple hyperspectral datasets in an endtoend fashion moreover we have experimentally shown that the proposed network trained on three of the widely used datasets outperform all the baseline networks which are trained on single dataset | [['in', 'this', 'paper', 'we', 'address', 'the', 'dataset', 'scarcity', 'issue', 'with', 'the', 'hyperspectral', 'image', 'classification', 'as', 'only', 'a', 'few', 'thousands', 'of', 'pixels', 'are', 'available', 'for', 'training', 'it', 'is', 'difficult', 'to', 'effectively', 'learn', 'highcapacity', 'convolutional', 'neural', 'networks', 'cnns', 'to', 'cope', 'with', 'this', 'problem', 'we', 'propose', 'a', 'novel', 'crossdomain', 'cnn', 'containing', 'the', 'shared', 'parameters', 'which', 'can', 'colearn', 'across', 'multiple', 'hyperspectral', 'datasets', 'the', 'network', 'also', 'contains', 'the', 'nonshared', 'portions', 'designed', 'to', 'handle', 'the', 'dataset', 'specific', 'spectral', 'characteristics', 'and', 'the', 'associated', 'classification', 'tasks', 'our', 'approach', 'is', 'the', 'first', 'attempt', 'to', 'learn', 'a', 'cnn', 'for', 'multiple', 'hyperspectral', 'datasets', 'in', 'an', 'endtoend', 'fashion', 'moreover', 'we', 'have', 'experimentally', 'shown', 'that', 'the', 'proposed', 'network', 'trained', 'on', 'three', 'of', 'the', 'widely', 'used', 'datasets', 'outperform', 'all', 'the', 'baseline', 'networks', 'which', 'are', 'trained', 'on', 'single', 'dataset']] | [-0.047019642643487805, -0.04996232895850441, -0.021242871407359358, 0.0585919123541023, -0.12229576957179233, -0.2082361415096168, -0.02949941957992832, 0.501788767234933, -0.28464290988631546, -0.36011592068919734, 0.0882108899137576, -0.2881510913702509, -0.19852681294263852, 0.18676467227839655, -0.15951000820965536, 0.11202059131896784, 0.19016231264498445, 0.061395381660399685, -0.028943557838623922, -0.35102170527792503, 0.33132861455106327, 0.016277051542044407, 0.3740388777918152, 0.006008535366310107, 0.15250369678476766, -0.09677964609657083, -0.02336863354374204, -0.029664406036552522, -0.0012117764772776882, 0.19535176534179388, 0.36460216702412696, 0.18559912384878244, 0.32001585265876903, -0.39849430420191867, -0.26795715425584105, 0.13549611747880735, 0.1539271595576147, 0.10404260313237412, 0.011895039875525981, -0.35098132227487383, 0.09019904024147939, -0.16600503825635138, 0.06547040812250587, -0.16963750658737076, -0.055879785649238095, -0.056665273961581046, -0.2907833976280545, 0.02714382375439351, 0.012562815826611532, 0.017977822687469364, -0.05100945765978747, -0.09125586480443035, 0.02246578698865168, 0.20392550193449302, 0.0016569954168517143, 0.0375625797586831, 0.08206707032983221, -0.15967758629408163, -0.12005383797335409, 0.3444027873356977, -0.062300928999320604, -0.23050665520432015, 0.20792793034906348, 0.01384401108859287, -0.17753526912025747, 0.0948421398493191, 0.26463253617346766, 0.13789540317544202, -0.2112635363253855, -0.04730562427158152, -0.11023085802463034, 0.21458081572106288, 0.04725585600000716, -0.010749684487241357, 0.1665296996023596, 0.3151860518846661, -0.009449133324162704, 0.17148391113826825, -0.23866679550631106, -0.01977807795253372, -0.16844002069668815, -0.04919557867293817, -0.2425292411888574, -0.046585676295968194, -0.08857441986824156, -0.1503096910253648, 0.4528950497286484, 0.27712983983738304, 0.24451193332131352, 0.12919548142963322, 0.3512732225335053, -0.05127803823204651, 0.20143346692765912, 0.09754308310502599, 0.1501379304325148, -0.022809882633267872, 0.171284970887486, -0.1519326737728871, 0.053104282657225284, 0.009638745247596694] |
1,802.00094 | Single Image Reflection Removal Using Deep Encoder-Decoder Network | Image of a scene captured through a piece of transparent and reflective
material, such as glass, is often spoiled by a superimposed layer of reflection
image. While separating the reflection from a familiar object in an image is
mentally not difficult for humans, it is a challenging, ill-posed problem in
computer vision. In this paper, we propose a novel deep convolutional
encoder-decoder method to remove the objectionable reflection by learning a map
between image pairs with and without reflection. For training the neural
network, we model the physical formation of reflections in images and
synthesize a large number of photo-realistic reflection-tainted images from
reflection-free images collected online. Extensive experimental results show
that, although the neural network learns only from synthetic data, the proposed
method is effective on real-world images, and it significantly outperforms the
other tested state-of-the-art techniques.
| cs.CV | image of a scene captured through a piece of transparent and reflective material such as glass is often spoiled by a superimposed layer of reflection image while separating the reflection from a familiar object in an image is mentally not difficult for humans it is a challenging illposed problem in computer vision in this paper we propose a novel deep convolutional encoderdecoder method to remove the objectionable reflection by learning a map between image pairs with and without reflection for training the neural network we model the physical formation of reflections in images and synthesize a large number of photorealistic reflectiontainted images from reflectionfree images collected online extensive experimental results show that although the neural network learns only from synthetic data the proposed method is effective on realworld images and it significantly outperforms the other tested stateoftheart techniques | [['image', 'of', 'a', 'scene', 'captured', 'through', 'a', 'piece', 'of', 'transparent', 'and', 'reflective', 'material', 'such', 'as', 'glass', 'is', 'often', 'spoiled', 'by', 'a', 'superimposed', 'layer', 'of', 'reflection', 'image', 'while', 'separating', 'the', 'reflection', 'from', 'a', 'familiar', 'object', 'in', 'an', 'image', 'is', 'mentally', 'not', 'difficult', 'for', 'humans', 'it', 'is', 'a', 'challenging', 'illposed', 'problem', 'in', 'computer', 'vision', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'deep', 'convolutional', 'encoderdecoder', 'method', 'to', 'remove', 'the', 'objectionable', 'reflection', 'by', 'learning', 'a', 'map', 'between', 'image', 'pairs', 'with', 'and', 'without', 'reflection', 'for', 'training', 'the', 'neural', 'network', 'we', 'model', 'the', 'physical', 'formation', 'of', 'reflections', 'in', 'images', 'and', 'synthesize', 'a', 'large', 'number', 'of', 'photorealistic', 'reflectiontainted', 'images', 'from', 'reflectionfree', 'images', 'collected', 'online', 'extensive', 'experimental', 'results', 'show', 'that', 'although', 'the', 'neural', 'network', 'learns', 'only', 'from', 'synthetic', 'data', 'the', 'proposed', 'method', 'is', 'effective', 'on', 'realworld', 'images', 'and', 'it', 'significantly', 'outperforms', 'the', 'other', 'tested', 'stateoftheart', 'techniques']] | [-0.03154034257601321, -0.0007204601351455547, -0.08944286721466231, 0.05073971389011092, -0.11990867199607357, -0.18934299266577637, -0.002745798278266877, 0.4835176284350183, -0.28221849754561473, -0.34825333652433255, 0.08203545821164429, -0.2796300522452832, -0.22889893705936243, 0.2106229934389329, -0.16546398090932818, 0.07753757191617994, 0.14666044425192107, 0.03148552554193884, -0.04800042967706321, -0.23119081006331002, 0.3203468309370393, 0.0022105300630337428, 0.33003863720835125, 0.01537547583086756, 0.1601169141643361, -0.004839818727524176, -0.02536093688274251, -0.004337358133812999, 0.0013226374648031302, 0.15508586087648207, 0.31170441835683627, 0.17179052868643843, 0.24944574298187547, -0.4538334704881167, -0.24023787510907618, 0.04705081620070077, 0.12668768860855187, 0.1227750521799869, -0.09869465424023215, -0.3698712350651078, 0.07849989635665922, -0.13466725042973557, 0.025655605633110895, -0.07958273516532823, -0.027678878185930695, -0.08278190005055704, -0.29654815456197753, 0.038314681808442136, 0.07864642387976611, 0.0897535478830487, -0.05282845198394336, -0.04170719368458066, -0.02060022534476253, 0.15932990279198236, 0.011250877596334263, 0.053281088913688913, 0.14166151103393657, -0.2416437093736128, -0.09470063190988816, 0.3950275731320581, -0.026947660752347787, -0.17469390114917197, 0.19815902756595047, -0.03996660118161218, -0.08878171297442848, 0.17846503089875473, 0.20182943191161773, 0.14252182464013352, -0.16198139998341238, 0.010432802740634031, -0.11989999353124277, 0.20153248800053158, 0.056745140609351825, -0.05286244371987499, 0.1929214431761499, 0.24830407829934825, 0.003214309970936636, 0.17411703949693902, -0.16821033133526953, 0.010870866626195174, -0.1993275338938514, -0.09499317434120134, -0.2407111661580058, -0.006012108426666002, -0.07085860662126614, -0.15166412732720266, 0.38201886261337487, 0.2470693558583675, 0.24004705890632458, 0.06409213066536144, 0.39721764363076567, 0.007152149949161622, 0.15532846249177726, 0.047520762244851265, 0.16888625300608331, 0.01345762986044848, 0.1365504551179245, -0.15220242308072038, 0.06859208185762765, 0.03551903635902453] |
1,802.00095 | A Galerkin-Collocation domain decomposition method: application to the
evolution of cylindrical gravitational waves | We present a Galerkin-Collocation domain decomposition algorithm applied to
the evolution of cylindrical unpolarized gravitational waves. We show the
effectiveness of the algorithm in reproducing initial data with high localized
gradients and in providing highly accurate dynamics. We characterize the
gravitational radiation with the standard Newman-Penrose Weyl scalar $\Psi_4$.
We generate wave templates for both polarization modes, $\times$ and $+$,
outgoing and ingoing, to show how they exchange energy nonlinearly. In
particular, considering an initially ingoing $\times$ wave, we were able to
trace a possible imprint of the gravitational analog of the Faraday effect in
the generated templates.
| gr-qc | we present a galerkincollocation domain decomposition algorithm applied to the evolution of cylindrical unpolarized gravitational waves we show the effectiveness of the algorithm in reproducing initial data with high localized gradients and in providing highly accurate dynamics we characterize the gravitational radiation with the standard newmanpenrose weyl scalar psi_4 we generate wave templates for both polarization modes times and outgoing and ingoing to show how they exchange energy nonlinearly in particular considering an initially ingoing times wave we were able to trace a possible imprint of the gravitational analog of the faraday effect in the generated templates | [['we', 'present', 'a', 'galerkincollocation', 'domain', 'decomposition', 'algorithm', 'applied', 'to', 'the', 'evolution', 'of', 'cylindrical', 'unpolarized', 'gravitational', 'waves', 'we', 'show', 'the', 'effectiveness', 'of', 'the', 'algorithm', 'in', 'reproducing', 'initial', 'data', 'with', 'high', 'localized', 'gradients', 'and', 'in', 'providing', 'highly', 'accurate', 'dynamics', 'we', 'characterize', 'the', 'gravitational', 'radiation', 'with', 'the', 'standard', 'newmanpenrose', 'weyl', 'scalar', 'psi_4', 'we', 'generate', 'wave', 'templates', 'for', 'both', 'polarization', 'modes', 'times', 'and', 'outgoing', 'and', 'ingoing', 'to', 'show', 'how', 'they', 'exchange', 'energy', 'nonlinearly', 'in', 'particular', 'considering', 'an', 'initially', 'ingoing', 'times', 'wave', 'we', 'were', 'able', 'to', 'trace', 'a', 'possible', 'imprint', 'of', 'the', 'gravitational', 'analog', 'of', 'the', 'faraday', 'effect', 'in', 'the', 'generated', 'templates']] | [-0.15057100170320764, 0.13757778384099287, -0.09473315710393884, 0.0947234838164037, -0.10054990359265165, -0.044277937050678375, -0.06110165926349378, 0.39839628033253566, -0.24150378807188616, -0.27138936817261977, 0.05574861723814428, -0.2704610759296368, -0.13000785266577275, 0.17367527996353113, 0.05369568111125341, 0.05155063461339504, 0.029696168434402915, -0.003646873187312146, -0.0658269784162445, -0.18407788459864474, 0.33119954428990783, 0.0868512289118521, 0.2636325861394559, 0.003931226763279014, 0.11302824965954192, 0.02392575665396283, -0.04935391404013121, 0.0038578316818961163, -0.09780991395464954, 0.06922853046778552, 0.20619897699924475, 0.14717881809728048, 0.17477465678275245, -0.4983118747159378, -0.1878563473673211, 0.11497997022569947, 0.138276116567251, 0.17875527581392028, -0.07737473128771544, -0.31225011816497933, 0.040435229257690074, -0.14442556907816492, -0.16667625367084576, -0.06479645689430925, 0.03137293438782397, 0.02219988688401705, -0.2807301370734253, 0.10055496020136957, 0.015414886872677766, -0.0509640461448388, -0.1100664134665402, -0.050622150445952245, -0.06792774381711311, 0.07197034229361213, 0.06449424911808875, 0.031682481826043, 0.13649782151573087, -0.09623391687877227, -0.08724143516545943, 0.35325086793439825, -0.1410166001446622, -0.24292932894829775, 0.16805670501606673, -0.1910471068023099, -0.04719272727319568, 0.1344462939989321, 0.21010602668849462, 0.14070590879268868, -0.10700582180198609, 0.05115890163344994, 0.04038903126811138, 0.14901434793377044, 0.14469407673579515, 0.04511444860608461, 0.2577555087519829, 0.09431058853701449, 0.011526709000013539, 0.16975798265835673, -0.11958579117007381, -0.014810991392485299, -0.31244119910100837, -0.13664828510291888, -0.16859853017076695, 0.05147498440970763, -0.08890655902697411, -0.1684548080197929, 0.4215658568709935, 0.17422674134248847, 0.15264809222354256, 0.025120925157062095, 0.3208513677350639, 0.11477924210677096, 0.03145619722793704, 0.12708121225821123, 0.2863085860789744, 0.13660631836007936, 0.11412191646384824, -0.2513936035066229, -0.024111335300216356, 0.019398384055449178] |
1,802.00096 | On the accuracy of retinal protonated Schiff base models | We investigate the molecular geometries of the ground state and the minimal
energy conical intersections (MECIs) between the ground and first excited
states of the models for the retinal protonated Schiff base in the gas phase
using the extended multistate complete active space second-order perturbation
theory (XMS-CASPT2). The biggest model in this work is the rhodopsin
chromophore truncated between the {\epsilon} and {\delta} carbon atoms, which
consists of 54 atoms and 12-orbital {\pi} conjugation. The results are compared
with those obtained by the state-averaged complete active space self-consistent
field (SA-CASSCF). The XMS-CASPT2 results suggest that the minimum energy
conical intersection associated with the so-called 13-14 isomerization is
thermally inaccessible, which is in contrast to the SA-CASSCF results. The
differences between the geometries of the conical intersections computed by
SA-CASSCF and XMS-CASPT2 are ascribed to the fact that the charge transfer
states are more stabilized by dynamical electron correlation than the
diradicaloid states. The impact of the various choices of active spaces, basis
sets, and state averaging schemes is also examined.
| physics.chem-ph | we investigate the molecular geometries of the ground state and the minimal energy conical intersections mecis between the ground and first excited states of the models for the retinal protonated schiff base in the gas phase using the extended multistate complete active space secondorder perturbation theory xmscaspt2 the biggest model in this work is the rhodopsin chromophore truncated between the epsilon and delta carbon atoms which consists of 54 atoms and 12orbital pi conjugation the results are compared with those obtained by the stateaveraged complete active space selfconsistent field sacasscf the xmscaspt2 results suggest that the minimum energy conical intersection associated with the socalled 1314 isomerization is thermally inaccessible which is in contrast to the sacasscf results the differences between the geometries of the conical intersections computed by sacasscf and xmscaspt2 are ascribed to the fact that the charge transfer states are more stabilized by dynamical electron correlation than the diradicaloid states the impact of the various choices of active spaces basis sets and state averaging schemes is also examined | [['we', 'investigate', 'the', 'molecular', 'geometries', 'of', 'the', 'ground', 'state', 'and', 'the', 'minimal', 'energy', 'conical', 'intersections', 'mecis', 'between', 'the', 'ground', 'and', 'first', 'excited', 'states', 'of', 'the', 'models', 'for', 'the', 'retinal', 'protonated', 'schiff', 'base', 'in', 'the', 'gas', 'phase', 'using', 'the', 'extended', 'multistate', 'complete', 'active', 'space', 'secondorder', 'perturbation', 'theory', 'xmscaspt2', 'the', 'biggest', 'model', 'in', 'this', 'work', 'is', 'the', 'rhodopsin', 'chromophore', 'truncated', 'between', 'the', 'epsilon', 'and', 'delta', 'carbon', 'atoms', 'which', 'consists', 'of', '54', 'atoms', 'and', '12orbital', 'pi', 'conjugation', 'the', 'results', 'are', 'compared', 'with', 'those', 'obtained', 'by', 'the', 'stateaveraged', 'complete', 'active', 'space', 'selfconsistent', 'field', 'sacasscf', 'the', 'xmscaspt2', 'results', 'suggest', 'that', 'the', 'minimum', 'energy', 'conical', 'intersection', 'associated', 'with', 'the', 'socalled', '1314', 'isomerization', 'is', 'thermally', 'inaccessible', 'which', 'is', 'in', 'contrast', 'to', 'the', 'sacasscf', 'results', 'the', 'differences', 'between', 'the', 'geometries', 'of', 'the', 'conical', 'intersections', 'computed', 'by', 'sacasscf', 'and', 'xmscaspt2', 'are', 'ascribed', 'to', 'the', 'fact', 'that', 'the', 'charge', 'transfer', 'states', 'are', 'more', 'stabilized', 'by', 'dynamical', 'electron', 'correlation', 'than', 'the', 'diradicaloid', 'states', 'the', 'impact', 'of', 'the', 'various', 'choices', 'of', 'active', 'spaces', 'basis', 'sets', 'and', 'state', 'averaging', 'schemes', 'is', 'also', 'examined']] | [-0.1253888090816742, 0.15854320615402512, -0.029522425373129192, 0.08708094534882721, 0.04501616726836454, -0.08207707500453883, 0.045814825150522494, 0.3460209943212768, -0.22255158260564453, -0.2661139355013369, 0.05746823963584445, -0.2944814143369773, -0.10679977718141995, 0.13053603569971442, 0.0017416751721785182, 0.009655776217446796, 0.034032019219012, 0.004832622024141962, -0.0743428909197627, -0.17400977454616667, 0.33688193743416506, 0.047874420267319126, 0.2700938011264606, 0.04503730314449751, 0.0568674376277375, -0.007924497928581246, 0.02063143911211574, 0.015700670039049805, -0.13285291799487217, 0.1543338300990789, 0.22866651056004966, 0.032498037276257365, 0.21303624860731707, -0.4421214067898247, -0.21149126270652882, 0.08876013727526047, 0.10233922239387452, 0.11859173626345139, -0.008188346361099061, -0.29801642557694796, 0.037950498745929165, -0.14755732775735114, -0.14562811313330062, -0.06431954980888847, 0.005059667521328222, 0.03761517266303556, -0.23456323733885906, 0.07093856295060028, 0.025562265473993085, 0.050109052717397434, -0.10520012128177941, -0.11982398714670646, -0.10508036063055486, 0.09639799083344683, 0.005256310043651389, 0.046050416943173675, 0.14327477773241254, -0.09744909580192707, -0.11539029058899143, 0.3665964707976118, -0.04953388564735221, -0.16380984148210181, 0.17552245088431628, -0.14364496219648226, -0.06461751518682354, 0.1817116561828048, 0.08168889132572249, 0.15624424627527506, -0.09597130195747706, 0.07199627454073856, -0.03564854524336711, 0.14333457810599134, 0.06577816478896975, 0.03384973652455734, 0.1699654622352682, 0.1262148622214833, 0.0417795756310668, 0.13364801897772677, -0.11464383137735283, -0.1540335086434165, -0.2837241615800719, -0.14219178001249452, -0.17426961571687744, 0.020670462843208087, -0.06169037424652266, -0.12056340306853167, 0.3821769986756235, 0.05963510640209452, 0.18557128739277168, -0.025533152368596, 0.2647380281511384, 0.0741466205495055, 0.031311835328649194, 0.0695071384945463, 0.25985397597902365, 0.1602196729883352, 0.03397790661879948, -0.28058006199231994, 0.03793165369036918, 0.06955561890000743] |
1,802.00097 | Holographic approach for dark energy - dark matter interaction in curved
FLRW spacetime | In this work we explore under a holographic approach the dark energy - dark
matter interaction in a non-flat Friedmann-Lemaitre-Robertson-Walker spacetime,
with a cut-off for the dark energy component given in terms of the Hubble
scale. Based on results coming from the use of observational data, we consider
a positive interaction $Q$-term together with a Chevallier-Polarsky-Linder type
parametrization for the coincidence parameter, we realize that the model admits
a Type III future singularity, in this singular universe we have that for a
null value of the curvature parameter its scale factor is a constant value.
With the use of some cosmological parameters constrained with observational
data, we obtain that the crossing of the phantom divide is possible. Once the
singular nature is obtained for the model, its Statefinder diagnosis reveals a
behavior that is {\it far} from the $\Lambda$-CDM model.
| gr-qc hep-th | in this work we explore under a holographic approach the dark energy dark matter interaction in a nonflat friedmannlemaitrerobertsonwalker spacetime with a cutoff for the dark energy component given in terms of the hubble scale based on results coming from the use of observational data we consider a positive interaction qterm together with a chevallierpolarskylinder type parametrization for the coincidence parameter we realize that the model admits a type iii future singularity in this singular universe we have that for a null value of the curvature parameter its scale factor is a constant value with the use of some cosmological parameters constrained with observational data we obtain that the crossing of the phantom divide is possible once the singular nature is obtained for the model its statefinder diagnosis reveals a behavior that is it far from the lambdacdm model | [['in', 'this', 'work', 'we', 'explore', 'under', 'a', 'holographic', 'approach', 'the', 'dark', 'energy', 'dark', 'matter', 'interaction', 'in', 'a', 'nonflat', 'friedmannlemaitrerobertsonwalker', 'spacetime', 'with', 'a', 'cutoff', 'for', 'the', 'dark', 'energy', 'component', 'given', 'in', 'terms', 'of', 'the', 'hubble', 'scale', 'based', 'on', 'results', 'coming', 'from', 'the', 'use', 'of', 'observational', 'data', 'we', 'consider', 'a', 'positive', 'interaction', 'qterm', 'together', 'with', 'a', 'chevallierpolarskylinder', 'type', 'parametrization', 'for', 'the', 'coincidence', 'parameter', 'we', 'realize', 'that', 'the', 'model', 'admits', 'a', 'type', 'iii', 'future', 'singularity', 'in', 'this', 'singular', 'universe', 'we', 'have', 'that', 'for', 'a', 'null', 'value', 'of', 'the', 'curvature', 'parameter', 'its', 'scale', 'factor', 'is', 'a', 'constant', 'value', 'with', 'the', 'use', 'of', 'some', 'cosmological', 'parameters', 'constrained', 'with', 'observational', 'data', 'we', 'obtain', 'that', 'the', 'crossing', 'of', 'the', 'phantom', 'divide', 'is', 'possible', 'once', 'the', 'singular', 'nature', 'is', 'obtained', 'for', 'the', 'model', 'its', 'statefinder', 'diagnosis', 'reveals', 'a', 'behavior', 'that', 'is', 'it', 'far', 'from', 'the', 'lambdacdm', 'model']] | [-0.12927744321633075, 0.06813194741920123, -0.13860881218578722, 0.0890793160761477, -0.13448126942081295, -0.1440918676359444, -0.0018496905939410562, 0.31658390518007934, -0.2206487590548299, -0.2819755031234598, 0.08156414483032742, -0.2636182270809144, -0.08357945784750948, 0.17179415960276526, 0.001646879439552625, -0.003359135764185339, 0.04912550335048117, 0.07253916117538145, -0.059760207982237815, -0.225396931254089, 0.4033768616171311, 0.0688513551848819, 0.221842101441892, 0.023857059149135686, 0.11564867057419126, -0.05053669521652594, -0.007981208514125235, 0.04570916823866065, -0.22930522882328977, 0.07663980540414543, 0.19555116956800464, 0.14212668532222186, 0.24222818606674834, -0.3721925984069273, -0.2647686108298924, 0.17339802385591294, 0.11295162827414258, 0.11779040253748173, -0.07026362161580609, -0.26233660324436164, 0.050531681879690135, -0.16712140263922082, -0.15611391252689605, -0.020519168102654858, -0.015212849184087869, -0.04397211522302604, -0.2556577740385588, 0.13635731211768976, -0.03117624116872532, -0.022813500920850514, -0.11766112216012688, -0.05399725296318639, 0.01357316935731881, 0.03091220929881261, 0.08834785856627117, 0.020238189025869782, 0.09074994961839115, -0.18344405868117683, -0.05901884806656238, 0.3939513185945596, -0.11503493918639109, -0.191136048453779, 0.1162906065667588, -0.11213067254267525, -0.1439030371248668, 0.08313985763664317, 0.10465391169207683, 0.07165605140229066, -0.10340884373104875, 0.17976366474792577, -0.022129301268580384, 0.1640137061274246, 0.040937034028541784, -0.016896166378949376, 0.24355654534208926, 0.19109705847812872, 0.05371497054348119, 0.09940020977755658, -0.1179775739395721, -0.07407062357347256, -0.3823980974114459, -0.1607050351947006, -0.1755835052066739, 0.06780010420640094, -0.1568785714275757, -0.17323032951495354, 0.4082393932486952, 0.14345934139134403, 0.25659521689058107, 0.07565292139011233, 0.29031202282783564, 0.08930717524819319, 0.04514142644652368, 0.050922533777285964, 0.3106742402232012, 0.05759036076336127, 0.10492521689772821, -0.2066523232800967, 0.007813073779064893, 0.022960981851835073] |
1,802.00098 | Scalar fields as sources for wormholes and regular black holes | We review nonsingular static, spherically symmetric solutions of general
relativity with a minimally coupled scalar field $\phi$ as a source. Considered
are wormholes and regular black holes without a center, including black
universes (black holes with an expanding cosmology beyond the horizon). Such
configurations require a "ghost" field with negative kinetic energy, but it may
be negative in a restricted (strong-field) region of space and positive outside
it ("trapped ghost") thus explaining why no ghosts are observed under usual
conditions. Another possible explanation of the same may be a rapid decay of a
ghost field at large radii. Before discussing particular examples, some general
results are presented, such as the necessity of anisotropic matter for
obtaining asymptotically flat or anti-de Sitter wormholes, no-hair and global
structure theorems for black holes with scalar fields. The stability properties
of scalar wormholes and regular black holes are discussed for perturbations
preserving spherical symmetry. It is stressed that the effective potential
$V_{eff}$ for perturbations has universal shapes near generic wormhole throats
(a positive pole regularizable by a Darboux transformation) and near transition
surfaces from canonical to ghost behavior of the scalar field (a negative pole
at which the perturbation finiteness requirement plays a stabilizing role). It
is also found that positive poles of $V_{eff}$ emerging at "long throats" (with
the spherical radius $r \approx r_0 + {\rm const} \cdot x^{2n}$, $n > 1$, if
$x=0$ is the throat) may be regularized by repeated Darboux transformations for
some values of $n$.
| gr-qc hep-th | we review nonsingular static spherically symmetric solutions of general relativity with a minimally coupled scalar field phi as a source considered are wormholes and regular black holes without a center including black universes black holes with an expanding cosmology beyond the horizon such configurations require a ghost field with negative kinetic energy but it may be negative in a restricted strongfield region of space and positive outside it trapped ghost thus explaining why no ghosts are observed under usual conditions another possible explanation of the same may be a rapid decay of a ghost field at large radii before discussing particular examples some general results are presented such as the necessity of anisotropic matter for obtaining asymptotically flat or antide sitter wormholes nohair and global structure theorems for black holes with scalar fields the stability properties of scalar wormholes and regular black holes are discussed for perturbations preserving spherical symmetry it is stressed that the effective potential v_eff for perturbations has universal shapes near generic wormhole throats a positive pole regularizable by a darboux transformation and near transition surfaces from canonical to ghost behavior of the scalar field a negative pole at which the perturbation finiteness requirement plays a stabilizing role it is also found that positive poles of v_eff emerging at long throats with the spherical radius r approx r_0 rm const cdot x2n n 1 if x0 is the throat may be regularized by repeated darboux transformations for some values of n | [['we', 'review', 'nonsingular', 'static', 'spherically', 'symmetric', 'solutions', 'of', 'general', 'relativity', 'with', 'a', 'minimally', 'coupled', 'scalar', 'field', 'phi', 'as', 'a', 'source', 'considered', 'are', 'wormholes', 'and', 'regular', 'black', 'holes', 'without', 'a', 'center', 'including', 'black', 'universes', 'black', 'holes', 'with', 'an', 'expanding', 'cosmology', 'beyond', 'the', 'horizon', 'such', 'configurations', 'require', 'a', 'ghost', 'field', 'with', 'negative', 'kinetic', 'energy', 'but', 'it', 'may', 'be', 'negative', 'in', 'a', 'restricted', 'strongfield', 'region', 'of', 'space', 'and', 'positive', 'outside', 'it', 'trapped', 'ghost', 'thus', 'explaining', 'why', 'no', 'ghosts', 'are', 'observed', 'under', 'usual', 'conditions', 'another', 'possible', 'explanation', 'of', 'the', 'same', 'may', 'be', 'a', 'rapid', 'decay', 'of', 'a', 'ghost', 'field', 'at', 'large', 'radii', 'before', 'discussing', 'particular', 'examples', 'some', 'general', 'results', 'are', 'presented', 'such', 'as', 'the', 'necessity', 'of', 'anisotropic', 'matter', 'for', 'obtaining', 'asymptotically', 'flat', 'or', 'antide', 'sitter', 'wormholes', 'nohair', 'and', 'global', 'structure', 'theorems', 'for', 'black', 'holes', 'with', 'scalar', 'fields', 'the', 'stability', 'properties', 'of', 'scalar', 'wormholes', 'and', 'regular', 'black', 'holes', 'are', 'discussed', 'for', 'perturbations', 'preserving', 'spherical', 'symmetry', 'it', 'is', 'stressed', 'that', 'the', 'effective', 'potential', 'v_eff', 'for', 'perturbations', 'has', 'universal', 'shapes', 'near', 'generic', 'wormhole', 'throats', 'a', 'positive', 'pole', 'regularizable', 'by', 'a', 'darboux', 'transformation', 'and', 'near', 'transition', 'surfaces', 'from', 'canonical', 'to', 'ghost', 'behavior', 'of', 'the', 'scalar', 'field', 'a', 'negative', 'pole', 'at', 'which', 'the', 'perturbation', 'finiteness', 'requirement', 'plays', 'a', 'stabilizing', 'role', 'it', 'is', 'also', 'found', 'that', 'positive', 'poles', 'of', 'v_eff', 'emerging', 'at', 'long', 'throats', 'with', 'the', 'spherical', 'radius', 'r', 'approx', 'r_0', 'rm', 'const', 'cdot', 'x2n', 'n', '1', 'if', 'x0', 'is', 'the', 'throat', 'may', 'be', 'regularized', 'by', 'repeated', 'darboux', 'transformations', 'for', 'some', 'values', 'of', 'n']] | [-0.1793688193725071, 0.1662595938346907, -0.08286820012278336, 0.15248382331366406, -0.10391648777390326, -0.20313247834851386, -0.052817789952224886, 0.3152375319861944, -0.1685667591501129, -0.2516094625361653, 0.11500810189720707, -0.28316922586403603, -0.1131767057212543, 0.14486759629379195, -0.016995343038183446, 0.016726446877671195, -0.010631616620469044, 0.06668465615051691, -0.09411298378573953, -0.2155727961088233, 0.3750476485297664, 0.07705449393938953, 0.20382755387146942, 0.01687434740955216, 0.07998118431738685, -0.011578272143569698, 0.050218976982086744, 0.06979641740171708, -0.16450689143335903, 0.003424224502418465, 0.20738186069502262, 0.11249144577810571, 0.22960173326151323, -0.39929932395958145, -0.23004349510194486, 0.14163835751194293, 0.16674987744295694, 0.13543996599734975, -0.12923198455723278, -0.2765336885311656, 0.10275387199738466, -0.14545049113564987, -0.2387823313550993, -0.07976346796370859, 0.07615375067164633, -0.04315884417346602, -0.24964296135628694, 0.10866189780568436, 0.054770839880087, -0.011691825773536425, -0.1007961864739687, -0.08333024875781896, -0.04990729568793331, 0.054868409351911396, 0.12703153570769468, 0.03926543696481948, 0.17382012262461385, -0.13830153940848577, -0.052876349065269605, 0.3527525524746199, -0.06595057343728229, -0.21423780686244917, 0.12693308665012543, -0.18958439207903002, -0.09533796129084085, 0.14360096144344903, 0.08613597762725148, 0.17849985046024036, -0.10958241970401418, 0.18895106535440942, 0.0004502924294668998, 0.13369365187421953, 0.18315724735424976, 0.04002024229428899, 0.35975979931283264, 0.059316624246049124, 0.052267142117536844, 0.10696436235915915, -0.0005348551730705487, -0.10702500511919813, -0.3924359359442577, -0.12872090914332476, -0.12250558182322344, 0.09911959325574095, -0.17298509178082716, -0.2188850448630964, 0.3064908377814763, 0.01759855702975536, 0.1557838325846757, 0.025913899483399647, 0.2247044183628144, 0.053245552564536024, 0.06838391414942739, 0.11165873032849526, 0.2937669863165299, 0.13409150424451552, 0.1170918594236623, -0.1923803594996332, -0.08214450325744349, 0.05890083987910881] |
1,802.00099 | Nonequilibrium Excitations and Transport of Dirac Electrons in
Electric-Field-Driven Graphene | We investigate nonequilibrium excitations and charge transport in
charge-neutral graphene driven with DC electric field by using the
nonequilibrium Green's function technique. Due to the vanishing Fermi surface,
electrons are subject to non-trivial nonequilibrium excitations such as highly
anisotropic momentum distribution of electron-hole pairs, an analog of the
Schwinger effect. We show that the electron-hole excitations, initiated by the
Landau-Zener tunneling with a superlinear IV relation $I \propto E^{3/2}$,
reaches a steady-state dominated by the dissipation due to optical phonons,
resulting in a marginally sublinear IV with $I \propto E$, in agreement with
recent experiments. The linear IV starts to show the sign of current saturation
as the graphene is doped away from the Dirac point, and recovers the
semi-classical relation for the saturated velocity. We give a detailed
discussion on the nonequilibrium charge creation and the relation between the
electron-phonon scattering rate and the electric field in the steady-state
limit. We explain how the apparent Ohmic IV is recovered near the Dirac point.
We propose a mechanism where the peculiar nonequilibrium electron-hole creation
can be utilized in a novel infra-red device.
| cond-mat.mes-hall | we investigate nonequilibrium excitations and charge transport in chargeneutral graphene driven with dc electric field by using the nonequilibrium greens function technique due to the vanishing fermi surface electrons are subject to nontrivial nonequilibrium excitations such as highly anisotropic momentum distribution of electronhole pairs an analog of the schwinger effect we show that the electronhole excitations initiated by the landauzener tunneling with a superlinear iv relation i propto e32 reaches a steadystate dominated by the dissipation due to optical phonons resulting in a marginally sublinear iv with i propto e in agreement with recent experiments the linear iv starts to show the sign of current saturation as the graphene is doped away from the dirac point and recovers the semiclassical relation for the saturated velocity we give a detailed discussion on the nonequilibrium charge creation and the relation between the electronphonon scattering rate and the electric field in the steadystate limit we explain how the apparent ohmic iv is recovered near the dirac point we propose a mechanism where the peculiar nonequilibrium electronhole creation can be utilized in a novel infrared device | [['we', 'investigate', 'nonequilibrium', 'excitations', 'and', 'charge', 'transport', 'in', 'chargeneutral', 'graphene', 'driven', 'with', 'dc', 'electric', 'field', 'by', 'using', 'the', 'nonequilibrium', 'greens', 'function', 'technique', 'due', 'to', 'the', 'vanishing', 'fermi', 'surface', 'electrons', 'are', 'subject', 'to', 'nontrivial', 'nonequilibrium', 'excitations', 'such', 'as', 'highly', 'anisotropic', 'momentum', 'distribution', 'of', 'electronhole', 'pairs', 'an', 'analog', 'of', 'the', 'schwinger', 'effect', 'we', 'show', 'that', 'the', 'electronhole', 'excitations', 'initiated', 'by', 'the', 'landauzener', 'tunneling', 'with', 'a', 'superlinear', 'iv', 'relation', 'i', 'propto', 'e32', 'reaches', 'a', 'steadystate', 'dominated', 'by', 'the', 'dissipation', 'due', 'to', 'optical', 'phonons', 'resulting', 'in', 'a', 'marginally', 'sublinear', 'iv', 'with', 'i', 'propto', 'e', 'in', 'agreement', 'with', 'recent', 'experiments', 'the', 'linear', 'iv', 'starts', 'to', 'show', 'the', 'sign', 'of', 'current', 'saturation', 'as', 'the', 'graphene', 'is', 'doped', 'away', 'from', 'the', 'dirac', 'point', 'and', 'recovers', 'the', 'semiclassical', 'relation', 'for', 'the', 'saturated', 'velocity', 'we', 'give', 'a', 'detailed', 'discussion', 'on', 'the', 'nonequilibrium', 'charge', 'creation', 'and', 'the', 'relation', 'between', 'the', 'electronphonon', 'scattering', 'rate', 'and', 'the', 'electric', 'field', 'in', 'the', 'steadystate', 'limit', 'we', 'explain', 'how', 'the', 'apparent', 'ohmic', 'iv', 'is', 'recovered', 'near', 'the', 'dirac', 'point', 'we', 'propose', 'a', 'mechanism', 'where', 'the', 'peculiar', 'nonequilibrium', 'electronhole', 'creation', 'can', 'be', 'utilized', 'in', 'a', 'novel', 'infrared', 'device']] | [-0.14824651647614992, 0.1844678404044576, -0.06328715662283894, 0.04634847899944941, -0.025585079380147323, -0.14352034364960023, 0.08019850988984926, 0.3367611987626303, -0.2572301722049795, -0.23717797664761708, -0.050447052163660404, -0.3185282135586981, -0.13028021437208076, 0.1860562106274621, 0.002082008369533079, 0.013427305590504637, -0.01578249220587927, -0.04013126512354875, -0.06630985985719855, -0.15487320731895474, 0.30709475297276134, 0.04236272830070907, 0.3256316120905167, 0.1135970252581391, 0.04797428651651429, 0.03128954413561867, 0.037685024550767963, 0.0431612220306236, -0.15053015361319502, 0.022083077464600677, 0.21613576274830848, -0.052767811462047745, 0.21701406842483986, -0.45695475081063724, -0.17986483471855075, 0.02957932103251281, 0.161059529798177, 0.15252458806415753, -0.08844481669379152, -0.2569954677044854, 0.013423720647192017, -0.16050084658315059, -0.1445764593759572, -0.05258822810176023, 0.022718908053510668, 0.03431094108805405, -0.24859910078249503, 0.15589392936153973, 0.0660353604456919, 0.019591635151940224, -0.06724014454316553, -0.05240264025281419, -0.08254770609130571, 0.03152349987834856, 0.04505857561489792, 0.049310036414881124, 0.19325634318270854, -0.16649222503426475, -0.08496720129675181, 0.3533292405696197, -0.11527231260417746, -0.12598146141025718, 0.17027117798340272, -0.18747546609265955, -0.03131675773305348, 0.14704614515917805, 0.09542141319476426, 0.09050383783651741, -0.16544790271219317, 0.10557470761321402, -0.009885201508091036, 0.10499023006119827, 0.03264292256758231, 0.06282841840948095, 0.2779605384342946, 0.1494123503900962, 0.028475441355872284, 0.13689598624765933, -0.12869624326429022, -0.07046177831048575, -0.30550802864420873, -0.1498876594129827, -0.22014429081253103, 0.14343455776055394, -0.029267128633404315, -0.17168344963063867, 0.4104071706635775, 0.1468231912691448, 0.21260545140510978, -0.01038312308674494, 0.2526060697919392, 0.23212317510502883, 0.03274893610748452, 0.09886773402935692, 0.25824270929353166, 0.15752550826541015, 0.12764248070511763, -0.3566345871658996, 0.01278004214579526, 0.04423253091146842] |
1,802.001 | Search for Gamma-Ray Emission from Local Primordial Black Holes with the
Fermi Large Area Telescope | Black holes with masses below approximately $10^{15}$ g are expected to emit
gamma rays with energies above a few tens of MeV, which can be detected by the
Fermi Large Area Telescope (LAT). Although black holes with these masses cannot
be formed as a result of stellar evolution, they may have formed in the early
Universe and are therefore called Primordial Black Holes (PBHs). Previous
searches for PBHs have focused on either short timescale bursts or the
contribution of PBHs to the isotropic gamma-ray emission. We show that, in case
of individual PBHs, the Fermi LAT is most sensitive to PBHs with temperatures
above approximately 16 GeV and masses $6\times 10^{11}$ g, which it can detect
out to a distance of about 0.03 pc. These PBHs have a remaining lifetime of
months to years at the start of the Fermi mission. They would appear as
potentially moving point sources with gamma-ray emission that becomes
spectrally harder and brighter with time until the PBH completely evaporates.
In this paper, we develop a new algorithm to detect the proper motion of a
gamma-ray point sources, and apply it to 318 unassociated point sources at high
galactic latitude in the third Fermi-LAT source catalog (3FGL). None of
unassociated point sources with spectra consistent with PBH evaporation show
significant proper motion. Using the non-detection of PBH candidates, we derive
a 99\% confidence limit on PBH evaporation rate in the vicinity of the Earth
$\dot{\rho}_{\rm PBH} < 7.2 \times 10^3\: {\rm {pc}^{-3} {yr}^{-1}}$. This
limit is similar to the limits obtained with ground-based gamma-ray
observatories.
| astro-ph.HE hep-ex | black holes with masses below approximately 1015 g are expected to emit gamma rays with energies above a few tens of mev which can be detected by the fermi large area telescope lat although black holes with these masses cannot be formed as a result of stellar evolution they may have formed in the early universe and are therefore called primordial black holes pbhs previous searches for pbhs have focused on either short timescale bursts or the contribution of pbhs to the isotropic gammaray emission we show that in case of individual pbhs the fermi lat is most sensitive to pbhs with temperatures above approximately 16 gev and masses 6times 1011 g which it can detect out to a distance of about 003 pc these pbhs have a remaining lifetime of months to years at the start of the fermi mission they would appear as potentially moving point sources with gammaray emission that becomes spectrally harder and brighter with time until the pbh completely evaporates in this paper we develop a new algorithm to detect the proper motion of a gammaray point sources and apply it to 318 unassociated point sources at high galactic latitude in the third fermilat source catalog 3fgl none of unassociated point sources with spectra consistent with pbh evaporation show significant proper motion using the nondetection of pbh candidates we derive a 99 confidence limit on pbh evaporation rate in the vicinity of the earth dotrho_rm pbh 72 times 103 rm pc3 yr1 this limit is similar to the limits obtained with groundbased gammaray observatories | [['black', 'holes', 'with', 'masses', 'below', 'approximately', '1015', 'g', 'are', 'expected', 'to', 'emit', 'gamma', 'rays', 'with', 'energies', 'above', 'a', 'few', 'tens', 'of', 'mev', 'which', 'can', 'be', 'detected', 'by', 'the', 'fermi', 'large', 'area', 'telescope', 'lat', 'although', 'black', 'holes', 'with', 'these', 'masses', 'can', 'not', 'be', 'formed', 'as', 'a', 'result', 'of', 'stellar', 'evolution', 'they', 'may', 'have', 'formed', 'in', 'the', 'early', 'universe', 'and', 'are', 'therefore', 'called', 'primordial', 'black', 'holes', 'pbhs', 'previous', 'searches', 'for', 'pbhs', 'have', 'focused', 'on', 'either', 'short', 'timescale', 'bursts', 'or', 'the', 'contribution', 'of', 'pbhs', 'to', 'the', 'isotropic', 'gammaray', 'emission', 'we', 'show', 'that', 'in', 'case', 'of', 'individual', 'pbhs', 'the', 'fermi', 'lat', 'is', 'most', 'sensitive', 'to', 'pbhs', 'with', 'temperatures', 'above', 'approximately', '16', 'gev', 'and', 'masses', '6times', '1011', 'g', 'which', 'it', 'can', 'detect', 'out', 'to', 'a', 'distance', 'of', 'about', '003', 'pc', 'these', 'pbhs', 'have', 'a', 'remaining', 'lifetime', 'of', 'months', 'to', 'years', 'at', 'the', 'start', 'of', 'the', 'fermi', 'mission', 'they', 'would', 'appear', 'as', 'potentially', 'moving', 'point', 'sources', 'with', 'gammaray', 'emission', 'that', 'becomes', 'spectrally', 'harder', 'and', 'brighter', 'with', 'time', 'until', 'the', 'pbh', 'completely', 'evaporates', 'in', 'this', 'paper', 'we', 'develop', 'a', 'new', 'algorithm', 'to', 'detect', 'the', 'proper', 'motion', 'of', 'a', 'gammaray', 'point', 'sources', 'and', 'apply', 'it', 'to', '318', 'unassociated', 'point', 'sources', 'at', 'high', 'galactic', 'latitude', 'in', 'the', 'third', 'fermilat', 'source', 'catalog', '3fgl', 'none', 'of', 'unassociated', 'point', 'sources', 'with', 'spectra', 'consistent', 'with', 'pbh', 'evaporation', 'show', 'significant', 'proper', 'motion', 'using', 'the', 'nondetection', 'of', 'pbh', 'candidates', 'we', 'derive', 'a', '99', 'confidence', 'limit', 'on', 'pbh', 'evaporation', 'rate', 'in', 'the', 'vicinity', 'of', 'the', 'earth', 'dotrho_rm', 'pbh', '72', 'times', '103', 'rm', 'pc3', 'yr1', 'this', 'limit', 'is', 'similar', 'to', 'the', 'limits', 'obtained', 'with', 'groundbased', 'gammaray', 'observatories']] | [-0.09827521282512372, 0.21691452521794977, -0.030464991067464534, 0.15457827825672352, -0.08742367246405383, -0.06813544249341179, 0.0884193068870585, 0.3967442918031548, -0.136752573359095, -0.405278311127152, 0.05589562428515189, -0.3635903590036413, 0.039230966905597596, 0.24761541749556693, -0.025812408419397588, -0.02229264936221835, 0.07603050806523802, -0.012261337049242755, -0.04046660982555925, -0.27958992362613433, 0.26229135010015364, 0.15126807439284257, 0.13860391965135932, 0.014855317975161597, 0.05755268393370968, -0.115881598876037, -0.011262751177239877, -0.05164896933935009, -0.12235139091348034, 0.03512225613857691, 0.26738680240680246, 0.11089732268144592, 0.17968303914396808, -0.3563808078537337, -0.23938893992632915, 0.1462427831747426, 0.15822322647839498, 0.03564851675898983, -0.0555771187100058, -0.32238389138186063, 0.09769888860710825, -0.21521482941909478, -0.16292607528694833, 0.055192432249448475, 0.06929645165442848, 0.009348756739368233, -0.15146109926550147, 0.1350968257452433, 0.015131736119152405, -0.054081757397104344, -0.1071206631080713, -0.08148992103882707, -0.03653304099347084, 0.013308786623215732, 0.09502336490505303, 0.07692296931054443, 0.21136357982714588, -0.06668595161351662, -0.07202427487892027, 0.4028295094236875, -0.08338730454695625, -0.0032123204714690264, 0.16845985274278344, -0.24630842476304118, -0.21822998417326464, 0.22635679489288194, 0.17588195109095137, 0.15204106900223102, -0.18788125255109311, 0.026631773246201473, 0.0215333361339827, 0.23707085257584157, 0.11384364835416469, 0.06628467934027027, 0.39776374257098024, 0.12097861492925753, 0.07607421198000129, 0.060169184568803755, -0.23701214294594067, 0.010466564330720128, -0.2709048299924829, -0.05377452273723275, -0.1635001451994937, 0.1684980495125973, -0.10231902201171929, -0.1249895469760164, 0.32529317408513564, 0.13269709734729707, 0.21644109105333112, 0.05667897166075328, 0.2488631850488953, 0.09156534625508357, 0.07764596305250261, 0.13772871101973577, 0.36708230101861633, 0.08458063221679857, 0.06154427113763702, -0.10636775945761026, 0.0054529709578044, -0.007130394733618372] |
1,802.00101 | Wavelength-dependent reflectivity changes on gold at elevated electronic
temperatures | Upon the excitation by an ultrashort laser pulse the conditions in a material
can drastically change, altering its optical properties and therefore the
relative amount of absorbed energy, a quan- tity relevant for determining the
damage threshold and for developing a detailed simulation of a structuring
process. The subject of interest in this work is the d-band metal gold which
has an absorption edge marking the transition of free valence electrons and an
absorbing deep d-band with bound electrons. Reflectivity changes are observed
in experiment over a broad spectral range at ablation conditions. To understand
the involved processes the laser excitation is modeled by a com- bination of
first principle calculations with a two-temperature model. The description is
kept most general and applied to realistically simulate the transfer of the
absorbed energy of a Gaussian laser pulse into the electronic system at every
point in space at every instance of time. An electronic temperature-dependent
reflectivity map is calculated, describing the out of equilibrium reflectivity
during laser excitation for photon energies from 0.9 - 6.4 eV, including inter-
and intra-band transi- tions and a temperature-dependent damping factor. The
main mechanisms are identified explaining the electronic temperature-dependent
change in reflectivity: broadening of the edge of the occu- pied/unoccupied
states around the chemical potential $\mu$, also leading to a shift of the
$\mu$ and an increase of the collision rate of free s/p-band electrons with
bound d-band holes.
| cond-mat.mtrl-sci | upon the excitation by an ultrashort laser pulse the conditions in a material can drastically change altering its optical properties and therefore the relative amount of absorbed energy a quan tity relevant for determining the damage threshold and for developing a detailed simulation of a structuring process the subject of interest in this work is the dband metal gold which has an absorption edge marking the transition of free valence electrons and an absorbing deep dband with bound electrons reflectivity changes are observed in experiment over a broad spectral range at ablation conditions to understand the involved processes the laser excitation is modeled by a com bination of first principle calculations with a twotemperature model the description is kept most general and applied to realistically simulate the transfer of the absorbed energy of a gaussian laser pulse into the electronic system at every point in space at every instance of time an electronic temperaturedependent reflectivity map is calculated describing the out of equilibrium reflectivity during laser excitation for photon energies from 09 64 ev including inter and intraband transi tions and a temperaturedependent damping factor the main mechanisms are identified explaining the electronic temperaturedependent change in reflectivity broadening of the edge of the occu piedunoccupied states around the chemical potential mu also leading to a shift of the mu and an increase of the collision rate of free spband electrons with bound dband holes | [['upon', 'the', 'excitation', 'by', 'an', 'ultrashort', 'laser', 'pulse', 'the', 'conditions', 'in', 'a', 'material', 'can', 'drastically', 'change', 'altering', 'its', 'optical', 'properties', 'and', 'therefore', 'the', 'relative', 'amount', 'of', 'absorbed', 'energy', 'a', 'quan', 'tity', 'relevant', 'for', 'determining', 'the', 'damage', 'threshold', 'and', 'for', 'developing', 'a', 'detailed', 'simulation', 'of', 'a', 'structuring', 'process', 'the', 'subject', 'of', 'interest', 'in', 'this', 'work', 'is', 'the', 'dband', 'metal', 'gold', 'which', 'has', 'an', 'absorption', 'edge', 'marking', 'the', 'transition', 'of', 'free', 'valence', 'electrons', 'and', 'an', 'absorbing', 'deep', 'dband', 'with', 'bound', 'electrons', 'reflectivity', 'changes', 'are', 'observed', 'in', 'experiment', 'over', 'a', 'broad', 'spectral', 'range', 'at', 'ablation', 'conditions', 'to', 'understand', 'the', 'involved', 'processes', 'the', 'laser', 'excitation', 'is', 'modeled', 'by', 'a', 'com', 'bination', 'of', 'first', 'principle', 'calculations', 'with', 'a', 'twotemperature', 'model', 'the', 'description', 'is', 'kept', 'most', 'general', 'and', 'applied', 'to', 'realistically', 'simulate', 'the', 'transfer', 'of', 'the', 'absorbed', 'energy', 'of', 'a', 'gaussian', 'laser', 'pulse', 'into', 'the', 'electronic', 'system', 'at', 'every', 'point', 'in', 'space', 'at', 'every', 'instance', 'of', 'time', 'an', 'electronic', 'temperaturedependent', 'reflectivity', 'map', 'is', 'calculated', 'describing', 'the', 'out', 'of', 'equilibrium', 'reflectivity', 'during', 'laser', 'excitation', 'for', 'photon', 'energies', 'from', '09', '64', 'ev', 'including', 'inter', 'and', 'intraband', 'transi', 'tions', 'and', 'a', 'temperaturedependent', 'damping', 'factor', 'the', 'main', 'mechanisms', 'are', 'identified', 'explaining', 'the', 'electronic', 'temperaturedependent', 'change', 'in', 'reflectivity', 'broadening', 'of', 'the', 'edge', 'of', 'the', 'occu', 'piedunoccupied', 'states', 'around', 'the', 'chemical', 'potential', 'mu', 'also', 'leading', 'to', 'a', 'shift', 'of', 'the', 'mu', 'and', 'an', 'increase', 'of', 'the', 'collision', 'rate', 'of', 'free', 'spband', 'electrons', 'with', 'bound', 'dband', 'holes']] | [-0.08954381729588555, 0.18643803907848608, -0.07369291937231601, 0.019251270780975167, 0.021924497262606847, -0.10867662475331975, 0.09131897573965474, 0.4023515662852803, -0.25300024917945346, -0.3136607551834835, 0.004315567763616604, -0.30567420802705375, -0.05447700964025993, 0.18940138413795624, 0.01822406796794706, 0.03111540209798038, 0.018531268764224385, -0.013639256248756408, -0.04375192049513411, -0.1281853603136526, 0.2905250336444969, 0.126155308456685, 0.2678707989047137, 0.11235464438555184, 0.061924285666840474, 0.02804684806524792, 0.033007244009460354, -0.05072695352270063, -0.12841774754984914, 0.0820977476988791, 0.24542588006568558, -0.007630497365708238, 0.25384728475082424, -0.4131228259856439, -0.2611814877379621, 0.04316884129817983, 0.10646496406868743, 0.10842825699916736, -0.05035831528798083, -0.2426495210725236, -0.0006497364590578744, -0.14462464088012048, -0.1464973072700026, -0.014909326444090954, 0.031170051436768924, 0.028351354316390794, -0.2741489162578765, 0.04348065958502361, 0.04273796787978865, 0.05835204599846073, -0.12340483388909669, -0.0827793648219587, -0.07963969555265944, 0.0846476647641574, 0.006524438016264145, 0.033032030461291814, 0.20035118836626523, -0.12919312726067989, -0.07514221541350707, 0.3944411093353069, -0.06999136021075739, -0.07647440851071914, 0.14986821506945175, -0.15602465662784104, -0.048947398431884157, 0.24673228851391066, 0.13840824080799738, 0.10954914389580593, -0.14552642593856757, 0.04142541264345396, 0.022321551858551864, 0.20373559203503175, 0.1029583301660123, 0.06573476338812255, 0.22117148655073332, 0.18901020525538179, 0.020023208346362387, 0.13079189364462168, -0.12131970917860223, -0.03749605273458593, -0.2681128477169891, -0.13216723245919826, -0.19558599305234786, 0.06149477221760176, -0.06384864728452472, -0.15853286273115122, 0.43127848645913064, 0.10737832727368343, 0.1798061204447957, -0.04187672648323973, 0.26661028706045947, 0.180222734330214, 0.02436677406537989, 0.043397929166656406, 0.2423699807118753, 0.13507074263781824, 0.10615803255119506, -0.2840758072712121, 0.07562798560006898, -0.014539421043270427] |
1,802.00102 | Modeling epidemics on d-cliqued graphs | Since social interactions have been shown to lead to symmetric clusters, we
propose here that symmetries play a key role in epidemic modeling. Mathematical
models on d-ary tree graphs were recently shown to be particularly effective
for modeling epidemics in simple networks [Seibold & Callender, 2016]. To
account for symmetric relations, we generalize this to a new type of networks
modeled on d-cliqued tree graphs, which are obtained by adding edges to regular
d-trees to form d-cliques. This setting gives a more realistic model for
epidemic outbreaks originating, for example, within a family or classroom and
which could reach a population by transmission via children in schools.
Specifically, we quantify how an infection starting in a clique (e.g. family)
can reach other cliques through the body of the graph (e.g. public places).
Moreover, we propose and study the notion of a safe zone, a subset that has a
negligible probability of infection.
| q-bio.PE cs.SI | since social interactions have been shown to lead to symmetric clusters we propose here that symmetries play a key role in epidemic modeling mathematical models on dary tree graphs were recently shown to be particularly effective for modeling epidemics in simple networks seibold callender 2016 to account for symmetric relations we generalize this to a new type of networks modeled on dcliqued tree graphs which are obtained by adding edges to regular dtrees to form dcliques this setting gives a more realistic model for epidemic outbreaks originating for example within a family or classroom and which could reach a population by transmission via children in schools specifically we quantify how an infection starting in a clique eg family can reach other cliques through the body of the graph eg public places moreover we propose and study the notion of a safe zone a subset that has a negligible probability of infection | [['since', 'social', 'interactions', 'have', 'been', 'shown', 'to', 'lead', 'to', 'symmetric', 'clusters', 'we', 'propose', 'here', 'that', 'symmetries', 'play', 'a', 'key', 'role', 'in', 'epidemic', 'modeling', 'mathematical', 'models', 'on', 'dary', 'tree', 'graphs', 'were', 'recently', 'shown', 'to', 'be', 'particularly', 'effective', 'for', 'modeling', 'epidemics', 'in', 'simple', 'networks', 'seibold', 'callender', '2016', 'to', 'account', 'for', 'symmetric', 'relations', 'we', 'generalize', 'this', 'to', 'a', 'new', 'type', 'of', 'networks', 'modeled', 'on', 'dcliqued', 'tree', 'graphs', 'which', 'are', 'obtained', 'by', 'adding', 'edges', 'to', 'regular', 'dtrees', 'to', 'form', 'dcliques', 'this', 'setting', 'gives', 'a', 'more', 'realistic', 'model', 'for', 'epidemic', 'outbreaks', 'originating', 'for', 'example', 'within', 'a', 'family', 'or', 'classroom', 'and', 'which', 'could', 'reach', 'a', 'population', 'by', 'transmission', 'via', 'children', 'in', 'schools', 'specifically', 'we', 'quantify', 'how', 'an', 'infection', 'starting', 'in', 'a', 'clique', 'eg', 'family', 'can', 'reach', 'other', 'cliques', 'through', 'the', 'body', 'of', 'the', 'graph', 'eg', 'public', 'places', 'moreover', 'we', 'propose', 'and', 'study', 'the', 'notion', 'of', 'a', 'safe', 'zone', 'a', 'subset', 'that', 'has', 'a', 'negligible', 'probability', 'of', 'infection']] | [-0.09413879332085442, 0.10151762256921486, -0.07435912935486429, 0.09640630370326894, -0.0998286626827148, -0.15824590623064116, 0.10017901388739513, 0.3863934824759191, -0.2225496728536421, -0.2992461747364015, 0.10313320764957147, -0.27811887283884995, -0.21817811638450352, 0.14450193471212341, -0.10756298758536326, -0.014645338378613815, 0.08543852523261858, 0.05427567855174955, 0.05188210634829325, -0.23533836343877074, 0.32604000113457693, 0.04332806550696291, 0.23983353918034434, 0.05397763246878025, 0.07199715599858177, 0.02216055865613492, -0.009453274534599905, 0.062268189318176057, -0.14077119459132617, 0.1085709694028058, 0.31022475325814436, 0.15185782989027682, 0.292194204587439, -0.4491854934776957, -0.2741472505605654, 0.1729587824524355, 0.15934829281330756, 0.15823988309303122, -0.03191208742557776, -0.2818248641261881, 0.07995070785408323, -0.21421762137843697, -0.11135146744247224, -0.05579885960606908, 0.045689935009372795, -0.015122740848833142, -0.28636689372895585, 0.019222507091841624, 0.04675027690324429, 0.06343421093156762, 0.02496531980687979, -0.10245088174486079, -0.025954775457157176, 0.14206674235174432, -0.02112072125483128, -0.001200048256086538, 0.09661737353638494, -0.12393630322421322, -0.152443974691827, 0.365589716260139, -0.017981426129621024, -0.17591003226619717, 0.1675862605853409, -0.08969398124797924, -0.1751112320493416, 0.0760798445380469, 0.27102422726818837, 0.08769397303694859, -0.20275405055616755, 0.03040007218589528, -0.06117917041961305, 0.1084120701148955, 0.0782872758588653, -0.016315496589585737, 0.18538232616186645, 0.20444138509825477, 0.08297958534770973, 0.14029690784337692, -0.05365900941054664, -0.12522002451146977, -0.21261844170481167, -0.08696691167062602, -0.12388219405909547, 0.053713590770564985, -0.10116415153351153, -0.18016325809317957, 0.4019918216540277, 0.1459049890981987, 0.17315135877957014, 0.1038950110889493, 0.19010127603070107, 0.056755407239826444, 0.07508695914686934, 0.09648132488394834, 0.178570025172588, 0.09317856717923959, 0.05073623719461564, -0.12777916738146766, 0.14021158749804002, 0.05919752954945874] |
1,802.00103 | High-spin spectroscopy and shell-model interpretation of the N < 126
radium isotopes $^{212}$Ra and $^{213}$Ra | The level structures of $^{212}$Ra and $^{213}$Ra have been established via
time-correlated $\gamma$-ray spectroscopy following the
$^{204}$Pb($^{12}$C,4$n$)$^{212}$Ra and $^{204}$Pb($^{13}$C,4$n$)$^{213}$Ra
reactions. In $^{212}$Ra, levels up to $\sim 6.2$ MeV were identified and firm
spin-parity assignments were achieved to a $J^{\pi} = 19^+$ isomer with a mean
life of 31(3) ns. For $^{213}$Ra the corresponding values were $\sim 4.5$ MeV
in excitation energy and $J^{\pi} = 33/2^+$. Two isomeric states with $J^\pi =
23/2^+$, $\tau = 27(3)$ ns and $J^\pi = 33/2^+$, $\tau = 50(3)$ ns were
discovered in $^{213}$Ra. The experimental data were compared with
semiempirical shell-model calculations, which allowed dominant configurations
to be assigned to most of the observed levels.
| nucl-ex | the level structures of 212ra and 213ra have been established via timecorrelated gammaray spectroscopy following the 204pb12c4n212ra and 204pb13c4n213ra reactions in 212ra levels up to sim 62 mev were identified and firm spinparity assignments were achieved to a jpi 19 isomer with a mean life of 313 ns for 213ra the corresponding values were sim 45 mev in excitation energy and jpi 332 two isomeric states with jpi 232 tau 273 ns and jpi 332 tau 503 ns were discovered in 213ra the experimental data were compared with semiempirical shellmodel calculations which allowed dominant configurations to be assigned to most of the observed levels | [['the', 'level', 'structures', 'of', '212ra', 'and', '213ra', 'have', 'been', 'established', 'via', 'timecorrelated', 'gammaray', 'spectroscopy', 'following', 'the', '204pb12c4n212ra', 'and', '204pb13c4n213ra', 'reactions', 'in', '212ra', 'levels', 'up', 'to', 'sim', '62', 'mev', 'were', 'identified', 'and', 'firm', 'spinparity', 'assignments', 'were', 'achieved', 'to', 'a', 'jpi', '19', 'isomer', 'with', 'a', 'mean', 'life', 'of', '313', 'ns', 'for', '213ra', 'the', 'corresponding', 'values', 'were', 'sim', '45', 'mev', 'in', 'excitation', 'energy', 'and', 'jpi', '332', 'two', 'isomeric', 'states', 'with', 'jpi', '232', 'tau', '273', 'ns', 'and', 'jpi', '332', 'tau', '503', 'ns', 'were', 'discovered', 'in', '213ra', 'the', 'experimental', 'data', 'were', 'compared', 'with', 'semiempirical', 'shellmodel', 'calculations', 'which', 'allowed', 'dominant', 'configurations', 'to', 'be', 'assigned', 'to', 'most', 'of', 'the', 'observed', 'levels']] | [-0.03331705176271498, 0.19904771638452076, -0.005557864990551025, 0.09741085795802064, 0.03138906134001445, -0.153546575573273, 0.14802067719399928, 0.3963068175688386, -0.1192360270919744, -0.4665788324736059, -0.014885523355333134, -0.34043057680130007, 0.08774948414415121, 0.15005698911729268, 0.09792848191224039, 0.07407832220211276, 0.07328899052692578, 0.03292124926112592, -0.042206054837442934, -0.19295161963440477, 0.19427179205464198, 0.08172839934006333, 0.19731618287041783, 0.05582232368760742, 0.045450296654598786, -0.10332091458374634, 0.038513998561538754, -0.13233321347739546, -0.1608966384548694, 0.039104863542015665, 0.2846172355581075, 0.03214723317651078, 0.17513752408325672, -0.3262417319603264, -0.12534022188512609, 0.046781705021858216, 0.1079871319537051, 0.06260073373443448, 0.04934818552370416, -0.3669292140379548, 0.1663592775212601, -0.20858702812343835, -0.07896032659336924, -0.03557089566253126, 0.10097408587578684, 0.027090599045623096, -0.20807653556927108, 0.11158745463297237, -0.09615701939910651, 0.09662982346657373, -0.18651090586325153, -0.31737317722290753, -0.05547123555094004, 0.044707778906449676, 0.032835763790644706, 0.08328781911317491, 0.11151803447399289, -0.03358059079386294, -0.19068220937624575, 0.3587363416980952, -0.01828843924216926, -0.05018685724120587, 0.12814368395134806, -0.15759912871813866, -0.17675739719183184, 0.23371287687681616, 0.061025013641919944, 0.11290052912198006, -0.14227048235945403, -0.0019506824720883743, 0.03358210446953308, 0.24487244042102246, 0.14181313891895114, 0.03677493072347716, 0.1483944160072133, 0.10640338755212725, -0.08311690926318988, 0.044003204581094905, -0.2583419370092452, -0.059299683053977786, -0.21531631195917725, -0.09727336960844696, -0.09510114112868905, 0.14455752566922456, 0.04098266446570051, -0.009342375011183322, 0.41598794059827926, 0.020912392206373625, 0.19938934167847036, -0.013623325453372671, 0.14666937191970647, 0.10345024984329938, 0.0709179346531164, 0.0597588571254164, 0.3236174866510555, 0.21267571655334905, 0.05687653719447553, -0.19935938818380236, 0.035502146021462976, -0.07463785669300706] |
1,802.00104 | On the Achievability Region of Regenerating Codes for Multiple Erasures | We study the problem of centralized exact repair of multiple failures in
distributed storage. We describe constructions that achieve a new set of
interior points under exact repair. The constructions build upon the layered
code construction by Tian et al., designed for exact repair of single failure.
We firstly improve upon the layered construction for general system parameters.
Then, we extend the improved construction to support the repair of multiple
failures, with varying number of helpers. In particular, we prove the
optimality of one point on the functional repair tradeoff of multiple failures
for some parameters. Finally, considering minimum bandwidth cooperative repair
(MBCR) codes as centralized repair codes, we determine explicitly the best
achievable region obtained by space-sharing among all known points, including
the MBCR point.
| cs.IT math.IT | we study the problem of centralized exact repair of multiple failures in distributed storage we describe constructions that achieve a new set of interior points under exact repair the constructions build upon the layered code construction by tian et al designed for exact repair of single failure we firstly improve upon the layered construction for general system parameters then we extend the improved construction to support the repair of multiple failures with varying number of helpers in particular we prove the optimality of one point on the functional repair tradeoff of multiple failures for some parameters finally considering minimum bandwidth cooperative repair mbcr codes as centralized repair codes we determine explicitly the best achievable region obtained by spacesharing among all known points including the mbcr point | [['we', 'study', 'the', 'problem', 'of', 'centralized', 'exact', 'repair', 'of', 'multiple', 'failures', 'in', 'distributed', 'storage', 'we', 'describe', 'constructions', 'that', 'achieve', 'a', 'new', 'set', 'of', 'interior', 'points', 'under', 'exact', 'repair', 'the', 'constructions', 'build', 'upon', 'the', 'layered', 'code', 'construction', 'by', 'tian', 'et', 'al', 'designed', 'for', 'exact', 'repair', 'of', 'single', 'failure', 'we', 'firstly', 'improve', 'upon', 'the', 'layered', 'construction', 'for', 'general', 'system', 'parameters', 'then', 'we', 'extend', 'the', 'improved', 'construction', 'to', 'support', 'the', 'repair', 'of', 'multiple', 'failures', 'with', 'varying', 'number', 'of', 'helpers', 'in', 'particular', 'we', 'prove', 'the', 'optimality', 'of', 'one', 'point', 'on', 'the', 'functional', 'repair', 'tradeoff', 'of', 'multiple', 'failures', 'for', 'some', 'parameters', 'finally', 'considering', 'minimum', 'bandwidth', 'cooperative', 'repair', 'mbcr', 'codes', 'as', 'centralized', 'repair', 'codes', 'we', 'determine', 'explicitly', 'the', 'best', 'achievable', 'region', 'obtained', 'by', 'spacesharing', 'among', 'all', 'known', 'points', 'including', 'the', 'mbcr', 'point']] | [-0.21702001945463023, -0.008236161473813274, 0.03419898340057227, 0.038741373719411, -0.03141733859517863, -0.21253168839769113, 0.1823443598520484, 0.3314189107345772, -0.2776198019347494, -0.2928684297431674, 0.10797287035356498, -0.22948381068214538, -0.1748050811833569, 0.15673311433148762, -0.1621974653544529, 0.11853467775250061, 0.050515363015057074, 0.013867911481712427, -0.08004230669411343, -0.3121208398656491, 0.3089392316455598, 0.1543004630089161, 0.29648258965758106, 0.00906373764940774, 0.031864215782473955, 0.06394568329495895, -0.01793636873896633, -0.027224475307212698, -0.20660010403760623, 0.1030054192099395, 0.31136202853586936, 0.19142043516815951, 0.2283372331913265, -0.434616395641887, -0.24664377538041057, 0.08397593319744966, 0.1271954150648699, 0.1546224363329303, -0.014610430745903166, -0.1880865297280252, 0.17325554115490782, -0.20836343135802993, -0.09481869361895535, -0.04816259608589231, -0.06025402730936923, 0.06654170407758404, -0.31103437380599125, -0.04372983713383003, 0.03527476830363628, 0.04967826197204727, -0.10310505391172474, -0.09982588227158265, 0.03192048469403138, 0.13314174212855362, -0.00868963481237491, -0.00574634239883236, 0.09626207280431003, -0.035140917388840565, -0.15983960757240845, 0.31127987029252663, 0.048792352359871276, -0.1742326670588689, 0.16752627790565527, -0.005998607702730667, -0.17964117835822796, 0.13876252644741538, 0.19488116952850268, 0.10093750670138332, -0.15669486922256293, 0.08887378773411796, -0.05951900798679581, 0.13902944319979435, 0.15987188127889698, 0.07926930585693169, 0.10902486721308724, 0.13987538425274015, 0.10349429619086478, 0.1949758031775081, -0.033556873684689875, -0.09866512489425654, -0.28458958396841477, -0.11281565739565329, -0.19146813570784169, 0.0013920123031037667, -0.140121934325656, -0.16601862454979074, 0.39659054369558505, 0.17001049366173526, 0.145368694967132, 0.13375568717518554, 0.2783704541978382, 0.007431274971168023, 0.07167405909710815, 0.19681037572907314, 0.18201561933424923, 0.03821938059436867, 0.010486643816832276, -0.23120418844729781, 0.07644367069449454, 0.09454960139867451] |
1,802.00105 | Can disorder act as a chemical pressure? An optical study of the Hubbard
model | The optical properties have been studied using the dynamical mean-field
theory (DMFT) on a disordered Hubbard model. Despite the fact that disorder
turns a metal to an insulator in high dimensional correlated materials, we
notice that it can enhance certain metallic behavior as if a chemical pressure
is applied to the system resulting in an increase of the effective lattice
bandwidth (BW). We study optical properties in such a scenario and compare
results with experiments where the BW is changed through chemical doping and
obtain remarkable similarities vindicating our claim. We also make a point that
these similarities differ from some other forms of BW tuned optical effects.
| cond-mat.str-el | the optical properties have been studied using the dynamical meanfield theory dmft on a disordered hubbard model despite the fact that disorder turns a metal to an insulator in high dimensional correlated materials we notice that it can enhance certain metallic behavior as if a chemical pressure is applied to the system resulting in an increase of the effective lattice bandwidth bw we study optical properties in such a scenario and compare results with experiments where the bw is changed through chemical doping and obtain remarkable similarities vindicating our claim we also make a point that these similarities differ from some other forms of bw tuned optical effects | [['the', 'optical', 'properties', 'have', 'been', 'studied', 'using', 'the', 'dynamical', 'meanfield', 'theory', 'dmft', 'on', 'a', 'disordered', 'hubbard', 'model', 'despite', 'the', 'fact', 'that', 'disorder', 'turns', 'a', 'metal', 'to', 'an', 'insulator', 'in', 'high', 'dimensional', 'correlated', 'materials', 'we', 'notice', 'that', 'it', 'can', 'enhance', 'certain', 'metallic', 'behavior', 'as', 'if', 'a', 'chemical', 'pressure', 'is', 'applied', 'to', 'the', 'system', 'resulting', 'in', 'an', 'increase', 'of', 'the', 'effective', 'lattice', 'bandwidth', 'bw', 'we', 'study', 'optical', 'properties', 'in', 'such', 'a', 'scenario', 'and', 'compare', 'results', 'with', 'experiments', 'where', 'the', 'bw', 'is', 'changed', 'through', 'chemical', 'doping', 'and', 'obtain', 'remarkable', 'similarities', 'vindicating', 'our', 'claim', 'we', 'also', 'make', 'a', 'point', 'that', 'these', 'similarities', 'differ', 'from', 'some', 'other', 'forms', 'of', 'bw', 'tuned', 'optical', 'effects']] | [-0.10053223082192105, 0.12969309452698022, -0.10925816346166863, 0.05395280524303585, -0.04205273613721753, -0.16439135070928992, 0.10816757073216313, 0.42363565835963796, -0.2839781648298312, -0.23989883652474317, 0.04682734978268854, -0.33591782041238966, -0.20674717345240493, 0.17593674611567553, -0.011300169177249901, 0.0010940899522851127, 0.024521068790582596, -0.01165421641026451, -0.12927978074704125, -0.24167815440644821, 0.26454698244816865, 0.02541723638165018, 0.28672756583222914, 0.08615568931714666, 0.024835368294993207, -0.012573017853019, 0.05912741527599455, 0.07612863567946651, -0.11351866074033347, 0.03833616458103751, 0.22061828179586748, -0.030057109312447546, 0.23163199933521725, -0.4114948520091949, -0.2816890880672468, 0.06809544938409494, 0.13878028602684261, 0.13288108631968498, -0.08859537787093022, -0.24494427339070374, 0.0714172449014667, -0.19750155568666136, -0.1430615403999885, -0.10198112967838016, 0.0025501262043016375, 0.03494927742846172, -0.24874475544008115, 0.039052654664070964, 0.02653889466132063, 0.07766846747620514, -0.06729526524388886, -0.1091384008447036, -0.05715652228186459, 0.1095316739735642, 0.031101103439815, 0.03750117320817447, 0.1323017814601944, -0.13257643129846083, -0.09182840409037588, 0.40442018845566996, -0.09057770116810894, -0.14752045809722472, 0.25577080728813867, -0.14274723705387227, -0.11859240040993663, 0.10587278705228258, 0.13436698951085824, 0.0640235654923513, -0.14206014892207114, 0.09992395183481104, -0.03861174598137883, 0.1969758191998052, -0.006491444657849906, 0.10013205369641245, 0.1994520360690162, 0.18664644642396727, -0.00399382940829835, 0.15536499862759634, -0.06487374960798425, -0.09563059011405264, -0.20043569080600585, -0.1231585370190226, -0.1893485504228415, 0.06320654451997985, -0.08679321571226292, -0.16967105730522977, 0.38485956106645364, 0.2252907952141767, 0.20392387774686707, -0.034435011739670125, 0.22989260945124207, 0.14106937735427724, 0.062335030404264455, 0.01979838161194628, 0.2934974920065509, 0.1326743422196833, 0.09212513360695017, -0.24966792564589046, 0.04344690669838908, 0.03137969016097486] |
1,802.00106 | Geometry of extended Bianchi-Cartan-Vranceanu spaces | The differential geometry of $3$-dimensional Bianchi, Cartan and Vranceanu
($BCV$) spaces is well known. We introduce the extended Bianchi, Cartan and
Vranceanu ($EBCV$) spaces as a natural seven dimensional generalization of
$BCV$ spaces and study some of their main geometric properties, such as the
Levi-Civita connection, Ricci curvatures, Killing fields and geodesics.
| math.DG | the differential geometry of 3dimensional bianchi cartan and vranceanu bcv spaces is well known we introduce the extended bianchi cartan and vranceanu ebcv spaces as a natural seven dimensional generalization of bcv spaces and study some of their main geometric properties such as the levicivita connection ricci curvatures killing fields and geodesics | [['the', 'differential', 'geometry', 'of', '3dimensional', 'bianchi', 'cartan', 'and', 'vranceanu', 'bcv', 'spaces', 'is', 'well', 'known', 'we', 'introduce', 'the', 'extended', 'bianchi', 'cartan', 'and', 'vranceanu', 'ebcv', 'spaces', 'as', 'a', 'natural', 'seven', 'dimensional', 'generalization', 'of', 'bcv', 'spaces', 'and', 'study', 'some', 'of', 'their', 'main', 'geometric', 'properties', 'such', 'as', 'the', 'levicivita', 'connection', 'ricci', 'curvatures', 'killing', 'fields', 'and', 'geodesics']] | [-0.17795555636871094, 0.05426594412282986, -0.023382703791938575, 0.14772049274852536, -0.2377272378653288, -0.13394673598711104, -0.1384610209029679, 0.3511955508706616, -0.2860924782614936, -0.21209744999513908, 0.1432973015636854, -0.21659226299208753, -0.23388159603757017, 0.12320855340244723, -0.15694627599498512, 0.0011665587514346721, -0.02241765421029984, 0.08374457582192239, -0.1443931308538452, -0.2682358201218806, 0.4862988230352308, -0.004705791891205544, 0.23581671364167156, -0.021308130119495235, 0.17742298982635724, -0.05189834725951739, -0.04847167745488239, 0.07519651021735341, -0.1850519355240406, 0.11417458248415999, 0.2224056990634577, 0.09086166758674617, 0.14185930368508778, -0.34118148425192224, -0.19075989056899048, 0.15602265606296487, 0.12719405368518302, 0.0075995717882452645, -0.02181081539567779, -0.36618211766814485, -0.005898780719030137, -0.09864319860935211, -0.19978422016320824, -0.15277590478459993, 0.030498793220841418, 0.0034979005828134568, -0.12318657512100888, 0.06079244692170737, 0.1365613908479538, 0.1160359512663597, -0.14237349655698328, -0.11807062726025012, -0.07633865634253358, 0.06813441985743303, 0.07154738217793113, -0.00859859742352045, 0.07978524821901731, -0.04331412774641363, -0.17338802493816496, 0.39582101639141054, -0.06030348146005588, -0.2709098193867534, 0.11354575514355127, -0.1091428891956514, -0.1409801800607466, -0.012697421299640601, 0.12620432652571859, 0.17844557225265922, -0.11635308470303084, 0.1970852901748217, -0.03424393989182278, -0.037869104640740975, 0.13548176070930912, 0.03335746112918737, 0.12448814069377441, 0.03812816092634902, 0.05827461688907123, 0.12493167405345422, 0.00823951222221641, -0.10829149932696429, -0.3997369119349648, -0.313083037165651, -0.07439149277029085, 0.1973397151941397, -0.21894956198315518, -0.19984152219166942, 0.39996297533313435, -0.030987594154544686, 0.14646494403189303, 0.09555133356822326, 0.17997314095241473, -0.04435254929715073, 0.04192223907083127, 0.1123370070686089, 0.20395029933184988, 0.3414922170523627, 0.0957068030302431, -0.12209066362622395, -0.10684311482142292, 0.19066604625321834] |
1,802.00107 | Predicting Wireless Channel Features using Neural Networks | We investigate the viability of using machine-learning techniques for
estimating user-channel features at a large-array base station (BS). In the
scenario we consider, user-pilot broadcasts are observed and processed by the
BS to extract angle-of-arrival (AoA) specific information about
propagation-channel features, such as received signal strength and relative
path delay. The problem of interest involves using this information to predict
the angle-of-departure (AoD) of the dominant propagation paths in the user
channels, i.e., channel features not directly observable at the BS. To
accomplish this task, the data collected in the same propagation environment
are used to train neural networks. Our studies rely on ray-tracing channel data
that have been calibrated against measurements from Shinjuku Square, a famous
hotspot in Tokyo, Japan. We demonstrate that the observed features at the BS
side are correlated with the angular features at the user side. We train neural
networks that exploit different combinations of measured features at the BS to
infer the unknown parameters at the users. The evaluation based on standard
statistical performance metrics suggests that such data-driven methods have the
potential to predict unobserved channel features from observed ones.
| eess.SP cs.IT math.IT | we investigate the viability of using machinelearning techniques for estimating userchannel features at a largearray base station bs in the scenario we consider userpilot broadcasts are observed and processed by the bs to extract angleofarrival aoa specific information about propagationchannel features such as received signal strength and relative path delay the problem of interest involves using this information to predict the angleofdeparture aod of the dominant propagation paths in the user channels ie channel features not directly observable at the bs to accomplish this task the data collected in the same propagation environment are used to train neural networks our studies rely on raytracing channel data that have been calibrated against measurements from shinjuku square a famous hotspot in tokyo japan we demonstrate that the observed features at the bs side are correlated with the angular features at the user side we train neural networks that exploit different combinations of measured features at the bs to infer the unknown parameters at the users the evaluation based on standard statistical performance metrics suggests that such datadriven methods have the potential to predict unobserved channel features from observed ones | [['we', 'investigate', 'the', 'viability', 'of', 'using', 'machinelearning', 'techniques', 'for', 'estimating', 'userchannel', 'features', 'at', 'a', 'largearray', 'base', 'station', 'bs', 'in', 'the', 'scenario', 'we', 'consider', 'userpilot', 'broadcasts', 'are', 'observed', 'and', 'processed', 'by', 'the', 'bs', 'to', 'extract', 'angleofarrival', 'aoa', 'specific', 'information', 'about', 'propagationchannel', 'features', 'such', 'as', 'received', 'signal', 'strength', 'and', 'relative', 'path', 'delay', 'the', 'problem', 'of', 'interest', 'involves', 'using', 'this', 'information', 'to', 'predict', 'the', 'angleofdeparture', 'aod', 'of', 'the', 'dominant', 'propagation', 'paths', 'in', 'the', 'user', 'channels', 'ie', 'channel', 'features', 'not', 'directly', 'observable', 'at', 'the', 'bs', 'to', 'accomplish', 'this', 'task', 'the', 'data', 'collected', 'in', 'the', 'same', 'propagation', 'environment', 'are', 'used', 'to', 'train', 'neural', 'networks', 'our', 'studies', 'rely', 'on', 'raytracing', 'channel', 'data', 'that', 'have', 'been', 'calibrated', 'against', 'measurements', 'from', 'shinjuku', 'square', 'a', 'famous', 'hotspot', 'in', 'tokyo', 'japan', 'we', 'demonstrate', 'that', 'the', 'observed', 'features', 'at', 'the', 'bs', 'side', 'are', 'correlated', 'with', 'the', 'angular', 'features', 'at', 'the', 'user', 'side', 'we', 'train', 'neural', 'networks', 'that', 'exploit', 'different', 'combinations', 'of', 'measured', 'features', 'at', 'the', 'bs', 'to', 'infer', 'the', 'unknown', 'parameters', 'at', 'the', 'users', 'the', 'evaluation', 'based', 'on', 'standard', 'statistical', 'performance', 'metrics', 'suggests', 'that', 'such', 'datadriven', 'methods', 'have', 'the', 'potential', 'to', 'predict', 'unobserved', 'channel', 'features', 'from', 'observed', 'ones']] | [-0.10659562316520707, 0.02153802501941201, -0.06978483195922783, 0.07086494815872435, -0.10488426587392535, -0.18466345056810457, 0.07849408285920104, 0.40614822423389263, -0.2837508570139661, -0.3121668275081269, 0.07939498025023015, -0.3313088990677067, -0.14511449621109615, 0.1596215245941573, -0.04752351770762091, 0.053012963882951146, 0.091955646844682, 0.08700853303257051, -0.03875741100890319, -0.19974579926929437, 0.3023218211114711, 0.08986491225052463, 0.3553786701421537, 0.003874772807846413, 0.1165402847704093, -0.003275846963768582, -0.07940380331938682, -0.05106486286335301, -0.09972335121220448, 0.09039136539112129, 0.29196806505838735, 0.17199774893410708, 0.23533407236327944, -0.4393308582227252, -0.27323559318345203, 0.08451073833250279, 0.11116295901339744, 0.08465837231209583, 0.0006894129265160502, -0.31792961479083676, 0.10663933462701211, -0.14309129318786765, -0.04409454684228758, -0.002593609638532381, -0.03800870760080769, 0.04144356174726019, -0.3096071882046881, 0.025990144177542432, -0.048885844699567395, 0.048479945034436554, -0.013685341026006348, -0.13881617615571368, -0.009562888635647814, 0.19948242255739626, 0.057727671897104614, 0.0064594250807599365, 0.14443213890215545, -0.1271647895031413, -0.1256261210048409, 0.3449089763200153, -0.0815540099157142, -0.19378337581672342, 0.16406724013801938, -0.11539576854651702, -0.126016907310417, 0.12517820036863786, 0.2731562045149115, 0.06879433648946756, -0.17529136493660347, -0.03417334455108452, -0.010587848044688935, 0.17897266517747598, 0.05373593098382749, 0.07540814342918685, 0.20147126692502396, 0.17374086532799993, 0.010094607322294589, 0.09878912672296714, -0.19388341175837684, -0.05781038536730668, -0.21566483271611936, -0.06412092731941653, -0.21950795857802682, -0.02942885404682665, -0.053590339534940024, -0.060584945487157114, 0.405834257228138, 0.20390410844431797, 0.21227023891254287, 0.07329016330059739, 0.34533442528513464, 0.07232039150688291, 0.10577882354466608, 0.1024131912509683, 0.23900647289788732, 0.06534905324857075, 0.14237285569391173, -0.20253728301537668, 0.12877848401852965, -0.02717485699584991] |
1,802.00108 | Reducible Calabi-Yau threefolds with countably many rational curves | We give a class of examples of reducible (d-semistable) threefolds of CY type
with two irreducible components for which (it is reasonably easy to prove that)
no family of admissible genus zero stable maps sweeps out a surface, yet such
stable maps occur in infinitely many degrees.
| math.AG | we give a class of examples of reducible dsemistable threefolds of cy type with two irreducible components for which it is reasonably easy to prove that no family of admissible genus zero stable maps sweeps out a surface yet such stable maps occur in infinitely many degrees | [['we', 'give', 'a', 'class', 'of', 'examples', 'of', 'reducible', 'dsemistable', 'threefolds', 'of', 'cy', 'type', 'with', 'two', 'irreducible', 'components', 'for', 'which', 'it', 'is', 'reasonably', 'easy', 'to', 'prove', 'that', 'no', 'family', 'of', 'admissible', 'genus', 'zero', 'stable', 'maps', 'sweeps', 'out', 'a', 'surface', 'yet', 'such', 'stable', 'maps', 'occur', 'in', 'infinitely', 'many', 'degrees']] | [-0.21110588207881412, 0.13482339468116508, -0.09841149790293496, 0.09611100052817441, -0.0650546056744845, -0.21663515767811434, 0.015562880569157878, 0.38656044045827637, -0.29035611045749293, -0.21343592449050883, 0.11687141278525814, -0.2342684101920737, -0.17285663490791037, 0.23798991023036448, -0.08824947728451503, -0.012281668888728904, 0.0894048408422943, 0.03844580050233914, -0.08288138716623349, -0.3108923583261102, 0.3512099906296024, -0.13563958158129422, 0.1852675624212007, 0.02155203467396938, 0.19344750905166502, -0.056830374979535525, 0.03556957068022988, 0.023024939527006252, -0.13038581541474306, 0.08965642955255411, 0.37488025063825975, 0.053631675070273166, 0.1480959935275757, -0.31737517956239375, -0.1997864821460098, 0.2568980335338932, 0.1230592850656451, 0.08814396734258322, -0.02412082860752454, -0.17348157687355642, 0.08279804876276656, -0.1701155914747885, -0.25405820339675184, -0.155057519795778, 0.09047103798745768, 0.021127261221408844, -0.2189371078680067, -0.012783536282570465, 0.13892223732545972, 0.13207274776599978, -0.012734217468001272, -0.1124254526651424, -0.12542166232900775, 0.06469147920649013, 0.03479851772705012, 0.028852725300290014, 0.04650878344419534, -0.10526676307958753, -0.05011188166985369, 0.31177901663265756, -0.04428060368999191, -0.23146299185717237, 0.23172825427584187, -0.09992426993203876, -0.2091839222703129, 0.26243913099777116, 0.08064510713776817, 0.1895150642072701, -0.04389374711267326, 0.12438483505874225, -0.08294032145615506, 0.09741121336169865, 0.12788331362864244, -0.005231176950948556, 0.21684133943737202, 0.03875729833405627, 0.14190570401953426, 0.15610108980099144, -0.010720869607251623, -0.07626302487662305, -0.37486354285932105, -0.14604964026290437, -0.0743756236852673, 0.15511125388919658, -0.052697604021016996, -0.2654746697162804, 0.4367616749975992, 0.047743861148457814, 0.21461373237569048, 0.10451956253508916, 0.19180174196219962, 0.006042645100261207, 0.057126746168765036, 0.10002691464741593, 0.16218569649018996, 0.16037616599351168, -0.07203626640788886, -0.07572353160535188, -0.0059820994350087385, 0.09904348953505573] |
1,802.00109 | Gradient estimates for nonlinear elliptic equations with a
gradient-dependent nonlinearity | In this paper, we obtain gradient estimates of the positive solutions to
weighted $p$-Laplacian type equations with a gradient-dependent nonlinearity of
the form \begin{equation} \label{one} {\rm div} (|x|^{\sigma}|\nabla u|^{p-2}
\nabla u)= |x|^{-\tau} u^q |\nabla u|^m \quad \mbox{in } \ \Omega^*:= \Omega
\setminus \{ 0 \}. \end{equation} Here, $\Omega\subseteq \mathbb R^N$ denotes a
domain containing the origin with $N\geq 2$, whereas $m,q\in [0,\infty)$,
$1<p\leq N+\sigma$ and $q>\max\{p-m-1,\sigma+\tau-1\}$. The main difficulty
arises from the dependence of the right-hand side of the equation on $x$, $u$
and $|\nabla u|$, without any upper bound restriction on the power $m$ of
$|\nabla u|$. Our proof of the gradient estimates is based on a two-step
process relying on a modified version of the Bernstein's method. As a
by-product, we extend the range of applicability of the Liouville-type results
known for our problem.
| math.AP | in this paper we obtain gradient estimates of the positive solutions to weighted plaplacian type equations with a gradientdependent nonlinearity of the form beginequation labelone rm div xsigmanabla up2 nabla u xtau uq nabla um quad mboxin omega omega setminus 0 endequation here omegasubseteq mathbb rn denotes a domain containing the origin with ngeq 2 whereas mqin 0infty 1pleq nsigma and qmaxpm1sigmatau1 the main difficulty arises from the dependence of the righthand side of the equation on x u and nabla u without any upper bound restriction on the power m of nabla u our proof of the gradient estimates is based on a twostep process relying on a modified version of the bernsteins method as a byproduct we extend the range of applicability of the liouvilletype results known for our problem | [['in', 'this', 'paper', 'we', 'obtain', 'gradient', 'estimates', 'of', 'the', 'positive', 'solutions', 'to', 'weighted', 'plaplacian', 'type', 'equations', 'with', 'a', 'gradientdependent', 'nonlinearity', 'of', 'the', 'form', 'beginequation', 'labelone', 'rm', 'div', 'xsigmanabla', 'up2', 'nabla', 'u', 'xtau', 'uq', 'nabla', 'um', 'quad', 'mboxin', 'omega', 'omega', 'setminus', '0', 'endequation', 'here', 'omegasubseteq', 'mathbb', 'rn', 'denotes', 'a', 'domain', 'containing', 'the', 'origin', 'with', 'ngeq', '2', 'whereas', 'mqin', '0infty', '1pleq', 'nsigma', 'and', 'qmaxpm1sigmatau1', 'the', 'main', 'difficulty', 'arises', 'from', 'the', 'dependence', 'of', 'the', 'righthand', 'side', 'of', 'the', 'equation', 'on', 'x', 'u', 'and', 'nabla', 'u', 'without', 'any', 'upper', 'bound', 'restriction', 'on', 'the', 'power', 'm', 'of', 'nabla', 'u', 'our', 'proof', 'of', 'the', 'gradient', 'estimates', 'is', 'based', 'on', 'a', 'twostep', 'process', 'relying', 'on', 'a', 'modified', 'version', 'of', 'the', 'bernsteins', 'method', 'as', 'a', 'byproduct', 'we', 'extend', 'the', 'range', 'of', 'applicability', 'of', 'the', 'liouvilletype', 'results', 'known', 'for', 'our', 'problem']] | [-0.1789248586355825, -0.010956935697322479, -0.0009960526258510072, -0.02510263505739374, -0.13112211953375663, -0.15394902122716303, 0.008205657811231504, 0.2813593538812711, -0.3307032289158087, -0.17633648094488308, 0.11774043073728535, -0.38818129677383695, -0.07423577750523691, 0.1790075048120343, -0.07410581623844337, 0.026172125111770583, 0.010508447156098555, 0.07651367882135673, -0.09503981565103459, -0.16022289972079307, 0.36744992484454997, -0.1775181272860209, 0.16691570306647918, 0.1077008041611407, 0.1327893851484987, -0.04092825480620377, 0.09251763286010828, -0.08555313929537078, -0.27869815797566844, 0.0906623560740627, 0.1651669362472603, 0.05413455351936136, 0.35421328579832334, -0.38639767169661354, -0.176004359248509, 0.18912374978845037, 0.17821603439369937, -0.06452522688050522, -0.01690549482464121, -0.3442260218434967, 0.12208216684302897, -0.054614133872746606, -0.17019517152220942, 0.00797360092656163, 0.07181135647624615, 0.08969418182459776, -0.39444069484306965, 0.15799646645609755, 0.13741296921580215, -0.012958927052977742, -0.1163033160410123, -0.2229784493392799, -0.027732191207178403, 0.012352901328995358, 0.0033430760338433174, 0.19044342729739583, 0.018726746423453733, -0.08726774230126466, 0.0010469515436852816, 0.3589909305301262, -0.1440773629146861, -0.28817716300545726, 0.05600735180451011, -0.1795381738411379, -0.14445569679628534, 0.0328384988461039, 0.13999297792543075, 0.2375929292793444, -0.07130704187875381, 0.2791962400688135, -0.0609929287165869, 0.18354603108491574, 0.10679825872830406, -0.006303259048763721, -0.016184043846806162, 0.13802211486472515, 0.14231257920801, 0.07233565694423305, -0.06637735710864945, 0.004338451490184525, -0.4224246479498106, -0.12518636966342456, -0.14402590784266067, 0.19452496061967395, -0.1108157398300591, -0.1558488754544669, 0.28145806785505556, 0.08053845479662414, 0.19683379381604027, 0.1086300762508472, 0.20613048752124996, 0.1614882818003025, -0.03745259657080169, 0.09117429181878833, 0.07544523594333441, 0.1874709339954279, 0.14073829194785503, -0.24779873933766794, 0.006554097981279483, 0.16113712826336268] |
1,802.0011 | Entanglement Swapping for Generation of Heralded
Time-Frequency-Entangled Photon Pairs | Photonic time-frequency entanglement is a promising resource for quantum
information processing technologies. We investigate swapping of
continuous-variable entanglement in the time-frequency degree of freedom using
three-wave mixing in the low-gain regime with the aim of producing heralded
biphoton states with high purity and low multi-pair probability. Heralding is
achieved by combining one photon from each of two biphoton sources via
sum-frequency generation to create a herald photon. We present a realistic
model with pulsed pumps, investigate the effects of resolving the frequency of
the herald photon, and find that frequency-resolving measurement of the herald
photon is necessary to produce high-purity biphotons. We also find a trade-off
between the rate of successful entanglement swapping and both the purity and
quantified entanglement resource (negativity) of the heralded biphoton state.
| quant-ph | photonic timefrequency entanglement is a promising resource for quantum information processing technologies we investigate swapping of continuousvariable entanglement in the timefrequency degree of freedom using threewave mixing in the lowgain regime with the aim of producing heralded biphoton states with high purity and low multipair probability heralding is achieved by combining one photon from each of two biphoton sources via sumfrequency generation to create a herald photon we present a realistic model with pulsed pumps investigate the effects of resolving the frequency of the herald photon and find that frequencyresolving measurement of the herald photon is necessary to produce highpurity biphotons we also find a tradeoff between the rate of successful entanglement swapping and both the purity and quantified entanglement resource negativity of the heralded biphoton state | [['photonic', 'timefrequency', 'entanglement', 'is', 'a', 'promising', 'resource', 'for', 'quantum', 'information', 'processing', 'technologies', 'we', 'investigate', 'swapping', 'of', 'continuousvariable', 'entanglement', 'in', 'the', 'timefrequency', 'degree', 'of', 'freedom', 'using', 'threewave', 'mixing', 'in', 'the', 'lowgain', 'regime', 'with', 'the', 'aim', 'of', 'producing', 'heralded', 'biphoton', 'states', 'with', 'high', 'purity', 'and', 'low', 'multipair', 'probability', 'heralding', 'is', 'achieved', 'by', 'combining', 'one', 'photon', 'from', 'each', 'of', 'two', 'biphoton', 'sources', 'via', 'sumfrequency', 'generation', 'to', 'create', 'a', 'herald', 'photon', 'we', 'present', 'a', 'realistic', 'model', 'with', 'pulsed', 'pumps', 'investigate', 'the', 'effects', 'of', 'resolving', 'the', 'frequency', 'of', 'the', 'herald', 'photon', 'and', 'find', 'that', 'frequencyresolving', 'measurement', 'of', 'the', 'herald', 'photon', 'is', 'necessary', 'to', 'produce', 'highpurity', 'biphotons', 'we', 'also', 'find', 'a', 'tradeoff', 'between', 'the', 'rate', 'of', 'successful', 'entanglement', 'swapping', 'and', 'both', 'the', 'purity', 'and', 'quantified', 'entanglement', 'resource', 'negativity', 'of', 'the', 'heralded', 'biphoton', 'state']] | [-0.1383716762139802, 0.24298347003798607, -0.07390692431686653, 0.026083158028389637, 0.055038474875295326, -0.21372159612956382, 0.10479303111233526, 0.3928433407748502, -0.21437035745105867, -0.279412097053691, 0.0008433426504895564, -0.2645942480968578, -0.023952190272717014, 0.2456034595083948, -0.020283547991384116, 0.15059233686354542, 0.07129826966584438, -0.027027712809661077, -0.0023519674090609426, -0.16275820286948203, 0.3060268970162031, 0.08311753493404785, 0.3927943310404699, 0.05560028791013691, 0.19049740768784273, 0.021994451245677376, -0.04270918192323445, -0.13950749635992069, -0.08787707427900242, 0.12258088056299289, 0.27550270091114004, 0.16559378760645077, 0.26120161213394666, -0.3644384168650186, -0.22064130640189564, 0.13462242742054284, 0.1016630239485364, 0.179094502090482, -0.08786296215008146, -0.3170060782308971, -0.02781596562884275, -0.22085747243256756, -0.06669251447440022, -0.07761638525075146, -0.058434546799472874, -0.004996617745962881, -0.2824137097479598, 0.11130579606614201, -0.004715910175859574, 0.00457059838513415, 0.08884894799825455, 0.04143694445254311, -0.034432473873335215, 0.0890175771810824, -0.11348991200885927, -0.03463507913855008, 0.11570872260499672, -0.1902438775591907, -0.21392347920863403, 0.3162986485117544, -0.07024754001204633, -0.145893593082234, 0.11894515029982561, -0.1791346179310321, -0.09280406555256969, 0.09881015736905355, 0.14675151890177013, 0.09401314128338108, -0.1130641620109109, -0.06243757245344265, 0.026012466237362888, 0.262624965551021, 0.15646480775201724, 0.29005958347226535, 0.21912238466375994, 0.15708483499844397, 0.04465109282838447, 0.28881910534959937, -0.1525003179678664, -0.04012282618454525, -0.2957296896474584, -0.2177376873746869, -0.2597102196517563, 0.08841784500945656, -0.08877856493881342, -0.06821495262371922, 0.46295880364431513, 0.11852396056998432, 0.09215649783182593, 0.006465293271171432, 0.336200954156026, 0.13626726506100523, 0.03171189249648402, 0.024633492219320957, 0.2985008818038281, 0.16642856507909498, 0.06152366364138231, -0.2843403969096789, 0.02243741086891128, -0.04437601263265288] |
1,802.00111 | Faithful entanglement purification for high-capacity quantum
communication with two-photon four-qubit systems | As the hyperentanglement of photon systems presents lots of unique
opportunities in high-capacity quantum networking, the hyperentanglement
purification protocol (hyper-EPP) becomes a vital project work and the quality
of its accomplishment attracts much attention recently. Here we present the
first theoretical scheme of faithful hyper-EPP for nonlocal two-photon systems
in two degrees of freedom (DOFs) by constructing several fidelity-robust
quantum circuits for hyper-encoded photons. With this faithful hyper-EPP, the
bit-flip errors in both the polarization and spatial-mode DOFs can be
efficiently corrected and the maximal hyperentanglement in two DOFs could be in
principle achieved by performing the hyper-EPP multiple rounds. Moreover, the
fidelity-robust quantum circuits, parity-check quantum nondemolition detectors,
and SWAP gates make this hyper-EPP works faithfully as the errors coming from
practical scattering, in these quantum circuits, are converted into a
detectable failure rather than infidelity. Furthermore, this hyper-EPP can be
directly extended to purify photon systems entangled in single polarization or
spatial-mode DOF and that hyperentangled in polarization and
multiple-spatial-mode DOFs.
| quant-ph | as the hyperentanglement of photon systems presents lots of unique opportunities in highcapacity quantum networking the hyperentanglement purification protocol hyperepp becomes a vital project work and the quality of its accomplishment attracts much attention recently here we present the first theoretical scheme of faithful hyperepp for nonlocal twophoton systems in two degrees of freedom dofs by constructing several fidelityrobust quantum circuits for hyperencoded photons with this faithful hyperepp the bitflip errors in both the polarization and spatialmode dofs can be efficiently corrected and the maximal hyperentanglement in two dofs could be in principle achieved by performing the hyperepp multiple rounds moreover the fidelityrobust quantum circuits paritycheck quantum nondemolition detectors and swap gates make this hyperepp works faithfully as the errors coming from practical scattering in these quantum circuits are converted into a detectable failure rather than infidelity furthermore this hyperepp can be directly extended to purify photon systems entangled in single polarization or spatialmode dof and that hyperentangled in polarization and multiplespatialmode dofs | [['as', 'the', 'hyperentanglement', 'of', 'photon', 'systems', 'presents', 'lots', 'of', 'unique', 'opportunities', 'in', 'highcapacity', 'quantum', 'networking', 'the', 'hyperentanglement', 'purification', 'protocol', 'hyperepp', 'becomes', 'a', 'vital', 'project', 'work', 'and', 'the', 'quality', 'of', 'its', 'accomplishment', 'attracts', 'much', 'attention', 'recently', 'here', 'we', 'present', 'the', 'first', 'theoretical', 'scheme', 'of', 'faithful', 'hyperepp', 'for', 'nonlocal', 'twophoton', 'systems', 'in', 'two', 'degrees', 'of', 'freedom', 'dofs', 'by', 'constructing', 'several', 'fidelityrobust', 'quantum', 'circuits', 'for', 'hyperencoded', 'photons', 'with', 'this', 'faithful', 'hyperepp', 'the', 'bitflip', 'errors', 'in', 'both', 'the', 'polarization', 'and', 'spatialmode', 'dofs', 'can', 'be', 'efficiently', 'corrected', 'and', 'the', 'maximal', 'hyperentanglement', 'in', 'two', 'dofs', 'could', 'be', 'in', 'principle', 'achieved', 'by', 'performing', 'the', 'hyperepp', 'multiple', 'rounds', 'moreover', 'the', 'fidelityrobust', 'quantum', 'circuits', 'paritycheck', 'quantum', 'nondemolition', 'detectors', 'and', 'swap', 'gates', 'make', 'this', 'hyperepp', 'works', 'faithfully', 'as', 'the', 'errors', 'coming', 'from', 'practical', 'scattering', 'in', 'these', 'quantum', 'circuits', 'are', 'converted', 'into', 'a', 'detectable', 'failure', 'rather', 'than', 'infidelity', 'furthermore', 'this', 'hyperepp', 'can', 'be', 'directly', 'extended', 'to', 'purify', 'photon', 'systems', 'entangled', 'in', 'single', 'polarization', 'or', 'spatialmode', 'dof', 'and', 'that', 'hyperentangled', 'in', 'polarization', 'and', 'multiplespatialmode', 'dofs']] | [-0.15553399979037308, 0.1918480190925839, -0.04198610855254737, -0.007935270792277495, 0.02014771386770145, -0.26399924223891125, 0.06674826670432193, 0.39025545417793894, -0.2568797352079466, -0.2871982804206698, 0.048322235139997664, -0.27500962330696155, -0.10079835875746179, 0.22872635335427177, -0.08385074813118053, 0.131421453102401, 0.07064080040582672, -0.04248698741057009, -0.05126169933435952, -0.2650176169520607, 0.23820645896917056, 0.06151823177216165, 0.2814660922919968, 0.021725842440735152, 0.12686269465869046, 0.0451455761227499, 0.013499966611699114, -0.0435009645151689, -0.02144090600421399, 0.13688724398292285, 0.30985180963762105, 0.15517756951469108, 0.2437878434422555, -0.4460534363129885, -0.2313606464040448, 0.09896095903039728, 0.142810806875123, 0.2273116671486096, -0.03709210989756639, -0.3206429482502101, -0.005724708063516227, -0.22449733068252792, -0.04933105351450215, -0.11359362087194931, -0.04185883823266757, -0.07117955724682377, -0.24776426109971492, 0.04436609876172254, 0.02903405949473381, 0.033297396727702905, 0.09716775280104235, -0.0515726427225478, 0.006359768817611273, 0.10995577945250948, -0.13965620195973408, 0.003671592282301178, 0.12110774437516178, -0.11109308375092516, -0.22974268956484753, 0.3500618117439719, -0.012142174908435176, -0.2069845666029672, 0.10357316419681382, -0.11686738035436603, -0.10634218137008401, 0.10049942073429811, 0.17270310277283285, 0.1167475112286285, -0.1620378304315356, 0.012480851175679398, 0.032847391290637025, 0.2238211260065905, 0.08037374453595693, 0.24711770800369903, 0.18363688015174004, 0.08936822492887014, 0.07550822032920126, 0.18124493764590402, -0.044612163513805134, -0.1086727624477924, -0.2866608109709561, -0.19844839067722572, -0.22171285014552702, 0.09317603525295619, -0.05225521924487409, -0.0346004122636814, 0.39702732214321507, 0.14948631792787592, 0.09141260433104476, -0.0028825575447752605, 0.3809581142498778, 0.06531692330385763, 0.09974489323853415, 0.06354468802880472, 0.28084904781349423, 0.16949656162902993, 0.05254644701482857, -0.24658428716953587, 0.07348773622176603, -0.04450318897904465] |
1,802.00112 | Frequency Domain Properties and Fundamental Limits of Buffer-Feedback
Regulation in Biochemical Systems | Feedback regulation in biochemical systems is fundamental to homeostasis,
with failure causing disease or death. Recent work has found that cooperation
between feedback and buffering---the use of reservoirs of molecules to maintain
molecular concentrations---is often critical for biochemical regulation, and
that buffering can act as a derivative or lead controller. However, buffering
differs from derivative feedback in important ways: it is not typically limited
by stability constraints on the parallel feedback loop, for some signals it
acts instead as a low-pass filter, and it can change the location of
disturbances in the closed-loop system. Here, we propose a frequency-domain
framework for studying the regulatory properties of buffer-feedback systems. We
determine standard single-output closed-loop transfer functions and discuss
loop-shaping properties. We also derive novel fundamental limits for
buffer-feedback regulation, which show that buffering and removal processes can
reduce the fundamental limits on feedback regulation. We apply the framework to
study the regulation for glycolysis (anaerobic metabolism) with creatine
phosphate buffering.
| math.OC q-bio.MN | feedback regulation in biochemical systems is fundamental to homeostasis with failure causing disease or death recent work has found that cooperation between feedback and bufferingthe use of reservoirs of molecules to maintain molecular concentrationsis often critical for biochemical regulation and that buffering can act as a derivative or lead controller however buffering differs from derivative feedback in important ways it is not typically limited by stability constraints on the parallel feedback loop for some signals it acts instead as a lowpass filter and it can change the location of disturbances in the closedloop system here we propose a frequencydomain framework for studying the regulatory properties of bufferfeedback systems we determine standard singleoutput closedloop transfer functions and discuss loopshaping properties we also derive novel fundamental limits for bufferfeedback regulation which show that buffering and removal processes can reduce the fundamental limits on feedback regulation we apply the framework to study the regulation for glycolysis anaerobic metabolism with creatine phosphate buffering | [['feedback', 'regulation', 'in', 'biochemical', 'systems', 'is', 'fundamental', 'to', 'homeostasis', 'with', 'failure', 'causing', 'disease', 'or', 'death', 'recent', 'work', 'has', 'found', 'that', 'cooperation', 'between', 'feedback', 'and', 'bufferingthe', 'use', 'of', 'reservoirs', 'of', 'molecules', 'to', 'maintain', 'molecular', 'concentrationsis', 'often', 'critical', 'for', 'biochemical', 'regulation', 'and', 'that', 'buffering', 'can', 'act', 'as', 'a', 'derivative', 'or', 'lead', 'controller', 'however', 'buffering', 'differs', 'from', 'derivative', 'feedback', 'in', 'important', 'ways', 'it', 'is', 'not', 'typically', 'limited', 'by', 'stability', 'constraints', 'on', 'the', 'parallel', 'feedback', 'loop', 'for', 'some', 'signals', 'it', 'acts', 'instead', 'as', 'a', 'lowpass', 'filter', 'and', 'it', 'can', 'change', 'the', 'location', 'of', 'disturbances', 'in', 'the', 'closedloop', 'system', 'here', 'we', 'propose', 'a', 'frequencydomain', 'framework', 'for', 'studying', 'the', 'regulatory', 'properties', 'of', 'bufferfeedback', 'systems', 'we', 'determine', 'standard', 'singleoutput', 'closedloop', 'transfer', 'functions', 'and', 'discuss', 'loopshaping', 'properties', 'we', 'also', 'derive', 'novel', 'fundamental', 'limits', 'for', 'bufferfeedback', 'regulation', 'which', 'show', 'that', 'buffering', 'and', 'removal', 'processes', 'can', 'reduce', 'the', 'fundamental', 'limits', 'on', 'feedback', 'regulation', 'we', 'apply', 'the', 'framework', 'to', 'study', 'the', 'regulation', 'for', 'glycolysis', 'anaerobic', 'metabolism', 'with', 'creatine', 'phosphate', 'buffering']] | [-0.13896224166026278, 0.06791463553785317, -0.0179959736809495, 0.048123795678839086, -0.08689280463863285, -0.18200695417040297, 0.0911149388179183, 0.37418019218790916, -0.2878314242382804, -0.2645535594903894, 0.13680328052085375, -0.22299974521982574, -0.2508009582547651, 0.20605396527286257, -0.12179816400391921, 0.020814394331987826, 0.032886961216647775, 0.01272780672016163, 0.03231533317105664, -0.15426430051785803, 0.29171892927448834, 0.1020309291239227, 0.28416814836523224, 0.039676105173965616, 0.1308504375178487, -0.03675086965574132, 0.0017462677134561443, -0.059598439438418756, -0.10572909733516186, 0.0922175107095691, 0.26966467789945103, 0.16494106640137973, 0.30739274706330993, -0.47374148779819086, -0.29504348014992093, 0.11552649463316605, 0.1595156117853138, 0.1334770990483042, -0.07576260897030514, -0.2139144976292887, 0.07740318484964871, -0.18893736537185407, -0.05543554637941622, -0.09124949364772728, -0.014913751716695485, 0.07330268099266828, -0.29908361019897123, 0.08433109435173983, 0.05146946471124407, 0.053393054092603344, -0.09796423717296772, -0.0747741327523404, -0.05278349638646168, 0.20700097214730998, -0.0005035361605546167, -0.03981072769740657, 0.2542019095181698, -0.13290967849654056, -0.12701084018955308, 0.35673212331509396, -0.02132590017657006, -0.2356269363884724, 0.22943741441253693, -0.08974470255986577, -0.15957345789478672, 0.0928461361207742, 0.2150064013834532, 0.04606107462558054, -0.21607149060695402, 0.00353940011325082, 0.04861603206804683, 0.21200550604130952, 0.08417900676027902, 0.045471574633472386, 0.1587702997179041, 0.21248342686843488, 0.11763160014525056, 0.12771723069731267, -0.025068913634505963, -0.12369811615320823, -0.25550201745561113, -0.11216197787153144, -0.07518420476586588, 0.04948039257818187, -0.04629933295964879, -0.11967921614526741, 0.3375260910169492, 0.1409630556410599, 0.1318523457320313, 0.06253014018593897, 0.3194727999849185, 0.13450226676800559, 0.10385413289430641, 0.028168661363663212, 0.2154243563191079, 0.11769977142647539, 0.10811691052851177, -0.30529464102695664, 0.15382304059476742, 0.009771977444348346] |
1,802.00113 | Self-error-corrected hyperparallel photonic quantum computation working
with both the polarization and the spatial-mode degrees of freedom | Usually, the hyperparallel quantum computation can speed up quantum
computing, reduce the quantum resource consumed largely, resist to noise, and
simplify the storage of quantum information. Here, we present the first scheme
for the self-error-corrected hyperparallel photonic quantum computation working
with both the polarization and the spatial-mode degrees of freedom of photon
systems simultaneously. It can prevent bit-flip errors from happening with an
imperfect nonlinear interaction in the nearly realistic condition. We give the
way to design the universal hyperparallel photonic quantum controlled-NOT
(CNOT) gate on a two-photon system, resorting to the nonlinear interaction
between the circularly polarized photon and the electron spin in the quantum
dot in a double-sided microcavity system, by taking the imperfect interaction
in the nearly realistic condition into account. Its self-error-corrected
pattern prevents the bit-flip errors from happening in the hyperparallel
quantum CNOT gate, guarantees the robust fidelity, and relaxes the requirement
for its experiment. Meanwhile, this scheme works in a failure-heralded way.
Also, we generalize this approach to achieve the self-error-corrected
hyperparallel quantum CNOT$^N$ gate working on a multiple-photon system. These
good features make this scheme more useful in the photonic quantum computation
and quantum communication in the future.
| quant-ph | usually the hyperparallel quantum computation can speed up quantum computing reduce the quantum resource consumed largely resist to noise and simplify the storage of quantum information here we present the first scheme for the selferrorcorrected hyperparallel photonic quantum computation working with both the polarization and the spatialmode degrees of freedom of photon systems simultaneously it can prevent bitflip errors from happening with an imperfect nonlinear interaction in the nearly realistic condition we give the way to design the universal hyperparallel photonic quantum controllednot cnot gate on a twophoton system resorting to the nonlinear interaction between the circularly polarized photon and the electron spin in the quantum dot in a doublesided microcavity system by taking the imperfect interaction in the nearly realistic condition into account its selferrorcorrected pattern prevents the bitflip errors from happening in the hyperparallel quantum cnot gate guarantees the robust fidelity and relaxes the requirement for its experiment meanwhile this scheme works in a failureheralded way also we generalize this approach to achieve the selferrorcorrected hyperparallel quantum cnotn gate working on a multiplephoton system these good features make this scheme more useful in the photonic quantum computation and quantum communication in the future | [['usually', 'the', 'hyperparallel', 'quantum', 'computation', 'can', 'speed', 'up', 'quantum', 'computing', 'reduce', 'the', 'quantum', 'resource', 'consumed', 'largely', 'resist', 'to', 'noise', 'and', 'simplify', 'the', 'storage', 'of', 'quantum', 'information', 'here', 'we', 'present', 'the', 'first', 'scheme', 'for', 'the', 'selferrorcorrected', 'hyperparallel', 'photonic', 'quantum', 'computation', 'working', 'with', 'both', 'the', 'polarization', 'and', 'the', 'spatialmode', 'degrees', 'of', 'freedom', 'of', 'photon', 'systems', 'simultaneously', 'it', 'can', 'prevent', 'bitflip', 'errors', 'from', 'happening', 'with', 'an', 'imperfect', 'nonlinear', 'interaction', 'in', 'the', 'nearly', 'realistic', 'condition', 'we', 'give', 'the', 'way', 'to', 'design', 'the', 'universal', 'hyperparallel', 'photonic', 'quantum', 'controllednot', 'cnot', 'gate', 'on', 'a', 'twophoton', 'system', 'resorting', 'to', 'the', 'nonlinear', 'interaction', 'between', 'the', 'circularly', 'polarized', 'photon', 'and', 'the', 'electron', 'spin', 'in', 'the', 'quantum', 'dot', 'in', 'a', 'doublesided', 'microcavity', 'system', 'by', 'taking', 'the', 'imperfect', 'interaction', 'in', 'the', 'nearly', 'realistic', 'condition', 'into', 'account', 'its', 'selferrorcorrected', 'pattern', 'prevents', 'the', 'bitflip', 'errors', 'from', 'happening', 'in', 'the', 'hyperparallel', 'quantum', 'cnot', 'gate', 'guarantees', 'the', 'robust', 'fidelity', 'and', 'relaxes', 'the', 'requirement', 'for', 'its', 'experiment', 'meanwhile', 'this', 'scheme', 'works', 'in', 'a', 'failureheralded', 'way', 'also', 'we', 'generalize', 'this', 'approach', 'to', 'achieve', 'the', 'selferrorcorrected', 'hyperparallel', 'quantum', 'cnotn', 'gate', 'working', 'on', 'a', 'multiplephoton', 'system', 'these', 'good', 'features', 'make', 'this', 'scheme', 'more', 'useful', 'in', 'the', 'photonic', 'quantum', 'computation', 'and', 'quantum', 'communication', 'in', 'the', 'future']] | [-0.1671311127648018, 0.1631032470355101, -0.06264946180506768, 0.009707641901829584, 0.01213027809027563, -0.24306394584438343, 0.09853978137427777, 0.38738428576188305, -0.272460695264446, -0.30499884195944266, 0.033114536409628206, -0.2262686420656702, -0.12577811622970445, 0.24493564035106508, -0.07997666135713231, 0.13642729841681786, 0.053560584322228204, -0.02110150157126545, -0.06798196628622209, -0.25563514412144306, 0.24397428027822254, 0.0718532428947649, 0.30779345415127246, 0.05144013012904153, 0.10889327454298055, 0.03965738670987323, 0.03438688763911918, -0.07633310468587542, -0.07278524013190926, 0.09903797051939303, 0.24705130225765262, 0.06879676966276502, 0.2451794951613703, -0.47775396598030095, -0.17165862688061256, 0.0562204714331274, 0.10121165724336097, 0.2282690857512963, -0.04398153242306757, -0.32743166914991456, 0.029013742570622964, -0.20275827924783674, -0.06764678041079115, -0.09094835888944841, -0.04705046970696415, -0.06797174611635545, -0.23848966403425204, 0.03608930554018366, 0.07466308994424092, 0.0037920532622639997, 0.043025092177160586, 0.009849862800549156, 0.04787745773840522, 0.13268508768635634, -0.12737979401636462, 0.00929901492480343, 0.16438852294126208, -0.14669969317218567, -0.17389569536498095, 0.37685801495600085, -0.013387784144691543, -0.1924935168486542, 0.11369769127286701, -0.10125223595294329, -0.056266948226067225, 0.09268903790205872, 0.16482081637027737, 0.07128581136870416, -0.1261350361586891, 0.0784436951260507, 0.04912971754900995, 0.21784696575505128, 0.05030043849207635, 0.16643907909566258, 0.1970381019926519, 0.12571786448041006, 0.0903981287138527, 0.17477075323834051, -0.07554669241623596, -0.15833035213245475, -0.308003208069179, -0.19037145949958056, -0.19011857360601425, 0.08972637556068638, -0.0713991005171345, -0.12075457349238637, 0.38635467004272295, 0.16750981613759608, 0.12771739601278242, 0.006321702920047596, 0.379321278801545, 0.12573453705091936, 0.08033081353521408, 0.06663760113399572, 0.25052719715731747, 0.1662687259434283, 0.0878573134927552, -0.2854145336654906, 0.04637183573753259, -0.04034159363397045] |
1,802.00114 | Low Complexity Time Domain Semi-Blind MIMO-OFDM Channel Estimation Using
Adaptive Bussgang Algorithm | In this paper, a low complexity time domain semi-blind algorithm is proposed
to estimate and track the time varying MIMO OFDM channels. First, the proposed
least mean squares (LMS) based algorithm is developed for the training mode and
then is extended for the blind mode of the operation by combining with the
decision direction (DD) or adaptive Bussgang algorithm (ABA) techniques. In the
blind mode, because of decision errors, a smaller step size is considered for
the LMS algorithm and the channel estimation is run a few times to improve its
precision. In each round of the estimation in the blind mode, the step size is
decreased to form some kind of annealing. Both DD LMS and ABA LMS techniques
are simulated and compared to the full training case and MSE of channel
estimation error is considered as comparison criterion. It is shown for 2x4 DD
LMS and for 4x4 ABA LMS algorithms present near full training case estimation
error. Of course in some scenarios the former proposed technique performs
better and in other scenarios the latter is better and therefore combine of it
can be very interesting in all channel conditions.
| eess.SP | in this paper a low complexity time domain semiblind algorithm is proposed to estimate and track the time varying mimo ofdm channels first the proposed least mean squares lms based algorithm is developed for the training mode and then is extended for the blind mode of the operation by combining with the decision direction dd or adaptive bussgang algorithm aba techniques in the blind mode because of decision errors a smaller step size is considered for the lms algorithm and the channel estimation is run a few times to improve its precision in each round of the estimation in the blind mode the step size is decreased to form some kind of annealing both dd lms and aba lms techniques are simulated and compared to the full training case and mse of channel estimation error is considered as comparison criterion it is shown for 2x4 dd lms and for 4x4 aba lms algorithms present near full training case estimation error of course in some scenarios the former proposed technique performs better and in other scenarios the latter is better and therefore combine of it can be very interesting in all channel conditions | [['in', 'this', 'paper', 'a', 'low', 'complexity', 'time', 'domain', 'semiblind', 'algorithm', 'is', 'proposed', 'to', 'estimate', 'and', 'track', 'the', 'time', 'varying', 'mimo', 'ofdm', 'channels', 'first', 'the', 'proposed', 'least', 'mean', 'squares', 'lms', 'based', 'algorithm', 'is', 'developed', 'for', 'the', 'training', 'mode', 'and', 'then', 'is', 'extended', 'for', 'the', 'blind', 'mode', 'of', 'the', 'operation', 'by', 'combining', 'with', 'the', 'decision', 'direction', 'dd', 'or', 'adaptive', 'bussgang', 'algorithm', 'aba', 'techniques', 'in', 'the', 'blind', 'mode', 'because', 'of', 'decision', 'errors', 'a', 'smaller', 'step', 'size', 'is', 'considered', 'for', 'the', 'lms', 'algorithm', 'and', 'the', 'channel', 'estimation', 'is', 'run', 'a', 'few', 'times', 'to', 'improve', 'its', 'precision', 'in', 'each', 'round', 'of', 'the', 'estimation', 'in', 'the', 'blind', 'mode', 'the', 'step', 'size', 'is', 'decreased', 'to', 'form', 'some', 'kind', 'of', 'annealing', 'both', 'dd', 'lms', 'and', 'aba', 'lms', 'techniques', 'are', 'simulated', 'and', 'compared', 'to', 'the', 'full', 'training', 'case', 'and', 'mse', 'of', 'channel', 'estimation', 'error', 'is', 'considered', 'as', 'comparison', 'criterion', 'it', 'is', 'shown', 'for', '2x4', 'dd', 'lms', 'and', 'for', '4x4', 'aba', 'lms', 'algorithms', 'present', 'near', 'full', 'training', 'case', 'estimation', 'error', 'of', 'course', 'in', 'some', 'scenarios', 'the', 'former', 'proposed', 'technique', 'performs', 'better', 'and', 'in', 'other', 'scenarios', 'the', 'latter', 'is', 'better', 'and', 'therefore', 'combine', 'of', 'it', 'can', 'be', 'very', 'interesting', 'in', 'all', 'channel', 'conditions']] | [-0.10254235706149, 0.01748216445654786, -0.07695268843235681, 0.06697568894257226, -0.05216104463105845, -0.235348613835716, 0.051641087221772373, 0.42333816112174344, -0.25548079846582067, -0.2917104708952441, 0.18407000155821152, -0.2248567446586094, -0.16415188793356114, 0.17830443270334703, -0.09654627073602266, 0.10328387723924, 0.11050207519171333, 0.046961844876932446, -0.07699738297439278, -0.3173219877765708, 0.19675816880044295, 0.09179968383493058, 0.312644372292804, -0.045163524893117334, 0.0880320320344481, 0.028365475367233255, -0.027236066040738176, -0.024026550992857665, -0.07775194058437289, 0.038780154866496254, 0.27359444595640525, 0.13836110985963992, 0.29863701358408434, -0.36623660230543464, -0.17449862273921704, 0.0915689320712166, 0.20898255620947262, 0.10523074170487234, -0.008041299778293856, -0.2540859047100336, 0.1299336761755209, -0.11853615321645823, -0.03427179414090157, -0.018127531055749085, -0.04719757754234403, -0.014019397636729991, -0.3454696986785469, 0.08602883844681249, 0.06525948045479406, 0.03621181684623783, -0.021301481184612687, -0.2120501924388615, 0.06037537501833867, 0.10850136685015362, 0.03627261413203087, 0.04696235465235077, 0.08824349039544661, -0.10013589601173105, -0.11663438067383443, 0.35120689220517914, -0.048151028924015314, -0.2375813278243489, 0.17012509639092363, -0.06774938813153615, -0.08681485475972295, 0.15394349299458554, 0.21204374138627222, 0.09223895390501487, -0.15669548807879133, 0.0347011139345644, 0.02840203003628024, 0.186948464771073, 0.03339260040471951, 0.04188292269827798, 0.08263551368630336, 0.24781753007967686, 0.10849615596816875, 0.12481451384731675, -0.16172639870395264, -0.08561288515193155, -0.22062517199568296, -0.1780650917735329, -0.20315431993367383, -0.09127928285549085, -0.07628866637416347, -0.1299283965883357, 0.3895484590017683, 0.147873121786688, 0.13890321569730682, 0.0950116238091141, 0.3667483188692131, 0.10962739287242584, 0.08364774238119328, 0.09125213927715474, 0.22268845571579732, 0.11468797038469347, 0.10300822428447039, -0.23947965782159977, 0.07883138516141723, 0.03661674253332118] |
1,802.00115 | Universal single-qubit non-adiabatic holonomic quantum gates in
optomechanical system | The non-adiabatic holonomic quantum computation with the advantages of fast
and robustness attracts widespread attention in recent years. Here, we propose
the first scheme for realizing universal single-qubit gates based on an
optomechanical system working with the non-adiabatic geometric phases. Our
quantum gates are robust to the control errors and the parameter fluctuations,
and have unique functions to achieve the quantum state transfer and
entanglement generation between cavities. We discuss the corresponding
experimental parameters and give some simulations. Our scheme may have the
practical applications in quantum computation and quantum information
processing.
| quant-ph | the nonadiabatic holonomic quantum computation with the advantages of fast and robustness attracts widespread attention in recent years here we propose the first scheme for realizing universal singlequbit gates based on an optomechanical system working with the nonadiabatic geometric phases our quantum gates are robust to the control errors and the parameter fluctuations and have unique functions to achieve the quantum state transfer and entanglement generation between cavities we discuss the corresponding experimental parameters and give some simulations our scheme may have the practical applications in quantum computation and quantum information processing | [['the', 'nonadiabatic', 'holonomic', 'quantum', 'computation', 'with', 'the', 'advantages', 'of', 'fast', 'and', 'robustness', 'attracts', 'widespread', 'attention', 'in', 'recent', 'years', 'here', 'we', 'propose', 'the', 'first', 'scheme', 'for', 'realizing', 'universal', 'singlequbit', 'gates', 'based', 'on', 'an', 'optomechanical', 'system', 'working', 'with', 'the', 'nonadiabatic', 'geometric', 'phases', 'our', 'quantum', 'gates', 'are', 'robust', 'to', 'the', 'control', 'errors', 'and', 'the', 'parameter', 'fluctuations', 'and', 'have', 'unique', 'functions', 'to', 'achieve', 'the', 'quantum', 'state', 'transfer', 'and', 'entanglement', 'generation', 'between', 'cavities', 'we', 'discuss', 'the', 'corresponding', 'experimental', 'parameters', 'and', 'give', 'some', 'simulations', 'our', 'scheme', 'may', 'have', 'the', 'practical', 'applications', 'in', 'quantum', 'computation', 'and', 'quantum', 'information', 'processing']] | [-0.1580909692211603, 0.14242579530859392, -0.06560311113160265, -0.025088295057092026, -0.01939852962412102, -0.20518582787000292, 0.06584370397183154, 0.4063129771662795, -0.26477906552305364, -0.27991331049808016, 0.07707110238856252, -0.2270932525482393, -0.16708136117591968, 0.2875742615079102, -0.09999398855712649, 0.17359743075465542, 0.07276138778188793, -0.02419638134913681, -0.1139693456618419, -0.2659818640006605, 0.257148808222669, 0.049074936646755545, 0.3213302985228517, 0.05517025580553783, 0.12456716482689523, -0.03814779538863703, 0.029598989103839773, -0.08730719097302822, -0.14111915816876874, 0.1551478693170635, 0.25560781411553285, 0.09277130350085866, 0.28056912120107724, -0.4737932529786359, -0.2258906363479226, 0.07533008655857133, 0.0935556163565944, 0.21513169854069533, -0.11273015525986683, -0.31208824669010937, 0.046356567272754466, -0.19430118200936072, -0.04272488854906481, -0.21660968143845347, 0.036901873065685126, -0.008310410998883131, -0.2331261633814353, 0.035129788706241095, 0.035043627407503664, 0.03637534273919933, 0.046396419011137405, -0.03708057669775925, 0.06483545391212987, 0.15283366484167663, -0.0734045612524547, -0.0031620489405569338, 0.16470804205101044, -0.12197937041460334, -0.21928438553890295, 0.35581325760880567, 0.011327332277964477, -0.18300536260737674, 0.1753030842316904, -0.06917933680882055, -0.11427287068521685, 0.02563602989539504, 0.15009101507324807, 0.07366468917335504, -0.06726225393282695, 0.0857854437136152, 0.06593081980700725, 0.16032384536937688, -0.010707998045963113, 0.17847263587274306, 0.19775035611920708, 0.12546980640162592, 0.06451141653056054, 0.16367598852324908, -0.09425816987894232, -0.2119125640930851, -0.30520232384214585, -0.18841179895579166, -0.1931197988577997, 0.04580902486391689, -0.07514956418795603, -0.14162978955099118, 0.42595130798137054, 0.20334419804503737, 0.16564211697297412, 0.022705941536000668, 0.36340102869207447, 0.1354192462775087, 0.05599271924660096, 0.08538295924866005, 0.26621542567970563, 0.17658969926465626, 0.07360579772427192, -0.2895248203497866, 0.03658215623252782, 0.0011995622746484435] |
1,802.00116 | Four-dimensional Painlev\'e-type difference equations | We focus on Fuchsian equations with four accessory parameters and three
singular points. We see that the Fuchsian equations admit a "degeneration
scheme" in some sense, which is expected to give rise to a degeneration scheme
of discrete isomodromic deformation equations with four-dimensional phase
space. We compute an example of discrete isomonodromic deformation equations of
a certain Fuchsian equation.
| math.CA math-ph math.MP | we focus on fuchsian equations with four accessory parameters and three singular points we see that the fuchsian equations admit a degeneration scheme in some sense which is expected to give rise to a degeneration scheme of discrete isomodromic deformation equations with fourdimensional phase space we compute an example of discrete isomonodromic deformation equations of a certain fuchsian equation | [['we', 'focus', 'on', 'fuchsian', 'equations', 'with', 'four', 'accessory', 'parameters', 'and', 'three', 'singular', 'points', 'we', 'see', 'that', 'the', 'fuchsian', 'equations', 'admit', 'a', 'degeneration', 'scheme', 'in', 'some', 'sense', 'which', 'is', 'expected', 'to', 'give', 'rise', 'to', 'a', 'degeneration', 'scheme', 'of', 'discrete', 'isomodromic', 'deformation', 'equations', 'with', 'fourdimensional', 'phase', 'space', 'we', 'compute', 'an', 'example', 'of', 'discrete', 'isomonodromic', 'deformation', 'equations', 'of', 'a', 'certain', 'fuchsian', 'equation']] | [-0.21996262441549835, 0.06194896155648166, -0.14932644877839704, 0.027606455394436187, -0.1535696359832996, -0.1755483700363929, -0.049171683763892485, 0.26370498884854643, -0.29358992340235873, -0.20636363280937076, 0.11003028052048115, -0.27167106244777295, -0.2628943255685013, 0.2166831087770647, -0.14124683408741037, 0.07524951836415406, 0.04948842723990373, 0.061293115678789284, -0.17365110191468405, -0.28139464650303125, 0.4168512731919001, -0.11207178207756631, 0.2112984719108148, -0.026871298841232884, 0.2116416341400352, -0.057219293474316084, -0.012951120348839924, -0.0422112454006906, -0.19762492886855335, 0.06201272921090753, 0.30930447668350974, 0.0031397091465648905, 0.17887073010206223, -0.4130757740128721, -0.15594116014685352, 0.14847652631779684, 0.1302174652589421, 0.11821488002596166, -0.018983252115692174, -0.25317914427482874, 0.0034679572804477707, -0.15718613243822394, -0.2497269282727663, -0.10710000050864343, 0.002690003325777321, 0.04245782889233067, -0.21904557397396401, 0.03746714571426655, 0.055922710979036214, 0.04090449520675787, -0.13628842495381832, -0.031767945182670294, -0.0412821598704262, 0.026536237560854905, 0.02950200116952303, -0.0012104971864228618, 0.044897865728828416, -0.0789986177716918, -0.06610057509608631, 0.4228622281546544, -0.054016134444752645, -0.33160926684223374, 0.0941044854578273, -0.10367936514928167, -0.19452592032030225, 0.20103798777764215, 0.18691994977215753, 0.16774549010884146, -0.07479155839196053, 0.12781515685291478, -0.02536230113614222, 0.1134469730073008, 0.10199392434402273, -0.04798901337198913, 0.06795815922769494, 0.10600181887375898, 0.08383369331794052, 0.11710287940463629, -0.003493844908822713, -0.1345122509860787, -0.415520294473089, -0.1671328218653798, -0.049134150468583764, 0.1633428202797498, -0.1420800131662841, -0.2573674434860205, 0.35794763509944333, 0.06183997024621429, 0.20013835207270136, 0.05353556176976718, 0.18233203109161095, 0.196786028991357, 0.0073293647889433235, 0.03153921540922903, 0.13812051441546547, 0.13882736588731923, -0.0036695626130777187, -0.22914666676861717, -0.08295997409631722, 0.28233241635085693] |
1,802.00117 | The time geography of segregation during working hours | Understanding segregation is essential to develop planning tools for building
more inclusive cities. Theoretically, segregation at the work place has been
described as lower compared to residential segregation given the importance of
skill complementarity among other productive factors shaping the economies of
cities. This paper tackles segregation during working hours from a dynamical
perspective by focusing on the movement of urbanites across the city. In
contrast to measuring residential patterns of segregation, we used mobile phone
data to infer home-work trajectory net- works and apply a community detection
algorithm to the example city of Santiago, Chile. We then describe
qualitatively and quantitatively outlined communities, in terms of their socio
eco- nomic composition. We then evaluate segregation for each of these
communities as the probability that a person from a specific community will
interact with a co-worker from the same commu- nity. Finally, we compare these
results with simulations where a new work location is set for each real user,
following the empirical probability distributions of home-work distances and
angles of direction for each community. Methodologically, this study shows that
segregation during working hours for Santiago is unexpectedly high for most of
the city with the exception of its central and business district. In fact, the
only community that is not statistically segregated corresponds to the downtown
area of Santiago, described as a zone of encounter and integration across the
city.
| cs.SI stat.AP | understanding segregation is essential to develop planning tools for building more inclusive cities theoretically segregation at the work place has been described as lower compared to residential segregation given the importance of skill complementarity among other productive factors shaping the economies of cities this paper tackles segregation during working hours from a dynamical perspective by focusing on the movement of urbanites across the city in contrast to measuring residential patterns of segregation we used mobile phone data to infer homework trajectory net works and apply a community detection algorithm to the example city of santiago chile we then describe qualitatively and quantitatively outlined communities in terms of their socio eco nomic composition we then evaluate segregation for each of these communities as the probability that a person from a specific community will interact with a coworker from the same commu nity finally we compare these results with simulations where a new work location is set for each real user following the empirical probability distributions of homework distances and angles of direction for each community methodologically this study shows that segregation during working hours for santiago is unexpectedly high for most of the city with the exception of its central and business district in fact the only community that is not statistically segregated corresponds to the downtown area of santiago described as a zone of encounter and integration across the city | [['understanding', 'segregation', 'is', 'essential', 'to', 'develop', 'planning', 'tools', 'for', 'building', 'more', 'inclusive', 'cities', 'theoretically', 'segregation', 'at', 'the', 'work', 'place', 'has', 'been', 'described', 'as', 'lower', 'compared', 'to', 'residential', 'segregation', 'given', 'the', 'importance', 'of', 'skill', 'complementarity', 'among', 'other', 'productive', 'factors', 'shaping', 'the', 'economies', 'of', 'cities', 'this', 'paper', 'tackles', 'segregation', 'during', 'working', 'hours', 'from', 'a', 'dynamical', 'perspective', 'by', 'focusing', 'on', 'the', 'movement', 'of', 'urbanites', 'across', 'the', 'city', 'in', 'contrast', 'to', 'measuring', 'residential', 'patterns', 'of', 'segregation', 'we', 'used', 'mobile', 'phone', 'data', 'to', 'infer', 'homework', 'trajectory', 'net', 'works', 'and', 'apply', 'a', 'community', 'detection', 'algorithm', 'to', 'the', 'example', 'city', 'of', 'santiago', 'chile', 'we', 'then', 'describe', 'qualitatively', 'and', 'quantitatively', 'outlined', 'communities', 'in', 'terms', 'of', 'their', 'socio', 'eco', 'nomic', 'composition', 'we', 'then', 'evaluate', 'segregation', 'for', 'each', 'of', 'these', 'communities', 'as', 'the', 'probability', 'that', 'a', 'person', 'from', 'a', 'specific', 'community', 'will', 'interact', 'with', 'a', 'coworker', 'from', 'the', 'same', 'commu', 'nity', 'finally', 'we', 'compare', 'these', 'results', 'with', 'simulations', 'where', 'a', 'new', 'work', 'location', 'is', 'set', 'for', 'each', 'real', 'user', 'following', 'the', 'empirical', 'probability', 'distributions', 'of', 'homework', 'distances', 'and', 'angles', 'of', 'direction', 'for', 'each', 'community', 'methodologically', 'this', 'study', 'shows', 'that', 'segregation', 'during', 'working', 'hours', 'for', 'santiago', 'is', 'unexpectedly', 'high', 'for', 'most', 'of', 'the', 'city', 'with', 'the', 'exception', 'of', 'its', 'central', 'and', 'business', 'district', 'in', 'fact', 'the', 'only', 'community', 'that', 'is', 'not', 'statistically', 'segregated', 'corresponds', 'to', 'the', 'downtown', 'area', 'of', 'santiago', 'described', 'as', 'a', 'zone', 'of', 'encounter', 'and', 'integration', 'across', 'the', 'city']] | [-0.05904678740638733, 0.09277590674250141, -0.08948237949925099, 0.0861330053762925, -0.06420471592553026, -0.10675257225222212, 0.08456658193761923, 0.3738653122594482, -0.21600765434733035, -0.3451391427681716, 0.08057512889826556, -0.29215567995050695, -0.15992938824357433, 0.1784858274326676, -0.1082167231810704, -0.015112491649026134, 0.08787781525027465, 0.04031881069960563, 0.010526031085183811, -0.24386375641098998, 0.30266769974402624, 0.06938066393578131, 0.3074225613882095, 0.05958729291019712, 0.07980196885897353, -0.006394637255908221, -0.0559179802055536, 0.030255764373067536, -0.10570600993924018, 0.15347401571476407, 0.32464988802339095, 0.17435049665622054, 0.32071449210368946, -0.4065428028504054, -0.18173020554904565, 0.07456418634811007, 0.14667444344989858, 0.05679948085085734, -0.04399411791605975, -0.3010626774354789, 0.07756332921327844, -0.20113954101403228, -0.13512919378863125, -0.006772494790774337, 0.045182165889919065, 0.023971346355035183, -0.22485175704085186, 0.05482744432096329, -0.0017325721787449112, 0.11471835741152366, -0.05721071428413045, -0.11066525056958199, -0.03631054981215449, 0.2369511066573435, 0.05822468921695346, -0.009643774153868946, 0.17093188513740243, -0.11205788987369983, -0.12209733944843736, 0.39814557603089623, -0.0011892001669988723, -0.1187992508047293, 0.205052992141103, -0.15901122096642084, -0.16785220797745543, 0.048777235214896665, 0.23655064431276465, 0.07066723870383085, -0.17498244687139, 0.00734170379502374, -0.04653097109628122, 0.14926170018959073, 0.09836937015234869, -0.0560869890828862, 0.21663163926068432, 0.22607325934376077, 0.10275653299718294, 0.09542709599956747, -0.10915297269719049, -0.13990317957001952, -0.22506589473025024, -0.15094422060677684, -0.16052932496970976, -0.01906017806239808, -0.0854793449629812, -0.1255169160349556, 0.41402627492993416, 0.1726649858674934, 0.16752504376191818, 0.06369628200691455, 0.25207273396173197, 0.03305333838069233, 0.058855307849099564, 0.06876517729266964, 0.1788190096420677, 0.01755339729399502, 0.18704491191780553, -0.1724443070626493, 0.14134801124843457, 0.01077491233305058] |
1,802.00118 | Continuous frames and the Kadison-Singer problem | In this paper we survey a recent progress on continuous frames inspired by
the solution of the Kadison-Singer problem by Marcus, Spielman, and Srivastava.
We present an extension of Lyapunov's theorem for discrete frames due to
Akemann and Weaver and a similar extension for continuous frames by the author.
We also outline a solution of the discretization problem, which was originally
posed by Ali, Antoine, and Gazeau, and recently solved by Freeman and Speegle.
| math.FA | in this paper we survey a recent progress on continuous frames inspired by the solution of the kadisonsinger problem by marcus spielman and srivastava we present an extension of lyapunovs theorem for discrete frames due to akemann and weaver and a similar extension for continuous frames by the author we also outline a solution of the discretization problem which was originally posed by ali antoine and gazeau and recently solved by freeman and speegle | [['in', 'this', 'paper', 'we', 'survey', 'a', 'recent', 'progress', 'on', 'continuous', 'frames', 'inspired', 'by', 'the', 'solution', 'of', 'the', 'kadisonsinger', 'problem', 'by', 'marcus', 'spielman', 'and', 'srivastava', 'we', 'present', 'an', 'extension', 'of', 'lyapunovs', 'theorem', 'for', 'discrete', 'frames', 'due', 'to', 'akemann', 'and', 'weaver', 'and', 'a', 'similar', 'extension', 'for', 'continuous', 'frames', 'by', 'the', 'author', 'we', 'also', 'outline', 'a', 'solution', 'of', 'the', 'discretization', 'problem', 'which', 'was', 'originally', 'posed', 'by', 'ali', 'antoine', 'and', 'gazeau', 'and', 'recently', 'solved', 'by', 'freeman', 'and', 'speegle']] | [-0.04866187684741374, 0.015390860315017414, -0.08697040002742731, 0.04048921245722906, -0.07660635147948523, -0.09711181698996271, 0.06954565198267684, 0.31524083441173706, -0.2576438394450658, -0.31555319710861185, 0.15782045806928008, -0.23483557817903725, -0.19648570876342017, 0.16069621548711047, -0.20523988038326638, 0.1091811058891786, 0.04411542510953606, -0.09325749434631418, -0.019742702288125212, -0.28530955676467634, 0.3253198236327719, 0.08702813935264744, 0.1962850968655501, 0.06913016275880304, 0.132454593606117, 0.06149400794576552, -0.11279673061358768, 0.02740957698866574, -0.14860868980680164, 0.17041504322677045, 0.21839248371386044, 0.1364484897726593, 0.3276725536262667, -0.36440408881753683, -0.2005719355987133, 0.045633437250413605, 0.1011106916136939, 0.09869574463919963, -0.10558921487953174, -0.3835879268275725, 0.08378401406839289, -0.1714861991790098, -0.09549263793647893, -0.05090970290208084, 0.10822160542011261, 0.0025176216495802275, -0.2514141686638263, 0.07378009374126024, 0.16174904970653556, 0.06084808663188203, -0.09618155553156661, -0.06626325569467971, 0.08834213208457506, 0.02247667100557403, 0.018798595407625306, 0.10273374761832324, -0.055861925479729437, -0.02670950467408811, -0.15821085899212473, 0.3460997616796679, -0.09383994865709462, -0.17557291173363557, 0.14038658952592192, -0.03935208758716849, -0.14337019134010817, 0.045454303962115604, 0.10063449336165511, 0.1690675116811149, -0.16445790353935916, 0.18246459477813914, -0.13324847056001826, 0.0805432128191397, 0.18723430060403976, -0.08973613669592384, 0.09951594791601638, 0.09492586549321139, 0.06672327409221514, 0.12491010428985229, 0.004477899328088136, -0.07933355158673146, -0.22401132854960254, -0.18293736094445293, -0.20248222604041566, 0.022979413533608453, 0.013615035446835807, -0.06076952064334339, 0.40150270837585667, 0.108530720982172, 0.19493924432773949, 0.08211725671001635, 0.22202273945298953, 0.12346949491876404, -0.0010190564774077487, 0.09801203981545326, 0.1937457135614209, 0.19877030316274613, 0.1685121714647205, -0.1759739820467862, -0.007803768767484439, 0.22799368989276322] |
1,802.00119 | Convex Pentagons with Positive Heesch Number | We found convex pentagons whose Heesch number is equal to one, and which
admit an edge-to-edge corona. In this manuscript, we present a new
classification of these convex pentagons.
| math.MG | we found convex pentagons whose heesch number is equal to one and which admit an edgetoedge corona in this manuscript we present a new classification of these convex pentagons | [['we', 'found', 'convex', 'pentagons', 'whose', 'heesch', 'number', 'is', 'equal', 'to', 'one', 'and', 'which', 'admit', 'an', 'edgetoedge', 'corona', 'in', 'this', 'manuscript', 'we', 'present', 'a', 'new', 'classification', 'of', 'these', 'convex', 'pentagons']] | [-0.1209684738182816, 0.10214573715397976, -0.019900022684757053, 0.00764623546475095, -0.0962871635525391, -0.139797270121374, 0.012026557357628542, 0.40604736514646433, -0.2585275810340355, -0.23731423766705498, 0.09780591415996052, -0.3010386190666207, -0.19287825348497978, 0.10594168382472005, -0.1578403610479215, 0.040254869835515475, 0.02409886006779712, 0.03670608464243083, -0.04627655308436731, -0.3561083796466219, 0.2774604336711867, -0.09265925141115641, 0.14183387202050152, 0.08291602674229391, 0.0776829829054146, -0.028139318146839225, 0.01568883060124414, 0.1267336242800129, -0.19937124035867124, 0.2076349644761147, 0.2557256967471591, 0.1291461611359284, 0.23108180740783954, -0.4533247907228511, -0.08445388409469662, 0.14776609593938136, 0.16380221409530477, 0.04998783781273483, -0.03190669394901086, -0.16654590697124086, 0.06398977098408444, -0.12192943904163508, -0.10967565026005795, -0.049437035581675066, -0.0006730444087036725, -0.0286958661765374, -0.20037077865081615, 0.023568600400126184, 0.16852934792003563, 0.06066311125097604, -0.07684467773250273, -0.1596795697535934, -0.0013892541254131958, 0.040467837343698944, 0.04695636942051351, 0.09282974201928952, 0.05470382741748773, -0.022302312639959413, -0.15910945309261823, 0.3435109345691985, 0.06985973859013155, -0.2610306974243501, 0.21399789971524272, -0.159188875414688, -0.1889002505561401, 0.1831843115003972, 0.18249948977910238, 0.19859479181468487, -0.18009786718878254, 0.023324942423014677, -0.16350122425576735, 0.13687114366169634, 0.11663434317271257, -0.020007822726821077, 0.22369473042159244, 0.1186095348334518, 0.17319119405322547, 0.24354713050455884, -0.06847597199395813, -0.03150211322795728, -0.3164525665342808, -0.15359960465916786, -0.17730347147404119, 0.0785495807127706, -0.07182994226328948, -0.26776638858277224, 0.37844242822531415, 0.014007549604465222, 0.18011345534489073, 0.09844343624768201, 0.23846023593997134, 0.060854113997955775, 0.08742967761796096, 0.1573430633911028, 0.20800099348456697, 0.0718050960708281, -0.03231182720126777, -0.1637686064691636, -0.04605893021577905, 0.13449280742748543] |
1,802.0012 | Properties of coplanar periodic electrodes in confined spaces: Case of
two-dimensional diffusion | Periodic configurations of electrodes, in particular of microelectrodes, have
been of interest since the advent of microfabrication. In this report, theory
which is common to any periodic cell (or any cell that can be extended
periodically) with finite height and two-dimensional symmentry was derived. The
diffusion equation in this cell was solved and the concentration profile was
obtained in terms of its Fourier coefficients and as a function of an arbitrary
current density. From this base result, a set of properties were derived which
are fairly general, since they don't assume restrictions such as reversible
electrode reactions (Nernst equation valid when current circulates). These
properties involve: horizontal averages and (weighted) sum of concentrations,
both with a close connection to the net current and accumulation of species in
the cell. The derived properties allow: to explain qualitative aspects of
collection efficiency and limiting currents, to predict the concentration on
counter electrodes and non-linearities caused by depletion of species at
extremely polarized electrodes, and to estimate the time required by the
current to reach steady state in potential controlled experiments. The
theoretical results are illustrated analytically and numerically for the
concrete case of interdigitated array of electrodes.
| physics.chem-ph | periodic configurations of electrodes in particular of microelectrodes have been of interest since the advent of microfabrication in this report theory which is common to any periodic cell or any cell that can be extended periodically with finite height and twodimensional symmentry was derived the diffusion equation in this cell was solved and the concentration profile was obtained in terms of its fourier coefficients and as a function of an arbitrary current density from this base result a set of properties were derived which are fairly general since they dont assume restrictions such as reversible electrode reactions nernst equation valid when current circulates these properties involve horizontal averages and weighted sum of concentrations both with a close connection to the net current and accumulation of species in the cell the derived properties allow to explain qualitative aspects of collection efficiency and limiting currents to predict the concentration on counter electrodes and nonlinearities caused by depletion of species at extremely polarized electrodes and to estimate the time required by the current to reach steady state in potential controlled experiments the theoretical results are illustrated analytically and numerically for the concrete case of interdigitated array of electrodes | [['periodic', 'configurations', 'of', 'electrodes', 'in', 'particular', 'of', 'microelectrodes', 'have', 'been', 'of', 'interest', 'since', 'the', 'advent', 'of', 'microfabrication', 'in', 'this', 'report', 'theory', 'which', 'is', 'common', 'to', 'any', 'periodic', 'cell', 'or', 'any', 'cell', 'that', 'can', 'be', 'extended', 'periodically', 'with', 'finite', 'height', 'and', 'twodimensional', 'symmentry', 'was', 'derived', 'the', 'diffusion', 'equation', 'in', 'this', 'cell', 'was', 'solved', 'and', 'the', 'concentration', 'profile', 'was', 'obtained', 'in', 'terms', 'of', 'its', 'fourier', 'coefficients', 'and', 'as', 'a', 'function', 'of', 'an', 'arbitrary', 'current', 'density', 'from', 'this', 'base', 'result', 'a', 'set', 'of', 'properties', 'were', 'derived', 'which', 'are', 'fairly', 'general', 'since', 'they', 'dont', 'assume', 'restrictions', 'such', 'as', 'reversible', 'electrode', 'reactions', 'nernst', 'equation', 'valid', 'when', 'current', 'circulates', 'these', 'properties', 'involve', 'horizontal', 'averages', 'and', 'weighted', 'sum', 'of', 'concentrations', 'both', 'with', 'a', 'close', 'connection', 'to', 'the', 'net', 'current', 'and', 'accumulation', 'of', 'species', 'in', 'the', 'cell', 'the', 'derived', 'properties', 'allow', 'to', 'explain', 'qualitative', 'aspects', 'of', 'collection', 'efficiency', 'and', 'limiting', 'currents', 'to', 'predict', 'the', 'concentration', 'on', 'counter', 'electrodes', 'and', 'nonlinearities', 'caused', 'by', 'depletion', 'of', 'species', 'at', 'extremely', 'polarized', 'electrodes', 'and', 'to', 'estimate', 'the', 'time', 'required', 'by', 'the', 'current', 'to', 'reach', 'steady', 'state', 'in', 'potential', 'controlled', 'experiments', 'the', 'theoretical', 'results', 'are', 'illustrated', 'analytically', 'and', 'numerically', 'for', 'the', 'concrete', 'case', 'of', 'interdigitated', 'array', 'of', 'electrodes']] | [-0.09939032947625388, 0.1264706732443151, -0.019037129430666797, 0.012081789863343859, -0.012338403886011274, -0.12499070170421883, 0.060511996970180726, 0.371503513584816, -0.267242740940533, -0.29088405954181074, 0.10666751759378816, -0.26389328263803224, -0.1177345630475776, 0.20596924545507417, -0.04402924325381953, 0.04153959794400845, 0.036595951484938716, 0.01888956296252874, -0.043531714638541504, -0.22414371109994838, 0.26778489459046767, 0.03345821606062506, 0.30159322720275444, 0.08093894144145715, 0.09498885662304525, -0.030429640708049547, -0.0004913121145026586, 0.057730650423651504, -0.11231062958664627, 0.09945818111684519, 0.24712034848701095, 0.03692446997240378, 0.19720078788256062, -0.5092688750562057, -0.234880807500416, 0.07810851971297189, 0.12907296221597678, 0.10857805485966779, -0.05404225298138719, -0.24458163216129214, 0.08807239652438492, -0.14039974041599973, -0.17005337479274682, -0.044192168646799306, 0.03493254963241364, 0.11199732502495159, -0.26840074069452347, 0.07911772043300197, 0.041527880841779725, 0.0518590065651542, -0.07728307615766379, -0.1241667645565743, -0.04361038629119236, 0.1309156164044776, 0.04091623695464862, -0.005050746644799088, 0.15360821236270605, -0.12434315382738204, -0.08467572272908826, 0.3280626992615823, -0.07040867256360685, -0.22210954705651695, 0.19383081639324767, -0.18366792957663305, -0.05611222175180374, 0.12818614389632166, 0.14257049034997707, 0.1129935170672642, -0.1758801172786427, 0.06460624634868528, -0.010568193835086314, 0.14330903002476206, 0.11589573718218575, -0.007812600562135334, 0.21545390906916528, 0.15417489836582934, 0.059637979822432546, 0.1267038403209731, -0.08195421760589768, -0.09009836308571711, -0.268970810995466, -0.15322962761004502, -0.17253178968590854, 0.06718754926432385, -0.04628136885985816, -0.1756209984383325, 0.3885080784885693, 0.10986116092913717, 0.19381291846043824, 0.005984819874637904, 0.2621263569651757, 0.1374408897504087, 0.06844983494014854, 0.005965656723308656, 0.21854326006303512, 0.17470803024900175, 0.11048944886610604, -0.2307110716944042, 0.10224128461061238, 0.026686511942804744] |
1,802.00121 | Interpreting CNNs via Decision Trees | This paper aims to quantitatively explain rationales of each prediction that
is made by a pre-trained convolutional neural network (CNN). We propose to
learn a decision tree, which clarifies the specific reason for each prediction
made by the CNN at the semantic level. I.e., the decision tree decomposes
feature representations in high conv-layers of the CNN into elementary concepts
of object parts. In this way, the decision tree tells people which object parts
activate which filters for the prediction and how much they contribute to the
prediction score. Such semantic and quantitative explanations for CNN
predictions have specific values beyond the traditional pixel-level analysis of
CNNs. More specifically, our method mines all potential decision modes of the
CNN, where each mode represents a common case of how the CNN uses object parts
for prediction. The decision tree organizes all potential decision modes in a
coarse-to-fine manner to explain CNN predictions at different fine-grained
levels. Experiments have demonstrated the effectiveness of the proposed method.
| cs.CV | this paper aims to quantitatively explain rationales of each prediction that is made by a pretrained convolutional neural network cnn we propose to learn a decision tree which clarifies the specific reason for each prediction made by the cnn at the semantic level ie the decision tree decomposes feature representations in high convlayers of the cnn into elementary concepts of object parts in this way the decision tree tells people which object parts activate which filters for the prediction and how much they contribute to the prediction score such semantic and quantitative explanations for cnn predictions have specific values beyond the traditional pixellevel analysis of cnns more specifically our method mines all potential decision modes of the cnn where each mode represents a common case of how the cnn uses object parts for prediction the decision tree organizes all potential decision modes in a coarsetofine manner to explain cnn predictions at different finegrained levels experiments have demonstrated the effectiveness of the proposed method | [['this', 'paper', 'aims', 'to', 'quantitatively', 'explain', 'rationales', 'of', 'each', 'prediction', 'that', 'is', 'made', 'by', 'a', 'pretrained', 'convolutional', 'neural', 'network', 'cnn', 'we', 'propose', 'to', 'learn', 'a', 'decision', 'tree', 'which', 'clarifies', 'the', 'specific', 'reason', 'for', 'each', 'prediction', 'made', 'by', 'the', 'cnn', 'at', 'the', 'semantic', 'level', 'ie', 'the', 'decision', 'tree', 'decomposes', 'feature', 'representations', 'in', 'high', 'convlayers', 'of', 'the', 'cnn', 'into', 'elementary', 'concepts', 'of', 'object', 'parts', 'in', 'this', 'way', 'the', 'decision', 'tree', 'tells', 'people', 'which', 'object', 'parts', 'activate', 'which', 'filters', 'for', 'the', 'prediction', 'and', 'how', 'much', 'they', 'contribute', 'to', 'the', 'prediction', 'score', 'such', 'semantic', 'and', 'quantitative', 'explanations', 'for', 'cnn', 'predictions', 'have', 'specific', 'values', 'beyond', 'the', 'traditional', 'pixellevel', 'analysis', 'of', 'cnns', 'more', 'specifically', 'our', 'method', 'mines', 'all', 'potential', 'decision', 'modes', 'of', 'the', 'cnn', 'where', 'each', 'mode', 'represents', 'a', 'common', 'case', 'of', 'how', 'the', 'cnn', 'uses', 'object', 'parts', 'for', 'prediction', 'the', 'decision', 'tree', 'organizes', 'all', 'potential', 'decision', 'modes', 'in', 'a', 'coarsetofine', 'manner', 'to', 'explain', 'cnn', 'predictions', 'at', 'different', 'finegrained', 'levels', 'experiments', 'have', 'demonstrated', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']] | [-0.008555970699640642, 0.04233753110676364, -0.0859007361113591, 0.0842370210783956, -0.13575772123205607, -0.18932757747182452, 0.0712172650379283, 0.4335567669177348, -0.26588738269166895, -0.30415529751453113, 0.02365923547571628, -0.253743604995436, -0.2100444417036184, 0.1070481841652397, -0.09693343695924486, 0.06692092663665986, 0.14503558961948826, 0.10648183604313827, -0.0017476646919546226, -0.25553634536504016, 0.32098260207638785, 0.06339948041010306, 0.3399832298510645, 0.009124902836932727, 0.1541944696122289, -0.002327455693364509, -0.057757485201732295, -0.045126948620626946, -0.057713264658230436, 0.17244323357036967, 0.3756435352571857, 0.1933615552632858, 0.32614941385780327, -0.42516892884452284, -0.22233461123388376, 0.07628863948208789, 0.13641893402123367, 0.09221961518443915, 0.04262168835546819, -0.3287675748822034, 0.10575944238608029, -0.15656894165736857, 0.009513120424070973, -0.12057488971886916, -0.02414209365650463, -0.09105821781751751, -0.2705558241213575, -0.00934388112145379, 0.07787586880299302, 0.018418927666976864, -0.06949487531291995, -0.13189602952359095, -0.009950368166644057, 0.19128932332208642, 0.024985100665098296, 0.05709414607563136, 0.15634312504114, -0.223699357516298, -0.15853465991908902, 0.3398141448780254, -0.027407357169235227, -0.2212114555624091, 0.1996981118422893, -0.05927272838614653, -0.18421733225095857, 0.1043270333195848, 0.208255092927649, 0.07095976772095346, -0.16627113313979805, -0.0441793938820176, -0.05655793399418607, 0.17292374152721599, 0.08017591904545991, -0.028572142538414592, 0.24542707909595657, 0.29638852839546703, -0.0013382275291701402, 0.13080754194785754, -0.13093514289089872, -0.04444661424381007, -0.2314915684126089, -0.1208974819636098, -0.13841355026451774, -0.08357394328326603, -0.14308318490161778, -0.15363847870107217, 0.467768750262041, 0.25509396332824613, 0.23664500720319023, 0.14128594232674552, 0.3339095274672095, 0.050833305016165724, 0.16540894308841667, 0.08496328284449738, 0.18224649090945516, 0.02636802134509741, 0.105168097345387, -0.13258007874689492, 0.1218992430671044, 0.11423174535535688] |
1,802.00122 | Assessing Strong String Stability of Constant Spacing Policy under Speed
Limit Fluctuations | The speed limit changes frequently throughout the transportation network, due
to either safety (e.g., change in geometry) or congestion management (e.g.,
speed harmonization systems). Any abrupt reduction in the speed limit can
create a shockwave that propagates upstream in traffic. Dealing with such an
abrupt reduction in speed limit is particularly important while designing
control laws for a platoon of automated vehicles from both stability and
efficiency perspectives. This paper focuses on Adaptive Cruise Control (ACC)
based platooning under a constant spacing policy, and investigates the
possibility of designing a controller that ensures stability, while tracking a
given target velocity profile that changes as a function of location. An ideal
controller should maintain a constant spacing between successive vehicles,
while tracking the desired velocity profile. The analytical investigations of
this paper suggest that such a controller does not exist.
| cs.SY | the speed limit changes frequently throughout the transportation network due to either safety eg change in geometry or congestion management eg speed harmonization systems any abrupt reduction in the speed limit can create a shockwave that propagates upstream in traffic dealing with such an abrupt reduction in speed limit is particularly important while designing control laws for a platoon of automated vehicles from both stability and efficiency perspectives this paper focuses on adaptive cruise control acc based platooning under a constant spacing policy and investigates the possibility of designing a controller that ensures stability while tracking a given target velocity profile that changes as a function of location an ideal controller should maintain a constant spacing between successive vehicles while tracking the desired velocity profile the analytical investigations of this paper suggest that such a controller does not exist | [['the', 'speed', 'limit', 'changes', 'frequently', 'throughout', 'the', 'transportation', 'network', 'due', 'to', 'either', 'safety', 'eg', 'change', 'in', 'geometry', 'or', 'congestion', 'management', 'eg', 'speed', 'harmonization', 'systems', 'any', 'abrupt', 'reduction', 'in', 'the', 'speed', 'limit', 'can', 'create', 'a', 'shockwave', 'that', 'propagates', 'upstream', 'in', 'traffic', 'dealing', 'with', 'such', 'an', 'abrupt', 'reduction', 'in', 'speed', 'limit', 'is', 'particularly', 'important', 'while', 'designing', 'control', 'laws', 'for', 'a', 'platoon', 'of', 'automated', 'vehicles', 'from', 'both', 'stability', 'and', 'efficiency', 'perspectives', 'this', 'paper', 'focuses', 'on', 'adaptive', 'cruise', 'control', 'acc', 'based', 'platooning', 'under', 'a', 'constant', 'spacing', 'policy', 'and', 'investigates', 'the', 'possibility', 'of', 'designing', 'a', 'controller', 'that', 'ensures', 'stability', 'while', 'tracking', 'a', 'given', 'target', 'velocity', 'profile', 'that', 'changes', 'as', 'a', 'function', 'of', 'location', 'an', 'ideal', 'controller', 'should', 'maintain', 'a', 'constant', 'spacing', 'between', 'successive', 'vehicles', 'while', 'tracking', 'the', 'desired', 'velocity', 'profile', 'the', 'analytical', 'investigations', 'of', 'this', 'paper', 'suggest', 'that', 'such', 'a', 'controller', 'does', 'not', 'exist']] | [-0.21192686301957575, 0.09718461665881818, -0.07814886020295483, -0.008262012251853782, -0.06800539793594064, -0.17010819118992565, 0.09867565954110766, 0.379537858068943, -0.2707873556776334, -0.3177714096985275, 0.15330425911187698, -0.2099752160385519, -0.14262570310283532, 0.1966763917949694, -0.16902446075804906, 0.10218395385723696, 0.0723362705660247, 0.03971104902758015, -0.03999866320242395, -0.13059664049634723, 0.23113591550253063, 0.07479250687760763, 0.3582509675451802, 0.0606152636435372, 0.12392498344591678, 0.028928429314932825, 0.01803670055065438, 0.04718944972310644, -0.08042340004325027, 0.08318213068515505, 0.2578080384807809, 0.13165908277691377, 0.3367901481822026, -0.4376173205539691, -0.26389239002823184, 0.09403448862110754, 0.18305896487980647, 0.07523800089131209, -0.07384574990602304, -0.2522899296047608, 0.07222726653797365, -0.18545180396511882, -0.18798368330374896, -0.027728386462846998, 0.02397223920795879, 0.08420331490254565, -0.2895437937812786, 0.009468660147177229, 0.055506353196185486, 0.09018790062764834, -0.07494212670432632, -0.018872271636969966, -0.035380885323254965, 0.1794366011875112, 0.045576089288764665, 0.03187102322104863, 0.22078250847730063, -0.17231820733788952, -0.0924183674618977, 0.3928134029181741, -0.03740886355274551, -0.20748587892049078, 0.16632278134423248, -0.055339108946525474, -0.09350405621891775, 0.1295144515875861, 0.2364901599956663, 0.06065578148666796, -0.1413670420619867, 0.010207093747084787, 0.02999148380661236, 0.2286997141798945, 0.10049118798413723, -0.0010678255486657187, 0.20335716543812976, 0.2097508625576286, 0.2031371755786776, 0.07777139243649707, -0.07889432265597443, -0.12400643300707284, -0.2812919518809846, -0.13484407867063775, -0.09251431716780226, 0.0055998665157734025, -0.09319158879476398, -0.14589162972226416, 0.3554081559087411, 0.17942668945468265, 0.17053394721110735, 0.06371156888571736, 0.37309455742938913, 0.11177273785189572, 0.024257287068171894, 0.16203002039704928, 0.23673319417259675, 0.021411804932926735, 0.17043870226011054, -0.2734310766259081, 0.1541263990325304, 0.025779324186724618] |
1,802.00123 | A Modified Sigma-Pi-Sigma Neural Network with Adaptive Choice of
Multinomials | Sigma-Pi-Sigma neural networks (SPSNNs) as a kind of high-order neural
networks can provide more powerful mapping capability than the traditional
feedforward neural networks (Sigma-Sigma neural networks). In the existing
literature, in order to reduce the number of the Pi nodes in the Pi layer, a
special multinomial P_s is used in SPSNNs. Each monomial in P_s is linear with
respect to each particular variable sigma_i when the other variables are taken
as constants. Therefore, the monomials like sigma_i^n or sigma_i^n sigma_j with
n>1 are not included. This choice may be somehow intuitive, but is not
necessarily the best. We propose in this paper a modified Sigma-Pi-Sigma neural
network (MSPSNN) with an adaptive approach to find a better multinomial for a
given problem. To elaborate, we start from a complete multinomial with a given
order. Then we employ a regularization technique in the learning process for
the given problem to reduce the number of monomials used in the multinomial,
and end up with a new SPSNN involving the same number of monomials (= the
number of nodes in the Pi-layer) as in P_s. Numerical experiments on some
benchmark problems show that our MSPSNN behaves better than the traditional
SPSNN with P_s.
| cs.LG stat.ML | sigmapisigma neural networks spsnns as a kind of highorder neural networks can provide more powerful mapping capability than the traditional feedforward neural networks sigmasigma neural networks in the existing literature in order to reduce the number of the pi nodes in the pi layer a special multinomial p_s is used in spsnns each monomial in p_s is linear with respect to each particular variable sigma_i when the other variables are taken as constants therefore the monomials like sigma_in or sigma_in sigma_j with n1 are not included this choice may be somehow intuitive but is not necessarily the best we propose in this paper a modified sigmapisigma neural network mspsnn with an adaptive approach to find a better multinomial for a given problem to elaborate we start from a complete multinomial with a given order then we employ a regularization technique in the learning process for the given problem to reduce the number of monomials used in the multinomial and end up with a new spsnn involving the same number of monomials the number of nodes in the pilayer as in p_s numerical experiments on some benchmark problems show that our mspsnn behaves better than the traditional spsnn with p_s | [['sigmapisigma', 'neural', 'networks', 'spsnns', 'as', 'a', 'kind', 'of', 'highorder', 'neural', 'networks', 'can', 'provide', 'more', 'powerful', 'mapping', 'capability', 'than', 'the', 'traditional', 'feedforward', 'neural', 'networks', 'sigmasigma', 'neural', 'networks', 'in', 'the', 'existing', 'literature', 'in', 'order', 'to', 'reduce', 'the', 'number', 'of', 'the', 'pi', 'nodes', 'in', 'the', 'pi', 'layer', 'a', 'special', 'multinomial', 'p_s', 'is', 'used', 'in', 'spsnns', 'each', 'monomial', 'in', 'p_s', 'is', 'linear', 'with', 'respect', 'to', 'each', 'particular', 'variable', 'sigma_i', 'when', 'the', 'other', 'variables', 'are', 'taken', 'as', 'constants', 'therefore', 'the', 'monomials', 'like', 'sigma_in', 'or', 'sigma_in', 'sigma_j', 'with', 'n1', 'are', 'not', 'included', 'this', 'choice', 'may', 'be', 'somehow', 'intuitive', 'but', 'is', 'not', 'necessarily', 'the', 'best', 'we', 'propose', 'in', 'this', 'paper', 'a', 'modified', 'sigmapisigma', 'neural', 'network', 'mspsnn', 'with', 'an', 'adaptive', 'approach', 'to', 'find', 'a', 'better', 'multinomial', 'for', 'a', 'given', 'problem', 'to', 'elaborate', 'we', 'start', 'from', 'a', 'complete', 'multinomial', 'with', 'a', 'given', 'order', 'then', 'we', 'employ', 'a', 'regularization', 'technique', 'in', 'the', 'learning', 'process', 'for', 'the', 'given', 'problem', 'to', 'reduce', 'the', 'number', 'of', 'monomials', 'used', 'in', 'the', 'multinomial', 'and', 'end', 'up', 'with', 'a', 'new', 'spsnn', 'involving', 'the', 'same', 'number', 'of', 'monomials', 'the', 'number', 'of', 'nodes', 'in', 'the', 'pilayer', 'as', 'in', 'p_s', 'numerical', 'experiments', 'on', 'some', 'benchmark', 'problems', 'show', 'that', 'our', 'mspsnn', 'behaves', 'better', 'than', 'the', 'traditional', 'spsnn', 'with', 'p_s']] | [-0.07713204612677985, 0.07925740350829498, -0.05306235733297243, 0.05365364633504082, -0.11104968633657138, -0.17557676392486754, 0.03496856531043841, 0.37414769885743066, -0.29861528345822824, -0.2664307745724284, 0.06346023405016607, -0.26723332485362616, -0.18798710352384093, 0.1766715004950897, -0.09208266093960235, 0.07731563458460446, 0.05388601547362852, 0.11123297322457631, -0.06028540544435044, -0.29528685689088285, 0.306953661775921, 0.0304802943411925, 0.2397870547837853, -0.042742120986925, 0.0827323133391304, -0.021029701248930836, -0.0024027095062880166, 0.019379354969337775, -0.08678002694792535, 0.11963171984064223, 0.27781915172953836, 0.12741275898233984, 0.31527761695182693, -0.44352152972202263, -0.19353091262686284, 0.17967393562388292, 0.15790149247167642, 0.08926541995742103, 0.022308900501983784, -0.21841902445297245, 0.09150426409393067, -0.17150319654764754, -0.08158201679413646, -0.08958139895205748, -0.01705458400037545, 0.051974307662455144, -0.32958146704389796, 0.035028576390055334, 0.05658546849660614, 0.04717557961748517, 0.0017248723725908934, -0.17715777762938734, 0.0019103052840119352, 0.08478429255879803, 0.0026111492163011893, 0.08652785218229102, 0.05595616382001441, -0.14588541592534032, -0.14015174169971611, 0.3670125891179464, -0.053922021896198366, -0.27849885165918176, 0.14334756382041336, -0.09168789790457095, -0.17278484870448052, 0.08349971952630988, 0.17917890967366917, 0.12920006646755408, -0.1103401207139654, 0.02028816008977737, -0.06421801515153991, 0.16282867581868266, 0.04782314847158693, 0.0024787507217782765, 0.12459030961666083, 0.1951623631863242, 0.07061798922678968, 0.1537232087038993, -0.06924571391132327, -0.05385744304835333, -0.2843996133520196, -0.13210206916266232, -0.17892984718016777, 0.03184518150860381, -0.11760908950817195, -0.16536863061835883, 0.37821137601355276, 0.15293281608915024, 0.24820696555049077, 0.11397640228059162, 0.279688372378059, 0.10995593415983407, 0.10169199124760346, 0.10064243373987047, 0.1735997589751704, 0.09091451302305868, 0.10604650907006134, -0.16206062926158038, 0.08777226975979043, 0.06563246880604891] |
1,802.00124 | Rethinking the Smaller-Norm-Less-Informative Assumption in Channel
Pruning of Convolution Layers | Model pruning has become a useful technique that improves the computational
efficiency of deep learning, making it possible to deploy solutions in
resource-limited scenarios. A widely-used practice in relevant work assumes
that a smaller-norm parameter or feature plays a less informative role at the
inference time. In this paper, we propose a channel pruning technique for
accelerating the computations of deep convolutional neural networks (CNNs) that
does not critically rely on this assumption. Instead, it focuses on direct
simplification of the channel-to-channel computation graph of a CNN without the
need of performing a computationally difficult and not-always-useful task of
making high-dimensional tensors of CNN structured sparse. Our approach takes
two stages: first to adopt an end-to- end stochastic training method that
eventually forces the outputs of some channels to be constant, and then to
prune those constant channels from the original neural network by adjusting the
biases of their impacting layers such that the resulting compact model can be
quickly fine-tuned. Our approach is mathematically appealing from an
optimization perspective and easy to reproduce. We experimented our approach
through several image learning benchmarks and demonstrate its interesting
aspects and competitive performance.
| cs.LG | model pruning has become a useful technique that improves the computational efficiency of deep learning making it possible to deploy solutions in resourcelimited scenarios a widelyused practice in relevant work assumes that a smallernorm parameter or feature plays a less informative role at the inference time in this paper we propose a channel pruning technique for accelerating the computations of deep convolutional neural networks cnns that does not critically rely on this assumption instead it focuses on direct simplification of the channeltochannel computation graph of a cnn without the need of performing a computationally difficult and notalwaysuseful task of making highdimensional tensors of cnn structured sparse our approach takes two stages first to adopt an endto end stochastic training method that eventually forces the outputs of some channels to be constant and then to prune those constant channels from the original neural network by adjusting the biases of their impacting layers such that the resulting compact model can be quickly finetuned our approach is mathematically appealing from an optimization perspective and easy to reproduce we experimented our approach through several image learning benchmarks and demonstrate its interesting aspects and competitive performance | [['model', 'pruning', 'has', 'become', 'a', 'useful', 'technique', 'that', 'improves', 'the', 'computational', 'efficiency', 'of', 'deep', 'learning', 'making', 'it', 'possible', 'to', 'deploy', 'solutions', 'in', 'resourcelimited', 'scenarios', 'a', 'widelyused', 'practice', 'in', 'relevant', 'work', 'assumes', 'that', 'a', 'smallernorm', 'parameter', 'or', 'feature', 'plays', 'a', 'less', 'informative', 'role', 'at', 'the', 'inference', 'time', 'in', 'this', 'paper', 'we', 'propose', 'a', 'channel', 'pruning', 'technique', 'for', 'accelerating', 'the', 'computations', 'of', 'deep', 'convolutional', 'neural', 'networks', 'cnns', 'that', 'does', 'not', 'critically', 'rely', 'on', 'this', 'assumption', 'instead', 'it', 'focuses', 'on', 'direct', 'simplification', 'of', 'the', 'channeltochannel', 'computation', 'graph', 'of', 'a', 'cnn', 'without', 'the', 'need', 'of', 'performing', 'a', 'computationally', 'difficult', 'and', 'notalwaysuseful', 'task', 'of', 'making', 'highdimensional', 'tensors', 'of', 'cnn', 'structured', 'sparse', 'our', 'approach', 'takes', 'two', 'stages', 'first', 'to', 'adopt', 'an', 'endto', 'end', 'stochastic', 'training', 'method', 'that', 'eventually', 'forces', 'the', 'outputs', 'of', 'some', 'channels', 'to', 'be', 'constant', 'and', 'then', 'to', 'prune', 'those', 'constant', 'channels', 'from', 'the', 'original', 'neural', 'network', 'by', 'adjusting', 'the', 'biases', 'of', 'their', 'impacting', 'layers', 'such', 'that', 'the', 'resulting', 'compact', 'model', 'can', 'be', 'quickly', 'finetuned', 'our', 'approach', 'is', 'mathematically', 'appealing', 'from', 'an', 'optimization', 'perspective', 'and', 'easy', 'to', 'reproduce', 'we', 'experimented', 'our', 'approach', 'through', 'several', 'image', 'learning', 'benchmarks', 'and', 'demonstrate', 'its', 'interesting', 'aspects', 'and', 'competitive', 'performance']] | [-0.057998015982635986, 0.020165386629597624, -0.09796450681314267, 0.05628534920806824, -0.13865179687038695, -0.1989132896898482, 0.07493768665242309, 0.4438929060700709, -0.27935746691322755, -0.31021270605614754, 0.08720007827523948, -0.20177197846874753, -0.233617564454983, 0.20226127704699084, -0.09277524092716963, 0.08910842067851542, 0.14905386750472996, 0.013770323990789986, -0.06087913646371345, -0.2930513774902528, 0.3090501272774957, 0.09352620624260799, 0.31726216465831, 0.025060113941974663, 0.13131799081740186, -0.029883623721876314, -0.033425689391575, -0.010838723001710912, -0.053978431479312125, 0.16290364488121614, 0.2837752563972519, 0.19603633411997368, 0.3417152675391032, -0.4604243489534215, -0.23528551341468104, 0.11028854039937465, 0.16435687195293472, 0.13032369127635052, -0.0098538967322961, -0.2733008560808326, 0.09111968613914632, -0.17087093316925267, -0.012720085912083507, -0.1503735917457749, -0.026767420483920626, -0.05538192929493056, -0.2983660457098965, 0.03171276191259345, 0.09346163286100678, -0.01666578303692399, -0.005941541120779538, -0.11717671046905692, 0.029820245940721146, 0.14450855700609586, 0.04181744468089029, 0.043689804868624796, 0.15273755232966135, -0.18434034733141147, -0.095957134262703, 0.3473428929687808, -0.03268752589503983, -0.22404163412961656, 0.19846293233333787, 0.013377562495411704, -0.16670496850496247, 0.12027258727398933, 0.21984748667224296, 0.15006937517750044, -0.1495645090459634, 0.044392301105689654, -0.012540094751529592, 0.17748504525195885, 0.03191699560672518, -0.0053997243863589586, 0.1718955210548032, 0.26877876486174673, 0.05240306230853238, 0.1395524455414267, -0.09886228411936412, -0.08682649066116138, -0.22192454677587622, -0.10962274357696217, -0.19634199974733213, -0.005883085919545949, -0.12164489133414386, -0.1532151040241674, 0.3912092091912335, 0.23904358440758808, 0.21817691110458876, 0.10411140055792337, 0.3751136408281074, 0.0389482495060841, 0.1192793989977208, 0.10403078460601459, 0.2276581267922656, 0.04843499966916781, 0.11484394947599087, -0.15354433163468326, 0.10003766257093515, 0.03611954783641354] |
1,802.00125 | Stability of Room Temperature Compensated Half-Metallicity in Cr-based
Inverse-Heusler Compounds | Using three correlated band approaches, namely the conventional band approach
plus on-site Coulomb repulsion $U$, the modified Becke-Johnson functional, and
hybrid functional, we have investigated inverse-Heusler ferrimagnets
Cr$_2$Co${\cal Z}$ (${\cal Z}$=Al, Ga, In). These approaches commonly indicate
that the Cr$_2$CoAl synthesized recently is a precise compensated half-metal
(CHM), whereas Cr$_2$CoGa and Cr$_2$CoIn are ferrimagnets with a small moment.
This is also confirmed by the fixed spin moment approach. Analysis of the Bader
charge decomposition and the radial charge densities indicates that this
contrast is due to chemical differences among the ${\cal Z}$ ions.
Additionally, in Cr$_2$CoAl, changing the volume by $\pm$ 5% or the ratio of
$c/a$ by $\pm$ 2% does not alter the CHM state, suggesting that this state is
robust even under application of moderate pressure or strain. Considering the
observed high Curie temperature of 750 K, our results suggest that Cr$_2$CoAl
is a promising candidate for robust high $T_C$ CHMs. Furthermore, the
electronic structure of the CHM Cr$_2$CoAl is discussed.
| cond-mat.mtrl-sci cond-mat.str-el | using three correlated band approaches namely the conventional band approach plus onsite coulomb repulsion u the modified beckejohnson functional and hybrid functional we have investigated inverseheusler ferrimagnets cr_2cocal z cal zal ga in these approaches commonly indicate that the cr_2coal synthesized recently is a precise compensated halfmetal chm whereas cr_2coga and cr_2coin are ferrimagnets with a small moment this is also confirmed by the fixed spin moment approach analysis of the bader charge decomposition and the radial charge densities indicates that this contrast is due to chemical differences among the cal z ions additionally in cr_2coal changing the volume by pm 5 or the ratio of ca by pm 2 does not alter the chm state suggesting that this state is robust even under application of moderate pressure or strain considering the observed high curie temperature of 750 k our results suggest that cr_2coal is a promising candidate for robust high t_c chms furthermore the electronic structure of the chm cr_2coal is discussed | [['using', 'three', 'correlated', 'band', 'approaches', 'namely', 'the', 'conventional', 'band', 'approach', 'plus', 'onsite', 'coulomb', 'repulsion', 'u', 'the', 'modified', 'beckejohnson', 'functional', 'and', 'hybrid', 'functional', 'we', 'have', 'investigated', 'inverseheusler', 'ferrimagnets', 'cr_2cocal', 'z', 'cal', 'zal', 'ga', 'in', 'these', 'approaches', 'commonly', 'indicate', 'that', 'the', 'cr_2coal', 'synthesized', 'recently', 'is', 'a', 'precise', 'compensated', 'halfmetal', 'chm', 'whereas', 'cr_2coga', 'and', 'cr_2coin', 'are', 'ferrimagnets', 'with', 'a', 'small', 'moment', 'this', 'is', 'also', 'confirmed', 'by', 'the', 'fixed', 'spin', 'moment', 'approach', 'analysis', 'of', 'the', 'bader', 'charge', 'decomposition', 'and', 'the', 'radial', 'charge', 'densities', 'indicates', 'that', 'this', 'contrast', 'is', 'due', 'to', 'chemical', 'differences', 'among', 'the', 'cal', 'z', 'ions', 'additionally', 'in', 'cr_2coal', 'changing', 'the', 'volume', 'by', 'pm', '5', 'or', 'the', 'ratio', 'of', 'ca', 'by', 'pm', '2', 'does', 'not', 'alter', 'the', 'chm', 'state', 'suggesting', 'that', 'this', 'state', 'is', 'robust', 'even', 'under', 'application', 'of', 'moderate', 'pressure', 'or', 'strain', 'considering', 'the', 'observed', 'high', 'curie', 'temperature', 'of', '750', 'k', 'our', 'results', 'suggest', 'that', 'cr_2coal', 'is', 'a', 'promising', 'candidate', 'for', 'robust', 'high', 't_c', 'chms', 'furthermore', 'the', 'electronic', 'structure', 'of', 'the', 'chm', 'cr_2coal', 'is', 'discussed']] | [-0.11849953139317222, 0.16531031626509501, -0.03349278222449357, 0.05478297348872729, -0.004308598245552275, -0.1555220229027327, 0.08434703903694754, 0.3769376967917196, -0.2237225960736396, -0.3045406846678816, 0.030606104676553513, -0.2962645631923806, -0.11317810888576788, 0.12305569363234099, 0.017209862964227794, -0.004145827944739722, 0.00579857797420118, -0.016077339387265965, -0.11889888671139488, -0.19346721653273563, 0.26986563657410445, 0.04329198462073691, 0.3033297389280051, 0.09224024243558233, 0.04879289028758649, 0.0022816112212240116, 0.061139632936101404, 0.06689605994033627, -0.11553109538599529, 0.07307828436605632, 0.201877891123695, -0.02268538438365795, 0.21945574011915597, -0.36763782298658043, -0.20105927575059468, 0.045108052482828495, 0.10924621070880676, 0.0940560230432311, -0.0844078223039105, -0.2699303925066488, 0.13167795440349436, -0.17132564981366158, -0.13086319289141102, -0.1105268829560373, 0.011763370578410103, 0.024345989870198537, -0.2933841299633059, 0.1586803110940309, 0.04687978480724268, 0.06299282913096249, -0.0821455767742009, -0.21433071864303202, -0.09803124751633732, 0.002830599359003827, 0.052868807170307265, 0.09174732642131858, 0.1460229751712177, -0.0657493741469807, -0.07021526751486817, 0.3700647515943274, -0.07620270750776399, -0.1165991335932631, 0.17266667188669088, -0.14268469192029443, -0.12673878088462515, 0.1596061753885806, 0.06789320326060988, 0.10384738341963384, -0.13573237176788097, 0.11808095833293919, 0.01528909837215906, 0.2010262602067087, 0.013389627440483309, 0.021150582219706848, 0.20292528394056716, 0.15583874020376243, 0.04311838232824812, 0.07304587252401688, -0.1259199890875607, -0.05172739409576934, -0.2202443530142773, -0.15182332178810612, -0.20562704225230846, 0.04050614004636373, -0.09477048827075123, -0.12780243179295211, 0.3545701237651883, 0.13744574630691203, 0.17153102371812565, -0.030520426796283574, 0.23887262457283215, 0.132443150258041, 0.08652418600977399, 0.056398493636515924, 0.2659515430073952, 0.1390094365546247, 0.10483171010273509, -0.2708182916569058, 0.07537336398963816, 0.009439401781128254] |
1,802.00126 | Observation of Discrete-Time-Crystal Signatures in an Ordered Dipolar
Many-Body System | A discrete time crystal (DTC) is a robust phase of driven systems that breaks
the discrete time translation symmetry of the driving Hamiltonian. Recent
experiments have observed DTC signatures in two distinct systems. Here we show
nuclear magnetic resonance (NMR) observations of DTC signatures in a third,
strikingly different system: an ordered spatial crystal. We use a novel DTC
echo experiment to probe the coherence of the driven system. Finally, we show
that interactions during the pulse of the DTC sequence contribute to the decay
of the signal, complicating attempts to measure the intrinsic lifetime of the
DTC.
| quant-ph cond-mat.stat-mech cond-mat.str-el | a discrete time crystal dtc is a robust phase of driven systems that breaks the discrete time translation symmetry of the driving hamiltonian recent experiments have observed dtc signatures in two distinct systems here we show nuclear magnetic resonance nmr observations of dtc signatures in a third strikingly different system an ordered spatial crystal we use a novel dtc echo experiment to probe the coherence of the driven system finally we show that interactions during the pulse of the dtc sequence contribute to the decay of the signal complicating attempts to measure the intrinsic lifetime of the dtc | [['a', 'discrete', 'time', 'crystal', 'dtc', 'is', 'a', 'robust', 'phase', 'of', 'driven', 'systems', 'that', 'breaks', 'the', 'discrete', 'time', 'translation', 'symmetry', 'of', 'the', 'driving', 'hamiltonian', 'recent', 'experiments', 'have', 'observed', 'dtc', 'signatures', 'in', 'two', 'distinct', 'systems', 'here', 'we', 'show', 'nuclear', 'magnetic', 'resonance', 'nmr', 'observations', 'of', 'dtc', 'signatures', 'in', 'a', 'third', 'strikingly', 'different', 'system', 'an', 'ordered', 'spatial', 'crystal', 'we', 'use', 'a', 'novel', 'dtc', 'echo', 'experiment', 'to', 'probe', 'the', 'coherence', 'of', 'the', 'driven', 'system', 'finally', 'we', 'show', 'that', 'interactions', 'during', 'the', 'pulse', 'of', 'the', 'dtc', 'sequence', 'contribute', 'to', 'the', 'decay', 'of', 'the', 'signal', 'complicating', 'attempts', 'to', 'measure', 'the', 'intrinsic', 'lifetime', 'of', 'the', 'dtc']] | [-0.1928144656977027, 0.19305719203943486, -0.1327723300361255, 0.03970176768037775, -0.05655856768847728, -0.11446033690923027, 0.04031077191846597, 0.41290878721189744, -0.314435703052702, -0.25569693457658343, 0.07604977687611719, -0.2411599314738331, -0.13458809231845092, 0.18819968210419222, 0.019271314707204546, 0.054582145558646405, 0.009340153700596064, 0.01814992128804858, -0.0702980296990397, -0.1697667696494229, 0.269623756199619, 0.022982390017761867, 0.31796303432795925, -0.0170970400842857, 0.11327092777177387, -0.027947237192444047, 0.019309613407038306, -0.03181093326788776, -0.11084636453404305, 0.054892111992539495, 0.19111025166621773, 0.062232910870450873, 0.22205144252476036, -0.4584782617926902, -0.20806647215646748, 0.13116345333163532, 0.13345357838409896, 0.169298517591396, -0.10766582963608053, -0.321729988905088, 0.031324885739251136, -0.15498437464821666, -0.10356723576575061, -0.09967928294719634, 0.0027815172714846475, 0.011971200326913777, -0.24531900938790369, 0.0896175915104508, 0.1058571540550994, 0.06416938352227515, -0.09854637405702046, -0.009854573879999166, 0.012603832617858234, 0.09994338141820792, 0.04519884069497716, 0.034682351706207405, 0.15047459724021847, -0.08346216257053371, -0.20351152259343286, 0.3282425604114423, -0.09316622583749135, -0.09992586718682124, 0.19857884838949053, -0.1841953507795626, -0.15750350343177513, 0.1661492920556695, 0.17889766052141975, 0.08422653442628834, -0.12869816576605853, 0.005034124516710943, -0.013211450173652597, 0.2548208992871247, -0.0038676357101078847, 0.07429502700569526, 0.1846004614454447, 0.22938118023531778, 0.03727557591153119, 0.15216211800710583, -0.14314002746345514, -0.10455350717529655, -0.2136659620149175, -0.14128766337181536, -0.19039242193387934, 0.02259760116683129, -0.025276246452133874, -0.11000050756158497, 0.44318126383883766, 0.1751571624653832, 0.19599987190140752, -0.01632121456454375, 0.30115213743125907, 0.12462649976226445, 0.06462221810408887, -0.029303357114407177, 0.2555811522167404, 0.13460678449114405, 0.12033083397248874, -0.32186364072222945, 0.06139395097674498, -0.029151975153470223] |
1,802.00127 | Local existence and uniqueness of strong solutions to the free boundary
problem of the full compressible Navier-Stokes equations in 3D | In this paper we establish the local-in-time existence and uniqueness of
strong solutions to the free boundary problem of the full compressible
Navier-Stokes equations in three-dimensional space. The vanishing density and
temperature condition is imposed on the free boundary, which captures the
motions of the non-isentropic viscous gas surrounded by vacuum with bounded
entropy. We also assume some proper decay rates of the density towards the
boundary and singularities of derivatives of the temperature across the
boundary on the initial data, which coincides with the physical vacuum
condition for the isentropic flows. This extends the previous result of Liu
[ArXiv:1612.07936] by removing the spherically symmetric assumption and
considering more general initial density and temperature profiles.
| math.AP | in this paper we establish the localintime existence and uniqueness of strong solutions to the free boundary problem of the full compressible navierstokes equations in threedimensional space the vanishing density and temperature condition is imposed on the free boundary which captures the motions of the nonisentropic viscous gas surrounded by vacuum with bounded entropy we also assume some proper decay rates of the density towards the boundary and singularities of derivatives of the temperature across the boundary on the initial data which coincides with the physical vacuum condition for the isentropic flows this extends the previous result of liu arxiv161207936 by removing the spherically symmetric assumption and considering more general initial density and temperature profiles | [['in', 'this', 'paper', 'we', 'establish', 'the', 'localintime', 'existence', 'and', 'uniqueness', 'of', 'strong', 'solutions', 'to', 'the', 'free', 'boundary', 'problem', 'of', 'the', 'full', 'compressible', 'navierstokes', 'equations', 'in', 'threedimensional', 'space', 'the', 'vanishing', 'density', 'and', 'temperature', 'condition', 'is', 'imposed', 'on', 'the', 'free', 'boundary', 'which', 'captures', 'the', 'motions', 'of', 'the', 'nonisentropic', 'viscous', 'gas', 'surrounded', 'by', 'vacuum', 'with', 'bounded', 'entropy', 'we', 'also', 'assume', 'some', 'proper', 'decay', 'rates', 'of', 'the', 'density', 'towards', 'the', 'boundary', 'and', 'singularities', 'of', 'derivatives', 'of', 'the', 'temperature', 'across', 'the', 'boundary', 'on', 'the', 'initial', 'data', 'which', 'coincides', 'with', 'the', 'physical', 'vacuum', 'condition', 'for', 'the', 'isentropic', 'flows', 'this', 'extends', 'the', 'previous', 'result', 'of', 'liu', 'arxiv161207936', 'by', 'removing', 'the', 'spherically', 'symmetric', 'assumption', 'and', 'considering', 'more', 'general', 'initial', 'density', 'and', 'temperature', 'profiles']] | [-0.17544580219066375, 0.12980009124843045, -0.07648763360696632, 0.005341046909483052, -0.04407712343565531, -0.07700031883034267, -0.009161924292831764, 0.2710497224736109, -0.2500378954747136, -0.2462027156480441, 0.14314874681529768, -0.23948125320633776, -0.025259149179123995, 0.13461513356550744, -0.05780480990105979, 0.10474051063749612, 0.041801920748854936, 0.020066275694325827, -0.11970348416402805, -0.20471230053890235, 0.437395599981149, 0.010521169882594493, 0.26897291309739413, 0.09014441987924408, 0.10605321540354277, -0.03495965193826379, -0.02619069520988616, 0.04730087177590018, -0.23252698887556203, 0.060673264683461174, 0.1595265643687494, 0.04082842719365369, 0.24308710623728602, -0.4436886933256398, -0.27148101891374643, 0.09548331874324695, 0.07192506144444148, 0.10812029738608225, -0.032682050622130636, -0.30176053178423135, 0.07567896638392356, -0.11969435811369565, -0.23537429454001157, -0.015053168625423783, 0.005761027442324057, 0.038528977627784275, -0.28051403867440267, 0.1822057055662235, 0.08910497323724262, 0.02669884516702344, -0.20423259269936303, -0.047674776372507936, -0.09393881657569293, 0.0670315311657951, 0.0877195281229848, 0.004610876675303045, 0.0958763859806615, -0.16542374447658004, 0.01729783330218899, 0.348729625156378, -0.10414434476804577, -0.24615452097107968, 0.21510198216460513, -0.18405581700305143, -0.0766408975673186, 0.1549349121520655, 0.1051737747784181, 0.15209120110477925, -0.12193396251256529, 0.13236398349277137, -0.07798605668256386, 0.11292439495241922, 0.1329204974892108, -0.02243011551163682, 0.16605245222321205, 0.10716679451676707, 0.12062793415399235, 0.1583556255096929, -0.05563491411323827, -0.12907195261990032, -0.3863397210738377, -0.1567272129917942, -0.15575346844924384, 0.07170609419291284, -0.12500668416683575, -0.20900485666239993, 0.3550665076340042, 0.1438323131664411, 0.17003792240039298, 0.05839801667510377, 0.29227638971714076, 0.1428648194608589, -0.016293685290995136, 0.15332424005477183, 0.22178983014907172, 0.18293411738500653, 0.14666089512767239, -0.2587456910323613, 0.05244546872174333, 0.12042703537774382] |
1,802.00128 | Direct photon production in relativistic heavy-ion collisions -- a
theory update | For tomographic studies of relativistic nuclear collisions and of the
quark-gluon plasma, photons (real and virtual) are unique. They are the only
probes than can be both soft and penetrating. First we report on advances in
modelling the hadron dynamics of heavy-ion collisions using a hybrid approach
which consists of IP-Glasma, relativistic fluid dynamics, and hadronic cascade
components. We briefly discuss the "photon flow puzzle", and then focus on a
recent development in the theory of photon emission from a non-equilibrium,
strongly interacting medium.
| hep-ph nucl-ex nucl-th | for tomographic studies of relativistic nuclear collisions and of the quarkgluon plasma photons real and virtual are unique they are the only probes than can be both soft and penetrating first we report on advances in modelling the hadron dynamics of heavyion collisions using a hybrid approach which consists of ipglasma relativistic fluid dynamics and hadronic cascade components we briefly discuss the photon flow puzzle and then focus on a recent development in the theory of photon emission from a nonequilibrium strongly interacting medium | [['for', 'tomographic', 'studies', 'of', 'relativistic', 'nuclear', 'collisions', 'and', 'of', 'the', 'quarkgluon', 'plasma', 'photons', 'real', 'and', 'virtual', 'are', 'unique', 'they', 'are', 'the', 'only', 'probes', 'than', 'can', 'be', 'both', 'soft', 'and', 'penetrating', 'first', 'we', 'report', 'on', 'advances', 'in', 'modelling', 'the', 'hadron', 'dynamics', 'of', 'heavyion', 'collisions', 'using', 'a', 'hybrid', 'approach', 'which', 'consists', 'of', 'ipglasma', 'relativistic', 'fluid', 'dynamics', 'and', 'hadronic', 'cascade', 'components', 'we', 'briefly', 'discuss', 'the', 'photon', 'flow', 'puzzle', 'and', 'then', 'focus', 'on', 'a', 'recent', 'development', 'in', 'the', 'theory', 'of', 'photon', 'emission', 'from', 'a', 'nonequilibrium', 'strongly', 'interacting', 'medium']] | [-0.07833907761821701, 0.24840471505497894, -0.1614727346736583, 0.06448755254088956, -0.01403244442882992, -0.0823132482279713, -0.08982841419527263, 0.3710590218903408, -0.20983785214567824, -0.2596757461849068, 0.03125417182274673, -0.3238153960223177, -0.03020458768809303, 0.1792850871348665, 0.07074434923318525, 0.06363046561074, 0.11267180412652947, -0.026638950842122238, -0.015525843795503966, -0.12831812020574165, 0.3448140770584966, 0.06478375130488227, 0.2448947796864169, 0.13838017656512203, 0.11270909360055589, 0.05374379902301977, -0.06599457985499785, 0.04678311555956801, -0.08395757694181936, 0.104203591650557, 0.2087285111137178, 0.10108610452152789, 0.2111115148152402, -0.4924052296915934, -0.24646113037930004, 0.044597033897714154, 0.15561330466187515, 0.1351775547553275, -0.08773513038786837, -0.2525568100723571, 0.010526173515245318, -0.21929820343696824, -0.1058249812728415, -0.06027776647048692, -0.02869236402745758, 0.04987987421641481, -0.23240090663672336, 0.07405779888254724, -0.023270702739301624, 0.014591898026299618, -0.02376537417599355, -0.08593500653348331, 0.005024446074717811, 0.03404745887521477, 0.018874177332257942, 0.03546739656234249, 0.2127215676397706, -0.23041622188507713, -0.1509968212728078, 0.4357276693030837, -0.028283515532945915, -0.11189603405295029, 0.24069976337653184, -0.18536638131453878, -0.178556654430438, 0.14714627958545906, 0.26143551539886783, 0.14272202827435518, -0.17991299150023787, 0.03467978625433586, -0.038317954167723656, 0.1367217202094339, 0.00987057679490785, 0.076942833495282, 0.24973144150516463, 0.2261739814864649, -0.07607342488864517, 0.1350663251373806, -0.08986954829500367, -0.10400326977417405, -0.3550943086322929, -0.12903358329952294, -0.15779692548260624, 0.048294689818119095, -0.03677496653229658, -0.10914210513943717, 0.3850553581114149, 0.12573926830996893, 0.17190342572506606, -0.06719569194856809, 0.3513686509270753, 0.08203938470355102, -0.04915920691564679, 0.10990401167267312, 0.30823553322503966, 0.181620293867863, 0.13836714741773903, -0.26442125851809534, -0.003987075105431445, 0.05483821479027115] |
1,802.00129 | Harmonically Trapped Four-Boson System | Four identical spinless bosons with purely attractive two-body short-range
interactions and repulsive three-body interactions under external spherically
symmetric harmonic confinement are considered. The repulsive three-body
potential prevents the formation of deeply-bound states with molecular
character. The low-energy spectrum with vanishing orbital angular momentum and
positive parity for infinitely large two-body $s$-wave scattering length is
analyzed in detail. Using the three-body contact, states are classified as
universal, quasi-universal, or strongly non-universal. Connections with the
zero-range interaction model are discussed. The energy spectrum is mapped out
as a function of the two-body $s$-wave scattering length $a_s$, $a_s>0$. In the
weakly- to medium-strongly-interacting regime, one of the states approaches the
energy obtained for a hard core interaction model. This state is identified as
the energetically lowest-lying "BEC state". Structural properties are also
presented.
| cond-mat.quant-gas | four identical spinless bosons with purely attractive twobody shortrange interactions and repulsive threebody interactions under external spherically symmetric harmonic confinement are considered the repulsive threebody potential prevents the formation of deeplybound states with molecular character the lowenergy spectrum with vanishing orbital angular momentum and positive parity for infinitely large twobody swave scattering length is analyzed in detail using the threebody contact states are classified as universal quasiuniversal or strongly nonuniversal connections with the zerorange interaction model are discussed the energy spectrum is mapped out as a function of the twobody swave scattering length a_s a_s0 in the weakly to mediumstronglyinteracting regime one of the states approaches the energy obtained for a hard core interaction model this state is identified as the energetically lowestlying bec state structural properties are also presented | [['four', 'identical', 'spinless', 'bosons', 'with', 'purely', 'attractive', 'twobody', 'shortrange', 'interactions', 'and', 'repulsive', 'threebody', 'interactions', 'under', 'external', 'spherically', 'symmetric', 'harmonic', 'confinement', 'are', 'considered', 'the', 'repulsive', 'threebody', 'potential', 'prevents', 'the', 'formation', 'of', 'deeplybound', 'states', 'with', 'molecular', 'character', 'the', 'lowenergy', 'spectrum', 'with', 'vanishing', 'orbital', 'angular', 'momentum', 'and', 'positive', 'parity', 'for', 'infinitely', 'large', 'twobody', 'swave', 'scattering', 'length', 'is', 'analyzed', 'in', 'detail', 'using', 'the', 'threebody', 'contact', 'states', 'are', 'classified', 'as', 'universal', 'quasiuniversal', 'or', 'strongly', 'nonuniversal', 'connections', 'with', 'the', 'zerorange', 'interaction', 'model', 'are', 'discussed', 'the', 'energy', 'spectrum', 'is', 'mapped', 'out', 'as', 'a', 'function', 'of', 'the', 'twobody', 'swave', 'scattering', 'length', 'a_s', 'a_s0', 'in', 'the', 'weakly', 'to', 'mediumstronglyinteracting', 'regime', 'one', 'of', 'the', 'states', 'approaches', 'the', 'energy', 'obtained', 'for', 'a', 'hard', 'core', 'interaction', 'model', 'this', 'state', 'is', 'identified', 'as', 'the', 'energetically', 'lowestlying', 'bec', 'state', 'structural', 'properties', 'are', 'also', 'presented']] | [-0.21577269356524528, 0.2599642712247464, -0.048585460776672515, 0.12986426496726655, 0.0086697470496026, -0.23883119156916244, -0.014423475978000797, 0.33704736475045827, -0.24265488884014677, -0.2188237887670019, -0.06251334607810533, -0.33711957240607154, -0.06378815834800344, 0.07870658158411294, 0.166727059991857, 0.08095624336120925, 0.06171152193474677, 0.0433213908889497, -0.05078243835677588, -0.19215391152186406, 0.3718411869030128, 0.02161412958647738, 0.1863932606128817, 0.1420149724192664, -0.026343309486559194, 0.08939395021647666, 0.0820252510787587, -0.03595819483446174, -0.13775861914478993, 0.03211378120652999, 0.2181445746493071, -0.06618067163382044, 0.15229138949265084, -0.38903688199009545, -0.20370647635007666, 0.10629556157676749, 0.20233225489627252, 0.14108015989971368, -0.02713096679401288, -0.3431081268476149, -0.03767053866235525, -0.2310767485814299, -0.1909661301327761, -0.10852497592099127, 0.08486642705072656, 0.023422125423716945, -0.23850439097587914, 0.15305755086321665, 0.04348834987112516, 0.004222801843181599, -0.13649023888820364, -0.14796558258578527, -0.0495509736225471, 0.05172509970973686, 0.060262888807139196, 0.021976484421662293, 0.1554550272737478, -0.16453442727793152, -0.08155397564721431, 0.4008831047532401, -0.05520788167040189, -0.212766102872529, 0.24536287128138393, -0.08604797619113395, -0.06048721088053182, 0.18120915487827371, 0.11137715512489568, 0.05289993934196153, -0.17314666877825594, 0.1315898164689844, -0.03648820981859814, 0.17856230215230856, 0.06366856662599846, 0.0801427377813835, 0.24498931679138264, 0.13798728166870022, -0.005354359984224619, 0.16364348467526046, -0.08259064120298266, -0.18671167538277517, -0.2863684391328531, -0.03161533214440641, -0.2237737232552076, 0.05210549743708887, -0.03326805693962857, -0.16638161230456922, 0.340450005780891, 0.020777917560911918, 0.2165955723725375, 0.02012528046286961, 0.2680288457136616, 0.1207605059368738, 0.0761691094340049, 0.0312773503630256, 0.30998428580315074, 0.16663978474445698, 0.01572887290696895, -0.3062975499291666, -0.010401885994428466, 0.06928262541381021] |
1,802.0013 | Distributed Newton Methods for Deep Neural Networks | Deep learning involves a difficult non-convex optimization problem with a
large number of weights between any two adjacent layers of a deep structure. To
handle large data sets or complicated networks, distributed training is needed,
but the calculation of function, gradient, and Hessian is expensive. In
particular, the communication and the synchronization cost may become a
bottleneck. In this paper, we focus on situations where the model is
distributedly stored, and propose a novel distributed Newton method for
training deep neural networks. By variable and feature-wise data partitions,
and some careful designs, we are able to explicitly use the Jacobian matrix for
matrix-vector products in the Newton method. Some techniques are incorporated
to reduce the running time as well as the memory consumption. First, to reduce
the communication cost, we propose a diagonalization method such that an
approximate Newton direction can be obtained without communication between
machines. Second, we consider subsampled Gauss-Newton matrices for reducing the
running time as well as the communication cost. Third, to reduce the
synchronization cost, we terminate the process of finding an approximate Newton
direction even though some nodes have not finished their tasks. Details of some
implementation issues in distributed environments are thoroughly investigated.
Experiments demonstrate that the proposed method is effective for the
distributed training of deep neural networks. In compared with stochastic
gradient methods, it is more robust and may give better test accuracy.
| stat.ML cs.LG math.OC | deep learning involves a difficult nonconvex optimization problem with a large number of weights between any two adjacent layers of a deep structure to handle large data sets or complicated networks distributed training is needed but the calculation of function gradient and hessian is expensive in particular the communication and the synchronization cost may become a bottleneck in this paper we focus on situations where the model is distributedly stored and propose a novel distributed newton method for training deep neural networks by variable and featurewise data partitions and some careful designs we are able to explicitly use the jacobian matrix for matrixvector products in the newton method some techniques are incorporated to reduce the running time as well as the memory consumption first to reduce the communication cost we propose a diagonalization method such that an approximate newton direction can be obtained without communication between machines second we consider subsampled gaussnewton matrices for reducing the running time as well as the communication cost third to reduce the synchronization cost we terminate the process of finding an approximate newton direction even though some nodes have not finished their tasks details of some implementation issues in distributed environments are thoroughly investigated experiments demonstrate that the proposed method is effective for the distributed training of deep neural networks in compared with stochastic gradient methods it is more robust and may give better test accuracy | [['deep', 'learning', 'involves', 'a', 'difficult', 'nonconvex', 'optimization', 'problem', 'with', 'a', 'large', 'number', 'of', 'weights', 'between', 'any', 'two', 'adjacent', 'layers', 'of', 'a', 'deep', 'structure', 'to', 'handle', 'large', 'data', 'sets', 'or', 'complicated', 'networks', 'distributed', 'training', 'is', 'needed', 'but', 'the', 'calculation', 'of', 'function', 'gradient', 'and', 'hessian', 'is', 'expensive', 'in', 'particular', 'the', 'communication', 'and', 'the', 'synchronization', 'cost', 'may', 'become', 'a', 'bottleneck', 'in', 'this', 'paper', 'we', 'focus', 'on', 'situations', 'where', 'the', 'model', 'is', 'distributedly', 'stored', 'and', 'propose', 'a', 'novel', 'distributed', 'newton', 'method', 'for', 'training', 'deep', 'neural', 'networks', 'by', 'variable', 'and', 'featurewise', 'data', 'partitions', 'and', 'some', 'careful', 'designs', 'we', 'are', 'able', 'to', 'explicitly', 'use', 'the', 'jacobian', 'matrix', 'for', 'matrixvector', 'products', 'in', 'the', 'newton', 'method', 'some', 'techniques', 'are', 'incorporated', 'to', 'reduce', 'the', 'running', 'time', 'as', 'well', 'as', 'the', 'memory', 'consumption', 'first', 'to', 'reduce', 'the', 'communication', 'cost', 'we', 'propose', 'a', 'diagonalization', 'method', 'such', 'that', 'an', 'approximate', 'newton', 'direction', 'can', 'be', 'obtained', 'without', 'communication', 'between', 'machines', 'second', 'we', 'consider', 'subsampled', 'gaussnewton', 'matrices', 'for', 'reducing', 'the', 'running', 'time', 'as', 'well', 'as', 'the', 'communication', 'cost', 'third', 'to', 'reduce', 'the', 'synchronization', 'cost', 'we', 'terminate', 'the', 'process', 'of', 'finding', 'an', 'approximate', 'newton', 'direction', 'even', 'though', 'some', 'nodes', 'have', 'not', 'finished', 'their', 'tasks', 'details', 'of', 'some', 'implementation', 'issues', 'in', 'distributed', 'environments', 'are', 'thoroughly', 'investigated', 'experiments', 'demonstrate', 'that', 'the', 'proposed', 'method', 'is', 'effective', 'for', 'the', 'distributed', 'training', 'of', 'deep', 'neural', 'networks', 'in', 'compared', 'with', 'stochastic', 'gradient', 'methods', 'it', 'is', 'more', 'robust', 'and', 'may', 'give', 'better', 'test', 'accuracy']] | [-0.13275679683057864, 0.02690427526462811, -0.03991740833263411, 0.06904352765563372, -0.10273736950756725, -0.18373139806022537, 0.059738815955291825, 0.4329297017137488, -0.31934890746749167, -0.3183494133609829, 0.13192047861129735, -0.22683788395832002, -0.19108536060004302, 0.1861751315179923, -0.11286025010410632, 0.09828028525426534, 0.12129931417364097, 0.009759037819658888, -0.08265267463490279, -0.32326186276823765, 0.2682590123330211, 0.07058114239269594, 0.28154050059624597, 0.012867385943034857, 0.09871198946962852, -0.011460217593562918, -0.010660840364991975, 0.0072269912764975994, -0.019072023324042675, 0.13728552278691245, 0.2928824964790316, 0.17831567476868854, 0.3492511776827902, -0.4910727284802525, -0.19204276687955354, 0.15415309649763692, 0.15797832062664133, 0.1193771570668042, -0.03805861544198455, -0.23590335047980449, 0.07826253665502761, -0.1531229633958368, -0.05427203567875228, -0.15123856900215193, -0.04955745703372141, 0.037091383925124725, -0.28511826060877926, 0.037548889083248875, 0.013821316649133724, 0.019292916354907933, -0.010712792116401974, -0.13069488186035946, 0.049793543606185646, 0.12292706375793104, 0.021345331333452185, 0.02433634744876803, 0.10896151609405683, -0.13409883073924495, -0.11071532460532738, 0.36426654965857624, -0.018005100712139996, -0.2297889993582242, 0.16839906207390193, -0.008780942261339453, -0.16384524550963322, 0.10626942870319532, 0.2501743988300561, 0.14141444661373528, -0.16469943368529444, 0.06599665802335447, 0.010958480048555368, 0.15797035758190886, 0.03477165086161253, -0.005796589530416832, 0.10342867193835915, 0.21182948012398717, 0.11768569877062089, 0.15101113436484692, -0.09005476052146244, -0.1041809938615188, -0.24437710874440982, -0.1396269192929171, -0.24465482988884543, -0.019309537067689737, -0.1250167070705582, -0.1534405421600617, 0.36072739003053544, 0.17101850575699215, 0.2244251115219507, 0.13193079609431904, 0.3668675765250649, 0.10391585662176206, 0.12384527877820174, 0.145466040091284, 0.1890058218439286, 0.06670394872821032, 0.1433090519923757, -0.20134798973783197, 0.08882136361729674, 0.0644410021446549] |
1,802.00131 | Higher order geometric flow of hypersurfaces in a Riemannian manifold | In this paper, we consider the high order geometric flows of a submanifolds
$M$ in a complete Riemannian manifold $N$ with $\dim(N)=\dim(M)+1=n+1$, which
were introduced by Mantegazza in the case the ambient space is an Euclidean
space, and extend some results due to Mantegazza to the present situation under
some assumptions on $N$. Precisely, we show that if $m\in\mathbb{N}$ is
strictly larger than the integer part of $n/2$ and $\varphi(t)$ is a immersion
for all $t\in[0,T)$ and if $\mathfrak{F}_m(\varphi_0)$ is bounded by a constant
which relies on the injectivity radius $\bar{R}>0$ and sectional curvature
$\bar{K}_{\pi}(\bar{K}_{\pi}\leqslant1)$ of $N$ , then $T$ must be $\infty$.
| math.DG | in this paper we consider the high order geometric flows of a submanifolds m in a complete riemannian manifold n with dimndimm1n1 which were introduced by mantegazza in the case the ambient space is an euclidean space and extend some results due to mantegazza to the present situation under some assumptions on n precisely we show that if minmathbbn is strictly larger than the integer part of n2 and varphit is a immersion for all tin0t and if mathfrakf_mvarphi_0 is bounded by a constant which relies on the injectivity radius barr0 and sectional curvature bark_pibark_pileqslant1 of n then t must be infty | [['in', 'this', 'paper', 'we', 'consider', 'the', 'high', 'order', 'geometric', 'flows', 'of', 'a', 'submanifolds', 'm', 'in', 'a', 'complete', 'riemannian', 'manifold', 'n', 'with', 'dimndimm1n1', 'which', 'were', 'introduced', 'by', 'mantegazza', 'in', 'the', 'case', 'the', 'ambient', 'space', 'is', 'an', 'euclidean', 'space', 'and', 'extend', 'some', 'results', 'due', 'to', 'mantegazza', 'to', 'the', 'present', 'situation', 'under', 'some', 'assumptions', 'on', 'n', 'precisely', 'we', 'show', 'that', 'if', 'minmathbbn', 'is', 'strictly', 'larger', 'than', 'the', 'integer', 'part', 'of', 'n2', 'and', 'varphit', 'is', 'a', 'immersion', 'for', 'all', 'tin0t', 'and', 'if', 'mathfrakf_mvarphi_0', 'is', 'bounded', 'by', 'a', 'constant', 'which', 'relies', 'on', 'the', 'injectivity', 'radius', 'barr0', 'and', 'sectional', 'curvature', 'bark_pibark_pileqslant1', 'of', 'n', 'then', 't', 'must', 'be', 'infty']] | [-0.15981814902922026, 0.1631290208447632, -0.046919309990290474, 0.030066939943935722, -0.06479715348259375, -0.1433239856316727, -0.030627970071747064, 0.34834560972391343, -0.22186383418323072, -0.23379620026835068, 0.16126476019283528, -0.28988579233005946, -0.1494121709672202, 0.1602866233027141, -0.13354443773931388, 0.014193696478305727, 0.025803880813550586, 0.11266766111271417, -0.06911005942407539, -0.28699115462772246, 0.40803403141243116, -0.02769638667339269, 0.16198015113228134, 0.08676649387735798, 0.1007767914585313, -0.0065137168145453445, 0.045489812763978024, 0.0697518944222366, -0.20537352833069197, 0.09931793561851492, 0.20702617364812034, 0.08696158785296947, 0.2596803072065457, -0.3869679055119656, -0.20616088600411098, 0.17445143054676604, 0.11102739350908265, -0.0065565068578841736, 0.011622374314263615, -0.2495890845026707, 0.1496522404153698, -0.0611022289804354, -0.13239568907159324, -0.05593869526281345, 0.08276396170638654, -0.025944563132539695, -0.29030080118017004, -0.0014069463573016074, 0.12934292263674493, 0.04935737486396517, -0.06367129326455903, -0.10896890960177597, -0.016307556726114482, 0.06143212397060148, 0.01892735936788234, 0.09572348349290538, 0.06759904089801926, -0.03767585176356821, -0.030207755600045225, 0.37656430255773726, -0.10997449946355155, -0.29027311032523917, 0.10747909194276649, -0.18949491775366573, -0.12107991780705597, 0.10558819746104431, 0.12590087881805945, 0.19584937715351733, -0.06778562098399413, 0.20327003852212422, -0.0644686128172016, 0.13916141407716334, 0.09826862707506029, -0.013033595815186903, 0.08041786643847519, 0.11213149473413217, 0.1840143276815664, 0.13911446035906141, -0.032602782099868874, -0.019976602244780074, -0.34972835274660313, -0.21132640627079777, -0.18076996312521834, 0.14717623735397903, -0.11438250244649754, -0.10474110446509202, 0.29818239816635544, 0.04827637241545076, 0.2544702975345509, 0.13238115151583843, 0.2719587530983536, 0.06360730143948173, 0.006867609692414348, 0.14074942449164785, 0.17312992948917577, 0.13994239718054555, 0.05611801161715875, -0.14023623870191526, 0.011719827381038696, 0.11524719005134028] |
1,802.00132 | Spin Seebeck effect and thermal spin galvanic effect in Ni80Fe20/p-Si
bilayers | The development of spintronics and spin-caloritronics devices need efficient
generation, detection and manipulation of spin current. The thermal spin
current from spin-Seebeck effect has been reported to be more energy efficient
than the electrical spin injection methods. But, spin detection has been the
one of the bottlenecks since metals with large spin-orbit coupling is an
essential requirement. In this work, we report an efficient thermal generation
and interfacial detection of spin current. We measured a spin-Seebeck effect in
Ni80Fe20 (25 nm)/p-Si (50 nm) (polycrystalline) bilayers without heavy metal
spin detector. The p-Si, having the centosymmetric crystal structure, has
insignificant intrinsic spin-orbit coupling leading to negligible spin-charge
conversion. We report a giant inverse spin-Hall effect, essential for detection
of spin-Seebeck effect, in the Ni80Fe20/p-Si bilayer structure, which
originates from Rashba spin orbit coupling due to structure inversion asymmetry
at the interface. In addition, the thermal spin pumping in p-Si leads to spin
current from p-Si to Ni80Fe20 layer due to thermal spin galvanic effect and
spin-Hall effect causing spin-orbit torques. The thermal spin-orbit torques
leads to collapse of magnetic hysteresis of 25 nm thick Ni80Fe20 layer. The
thermal spin-orbit torques can be used for efficient magnetic switching for
memory applications. These scientific breakthroughs may give impetus to the
silicon spintronics and spin-caloritronics devices.
| cond-mat.mes-hall cond-mat.mtrl-sci | the development of spintronics and spincaloritronics devices need efficient generation detection and manipulation of spin current the thermal spin current from spinseebeck effect has been reported to be more energy efficient than the electrical spin injection methods but spin detection has been the one of the bottlenecks since metals with large spinorbit coupling is an essential requirement in this work we report an efficient thermal generation and interfacial detection of spin current we measured a spinseebeck effect in ni80fe20 25 nmpsi 50 nm polycrystalline bilayers without heavy metal spin detector the psi having the centosymmetric crystal structure has insignificant intrinsic spinorbit coupling leading to negligible spincharge conversion we report a giant inverse spinhall effect essential for detection of spinseebeck effect in the ni80fe20psi bilayer structure which originates from rashba spin orbit coupling due to structure inversion asymmetry at the interface in addition the thermal spin pumping in psi leads to spin current from psi to ni80fe20 layer due to thermal spin galvanic effect and spinhall effect causing spinorbit torques the thermal spinorbit torques leads to collapse of magnetic hysteresis of 25 nm thick ni80fe20 layer the thermal spinorbit torques can be used for efficient magnetic switching for memory applications these scientific breakthroughs may give impetus to the silicon spintronics and spincaloritronics devices | [['the', 'development', 'of', 'spintronics', 'and', 'spincaloritronics', 'devices', 'need', 'efficient', 'generation', 'detection', 'and', 'manipulation', 'of', 'spin', 'current', 'the', 'thermal', 'spin', 'current', 'from', 'spinseebeck', 'effect', 'has', 'been', 'reported', 'to', 'be', 'more', 'energy', 'efficient', 'than', 'the', 'electrical', 'spin', 'injection', 'methods', 'but', 'spin', 'detection', 'has', 'been', 'the', 'one', 'of', 'the', 'bottlenecks', 'since', 'metals', 'with', 'large', 'spinorbit', 'coupling', 'is', 'an', 'essential', 'requirement', 'in', 'this', 'work', 'we', 'report', 'an', 'efficient', 'thermal', 'generation', 'and', 'interfacial', 'detection', 'of', 'spin', 'current', 'we', 'measured', 'a', 'spinseebeck', 'effect', 'in', 'ni80fe20', '25', 'nmpsi', '50', 'nm', 'polycrystalline', 'bilayers', 'without', 'heavy', 'metal', 'spin', 'detector', 'the', 'psi', 'having', 'the', 'centosymmetric', 'crystal', 'structure', 'has', 'insignificant', 'intrinsic', 'spinorbit', 'coupling', 'leading', 'to', 'negligible', 'spincharge', 'conversion', 'we', 'report', 'a', 'giant', 'inverse', 'spinhall', 'effect', 'essential', 'for', 'detection', 'of', 'spinseebeck', 'effect', 'in', 'the', 'ni80fe20psi', 'bilayer', 'structure', 'which', 'originates', 'from', 'rashba', 'spin', 'orbit', 'coupling', 'due', 'to', 'structure', 'inversion', 'asymmetry', 'at', 'the', 'interface', 'in', 'addition', 'the', 'thermal', 'spin', 'pumping', 'in', 'psi', 'leads', 'to', 'spin', 'current', 'from', 'psi', 'to', 'ni80fe20', 'layer', 'due', 'to', 'thermal', 'spin', 'galvanic', 'effect', 'and', 'spinhall', 'effect', 'causing', 'spinorbit', 'torques', 'the', 'thermal', 'spinorbit', 'torques', 'leads', 'to', 'collapse', 'of', 'magnetic', 'hysteresis', 'of', '25', 'nm', 'thick', 'ni80fe20', 'layer', 'the', 'thermal', 'spinorbit', 'torques', 'can', 'be', 'used', 'for', 'efficient', 'magnetic', 'switching', 'for', 'memory', 'applications', 'these', 'scientific', 'breakthroughs', 'may', 'give', 'impetus', 'to', 'the', 'silicon', 'spintronics', 'and', 'spincaloritronics', 'devices']] | [-0.19828599116022122, 0.19758708447874856, 0.009495515943992706, -0.029048560679491076, -0.12035295851528645, -0.14109726486328458, -0.0013496916796568604, 0.4102837514753143, -0.2807426293979266, -0.3488124905331504, 0.005446845556365414, -0.2837119725377609, -0.09261253568831654, 0.23278384828341325, 0.03915219106711447, 0.020866383410092178, -0.01734475948892179, -0.10524654923051241, -0.07245687082675951, -0.14254974135020304, 0.22227071395498657, 0.040463237977764084, 0.3431550133152909, 0.14762730589358225, 0.061773672926106624, -0.017270444186093907, 0.10851366541714275, -0.031244175993682195, -0.10920747679968675, 0.05257367589289234, 0.24291535783115598, -0.1578421055671892, 0.18624078129706462, -0.5209088365813451, -0.1673785477488612, 0.03352452040916043, 0.1188953679276719, 0.20851524462528426, -0.11767566262313353, -0.25771999851623106, 0.03535952275352819, -0.22391670671779484, -0.08407614967505825, -0.07057957620847793, 0.056725865606928154, -0.10147051940938191, -0.2657523977146151, 0.08653139156466794, 0.12566055874783724, 0.07544038112585744, -0.0420008290765552, -0.1659039485212859, -0.07897087179922632, 0.05808287710672067, 0.05480309655956392, 0.0507855774446701, 0.24522735274208354, -0.14659804253218076, -0.16567774638755337, 0.3281307010867056, -0.07674555631411273, -0.12149721265193962, 0.13486323637965444, -0.18132559716246932, -0.02407960409431585, 0.14993781186751134, 0.17205503565686134, 0.0968689958728473, -0.15574086483074573, 0.06008965888232481, 0.08291563889277832, 0.16048977230897263, 0.029939233669678548, 0.1148361806624702, 0.3283382907398932, 0.238460675382521, 0.05201336279500365, 0.15143393153058632, -0.20465447105289925, -0.009854633644932793, -0.14196978199872232, -0.17712592841126024, -0.20839628419572753, 0.1546364173248765, -0.044469899216797094, -0.15102624809369444, 0.37946566166356205, 0.22932662971683646, 0.0900589872262485, -0.08367827878544284, 0.3337314803042405, 0.11418792628794022, 0.15272450035304896, -0.0007804537019096426, 0.31931418910445203, 0.22339864192264422, 0.15819607819874018, -0.3479227201824653, 0.14016365321197857, -0.05416626950415472] |
1,802.00133 | Thirty-fold: Extreme gravitational lensing of a quiescent galaxy at
$z=1.6$ | We report the discovery of eMACSJ1341-QG-1, a quiescent galaxy at $z=1.594$
located behind the massive galaxy cluster eMACSJ1341.9$-$2442 ($z=0.835$). The
system was identified as a gravitationally lensed triple image in Hubble Space
Telescope images obtained as part of a snapshot survey of the most X-ray
luminous galaxy clusters at $z>0.5$ and spectroscopically confirmed in
ground-based follow-up observations with the ESO/X-Shooter spectrograph. From
the constraints provided by the triple image, we derive a first, crude model of
the mass distribution of the cluster lens, which predicts a gravitational
amplification of a factor of $\sim$30 for the primary image and a factor of
$\sim$6 for the remaining two images of the source, making eMACSJ1341-QG-1 by
far the most strongly amplified quiescent galaxy discovered to date. Our
discovery underlines the power of SNAPshot observations of massive, X-ray
selected galaxy clusters for lensing-assisted studies of faint background
populations.
| astro-ph.GA | we report the discovery of emacsj1341qg1 a quiescent galaxy at z1594 located behind the massive galaxy cluster emacsj134192442 z0835 the system was identified as a gravitationally lensed triple image in hubble space telescope images obtained as part of a snapshot survey of the most xray luminous galaxy clusters at z05 and spectroscopically confirmed in groundbased followup observations with the esoxshooter spectrograph from the constraints provided by the triple image we derive a first crude model of the mass distribution of the cluster lens which predicts a gravitational amplification of a factor of sim30 for the primary image and a factor of sim6 for the remaining two images of the source making emacsj1341qg1 by far the most strongly amplified quiescent galaxy discovered to date our discovery underlines the power of snapshot observations of massive xray selected galaxy clusters for lensingassisted studies of faint background populations | [['we', 'report', 'the', 'discovery', 'of', 'emacsj1341qg1', 'a', 'quiescent', 'galaxy', 'at', 'z1594', 'located', 'behind', 'the', 'massive', 'galaxy', 'cluster', 'emacsj134192442', 'z0835', 'the', 'system', 'was', 'identified', 'as', 'a', 'gravitationally', 'lensed', 'triple', 'image', 'in', 'hubble', 'space', 'telescope', 'images', 'obtained', 'as', 'part', 'of', 'a', 'snapshot', 'survey', 'of', 'the', 'most', 'xray', 'luminous', 'galaxy', 'clusters', 'at', 'z05', 'and', 'spectroscopically', 'confirmed', 'in', 'groundbased', 'followup', 'observations', 'with', 'the', 'esoxshooter', 'spectrograph', 'from', 'the', 'constraints', 'provided', 'by', 'the', 'triple', 'image', 'we', 'derive', 'a', 'first', 'crude', 'model', 'of', 'the', 'mass', 'distribution', 'of', 'the', 'cluster', 'lens', 'which', 'predicts', 'a', 'gravitational', 'amplification', 'of', 'a', 'factor', 'of', 'sim30', 'for', 'the', 'primary', 'image', 'and', 'a', 'factor', 'of', 'sim6', 'for', 'the', 'remaining', 'two', 'images', 'of', 'the', 'source', 'making', 'emacsj1341qg1', 'by', 'far', 'the', 'most', 'strongly', 'amplified', 'quiescent', 'galaxy', 'discovered', 'to', 'date', 'our', 'discovery', 'underlines', 'the', 'power', 'of', 'snapshot', 'observations', 'of', 'massive', 'xray', 'selected', 'galaxy', 'clusters', 'for', 'lensingassisted', 'studies', 'of', 'faint', 'background', 'populations']] | [-0.09782148882692313, 0.0486571914890278, -0.07508601876482177, 0.06351946384720776, -0.11901275380208653, -0.049515106337974325, 0.05391312576830387, 0.3687898720594218, -0.137980420461917, -0.37189676357011725, 0.08591530167405922, -0.31321532409094327, -0.052900275959884814, 0.2266672822214435, 0.022089563711226858, -0.020483874347074514, 0.10579234150443974, -0.03995213504153283, -0.009064578814907883, -0.31956774574181024, 0.3282607507409297, 0.12139240082652464, 0.16283258802876094, -0.10094768342555221, 0.134764656261371, -0.047156070377745656, -0.14915191213579942, -0.022895305388799126, -0.12650860623069052, 0.046204620235545196, 0.24739327640646566, 0.1668908567172917, 0.2537122621323342, -0.3147920680361508, -0.1984255314960967, 0.04096129287143041, 0.21534998205755532, 0.03554755025696227, -0.09077914446646715, -0.3386753839321679, 0.062414040105811655, -0.1342405130284546, -0.18429902161430758, 0.11293813811417969, -0.0075359983543056425, 0.006039246988149672, -0.19044975898344152, 0.14714077637143377, -0.021843723286568684, 0.06081196611719954, -0.13783092599661245, -0.05455913585627683, -0.0450333453176108, 0.09828228408294003, -0.017556365853834924, 0.07838855474340954, 0.17038242606935602, -0.23043016749128264, -0.032629897634424, 0.4071804550034504, -0.04853861797838914, 0.06513208213065119, 0.18768305718953157, -0.2292660609309147, -0.242217246779533, 0.1406603039193042, 0.14839658118023055, 0.12316493873899109, -0.19586360064355562, -0.006317731988086045, -0.025277359880180688, 0.23359283990138313, 0.03185767716435838, 0.06732633171051174, 0.328939962051265, 0.16779446093888994, 0.0302678938168203, 0.15581151188425993, -0.28218895611931044, 0.034925592587377034, -0.2311039055140186, -0.09577206384907239, -0.19322797477272521, 0.07770494858557563, -0.12156211202399105, -0.1288899415560121, 0.36297083654556506, 0.07642526390714177, 0.21311609317331037, 0.05168817063919302, 0.31216986197298463, 0.04577419584290716, 0.1474469200449649, 0.035724686581070406, 0.3503538502489019, 0.14939457133759057, 0.053266233437436285, -0.19687544452332395, 0.016733701820961153, 0.004470699177532334] |
1,802.00134 | Evaluation of Applicability of a Flare Trigger Model based on Comparison
of Geometric Structures | The triggering mechanism(s) and critical condition(s) of solar flares are
still not completely clarified, although various studies have attempted to
elucidate them. We have also proposed a theoretical flare-trigger model based
on MHD simulations Kusano et al. 2012, in which two types of small-scale bipole
field, the so-called Opposite Polarity (OP) and Reversed Shear (RS) types of
field, can trigger flares. In this study, we evaluated the applicability of our
flare-trigger model to observation of 32 flares that were observed by the Solar
Dynamics Observatory (SDO), by focusing on geometrical structures. We
classified the events into six types, including the OP and RS types, based on
photospheric magnetic field configuration, presence of precursor brightenings,
and shape of the initial flare ribbons. As a result, we found that
approximately 30% of the flares were consistent with our flare-trigger model,
and the number of RS type triggered flares is larger than that of the OP type.
We found none of the sampled events contradicts our flare model, although we
cannot clearly determine the trigger mechanism of 70% of the flares in this
study. We carefully investigated the applicability of our flare-trigger model
and the possibility that other models can explain the other 70% of the events.
Consequently, we concluded that our flare-trigger model has certainly proposed
important conditions for flare-triggering.
| astro-ph.SR | the triggering mechanisms and critical conditions of solar flares are still not completely clarified although various studies have attempted to elucidate them we have also proposed a theoretical flaretrigger model based on mhd simulations kusano et al 2012 in which two types of smallscale bipole field the socalled opposite polarity op and reversed shear rs types of field can trigger flares in this study we evaluated the applicability of our flaretrigger model to observation of 32 flares that were observed by the solar dynamics observatory sdo by focusing on geometrical structures we classified the events into six types including the op and rs types based on photospheric magnetic field configuration presence of precursor brightenings and shape of the initial flare ribbons as a result we found that approximately 30 of the flares were consistent with our flaretrigger model and the number of rs type triggered flares is larger than that of the op type we found none of the sampled events contradicts our flare model although we cannot clearly determine the trigger mechanism of 70 of the flares in this study we carefully investigated the applicability of our flaretrigger model and the possibility that other models can explain the other 70 of the events consequently we concluded that our flaretrigger model has certainly proposed important conditions for flaretriggering | [['the', 'triggering', 'mechanisms', 'and', 'critical', 'conditions', 'of', 'solar', 'flares', 'are', 'still', 'not', 'completely', 'clarified', 'although', 'various', 'studies', 'have', 'attempted', 'to', 'elucidate', 'them', 'we', 'have', 'also', 'proposed', 'a', 'theoretical', 'flaretrigger', 'model', 'based', 'on', 'mhd', 'simulations', 'kusano', 'et', 'al', '2012', 'in', 'which', 'two', 'types', 'of', 'smallscale', 'bipole', 'field', 'the', 'socalled', 'opposite', 'polarity', 'op', 'and', 'reversed', 'shear', 'rs', 'types', 'of', 'field', 'can', 'trigger', 'flares', 'in', 'this', 'study', 'we', 'evaluated', 'the', 'applicability', 'of', 'our', 'flaretrigger', 'model', 'to', 'observation', 'of', '32', 'flares', 'that', 'were', 'observed', 'by', 'the', 'solar', 'dynamics', 'observatory', 'sdo', 'by', 'focusing', 'on', 'geometrical', 'structures', 'we', 'classified', 'the', 'events', 'into', 'six', 'types', 'including', 'the', 'op', 'and', 'rs', 'types', 'based', 'on', 'photospheric', 'magnetic', 'field', 'configuration', 'presence', 'of', 'precursor', 'brightenings', 'and', 'shape', 'of', 'the', 'initial', 'flare', 'ribbons', 'as', 'a', 'result', 'we', 'found', 'that', 'approximately', '30', 'of', 'the', 'flares', 'were', 'consistent', 'with', 'our', 'flaretrigger', 'model', 'and', 'the', 'number', 'of', 'rs', 'type', 'triggered', 'flares', 'is', 'larger', 'than', 'that', 'of', 'the', 'op', 'type', 'we', 'found', 'none', 'of', 'the', 'sampled', 'events', 'contradicts', 'our', 'flare', 'model', 'although', 'we', 'can', 'not', 'clearly', 'determine', 'the', 'trigger', 'mechanism', 'of', '70', 'of', 'the', 'flares', 'in', 'this', 'study', 'we', 'carefully', 'investigated', 'the', 'applicability', 'of', 'our', 'flaretrigger', 'model', 'and', 'the', 'possibility', 'that', 'other', 'models', 'can', 'explain', 'the', 'other', '70', 'of', 'the', 'events', 'consequently', 'we', 'concluded', 'that', 'our', 'flaretrigger', 'model', 'has', 'certainly', 'proposed', 'important', 'conditions', 'for', 'flaretriggering']] | [-0.10639416522142443, 0.1413675409884816, -0.02996156316404359, 0.1228712439348007, -0.04559170641966267, -0.08735084517670949, 0.03839141923833826, 0.407868497586305, -0.17536126448636138, -0.3691573142663601, 0.07426864287331102, -0.2336856428973821, -0.17054993362345416, 0.23065111883317863, -0.028322366286291305, -0.00789913544403293, 0.0698505545258223, -0.022856151074205244, -0.023209968469635803, -0.24617695660061212, 0.28353124879537694, 0.08425180982892325, 0.2603386067998929, 0.008700419715584315, 0.049716242003175024, -0.07799706393382896, -0.041892275906279, 0.04155357952930307, -0.11785169496095377, 0.028703455415120725, 0.1476477561472658, 0.11548911353494169, 0.2067178131333219, -0.44855155048191275, -0.2646890740164496, 0.04493398136895047, 0.14929505283802794, 0.023589034321816176, -0.029179334503261014, -0.27228165129968607, 0.11001904966489096, -0.14715358545285984, -0.10591684586641917, -0.0023881678785616107, 0.030375256416187067, 0.032880993681712024, -0.24709223000196004, 0.06450519649994906, 0.08365508166586108, 0.06659337365572605, -0.13621964066720849, -0.09124334709112182, -0.05518333461304375, 0.08615148344147659, 0.10525489013659162, 0.010671989036373657, 0.1268276199484842, -0.08491779110018471, -0.1519597591789559, 0.34076878014991197, -0.016394422355723682, -0.07535112779502065, 0.2196211093639391, -0.18769637176579018, -0.17272701673850485, 0.13927363294578338, 0.14745346461892675, 0.10179625451351183, -0.14414392591565164, -0.0034170863405510853, -0.05063356110749236, 0.15361558126473646, 0.02910155000767474, 0.007429327233694494, 0.20967034747025187, 0.1495617629806383, -0.0385759813740952, 0.1294313802628419, -0.19830943421589386, -0.09144625372660278, -0.2966287617636802, -0.09746681743994604, -0.11115947197866413, 0.0307249271700964, -0.044650853191392385, -0.14941060500766296, 0.45530917978238894, 0.20512295075811857, 0.20161819297536235, -0.03641812818673858, 0.22643998594433412, 0.08105413081474738, 0.08561675403685813, 0.0958711404028699, 0.3206272592977407, 0.11936651799430507, 0.13725545400179018, -0.2199463689413537, 0.08729123655031648, 0.05241881451278993] |
1,802.00135 | Global Weak Solutions to Landau-Lifshitz Equations into Compact Lie
Algebras | In this paper, we consider a parabolic system from a bounded domain in a
Euclidean space or a closed Riemannian manifold into a unit sphere in a compact
Lie algebra $\mathfrak{g}$, which can be viewed as the extension of
Landau-Lifshtiz (LL) equation and was proposed by V. Arnold. We follow the
ideas taken from the work by the second author to show the existence of global
weak solutions to the Cauchy problems of such Landau-Lifshtiz equations from an
$n$-dimensional closed Riemannian manifold $\mathbb{T}$ or a bounded domain in
$\mathbb{R}^n$ into a unit sphere $S_\mathfrak{g}(1)$ in $\mathfrak{g}$. In
particular, we consider the Hamiltonian system associated with the nonlocal
energy--{\it micromagnetic energy} defined on a bounded domain of
$\mathbb{R}^3$ and show the initial-boundary value problem to such LL equation
without damping terms admits a global weak solution. The key ingredient of this
article consists of the choices of test functions and approximate equations.
| math.DG | in this paper we consider a parabolic system from a bounded domain in a euclidean space or a closed riemannian manifold into a unit sphere in a compact lie algebra mathfrakg which can be viewed as the extension of landaulifshtiz ll equation and was proposed by v arnold we follow the ideas taken from the work by the second author to show the existence of global weak solutions to the cauchy problems of such landaulifshtiz equations from an ndimensional closed riemannian manifold mathbbt or a bounded domain in mathbbrn into a unit sphere s_mathfrakg1 in mathfrakg in particular we consider the hamiltonian system associated with the nonlocal energyit micromagnetic energy defined on a bounded domain of mathbbr3 and show the initialboundary value problem to such ll equation without damping terms admits a global weak solution the key ingredient of this article consists of the choices of test functions and approximate equations | [['in', 'this', 'paper', 'we', 'consider', 'a', 'parabolic', 'system', 'from', 'a', 'bounded', 'domain', 'in', 'a', 'euclidean', 'space', 'or', 'a', 'closed', 'riemannian', 'manifold', 'into', 'a', 'unit', 'sphere', 'in', 'a', 'compact', 'lie', 'algebra', 'mathfrakg', 'which', 'can', 'be', 'viewed', 'as', 'the', 'extension', 'of', 'landaulifshtiz', 'll', 'equation', 'and', 'was', 'proposed', 'by', 'v', 'arnold', 'we', 'follow', 'the', 'ideas', 'taken', 'from', 'the', 'work', 'by', 'the', 'second', 'author', 'to', 'show', 'the', 'existence', 'of', 'global', 'weak', 'solutions', 'to', 'the', 'cauchy', 'problems', 'of', 'such', 'landaulifshtiz', 'equations', 'from', 'an', 'ndimensional', 'closed', 'riemannian', 'manifold', 'mathbbt', 'or', 'a', 'bounded', 'domain', 'in', 'mathbbrn', 'into', 'a', 'unit', 'sphere', 's_mathfrakg1', 'in', 'mathfrakg', 'in', 'particular', 'we', 'consider', 'the', 'hamiltonian', 'system', 'associated', 'with', 'the', 'nonlocal', 'energyit', 'micromagnetic', 'energy', 'defined', 'on', 'a', 'bounded', 'domain', 'of', 'mathbbr3', 'and', 'show', 'the', 'initialboundary', 'value', 'problem', 'to', 'such', 'll', 'equation', 'without', 'damping', 'terms', 'admits', 'a', 'global', 'weak', 'solution', 'the', 'key', 'ingredient', 'of', 'this', 'article', 'consists', 'of', 'the', 'choices', 'of', 'test', 'functions', 'and', 'approximate', 'equations']] | [-0.16877332546425108, 0.020921628980134728, -0.04161728096676066, 0.029870222650506362, -0.12309518611045922, -0.10615774555144464, -0.01623346689743224, 0.2880365386617934, -0.32651009479993764, -0.20877199339186203, 0.14031829892817668, -0.2707686790195452, -0.1383967159955832, 0.17722933945011626, -0.09843777327760293, 0.05071050700332437, 0.08104966493437485, 0.08348787264885749, -0.10044624566157558, -0.1886760811566939, 0.4261088407864528, -0.09146488042307549, 0.20136148029095716, 0.034075905404174, 0.1815926021718908, -0.011470771823902012, 0.038165655813883155, 0.050483354389292134, -0.16759941473343493, 0.09629269432019899, 0.23646796150228047, 0.06563648484888024, 0.3026464138509465, -0.44076643683345745, -0.20715876479259357, 0.14387517232371835, 0.17510409573359148, 0.027423021515837687, -0.016370238862982413, -0.3341116226645706, 0.07318948603989113, -0.1184352477711505, -0.18864414562806994, -0.016172949421111825, 0.018365397165548438, 0.0024752683563753456, -0.2795939693911647, 0.05895030400303959, 0.1335165861259107, 0.036409037281144536, -0.15951518603872988, -0.06810288537185968, -0.018296460130055543, 0.06435420572580326, -0.0020836028032841123, 0.11105535033342688, 0.061587369069457054, -0.06952121744540576, -0.10044062040353409, 0.4024452695521672, -0.102373821570595, -0.32778084532794904, 0.09732389839074644, -0.15421266010550616, -0.10321050414143979, 0.07649556623588057, 0.1806997314957129, 0.16244706171913212, -0.11830272301271254, 0.20862244920952397, -0.09474104350166661, 0.10372439618887645, 0.05738656624492739, -0.03464471013760384, 0.12944998381481992, 0.15586700481616061, 0.12099448941825401, 0.1610994990340903, -0.0029989035968782797, -0.08442289702797016, -0.36621695805062243, -0.18085726753485445, -0.18491928269263028, 0.14990214752445163, -0.09418849620247834, -0.1820834729389674, 0.38881480632679294, 0.059599864562707286, 0.2078393189565969, 0.07129436238513638, 0.23535757018950115, 0.14325446396674898, 0.027970264941377908, 0.09389036985293987, 0.14662118415588982, 0.13691778214439293, 0.08666937817109838, -0.1846781866278477, -0.040636235161456376, 0.16114603473140057] |
1,802.00136 | Redundancy of unbounded memory Markov classes with continuity conditions | We study the redundancy of universally compressing strings $X_1,\dots, X_n$
generated by a binary Markov source $p$ without any bound on the memory. To
better understand the connection between compression and estimation in the
Markov regime, we consider a class of Markov sources restricted by a continuity
condition. In the absence of an upper bound on memory, the continuity condition
implies that $p(X_0|X^{-1}_{-m})$ gets closer to the true probability
$p(X_0|X_{-\infty}^{-1})$ as $m$ increases, rather than vary around
arbitrarily. For such sources, we prove asymptotically matching upper and lower
bounds on the redundancy. In the process, we identify what sources in the class
matter the most from a redundancy perspective.
| cs.IT math.IT | we study the redundancy of universally compressing strings x_1dots x_n generated by a binary markov source p without any bound on the memory to better understand the connection between compression and estimation in the markov regime we consider a class of markov sources restricted by a continuity condition in the absence of an upper bound on memory the continuity condition implies that px_0x1_m gets closer to the true probability px_0x_infty1 as m increases rather than vary around arbitrarily for such sources we prove asymptotically matching upper and lower bounds on the redundancy in the process we identify what sources in the class matter the most from a redundancy perspective | [['we', 'study', 'the', 'redundancy', 'of', 'universally', 'compressing', 'strings', 'x_1dots', 'x_n', 'generated', 'by', 'a', 'binary', 'markov', 'source', 'p', 'without', 'any', 'bound', 'on', 'the', 'memory', 'to', 'better', 'understand', 'the', 'connection', 'between', 'compression', 'and', 'estimation', 'in', 'the', 'markov', 'regime', 'we', 'consider', 'a', 'class', 'of', 'markov', 'sources', 'restricted', 'by', 'a', 'continuity', 'condition', 'in', 'the', 'absence', 'of', 'an', 'upper', 'bound', 'on', 'memory', 'the', 'continuity', 'condition', 'implies', 'that', 'px_0x1_m', 'gets', 'closer', 'to', 'the', 'true', 'probability', 'px_0x_infty1', 'as', 'm', 'increases', 'rather', 'than', 'vary', 'around', 'arbitrarily', 'for', 'such', 'sources', 'we', 'prove', 'asymptotically', 'matching', 'upper', 'and', 'lower', 'bounds', 'on', 'the', 'redundancy', 'in', 'the', 'process', 'we', 'identify', 'what', 'sources', 'in', 'the', 'class', 'matter', 'the', 'most', 'from', 'a', 'redundancy', 'perspective']] | [-0.14271375345214157, 0.15933131241736276, -0.05618650687284002, 0.1151084587273655, -0.05077055382986213, -0.13262943757880724, 0.1335683578677545, 0.3455632797085515, -0.2744041830616803, -0.3035254348330548, 0.11161037253120165, -0.2636446403339505, -0.0869428918688236, 0.1937701694523724, -0.08454996904534523, 0.021383644409138258, 0.030251235385625578, 0.09929394177117637, -0.07252760169044067, -0.23216571782880993, 0.3238211304262698, 0.07161212526261806, 0.28916980022407857, -0.003114759478126174, 0.08309267308871984, 0.006050224455125699, -0.01870894764558734, -0.03571488399702673, -0.15980956634479657, 0.12040932040452679, 0.20090961572931748, 0.14371128743035702, 0.26933807526306014, -0.39033392336323997, -0.20761276804189258, 0.17746949283554106, 0.13891160318836848, 0.07848670424580156, -0.008936536264449148, -0.2635920450720222, 0.13776416549940945, -0.12709623893122318, -0.09203872718265123, 0.002171940544498301, 0.011662402198971989, -0.0012233171810039154, -0.2883857876784821, 0.033258238319899436, 0.14262519336401303, 0.018337649562522318, -0.07294983877669846, -0.08685958312354355, 0.02369810789649453, 0.08553097753950925, 0.029847635864443365, 0.04763782962016483, 0.08800664742120376, -0.156112540694972, -0.08699511505976737, 0.3188113184323726, -0.09192612936796955, -0.2273495389653422, 0.15844731922283176, -0.13676334784374894, -0.17540748650235316, 0.11294202319407295, 0.17434942959067978, 0.1207684307037113, -0.1296422424264879, 0.10867295898040147, -0.052855036637058185, 0.19594795785182825, 0.12270918461629059, 0.10603539424591532, 0.18146693320329102, 0.1266694994573699, 0.14177215350878852, 0.20859849237984865, -0.07568427568919539, -0.09226560769341538, -0.3130967504231729, -0.12955863096764328, -0.21428730841247348, 0.07912498960384629, -0.1525985638871593, -0.16262417362522003, 0.2746094903564864, 0.15370984946455912, 0.2073817790581662, 0.14030553878363328, 0.24781672134299146, 0.11315414672347535, 0.018190222204810827, 0.15061752279245547, 0.17699947034087138, 0.13574836409877045, 0.0356846793432868, -0.1651534182661448, 0.14644580898876083, 0.08416469244799951] |
1,802.00137 | Local Nonautonomous Schr\"{o}dinger Flows on K\"{a}hler Manifolds | $\,\,\,\,\,\,$In this paper, we prove that the nonautonomous Schr\"{o}dinger
flow from a compact Riemannian manifold into a K\"ahler manifold admits a local
solution. Under some certain conditions, the solution is unique and has higher
regularity.
| math.DG | in this paper we prove that the nonautonomous schrodinger flow from a compact riemannian manifold into a kahler manifold admits a local solution under some certain conditions the solution is unique and has higher regularity | [['in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'nonautonomous', 'schrodinger', 'flow', 'from', 'a', 'compact', 'riemannian', 'manifold', 'into', 'a', 'kahler', 'manifold', 'admits', 'a', 'local', 'solution', 'under', 'some', 'certain', 'conditions', 'the', 'solution', 'is', 'unique', 'and', 'has', 'higher', 'regularity']] | [-0.19985006052468504, -0.01145735526723521, -0.17194759946848664, 0.05580896501030241, -0.15225261358677278, -0.17127054845914244, -0.07690200150744723, 0.35186050832271576, -0.2747471462403025, -0.13313875432525363, 0.18296316481095606, -0.26956321841904096, -0.2008259658834764, 0.15892858879108515, -0.15950543638318776, 0.05731460228562355, 0.1358055184728333, 0.10339992669011866, -0.1347933533667986, -0.19230100034869144, 0.503814389875957, -0.07455105041818959, 0.22653922848403454, 0.09075596579184224, 0.21771252897701093, -0.10714358022170407, 0.11801728755235671, 0.059621406772306984, -0.18008158119898457, 0.07560373228043318, 0.21237651715720338, 0.10734187973264073, 0.32399647523249897, -0.4277967794133084, -0.24136021241013492, 0.19695908608181137, 0.08685882232551063, 0.07612448015383312, -0.11413993450946042, -0.3223206242280347, 0.14235659510429416, -0.05800499830927167, -0.2100057619756886, -0.12041399212820189, 0.0003816830792597362, -0.028687753714621067, -0.27726069555750915, 0.012935663626662323, 0.13128237878637655, 0.02012231182307005, -0.1951482606785638, 0.002491376136562654, -0.0719386789681656, 0.038425727747380733, 0.01717833689680057, 0.08897216189652682, 0.05137523602960365, -0.0718548981672419, -0.023892260755279233, 0.3893838243825095, -0.14180603378585407, -0.34367992830728844, 0.12022978564242034, -0.13509740563375608, -0.18445946466443794, 0.14892608534012522, 0.14589341109884638, 0.19059093328458923, -0.1727483398414084, 0.21024080762207242, -0.1259625231581075, 0.08742597830880966, 0.09698385037481785, 0.01340871752638902, 0.0791119246078389, 0.18428429319922413, 0.3043171938774841, 0.13814947550584164, 0.03489514301930155, -0.07707316992538316, -0.3295360378921032, -0.1993586579071624, -0.10188104127134595, 0.25041329081037217, -0.1819430658190478, -0.16298353198383536, 0.442605133248227, 0.014855775237083434, 0.18531311345951898, 0.1141169449314475, 0.20392349883913993, 0.13571273449675314, -0.02321708888879844, 0.1563608213194779, 0.17055456195708496, 0.16750344514314616, 0.1043315688414233, -0.143358945001715, -0.06621149203607014, 0.1604818658637149] |
1,802.00138 | Phase separation and hidden vortices induced by spin-orbit coupling in
spin-1 Bose-Einstein condensates | We investigate phase separation and hidden vortices in spin-orbit coupled
ferromagnetic BoseEinstein condensates with rotation and Rabi coupling. The
hidden vortices are invisible in density distribution but are visible in phase
distribution, which can carry angular momentum like the ordinary quantized
vortices. In the absence of the rotation, we observe the phase separation
induced by the spin-orbit coupling and determine the entire phase diagram of
the existence of phase separation. For the rotation case, in addition to the
phase separation, we demonstrate particularly that the spin-orbit coupling can
result in the hidden vortices and hidden vortex-antivortex pairs. The
corresponding entire phase diagrams are determined, depending on the interplay
of the spin-orbit coupling strength, the rotation frequency, and Rabi
frequency, which reveals the critical condition of the occurrence of the hidden
vortices and vortex-antivortex pairs. The hidden vortices here are proved to be
long-lived in the time scale of experiment by the dynamic analysis. These
findings not only provide a clear illustration of the phase separation in
spin-orbit coupled spinor Bose-Einstein condensates, but also open a new
direction for investigating the hidden vortices in high-spin quantum system.
| cond-mat.quant-gas | we investigate phase separation and hidden vortices in spinorbit coupled ferromagnetic boseeinstein condensates with rotation and rabi coupling the hidden vortices are invisible in density distribution but are visible in phase distribution which can carry angular momentum like the ordinary quantized vortices in the absence of the rotation we observe the phase separation induced by the spinorbit coupling and determine the entire phase diagram of the existence of phase separation for the rotation case in addition to the phase separation we demonstrate particularly that the spinorbit coupling can result in the hidden vortices and hidden vortexantivortex pairs the corresponding entire phase diagrams are determined depending on the interplay of the spinorbit coupling strength the rotation frequency and rabi frequency which reveals the critical condition of the occurrence of the hidden vortices and vortexantivortex pairs the hidden vortices here are proved to be longlived in the time scale of experiment by the dynamic analysis these findings not only provide a clear illustration of the phase separation in spinorbit coupled spinor boseeinstein condensates but also open a new direction for investigating the hidden vortices in highspin quantum system | [['we', 'investigate', 'phase', 'separation', 'and', 'hidden', 'vortices', 'in', 'spinorbit', 'coupled', 'ferromagnetic', 'boseeinstein', 'condensates', 'with', 'rotation', 'and', 'rabi', 'coupling', 'the', 'hidden', 'vortices', 'are', 'invisible', 'in', 'density', 'distribution', 'but', 'are', 'visible', 'in', 'phase', 'distribution', 'which', 'can', 'carry', 'angular', 'momentum', 'like', 'the', 'ordinary', 'quantized', 'vortices', 'in', 'the', 'absence', 'of', 'the', 'rotation', 'we', 'observe', 'the', 'phase', 'separation', 'induced', 'by', 'the', 'spinorbit', 'coupling', 'and', 'determine', 'the', 'entire', 'phase', 'diagram', 'of', 'the', 'existence', 'of', 'phase', 'separation', 'for', 'the', 'rotation', 'case', 'in', 'addition', 'to', 'the', 'phase', 'separation', 'we', 'demonstrate', 'particularly', 'that', 'the', 'spinorbit', 'coupling', 'can', 'result', 'in', 'the', 'hidden', 'vortices', 'and', 'hidden', 'vortexantivortex', 'pairs', 'the', 'corresponding', 'entire', 'phase', 'diagrams', 'are', 'determined', 'depending', 'on', 'the', 'interplay', 'of', 'the', 'spinorbit', 'coupling', 'strength', 'the', 'rotation', 'frequency', 'and', 'rabi', 'frequency', 'which', 'reveals', 'the', 'critical', 'condition', 'of', 'the', 'occurrence', 'of', 'the', 'hidden', 'vortices', 'and', 'vortexantivortex', 'pairs', 'the', 'hidden', 'vortices', 'here', 'are', 'proved', 'to', 'be', 'longlived', 'in', 'the', 'time', 'scale', 'of', 'experiment', 'by', 'the', 'dynamic', 'analysis', 'these', 'findings', 'not', 'only', 'provide', 'a', 'clear', 'illustration', 'of', 'the', 'phase', 'separation', 'in', 'spinorbit', 'coupled', 'spinor', 'boseeinstein', 'condensates', 'but', 'also', 'open', 'a', 'new', 'direction', 'for', 'investigating', 'the', 'hidden', 'vortices', 'in', 'highspin', 'quantum', 'system']] | [-0.24699525956455018, 0.2579421707402704, -0.05308221039983133, 0.0759189569150969, -0.05710236721932487, -0.10987872735131532, 0.055030153818949254, 0.35071684149724824, -0.2651721380251367, -0.30356361203756865, 0.04043247691363156, -0.22602559373994427, -0.10080999561825828, 0.13335159938952695, 0.06370133693049591, -0.003431288635618584, -0.01686132688485887, 0.009618750961293386, -0.07576073342007936, -0.19347202942095776, 0.3354657417193295, -0.052799462574228684, 0.3053095779501863, 0.04141457233032192, 0.05131618137301136, -0.024024416066666124, 0.053662265738552456, -0.03318192341905688, -0.11537779899338613, 0.023570358422735044, 0.19365508283328225, -0.03265258163383972, 0.16097331930437597, -0.41509401954470143, -0.16846133583545764, 0.10097208147698272, 0.207614980154841, 0.181896731362588, -0.050811838607118534, -0.34850271869205457, -0.0199663386960584, -0.11102766503069189, -0.14098941452641, -0.11427795060820156, 0.016873018952557238, 0.03971522044476813, -0.25027497008102395, 0.11211720150904805, 0.09585966035643573, 0.06819933251307536, -0.058198354499895244, -0.04143626663222989, -0.09669412247165637, 0.07610310965107493, 0.04438532488320463, 0.03524130864209065, 0.10529137813105618, -0.1727704351563858, -0.09878162226028821, 0.3479579331213108, -0.09375964059501947, -0.16345391466870018, 0.16362987718574942, -0.1736052821400345, -0.0659221058776502, 0.14881571407695252, 0.16052068905123779, 0.10109615477768363, -0.08602334487236916, 0.042732314370016775, -0.03847426624019801, 0.20837741847787183, 0.06993338705531212, 0.09580366733929603, 0.3124112386797224, 0.17661919038534984, 0.020550204596171778, 0.16560853222542773, -0.16204772087349806, -0.18756002947557918, -0.28800766057865596, -0.14137746159973685, -0.2012498732455956, 0.002564706683852985, -0.05600843759286793, -0.13900744281859406, 0.3942347068279501, 0.15010470192709197, 0.2085405329725222, -0.05705628216001255, 0.24787012817117796, 0.10409163601035552, 0.07101638309947986, 0.01587955528239329, 0.3325442631443542, 0.1881061530827234, 0.11022738128730286, -0.3334001817525194, 0.019153930867711704, 0.027210891741247828] |
1,802.00139 | Homological congruence formulae for characteristic classes of singular
varieties | For a pair $(f, g)$ of morphisms $f:X \to Z$ and $g:Y \to Z$ of (possibly
singular) complex algebraic varieties $X,Y,Z$, we present congruence formulae
for the difference $f_*T_{y*}(X) -g_*T_{y*}(Y)$ of pushforwards of the
corresponding motivic Hirzebruch classes $T_{y*}$. If we consider the special
pair of a fiber bundle $F \hookrightarrow E \to B$ and the projection $pr_2:F
\times B \to B$ as such a pair $(f,g)$, then we get a congruence formula for
the difference $f_*T_{y*}(E) -\chi_y(F)T_{y*}(B)$, which at degree level yields
a congruence formula for $\chi_y(E) -\chi_y(F)\chi_y(B)$, expressed in terms of
the Euler--Poincarv'e characteristic, Todd genus and signature in the case when
$F, E, B$ are non-singular and compact. We also extend the finer congruence
identities of Rovi--Yokura to the singular complex projective situation, by
using the corresponding intersection (co)homology invariants.
| math.AG math.AT | for a pair f g of morphisms fx to z and gy to z of possibly singular complex algebraic varieties xyz we present congruence formulae for the difference f_t_yx g_t_yy of pushforwards of the corresponding motivic hirzebruch classes t_y if we consider the special pair of a fiber bundle f hookrightarrow e to b and the projection pr_2f times b to b as such a pair fg then we get a congruence formula for the difference f_t_ye chi_yft_yb which at degree level yields a congruence formula for chi_ye chi_yfchi_yb expressed in terms of the eulerpoincarve characteristic todd genus and signature in the case when f e b are nonsingular and compact we also extend the finer congruence identities of roviyokura to the singular complex projective situation by using the corresponding intersection cohomology invariants | [['for', 'a', 'pair', 'f', 'g', 'of', 'morphisms', 'fx', 'to', 'z', 'and', 'gy', 'to', 'z', 'of', 'possibly', 'singular', 'complex', 'algebraic', 'varieties', 'xyz', 'we', 'present', 'congruence', 'formulae', 'for', 'the', 'difference', 'f_t_yx', 'g_t_yy', 'of', 'pushforwards', 'of', 'the', 'corresponding', 'motivic', 'hirzebruch', 'classes', 't_y', 'if', 'we', 'consider', 'the', 'special', 'pair', 'of', 'a', 'fiber', 'bundle', 'f', 'hookrightarrow', 'e', 'to', 'b', 'and', 'the', 'projection', 'pr_2f', 'times', 'b', 'to', 'b', 'as', 'such', 'a', 'pair', 'fg', 'then', 'we', 'get', 'a', 'congruence', 'formula', 'for', 'the', 'difference', 'f_t_ye', 'chi_yft_yb', 'which', 'at', 'degree', 'level', 'yields', 'a', 'congruence', 'formula', 'for', 'chi_ye', 'chi_yfchi_yb', 'expressed', 'in', 'terms', 'of', 'the', 'eulerpoincarve', 'characteristic', 'todd', 'genus', 'and', 'signature', 'in', 'the', 'case', 'when', 'f', 'e', 'b', 'are', 'nonsingular', 'and', 'compact', 'we', 'also', 'extend', 'the', 'finer', 'congruence', 'identities', 'of', 'roviyokura', 'to', 'the', 'singular', 'complex', 'projective', 'situation', 'by', 'using', 'the', 'corresponding', 'intersection', 'cohomology', 'invariants']] | [-0.21873445179136025, 0.05262569292192763, -0.07695889257500688, 0.08716477602276773, -0.07296462253379148, -0.1718492589647039, 0.013218754786066711, 0.3205578529926401, -0.32566138974849196, -0.19785844955948137, 0.017574272035355016, -0.2572695091754819, -0.09571355998161293, 0.20616403152604426, -0.06888647555994491, -0.004420616859865803, 0.02973492367983988, 0.11274333947914697, -0.12716231060524782, -0.27688030464230995, 0.39896466860932017, -0.08139861796406053, 0.1542212279099557, 0.049333842227324134, 0.10285840220084148, 0.03381258278479061, 0.014155689881937135, -0.02737024562647714, -0.16346730496956124, 0.12216166814138728, 0.29575183118198306, 0.08698854196284499, 0.15467079754711854, -0.3132373098845756, -0.06885761062296787, 0.2346548285660526, 0.08861024482988768, -0.052136388617486415, 0.04272500698506418, -0.253268798663547, 0.14393595753455654, -0.14803559971995936, -0.17583612836379972, -0.07608103712591978, 0.13508962361615093, 0.03309547623235082, -0.2799588928945244, 0.01453327104825312, 0.09738888485091073, 0.13559103817752902, 0.003076904760082326, -0.12863982128744414, -0.09693477339377361, 0.037992034609372255, 0.010499160828268421, 0.10190702136351897, 0.07196474755700263, -0.08934176386156607, -0.08043484904965947, 0.3871115083355338, -0.10368124379717286, -0.22835290140753228, 0.10617215095073103, -0.1864792898644708, -0.16582004981307638, 0.13148333871134718, 0.11487513989032734, 0.17518648912849288, -0.019654273026505492, 0.17598829555347384, -0.0764838194152126, 0.04193065814777381, 0.1388797896271128, -0.014354196768845357, 0.1520328926364152, 0.011806426521313066, 0.03231607906017748, 0.12548106998604322, -0.026707783064228437, 0.024362715859232203, -0.40352650582494715, -0.23998238569835112, -0.08025690588715767, 0.19109606718467104, -0.10791672627203211, -0.15788659956749707, 0.4066224717017677, 0.0016635360624936838, 0.2230005449262477, 0.11846865497026889, 0.2058745453296791, 0.10242129430370701, 0.024762954146209513, 0.017027272846520183, 0.09198640155724234, 0.20339241255969104, -0.020059580355351384, -0.13172463215665803, -0.026378991366881464, 0.2084549209509518] |
1,802.0014 | Minimal Determination of a Pure State through Adaptive Tomography | Finding the least measurement settings to determine an arbitrary pure state
has been long known as the Pauli problem. In the fixed measurement scheme four
orthonormal bases are required even though there are far less parameters in a
pure state. Peres conjectured that two unbiased bases suffice to determine a
pure state up to some finite ambiguities. Here we shall at first prove Peres
conjecture in the case of $d=3,4$, namely, two unbiased measurements determine
a pure state up to to 6 and 16 candidates for a qutrit and ququad,
respectively. And then, taking Peres' conjecture for established, we propose an
adaptive 3-measurement scheme involving the minimal number of measurements,
based on the observation that the ambiguities can be removed by an adaptive
two-outcome projective measurement. With the help of this observation, we
simplify a recent five-basis protocol $[Phys. Rev. Lett. 115, 090401 (2015)]$
to a three-basis one at the cost of the extra dichotomic measurement.
| quant-ph | finding the least measurement settings to determine an arbitrary pure state has been long known as the pauli problem in the fixed measurement scheme four orthonormal bases are required even though there are far less parameters in a pure state peres conjectured that two unbiased bases suffice to determine a pure state up to some finite ambiguities here we shall at first prove peres conjecture in the case of d34 namely two unbiased measurements determine a pure state up to to 6 and 16 candidates for a qutrit and ququad respectively and then taking peres conjecture for established we propose an adaptive 3measurement scheme involving the minimal number of measurements based on the observation that the ambiguities can be removed by an adaptive twooutcome projective measurement with the help of this observation we simplify a recent fivebasis protocol phys rev lett 115 090401 2015 to a threebasis one at the cost of the extra dichotomic measurement | [['finding', 'the', 'least', 'measurement', 'settings', 'to', 'determine', 'an', 'arbitrary', 'pure', 'state', 'has', 'been', 'long', 'known', 'as', 'the', 'pauli', 'problem', 'in', 'the', 'fixed', 'measurement', 'scheme', 'four', 'orthonormal', 'bases', 'are', 'required', 'even', 'though', 'there', 'are', 'far', 'less', 'parameters', 'in', 'a', 'pure', 'state', 'peres', 'conjectured', 'that', 'two', 'unbiased', 'bases', 'suffice', 'to', 'determine', 'a', 'pure', 'state', 'up', 'to', 'some', 'finite', 'ambiguities', 'here', 'we', 'shall', 'at', 'first', 'prove', 'peres', 'conjecture', 'in', 'the', 'case', 'of', 'd34', 'namely', 'two', 'unbiased', 'measurements', 'determine', 'a', 'pure', 'state', 'up', 'to', 'to', '6', 'and', '16', 'candidates', 'for', 'a', 'qutrit', 'and', 'ququad', 'respectively', 'and', 'then', 'taking', 'peres', 'conjecture', 'for', 'established', 'we', 'propose', 'an', 'adaptive', '3measurement', 'scheme', 'involving', 'the', 'minimal', 'number', 'of', 'measurements', 'based', 'on', 'the', 'observation', 'that', 'the', 'ambiguities', 'can', 'be', 'removed', 'by', 'an', 'adaptive', 'twooutcome', 'projective', 'measurement', 'with', 'the', 'help', 'of', 'this', 'observation', 'we', 'simplify', 'a', 'recent', 'fivebasis', 'protocol', 'phys', 'rev', 'lett', '115', '090401', '2015', 'to', 'a', 'threebasis', 'one', 'at', 'the', 'cost', 'of', 'the', 'extra', 'dichotomic', 'measurement']] | [-0.11411202830985483, 0.14555913014412095, -0.062095588269202334, -0.013271583977161515, -0.02792565133208164, -0.18225709791907943, 0.09623088776501582, 0.34474344383373756, -0.21477049867328452, -0.3283572483403412, 0.10203194589427624, -0.2725521862341434, -0.07526462121007314, 0.17593285542802492, -0.0797325481054079, 0.0801473753427241, 0.05233931343383646, 0.02423017248388772, -0.10342089063066708, -0.31491835884700875, 0.26380105118273367, 0.048211775977458605, 0.25423384999464216, 0.031062318025904364, 0.13099015715047962, 0.049132274292213354, -0.032460593722613625, -0.015126048486165115, -0.14805252958706805, 0.0541617813984263, 0.25473837331427557, 0.1188022558589613, 0.2560888363177104, -0.39417222169178884, -0.16798271114729638, 0.15890335542912667, 0.08840894347399865, 0.16669189350795932, 0.0028561688109460335, -0.2672544116763962, 0.06219747678934302, -0.16699211821450213, -0.14853817182838133, -0.11163438115985819, 0.04132059696865709, -0.08978251202681445, -0.3126344314016598, 0.07688142212741934, 0.05241852394292915, 0.038484363041597566, -0.014382721495502139, -0.11260519192652091, 0.018498627389291006, 0.09105929459512577, -0.04514014428653019, 0.05004284915278396, 0.04646515818680391, -0.04179886962734408, -0.19637451021117158, 0.29793018821050954, -0.03920218368109904, -0.21251651173531028, 0.18039473523784086, -0.13700556532345026, -0.17942371409950092, 0.0921135182847808, 0.09542846382522073, 0.13442143325166972, -0.14312384693613767, 0.04899429909672012, -0.09242376382769037, 0.17074688288113593, 0.11059559454014034, 0.05140734236001184, 0.11093571763730754, 0.08114235184084943, 0.07575512369849573, 0.12248611495459427, -0.06751385467635516, -0.06980058695128384, -0.3267516196754418, -0.17355852005896036, -0.20106219432292213, 0.11543162095691323, -0.03938480158534443, -0.09934195495627232, 0.33848530169756197, 0.1539253477822058, 0.20575287349301538, 0.015118878585972675, 0.24265625186901735, 0.07236017941537093, 0.01047094483663769, 0.09133587574194137, 0.2756171791064078, 0.17218995368947568, 0.024960051836196248, -0.1874097116432447, 0.04694357292656174, 0.05316114717769731] |
1,802.00141 | On the bio-habitability of M-dwarf planets | The recent detection of Earth-sized planets in the habitable zone of Proxima
Centauri, Trappist-1 and many other nearby M-type stars has led to
speculations, whether liquid water and life actually exist on these planets. To
a large extent, the answer depends on their yet unknown atmospheres, which may
though be within observational reach in the near future by JWST, ELT and other
planned telescopes. We consider the habitability of planets of M-type stars in
the context of their atmospheric properties, heat transport and irradiation.
Instead of the traditional definition of the habitable zone, we define the
bio-habitable zone, where liquid water and complex organic molecules can
survive on at least part of the planetary surface. The atmospheric impact on
the temperature is quantified in terms of the heating factor (a combination of
greenhouse heating, stellar irradiation, albedo etc.) and heat redistribution
(horizontal energy transport). We investigate the bio-habitable domain (where
planets can support surface liquid water and organics) in terms of these two
factors. Our results suggest that planets orbiting M-type stars may have
life-supporting temperatures, at least on part of their surface, for a wide
range of atmospheric properties. We apply this analyses to Proxima b and the
Trappist-1 system. Finally we discuss the implications to the search of
biosignatures and demonstrate how they may be used to estimate the abundance of
photosynthesis and biotic planets.
| astro-ph.EP | the recent detection of earthsized planets in the habitable zone of proxima centauri trappist1 and many other nearby mtype stars has led to speculations whether liquid water and life actually exist on these planets to a large extent the answer depends on their yet unknown atmospheres which may though be within observational reach in the near future by jwst elt and other planned telescopes we consider the habitability of planets of mtype stars in the context of their atmospheric properties heat transport and irradiation instead of the traditional definition of the habitable zone we define the biohabitable zone where liquid water and complex organic molecules can survive on at least part of the planetary surface the atmospheric impact on the temperature is quantified in terms of the heating factor a combination of greenhouse heating stellar irradiation albedo etc and heat redistribution horizontal energy transport we investigate the biohabitable domain where planets can support surface liquid water and organics in terms of these two factors our results suggest that planets orbiting mtype stars may have lifesupporting temperatures at least on part of their surface for a wide range of atmospheric properties we apply this analyses to proxima b and the trappist1 system finally we discuss the implications to the search of biosignatures and demonstrate how they may be used to estimate the abundance of photosynthesis and biotic planets | [['the', 'recent', 'detection', 'of', 'earthsized', 'planets', 'in', 'the', 'habitable', 'zone', 'of', 'proxima', 'centauri', 'trappist1', 'and', 'many', 'other', 'nearby', 'mtype', 'stars', 'has', 'led', 'to', 'speculations', 'whether', 'liquid', 'water', 'and', 'life', 'actually', 'exist', 'on', 'these', 'planets', 'to', 'a', 'large', 'extent', 'the', 'answer', 'depends', 'on', 'their', 'yet', 'unknown', 'atmospheres', 'which', 'may', 'though', 'be', 'within', 'observational', 'reach', 'in', 'the', 'near', 'future', 'by', 'jwst', 'elt', 'and', 'other', 'planned', 'telescopes', 'we', 'consider', 'the', 'habitability', 'of', 'planets', 'of', 'mtype', 'stars', 'in', 'the', 'context', 'of', 'their', 'atmospheric', 'properties', 'heat', 'transport', 'and', 'irradiation', 'instead', 'of', 'the', 'traditional', 'definition', 'of', 'the', 'habitable', 'zone', 'we', 'define', 'the', 'biohabitable', 'zone', 'where', 'liquid', 'water', 'and', 'complex', 'organic', 'molecules', 'can', 'survive', 'on', 'at', 'least', 'part', 'of', 'the', 'planetary', 'surface', 'the', 'atmospheric', 'impact', 'on', 'the', 'temperature', 'is', 'quantified', 'in', 'terms', 'of', 'the', 'heating', 'factor', 'a', 'combination', 'of', 'greenhouse', 'heating', 'stellar', 'irradiation', 'albedo', 'etc', 'and', 'heat', 'redistribution', 'horizontal', 'energy', 'transport', 'we', 'investigate', 'the', 'biohabitable', 'domain', 'where', 'planets', 'can', 'support', 'surface', 'liquid', 'water', 'and', 'organics', 'in', 'terms', 'of', 'these', 'two', 'factors', 'our', 'results', 'suggest', 'that', 'planets', 'orbiting', 'mtype', 'stars', 'may', 'have', 'lifesupporting', 'temperatures', 'at', 'least', 'on', 'part', 'of', 'their', 'surface', 'for', 'a', 'wide', 'range', 'of', 'atmospheric', 'properties', 'we', 'apply', 'this', 'analyses', 'to', 'proxima', 'b', 'and', 'the', 'trappist1', 'system', 'finally', 'we', 'discuss', 'the', 'implications', 'to', 'the', 'search', 'of', 'biosignatures', 'and', 'demonstrate', 'how', 'they', 'may', 'be', 'used', 'to', 'estimate', 'the', 'abundance', 'of', 'photosynthesis', 'and', 'biotic', 'planets']] | [-0.09815459826366148, 0.18690044483583834, -0.03955051098225845, 0.06431265525933769, -0.10001902395290219, -0.025333521134323543, 0.12021405881891647, 0.349012552888857, -0.1917079308939477, -0.3475722985507713, 0.12344371610372845, -0.2884171228069398, -0.11936970930675872, 0.21580063467120958, -0.09272655301209953, 0.02184052466466609, 0.1188401449409624, -0.037926531820299314, -0.01544686719102578, -0.26535492352416945, 0.3005134991183877, 0.06810971611696813, 0.07354084603566055, 0.08961677879095077, 0.007398300516522593, -0.10045756288183232, -0.009890291574928496, -0.06282672750867076, -0.1998649846359169, 0.04890985579954253, 0.28500961840566663, 0.11775709979546567, 0.2072506721317768, -0.4358826399739418, -0.2898696480815609, 0.0938725110662118, 0.12695852118010711, 0.006489977192444106, -0.03827952024112973, -0.23950268170071973, 0.03997015828732401, -0.15781327731700406, -0.17571499984711408, -0.01634867170204719, 0.04013780523919397, 0.012457859660628148, -0.22421101255859766, 0.02761303413607594, 0.05884838068857789, 0.13776934726784626, -0.15273711738901005, -0.18637497070814588, -0.08370468054898084, 0.12200918551469739, 0.024114341216009052, -0.028475412257119186, 0.23068843582438098, -0.12290530256254392, -0.012662522999776734, 0.42695157046947213, -0.1281056980206631, -0.08346680206867556, 0.2968677462368376, -0.24280803115314079, -0.11063839233583875, 0.10948495696195298, 0.21431693266870247, 0.1516422233916819, -0.15499133859243658, 0.003174705855910563, -0.01609155806298885, 0.14186249438673257, 0.10114859192425178, 0.07037536580736438, 0.3899276835699048, 0.18838303027053674, 0.0804201939357962, 0.047163133572062685, -0.2160541293821815, -0.03689689565036032, -0.17206918991688225, -0.21412723808238904, -0.13619144396235547, 0.03389392050190104, -0.06431794234590295, -0.15455092798504563, 0.37770967403633726, 0.1871939669192458, 0.12322689728707903, -0.02912563496321026, 0.2675831761361203, 0.0667449227353144, 0.08922678842131669, 0.08780436183843347, 0.3108632233438806, 0.11508294841998981, 0.08247369368457132, -0.29419794727090953, 0.1340427152884917, -0.017283189970379073] |
1,802.00142 | Decay Estimations of Higher Derivatives of Solutions to Nonlinear Dirac
Equation with Spin Null Structure | We get decay rate of higher derivatives of nonlinear massless Dirac equations
with a kind of "good" spin null form. The method we rely on is similar to that
of Li and Zang. However, they only give the decay rate of solution itself to
nonlinear massless Dirac system.
| math.DG | we get decay rate of higher derivatives of nonlinear massless dirac equations with a kind of good spin null form the method we rely on is similar to that of li and zang however they only give the decay rate of solution itself to nonlinear massless dirac system | [['we', 'get', 'decay', 'rate', 'of', 'higher', 'derivatives', 'of', 'nonlinear', 'massless', 'dirac', 'equations', 'with', 'a', 'kind', 'of', 'good', 'spin', 'null', 'form', 'the', 'method', 'we', 'rely', 'on', 'is', 'similar', 'to', 'that', 'of', 'li', 'and', 'zang', 'however', 'they', 'only', 'give', 'the', 'decay', 'rate', 'of', 'solution', 'itself', 'to', 'nonlinear', 'massless', 'dirac', 'system']] | [-0.147184911222818, 0.11285606137244031, -0.06629058722561847, 0.07329844460521902, -0.13513138129686317, -0.17960611628950574, 0.03548365709139034, 0.3087483945613106, -0.2055817567743361, -0.2585477258544415, 0.052129125678523756, -0.30353288668751094, -0.14243484827845046, 0.20181774153995016, 0.002158363306079991, 0.09051088635654499, 0.06684437952450632, 0.08211063878358497, -0.10161285073506103, -0.2902812170408045, 0.33364919437250745, 0.03476001415401697, 0.24649552069604397, 0.01776443738102292, 0.11995365819893777, -0.013558998708807243, 0.04402716038748622, -0.04773828637553379, -0.11042013217790252, 0.09169826094876043, 0.1521973893880689, 0.07021948329444665, 0.19838139038377753, -0.4364812211521591, -0.165754948403143, 0.07472020267353703, 0.17083437241187008, 0.14220650936476886, -0.08024843851308106, -0.2745108559805279, 0.12009977307510174, -0.13102251742384396, -0.17450903507415205, -0.10418647343370442, -0.038628478650934994, 0.011096886114197938, -0.26739215579194325, 0.1807418703683652, 0.07761031814152375, -0.02534466180562352, -0.08088827920922388, -0.1072723557857292, -0.057042594106557466, 0.06689399491491106, 0.11753388324480814, -0.00525767191235597, 0.0589316634577699, -0.13268212566617876, -0.07879389680844422, 0.37772219158553827, -0.1468328749324428, -0.2528805711772293, 0.18983513038256206, -0.20663263809789592, -0.07912625956426685, 0.1780123247493369, 0.17356226146997264, 0.16355045624853423, -0.13992290600435808, 0.09803559546586864, -0.03922519244952127, 0.15275784966070205, 0.09051870661399637, 0.07429214370010111, 0.17783379443183853, 0.10935296345269307, 0.09518156837051113, 0.04820791573729366, 0.00702827697872029, -0.07923913970201586, -0.310158391095077, -0.23470359059865586, -0.1493845145062854, 0.13585682900156826, -0.054815440740336875, -0.21171720364751914, 0.3775500561023364, 0.11664731064350538, 0.17097741559458277, 0.02589273068588227, 0.22463104307341078, 0.21979216533266785, 0.04249505675397813, 0.04938366175823224, 0.2671953831256057, 0.15217335964067993, 0.11574145698493037, -0.2415579375034819, 0.005128240707563236, 0.12133687901465844] |
1,802.00143 | Invariant Whitney Functions | A theorem of Gerald Schwarz [24, Thm. 1] says that for a linear action of a
compact Lie group $G$ on a finite dimensional real vector space $V$ any smooth
$G$-invariant function on $V$ can be written as a composite with the Hilbert
map. We prove a similar statement for the case of Whitney functions along a
subanalytic set $Z\subset V$ fulfilling some regularity assumptions. In order
to deal with the case when $Z$ is not $G$-stable we use the language of
groupoids.
| math.SG math.AC math.AG | a theorem of gerald schwarz 24 thm 1 says that for a linear action of a compact lie group g on a finite dimensional real vector space v any smooth ginvariant function on v can be written as a composite with the hilbert map we prove a similar statement for the case of whitney functions along a subanalytic set zsubset v fulfilling some regularity assumptions in order to deal with the case when z is not gstable we use the language of groupoids | [['a', 'theorem', 'of', 'gerald', 'schwarz', '24', 'thm', '1', 'says', 'that', 'for', 'a', 'linear', 'action', 'of', 'a', 'compact', 'lie', 'group', 'g', 'on', 'a', 'finite', 'dimensional', 'real', 'vector', 'space', 'v', 'any', 'smooth', 'ginvariant', 'function', 'on', 'v', 'can', 'be', 'written', 'as', 'a', 'composite', 'with', 'the', 'hilbert', 'map', 'we', 'prove', 'a', 'similar', 'statement', 'for', 'the', 'case', 'of', 'whitney', 'functions', 'along', 'a', 'subanalytic', 'set', 'zsubset', 'v', 'fulfilling', 'some', 'regularity', 'assumptions', 'in', 'order', 'to', 'deal', 'with', 'the', 'case', 'when', 'z', 'is', 'not', 'gstable', 'we', 'use', 'the', 'language', 'of', 'groupoids']] | [-0.1758519942053111, 0.03480334188340299, -0.08681834683848576, 0.08030419018686222, -0.12844501395361968, -0.144506903999227, 0.02530267048088542, 0.3618268118946847, -0.2974081648042403, -0.17125058020408973, 0.09302476841075548, -0.24749412783702096, -0.10463617950767638, 0.21663556099835649, -0.13116910017631297, -0.019039025608764356, 0.0836567763710417, 0.1048457119838301, -0.10850365227368851, -0.2898479183933821, 0.40697477643479063, -0.12881743921954408, 0.18023349099556904, 0.02863771679351129, 0.14372632420812564, 0.027996189151722264, 0.013228134930986598, 0.018351018131101862, -0.12711714465405682, 0.09078986065866179, 0.2819788828604372, 0.09626201070923672, 0.2953928825725992, -0.3164068065718355, -0.17637400807117123, 0.18825608589518142, 0.06388106981449458, -0.024290493689477444, -0.005325733375432621, -0.28679899162197686, 0.1520789790595601, -0.14023944669044072, -0.17137317978272057, -0.06279402158885117, 0.0862441023037466, 0.010979855994144118, -0.3019329217607604, -0.013623906838068044, 0.1228727453601468, 0.11172054545583585, -0.06589355529566486, -0.08623753511627395, -0.09411308959586523, 0.03308224914131226, -0.05394430192894336, 0.16502934647162995, 0.07812677034726001, -0.049410000702675504, -0.09680710587628095, 0.39382283217890796, -0.1282333366759402, -0.29676088772669257, 0.15868179977756464, -0.17999575763424658, -0.18086301491326506, 0.09329014353689749, 0.11446841119463186, 0.1461512918628932, -0.052779551105418085, 0.2286250469813415, -0.1320687959599028, 0.11020251738289034, 0.09719515067850609, -0.02340444429856108, 0.09998409848390932, 0.09477093409051199, 0.12357202450554054, 0.09534784134741064, 0.01867339149095028, 0.03787852184151311, -0.39941134806497985, -0.21811591299721994, -0.1558270442737154, 0.16565451751121585, -0.10241916846394179, -0.1821797276084053, 0.3673850530814604, 0.03918068471900468, 0.2057488188315856, 0.12196816909070833, 0.19032837697360888, 0.10410000805210755, 0.06761602834652526, 0.0865642697247396, 0.09332921229063039, 0.18354750955645668, -0.006359264220907746, -0.08288987764965249, -0.04208476710166917, 0.18219419363437286] |
1,802.00144 | Local strong solution to General Landau-Lifshitz-Bloch equation | In this paper, we bring in General Landau-Lifshitz-Bloch equation and prove
that it admits a local strong solution.
| math.DG | in this paper we bring in general landaulifshitzbloch equation and prove that it admits a local strong solution | [['in', 'this', 'paper', 'we', 'bring', 'in', 'general', 'landaulifshitzbloch', 'equation', 'and', 'prove', 'that', 'it', 'admits', 'a', 'local', 'strong', 'solution']] | [-0.15646911474565664, -0.03215189358322985, -0.17791317641321155, 0.04913750080676335, -0.09145060119529565, -0.16282065675800872, 0.010821715417680226, 0.311069402222832, -0.3182632339497407, -0.20823383362342915, 0.04734048207238731, -0.25523753981623387, -0.26877855819960433, 0.11616609659459856, -0.07744963420554996, -0.03512878529727459, 0.11077691262794866, 0.011442641106744608, -0.05538130953856227, -0.22698290184295425, 0.34346269278062713, -0.07092185070117314, 0.2547319009900093, 0.12371775075896746, 0.21835061266190475, -0.015170648771648606, 0.05216515571292904, 0.08000846289926106, -0.21517952900426784, 0.08583795781143838, 0.24428799158583084, 0.09461908025615332, 0.31221784506407046, -0.4737386146767272, -0.19056191331603461, 0.13599781376413173, 0.10064905643877056, 0.16836769790906045, -0.127637476582701, -0.23675275480167735, 0.13666722142241067, -0.1638792192356454, -0.20462506528322896, -0.12765671209328705, 0.020060619649787743, 0.004516025901668602, -0.281401000606517, 0.10173020454951459, 0.16643237674401867, -0.03339723731753313, -0.11509218346327543, 0.018397906542910885, 0.06394038318345945, 0.005337152862921357, 0.033583030415078007, 0.09733595202366511, -0.050108609488233924, -0.11082318943873462, -0.009783080882496305, 0.3766835323638386, -0.13132002277092802, -0.26760146716454375, 0.13573880307376385, -0.12435238073683447, -0.2198989709528784, 0.05138130703320106, 0.14609668207251364, 0.15593682177778748, -0.18529646983370185, 0.1963347122040836, -0.13758398685604334, 0.15116203956616422, 0.06329590801356567, 0.009630168028201701, 0.09456828916962776, 0.1595600812902881, 0.16624677383030453, 0.15938950267930826, 0.047376064790619746, -0.12069391293658151, -0.2921982225185881, -0.22513822124650082, -0.08706116448673937, 0.13140545940647522, -0.07420070813370533, -0.18085238430649042, 0.37220204453397954, 0.21937617732004988, 0.11889643434228168, 0.06876307037762469, 0.25061947852373123, 0.2274229164338774, -0.0511583871104651, 0.14572299333910146, 0.2756284096588691, 0.11342438847188735, 0.13084657174638575, -0.18142469661931196, -0.0013130210443503326, 0.10678424603409237] |
1,802.00145 | Entropy rigidity and flexibility for suspension flows over Anosov
diffeomorphisms | For any $C^\infty$, area-preserving Anosov diffeomorphism $f$ of a surface,
we show that a suspension flow over $f$ is $C^\infty$-conjugate to a
constant-time suspension flow of a hyperbolic automorphism of the two torus if
and only if the volume measure is the measure with maximal entropy. We also
show that the the metric entropy with respect to the volume measure and the
topological entropy of suspension flow over Anosov diffeomorphisms on torus
achieve all possible values. Our results fit into two programs related to
entropy rigidity and flexibility of Anosov systems.
| math.DS | for any cinfty areapreserving anosov diffeomorphism f of a surface we show that a suspension flow over f is cinftyconjugate to a constanttime suspension flow of a hyperbolic automorphism of the two torus if and only if the volume measure is the measure with maximal entropy we also show that the the metric entropy with respect to the volume measure and the topological entropy of suspension flow over anosov diffeomorphisms on torus achieve all possible values our results fit into two programs related to entropy rigidity and flexibility of anosov systems | [['for', 'any', 'cinfty', 'areapreserving', 'anosov', 'diffeomorphism', 'f', 'of', 'a', 'surface', 'we', 'show', 'that', 'a', 'suspension', 'flow', 'over', 'f', 'is', 'cinftyconjugate', 'to', 'a', 'constanttime', 'suspension', 'flow', 'of', 'a', 'hyperbolic', 'automorphism', 'of', 'the', 'two', 'torus', 'if', 'and', 'only', 'if', 'the', 'volume', 'measure', 'is', 'the', 'measure', 'with', 'maximal', 'entropy', 'we', 'also', 'show', 'that', 'the', 'the', 'metric', 'entropy', 'with', 'respect', 'to', 'the', 'volume', 'measure', 'and', 'the', 'topological', 'entropy', 'of', 'suspension', 'flow', 'over', 'anosov', 'diffeomorphisms', 'on', 'torus', 'achieve', 'all', 'possible', 'values', 'our', 'results', 'fit', 'into', 'two', 'programs', 'related', 'to', 'entropy', 'rigidity', 'and', 'flexibility', 'of', 'anosov', 'systems']] | [-0.1937953208849489, 0.1321344452802665, -0.1303645121752397, 0.016675015770738107, -0.03342770164382163, -0.1317343326633448, -0.004834702409865273, 0.34101113419120127, -0.3039600726953902, -0.18364089559367092, 0.11083576634812814, -0.3120146220918376, -0.12593796241332542, 0.23447287834894198, -0.14913516017802797, 0.09556785819858216, 0.06260530052931754, 0.10117449044444404, -0.08287168533226558, -0.22107825070558176, 0.36930744431831025, -0.056988530730890045, 0.23301024455577135, 0.12977349501011054, 0.1633075531520932, -0.06859961961099244, 0.010775591108620494, 0.10792497308044643, -0.2004319060407387, 0.10517003490579324, 0.19635422518323328, 0.08409549613677703, 0.17478978457594557, -0.29910751679850806, -0.2705105480809624, 0.17368844177082673, 0.06294204764436562, -0.02571899808206401, -0.0256132091674442, -0.2652779023603096, 0.12886103920147315, -0.18243552651256323, -0.1256009181142672, -0.12711118943579905, 0.06414731759782676, 0.006428742842687355, -0.2092253591374054, 0.03568715313264005, 0.16713638494180127, 0.11795697584338896, -0.09408219097755276, 0.024647330210267843, -0.15288473766778116, 0.12711359182843468, 0.0833093762848076, 0.08845281925379903, 0.19108549639541697, -0.040653914653256046, -0.06253519160468336, 0.3874292744548766, -0.136017737992026, -0.2962521151486006, 0.20181097294930572, -0.18748468887265568, -0.1507009748819765, 0.17850267802682387, 0.18968548491638113, 0.11401117038350184, -0.06674002525447817, 0.11708541316617342, -0.11287361354782031, 0.1760363169833199, 0.05248338332051759, -0.049289787955745894, 0.13751574242896922, 0.062153107803928985, 0.21352228413816993, 0.1632407551828342, -0.0037623985010393703, -0.05919326815797671, -0.3208475693200643, -0.24026401671529798, -0.1441602147616712, 0.14549273756015432, -0.13320750936531273, -0.18798224207341344, 0.38377013483217787, 0.05769994527429015, 0.20788312611262222, 0.16055573803656684, 0.27110825871004834, 0.028609599682098193, 0.04537604850906224, 0.14903988335076923, 0.16526855049900466, 0.17246294377760574, -0.013530666855481136, -0.21163893608212636, -0.02189022445396244, 0.19051973098008843] |
1,802.00146 | Algebraic formulas for the structure constants in symmetric functions | Littlewood-Richardson rule gives the decomposition formula for the
multiplication of two Schur functions, while the decomposition formula for the
multiplication of two Hall-Littlewood functions or two universal characters is
also given by the combinatorial method. In this paper, using the vertex
operator realizations of these symmetric functions, we construct the algebraic
forms of these decomposition formulas.
| math-ph math.CO math.MP | littlewoodrichardson rule gives the decomposition formula for the multiplication of two schur functions while the decomposition formula for the multiplication of two halllittlewood functions or two universal characters is also given by the combinatorial method in this paper using the vertex operator realizations of these symmetric functions we construct the algebraic forms of these decomposition formulas | [['littlewoodrichardson', 'rule', 'gives', 'the', 'decomposition', 'formula', 'for', 'the', 'multiplication', 'of', 'two', 'schur', 'functions', 'while', 'the', 'decomposition', 'formula', 'for', 'the', 'multiplication', 'of', 'two', 'halllittlewood', 'functions', 'or', 'two', 'universal', 'characters', 'is', 'also', 'given', 'by', 'the', 'combinatorial', 'method', 'in', 'this', 'paper', 'using', 'the', 'vertex', 'operator', 'realizations', 'of', 'these', 'symmetric', 'functions', 'we', 'construct', 'the', 'algebraic', 'forms', 'of', 'these', 'decomposition', 'formulas']] | [-0.1302882095665804, 0.06589031008765492, -0.13954523651461517, 0.07260268675496004, -0.11461306622784052, -0.1306501220845218, 0.035562815304729156, 0.3209016250579485, -0.3542858845155154, -0.19214936628538584, 0.09598237301647064, -0.20671813182447554, -0.24213612144896096, 0.20390872713427857, -0.03067534203078789, 0.02819679622604911, -0.0015196403172532363, 0.025436212508273975, -0.16534081673710585, -0.23955512289623065, 0.41142566675054176, -0.0657168209685811, 0.23925176131472523, 0.06620584433715392, 0.11683706858561241, 0.034782982913644185, -0.0918170106514091, -0.09557892994156905, -0.1175302946690603, 0.18457374047596073, 0.2621104583335442, 0.1597093288520617, 0.187830016582406, -0.39981996031877187, -0.01950116137907441, 0.15821673878235742, 0.15408343610553338, 0.045702278443578895, -0.015902027479439442, -0.1647983176267839, 0.06659423829322415, -0.22592725142437434, -0.14393335814487987, -0.11931234094247754, 0.03232051493250765, 0.028508869863539336, -0.30516151811129283, 0.019648273420898477, 0.11587868882842096, 0.03489040191717712, -0.10137736526251372, -0.22536254797055985, 0.06174738504757572, 0.0653203874535393, -0.05047666759180304, -0.023134097390409027, 0.06410844478523359, -0.12144755252354246, -0.19039359505820488, 0.32307144575419705, 0.015451960872659194, -0.30086326013718334, 0.06160531923108335, -0.17270574019390292, -0.1597980192995497, 0.084605229985235, 0.04821281590349307, 0.17083166550479031, -0.10456987573499125, 0.12107397521945781, -0.13900718724887287, -0.002163238397250617, 0.1530728707023497, 0.006849141342432371, 0.1152537730855069, -0.02332657402647393, 0.03173053230524862, 0.2364177863870022, 0.03965358579963712, -0.09430697104627532, -0.340984693961218, -0.1746313561702014, -0.1774451271464516, 0.06141519486638052, -0.21359820782007383, -0.2613708865745658, 0.48355744612802354, 0.032652328023687005, 0.1794705780089966, 0.13649171017043824, 0.28265147832488374, 0.21146644735043602, 0.11644163619660373, -0.0033502446437653688, 0.09264704388832408, 0.2304290562710126, 0.009691923228924029, -0.1549523861203852, 0.04102283077580588, 0.30080676527826916] |
1,802.00147 | GPU accelerated manifold correction method for spinning compact binaries | The conservative Post-Newtonian (PN) Hamiltonian formulation of spinning
compact binaries has six integrals of motion including the total energy, the
total angular momentum and the constant unit lengths of spins. The manifold
correction method can effectively eliminate the integration errors accumulation
in a long time. In this paper, the accelerated manifold correction method based
on graphics processing unit (GPU) is designed to simulate the dynamic evolution
of spinning compact binaries. The feasibility and the efficiency of parallel
computation on GPU for spinning compact binaries have been confirmed by various
numerical experiments. The numerical comparisons show that the accuracy on GPU
execution of manifold corrections method has a good agreement with the
execution of codes on merely central processing unit (CPU-based) method. The
acceleration ability when the codes are implemented on GPU can increase
enormously through the use of shared memory and register optimization
techniques without additional hardware costs, implying that the speedup is
nearly 13 times as compared with the codes executed on CPU for phase space scan
(including orbits). In addition, GPU-accelerated manifold correction method is
used to numerically study how dynamics are affected by the spin-induced
quadrupole-monopole interaction for black hole binary system.
| astro-ph.IM | the conservative postnewtonian pn hamiltonian formulation of spinning compact binaries has six integrals of motion including the total energy the total angular momentum and the constant unit lengths of spins the manifold correction method can effectively eliminate the integration errors accumulation in a long time in this paper the accelerated manifold correction method based on graphics processing unit gpu is designed to simulate the dynamic evolution of spinning compact binaries the feasibility and the efficiency of parallel computation on gpu for spinning compact binaries have been confirmed by various numerical experiments the numerical comparisons show that the accuracy on gpu execution of manifold corrections method has a good agreement with the execution of codes on merely central processing unit cpubased method the acceleration ability when the codes are implemented on gpu can increase enormously through the use of shared memory and register optimization techniques without additional hardware costs implying that the speedup is nearly 13 times as compared with the codes executed on cpu for phase space scan including orbits in addition gpuaccelerated manifold correction method is used to numerically study how dynamics are affected by the spininduced quadrupolemonopole interaction for black hole binary system | [['the', 'conservative', 'postnewtonian', 'pn', 'hamiltonian', 'formulation', 'of', 'spinning', 'compact', 'binaries', 'has', 'six', 'integrals', 'of', 'motion', 'including', 'the', 'total', 'energy', 'the', 'total', 'angular', 'momentum', 'and', 'the', 'constant', 'unit', 'lengths', 'of', 'spins', 'the', 'manifold', 'correction', 'method', 'can', 'effectively', 'eliminate', 'the', 'integration', 'errors', 'accumulation', 'in', 'a', 'long', 'time', 'in', 'this', 'paper', 'the', 'accelerated', 'manifold', 'correction', 'method', 'based', 'on', 'graphics', 'processing', 'unit', 'gpu', 'is', 'designed', 'to', 'simulate', 'the', 'dynamic', 'evolution', 'of', 'spinning', 'compact', 'binaries', 'the', 'feasibility', 'and', 'the', 'efficiency', 'of', 'parallel', 'computation', 'on', 'gpu', 'for', 'spinning', 'compact', 'binaries', 'have', 'been', 'confirmed', 'by', 'various', 'numerical', 'experiments', 'the', 'numerical', 'comparisons', 'show', 'that', 'the', 'accuracy', 'on', 'gpu', 'execution', 'of', 'manifold', 'corrections', 'method', 'has', 'a', 'good', 'agreement', 'with', 'the', 'execution', 'of', 'codes', 'on', 'merely', 'central', 'processing', 'unit', 'cpubased', 'method', 'the', 'acceleration', 'ability', 'when', 'the', 'codes', 'are', 'implemented', 'on', 'gpu', 'can', 'increase', 'enormously', 'through', 'the', 'use', 'of', 'shared', 'memory', 'and', 'register', 'optimization', 'techniques', 'without', 'additional', 'hardware', 'costs', 'implying', 'that', 'the', 'speedup', 'is', 'nearly', '13', 'times', 'as', 'compared', 'with', 'the', 'codes', 'executed', 'on', 'cpu', 'for', 'phase', 'space', 'scan', 'including', 'orbits', 'in', 'addition', 'gpuaccelerated', 'manifold', 'correction', 'method', 'is', 'used', 'to', 'numerically', 'study', 'how', 'dynamics', 'are', 'affected', 'by', 'the', 'spininduced', 'quadrupolemonopole', 'interaction', 'for', 'black', 'hole', 'binary', 'system']] | [-0.17284608806531207, 0.029812617982045198, -0.052259104676210345, 0.06474468903974272, -0.04984917608686747, -0.13861665222793818, 0.018870699181794546, 0.4194366932583925, -0.22147715946372884, -0.36770247964140695, 0.10406808194596893, -0.24766512737155724, -0.06294958763158856, 0.28383247645165866, -0.05621472492034977, 0.09974881466955711, 0.17622085090320652, 0.01674601837980728, -0.1283707764783265, -0.297085979872216, 0.27209948008777035, 0.1258126449604065, 0.21304430852954587, -0.0048750036622946845, 0.12289643272136648, -0.007474220386491372, -0.01710745104087087, -0.010440249576454218, -0.06197810900936393, 0.10615515825935663, 0.18437460164258926, 0.09665274413612981, 0.24275935945841365, -0.4471802183211996, -0.1983474869448214, 0.03811440887168432, 0.16254686148753628, 0.08373207149501795, -0.060138171072452305, -0.22550619491555082, 0.07372581123804244, -0.21681289926812333, -0.07355814587133817, -0.1272810119514664, 0.038850744119069226, 0.02668631637516694, -0.21526598636216174, 0.05798803173686163, 0.037438984173469435, 0.005741783226720798, -0.05704508433596064, -0.08801289725845728, 0.002549822859537716, 0.10105812465488458, 0.019211125849053646, 0.0985227956663435, 0.1834112777446325, -0.03949118340746141, -0.17603277872653844, 0.39435855695643485, -0.056255878870470975, -0.24012008786010436, 0.15092402870098176, -0.12458178840147761, -0.12175479298935105, 0.1750784612921192, 0.2367537206898515, 0.14686365157413558, -0.14418830477120653, 0.11709021821958371, 0.07715431416454988, 0.20377010208411286, 0.07450870632623824, 0.02009457173150552, 0.2118362337267265, 0.18043822125436212, 0.011206346842496155, 0.14777128282600108, -0.13068223408877086, -0.14672906720676485, -0.24168028539189926, -0.15989186141448908, -0.20517583790784463, 0.03136040220419184, -0.14676140960617862, -0.12700853591593794, 0.3320864238489706, 0.14386374935125693, 0.10801760270887126, 0.0762730508386038, 0.36846186905526196, 0.05909682493238973, 0.14722532786022968, 0.1536444427564931, 0.2091521324762979, 0.09731232644034885, 0.09681027417238323, -0.29859001258423984, 0.02232945330727559, 0.060213256221957126] |
1,802.00148 | How many weights can a linear code have ? | We study the combinatorial function $L(k,q),$ the maximum number of nonzero
weights a linear code of dimension $k$ over $\F_q$ can have. We determine it
completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the
general case when both $k$ and $q$ are $\ge 3.$ A refinement $L(n,k,q),$ as
well as nonlinear analogues $N(M,q)$ and $N(n,M,q),$ are also introduced and
studied.
| cs.IT math.IT | we study the combinatorial function lkq the maximum number of nonzero weights a linear code of dimension k over f_q can have we determine it completely for q2 and for k2 and provide upper and lower bounds in the general case when both k and q are ge 3 a refinement lnkq as well as nonlinear analogues nmq and nnmq are also introduced and studied | [['we', 'study', 'the', 'combinatorial', 'function', 'lkq', 'the', 'maximum', 'number', 'of', 'nonzero', 'weights', 'a', 'linear', 'code', 'of', 'dimension', 'k', 'over', 'f_q', 'can', 'have', 'we', 'determine', 'it', 'completely', 'for', 'q2', 'and', 'for', 'k2', 'and', 'provide', 'upper', 'and', 'lower', 'bounds', 'in', 'the', 'general', 'case', 'when', 'both', 'k', 'and', 'q', 'are', 'ge', '3', 'a', 'refinement', 'lnkq', 'as', 'well', 'as', 'nonlinear', 'analogues', 'nmq', 'and', 'nnmq', 'are', 'also', 'introduced', 'and', 'studied']] | [-0.11114576274765747, 0.14438835954385215, -0.015999692362412565, 0.06735947718614804, -0.03638020050177564, -0.17177108756159662, 0.04342319515579548, 0.34209287052088583, -0.25939960466300854, -0.3283895829417666, 0.13464427046042668, -0.25165182217711307, -0.15456143959776544, 0.2503416415029129, -0.008960493473855198, 0.06070161204724038, -0.036117200724414135, 0.07795102234412611, -0.07313408233312657, -0.3177522326224163, 0.29802568736257123, 0.02061464422245006, 0.16275540159129706, 0.08606011531178336, 0.04929125110464186, 0.04315769625064291, -0.015289894045620669, 0.051484361023748995, -0.2189692778238019, 0.06251044968356852, 0.258718398842411, 0.13799530791775247, 0.21393763339605, -0.33467891800110455, -0.20428640233566525, 0.13414224792943627, 0.1512736625202214, 0.0760461561740605, -0.010884286583874558, -0.1498863148296893, 0.19122610669430407, -0.1512071595328753, -0.09017660911576669, -0.09862067229801515, 0.06552659436205371, 0.03489716285763339, -0.32357597835056606, 0.008851486437125742, 0.10857463103803028, 0.1147772889755109, -0.062273133958338715, -0.23389089827952508, -0.009032349289226973, 0.11936464381726748, -0.02091995532028988, 0.03144524478903193, -0.018365502916658144, -0.13094683851069602, -0.0820009671151638, 0.3477413241720957, -0.076200509924808, -0.19814105667784565, 0.15155103417937874, -0.1720565794890777, -0.09649146518853234, 0.08492488934673735, 0.21874804339814383, 0.16868449609963315, -0.04770678548704352, 0.15985002839884369, -0.08960979284535421, 0.11290552995366152, 0.10997390082930444, 0.05301789599413541, 0.11908044772924947, 0.05761699714758968, 0.10705144847285186, 0.17087685194660407, -0.06833362098416833, -0.01608865593605843, -0.3201492420535107, -0.16580073523228286, -0.1755450726792094, 0.06539067541264364, -0.13350415499890453, -0.10428635713255002, 0.3307559228135792, 0.05534780215563589, 0.23465630102169807, 0.12248766397843595, 0.25200398388837814, 0.15171838046784406, 0.035115711612352093, 0.12683733338948155, 0.16307052743972325, 0.19995707441045002, 0.016106223924177102, -0.16280285424369648, 0.033578461776563866, 0.0934977450056887] |
1,802.00149 | Gorenstein projective dimensions of modules over minimal
Auslander-Gorenstein algebras | In this article we investigate the relations between the Gorenstein
projective dimensions of $\Lambda$-modules and their socles for minimal
n-Auslander-Gorenstein algebras $\Lambda$ in the sense of Iyama and Solberg
\cite{IS}. First we give a description of projective-injective
$\Lambda$-modules in terms of their socles. Then we prove that a
$\Lambda$-module $N$ has Gorenstein projective dimension at most n iff its
socle has Gorenstein projective dimension at most n iff $N$ is cogenerated by a
projective $\Lambda$-module. Furthermore, we show that minimal
n-Auslander-Gorenstein algebras can be characterised by the relations between
the Gorenstein projective dimensions of modules and their socles.
| math.RT math.RA | in this article we investigate the relations between the gorenstein projective dimensions of lambdamodules and their socles for minimal nauslandergorenstein algebras lambda in the sense of iyama and solberg citeis first we give a description of projectiveinjective lambdamodules in terms of their socles then we prove that a lambdamodule n has gorenstein projective dimension at most n iff its socle has gorenstein projective dimension at most n iff n is cogenerated by a projective lambdamodule furthermore we show that minimal nauslandergorenstein algebras can be characterised by the relations between the gorenstein projective dimensions of modules and their socles | [['in', 'this', 'article', 'we', 'investigate', 'the', 'relations', 'between', 'the', 'gorenstein', 'projective', 'dimensions', 'of', 'lambdamodules', 'and', 'their', 'socles', 'for', 'minimal', 'nauslandergorenstein', 'algebras', 'lambda', 'in', 'the', 'sense', 'of', 'iyama', 'and', 'solberg', 'citeis', 'first', 'we', 'give', 'a', 'description', 'of', 'projectiveinjective', 'lambdamodules', 'in', 'terms', 'of', 'their', 'socles', 'then', 'we', 'prove', 'that', 'a', 'lambdamodule', 'n', 'has', 'gorenstein', 'projective', 'dimension', 'at', 'most', 'n', 'iff', 'its', 'socle', 'has', 'gorenstein', 'projective', 'dimension', 'at', 'most', 'n', 'iff', 'n', 'is', 'cogenerated', 'by', 'a', 'projective', 'lambdamodule', 'furthermore', 'we', 'show', 'that', 'minimal', 'nauslandergorenstein', 'algebras', 'can', 'be', 'characterised', 'by', 'the', 'relations', 'between', 'the', 'gorenstein', 'projective', 'dimensions', 'of', 'modules', 'and', 'their', 'socles']] | [-0.1990893601783012, 0.06028819715506152, -0.04973790488499952, 0.0640729872705905, -0.012168078374509748, -0.22644295115023852, -0.09434227190519634, 0.37423030731121176, -0.36066302021622265, -0.12578316606385143, 0.08881344943380866, -0.2740527734846661, -0.1288901465209691, 0.14654447384374705, -0.17895829860905282, -0.07104635491881421, 0.01172193463058456, 0.12749547880927198, -0.09133073131409841, -0.4015819189775931, 0.4476794921449925, -0.020658405936372123, 0.1982338209415933, 0.053973560545005295, 0.1878907681589848, 0.023380202600904006, -0.01022300628062926, 0.025749714986274118, -0.23513199299356385, 0.12569657934057576, 0.37361378050164173, 0.11099734647738699, 0.1625439597073158, -0.3542754754522129, -0.041631955511279795, 0.27199948897683307, 0.1987971809104477, -0.012494531381679209, 0.049441107688471674, -0.22664114041744093, 0.15585401572875288, -0.21370269582655868, -0.15454765033270967, -0.09006250802378514, 0.14704957825965004, -0.031176985604198355, -0.20237255645915866, -0.010008629636937065, 0.10902026125573014, 0.21103410443144016, -0.008497060988539536, -0.04293372516373271, -0.16367354817492397, 0.02844031832769121, -0.10518277813190301, -0.041956612060924894, 0.03796058585377116, -0.10107979597768893, -0.17160586195777316, 0.33575158332915683, -0.00954441817501854, -0.22578162639156768, 0.13672305194562986, -0.25133430204893414, -0.11347120595409682, 0.07862520923739985, -0.016405289737801802, 0.17188247532436723, -0.00574469550659782, 0.2769907818108454, -0.18276939049583713, 0.06539125394468245, 0.160657793567761, 0.05661241221486738, 0.11424724715516756, 0.11867471952297676, 0.03690089159890225, 0.12246822019622318, 0.05554798327778515, 0.0820948464844964, -0.38508156141952465, -0.23834490878997663, -0.11939688591580642, 0.16756981094612888, -0.13817101604210238, -0.0904426614508817, 0.38579158081035864, 0.09417568546670832, 0.21653103413256375, 0.177609544325816, 0.19798928400207508, -0.04248877063785729, 0.04704481471869114, 0.0680798220252128, 0.13558141660729522, 0.2641861560754478, -0.04803414374197784, -0.08924077678667872, -0.00863342626804584, 0.26632306913992293] |
1,802.0015 | Alternating Multi-bit Quantization for Recurrent Neural Networks | Recurrent neural networks have achieved excellent performance in many
applications. However, on portable devices with limited resources, the models
are often too large to deploy. For applications on the server with large scale
concurrent requests, the latency during inference can also be very critical for
costly computing resources. In this work, we address these problems by
quantizing the network, both weights and activations, into multiple binary
codes {-1,+1}. We formulate the quantization as an optimization problem. Under
the key observation that once the quantization coefficients are fixed the
binary codes can be derived efficiently by binary search tree, alternating
minimization is then applied. We test the quantization for two well-known RNNs,
i.e., long short term memory (LSTM) and gated recurrent unit (GRU), on the
language models. Compared with the full-precision counter part, by 2-bit
quantization we can achieve ~16x memory saving and ~6x real inference
acceleration on CPUs, with only a reasonable loss in the accuracy. By 3-bit
quantization, we can achieve almost no loss in the accuracy or even surpass the
original model, with ~10.5x memory saving and ~3x real inference acceleration.
Both results beat the exiting quantization works with large margins. We extend
our alternating quantization to image classification tasks. In both RNNs and
feedforward neural networks, the method also achieves excellent performance.
| cs.LG stat.ML | recurrent neural networks have achieved excellent performance in many applications however on portable devices with limited resources the models are often too large to deploy for applications on the server with large scale concurrent requests the latency during inference can also be very critical for costly computing resources in this work we address these problems by quantizing the network both weights and activations into multiple binary codes 11 we formulate the quantization as an optimization problem under the key observation that once the quantization coefficients are fixed the binary codes can be derived efficiently by binary search tree alternating minimization is then applied we test the quantization for two wellknown rnns ie long short term memory lstm and gated recurrent unit gru on the language models compared with the fullprecision counter part by 2bit quantization we can achieve 16x memory saving and 6x real inference acceleration on cpus with only a reasonable loss in the accuracy by 3bit quantization we can achieve almost no loss in the accuracy or even surpass the original model with 105x memory saving and 3x real inference acceleration both results beat the exiting quantization works with large margins we extend our alternating quantization to image classification tasks in both rnns and feedforward neural networks the method also achieves excellent performance | [['recurrent', 'neural', 'networks', 'have', 'achieved', 'excellent', 'performance', 'in', 'many', 'applications', 'however', 'on', 'portable', 'devices', 'with', 'limited', 'resources', 'the', 'models', 'are', 'often', 'too', 'large', 'to', 'deploy', 'for', 'applications', 'on', 'the', 'server', 'with', 'large', 'scale', 'concurrent', 'requests', 'the', 'latency', 'during', 'inference', 'can', 'also', 'be', 'very', 'critical', 'for', 'costly', 'computing', 'resources', 'in', 'this', 'work', 'we', 'address', 'these', 'problems', 'by', 'quantizing', 'the', 'network', 'both', 'weights', 'and', 'activations', 'into', 'multiple', 'binary', 'codes', '11', 'we', 'formulate', 'the', 'quantization', 'as', 'an', 'optimization', 'problem', 'under', 'the', 'key', 'observation', 'that', 'once', 'the', 'quantization', 'coefficients', 'are', 'fixed', 'the', 'binary', 'codes', 'can', 'be', 'derived', 'efficiently', 'by', 'binary', 'search', 'tree', 'alternating', 'minimization', 'is', 'then', 'applied', 'we', 'test', 'the', 'quantization', 'for', 'two', 'wellknown', 'rnns', 'ie', 'long', 'short', 'term', 'memory', 'lstm', 'and', 'gated', 'recurrent', 'unit', 'gru', 'on', 'the', 'language', 'models', 'compared', 'with', 'the', 'fullprecision', 'counter', 'part', 'by', '2bit', 'quantization', 'we', 'can', 'achieve', '16x', 'memory', 'saving', 'and', '6x', 'real', 'inference', 'acceleration', 'on', 'cpus', 'with', 'only', 'a', 'reasonable', 'loss', 'in', 'the', 'accuracy', 'by', '3bit', 'quantization', 'we', 'can', 'achieve', 'almost', 'no', 'loss', 'in', 'the', 'accuracy', 'or', 'even', 'surpass', 'the', 'original', 'model', 'with', '105x', 'memory', 'saving', 'and', '3x', 'real', 'inference', 'acceleration', 'both', 'results', 'beat', 'the', 'exiting', 'quantization', 'works', 'with', 'large', 'margins', 'we', 'extend', 'our', 'alternating', 'quantization', 'to', 'image', 'classification', 'tasks', 'in', 'both', 'rnns', 'and', 'feedforward', 'neural', 'networks', 'the', 'method', 'also', 'achieves', 'excellent', 'performance']] | [-0.13529760132781987, 0.04109053986727769, 0.0023898589284007633, 0.0881968165899432, -0.07697344704011325, -0.23639661547901153, 0.06999096640840519, 0.47012687375725704, -0.2921688503369169, -0.3349776783265, 0.12377025364020969, -0.23081110237209604, -0.1696571484825379, 0.22395752925577378, -0.1506113355562394, 0.1167310980495152, 0.17676822007850332, 0.04782241922911516, -0.08904082970937367, -0.3586029336376246, 0.2110535389765404, 0.11456695755748728, 0.32033146180775623, -0.010574286629521656, 0.12038780673241871, -0.02523985358231246, 0.016815213462727706, -0.02654724972116826, -0.009366125520487954, 0.1281448409895326, 0.26410071457303697, 0.11270784683915418, 0.30522566803102924, -0.46723125193398013, -0.24284336410982665, 0.0854518162314022, 0.14392086866874854, 0.08307029509018067, -0.01916934011374102, -0.24990095604850024, 0.1363758859649669, -0.19091926287144942, 0.06752433815956127, -0.14818199143290173, -0.05093278482686295, 0.02910605137355539, -0.27129135026953854, 0.022897413465313526, 0.06416286452203654, 0.010802349212124597, -0.07234596373238547, -0.12000937557855058, 0.06918556940806812, 0.1291124258179564, 0.014693606413662607, 0.07411335208778118, 0.10443489668717565, -0.161703999408759, -0.18180166633561426, 0.3433515039814073, -0.07374834797323443, -0.2607846839764957, 0.17449094375682084, -0.03250827588747407, -0.1461613566105709, 0.08952316075650066, 0.2146091976167829, 0.08734572214009458, -0.12911459299367528, 0.052104451168101105, 0.0097114646287505, 0.19241902755226853, 0.10462753265110646, 0.033860020060633676, 0.1772530338607815, 0.23442514667065467, 0.029305202150879818, 0.1557576621731007, -0.12762141213210862, -0.1203395577407507, -0.20282217350349827, -0.10267735723498125, -0.19739756536518419, 0.04012712996323095, -0.1391991906774333, -0.1158502665478303, 0.36829848418142214, 0.18563239465922463, 0.19759229350358595, 0.18061634570706722, 0.37464159447699785, 0.09040706496642426, 0.1759174475411148, 0.15233784644149764, 0.17310735055808585, 0.05183959321313819, 0.13051092458190397, -0.19200648898258804, 0.07136706174892742, 0.025212979745552984] |
1,802.00151 | Macros to Conduct Tests of Multimodality in SAS | The Dip Test of Unimodality and Silverman's Critical Bandwidth Test are two
popular tests to determine if an unknown density contains more than one mode.
While the tests can be easily run in R, they are not included in SAS software.
We provide implementations of the Dip Test and Silverman Test as macros in the
SAS software, capitalizing on the capability of SAS to execute R code
internally. Descriptions of the macro parameters, installation steps, and
sample macro calls are provided, along with an appendix for troubleshooting. We
illustrate the use of the macros on data simulated from one or more Gaussian
distributions as well as on the famous $\textit{iris}$ dataset.
| stat.CO | the dip test of unimodality and silvermans critical bandwidth test are two popular tests to determine if an unknown density contains more than one mode while the tests can be easily run in r they are not included in sas software we provide implementations of the dip test and silverman test as macros in the sas software capitalizing on the capability of sas to execute r code internally descriptions of the macro parameters installation steps and sample macro calls are provided along with an appendix for troubleshooting we illustrate the use of the macros on data simulated from one or more gaussian distributions as well as on the famous textitiris dataset | [['the', 'dip', 'test', 'of', 'unimodality', 'and', 'silvermans', 'critical', 'bandwidth', 'test', 'are', 'two', 'popular', 'tests', 'to', 'determine', 'if', 'an', 'unknown', 'density', 'contains', 'more', 'than', 'one', 'mode', 'while', 'the', 'tests', 'can', 'be', 'easily', 'run', 'in', 'r', 'they', 'are', 'not', 'included', 'in', 'sas', 'software', 'we', 'provide', 'implementations', 'of', 'the', 'dip', 'test', 'and', 'silverman', 'test', 'as', 'macros', 'in', 'the', 'sas', 'software', 'capitalizing', 'on', 'the', 'capability', 'of', 'sas', 'to', 'execute', 'r', 'code', 'internally', 'descriptions', 'of', 'the', 'macro', 'parameters', 'installation', 'steps', 'and', 'sample', 'macro', 'calls', 'are', 'provided', 'along', 'with', 'an', 'appendix', 'for', 'troubleshooting', 'we', 'illustrate', 'the', 'use', 'of', 'the', 'macros', 'on', 'data', 'simulated', 'from', 'one', 'or', 'more', 'gaussian', 'distributions', 'as', 'well', 'as', 'on', 'the', 'famous', 'textitiris', 'dataset']] | [-0.07931263263857512, 0.03140404943753294, -0.08356585235100004, 0.08361550157906504, -0.07002816559025296, -0.1902245190833603, 0.025131730597701157, 0.37621745633313786, -0.21270615133448495, -0.3547003626789864, 0.1544221275672736, -0.28652207814324815, -0.05711194105249167, 0.2790731371502048, -0.051476962340005615, 0.04492435930716293, 0.07895818351440735, 0.024941972601867222, -0.027599032495279906, -0.27906448956209795, 0.2698847832963676, 0.0884699664657583, 0.25984502593810493, 0.005735439437164648, 0.03771909249858377, 0.012699926800623134, -0.0737443523290609, -0.009313218484355791, -0.08795253937090705, 0.05409974209871982, 0.25712503796141295, 0.23100459081045277, 0.24082370502203032, -0.443063114568062, -0.12252005204759739, 0.03917077085137501, 0.14232388021726464, 0.04431201088837944, 0.0017595730157178903, -0.27325191961282547, 0.08638036810700689, -0.14754840756372153, -0.11532739398010948, -0.09216903752504706, -0.0084460407877257, 0.07111273817497783, -0.27246122688541674, 0.01340816949435451, 0.03427484183286963, 0.10550623484425717, 0.006708075548312417, -0.14178879127674107, -0.021234638680628425, 0.12226701813313674, 0.021591406785421544, -0.003188690748527176, 0.1460619927006396, -0.09415050194706759, -0.11823545983229, 0.38572727893856734, -0.048457837776466575, -0.2012397520797881, 0.20229833109958753, -0.0896715035175418, -0.11982151948184043, 0.06859937961934856, 0.19740747628515368, 0.08073406273432009, -0.1519563594048524, 0.04352941549318079, -0.01633572363324027, 0.19034098599710175, 0.08510563127813978, -0.013800157557098984, 0.1903735664799004, 0.16515888663497544, 0.022543468558741314, 0.14202865903781778, -0.11182536024742902, -0.0386185454674535, -0.3268509988782105, -0.1546809937393813, -0.18740573775538177, -0.02197925163512139, -0.08017356634973276, -0.17865372009508246, 0.36928828626132765, 0.16993428662845125, 0.14467344852583902, 0.06413072674023407, 0.32208656414772746, 0.05282752326299512, 0.07981594274374279, 0.12222399197619509, 0.1625734740817869, 0.04982397761951025, 0.06371455324545235, -0.1321073342429323, 0.07692046993336565, -0.020006279387670727] |
1,802.00152 | Taking Control: Design and Implementation of Botnets for Cyber-Physical
Attacks with CPSBot | Recently, botnets such as Mirai and Persirai targeted IoT devices on a large
scale. We consider attacks by botnets on cyber-physical systems (CPS), which
require advanced capabilities such as controlling the physical processes in
real-time. Traditional botnets are not suitable for this goal mainly because
they lack process control capabilities, are not optimized for low latency
communication, and bots generally do not leverage local resources. We argue
that such attacks would require cyber-physical botnets. A cyber-physical botnet
needs coordinated and heterogeneous bots, capable of performing adversarial
control strategies while subject to the constraints of the target CPS. In this
work, we present CPSBot, a framework to build cyber-physical botnets. We
present an example of a centralized CPSBot targeting a centrally controlled
system and a decentralized CPSBot targeting a system distributed control. We
implemented the former CPSBot using MQTT for the C&C channel and Modbus/TCP as
the target network protocol and we used it to launch several attacks on real
and simulated Water Distribution. We evaluate our implementation with
distributed reply and distributed impersonation attacks on a CPS, and show that
malicious control with negligible latency is possible.
| cs.CR | recently botnets such as mirai and persirai targeted iot devices on a large scale we consider attacks by botnets on cyberphysical systems cps which require advanced capabilities such as controlling the physical processes in realtime traditional botnets are not suitable for this goal mainly because they lack process control capabilities are not optimized for low latency communication and bots generally do not leverage local resources we argue that such attacks would require cyberphysical botnets a cyberphysical botnet needs coordinated and heterogeneous bots capable of performing adversarial control strategies while subject to the constraints of the target cps in this work we present cpsbot a framework to build cyberphysical botnets we present an example of a centralized cpsbot targeting a centrally controlled system and a decentralized cpsbot targeting a system distributed control we implemented the former cpsbot using mqtt for the cc channel and modbustcp as the target network protocol and we used it to launch several attacks on real and simulated water distribution we evaluate our implementation with distributed reply and distributed impersonation attacks on a cps and show that malicious control with negligible latency is possible | [['recently', 'botnets', 'such', 'as', 'mirai', 'and', 'persirai', 'targeted', 'iot', 'devices', 'on', 'a', 'large', 'scale', 'we', 'consider', 'attacks', 'by', 'botnets', 'on', 'cyberphysical', 'systems', 'cps', 'which', 'require', 'advanced', 'capabilities', 'such', 'as', 'controlling', 'the', 'physical', 'processes', 'in', 'realtime', 'traditional', 'botnets', 'are', 'not', 'suitable', 'for', 'this', 'goal', 'mainly', 'because', 'they', 'lack', 'process', 'control', 'capabilities', 'are', 'not', 'optimized', 'for', 'low', 'latency', 'communication', 'and', 'bots', 'generally', 'do', 'not', 'leverage', 'local', 'resources', 'we', 'argue', 'that', 'such', 'attacks', 'would', 'require', 'cyberphysical', 'botnets', 'a', 'cyberphysical', 'botnet', 'needs', 'coordinated', 'and', 'heterogeneous', 'bots', 'capable', 'of', 'performing', 'adversarial', 'control', 'strategies', 'while', 'subject', 'to', 'the', 'constraints', 'of', 'the', 'target', 'cps', 'in', 'this', 'work', 'we', 'present', 'cpsbot', 'a', 'framework', 'to', 'build', 'cyberphysical', 'botnets', 'we', 'present', 'an', 'example', 'of', 'a', 'centralized', 'cpsbot', 'targeting', 'a', 'centrally', 'controlled', 'system', 'and', 'a', 'decentralized', 'cpsbot', 'targeting', 'a', 'system', 'distributed', 'control', 'we', 'implemented', 'the', 'former', 'cpsbot', 'using', 'mqtt', 'for', 'the', 'cc', 'channel', 'and', 'modbustcp', 'as', 'the', 'target', 'network', 'protocol', 'and', 'we', 'used', 'it', 'to', 'launch', 'several', 'attacks', 'on', 'real', 'and', 'simulated', 'water', 'distribution', 'we', 'evaluate', 'our', 'implementation', 'with', 'distributed', 'reply', 'and', 'distributed', 'impersonation', 'attacks', 'on', 'a', 'cps', 'and', 'show', 'that', 'malicious', 'control', 'with', 'negligible', 'latency', 'is', 'possible']] | [-0.21662320851071462, 0.015655870820675676, -0.0185807687167481, 0.05250515856854248, -0.08583979976136942, -0.23307568730559905, 0.11684834798420402, 0.3844035372440074, -0.23361933307873237, -0.3307485170171571, 0.1443491912560185, -0.2618081641559665, -0.18625533407163883, 0.18786039502498367, -0.14889895689698893, 0.1352446132566075, 0.02129021251473475, -0.03484375650390378, 0.050275123319620064, -0.26408065973932077, 0.3006178634461468, 0.05089086294677612, 0.2988236217684037, 0.049842243923528776, 0.0530075514236012, 0.017555630894226803, -0.020399051016146266, -0.013715210784151144, -0.04439305961045525, 0.10212358548431782, 0.35032561530510115, 0.2450556521681515, 0.3376361829404895, -0.48221902854337884, -0.20713831014629153, 0.1182058224706231, 0.1614272642521993, 0.10342279864991134, -0.08218165788472302, -0.34676700747773254, 0.14463480881515992, -0.29273593951067006, -0.07680639866354082, -0.11676665971408019, -0.008280358282295433, 0.07004320012134928, -0.24105331400642172, -0.04461481903138495, 0.023433645603221816, 0.06877382594236248, -0.015000773873573446, -0.0382160075575214, 0.013555156975682523, 0.14230050191509763, -0.01791072045909115, -0.041387923791173946, 0.2600903232128838, -0.10799979794911278, -0.1582747005303768, 0.3706540396789441, 0.004818159246162788, -0.1805986983537976, 0.20921731663118998, 0.04154276017326157, -0.1877119486270523, 0.06782010193077244, 0.2876223448949482, 0.1429331731781162, -0.2045097587781178, -0.004127470722478638, 0.04068360167580682, 0.21858387270539598, -0.022016265685040805, 0.05922809923319398, 0.17946861118984384, 0.2160628936480026, 0.15374133659501535, 0.09265630933884028, -0.06898128311653194, -0.10192494550499612, -0.20556152496751195, -0.12263463353234771, -0.15755121334883812, 0.029542676810209792, 0.01139830465977571, -0.11960074163822307, 0.3283580783981125, 0.19930776463368455, 0.1161146339450686, 0.07484366333881405, 0.398639083527834, 0.006470898704326435, 0.11428651802644536, 0.15207652529474266, 0.18757023183578575, -0.028235968938600774, 0.18593820433786792, -0.16685719262254803, 0.15609059509494014, -0.08565391629707773] |
1,802.00153 | Semantic White Balance: Semantic Color Constancy Using Convolutional
Neural Network | The goal of computational color constancy is to preserve the perceptive
colors of objects under different lighting conditions by removing the effect of
color casts caused by the scene's illumination. With the rapid development of
deep learning based techniques, significant progress has been made in image
semantic segmentation. In this work, we exploit the semantic information
together with the color and spatial information of the input image in order to
remove color casts. We train a convolutional neural network (CNN) model that
learns to estimate the illuminant color and gamma correction parameters based
on the semantic information of the given image. Experimental results show that
feeding the CNN with the semantic information leads to a significant
improvement in the results by reducing the error by more than 40%.
| cs.CV | the goal of computational color constancy is to preserve the perceptive colors of objects under different lighting conditions by removing the effect of color casts caused by the scenes illumination with the rapid development of deep learning based techniques significant progress has been made in image semantic segmentation in this work we exploit the semantic information together with the color and spatial information of the input image in order to remove color casts we train a convolutional neural network cnn model that learns to estimate the illuminant color and gamma correction parameters based on the semantic information of the given image experimental results show that feeding the cnn with the semantic information leads to a significant improvement in the results by reducing the error by more than 40 | [['the', 'goal', 'of', 'computational', 'color', 'constancy', 'is', 'to', 'preserve', 'the', 'perceptive', 'colors', 'of', 'objects', 'under', 'different', 'lighting', 'conditions', 'by', 'removing', 'the', 'effect', 'of', 'color', 'casts', 'caused', 'by', 'the', 'scenes', 'illumination', 'with', 'the', 'rapid', 'development', 'of', 'deep', 'learning', 'based', 'techniques', 'significant', 'progress', 'has', 'been', 'made', 'in', 'image', 'semantic', 'segmentation', 'in', 'this', 'work', 'we', 'exploit', 'the', 'semantic', 'information', 'together', 'with', 'the', 'color', 'and', 'spatial', 'information', 'of', 'the', 'input', 'image', 'in', 'order', 'to', 'remove', 'color', 'casts', 'we', 'train', 'a', 'convolutional', 'neural', 'network', 'cnn', 'model', 'that', 'learns', 'to', 'estimate', 'the', 'illuminant', 'color', 'and', 'gamma', 'correction', 'parameters', 'based', 'on', 'the', 'semantic', 'information', 'of', 'the', 'given', 'image', 'experimental', 'results', 'show', 'that', 'feeding', 'the', 'cnn', 'with', 'the', 'semantic', 'information', 'leads', 'to', 'a', 'significant', 'improvement', 'in', 'the', 'results', 'by', 'reducing', 'the', 'error', 'by', 'more', 'than', '40']] | [-0.01452508036072686, 0.026158424800087232, -0.10807018470950425, 0.0400550382619258, -0.11248108190739003, -0.11441125030705734, 0.016744976798690914, 0.47723374667111784, -0.22877274526763358, -0.37608095590258017, 0.0499637344655639, -0.2532351263507735, -0.15491013053406277, 0.12889431706753385, -0.23096718761735247, 0.08570692571402105, 0.1095216518297093, 0.055012065669870935, -0.10296310052763147, -0.27607528353109956, 0.33256416668882594, 0.023639335331381517, 0.33773206090700114, 0.060339566106904385, 0.14542014934886538, 0.004963805447914638, -0.11428087199601578, -0.008360278265172383, -0.06064851703979457, 0.19270787275308976, 0.26254678050463554, 0.18357396359442646, 0.2813025496325281, -0.44530580586433643, -0.25669384143839125, 0.07272495161851111, 0.0878018460707608, 0.12591161953969277, -0.06203072566643186, -0.3572197555185994, 0.10475171475172829, -0.10896173342916882, 0.008899771579308435, -0.06339794157247525, 0.0018223258302896284, -0.04341310414201871, -0.2627154284855351, 0.022771677126002032, 0.12726691698480863, 0.06148144940380007, -0.06218302601155301, -0.09590889813080139, -0.021123364007507917, 0.19285855257112416, 0.02341012170745671, 0.115131615086284, 0.14411750370709342, -0.2736440582320938, -0.1092756234575063, 0.3617366765247425, -0.07666435000612637, -0.1832924950231245, 0.14285227116124588, -0.05388707151723793, -0.11524211374489823, 0.14901920613192488, 0.1873247867624741, 0.060215935242013074, -0.17122034064004765, -0.013777756467789004, -0.0403832933443482, 0.21337783760463935, 0.08038752838911023, 0.07715370981532033, 0.18700086871831445, 0.2430136253897217, 0.031200265516872605, 0.16350836106175848, -0.21829654219436634, -0.022680400164972525, -0.20731900881764886, -0.08360823188559152, -0.1795743767379463, -0.044024575196090154, -0.14788979787022072, -0.09738289425104085, 0.43085894273099257, 0.26290176180918934, 0.24944891630912025, 0.05151294796996808, 0.35452402599548805, 0.03696633955951256, 0.18400530570943374, 0.07302646824609837, 0.21245105261641584, 0.05360667084414672, 0.10569295543245971, -0.20318307858087792, 0.10162313913315302, 0.08648954710224643] |
1,802.00154 | Bootstrapping and Multiple Imputation Ensemble Approaches for Missing
Data | Presence of missing values in a dataset can adversely affect the performance
of a classifier. Single and Multiple Imputation are normally performed to fill
in the missing values. In this paper, we present several variants of combining
single and multiple imputation with bootstrapping to create ensembles that can
model uncertainty and diversity in the data, and that are robust to high
missingness in the data. We present three ensemble strategies: bootstrapping on
incomplete data followed by (i) single imputation and (ii) multiple imputation,
and (iii) multiple imputation ensemble without bootstrapping. We perform an
extensive evaluation of the performance of the these ensemble strategies on 8
datasets by varying the missingness ratio. Our results show that bootstrapping
followed by multiple imputation using expectation maximization is the most
robust method even at high missingness ratio (up to 30%). For small missingness
ratio (up to 10%) most of the ensemble methods perform quivalently but better
than single imputation. Kappa-error plots suggest that accurate classifiers
with reasonable diversity is the reason for this behaviour. A consistent
observation in all the datasets suggests that for small missingness (up to
10%), bootstrapping on incomplete data without any imputation produces
equivalent results to other ensemble methods.
| cs.LG | presence of missing values in a dataset can adversely affect the performance of a classifier single and multiple imputation are normally performed to fill in the missing values in this paper we present several variants of combining single and multiple imputation with bootstrapping to create ensembles that can model uncertainty and diversity in the data and that are robust to high missingness in the data we present three ensemble strategies bootstrapping on incomplete data followed by i single imputation and ii multiple imputation and iii multiple imputation ensemble without bootstrapping we perform an extensive evaluation of the performance of the these ensemble strategies on 8 datasets by varying the missingness ratio our results show that bootstrapping followed by multiple imputation using expectation maximization is the most robust method even at high missingness ratio up to 30 for small missingness ratio up to 10 most of the ensemble methods perform quivalently but better than single imputation kappaerror plots suggest that accurate classifiers with reasonable diversity is the reason for this behaviour a consistent observation in all the datasets suggests that for small missingness up to 10 bootstrapping on incomplete data without any imputation produces equivalent results to other ensemble methods | [['presence', 'of', 'missing', 'values', 'in', 'a', 'dataset', 'can', 'adversely', 'affect', 'the', 'performance', 'of', 'a', 'classifier', 'single', 'and', 'multiple', 'imputation', 'are', 'normally', 'performed', 'to', 'fill', 'in', 'the', 'missing', 'values', 'in', 'this', 'paper', 'we', 'present', 'several', 'variants', 'of', 'combining', 'single', 'and', 'multiple', 'imputation', 'with', 'bootstrapping', 'to', 'create', 'ensembles', 'that', 'can', 'model', 'uncertainty', 'and', 'diversity', 'in', 'the', 'data', 'and', 'that', 'are', 'robust', 'to', 'high', 'missingness', 'in', 'the', 'data', 'we', 'present', 'three', 'ensemble', 'strategies', 'bootstrapping', 'on', 'incomplete', 'data', 'followed', 'by', 'i', 'single', 'imputation', 'and', 'ii', 'multiple', 'imputation', 'and', 'iii', 'multiple', 'imputation', 'ensemble', 'without', 'bootstrapping', 'we', 'perform', 'an', 'extensive', 'evaluation', 'of', 'the', 'performance', 'of', 'the', 'these', 'ensemble', 'strategies', 'on', '8', 'datasets', 'by', 'varying', 'the', 'missingness', 'ratio', 'our', 'results', 'show', 'that', 'bootstrapping', 'followed', 'by', 'multiple', 'imputation', 'using', 'expectation', 'maximization', 'is', 'the', 'most', 'robust', 'method', 'even', 'at', 'high', 'missingness', 'ratio', 'up', 'to', '30', 'for', 'small', 'missingness', 'ratio', 'up', 'to', '10', 'most', 'of', 'the', 'ensemble', 'methods', 'perform', 'quivalently', 'but', 'better', 'than', 'single', 'imputation', 'kappaerror', 'plots', 'suggest', 'that', 'accurate', 'classifiers', 'with', 'reasonable', 'diversity', 'is', 'the', 'reason', 'for', 'this', 'behaviour', 'a', 'consistent', 'observation', 'in', 'all', 'the', 'datasets', 'suggests', 'that', 'for', 'small', 'missingness', 'up', 'to', '10', 'bootstrapping', 'on', 'incomplete', 'data', 'without', 'any', 'imputation', 'produces', 'equivalent', 'results', 'to', 'other', 'ensemble', 'methods']] | [-0.05541939214510172, 0.03207835468983923, -0.056330125366436876, 0.10392351187103745, -0.055359435476939466, -0.181345777909938, 0.09902396922763249, 0.4474509466571856, -0.21670587086366952, -0.3701191049773567, 0.10998513397221751, -0.2904626411210916, -0.07936295511456311, 0.1774984112639201, -0.10070386765345099, 0.05261158177804623, 0.16872174628220762, -0.011661148745316048, -0.04415927124847918, -0.3247621380913114, 0.3128733278345553, 0.08643396000666213, 0.3375707689606523, -0.028572758116054957, 0.07536399838051329, 0.020186705101130124, -0.06722057371064642, 0.03471043741928537, -0.02506530038551646, 0.14227695078447197, 0.2644254647769734, 0.17191816742241212, 0.32672086174642373, -0.37170984794570106, -0.19500482365072982, 0.10878680541232078, 0.1600566502060117, 0.11038775185284413, -0.020509532164087338, -0.25085689579396686, 0.116438474249376, -0.16415094250463289, -0.020145590807107955, -0.14243554498357366, -0.0745331868576595, -0.011999233145394415, -0.37213408363850664, 0.14678327012854406, 0.022843701755486164, 0.08997768386347493, -0.04680749060953808, -0.19513614696975287, 0.04124877888940955, 0.11749021373074596, 0.06687788303343456, 0.002955689983440062, 0.10817514294238412, -0.1081640621006659, -0.1632089469307646, 0.31620401067678167, -0.0866461489672405, -0.230353637288802, 0.18933931981842153, -0.10569582941473891, -0.16473480153516842, 0.14066065780151882, 0.17355282026517965, 0.0941311473731273, -0.1789381096687943, -0.060272700235431985, -0.005121847429090572, 0.17855627772393565, 0.02900903673398162, -0.037683279969762576, 0.15727599870252806, 0.1901512884766544, 0.00013751243264768936, 0.09976630849642017, -0.18053079702002633, -0.08052094755126966, -0.2305040942067115, -0.07182010322025337, -0.18732209123439406, -0.002954692206331316, -0.1709455261073432, -0.16376346976349726, 0.3527093052504783, 0.2653483469842881, 0.260851255925325, 0.0864662113670392, 0.33111387136661763, 0.046928207109313516, 0.08748825452985422, 0.04978147831267966, 0.1868916962231949, 0.007793774782221405, 0.0604227925934427, -0.1866576339491657, 0.1180094423926043, -0.0496729548918887] |
1,802.00155 | Revisiting Final State Interaction in Charmless $B_q\to P P$ Decays | Various new measurements in charmless $B_{u,d,s}\to PP$ modes, where $P$ is a
low lying pseudoscalar meson, are reported by Belle and LHCb. These include the
rates of $B^0\to\pi^0\pi^0$, $\eta\pi^0$, $B_s\to\eta'\eta'$, $B^0\to K^+K^-$
and $B^0_s\to\pi^+\pi^-$ decays. Some of these modes are highly suppressed and
are among the rarest $B$ decays. Direct CP asymmetries on various modes are
constantly updated. It is well known that direct CP asymmetries and rates of
suppressed modes are sensitive to final state interaction (FSI). As new
measurements are reported and more data will be collected, it is interesting
and timely to revisit the rescattering effects in $B_{u,d,s}\to PP$ states. We
perform a $\chi^2$ analysis with all available data on CP-averaged rates and CP
asymmetries in $\overline B{}_{u,d,s}\to PP$ decays. Our numerical results are
compared to data and those from factorization approach. The quality of the fit
is improved significantly from the factorization results in the presence of
rescattering. The relations on topological amplitudes and rescattering are
explored and they help to provide a better understanding of the effects of FSI.
As suggested by U(3) symmetry on topological amplitudes and FSI, a vanishing
exchange rescattering scenario is considered. The exchange, annihilation,
$u$-penguin, $u$-penguin annihilation and some electroweak penguin amplitudes
are enhanced significantly via annihilation and total annihilation
rescatterings. In particular, the $u$-penguin annihilation amplitude is sizably
enhanced by the tree amplitude via total annihilation rescattering. These
enhancements affect rates and CP asymmetries. Predictions can be checked in the
near future.
| hep-ph hep-ex | various new measurements in charmless b_udsto pp modes where p is a low lying pseudoscalar meson are reported by belle and lhcb these include the rates of b0topi0pi0 etapi0 b_stoetaeta b0to kk and b0_stopipi decays some of these modes are highly suppressed and are among the rarest b decays direct cp asymmetries on various modes are constantly updated it is well known that direct cp asymmetries and rates of suppressed modes are sensitive to final state interaction fsi as new measurements are reported and more data will be collected it is interesting and timely to revisit the rescattering effects in b_udsto pp states we perform a chi2 analysis with all available data on cpaveraged rates and cp asymmetries in overline b_udsto pp decays our numerical results are compared to data and those from factorization approach the quality of the fit is improved significantly from the factorization results in the presence of rescattering the relations on topological amplitudes and rescattering are explored and they help to provide a better understanding of the effects of fsi as suggested by u3 symmetry on topological amplitudes and fsi a vanishing exchange rescattering scenario is considered the exchange annihilation upenguin upenguin annihilation and some electroweak penguin amplitudes are enhanced significantly via annihilation and total annihilation rescatterings in particular the upenguin annihilation amplitude is sizably enhanced by the tree amplitude via total annihilation rescattering these enhancements affect rates and cp asymmetries predictions can be checked in the near future | [['various', 'new', 'measurements', 'in', 'charmless', 'b_udsto', 'pp', 'modes', 'where', 'p', 'is', 'a', 'low', 'lying', 'pseudoscalar', 'meson', 'are', 'reported', 'by', 'belle', 'and', 'lhcb', 'these', 'include', 'the', 'rates', 'of', 'b0topi0pi0', 'etapi0', 'b_stoetaeta', 'b0to', 'kk', 'and', 'b0_stopipi', 'decays', 'some', 'of', 'these', 'modes', 'are', 'highly', 'suppressed', 'and', 'are', 'among', 'the', 'rarest', 'b', 'decays', 'direct', 'cp', 'asymmetries', 'on', 'various', 'modes', 'are', 'constantly', 'updated', 'it', 'is', 'well', 'known', 'that', 'direct', 'cp', 'asymmetries', 'and', 'rates', 'of', 'suppressed', 'modes', 'are', 'sensitive', 'to', 'final', 'state', 'interaction', 'fsi', 'as', 'new', 'measurements', 'are', 'reported', 'and', 'more', 'data', 'will', 'be', 'collected', 'it', 'is', 'interesting', 'and', 'timely', 'to', 'revisit', 'the', 'rescattering', 'effects', 'in', 'b_udsto', 'pp', 'states', 'we', 'perform', 'a', 'chi2', 'analysis', 'with', 'all', 'available', 'data', 'on', 'cpaveraged', 'rates', 'and', 'cp', 'asymmetries', 'in', 'overline', 'b_udsto', 'pp', 'decays', 'our', 'numerical', 'results', 'are', 'compared', 'to', 'data', 'and', 'those', 'from', 'factorization', 'approach', 'the', 'quality', 'of', 'the', 'fit', 'is', 'improved', 'significantly', 'from', 'the', 'factorization', 'results', 'in', 'the', 'presence', 'of', 'rescattering', 'the', 'relations', 'on', 'topological', 'amplitudes', 'and', 'rescattering', 'are', 'explored', 'and', 'they', 'help', 'to', 'provide', 'a', 'better', 'understanding', 'of', 'the', 'effects', 'of', 'fsi', 'as', 'suggested', 'by', 'u3', 'symmetry', 'on', 'topological', 'amplitudes', 'and', 'fsi', 'a', 'vanishing', 'exchange', 'rescattering', 'scenario', 'is', 'considered', 'the', 'exchange', 'annihilation', 'upenguin', 'upenguin', 'annihilation', 'and', 'some', 'electroweak', 'penguin', 'amplitudes', 'are', 'enhanced', 'significantly', 'via', 'annihilation', 'and', 'total', 'annihilation', 'rescatterings', 'in', 'particular', 'the', 'upenguin', 'annihilation', 'amplitude', 'is', 'sizably', 'enhanced', 'by', 'the', 'tree', 'amplitude', 'via', 'total', 'annihilation', 'rescattering', 'these', 'enhancements', 'affect', 'rates', 'and', 'cp', 'asymmetries', 'predictions', 'can', 'be', 'checked', 'in', 'the', 'near', 'future']] | [-0.11781850509892346, 0.24066668038480601, -0.08713545581457278, 0.15407999032331607, -0.08589610570406007, -0.10881275821600836, 0.04562801223381566, 0.32861174282973393, -0.21403979701646972, -0.2527014358486996, 0.024324374709131496, -0.35766543256103434, -0.03444438905617477, 0.17191663998492154, 0.07561898915120303, 0.07351456881265052, 0.1273591069036542, -0.024087902499412096, -0.03133049943625417, -0.22043687812752125, 0.26113042652923846, 0.0173072039238583, 0.23370640301164936, 0.12075692166369485, -0.08611344161039582, 0.01903683884954273, -0.1096220985132258, -0.03751194831447606, -0.11430861934282478, 0.042842470543001124, 0.24429862941948588, 0.09631609766458112, 0.05561073923858339, -0.3930522288887518, -0.1008102532932187, 0.1326015869457916, 0.1958538457071138, 0.1031494429692456, -0.03782943028627452, -0.3679629215445076, 0.10994510730913032, -0.1829916589595841, -0.033321308385565324, -0.14082078730757058, 0.026113996442592862, -0.04809186417083894, -0.3530343399649772, 0.1201293784168576, -0.04326668089589962, -0.007081392010542491, 0.007269593508318994, -0.21821130129906707, -0.07249143357964472, 0.04076316784990032, 0.12078788831319923, 0.05981660494194424, 0.16526024758524002, -0.14805209205806627, -0.16711617754269933, 0.38984531165425246, -0.04073764866457564, -0.16703880855357622, 0.17227902251616492, -0.17037475816093972, -0.11759123229518285, 0.17457279134773615, 0.21822902114281267, 0.06328396415299276, -0.15360499013416254, 0.08982852873205463, 0.0273194960415116, 0.12214740258313066, 0.07839488238289458, 0.1053206872304175, 0.14857722820590455, 0.14380656147116788, -0.03590319294837995, 0.04151728766761659, -0.08195968790760426, -0.0728301118394646, -0.3628998768295614, -0.088651789925921, -0.0601708167430624, 0.020805999534726297, -0.05022511211660095, -0.03834527466181449, 0.33572160299187254, 0.06923523421024448, 0.2708016868016037, -0.01863998691821896, 0.32658222033275114, 0.09952646611438083, 0.07132035731101269, 0.043879975464303216, 0.34175440937756946, 0.1751984895595361, 0.1298658320587515, -0.2948351849799906, 0.09272128069015892, 0.010341034101755107] |
1,802.00156 | The Great Division | When information flow fails, when Democrats and Republicans do not talk to
each other, when Israelis and Palestinians do not talk to each other, and when
North Koreans and South Koreans do not talk to each other, mis-perceptions,
biases and fake news arise. In this paper we present an in-depth study of
political polarization and social division using Twitter data and Monte Carlo
simulations. First, we study at the aggregate level people's inclination to
retweet within their own ideological circle. Introducing the concept of cocoon
ratio, we show that Donald Trump's followers are 2.56 more likely to retweet a
fellow Trump follower than to retweet a Hillary Clinton follower. Second, going
down to the individual level, we show that the tendency of retweeting
exclusively within one's ideological circle is stronger for women than for men
and that such tendency weakens as one's social capital grows. Third, we use a
one-dimensional Ising model to simulate how a society with high cocoon ratios
could end up becoming completely divided. We conclude with a discussion of our
findings with respect to fake news.
| cs.SI | when information flow fails when democrats and republicans do not talk to each other when israelis and palestinians do not talk to each other and when north koreans and south koreans do not talk to each other misperceptions biases and fake news arise in this paper we present an indepth study of political polarization and social division using twitter data and monte carlo simulations first we study at the aggregate level peoples inclination to retweet within their own ideological circle introducing the concept of cocoon ratio we show that donald trumps followers are 256 more likely to retweet a fellow trump follower than to retweet a hillary clinton follower second going down to the individual level we show that the tendency of retweeting exclusively within ones ideological circle is stronger for women than for men and that such tendency weakens as ones social capital grows third we use a onedimensional ising model to simulate how a society with high cocoon ratios could end up becoming completely divided we conclude with a discussion of our findings with respect to fake news | [['when', 'information', 'flow', 'fails', 'when', 'democrats', 'and', 'republicans', 'do', 'not', 'talk', 'to', 'each', 'other', 'when', 'israelis', 'and', 'palestinians', 'do', 'not', 'talk', 'to', 'each', 'other', 'and', 'when', 'north', 'koreans', 'and', 'south', 'koreans', 'do', 'not', 'talk', 'to', 'each', 'other', 'misperceptions', 'biases', 'and', 'fake', 'news', 'arise', 'in', 'this', 'paper', 'we', 'present', 'an', 'indepth', 'study', 'of', 'political', 'polarization', 'and', 'social', 'division', 'using', 'twitter', 'data', 'and', 'monte', 'carlo', 'simulations', 'first', 'we', 'study', 'at', 'the', 'aggregate', 'level', 'peoples', 'inclination', 'to', 'retweet', 'within', 'their', 'own', 'ideological', 'circle', 'introducing', 'the', 'concept', 'of', 'cocoon', 'ratio', 'we', 'show', 'that', 'donald', 'trumps', 'followers', 'are', '256', 'more', 'likely', 'to', 'retweet', 'a', 'fellow', 'trump', 'follower', 'than', 'to', 'retweet', 'a', 'hillary', 'clinton', 'follower', 'second', 'going', 'down', 'to', 'the', 'individual', 'level', 'we', 'show', 'that', 'the', 'tendency', 'of', 'retweeting', 'exclusively', 'within', 'ones', 'ideological', 'circle', 'is', 'stronger', 'for', 'women', 'than', 'for', 'men', 'and', 'that', 'such', 'tendency', 'weakens', 'as', 'ones', 'social', 'capital', 'grows', 'third', 'we', 'use', 'a', 'onedimensional', 'ising', 'model', 'to', 'simulate', 'how', 'a', 'society', 'with', 'high', 'cocoon', 'ratios', 'could', 'end', 'up', 'becoming', 'completely', 'divided', 'we', 'conclude', 'with', 'a', 'discussion', 'of', 'our', 'findings', 'with', 'respect', 'to', 'fake', 'news']] | [-0.0716079682317102, 0.13087614619487364, -0.06327220808657075, 0.12730939148498824, -0.18773113618855983, -0.17170601642397598, 0.10787016019327147, 0.4248878462135457, -0.20557005939942397, -0.3099653612278805, 0.0763638364458509, -0.3905408876409147, -0.1601203348751839, 0.12697386887157336, -0.10413048494335138, -0.1088806606778153, 0.04668751214905589, 0.0653331110389966, 0.0052216163394302965, -0.3317934399250937, 0.27724320742594644, 0.0917047303316466, 0.2819200372480358, 0.06664615966578465, 0.04693553363855305, 0.004676265691752347, -0.07069839333351492, 0.019781654745110133, -0.11354680914686714, 0.09954507110033477, 0.2652319099641604, 0.1644546942460989, 0.36395856076746846, -0.41483500484230645, -0.11840320380373198, 0.12144309496820978, 0.1578938044775068, 0.10293710543355497, 0.019835005554464106, -0.30854761815797327, 0.08278988634649496, -0.24262769835781348, -0.11443729705982998, -0.01385494344802364, 0.011000713659188805, 0.028457320170029683, -0.17688440311218748, 0.07146675425079348, 0.04588113818186848, 0.09485728634401026, -0.004412703692855502, -0.11421576985210348, -0.06676285947395719, 0.16938261405350327, 0.11239971267844268, 0.021936483627245394, 0.18056337519161655, -0.13452988256323622, -0.14607724233457212, 0.3970072209054154, -0.028920484079065042, -0.12683896092813085, 0.17910071583909473, -0.1855737624004525, -0.16935374400953845, 0.05288260256390223, 0.2149346691315596, 0.057739821754806686, -0.12907509721607607, -0.10000604320725615, -0.059973699672906826, 0.20002280352908589, 0.07861734693869948, -0.04286606877968971, 0.2126805728897871, 0.1003341968642192, 0.07290219115171832, 0.07604480959217357, -0.060068281056108265, -0.12645647069439292, -0.21659099729862483, -0.11520588461811958, -0.0932554262755648, 0.07384705147207284, -0.05671203745400868, -0.10912856791826395, 0.35721390994705177, 0.18704358652087577, 0.1655640188312574, 0.07803052069692548, 0.26169939582979074, -0.0067525895631589585, 0.03703740165310796, 0.11376964889749298, 0.18417100155244717, 0.0034527315109382185, 0.17270578116079102, -0.12601987556688451, 0.10555308075161295, -0.007374514539181935] |
1,802.00157 | Optimal LRC codes for all lenghts n <= q | A family of distance-optimal LRC codes from certain subcodes of $q$-ary
Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the
code length $n$ is a multiple of $r+1.$ By shortening codes from this family,
we show that it is possible to lift this assumption, still obtaining
distance-optimal codes.
| cs.IT math.IT | a family of distanceoptimal lrc codes from certain subcodes of qary reedsolomon codes proposed by itamo and abarg in 2014 assumes that the code length n is a multiple of r1 by shortening codes from this family we show that it is possible to lift this assumption still obtaining distanceoptimal codes | [['a', 'family', 'of', 'distanceoptimal', 'lrc', 'codes', 'from', 'certain', 'subcodes', 'of', 'qary', 'reedsolomon', 'codes', 'proposed', 'by', 'itamo', 'and', 'abarg', 'in', '2014', 'assumes', 'that', 'the', 'code', 'length', 'n', 'is', 'a', 'multiple', 'of', 'r1', 'by', 'shortening', 'codes', 'from', 'this', 'family', 'we', 'show', 'that', 'it', 'is', 'possible', 'to', 'lift', 'this', 'assumption', 'still', 'obtaining', 'distanceoptimal', 'codes']] | [-0.22883184619095862, 0.07482828754855662, -0.07330283191891349, 0.07846130427847407, 0.04028224880445977, -0.2677408620829181, 0.008810806848412874, 0.35175919707636444, -0.3592035986331044, -0.24754871633283945, 0.12346768698284441, -0.2457200739988867, -0.1850293221531854, 0.2408973119810832, -0.1509468815270431, 0.11054394633642264, 0.10017766373003928, 0.020199402729619523, -0.12730350607782792, -0.35859969410361076, 0.33700303699136996, 0.2001284330475087, 0.2222502495029143, -0.029409025520162314, 0.06275988124044878, 0.00553802955819636, 0.0008122210523911885, -0.039323430071223756, -0.2111893789762541, 0.11007920132441522, 0.2591624988280997, 0.2192072636846985, 0.18001396983519805, -0.2662396454537401, -0.2755718650676462, 0.07946307655175606, 0.13454863178182622, 0.2363274474248138, -0.051792692839719205, -0.12657372531842212, 0.17889341377482124, -0.22672717615353818, -0.016315542902721435, 0.038467114553691784, 0.048385350489798855, 0.0190454687238956, -0.313376686383723, -0.061332265751398336, 0.1412745614973258, 0.08738514069261086, -0.015903395790682763, -0.1522592134792738, 0.03565469087690723, 0.0526174333763822, 0.03985293404845407, 0.09479390110402387, -0.03876901101511048, 0.005636855931382398, -0.10090615459698804, 0.3198207690242716, -0.011935186211247834, -0.19349014473964973, 0.08171667667980097, -0.07278090667891868, -0.10358401186460135, 0.17346462147424416, 0.1797043030359307, 0.14464579581530118, -0.09437434858053315, 0.12603237249826707, -0.165633281578823, 0.20832916128696227, 0.12348948468511202, 0.09067716805872564, 0.17659441792235084, 0.023763447771875227, 0.013840048611924356, 0.20330146154654877, -0.02307510945223728, -0.04833647475829728, -0.27898038801266717, -0.09617286015834127, -0.20476561503446833, 0.07824548805246548, -0.119213120384339, -0.17497050180099905, 0.3712298349876489, 0.12927590519645993, 0.12341663714650335, 0.14958653472392458, 0.19552851578562844, -0.09217689475234674, 0.18511600199402595, 0.26366582830265467, 0.13794163295200892, 0.13419459723363802, -0.08582697116902896, -0.19040370743949803, 0.06928296614324256, 0.159320302934823] |
1,802.00158 | Negative thermal expansion and magnetoelastic coupling in the breathing
pyrochlore lattice material LiGaCr4S8 | The physical properties of the spinel LiGaCr4S8 have been studied with
neutron diffraction, X-ray diffraction, magnetic susceptibility and heat
capacity measurements. The neutron diffraction and synchrotron X-ray
diffraction data reveal negative thermal expansion (NTE) below 111(4) K. The
magnetic susceptibility deviates from Curie-Weiss behavior with the onset of
NTE. At low temperature a broad peak in the magnetic susceptibility at 10.3(3)
K is accompanied by the return of normal thermal expansion. First principles
calculations find a strong coupling between the lattice and the simulated
magnetic ground state. These results indicate strong magnetoelastic coupling in
LiGaCr4S8.
| cond-mat.other cond-mat.mtrl-sci | the physical properties of the spinel ligacr4s8 have been studied with neutron diffraction xray diffraction magnetic susceptibility and heat capacity measurements the neutron diffraction and synchrotron xray diffraction data reveal negative thermal expansion nte below 1114 k the magnetic susceptibility deviates from curieweiss behavior with the onset of nte at low temperature a broad peak in the magnetic susceptibility at 1033 k is accompanied by the return of normal thermal expansion first principles calculations find a strong coupling between the lattice and the simulated magnetic ground state these results indicate strong magnetoelastic coupling in ligacr4s8 | [['the', 'physical', 'properties', 'of', 'the', 'spinel', 'ligacr4s8', 'have', 'been', 'studied', 'with', 'neutron', 'diffraction', 'xray', 'diffraction', 'magnetic', 'susceptibility', 'and', 'heat', 'capacity', 'measurements', 'the', 'neutron', 'diffraction', 'and', 'synchrotron', 'xray', 'diffraction', 'data', 'reveal', 'negative', 'thermal', 'expansion', 'nte', 'below', '1114', 'k', 'the', 'magnetic', 'susceptibility', 'deviates', 'from', 'curieweiss', 'behavior', 'with', 'the', 'onset', 'of', 'nte', 'at', 'low', 'temperature', 'a', 'broad', 'peak', 'in', 'the', 'magnetic', 'susceptibility', 'at', '1033', 'k', 'is', 'accompanied', 'by', 'the', 'return', 'of', 'normal', 'thermal', 'expansion', 'first', 'principles', 'calculations', 'find', 'a', 'strong', 'coupling', 'between', 'the', 'lattice', 'and', 'the', 'simulated', 'magnetic', 'ground', 'state', 'these', 'results', 'indicate', 'strong', 'magnetoelastic', 'coupling', 'in', 'ligacr4s8']] | [-0.14796913712236442, 0.26523603311139404, -0.04521091032381121, 0.015486771658700155, -0.10053605563007295, -0.05917132526243988, 0.12134590111917963, 0.39736806201307395, -0.2750645869264477, -0.3200246811305222, 0.03205844582744727, -0.40335729643702506, -0.03279140932044308, 0.20980929214458324, 0.14756859378202966, 0.011584568165830875, -0.03949629105627537, 0.05001471420799039, -0.10445793524972702, -0.15006849211296006, 0.2515378553714407, 0.08540998614442191, 0.3349939865109168, 0.14733430826546332, 0.03963519714552125, -0.01769463215513449, 0.12295943923588647, 0.04915899292222763, -0.14123007989102535, -0.02872919946614849, 0.23108813323472677, -0.07064555384659846, 0.14015496681493364, -0.4132400791013711, -0.25689416227886747, -0.009287400391737097, 0.04197996794338044, 0.03796402655149761, -0.06414595638481459, -0.20771648534818699, 0.025739194869406914, -0.09810770292227206, -0.14971826186795767, -0.15280115956342535, -0.07853217473939846, 0.0255187111441046, -0.26405280193215924, 0.19231622059290346, 0.04986845561989436, 0.1765107224663983, -0.17037623208506328, -0.1411891250822105, -0.02267243431783036, 0.01381719887844826, 0.0854007896599605, 0.04981981528705402, 0.15113019990875678, -0.10484112920484652, -0.10208611574121997, 0.33230389896780255, -0.06057529748466454, 0.09401827476134425, 0.11065133117923612, -0.32703985599800944, -0.11351391029495157, 0.2671931600394218, 0.07878062727027818, 0.09190931984370476, -0.14995761657819937, 0.036035408384448506, 0.003700579163667403, 0.21177649646507282, 0.08789243880463274, 0.046369425638725884, 0.27829290832343856, 0.16462237311184014, -0.07433935095752148, 0.18561083581543675, -0.1733124758067884, -0.008743045101628492, -0.21033682559469813, -0.05920951560531792, -0.20433879050573237, 0.12166684375781762, -0.15776326167106164, -0.19102310120177113, 0.2720593505489983, 0.11696676101633592, 0.14888890089565202, -0.05289292467365923, 0.27856399526721554, 0.12045463026427713, 0.06657155540918833, 0.0895206355771638, 0.29458041976353055, 0.27493874939207574, 0.2265300880137243, -0.3896839843695297, 0.10172454476062405, -0.03565660030826142] |
1,802.00159 | Combination of complex momentum representation and Green's function
methods in relativistic mean-field theory | We have combined the complex momentum representation method with the Green's
function method in the relativistic mean-field framework to establish the
RMF-CMR-GF approach. This new approach is applied to study the halo structure
of $^{74}$Ca. All the continuum level density of concerned resonant states are
calculated accurately without introducing any unphysical parameters, and they
are independent of the choice of integral contour. The important
single-particle wave functions and densities for the halo phenomenon in
$^{74}$Ca are discussed in detail.
| nucl-th nucl-ex | we have combined the complex momentum representation method with the greens function method in the relativistic meanfield framework to establish the rmfcmrgf approach this new approach is applied to study the halo structure of 74ca all the continuum level density of concerned resonant states are calculated accurately without introducing any unphysical parameters and they are independent of the choice of integral contour the important singleparticle wave functions and densities for the halo phenomenon in 74ca are discussed in detail | [['we', 'have', 'combined', 'the', 'complex', 'momentum', 'representation', 'method', 'with', 'the', 'greens', 'function', 'method', 'in', 'the', 'relativistic', 'meanfield', 'framework', 'to', 'establish', 'the', 'rmfcmrgf', 'approach', 'this', 'new', 'approach', 'is', 'applied', 'to', 'study', 'the', 'halo', 'structure', 'of', '74ca', 'all', 'the', 'continuum', 'level', 'density', 'of', 'concerned', 'resonant', 'states', 'are', 'calculated', 'accurately', 'without', 'introducing', 'any', 'unphysical', 'parameters', 'and', 'they', 'are', 'independent', 'of', 'the', 'choice', 'of', 'integral', 'contour', 'the', 'important', 'singleparticle', 'wave', 'functions', 'and', 'densities', 'for', 'the', 'halo', 'phenomenon', 'in', '74ca', 'are', 'discussed', 'in', 'detail']] | [-0.10352650668325, 0.10470573416310608, -0.11809505329859492, 0.14669422426653145, -0.042775213932863584, -0.05556417959987333, 0.0016300547990555827, 0.40184162118423145, -0.21908982837033508, -0.30086031315946266, 0.010197277960526807, -0.23112973007128426, -0.15156010685390547, 0.16714663146749922, 0.026799315329347, 0.0950370641229184, 0.03805278013092711, 0.016341720309451614, -0.0783786467524662, -0.17422773905931727, 0.37176336759799405, 0.026914625764459885, 0.2562087658964294, 0.05206173564932358, 0.08584837415745776, 0.050209345265389664, -0.05026411271874646, 0.007582849112192267, -0.1289242379685962, 0.12355661512839633, 0.2469038600102067, 0.07852739339307989, 0.2500962767118931, -0.42381980645127204, -0.23973999473597168, 0.04349045840239054, 0.1409136687687255, 0.13345596275757998, -0.010428848451211755, -0.2793356913485025, 0.04680502866272276, -0.1727422180426258, -0.22599984786326163, -0.1156304673855438, -0.03686875726807078, 0.05529595390391095, -0.2273950299690784, 0.12974016978650502, 0.008919883016987066, 0.013900696655343237, -0.08613305144918788, -0.1563962394322612, -0.013614842128988943, 0.09545622016670868, 0.03404869879044494, 0.031415964144750765, 0.1347648022821982, -0.1320623809955769, -0.05308845703563604, 0.36094517279937127, -0.044631774518883935, -0.24932577066475028, 0.15937854189082587, -0.17589138688421563, -0.13418726718028715, 0.14613568105146682, 0.14963218186197705, 0.13945591957063266, -0.18029080830149868, 0.09974574177421776, -0.02390066365229646, 0.11980689754158161, 0.02750959926848545, 0.03565912761137282, 0.1805738671376419, 0.12338563321636205, 0.02561885195992593, 0.10752143115295391, -0.07928390587116346, -0.11286226799098872, -0.31448334180995036, -0.11428911003014564, -0.1901525217920272, -0.019648939909721344, -0.07226713783510556, -0.17257238692898108, 0.41445649877239604, 0.173846357238577, 0.19633748416641825, 0.028257586503107297, 0.2903073393788777, 0.22361933853550764, 0.06680208813448094, 0.053395410785206446, 0.2266476969663544, 0.16206686716453222, 0.03699825813160523, -0.25266876446671394, 0.03409141658400921, 0.0848752710612883] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.