id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.09167 | 3D Reconstruction & Assessment Framework based on affordable 2D Lidar | Lidar is extensively used in the industry and mass-market. Due to its
measurement accuracy and insensitivity to illumination compared to cameras, It
is applied onto a broad range of applications, like geodetic engineering, self
driving cars or virtual reality. But the 3D Lidar with multi-beam is very
expensive, and the massive measurements data can not be fully leveraged on some
constrained platforms. The purpose of this paper is to explore the possibility
of using cheap 2D Lidar off-the-shelf, to preform complex 3D Reconstruction,
moreover, the generated 3D map quality is evaluated by our proposed metrics at
the end. The 3D map is constructed in two ways, one way in which the scan is
performed at known positions with an external rotary axis at another plane. The
other way, in which the 2D Lidar for mapping and another 2D Lidar for
localization are placed on a trolley, the trolley is pushed on the ground
arbitrarily. The generated maps by different approaches are converted to
octomaps uniformly before the evaluation. The similarity and difference between
two maps will be evaluated by the proposed metrics thoroughly. The whole
mapping system is composed of several modular components. A 3D bracket was made
for assembling of the Lidar with a long range, the driver and the motor
together. A cover platform made for the IMU and 2D Lidar with a shorter range
but high accuracy. The software is stacked up in different ROS packages.
| cs.RO | lidar is extensively used in the industry and massmarket due to its measurement accuracy and insensitivity to illumination compared to cameras it is applied onto a broad range of applications like geodetic engineering self driving cars or virtual reality but the 3d lidar with multibeam is very expensive and the massive measurements data can not be fully leveraged on some constrained platforms the purpose of this paper is to explore the possibility of using cheap 2d lidar offtheshelf to preform complex 3d reconstruction moreover the generated 3d map quality is evaluated by our proposed metrics at the end the 3d map is constructed in two ways one way in which the scan is performed at known positions with an external rotary axis at another plane the other way in which the 2d lidar for mapping and another 2d lidar for localization are placed on a trolley the trolley is pushed on the ground arbitrarily the generated maps by different approaches are converted to octomaps uniformly before the evaluation the similarity and difference between two maps will be evaluated by the proposed metrics thoroughly the whole mapping system is composed of several modular components a 3d bracket was made for assembling of the lidar with a long range the driver and the motor together a cover platform made for the imu and 2d lidar with a shorter range but high accuracy the software is stacked up in different ros packages | [['lidar', 'is', 'extensively', 'used', 'in', 'the', 'industry', 'and', 'massmarket', 'due', 'to', 'its', 'measurement', 'accuracy', 'and', 'insensitivity', 'to', 'illumination', 'compared', 'to', 'cameras', 'it', 'is', 'applied', 'onto', 'a', 'broad', 'range', 'of', 'applications', 'like', 'geodetic', 'engineering', 'self', 'driving', 'cars', 'or', 'virtual', 'reality', 'but', 'the', '3d', 'lidar', 'with', 'multibeam', 'is', 'very', 'expensive', 'and', 'the', 'massive', 'measurements', 'data', 'can', 'not', 'be', 'fully', 'leveraged', 'on', 'some', 'constrained', 'platforms', 'the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'explore', 'the', 'possibility', 'of', 'using', 'cheap', '2d', 'lidar', 'offtheshelf', 'to', 'preform', 'complex', '3d', 'reconstruction', 'moreover', 'the', 'generated', '3d', 'map', 'quality', 'is', 'evaluated', 'by', 'our', 'proposed', 'metrics', 'at', 'the', 'end', 'the', '3d', 'map', 'is', 'constructed', 'in', 'two', 'ways', 'one', 'way', 'in', 'which', 'the', 'scan', 'is', 'performed', 'at', 'known', 'positions', 'with', 'an', 'external', 'rotary', 'axis', 'at', 'another', 'plane', 'the', 'other', 'way', 'in', 'which', 'the', '2d', 'lidar', 'for', 'mapping', 'and', 'another', '2d', 'lidar', 'for', 'localization', 'are', 'placed', 'on', 'a', 'trolley', 'the', 'trolley', 'is', 'pushed', 'on', 'the', 'ground', 'arbitrarily', 'the', 'generated', 'maps', 'by', 'different', 'approaches', 'are', 'converted', 'to', 'octomaps', 'uniformly', 'before', 'the', 'evaluation', 'the', 'similarity', 'and', 'difference', 'between', 'two', 'maps', 'will', 'be', 'evaluated', 'by', 'the', 'proposed', 'metrics', 'thoroughly', 'the', 'whole', 'mapping', 'system', 'is', 'composed', 'of', 'several', 'modular', 'components', 'a', '3d', 'bracket', 'was', 'made', 'for', 'assembling', 'of', 'the', 'lidar', 'with', 'a', 'long', 'range', 'the', 'driver', 'and', 'the', 'motor', 'together', 'a', 'cover', 'platform', 'made', 'for', 'the', 'imu', 'and', '2d', 'lidar', 'with', 'a', 'shorter', 'range', 'but', 'high', 'accuracy', 'the', 'software', 'is', 'stacked', 'up', 'in', 'different', 'ros', 'packages']] | [-0.08988217252087505, 0.07367733962685427, -0.046334931449847246, -0.006548066292361145, -0.03250805863194919, -0.15063513072986282, -0.01015528357155355, 0.4291967257442532, -0.27418674204592447, -0.3274815930347076, 0.12732649473556584, -0.2822824840633465, -0.112882018213536, 0.2651468034307355, -0.07033833345626246, 0.10190378432480048, 0.09775910441599348, 0.0020123991358070438, -0.0689623483315799, -0.20694995041596195, 0.2834415598390937, 0.03754322791957304, 0.3164875728416671, 0.011059352953452617, 0.12555295318959891, -0.0050003935696416296, -0.030942880466361258, 0.022383742848364245, -0.046964134799880014, 0.15163496604087537, 0.24733270587597214, 0.11262574214918711, 0.22088388581721097, -0.4107244363320725, -0.2098329684828181, 0.05417519232831473, 0.1178531809866491, 0.06963947861936695, -0.05918333579115022, -0.33463703361809444, 0.08756229719450354, -0.14739256321269498, -0.09783148242575469, -0.049209061668630094, 0.010846665307112476, 0.007276027592509484, -0.25730085341424186, -0.03673504275991777, -0.0220495313435339, 0.08132362595716287, -0.05168777855921208, -0.05510109096732257, -0.023242537655178926, 0.19559524753698374, -0.020147785106126, 0.10504509351693657, 0.1534427889493615, -0.13495988131719916, -0.06514201300979804, 0.43109530335323526, -0.04531463948098019, -0.23369306029689288, 0.250507948575287, -0.09538931294614371, -0.10778657557514199, 0.14540843473661283, 0.16533502816034779, 0.10687678521635997, -0.1656076117040112, 0.03411080074342977, -0.002526885338769365, 0.16266294250640423, 0.07514015679685947, -0.034575580180516985, 0.22453339161554806, 0.17621849926908603, 0.06458706954689653, 0.1332901953648631, -0.1507257539769165, -0.05354074158650987, -0.21023214637828178, -0.14212994186301567, -0.1997630451135768, 0.0006782430251145602, -0.04689635665889902, -0.1277648038690628, 0.39333307397739664, 0.18702170969683582, 0.19949030841235071, 0.01929440164836828, 0.37615074287559996, 0.07070860174824993, 0.11059084722377016, 0.028473546958876727, 0.2366426429128472, 0.04504313411708616, 0.13483519422109513, -0.13646600769364134, 0.04291113357924457, 0.03761088102175502] |
1,803.09168 | Vacua on the Brink of Decay | We consider free massive matter fields in static scalar, electric and
gravitational backgrounds. Tuning these backgrounds to the brink of vacuum
decay, we identify a term in their effective action that is singular. This
singular term is universal, being independent of the features of the background
configuration. In the case of gravitational backgrounds, it can be interpreted
as a quantum mechanical analog of Choptuik scaling. If the background is tuned
slightly above the instability threshold, this singular term gives the leading
contribution to the vacuum decay rate.
| hep-th | we consider free massive matter fields in static scalar electric and gravitational backgrounds tuning these backgrounds to the brink of vacuum decay we identify a term in their effective action that is singular this singular term is universal being independent of the features of the background configuration in the case of gravitational backgrounds it can be interpreted as a quantum mechanical analog of choptuik scaling if the background is tuned slightly above the instability threshold this singular term gives the leading contribution to the vacuum decay rate | [['we', 'consider', 'free', 'massive', 'matter', 'fields', 'in', 'static', 'scalar', 'electric', 'and', 'gravitational', 'backgrounds', 'tuning', 'these', 'backgrounds', 'to', 'the', 'brink', 'of', 'vacuum', 'decay', 'we', 'identify', 'a', 'term', 'in', 'their', 'effective', 'action', 'that', 'is', 'singular', 'this', 'singular', 'term', 'is', 'universal', 'being', 'independent', 'of', 'the', 'features', 'of', 'the', 'background', 'configuration', 'in', 'the', 'case', 'of', 'gravitational', 'backgrounds', 'it', 'can', 'be', 'interpreted', 'as', 'a', 'quantum', 'mechanical', 'analog', 'of', 'choptuik', 'scaling', 'if', 'the', 'background', 'is', 'tuned', 'slightly', 'above', 'the', 'instability', 'threshold', 'this', 'singular', 'term', 'gives', 'the', 'leading', 'contribution', 'to', 'the', 'vacuum', 'decay', 'rate']] | [-0.18672636546323013, 0.19918349045917563, -0.08576787484745527, 0.12297352093630524, -0.07439080032723389, -0.1200971616560529, -0.008997806594118305, 0.268576162104527, -0.23942951477486, -0.2552872882920435, 0.0751728536467464, -0.28047387721552247, -0.1331507660309388, 0.1575570253912231, -0.026563026535528146, 0.020048601017601187, -0.01671774165126784, 0.09099169567912474, -0.049020403629468606, -0.22403276126012847, 0.36669448540471067, 0.0946335889714845, 0.25653835266143427, 0.04291553958586749, 0.08024435461466682, -0.038687340685048664, -0.0018133482495697494, 0.011355241273540533, -0.10779878629102899, 0.03294085445760311, 0.20058238409839613, 0.0633598259019086, 0.17852566615496387, -0.36470314611991245, -0.21594293463718275, 0.15050307221325307, 0.13924292278550993, 0.17401101859821672, -0.03155936507358291, -0.27428417957130946, 0.10730180151000533, -0.18546311878438654, -0.17670833056086097, -0.053691514847992824, 0.009555722067625016, -0.051972586608052936, -0.27784467963822956, 0.10621476561819931, 0.052329342226208796, -0.043625115770204316, -0.09014858383131374, -0.0675975000325205, 0.026365358617970312, 0.08542996476907497, 0.13997976724513347, 0.07463974247140617, 0.22104259861911507, -0.19836300052568617, -0.0800174267376484, 0.3513335588350678, -0.12709854807619048, -0.22920616964499155, 0.14810152466933446, -0.14661509834294176, -0.06817344077274032, 0.16259115198680638, 0.13427617879124124, 0.10766381150494254, -0.143806464247534, 0.15680466244337096, 0.05904729254864927, 0.13965117333901125, 0.09551736186847262, 0.064322331593768, 0.26015104086140983, 0.11486767432598889, 0.05572952850368516, 0.17076571635104415, -0.04215297744082201, -0.06802431117186601, -0.37927537505654085, -0.0945315076594894, -0.1105042022288959, 0.12328951685534169, -0.10448082194957299, -0.22708220215214567, 0.3851329070440997, 0.10634359224410407, 0.1515511972883224, 0.0023157094851478763, 0.2556389707472475, 0.16173465922541766, 0.07264465439647179, 0.026380631885352147, 0.3577496897557686, 0.12054134156533527, 0.11160533556222231, -0.24412329297983784, -0.03607660035827551, 0.0730423026065203] |
1,803.09169 | FROST -- Fast row-stochastic optimization with uncoordinated step-sizes | In this paper, we discuss distributed optimization over directed graphs,
where doubly-stochastic weights cannot be constructed. Most of the existing
algorithms overcome this issue by applying push-sum consensus, which utilizes
column-stochastic weights. The formulation of column-stochastic weights
requires each agent to know (at least) its out-degree, which may be impractical
in e.g., broadcast-based communication protocols. In contrast, we describe
FROST (Fast Row-stochastic-Optimization with uncoordinated STep-sizes), an
optimization algorithm applicable to directed graphs that does not require the
knowledge of out-degrees; the implementation of which is straightforward as
each agent locally assigns weights to the incoming information and locally
chooses a suitable step-size. We show that FROST converges linearly to the
optimal solution for smooth and strongly-convex functions given that the
largest step-size is positive and sufficiently small.
| math.OC | in this paper we discuss distributed optimization over directed graphs where doublystochastic weights cannot be constructed most of the existing algorithms overcome this issue by applying pushsum consensus which utilizes columnstochastic weights the formulation of columnstochastic weights requires each agent to know at least its outdegree which may be impractical in eg broadcastbased communication protocols in contrast we describe frost fast rowstochasticoptimization with uncoordinated stepsizes an optimization algorithm applicable to directed graphs that does not require the knowledge of outdegrees the implementation of which is straightforward as each agent locally assigns weights to the incoming information and locally chooses a suitable stepsize we show that frost converges linearly to the optimal solution for smooth and stronglyconvex functions given that the largest stepsize is positive and sufficiently small | [['in', 'this', 'paper', 'we', 'discuss', 'distributed', 'optimization', 'over', 'directed', 'graphs', 'where', 'doublystochastic', 'weights', 'can', 'not', 'be', 'constructed', 'most', 'of', 'the', 'existing', 'algorithms', 'overcome', 'this', 'issue', 'by', 'applying', 'pushsum', 'consensus', 'which', 'utilizes', 'columnstochastic', 'weights', 'the', 'formulation', 'of', 'columnstochastic', 'weights', 'requires', 'each', 'agent', 'to', 'know', 'at', 'least', 'its', 'outdegree', 'which', 'may', 'be', 'impractical', 'in', 'eg', 'broadcastbased', 'communication', 'protocols', 'in', 'contrast', 'we', 'describe', 'frost', 'fast', 'rowstochasticoptimization', 'with', 'uncoordinated', 'stepsizes', 'an', 'optimization', 'algorithm', 'applicable', 'to', 'directed', 'graphs', 'that', 'does', 'not', 'require', 'the', 'knowledge', 'of', 'outdegrees', 'the', 'implementation', 'of', 'which', 'is', 'straightforward', 'as', 'each', 'agent', 'locally', 'assigns', 'weights', 'to', 'the', 'incoming', 'information', 'and', 'locally', 'chooses', 'a', 'suitable', 'stepsize', 'we', 'show', 'that', 'frost', 'converges', 'linearly', 'to', 'the', 'optimal', 'solution', 'for', 'smooth', 'and', 'stronglyconvex', 'functions', 'given', 'that', 'the', 'largest', 'stepsize', 'is', 'positive', 'and', 'sufficiently', 'small']] | [-0.13052234637338345, 0.08772736390803731, -0.055314064865535875, 0.007995487118023448, -0.14519629013673294, -0.24343821839942764, 0.06504382985171048, 0.45309428530415213, -0.3188486774754527, -0.243297218517437, 0.10261694126758783, -0.20438212607290565, -0.16150915456979764, 0.11397761508353113, -0.15458093831080974, 0.05012721962152933, 0.0976235759627866, 0.06365860473569923, -0.0032827707656519853, -0.28338741965401243, 0.2874193570886438, 0.05795516034654217, 0.25015050507385256, 0.023144651065015887, 0.143494357123025, 0.023806464227693756, -0.01581429817354468, 0.04306255397936842, -0.09627520155034891, 0.09215167370133513, 0.3119413926390799, 0.19030935813005515, 0.3520325041691384, -0.40622100295630964, -0.16044312125203883, 0.2008535798463061, 0.16849144183382975, 0.09306926044221146, 0.0017702603991341403, -0.20315777977532523, 0.13647787703025177, -0.12858690054881877, -0.07734979671888112, -0.08119744617917289, -0.013162497854534917, 0.06631384460680832, -0.3669727668239493, -0.010765688886176648, 0.05168889796243995, -0.026008740256313147, -0.020352114583218953, -0.12644927005290868, 0.011676611019459765, 0.11410032904351233, 0.007454460594018437, 0.06650060838763053, 0.13160786724935367, -0.08683179879898396, -0.15271298941334813, 0.3475742028938152, -0.005971872935247586, -0.25550259420520804, 0.14472727340418756, -0.05663389424008765, -0.15204719987910564, 0.13086429091104432, 0.17993121314977156, 0.1868659767714571, -0.1399100310513823, 0.06724358891828103, -0.04443141026055719, 0.17621696242461288, 0.0541157984838447, -0.0034894329114399086, 0.10456201473368316, 0.12809371385782017, 0.21760816632322674, 0.10769876217704237, -0.014032210645038547, -0.1258362758002706, -0.2750281331667449, -0.10556570144634195, -0.27031342588607077, 0.03408953133538754, -0.1248985488297955, -0.16914427065928503, 0.3708305943053304, 0.17024311472526127, 0.20269258754459893, 0.14412731620369434, 0.30230224982461357, 0.08401629984045152, 0.09286652252767381, 0.21189860189260226, 0.16479127631361384, 0.06352429691240133, 0.08758316777818873, -0.18261047882829082, 0.16996460941832836, 0.07562906021530938] |
1,803.0917 | Hermitian non-K\"{a}hler structures on products of principal
$S^{1}$-bundles over complex flag manifolds and applications in Hermitian
geometry with torsion | In this paper we provide an explicit description of normal almost contact
structures obtained from Cartan-Ehresmann connections (gauge fields) on
principal $S^{1}$-bundles over complex flag manifolds. The main feature of our
approach is to employ elements of representation theory of complex simple Lie
algebras in order to describe and classify these structures. We use these
normal almost contact structures to explicitly describe a huge class of compact
Hermitian non-K\"{a}hler manifolds obtained from products of principal
$S^{1}$-bundles over complex flag manifolds. Moreover, we obtain from our
description several concrete examples of 1-parametric families of complex
structures on products of principal $S^{1}$-bundles over flag manifolds, these
concrete examples generalize the Calabi-Eckmann manifolds. Further, as an
application of our main results in the setting of KT structures on toric
bundles over flag manifolds, we classify a huge class of explicit examples of
Calabi-Yau structures with torsion (CYT) on certain Vaisman manifolds
(generalized Hopf manifolds). Also as an application of our main results, we
provide several new concrete examples of astheno-K\"{a}hler structures on
products of compact homogeneous Sasaki manifolds.
| math.DG | in this paper we provide an explicit description of normal almost contact structures obtained from cartanehresmann connections gauge fields on principal s1bundles over complex flag manifolds the main feature of our approach is to employ elements of representation theory of complex simple lie algebras in order to describe and classify these structures we use these normal almost contact structures to explicitly describe a huge class of compact hermitian nonkahler manifolds obtained from products of principal s1bundles over complex flag manifolds moreover we obtain from our description several concrete examples of 1parametric families of complex structures on products of principal s1bundles over flag manifolds these concrete examples generalize the calabieckmann manifolds further as an application of our main results in the setting of kt structures on toric bundles over flag manifolds we classify a huge class of explicit examples of calabiyau structures with torsion cyt on certain vaisman manifolds generalized hopf manifolds also as an application of our main results we provide several new concrete examples of asthenokahler structures on products of compact homogeneous sasaki manifolds | [['in', 'this', 'paper', 'we', 'provide', 'an', 'explicit', 'description', 'of', 'normal', 'almost', 'contact', 'structures', 'obtained', 'from', 'cartanehresmann', 'connections', 'gauge', 'fields', 'on', 'principal', 's1bundles', 'over', 'complex', 'flag', 'manifolds', 'the', 'main', 'feature', 'of', 'our', 'approach', 'is', 'to', 'employ', 'elements', 'of', 'representation', 'theory', 'of', 'complex', 'simple', 'lie', 'algebras', 'in', 'order', 'to', 'describe', 'and', 'classify', 'these', 'structures', 'we', 'use', 'these', 'normal', 'almost', 'contact', 'structures', 'to', 'explicitly', 'describe', 'a', 'huge', 'class', 'of', 'compact', 'hermitian', 'nonkahler', 'manifolds', 'obtained', 'from', 'products', 'of', 'principal', 's1bundles', 'over', 'complex', 'flag', 'manifolds', 'moreover', 'we', 'obtain', 'from', 'our', 'description', 'several', 'concrete', 'examples', 'of', '1parametric', 'families', 'of', 'complex', 'structures', 'on', 'products', 'of', 'principal', 's1bundles', 'over', 'flag', 'manifolds', 'these', 'concrete', 'examples', 'generalize', 'the', 'calabieckmann', 'manifolds', 'further', 'as', 'an', 'application', 'of', 'our', 'main', 'results', 'in', 'the', 'setting', 'of', 'kt', 'structures', 'on', 'toric', 'bundles', 'over', 'flag', 'manifolds', 'we', 'classify', 'a', 'huge', 'class', 'of', 'explicit', 'examples', 'of', 'calabiyau', 'structures', 'with', 'torsion', 'cyt', 'on', 'certain', 'vaisman', 'manifolds', 'generalized', 'hopf', 'manifolds', 'also', 'as', 'an', 'application', 'of', 'our', 'main', 'results', 'we', 'provide', 'several', 'new', 'concrete', 'examples', 'of', 'asthenokahler', 'structures', 'on', 'products', 'of', 'compact', 'homogeneous', 'sasaki', 'manifolds']] | [-0.17294441442138384, 0.0073883971338260124, -0.040821553170681, 0.08941013046407274, -0.12928996426718575, -0.09208046470369612, -0.06497916266588229, 0.40668371534773284, -0.26678238210401367, -0.22058613408756042, 0.12751549610136342, -0.23058280575488294, -0.251917346481766, 0.27377237755805256, -0.1473616812963571, -0.05048464851719992, 0.08240017256965594, 0.07912074055822034, -0.1336134989506432, -0.31382811837962693, 0.5281037067329245, -0.0292974774229307, 0.22535041064023972, 0.04151746938932255, 0.13003398772329092, -0.046850000826774964, -0.03711180283554963, 0.0032554753710116657, -0.17024543844163417, 0.18529028246910975, 0.29577575073178325, 0.049538184896643675, 0.11954114728740284, -0.3954255284847958, -0.20114525859709828, 0.1473634703271091, 0.10777175398277385, 0.058548911925671354, -0.012688817531535668, -0.31853397212922574, 0.07563719962058323, -0.16550435687282256, -0.1671194540160442, -0.19876041192029203, -0.012855821483369384, 0.02515364695340395, -0.16141878206282853, -0.04666179926284323, 0.1070231985839616, 0.12031380675733089, -0.10957876509853771, -0.1253472048842481, -0.038318437649203195, 0.10287486304129873, -0.013559462179296784, -0.04192201699795468, 0.0991883101962906, -0.044256939099037225, -0.17694124104754466, 0.33624565650309834, -0.04558260394592902, -0.24922987712281092, 0.17714047508646866, -0.0793030196800828, -0.19925604938130292, 0.16388671452445644, 0.19355466504182134, 0.21017205858337026, -0.023870610919714506, 0.12060562575468793, -0.0960521043038794, 0.027442540457206115, 0.10045511534969721, -0.028835509287725603, 0.12039986347247447, 0.13153466124087573, 0.0892860464698502, 0.12359630937555006, 0.03354455550201237, -0.10688351292695318, -0.39309519410133364, -0.218539740975414, -0.07479215193007674, 0.21627394954940038, -0.15115331918924182, -0.21766839640614177, 0.42171364735146716, 0.010688578139192292, 0.22227853607918535, 0.10782924151048064, 0.22312474390425321, -0.06534216513192015, 0.070580291505903, 0.033830233995935745, 0.12476091608405113, 0.28077326395149743, -0.0030886842709566867, -0.038921236697850484, -0.10125461220242349, 0.09997942442074419] |
1,803.09171 | Extended Abstract: Mimicry Resilient Program Behavior Modeling with LSTM
based Branch Models | In the software design, protecting a computer system from a plethora of
software attacks or malware in the wild has been increasingly important. One
branch of research to detect the existence of attacks or malware, there has
been much work focused on modeling the runtime behavior of a program. Stemming
from the seminal work of Forrest et al., one of the main tools to model program
behavior is system call sequences. Unfortunately, however, since mimicry
attacks were proposed, program behavior models based solely on system call
sequences could no longer ensure the security of systems and require additional
information that comes with its own drawbacks. In this paper, we report our
preliminary findings in our research to build a mimicry resilient program
behavior model that has lesser drawbacks. We employ branch sequences to harden
our program behavior model against mimicry attacks while employing hardware
features for efficient extraction of such branch information during program
runtime. In order to handle the large scale of branch sequences, we also employ
LSTM, the de facto standard in deep learning based sequence modeling and report
our preliminary experiments on its interaction with program branch sequences.
| cs.CR | in the software design protecting a computer system from a plethora of software attacks or malware in the wild has been increasingly important one branch of research to detect the existence of attacks or malware there has been much work focused on modeling the runtime behavior of a program stemming from the seminal work of forrest et al one of the main tools to model program behavior is system call sequences unfortunately however since mimicry attacks were proposed program behavior models based solely on system call sequences could no longer ensure the security of systems and require additional information that comes with its own drawbacks in this paper we report our preliminary findings in our research to build a mimicry resilient program behavior model that has lesser drawbacks we employ branch sequences to harden our program behavior model against mimicry attacks while employing hardware features for efficient extraction of such branch information during program runtime in order to handle the large scale of branch sequences we also employ lstm the de facto standard in deep learning based sequence modeling and report our preliminary experiments on its interaction with program branch sequences | [['in', 'the', 'software', 'design', 'protecting', 'a', 'computer', 'system', 'from', 'a', 'plethora', 'of', 'software', 'attacks', 'or', 'malware', 'in', 'the', 'wild', 'has', 'been', 'increasingly', 'important', 'one', 'branch', 'of', 'research', 'to', 'detect', 'the', 'existence', 'of', 'attacks', 'or', 'malware', 'there', 'has', 'been', 'much', 'work', 'focused', 'on', 'modeling', 'the', 'runtime', 'behavior', 'of', 'a', 'program', 'stemming', 'from', 'the', 'seminal', 'work', 'of', 'forrest', 'et', 'al', 'one', 'of', 'the', 'main', 'tools', 'to', 'model', 'program', 'behavior', 'is', 'system', 'call', 'sequences', 'unfortunately', 'however', 'since', 'mimicry', 'attacks', 'were', 'proposed', 'program', 'behavior', 'models', 'based', 'solely', 'on', 'system', 'call', 'sequences', 'could', 'no', 'longer', 'ensure', 'the', 'security', 'of', 'systems', 'and', 'require', 'additional', 'information', 'that', 'comes', 'with', 'its', 'own', 'drawbacks', 'in', 'this', 'paper', 'we', 'report', 'our', 'preliminary', 'findings', 'in', 'our', 'research', 'to', 'build', 'a', 'mimicry', 'resilient', 'program', 'behavior', 'model', 'that', 'has', 'lesser', 'drawbacks', 'we', 'employ', 'branch', 'sequences', 'to', 'harden', 'our', 'program', 'behavior', 'model', 'against', 'mimicry', 'attacks', 'while', 'employing', 'hardware', 'features', 'for', 'efficient', 'extraction', 'of', 'such', 'branch', 'information', 'during', 'program', 'runtime', 'in', 'order', 'to', 'handle', 'the', 'large', 'scale', 'of', 'branch', 'sequences', 'we', 'also', 'employ', 'lstm', 'the', 'de', 'facto', 'standard', 'in', 'deep', 'learning', 'based', 'sequence', 'modeling', 'and', 'report', 'our', 'preliminary', 'experiments', 'on', 'its', 'interaction', 'with', 'program', 'branch', 'sequences']] | [-0.11861466944442589, -0.012114933606588248, -0.15089953170372514, 0.05428398346421138, -0.10942272502558394, -0.18170997172628203, 0.057629925341477026, 0.357349028567057, -0.23308744928549674, -0.3529366475008233, 0.1475649790738402, -0.29053021192609174, -0.19634422806276897, 0.22640935087171798, -0.12842453120237324, 0.088008978162741, 0.09857243353791087, 0.006172492082294135, -0.0005361187803261567, -0.2612034446823152, 0.3223945684072742, 0.07970179449654116, 0.307471311756005, 0.015570526089304718, 0.06394341317400415, 0.005105777147484465, -0.02458650472266746, -0.04313387841727409, -0.06142309558200248, 0.11649118715906955, 0.26630797845071696, 0.22466748737832481, 0.3379223712601733, -0.43958114381118907, -0.2178978133624839, 0.09913978913642896, 0.15725556055342302, 0.1630924583853988, -0.07705486344517311, -0.287054303058311, 0.10093581331259917, -0.18638545330747944, -0.08202511542208532, -0.09251785659382403, -0.0010379308429961118, 0.004468726862772948, -0.18779275599008924, -0.03365848343639576, 0.0872589086123903, 0.1158260261269374, 0.007627630273504329, -0.13579954640727723, -0.011737217968183507, 0.15325702850448444, 0.09640524974421974, 0.029101985823655627, 0.13694051889878214, -0.1215365563668018, -0.16318618987945363, 0.3199500615430596, -0.04791418775240769, -0.1204017671556529, 0.23015772434273316, -0.024963676790506897, -0.20682845049883916, 0.12103302551784519, 0.21698440024638377, 0.12794331792761518, -0.16086355053102938, 0.0673261262849461, 0.033466921439053034, 0.23513729122335686, 0.015574466307886453, 0.03538893998766023, 0.20215245609595903, 0.24337897421450827, 0.009454103406148119, 0.14697807329994533, -0.05507558047118065, -0.10094818092927736, -0.21625583023332665, -0.10966445292536345, -0.14957575758380318, -0.021803055082920804, 0.0005643400779610782, -0.18460233109583835, 0.38658113143265405, 0.2319971147695488, 0.14433435425991242, 0.07746255902831896, 0.33567062895062394, 0.01255801730485711, 0.12165613718030983, 0.08327924650094194, 0.21767214692992534, 0.01750122118224414, 0.1419344612321675, -0.19557654507048622, 0.14366047529269654, 0.034767644331151745] |
1,803.09172 | Multiple Sclerosis Lesion Segmentation from Brain MRI via Fully
Convolutional Neural Networks | Multiple Sclerosis (MS) is an autoimmune disease that leads to lesions in the
central nervous system. Magnetic resonance (MR) images provide sufficient
imaging contrast to visualize and detect lesions, particularly those in the
white matter. Quantitative measures based on various features of lesions have
been shown to be useful in clinical trials for evaluating therapies. Therefore
robust and accurate segmentation of white matter lesions from MR images can
provide important information about the disease status and progression. In this
paper, we propose a fully convolutional neural network (CNN) based method to
segment white matter lesions from multi-contrast MR images. The proposed CNN
based method contains two convolutional pathways. The first pathway consists of
multiple parallel convolutional filter banks catering to multiple MR
modalities. In the second pathway, the outputs of the first one are
concatenated and another set of convolutional filters are applied. The output
of this last pathway produces a membership function for lesions that may be
thresholded to obtain a binary segmentation. The proposed method is evaluated
on a dataset of 100 MS patients, as well as the ISBI 2015 challenge data
consisting of 14 patients. The comparison is performed against four publicly
available MS lesion segmentation methods. Significant improvement in
segmentation quality over the competing methods is demonstrated on various
metrics, such as Dice and false positive ratio. While evaluating on the ISBI
2015 challenge data, our method produces a score of 90.48, where a score of 90
is considered to be comparable to a human rater.
| cs.CV | multiple sclerosis ms is an autoimmune disease that leads to lesions in the central nervous system magnetic resonance mr images provide sufficient imaging contrast to visualize and detect lesions particularly those in the white matter quantitative measures based on various features of lesions have been shown to be useful in clinical trials for evaluating therapies therefore robust and accurate segmentation of white matter lesions from mr images can provide important information about the disease status and progression in this paper we propose a fully convolutional neural network cnn based method to segment white matter lesions from multicontrast mr images the proposed cnn based method contains two convolutional pathways the first pathway consists of multiple parallel convolutional filter banks catering to multiple mr modalities in the second pathway the outputs of the first one are concatenated and another set of convolutional filters are applied the output of this last pathway produces a membership function for lesions that may be thresholded to obtain a binary segmentation the proposed method is evaluated on a dataset of 100 ms patients as well as the isbi 2015 challenge data consisting of 14 patients the comparison is performed against four publicly available ms lesion segmentation methods significant improvement in segmentation quality over the competing methods is demonstrated on various metrics such as dice and false positive ratio while evaluating on the isbi 2015 challenge data our method produces a score of 9048 where a score of 90 is considered to be comparable to a human rater | [['multiple', 'sclerosis', 'ms', 'is', 'an', 'autoimmune', 'disease', 'that', 'leads', 'to', 'lesions', 'in', 'the', 'central', 'nervous', 'system', 'magnetic', 'resonance', 'mr', 'images', 'provide', 'sufficient', 'imaging', 'contrast', 'to', 'visualize', 'and', 'detect', 'lesions', 'particularly', 'those', 'in', 'the', 'white', 'matter', 'quantitative', 'measures', 'based', 'on', 'various', 'features', 'of', 'lesions', 'have', 'been', 'shown', 'to', 'be', 'useful', 'in', 'clinical', 'trials', 'for', 'evaluating', 'therapies', 'therefore', 'robust', 'and', 'accurate', 'segmentation', 'of', 'white', 'matter', 'lesions', 'from', 'mr', 'images', 'can', 'provide', 'important', 'information', 'about', 'the', 'disease', 'status', 'and', 'progression', 'in', 'this', 'paper', 'we', 'propose', 'a', 'fully', 'convolutional', 'neural', 'network', 'cnn', 'based', 'method', 'to', 'segment', 'white', 'matter', 'lesions', 'from', 'multicontrast', 'mr', 'images', 'the', 'proposed', 'cnn', 'based', 'method', 'contains', 'two', 'convolutional', 'pathways', 'the', 'first', 'pathway', 'consists', 'of', 'multiple', 'parallel', 'convolutional', 'filter', 'banks', 'catering', 'to', 'multiple', 'mr', 'modalities', 'in', 'the', 'second', 'pathway', 'the', 'outputs', 'of', 'the', 'first', 'one', 'are', 'concatenated', 'and', 'another', 'set', 'of', 'convolutional', 'filters', 'are', 'applied', 'the', 'output', 'of', 'this', 'last', 'pathway', 'produces', 'a', 'membership', 'function', 'for', 'lesions', 'that', 'may', 'be', 'thresholded', 'to', 'obtain', 'a', 'binary', 'segmentation', 'the', 'proposed', 'method', 'is', 'evaluated', 'on', 'a', 'dataset', 'of', '100', 'ms', 'patients', 'as', 'well', 'as', 'the', 'isbi', '2015', 'challenge', 'data', 'consisting', 'of', '14', 'patients', 'the', 'comparison', 'is', 'performed', 'against', 'four', 'publicly', 'available', 'ms', 'lesion', 'segmentation', 'methods', 'significant', 'improvement', 'in', 'segmentation', 'quality', 'over', 'the', 'competing', 'methods', 'is', 'demonstrated', 'on', 'various', 'metrics', 'such', 'as', 'dice', 'and', 'false', 'positive', 'ratio', 'while', 'evaluating', 'on', 'the', 'isbi', '2015', 'challenge', 'data', 'our', 'method', 'produces', 'a', 'score', 'of', '9048', 'where', 'a', 'score', 'of', '90', 'is', 'considered', 'to', 'be', 'comparable', 'to', 'a', 'human', 'rater']] | [-0.03537797087901197, -0.005313223211670268, -0.0695667387562314, 0.07267217350381251, -0.05901808749199901, -0.17218711578575183, 0.014267137013497317, 0.4155270556870653, -0.17880692104079637, -0.3258751501800515, 0.09718313174094093, -0.29314060081507126, -0.20411159577461552, 0.21679119901529637, -0.16040992201025406, 0.07241473235489135, 0.16698489867031097, 0.06140102350562587, 0.004313833351867895, -0.3103107271372831, 0.2638982122952874, 0.028987900219319098, 0.33717599053339786, 0.01387497038724477, 0.13000087516595532, -0.05498362393431687, -0.05226289396675446, -0.022522823492824345, -0.0482790376806943, 0.13232629039197652, 0.34602126631003066, 0.18278727624995492, 0.33995571108460126, -0.4008218067731843, -0.22603194965760273, 0.07263763766384208, 0.13511332891947855, 0.09248114562122128, -0.025229184731212724, -0.36852382288462143, 0.13733587783142312, -0.14532217221712343, 0.039746524708113636, -0.09310131836458142, -0.010788469794325541, -0.03480810735839415, -0.3135203802696313, 0.1504932896537523, 0.007022232243867898, 0.09238649856104669, -0.1065944862340663, -0.15180137785045003, 0.015147996073341873, 0.20348963888556543, 0.0057591225561053755, 0.10491338096340243, 0.16910251522863126, -0.19206958710850425, -0.13584356008651086, 0.305565292596112, -0.019714435972048933, -0.1603720061407129, 0.17855148813238433, -0.07170970256937795, -0.10457687476747127, 0.1418735220968484, 0.21077708321357946, 0.12611064717480278, -0.19683139978807015, -0.0904603167430004, 0.005328217928997245, 0.20648386236280203, 0.08584079574456954, -0.0548682677967242, 0.20485162454373, 0.2619405076642667, -0.014678845643982232, 0.14224202504772393, -0.23443575793151167, 0.003182624474197746, -0.19620880545056182, -0.14902422891832265, -0.17007539121305054, -0.027762171059629942, -0.08752559221191397, -0.1962760371986139, 0.4260920611131622, 0.19552502376130262, 0.1889733145869969, 0.05898417946723585, 0.32369682941974764, -0.00900894257839139, 0.1312113928423454, 0.007074277502032049, 0.17948292194113855, 0.08509528492956074, 0.08130429177610465, -0.1767302090845615, 0.10940916911814826, 0.030277107973175354] |
1,803.09173 | An Introduction to Imperfect Competition via Bilateral Oligopoly | The aim of this paper is threefold. First, we provide a unified framework, by
means of non-trivial examples, to compare the results obtained in
simultaneous-move and sequential-move versions of bilateral oligopoly with the
Cournot model and the Cournot-Walras approach. We also survey the main
contributions on imperfect competition and strategic market games that are
linked with our analysis. Secondly, we show how the bilateral oligopoly model
can be used to study different kinds of oligopoly: symmetric oligopoly, where
all agents act strategically; asymmetric oligopoly where only some agents act
strategically; simultaneous oligopoly, where sellers and buyers make their
choices without knowledge of others' decisions; and sequential oligopoly, where
some agents move first. Thirdly, we focus on how the bilateral oligopoly model
can clarify how either strategic or competitive behaviours may emerge
endogenously depending on the fundamentals of the economy.
| cs.GT | the aim of this paper is threefold first we provide a unified framework by means of nontrivial examples to compare the results obtained in simultaneousmove and sequentialmove versions of bilateral oligopoly with the cournot model and the cournotwalras approach we also survey the main contributions on imperfect competition and strategic market games that are linked with our analysis secondly we show how the bilateral oligopoly model can be used to study different kinds of oligopoly symmetric oligopoly where all agents act strategically asymmetric oligopoly where only some agents act strategically simultaneous oligopoly where sellers and buyers make their choices without knowledge of others decisions and sequential oligopoly where some agents move first thirdly we focus on how the bilateral oligopoly model can clarify how either strategic or competitive behaviours may emerge endogenously depending on the fundamentals of the economy | [['the', 'aim', 'of', 'this', 'paper', 'is', 'threefold', 'first', 'we', 'provide', 'a', 'unified', 'framework', 'by', 'means', 'of', 'nontrivial', 'examples', 'to', 'compare', 'the', 'results', 'obtained', 'in', 'simultaneousmove', 'and', 'sequentialmove', 'versions', 'of', 'bilateral', 'oligopoly', 'with', 'the', 'cournot', 'model', 'and', 'the', 'cournotwalras', 'approach', 'we', 'also', 'survey', 'the', 'main', 'contributions', 'on', 'imperfect', 'competition', 'and', 'strategic', 'market', 'games', 'that', 'are', 'linked', 'with', 'our', 'analysis', 'secondly', 'we', 'show', 'how', 'the', 'bilateral', 'oligopoly', 'model', 'can', 'be', 'used', 'to', 'study', 'different', 'kinds', 'of', 'oligopoly', 'symmetric', 'oligopoly', 'where', 'all', 'agents', 'act', 'strategically', 'asymmetric', 'oligopoly', 'where', 'only', 'some', 'agents', 'act', 'strategically', 'simultaneous', 'oligopoly', 'where', 'sellers', 'and', 'buyers', 'make', 'their', 'choices', 'without', 'knowledge', 'of', 'others', 'decisions', 'and', 'sequential', 'oligopoly', 'where', 'some', 'agents', 'move', 'first', 'thirdly', 'we', 'focus', 'on', 'how', 'the', 'bilateral', 'oligopoly', 'model', 'can', 'clarify', 'how', 'either', 'strategic', 'or', 'competitive', 'behaviours', 'may', 'emerge', 'endogenously', 'depending', 'on', 'the', 'fundamentals', 'of', 'the', 'economy']] | [-0.10248131977425436, 0.057229017234825784, -0.07435866715082817, 0.10170376032550374, -0.12855782015654055, -0.1838111399318196, 0.13033249540392822, 0.4328496888063956, -0.2840526167276329, -0.2750481399235086, 0.11854165307485728, -0.27999764665002946, -0.2349697456221042, 0.0971389078544419, -0.11413485812279733, -0.07957380522460933, 0.0075479994116324015, 0.010078062787795427, 0.07802380258278614, -0.3164350197370421, 0.3693035321472132, 0.007963608923381653, 0.24271241106443864, 0.025816865643297417, 0.07843724688164135, 0.037445670793480844, -0.04112700867108947, 0.020300120952120727, -0.1488618955535049, 0.13290411728920173, 0.28616077864907036, 0.13104973113893167, 0.34855223742678115, -0.5068317844626912, -0.1143228483700153, 0.1712888178164207, 0.0949485964741578, 0.04072532540295219, 0.01676334354746412, -0.2987689142641814, 0.023246154735755663, -0.2563545929092536, -0.06714472816109765, -0.11214808557364765, -0.08750520820330417, 0.10382423488477217, -0.3129960701115888, -0.011718720432406331, 0.05167080933692953, 0.01886003347032744, -0.10027297813971729, -0.12489745378885689, -0.029056714076643297, 0.19745677758676364, 0.08055068430932832, -0.10845681403905315, 0.12544892425986304, -0.14455288658728419, -0.21585921103310218, 0.3794980735342572, -0.046996724557306996, -0.19012082725479876, 0.18268193450310957, -0.06471307335111003, -0.13560399286570432, -0.015535450531203516, 0.24261887757229092, 0.10069654117345951, -0.1422344505570937, 0.03828874629022945, -0.08355043296519991, 0.16444467748026026, 0.05361353073849518, 0.0010951243212743514, 0.172459473165319, 0.14644947294415772, 0.112632355600447, 0.12122888571626601, 0.044144868221390396, -0.21522468656126031, -0.2827209039064853, -0.08480080554896183, -0.0984227061786257, 0.02311591548335644, -0.09260391300757993, -0.07479585519573395, 0.3861392061293557, 0.1600266711329164, 0.14105317029474385, 0.0528844824795564, 0.2983014086342376, 0.044501935446506664, -0.052472166819970356, 0.05986289517275746, 0.20051294664617803, -0.03544132562144997, 0.10291456868129688, -0.17050154116578345, 0.12402341014071219, 0.008277169465883702] |
1,803.09174 | Microstructural constitutive model for polycrystal viscoplasticity in
cold and warm regimes based on continuum dislocation dynamics | Viscoplastic flow of polycrystalline metallic materials is the result of
motion and interaction of dislocations, line defects of the crystalline
structure. In the microstructural (physics-based) constitutive model presented
in this paper, the main underlying microstructural processes influencing
viscoplastic deformation and mechanical properties of metals in cold and warm
regimes are statistically described by the introduced sets of postulates/axioms
for continuum dislocation dynamics (CDD). Three microstructural (internal)
state variables (MSVs) are used for statistical quantifications of different
types/species of dislocations by the notion of dislocation density. Considering
the mobility property of dislocations, they are categorized to mobile and
(relatively) immobile dislocations. Mobile dislocations carry the plastic
strain (rate), while immobile dislocations contribute to plastic hardening.
Moreover, with respect to their arrangement, dislocations are classified to
cell and wall dislocations. Cell dislocations are those that exist inside
cells/subgrains, and wall dislocations are packed in (and consequently formed)
the subgrain walls/boundaries. Therefore, the MSVs incorporated in this model
are cell mobile, cell immobile and wall immobile dislocation densities. The
evolution of these internal variables is calculated by means of adequate
equations that characterize the dislocation processes dominating material
behavior during cold and warm monotonic viscoplastic deformation. The
constitutive equations are then numerically integrated; and the constitutive
parameters are determined/fitted for a widely used ferritic-pearlitic steel
(20MnCr5).
| cond-mat.mtrl-sci physics.app-ph | viscoplastic flow of polycrystalline metallic materials is the result of motion and interaction of dislocations line defects of the crystalline structure in the microstructural physicsbased constitutive model presented in this paper the main underlying microstructural processes influencing viscoplastic deformation and mechanical properties of metals in cold and warm regimes are statistically described by the introduced sets of postulatesaxioms for continuum dislocation dynamics cdd three microstructural internal state variables msvs are used for statistical quantifications of different typesspecies of dislocations by the notion of dislocation density considering the mobility property of dislocations they are categorized to mobile and relatively immobile dislocations mobile dislocations carry the plastic strain rate while immobile dislocations contribute to plastic hardening moreover with respect to their arrangement dislocations are classified to cell and wall dislocations cell dislocations are those that exist inside cellssubgrains and wall dislocations are packed in and consequently formed the subgrain wallsboundaries therefore the msvs incorporated in this model are cell mobile cell immobile and wall immobile dislocation densities the evolution of these internal variables is calculated by means of adequate equations that characterize the dislocation processes dominating material behavior during cold and warm monotonic viscoplastic deformation the constitutive equations are then numerically integrated and the constitutive parameters are determinedfitted for a widely used ferriticpearlitic steel 20mncr5 | [['viscoplastic', 'flow', 'of', 'polycrystalline', 'metallic', 'materials', 'is', 'the', 'result', 'of', 'motion', 'and', 'interaction', 'of', 'dislocations', 'line', 'defects', 'of', 'the', 'crystalline', 'structure', 'in', 'the', 'microstructural', 'physicsbased', 'constitutive', 'model', 'presented', 'in', 'this', 'paper', 'the', 'main', 'underlying', 'microstructural', 'processes', 'influencing', 'viscoplastic', 'deformation', 'and', 'mechanical', 'properties', 'of', 'metals', 'in', 'cold', 'and', 'warm', 'regimes', 'are', 'statistically', 'described', 'by', 'the', 'introduced', 'sets', 'of', 'postulatesaxioms', 'for', 'continuum', 'dislocation', 'dynamics', 'cdd', 'three', 'microstructural', 'internal', 'state', 'variables', 'msvs', 'are', 'used', 'for', 'statistical', 'quantifications', 'of', 'different', 'typesspecies', 'of', 'dislocations', 'by', 'the', 'notion', 'of', 'dislocation', 'density', 'considering', 'the', 'mobility', 'property', 'of', 'dislocations', 'they', 'are', 'categorized', 'to', 'mobile', 'and', 'relatively', 'immobile', 'dislocations', 'mobile', 'dislocations', 'carry', 'the', 'plastic', 'strain', 'rate', 'while', 'immobile', 'dislocations', 'contribute', 'to', 'plastic', 'hardening', 'moreover', 'with', 'respect', 'to', 'their', 'arrangement', 'dislocations', 'are', 'classified', 'to', 'cell', 'and', 'wall', 'dislocations', 'cell', 'dislocations', 'are', 'those', 'that', 'exist', 'inside', 'cellssubgrains', 'and', 'wall', 'dislocations', 'are', 'packed', 'in', 'and', 'consequently', 'formed', 'the', 'subgrain', 'wallsboundaries', 'therefore', 'the', 'msvs', 'incorporated', 'in', 'this', 'model', 'are', 'cell', 'mobile', 'cell', 'immobile', 'and', 'wall', 'immobile', 'dislocation', 'densities', 'the', 'evolution', 'of', 'these', 'internal', 'variables', 'is', 'calculated', 'by', 'means', 'of', 'adequate', 'equations', 'that', 'characterize', 'the', 'dislocation', 'processes', 'dominating', 'material', 'behavior', 'during', 'cold', 'and', 'warm', 'monotonic', 'viscoplastic', 'deformation', 'the', 'constitutive', 'equations', 'are', 'then', 'numerically', 'integrated', 'and', 'the', 'constitutive', 'parameters', 'are', 'determinedfitted', 'for', 'a', 'widely', 'used', 'ferriticpearlitic', 'steel', '20mncr5']] | [-0.12442306452387986, 0.23279133368301771, -0.03653624488837451, -0.012312261483577244, -0.028488740743840953, -0.09512118734054122, 0.003931253998398818, 0.4266535060881984, -0.2688952341844675, -0.2626112234569269, 0.03640843782626439, -0.2556500960867304, -0.13930702121362237, 0.07141886231279475, -0.03680088137180599, 0.07894347519625929, -0.0050766203819554954, -0.0569139443972495, 0.004291218894364897, -0.23145338181776048, 0.2565332963816164, 0.0152180275934584, 0.336879392008425, 0.023542540088551594, 0.050418748435214523, -0.04147171675040405, -0.01845135560314007, 0.09471044179700389, -0.18728147296339967, 0.096797853801856, 0.26823962692601616, -0.0370622073898238, 0.17577733053921668, -0.5803109586156685, -0.27252381573905987, 0.011485834948389846, 0.13198455292320646, 0.08569798624482834, 0.0004345880559983426, -0.25663782966405374, 0.08797382650492877, -0.1087683999052673, -0.15019612581304767, -0.0365431853524391, 0.051156539255387934, 0.0858510340499468, -0.20065014958798236, 0.14938993538574627, 0.07497404888614684, 0.07542339716090675, -0.18255720659790847, -0.06948181150444582, -0.11872302977865853, 0.0716672936732899, 0.05928455368391987, -0.05704211016635265, 0.2645323368647665, -0.12879097008023083, -0.08382860279708243, 0.4580975729953863, 0.06417561184121844, -0.19576350111724333, 0.1951617442833844, -0.07513352933650215, -0.07537483437872473, 0.21368630419658752, 0.16897624330001645, 0.035380039373230115, -0.20382229036990526, -0.0043111449093189815, 0.009623755995919197, 0.11362329312410735, 0.09530073349300187, -0.012707469229330765, 0.23683315657270962, 0.21375670364610486, -0.025214813010511445, 0.1297677890945445, -0.07786603749720562, -0.1044238451366112, -0.30389180331029836, -0.19856134595979444, -0.17361180325422218, 0.009445573795614216, -0.1317189899739734, -0.23202744124493763, 0.3174416507872771, 0.0758652082854407, 0.14306351298885192, -0.017995139150241136, 0.18769756574571753, 0.07142540826644822, 0.059352009003929444, 0.056690344158970916, 0.20777424336319752, 0.19421277704132794, 0.10420308239568554, -0.24451247109847793, 0.11059483843764253, 0.06641592281327273] |
1,803.09175 | Distributed Energy and Resource Management for Full-Duplex Dense Small
Cells for 5G | We consider a multi-carrier and densely deployed small cell network, where
small cells are powered by renewable energy source and operate in a full-duplex
mode. We formulate an energy and traffic aware resource allocation optimization
problem, where a joint design of the beamformers, power and sub-carrier
allocation, and users scheduling is proposed. The problem minimizes the sum
data buffer lengths of each user in the network by using the harvested energy.
A practical uplink user rate-dependent decoding energy consumption is included
in the total energy consumption at the small cell base stations. Hence,
harvested energy is shared with both downlink and uplink users. Owing to the
non-convexity of the problem, a faster convergence sub-optimal algorithm based
on successive parametric convex approximation framework is proposed. The
algorithm is implemented in a distributed fashion, by using the alternating
direction method of multipliers, which offers not only the limited information
exchange between the base stations, but also fast convergence. Numerical
results advocate the redesigning of the resource allocation strategy when the
energy at the base station is shared among the downlink and uplink
transmissions.
| eess.SP | we consider a multicarrier and densely deployed small cell network where small cells are powered by renewable energy source and operate in a fullduplex mode we formulate an energy and traffic aware resource allocation optimization problem where a joint design of the beamformers power and subcarrier allocation and users scheduling is proposed the problem minimizes the sum data buffer lengths of each user in the network by using the harvested energy a practical uplink user ratedependent decoding energy consumption is included in the total energy consumption at the small cell base stations hence harvested energy is shared with both downlink and uplink users owing to the nonconvexity of the problem a faster convergence suboptimal algorithm based on successive parametric convex approximation framework is proposed the algorithm is implemented in a distributed fashion by using the alternating direction method of multipliers which offers not only the limited information exchange between the base stations but also fast convergence numerical results advocate the redesigning of the resource allocation strategy when the energy at the base station is shared among the downlink and uplink transmissions | [['we', 'consider', 'a', 'multicarrier', 'and', 'densely', 'deployed', 'small', 'cell', 'network', 'where', 'small', 'cells', 'are', 'powered', 'by', 'renewable', 'energy', 'source', 'and', 'operate', 'in', 'a', 'fullduplex', 'mode', 'we', 'formulate', 'an', 'energy', 'and', 'traffic', 'aware', 'resource', 'allocation', 'optimization', 'problem', 'where', 'a', 'joint', 'design', 'of', 'the', 'beamformers', 'power', 'and', 'subcarrier', 'allocation', 'and', 'users', 'scheduling', 'is', 'proposed', 'the', 'problem', 'minimizes', 'the', 'sum', 'data', 'buffer', 'lengths', 'of', 'each', 'user', 'in', 'the', 'network', 'by', 'using', 'the', 'harvested', 'energy', 'a', 'practical', 'uplink', 'user', 'ratedependent', 'decoding', 'energy', 'consumption', 'is', 'included', 'in', 'the', 'total', 'energy', 'consumption', 'at', 'the', 'small', 'cell', 'base', 'stations', 'hence', 'harvested', 'energy', 'is', 'shared', 'with', 'both', 'downlink', 'and', 'uplink', 'users', 'owing', 'to', 'the', 'nonconvexity', 'of', 'the', 'problem', 'a', 'faster', 'convergence', 'suboptimal', 'algorithm', 'based', 'on', 'successive', 'parametric', 'convex', 'approximation', 'framework', 'is', 'proposed', 'the', 'algorithm', 'is', 'implemented', 'in', 'a', 'distributed', 'fashion', 'by', 'using', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'which', 'offers', 'not', 'only', 'the', 'limited', 'information', 'exchange', 'between', 'the', 'base', 'stations', 'but', 'also', 'fast', 'convergence', 'numerical', 'results', 'advocate', 'the', 'redesigning', 'of', 'the', 'resource', 'allocation', 'strategy', 'when', 'the', 'energy', 'at', 'the', 'base', 'station', 'is', 'shared', 'among', 'the', 'downlink', 'and', 'uplink', 'transmissions']] | [-0.2520291919431531, 0.023992764100497357, 0.0021527164914125567, 0.021329265599813085, -0.0957566474497483, -0.23083128376210427, 0.18304097208127543, 0.4008265908869261, -0.3102106245141991, -0.28507333708855, 0.05795804747941168, -0.23325605112133105, -0.12413996053365631, 0.12543976882688743, -0.12993199022960186, 0.03765988258325922, 0.08013432286663666, 0.04760208614530731, 0.011596772827957989, -0.2611109811789485, 0.241476192898683, 0.15883430461424985, 0.4254405075756226, 0.0192129489018978, 0.11403147947944917, 0.01814291320190616, -0.01509514439063795, -0.055241657324516066, -0.045526385402502444, 0.11320578575054523, 0.358913168595404, 0.20615950474536138, 0.353204298759965, -0.46308303417030783, -0.23022967462237534, 0.09955348672592261, 0.15692145466027543, -0.003173802218731822, -0.03707914895092482, -0.21524937618626744, 0.12048987889255897, -0.2433315160869523, 0.01436111595203781, 0.011357820685438358, -0.10320078214573884, 0.10321936389889301, -0.3716104650813366, 0.02920837189216882, -0.04693392927125508, 0.0202557733428368, -0.10991410001371447, -0.11110723969264172, 0.0013389238002015412, 0.1430004406535486, 0.07023080215192508, -0.04012790726798777, 0.11793900841270774, -0.050890529523114805, -0.09412646117151936, 0.3847248838923084, 0.053860960250079776, -0.252125751618193, 0.09463468949742697, -0.03521951279494891, -0.07639813791312154, 0.1777790718511241, 0.2550747318174664, 0.09611740035586347, -0.2004305555673158, 0.039874488256617005, -0.013205119310903944, 0.16825794789796047, 0.08539446628201001, 0.07015622351241417, 0.1522496015422602, 0.2321258808797462, 0.19987660782277913, 0.13036203452013562, -0.14004247316457744, -0.11926380555191751, -0.21238463955226441, -0.09984376349934063, -0.27919340821659033, -0.007616268183945328, -0.09436467208827844, -0.03560083991338535, 0.38523666937934403, 0.06372865567682713, 0.09149315955570142, 0.1195237414856076, 0.44816068728655084, 0.13198169775163107, 0.05937811937852047, 0.224671163603931, 0.14827283476968167, 0.043903160474947474, 0.1956864857945838, -0.2775881140986818, 0.02996928666754322, 0.018215452412205096] |
1,803.09176 | Predictions for the isolated diphoton production through NNLO in QCD and
comparison to the 8 TeV ATLAS data | We present cross section predictions for the isolated diphoton production in
next-to-next-to-leading order (NNLO) QCD using the computational framework
MATRIX. Both the integrated and the differential fiducial cross sections are
calculated. We found that the arbitrary setup of the isolation procedure
introduces uncertainties with a size comparable to the estimation of the
theoretical uncertainties obtained with the customary variation of the
factorization and renormalization scales. This fact is taken into account in
the final result.
| hep-ph | we present cross section predictions for the isolated diphoton production in nexttonexttoleading order nnlo qcd using the computational framework matrix both the integrated and the differential fiducial cross sections are calculated we found that the arbitrary setup of the isolation procedure introduces uncertainties with a size comparable to the estimation of the theoretical uncertainties obtained with the customary variation of the factorization and renormalization scales this fact is taken into account in the final result | [['we', 'present', 'cross', 'section', 'predictions', 'for', 'the', 'isolated', 'diphoton', 'production', 'in', 'nexttonexttoleading', 'order', 'nnlo', 'qcd', 'using', 'the', 'computational', 'framework', 'matrix', 'both', 'the', 'integrated', 'and', 'the', 'differential', 'fiducial', 'cross', 'sections', 'are', 'calculated', 'we', 'found', 'that', 'the', 'arbitrary', 'setup', 'of', 'the', 'isolation', 'procedure', 'introduces', 'uncertainties', 'with', 'a', 'size', 'comparable', 'to', 'the', 'estimation', 'of', 'the', 'theoretical', 'uncertainties', 'obtained', 'with', 'the', 'customary', 'variation', 'of', 'the', 'factorization', 'and', 'renormalization', 'scales', 'this', 'fact', 'is', 'taken', 'into', 'account', 'in', 'the', 'final', 'result']] | [-0.07557593061899145, 0.06834574711198609, -0.11739475616564353, 0.1130898141907528, -0.0028485978146394093, -0.03319518603384495, -0.016901661222800613, 0.35378109470009805, -0.1947634973625342, -0.316072838306427, 0.024959682049229742, -0.2938780842969815, -0.021091045942157507, 0.12093772048751514, 0.014454676446815333, 0.15373367986331382, 0.10902776518836617, 0.0040936294384300706, -0.08506277914779882, -0.26532110950599114, 0.3148121041835596, 0.05316037392864625, 0.24809328703830638, 0.13232585248847803, 0.093089447611322, 0.060030985679477455, -0.12585926595066363, 0.01617265714177241, -0.1558994316656026, 0.13975302640659112, 0.2645565609230349, 0.05259546960393588, 0.16381777444543938, -0.38068254011372726, -0.1182162006633977, 0.06867368106652672, 0.14488797989363472, 0.1519070750226577, -0.02928647454828024, -0.2848316380040099, 0.08846802609041333, -0.23662776307513317, -0.09860856916755438, -0.061853811272109545, -0.02596312640234828, -0.0778289590527614, -0.30810202825814487, 0.06952689943835139, -0.021705451160669326, -0.017156897531822323, -0.03184993201245864, -0.1916574412273864, -0.0338925499903659, 0.0848546777976056, 0.08154920324372748, 0.01659295440185815, 0.18422503454300265, -0.11576628883369267, -0.13562901853273313, 0.408792687356472, -0.07534310594977191, -0.19739409503837427, 0.07211751757810513, -0.1907799602858722, -0.13790405072271825, 0.17580650851130486, 0.2182905840439101, 0.07502501821455856, -0.16519244613746803, 0.1098323725272591, 0.0418260693239669, 0.17987683547660707, 0.02301824520652493, 0.020998679557815193, 0.09491164095699788, 0.21398317695284882, -0.030061469705154498, 0.06651430211961269, -0.11740338599619767, -0.12087578667327761, -0.44609923695524534, -0.0954198614694178, -0.06152269314974546, 0.026699103550054133, -0.11519207552657462, -0.13631286763896544, 0.33281964872032405, 0.1685122957204779, 0.3006280470142762, 0.09136926463494698, 0.4008524853984515, 0.1811266486470898, 0.08238322157412767, 0.048816909448554116, 0.30068471543025227, 0.18587847529600063, 0.08300643485039473, -0.23395022025331855, 0.07405132364481687, 0.05027130372201403] |
1,803.09177 | Balanced Random Survival Forests for Extremely Unbalanced, Right
Censored Data | Accuracies of survival models for life expectancy prediction as well as
critical-care applications are significantly compromised due to the sparsity of
samples and extreme imbalance between the survival (usually, the majority) and
mortality class sizes. While a recent random survival forest (RSF) model
overcomes the limitations of the proportional hazard assumption, an imbalance
in the data results in an underestimation (overestimation) of the hazard of the
mortality (survival) classes. A balanced random survival forests (BRSF) model,
based on training the RSF model with data generated from a synthetic minority
sampling scheme is presented to address this gap. Theoretical results on the
effect of balancing on prediction accuracies in BRSF are reported. Benchmarking
studies were conducted using five datasets with different levels of class
imbalance from public repositories and an imbalanced dataset of 267 acute
cardiac patients, collected at the Heart, Artery, and Vein Center of Fresno,
CA. Investigations suggest that BRSF provides an improved discriminatory
strength between the survival and the mortality classes. It outperformed both
optimized Cox (without and with balancing) and RSF with an average reduction of
55\% in the prediction error over the next best alternative.
| stat.ML cs.LG | accuracies of survival models for life expectancy prediction as well as criticalcare applications are significantly compromised due to the sparsity of samples and extreme imbalance between the survival usually the majority and mortality class sizes while a recent random survival forest rsf model overcomes the limitations of the proportional hazard assumption an imbalance in the data results in an underestimation overestimation of the hazard of the mortality survival classes a balanced random survival forests brsf model based on training the rsf model with data generated from a synthetic minority sampling scheme is presented to address this gap theoretical results on the effect of balancing on prediction accuracies in brsf are reported benchmarking studies were conducted using five datasets with different levels of class imbalance from public repositories and an imbalanced dataset of 267 acute cardiac patients collected at the heart artery and vein center of fresno ca investigations suggest that brsf provides an improved discriminatory strength between the survival and the mortality classes it outperformed both optimized cox without and with balancing and rsf with an average reduction of 55 in the prediction error over the next best alternative | [['accuracies', 'of', 'survival', 'models', 'for', 'life', 'expectancy', 'prediction', 'as', 'well', 'as', 'criticalcare', 'applications', 'are', 'significantly', 'compromised', 'due', 'to', 'the', 'sparsity', 'of', 'samples', 'and', 'extreme', 'imbalance', 'between', 'the', 'survival', 'usually', 'the', 'majority', 'and', 'mortality', 'class', 'sizes', 'while', 'a', 'recent', 'random', 'survival', 'forest', 'rsf', 'model', 'overcomes', 'the', 'limitations', 'of', 'the', 'proportional', 'hazard', 'assumption', 'an', 'imbalance', 'in', 'the', 'data', 'results', 'in', 'an', 'underestimation', 'overestimation', 'of', 'the', 'hazard', 'of', 'the', 'mortality', 'survival', 'classes', 'a', 'balanced', 'random', 'survival', 'forests', 'brsf', 'model', 'based', 'on', 'training', 'the', 'rsf', 'model', 'with', 'data', 'generated', 'from', 'a', 'synthetic', 'minority', 'sampling', 'scheme', 'is', 'presented', 'to', 'address', 'this', 'gap', 'theoretical', 'results', 'on', 'the', 'effect', 'of', 'balancing', 'on', 'prediction', 'accuracies', 'in', 'brsf', 'are', 'reported', 'benchmarking', 'studies', 'were', 'conducted', 'using', 'five', 'datasets', 'with', 'different', 'levels', 'of', 'class', 'imbalance', 'from', 'public', 'repositories', 'and', 'an', 'imbalanced', 'dataset', 'of', '267', 'acute', 'cardiac', 'patients', 'collected', 'at', 'the', 'heart', 'artery', 'and', 'vein', 'center', 'of', 'fresno', 'ca', 'investigations', 'suggest', 'that', 'brsf', 'provides', 'an', 'improved', 'discriminatory', 'strength', 'between', 'the', 'survival', 'and', 'the', 'mortality', 'classes', 'it', 'outperformed', 'both', 'optimized', 'cox', 'without', 'and', 'with', 'balancing', 'and', 'rsf', 'with', 'an', 'average', 'reduction', 'of', '55', 'in', 'the', 'prediction', 'error', 'over', 'the', 'next', 'best', 'alternative']] | [-0.031524666841515406, 0.07099952896284052, -0.020362404848692967, 0.10038065109003515, -0.0053233499688539595, -0.11793375022978307, 0.11917704380152219, 0.3818158883461978, -0.1856049666689201, -0.3384878331606082, 0.11372554388126349, -0.3073285947439266, -0.11714676457810848, 0.20374302611497036, -0.14210121194025213, 0.054767516269821695, 0.11450652720563533, 0.012173222836087095, -0.023195460879487945, -0.31721593724080627, 0.26673071254119474, 0.09013262246162655, 0.39498065259646287, 0.02896884460510178, 0.0640008619458559, -0.0028729246416313446, -0.05961676460770482, 0.012566499995070205, -0.06306918373694526, 0.11863577463756328, 0.2478932040107331, 0.15304503785844714, 0.33238829022900945, -0.3687274882789044, -0.2330287286867313, 0.12927199774894882, 0.0975165980355067, 0.08341786079178751, -0.04786979522553576, -0.2914838666273132, 0.03048310495189635, -0.19881079857919942, -0.0641046703057264, -0.022790355475265832, 0.016590111102052232, 0.029448768639137698, -0.34368616811941094, 0.1359315283227971, 0.009146962469857047, 0.14446048903214262, -0.11708526561823598, -0.19012037516237898, -0.016664597127377428, 0.14692217095774962, 0.0990152002759228, 0.01844411490380485, 0.1292740807894687, -0.16912566055045689, -0.15120224680074237, 0.3449825701194213, -0.06455857489746124, -0.15425123317779743, 0.20078541849052564, -0.10048350841703421, -0.11695097896512, 0.1089866322092961, 0.2292556103543356, 0.059061239217034475, -0.13745377814138238, -0.040659231312739796, -0.005014126693311939, 0.133589346034024, 0.036632107142458625, -0.05948135981405961, 0.14517704520952254, 0.254388057004242, 0.02026030170248154, 0.10483967315064455, -0.1695995434532241, -0.08221687118144318, -0.22550223420379076, -0.0914792763231133, -0.144100017315225, 0.008507995578002204, -0.1247337520475665, -0.1687393840196926, 0.3873188998046501, 0.18990542513273537, 0.2181012125904946, 0.10314499544985792, 0.2853913832714851, 0.04687291161993887, 0.0893382018392801, 0.04156043689030616, 0.17620443168748667, 0.059851825470104814, 0.02317645874143364, -0.2439377539925636, 0.16651895128123284, -0.01285869157798389] |
1,803.09178 | On the Enhancement of Heat Transfer and Reduction of Entropy Generation
by Asymmetric Slip in Pressure-Driven Non-Newtonian Microflows | We study hydrodynamics, heat transfer and entropy generation in
pressure-driven microchannel flow of a power-law fluid. Specifically, we
address the effect of asymmetry in the slip boundary condition at the channel
walls. Constant, uniform but unequal heat fluxes are imposed at the walls in
this thermally developed flow. The effect of asymmetric slip on the velocity
profile, on the wall shear stress, on the temperature distribution, on the
Bejan number profiles, and on the average entropy generation and the Nusselt
number are established through the numerical evaluation of exact analytical
expressions derived. Specifically, due to asymmetric slip, the fluid momentum
flux and thermal energy flux are enhanced along the wall with larger slip,
which in turn shifts the location of the velocity's maximum to an off-center
location closer to the said wall. Asymmetric slip is also shown to redistribute
the peaks and plateaus of the Bejan number profile across the microchannel,
showing a sharp transition between entropy generation due to heat transfer and
due to fluid flow at an off-center-line location. In the presence of asymmetric
slip, the difference in the imposed heat fluxes leads to starkly different
Bejan number profiles depending on which wall is hotter, and whether the fluid
is shear-thinning or shear-thickening. Overall, slip is shown to promote
uniformity in both the velocity field and the temperature field, thereby
reducing irreversibility in this flow.
| physics.flu-dyn | we study hydrodynamics heat transfer and entropy generation in pressuredriven microchannel flow of a powerlaw fluid specifically we address the effect of asymmetry in the slip boundary condition at the channel walls constant uniform but unequal heat fluxes are imposed at the walls in this thermally developed flow the effect of asymmetric slip on the velocity profile on the wall shear stress on the temperature distribution on the bejan number profiles and on the average entropy generation and the nusselt number are established through the numerical evaluation of exact analytical expressions derived specifically due to asymmetric slip the fluid momentum flux and thermal energy flux are enhanced along the wall with larger slip which in turn shifts the location of the velocitys maximum to an offcenter location closer to the said wall asymmetric slip is also shown to redistribute the peaks and plateaus of the bejan number profile across the microchannel showing a sharp transition between entropy generation due to heat transfer and due to fluid flow at an offcenterline location in the presence of asymmetric slip the difference in the imposed heat fluxes leads to starkly different bejan number profiles depending on which wall is hotter and whether the fluid is shearthinning or shearthickening overall slip is shown to promote uniformity in both the velocity field and the temperature field thereby reducing irreversibility in this flow | [['we', 'study', 'hydrodynamics', 'heat', 'transfer', 'and', 'entropy', 'generation', 'in', 'pressuredriven', 'microchannel', 'flow', 'of', 'a', 'powerlaw', 'fluid', 'specifically', 'we', 'address', 'the', 'effect', 'of', 'asymmetry', 'in', 'the', 'slip', 'boundary', 'condition', 'at', 'the', 'channel', 'walls', 'constant', 'uniform', 'but', 'unequal', 'heat', 'fluxes', 'are', 'imposed', 'at', 'the', 'walls', 'in', 'this', 'thermally', 'developed', 'flow', 'the', 'effect', 'of', 'asymmetric', 'slip', 'on', 'the', 'velocity', 'profile', 'on', 'the', 'wall', 'shear', 'stress', 'on', 'the', 'temperature', 'distribution', 'on', 'the', 'bejan', 'number', 'profiles', 'and', 'on', 'the', 'average', 'entropy', 'generation', 'and', 'the', 'nusselt', 'number', 'are', 'established', 'through', 'the', 'numerical', 'evaluation', 'of', 'exact', 'analytical', 'expressions', 'derived', 'specifically', 'due', 'to', 'asymmetric', 'slip', 'the', 'fluid', 'momentum', 'flux', 'and', 'thermal', 'energy', 'flux', 'are', 'enhanced', 'along', 'the', 'wall', 'with', 'larger', 'slip', 'which', 'in', 'turn', 'shifts', 'the', 'location', 'of', 'the', 'velocitys', 'maximum', 'to', 'an', 'offcenter', 'location', 'closer', 'to', 'the', 'said', 'wall', 'asymmetric', 'slip', 'is', 'also', 'shown', 'to', 'redistribute', 'the', 'peaks', 'and', 'plateaus', 'of', 'the', 'bejan', 'number', 'profile', 'across', 'the', 'microchannel', 'showing', 'a', 'sharp', 'transition', 'between', 'entropy', 'generation', 'due', 'to', 'heat', 'transfer', 'and', 'due', 'to', 'fluid', 'flow', 'at', 'an', 'offcenterline', 'location', 'in', 'the', 'presence', 'of', 'asymmetric', 'slip', 'the', 'difference', 'in', 'the', 'imposed', 'heat', 'fluxes', 'leads', 'to', 'starkly', 'different', 'bejan', 'number', 'profiles', 'depending', 'on', 'which', 'wall', 'is', 'hotter', 'and', 'whether', 'the', 'fluid', 'is', 'shearthinning', 'or', 'shearthickening', 'overall', 'slip', 'is', 'shown', 'to', 'promote', 'uniformity', 'in', 'both', 'the', 'velocity', 'field', 'and', 'the', 'temperature', 'field', 'thereby', 'reducing', 'irreversibility', 'in', 'this', 'flow']] | [-0.16243791911417238, 0.1841402710818498, -0.07448950644780312, 0.002562670085570915, -0.06789363830337977, -0.11844465000950526, 0.013201017417446339, 0.3558294800464558, -0.27012408184777714, -0.3183461196434198, 0.08331161483800846, -0.26719057684109043, -0.04116763421478558, 0.17605611067409505, -0.04376898361452385, 0.03719310318861585, -0.002866496011074962, 0.040604381133859925, -0.028697864678935602, -0.16136165615377238, 0.27950061689155686, 0.0731154236194587, 0.3826664459265241, 0.14137884565068623, 0.04748885479211741, -0.06300362466475967, -0.024131814685477093, 0.07672113714640778, -0.20630089511715732, 0.03205626796461246, 0.15622804101774948, -0.046549474689656194, 0.17528166556813285, -0.4591393531671008, -0.23878749101876026, 0.08832484796597927, 0.13881631973931005, 0.09596039109092733, -0.036999109274279164, -0.23104131196839817, 0.01805278230499707, -0.12535555274596652, -0.10911888166833504, 0.019779360144341413, 0.04477220986438173, 0.050541565265193315, -0.25152628291480705, 0.18599464407845387, 0.04596026609054214, 0.06727361902429731, -0.08085545935602118, -0.05501789805392809, -0.09555813306901373, 0.08286784270848353, 0.10583690005000186, 0.008974263897326371, 0.20151784094138095, -0.18061608213939565, 0.0023967596007906625, 0.3440124550669462, -0.07082640958035084, -0.21944439565284854, 0.19529498503177706, -0.15734751860866636, 0.002219867062202729, 0.1870179938067954, 0.1940097471995823, 0.08148911222892781, -0.11576182601470665, -0.036992991814983237, 0.0017346363742341312, 0.12368151104537177, 0.12088304314869497, -0.056958659608700044, 0.2576980751288016, 0.11228392870717607, 0.07938857415311895, 0.18779353103888904, -0.16636693641951358, -0.13776360991188383, -0.3098636954215116, -0.14716943321220033, -0.16800447752847608, 0.015742755159673865, -0.11818010805007811, -0.17519843720998904, 0.35404334223182227, 0.13368560462588427, 0.18509377347896766, 0.037067675132554774, 0.29285574985659824, 0.13234973968361066, 0.05371911948921769, 0.12968363369139224, 0.2442074043560872, 0.18121977957105675, 0.1894910722472334, -0.3386124416751029, 0.08754426254107889, 0.04725094581954181] |
1,803.09179 | FaceForensics: A Large-scale Video Dataset for Forgery Detection in
Human Faces | With recent advances in computer vision and graphics, it is now possible to
generate videos with extremely realistic synthetic faces, even in real time.
Countless applications are possible, some of which raise a legitimate alarm,
calling for reliable detectors of fake videos. In fact, distinguishing between
original and manipulated video can be a challenge for humans and computers
alike, especially when the videos are compressed or have low resolution, as it
often happens on social networks. Research on the detection of face
manipulations has been seriously hampered by the lack of adequate datasets. To
this end, we introduce a novel face manipulation dataset of about half a
million edited images (from over 1000 videos). The manipulations have been
generated with a state-of-the-art face editing approach. It exceeds all
existing video manipulation datasets by at least an order of magnitude. Using
our new dataset, we introduce benchmarks for classical image forensic tasks,
including classification and segmentation, considering videos compressed at
various quality levels. In addition, we introduce a benchmark evaluation for
creating indistinguishable forgeries with known ground truth; for instance with
generative refinement models.
| cs.CV | with recent advances in computer vision and graphics it is now possible to generate videos with extremely realistic synthetic faces even in real time countless applications are possible some of which raise a legitimate alarm calling for reliable detectors of fake videos in fact distinguishing between original and manipulated video can be a challenge for humans and computers alike especially when the videos are compressed or have low resolution as it often happens on social networks research on the detection of face manipulations has been seriously hampered by the lack of adequate datasets to this end we introduce a novel face manipulation dataset of about half a million edited images from over 1000 videos the manipulations have been generated with a stateoftheart face editing approach it exceeds all existing video manipulation datasets by at least an order of magnitude using our new dataset we introduce benchmarks for classical image forensic tasks including classification and segmentation considering videos compressed at various quality levels in addition we introduce a benchmark evaluation for creating indistinguishable forgeries with known ground truth for instance with generative refinement models | [['with', 'recent', 'advances', 'in', 'computer', 'vision', 'and', 'graphics', 'it', 'is', 'now', 'possible', 'to', 'generate', 'videos', 'with', 'extremely', 'realistic', 'synthetic', 'faces', 'even', 'in', 'real', 'time', 'countless', 'applications', 'are', 'possible', 'some', 'of', 'which', 'raise', 'a', 'legitimate', 'alarm', 'calling', 'for', 'reliable', 'detectors', 'of', 'fake', 'videos', 'in', 'fact', 'distinguishing', 'between', 'original', 'and', 'manipulated', 'video', 'can', 'be', 'a', 'challenge', 'for', 'humans', 'and', 'computers', 'alike', 'especially', 'when', 'the', 'videos', 'are', 'compressed', 'or', 'have', 'low', 'resolution', 'as', 'it', 'often', 'happens', 'on', 'social', 'networks', 'research', 'on', 'the', 'detection', 'of', 'face', 'manipulations', 'has', 'been', 'seriously', 'hampered', 'by', 'the', 'lack', 'of', 'adequate', 'datasets', 'to', 'this', 'end', 'we', 'introduce', 'a', 'novel', 'face', 'manipulation', 'dataset', 'of', 'about', 'half', 'a', 'million', 'edited', 'images', 'from', 'over', '1000', 'videos', 'the', 'manipulations', 'have', 'been', 'generated', 'with', 'a', 'stateoftheart', 'face', 'editing', 'approach', 'it', 'exceeds', 'all', 'existing', 'video', 'manipulation', 'datasets', 'by', 'at', 'least', 'an', 'order', 'of', 'magnitude', 'using', 'our', 'new', 'dataset', 'we', 'introduce', 'benchmarks', 'for', 'classical', 'image', 'forensic', 'tasks', 'including', 'classification', 'and', 'segmentation', 'considering', 'videos', 'compressed', 'at', 'various', 'quality', 'levels', 'in', 'addition', 'we', 'introduce', 'a', 'benchmark', 'evaluation', 'for', 'creating', 'indistinguishable', 'forgeries', 'with', 'known', 'ground', 'truth', 'for', 'instance', 'with', 'generative', 'refinement', 'models']] | [-0.05819692889793364, 0.044785745268324365, -0.03194605495622942, 0.04596097435283124, -0.09386468202109789, -0.18269986460300905, -0.010285281001137254, 0.4558748973767614, -0.22537598943673684, -0.4164365282882758, 0.13429991410895062, -0.31420630957839674, -0.14888728897423162, 0.2543191138738919, -0.16447932103933777, 0.0691292954741117, 0.16150554757097055, 0.06341817415869017, -0.03628077122059656, -0.32563083003277643, 0.26127776461195384, 0.0099904401624789, 0.3096787543672193, 0.0407264185484112, 0.11728210371659427, -0.03291746630788847, -0.0467674480585758, 0.00897505068884338, -0.03715622796463307, 0.17288990369539892, 0.338661067922797, 0.2156711101705015, 0.3168634367073616, -0.43533878456394043, -0.2299441874149393, 0.09232665771107021, 0.13882450155959633, 0.1437529936082002, -0.11019574149633896, -0.3781001261979993, 0.12265132572451005, -0.1725352576239126, 0.007043488665777793, -0.15830143401717328, 0.03700683767400947, -0.0504358192690129, -0.2370757394072045, 0.04631448465608101, -0.001481938462124252, 0.1511360745001686, -0.008730919336991721, -0.09486053766596228, 0.05932214380488995, 0.20911868327870442, 0.03808185517917708, 0.04109064874600599, 0.11876481295788477, -0.25637923041072325, -0.158473696629644, 0.43379937083831904, -0.01815198041826914, -0.17281967874290677, 0.2343485165804706, -0.052490424564556104, -0.1252338313497603, 0.13873463872911745, 0.1992003601502444, 0.14242437450327183, -0.1303377124864024, -0.0038747823159784507, -0.05866529282928022, 0.1793139491629751, 0.11708397350637904, 0.007802214096567487, 0.23061012231892414, 0.2385454660512461, 0.005359333648175877, 0.12847778644197103, -0.13041788704001187, -0.053201956195436176, -0.17943105614576182, -0.11155011252210033, -0.19956018178293716, 0.008065422895094735, -0.05969889064750741, -0.127622105414684, 0.37048740639183364, 0.25948032962070533, 0.1724851921911967, 0.05139189700359387, 0.3812379125821216, -0.0006497850860443597, 0.11438958446941812, 0.04342178121219323, 0.13660339426959844, -0.03642376769865899, 0.13295522008455088, -0.09021872092789686, 0.07306443406790597, 0.0013892037038248583] |
1,803.0918 | Unsupervised Domain Adaptation: from Simulation Engine to the RealWorld | Large-scale labeled training datasets have enabled deep neural networks to
excel on a wide range of benchmark vision tasks. However, in many applications
it is prohibitively expensive or time-consuming to obtain large quantities of
labeled data. To cope with limited labeled training data, many have attempted
to directly apply models trained on a large-scale labeled source domain to
another sparsely labeled target domain. Unfortunately, direct transfer across
domains often performs poorly due to domain shift and dataset bias. Domain
adaptation is the machine learning paradigm that aims to learn a model from a
source domain that can perform well on a different (but related) target domain.
In this paper, we summarize and compare the latest unsupervised domain
adaptation methods in computer vision applications. We classify the non-deep
approaches into sample re-weighting and intermediate subspace transformation
categories, while the deep strategy includes discrepancy-based methods,
adversarial generative models, adversarial discriminative models and
reconstruction-based methods. We also discuss some potential directions.
| cs.CV cs.LG stat.ML | largescale labeled training datasets have enabled deep neural networks to excel on a wide range of benchmark vision tasks however in many applications it is prohibitively expensive or timeconsuming to obtain large quantities of labeled data to cope with limited labeled training data many have attempted to directly apply models trained on a largescale labeled source domain to another sparsely labeled target domain unfortunately direct transfer across domains often performs poorly due to domain shift and dataset bias domain adaptation is the machine learning paradigm that aims to learn a model from a source domain that can perform well on a different but related target domain in this paper we summarize and compare the latest unsupervised domain adaptation methods in computer vision applications we classify the nondeep approaches into sample reweighting and intermediate subspace transformation categories while the deep strategy includes discrepancybased methods adversarial generative models adversarial discriminative models and reconstructionbased methods we also discuss some potential directions | [['largescale', 'labeled', 'training', 'datasets', 'have', 'enabled', 'deep', 'neural', 'networks', 'to', 'excel', 'on', 'a', 'wide', 'range', 'of', 'benchmark', 'vision', 'tasks', 'however', 'in', 'many', 'applications', 'it', 'is', 'prohibitively', 'expensive', 'or', 'timeconsuming', 'to', 'obtain', 'large', 'quantities', 'of', 'labeled', 'data', 'to', 'cope', 'with', 'limited', 'labeled', 'training', 'data', 'many', 'have', 'attempted', 'to', 'directly', 'apply', 'models', 'trained', 'on', 'a', 'largescale', 'labeled', 'source', 'domain', 'to', 'another', 'sparsely', 'labeled', 'target', 'domain', 'unfortunately', 'direct', 'transfer', 'across', 'domains', 'often', 'performs', 'poorly', 'due', 'to', 'domain', 'shift', 'and', 'dataset', 'bias', 'domain', 'adaptation', 'is', 'the', 'machine', 'learning', 'paradigm', 'that', 'aims', 'to', 'learn', 'a', 'model', 'from', 'a', 'source', 'domain', 'that', 'can', 'perform', 'well', 'on', 'a', 'different', 'but', 'related', 'target', 'domain', 'in', 'this', 'paper', 'we', 'summarize', 'and', 'compare', 'the', 'latest', 'unsupervised', 'domain', 'adaptation', 'methods', 'in', 'computer', 'vision', 'applications', 'we', 'classify', 'the', 'nondeep', 'approaches', 'into', 'sample', 'reweighting', 'and', 'intermediate', 'subspace', 'transformation', 'categories', 'while', 'the', 'deep', 'strategy', 'includes', 'discrepancybased', 'methods', 'adversarial', 'generative', 'models', 'adversarial', 'discriminative', 'models', 'and', 'reconstructionbased', 'methods', 'we', 'also', 'discuss', 'some', 'potential', 'directions']] | [-0.006638920258824961, -0.008799737991317164, -0.025151110075921104, 0.1057872678907706, -0.1898963874695186, -0.19431881125297257, 0.0381655877911415, 0.5041310820681385, -0.3101180967804092, -0.35490587402335544, 0.10581129701304119, -0.2549595582038105, -0.15591296526644663, 0.22047730247325065, -0.17685203896091273, 0.09539703412358708, 0.18501688381421227, 0.014851051839540087, -0.05588070586577199, -0.27162667655362455, 0.3202255079419576, -0.01827431149534657, 0.3757267816587575, -0.010835494296448422, 0.12805805012990448, -0.0759513978831635, -0.060670514791449415, -0.01415325771085918, -0.055907089306396, 0.16552056639036752, 0.37326997337890755, 0.2253707157937173, 0.3370180585468777, -0.4133076769285714, -0.2816188523562071, 0.14128231922977993, 0.1763145223118459, 0.16285936722667854, -0.03824497732227739, -0.3420656674093555, 0.07666976816062167, -0.17087582731619477, 0.04549849280922473, -0.202502451377296, -0.020597979561956244, -0.013624409068511398, -0.28196239220921565, 0.02186291482688876, 0.043391881246102056, 0.09040971544918994, -0.04988209247630372, -0.12800266596052465, 0.0646034556903723, 0.16711373255393597, 0.05294510120484695, 0.10565882635411888, 0.1377091551394072, -0.21907189422540507, -0.14047492751439067, 0.3314309204704588, -0.014474642421767304, -0.23148819284890837, 0.2824159283485688, -0.019352862791193626, -0.17530135239792777, 0.08083225259132966, 0.2836612156128859, 0.1586277002252821, -0.17069983532168914, 0.07399511748860013, 0.02167224639266305, 0.18677271624932748, 0.023470196357185516, -0.059637576023328906, 0.1683866263988363, 0.25564564294712266, 0.01790164454023743, 0.15737494812759606, -0.13380004007434118, -0.06748360528056568, -0.1884399468846961, -0.01822208175494607, -0.2560814554932751, -0.03653175073168889, -0.05337609393287102, -0.16662239380701388, 0.35630748316622046, 0.24988841543068427, 0.2530221292701892, 0.08207603799944738, 0.36079049399240487, -0.03989031484138362, 0.1626087266220888, 0.0698375639776829, 0.11953985817598539, 0.016719665861676766, 0.18426988224787755, -0.12602691300938354, 0.055384759954766286, -0.009579273119061902] |
1,803.09181 | Saturated Fully Leafed Tree-Like Polyforms and Polycubes | We present recursive formulas giving the maximal number of leaves in
tree-like polyforms living in two-dimensional regular lattices and in tree-like
polycubes in the three-dimensional cubic lattice.
We call these tree-like polyforms and polycubes \emph{fully leafed}.
The proof relies on a combinatorial algorithm that enumerates rooted directed
trees that we call abundant.
In the last part, we concentrate on the particular case of polyforms and
polycubes, that we call \emph{saturated}, which is the family of fully leafed
structures that maximize the ratio
$\mbox{(number of leaves)}/\mbox{ (number of cells)}$.
In the polyomino case, we present a bijection between the set of saturated
tree-like polyominoes of size $4k+1$ and the set of tree-like polyominoes of
size $k$.
We exhibit a similar bijection between the set of saturated tree-like
polycubes of size $41k+28$ and a family of polycubes, called $4$-trees, of size
$3k+2$.
| math.CO | we present recursive formulas giving the maximal number of leaves in treelike polyforms living in twodimensional regular lattices and in treelike polycubes in the threedimensional cubic lattice we call these treelike polyforms and polycubes emphfully leafed the proof relies on a combinatorial algorithm that enumerates rooted directed trees that we call abundant in the last part we concentrate on the particular case of polyforms and polycubes that we call emphsaturated which is the family of fully leafed structures that maximize the ratio mboxnumber of leavesmbox number of cells in the polyomino case we present a bijection between the set of saturated treelike polyominoes of size 4k1 and the set of treelike polyominoes of size k we exhibit a similar bijection between the set of saturated treelike polycubes of size 41k28 and a family of polycubes called 4trees of size 3k2 | [['we', 'present', 'recursive', 'formulas', 'giving', 'the', 'maximal', 'number', 'of', 'leaves', 'in', 'treelike', 'polyforms', 'living', 'in', 'twodimensional', 'regular', 'lattices', 'and', 'in', 'treelike', 'polycubes', 'in', 'the', 'threedimensional', 'cubic', 'lattice', 'we', 'call', 'these', 'treelike', 'polyforms', 'and', 'polycubes', 'emphfully', 'leafed', 'the', 'proof', 'relies', 'on', 'a', 'combinatorial', 'algorithm', 'that', 'enumerates', 'rooted', 'directed', 'trees', 'that', 'we', 'call', 'abundant', 'in', 'the', 'last', 'part', 'we', 'concentrate', 'on', 'the', 'particular', 'case', 'of', 'polyforms', 'and', 'polycubes', 'that', 'we', 'call', 'emphsaturated', 'which', 'is', 'the', 'family', 'of', 'fully', 'leafed', 'structures', 'that', 'maximize', 'the', 'ratio', 'mboxnumber', 'of', 'leavesmbox', 'number', 'of', 'cells', 'in', 'the', 'polyomino', 'case', 'we', 'present', 'a', 'bijection', 'between', 'the', 'set', 'of', 'saturated', 'treelike', 'polyominoes', 'of', 'size', '4k1', 'and', 'the', 'set', 'of', 'treelike', 'polyominoes', 'of', 'size', 'k', 'we', 'exhibit', 'a', 'similar', 'bijection', 'between', 'the', 'set', 'of', 'saturated', 'treelike', 'polycubes', 'of', 'size', '41k28', 'and', 'a', 'family', 'of', 'polycubes', 'called', '4trees', 'of', 'size', '3k2']] | [-0.1784055384453731, 0.16007672224055838, -0.011519993041400556, 0.04836338153195188, -0.09710174865537771, -0.08652385468422263, 0.0821781985703166, 0.3593874915882393, -0.26656751898979697, -0.22602565719021692, 0.06017001144829447, -0.26831408163739573, -0.2094312236506354, 0.1292370105093276, -0.09949346758302353, -0.009394450389987066, 0.03898635490762967, 0.0444724444920818, -0.009266150548474225, -0.25313056971774334, 0.34376118286961205, -0.0332257736991677, 0.23518957106948452, 0.011003571232194425, 0.10805331287146719, 0.020656574969352394, 0.001481500609467427, 0.10198893909928976, -0.2037925172676936, 0.14593588255207848, 0.1995295068456067, 0.15120604623936945, 0.17667329137523968, -0.42705374024808407, -0.08062724933994037, 0.173666565173685, 0.1383383728598279, 0.08181888968425079, -0.02503047960948337, -0.17006300595002594, 0.09563085353088185, -0.13127455270150676, -0.11766116941623665, -0.01597309934527234, 0.056734542914286805, 0.050106473239510604, -0.2074976823396153, -0.008060670754423849, 0.13822071979650194, 0.08485345810789753, 0.005925093870609998, -0.1538911292605378, -0.06004913090555756, 0.08656235632521135, -0.09722202523197565, -0.0320749962978341, 0.02111543615314144, -0.08762989112486443, -0.13778140587318274, 0.33398636950921545, 0.006359616567001299, -0.1865729249254973, 0.16573801921956516, -0.16891149014786438, -0.2164455170294753, 0.15273723439830872, 0.18555430174908705, 0.16102443471274994, -0.06560074692824855, 0.1323229920028502, -0.21645353436470033, 0.1262922039496954, 0.15337067984251512, 0.004692088574584988, 0.14499941519116638, 0.2106347215068699, 0.10156546766800736, 0.24022668064744385, -0.02147987019960527, -0.07302773423768856, -0.25953647639533434, -0.14022765877242718, -0.17542073856608045, 0.04689062414690852, -0.14288940866320413, -0.29343527009089787, 0.3806348606530163, 0.09306799395837717, 0.23047496779925294, 0.1704942628060019, 0.16225366245748268, -0.011638886469989774, 0.08799156833750506, 0.09126726576058125, 0.101103718896155, 0.12272238941406141, -0.0017213805992570188, -0.14179222230644276, 0.055556377544309254, 0.18621840882632468] |
1,803.09182 | Harmonic determinants and unique continuation | We give partial answers to the following question: if $F$ is an $m$ by $m$
matrix on $\mathbb{R}^n$ satisfying a second order linear elliptic equation,
does $\det F$ satisfy the strong unique continuation property? We give
counterexamples in the case when the operator is a general non-diagonal
operator and also for some diagonal operators. Positive results are obtained
when $n = 1$ and any $m$, when $n = 2$ for the Laplace-Beltrami operator and
also twisted with a Yang-Mills connection. Reductions to special cases when $n
= 2$ are obtained. The last section considers an application to the Calder\'on
problem in 2D based on recent techniques.
| math.AP math.DG | we give partial answers to the following question if f is an m by m matrix on mathbbrn satisfying a second order linear elliptic equation does det f satisfy the strong unique continuation property we give counterexamples in the case when the operator is a general nondiagonal operator and also for some diagonal operators positive results are obtained when n 1 and any m when n 2 for the laplacebeltrami operator and also twisted with a yangmills connection reductions to special cases when n 2 are obtained the last section considers an application to the calderon problem in 2d based on recent techniques | [['we', 'give', 'partial', 'answers', 'to', 'the', 'following', 'question', 'if', 'f', 'is', 'an', 'm', 'by', 'm', 'matrix', 'on', 'mathbbrn', 'satisfying', 'a', 'second', 'order', 'linear', 'elliptic', 'equation', 'does', 'det', 'f', 'satisfy', 'the', 'strong', 'unique', 'continuation', 'property', 'we', 'give', 'counterexamples', 'in', 'the', 'case', 'when', 'the', 'operator', 'is', 'a', 'general', 'nondiagonal', 'operator', 'and', 'also', 'for', 'some', 'diagonal', 'operators', 'positive', 'results', 'are', 'obtained', 'when', 'n', '1', 'and', 'any', 'm', 'when', 'n', '2', 'for', 'the', 'laplacebeltrami', 'operator', 'and', 'also', 'twisted', 'with', 'a', 'yangmills', 'connection', 'reductions', 'to', 'special', 'cases', 'when', 'n', '2', 'are', 'obtained', 'the', 'last', 'section', 'considers', 'an', 'application', 'to', 'the', 'calderon', 'problem', 'in', '2d', 'based', 'on', 'recent', 'techniques']] | [-0.14206085767307616, 0.0782404983197497, 0.012306181044833175, 0.048611078092611386, -0.09429528091545895, -0.18789222254643886, -0.030006606529638605, 0.3270540471704116, -0.2607982130133484, -0.22091273089997399, 0.1306637826898967, -0.3357642772404061, -0.16254036461943489, 0.19126876739522858, -0.0816127042855742, 0.07247383292149571, 0.07197293574985081, 0.09473243243178552, -0.13874588498972285, -0.3046869616955519, 0.4091598493887961, -0.04848170124482617, 0.18049137334529203, 0.10526870289654697, 0.08543992675931274, 0.03039804391689526, 0.015614803857848194, -0.026208970371229847, -0.14380823771098575, 0.08386629660222769, 0.2363750478908311, 0.08337132724056255, 0.2587030031673104, -0.4188895074524058, -0.15009028395384694, 0.1618254080197765, 0.11996443790736273, 0.021388421377655373, -0.018776398673580136, -0.24342690387659355, 0.14168774841005183, -0.09327030249699517, -0.16099007737379775, -0.05303447272682798, 0.08875847284148619, -0.020659347742940617, -0.36414111723888265, 0.03122706454443899, 0.13698474460652152, 0.02449799218052293, -0.06670878988066778, -0.1500055682879321, 0.017861998992637525, 0.06634077784329544, 0.01891927507895868, 0.058131055923368674, 0.008199377650015273, -0.07264252462270625, -0.0765974386877751, 0.3432908907207181, -0.0915350282747859, -0.2862197356388986, 0.08514920505242947, -0.16676290094111007, -0.15605286012055553, 0.062450312354909346, 0.10151973081237266, 0.16248833917271238, -0.07380771422950841, 0.21107025601216184, -0.12309056704013961, 0.13721872567768814, 0.08097629514025542, -0.024448689549722825, 0.054463287365613774, 0.037937421143705984, 0.15490880506723503, 0.10256322959067246, 0.04161900072584598, -0.023956248667814487, -0.35470455128120854, -0.16328216458951095, -0.15433787566030996, 0.15323647593591108, -0.10854576653176444, -0.14448791874337544, 0.33606520632860587, 0.06303436404039849, 0.23332938275670687, 0.08264028064955198, 0.22262659938373033, 0.1786194445239832, -0.007333728114088762, 0.09363782613818507, 0.13082629281974362, 0.19082963074901077, 0.10176228713786718, -0.16668170906780785, -0.024188160587744156, 0.19371284575210612] |
1,803.09183 | COHERENT 2018 at the Spallation Neutron Source | The primary goal of the COHERENT collaboration is to measure and study
coherent elastic neutrino-nucleus scattering (CEvNS) using the high-power,
few-tens-of-MeV, pulsed source of neutrinos provided by the Spallation Neutron
Source (SNS) at Oak Ridge National Laboratory (ORNL). The COHERENT
collaboration reported the first detection of CEvNS [Akimov:2017ade] using a
CsI[Na] detector. At present the collaboration is deploying four detector
technologies: a CsI[Na] scintillating crystal, p-type point-contact germanium
detectors, single-phase liquid argon, and NaI[Tl] crystals. All detectors are
located in the neutron-quiet basement of the SNS target building at distances
20-30 m from the SNS neutrino source. The simultaneous measurement in all four
COHERENT detector subsystems will test the $N^2$ dependence of the cross
section and search for new physics. In addition, COHERENT is measuring
neutrino-induced neutrons from charged- and neutral-current neutrino
interactions on nuclei in shielding materials, which represent a non-negligible
background for CEvNS as well as being of intrinsic interest. The Collaboration
is planning as well to look for charged-current interactions of relevance to
supernova and weak-interaction physics. This document describes concisely the
COHERENT physics motivations, sensitivity, and next plans for measurements at
the SNS to be accomplished on a few-year timescale.
| physics.ins-det hep-ex nucl-ex | the primary goal of the coherent collaboration is to measure and study coherent elastic neutrinonucleus scattering cevns using the highpower fewtensofmev pulsed source of neutrinos provided by the spallation neutron source sns at oak ridge national laboratory ornl the coherent collaboration reported the first detection of cevns akimov2017ade using a csina detector at present the collaboration is deploying four detector technologies a csina scintillating crystal ptype pointcontact germanium detectors singlephase liquid argon and naitl crystals all detectors are located in the neutronquiet basement of the sns target building at distances 2030 m from the sns neutrino source the simultaneous measurement in all four coherent detector subsystems will test the n2 dependence of the cross section and search for new physics in addition coherent is measuring neutrinoinduced neutrons from charged and neutralcurrent neutrino interactions on nuclei in shielding materials which represent a nonnegligible background for cevns as well as being of intrinsic interest the collaboration is planning as well to look for chargedcurrent interactions of relevance to supernova and weakinteraction physics this document describes concisely the coherent physics motivations sensitivity and next plans for measurements at the sns to be accomplished on a fewyear timescale | [['the', 'primary', 'goal', 'of', 'the', 'coherent', 'collaboration', 'is', 'to', 'measure', 'and', 'study', 'coherent', 'elastic', 'neutrinonucleus', 'scattering', 'cevns', 'using', 'the', 'highpower', 'fewtensofmev', 'pulsed', 'source', 'of', 'neutrinos', 'provided', 'by', 'the', 'spallation', 'neutron', 'source', 'sns', 'at', 'oak', 'ridge', 'national', 'laboratory', 'ornl', 'the', 'coherent', 'collaboration', 'reported', 'the', 'first', 'detection', 'of', 'cevns', 'akimov2017ade', 'using', 'a', 'csina', 'detector', 'at', 'present', 'the', 'collaboration', 'is', 'deploying', 'four', 'detector', 'technologies', 'a', 'csina', 'scintillating', 'crystal', 'ptype', 'pointcontact', 'germanium', 'detectors', 'singlephase', 'liquid', 'argon', 'and', 'naitl', 'crystals', 'all', 'detectors', 'are', 'located', 'in', 'the', 'neutronquiet', 'basement', 'of', 'the', 'sns', 'target', 'building', 'at', 'distances', '2030', 'm', 'from', 'the', 'sns', 'neutrino', 'source', 'the', 'simultaneous', 'measurement', 'in', 'all', 'four', 'coherent', 'detector', 'subsystems', 'will', 'test', 'the', 'n2', 'dependence', 'of', 'the', 'cross', 'section', 'and', 'search', 'for', 'new', 'physics', 'in', 'addition', 'coherent', 'is', 'measuring', 'neutrinoinduced', 'neutrons', 'from', 'charged', 'and', 'neutralcurrent', 'neutrino', 'interactions', 'on', 'nuclei', 'in', 'shielding', 'materials', 'which', 'represent', 'a', 'nonnegligible', 'background', 'for', 'cevns', 'as', 'well', 'as', 'being', 'of', 'intrinsic', 'interest', 'the', 'collaboration', 'is', 'planning', 'as', 'well', 'to', 'look', 'for', 'chargedcurrent', 'interactions', 'of', 'relevance', 'to', 'supernova', 'and', 'weakinteraction', 'physics', 'this', 'document', 'describes', 'concisely', 'the', 'coherent', 'physics', 'motivations', 'sensitivity', 'and', 'next', 'plans', 'for', 'measurements', 'at', 'the', 'sns', 'to', 'be', 'accomplished', 'on', 'a', 'fewyear', 'timescale']] | [-0.06129328685710789, 0.22037785474822158, -0.042234320904753986, 0.09797195781175105, -0.03196824833563975, -0.13149970043014036, 0.029913077985838754, 0.35037603422703495, -0.2055855097616283, -0.32525768014844897, 0.01360027050880793, -0.39733760295954806, 0.006330880574144733, 0.22542480219635763, 0.08655044622719288, 0.0582010905224403, 0.07563271842597412, -0.00889376550912857, -0.04749747637833934, -0.16056497093874592, 0.2819720712044121, 0.19266076620988315, 0.3342281715401138, 0.08382894334378459, 0.13771379755993016, 0.022971867258396134, -0.06969604163684077, -0.0741597149244626, -0.06631209839482229, 0.052581233331390344, 0.3730533013717074, 0.08213520935078122, 0.11003661589105225, -0.43491648863224935, -0.15396434728851696, 0.08844349244221424, 0.07207211751938303, 0.07457534065709599, -0.11591709286949481, -0.34802413686702494, 0.036192513718560804, -0.22259390754940492, -0.12638636811425386, 0.020886649694148218, -0.04272132199018112, 0.04528999760183675, -0.21163151217236495, -0.008529907085176092, -0.03772047810965281, 0.01876506578992121, -0.05548598522970375, -0.17799483285610526, 0.07019735987948177, 0.07853352576785255, 0.006969949459213846, 0.023487283529902925, 0.20109302416919186, -0.15787907628168796, -0.11834032973577753, 0.35935349039452075, -0.04706918486772338, -0.08319334291900304, 0.15210844618195551, -0.20181936768009714, -0.10406820208057373, 0.15728168752320926, 0.2257347908898737, 0.09147172537753552, -0.25323561988867976, 0.028337004813389893, -0.0015299077622330515, 0.1594712902133324, 0.10916881605226081, 0.04369781206503376, 0.25863539695274085, 0.34406969175324775, 0.04648810539462526, 0.05386691550484102, -0.20972581733682696, 0.03548274478574361, -0.35247021566950326, -0.1317554602283053, -0.10916266014222249, 0.0544897581942981, 0.02252450137454313, -0.09172480260364561, 0.35491926115355454, 0.06705873495957348, 0.09856650819832187, -0.0812165373966612, 0.3010024448352245, -0.03162039622596543, 0.06462733877803355, -0.020297316065504372, 0.3385083780061298, 0.14443298311865269, 0.13348120768205263, -0.22705819028427263, 0.08104625240230234, -0.002664543678595995] |
1,803.09184 | Measurement of Source Star Colors with the K2C9-CFHT Multi-color
Microlensing Survey | K2 Campaign 9 (K2C9) was the first space-based microlensing parallax survey
capable of measuring microlensing parallaxes of free-floating planet candidate
microlensing events. Simultaneous to K2C9 observations we conducted the K2C9
Canada-France-Hawaii Telescope Multi-Color Microlensing Survey (K2C9-CFHT MCMS)
in order to measure the colors of microlensing source stars to improve the
accuracy of K2C9's parallax measurements. We describe the difference imaging
photometry analysis of the K2C9-CFHT MCMS observations, and present the
project's first data release. This includes instrumental difference flux
lightcurves of 217 microlensing events identified by other microlensing
surveys, reference image photometry calibrated to PanSTARRS data release 1
photometry, and tools to convert between instrumental and calibrated flux
scales. We derive accurate analytic transformations between the PanSTARRS
bandpasses and the Kepler bandpass, as well as angular diameter-color relations
in the PanSTARRS bandpasses. To demonstrate the use of our data set, we analyze
ground-based and K2 data of a short timescale microlensing event,
OGLE-2016-BLG-0795. We find the event has a timescale $t_{\rm E}=4.5 \pm
0.1$~days and microlens parallax $\pi_{\rm E}=0.12 \pm 0.03$ or $0.97 \pm
0.04$, subject to the standard satellite parallax degeneracy. We argue that the
smaller value of the parallax is more likely, which implies that the lens is
likely a stellar-mass object in the Galactic bulge as opposed to a
super-Jupiter mass object in the Galactic disk.
| astro-ph.EP | k2 campaign 9 k2c9 was the first spacebased microlensing parallax survey capable of measuring microlensing parallaxes of freefloating planet candidate microlensing events simultaneous to k2c9 observations we conducted the k2c9 canadafrancehawaii telescope multicolor microlensing survey k2c9cfht mcms in order to measure the colors of microlensing source stars to improve the accuracy of k2c9s parallax measurements we describe the difference imaging photometry analysis of the k2c9cfht mcms observations and present the projects first data release this includes instrumental difference flux lightcurves of 217 microlensing events identified by other microlensing surveys reference image photometry calibrated to panstarrs data release 1 photometry and tools to convert between instrumental and calibrated flux scales we derive accurate analytic transformations between the panstarrs bandpasses and the kepler bandpass as well as angular diametercolor relations in the panstarrs bandpasses to demonstrate the use of our data set we analyze groundbased and k2 data of a short timescale microlensing event ogle2016blg0795 we find the event has a timescale t_rm e45 pm 01days and microlens parallax pi_rm e012 pm 003 or 097 pm 004 subject to the standard satellite parallax degeneracy we argue that the smaller value of the parallax is more likely which implies that the lens is likely a stellarmass object in the galactic bulge as opposed to a superjupiter mass object in the galactic disk | [['k2', 'campaign', '9', 'k2c9', 'was', 'the', 'first', 'spacebased', 'microlensing', 'parallax', 'survey', 'capable', 'of', 'measuring', 'microlensing', 'parallaxes', 'of', 'freefloating', 'planet', 'candidate', 'microlensing', 'events', 'simultaneous', 'to', 'k2c9', 'observations', 'we', 'conducted', 'the', 'k2c9', 'canadafrancehawaii', 'telescope', 'multicolor', 'microlensing', 'survey', 'k2c9cfht', 'mcms', 'in', 'order', 'to', 'measure', 'the', 'colors', 'of', 'microlensing', 'source', 'stars', 'to', 'improve', 'the', 'accuracy', 'of', 'k2c9s', 'parallax', 'measurements', 'we', 'describe', 'the', 'difference', 'imaging', 'photometry', 'analysis', 'of', 'the', 'k2c9cfht', 'mcms', 'observations', 'and', 'present', 'the', 'projects', 'first', 'data', 'release', 'this', 'includes', 'instrumental', 'difference', 'flux', 'lightcurves', 'of', '217', 'microlensing', 'events', 'identified', 'by', 'other', 'microlensing', 'surveys', 'reference', 'image', 'photometry', 'calibrated', 'to', 'panstarrs', 'data', 'release', '1', 'photometry', 'and', 'tools', 'to', 'convert', 'between', 'instrumental', 'and', 'calibrated', 'flux', 'scales', 'we', 'derive', 'accurate', 'analytic', 'transformations', 'between', 'the', 'panstarrs', 'bandpasses', 'and', 'the', 'kepler', 'bandpass', 'as', 'well', 'as', 'angular', 'diametercolor', 'relations', 'in', 'the', 'panstarrs', 'bandpasses', 'to', 'demonstrate', 'the', 'use', 'of', 'our', 'data', 'set', 'we', 'analyze', 'groundbased', 'and', 'k2', 'data', 'of', 'a', 'short', 'timescale', 'microlensing', 'event', 'ogle2016blg0795', 'we', 'find', 'the', 'event', 'has', 'a', 'timescale', 't_rm', 'e45', 'pm', '01days', 'and', 'microlens', 'parallax', 'pi_rm', 'e012', 'pm', '003', 'or', '097', 'pm', '004', 'subject', 'to', 'the', 'standard', 'satellite', 'parallax', 'degeneracy', 'we', 'argue', 'that', 'the', 'smaller', 'value', 'of', 'the', 'parallax', 'is', 'more', 'likely', 'which', 'implies', 'that', 'the', 'lens', 'is', 'likely', 'a', 'stellarmass', 'object', 'in', 'the', 'galactic', 'bulge', 'as', 'opposed', 'to', 'a', 'superjupiter', 'mass', 'object', 'in', 'the', 'galactic', 'disk']] | [-0.0888117962104745, 0.04321830732389375, -0.10647498850793766, 0.11461482961288273, -0.1896808196882337, -0.04578095709985918, 0.07046458786331607, 0.37712258005191185, -0.1707440890916164, -0.41143418879995886, 0.08457750307850785, -0.3908156266812008, -0.03155199088431685, 0.2579016653632859, -0.12437508691172225, 0.04069790379647078, 0.17283358978448618, -0.1468532491090572, -0.019320559785198508, -0.27809016563122907, 0.19228747608621075, 0.06007890945230501, 0.089685174509743, -0.09697277118819313, 0.10347592414814778, -0.03396931417535623, -0.16363583058949577, -0.03991474451698328, -0.22906294522159065, 0.01778116756000779, 0.25991050095380475, 0.2023262760422669, 0.14942088632455244, -0.2528969328194647, -0.17228285018780964, 0.10113389561053349, 0.12823682146566645, 0.012415188724246694, 0.004238720020995817, -0.3424244409956108, 0.03472323084092686, -0.18241945261183795, -0.1671662580204402, 0.0257478351508018, 0.11528126292472854, 0.033302031682603095, -0.2423711802172059, 0.10483033642579447, -0.015050583022363492, 0.16347283715854438, -0.13834017359087586, -0.09537480406882898, -0.053168587178372265, 0.10542981776172741, 0.012082916747848612, 0.12877371363402476, 0.0947350966787849, -0.0716479300497266, -0.06072787839226302, 0.42131700445438774, -0.12393792081753255, 0.015589276746247716, 0.1210752715894454, -0.20845580019905044, -0.17085385272178816, 0.113767144030852, 0.2031108185871911, 0.11834632252570364, -0.23452528221576427, -0.043187086203844975, 0.05932105226363515, 0.2800425710987317, 0.05203020486635256, 0.06190714386768394, 0.3385949550904858, 0.13217690615027164, 0.08313561600591701, 0.06310364287679998, -0.390239894011893, 0.022814729318193252, -0.2576753597907687, -0.07899810434033507, -0.16271163395413596, 0.09957527162746566, -0.1276619037797187, -0.07528761833329016, 0.3117882637307048, 0.17718073676729426, 0.178119571663072, 0.07065529293561586, 0.36334306474320344, 0.023229095894701783, 0.13681155129707065, 0.013467153975906226, 0.36869327469943136, 0.11073459452018142, 0.0985348679501336, -0.23005780653083618, 0.02792957852957464, -0.006884472709184101] |
1,803.09185 | Slim cyclotomic q-Schur algebras | We construct a new basis for a slim cyclotomic $q$-Schur algebra $\cysSr$ via
symmetric polynomials in Jucys--Murphy operators of the cyclotomic Hecke
algebra $\cysHr$. We show that this basis, labelled by matrices, is not the
double coset basis when $\cysHr$ is the Hecke algebra of a Coxeter group, but
coincides with the double coset basis for the corresponding group algebra, the
Hecke algebra at $q=1$. As further applications, we then discuss the cyclotomic
Schur--Weyl duality at the integral level. This also includes a category
equivalence and a classification of simple objects.
| math.RT math.QA math.RA | we construct a new basis for a slim cyclotomic qschur algebra cyssr via symmetric polynomials in jucysmurphy operators of the cyclotomic hecke algebra cyshr we show that this basis labelled by matrices is not the double coset basis when cyshr is the hecke algebra of a coxeter group but coincides with the double coset basis for the corresponding group algebra the hecke algebra at q1 as further applications we then discuss the cyclotomic schurweyl duality at the integral level this also includes a category equivalence and a classification of simple objects | [['we', 'construct', 'a', 'new', 'basis', 'for', 'a', 'slim', 'cyclotomic', 'qschur', 'algebra', 'cyssr', 'via', 'symmetric', 'polynomials', 'in', 'jucysmurphy', 'operators', 'of', 'the', 'cyclotomic', 'hecke', 'algebra', 'cyshr', 'we', 'show', 'that', 'this', 'basis', 'labelled', 'by', 'matrices', 'is', 'not', 'the', 'double', 'coset', 'basis', 'when', 'cyshr', 'is', 'the', 'hecke', 'algebra', 'of', 'a', 'coxeter', 'group', 'but', 'coincides', 'with', 'the', 'double', 'coset', 'basis', 'for', 'the', 'corresponding', 'group', 'algebra', 'the', 'hecke', 'algebra', 'at', 'q1', 'as', 'further', 'applications', 'we', 'then', 'discuss', 'the', 'cyclotomic', 'schurweyl', 'duality', 'at', 'the', 'integral', 'level', 'this', 'also', 'includes', 'a', 'category', 'equivalence', 'and', 'a', 'classification', 'of', 'simple', 'objects']] | [-0.15250941870511847, 0.08562461863965093, -0.08823451301379298, 0.07092258605619216, -0.1677323460383129, -0.14702614670386538, -0.006700383901426738, 0.3293556593125686, -0.3918088870334693, -0.13665713721738112, 0.1268400594986319, -0.20697587553877383, -0.18203908509828828, 0.18652100989129394, -0.14477839386877764, -0.05288823252141645, 0.08534139135140735, 0.16821638246024537, -0.17409152340736578, -0.2552686622260477, 0.43805831696160813, 0.04782338792839172, 0.2350433626085181, -0.040058216503397984, 0.09985863389010774, 0.04884149903558533, 0.017533058596944266, -0.1206574597321874, -0.0955510151812136, 0.1519752323034812, 0.35192245758265595, 0.06972896492913026, 0.1941766890509329, -0.33500465866580437, -0.02623086144078777, 0.17330854586113922, 0.21699046549805312, 0.02609587867151607, -0.06005659290928055, -0.25991842142221605, 0.04327326338865201, -0.31135501636361534, -0.1385462538455613, -0.07102852997856891, 0.06617262839890001, -0.0164287815886465, -0.3248848154643466, -0.019257040157588726, 0.04764277653091333, 0.2078600930134681, -0.08073656053271737, -0.13718342985322868, -0.0675773226275024, 0.03311251952023171, -0.11819057721665806, -0.018296729089012264, 0.10306421215963465, -0.09116225436181677, -0.19750960774994877, 0.35408566684716125, -0.0016599478655156088, -0.21954188324426385, 0.08147306563544342, -0.2370268277220682, -0.2228287527528168, 0.05944123858882284, 0.04446117431772026, 0.1084153429467485, -0.026887815634340353, 0.2427909392221905, -0.2049717557066205, 0.030602456974024375, 0.08426820240195164, -0.031389599269128994, 0.1697276407609355, 0.05706646471993405, -0.009216834161303599, 0.188747756738766, 0.06085236013380133, 0.000763131750070236, -0.40853238304738293, -0.22758388287514786, -0.11606363606088879, 0.0649221462003466, -0.15476984369276828, -0.18326646075795658, 0.4229509869103574, 0.10068560751493681, 0.1310894800752232, 0.16062611871695315, 0.1489364926343445, 0.13562425231397024, 0.20207455651622944, 0.01403916838832877, 0.0960029261133803, 0.28987858942789235, -0.05699808565920896, -0.14573979667197404, -0.11835490117929029, 0.31093481344446033] |
1,803.09186 | Finite-Data Performance Guarantees for the Output-Feedback Control of an
Unknown System | As the systems we control become more complex, first-principle modeling
becomes either impossible or intractable, motivating the use of machine
learning techniques for the control of systems with continuous action spaces.
As impressive as the empirical success of these methods have been, strong
theoretical guarantees of performance, safety, or robustness are few and far
between. This paper takes a step towards such providing such guarantees by
establishing finite-data performance guarantees for the robust output-feedback
control of an unknown FIR SISO system. In particular, we introduce the
"Coarse-ID control" pipeline, which is composed of a system identification step
followed by a robust controller synthesis procedure, and analyze its end-to-end
performance, providing quantitative bounds on the performance degradation
suffered due to model uncertainty as a function of the number of experiments
run to identify the system. We conclude with numerical examples demonstrating
the effectiveness of our method.
| math.OC cs.LG | as the systems we control become more complex firstprinciple modeling becomes either impossible or intractable motivating the use of machine learning techniques for the control of systems with continuous action spaces as impressive as the empirical success of these methods have been strong theoretical guarantees of performance safety or robustness are few and far between this paper takes a step towards such providing such guarantees by establishing finitedata performance guarantees for the robust outputfeedback control of an unknown fir siso system in particular we introduce the coarseid control pipeline which is composed of a system identification step followed by a robust controller synthesis procedure and analyze its endtoend performance providing quantitative bounds on the performance degradation suffered due to model uncertainty as a function of the number of experiments run to identify the system we conclude with numerical examples demonstrating the effectiveness of our method | [['as', 'the', 'systems', 'we', 'control', 'become', 'more', 'complex', 'firstprinciple', 'modeling', 'becomes', 'either', 'impossible', 'or', 'intractable', 'motivating', 'the', 'use', 'of', 'machine', 'learning', 'techniques', 'for', 'the', 'control', 'of', 'systems', 'with', 'continuous', 'action', 'spaces', 'as', 'impressive', 'as', 'the', 'empirical', 'success', 'of', 'these', 'methods', 'have', 'been', 'strong', 'theoretical', 'guarantees', 'of', 'performance', 'safety', 'or', 'robustness', 'are', 'few', 'and', 'far', 'between', 'this', 'paper', 'takes', 'a', 'step', 'towards', 'such', 'providing', 'such', 'guarantees', 'by', 'establishing', 'finitedata', 'performance', 'guarantees', 'for', 'the', 'robust', 'outputfeedback', 'control', 'of', 'an', 'unknown', 'fir', 'siso', 'system', 'in', 'particular', 'we', 'introduce', 'the', 'coarseid', 'control', 'pipeline', 'which', 'is', 'composed', 'of', 'a', 'system', 'identification', 'step', 'followed', 'by', 'a', 'robust', 'controller', 'synthesis', 'procedure', 'and', 'analyze', 'its', 'endtoend', 'performance', 'providing', 'quantitative', 'bounds', 'on', 'the', 'performance', 'degradation', 'suffered', 'due', 'to', 'model', 'uncertainty', 'as', 'a', 'function', 'of', 'the', 'number', 'of', 'experiments', 'run', 'to', 'identify', 'the', 'system', 'we', 'conclude', 'with', 'numerical', 'examples', 'demonstrating', 'the', 'effectiveness', 'of', 'our', 'method']] | [-0.11451401947756651, -0.02620474344735628, -0.06824024763150975, 0.03073832342593834, -0.06251221709916818, -0.16660819001945443, 0.06963886447282958, 0.4136478333637632, -0.249897766357352, -0.34275446153920275, 0.15030522320403492, -0.23556878235319564, -0.17298648083855495, 0.2593565465191957, -0.11324589126538896, 0.16109093131521587, 0.08666945707598894, 0.0033953311451678644, -0.07346865001359376, -0.24992043366334563, 0.2813351608202632, 0.07188815517864865, 0.2853112211884481, 0.024100783740266644, 0.12014156574993555, -0.004573998894092852, -0.010603603939044064, 0.011957695042907165, -0.0636342770709046, 0.14568936349502926, 0.26022814703655656, 0.17638563778861585, 0.37049839690905706, -0.403610830278746, -0.2219105904729202, 0.09837913160565598, 0.1508678325271266, 0.10849312405856647, -0.09456713487974223, -0.2978490682961098, 0.09562574232976627, -0.18585055342329473, -0.09190796419801511, -0.14749671127165442, -0.04339873545706786, 0.001831636603536277, -0.292504277863893, 0.018584234635185066, 0.08735996047356005, 0.09817250646522332, -0.046201797103477195, -0.1035136913631818, 0.02135604920572248, 0.17534663720891394, 0.04563881703893301, 0.011331439737615915, 0.14159775126950236, -0.1435994430846567, -0.15518013326419067, 0.37176437574470866, -0.02653329349965949, -0.19839039966142896, 0.22630747383267716, -0.025305277319496562, -0.1406246287716103, 0.11966152657947407, 0.21444871444897404, 0.10211427179968048, -0.13637202083743338, 0.03839489114872212, 0.007134902557550833, 0.1803919800717769, -0.015924926755692938, 0.06643179248183452, 0.15451588450192377, 0.2849466015022762, 0.10356344824881646, 0.16278523261947878, -0.05515535461459437, -0.09682346660892704, -0.25575291373734843, -0.13104119248816679, -0.14116526477135205, -0.0007942718164674167, -0.05300671923243248, -0.16169760744167685, 0.36836097936370765, 0.18807756399800038, 0.1794898453104342, 0.13002431120739544, 0.3720172942327014, 0.11395111694883812, 0.029036596648651977, 0.053577698651572754, 0.26687843374795567, 0.08967263412597622, 0.07456872388559939, -0.23010998818108105, 0.12023919920019549, 0.024118788713781997] |
1,803.09187 | The Probability that Ideals in a Number Ring are k-wise Relatively
r-Prime | We say that n ideals of algebraic integers in a fixed number ring are k-wise
relatively r-prime if any k of them are relatively r-prime. In this article, we
provide an exact formula for the probability that n nonzero ideals of algebraic
integers in a fixed number ring are k-wise relatively r-prime.
| math.NT | we say that n ideals of algebraic integers in a fixed number ring are kwise relatively rprime if any k of them are relatively rprime in this article we provide an exact formula for the probability that n nonzero ideals of algebraic integers in a fixed number ring are kwise relatively rprime | [['we', 'say', 'that', 'n', 'ideals', 'of', 'algebraic', 'integers', 'in', 'a', 'fixed', 'number', 'ring', 'are', 'kwise', 'relatively', 'rprime', 'if', 'any', 'k', 'of', 'them', 'are', 'relatively', 'rprime', 'in', 'this', 'article', 'we', 'provide', 'an', 'exact', 'formula', 'for', 'the', 'probability', 'that', 'n', 'nonzero', 'ideals', 'of', 'algebraic', 'integers', 'in', 'a', 'fixed', 'number', 'ring', 'are', 'kwise', 'relatively', 'rprime']] | [-0.2942152366113777, 0.1634783610064075, -0.08498315576266927, 0.0481803480853649, -0.05341142327345621, -0.24097765263958046, 0.023429007591822974, 0.3656986292021779, -0.2831993695491782, -0.20331622527793605, 0.04219218615952951, -0.3024679899502259, -0.07170057813457859, 0.1666798136340311, -0.08648661968226616, -0.024982028694536824, 0.024585277589861877, 0.12197030528701501, -0.01910755180646307, -0.3660196202377287, 0.30660735461144495, -0.0689450200790396, 0.09526669011952785, -0.008217326580331875, 0.04594058024947746, -0.03375690716068046, 0.010768730103826294, 0.052098957947097145, -0.17692996358388113, 0.08231927597751984, 0.36722245468543124, 0.11445246289412563, 0.27686328677317273, -0.39658727403730154, -0.01830890402197838, 0.26392147623790574, 0.19180751125364062, 0.020821904082997486, -0.06342645474852851, -0.12167989947976401, 0.22688703009715447, -0.19777173108349627, -0.17662421746466023, -0.05868539244581301, 0.18249849025876477, 0.08478583612192708, -0.33741134729308003, -0.07054880513952902, 0.09924147786715856, 0.21133078573844755, 0.03395085150483423, -0.17326152109308168, 0.016590242847227134, 0.01736173307738052, -0.04338268004357815, 0.0251827501029206, 0.020380305878531475, -0.0665308424191048, -0.03132246506328766, 0.29994015166392696, -0.03552141640550242, -0.21587307256861374, 0.09237709058484492, -0.19743016267266983, -0.17741093928746593, 0.17308980856950468, 0.04579256593178098, 0.18521736327630395, -0.014750737231224775, 0.2454414011623997, -0.2346551249949978, 0.11620917117509705, 0.09623378950457734, 0.08826699500115445, 0.1875810869432126, -0.025104295319089524, 0.06127237116743345, 0.11512290955019686, 0.004108645634774943, 0.025645806364571817, -0.35803886961478454, -0.12451699208311486, -0.24504976413355997, 0.17851704903520071, -0.16760655905370817, -0.17623627096271285, 0.3156983215505114, 0.10040576732717454, 0.252237565528888, 0.1851213403726713, 0.2548803323163436, 0.04228366642760543, -0.02158662397414446, 0.12127748329658061, 0.03189310524612665, 0.18062675697728992, -0.09309269319503354, -0.09228167587067358, 0.012457425518033024, 0.13650229569667807] |
1,803.09188 | Parareal exponential $\theta$-scheme for longtime simulation of
stochastic Schr\"odinger equations with weak damping | A parareal algorithm based on an exponential $\theta$-scheme is proposed for
the stochastic Schr\"odinger equation with weak damping and additive noise. It
proceeds as a two-level temporal parallelizable integrator with the exponential
$\theta$-scheme as the propagator on the coarse grid. The proposed algorithm in
the linear case increases the convergence order from one to $k$ for
$\theta\in[0,1]\setminus\{\frac12\}$. In particular, the convergence order
increases to $2k$ when $\theta=\frac12$ due to the symmetry of the algorithm.
Furthermore, the algorithm is proved to be suitable for longtime simulation
based on the analysis of the invariant distributions for the exponential
$\theta$-scheme. The convergence condition for longtime simulation is also
established for the proposed algorithm in the nonlinear case, which indicates
the superiority of implicit schemes. Numerical experiments are dedicated to
illustrate the best choice of the iteration number $k$, as well as the
convergence order of the algorithm for different choices of $\theta$.
| math.NA | a parareal algorithm based on an exponential thetascheme is proposed for the stochastic schrodinger equation with weak damping and additive noise it proceeds as a twolevel temporal parallelizable integrator with the exponential thetascheme as the propagator on the coarse grid the proposed algorithm in the linear case increases the convergence order from one to k for thetain01setminusfrac12 in particular the convergence order increases to 2k when thetafrac12 due to the symmetry of the algorithm furthermore the algorithm is proved to be suitable for longtime simulation based on the analysis of the invariant distributions for the exponential thetascheme the convergence condition for longtime simulation is also established for the proposed algorithm in the nonlinear case which indicates the superiority of implicit schemes numerical experiments are dedicated to illustrate the best choice of the iteration number k as well as the convergence order of the algorithm for different choices of theta | [['a', 'parareal', 'algorithm', 'based', 'on', 'an', 'exponential', 'thetascheme', 'is', 'proposed', 'for', 'the', 'stochastic', 'schrodinger', 'equation', 'with', 'weak', 'damping', 'and', 'additive', 'noise', 'it', 'proceeds', 'as', 'a', 'twolevel', 'temporal', 'parallelizable', 'integrator', 'with', 'the', 'exponential', 'thetascheme', 'as', 'the', 'propagator', 'on', 'the', 'coarse', 'grid', 'the', 'proposed', 'algorithm', 'in', 'the', 'linear', 'case', 'increases', 'the', 'convergence', 'order', 'from', 'one', 'to', 'k', 'for', 'thetain01setminusfrac12', 'in', 'particular', 'the', 'convergence', 'order', 'increases', 'to', '2k', 'when', 'thetafrac12', 'due', 'to', 'the', 'symmetry', 'of', 'the', 'algorithm', 'furthermore', 'the', 'algorithm', 'is', 'proved', 'to', 'be', 'suitable', 'for', 'longtime', 'simulation', 'based', 'on', 'the', 'analysis', 'of', 'the', 'invariant', 'distributions', 'for', 'the', 'exponential', 'thetascheme', 'the', 'convergence', 'condition', 'for', 'longtime', 'simulation', 'is', 'also', 'established', 'for', 'the', 'proposed', 'algorithm', 'in', 'the', 'nonlinear', 'case', 'which', 'indicates', 'the', 'superiority', 'of', 'implicit', 'schemes', 'numerical', 'experiments', 'are', 'dedicated', 'to', 'illustrate', 'the', 'best', 'choice', 'of', 'the', 'iteration', 'number', 'k', 'as', 'well', 'as', 'the', 'convergence', 'order', 'of', 'the', 'algorithm', 'for', 'different', 'choices', 'of', 'theta']] | [-0.09232245468642233, 0.024250113871839486, -0.10370419667336811, 0.059979943413648526, -0.05049204091433765, -0.13255675669544104, 0.018339054883920215, 0.3580461736945879, -0.2717445985775213, -0.29168240468138135, 0.1220733934508947, -0.22134821140999292, -0.1503396543300375, 0.2301887465457964, -0.016391766783432897, 0.135842053501607, 0.05119990413615696, 0.05658930628148674, -0.06703918496286179, -0.29947204974346925, 0.284480526715479, 0.09325165172950142, 0.2777256840193758, 0.016086300321835643, 0.1428865447678432, -0.015430202181799477, -0.00837057868817023, -0.00208594741895288, -0.10298546807853137, 0.06150318266741526, 0.188469760978379, 0.08458482962716245, 0.31880611637100376, -0.3665710495417418, -0.16470242158009285, 0.08322967896808167, 0.17088157358895323, 0.10420108259874111, -0.028832934612287905, -0.2789028541463725, 0.12333965484927199, -0.12208208375844826, -0.12362782371730931, -0.10832698893460894, -0.02395965468746667, 0.07867433737051122, -0.3524009321759246, 0.07434796366732105, 0.08533239786728558, 0.01855738792048932, -0.03543011142181701, -0.10620100177875182, 0.007988511063601999, 0.0735852571869931, 0.07805844475705252, 0.011005190395129224, 0.06559738771876893, -0.07296135779913693, -0.11248272099234417, 0.3722682133646441, -0.0965531660254956, -0.233865948835844, 0.15659175592404947, -0.09385548118932717, -0.11749974915759359, 0.15497146018774433, 0.16661615594354345, 0.15601899752988904, -0.07094047033454871, 0.1157906459843214, -0.02952611941145733, 0.15552662004444268, 0.04715926601982289, 0.004616692982183225, 0.02808690258954354, 0.19849882038867697, 0.14924921783726333, 0.15187731450764133, -0.0581453035951459, -0.1608559697823675, -0.31659694170566643, -0.15318686114449917, -0.21092077835342612, 0.0020609171530485255, -0.1496133064821665, -0.15993479669702296, 0.38581608188953126, 0.15528607490586535, 0.16241187796148718, 0.1226601823475402, 0.3341126667500353, 0.16163074549209946, 0.003908701773200717, 0.09248476235484458, 0.18276456624054077, 0.1441191305561513, 0.10836138576902703, -0.2984530970368686, 0.08371380351319098, 0.1252545760817775] |
1,803.09189 | Scene Graph Parsing as Dependency Parsing | In this paper, we study the problem of parsing structured knowledge graphs
from textual descriptions. In particular, we consider the scene graph
representation that considers objects together with their attributes and
relations: this representation has been proved useful across a variety of
vision and language applications. We begin by introducing an alternative but
equivalent edge-centric view of scene graphs that connect to dependency parses.
Together with a careful redesign of label and action space, we combine the
two-stage pipeline used in prior work (generic dependency parsing followed by
simple post-processing) into one, enabling end-to-end training. The scene
graphs generated by our learned neural dependency parser achieve an F-score
similarity of 49.67% to ground truth graphs on our evaluation set, surpassing
best previous approaches by 5%. We further demonstrate the effectiveness of our
learned parser on image retrieval applications.
| cs.CL cs.CV | in this paper we study the problem of parsing structured knowledge graphs from textual descriptions in particular we consider the scene graph representation that considers objects together with their attributes and relations this representation has been proved useful across a variety of vision and language applications we begin by introducing an alternative but equivalent edgecentric view of scene graphs that connect to dependency parses together with a careful redesign of label and action space we combine the twostage pipeline used in prior work generic dependency parsing followed by simple postprocessing into one enabling endtoend training the scene graphs generated by our learned neural dependency parser achieve an fscore similarity of 4967 to ground truth graphs on our evaluation set surpassing best previous approaches by 5 we further demonstrate the effectiveness of our learned parser on image retrieval applications | [['in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'parsing', 'structured', 'knowledge', 'graphs', 'from', 'textual', 'descriptions', 'in', 'particular', 'we', 'consider', 'the', 'scene', 'graph', 'representation', 'that', 'considers', 'objects', 'together', 'with', 'their', 'attributes', 'and', 'relations', 'this', 'representation', 'has', 'been', 'proved', 'useful', 'across', 'a', 'variety', 'of', 'vision', 'and', 'language', 'applications', 'we', 'begin', 'by', 'introducing', 'an', 'alternative', 'but', 'equivalent', 'edgecentric', 'view', 'of', 'scene', 'graphs', 'that', 'connect', 'to', 'dependency', 'parses', 'together', 'with', 'a', 'careful', 'redesign', 'of', 'label', 'and', 'action', 'space', 'we', 'combine', 'the', 'twostage', 'pipeline', 'used', 'in', 'prior', 'work', 'generic', 'dependency', 'parsing', 'followed', 'by', 'simple', 'postprocessing', 'into', 'one', 'enabling', 'endtoend', 'training', 'the', 'scene', 'graphs', 'generated', 'by', 'our', 'learned', 'neural', 'dependency', 'parser', 'achieve', 'an', 'fscore', 'similarity', 'of', '4967', 'to', 'ground', 'truth', 'graphs', 'on', 'our', 'evaluation', 'set', 'surpassing', 'best', 'previous', 'approaches', 'by', '5', 'we', 'further', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'learned', 'parser', 'on', 'image', 'retrieval', 'applications']] | [-0.029612769529668858, -0.02211762145916641, -0.05362350799386268, 0.0415611160038363, -0.16636666035755415, -0.10948365781645196, 0.05740662594831994, 0.48217336977224634, -0.2761999259110662, -0.37164146332002745, 0.016549418333654656, -0.2677645664493405, -0.17518828744979817, 0.1816957078172245, -0.1723252725703102, 0.07744362700622583, 0.18301909616001058, 0.06316923926098515, -0.07419748941395918, -0.273946967422397, 0.3393828410645137, 0.013970066533437457, 0.317873214830415, 0.00674371215838777, 0.15559773214593314, 0.012615961012551967, -0.07515342908479489, 0.014360602340868512, -0.08845826646912441, 0.2130472242108384, 0.33591069262879697, 0.24454505057107873, 0.2601580594183769, -0.41317278571912774, -0.23072927960775036, 0.06516753822781038, 0.13557479219784052, 0.11116176074289758, -0.014516876602589247, -0.3787245679160823, 0.0854506324723606, -0.1745335852754289, 0.06442333707599428, -0.1359332362898504, -0.019586207790543205, -0.04767544918011982, -0.24718365738542913, -0.04043220277652954, 0.1566221913068886, 0.11207793148207491, -0.03641274663369995, -0.10780014363589926, 0.037916241902048176, 0.182934974718407, -0.018517157364049523, 0.08279514630777303, 0.0920932689745762, -0.17809714781005692, -0.18009257227337608, 0.3703153677068759, -0.05781961216226868, -0.20030721357139503, 0.16375879150396888, 0.0037143619467868753, -0.19061923365486597, 0.07442856870213713, 0.21303820925717498, 0.11876806605310328, -0.16100997549643659, 0.05054318730970777, -0.061181146374809134, 0.19330360844015967, 0.1065755735853336, -0.023753088612980006, 0.17184058938553368, 0.2666648287491441, 0.0331534347952465, 0.19185165176842955, -0.04515763783348265, -0.024771582686166832, -0.23195618419381586, -0.09648785339938341, -0.18821633774179802, -0.03122281416511649, -0.14596519334736513, -0.13475845674849182, 0.417577714379202, 0.270780090485578, 0.2114246845940479, 0.13866213244277195, 0.31785073306789435, 0.0018917722156165046, 0.0777012998106606, 0.08989414496202211, 0.12878805941368954, 0.02770263206659128, 0.11990819444063296, -0.13541797434310496, 0.10308451293562741, 0.10678046315476514] |
1,803.0919 | Bayesian Optimal Data Detector for Hybrid mmWave MIMO-OFDM Systems with
Low-Resolution ADCs | Hybrid analog-digital precoding architectures and low-resolution
analog-to-digital converter (ADC) receivers are two solutions to reduce
hardware cost and power consumption for millimeter wave (mmWave) multiple-input
multiple-output (MIMO) communication systems with large antenna arrays. In this
study, we consider a mmWave MIMO-OFDM receiver with a generalized hybrid
architecture in which a small number of radio-frequency (RF) chains and
low-resolution ADCs are employed simultaneously. Owing to the strong
nonlinearity introduced by low-resolution ADCs, the task of data detection is
challenging, particularly achieving a Bayesian optimal data detector. This
study aims to fill this gap. By using generalized expectation consistent signal
recovery technique, we propose a computationally efficient data detection
algorithm that provides a minimum mean-square error estimate on data symbols
and is extended to a mixed-ADC architecture. Considering particular structure
of MIMO-OFDM channel matirx, we provide a lowcomplexity realization in which
only FFT operation and matrixvector multiplications are required. Furthermore,
we present an analytical framework to study the theoretical performance of the
detector in the large-system limit, which can precisely evaluate the
performance expressions such as mean-square error and symbol error rate. Based
on this optimal detector, the potential of adding a few low-resolution RF
chains and high-resolution ADCs for mixed-ADC architecture is investigated.
Simulation results confirm the accuracy of our theoretical analysis and can be
used for system design rapidly. The results reveal that adding a few
low-resolution RF chains to original unquantized systems can obtain significant
gains.
| cs.IT math.IT | hybrid analogdigital precoding architectures and lowresolution analogtodigital converter adc receivers are two solutions to reduce hardware cost and power consumption for millimeter wave mmwave multipleinput multipleoutput mimo communication systems with large antenna arrays in this study we consider a mmwave mimoofdm receiver with a generalized hybrid architecture in which a small number of radiofrequency rf chains and lowresolution adcs are employed simultaneously owing to the strong nonlinearity introduced by lowresolution adcs the task of data detection is challenging particularly achieving a bayesian optimal data detector this study aims to fill this gap by using generalized expectation consistent signal recovery technique we propose a computationally efficient data detection algorithm that provides a minimum meansquare error estimate on data symbols and is extended to a mixedadc architecture considering particular structure of mimoofdm channel matirx we provide a lowcomplexity realization in which only fft operation and matrixvector multiplications are required furthermore we present an analytical framework to study the theoretical performance of the detector in the largesystem limit which can precisely evaluate the performance expressions such as meansquare error and symbol error rate based on this optimal detector the potential of adding a few lowresolution rf chains and highresolution adcs for mixedadc architecture is investigated simulation results confirm the accuracy of our theoretical analysis and can be used for system design rapidly the results reveal that adding a few lowresolution rf chains to original unquantized systems can obtain significant gains | [['hybrid', 'analogdigital', 'precoding', 'architectures', 'and', 'lowresolution', 'analogtodigital', 'converter', 'adc', 'receivers', 'are', 'two', 'solutions', 'to', 'reduce', 'hardware', 'cost', 'and', 'power', 'consumption', 'for', 'millimeter', 'wave', 'mmwave', 'multipleinput', 'multipleoutput', 'mimo', 'communication', 'systems', 'with', 'large', 'antenna', 'arrays', 'in', 'this', 'study', 'we', 'consider', 'a', 'mmwave', 'mimoofdm', 'receiver', 'with', 'a', 'generalized', 'hybrid', 'architecture', 'in', 'which', 'a', 'small', 'number', 'of', 'radiofrequency', 'rf', 'chains', 'and', 'lowresolution', 'adcs', 'are', 'employed', 'simultaneously', 'owing', 'to', 'the', 'strong', 'nonlinearity', 'introduced', 'by', 'lowresolution', 'adcs', 'the', 'task', 'of', 'data', 'detection', 'is', 'challenging', 'particularly', 'achieving', 'a', 'bayesian', 'optimal', 'data', 'detector', 'this', 'study', 'aims', 'to', 'fill', 'this', 'gap', 'by', 'using', 'generalized', 'expectation', 'consistent', 'signal', 'recovery', 'technique', 'we', 'propose', 'a', 'computationally', 'efficient', 'data', 'detection', 'algorithm', 'that', 'provides', 'a', 'minimum', 'meansquare', 'error', 'estimate', 'on', 'data', 'symbols', 'and', 'is', 'extended', 'to', 'a', 'mixedadc', 'architecture', 'considering', 'particular', 'structure', 'of', 'mimoofdm', 'channel', 'matirx', 'we', 'provide', 'a', 'lowcomplexity', 'realization', 'in', 'which', 'only', 'fft', 'operation', 'and', 'matrixvector', 'multiplications', 'are', 'required', 'furthermore', 'we', 'present', 'an', 'analytical', 'framework', 'to', 'study', 'the', 'theoretical', 'performance', 'of', 'the', 'detector', 'in', 'the', 'largesystem', 'limit', 'which', 'can', 'precisely', 'evaluate', 'the', 'performance', 'expressions', 'such', 'as', 'meansquare', 'error', 'and', 'symbol', 'error', 'rate', 'based', 'on', 'this', 'optimal', 'detector', 'the', 'potential', 'of', 'adding', 'a', 'few', 'lowresolution', 'rf', 'chains', 'and', 'highresolution', 'adcs', 'for', 'mixedadc', 'architecture', 'is', 'investigated', 'simulation', 'results', 'confirm', 'the', 'accuracy', 'of', 'our', 'theoretical', 'analysis', 'and', 'can', 'be', 'used', 'for', 'system', 'design', 'rapidly', 'the', 'results', 'reveal', 'that', 'adding', 'a', 'few', 'lowresolution', 'rf', 'chains', 'to', 'original', 'unquantized', 'systems', 'can', 'obtain', 'significant', 'gains']] | [-0.2301539440513036, -0.0033035803994068175, -0.0036376468902374853, 0.009851314562276179, -0.07737402232083634, -0.24418367210665118, 0.07868311848487484, 0.4093633044927413, -0.2137421284081075, -0.30103278995523136, 0.1282260994682428, -0.23633469999728376, -0.19594120234571658, 0.1908083584236565, -0.1228438969622603, 0.1320121184243501, 0.14160753005594648, -0.02106907245517073, -0.08726152325501879, -0.22238796560835045, 0.2160579405401407, 0.16404495356205884, 0.3433737061933567, -0.047470055145637714, 0.11745004783684419, -0.02929141486193827, -0.0021082332192020395, -0.07291633342945222, -0.09851084260810887, 0.1135268013794133, 0.3529162906964657, 0.16268163937996377, 0.2663995723123662, -0.4302053983815081, -0.23045694959740612, 0.06593115208522511, 0.18184582106039024, 0.09164249285280121, -0.08466173513591195, -0.26718438141268946, 0.1507848549675654, -0.2424142797935312, -0.013534325828097002, -0.052621079978761975, -0.10541122399617807, 0.05600319743188404, -0.35503982221120695, 0.023352023482448973, 0.015712970205764207, 0.050278305216494824, -0.02612931261695448, -0.15185792249049282, 0.08298264371164112, 0.08166154902684897, -0.03419584896804181, -0.011895721690222164, 0.069785857510751, -0.08022415542146226, -0.06906626319070741, 0.31939928517755817, -0.04729620174611366, -0.2520250934097221, 0.14567382964705142, -0.09127158942529774, -0.10172738749099801, 0.16714686589804872, 0.27207170523726776, 0.06280951824639056, -0.20717491700054516, 0.03523235257529512, 0.02138110833895892, 0.2308705954070566, 0.056458437899906996, 0.12959672903279001, 0.14983866806832633, 0.2407914082619847, 0.09213695229796724, 0.1752648574889093, -0.1962187319024174, -0.0454871911295074, -0.20765578466214998, -0.12461683249458182, -0.23597214863856592, 0.008513794447010743, -0.07857568138742708, -0.08293453428176058, 0.36404845373847095, 0.18387508297228586, 0.12069478328734384, 0.1345428178334506, 0.43137935627058493, 0.12566262425191826, 0.08694815484415226, 0.08322557083393202, 0.21298248810156928, 0.13867658009492176, 0.12875749682415655, -0.22255913301280272, -0.025909348754547694, -0.0030130391873387716] |
1,803.09191 | Phase transition in the recoverability of network history | Network growth processes can be understood as generative models of the
structure and history of complex networks. This point of view naturally leads
to the problem of network archaeology: reconstructing all the past states of a
network from its structure---a difficult permutation inference problem. In this
paper, we introduce a Bayesian formulation of network archaeology, with a
generalization of preferential attachment as our generative mechanism. We
develop a sequential Monte Carlo algorithm to evaluate the posterior averages
of this model, as well as an efficient heuristic that uncovers a history well
correlated with the true one, in polynomial time. We use these methods to
identify and characterize a phase transition in the quality of the
reconstructed history, when they are applied to artificial networks generated
by the model itself. Despite the existence of a no-recovery phase, we find that
nontrivial inference is possible in a large portion of the parameter space as
well as on empirical data.
| physics.soc-ph cond-mat.stat-mech stat.ML | network growth processes can be understood as generative models of the structure and history of complex networks this point of view naturally leads to the problem of network archaeology reconstructing all the past states of a network from its structurea difficult permutation inference problem in this paper we introduce a bayesian formulation of network archaeology with a generalization of preferential attachment as our generative mechanism we develop a sequential monte carlo algorithm to evaluate the posterior averages of this model as well as an efficient heuristic that uncovers a history well correlated with the true one in polynomial time we use these methods to identify and characterize a phase transition in the quality of the reconstructed history when they are applied to artificial networks generated by the model itself despite the existence of a norecovery phase we find that nontrivial inference is possible in a large portion of the parameter space as well as on empirical data | [['network', 'growth', 'processes', 'can', 'be', 'understood', 'as', 'generative', 'models', 'of', 'the', 'structure', 'and', 'history', 'of', 'complex', 'networks', 'this', 'point', 'of', 'view', 'naturally', 'leads', 'to', 'the', 'problem', 'of', 'network', 'archaeology', 'reconstructing', 'all', 'the', 'past', 'states', 'of', 'a', 'network', 'from', 'its', 'structurea', 'difficult', 'permutation', 'inference', 'problem', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'bayesian', 'formulation', 'of', 'network', 'archaeology', 'with', 'a', 'generalization', 'of', 'preferential', 'attachment', 'as', 'our', 'generative', 'mechanism', 'we', 'develop', 'a', 'sequential', 'monte', 'carlo', 'algorithm', 'to', 'evaluate', 'the', 'posterior', 'averages', 'of', 'this', 'model', 'as', 'well', 'as', 'an', 'efficient', 'heuristic', 'that', 'uncovers', 'a', 'history', 'well', 'correlated', 'with', 'the', 'true', 'one', 'in', 'polynomial', 'time', 'we', 'use', 'these', 'methods', 'to', 'identify', 'and', 'characterize', 'a', 'phase', 'transition', 'in', 'the', 'quality', 'of', 'the', 'reconstructed', 'history', 'when', 'they', 'are', 'applied', 'to', 'artificial', 'networks', 'generated', 'by', 'the', 'model', 'itself', 'despite', 'the', 'existence', 'of', 'a', 'norecovery', 'phase', 'we', 'find', 'that', 'nontrivial', 'inference', 'is', 'possible', 'in', 'a', 'large', 'portion', 'of', 'the', 'parameter', 'space', 'as', 'well', 'as', 'on', 'empirical', 'data']] | [-0.06985812132748273, 0.05146143572990415, -0.09453499071204509, 0.10399870728948511, -0.07448410164588729, -0.07992121287418577, 0.07269797715633057, 0.3980380297945932, -0.3359854667184827, -0.32790012658537865, 0.09167099758409537, -0.21418792066367295, -0.21759412612598866, 0.15490896783385558, -0.06380633531639782, 0.04699917605037813, 0.0728542292669702, 0.02190451056827815, -0.0483266779199953, -0.23290648726292718, 0.30653007419851536, 0.08185549127534987, 0.2712750211910297, -0.008961625588245882, 0.1174593302294409, -0.009055428308410904, -0.015850089815779567, 0.03271042038548517, -0.10342545721440007, 0.12266809166407583, 0.25964363991949, 0.19962049185787925, 0.3007762135552744, -0.42433543268065804, -0.25310286549696076, 0.13735845635603303, 0.15298132016622007, 0.13783614540574116, -0.03288361766056205, -0.267735944989209, 0.05883902116254784, -0.1840937678875306, -0.08796096588216293, -0.09965217312594923, -0.03846938415275266, 0.0019764225125515787, -0.2678950743937047, 0.07892788257091664, 0.04539458418656021, 0.03009842827556825, -0.02774576857038296, -0.08266409731601389, -0.02272377742860371, 0.1452623712585848, 0.040249414392000735, 0.06207759795674624, 0.10090001349229939, -0.15852236776206552, -0.16748183503603706, 0.38022473858048517, -0.061827344061711274, -0.1836198734340425, 0.1850153057394215, -0.09072087895877373, -0.16339365770750774, 0.08705902958097748, 0.22411815236615112, 0.15269812691706017, -0.15199112264636847, 0.06003368387330109, -0.05902837397223219, 0.12393255850680035, -0.026536042837109655, -0.006175561682679332, 0.19953765977735224, 0.23660534527600527, 0.05947246726673956, 0.16706721147280545, -0.09882220610803089, -0.1320172122695322, -0.2601399703297573, -0.13533776503269715, -0.20571062971243803, 0.04282063848521107, -0.09781209979887652, -0.2280832741719981, 0.4163202016736763, 0.1943995341216811, 0.25984210813215053, 0.08346630601833264, 0.297987719045546, 0.05931622875803628, 0.05820199454692789, 0.041080209029575765, 0.18516061375013146, 0.11071932382839851, 0.09189567367026868, -0.16429150095194553, 0.14766690101271543, 0.034744001186202064] |
1,803.09192 | The Shifted-inverse Power Weak Galerkin Method for Eigenvalue Problems | This paper proposes and analyzes a new weak Galerkin method for the
eigenvalue problem by using the shifted-inverse power technique. A high order
lower bound can be obtained at a relatively low cost via the proposed method.
The error estimates for both eigenvalue and eigenfunction are provided and
asymptotic lower bounds are shown as well under some conditions. Numerical
examples are presented to validate the theoretical analysis.
| math.NA | this paper proposes and analyzes a new weak galerkin method for the eigenvalue problem by using the shiftedinverse power technique a high order lower bound can be obtained at a relatively low cost via the proposed method the error estimates for both eigenvalue and eigenfunction are provided and asymptotic lower bounds are shown as well under some conditions numerical examples are presented to validate the theoretical analysis | [['this', 'paper', 'proposes', 'and', 'analyzes', 'a', 'new', 'weak', 'galerkin', 'method', 'for', 'the', 'eigenvalue', 'problem', 'by', 'using', 'the', 'shiftedinverse', 'power', 'technique', 'a', 'high', 'order', 'lower', 'bound', 'can', 'be', 'obtained', 'at', 'a', 'relatively', 'low', 'cost', 'via', 'the', 'proposed', 'method', 'the', 'error', 'estimates', 'for', 'both', 'eigenvalue', 'and', 'eigenfunction', 'are', 'provided', 'and', 'asymptotic', 'lower', 'bounds', 'are', 'shown', 'as', 'well', 'under', 'some', 'conditions', 'numerical', 'examples', 'are', 'presented', 'to', 'validate', 'the', 'theoretical', 'analysis']] | [-0.0791976694846667, 0.024738060423370564, -0.09143731485572502, 0.0897854531208533, -0.054789619760192705, -0.13877105150569344, 0.06016708377247789, 0.34575171384847525, -0.22717578892567844, -0.3423063153767902, 0.2020223903554407, -0.2538511742922393, -0.16933727010407232, 0.2808827371054301, -0.0691760358626418, 0.1572826863478192, 0.09816605961091365, 0.02614217545046951, -0.07189575039206608, -0.21773659110520827, 0.2747378118255063, 0.09071968847208402, 0.2988847507671876, 0.12545741334201232, 0.08347965182143856, -0.11479874950777175, -0.01744318570038586, 0.032517924763713825, -0.15408041425910074, 0.1551906320488673, 0.2503494453073169, 0.09359238453378732, 0.33019750857387076, -0.3941389252149472, -0.17767710059486103, 0.08759597195030162, 0.15727911420364046, 0.11167938030804649, -0.1026012846127604, -0.30489646869175363, 0.1864133176930023, -0.1568504903521953, -0.11997352903849925, -0.14612207377230693, -0.1027577719580608, 0.045513401005529995, -0.36100764995948836, 0.10394143672293109, 0.036525652336422354, 0.0438681317098213, -0.05905807840242756, -0.17843685971544773, 0.039109795237891376, 0.07782039526059772, 0.05964690158990296, -0.05387818061210441, 0.02075845928806247, -0.043849196528423236, -0.06252683442840917, 0.3424782610258483, -0.08790874388950849, -0.258055462530165, 0.16912402932278134, -0.11294927455795307, -0.09840112222556138, 0.1191546099655556, 0.1940174482085488, 0.15883284194790054, -0.14785205046505187, 0.08145262420337972, -0.003981056870102431, 0.10111817215202433, 0.03920368416319517, 0.03308552995352357, 0.08257529211484572, 0.15534301066884038, 0.1333563933713418, 0.16510456599908965, -0.07474257181765455, -0.04598521675462976, -0.3253794363770408, -0.10167454799485506, -0.24514538718556816, -0.05059534498088231, -0.1212306860192753, -0.10023874847287186, 0.38778360607102513, 0.11800853554582731, 0.18771989424854066, 0.14693196124933433, 0.3541983060651656, 0.21955774957843294, -0.035030909828051474, 0.1308508936851991, 0.22687308599856668, 0.1568479481837571, 0.06122532280895746, -0.20328422421307274, 0.0704935725044572, 0.15380504880467374] |
1,803.09193 | Optimal Spectrum Sensing Policy with Traffic Classification in
RF-Powered CRNs | An orthogonal frequency division multiple access (OFDMA)-based primary user
(PU) network is considered, which provides different spectral access/energy
harvesting opportunities in RF-powered cognitive radio networks (CRNs). In this
scenario, we propose an optimal spectrum sensing policy for opportunistic
spectrum access/energy harvesting under both the PU collision and energy
causality constraints. PU subchannels can have different traffic patterns and
exhibit distinct idle/busy frequencies, due to which the spectral access/energy
harvesting opportunities are application specific. Secondary user (SU) collects
traffic pattern information through observation of the PU subchannels and
classifies the idle/busy period statistics for each subchannel. Based on the
statistics, we invoke stochastic models for evaluating SU capacity by which the
energy detection threshold for spectrum sensing can be adjusted with higher
sensing accuracy. To this end, we employ the Markov decision process (MDP)
model obtained by quantizing the amount of SU battery and the duty cycle model
obtained by the ratio of average harvested energy and energy consumption rates.
We demonstrate the effectiveness of the proposed stochastic models through
comparison with the optimal one obtained from an exhaustive method.
| cs.IT math.IT | an orthogonal frequency division multiple access ofdmabased primary user pu network is considered which provides different spectral accessenergy harvesting opportunities in rfpowered cognitive radio networks crns in this scenario we propose an optimal spectrum sensing policy for opportunistic spectrum accessenergy harvesting under both the pu collision and energy causality constraints pu subchannels can have different traffic patterns and exhibit distinct idlebusy frequencies due to which the spectral accessenergy harvesting opportunities are application specific secondary user su collects traffic pattern information through observation of the pu subchannels and classifies the idlebusy period statistics for each subchannel based on the statistics we invoke stochastic models for evaluating su capacity by which the energy detection threshold for spectrum sensing can be adjusted with higher sensing accuracy to this end we employ the markov decision process mdp model obtained by quantizing the amount of su battery and the duty cycle model obtained by the ratio of average harvested energy and energy consumption rates we demonstrate the effectiveness of the proposed stochastic models through comparison with the optimal one obtained from an exhaustive method | [['an', 'orthogonal', 'frequency', 'division', 'multiple', 'access', 'ofdmabased', 'primary', 'user', 'pu', 'network', 'is', 'considered', 'which', 'provides', 'different', 'spectral', 'accessenergy', 'harvesting', 'opportunities', 'in', 'rfpowered', 'cognitive', 'radio', 'networks', 'crns', 'in', 'this', 'scenario', 'we', 'propose', 'an', 'optimal', 'spectrum', 'sensing', 'policy', 'for', 'opportunistic', 'spectrum', 'accessenergy', 'harvesting', 'under', 'both', 'the', 'pu', 'collision', 'and', 'energy', 'causality', 'constraints', 'pu', 'subchannels', 'can', 'have', 'different', 'traffic', 'patterns', 'and', 'exhibit', 'distinct', 'idlebusy', 'frequencies', 'due', 'to', 'which', 'the', 'spectral', 'accessenergy', 'harvesting', 'opportunities', 'are', 'application', 'specific', 'secondary', 'user', 'su', 'collects', 'traffic', 'pattern', 'information', 'through', 'observation', 'of', 'the', 'pu', 'subchannels', 'and', 'classifies', 'the', 'idlebusy', 'period', 'statistics', 'for', 'each', 'subchannel', 'based', 'on', 'the', 'statistics', 'we', 'invoke', 'stochastic', 'models', 'for', 'evaluating', 'su', 'capacity', 'by', 'which', 'the', 'energy', 'detection', 'threshold', 'for', 'spectrum', 'sensing', 'can', 'be', 'adjusted', 'with', 'higher', 'sensing', 'accuracy', 'to', 'this', 'end', 'we', 'employ', 'the', 'markov', 'decision', 'process', 'mdp', 'model', 'obtained', 'by', 'quantizing', 'the', 'amount', 'of', 'su', 'battery', 'and', 'the', 'duty', 'cycle', 'model', 'obtained', 'by', 'the', 'ratio', 'of', 'average', 'harvested', 'energy', 'and', 'energy', 'consumption', 'rates', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'stochastic', 'models', 'through', 'comparison', 'with', 'the', 'optimal', 'one', 'obtained', 'from', 'an', 'exhaustive', 'method']] | [-0.19503287372423866, 0.0632249893676379, -0.04371478099261499, 0.03467378008682627, -0.07746409370652374, -0.24527449160814285, 0.158702185481537, 0.4190874842656308, -0.29454652735880216, -0.31991046706381043, 0.057498547642663454, -0.2400056300996985, -0.15555549660494666, 0.14442958524346602, -0.11334705514333851, 0.04453152286502735, 0.07506042590700403, 0.07861785774311707, 0.01709729003428622, -0.21031499651713328, 0.2664799601712405, 0.17772597886164096, 0.39385420047058906, 0.004363733961301538, 0.06405494170128134, 0.05340433184886039, -0.03159464805145675, -0.09720702713821083, -0.07902636987224804, 0.09892815988583688, 0.3057550457038337, 0.20969042391061013, 0.2414296999282344, -0.4134475133647133, -0.31528105522251, 0.12607439014118935, 0.1383450163652543, 0.013303094299629788, -0.05366590292148771, -0.2606870271850835, 0.12048917627235219, -0.2398113835779898, 0.00011346031594293078, -0.00037693480477153256, -0.08985925798809062, 0.06169470884009946, -0.3359758799749962, 0.030570948893264817, -0.023602160958146583, 0.04170585567568684, -0.14476689006664983, -0.12528029308191307, -0.0024198223160340464, 0.17939731058035066, 0.045123808241843415, -0.08640229873822264, 0.11661655770344191, -0.08093816098007868, -0.14818135996650925, 0.33164987626730064, -0.013021763792656902, -0.1573676809788208, 0.17111833992039566, -0.05580245510430476, -0.11132476129699186, 0.18377123492140343, 0.22663049796835505, 0.07521314522792591, -0.21169511604905858, 0.03174332761974464, 0.04789830819269845, 0.14849100728888667, 0.07308491382113132, 0.09221463950933607, 0.17946915749028616, 0.168692249897087, 0.12143913546171269, 0.12012560159298358, -0.12114089069622647, -0.07939470585893486, -0.19072764656440142, -0.07817091880653668, -0.2043274733016473, 0.03935276109311605, -0.08157547521390289, -0.03169883685654768, 0.417951077646862, 0.10863669738623863, 0.1498276126719283, 0.09610395222660362, 0.3586924654436844, 0.1692858764735264, -0.0009144041579126969, 0.126236227164097, 0.17770508364592186, 0.06495173579971592, 0.18476746033086291, -0.2559287576525155, 0.05498618989215134, 0.0015680210134170576] |
1,803.09194 | A categorical approach to cyclic cohomology of quasi-Hopf algebras and
Hopf algebroids | We apply categorical machinery to the problem of defining cyclic cohomology
with coefficients in two particular cases, namely quasi-Hopf algebras and Hopf
algebroids. In the case of the former, no definition was thus far available in
the literature, and while a definition exists for the latter, we feel that our
approach demystifies the seemingly arbitrary formulas present there. This paper
emphasizes the importance of working with a biclosed monoidal category in order
to obtain natural coefficients for a cyclic theory that are analogous to the
stable anti-Yetter-Drinfeld contramodules for Hopf algebras.
| math.KT math.CT math.QA | we apply categorical machinery to the problem of defining cyclic cohomology with coefficients in two particular cases namely quasihopf algebras and hopf algebroids in the case of the former no definition was thus far available in the literature and while a definition exists for the latter we feel that our approach demystifies the seemingly arbitrary formulas present there this paper emphasizes the importance of working with a biclosed monoidal category in order to obtain natural coefficients for a cyclic theory that are analogous to the stable antiyetterdrinfeld contramodules for hopf algebras | [['we', 'apply', 'categorical', 'machinery', 'to', 'the', 'problem', 'of', 'defining', 'cyclic', 'cohomology', 'with', 'coefficients', 'in', 'two', 'particular', 'cases', 'namely', 'quasihopf', 'algebras', 'and', 'hopf', 'algebroids', 'in', 'the', 'case', 'of', 'the', 'former', 'no', 'definition', 'was', 'thus', 'far', 'available', 'in', 'the', 'literature', 'and', 'while', 'a', 'definition', 'exists', 'for', 'the', 'latter', 'we', 'feel', 'that', 'our', 'approach', 'demystifies', 'the', 'seemingly', 'arbitrary', 'formulas', 'present', 'there', 'this', 'paper', 'emphasizes', 'the', 'importance', 'of', 'working', 'with', 'a', 'biclosed', 'monoidal', 'category', 'in', 'order', 'to', 'obtain', 'natural', 'coefficients', 'for', 'a', 'cyclic', 'theory', 'that', 'are', 'analogous', 'to', 'the', 'stable', 'antiyetterdrinfeld', 'contramodules', 'for', 'hopf', 'algebras']] | [-0.14875592504484722, 0.060685594678743855, -0.06741504878788204, 0.0996225346736917, -0.13518719452914302, -0.15556286048696755, -0.0014881045828767858, 0.36115030352804034, -0.3248594910121308, -0.20918337873357173, 0.09725645967953644, -0.19702055373732485, -0.19614676530933478, 0.18852192433653298, -0.16331389726950035, -0.059014460747386074, 0.07038965074161252, 0.10979520709632518, -0.09678366622160915, -0.24034365456919748, 0.4022681672166992, 0.010691923117469792, 0.24100370597795348, 0.04155364254704462, 0.09460654298027793, 0.021587587263598874, -0.031065889746769444, 0.022197730193351323, -0.1876007225282892, 0.13101819037475143, 0.3536195774040707, 0.04827619501604484, 0.23549967032094782, -0.368075584685737, -0.11260537618955413, 0.15024322448912394, 0.11913046451121732, 0.1072851948997845, -0.04004970668804842, -0.23061711335769638, 0.1009256290067192, -0.22376405512965233, -0.10900106115246212, -0.09567815517436759, 0.07944517701372995, -0.04863495972317101, -0.2523055304517294, 0.02623716450122359, 0.13090900770955588, 0.12104714470454953, -0.10620160287266577, -0.08655618534392708, -0.027739228600134645, 0.11488066655123136, 0.008018209302163386, 0.0005843188142874738, 0.07584130374847778, -0.10615768369573814, -0.1588659796372547, 0.38064076735095664, -0.018092666139217235, -0.22484015996803294, 0.15834117636012918, -0.14273991843603634, -0.2087923247152223, 0.07300040832014529, 0.015234205288464552, 0.14269989257637453, -0.07154924063789812, 0.14954383653245742, -0.1136064425438315, 0.043972164003567384, 0.1189497396155455, 0.02179290498939476, 0.1357066964648746, 0.09374437513658879, 0.03302991628048143, 0.15609480834317874, 0.04282502569565243, -0.12738160272435908, -0.3392133509105706, -0.17642122817706768, -0.04117875482764218, 0.0625246871559584, -0.06734131902915548, -0.19314114501761212, 0.38868323424933376, 0.18404174635217493, 0.1551775587434819, 0.12735817595631277, 0.24842489953280764, 0.05556562603425726, 0.10251011167253767, 0.01110309799416707, 0.18608603221210804, 0.23378804181753607, 0.07668837222557229, -0.09586896537547256, 0.009684687106778006, 0.17539982950048788] |
1,803.09195 | The $0\nu\beta\beta$-decay nuclear matrix element for light and heavy
neutrino mass mechanisms from deformed QRPA cacluations for $^{76}$Ge,
$^{82}$Se, $^{130}$Te, $^{136}$Xe and $^{150}$Nd with isospin restoration | In this work, with restored isospin symmetry, we evaluated the neutrinoless
double beta decay nuclear matrix elements for $^{76}$Ge, $^{82}$Se, $^{130}$Te,
$^{136}$Xe and $^{150}$Nd for both the light and heavy neutrino mass mechanisms
using the deformed QRPA approach with realistic forces. We give detailed
decompositions of the nuclear matrix elements over different intermediate
states and nucleon pairs, and discuss how these decompositions are affected by
the model space truncations. Compared to the spherical calculations, our
results show reductions from $30\%$ to about $60\%$ of the nuclear matrix
elements for the calculated isotopes mainly due to the presence of BCS overlap
factor between the initial and final ground states. The comparison between
different nucleon-nucleon forces with corresponding Short-Range-Correlations
(src) shows, that the choice of the NN force gives roughly $20\%$ deviations
for light exchange neutrino mechanism and much larger deviations for the heavy
neutrino exchange mechanism.
| nucl-th hep-ph | in this work with restored isospin symmetry we evaluated the neutrinoless double beta decay nuclear matrix elements for 76ge 82se 130te 136xe and 150nd for both the light and heavy neutrino mass mechanisms using the deformed qrpa approach with realistic forces we give detailed decompositions of the nuclear matrix elements over different intermediate states and nucleon pairs and discuss how these decompositions are affected by the model space truncations compared to the spherical calculations our results show reductions from 30 to about 60 of the nuclear matrix elements for the calculated isotopes mainly due to the presence of bcs overlap factor between the initial and final ground states the comparison between different nucleonnucleon forces with corresponding shortrangecorrelations src shows that the choice of the nn force gives roughly 20 deviations for light exchange neutrino mechanism and much larger deviations for the heavy neutrino exchange mechanism | [['in', 'this', 'work', 'with', 'restored', 'isospin', 'symmetry', 'we', 'evaluated', 'the', 'neutrinoless', 'double', 'beta', 'decay', 'nuclear', 'matrix', 'elements', 'for', '76ge', '82se', '130te', '136xe', 'and', '150nd', 'for', 'both', 'the', 'light', 'and', 'heavy', 'neutrino', 'mass', 'mechanisms', 'using', 'the', 'deformed', 'qrpa', 'approach', 'with', 'realistic', 'forces', 'we', 'give', 'detailed', 'decompositions', 'of', 'the', 'nuclear', 'matrix', 'elements', 'over', 'different', 'intermediate', 'states', 'and', 'nucleon', 'pairs', 'and', 'discuss', 'how', 'these', 'decompositions', 'are', 'affected', 'by', 'the', 'model', 'space', 'truncations', 'compared', 'to', 'the', 'spherical', 'calculations', 'our', 'results', 'show', 'reductions', 'from', '30', 'to', 'about', '60', 'of', 'the', 'nuclear', 'matrix', 'elements', 'for', 'the', 'calculated', 'isotopes', 'mainly', 'due', 'to', 'the', 'presence', 'of', 'bcs', 'overlap', 'factor', 'between', 'the', 'initial', 'and', 'final', 'ground', 'states', 'the', 'comparison', 'between', 'different', 'nucleonnucleon', 'forces', 'with', 'corresponding', 'shortrangecorrelations', 'src', 'shows', 'that', 'the', 'choice', 'of', 'the', 'nn', 'force', 'gives', 'roughly', '20', 'deviations', 'for', 'light', 'exchange', 'neutrino', 'mechanism', 'and', 'much', 'larger', 'deviations', 'for', 'the', 'heavy', 'neutrino', 'exchange', 'mechanism']] | [-0.024982000975998946, 0.23805968859475493, -0.04979027087554439, 0.1450470152057177, 0.04162705196682105, -0.1073274554057409, 0.07728227245065176, 0.3448260683928513, -0.22292028177050977, -0.3064543646436909, -0.01939051011949131, -0.3191173809658115, -0.04076176312648588, 0.15040107527036323, 0.08349268748093487, 0.02443812559876177, 0.09449710334431277, 0.009931212947170328, -0.16263428889700057, -0.20484493598147915, 0.327169557794049, 0.07911351284322639, 0.244377887545852, 0.09151425367114523, 0.030654563272037194, 0.034918015870061936, -0.03191540131026866, -0.11559253306303516, -0.08701684068713196, 0.10666091039618347, 0.2106484832701325, 0.05267340396918977, 0.1316408682355864, -0.4503224129633357, -0.1222071249924031, 0.13697936762926272, 0.12088965274435598, 0.12324402313162056, -0.08429703883464551, -0.329549022762674, 0.07484593446537878, -0.2575750421706794, -0.13802609149974565, -0.09085095039174323, 0.02705288516719722, 0.014776423903337369, -0.31816446462956566, 0.06705206652542176, -0.03229495584835402, 0.018280742742869432, -0.09377650524321426, -0.27704708098058795, 0.036256558350740105, 0.07277382436182557, 0.1192404267276288, 0.0014903766714269295, 0.18908539138161964, -0.10250759545629586, -0.058896935495593224, 0.40284424150660114, -0.019614089775132015, -0.1395046800090414, 0.11369587006306069, -0.15328132619874346, -0.08617182485371207, 0.14923993050534692, 0.13046188026136304, 0.057637739292759865, -0.1311971504821688, 0.06273620247520739, -0.016653549145606423, 0.20289583751420853, 0.0558865785100756, 0.06174963775588872, 0.1555682069156319, 0.17247339165381467, 0.005323283002427261, 0.03140531920912003, -0.12286047296624424, -0.11841118620941415, -0.3285604185342284, -0.06929142979626907, -0.10120642225794857, 0.05073813047622227, -0.1144317810631037, -0.09834410494679308, 0.4076252925668895, 0.047068648509189695, 0.17466577707899786, 0.0005929328536795867, 0.2537089315398286, 0.05209156039846777, 0.09858573900742663, 0.014017032853088394, 0.3142454033885669, 0.22818862958390834, 0.06577168839592357, -0.3015607471914134, 0.04422716782493, 0.07290245420881547] |
1,803.09196 | Learning Type-Aware Embeddings for Fashion Compatibility | Outfits in online fashion data are composed of items of many different types
(e.g. top, bottom, shoes) that share some stylistic relationship with one
another. A representation for building outfits requires a method that can learn
both notions of similarity (for example, when two tops are interchangeable) and
compatibility (items of possibly different type that can go together in an
outfit). This paper presents an approach to learning an image embedding that
respects item type, and jointly learns notions of item similarity and
compatibility in an end-to-end model. To evaluate the learned representation,
we crawled 68,306 outfits created by users on the Polyvore website. Our
approach obtains 3-5% improvement over the state-of-the-art on outfit
compatibility prediction and fill-in-the-blank tasks using our dataset, as well
as an established smaller dataset, while supporting a variety of useful
queries.
| cs.CV | outfits in online fashion data are composed of items of many different types eg top bottom shoes that share some stylistic relationship with one another a representation for building outfits requires a method that can learn both notions of similarity for example when two tops are interchangeable and compatibility items of possibly different type that can go together in an outfit this paper presents an approach to learning an image embedding that respects item type and jointly learns notions of item similarity and compatibility in an endtoend model to evaluate the learned representation we crawled 68306 outfits created by users on the polyvore website our approach obtains 35 improvement over the stateoftheart on outfit compatibility prediction and fillintheblank tasks using our dataset as well as an established smaller dataset while supporting a variety of useful queries | [['outfits', 'in', 'online', 'fashion', 'data', 'are', 'composed', 'of', 'items', 'of', 'many', 'different', 'types', 'eg', 'top', 'bottom', 'shoes', 'that', 'share', 'some', 'stylistic', 'relationship', 'with', 'one', 'another', 'a', 'representation', 'for', 'building', 'outfits', 'requires', 'a', 'method', 'that', 'can', 'learn', 'both', 'notions', 'of', 'similarity', 'for', 'example', 'when', 'two', 'tops', 'are', 'interchangeable', 'and', 'compatibility', 'items', 'of', 'possibly', 'different', 'type', 'that', 'can', 'go', 'together', 'in', 'an', 'outfit', 'this', 'paper', 'presents', 'an', 'approach', 'to', 'learning', 'an', 'image', 'embedding', 'that', 'respects', 'item', 'type', 'and', 'jointly', 'learns', 'notions', 'of', 'item', 'similarity', 'and', 'compatibility', 'in', 'an', 'endtoend', 'model', 'to', 'evaluate', 'the', 'learned', 'representation', 'we', 'crawled', '68306', 'outfits', 'created', 'by', 'users', 'on', 'the', 'polyvore', 'website', 'our', 'approach', 'obtains', '35', 'improvement', 'over', 'the', 'stateoftheart', 'on', 'outfit', 'compatibility', 'prediction', 'and', 'fillintheblank', 'tasks', 'using', 'our', 'dataset', 'as', 'well', 'as', 'an', 'established', 'smaller', 'dataset', 'while', 'supporting', 'a', 'variety', 'of', 'useful', 'queries']] | [-0.03649645107453344, 0.004671517372911761, -0.06742751038702274, 0.06887638466346457, -0.1491597243619186, -0.19388468439725262, 0.050647870494328714, 0.4535607901436311, -0.28342181310333586, -0.37052080743014815, 0.0452883235069479, -0.35112981073282384, -0.14089350070183476, 0.2018000360561052, -0.1300554079314073, 0.011155230017309939, 0.11857799402679559, 0.0832876258391749, -0.07437558729477503, -0.31353073084761424, 0.3491809449141362, 0.0035489583629424925, 0.3202924764956589, -0.002478320237801031, 0.13724005433851508, 0.005955709330737591, -0.05201046030140585, 0.003720614517590514, -0.028457624955249398, 0.1940237135246948, 0.31034105671052303, 0.21414625129007078, 0.3011671252238254, -0.37885056001444656, -0.1467782723294847, 0.04924817976921245, 0.1336593260733126, 0.05139851213294875, -0.05809809713865872, -0.34137493481652603, 0.11228612165863591, -0.19406117850017768, 0.006078844648544435, -0.1186555696375392, -0.02723131943795899, -0.03350281559180951, -0.30758168581459255, -0.02549733199800054, 0.05471178887593042, 0.06165759805589914, -0.06539387885412132, -0.11446546966003047, 0.016929730733304664, 0.20299546253733786, 0.0557215575594455, 0.031212182602784768, 0.1306773515004251, -0.17172986732540368, -0.18117944222047097, 0.38348000087533834, -0.08622413920885366, -0.19653359447623156, 0.21655077030537306, 0.020869545648909277, -0.14081774266367708, 0.04619746043312329, 0.2101147004575641, 0.08392950082025319, -0.17488238739800485, -0.01040979752799979, -0.12255427885662626, 0.19252520849738547, 0.07849013897141925, 0.00740122533644791, 0.18644216819493858, 0.22525781619155572, 0.031216837127296324, 0.1147742831941556, -0.03217712426517715, -0.04648918264924928, -0.24329563193713075, -0.14602450494831257, -0.14969926303321565, -0.029333853797504195, -0.14872975731570343, -0.13856451469096268, 0.41399371543968166, 0.19152705891540758, 0.24426560815837647, 0.10835874514843992, 0.290086427413755, -0.02282567990736829, 0.08835038064668575, 0.0748202590427051, 0.11426210414588071, -0.03822254757741811, 0.1218478471532257, -0.09329211238978638, 0.10608708567192984, 0.0685710475469629] |
1,803.09197 | Stephen Hawking: To Understand the Universe | A brief remembrance of some aspects of the author's scientific interaction
with Stephen Hawking. A contribution to Physics Today's March 14, 2018 web page
in which Stephen Hawking is remembered by his colleagues.
| physics.hist-ph gr-qc hep-th | a brief remembrance of some aspects of the authors scientific interaction with stephen hawking a contribution to physics todays march 14 2018 web page in which stephen hawking is remembered by his colleagues | [['a', 'brief', 'remembrance', 'of', 'some', 'aspects', 'of', 'the', 'authors', 'scientific', 'interaction', 'with', 'stephen', 'hawking', 'a', 'contribution', 'to', 'physics', 'todays', 'march', '14', '2018', 'web', 'page', 'in', 'which', 'stephen', 'hawking', 'is', 'remembered', 'by', 'his', 'colleagues']] | [-0.09173973361876878, 0.11747043297597856, -0.11759879098584254, 0.11391518286880896, -0.21376266798964053, -0.14476374635529338, 0.02873963817502513, 0.19252253741477476, -0.13442403800559766, -0.42461980647887243, 0.06609532439897796, -0.43930095626097737, -0.15938228571956808, 0.16449054288254542, -0.19990120709619738, -0.08191749436611478, 0.04236124755080902, 0.005370643695421291, 0.034483779165329353, -0.4646374965933236, 0.2796413517754638, 0.2669940772043033, 0.21864111015968252, 0.1722022381145507, 0.006330223062611891, 0.012177294162525372, -0.1499964560692509, -0.07326920643787492, -0.13974195492990088, 0.06214872377952843, 0.3021402083580721, 0.22964509813622994, 0.332513798479781, -0.3554757714384433, -0.15025285075446873, -0.01001034298855247, -3.400655237562729e-05, 0.08655074595431374, -0.05274520783374707, -0.40725711247686186, -0.03828859041360291, -0.27307605833718274, -0.06116167369834853, 0.09788281710423304, 0.19008676527124463, -0.05598032257209221, -0.06355777992443605, 0.012891854780415693, 0.08705922278265159, 0.0948759950697422, 0.010864562919419823, -0.08375407625554186, 0.06046748347580433, 0.10136605191016287, 0.10073289638526287, 0.08253054404066819, 0.17643536194086526, -0.09109408890997822, -0.20388213700304428, 0.3318538139715339, -0.0008858584827094367, 0.013720060162472002, 0.15852532766152624, -0.10961184525072123, -0.147184144906615, 0.05107571021653712, 0.09311877346287172, 0.07999969550380201, -0.20796988331571672, 0.15746416241833658, 0.0017331824214621024, 0.12722999348559164, 0.17398895368431555, -0.04976417361335321, 0.3140679836047418, 0.06910215724598277, -0.09442273760214448, 0.07038003087368314, 0.07646012752824886, -0.07723026872245652, -0.2838802102840308, -0.21008891394982734, -0.17900079251690346, 0.1774445059144813, 0.04204575838803342, -0.0833613561804999, 0.3855319313253417, 0.17379359627198993, 0.10008484024949597, -0.044009357038179805, 0.23883138280926328, -0.020024277582044968, -0.007100697620912935, 0.12730266011291833, 0.25046906342719344, 0.09837432053984341, 0.38742752898145805, -0.08614544727077539, 0.005159576959682234, 0.1501168840931672] |
1,803.09198 | Quadratic differentials, measured foliations and metric graphs on
punctured surfaces | A meromorphic quadratic differential on a punctured Riemann surface induces
horizontal and vertical measured foliations with pole-singularities. In a
neighborhood of a pole such a foliation comprises foliated strips and
half-planes, and its leaf-space determines a metric graph. We introduce the
notion of an asymptotic direction at each pole, and show that for a punctured
surface equipped with a choice of such asymptotic data, any compatible pair of
measured foliations uniquely determines a complex structure and a meromorphic
quadratic differential realizing that pair. This proves the analogue of a
theorem of Gardiner-Masur, for meromorphic quadratic differentials. We also
prove an analogue of the Hubbard-Masur theorem, namely, for a fixed punctured
Riemann surface there exists a meromorphic quadratic differential with any
prescribed horizontal foliation, and such a differential is unique provided we
prescribe the singular-flat geometry at the poles.
| math.GT | a meromorphic quadratic differential on a punctured riemann surface induces horizontal and vertical measured foliations with polesingularities in a neighborhood of a pole such a foliation comprises foliated strips and halfplanes and its leafspace determines a metric graph we introduce the notion of an asymptotic direction at each pole and show that for a punctured surface equipped with a choice of such asymptotic data any compatible pair of measured foliations uniquely determines a complex structure and a meromorphic quadratic differential realizing that pair this proves the analogue of a theorem of gardinermasur for meromorphic quadratic differentials we also prove an analogue of the hubbardmasur theorem namely for a fixed punctured riemann surface there exists a meromorphic quadratic differential with any prescribed horizontal foliation and such a differential is unique provided we prescribe the singularflat geometry at the poles | [['a', 'meromorphic', 'quadratic', 'differential', 'on', 'a', 'punctured', 'riemann', 'surface', 'induces', 'horizontal', 'and', 'vertical', 'measured', 'foliations', 'with', 'polesingularities', 'in', 'a', 'neighborhood', 'of', 'a', 'pole', 'such', 'a', 'foliation', 'comprises', 'foliated', 'strips', 'and', 'halfplanes', 'and', 'its', 'leafspace', 'determines', 'a', 'metric', 'graph', 'we', 'introduce', 'the', 'notion', 'of', 'an', 'asymptotic', 'direction', 'at', 'each', 'pole', 'and', 'show', 'that', 'for', 'a', 'punctured', 'surface', 'equipped', 'with', 'a', 'choice', 'of', 'such', 'asymptotic', 'data', 'any', 'compatible', 'pair', 'of', 'measured', 'foliations', 'uniquely', 'determines', 'a', 'complex', 'structure', 'and', 'a', 'meromorphic', 'quadratic', 'differential', 'realizing', 'that', 'pair', 'this', 'proves', 'the', 'analogue', 'of', 'a', 'theorem', 'of', 'gardinermasur', 'for', 'meromorphic', 'quadratic', 'differentials', 'we', 'also', 'prove', 'an', 'analogue', 'of', 'the', 'hubbardmasur', 'theorem', 'namely', 'for', 'a', 'fixed', 'punctured', 'riemann', 'surface', 'there', 'exists', 'a', 'meromorphic', 'quadratic', 'differential', 'with', 'any', 'prescribed', 'horizontal', 'foliation', 'and', 'such', 'a', 'differential', 'is', 'unique', 'provided', 'we', 'prescribe', 'the', 'singularflat', 'geometry', 'at', 'the', 'poles']] | [-0.27580191008746624, 0.01781052892911248, -0.12718203289227353, 0.0786567716928268, -0.13902813384343904, -0.14281938374387446, -0.004154522199597624, 0.2978003963828087, -0.3002612967113102, -0.19626396646792138, 0.06976151219757783, -0.27318043130691405, -0.17727675243384308, 0.21457595264332163, -0.10461454220392086, 0.03931676675694891, 0.057426489298059435, 0.11047684433870017, -0.11510922732349071, -0.17868031015106545, 0.4308637703044547, -0.04547816613404494, 0.16888604652378017, 0.07264558917463378, 0.22930565445632156, 0.027309160401259927, -0.01112321962567943, 0.010436696117674863, -0.18522027068376903, 0.10349025739598329, 0.25418246429999947, 0.02636868446090914, 0.21970422669589795, -0.3606665937298978, -0.15112947880945823, 0.16207940224558115, 0.09091298800237753, -0.01971440888699834, -0.04555130330414546, -0.22381445922095466, 0.11886887647970407, -0.06252283033811384, -0.25356059895517924, -0.0038395356744769273, 0.01328848322370538, -0.002175661557595487, -0.25209765408783114, -0.03455346799822076, 0.10284167248065824, 0.13864094320408724, -0.0617664905515051, -0.06905017661413661, -0.1479670053606646, 0.04957005124953058, 0.012933658327286442, 0.11969590767597159, 0.11723414289385632, -0.04967191584787711, -0.09533331820879269, 0.3069928987020696, -0.13836114773854474, -0.3068112544025536, 0.11767702016427561, -0.1672014901690461, -0.15021200665376253, 0.12698051530039972, 0.13430329013477874, 0.17412062692973349, -0.08839560059390755, 0.1899197578438799, -0.09358853790865936, 0.11104322341443212, 0.17582366548616576, -0.044346573045132336, 0.23179607154042633, 0.1144890048523882, 0.15312968781562866, 0.12915245217133176, -0.05888343552230961, -0.06456503590085992, -0.385472412576416, -0.2434781801610909, -0.09878345030851456, 0.11350860485669087, -0.12880043484964754, -0.2650370856953992, 0.4181029653383626, -0.043022656727030324, 0.23114869794635862, 0.11314654951846158, 0.22600765451702667, 0.11806814867347755, 0.07696033994218818, 0.10166289258955254, 0.14534344278551914, 0.19022837663069367, 0.007568688187920661, -0.1507900326029846, -0.0046539591056191255, 0.14156150711631332] |
1,803.09199 | Peano Model for Planar Compacta and a Lemma by Beardon | It is known that, among all the monotone decompositions of a planar compact
set K with Peano hyperspaces, there exists a unique one that is finer than all
the others. We call it the "core decomposition" of K with Peano hyperspace. The
resulted hyperspace under quotient topology will be referred to as the "Peano
model" for K. We show that the core decomposition is independent of the
embedding of K into the plane. Given a rational function f with degree at least
2 that is independent of K. A well known result by Beardon says that the
pre-image for any element d of the core decomposition has finitely many
components, each of which is mapped by f onto d. We show that those components
belong to the core decomposition of L, the pre-image of K under the above
mentioned rational map f. This provides an affirmative answer to Question 5.4
proposed by Curry (MR2642461) and extends earlier partial results by
Blokh-Curry-Oversteegen (MR2737795 and MR3008890), when K is assumed to be
unshielded and the rational map f is assumed to be a polynomial, under which K
is completely invariant. The previous result is also connected with a well
known Factor Theorem developed by Whyburn. We also introduce a lambda function
from K to the set of non-negative integers, such that this function is
constantly zero if and only if K is a Peano space. This function and its
maximum are topologically invariant, while its level set at zero is of
particular interest. For instance, when K is the Mandelbrot set we find close
relations between the level set at zero and the hyperbolic components. Further
discussions on the lambda function can be expected.
| math.DS | it is known that among all the monotone decompositions of a planar compact set k with peano hyperspaces there exists a unique one that is finer than all the others we call it the core decomposition of k with peano hyperspace the resulted hyperspace under quotient topology will be referred to as the peano model for k we show that the core decomposition is independent of the embedding of k into the plane given a rational function f with degree at least 2 that is independent of k a well known result by beardon says that the preimage for any element d of the core decomposition has finitely many components each of which is mapped by f onto d we show that those components belong to the core decomposition of l the preimage of k under the above mentioned rational map f this provides an affirmative answer to question 54 proposed by curry mr2642461 and extends earlier partial results by blokhcurryoversteegen mr2737795 and mr3008890 when k is assumed to be unshielded and the rational map f is assumed to be a polynomial under which k is completely invariant the previous result is also connected with a well known factor theorem developed by whyburn we also introduce a lambda function from k to the set of nonnegative integers such that this function is constantly zero if and only if k is a peano space this function and its maximum are topologically invariant while its level set at zero is of particular interest for instance when k is the mandelbrot set we find close relations between the level set at zero and the hyperbolic components further discussions on the lambda function can be expected | [['it', 'is', 'known', 'that', 'among', 'all', 'the', 'monotone', 'decompositions', 'of', 'a', 'planar', 'compact', 'set', 'k', 'with', 'peano', 'hyperspaces', 'there', 'exists', 'a', 'unique', 'one', 'that', 'is', 'finer', 'than', 'all', 'the', 'others', 'we', 'call', 'it', 'the', 'core', 'decomposition', 'of', 'k', 'with', 'peano', 'hyperspace', 'the', 'resulted', 'hyperspace', 'under', 'quotient', 'topology', 'will', 'be', 'referred', 'to', 'as', 'the', 'peano', 'model', 'for', 'k', 'we', 'show', 'that', 'the', 'core', 'decomposition', 'is', 'independent', 'of', 'the', 'embedding', 'of', 'k', 'into', 'the', 'plane', 'given', 'a', 'rational', 'function', 'f', 'with', 'degree', 'at', 'least', '2', 'that', 'is', 'independent', 'of', 'k', 'a', 'well', 'known', 'result', 'by', 'beardon', 'says', 'that', 'the', 'preimage', 'for', 'any', 'element', 'd', 'of', 'the', 'core', 'decomposition', 'has', 'finitely', 'many', 'components', 'each', 'of', 'which', 'is', 'mapped', 'by', 'f', 'onto', 'd', 'we', 'show', 'that', 'those', 'components', 'belong', 'to', 'the', 'core', 'decomposition', 'of', 'l', 'the', 'preimage', 'of', 'k', 'under', 'the', 'above', 'mentioned', 'rational', 'map', 'f', 'this', 'provides', 'an', 'affirmative', 'answer', 'to', 'question', '54', 'proposed', 'by', 'curry', 'mr2642461', 'and', 'extends', 'earlier', 'partial', 'results', 'by', 'blokhcurryoversteegen', 'mr2737795', 'and', 'mr3008890', 'when', 'k', 'is', 'assumed', 'to', 'be', 'unshielded', 'and', 'the', 'rational', 'map', 'f', 'is', 'assumed', 'to', 'be', 'a', 'polynomial', 'under', 'which', 'k', 'is', 'completely', 'invariant', 'the', 'previous', 'result', 'is', 'also', 'connected', 'with', 'a', 'well', 'known', 'factor', 'theorem', 'developed', 'by', 'whyburn', 'we', 'also', 'introduce', 'a', 'lambda', 'function', 'from', 'k', 'to', 'the', 'set', 'of', 'nonnegative', 'integers', 'such', 'that', 'this', 'function', 'is', 'constantly', 'zero', 'if', 'and', 'only', 'if', 'k', 'is', 'a', 'peano', 'space', 'this', 'function', 'and', 'its', 'maximum', 'are', 'topologically', 'invariant', 'while', 'its', 'level', 'set', 'at', 'zero', 'is', 'of', 'particular', 'interest', 'for', 'instance', 'when', 'k', 'is', 'the', 'mandelbrot', 'set', 'we', 'find', 'close', 'relations', 'between', 'the', 'level', 'set', 'at', 'zero', 'and', 'the', 'hyperbolic', 'components', 'further', 'discussions', 'on', 'the', 'lambda', 'function', 'can', 'be', 'expected']] | [-0.1365338308483751, 0.1253152934926174, -0.09305408714245335, 0.013893016536130483, -0.07753209878435935, -0.13960556527633194, 0.039754591329465454, 0.3374777509958195, -0.3190318410345119, -0.23655674636879895, 0.0917259233016705, -0.2927848157663863, -0.13312154295083753, 0.17490827448568944, -0.04241978624172294, 0.010689347981987856, 0.012840358235558375, 0.10941519284882187, -0.03820405212539188, -0.2695463318369358, 0.3506885720182398, -0.03792164012498269, 0.20389642642991845, 0.05790547373316841, 0.11436236121946369, -0.016245927655323587, 0.01089311562136834, 0.04707857318339357, -0.1377371607965523, 0.07899734827735053, 0.27589665438138994, 0.17297715130516475, 0.2600565721463452, -0.31153553010051627, -0.18145095462460245, 0.15775973975060428, 0.10788960216471442, -0.003258227466156693, 0.03741597579314755, -0.22899892922866044, 0.18081062201162626, -0.0971745076081435, -0.13770970202087954, -0.05214440012216675, 0.09577403135979615, -0.008830328346539972, -0.27005045024825514, -0.014177636017481857, 0.14641152625307172, 0.05749045194398022, -0.02516375638447407, -0.1546684849618686, -0.05459779404269585, 0.08788495054807709, -0.011079464654106252, 0.13202690977620785, 0.08450427746715145, -0.05627455235468961, -0.06726145341141458, 0.3765732527479342, -0.09056366639314999, -0.2168840352620045, 0.18082926189526916, -0.16327656609368035, -0.1278747685752782, 0.15812028047717477, 0.07045308569540008, 0.12129988530047721, -0.08930704353610472, 0.1575714177104457, -0.1453966244246154, 0.16365293430569816, 0.08526505665726317, -0.00922537904748653, 0.17392708740796786, 0.09915913684375705, 0.1316735397256367, 0.1606642790649609, -0.0013253121551380848, -0.017439333705244947, -0.3208086981619005, -0.13703287575769124, -0.1805237578944196, 0.09266712934720135, -0.06945738564028694, -0.16526851463198608, 0.34589879813590657, 0.07736052793916315, 0.22367700886838943, 0.07834248356717947, 0.266561716303762, 0.13542456670104996, 0.07108415150679916, 0.1097197969089825, 0.14436316349637435, 0.14858523347220726, -0.01978277015791228, -0.1378192831217747, 0.06064034615251363, 0.09863910469454344] |
1,803.092 | Automated Driving Maneuvers under Interactive Environment based on Deep
Reinforcement Learning | Safe and efficient autonomous driving maneuvers in an interactive and complex
environment can be considerably challenging due to the unpredictable actions of
other surrounding agents that may be cooperative or adversarial in their
interactions with the ego vehicle. One of the state-of-the-art approaches is to
apply Reinforcement Learning (RL) to learn a time-sequential driving policy, to
execute proper control strategy or tracking trajectory in dynamic situations.
However, direct application of RL algorithms is not satisfactorily enough to
deal with the cases in the autonomous driving domain, mainly due to the complex
driving environment and continuous action space. In this paper, we adopt
Q-learning as our basic learning framework and design a unique format of the
Q-function approximator that consists of neural networks to handle the
continuous action space challenge. The learning model is present in a closed
form of continuous control variables and trained in a simulation platform that
we have developed with embedded properties of real-time vehicle interactions.
The proposed algorithm avoids invoking an additional actor network that learns
to take actions, as in actor-critic algorithms. At the same time, some prior
knowledge of vehicle dynamics is also fed into the model to assist learning. We
test our algorithm with a challenging use case - lane change maneuver, to
verify the practicability and feasibility of the proposed approach. Results
from accumulated rewards and vehicle performance show that RL vehicle agents
successfully learn a safe, comfort and efficient driving policy as defined in
the reward function.
| cs.RO | safe and efficient autonomous driving maneuvers in an interactive and complex environment can be considerably challenging due to the unpredictable actions of other surrounding agents that may be cooperative or adversarial in their interactions with the ego vehicle one of the stateoftheart approaches is to apply reinforcement learning rl to learn a timesequential driving policy to execute proper control strategy or tracking trajectory in dynamic situations however direct application of rl algorithms is not satisfactorily enough to deal with the cases in the autonomous driving domain mainly due to the complex driving environment and continuous action space in this paper we adopt qlearning as our basic learning framework and design a unique format of the qfunction approximator that consists of neural networks to handle the continuous action space challenge the learning model is present in a closed form of continuous control variables and trained in a simulation platform that we have developed with embedded properties of realtime vehicle interactions the proposed algorithm avoids invoking an additional actor network that learns to take actions as in actorcritic algorithms at the same time some prior knowledge of vehicle dynamics is also fed into the model to assist learning we test our algorithm with a challenging use case lane change maneuver to verify the practicability and feasibility of the proposed approach results from accumulated rewards and vehicle performance show that rl vehicle agents successfully learn a safe comfort and efficient driving policy as defined in the reward function | [['safe', 'and', 'efficient', 'autonomous', 'driving', 'maneuvers', 'in', 'an', 'interactive', 'and', 'complex', 'environment', 'can', 'be', 'considerably', 'challenging', 'due', 'to', 'the', 'unpredictable', 'actions', 'of', 'other', 'surrounding', 'agents', 'that', 'may', 'be', 'cooperative', 'or', 'adversarial', 'in', 'their', 'interactions', 'with', 'the', 'ego', 'vehicle', 'one', 'of', 'the', 'stateoftheart', 'approaches', 'is', 'to', 'apply', 'reinforcement', 'learning', 'rl', 'to', 'learn', 'a', 'timesequential', 'driving', 'policy', 'to', 'execute', 'proper', 'control', 'strategy', 'or', 'tracking', 'trajectory', 'in', 'dynamic', 'situations', 'however', 'direct', 'application', 'of', 'rl', 'algorithms', 'is', 'not', 'satisfactorily', 'enough', 'to', 'deal', 'with', 'the', 'cases', 'in', 'the', 'autonomous', 'driving', 'domain', 'mainly', 'due', 'to', 'the', 'complex', 'driving', 'environment', 'and', 'continuous', 'action', 'space', 'in', 'this', 'paper', 'we', 'adopt', 'qlearning', 'as', 'our', 'basic', 'learning', 'framework', 'and', 'design', 'a', 'unique', 'format', 'of', 'the', 'qfunction', 'approximator', 'that', 'consists', 'of', 'neural', 'networks', 'to', 'handle', 'the', 'continuous', 'action', 'space', 'challenge', 'the', 'learning', 'model', 'is', 'present', 'in', 'a', 'closed', 'form', 'of', 'continuous', 'control', 'variables', 'and', 'trained', 'in', 'a', 'simulation', 'platform', 'that', 'we', 'have', 'developed', 'with', 'embedded', 'properties', 'of', 'realtime', 'vehicle', 'interactions', 'the', 'proposed', 'algorithm', 'avoids', 'invoking', 'an', 'additional', 'actor', 'network', 'that', 'learns', 'to', 'take', 'actions', 'as', 'in', 'actorcritic', 'algorithms', 'at', 'the', 'same', 'time', 'some', 'prior', 'knowledge', 'of', 'vehicle', 'dynamics', 'is', 'also', 'fed', 'into', 'the', 'model', 'to', 'assist', 'learning', 'we', 'test', 'our', 'algorithm', 'with', 'a', 'challenging', 'use', 'case', 'lane', 'change', 'maneuver', 'to', 'verify', 'the', 'practicability', 'and', 'feasibility', 'of', 'the', 'proposed', 'approach', 'results', 'from', 'accumulated', 'rewards', 'and', 'vehicle', 'performance', 'show', 'that', 'rl', 'vehicle', 'agents', 'successfully', 'learn', 'a', 'safe', 'comfort', 'and', 'efficient', 'driving', 'policy', 'as', 'defined', 'in', 'the', 'reward', 'function']] | [-0.08826401368334737, 0.025443839216343488, -0.10210657236118782, 0.039702941572806814, -0.14317875261969712, -0.18435887501632073, 0.054135179754859784, 0.4829048618978384, -0.2821407971884675, -0.3241063945204476, 0.08820772557923266, -0.2000199453002412, -0.2006680034443128, 0.18919373226295016, -0.16083679381586916, 0.07554805077118229, 0.08605644253310653, 0.05084277889121096, 0.008395623847870726, -0.23982017469848982, 0.28593357442640605, 0.01728238236843323, 0.27280592833246503, -0.009782429769331096, 0.16462949930443144, 0.01262523457978149, 0.0319239521779272, 0.0042995227432417165, -0.017510519651678266, 0.1304249369881439, 0.3272233983435269, 0.1874276976614278, 0.3591959668294888, -0.43654567920887954, -0.21637000646252108, 0.12529476280039062, 0.12361590649210373, 0.06999260750919942, -0.03390159925751207, -0.36123438705690203, 0.06651044304349593, -0.21529263915227992, -0.08067448496134305, -0.13582629068393487, -0.014978342769401414, 0.01629796706814775, -0.3154646248480647, -0.045927740459696255, 0.05877072862254418, 0.018241717297659846, -0.10328511668046061, -0.02437337743004366, 0.02069296848637109, 0.20815688746848277, 0.0446442201025594, 0.07905754761352222, 0.20091498697376145, -0.18337806689705016, -0.1769133398727495, 0.3902305369550476, -0.030020955623108515, -0.2111804267986706, 0.220010439625333, -0.03227897470256276, -0.1266407379804521, 0.11731036466935992, 0.26916774900592105, 0.13299165660971585, -0.16264520880899258, 0.03387349045512324, -0.002858647662309968, 0.1574919263433133, -0.014866581192354159, -0.02797959453850386, 0.14046392557971485, 0.23682640844727962, 0.11862851061183503, 0.11688428087660696, -0.045812432594331244, -0.16027747636889011, -0.22031160376927986, -0.11203911652674481, -0.169764702020175, -0.011791859161315428, -0.07368477938437777, -0.11144764529391459, 0.3539181605884235, 0.24588428450871866, 0.18155495362470345, 0.10685378237798505, 0.38760343734555097, 0.06202424475923181, 0.07289882685456957, 0.1308549789160642, 0.19874847128486015, 0.003850706259016784, 0.13651707084013187, -0.22864351129368404, 0.1300663471488016, 0.028038678406642713] |
1,803.09201 | On the Euler-Poincar\'e characteristic and mixed multiplicities of
maximal degrees | This paper defines the Euler-Poincar\'{e} characteristic of joint reductions
of ideals which concerns the maximal terms in the Hilbert polynomial;
characterizes the positivity of mixed multiplicities in terms of minimal joint
reductions; proves the additivity and other elementary properties for mixed
multiplicities. The results of the paper together with the results of [17] seem
to show a natural and nice picture of mixed multiplicities of maximal degrees.
| math.AC | this paper defines the eulerpoincare characteristic of joint reductions of ideals which concerns the maximal terms in the hilbert polynomial characterizes the positivity of mixed multiplicities in terms of minimal joint reductions proves the additivity and other elementary properties for mixed multiplicities the results of the paper together with the results of 17 seem to show a natural and nice picture of mixed multiplicities of maximal degrees | [['this', 'paper', 'defines', 'the', 'eulerpoincare', 'characteristic', 'of', 'joint', 'reductions', 'of', 'ideals', 'which', 'concerns', 'the', 'maximal', 'terms', 'in', 'the', 'hilbert', 'polynomial', 'characterizes', 'the', 'positivity', 'of', 'mixed', 'multiplicities', 'in', 'terms', 'of', 'minimal', 'joint', 'reductions', 'proves', 'the', 'additivity', 'and', 'other', 'elementary', 'properties', 'for', 'mixed', 'multiplicities', 'the', 'results', 'of', 'the', 'paper', 'together', 'with', 'the', 'results', 'of', '17', 'seem', 'to', 'show', 'a', 'natural', 'and', 'nice', 'picture', 'of', 'mixed', 'multiplicities', 'of', 'maximal', 'degrees']] | [-0.15873419371113848, 0.09174787157229078, -0.11258160917839008, 0.0663929931982768, -0.03878640881114041, -0.05779033265451887, -0.03134724544708742, 0.21119174609349958, -0.31842792551241705, -0.26935476508797773, 0.05771240673667348, -0.2168631020988991, -0.10770580510577576, 0.16915063754439966, -0.16400137628470338, 0.04019364829995294, 0.0908266746703146, 0.08496124671299511, -0.13648317395639953, -0.2824714560506504, 0.37689679755426164, 0.015286474307971214, 0.26270908400861187, 0.10649938762375612, 0.13922552607341934, 0.04026192153539898, -0.07554305167590726, 0.012442859237207405, -0.15628230954006092, 0.21688974399898034, 0.28264948646642213, 0.12174907385079718, 0.20168951663897552, -0.37201504377342426, -0.1242485580733046, 0.1889758735978559, 0.11566064178721229, 0.01899611352032412, 0.06661834690455737, -0.1902451540774374, 0.11664149024760101, -0.16252125834406755, -0.21080082226822625, -0.06365353418097122, -0.016623156006211667, 0.049816661222434756, -0.2730958535711267, 0.08811471319354292, 0.154846719184668, 0.1247926315209314, -0.0789640567390554, -0.17245370385918155, -0.03122735377957127, 0.04772196108225121, 0.03131252185983667, -0.08348991766349594, 0.026506459764413424, -0.1512469221149752, -0.1680685434240236, 0.3755015409760066, -0.02199016879712329, -0.20677887435668885, 0.180818797193412, -0.1778982392887571, -0.16257788045609842, 0.1191633242571643, 0.11116125530549395, 0.10350121493771006, -0.07925418839414618, 0.11846035613101531, -0.15837818493983194, 0.06744672683303926, 0.07881865704626735, 0.13516241385698763, 0.13340847789129215, 0.05019117025797492, 0.05675978887715002, 0.18684176712230877, 0.013854018655786319, -0.10549562035211876, -0.399226689745964, -0.21961459115759205, -0.13281385640182825, 0.04235420293702897, -0.11958326176182478, -0.14758243598043919, 0.45386830478239415, 0.04971845611693588, 0.20512695032269207, 0.1331716725314314, 0.20092053236022814, 0.10674636199403165, 0.02482241584524971, 0.01819178509289649, 0.13835153420483554, 0.21546215174455585, 0.04438458175273306, -0.24265033806632483, 0.06143592102036102, 0.1352116744061793] |
1,803.09202 | Unsupervised Depth Estimation, 3D Face Rotation and Replacement | We present an unsupervised approach for learning to estimate three
dimensional (3D) facial structure from a single image while also predicting 3D
viewpoint transformations that match a desired pose and facial geometry. We
achieve this by inferring the depth of facial keypoints of an input image in an
unsupervised manner, without using any form of ground-truth depth information.
We show how it is possible to use these depths as intermediate computations
within a new backpropable loss to predict the parameters of a 3D affine
transformation matrix that maps inferred 3D keypoints of an input face to the
corresponding 2D keypoints on a desired target facial geometry or pose. Our
resulting approach, called DepthNets, can therefore be used to infer plausible
3D transformations from one face pose to another, allowing faces to be
frontalized, transformed into 3D models or even warped to another pose and
facial geometry. Lastly, we identify certain shortcomings with our formulation,
and explore adversarial image translation techniques as a post-processing step
to re-synthesize complete head shots for faces re-targeted to different poses
or identities.
| cs.CV stat.ML | we present an unsupervised approach for learning to estimate three dimensional 3d facial structure from a single image while also predicting 3d viewpoint transformations that match a desired pose and facial geometry we achieve this by inferring the depth of facial keypoints of an input image in an unsupervised manner without using any form of groundtruth depth information we show how it is possible to use these depths as intermediate computations within a new backpropable loss to predict the parameters of a 3d affine transformation matrix that maps inferred 3d keypoints of an input face to the corresponding 2d keypoints on a desired target facial geometry or pose our resulting approach called depthnets can therefore be used to infer plausible 3d transformations from one face pose to another allowing faces to be frontalized transformed into 3d models or even warped to another pose and facial geometry lastly we identify certain shortcomings with our formulation and explore adversarial image translation techniques as a postprocessing step to resynthesize complete head shots for faces retargeted to different poses or identities | [['we', 'present', 'an', 'unsupervised', 'approach', 'for', 'learning', 'to', 'estimate', 'three', 'dimensional', '3d', 'facial', 'structure', 'from', 'a', 'single', 'image', 'while', 'also', 'predicting', '3d', 'viewpoint', 'transformations', 'that', 'match', 'a', 'desired', 'pose', 'and', 'facial', 'geometry', 'we', 'achieve', 'this', 'by', 'inferring', 'the', 'depth', 'of', 'facial', 'keypoints', 'of', 'an', 'input', 'image', 'in', 'an', 'unsupervised', 'manner', 'without', 'using', 'any', 'form', 'of', 'groundtruth', 'depth', 'information', 'we', 'show', 'how', 'it', 'is', 'possible', 'to', 'use', 'these', 'depths', 'as', 'intermediate', 'computations', 'within', 'a', 'new', 'backpropable', 'loss', 'to', 'predict', 'the', 'parameters', 'of', 'a', '3d', 'affine', 'transformation', 'matrix', 'that', 'maps', 'inferred', '3d', 'keypoints', 'of', 'an', 'input', 'face', 'to', 'the', 'corresponding', '2d', 'keypoints', 'on', 'a', 'desired', 'target', 'facial', 'geometry', 'or', 'pose', 'our', 'resulting', 'approach', 'called', 'depthnets', 'can', 'therefore', 'be', 'used', 'to', 'infer', 'plausible', '3d', 'transformations', 'from', 'one', 'face', 'pose', 'to', 'another', 'allowing', 'faces', 'to', 'be', 'frontalized', 'transformed', 'into', '3d', 'models', 'or', 'even', 'warped', 'to', 'another', 'pose', 'and', 'facial', 'geometry', 'lastly', 'we', 'identify', 'certain', 'shortcomings', 'with', 'our', 'formulation', 'and', 'explore', 'adversarial', 'image', 'translation', 'techniques', 'as', 'a', 'postprocessing', 'step', 'to', 'resynthesize', 'complete', 'head', 'shots', 'for', 'faces', 'retargeted', 'to', 'different', 'poses', 'or', 'identities']] | [0.004300808794131236, -0.030583925524260848, -0.06186594176239201, 0.052634369651121754, -0.10347923911841853, -0.20778953532555275, -0.011028949012979865, 0.45433918599039314, -0.3180324304636036, -0.3467849557740348, 0.08406094759370067, -0.2553110995516181, -0.19755787175980263, 0.14127392716373183, -0.20014431459696166, 0.09233170876013382, 0.10194968228494482, 0.051969267038096276, -0.12630961184223582, -0.21434582061067756, 0.31452239092705503, -0.01624641585030726, 0.27104201354618584, -0.018252939843971815, 0.17252880964428186, -0.0021696055888397884, -0.009835224056649687, 0.020136998500674963, -0.07611491297014124, 0.21107843668200077, 0.28441595629350297, 0.2035555585500385, 0.19236597709756878, -0.46110610720302375, -0.21261771611869335, 0.04565558973142678, 0.13008145319564002, 0.18148928564440991, -0.06498425904195755, -0.3601049893176449, 0.08381140787620098, -0.10576509298224535, -0.05332456002643864, -0.14612718650040082, -0.004618234235261168, -0.10324094609523725, -0.31258039602643944, 0.01840510917018816, 0.06896959625982813, 0.07925851703754493, -0.08885412007570266, -0.053164853290821025, -0.03322245389755283, 0.2611193089972117, 0.014559019003021863, 0.08651989153386759, 0.15236803286575845, -0.23709134723379977, -0.10828184719197452, 0.4048362953029573, -0.0067373861252729384, -0.2657510044252766, 0.17803763841411896, -0.04814005883410573, -0.12663933655114046, 0.1257758676047836, 0.2366727333023612, 0.11543144716981, -0.14479613259734053, -0.022356343161248203, -0.07176212283915707, 0.20269536008193556, 0.08174805312949632, -0.03974103407069508, 0.22521522244505052, 0.1299090071727655, 0.04378365399582045, 0.1611829229218087, -0.20993114866715457, 0.0050948335945473185, -0.22804621956710305, -0.1301909607768591, -0.16716262022299425, 0.008800448648232434, -0.1318345428255686, -0.19351493010563509, 0.4177100563874202, 0.22785604066581333, 0.3054799948446453, 0.08454575446567365, 0.36337126888334753, 0.04603894725974117, 0.11313697158492038, 0.024375777055642433, 0.16417258162650147, -0.00765075814910233, 0.024171304499198284, -0.14360360344406217, 0.06209805090512548, 0.12415618722925761] |
1,803.09203 | Autonomous Ramp Merge Maneuver Based on Reinforcement Learning with
Continuous Action Space | Ramp merging is a critical maneuver for road safety and traffic efficiency.
Most of the current automated driving systems developed by multiple automobile
manufacturers and suppliers are typically limited to restricted access freeways
only. Extending the automated mode to ramp merging zones presents substantial
challenges. One is that the automated vehicle needs to incorporate a future
objective (e.g. a successful and smooth merge) and optimize a long-term reward
that is impacted by subsequent actions when executing the current action.
Furthermore, the merging process involves interaction between the merging
vehicle and its surrounding vehicles whose behavior may be cooperative or
adversarial, leading to distinct merging countermeasures that are crucial to
successfully complete the merge. In place of the conventional rule-based
approaches, we propose to apply reinforcement learning algorithm on the
automated vehicle agent to find an optimal driving policy by maximizing the
long-term reward in an interactive driving environment. Most importantly, in
contrast to most reinforcement learning applications in which the action space
is resolved as discrete, our approach treats the action space as well as the
state space as continuous without incurring additional computational costs. Our
unique contribution is the design of the Q-function approximation whose format
is structured as a quadratic function, by which simple but effective neural
networks are used to estimate its coefficients. The results obtained through
the implementation of our training platform demonstrate that the vehicle agent
is able to learn a safe, smooth and timely merging policy, indicating the
effectiveness and practicality of our approach.
| cs.AI cs.RO | ramp merging is a critical maneuver for road safety and traffic efficiency most of the current automated driving systems developed by multiple automobile manufacturers and suppliers are typically limited to restricted access freeways only extending the automated mode to ramp merging zones presents substantial challenges one is that the automated vehicle needs to incorporate a future objective eg a successful and smooth merge and optimize a longterm reward that is impacted by subsequent actions when executing the current action furthermore the merging process involves interaction between the merging vehicle and its surrounding vehicles whose behavior may be cooperative or adversarial leading to distinct merging countermeasures that are crucial to successfully complete the merge in place of the conventional rulebased approaches we propose to apply reinforcement learning algorithm on the automated vehicle agent to find an optimal driving policy by maximizing the longterm reward in an interactive driving environment most importantly in contrast to most reinforcement learning applications in which the action space is resolved as discrete our approach treats the action space as well as the state space as continuous without incurring additional computational costs our unique contribution is the design of the qfunction approximation whose format is structured as a quadratic function by which simple but effective neural networks are used to estimate its coefficients the results obtained through the implementation of our training platform demonstrate that the vehicle agent is able to learn a safe smooth and timely merging policy indicating the effectiveness and practicality of our approach | [['ramp', 'merging', 'is', 'a', 'critical', 'maneuver', 'for', 'road', 'safety', 'and', 'traffic', 'efficiency', 'most', 'of', 'the', 'current', 'automated', 'driving', 'systems', 'developed', 'by', 'multiple', 'automobile', 'manufacturers', 'and', 'suppliers', 'are', 'typically', 'limited', 'to', 'restricted', 'access', 'freeways', 'only', 'extending', 'the', 'automated', 'mode', 'to', 'ramp', 'merging', 'zones', 'presents', 'substantial', 'challenges', 'one', 'is', 'that', 'the', 'automated', 'vehicle', 'needs', 'to', 'incorporate', 'a', 'future', 'objective', 'eg', 'a', 'successful', 'and', 'smooth', 'merge', 'and', 'optimize', 'a', 'longterm', 'reward', 'that', 'is', 'impacted', 'by', 'subsequent', 'actions', 'when', 'executing', 'the', 'current', 'action', 'furthermore', 'the', 'merging', 'process', 'involves', 'interaction', 'between', 'the', 'merging', 'vehicle', 'and', 'its', 'surrounding', 'vehicles', 'whose', 'behavior', 'may', 'be', 'cooperative', 'or', 'adversarial', 'leading', 'to', 'distinct', 'merging', 'countermeasures', 'that', 'are', 'crucial', 'to', 'successfully', 'complete', 'the', 'merge', 'in', 'place', 'of', 'the', 'conventional', 'rulebased', 'approaches', 'we', 'propose', 'to', 'apply', 'reinforcement', 'learning', 'algorithm', 'on', 'the', 'automated', 'vehicle', 'agent', 'to', 'find', 'an', 'optimal', 'driving', 'policy', 'by', 'maximizing', 'the', 'longterm', 'reward', 'in', 'an', 'interactive', 'driving', 'environment', 'most', 'importantly', 'in', 'contrast', 'to', 'most', 'reinforcement', 'learning', 'applications', 'in', 'which', 'the', 'action', 'space', 'is', 'resolved', 'as', 'discrete', 'our', 'approach', 'treats', 'the', 'action', 'space', 'as', 'well', 'as', 'the', 'state', 'space', 'as', 'continuous', 'without', 'incurring', 'additional', 'computational', 'costs', 'our', 'unique', 'contribution', 'is', 'the', 'design', 'of', 'the', 'qfunction', 'approximation', 'whose', 'format', 'is', 'structured', 'as', 'a', 'quadratic', 'function', 'by', 'which', 'simple', 'but', 'effective', 'neural', 'networks', 'are', 'used', 'to', 'estimate', 'its', 'coefficients', 'the', 'results', 'obtained', 'through', 'the', 'implementation', 'of', 'our', 'training', 'platform', 'demonstrate', 'that', 'the', 'vehicle', 'agent', 'is', 'able', 'to', 'learn', 'a', 'safe', 'smooth', 'and', 'timely', 'merging', 'policy', 'indicating', 'the', 'effectiveness', 'and', 'practicality', 'of', 'our', 'approach']] | [-0.10776542642433197, 0.058036929039866667, -0.07452142946235836, 0.04406043044132093, -0.143385632510297, -0.15691403509490193, 0.08768654631171376, 0.428603213571012, -0.27103855695435775, -0.319121692661196, 0.1152351475271862, -0.23612018752656877, -0.16350658644386568, 0.2052204650316853, -0.12003147060051561, 0.08016097027715295, 0.0758095266171731, 0.04161919440096244, -0.002592482481151819, -0.26109574146289377, 0.29643264136742803, 0.04309645147807896, 0.2971567659936845, 0.032851228130981326, 0.13089212235016748, 0.03117149867117405, -0.006764439037069679, -0.012299398925970309, -0.024447999082971364, 0.12014182075113058, 0.3309527826097328, 0.17678643929772078, 0.3659069770947099, -0.4387912293188274, -0.21734379110485316, 0.08874418922606855, 0.13357566610019422, 0.07181186295300722, -0.039053903197753245, -0.3130832871524617, 0.08314353919704445, -0.2092424479201436, -0.07913836664427072, -0.10626599795860238, -0.01402867085300386, 0.01919439645577222, -0.3060138411170337, -0.01724085812701378, 0.044355372878257186, 0.01328341332450509, -0.06624618998542428, -0.051586112273856996, -0.02215940910950303, 0.20797959836258087, 0.04726526684768032, 0.0780803344892338, 0.1980665258602239, -0.16171334718819708, -0.15799949939269572, 0.3783540044873953, -0.0218865849878639, -0.1660069108805619, 0.21080836357176305, -0.025132537725381553, -0.1059880071990192, 0.13233352380921132, 0.22486674394994044, 0.11153913229028695, -0.17359278423088836, 0.006165875593433156, 0.03044282027799636, 0.1491880499527324, 0.0200556722888723, -0.021050861939787866, 0.18907015261030755, 0.23157987457793205, 0.12708314062003045, 0.11801145299570635, -0.05629938009893522, -0.1380541638340801, -0.24247919592098333, -0.11544523029588163, -0.16793886803870556, -0.008237745213788002, -0.07438387377146864, -0.1272466559339664, 0.35699012110941114, 0.196166897686664, 0.176265527801821, 0.08631387416645885, 0.3989631500169635, 0.09613526590843685, 0.08690708657726645, 0.11134831701219082, 0.2199106016661972, -0.008346876812167465, 0.1157927705142647, -0.23482808386022225, 0.14036519213486462, 0.0343856291109696] |
1,803.09204 | New general parametrization of quintessence fields and its observational
constraints | We present a new parameterization of quintessence potentials for dark energy
based directly upon the dynamical properties of the equations of motion. Such
parameterization arises naturally once the equations of motion are written as a
dynamical system in terms of properly defined polar variables. We have
identified two different classes of parameters, and we dubbed them as dynamical
and passive parameters. The dynamical parameters appear explicitly in the
equations of motion, but the passive parameters play just a secondary role in
their solutions. The new approach is applied to the so-called thawing
potentials and it is argued that only three dynamical parameters are sufficient
to capture the evolution of the quintessence fields at late times. This work
reconfirms the arbitrariness of the quintessence potentials as the recent
observational data fail to constrain the dynamical parameters.
| gr-qc astro-ph.CO math.DS | we present a new parameterization of quintessence potentials for dark energy based directly upon the dynamical properties of the equations of motion such parameterization arises naturally once the equations of motion are written as a dynamical system in terms of properly defined polar variables we have identified two different classes of parameters and we dubbed them as dynamical and passive parameters the dynamical parameters appear explicitly in the equations of motion but the passive parameters play just a secondary role in their solutions the new approach is applied to the socalled thawing potentials and it is argued that only three dynamical parameters are sufficient to capture the evolution of the quintessence fields at late times this work reconfirms the arbitrariness of the quintessence potentials as the recent observational data fail to constrain the dynamical parameters | [['we', 'present', 'a', 'new', 'parameterization', 'of', 'quintessence', 'potentials', 'for', 'dark', 'energy', 'based', 'directly', 'upon', 'the', 'dynamical', 'properties', 'of', 'the', 'equations', 'of', 'motion', 'such', 'parameterization', 'arises', 'naturally', 'once', 'the', 'equations', 'of', 'motion', 'are', 'written', 'as', 'a', 'dynamical', 'system', 'in', 'terms', 'of', 'properly', 'defined', 'polar', 'variables', 'we', 'have', 'identified', 'two', 'different', 'classes', 'of', 'parameters', 'and', 'we', 'dubbed', 'them', 'as', 'dynamical', 'and', 'passive', 'parameters', 'the', 'dynamical', 'parameters', 'appear', 'explicitly', 'in', 'the', 'equations', 'of', 'motion', 'but', 'the', 'passive', 'parameters', 'play', 'just', 'a', 'secondary', 'role', 'in', 'their', 'solutions', 'the', 'new', 'approach', 'is', 'applied', 'to', 'the', 'socalled', 'thawing', 'potentials', 'and', 'it', 'is', 'argued', 'that', 'only', 'three', 'dynamical', 'parameters', 'are', 'sufficient', 'to', 'capture', 'the', 'evolution', 'of', 'the', 'quintessence', 'fields', 'at', 'late', 'times', 'this', 'work', 'reconfirms', 'the', 'arbitrariness', 'of', 'the', 'quintessence', 'potentials', 'as', 'the', 'recent', 'observational', 'data', 'fail', 'to', 'constrain', 'the', 'dynamical', 'parameters']] | [-0.13871356877843263, 0.1358710210563408, -0.1240860327112454, 0.092841336049174, -0.09314548691941632, -0.10709093396758868, -0.03969424888319163, 0.2961077181570646, -0.2719579434884643, -0.3408682346895889, 0.07120941336594384, -0.21566399197887492, -0.15151566124900623, 0.17249513273989714, -0.02293260791166513, 0.06288906148100203, 0.007286675091556929, 0.035019387589353655, -0.07945401929491372, -0.24860202649401295, 0.3504829348832438, 0.009700843809103524, 0.1950340842728986, -0.02326235883800244, 0.1169668569997022, -0.029528626926346786, -0.022009475744777806, 0.010820465955745292, -0.16141340796931655, 0.039944049428837995, 0.19506817922272063, 0.12845405892089562, 0.2262947072878618, -0.41451842514453113, -0.2804029452511006, 0.12016159024055081, 0.13466951034066302, 0.11683476462408349, -0.032847906894016045, -0.2554688291279254, 0.024996430727144428, -0.16500908161548, -0.16706056172649067, -0.08302779275992954, 0.02671661381437271, 0.07425820249632967, -0.25756671007170723, 0.10979872481828487, 0.05306872991905375, 0.0034656324113408726, -0.12658232531027386, -0.09484055953496998, -0.039168088565822004, 0.13120476756313884, 0.07460095558005074, -0.004809675327743645, 0.14967902150625984, -0.16921268590312039, -0.06504417221898351, 0.3997356831751488, -0.07958146796768738, -0.21808501486149098, 0.21281266586544614, -0.084181783500093, -0.1581077084083248, 0.0853715099842736, 0.16718554937591154, 0.12546252299928004, -0.20961271924898028, 0.09430808981889169, 0.023262429071797264, 0.14029750406604122, 0.01917317846307048, 0.044618017633480056, 0.24384473476696897, 0.11451744747486103, -0.009351657660402081, 0.09219400969299453, -0.04041397996371853, -0.1426787057477567, -0.31555760308272307, -0.11307656206190586, -0.13099205144163634, 0.017604043169369647, -0.10666408260424053, -0.1691913817026135, 0.4269308990764397, 0.14808953384420387, 0.22771453982977954, -0.008134941925743112, 0.2553018238533426, 0.12438546285524757, 0.08117295880457041, 0.040690063899038016, 0.30036397840551754, 0.11332986545231608, 0.1025025943984036, -0.2336375912649264, 0.029459895390620525, 0.06386511931885723] |
1,803.09205 | Updating the MACHO fraction of the Milky Way dark halo with improved
mass models | Recent interest in primordial black holes as a possible dark matter candidate
has motivated the reanalysis of previous methods for constraining massive
astrophysical compact objects in the Milky Way halo and beyond. In order to
derive these constraints, a model for the dark matter distribution around the
Milky Way must be used. Previous microlensing searches have assumed a
semi-isothermal density sphere for this task. We show this model is no longer
consistent with data from the Milky Way rotation curve, and test two
replacement models, namely NFW and power-law. The power-law model is the most
flexible as it can break spherical symmetry, and best fits the data. Thus, we
recommend the power-law model as a replacement, although it still lacks the
flexibility to fully encapsulate all possible shapes of the Milky Way halo. We
then use the power-law model to rederive some previous microlensing constraints
in the literature, while propagating the primary halo-shape uncertainties
through to our final constraints. Our analysis reveals that the microlensing
constraints towards the Large Magellanic Cloud weaken somewhat for MACHO masses
around $10\, M_\odot$ when this uncertainty is taken into account, but the
constraints tighten at lower masses. Exploring some of the simplifying
assumptions of previous constraints we also study the effect of wide mass
distributions of compact halo objects, as well as the effect of spatial
clustering on microlensing constraints. We find that both effects induce a
shift in the constraints towards smaller masses, and can effectively remove the
microlensing constraints from $M \sim 1-10 M_\odot$ for certain MACHO
populations.
| astro-ph.CO | recent interest in primordial black holes as a possible dark matter candidate has motivated the reanalysis of previous methods for constraining massive astrophysical compact objects in the milky way halo and beyond in order to derive these constraints a model for the dark matter distribution around the milky way must be used previous microlensing searches have assumed a semiisothermal density sphere for this task we show this model is no longer consistent with data from the milky way rotation curve and test two replacement models namely nfw and powerlaw the powerlaw model is the most flexible as it can break spherical symmetry and best fits the data thus we recommend the powerlaw model as a replacement although it still lacks the flexibility to fully encapsulate all possible shapes of the milky way halo we then use the powerlaw model to rederive some previous microlensing constraints in the literature while propagating the primary haloshape uncertainties through to our final constraints our analysis reveals that the microlensing constraints towards the large magellanic cloud weaken somewhat for macho masses around 10 m_odot when this uncertainty is taken into account but the constraints tighten at lower masses exploring some of the simplifying assumptions of previous constraints we also study the effect of wide mass distributions of compact halo objects as well as the effect of spatial clustering on microlensing constraints we find that both effects induce a shift in the constraints towards smaller masses and can effectively remove the microlensing constraints from m sim 110 m_odot for certain macho populations | [['recent', 'interest', 'in', 'primordial', 'black', 'holes', 'as', 'a', 'possible', 'dark', 'matter', 'candidate', 'has', 'motivated', 'the', 'reanalysis', 'of', 'previous', 'methods', 'for', 'constraining', 'massive', 'astrophysical', 'compact', 'objects', 'in', 'the', 'milky', 'way', 'halo', 'and', 'beyond', 'in', 'order', 'to', 'derive', 'these', 'constraints', 'a', 'model', 'for', 'the', 'dark', 'matter', 'distribution', 'around', 'the', 'milky', 'way', 'must', 'be', 'used', 'previous', 'microlensing', 'searches', 'have', 'assumed', 'a', 'semiisothermal', 'density', 'sphere', 'for', 'this', 'task', 'we', 'show', 'this', 'model', 'is', 'no', 'longer', 'consistent', 'with', 'data', 'from', 'the', 'milky', 'way', 'rotation', 'curve', 'and', 'test', 'two', 'replacement', 'models', 'namely', 'nfw', 'and', 'powerlaw', 'the', 'powerlaw', 'model', 'is', 'the', 'most', 'flexible', 'as', 'it', 'can', 'break', 'spherical', 'symmetry', 'and', 'best', 'fits', 'the', 'data', 'thus', 'we', 'recommend', 'the', 'powerlaw', 'model', 'as', 'a', 'replacement', 'although', 'it', 'still', 'lacks', 'the', 'flexibility', 'to', 'fully', 'encapsulate', 'all', 'possible', 'shapes', 'of', 'the', 'milky', 'way', 'halo', 'we', 'then', 'use', 'the', 'powerlaw', 'model', 'to', 'rederive', 'some', 'previous', 'microlensing', 'constraints', 'in', 'the', 'literature', 'while', 'propagating', 'the', 'primary', 'haloshape', 'uncertainties', 'through', 'to', 'our', 'final', 'constraints', 'our', 'analysis', 'reveals', 'that', 'the', 'microlensing', 'constraints', 'towards', 'the', 'large', 'magellanic', 'cloud', 'weaken', 'somewhat', 'for', 'macho', 'masses', 'around', '10', 'm_odot', 'when', 'this', 'uncertainty', 'is', 'taken', 'into', 'account', 'but', 'the', 'constraints', 'tighten', 'at', 'lower', 'masses', 'exploring', 'some', 'of', 'the', 'simplifying', 'assumptions', 'of', 'previous', 'constraints', 'we', 'also', 'study', 'the', 'effect', 'of', 'wide', 'mass', 'distributions', 'of', 'compact', 'halo', 'objects', 'as', 'well', 'as', 'the', 'effect', 'of', 'spatial', 'clustering', 'on', 'microlensing', 'constraints', 'we', 'find', 'that', 'both', 'effects', 'induce', 'a', 'shift', 'in', 'the', 'constraints', 'towards', 'smaller', 'masses', 'and', 'can', 'effectively', 'remove', 'the', 'microlensing', 'constraints', 'from', 'm', 'sim', '110', 'm_odot', 'for', 'certain', 'macho', 'populations']] | [-0.07735469785617943, 0.07365155934656817, -0.12073090606493743, 0.13654758227121921, -0.15221427821583577, -0.08598756426981995, 0.04306350782051624, 0.35298909112723087, -0.19432910099601755, -0.41531827480818223, 0.044346621695916924, -0.2685916188400327, -0.04442405004024975, 0.2147512967234448, -0.029550724734067408, 0.041541308883025756, 0.040444553292569095, -0.045703449016106935, -0.0714859916891822, -0.2458926837444012, 0.30089449124066087, 0.06562813665666507, 0.19055285155919827, -0.003610875100029383, 0.03133440276838868, -0.036088924985158984, -0.06172168242752435, -0.010045258738980519, -0.15617715629161652, 0.062458054423121384, 0.1796289863434326, 0.15453102754559148, 0.19570481377529111, -0.3967026143635469, -0.26119907226083033, 0.1336478536992561, 0.1920952067204465, 0.1070906989428574, -0.07905222195627784, -0.2872885035710248, 0.06670445622326293, -0.21626420519369705, -0.1563069400584736, -0.015919826730469783, 0.0463946147759511, 0.005039902697968128, -0.2475365871288786, 0.11029868727395455, 0.05848210199605894, -0.016035217938460702, -0.0793122265838072, -0.13202377759088857, -0.05438568029923027, 0.07963387558466341, 0.09618451112150728, 0.03433295724937311, 0.1783523457560241, -0.1387277979808896, -0.03577593031365014, 0.4396906327676233, -0.07773836782728286, -0.12125097307116234, 0.16754749094642055, -0.17244679331009488, -0.21960310097857136, 0.0774978883445307, 0.17243544794215754, 0.1114170554343347, -0.18857742111340914, 0.06530492739155191, -0.0488769150853311, 0.19416370504722733, 0.05196636107449574, 0.04571479890453373, 0.3378902610032049, 0.1621643920423551, 0.0861145879580148, 0.07264147451473767, -0.14562732148154706, -0.07039954922644158, -0.2719236533927519, -0.07059591422389137, -0.12476807670126024, 0.03322133118089419, -0.13961356254375867, -0.09518213199238902, 0.3198764552013934, 0.17483081910887543, 0.2543911881906193, 0.10447455217005817, 0.35287818512551894, 0.06649422493128943, 0.11016972250613112, 0.0665656648075307, 0.3018398708345343, 0.11270708656745164, 0.046860835878875136, -0.17696758477002617, 0.06924565098162257, -0.04793603813338027] |
1,803.09206 | Agent-Based Implementation of Particle Hopping Traffic Model With
Stochastic and Queuing Elements | Lagging or halted traffic is bothersome. As such, it is desirable to have a
model that can begin to determine the efficiency of various traffic
standardizations. Our model intended to create a multifaceted realistic
simulation of traffic flow while considering several factors. These factors
included: passing conventions, e.g., right except to pass (REP) rule, system
perturbation caused by insertion of an accident into the system, accessible
number of lanes available with the REP, various human factors such as variation
of individual maximum speed and likelihood to pass. A succession of models were
created from a variation on an existing single-lane traffic model and adding
extra dimensionality to the lattice to include multiple lanes, passing
conventions, stochastic elements for individuality, and queuing rules to
movement algorithms. We found that the REP is an effective means of increasing
the critical density that a system can support. Eliminating human factors and
thereby automating the system, results in a 160% increase in the sustainable
critical density of the system. The number of lanes increases the critical
density of the system, but the maximum efficiency of the speed distribution
remains the same. Excluding system automation, the optimal speed distribution
for drivers maximal speed was found to be Beta(5,5). Accidents in stable
systems can cause small local jams without causing global jams.
| nlin.CG stat.AP | lagging or halted traffic is bothersome as such it is desirable to have a model that can begin to determine the efficiency of various traffic standardizations our model intended to create a multifaceted realistic simulation of traffic flow while considering several factors these factors included passing conventions eg right except to pass rep rule system perturbation caused by insertion of an accident into the system accessible number of lanes available with the rep various human factors such as variation of individual maximum speed and likelihood to pass a succession of models were created from a variation on an existing singlelane traffic model and adding extra dimensionality to the lattice to include multiple lanes passing conventions stochastic elements for individuality and queuing rules to movement algorithms we found that the rep is an effective means of increasing the critical density that a system can support eliminating human factors and thereby automating the system results in a 160 increase in the sustainable critical density of the system the number of lanes increases the critical density of the system but the maximum efficiency of the speed distribution remains the same excluding system automation the optimal speed distribution for drivers maximal speed was found to be beta55 accidents in stable systems can cause small local jams without causing global jams | [['lagging', 'or', 'halted', 'traffic', 'is', 'bothersome', 'as', 'such', 'it', 'is', 'desirable', 'to', 'have', 'a', 'model', 'that', 'can', 'begin', 'to', 'determine', 'the', 'efficiency', 'of', 'various', 'traffic', 'standardizations', 'our', 'model', 'intended', 'to', 'create', 'a', 'multifaceted', 'realistic', 'simulation', 'of', 'traffic', 'flow', 'while', 'considering', 'several', 'factors', 'these', 'factors', 'included', 'passing', 'conventions', 'eg', 'right', 'except', 'to', 'pass', 'rep', 'rule', 'system', 'perturbation', 'caused', 'by', 'insertion', 'of', 'an', 'accident', 'into', 'the', 'system', 'accessible', 'number', 'of', 'lanes', 'available', 'with', 'the', 'rep', 'various', 'human', 'factors', 'such', 'as', 'variation', 'of', 'individual', 'maximum', 'speed', 'and', 'likelihood', 'to', 'pass', 'a', 'succession', 'of', 'models', 'were', 'created', 'from', 'a', 'variation', 'on', 'an', 'existing', 'singlelane', 'traffic', 'model', 'and', 'adding', 'extra', 'dimensionality', 'to', 'the', 'lattice', 'to', 'include', 'multiple', 'lanes', 'passing', 'conventions', 'stochastic', 'elements', 'for', 'individuality', 'and', 'queuing', 'rules', 'to', 'movement', 'algorithms', 'we', 'found', 'that', 'the', 'rep', 'is', 'an', 'effective', 'means', 'of', 'increasing', 'the', 'critical', 'density', 'that', 'a', 'system', 'can', 'support', 'eliminating', 'human', 'factors', 'and', 'thereby', 'automating', 'the', 'system', 'results', 'in', 'a', '160', 'increase', 'in', 'the', 'sustainable', 'critical', 'density', 'of', 'the', 'system', 'the', 'number', 'of', 'lanes', 'increases', 'the', 'critical', 'density', 'of', 'the', 'system', 'but', 'the', 'maximum', 'efficiency', 'of', 'the', 'speed', 'distribution', 'remains', 'the', 'same', 'excluding', 'system', 'automation', 'the', 'optimal', 'speed', 'distribution', 'for', 'drivers', 'maximal', 'speed', 'was', 'found', 'to', 'be', 'beta55', 'accidents', 'in', 'stable', 'systems', 'can', 'cause', 'small', 'local', 'jams', 'without', 'causing', 'global', 'jams']] | [-0.15997920173699534, 0.11863519076960496, -0.0673341264915761, 0.04632590629192892, -0.05025060294239327, -0.12947152700101913, 0.10658278878680755, 0.3517911774994329, -0.28688606024221625, -0.352923186968059, 0.11077907659860631, -0.27303509806867604, -0.11256971202335905, 0.17627910432124208, -0.10232350356270407, 0.07378558034326362, 0.0482140870125921, 0.04350573094453403, -0.0018251855327033027, -0.2354528468178022, 0.2567215277098639, 0.0664300033541093, 0.31067758930283923, 0.05875039951074435, 0.08499841945094251, -0.0028925271325766348, -0.02723123263892566, 0.03381094146373703, -0.050055220555805136, 0.10443893016456778, 0.2258744289916649, 0.16506206598782608, 0.2730406616467896, -0.4550559451933517, -0.26161079884961597, 0.10379383977459267, 0.16414093968118704, 0.10180854727838969, 0.010245482936544821, -0.2774953547285783, 0.09940175244443898, -0.20498007543731567, -0.15383958455478383, -0.04974919007874506, 0.028301798462391246, 0.04827198062368214, -0.2729604753297429, 0.05329537412170646, 0.038507417647904434, 0.0697031611923215, -0.033996066118612195, -0.09559286337746524, -0.053756095133288655, 0.18451434962538094, 0.06784185521510365, 0.006069172785866486, 0.18999314137063053, -0.18768906342082245, -0.08362886315579851, 0.39614211333439103, -0.025313535173488565, -0.1490854332981588, 0.2058916086504279, -0.07151765544292366, -0.07449568302200046, 0.15835222786530678, 0.21235108134921554, 0.04393423657680234, -0.14175854426873633, -0.01078245749068988, -0.0005271682358715077, 0.18638632417504872, 0.07115584156627572, -0.030510631406159942, 0.19803748027703097, 0.17211946083644275, 0.09202940946141648, 0.08920734194053206, -0.08301543709607105, -0.11893039878761005, -0.2686646929468288, -0.1311533853173429, -0.11128206043287592, 0.008168114100239066, -0.09071158301653774, -0.12648635864214494, 0.36365846827366327, 0.18026733037387563, 0.19338418012281858, 0.031505014804776674, 0.3018181351230068, 0.11992739869747311, 0.09376833615228967, 0.10187753703835052, 0.18947302780850508, 0.0461686882049625, 0.11372516729955583, -0.22458244504970173, 0.11511163445904331, 0.017072014129439067] |
1,803.09207 | Revisiting Mayer: Symmetric solutions for sporadic cases of the Map
Color Theorem | The original proof of the genus of the complete graphs $K_n$ depended on
Mayer's \emph{ad hoc} solutions for $n = 18, 20, 23$. Recently, an improved
solution for $K_{20}$ was found by the author. The purpose of this note is to
use the theory of current graphs to interpret the aforementioned result and to
provide new embeddings of $K_{18}$ and $K_{23}$.
| math.CO | the original proof of the genus of the complete graphs k_n depended on mayers emphad hoc solutions for n 18 20 23 recently an improved solution for k_20 was found by the author the purpose of this note is to use the theory of current graphs to interpret the aforementioned result and to provide new embeddings of k_18 and k_23 | [['the', 'original', 'proof', 'of', 'the', 'genus', 'of', 'the', 'complete', 'graphs', 'k_n', 'depended', 'on', 'mayers', 'emphad', 'hoc', 'solutions', 'for', 'n', '18', '20', '23', 'recently', 'an', 'improved', 'solution', 'for', 'k_20', 'was', 'found', 'by', 'the', 'author', 'the', 'purpose', 'of', 'this', 'note', 'is', 'to', 'use', 'the', 'theory', 'of', 'current', 'graphs', 'to', 'interpret', 'the', 'aforementioned', 'result', 'and', 'to', 'provide', 'new', 'embeddings', 'of', 'k_18', 'and', 'k_23']] | [-0.10673786036007232, 0.027542449646655046, -0.05189028001879736, 0.07367894945318922, -0.08649026578828944, -0.0834051834940279, 0.05194050131042062, 0.31583480420127763, -0.19773961180994698, -0.37377356785207483, 0.10369137478045236, -0.2917105003370572, -0.13661026520954478, 0.16778426866788984, -0.12564195604931752, 0.04403636374084626, 0.07151616609386974, 0.06815822616710833, -0.014261989428077713, -0.3094908402190875, 0.32268098095368786, 0.0329487232799184, 0.23929308640565408, 0.12621963871800798, 0.056560870173182023, 0.0021645266925758226, -0.07479034888289743, -0.013981774275712037, -0.18405954036230254, 0.14669717147441233, 0.21614126061578676, 0.13327627618781338, 0.20713717507798288, -0.4000561514837762, -0.16870581892208528, 0.10206585967818559, 0.14295620657503605, 0.10238648597466743, 0.006985344045984922, -0.2600018983564766, 0.1279333157591143, -0.13846109182400218, -0.15131109325467781, -0.0441077764272311, 0.07569746774131969, -0.0027385152308112485, -0.2429724180976213, -0.0067907161063562, 0.12641558440212727, 0.07583493824606224, -0.022631180677878653, -0.1569726617564842, 0.011006683882688946, 0.11567744757916967, 0.023587500783062335, 0.09013761609192875, 0.010132330990696357, -0.08288028041074463, -0.1543656198043471, 0.3260503565355883, -0.03610260785809892, -0.14887737018703404, 0.12117371726702204, -0.08237828063715438, -0.18242293018532002, 0.11793432422613694, 0.08295537373524602, 0.1715432950058731, -0.14342477436224788, 0.09665748558867471, -0.056234361039537745, 0.14866249970460343, 0.10727467174815425, -0.03692407618766114, 0.06758854358251822, 0.12252480619669875, 0.09251965666031939, 0.14070878375195345, 0.0011289549115413831, -0.03241379757143431, -0.28073311661827866, -0.16376280266065465, -0.16809369256656806, 0.1078072467787286, -0.12832110462724072, -0.16917700816135287, 0.4259409530530289, 0.12225426556996338, 0.18308206846527122, 0.12273786993602574, 0.22275476782756337, 0.06555070342906451, 0.04420856046549566, 0.08184756704022066, 0.25119997939031763, 0.16720292493069577, 0.11624307846019076, -0.1114456201666745, 0.03547932309398459, 0.16436749342355436] |
1,803.09208 | Unsupervised Domain Adaptation: A Multi-task Learning-based Method | This paper presents a novel multi-task learning-based method for unsupervised
domain adaptation. Specifically, the source and target domain classifiers are
jointly learned by considering the geometry of target domain and the divergence
between the source and target domains based on the concept of multi-task
learning. Two novel algorithms are proposed upon the method using Regularized
Least Squares and Support Vector Machines respectively. Experiments on both
synthetic and real world cross domain recognition tasks have shown that the
proposed methods outperform several state-of-the-art domain adaptation methods.
| cs.CV | this paper presents a novel multitask learningbased method for unsupervised domain adaptation specifically the source and target domain classifiers are jointly learned by considering the geometry of target domain and the divergence between the source and target domains based on the concept of multitask learning two novel algorithms are proposed upon the method using regularized least squares and support vector machines respectively experiments on both synthetic and real world cross domain recognition tasks have shown that the proposed methods outperform several stateoftheart domain adaptation methods | [['this', 'paper', 'presents', 'a', 'novel', 'multitask', 'learningbased', 'method', 'for', 'unsupervised', 'domain', 'adaptation', 'specifically', 'the', 'source', 'and', 'target', 'domain', 'classifiers', 'are', 'jointly', 'learned', 'by', 'considering', 'the', 'geometry', 'of', 'target', 'domain', 'and', 'the', 'divergence', 'between', 'the', 'source', 'and', 'target', 'domains', 'based', 'on', 'the', 'concept', 'of', 'multitask', 'learning', 'two', 'novel', 'algorithms', 'are', 'proposed', 'upon', 'the', 'method', 'using', 'regularized', 'least', 'squares', 'and', 'support', 'vector', 'machines', 'respectively', 'experiments', 'on', 'both', 'synthetic', 'and', 'real', 'world', 'cross', 'domain', 'recognition', 'tasks', 'have', 'shown', 'that', 'the', 'proposed', 'methods', 'outperform', 'several', 'stateoftheart', 'domain', 'adaptation', 'methods']] | [0.0021995068377103, -0.0486053936621722, -0.07020733508774463, 0.029044743938207187, -0.14041050520232495, -0.1838725309106795, 0.013262896964271718, 0.5142628578578725, -0.264993522086126, -0.28563056960701944, 0.1016330586910686, -0.2535703192519791, -0.20836941941696055, 0.22539028862819951, -0.1224967522546649, 0.12084447421982665, 0.13228858527453508, 0.05020038218182676, -0.08238178398186231, -0.29045949269305255, 0.3805970516357133, -0.036097093277117784, 0.4320966228404466, 0.04671260176007362, 0.19091765950159992, -0.02174445199506248, -0.05138581054805614, -0.01166384712080745, -0.03389917738942826, 0.22555831482853084, 0.31221972720094904, 0.24978234466603574, 0.3339106151724563, -0.3680500018465168, -0.26294842324055295, 0.08958280900602832, 0.14345642055439597, 0.06278007428216584, -0.04139132272753426, -0.3811787965323995, 0.08439091325134915, -0.1318382515298093, 0.05756788232418544, -0.17516499086255755, -0.09044405197834267, 0.014506909273126546, -0.3007631104439497, 0.030679299964514725, 0.10708364622448296, 0.08064686686677092, -0.12015250122640282, -0.18888285489862455, 0.10821671981145353, 0.12874187571818338, 0.04715274261201129, 0.07925560026265242, 0.1313486591091051, -0.14232979055617334, -0.23609957888804595, 0.2926888640093453, -0.07609880737522069, -0.2937618277788929, 0.23528011152246858, 0.007762076919350554, -0.09620456685695578, 0.0705696063088801, 0.289952868069796, 0.19138902048854267, -0.1749927246285712, 0.044385508630726045, -0.026406124376637093, 0.16082232870599802, 0.06851319292395869, -0.07185126381981022, 0.14551505423219435, 0.27272272827925487, 0.047778690773445896, 0.14613918442388668, -0.1801335237482015, -0.08213375936097958, -0.22660870200351757, -0.0587332820848507, -0.2498296143158394, -0.14898286502370062, -0.10411253958197503, -0.1125954817114261, 0.3816156720633016, 0.17607103314469844, 0.19070591765784603, 0.10115957335733315, 0.3785069938091671, 0.004086147714406252, 0.08845346821472048, 0.13061437682413002, 0.15401592544033466, 0.018496195799397194, 0.13395070547566695, -0.2298851968610988, 0.04798046425532769, 0.06285364842590163] |
1,803.09209 | Watt-level dysprosium fiber laser at 3.15 {\mu}m with 73% slope
efficiency | Rare-earth-doped fiber lasers are emerging as promising high-power
mid-infrared sources for the 2.6-3.0 {\mu}m and 3.3-3.8 {\mu}m regions based on
erbium and holmium ions. The intermediate wavelength range, however, remains
vastly underserved, despite prospects for important manufacturing and defense
applications. Here, we demonstrate the potential of dysprosium-doped fiber to
solve this problem, with a simple in-band pumped grating-stabilized linear
cavity generating up to 1.06 W at 3.15 {\mu}m. A slope efficiency of 73% with
respect to launched power (77% relative to absorbed power) is achieved: the
highest value for any mid-infrared fiber laser to date, to the best of our
knowledge. Opportunities for further power and efficiency scaling are also
discussed.
| physics.optics | rareearthdoped fiber lasers are emerging as promising highpower midinfrared sources for the 2630 mum and 3338 mum regions based on erbium and holmium ions the intermediate wavelength range however remains vastly underserved despite prospects for important manufacturing and defense applications here we demonstrate the potential of dysprosiumdoped fiber to solve this problem with a simple inband pumped gratingstabilized linear cavity generating up to 106 w at 315 mum a slope efficiency of 73 with respect to launched power 77 relative to absorbed power is achieved the highest value for any midinfrared fiber laser to date to the best of our knowledge opportunities for further power and efficiency scaling are also discussed | [['rareearthdoped', 'fiber', 'lasers', 'are', 'emerging', 'as', 'promising', 'highpower', 'midinfrared', 'sources', 'for', 'the', '2630', 'mum', 'and', '3338', 'mum', 'regions', 'based', 'on', 'erbium', 'and', 'holmium', 'ions', 'the', 'intermediate', 'wavelength', 'range', 'however', 'remains', 'vastly', 'underserved', 'despite', 'prospects', 'for', 'important', 'manufacturing', 'and', 'defense', 'applications', 'here', 'we', 'demonstrate', 'the', 'potential', 'of', 'dysprosiumdoped', 'fiber', 'to', 'solve', 'this', 'problem', 'with', 'a', 'simple', 'inband', 'pumped', 'gratingstabilized', 'linear', 'cavity', 'generating', 'up', 'to', '106', 'w', 'at', '315', 'mum', 'a', 'slope', 'efficiency', 'of', '73', 'with', 'respect', 'to', 'launched', 'power', '77', 'relative', 'to', 'absorbed', 'power', 'is', 'achieved', 'the', 'highest', 'value', 'for', 'any', 'midinfrared', 'fiber', 'laser', 'to', 'date', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'opportunities', 'for', 'further', 'power', 'and', 'efficiency', 'scaling', 'are', 'also', 'discussed']] | [-0.055321467319630425, 0.11024085586382584, 0.02510781750844961, -0.04022158012481999, -0.04030336636033925, -0.1755841739475727, 0.0805432253898206, 0.478871306294406, -0.2128999545831572, -0.3194006197646641, 0.07021673313680697, -0.29182622488588095, -0.044037811098281636, 0.2917426518757235, -0.05494108223356307, 0.07858657089739361, -0.009864769782871008, -0.09879265583374283, 0.028728733508085663, -0.18511708384718406, 0.21572377163154835, 0.13217875199096107, 0.32981886391697285, 0.0767493968247436, 0.1204107817812738, -0.07813171611103992, 0.01053742128001018, -0.08355147090147842, -0.12897901587315241, 0.14357397003755482, 0.3049773491993123, 0.0269311687274074, 0.2731144720360383, -0.32815363898196004, -0.21032556448639794, 0.08436153257181021, 0.14395851765716958, 0.04403169523416595, -0.06577112225667489, -0.2159834543221884, 0.1212696639905599, -0.18314470030071045, -0.1607798562744971, -0.025578542731025004, 0.059151549730449914, 0.052494674861769786, -0.25852244231341914, 0.0037901729194510896, -0.004436927002693251, 0.07670607154511593, -0.0632279062135653, -0.12633721465350722, -0.010324909358116035, 0.04802096831739287, -0.05178301181347871, 0.05448752515314316, 0.18446449854580516, -0.1447144153760746, -0.09409713433547454, 0.3867977604947307, -0.06675498984246091, -0.0450449000345543, 0.18503713794264265, -0.12999410429038108, -0.06042918709995733, 0.1993011551570486, 0.15365787189961835, 0.08690799288451671, -0.10956866127354177, 0.010653892072679643, 0.06251805578358471, 0.25858181049962614, 0.1327838040422648, 0.15114929407242347, 0.2238914087584073, 0.20066292335025288, 0.03324226309249008, 0.14349125621163034, -0.15979715030090036, -0.03225868183442138, -0.2338574641976844, -0.1307286272666798, -0.14823926250365646, 0.08722569775577127, -0.07672585031726736, -0.04923003655117513, 0.38575698816302145, 0.14351785937747494, 0.13306145720945842, 0.025381449034268207, 0.3200302866372195, 0.09017305369912224, 0.07448291323750957, 0.052876477341421625, 0.3309619170020927, 0.11601233006698418, 0.12140572599389336, -0.19444834520638157, -0.038704121337187564, -0.057967832474969325] |
1,803.0921 | Importance Weighted Adversarial Nets for Partial Domain Adaptation | This paper proposes an importance weighted adversarial nets-based method for
unsupervised domain adaptation, specific for partial domain adaptation where
the target domain has less number of classes compared to the source domain.
Previous domain adaptation methods generally assume the identical label spaces,
such that reducing the distribution divergence leads to feasible knowledge
transfer. However, such an assumption is no longer valid in a more realistic
scenario that requires adaptation from a larger and more diverse source domain
to a smaller target domain with less number of classes. This paper extends the
adversarial nets-based domain adaptation and proposes a novel adversarial
nets-based partial domain adaptation method to identify the source samples that
are potentially from the outlier classes and, at the same time, reduce the
shift of shared classes between domains.
| cs.CV | this paper proposes an importance weighted adversarial netsbased method for unsupervised domain adaptation specific for partial domain adaptation where the target domain has less number of classes compared to the source domain previous domain adaptation methods generally assume the identical label spaces such that reducing the distribution divergence leads to feasible knowledge transfer however such an assumption is no longer valid in a more realistic scenario that requires adaptation from a larger and more diverse source domain to a smaller target domain with less number of classes this paper extends the adversarial netsbased domain adaptation and proposes a novel adversarial netsbased partial domain adaptation method to identify the source samples that are potentially from the outlier classes and at the same time reduce the shift of shared classes between domains | [['this', 'paper', 'proposes', 'an', 'importance', 'weighted', 'adversarial', 'netsbased', 'method', 'for', 'unsupervised', 'domain', 'adaptation', 'specific', 'for', 'partial', 'domain', 'adaptation', 'where', 'the', 'target', 'domain', 'has', 'less', 'number', 'of', 'classes', 'compared', 'to', 'the', 'source', 'domain', 'previous', 'domain', 'adaptation', 'methods', 'generally', 'assume', 'the', 'identical', 'label', 'spaces', 'such', 'that', 'reducing', 'the', 'distribution', 'divergence', 'leads', 'to', 'feasible', 'knowledge', 'transfer', 'however', 'such', 'an', 'assumption', 'is', 'no', 'longer', 'valid', 'in', 'a', 'more', 'realistic', 'scenario', 'that', 'requires', 'adaptation', 'from', 'a', 'larger', 'and', 'more', 'diverse', 'source', 'domain', 'to', 'a', 'smaller', 'target', 'domain', 'with', 'less', 'number', 'of', 'classes', 'this', 'paper', 'extends', 'the', 'adversarial', 'netsbased', 'domain', 'adaptation', 'and', 'proposes', 'a', 'novel', 'adversarial', 'netsbased', 'partial', 'domain', 'adaptation', 'method', 'to', 'identify', 'the', 'source', 'samples', 'that', 'are', 'potentially', 'from', 'the', 'outlier', 'classes', 'and', 'at', 'the', 'same', 'time', 'reduce', 'the', 'shift', 'of', 'shared', 'classes', 'between', 'domains']] | [-0.05152192861558153, 0.03763718848819665, -0.03493955534023161, 0.05809475982812448, -0.16684370117190367, -0.13038657134255538, 0.0508075500292202, 0.4232523627794133, -0.28335336730457267, -0.32135002268478274, 0.08535267872144826, -0.2197637309965033, -0.1213260412789308, 0.18722160067409277, -0.1476027762588973, 0.02265968221024825, 0.061422060906457215, 0.025109215003724854, -0.060608823853544894, -0.20359302815049887, 0.38136883369073843, -0.026646472579942872, 0.34958717851684645, -0.006369222002103925, 0.0989570621186151, -0.029470524990644592, -0.05871689090361962, -0.02550533519914517, -0.06144759699320555, 0.15117131292533417, 0.3036494549274301, 0.1694875015805547, 0.35297279054155717, -0.3885250871571211, -0.2743025409478623, 0.17842684680810914, 0.1608726567051445, 0.1405296525165725, -0.047113811767597394, -0.29774748511039295, 0.13414889525066917, -0.16073183748297967, -0.027214687271043658, -0.0566044464868565, 0.02283961187618283, -0.023073787694402898, -0.32334841451822566, 0.04872417345356483, 0.1271007160656154, 0.0584979623162116, -0.06473903788898427, -0.1170631939616914, 0.05517888456368102, 0.14743555727271507, 0.05101401004761171, 0.12077440921432124, 0.08824837995119966, -0.138411027382916, -0.09866463258110274, 0.3229135611309455, -0.012827124976767943, -0.29025165255555363, 0.23470472460970856, -0.07062080063713858, -0.09388908272465835, 0.1328585365625958, 0.19317465495461456, 0.18680205378824702, -0.16671170843048738, 0.02783931821020535, -0.002275416828118838, 0.2198917991696642, 0.08845058689968517, 0.018435635302179995, 0.11578342822389319, 0.22409644212860327, 0.15158642803390437, 0.18924349289244183, -0.09747421867572344, -0.07936094142630912, -0.29384170602290677, -0.07747137310126653, -0.21846312887680072, -0.0272740742800614, -0.10571967655839846, -0.14942391488987666, 0.3677883425942407, 0.16515727755087517, 0.19847190522481328, 0.09657087881977741, 0.3006145242458353, 0.023201505449385595, 0.09621789400250866, 0.09836277862151081, 0.11465449386921067, 0.00775614467700227, 0.12848112251466284, -0.18836546935714207, 0.11481302236206829, -0.008999408960628967] |
1,803.09211 | Bernoulli Embeddings for Graphs | Just as semantic hashing can accelerate information retrieval, binary valued
embeddings can significantly reduce latency in the retrieval of graphical data.
We introduce a simple but effective model for learning such binary vectors for
nodes in a graph. By imagining the embeddings as independent coin flips of
varying bias, continuous optimization techniques can be applied to the
approximate expected loss. Embeddings optimized in this fashion consistently
outperform the quantization of both spectral graph embeddings and various
learned real-valued embeddings, on both ranking and pre-ranking tasks for a
variety of datasets.
| cs.LG cs.AI stat.ML | just as semantic hashing can accelerate information retrieval binary valued embeddings can significantly reduce latency in the retrieval of graphical data we introduce a simple but effective model for learning such binary vectors for nodes in a graph by imagining the embeddings as independent coin flips of varying bias continuous optimization techniques can be applied to the approximate expected loss embeddings optimized in this fashion consistently outperform the quantization of both spectral graph embeddings and various learned realvalued embeddings on both ranking and preranking tasks for a variety of datasets | [['just', 'as', 'semantic', 'hashing', 'can', 'accelerate', 'information', 'retrieval', 'binary', 'valued', 'embeddings', 'can', 'significantly', 'reduce', 'latency', 'in', 'the', 'retrieval', 'of', 'graphical', 'data', 'we', 'introduce', 'a', 'simple', 'but', 'effective', 'model', 'for', 'learning', 'such', 'binary', 'vectors', 'for', 'nodes', 'in', 'a', 'graph', 'by', 'imagining', 'the', 'embeddings', 'as', 'independent', 'coin', 'flips', 'of', 'varying', 'bias', 'continuous', 'optimization', 'techniques', 'can', 'be', 'applied', 'to', 'the', 'approximate', 'expected', 'loss', 'embeddings', 'optimized', 'in', 'this', 'fashion', 'consistently', 'outperform', 'the', 'quantization', 'of', 'both', 'spectral', 'graph', 'embeddings', 'and', 'various', 'learned', 'realvalued', 'embeddings', 'on', 'both', 'ranking', 'and', 'preranking', 'tasks', 'for', 'a', 'variety', 'of', 'datasets']] | [-0.05739911001834893, 0.0468416807001059, -0.06295092995644788, 0.13253173296041576, -0.13370436877587788, -0.18829999019697916, 0.07299531503381688, 0.47503792804278683, -0.34046326196762955, -0.3418473265646549, 0.09145875726277114, -0.2778637905845816, -0.1547278816696633, 0.1818377051183305, -0.1430390145409894, 0.08615396590380187, 0.135304725095839, 0.08421210104369381, -0.15094766793040076, -0.31942932985872136, 0.2977763207713037, 0.01807668719315127, 0.3067285286712596, -0.0094778330766418, 0.12539845966770616, 0.06797964807097497, -0.027356319723315956, 0.03419284292318848, -0.04499090985091549, 0.17637369333337363, 0.3540424961659513, 0.2159705180288103, 0.2505421768978573, -0.34951295799921067, -0.2846705612171902, 0.15080544175684787, 0.19245738953906583, 0.1067687294622844, -0.05238075931739648, -0.3151245168384081, 0.06013074306656052, -0.17704940572632163, 0.10651625940063444, -0.19127905721451793, -0.03885453979202201, 0.030639422220293054, -0.3271583009281018, -0.006859131846406884, 0.11512860136755397, 0.013483122127193414, -0.04475453216320929, -0.10781641562961125, 0.01655909506305843, 0.14533381479049332, -0.02939708208602466, 0.11067320926904971, 0.13829338084383125, -0.16237689623036264, -0.21053257921522253, 0.3724343774296092, -0.08892409735963565, -0.26982294925059497, 0.15232369748435998, 0.008698977158519994, -0.1559727295416962, 0.07096155069956786, 0.2755788871285956, 0.10353315891854967, -0.13963228093167201, 0.04064031941371478, -0.015482877538110434, 0.15962436235394706, 0.0939308475137929, 0.025625338908703475, 0.1816963566221255, 0.1663215576325742, 0.0734404529329766, 0.1647124636350618, -0.07175975107441374, -0.06430919357481298, -0.17616730101218217, -0.09025379467043984, -0.23504683988043265, -0.018529261260952674, -0.22925951951830859, -0.16185513705412827, 0.4190428251965662, 0.17009773609238896, 0.2447084747097884, 0.10839219327513756, 0.30618978426739407, 0.04224706071512669, 0.10732771463566616, 0.0997390653519483, 0.12095170585946127, 0.04452973915253546, 0.10683941592598396, -0.13283965402162434, 0.10814360838404365, 0.07296915794984343] |
1,803.09212 | Shape, Scale, and Minimality of Matrix Ranges | We study containment and uniqueness problems concerning matrix convex sets.
First, to what extent is a matrix convex set determined by its first level? Our
results in this direction quantify the disparity between two product
operations, namely the product of the smallest matrix convex sets over $K_i
\subseteq \mathbb{C}^d$, and the smallest matrix convex set over the product of
$K_i$. Second, if a matrix convex set is given as the matrix range of an
operator tuple $T$, when is $T$ determined uniquely? We provide counterexamples
to results in the literature, showing that a compact tuple meeting a minimality
condition need not be determined uniquely, even if its matrix range is a
particularly friendly set. Finally, our results may be used to improve dilation
scales, such as the norm bound on the dilation of (non self-adjoint)
contractions to commuting normal operators, both concretely and abstractly.
| math.OA math.FA | we study containment and uniqueness problems concerning matrix convex sets first to what extent is a matrix convex set determined by its first level our results in this direction quantify the disparity between two product operations namely the product of the smallest matrix convex sets over k_i subseteq mathbbcd and the smallest matrix convex set over the product of k_i second if a matrix convex set is given as the matrix range of an operator tuple t when is t determined uniquely we provide counterexamples to results in the literature showing that a compact tuple meeting a minimality condition need not be determined uniquely even if its matrix range is a particularly friendly set finally our results may be used to improve dilation scales such as the norm bound on the dilation of non selfadjoint contractions to commuting normal operators both concretely and abstractly | [['we', 'study', 'containment', 'and', 'uniqueness', 'problems', 'concerning', 'matrix', 'convex', 'sets', 'first', 'to', 'what', 'extent', 'is', 'a', 'matrix', 'convex', 'set', 'determined', 'by', 'its', 'first', 'level', 'our', 'results', 'in', 'this', 'direction', 'quantify', 'the', 'disparity', 'between', 'two', 'product', 'operations', 'namely', 'the', 'product', 'of', 'the', 'smallest', 'matrix', 'convex', 'sets', 'over', 'k_i', 'subseteq', 'mathbbcd', 'and', 'the', 'smallest', 'matrix', 'convex', 'set', 'over', 'the', 'product', 'of', 'k_i', 'second', 'if', 'a', 'matrix', 'convex', 'set', 'is', 'given', 'as', 'the', 'matrix', 'range', 'of', 'an', 'operator', 'tuple', 't', 'when', 'is', 't', 'determined', 'uniquely', 'we', 'provide', 'counterexamples', 'to', 'results', 'in', 'the', 'literature', 'showing', 'that', 'a', 'compact', 'tuple', 'meeting', 'a', 'minimality', 'condition', 'need', 'not', 'be', 'determined', 'uniquely', 'even', 'if', 'its', 'matrix', 'range', 'is', 'a', 'particularly', 'friendly', 'set', 'finally', 'our', 'results', 'may', 'be', 'used', 'to', 'improve', 'dilation', 'scales', 'such', 'as', 'the', 'norm', 'bound', 'on', 'the', 'dilation', 'of', 'non', 'selfadjoint', 'contractions', 'to', 'commuting', 'normal', 'operators', 'both', 'concretely', 'and', 'abstractly']] | [-0.114593056586778, 0.1153688687604194, -0.0171864406715435, 0.035786288162247125, -0.0804091092965488, -0.11048712039418104, 0.03732892686578756, 0.35978325083205065, -0.365842170909875, -0.20794501409788305, 0.15356654667508943, -0.2935592655396451, -0.1452369394537527, 0.18240145892034182, -0.09892273983859923, 0.04959005971209586, 0.07607947105861967, 0.08280952967652411, -0.1317081728840195, -0.27524253105123836, 0.37462207473193604, -0.027476322883659223, 0.1962685783477759, 0.11295041108840248, 0.0935754538287357, -0.001218403932095195, 0.00035895594434502226, 0.04142239944323794, -0.11956640027857349, 0.0954822359280014, 0.28453779118394273, 0.23075401579586063, 0.2594797022886471, -0.38093631631798214, -0.10820866034514943, 0.21773966669408967, 0.09743454857703505, -0.01380524587067258, 0.009011184048884187, -0.25641226516907206, 0.13020910299140573, -0.1480097701294451, -0.1117426198163432, -0.08367296773778637, 0.05348254629643634, -0.03770989220518257, -0.34523607435080017, 0.0085076768462184, 0.07680325615607823, 0.051679074531421065, -0.05456985716753277, -0.135377174484246, 0.0028535288454602575, 0.11393881587496758, -0.004091599390247009, 0.05661811869686062, 0.11001070153300437, -0.015906500764281697, -0.10319680031453674, 0.36705997431029874, -0.02820823040666356, -0.2709390338198621, 0.12419186847061307, -0.18012470730334623, -0.10517324757852799, 0.07292371193438561, 0.12422845419496298, 0.14123636043384774, -0.1384250931883394, 0.12655634834866053, -0.14071062493086275, 0.13399024720921363, 0.08600682051878215, 0.03666718880736476, 0.12056981949394362, 0.10497118771794096, 0.1736799805819626, 0.10898655260098167, 0.05079794168866809, -0.03551541237781445, -0.3661689073519988, -0.12470266892058943, -0.23893452872127657, 0.05543292996309093, -0.14361738839751423, -0.17193221916709767, 0.3810219579091709, 0.07718419136532854, 0.21679502469487488, 0.10505566004818927, 0.24285864223363912, 0.1020703536054902, 0.05755420401045638, 0.0954604145242936, 0.13570983432065178, 0.18906024321687356, -0.01462220224170273, -0.18568329899365685, 0.07675602495308137, 0.13976298954932848] |
1,803.09213 | Almost para-Hermitian and almost paracontact metric structures induced
by natural Riemann extensions | In this paper we consider a manifold $(M,\nabla )$ with a symmetric linear
connection $\nabla $ which induces on the cotangent bundle $T^*M$ of $M$ a
semi-Riemannian metric $\overline g$ with a neutral signature. The metric
$\overline g$ is called natural Riemann extension and it is a generalization
(made by M. Sekizawa and O. Kowalski) of the Riemann extension, introduced by
E. K. Patterson and A. G. Walker (1952). We construct two almost para-Hermitian
structures on $(T^*M,\overline g)$ which are almost para-K\"ahler or
para-K\"ahler and prove that the defined almost para-complex structures are
harmonic. On certain hypersurfaces of $T^*M$ we construct almost paracontact
metric structures, induced by the obtained almost para-Hermitian structures. We
determine the classes of the corresponding almost paracontact metric manifolds
according to the classification given by S. Zamkovoy and G. Nakova (2018). We
obtain a necessary and sufficient condition the considered manifolds to be
paracontact metric, K-paracontact metric or para-Sasakian.
| math.DG | in this paper we consider a manifold mnabla with a symmetric linear connection nabla which induces on the cotangent bundle tm of m a semiriemannian metric overline g with a neutral signature the metric overline g is called natural riemann extension and it is a generalization made by m sekizawa and o kowalski of the riemann extension introduced by e k patterson and a g walker 1952 we construct two almost parahermitian structures on tmoverline g which are almost parakahler or parakahler and prove that the defined almost paracomplex structures are harmonic on certain hypersurfaces of tm we construct almost paracontact metric structures induced by the obtained almost parahermitian structures we determine the classes of the corresponding almost paracontact metric manifolds according to the classification given by s zamkovoy and g nakova 2018 we obtain a necessary and sufficient condition the considered manifolds to be paracontact metric kparacontact metric or parasasakian | [['in', 'this', 'paper', 'we', 'consider', 'a', 'manifold', 'mnabla', 'with', 'a', 'symmetric', 'linear', 'connection', 'nabla', 'which', 'induces', 'on', 'the', 'cotangent', 'bundle', 'tm', 'of', 'm', 'a', 'semiriemannian', 'metric', 'overline', 'g', 'with', 'a', 'neutral', 'signature', 'the', 'metric', 'overline', 'g', 'is', 'called', 'natural', 'riemann', 'extension', 'and', 'it', 'is', 'a', 'generalization', 'made', 'by', 'm', 'sekizawa', 'and', 'o', 'kowalski', 'of', 'the', 'riemann', 'extension', 'introduced', 'by', 'e', 'k', 'patterson', 'and', 'a', 'g', 'walker', '1952', 'we', 'construct', 'two', 'almost', 'parahermitian', 'structures', 'on', 'tmoverline', 'g', 'which', 'are', 'almost', 'parakahler', 'or', 'parakahler', 'and', 'prove', 'that', 'the', 'defined', 'almost', 'paracomplex', 'structures', 'are', 'harmonic', 'on', 'certain', 'hypersurfaces', 'of', 'tm', 'we', 'construct', 'almost', 'paracontact', 'metric', 'structures', 'induced', 'by', 'the', 'obtained', 'almost', 'parahermitian', 'structures', 'we', 'determine', 'the', 'classes', 'of', 'the', 'corresponding', 'almost', 'paracontact', 'metric', 'manifolds', 'according', 'to', 'the', 'classification', 'given', 'by', 's', 'zamkovoy', 'and', 'g', 'nakova', '2018', 'we', 'obtain', 'a', 'necessary', 'and', 'sufficient', 'condition', 'the', 'considered', 'manifolds', 'to', 'be', 'paracontact', 'metric', 'kparacontact', 'metric', 'or', 'parasasakian']] | [-0.25481342032336357, 0.08332063973450489, -0.056598380321955945, 0.07177638610726741, -0.13221431883102674, -0.15088154206077764, -0.041626916144226936, 0.4088344970895421, -0.23722762248928653, -0.23739240743017115, 0.06475163832050274, -0.2674102819854153, -0.22375331819374242, 0.12106670860239134, -0.10382189570298912, -0.007699398881419986, 0.06794519155748746, 0.11019592100222196, -0.09154508281087338, -0.2769847645552601, 0.45218226114655435, 0.012361004560564956, 0.22997252452408984, 0.02882545014018142, 0.16106693974702435, -0.031085449239226425, -0.006132777436592039, 0.0363730212913008, -0.21014717325979415, 0.1002203291345413, 0.22187965061692966, 0.08704676218552604, 0.16193121577910827, -0.32453314138284955, -0.1617569557080666, 0.18174353222280334, 0.023778072802261227, -0.0688924707732081, 0.02247207159363367, -0.34931391584021704, 0.13641055893362025, -0.08255795677046791, -0.13226696294510648, -0.08772666744735776, 0.07362889556759068, -0.061067196382146305, -0.21563800690746326, -0.027808619669454845, 0.17158451026343569, 0.06276117409961568, -0.07732825017008348, -0.08362384143342473, -0.10277489317441676, 0.010647613630427339, -0.015419199968510796, 0.11585441228718224, 0.06611251515862183, 0.024286585494077632, -0.09954135546296024, 0.4038824244548066, -0.16463029667811127, -0.28248779958456144, 0.09536713533432914, -0.10471467962678598, -0.11112635046541437, 0.06446199237248626, 0.10912103392500556, 0.19058769571335138, -0.07458109354131481, 0.2005771694009566, -0.09306094372405656, 0.022838308054599025, 0.17420290426357465, -0.038441192802219165, 0.12566537226132135, 0.08534410774397354, 0.15957589602401975, 0.1051120835722291, 0.021126108508569753, 0.001960283903987939, -0.34571631062699826, -0.21366439435352275, -0.11733271840874258, 0.22286916516094032, -0.11062098991028413, -0.21548754788403, 0.3719831379954101, -0.04258481624099065, 0.23192964622206022, 0.09521373827802335, 0.18286722090861882, -0.007626630800624131, 0.014445216855870522, 0.1723823577013551, 0.17743884637115562, 0.27526706105516274, 0.011585243644991092, -0.0835616415814769, -0.0371625870402877, 0.1514774515851065] |
1,803.09214 | Prospective phosphors for white LEDs based on double molybdates of the
composition Ln2Zr3 (MoO4) 9 (Ln: Eu, Tb) | The results of the investigation of the spectral characteristics of new
luminescent substances based on rare-earth ions Eu3 + and Tb3 + in matrices of
double molybdates are presented in the article. The luminescence and excitation
spectra are considered, the decay times of the main transitions are determined,
and the color coordinates are determined. The results show the possible
suitability of using these compounds as white phosphor phosphor components.
| physics.app-ph cond-mat.mtrl-sci | the results of the investigation of the spectral characteristics of new luminescent substances based on rareearth ions eu3 and tb3 in matrices of double molybdates are presented in the article the luminescence and excitation spectra are considered the decay times of the main transitions are determined and the color coordinates are determined the results show the possible suitability of using these compounds as white phosphor phosphor components | [['the', 'results', 'of', 'the', 'investigation', 'of', 'the', 'spectral', 'characteristics', 'of', 'new', 'luminescent', 'substances', 'based', 'on', 'rareearth', 'ions', 'eu3', 'and', 'tb3', 'in', 'matrices', 'of', 'double', 'molybdates', 'are', 'presented', 'in', 'the', 'article', 'the', 'luminescence', 'and', 'excitation', 'spectra', 'are', 'considered', 'the', 'decay', 'times', 'of', 'the', 'main', 'transitions', 'are', 'determined', 'and', 'the', 'color', 'coordinates', 'are', 'determined', 'the', 'results', 'show', 'the', 'possible', 'suitability', 'of', 'using', 'these', 'compounds', 'as', 'white', 'phosphor', 'phosphor', 'components']] | [-0.07601565272728009, 0.17486718542345647, 0.00047743388229230446, 0.0004054557031659938, 0.04436147345035379, -0.09631367672735186, 0.0316097883285204, 0.4221053354775728, -0.20106680240871302, -0.26395691645595787, 0.06303043146409205, -0.35227348099448785, -0.1000690934345571, 0.19698718926911032, -0.014313414470473332, 0.018233908507138935, 0.007594917880009804, -0.014188701294730904, -0.07209073518031041, -0.20819958684437756, 0.2989480720916346, 0.04199296482074172, 0.28383558318574925, 0.06715031059931463, 0.03943079710006714, -0.028675506419655102, -0.023795235651864935, -0.048779670149087906, -0.12811900311802973, 0.13364739646551324, 0.22558112093247473, 0.05595833440519758, 0.1200130413661697, -0.4033522990101309, -0.16670706961651457, 0.03522144734108849, 0.12316679442996409, 0.06250899397670778, -0.09505787434285756, -0.2869367182060187, 0.07999557584051543, -0.06800007594943937, -0.1080403346568346, -0.07911877787268873, -0.034070746166937387, 0.14178960142073346, -0.23518270402868738, 0.04360816542948805, 0.0678638509238389, 0.07807849656178881, -0.13590428878122301, -0.2257221123036831, -0.05160563489867013, 0.11412220075031493, 0.06689262545125475, -0.09250198397090409, 0.17229393523520053, -0.039787491477692304, -0.11752251644076696, 0.3914448388360455, -0.0500866398632304, -0.06376617719895387, 0.1482933140603075, -0.15685209460945718, -0.08942544963662583, 0.16772577546731526, 0.11852372655255804, 0.18502804689776542, -0.1632941948083132, 0.03578062096711443, 0.0061061609425206685, 0.15234743756478403, 0.04648783824531667, 0.1268884685279718, 0.206782333455535, 0.1509682295649354, -0.07217166182654997, 0.14203375192887302, -0.13823083477831488, -0.033854249212369604, -0.25577878051284536, -0.21309737877141852, -0.2034841626283101, 0.0131767125967056, -0.04970105217336225, -0.1824736295740551, 0.4416650021031721, 0.0953247720660614, 0.18523231795780473, -0.09028077317373966, 0.23171383900039677, 0.07421477325643441, 0.04785966021078291, -0.013637839121493831, 0.26194643459991734, 0.22193542710825134, 0.09797066471664541, -0.2745722217255953, 0.06744173465213224, 0.018740010280996117] |
1,803.09215 | Electrical Resistivity and Hall Effect in Binary Neutron-Star Mergers | We examine the range of rest-mass densities, temperatures and magnetic fields
involved in simulations of binary neutron-star mergers and identify the
conditions under which the ideal-magnetohydrodynamics approximation breaks down
and hence the magnetic-field decay should be accounted for. We use recent
calculations of the conductivities of warm correlated plasma in envelopes of
compact stars and find that the magnetic-field decay timescales are much larger
than the characteristic timescales of the merger process for lengthscales down
to a meter. Because these are smaller than the currently available resolution
in numerical simulations, the ideal-magnetohydrodynamics approximation is
effectively valid for all realistic simulations. At the same time, we find that
the Hall effect can be important at low densities and low temperatures, where
it can induce a non-dissipative rearrangement of the magnetic field. Finally,
we mark the region in temperature and density where the hydrodynamic
description breaks down.
| astro-ph.HE nucl-th | we examine the range of restmass densities temperatures and magnetic fields involved in simulations of binary neutronstar mergers and identify the conditions under which the idealmagnetohydrodynamics approximation breaks down and hence the magneticfield decay should be accounted for we use recent calculations of the conductivities of warm correlated plasma in envelopes of compact stars and find that the magneticfield decay timescales are much larger than the characteristic timescales of the merger process for lengthscales down to a meter because these are smaller than the currently available resolution in numerical simulations the idealmagnetohydrodynamics approximation is effectively valid for all realistic simulations at the same time we find that the hall effect can be important at low densities and low temperatures where it can induce a nondissipative rearrangement of the magnetic field finally we mark the region in temperature and density where the hydrodynamic description breaks down | [['we', 'examine', 'the', 'range', 'of', 'restmass', 'densities', 'temperatures', 'and', 'magnetic', 'fields', 'involved', 'in', 'simulations', 'of', 'binary', 'neutronstar', 'mergers', 'and', 'identify', 'the', 'conditions', 'under', 'which', 'the', 'idealmagnetohydrodynamics', 'approximation', 'breaks', 'down', 'and', 'hence', 'the', 'magneticfield', 'decay', 'should', 'be', 'accounted', 'for', 'we', 'use', 'recent', 'calculations', 'of', 'the', 'conductivities', 'of', 'warm', 'correlated', 'plasma', 'in', 'envelopes', 'of', 'compact', 'stars', 'and', 'find', 'that', 'the', 'magneticfield', 'decay', 'timescales', 'are', 'much', 'larger', 'than', 'the', 'characteristic', 'timescales', 'of', 'the', 'merger', 'process', 'for', 'lengthscales', 'down', 'to', 'a', 'meter', 'because', 'these', 'are', 'smaller', 'than', 'the', 'currently', 'available', 'resolution', 'in', 'numerical', 'simulations', 'the', 'idealmagnetohydrodynamics', 'approximation', 'is', 'effectively', 'valid', 'for', 'all', 'realistic', 'simulations', 'at', 'the', 'same', 'time', 'we', 'find', 'that', 'the', 'hall', 'effect', 'can', 'be', 'important', 'at', 'low', 'densities', 'and', 'low', 'temperatures', 'where', 'it', 'can', 'induce', 'a', 'nondissipative', 'rearrangement', 'of', 'the', 'magnetic', 'field', 'finally', 'we', 'mark', 'the', 'region', 'in', 'temperature', 'and', 'density', 'where', 'the', 'hydrodynamic', 'description', 'breaks', 'down']] | [-0.10924487089063843, 0.23361576786585922, -0.0665562207264633, 0.10602605090089441, -0.023675321484113047, -0.0642072729380994, 0.01303823170059457, 0.3785459251881673, -0.22690237719116027, -0.31745143463385517, 0.08785484121983934, -0.2198097238702507, -0.027603529958889404, 0.2186284037547764, 0.04965257164299616, -0.018220173837295895, 0.013747808411075124, -0.016938348368998487, -0.11321436634752899, -0.20865630120167444, 0.28446668892585, 0.07673598733120437, 0.22074382533801012, 0.0627013559497347, 0.06197097489192825, -0.07201564329644215, 0.014146876110342042, 0.03867658914933945, -0.15891964625936517, -0.01951143902822815, 0.2381445566850618, 0.0213416774452118, 0.22114130185338957, -0.4677722597687409, -0.23309564344376196, 0.0656413090640101, 0.14268296795800842, 0.13542354752566538, -0.02479522566407405, -0.20690890635155013, 0.09036048601927428, -0.15620319275185465, -0.13097582760684448, -0.08602884379697257, 0.03963716194828459, 0.032961935832582674, -0.282557559029424, 0.1543061272763037, 0.04097791791106735, 0.03481749712829759, -0.08106852883376695, -0.10829984413235096, -0.03660598030606895, 0.0860670603900056, 0.06137361665324565, 0.028525251037730227, 0.1788624431263527, -0.15201182473001296, -0.01809980011513007, 0.39138862791888673, -0.05374888951372323, -0.09638625570926174, 0.23712224721394737, -0.24061472497173939, -0.12728158817706822, 0.18481583611493738, 0.17138482164671837, 0.14207343648926452, -0.11237596177720818, 0.027744825127743313, -0.0010184308040309055, 0.17182683182462793, 0.07334815013896802, 0.053440449714403725, 0.26928143212250594, 0.16370719362628358, 0.0174063448954759, 0.10055525109878388, -0.15125468261539937, -0.07958364599095337, -0.27370473649553506, -0.11436498077778981, -0.1437723954055651, 0.08188760613306056, -0.10267892937790121, -0.12442859380409635, 0.35536045026162577, 0.20992749795189192, 0.1691787572320679, 0.04703059245366603, 0.29343993794815293, 0.14097218774419662, 0.0973233616300698, 0.12094624498537902, 0.2594958901662251, 0.15583817724555987, 0.07151119081496164, -0.2555675619040969, 0.048388715586946185, -0.015055356248570927] |
1,803.09216 | Real-Variable Characterizations of Orlicz-Slice Hardy Spaces | In this article, the authors first introduce a class of Orlicz-slice spaces
which generalize the slice spaces recently studied by P. Auscher et al. Based
on these Orlicz-slice spaces, the authors introduce a new kind of Hardy type
spaces, the Orlicz-slice Hardy spaces, via the radial maximal functions. This
new scale of Orlicz-slice Hardy spaces contains the variant of the Orlicz-Hardy
space of A. Bonami and J. Feuto as well as the Hardy-amalgam space of Z. V. de
P. Abl\'e and J. Feuto as special cases. Their characterizations via the atom,
the molecule, various maximal functions, the Poisson integral and the
Littlewood-Paley functions are also obtained. As an application of these
characterizations, the authors establish their finite atomic characterizations,
which further induce a description of their dual spaces and a criterion on the
boundedness of sublinear operators from these Orlicz-slice Hardy spaces into a
quasi-Banach space. Then, applying this criterion, the authors obtain the
boundedness of $\delta$-type Calder\'on-Zygmund operators on these Orlicz-slice
Hardy spaces. All these results are new even for slice Hardy spaces and,
moreover, for Hardy-amalgam spaces, the Littlewood-Paley function
characterizations, the dual spaces and the boundedness of $\delta$-type
Calder\'on-Zygmund operators on these Hardy-type spaces are also new.
| math.CA math.AP math.FA | in this article the authors first introduce a class of orliczslice spaces which generalize the slice spaces recently studied by p auscher et al based on these orliczslice spaces the authors introduce a new kind of hardy type spaces the orliczslice hardy spaces via the radial maximal functions this new scale of orliczslice hardy spaces contains the variant of the orliczhardy space of a bonami and j feuto as well as the hardyamalgam space of z v de p able and j feuto as special cases their characterizations via the atom the molecule various maximal functions the poisson integral and the littlewoodpaley functions are also obtained as an application of these characterizations the authors establish their finite atomic characterizations which further induce a description of their dual spaces and a criterion on the boundedness of sublinear operators from these orliczslice hardy spaces into a quasibanach space then applying this criterion the authors obtain the boundedness of deltatype calderonzygmund operators on these orliczslice hardy spaces all these results are new even for slice hardy spaces and moreover for hardyamalgam spaces the littlewoodpaley function characterizations the dual spaces and the boundedness of deltatype calderonzygmund operators on these hardytype spaces are also new | [['in', 'this', 'article', 'the', 'authors', 'first', 'introduce', 'a', 'class', 'of', 'orliczslice', 'spaces', 'which', 'generalize', 'the', 'slice', 'spaces', 'recently', 'studied', 'by', 'p', 'auscher', 'et', 'al', 'based', 'on', 'these', 'orliczslice', 'spaces', 'the', 'authors', 'introduce', 'a', 'new', 'kind', 'of', 'hardy', 'type', 'spaces', 'the', 'orliczslice', 'hardy', 'spaces', 'via', 'the', 'radial', 'maximal', 'functions', 'this', 'new', 'scale', 'of', 'orliczslice', 'hardy', 'spaces', 'contains', 'the', 'variant', 'of', 'the', 'orliczhardy', 'space', 'of', 'a', 'bonami', 'and', 'j', 'feuto', 'as', 'well', 'as', 'the', 'hardyamalgam', 'space', 'of', 'z', 'v', 'de', 'p', 'able', 'and', 'j', 'feuto', 'as', 'special', 'cases', 'their', 'characterizations', 'via', 'the', 'atom', 'the', 'molecule', 'various', 'maximal', 'functions', 'the', 'poisson', 'integral', 'and', 'the', 'littlewoodpaley', 'functions', 'are', 'also', 'obtained', 'as', 'an', 'application', 'of', 'these', 'characterizations', 'the', 'authors', 'establish', 'their', 'finite', 'atomic', 'characterizations', 'which', 'further', 'induce', 'a', 'description', 'of', 'their', 'dual', 'spaces', 'and', 'a', 'criterion', 'on', 'the', 'boundedness', 'of', 'sublinear', 'operators', 'from', 'these', 'orliczslice', 'hardy', 'spaces', 'into', 'a', 'quasibanach', 'space', 'then', 'applying', 'this', 'criterion', 'the', 'authors', 'obtain', 'the', 'boundedness', 'of', 'deltatype', 'calderonzygmund', 'operators', 'on', 'these', 'orliczslice', 'hardy', 'spaces', 'all', 'these', 'results', 'are', 'new', 'even', 'for', 'slice', 'hardy', 'spaces', 'and', 'moreover', 'for', 'hardyamalgam', 'spaces', 'the', 'littlewoodpaley', 'function', 'characterizations', 'the', 'dual', 'spaces', 'and', 'the', 'boundedness', 'of', 'deltatype', 'calderonzygmund', 'operators', 'on', 'these', 'hardytype', 'spaces', 'are', 'also', 'new']] | [-0.0763849349918239, 0.09667760393068704, -0.05843575332534848, 0.14576866868189584, -0.10127937010221297, -0.05418009297437778, 0.02296419706985806, 0.3419166672598533, -0.3122917539581205, -0.17285905364869078, 0.1551844666510905, -0.23955794950156953, -0.13768317619094042, 0.23017580549684213, -0.11935056819382941, 0.042265731770183064, -0.010705367965985917, -0.0008336569375424374, -0.14654746475924074, -0.31046070572637924, 0.45629745608929434, -0.0257423935338121, 0.19675760821238245, 0.03424924860515566, 0.06023162288931986, 0.05468249040881567, -0.07225458447896697, -0.03415568672320513, -0.2530560722866218, 0.2015627680988418, 0.2221990493549542, 0.07988459824683201, 0.32379747152027455, -0.3489657412800524, -0.19035995198587766, 0.18969586981234676, 0.11149202412196595, -0.06282066132736891, -0.013344456319332081, -0.3771483001694309, -0.0002363614856754665, -0.1088729543573778, -0.11287744975451267, -0.15319842614487492, 0.013650020923126827, 0.11052383479163652, -0.3102564255006122, 0.028383883579123786, 0.11368324165526458, 0.061809941513623776, -0.1896745880802322, -0.14071467442136973, -0.017084992257290228, 0.055218961600195425, -0.04805874631674302, 0.07555111774391579, 0.054794611609211626, -0.018605959279353334, -0.1665657438323692, 0.29685722598617875, -0.04960785915303712, -0.242580215164432, 0.14231127866125204, -0.16371217300889618, -0.15045980607027734, 0.01794111613370008, 0.1011234719407359, 0.18991480538659175, -0.09117934406462191, 0.19243592510030444, -0.11780411072987874, 0.026725820604373108, 0.1427081366083726, 0.14765029264651616, 0.021868780501083367, 0.04955812162164636, 0.1499901585148017, 0.15222531851178805, -0.001275414143097493, -0.045272428009687275, -0.37002118199480455, -0.22533821808691654, -0.17859573718430852, 0.052389831427938065, -0.12052558235441349, -0.19805984977030694, 0.3583557406661449, 0.036085459855244015, 0.1743744132826293, 0.0927453016770552, 0.16056284911911747, 0.06067654837835392, 0.05769773470496552, 0.022327766596160904, 0.17866709159988195, 0.2200964074346679, 0.14890121859545358, -0.10512060774216837, -0.018617149995113113, 0.2754332302608574] |
1,803.09217 | Inside a VAMDC data node - Putting standards into practical software | Access to molecular and atomic data is critical for many forms of remote
sensing analysis across different fields. Many atomic and molecular databases
are however highly specialized for their intended application, complicating
querying and combination data between sources. The Virtual Atomic and Molecular
Data Centre, VAMDC, is an electronic infrastructure that allows each database
to register as a "node". Through services such as VAMDC's portal website, users
can then access and query all nodes in a homogenized way. Today all major
Atomic and Molecular databases are attached to VAMDC.
This article describes the software tools we developed to help data providers
create and manage a VAMDC node. It gives an overview of the VAMDC
infrastructure and of the various standards it uses. The article then discusses
the development choices made and how the standards are implemented in practice.
It concludes with a full example of implementing a VAMDC node using a real-life
case as well as future plans for the node software.
| astro-ph.IM cs.SE physics.atm-clus physics.atom-ph physics.comp-ph | access to molecular and atomic data is critical for many forms of remote sensing analysis across different fields many atomic and molecular databases are however highly specialized for their intended application complicating querying and combination data between sources the virtual atomic and molecular data centre vamdc is an electronic infrastructure that allows each database to register as a node through services such as vamdcs portal website users can then access and query all nodes in a homogenized way today all major atomic and molecular databases are attached to vamdc this article describes the software tools we developed to help data providers create and manage a vamdc node it gives an overview of the vamdc infrastructure and of the various standards it uses the article then discusses the development choices made and how the standards are implemented in practice it concludes with a full example of implementing a vamdc node using a reallife case as well as future plans for the node software | [['access', 'to', 'molecular', 'and', 'atomic', 'data', 'is', 'critical', 'for', 'many', 'forms', 'of', 'remote', 'sensing', 'analysis', 'across', 'different', 'fields', 'many', 'atomic', 'and', 'molecular', 'databases', 'are', 'however', 'highly', 'specialized', 'for', 'their', 'intended', 'application', 'complicating', 'querying', 'and', 'combination', 'data', 'between', 'sources', 'the', 'virtual', 'atomic', 'and', 'molecular', 'data', 'centre', 'vamdc', 'is', 'an', 'electronic', 'infrastructure', 'that', 'allows', 'each', 'database', 'to', 'register', 'as', 'a', 'node', 'through', 'services', 'such', 'as', 'vamdcs', 'portal', 'website', 'users', 'can', 'then', 'access', 'and', 'query', 'all', 'nodes', 'in', 'a', 'homogenized', 'way', 'today', 'all', 'major', 'atomic', 'and', 'molecular', 'databases', 'are', 'attached', 'to', 'vamdc', 'this', 'article', 'describes', 'the', 'software', 'tools', 'we', 'developed', 'to', 'help', 'data', 'providers', 'create', 'and', 'manage', 'a', 'vamdc', 'node', 'it', 'gives', 'an', 'overview', 'of', 'the', 'vamdc', 'infrastructure', 'and', 'of', 'the', 'various', 'standards', 'it', 'uses', 'the', 'article', 'then', 'discusses', 'the', 'development', 'choices', 'made', 'and', 'how', 'the', 'standards', 'are', 'implemented', 'in', 'practice', 'it', 'concludes', 'with', 'a', 'full', 'example', 'of', 'implementing', 'a', 'vamdc', 'node', 'using', 'a', 'reallife', 'case', 'as', 'well', 'as', 'future', 'plans', 'for', 'the', 'node', 'software']] | [-0.12680776692349868, 0.01842357516335757, -0.033733904866432275, 0.04112440548180631, -0.09405927263454807, -0.15437862013252626, 0.08725722745257597, 0.4072787934532447, -0.2935909503284171, -0.3341191884922731, 0.11565051779804623, -0.3002037042478043, -0.10934734789897567, 0.21531644488991417, -0.042045268959001354, 0.07084447595432562, 0.07654665236004125, 0.014371843126411578, 0.023520089430490117, -0.2266243476252887, 0.29949110534377626, 0.09634598203130668, 0.3185689978718017, 0.07172539179438944, 0.05581779593908407, 0.03225584432008381, -0.07879895810905543, -0.044810049675089766, -0.0763609944033362, 0.17654663615538999, 0.37937589805798827, 0.2283867934707159, 0.29268738352953927, -0.4734840162838838, -0.12782201198687465, 0.048925820842200186, 0.16194265667401161, 0.126327725804139, -0.04942479660526288, -0.29700994788761603, 0.04974695506486868, -0.2537614652042433, -0.13229903878401156, -0.10036720076332921, 0.007115797671888556, 0.0675457401182329, -0.23437014455264954, -0.07690103023937724, -0.07032649978555693, 0.12221926903664511, -0.045014647738386225, -0.08613559487998856, -0.005161530551535326, 0.21739029566763166, -0.022769341179132114, 0.04300358879339436, 0.20551812203791894, -0.10756904137991831, -0.1304393830403298, 0.4390921642922837, 0.006214598997825792, -0.13881298019232588, 0.2336531293561092, -0.027173557820562157, -0.17776754930881516, 0.04294803103154398, 0.17546540511459668, 0.012956781171100296, -0.23333567807520306, 0.07302965634171302, 0.0011830460800795082, 0.16359640541197212, 0.05800746354709744, 0.044306991542313504, 0.20144876762385833, 0.18204362229993626, 0.0694268875001924, 0.11659207371763469, -0.06920531935851026, -0.08689438003861572, -0.23064919995933608, -0.18595485419312618, -0.18120824004037547, -0.012616874094074882, -0.04075939017006338, -0.15662063433469117, 0.3544306164890852, 0.17509728685883308, 0.14532198282450393, -0.034148382617526556, 0.37436645605271646, -0.014786708564931377, 0.11220709615537422, 0.11381181304614922, 0.09774073322089563, 0.04172954660976271, 0.18202426139647082, -0.11680226559571413, 0.08321441741232176, -0.03993057062913033] |
1,803.09218 | Image Recognition Using Scale Recurrent Neural Networks | Convolutional Neural Network(CNN) has been widely used for image recognition
with great success. However, there are a number of limitations of the current
CNN based image recognition paradigm. First, the receptive field of CNN is
generally fixed, which limits its recognition capacity when the input image is
very large. Second, it lacks the computational scalability for dealing with
images with different sizes. Third, it is quite different from human visual
system for image recognition, which involves both feadforward and recurrent
proprocessing. This paper proposes a different paradigm of image recognition,
which can take advantages of variable scales of the input images, has more
computational scalabilities, and is more similar to image recognition by human
visual system. It is based on recurrent neural network (RNN) defined on image
scale with an embeded base CNN, which is named Scale Recurrent Neural
Network(SRNN). This RNN based approach makes it easier to deal with images with
variable sizes, and allows us to borrow existing RNN techniques, such as LSTM
and GRU, to further enhance the recognition accuracy. Our experiments show that
the recognition accuracy of a base CNN can be significantly boosted using the
proposed SRNN models. It also significantly outperforms the scale ensemble
method, which integrate the results of performing CNN to the input image at
different scales, although the computational overhead of using SRNN is
negligible.
| cs.CV | convolutional neural networkcnn has been widely used for image recognition with great success however there are a number of limitations of the current cnn based image recognition paradigm first the receptive field of cnn is generally fixed which limits its recognition capacity when the input image is very large second it lacks the computational scalability for dealing with images with different sizes third it is quite different from human visual system for image recognition which involves both feadforward and recurrent proprocessing this paper proposes a different paradigm of image recognition which can take advantages of variable scales of the input images has more computational scalabilities and is more similar to image recognition by human visual system it is based on recurrent neural network rnn defined on image scale with an embeded base cnn which is named scale recurrent neural networksrnn this rnn based approach makes it easier to deal with images with variable sizes and allows us to borrow existing rnn techniques such as lstm and gru to further enhance the recognition accuracy our experiments show that the recognition accuracy of a base cnn can be significantly boosted using the proposed srnn models it also significantly outperforms the scale ensemble method which integrate the results of performing cnn to the input image at different scales although the computational overhead of using srnn is negligible | [['convolutional', 'neural', 'networkcnn', 'has', 'been', 'widely', 'used', 'for', 'image', 'recognition', 'with', 'great', 'success', 'however', 'there', 'are', 'a', 'number', 'of', 'limitations', 'of', 'the', 'current', 'cnn', 'based', 'image', 'recognition', 'paradigm', 'first', 'the', 'receptive', 'field', 'of', 'cnn', 'is', 'generally', 'fixed', 'which', 'limits', 'its', 'recognition', 'capacity', 'when', 'the', 'input', 'image', 'is', 'very', 'large', 'second', 'it', 'lacks', 'the', 'computational', 'scalability', 'for', 'dealing', 'with', 'images', 'with', 'different', 'sizes', 'third', 'it', 'is', 'quite', 'different', 'from', 'human', 'visual', 'system', 'for', 'image', 'recognition', 'which', 'involves', 'both', 'feadforward', 'and', 'recurrent', 'proprocessing', 'this', 'paper', 'proposes', 'a', 'different', 'paradigm', 'of', 'image', 'recognition', 'which', 'can', 'take', 'advantages', 'of', 'variable', 'scales', 'of', 'the', 'input', 'images', 'has', 'more', 'computational', 'scalabilities', 'and', 'is', 'more', 'similar', 'to', 'image', 'recognition', 'by', 'human', 'visual', 'system', 'it', 'is', 'based', 'on', 'recurrent', 'neural', 'network', 'rnn', 'defined', 'on', 'image', 'scale', 'with', 'an', 'embeded', 'base', 'cnn', 'which', 'is', 'named', 'scale', 'recurrent', 'neural', 'networksrnn', 'this', 'rnn', 'based', 'approach', 'makes', 'it', 'easier', 'to', 'deal', 'with', 'images', 'with', 'variable', 'sizes', 'and', 'allows', 'us', 'to', 'borrow', 'existing', 'rnn', 'techniques', 'such', 'as', 'lstm', 'and', 'gru', 'to', 'further', 'enhance', 'the', 'recognition', 'accuracy', 'our', 'experiments', 'show', 'that', 'the', 'recognition', 'accuracy', 'of', 'a', 'base', 'cnn', 'can', 'be', 'significantly', 'boosted', 'using', 'the', 'proposed', 'srnn', 'models', 'it', 'also', 'significantly', 'outperforms', 'the', 'scale', 'ensemble', 'method', 'which', 'integrate', 'the', 'results', 'of', 'performing', 'cnn', 'to', 'the', 'input', 'image', 'at', 'different', 'scales', 'although', 'the', 'computational', 'overhead', 'of', 'using', 'srnn', 'is', 'negligible']] | [-0.0317039477303877, -0.003765663536035296, -0.06914142144810223, 0.0384854818889197, -0.11492652015031496, -0.23247264891049543, -0.031200065352844402, 0.465981145191314, -0.2721246329275259, -0.33008831996066135, 0.08206800607557733, -0.2293321091505384, -0.20734348616402648, 0.21305682762353195, -0.1597078659790842, 0.1071321947046564, 0.13910810916149374, 0.09424711442742142, -0.05744279150395945, -0.3057939417542241, 0.2769364567401891, 0.07256658978989912, 0.35977100557858355, -0.002692206278369589, 0.14922851868546927, -0.07609690092735802, -0.02226171608144055, -0.021052558459678655, 0.01768201452503334, 0.19623932694569568, 0.29076718918134564, 0.18745683723896303, 0.30198947002698256, -0.4194206515879147, -0.2571076239075731, 0.05893874094754087, 0.168633263074578, 0.10683962952174937, -0.006922010679616555, -0.3326492186054183, 0.12721618100773222, -0.17026249472709262, 0.06231137070745837, -0.12738510345138307, 0.021620853237251485, -0.02868537700522219, -0.28690344723978195, 0.024866408902210948, 0.08948298928230934, 0.06919439579886953, -0.025086577171280693, -0.10880384633498798, 0.015781947414757372, 0.19519592330823188, 0.058646462683890406, 0.1118628647877957, 0.14870939248060278, -0.21606154176427633, -0.10802260375206624, 0.3842321434964287, -0.05676294577927476, -0.2401345301307822, 0.226107197578752, -0.03320622993569939, -0.16877574479940655, 0.12326340391079377, 0.2051951900225689, 0.08598057168264077, -0.1424207394341206, 0.014909996997725168, -0.04643388169215006, 0.23159312805776142, 0.07476223378370588, 0.006416283212854986, 0.1745562543671123, 0.33481750633078733, 0.014419356193519892, 0.1424024008563193, -0.20469421582987607, -0.05931713983281705, -0.14934504304999882, -0.0691576558649877, -0.20774446292548562, -0.015243009491338989, -0.1270132545585643, -0.14263269790275468, 0.4212958823333229, 0.26177635299867835, 0.20627253934134185, 0.14764476135400506, 0.3726417215797013, 0.06013148687400632, 0.21828530382836972, 0.06952678248331944, 0.168339207458175, 0.018545964657965357, 0.14099692867445124, -0.16534438388797715, 0.0714624918748654, 0.07257485017391149] |
1,803.09219 | Digital Cardan Grille: A Modern Approach for Information Hiding | In this paper, a new framework for construction of Cardan grille for
information hiding is proposed. Based on the semantic image inpainting
technique, the stego image are driven by secret messages directly. A mask
called Digital Cardan Grille (DCG) for determining the hidden location is
introduced to hide the message. The message is written to the corrupted region
that needs to be filled in the corrupted image in advance. Then the corrupted
image with secret message is feeded into a Generative Adversarial Network (GAN)
for semantic completion. The adversarial game not only reconstruct the
corrupted image , but also generate a stego image which contains the logic
rationality of image content. The experimental results verify the feasibility
of the proposed method.
| cs.MM cs.CR | in this paper a new framework for construction of cardan grille for information hiding is proposed based on the semantic image inpainting technique the stego image are driven by secret messages directly a mask called digital cardan grille dcg for determining the hidden location is introduced to hide the message the message is written to the corrupted region that needs to be filled in the corrupted image in advance then the corrupted image with secret message is feeded into a generative adversarial network gan for semantic completion the adversarial game not only reconstruct the corrupted image but also generate a stego image which contains the logic rationality of image content the experimental results verify the feasibility of the proposed method | [['in', 'this', 'paper', 'a', 'new', 'framework', 'for', 'construction', 'of', 'cardan', 'grille', 'for', 'information', 'hiding', 'is', 'proposed', 'based', 'on', 'the', 'semantic', 'image', 'inpainting', 'technique', 'the', 'stego', 'image', 'are', 'driven', 'by', 'secret', 'messages', 'directly', 'a', 'mask', 'called', 'digital', 'cardan', 'grille', 'dcg', 'for', 'determining', 'the', 'hidden', 'location', 'is', 'introduced', 'to', 'hide', 'the', 'message', 'the', 'message', 'is', 'written', 'to', 'the', 'corrupted', 'region', 'that', 'needs', 'to', 'be', 'filled', 'in', 'the', 'corrupted', 'image', 'in', 'advance', 'then', 'the', 'corrupted', 'image', 'with', 'secret', 'message', 'is', 'feeded', 'into', 'a', 'generative', 'adversarial', 'network', 'gan', 'for', 'semantic', 'completion', 'the', 'adversarial', 'game', 'not', 'only', 'reconstruct', 'the', 'corrupted', 'image', 'but', 'also', 'generate', 'a', 'stego', 'image', 'which', 'contains', 'the', 'logic', 'rationality', 'of', 'image', 'content', 'the', 'experimental', 'results', 'verify', 'the', 'feasibility', 'of', 'the', 'proposed', 'method']] | [-0.07355998938631576, -0.05164214751615267, -0.07852956908755004, 0.07279330573413366, -0.11577869144578774, -0.22177469158389915, 0.046764756852644494, 0.4009142237715423, -0.31934872375180323, -0.2811585864905889, 0.12046415985872348, -0.2792261717608199, -0.16139084780588747, 0.12050530503426368, -0.23420799442319548, 0.07523122403848295, 0.04235008635171956, 0.07033419293317517, 0.00031430241845858595, -0.3295756159427886, 0.3151770686885963, 0.023205113845566908, 0.2883782709638278, 0.002712438280771797, 0.15229569689448302, -0.0031773472825686135, -0.0695585630707986, -0.05285554473618201, -0.02914936289726029, 0.13720785287441686, 0.34561467319726946, 0.2501089831930585, 0.26857525697851087, -0.4006868601155778, -0.20447944750946287, 0.08755368441343307, 0.13504792092911277, 0.13555300236912443, -0.12838192078149102, -0.4135081631655339, 0.1694860033186463, -0.12926900242455303, 0.07775562007057792, -0.056626761722145605, -0.0743217645601059, -0.07176186244614655, -0.3219198334690494, -0.019345108885560573, 0.08277201193074385, 0.01543125198998799, -0.01172284028531673, -0.03756927233868434, -0.007364918413804844, 0.17723111836627747, -0.01655558607696245, 0.09934559734926249, 0.15177004345847914, -0.17133540015323281, -0.0890070217079483, 0.3593130551278591, -0.0354688358027488, -0.22941874231546536, 0.035230660254213335, -0.019282078127920006, -0.11059684735179569, 0.17432306982858184, 0.20788983296758184, 0.08755515442462639, -0.17477946057527635, 0.02104597748645271, -0.10742143962609892, 0.25258354923377435, 0.09609302059204007, 0.042143772546357164, 0.1608836498266707, 0.18514901332867642, 0.018835182821688553, 0.18200192472528823, -0.1541203118142827, -0.05311561870233466, -0.2459961368391911, -0.1439418266005911, -0.2797183816864466, -0.06410901176847499, -0.08520076448330656, -0.14623722521937452, 0.4087398557613293, 0.23413919583351042, 0.19515562037704512, 0.05709231904960082, 0.4185442808258813, -0.003435811373249938, 0.09409372597001493, 0.08640215945585321, 0.14978626030254721, 0.07050576139590703, 0.11024644812277984, -0.11148851702455431, 0.14920922484016047, 0.09581594920212713] |
1,803.0922 | A Minimal Mechanosensing Model Predicts Keratocyte Evolution on Flexible
Substrates | A mathematical model is proposed for shape evolution and locomotion of fish
epidermal keratocytes on elastic substrates. The model is based on
mechanosensing concepts: cells apply contractile forces onto the elastic
substrate, while cell shape evolution depends locally on the substrate stress
generated by themselves or external mechanical stimuli acting on the substrate.
We use the level set method to study the behavior of the model numerically, and
predict a number of distinct phenomena observed in experiments, such as (i)
symmetry breaking from the stationary centrosymmetric to the well-known
steadily propagating crescent shape, (ii) asymmetric bipedal oscillations and
traveling waves in the lamellipodium leading edge (iii) response to mechanical
stress externally applied to the substrate (tensotaxis), (iv) changing
direction of motion towards an interface with a rigid substrate (durotaxis) and
(v) the configuration of substrate wrinkles induced by contractile forces
applied by the keratocyte.
| physics.bio-ph q-bio.CB | a mathematical model is proposed for shape evolution and locomotion of fish epidermal keratocytes on elastic substrates the model is based on mechanosensing concepts cells apply contractile forces onto the elastic substrate while cell shape evolution depends locally on the substrate stress generated by themselves or external mechanical stimuli acting on the substrate we use the level set method to study the behavior of the model numerically and predict a number of distinct phenomena observed in experiments such as i symmetry breaking from the stationary centrosymmetric to the wellknown steadily propagating crescent shape ii asymmetric bipedal oscillations and traveling waves in the lamellipodium leading edge iii response to mechanical stress externally applied to the substrate tensotaxis iv changing direction of motion towards an interface with a rigid substrate durotaxis and v the configuration of substrate wrinkles induced by contractile forces applied by the keratocyte | [['a', 'mathematical', 'model', 'is', 'proposed', 'for', 'shape', 'evolution', 'and', 'locomotion', 'of', 'fish', 'epidermal', 'keratocytes', 'on', 'elastic', 'substrates', 'the', 'model', 'is', 'based', 'on', 'mechanosensing', 'concepts', 'cells', 'apply', 'contractile', 'forces', 'onto', 'the', 'elastic', 'substrate', 'while', 'cell', 'shape', 'evolution', 'depends', 'locally', 'on', 'the', 'substrate', 'stress', 'generated', 'by', 'themselves', 'or', 'external', 'mechanical', 'stimuli', 'acting', 'on', 'the', 'substrate', 'we', 'use', 'the', 'level', 'set', 'method', 'to', 'study', 'the', 'behavior', 'of', 'the', 'model', 'numerically', 'and', 'predict', 'a', 'number', 'of', 'distinct', 'phenomena', 'observed', 'in', 'experiments', 'such', 'as', 'i', 'symmetry', 'breaking', 'from', 'the', 'stationary', 'centrosymmetric', 'to', 'the', 'wellknown', 'steadily', 'propagating', 'crescent', 'shape', 'ii', 'asymmetric', 'bipedal', 'oscillations', 'and', 'traveling', 'waves', 'in', 'the', 'lamellipodium', 'leading', 'edge', 'iii', 'response', 'to', 'mechanical', 'stress', 'externally', 'applied', 'to', 'the', 'substrate', 'tensotaxis', 'iv', 'changing', 'direction', 'of', 'motion', 'towards', 'an', 'interface', 'with', 'a', 'rigid', 'substrate', 'durotaxis', 'and', 'v', 'the', 'configuration', 'of', 'substrate', 'wrinkles', 'induced', 'by', 'contractile', 'forces', 'applied', 'by', 'the', 'keratocyte']] | [-0.12124025794250852, 0.19772806042454033, -0.06007379607681732, -0.03503999783546775, -0.09294590893872343, -0.1400962783173508, 0.021521360545021878, 0.4186324159959917, -0.3002286206807134, -0.2706920651106776, 0.03495246498728288, -0.2565820826171943, -0.2249090973649278, 0.15972742738553902, -0.030169456908555145, 0.030382781299287, -0.00020715299427144594, -0.027421096398436522, 0.04266893963322981, -0.12991833123305696, 0.26257513523577236, 0.02702027288838648, 0.37039128398210125, 0.029822762241469812, 0.11398647138620954, 0.012459148691928053, 0.05442141757551841, 0.04789773661845162, -0.1454416510936604, 0.07653870859990951, 0.15623553159444795, 0.002020927968311247, 0.1993149445991364, -0.5459467600119281, -0.21965952476623332, 0.03197819104261853, 0.10082044934371968, 0.13571155545874858, -0.0564576339626268, -0.2918638652190566, 0.01667272759979213, -0.10663274447824415, -0.15554790728044912, -0.029204075296337787, 0.056252751442427924, 0.059856870579223925, -0.20753768427701264, 0.07958656705596803, 0.06802046698374817, 0.0813147834497276, -0.13056842911128813, -0.04875759963659322, -0.1273298530718898, 0.10428640570400374, 0.06098453518918266, 0.02273784029412318, 0.3017858776819104, -0.15236060221360384, -0.07788222633510619, 0.39914578413655916, -0.03647752332426217, -0.2261112655636731, 0.20291433526509137, -0.1091540645925211, -0.00533870854121926, 0.15124427599480728, 0.23363299553862193, 0.07293987425550545, -0.10840171591502491, 0.02047704073756777, 0.021760366681207725, 0.15695276558464327, 0.10696289818115219, -0.0998682983616901, 0.2234232158406631, 0.21182554068004752, 0.04594289354485023, 0.14066687213921256, -0.08744020189868508, -0.04826901315783079, -0.25428397335694986, -0.09478249976092337, -0.15579767913437104, 0.02152179875183147, -0.06865680039741451, -0.21737216302955692, 0.4035549106734147, 0.07727518433971994, 0.18512226727472006, 0.010074318214026573, 0.25185189165917415, 0.02432208164878779, 0.07115338596033415, 0.016322253522678062, 0.2630628351972054, 0.12780755212029013, 0.08412971571771675, -0.2868703414858612, 0.11423725486648353, 0.05406784645600857] |
1,803.09221 | Nonconventional Random Matrix Products | Let $\xi_1,\xi_2,...$ be independent identically distributed random variables
and $F:\bbR^\ell\to SL_d(\bbR)$ be a Borel measurable matrix-valued function.
Set $X_n=F(\xi_{q_1(n)},\xi_{q_2(n)},...,\xi_{q_\ell(n)})$ where $0\leq
q_1<q_2<...<q_\ell$ are increasing functions taking on integer values on
integers. We study the asymptotic behavior as $N\to\infty$ of the singular
values of the random matrix product $\Pi_N=X_N\cdots X_2X_1$ and show, in
particular, that (under certain conditions) $\frac 1N\log\|\Pi_N\|$ converges
with probability one as $N\to\infty$. We also obtain similar results for such
products when $\xi_i$ form a Markov chain. The essential difference from the
usual setting appears since the sequence $(X_n)$ is long-range dependent and
nonstationary.
| math.PR | let xi_1xi_2 be independent identically distributed random variables and fbbrellto sl_dbbr be a borel measurable matrixvalued function set x_nfxi_q_1nxi_q_2nxi_q_elln where 0leq q_1q_2q_ell are increasing functions taking on integer values on integers we study the asymptotic behavior as ntoinfty of the singular values of the random matrix product pi_nx_ncdots x_2x_1 and show in particular that under certain conditions frac 1nlogpi_n converges with probability one as ntoinfty we also obtain similar results for such products when xi_i form a markov chain the essential difference from the usual setting appears since the sequence x_n is longrange dependent and nonstationary | [['let', 'xi_1xi_2', 'be', 'independent', 'identically', 'distributed', 'random', 'variables', 'and', 'fbbrellto', 'sl_dbbr', 'be', 'a', 'borel', 'measurable', 'matrixvalued', 'function', 'set', 'x_nfxi_q_1nxi_q_2nxi_q_elln', 'where', '0leq', 'q_1q_2q_ell', 'are', 'increasing', 'functions', 'taking', 'on', 'integer', 'values', 'on', 'integers', 'we', 'study', 'the', 'asymptotic', 'behavior', 'as', 'ntoinfty', 'of', 'the', 'singular', 'values', 'of', 'the', 'random', 'matrix', 'product', 'pi_nx_ncdots', 'x_2x_1', 'and', 'show', 'in', 'particular', 'that', 'under', 'certain', 'conditions', 'frac', '1nlogpi_n', 'converges', 'with', 'probability', 'one', 'as', 'ntoinfty', 'we', 'also', 'obtain', 'similar', 'results', 'for', 'such', 'products', 'when', 'xi_i', 'form', 'a', 'markov', 'chain', 'the', 'essential', 'difference', 'from', 'the', 'usual', 'setting', 'appears', 'since', 'the', 'sequence', 'x_n', 'is', 'longrange', 'dependent', 'and', 'nonstationary']] | [-0.1354895576524238, 0.20072310608811678, -0.0538972416271766, 0.04038198118279171, -0.012628469606473422, -0.15794451704455748, 0.008188736564221068, 0.35921745403773253, -0.29649599968559215, -0.1542192433834619, 0.1264092232268821, -0.3047142482466168, -0.1460016612817223, 0.15839082728036577, -0.050018819581924216, 0.05716140940170994, 0.037061353128713864, 0.10997592637108432, -0.059575826703156864, -0.24544404974828163, 0.32882389050727295, -0.05781780592062407, 0.23795765325840976, -0.023649341088538577, 0.10354683692049649, 0.0753888048697263, 0.022357808115581673, -0.002251620880431599, -0.15116310277735465, -0.019777685763417846, 0.2476180763087339, 0.08247809534069449, 0.29823525261567235, -0.3521164438376824, -0.12280594102339819, 0.22964312631326417, 0.184159839582733, -0.029852172755636276, 0.026010777115718357, -0.26934104272190273, 0.12865800496397747, -0.13775314545233008, -0.14019425990991294, -0.07684553757313148, 0.041574557430835234, 0.1273085645865649, -0.4246392657049, 0.06299236424286694, 0.07222275644437307, 0.02991505377512011, -0.03962173682327072, -0.20174774553419816, 0.0020691257358218234, 0.11783257839108248, 0.060927846052476926, 0.04942162711587217, 0.09415701074629194, -0.02944816771066851, -0.054653067159880366, 0.3148604555178382, -0.10351696832415959, -0.27073106334234276, 0.1028586832444287, -0.1947799382951214, -0.1845179178027643, 0.05646615949355894, 0.12417466593906283, 0.1528894778004744, -0.09301786477396187, 0.18067296937741856, -0.09053376418434911, 0.13123328059187367, 0.07979832551856007, 0.06885614181713512, 0.16456612637266516, 0.06220287602498299, 0.106933500783311, 0.15029147427218656, 0.025750787275319452, -0.12209670298422376, -0.34936488014128475, -0.13578770158605444, -0.2495651366447823, 0.17591694565489888, -0.21048644962672067, -0.21505284868180752, 0.30315367043173563, 0.11869447597710961, 0.24152169831536918, 0.14849779323364298, 0.19696829850888914, 0.20722758554378137, -0.027180412535866103, 0.0628045705664489, 0.036021487321704626, 0.16966287520351922, 0.027840048923260637, -0.1299493841180164, 0.12602208982118301, 0.08906661866025792] |
1,803.09222 | Multi-SpaM: a Maximum-Likelihood approach to Phylogeny reconstruction
based on Multiple Spaced-Word Matches | Motivation: Word-based or `alignment-free' methods for phylogeny
reconstruction are much faster than traditional approaches, but they are
generally less accurate. Most of these methods calculate pairwise distances for
a set of input sequences, for example from word frequencies, from so-called
spaced-word matches or from the average length of common substrings.
Results: In this paper, we propose the first word-based approach to tree
reconstruction that is based on multiple sequence comparison and Maximum
Likelihood. Our algorithm first samples small, gap-free alignments involving
four taxa each. For each of these alignments, it then calculates a quartet tree
and, finally, the program Quartet MaxCut is used to infer a super tree topology
for the full set of input taxa from the calculated quartet trees. Experimental
results show that trees calculated with our approach are of high quality.
Availability: The source code of the program is available at
https://github.com/tdencker/multi-SpaM
Contact: thomas.dencker@stud.uni-goettingen.de
| q-bio.PE | motivation wordbased or alignmentfree methods for phylogeny reconstruction are much faster than traditional approaches but they are generally less accurate most of these methods calculate pairwise distances for a set of input sequences for example from word frequencies from socalled spacedword matches or from the average length of common substrings results in this paper we propose the first wordbased approach to tree reconstruction that is based on multiple sequence comparison and maximum likelihood our algorithm first samples small gapfree alignments involving four taxa each for each of these alignments it then calculates a quartet tree and finally the program quartet maxcut is used to infer a super tree topology for the full set of input taxa from the calculated quartet trees experimental results show that trees calculated with our approach are of high quality availability the source code of the program is available at httpsgithubcomtdenckermultispam contact thomasdenckerstudunigoettingende | [['motivation', 'wordbased', 'or', 'alignmentfree', 'methods', 'for', 'phylogeny', 'reconstruction', 'are', 'much', 'faster', 'than', 'traditional', 'approaches', 'but', 'they', 'are', 'generally', 'less', 'accurate', 'most', 'of', 'these', 'methods', 'calculate', 'pairwise', 'distances', 'for', 'a', 'set', 'of', 'input', 'sequences', 'for', 'example', 'from', 'word', 'frequencies', 'from', 'socalled', 'spacedword', 'matches', 'or', 'from', 'the', 'average', 'length', 'of', 'common', 'substrings', 'results', 'in', 'this', 'paper', 'we', 'propose', 'the', 'first', 'wordbased', 'approach', 'to', 'tree', 'reconstruction', 'that', 'is', 'based', 'on', 'multiple', 'sequence', 'comparison', 'and', 'maximum', 'likelihood', 'our', 'algorithm', 'first', 'samples', 'small', 'gapfree', 'alignments', 'involving', 'four', 'taxa', 'each', 'for', 'each', 'of', 'these', 'alignments', 'it', 'then', 'calculates', 'a', 'quartet', 'tree', 'and', 'finally', 'the', 'program', 'quartet', 'maxcut', 'is', 'used', 'to', 'infer', 'a', 'super', 'tree', 'topology', 'for', 'the', 'full', 'set', 'of', 'input', 'taxa', 'from', 'the', 'calculated', 'quartet', 'trees', 'experimental', 'results', 'show', 'that', 'trees', 'calculated', 'with', 'our', 'approach', 'are', 'of', 'high', 'quality', 'availability', 'the', 'source', 'code', 'of', 'the', 'program', 'is', 'available', 'at', 'httpsgithubcomtdenckermultispam', 'contact', 'thomasdenckerstudunigoettingende']] | [-0.0584787823010831, 0.06428051023330125, -0.055044163749294564, 0.13153591168520506, -0.0779431484649346, -0.13729531774879433, 0.06875258816580754, 0.4141982523465736, -0.2702523821668971, -0.3459768878076122, 0.07608564317585358, -0.3117158056185063, -0.12121710806806935, 0.20381555052073155, -0.017969644122381903, 0.05898600334088163, 0.17320180826936848, 0.09078606357474604, -0.05045732203305104, -0.26220117118727004, 0.30390829061313224, 0.0382514304559057, 0.29544586861609584, -0.035360063979169354, 0.10874168258225028, 0.005401193586698759, -0.054727817639812, 0.016204360044664808, -0.10357642177859816, 0.15842532054779845, 0.2779597410537665, 0.23349088231043424, 0.21731605734546772, -0.373993265015694, -0.16131201280384427, 0.09359591193788219, 0.1451399662708152, 0.20434512650050843, 0.0076998090686781024, -0.21890109138136418, 0.13724311757202182, -0.11346406543210226, 0.0035889072225674884, -0.047457216520948954, -0.00030079671867295273, 0.012978355429368094, -0.2722351995115686, 0.04815962769862381, 0.01690319004895476, 0.04488867246416501, -0.05123328739621987, -0.22398497834607647, -0.016401880276842147, 0.14765606643373352, 0.020878825477363232, 0.0880861686115774, 0.06740658290153886, -0.08799731782669874, -0.16400524006490336, 0.36548720948889646, -0.04814926618574747, -0.18894875783330967, 0.20614024662548522, -0.09382669307200962, -0.1743016785767395, 0.13986002556824437, 0.16116144467378035, 0.16922582658137092, -0.15693276832138914, 0.01403518749915141, -0.03191113904985185, 0.1838899335933901, 0.09975503192658329, -0.009733437013993453, 0.18187301494698557, 0.1950322852321228, 0.061809143678854324, 0.13077364010678139, -0.10762575196147534, -0.039237219992274835, -0.2360018742138992, -0.09269587505847691, -0.2062869395271668, -0.04405892453117607, -0.13068860173593244, -0.209469478797271, 0.3840722633499859, 0.18752947945277912, 0.19993585489767915, 0.18246838356006062, 0.3375672474503517, 0.03625853007886488, 0.08834411934124849, 0.09207007829940671, 0.13308543944731355, 0.0661209191918412, -0.019627315474079095, -0.18088543078273586, 0.11090470142112786, 0.0930225831301262] |
1,803.09223 | Edge correlations in random regular hypergraphs and applications to
subgraph testing | Compared to the classical binomial random (hyper)graph model, the study of
random regular hypergraphs is made more challenging due to correlations between
the occurrence of different edges. We develop an edge-switching technique for
hypergraphs which allows us to show that these correlations are limited for a
large range of densities. This extends some previous results of Kim, Sudakov
and Vu for graphs. From our results we deduce several corollaries on subgraph
counts in random $d$-regular hypergraphs. We also prove a conjecture of Dudek,
Frieze, Ruci\'nski and \v{S}ileikis on the threshold for the existence of an
$\ell$-overlapping Hamilton cycle in a random $d$-regular $r$-graph.
Moreover, we apply our results to prove bounds on the query complexity of
testing subgraph-freeness. The problem of testing subgraph-freeness in the
general graphs model was first studied by Alon, Kaufman, Krivelevich and Ron,
who obtained several bounds on the query complexity of testing
triangle-freeness. We extend some of these previous results beyond the triangle
setting and to the hypergraph setting.
| math.CO | compared to the classical binomial random hypergraph model the study of random regular hypergraphs is made more challenging due to correlations between the occurrence of different edges we develop an edgeswitching technique for hypergraphs which allows us to show that these correlations are limited for a large range of densities this extends some previous results of kim sudakov and vu for graphs from our results we deduce several corollaries on subgraph counts in random dregular hypergraphs we also prove a conjecture of dudek frieze rucinski and vsileikis on the threshold for the existence of an elloverlapping hamilton cycle in a random dregular rgraph moreover we apply our results to prove bounds on the query complexity of testing subgraphfreeness the problem of testing subgraphfreeness in the general graphs model was first studied by alon kaufman krivelevich and ron who obtained several bounds on the query complexity of testing trianglefreeness we extend some of these previous results beyond the triangle setting and to the hypergraph setting | [['compared', 'to', 'the', 'classical', 'binomial', 'random', 'hypergraph', 'model', 'the', 'study', 'of', 'random', 'regular', 'hypergraphs', 'is', 'made', 'more', 'challenging', 'due', 'to', 'correlations', 'between', 'the', 'occurrence', 'of', 'different', 'edges', 'we', 'develop', 'an', 'edgeswitching', 'technique', 'for', 'hypergraphs', 'which', 'allows', 'us', 'to', 'show', 'that', 'these', 'correlations', 'are', 'limited', 'for', 'a', 'large', 'range', 'of', 'densities', 'this', 'extends', 'some', 'previous', 'results', 'of', 'kim', 'sudakov', 'and', 'vu', 'for', 'graphs', 'from', 'our', 'results', 'we', 'deduce', 'several', 'corollaries', 'on', 'subgraph', 'counts', 'in', 'random', 'dregular', 'hypergraphs', 'we', 'also', 'prove', 'a', 'conjecture', 'of', 'dudek', 'frieze', 'rucinski', 'and', 'vsileikis', 'on', 'the', 'threshold', 'for', 'the', 'existence', 'of', 'an', 'elloverlapping', 'hamilton', 'cycle', 'in', 'a', 'random', 'dregular', 'rgraph', 'moreover', 'we', 'apply', 'our', 'results', 'to', 'prove', 'bounds', 'on', 'the', 'query', 'complexity', 'of', 'testing', 'subgraphfreeness', 'the', 'problem', 'of', 'testing', 'subgraphfreeness', 'in', 'the', 'general', 'graphs', 'model', 'was', 'first', 'studied', 'by', 'alon', 'kaufman', 'krivelevich', 'and', 'ron', 'who', 'obtained', 'several', 'bounds', 'on', 'the', 'query', 'complexity', 'of', 'testing', 'trianglefreeness', 'we', 'extend', 'some', 'of', 'these', 'previous', 'results', 'beyond', 'the', 'triangle', 'setting', 'and', 'to', 'the', 'hypergraph', 'setting']] | [-0.10211928617884693, 0.06667187658334754, -0.06511680753734524, 0.08532966944147591, -0.07585398453563728, -0.12602465892682013, 0.08961171723534296, 0.3524364403989396, -0.22913893678942035, -0.34229648677505736, 0.075193690091521, -0.29009739141690294, -0.1473833796809669, 0.18427480379820882, -0.15421534556734526, 0.0884003725282296, 0.08063818433574964, 0.012563124948675617, 0.025539926444410267, -0.33492506557305196, 0.29956437985522005, 0.01600616030326044, 0.21647920089279427, 0.12918142816712966, 0.002536687718267426, 0.05099403653523804, -0.03713274978814118, 0.059295951020846394, -0.2092746393757324, 0.11526787445095747, 0.23012676709733995, 0.15417177288183642, 0.2619336830383098, -0.3821203361644789, -0.17691487730135796, 0.1412533247946865, 0.08917866486274166, 0.11667735696688329, -0.013888141406138779, -0.2949340810228921, 0.11152297114654455, -0.11431404325340724, -0.08798535335176613, -0.04288025060668588, 0.04031387232473971, 0.030105701317136854, -0.322180329511563, 0.011159393966397741, 0.15766162297653932, 0.019716659676496308, 0.028016862484991526, -0.17490938012301346, 0.05202121382728679, 0.10166416377372418, -0.019318761642128344, 0.016543953854124993, 0.01961202417316352, -0.10135014552441943, -0.21727619642667748, 0.3109933181240419, -0.029906627759452402, -0.12487845021489731, 0.15381821185166453, -0.14408951584410704, -0.25172801681414797, 0.07177982855024805, 0.13712719613132873, 0.16626505218848678, -0.10043049920465291, 0.11753635097404275, -0.1676287406532347, 0.10271682007019811, 0.15906334195550484, -0.006219913905276629, 0.04490698458063474, 0.12192592618665025, 0.12240028641773043, 0.2140865023937766, -0.004150107180998649, -0.050737378302455685, -0.24221118330886518, -0.09570267465379503, -0.2257206248835212, 0.05789800978015625, -0.2010542271183775, -0.17571067567885978, 0.40430084611921585, 0.199139904803927, 0.19528449509568788, 0.189891043309565, 0.20475577364710193, 0.05145832258247897, -0.016279480976978157, 0.1356842913751111, 0.16562566604575912, 0.2350858286968835, 0.036675104994993706, -0.13702398523211157, 0.07631924747989548, 0.13245664400416485] |
1,803.09224 | Inexact Sequential Quadratic Optimization with Penalty Parameter Updates
Within the QP Solve: Extended Version | This paper focuses on the design of sequential quadratic optimization
(commonly known as SQP) methods for solving large-scale nonlinear optimization
problems. The most computationally demanding aspect of such an approach is the
computation of the search direction during each iteration, for which we
consider the use of matrix-free methods. In particular, we develop a method
that requires an inexact solve of a single QP subproblem to establish the
convergence of the overall SQP method. It is known that SQP methods can be
plagued by poor behavior of the global convergence mechanism. To confront this
issue, we propose the use of an exact penalty function with a dynamic penalty
parameter updating strategy to be employed within the subproblem solver in such
a way that the resulting search direction predicts progress toward both
feasibility and optimality. We present our parameter updating strategy and
prove that, under reasonable assumptions, the strategy does not modify the
penalty parameter unnecessarily. We also discuss a matrix-free subproblem
solver in which our updating strategy can be incorporated. We close the paper
with a discussion of the results of numerical experiments that illustrate the
benefits of our proposed techniques.
| math.OC | this paper focuses on the design of sequential quadratic optimization commonly known as sqp methods for solving largescale nonlinear optimization problems the most computationally demanding aspect of such an approach is the computation of the search direction during each iteration for which we consider the use of matrixfree methods in particular we develop a method that requires an inexact solve of a single qp subproblem to establish the convergence of the overall sqp method it is known that sqp methods can be plagued by poor behavior of the global convergence mechanism to confront this issue we propose the use of an exact penalty function with a dynamic penalty parameter updating strategy to be employed within the subproblem solver in such a way that the resulting search direction predicts progress toward both feasibility and optimality we present our parameter updating strategy and prove that under reasonable assumptions the strategy does not modify the penalty parameter unnecessarily we also discuss a matrixfree subproblem solver in which our updating strategy can be incorporated we close the paper with a discussion of the results of numerical experiments that illustrate the benefits of our proposed techniques | [['this', 'paper', 'focuses', 'on', 'the', 'design', 'of', 'sequential', 'quadratic', 'optimization', 'commonly', 'known', 'as', 'sqp', 'methods', 'for', 'solving', 'largescale', 'nonlinear', 'optimization', 'problems', 'the', 'most', 'computationally', 'demanding', 'aspect', 'of', 'such', 'an', 'approach', 'is', 'the', 'computation', 'of', 'the', 'search', 'direction', 'during', 'each', 'iteration', 'for', 'which', 'we', 'consider', 'the', 'use', 'of', 'matrixfree', 'methods', 'in', 'particular', 'we', 'develop', 'a', 'method', 'that', 'requires', 'an', 'inexact', 'solve', 'of', 'a', 'single', 'qp', 'subproblem', 'to', 'establish', 'the', 'convergence', 'of', 'the', 'overall', 'sqp', 'method', 'it', 'is', 'known', 'that', 'sqp', 'methods', 'can', 'be', 'plagued', 'by', 'poor', 'behavior', 'of', 'the', 'global', 'convergence', 'mechanism', 'to', 'confront', 'this', 'issue', 'we', 'propose', 'the', 'use', 'of', 'an', 'exact', 'penalty', 'function', 'with', 'a', 'dynamic', 'penalty', 'parameter', 'updating', 'strategy', 'to', 'be', 'employed', 'within', 'the', 'subproblem', 'solver', 'in', 'such', 'a', 'way', 'that', 'the', 'resulting', 'search', 'direction', 'predicts', 'progress', 'toward', 'both', 'feasibility', 'and', 'optimality', 'we', 'present', 'our', 'parameter', 'updating', 'strategy', 'and', 'prove', 'that', 'under', 'reasonable', 'assumptions', 'the', 'strategy', 'does', 'not', 'modify', 'the', 'penalty', 'parameter', 'unnecessarily', 'we', 'also', 'discuss', 'a', 'matrixfree', 'subproblem', 'solver', 'in', 'which', 'our', 'updating', 'strategy', 'can', 'be', 'incorporated', 'we', 'close', 'the', 'paper', 'with', 'a', 'discussion', 'of', 'the', 'results', 'of', 'numerical', 'experiments', 'that', 'illustrate', 'the', 'benefits', 'of', 'our', 'proposed', 'techniques']] | [-0.08533421485728697, -0.03826818998980138, -0.12169589910288073, 0.04816360404856347, -0.12248770543983625, -0.15366349330279216, 0.08879347596834389, 0.4016279231766678, -0.3251898105077065, -0.32231987595402134, 0.13846056492260478, -0.18448145152282955, -0.1984455030879581, 0.1867359944872792, -0.07651436089337511, 0.07900218852656693, 0.10178717662317005, -0.027822212878058795, -0.12154334488432093, -0.2787490537382799, 0.276483206197873, 0.07490969604827191, 0.25523224107540793, 0.039014358362073266, 0.11548885782444314, 0.01098617956929728, -0.012809556650475682, 0.042226335829177494, -0.10773360390550273, 0.14027787397337677, 0.2698293847582883, 0.17858263310069383, 0.38592965720728506, -0.4250780184855636, -0.18432228218188695, 0.10387807779857665, 0.18151304154066827, 0.12052035599907968, -0.08982537934466397, -0.21473616264584958, 0.10333679936258171, -0.1395551016485972, -0.11427271594317796, -0.137495338270704, -0.09358126714981663, 0.007066489561797358, -0.33100631914018647, 0.04853385403805354, 0.050899697902261315, -0.01153116027156564, -0.056444286194469055, -0.1348117474010653, 0.06399535950326912, 0.055407946906174434, 0.08927471988593078, 0.025586563879282688, 0.11008052130142003, -0.09829518611601393, -0.15195044513830808, 0.39098966801880386, -0.03843806256632764, -0.25283998807438735, 0.15321090259633138, -0.022183256952764945, -0.1630476352232094, 0.11850059636093246, 0.19678742135158758, 0.22277041611929682, -0.14301217451669684, 0.08853478033122417, -0.04145418259398085, 0.16789177027457827, -0.012038248368046437, -0.03428033017431488, 0.11176921319001944, 0.2183566939095474, 0.1658288367307155, 0.15342877560882726, -0.07033235000608568, -0.12237525269564689, -0.30347542933807636, -0.13398062285945228, -0.16913345676032504, -0.06404856994621035, -0.1032051441333737, -0.15190391639900924, 0.38011492989684276, 0.22553571162828248, 0.16249385306913972, 0.08944735296085204, 0.34530287499281126, 0.14937194414236898, 0.056560778731043836, 0.10578293572740717, 0.23513043997382638, 0.05193244550542916, 0.09891999953460553, -0.28061974962810005, 0.09797120286415073, 0.10992548246599773] |
1,803.09225 | NOMA for throughput and EE maximization in Energy Harvesting Enabled
Networks | Wireless power transfer via radio-frequency (RF) radiation is regarded as a
potential solution to energize energy-constrained users, who are deployed close
to the base stations (near-by users). However, energy transfer requires much
more transmit power than normal information transfer, which makes it very
challenging to provide the quality of service in terms of throughput for all
near-by users and cell-edge users. Thus, it is of practical interest to employ
non-orthogonal multiple access (NOMA) to improve the throughput of all network
users, while fulfilling the energy harvesting requirements of the near-by
users. To realize both energy harvesting and information decoding, we consider
a transmit time-switching (transmit-TS) protocol. We formulate two important
beamfoming problems of users' max-min throughput optimization and energy
efficiency maximization under power constraint and energy harvesting thresholds
at the nearly-located users. For these problems, the optimization objective and
energy harvesting are non-convex in beamforming vectors. Thus, we develop
efficient path-following algorithms to solve them. In addition, we also
consider conventional power splitting (PS)-based energy harvesting receiver.
Our numerical results confirm that the proposed transmit-TS based algorithms
clearly outperform PS-based algorithms in terms of both, throughput and energy
efficiency.
| cs.IT math.IT | wireless power transfer via radiofrequency rf radiation is regarded as a potential solution to energize energyconstrained users who are deployed close to the base stations nearby users however energy transfer requires much more transmit power than normal information transfer which makes it very challenging to provide the quality of service in terms of throughput for all nearby users and celledge users thus it is of practical interest to employ nonorthogonal multiple access noma to improve the throughput of all network users while fulfilling the energy harvesting requirements of the nearby users to realize both energy harvesting and information decoding we consider a transmit timeswitching transmitts protocol we formulate two important beamfoming problems of users maxmin throughput optimization and energy efficiency maximization under power constraint and energy harvesting thresholds at the nearlylocated users for these problems the optimization objective and energy harvesting are nonconvex in beamforming vectors thus we develop efficient pathfollowing algorithms to solve them in addition we also consider conventional power splitting psbased energy harvesting receiver our numerical results confirm that the proposed transmitts based algorithms clearly outperform psbased algorithms in terms of both throughput and energy efficiency | [['wireless', 'power', 'transfer', 'via', 'radiofrequency', 'rf', 'radiation', 'is', 'regarded', 'as', 'a', 'potential', 'solution', 'to', 'energize', 'energyconstrained', 'users', 'who', 'are', 'deployed', 'close', 'to', 'the', 'base', 'stations', 'nearby', 'users', 'however', 'energy', 'transfer', 'requires', 'much', 'more', 'transmit', 'power', 'than', 'normal', 'information', 'transfer', 'which', 'makes', 'it', 'very', 'challenging', 'to', 'provide', 'the', 'quality', 'of', 'service', 'in', 'terms', 'of', 'throughput', 'for', 'all', 'nearby', 'users', 'and', 'celledge', 'users', 'thus', 'it', 'is', 'of', 'practical', 'interest', 'to', 'employ', 'nonorthogonal', 'multiple', 'access', 'noma', 'to', 'improve', 'the', 'throughput', 'of', 'all', 'network', 'users', 'while', 'fulfilling', 'the', 'energy', 'harvesting', 'requirements', 'of', 'the', 'nearby', 'users', 'to', 'realize', 'both', 'energy', 'harvesting', 'and', 'information', 'decoding', 'we', 'consider', 'a', 'transmit', 'timeswitching', 'transmitts', 'protocol', 'we', 'formulate', 'two', 'important', 'beamfoming', 'problems', 'of', 'users', 'maxmin', 'throughput', 'optimization', 'and', 'energy', 'efficiency', 'maximization', 'under', 'power', 'constraint', 'and', 'energy', 'harvesting', 'thresholds', 'at', 'the', 'nearlylocated', 'users', 'for', 'these', 'problems', 'the', 'optimization', 'objective', 'and', 'energy', 'harvesting', 'are', 'nonconvex', 'in', 'beamforming', 'vectors', 'thus', 'we', 'develop', 'efficient', 'pathfollowing', 'algorithms', 'to', 'solve', 'them', 'in', 'addition', 'we', 'also', 'consider', 'conventional', 'power', 'splitting', 'psbased', 'energy', 'harvesting', 'receiver', 'our', 'numerical', 'results', 'confirm', 'that', 'the', 'proposed', 'transmitts', 'based', 'algorithms', 'clearly', 'outperform', 'psbased', 'algorithms', 'in', 'terms', 'of', 'both', 'throughput', 'and', 'energy', 'efficiency']] | [-0.22337201491601624, -0.03509346042604496, -0.0020597591715794737, 0.07541195262617675, -0.11140127421071332, -0.2722252280960205, 0.12143802788529184, 0.41653376783654894, -0.24959954948875532, -0.33460274873481644, 0.04031018487062626, -0.26898655331423205, -0.13534907237451363, 0.18582078558392823, -0.12288674466957848, 0.0559630144903216, 0.08280376194079997, 0.04761580722697545, -0.022907617593920158, -0.2762540144756967, 0.2567268544607746, 0.18205318223654984, 0.38882341198823467, 0.06595702901806792, 0.07378490660239452, 0.018513302852009094, 0.03132831010784733, -0.05614670583420003, -0.08944764009305878, 0.1342124889719911, 0.4036766511753642, 0.22046142700879323, 0.31303807947426654, -0.4276126086992282, -0.26285733578611487, 0.12989992168681916, 0.1546455875730082, 0.005770557420453438, -0.0570161737798449, -0.21227854615457917, 0.14258859371666305, -0.21884790555353686, -0.0031091551739542236, -0.05069332096164906, -0.12514488402033044, 0.09215284515609114, -0.3572342102916571, 0.005531193366648519, -0.044299704875166136, -0.012155599326335935, -0.09907583686928716, -0.11469281449293096, 0.028608681998335786, 0.16957361242979244, 0.05957351458354062, -0.06574661793970873, 0.13438649015968682, -0.10823273555637257, -0.11420827933509445, 0.38779506470847835, 0.06056036758422789, -0.21356696885715049, 0.16160600332628375, -0.01300975307571872, -0.08683689145865144, 0.18010742389046216, 0.2672763815329921, 0.09366138960968362, -0.1921177075015411, 0.004873727115937659, 0.040241908382183764, 0.13362760473823837, 0.11715273631446224, 0.15272111323429272, 0.16078876125499836, 0.1669847684549681, 0.20283511238453047, 0.11845431754225365, -0.07835241273857317, -0.1171425657192876, -0.15725511108476278, -0.13910215234844595, -0.23865709179055988, 0.05942461510459261, -0.06896289983737378, -0.0382520900688745, 0.38812090613458666, 0.14589297907647267, 0.09901513176299231, 0.11421137661184935, 0.43895783762056984, 0.11091415735114346, 0.03883696216194871, 0.18301016084789748, 0.210466979470815, 0.07066495729715473, 0.19954624169591254, -0.23943169008920429, -0.002741238534180147, -0.03453117733701102] |
1,803.09226 | Kernel-based Detection of Coincidentally Correct Test Cases to Improve
Fault Localization Effectiveness | Although empirical studies have confirmed the effectiveness of spectrum-based
fault localization (SBFL) techniques, their performance may be degraded due to
presence of some undesired circumstances such as the existence of coincidental
correctness (CC) where one or more passing test cases exercise a faulty
statement and thus causing some confusion to decide whether the underlying
exercised statement is faulty or not. This article aims at improving SBFL
effectiveness by mitigating the effect of CC test cases. In this regard, a new
method is proposed that uses a support vector machine (SVM) with a customized
kernel function. To build the kernel function, we applied a new
sequence-matching algorithm that measures the similarities between passing and
failing executions. We conducted some experiments to assess the proposed
method. The results show that our method can effectively improve the
performance of SBFL techniques.
| cs.SE | although empirical studies have confirmed the effectiveness of spectrumbased fault localization sbfl techniques their performance may be degraded due to presence of some undesired circumstances such as the existence of coincidental correctness cc where one or more passing test cases exercise a faulty statement and thus causing some confusion to decide whether the underlying exercised statement is faulty or not this article aims at improving sbfl effectiveness by mitigating the effect of cc test cases in this regard a new method is proposed that uses a support vector machine svm with a customized kernel function to build the kernel function we applied a new sequencematching algorithm that measures the similarities between passing and failing executions we conducted some experiments to assess the proposed method the results show that our method can effectively improve the performance of sbfl techniques | [['although', 'empirical', 'studies', 'have', 'confirmed', 'the', 'effectiveness', 'of', 'spectrumbased', 'fault', 'localization', 'sbfl', 'techniques', 'their', 'performance', 'may', 'be', 'degraded', 'due', 'to', 'presence', 'of', 'some', 'undesired', 'circumstances', 'such', 'as', 'the', 'existence', 'of', 'coincidental', 'correctness', 'cc', 'where', 'one', 'or', 'more', 'passing', 'test', 'cases', 'exercise', 'a', 'faulty', 'statement', 'and', 'thus', 'causing', 'some', 'confusion', 'to', 'decide', 'whether', 'the', 'underlying', 'exercised', 'statement', 'is', 'faulty', 'or', 'not', 'this', 'article', 'aims', 'at', 'improving', 'sbfl', 'effectiveness', 'by', 'mitigating', 'the', 'effect', 'of', 'cc', 'test', 'cases', 'in', 'this', 'regard', 'a', 'new', 'method', 'is', 'proposed', 'that', 'uses', 'a', 'support', 'vector', 'machine', 'svm', 'with', 'a', 'customized', 'kernel', 'function', 'to', 'build', 'the', 'kernel', 'function', 'we', 'applied', 'a', 'new', 'sequencematching', 'algorithm', 'that', 'measures', 'the', 'similarities', 'between', 'passing', 'and', 'failing', 'executions', 'we', 'conducted', 'some', 'experiments', 'to', 'assess', 'the', 'proposed', 'method', 'the', 'results', 'show', 'that', 'our', 'method', 'can', 'effectively', 'improve', 'the', 'performance', 'of', 'sbfl', 'techniques']] | [-0.07544235529064242, -0.015637902269625793, -0.10619417314613373, 0.09629480951411677, -0.10728893951728832, -0.17199162612804145, 0.10693646128208417, 0.37436550226656423, -0.242725045453973, -0.3063418630382343, 0.11311452488408194, -0.2434298748983934, -0.187391933866952, 0.20785021367212891, -0.10978642952007552, 0.08399531800650815, 0.12236688469198745, 0.01922521009987247, -0.06879866475651068, -0.3254951701290312, 0.2826761505229102, 0.09676885236378598, 0.3131605861843496, 0.09336103370035256, 0.04349843927227177, -0.006963329743998854, -0.028308844606331346, 0.04063959761736877, -0.05383280899448015, 0.08840493927372323, 0.2758554312589484, 0.21440317897477013, 0.3484705619217045, -0.3935137859864525, -0.1987008916861985, 0.14354368659289743, 0.13097346668803148, 0.06908726219620988, -0.04953480691641006, -0.30704015571003157, 0.15866645759113296, -0.16144412668064181, -0.12761680848316115, -0.10178838934803354, -0.058767905474098, 0.01123778942796955, -0.2617017463612222, 0.030178895717878164, 0.1061260147911051, 0.038707598281241415, -0.02792503396757757, -0.09426209018768175, 0.030888338861784534, 0.1349788293870085, 0.07521269506558884, 0.03701947046362836, 0.13311769029436013, -0.10320518872754621, -0.16906467464792987, 0.3497971977390673, -0.041657357328179954, -0.23551755832390947, 0.24331957673775437, -0.05051292000216958, -0.1322568447018663, 0.10544945906334813, 0.19708951616696035, 0.09096223937914423, -0.13875556321463722, 0.011884878570909032, -0.01383627286059377, 0.15744856073845015, 0.07165766103307893, -0.006515879588930503, 0.1579175793390343, 0.15307154088868233, 0.029035770401790523, 0.15810015322589924, -0.10232160600455667, -0.02130745460137563, -0.27099284691992553, -0.16296424679593116, -0.16549037794069643, -0.019234941494410716, -0.06297437341160822, -0.13885152786025318, 0.37920216273894347, 0.27022399900875904, 0.1687466874347487, 0.05043207262845143, 0.34232389032030885, 0.06608552229590714, 0.065622448811537, 0.08444632837494863, 0.20912892435001634, 0.07905206331085629, 0.056509630518385034, -0.22389880945801438, 0.15450907170610584, 0.03277758248420297] |
1,803.09227 | A General Dichotomy of Evolutionary Algorithms on Monotone Functions | It is known that the evolutionary algorithm $(1+1)$-EA with mutation rate
$c/n$ optimises every monotone function efficiently if $c<1$, and needs
exponential time on some monotone functions (HotTopic functions) if $c\geq
2.2$. We study the same question for a large variety of algorithms,
particularly for $(1+\lambda)$-EA, $(\mu+1)$-EA, $(\mu+1)$-GA, their fast
counterparts like fast $(1+1)$-EA, and for $(1+(\lambda,\lambda))$-GA. We find
that all considered mutation-based algorithms show a similar dichotomy for
HotTopic functions, or even for all monotone functions. For the
$(1+(\lambda,\lambda))$-GA, this dichotomy is in the parameter $c\gamma$, which
is the expected number of bit flips in an individual after mutation and
crossover, neglecting selection. For the fast algorithms, the dichotomy is in
$m_2/m_1$, where $m_1$ and $m_2$ are the first and second falling moment of the
number of bit flips. Surprisingly, the range of efficient parameters is not
affected by either population size $\mu$ nor by the offspring population size
$\lambda$.
The picture changes completely if crossover is allowed. The genetic
algorithms $(\mu+1)$-GA and fast $(\mu+1)$-GA are efficient for arbitrary
mutations strengths if $\mu$ is large enough.
| cs.NE | it is known that the evolutionary algorithm 11ea with mutation rate cn optimises every monotone function efficiently if c1 and needs exponential time on some monotone functions hottopic functions if cgeq 22 we study the same question for a large variety of algorithms particularly for 1lambdaea mu1ea mu1ga their fast counterparts like fast 11ea and for 1lambdalambdaga we find that all considered mutationbased algorithms show a similar dichotomy for hottopic functions or even for all monotone functions for the 1lambdalambdaga this dichotomy is in the parameter cgamma which is the expected number of bit flips in an individual after mutation and crossover neglecting selection for the fast algorithms the dichotomy is in m_2m_1 where m_1 and m_2 are the first and second falling moment of the number of bit flips surprisingly the range of efficient parameters is not affected by either population size mu nor by the offspring population size lambda the picture changes completely if crossover is allowed the genetic algorithms mu1ga and fast mu1ga are efficient for arbitrary mutations strengths if mu is large enough | [['it', 'is', 'known', 'that', 'the', 'evolutionary', 'algorithm', '11ea', 'with', 'mutation', 'rate', 'cn', 'optimises', 'every', 'monotone', 'function', 'efficiently', 'if', 'c1', 'and', 'needs', 'exponential', 'time', 'on', 'some', 'monotone', 'functions', 'hottopic', 'functions', 'if', 'cgeq', '22', 'we', 'study', 'the', 'same', 'question', 'for', 'a', 'large', 'variety', 'of', 'algorithms', 'particularly', 'for', '1lambdaea', 'mu1ea', 'mu1ga', 'their', 'fast', 'counterparts', 'like', 'fast', '11ea', 'and', 'for', '1lambdalambdaga', 'we', 'find', 'that', 'all', 'considered', 'mutationbased', 'algorithms', 'show', 'a', 'similar', 'dichotomy', 'for', 'hottopic', 'functions', 'or', 'even', 'for', 'all', 'monotone', 'functions', 'for', 'the', '1lambdalambdaga', 'this', 'dichotomy', 'is', 'in', 'the', 'parameter', 'cgamma', 'which', 'is', 'the', 'expected', 'number', 'of', 'bit', 'flips', 'in', 'an', 'individual', 'after', 'mutation', 'and', 'crossover', 'neglecting', 'selection', 'for', 'the', 'fast', 'algorithms', 'the', 'dichotomy', 'is', 'in', 'm_2m_1', 'where', 'm_1', 'and', 'm_2', 'are', 'the', 'first', 'and', 'second', 'falling', 'moment', 'of', 'the', 'number', 'of', 'bit', 'flips', 'surprisingly', 'the', 'range', 'of', 'efficient', 'parameters', 'is', 'not', 'affected', 'by', 'either', 'population', 'size', 'mu', 'nor', 'by', 'the', 'offspring', 'population', 'size', 'lambda', 'the', 'picture', 'changes', 'completely', 'if', 'crossover', 'is', 'allowed', 'the', 'genetic', 'algorithms', 'mu1ga', 'and', 'fast', 'mu1ga', 'are', 'efficient', 'for', 'arbitrary', 'mutations', 'strengths', 'if', 'mu', 'is', 'large', 'enough']] | [-0.1203246431619015, 0.16584751718737134, -0.02444958314030415, 0.13481502480282734, -0.03546285597779761, -0.1948291581134834, 0.08145059763912833, 0.3960947874082909, -0.2731092091289085, -0.26478640169895795, 0.10967142235910293, -0.21470296046174417, -0.13342103548751702, 0.20347517324918396, -0.049399384152079596, 0.017964544796217986, 0.05545874400538085, 0.03146020923821912, -0.04004888227774702, -0.2687285920238994, 0.28647167272152474, 0.001564633550736084, 0.21992820284377806, 0.009317019870208651, 0.06958620438642929, 0.01909915942461849, -0.003581754481043085, 0.0036276896158502453, -0.1328169840507948, 0.024123107481553056, 0.22320863799961832, 0.18891169650566286, 0.2799175162126735, -0.33787349675229555, -0.11575318528258516, 0.19566839458380497, 0.1633008388072963, 0.09894244056504564, -0.05088066117033212, -0.18758556554820713, 0.1268063178272498, -0.12115003855921183, -0.11096352543897195, -0.05285642659991463, 0.1162188482023991, 0.06751027736258343, -0.32598756432783593, 0.06394882436715217, 0.09821931096305263, 0.012623473999192777, -0.025077901387619488, -0.1522155179200705, -0.013603618690162638, 0.11448363681603761, 0.044067925670267634, 0.07297179576768567, 0.10890314266902551, -0.11221744009627385, -0.08537174121482093, 0.3349540553814758, -0.04165177882212952, -0.21124301548250493, 0.20100394861148185, -0.1770557193368178, -0.15539460941527383, 0.1583109196996171, 0.11552198998215528, 0.15874310093393518, -0.124105225871667, 0.12281869948946607, -0.017211860614408863, 0.1771517504340393, 0.048015049577965215, 0.027912478145707204, 0.15242513382236736, 0.12805014793260422, 0.13615421248825987, 0.09707582563247984, -0.059315588819186034, -0.0811891629915103, -0.2527322800469321, -0.12127734228801736, -0.1747186297895333, 0.04668122975331007, -0.12879659096536097, -0.16668547042026427, 0.3395285441357147, 0.07070613142023552, 0.20081680484998948, 0.14177498565461874, 0.27652079001542806, 0.12525750323591722, 0.07091118065731848, 0.1084482096375092, 0.16221083752690502, 0.08989689963589816, 0.032556279333620576, -0.241508263008665, 0.13458178963006145, 0.073558845935454] |
1,803.09228 | The Gross-Pitaevskii equation: B\"acklund transformations and admitted
solutions | B\"acklund transformations are applied to study the Gross-Pitaevskii
equation. Supported by previous results, a class of B\"acklund transformations
admitted by this equation are constructed. Schwartzian derivative as well as
its invariance properties turn out to represent a key tool in the present
investigation. Examples and explicit solutions of the Gross-Pitaevskii equation
are obtained.
| math-ph math.AP math.MP | backlund transformations are applied to study the grosspitaevskii equation supported by previous results a class of backlund transformations admitted by this equation are constructed schwartzian derivative as well as its invariance properties turn out to represent a key tool in the present investigation examples and explicit solutions of the grosspitaevskii equation are obtained | [['backlund', 'transformations', 'are', 'applied', 'to', 'study', 'the', 'grosspitaevskii', 'equation', 'supported', 'by', 'previous', 'results', 'a', 'class', 'of', 'backlund', 'transformations', 'admitted', 'by', 'this', 'equation', 'are', 'constructed', 'schwartzian', 'derivative', 'as', 'well', 'as', 'its', 'invariance', 'properties', 'turn', 'out', 'to', 'represent', 'a', 'key', 'tool', 'in', 'the', 'present', 'investigation', 'examples', 'and', 'explicit', 'solutions', 'of', 'the', 'grosspitaevskii', 'equation', 'are', 'obtained']] | [-0.13864429737880546, 0.0037263639464552674, -0.07963356870129916, 0.1007305300807721, -0.13047764770124318, -0.1421140766491727, -0.016172120457444834, 0.32617021457485434, -0.2671076885231261, -0.2827081692246896, 0.1183685320012166, -0.28358996586153673, -0.2009514549852542, 0.21420058007088472, 0.020456504990469734, 0.11502303593278036, 0.04721126274891057, -0.019653046046787838, -0.11313038099697738, -0.2504629408413509, 0.3280057221791654, -0.021265689002455405, 0.25724824725755685, -0.040179655245804, 0.1291005704376214, -0.05976025102097752, -0.04823158860628335, -0.029554096876450303, -0.18157879328179471, 0.057799197627969506, 0.264350424046224, 0.0712712594167382, 0.24576898115985799, -0.397213895365877, -0.24478459736015998, 0.036179832112536114, 0.1513943679296886, 0.1581907438746882, -0.08070212704533676, -0.3997802692201902, 0.03171473259176567, -0.10587116381821204, -0.2607649680191897, -0.2022233864222214, -0.003651387075770576, 0.12265502395688223, -0.20183694830937488, 0.10296380215869197, 0.07357856650827979, 0.03082162099187526, -0.11109643970080212, -0.05772936500538633, -0.09271440664218422, 0.04790992139759561, 0.06816010210522504, 0.019657109288569046, 0.07422858350998107, -0.09016374303994454, -0.10202384030200401, 0.42451403760966266, -0.0679949691765151, -0.3027298838813912, 0.1313516209824538, -0.03353377275239184, -0.1220209325031149, 0.08745539883537551, 0.12023059358679743, 0.14477816680973432, -0.23190490246029957, 0.1016758535801925, -0.05590726218168747, 0.10040824048502266, 0.08305944633265992, -0.012244569014687583, 0.1390039383978495, 0.0938480468906181, -0.01092214905217571, 0.18685740140653304, 0.09099735038460426, -0.17605318650954738, -0.39588222758106467, -0.16134203221859797, -0.14763728191830078, 0.07583274774007359, -0.03576384773801898, -0.10302041439374662, 0.3618122774949473, 0.1160520173363247, 0.15047788180692015, 0.05318930240804857, 0.17824192317026966, 0.2147171053165605, 0.07102285127840796, 0.0004471237156188713, 0.17863463283569184, 0.2066891467251446, 0.10211388455738998, -0.20492369187929896, -0.02624026606878582, 0.19700414731325405] |
1,803.09229 | Logarithmic girth expander graphs of $SL_n(\mathbb F_p)$ | We provide an explicit construction of finite 4-regular graphs
$(\Gamma_k)_{k\in \mathbb N}$ with ${girth \Gamma_k\to\infty}$ as $k\to\infty$
and $\frac{diam \Gamma_k}{girth \Gamma_k}\leqslant D$ for some $D>0$ and all
$k\in\mathbb{N}$. For each fixed dimension $n\geqslant 2,$ we find a pair of
matrices in $SL_{n}(\mathbb{Z})$ such that (i) they generate a free subgroup,
(ii)~their reductions $\bmod\, p$ generate $SL_{n}(\mathbb{F}_{p})$ for all
sufficiently large primes $p$, (iii) the corresponding Cayley graphs of
$SL_{n}(\mathbb{F}_{p})$ have girth at least $c_n\log p$ for some $c_n>0$.
Relying on growth results (with no use of expansion properties of the involved
graphs), we observe that the diameter of those Cayley graphs is at most $O(\log
p)$. This gives infinite sequences of finite $4$-regular Cayley graphs of
$SL_n(\mathbb F_p)$ as $p\to\infty$ with large girth and bounded
diameter-by-girth ratio. These are the first explicit examples in all
dimensions $n\geqslant 2$ (all prior examples were in $n=2$). Moreover, they
happen to be expanders. Together with Margulis' and Lubotzky-Phillips-Sarnak's
classical constructions, these new graphs are the only known explicit
logarithmic girth Cayley graph expanders.
| math.GR math.CO math.MG | we provide an explicit construction of finite 4regular graphs gamma_k_kin mathbb n with girth gamma_ktoinfty as ktoinfty and fracdiam gamma_kgirth gamma_kleqslant d for some d0 and all kinmathbbn for each fixed dimension ngeqslant 2 we find a pair of matrices in sl_nmathbbz such that i they generate a free subgroup iitheir reductions bmod p generate sl_nmathbbf_p for all sufficiently large primes p iii the corresponding cayley graphs of sl_nmathbbf_p have girth at least c_nlog p for some c_n0 relying on growth results with no use of expansion properties of the involved graphs we observe that the diameter of those cayley graphs is at most olog p this gives infinite sequences of finite 4regular cayley graphs of sl_nmathbb f_p as ptoinfty with large girth and bounded diameterbygirth ratio these are the first explicit examples in all dimensions ngeqslant 2 all prior examples were in n2 moreover they happen to be expanders together with margulis and lubotzkyphillipssarnaks classical constructions these new graphs are the only known explicit logarithmic girth cayley graph expanders | [['we', 'provide', 'an', 'explicit', 'construction', 'of', 'finite', '4regular', 'graphs', 'gamma_k_kin', 'mathbb', 'n', 'with', 'girth', 'gamma_ktoinfty', 'as', 'ktoinfty', 'and', 'fracdiam', 'gamma_kgirth', 'gamma_kleqslant', 'd', 'for', 'some', 'd0', 'and', 'all', 'kinmathbbn', 'for', 'each', 'fixed', 'dimension', 'ngeqslant', '2', 'we', 'find', 'a', 'pair', 'of', 'matrices', 'in', 'sl_nmathbbz', 'such', 'that', 'i', 'they', 'generate', 'a', 'free', 'subgroup', 'iitheir', 'reductions', 'bmod', 'p', 'generate', 'sl_nmathbbf_p', 'for', 'all', 'sufficiently', 'large', 'primes', 'p', 'iii', 'the', 'corresponding', 'cayley', 'graphs', 'of', 'sl_nmathbbf_p', 'have', 'girth', 'at', 'least', 'c_nlog', 'p', 'for', 'some', 'c_n0', 'relying', 'on', 'growth', 'results', 'with', 'no', 'use', 'of', 'expansion', 'properties', 'of', 'the', 'involved', 'graphs', 'we', 'observe', 'that', 'the', 'diameter', 'of', 'those', 'cayley', 'graphs', 'is', 'at', 'most', 'olog', 'p', 'this', 'gives', 'infinite', 'sequences', 'of', 'finite', '4regular', 'cayley', 'graphs', 'of', 'sl_nmathbb', 'f_p', 'as', 'ptoinfty', 'with', 'large', 'girth', 'and', 'bounded', 'diameterbygirth', 'ratio', 'these', 'are', 'the', 'first', 'explicit', 'examples', 'in', 'all', 'dimensions', 'ngeqslant', '2', 'all', 'prior', 'examples', 'were', 'in', 'n2', 'moreover', 'they', 'happen', 'to', 'be', 'expanders', 'together', 'with', 'margulis', 'and', 'lubotzkyphillipssarnaks', 'classical', 'constructions', 'these', 'new', 'graphs', 'are', 'the', 'only', 'known', 'explicit', 'logarithmic', 'girth', 'cayley', 'graph', 'expanders']] | [-0.19329564471336655, 0.1705049804014442, -0.009762779660171495, 0.07234076004615932, -0.06557196482090549, -0.18613115281346929, -0.02530268424702369, 0.4049819027917143, -0.2343233556306552, -0.29373513490441927, 0.11056627844073721, -0.3495190067058605, -0.11548893894918216, 0.15808557656904063, -0.08064187726638508, 0.048582320233167046, 0.0813344083287103, 0.11436141897801971, -0.03100171949239975, -0.35246263083993784, 0.2946195924133297, -0.05338587881792219, 0.1417931745168548, 0.056303837529893194, 0.06530473859242673, -0.026035374015827412, 0.02427476324996202, 0.010358092899334693, -0.21138172069867947, 0.06793947068904087, 0.3019856463754608, 0.10664038034302399, 0.18332032651974345, -0.3831306168774389, -0.1438752541817511, 0.24277512460680525, 0.14102114516796557, 0.07397829736700082, -0.012485482348509883, -0.1938416667388014, 0.1737547036928107, -0.12246955859433836, -0.14768025234529059, -0.05219344127595237, 0.11051751940500916, 0.04161689533089118, -0.28423608205743933, -0.011261716107222831, 0.15731821995251957, 0.12061450935302759, 0.05904764170412841, -0.23097231044029853, -0.010799974636555468, 0.11960147034725374, -0.0535434872020364, 0.017383076722071792, -0.012674367660070834, -0.07233993357498457, -0.17661925106537793, 0.3284716455459173, -0.011381463821297922, -0.17630111898805173, 0.1394809973279729, -0.1744828277601386, -0.2228921714543406, 0.15201577515804074, 0.1388803843889128, 0.16417868076618644, -0.012526320557127584, 0.18539240183572303, -0.09403528242647273, 0.12963500793337962, 0.18892114993137946, 0.016372044913400458, 0.04275109294403649, 0.061023218000787985, 0.1258581791427455, 0.14931011202953076, 0.043974401893492485, 0.026403361732292477, -0.3660569372674767, -0.09471908726736042, -0.20637365850786907, 0.14026926057383934, -0.25656013381660114, -0.2139975496058194, 0.32374524941328187, 0.058598990389219126, 0.2026773688248681, 0.18361870757649718, 0.16201570923308367, 0.015551482686046628, 0.05151964086561856, 0.19581685511617916, 0.0815635194094799, 0.17146822371602105, -0.05060093851654597, -0.10601012918324966, 0.012881322752145477, 0.16746305483537974] |
1,803.0923 | Pay More Attention - Neural Architectures for Question-Answering | Machine comprehension is a representative task of natural language
understanding. Typically, we are given context paragraph and the objective is
to answer a question that depends on the context. Such a problem requires to
model the complex interactions between the context paragraph and the question.
Lately, attention mechanisms have been found to be quite successful at these
tasks and in particular, attention mechanisms with attention flow from both
context-to-question and question-to-context have been proven to be quite
useful. In this paper, we study two state-of-the-art attention mechanisms
called Bi-Directional Attention Flow (BiDAF) and Dynamic Co-Attention Network
(DCN) and propose a hybrid scheme combining these two architectures that gives
better overall performance. Moreover, we also suggest a new simpler attention
mechanism that we call Double Cross Attention (DCA) that provides better
results compared to both BiDAF and Co-Attention mechanisms while providing
similar performance as the hybrid scheme. The objective of our paper is to
focus particularly on the attention layer and to suggest improvements on that.
Our experimental evaluations show that both our proposed models achieve
superior results on the Stanford Question Answering Dataset (SQuAD) compared to
BiDAF and DCN attention mechanisms.
| cs.CL | machine comprehension is a representative task of natural language understanding typically we are given context paragraph and the objective is to answer a question that depends on the context such a problem requires to model the complex interactions between the context paragraph and the question lately attention mechanisms have been found to be quite successful at these tasks and in particular attention mechanisms with attention flow from both contexttoquestion and questiontocontext have been proven to be quite useful in this paper we study two stateoftheart attention mechanisms called bidirectional attention flow bidaf and dynamic coattention network dcn and propose a hybrid scheme combining these two architectures that gives better overall performance moreover we also suggest a new simpler attention mechanism that we call double cross attention dca that provides better results compared to both bidaf and coattention mechanisms while providing similar performance as the hybrid scheme the objective of our paper is to focus particularly on the attention layer and to suggest improvements on that our experimental evaluations show that both our proposed models achieve superior results on the stanford question answering dataset squad compared to bidaf and dcn attention mechanisms | [['machine', 'comprehension', 'is', 'a', 'representative', 'task', 'of', 'natural', 'language', 'understanding', 'typically', 'we', 'are', 'given', 'context', 'paragraph', 'and', 'the', 'objective', 'is', 'to', 'answer', 'a', 'question', 'that', 'depends', 'on', 'the', 'context', 'such', 'a', 'problem', 'requires', 'to', 'model', 'the', 'complex', 'interactions', 'between', 'the', 'context', 'paragraph', 'and', 'the', 'question', 'lately', 'attention', 'mechanisms', 'have', 'been', 'found', 'to', 'be', 'quite', 'successful', 'at', 'these', 'tasks', 'and', 'in', 'particular', 'attention', 'mechanisms', 'with', 'attention', 'flow', 'from', 'both', 'contexttoquestion', 'and', 'questiontocontext', 'have', 'been', 'proven', 'to', 'be', 'quite', 'useful', 'in', 'this', 'paper', 'we', 'study', 'two', 'stateoftheart', 'attention', 'mechanisms', 'called', 'bidirectional', 'attention', 'flow', 'bidaf', 'and', 'dynamic', 'coattention', 'network', 'dcn', 'and', 'propose', 'a', 'hybrid', 'scheme', 'combining', 'these', 'two', 'architectures', 'that', 'gives', 'better', 'overall', 'performance', 'moreover', 'we', 'also', 'suggest', 'a', 'new', 'simpler', 'attention', 'mechanism', 'that', 'we', 'call', 'double', 'cross', 'attention', 'dca', 'that', 'provides', 'better', 'results', 'compared', 'to', 'both', 'bidaf', 'and', 'coattention', 'mechanisms', 'while', 'providing', 'similar', 'performance', 'as', 'the', 'hybrid', 'scheme', 'the', 'objective', 'of', 'our', 'paper', 'is', 'to', 'focus', 'particularly', 'on', 'the', 'attention', 'layer', 'and', 'to', 'suggest', 'improvements', 'on', 'that', 'our', 'experimental', 'evaluations', 'show', 'that', 'both', 'our', 'proposed', 'models', 'achieve', 'superior', 'results', 'on', 'the', 'stanford', 'question', 'answering', 'dataset', 'squad', 'compared', 'to', 'bidaf', 'and', 'dcn', 'attention', 'mechanisms']] | [-0.05010924614330251, -0.019193427287973464, -0.05952164448123849, 0.09122636495928019, -0.13828620635879735, -0.17849179448697855, 0.05351169833731123, 0.4638581091252269, -0.22905393879584693, -0.31197279597978755, 0.0469102130786432, -0.2531154419655207, -0.23454944169513448, 0.24670982101523176, -0.11843559021997467, 0.06231917247235302, 0.1268183989647441, 0.032857777383277026, -0.015827322788980035, -0.2858690495563366, 0.3147071645065009, 0.08593175464393522, 0.3776736513282808, 0.11072297717035605, 0.09587334936469911, -0.07616684606998528, -0.018438620421365296, 0.0060175328361327515, -0.08674874800500995, 0.17245708126020395, 0.2576522374258381, 0.15162423093157706, 0.32050428606530346, -0.4121443313600683, -0.2542916434550924, 0.07137692198169629, 0.13496623183575968, 0.10765729967145023, -0.0861024733967882, -0.26755221243257876, 0.12063284655453924, -0.18729561071586673, 0.04585200438039407, -0.13013736676873155, -0.0015668115140032516, -0.029001444531666244, -0.2808283246288608, -0.013591655095325901, 0.13620519960544283, 0.015431546029590425, -0.03254441577798278, -0.11977849737617863, 0.014417612418857596, 0.13752377798741378, 0.05672930380306372, 0.08912393739126702, 0.09512575277467332, -0.16150976647376503, -0.17508352181021736, 0.40442395691449445, -0.04693884718374758, -0.21435870263705809, 0.23663230935141208, -0.04795677989977535, -0.17600348889063946, 0.06412923666426823, 0.23969284310030242, 0.12068181060175731, -0.13361902715313057, 0.008952014110970099, -0.07727257592761248, 0.16944312555813995, 0.03417397623329803, 0.0438638617230392, 0.17589994093955116, 0.2704411787732391, 0.0033841399628688736, 0.14323298164111162, -0.062261736293929434, -0.14508947442044262, -0.15180836283360366, -0.09755382924488494, -0.1008751492530955, -0.028395309158546662, -0.009355849388628957, -0.07440856978218391, 0.42691559783470534, 0.23271928736373348, 0.2529885569616916, 0.08602051681311673, 0.31221642121475524, 0.02972719192421113, 0.08173758663956529, 0.06635385925392497, 0.2154806755906927, 0.0489554836084603, 0.13336967753872236, -0.18700816714520216, 0.09446469570199649, 0.05539841564475662] |
1,803.09231 | Biomolecular System Energetics | Efficient energy transduction is one driver of evolution; and thus
understanding biomolecular energy transduction is crucial to understanding
living organisms. As an energy-orientated modelling methodology, bond graphs
provide a useful approach to describing and modelling the efficiency of living
systems. This paper gives some new results on the efficiency of metabolism
based on bond graph models of the key metabolic processes: glycolysis.
| q-bio.MN | efficient energy transduction is one driver of evolution and thus understanding biomolecular energy transduction is crucial to understanding living organisms as an energyorientated modelling methodology bond graphs provide a useful approach to describing and modelling the efficiency of living systems this paper gives some new results on the efficiency of metabolism based on bond graph models of the key metabolic processes glycolysis | [['efficient', 'energy', 'transduction', 'is', 'one', 'driver', 'of', 'evolution', 'and', 'thus', 'understanding', 'biomolecular', 'energy', 'transduction', 'is', 'crucial', 'to', 'understanding', 'living', 'organisms', 'as', 'an', 'energyorientated', 'modelling', 'methodology', 'bond', 'graphs', 'provide', 'a', 'useful', 'approach', 'to', 'describing', 'and', 'modelling', 'the', 'efficiency', 'of', 'living', 'systems', 'this', 'paper', 'gives', 'some', 'new', 'results', 'on', 'the', 'efficiency', 'of', 'metabolism', 'based', 'on', 'bond', 'graph', 'models', 'of', 'the', 'key', 'metabolic', 'processes', 'glycolysis']] | [-0.08373867626851578, 0.0955436426373752, -0.05992622238385384, 0.08310879331242416, -0.06402477081559721, -0.1289550075689178, 0.02935907699847136, 0.3336595471215541, -0.22425323205648875, -0.30555446094787514, 0.027560124753928574, -0.1979192500384372, -0.25786176281141454, 0.24788757242628787, -0.07133851920972105, 0.02558094191319141, 0.10979771017112204, -0.013383474776838128, 0.13415894055830652, -0.1394727484453813, 0.2533777246373843, 0.15802908774282112, 0.33863193566193345, 0.12474866909142888, 0.11852603614879925, 0.0008657287623061509, -0.0346459506430709, -0.08258447197617078, -0.1734568819739535, 0.2615581603995601, 0.29337656046303234, 0.19106291907793674, 0.2863055134466926, -0.4816601691065264, -0.3180826841929897, 0.12108607829136193, 0.15532042510563232, 0.11208598575264704, -0.045620641598600103, -0.16255271480204997, 0.020774735366833993, -0.14217084779434638, -0.1141788113679065, -0.12308556400239468, 0.039540905826038024, 0.04147938028222225, -0.21726936121093354, 0.07743858516246813, 0.09543612569505654, 0.08214942089302969, -0.10880824778473279, -0.12050562580192431, -0.08391527186499023, 0.19922852026848276, -0.008334007877551142, 0.00028858519327200826, 0.2237667613891793, -0.15023849494984282, -0.17560496562939198, 0.4106732975752627, 0.017688197885319345, -0.19935925430083862, 0.25662670451308006, -0.045931069638396875, -0.2018529072281767, 0.09722605578173868, 0.21659985799189718, 0.0842284361419619, -0.2297758465541191, 0.01587966262920164, 0.06488607542925194, 0.17460244997083896, 0.005157917463144318, 0.03885062616013112, 0.21234671283727052, 0.3530915294025765, 0.05571545620800042, 0.0962922318464481, -0.009738932203379323, -0.1375596387136239, -0.23139891993315492, -0.1886842756180978, -0.15187588647832392, 0.09095794109047436, -0.12147053035661258, -0.16330036078198035, 0.42423593588020714, 0.15971383934871095, 0.1385451949537411, 0.04393358802285473, 0.28794479354849606, 0.08158491263127901, 0.034580724909290914, -0.023878381648635278, 0.12369838564086048, 0.16892726264405447, 0.11301146139253358, -0.24423302545929787, 0.1462477482817151, 0.06051733951298062] |
1,803.09232 | On the a posteriori error analysis for linear Fokker-Planck models in
convection-dominated diffusion problems | This work is aimed at the derivation of reliable and efficient a posteriori
error estimates for convection-dominated diffusion problems motivated by a
linear Fokker-Planck problem appearing in computational neuroscience. We obtain
computable error bounds of the functional type for the static and
time-dependent case and for different boundary conditions (mixed and pure
Neumann boundary conditions). Finally, we present a set of various numerical
examples including discussions on mesh adaptivity and space-time
discretisation. The numerical results confirm the reliability and efficiency of
the error estimates derived.
| cs.NA math.NA | this work is aimed at the derivation of reliable and efficient a posteriori error estimates for convectiondominated diffusion problems motivated by a linear fokkerplanck problem appearing in computational neuroscience we obtain computable error bounds of the functional type for the static and timedependent case and for different boundary conditions mixed and pure neumann boundary conditions finally we present a set of various numerical examples including discussions on mesh adaptivity and spacetime discretisation the numerical results confirm the reliability and efficiency of the error estimates derived | [['this', 'work', 'is', 'aimed', 'at', 'the', 'derivation', 'of', 'reliable', 'and', 'efficient', 'a', 'posteriori', 'error', 'estimates', 'for', 'convectiondominated', 'diffusion', 'problems', 'motivated', 'by', 'a', 'linear', 'fokkerplanck', 'problem', 'appearing', 'in', 'computational', 'neuroscience', 'we', 'obtain', 'computable', 'error', 'bounds', 'of', 'the', 'functional', 'type', 'for', 'the', 'static', 'and', 'timedependent', 'case', 'and', 'for', 'different', 'boundary', 'conditions', 'mixed', 'and', 'pure', 'neumann', 'boundary', 'conditions', 'finally', 'we', 'present', 'a', 'set', 'of', 'various', 'numerical', 'examples', 'including', 'discussions', 'on', 'mesh', 'adaptivity', 'and', 'spacetime', 'discretisation', 'the', 'numerical', 'results', 'confirm', 'the', 'reliability', 'and', 'efficiency', 'of', 'the', 'error', 'estimates', 'derived']] | [-0.09222631659906577, 0.0018300302491030273, -0.03726455044987447, 0.09130924839033362, -0.06648914232740508, -0.13836100816397984, 0.06828647451064385, 0.32989393667427497, -0.24528894897221643, -0.2908738375586622, 0.19476643039653188, -0.21831026826163424, -0.13859633244026234, 0.24691331548725856, -0.10055828217471785, 0.16159134358167648, 0.11781676572966664, -0.013025343796128736, -0.13323907282970407, -0.24065013622235068, 0.3301390327951487, 0.05357544955194873, 0.26365394065266146, 0.0835617851356373, 0.09634356944657424, -0.06569920703768731, -0.09070585987064987, 0.04510481702711652, -0.23934697269681185, 0.1472036940716755, 0.24683525443953627, 0.09216320400181062, 0.3319552405312767, -0.4525474501773715, -0.25933543456827896, 0.0440866691964295, 0.11397959045134484, 0.13599260226439905, -0.08428862465901629, -0.2879292301806238, 0.09212286871282713, -0.12481419350404073, -0.11975306194713888, -0.07276615704245427, -0.011692600215182584, 0.013458842767731231, -0.3661181068938116, 0.1618515960735214, 0.0335620596730972, 0.09404193857575165, -0.10533065892317715, -0.13774706569281134, 0.03053381319349522, 0.11546781786772257, 0.018381003693074865, -0.04714013743762146, 0.06418873095775351, -0.10218286143670625, -0.09509993535192574, 0.33444533683359623, -0.021039989731028018, -0.287584715511869, 0.19660279357203228, -0.07443232251988614, -0.11267180894501508, 0.09646064312854673, 0.1856615823748357, 0.13691441793104306, -0.14182093100731863, 0.10052663033198127, 0.0010443168884033665, 0.11248664657640106, 0.047678988240659234, 0.011285602569799214, 0.0612386621425257, 0.15174828417160932, 0.11391312034033677, 0.13696073818376617, -0.05246992881738526, -0.1056596521726426, -0.38886828825754277, -0.14324525881777792, -0.17922576141872387, 0.009172951441039058, -0.16545324812485726, -0.18204277123680668, 0.3604714933454114, 0.15925581221852234, 0.09167211288175381, 0.1251811746179181, 0.2762053157750736, 0.16525987710903042, -0.08088077556561021, 0.10502921439816847, 0.1858836319297552, 0.16903583157862373, 0.09659794091849642, -0.2711964688373401, 0.043168099454658874, 0.13879862047512742] |
1,803.09233 | On modules with self Tor vanishing | The long-standing Auslander and Reiten Conjecture states that a finitely
generated module over a finite-dimensional algebra is projective if certain
Ext-groups vanish. Several authors, including Avramov, Buchweitz, Iyengar,
Jorgensen, Nasseh, Sather-Wagstaff, and \c{S}ega, have studied a possible
counterpart of the conjecture, or question, for commutative rings in terms of
vanishing of Tor. This has led to the notion of Tor-persistent rings. Our main
result shows that the class of Tor-persistent local rings is closed under a
number of standard procedures in ring theory.
| math.AC | the longstanding auslander and reiten conjecture states that a finitely generated module over a finitedimensional algebra is projective if certain extgroups vanish several authors including avramov buchweitz iyengar jorgensen nasseh satherwagstaff and csega have studied a possible counterpart of the conjecture or question for commutative rings in terms of vanishing of tor this has led to the notion of torpersistent rings our main result shows that the class of torpersistent local rings is closed under a number of standard procedures in ring theory | [['the', 'longstanding', 'auslander', 'and', 'reiten', 'conjecture', 'states', 'that', 'a', 'finitely', 'generated', 'module', 'over', 'a', 'finitedimensional', 'algebra', 'is', 'projective', 'if', 'certain', 'extgroups', 'vanish', 'several', 'authors', 'including', 'avramov', 'buchweitz', 'iyengar', 'jorgensen', 'nasseh', 'satherwagstaff', 'and', 'csega', 'have', 'studied', 'a', 'possible', 'counterpart', 'of', 'the', 'conjecture', 'or', 'question', 'for', 'commutative', 'rings', 'in', 'terms', 'of', 'vanishing', 'of', 'tor', 'this', 'has', 'led', 'to', 'the', 'notion', 'of', 'torpersistent', 'rings', 'our', 'main', 'result', 'shows', 'that', 'the', 'class', 'of', 'torpersistent', 'local', 'rings', 'is', 'closed', 'under', 'a', 'number', 'of', 'standard', 'procedures', 'in', 'ring', 'theory']] | [-0.20618128857458942, 0.022930063132662326, -0.09554584973957389, 0.058955132921983025, -0.04972774019697681, -0.16777144444640726, -0.04780718269903446, 0.2984141361434013, -0.3418513639597222, -0.18823551612440498, 0.09333425089134835, -0.19219968137913385, -0.13932610972842668, 0.23407630101719407, -0.1888781400048174, -0.010482184095599223, 0.045873477970599194, 0.06707355030812323, -0.035902400170016335, -0.3822606444140547, 0.3885728315508459, 0.02315872084000148, 0.23212696767877788, 0.1103809660904517, 0.08827374315587803, 0.025126852365565354, -0.039414219921309265, 0.03997303618816659, -0.16023157224499301, 0.10585870091672404, 0.308631358272396, 0.10290706861997023, 0.26157745539676397, -0.35409311109688135, -0.1306015268608462, 0.20043290953617543, 0.09036089326255023, 0.044618470605928454, -0.0377296984748682, -0.2783212900627404, 0.18176004709675908, -0.277243879227899, -0.16464024173328654, -0.04020032393746078, 0.12346111682709307, -0.006283074239036068, -0.21863017284777014, 0.017845883934933228, 0.1751127426919993, 0.15570996028836817, -0.04860121977399103, -0.0542718049720861, -0.037279067758936434, 0.03858587254944723, 0.001549080846598372, -0.006522736260376405, 0.0910629297606647, -0.0768128522176994, -0.19655080868396907, 0.2898119997931644, -0.031753749691415575, -0.1434611563832732, 0.16497162472223864, -0.167758965754183, -0.14839122768025845, 0.12326798129361123, -0.025548491958761587, 0.15482576522626915, -0.02590823910140898, 0.23864012107806049, -0.24971577082760632, 0.02651709788478911, 0.16791011346504092, 0.038635419576894495, 0.15689099520968738, 0.05726092593977228, 0.04831778054103779, 0.13944290464860387, 0.04044472838577349, -0.03935196975435247, -0.2967082203598693, -0.20577567126601934, -0.09731402707111556, 0.1586544038262218, -0.01818855396086292, -0.16352176305372268, 0.4184673183364794, 0.10535569729108829, 0.1482693889294751, 0.09878756330581381, 0.20194524987600743, 0.010195325915992726, 0.09536450232262723, 0.028218521769849757, 0.14954085916979237, 0.29818417119095103, -0.004547752505459357, -0.10691655583214014, 0.0019739229057449846, 0.2045383738586679] |
1,803.09234 | Tetrads in solids: from elasticity theory to topological quantum Hall
systems and Weyl fermions | Theory of elasticity in topological insulators has many common features with
relativistic quantum fields interacting with gravitational field in the tetrad
form. Here we discuss several issues in the effective topological
(pseudo)electromagnetic response in three-dimensional weak crystalline
topological insulators with no time-reversal symmetry that feature elasticity
tetrads, including a mixed "axial-gravitational" anomaly. This response has
some resemblance to "quasitopological" terms proposed for massless Weyl
quasiparticles with separate, emergent fermion tetrads. As an example, we
discuss the chiral/axial anomaly in superfluid 3He-A. We demonstrate the
principal difference between the elasticity tetrads and the Weyl fermion
tetrads in the construction of the topological terms in the action. In
particular, the topological action expressed in terms of the elasticity
tetrads, cannot be expressed in terms of the Weyl fermion tetrads since in this
case the gauge invariance is lost.
| cond-mat.str-el gr-qc hep-ph | theory of elasticity in topological insulators has many common features with relativistic quantum fields interacting with gravitational field in the tetrad form here we discuss several issues in the effective topological pseudoelectromagnetic response in threedimensional weak crystalline topological insulators with no timereversal symmetry that feature elasticity tetrads including a mixed axialgravitational anomaly this response has some resemblance to quasitopological terms proposed for massless weyl quasiparticles with separate emergent fermion tetrads as an example we discuss the chiralaxial anomaly in superfluid 3hea we demonstrate the principal difference between the elasticity tetrads and the weyl fermion tetrads in the construction of the topological terms in the action in particular the topological action expressed in terms of the elasticity tetrads cannot be expressed in terms of the weyl fermion tetrads since in this case the gauge invariance is lost | [['theory', 'of', 'elasticity', 'in', 'topological', 'insulators', 'has', 'many', 'common', 'features', 'with', 'relativistic', 'quantum', 'fields', 'interacting', 'with', 'gravitational', 'field', 'in', 'the', 'tetrad', 'form', 'here', 'we', 'discuss', 'several', 'issues', 'in', 'the', 'effective', 'topological', 'pseudoelectromagnetic', 'response', 'in', 'threedimensional', 'weak', 'crystalline', 'topological', 'insulators', 'with', 'no', 'timereversal', 'symmetry', 'that', 'feature', 'elasticity', 'tetrads', 'including', 'a', 'mixed', 'axialgravitational', 'anomaly', 'this', 'response', 'has', 'some', 'resemblance', 'to', 'quasitopological', 'terms', 'proposed', 'for', 'massless', 'weyl', 'quasiparticles', 'with', 'separate', 'emergent', 'fermion', 'tetrads', 'as', 'an', 'example', 'we', 'discuss', 'the', 'chiralaxial', 'anomaly', 'in', 'superfluid', '3hea', 'we', 'demonstrate', 'the', 'principal', 'difference', 'between', 'the', 'elasticity', 'tetrads', 'and', 'the', 'weyl', 'fermion', 'tetrads', 'in', 'the', 'construction', 'of', 'the', 'topological', 'terms', 'in', 'the', 'action', 'in', 'particular', 'the', 'topological', 'action', 'expressed', 'in', 'terms', 'of', 'the', 'elasticity', 'tetrads', 'can', 'not', 'be', 'expressed', 'in', 'terms', 'of', 'the', 'weyl', 'fermion', 'tetrads', 'since', 'in', 'this', 'case', 'the', 'gauge', 'invariance', 'is', 'lost']] | [-0.24241683315417237, 0.22945591920795458, -0.05553660215039546, 0.034999071442357754, -0.11030188312425333, -0.13352538432638325, -0.046990802017663716, 0.3141323443748714, -0.23510014477377647, -0.2449161288985873, 0.0014529632659533115, -0.28748253463110063, -0.2261266328414957, 0.06475274814703666, -0.05665475492851863, 0.044370348779279194, -0.07111948041539803, 0.07547840431524332, -0.18204296880696133, -0.24205534367715967, 0.33993776445277035, -0.03277355237257913, 0.3299489438170841, 0.035469736154054236, 0.07655860147411551, -0.009386069042032914, 0.04058520994080669, 0.048891142955707276, -0.054187006709392284, 0.0688801581341335, 0.30597093480515897, -0.048158133633585426, 0.15409149932127228, -0.45072215143591166, -0.25157693632589895, 0.0625305484607131, 0.11848144748193376, 0.1326145745560472, -0.083045654303586, -0.3480650791675811, 0.028320052910952225, -0.1906835820614908, -0.14182886395086397, -0.15220903043689973, -0.017164664383231224, -0.09350448999868925, -0.16253813495859504, 0.10079610461659338, 0.045474345348124834, 0.11480667825569124, -0.10090706352596446, -0.052940959605621174, -0.05987923962803667, 0.05944495111608001, 0.154221707230831, -0.0008974887040334151, 0.055483737283365746, -0.19860908940352281, -0.14793689321616993, 0.4681790780467803, -0.10716023021214983, -0.27375437458634705, 0.1708887907957165, -0.13153649076668764, -0.1573517843601568, 0.06375972297631533, 0.09679248854552176, 0.08238235028693452, -0.1257480233702261, 0.17866374921996955, -0.08135851790361545, 0.0774788722902646, 0.055274540133883845, 0.1241242679697119, 0.29309976633008133, 0.0746532684429172, 0.02941011903792113, 0.15290795821227435, -0.01990410472910084, -0.09793103986200602, -0.4048985656306339, -0.25430111817331635, -0.21405022191089196, 0.02572227843452043, -0.09424556627078239, -0.21282913923085503, 0.4361155761238051, 0.15315595356857076, 0.10808159848603041, -0.043277780383291165, 0.19340086366933332, 0.10873365713290267, 0.11134040359791149, 0.049630142905858946, 0.2809142792087668, 0.18185934175134583, 0.08639669419704553, -0.2759585372028489, -0.04111876921139329, 0.14552089897230924] |
1,803.09235 | An improved Popoviciu-type inequality for a new Bernstein-type operator | Recently we introduced a new Bernstein-type operator using P\'olya's urn
model with negative replacement, and we showed that it satisfies a
Popoviciu-type inequality with a constant slightly larger than that of the
corresponding inequality for the classical Bernstein operator.
In the present paper we prove an inequality for the rising factorial (of
independent interest), and we use it in order to show that the constant in the
Popoviciu inequality for the new operator is in fact smaller than the
corresponding constant for the Bernstein operator.
| math.CA | recently we introduced a new bernsteintype operator using polyas urn model with negative replacement and we showed that it satisfies a popoviciutype inequality with a constant slightly larger than that of the corresponding inequality for the classical bernstein operator in the present paper we prove an inequality for the rising factorial of independent interest and we use it in order to show that the constant in the popoviciu inequality for the new operator is in fact smaller than the corresponding constant for the bernstein operator | [['recently', 'we', 'introduced', 'a', 'new', 'bernsteintype', 'operator', 'using', 'polyas', 'urn', 'model', 'with', 'negative', 'replacement', 'and', 'we', 'showed', 'that', 'it', 'satisfies', 'a', 'popoviciutype', 'inequality', 'with', 'a', 'constant', 'slightly', 'larger', 'than', 'that', 'of', 'the', 'corresponding', 'inequality', 'for', 'the', 'classical', 'bernstein', 'operator', 'in', 'the', 'present', 'paper', 'we', 'prove', 'an', 'inequality', 'for', 'the', 'rising', 'factorial', 'of', 'independent', 'interest', 'and', 'we', 'use', 'it', 'in', 'order', 'to', 'show', 'that', 'the', 'constant', 'in', 'the', 'popoviciu', 'inequality', 'for', 'the', 'new', 'operator', 'is', 'in', 'fact', 'smaller', 'than', 'the', 'corresponding', 'constant', 'for', 'the', 'bernstein', 'operator']] | [-0.03683199681663176, 0.11028990642201582, -0.07546303669611613, 0.08192681127166863, -0.0706927160222438, -0.17767268725826094, 0.02848993610851245, 0.3156994731647761, -0.26624199872215587, -0.23329741146326774, 0.11124437660605292, -0.2912983317815122, -0.1650739045636285, 0.23071953960018055, -0.10273498295628954, 0.045931016316726095, 0.0262924198648848, 0.0652546002307818, -0.06217579155816652, -0.23125632299620302, 0.3525382929947227, 0.01640685923796679, 0.2278569543933762, 0.06685356105056901, 0.11748712345780361, 0.02467849348960001, 0.0004641723646186403, 0.019086623912222593, -0.17756890076504664, 0.17584447050467134, 0.15103431757805602, 0.13317243315317942, 0.3105638502609162, -0.3744057291630833, -0.15578130844265356, 0.17048486579386962, 0.120485206018202, 0.06054448793708746, -0.08127600525871717, -0.23737669481419116, 0.09316847361402497, -0.17223740014291944, -0.17824845624688482, -0.04712902129228626, 0.031594120032553165, 0.0020366174479325614, -0.3407697523722336, 0.12739322213677778, 0.11974892744217955, 0.015999557239757406, -0.06748303452262744, -0.14443374948487395, 0.047439687829908164, 0.014478292898274958, 0.03888107119599313, 0.05141826109805455, 0.012875125100392671, -0.05639094693608405, -0.10677541036247498, 0.30148779606402276, -0.10422556643087384, -0.22010572423182784, 0.08386208775586315, -0.1842440488981083, -0.16649483383211883, 0.02147120436919587, 0.11112801941289079, 0.1370636921686431, -0.09188869366023157, 0.09582918604497709, -0.09965429408475757, 0.1224849344275537, 0.10098445623935688, 0.015242186291808528, 0.028434691732400097, 0.07626305926325065, 0.17713610596062304, 0.19338902927397394, -0.00019702357461764698, -0.11116420142796068, -0.34010472181918366, -0.23154738419578366, -0.20882038605798567, 0.07268307183957881, -0.16115697967740875, -0.16075717278623156, 0.34658215860170977, 0.12941119832283307, 0.18842059611121104, 0.11491647750760119, 0.21497517628207183, 0.19796203881768243, 0.09881515974744357, 0.08891406421372224, 0.22853605459178133, 0.15565436444289626, 0.12035150355881169, -0.1411900373059325, 0.06368646699757803, 0.1380267518550335] |
1,803.09236 | A mathematical justification of the Isobe-Kakinuma model for water waves
with and without bottom topography | We consider the Isobe-Kakinuma model for water waves in both cases of the
flat and the variable bottoms. The Isobe-Kakinuma model is a system of
Euler-Lagrange equations for an approximate Lagrangian which is derived from
Luke's Lagrangian for water waves by approximating the velocity potential in
the Lagrangian appropriately. The Isobe-Kakinuma model consists of $(N+1)$
second order and a first order partial differential equations, where $N$ is a
nonnegative integer. We justify rigorously the Isobe-Kakinuma model as a higher
order shallow water approximation in the strongly nonlinear regime by giving an
error estimate between the solutions of the Isobe-Kakinuma model and of the
full water wave problem in terms of the small nondimensional parameter
$\delta$, which is the ratio of the mean depth to the typical wavelength. It
turns out that the error is of order $O(\delta^{4N+2})$ in the case of the flat
bottom and of order $O(\delta^{4[N/2]+2})$ in the case of variable bottoms.
| math.AP | we consider the isobekakinuma model for water waves in both cases of the flat and the variable bottoms the isobekakinuma model is a system of eulerlagrange equations for an approximate lagrangian which is derived from lukes lagrangian for water waves by approximating the velocity potential in the lagrangian appropriately the isobekakinuma model consists of n1 second order and a first order partial differential equations where n is a nonnegative integer we justify rigorously the isobekakinuma model as a higher order shallow water approximation in the strongly nonlinear regime by giving an error estimate between the solutions of the isobekakinuma model and of the full water wave problem in terms of the small nondimensional parameter delta which is the ratio of the mean depth to the typical wavelength it turns out that the error is of order odelta4n2 in the case of the flat bottom and of order odelta4n22 in the case of variable bottoms | [['we', 'consider', 'the', 'isobekakinuma', 'model', 'for', 'water', 'waves', 'in', 'both', 'cases', 'of', 'the', 'flat', 'and', 'the', 'variable', 'bottoms', 'the', 'isobekakinuma', 'model', 'is', 'a', 'system', 'of', 'eulerlagrange', 'equations', 'for', 'an', 'approximate', 'lagrangian', 'which', 'is', 'derived', 'from', 'lukes', 'lagrangian', 'for', 'water', 'waves', 'by', 'approximating', 'the', 'velocity', 'potential', 'in', 'the', 'lagrangian', 'appropriately', 'the', 'isobekakinuma', 'model', 'consists', 'of', 'n1', 'second', 'order', 'and', 'a', 'first', 'order', 'partial', 'differential', 'equations', 'where', 'n', 'is', 'a', 'nonnegative', 'integer', 'we', 'justify', 'rigorously', 'the', 'isobekakinuma', 'model', 'as', 'a', 'higher', 'order', 'shallow', 'water', 'approximation', 'in', 'the', 'strongly', 'nonlinear', 'regime', 'by', 'giving', 'an', 'error', 'estimate', 'between', 'the', 'solutions', 'of', 'the', 'isobekakinuma', 'model', 'and', 'of', 'the', 'full', 'water', 'wave', 'problem', 'in', 'terms', 'of', 'the', 'small', 'nondimensional', 'parameter', 'delta', 'which', 'is', 'the', 'ratio', 'of', 'the', 'mean', 'depth', 'to', 'the', 'typical', 'wavelength', 'it', 'turns', 'out', 'that', 'the', 'error', 'is', 'of', 'order', 'odelta4n2', 'in', 'the', 'case', 'of', 'the', 'flat', 'bottom', 'and', 'of', 'order', 'odelta4n22', 'in', 'the', 'case', 'of', 'variable', 'bottoms']] | [-0.1394315791732975, 0.08188259077896394, -0.02789777718288334, 0.05782197838523548, -0.028129723226332937, -0.09552236939290244, 0.003296795028482417, 0.26716286443345444, -0.2673818515782171, -0.28404589818857956, 0.11010836185060295, -0.2822790603294331, -0.1325250060736404, 0.13265117734983123, 0.00032881965346046185, 0.08281077459258468, -0.0028783722924632265, 0.055793353802169134, -0.05319940530554097, -0.21213729057298655, 0.3267549209137398, 0.014927682577093182, 0.20139172957523874, 0.036704779997020716, 0.1475409961115618, -0.02088863879754698, 0.01160521706946096, 0.026373103006036264, -0.14603203554097968, 0.08697694454627038, 0.21761480172924502, 0.020345159411111747, 0.2611027205497713, -0.4011331026987663, -0.21883225557394326, 0.08398915554464206, 0.1151638038986436, 0.11777100886377555, 0.03805678040340641, -0.2558889078760618, 0.0708850765046296, -0.12854633361099618, -0.18011680234370656, -0.0015271073084716733, 0.029208349906471802, 0.03948224183037191, -0.3044560565368125, 0.11534857790837505, 0.07084067232637226, -0.005421211874100233, -0.08833050431827646, -0.1029780433799667, -0.07133853148154326, 0.0765846936479456, 0.053356132656948545, 0.02709655232760461, 0.031333558322665725, -0.15974047360941768, -0.00810881777464314, 0.42484539287091283, -0.13632288943029525, -0.2733203208956279, 0.10994681884767488, -0.1240366698199834, -0.06012958198124053, 0.16497932203530677, 0.18145523004625974, 0.16837678865014918, -0.136146658161459, 0.11004426192161382, -0.06521590986573612, 0.17589859797398708, 0.06588598578482081, -0.03755018576109586, 0.15886335184883424, 0.1662686777417548, 0.0987159575199353, 0.132795454713663, -0.11351379242382552, -0.12245210217875674, -0.3529719211234662, -0.17163127009438253, -0.14507742837534016, 0.002724736837320195, -0.12238998486454396, -0.1584474182301691, 0.39882491082933386, 0.11337690183427185, 0.15598343292520822, 0.08799206976025169, 0.2775492515341428, 0.19673075350415034, 0.0007143741975979585, 0.06326371701097262, 0.2665388477111456, 0.14269893742350273, 0.09210011209238712, -0.22113685621393656, 0.034460681818401145, 0.11952953232685104] |
1,803.09237 | Goldbach's Function Approximation Using Deep Learning | Goldbach conjecture is one of the most famous open mathematical problems. It
states that every even number, bigger than two, can be presented as a sum of 2
prime numbers. % In this work we present a deep learning based model that
predicts the number of Goldbach partitions for a given even number.
Surprisingly, our model outperforms all state-of-the-art analytically derived
estimations for the number of couples, while not requiring prime factorization
of the given number. We believe that building a model that can accurately
predict the number of couples brings us one step closer to solving one of the
world most famous open problems. To the best of our knowledge, this is the
first attempt to consider machine learning based data-driven methods to
approximate open mathematical problems in the field of number theory, and hope
that this work will encourage such attempts.
| cs.LG stat.ML | goldbach conjecture is one of the most famous open mathematical problems it states that every even number bigger than two can be presented as a sum of 2 prime numbers in this work we present a deep learning based model that predicts the number of goldbach partitions for a given even number surprisingly our model outperforms all stateoftheart analytically derived estimations for the number of couples while not requiring prime factorization of the given number we believe that building a model that can accurately predict the number of couples brings us one step closer to solving one of the world most famous open problems to the best of our knowledge this is the first attempt to consider machine learning based datadriven methods to approximate open mathematical problems in the field of number theory and hope that this work will encourage such attempts | [['goldbach', 'conjecture', 'is', 'one', 'of', 'the', 'most', 'famous', 'open', 'mathematical', 'problems', 'it', 'states', 'that', 'every', 'even', 'number', 'bigger', 'than', 'two', 'can', 'be', 'presented', 'as', 'a', 'sum', 'of', '2', 'prime', 'numbers', 'in', 'this', 'work', 'we', 'present', 'a', 'deep', 'learning', 'based', 'model', 'that', 'predicts', 'the', 'number', 'of', 'goldbach', 'partitions', 'for', 'a', 'given', 'even', 'number', 'surprisingly', 'our', 'model', 'outperforms', 'all', 'stateoftheart', 'analytically', 'derived', 'estimations', 'for', 'the', 'number', 'of', 'couples', 'while', 'not', 'requiring', 'prime', 'factorization', 'of', 'the', 'given', 'number', 'we', 'believe', 'that', 'building', 'a', 'model', 'that', 'can', 'accurately', 'predict', 'the', 'number', 'of', 'couples', 'brings', 'us', 'one', 'step', 'closer', 'to', 'solving', 'one', 'of', 'the', 'world', 'most', 'famous', 'open', 'problems', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'attempt', 'to', 'consider', 'machine', 'learning', 'based', 'datadriven', 'methods', 'to', 'approximate', 'open', 'mathematical', 'problems', 'in', 'the', 'field', 'of', 'number', 'theory', 'and', 'hope', 'that', 'this', 'work', 'will', 'encourage', 'such', 'attempts']] | [-0.09972465419682713, 0.05822715744159748, -0.09531977228348104, 0.07940491688565653, -0.13258168938804196, -0.16676880184456078, 0.031457924927604505, 0.29135710328266445, -0.26216350841617975, -0.3584915427031966, 0.06980531045701355, -0.26410399177390426, -0.17229714361183399, 0.2363289003211244, -0.07711397303255196, 0.05163167584785851, 0.08486978389637571, 0.07538470269744875, -0.00502660874651194, -0.31623778596002294, 0.3190426251696895, -0.013510255177684036, 0.24188797410682472, 0.05080345394844058, 0.0695381965225851, 0.010505948376408974, 0.003077068174270992, 0.039356836567068815, -0.08026123208262913, 0.1852061820989573, 0.30330514745183396, 0.1966101157111706, 0.34611088609565577, -0.4238369770462438, -0.1927745607632383, 0.1398844486266427, 0.16742580186601885, 0.13208931045521471, -0.029566252695947464, -0.19368357088049531, 0.11045400648907444, -0.14893274976458715, -0.1434111096765059, -0.07584712813070542, 0.0024074325477376475, -0.02236698407714229, -0.2643166896657572, 0.0064802636034970345, 0.061196445828487336, 0.0034865381845443602, -0.027811986002349624, -0.17535180440352915, 0.06100844376733605, 0.14507849345928137, 0.05278958667907024, 0.05985812683184762, 0.06080317785463322, -0.14949949630241002, -0.1554319651036615, 0.38204588262285566, -0.02908461164360502, -0.20341860912051576, 0.16918189154813248, -0.10449939806171706, -0.2042659063574294, 0.09907104045933139, 0.15044077955396243, 0.12831356299017938, -0.09832780635718938, 0.04265376595201456, -0.1339144977006379, 0.17853109557657096, 0.05426820222280992, -0.02360236212532495, 0.18096117576269408, 0.20591750632787884, 0.04695168962623452, 0.12755121500477273, -0.05074323353383847, -0.0867054117351613, -0.27918103217265344, -0.15456356662063217, -0.21807703530025654, 0.0432528694781096, -0.057255391864344626, -0.15241917430646193, 0.392543639082619, 0.24864470114616652, 0.18529620858788176, 0.10542896975153192, 0.29321395933569055, 0.06793755224764898, 0.061481367829452516, 0.11350884967365525, 0.20397471841982184, 0.10489246962775647, 0.04267326469080601, -0.16092657679232808, 0.05574587235082938, 0.07344672042207503] |
1,803.09238 | Hydrogen energy-levels shifts induced by the atom motion. Crossover from
the Lamb shifts to the motion-induced shifts | When the hydrogen atom moves, the proton current generates a magnetic field
which interacts with the hydrogen electron. A simple analyze shows that this
interaction between the hydrogen momentum and the electron is of order of
$\alpha^3\frac{v}{c}m$, where $\alpha$ is the fine structure constant, $v$ is
the atom velocity, $c$ is the speed of light, and $m$ is the electron mass.
Using the Bethe-Salpeter equation, the two velocity-dependent operators of this
order are derived for the hydrogen velocity $\frac{v}{c}<<\alpha$. As well
known, the degeneracy of the energy levels with the same principal quantum
number, $n$, and the same quantum number of the total angular momentum, $j$,
but the different orbital angular momenta $l=j\pm 1/2$ is removed by the
radiative corrections (the Lamb shift) that are proportional to $\alpha^{5}m$.
It is shown that the velocity-dependent perturbation interactions remove this
degeneracy as well. There is, however, an important difference between the Lamb
shifts and the energy-levels shifts induced by the atom motion. The Lamb shift
is the diagonal correction to the energy separately for each of the degenerate
states. The the velocity-dependent perturbation interactions result in the
off-diagonal energy corrections between the mutually degenerate states. The
joint effect of these two perturbations which are essentially different in
their origin, is analyzed. Given their order of magnitude, the crossover from
the Lamb shifts to the motion-induced shifts should occur at the atom velocity
$v=k\alpha^2 c$, where $k>>1$ is a numerical factor depended on $n$ and $j$. An
experiment used the orbital motion of the Earth, is proposed to test the theory
developed.
| physics.atom-ph quant-ph | when the hydrogen atom moves the proton current generates a magnetic field which interacts with the hydrogen electron a simple analyze shows that this interaction between the hydrogen momentum and the electron is of order of alpha3fracvcm where alpha is the fine structure constant v is the atom velocity c is the speed of light and m is the electron mass using the bethesalpeter equation the two velocitydependent operators of this order are derived for the hydrogen velocity fracvcalpha as well known the degeneracy of the energy levels with the same principal quantum number n and the same quantum number of the total angular momentum j but the different orbital angular momenta ljpm 12 is removed by the radiative corrections the lamb shift that are proportional to alpha5m it is shown that the velocitydependent perturbation interactions remove this degeneracy as well there is however an important difference between the lamb shifts and the energylevels shifts induced by the atom motion the lamb shift is the diagonal correction to the energy separately for each of the degenerate states the the velocitydependent perturbation interactions result in the offdiagonal energy corrections between the mutually degenerate states the joint effect of these two perturbations which are essentially different in their origin is analyzed given their order of magnitude the crossover from the lamb shifts to the motioninduced shifts should occur at the atom velocity vkalpha2 c where k1 is a numerical factor depended on n and j an experiment used the orbital motion of the earth is proposed to test the theory developed | [['when', 'the', 'hydrogen', 'atom', 'moves', 'the', 'proton', 'current', 'generates', 'a', 'magnetic', 'field', 'which', 'interacts', 'with', 'the', 'hydrogen', 'electron', 'a', 'simple', 'analyze', 'shows', 'that', 'this', 'interaction', 'between', 'the', 'hydrogen', 'momentum', 'and', 'the', 'electron', 'is', 'of', 'order', 'of', 'alpha3fracvcm', 'where', 'alpha', 'is', 'the', 'fine', 'structure', 'constant', 'v', 'is', 'the', 'atom', 'velocity', 'c', 'is', 'the', 'speed', 'of', 'light', 'and', 'm', 'is', 'the', 'electron', 'mass', 'using', 'the', 'bethesalpeter', 'equation', 'the', 'two', 'velocitydependent', 'operators', 'of', 'this', 'order', 'are', 'derived', 'for', 'the', 'hydrogen', 'velocity', 'fracvcalpha', 'as', 'well', 'known', 'the', 'degeneracy', 'of', 'the', 'energy', 'levels', 'with', 'the', 'same', 'principal', 'quantum', 'number', 'n', 'and', 'the', 'same', 'quantum', 'number', 'of', 'the', 'total', 'angular', 'momentum', 'j', 'but', 'the', 'different', 'orbital', 'angular', 'momenta', 'ljpm', '12', 'is', 'removed', 'by', 'the', 'radiative', 'corrections', 'the', 'lamb', 'shift', 'that', 'are', 'proportional', 'to', 'alpha5m', 'it', 'is', 'shown', 'that', 'the', 'velocitydependent', 'perturbation', 'interactions', 'remove', 'this', 'degeneracy', 'as', 'well', 'there', 'is', 'however', 'an', 'important', 'difference', 'between', 'the', 'lamb', 'shifts', 'and', 'the', 'energylevels', 'shifts', 'induced', 'by', 'the', 'atom', 'motion', 'the', 'lamb', 'shift', 'is', 'the', 'diagonal', 'correction', 'to', 'the', 'energy', 'separately', 'for', 'each', 'of', 'the', 'degenerate', 'states', 'the', 'the', 'velocitydependent', 'perturbation', 'interactions', 'result', 'in', 'the', 'offdiagonal', 'energy', 'corrections', 'between', 'the', 'mutually', 'degenerate', 'states', 'the', 'joint', 'effect', 'of', 'these', 'two', 'perturbations', 'which', 'are', 'essentially', 'different', 'in', 'their', 'origin', 'is', 'analyzed', 'given', 'their', 'order', 'of', 'magnitude', 'the', 'crossover', 'from', 'the', 'lamb', 'shifts', 'to', 'the', 'motioninduced', 'shifts', 'should', 'occur', 'at', 'the', 'atom', 'velocity', 'vkalpha2', 'c', 'where', 'k1', 'is', 'a', 'numerical', 'factor', 'depended', 'on', 'n', 'and', 'j', 'an', 'experiment', 'used', 'the', 'orbital', 'motion', 'of', 'the', 'earth', 'is', 'proposed', 'to', 'test', 'the', 'theory', 'developed']] | [-0.15018497908893078, 0.22284650774115758, -0.023873393655310965, 0.05949831482409829, -0.022556081025904288, -0.09680524398458161, 0.017284976329020128, 0.33776722507419316, -0.2753619924297659, -0.3049255844176285, 0.004973588873426921, -0.3200521354424202, -0.05750432893758508, 0.13698470586907177, 0.03902275502538734, 0.017665564430892233, 0.023218004233717157, 0.06798191723692429, -0.0654805955929887, -0.18950665005809061, 0.3465868603515138, 0.07762867331002495, 0.23610058494987457, 0.07970668996434922, 0.08847647532729036, -0.005129691921944518, -0.010010536229347913, -0.0070302424893721824, -0.10637235544127752, 0.09385210422085832, 0.1861720570966608, 0.023653406501329674, 0.22777451283122435, -0.3772704586548012, -0.16908983944907902, 0.07605036851852824, 0.11200650259815743, 0.16406606382866368, -0.019998221959291743, -0.26574142797534744, -0.017460952006925747, -0.162499473023221, -0.14734538193924104, -0.03920331223699169, 0.08408332775084772, 0.03133664100099076, -0.26341502187250176, 0.09111355227055248, 0.052865304918153076, 0.005214059564988972, -0.06417167494275175, -0.13016955940947522, -0.07893174143662075, 0.13158697171989686, 0.053371186897077955, 0.04496852298428517, 0.13634634024246348, -0.08038847367040901, -0.0627475269578808, 0.4358339504463466, -0.09221903858183861, -0.18358241297729957, 0.1370425651117602, -0.17091591257554312, -0.05638347306164113, 0.14769626379115727, 0.09092995192072773, 0.0880175914787724, -0.09706302954019899, 0.09986314047416708, 0.0032003766923086848, 0.17380065379268306, 0.0912783694092375, 0.026959511568755146, 0.18386275087681225, 0.08168481342314823, 0.06740850180856825, 0.06760457245171012, -0.14121195228906042, -0.08418429666290456, -0.29407865458762084, -0.13306625096098057, -0.20280682878645767, 0.045987834305113814, -0.060579424445032906, -0.13888508704430003, 0.3779747367242542, 0.10568295416649519, 0.22443669088419496, -0.02690542161035696, 0.32905706752634306, 0.1838484240125674, 0.060298035729779154, 0.060760570360956286, 0.2899819385905669, 0.17189191866438747, 0.0789192486435219, -0.3354296445742059, 0.04017856262081603, 0.053837642315628494] |
1,803.09239 | What is a true spectra of a finite Fourier transform | In this paper we deal with a finite abelian group $G$ and the abstract
Fourier transform ${\mathcal F}:{\mathbb C}^G\to {\mathbb C}^\hat{G}$. Then, we
consider $\tilde{j}\circ {\mathcal F}:{\mathbb C}^G\to {\mathbb C}^\hat{G}$
where $\tilde j:{\mathbb C}^\hat{G}\to {\mathbb C}^G$ is defined by the
composition with a bijection $j:G\to \hat{G}$. ($\tilde j$ is a pullback of
$j$.)
In particular, we show that $(\tilde{j}\circ {\mathcal F})^2$ is a
permutation if and only if $j$ is a group isomorphism. Then, we study how the
spectra of $\tilde{j}\circ{\mathcal F}$ depends on the isomorphism $j$.
| math.GR math.RT | in this paper we deal with a finite abelian group g and the abstract fourier transform mathcal fmathbb cgto mathbb chatg then we consider tildejcirc mathcal fmathbb cgto mathbb chatg where tilde jmathbb chatgto mathbb cg is defined by the composition with a bijection jgto hatg tilde j is a pullback of j in particular we show that tildejcirc mathcal f2 is a permutation if and only if j is a group isomorphism then we study how the spectra of tildejcircmathcal f depends on the isomorphism j | [['in', 'this', 'paper', 'we', 'deal', 'with', 'a', 'finite', 'abelian', 'group', 'g', 'and', 'the', 'abstract', 'fourier', 'transform', 'mathcal', 'fmathbb', 'cgto', 'mathbb', 'chatg', 'then', 'we', 'consider', 'tildejcirc', 'mathcal', 'fmathbb', 'cgto', 'mathbb', 'chatg', 'where', 'tilde', 'jmathbb', 'chatgto', 'mathbb', 'cg', 'is', 'defined', 'by', 'the', 'composition', 'with', 'a', 'bijection', 'jgto', 'hatg', 'tilde', 'j', 'is', 'a', 'pullback', 'of', 'j', 'in', 'particular', 'we', 'show', 'that', 'tildejcirc', 'mathcal', 'f2', 'is', 'a', 'permutation', 'if', 'and', 'only', 'if', 'j', 'is', 'a', 'group', 'isomorphism', 'then', 'we', 'study', 'how', 'the', 'spectra', 'of', 'tildejcircmathcal', 'f', 'depends', 'on', 'the', 'isomorphism', 'j']] | [-0.18324443467427046, 0.12541088230209424, -0.05503159972140566, -0.03754132776666665, -0.1082135571341496, -0.15240210277843289, -0.022329149056167806, 0.37347510498948394, -0.35178859981242566, -0.14224719199119135, 0.07074838110420387, -0.2808852919144556, -0.14323735341895372, 0.11585792558034883, -0.1389144245069474, -0.0716185320285149, -0.0031038244953379033, 0.10935122054506792, -0.10640793874044903, -0.2585064525628695, 0.34146195790963246, -0.1085023060120875, 0.1748657988573541, 0.03487089446280152, 0.09522218224592507, 0.015435164060909301, -0.022910515079274774, -0.02863772980053909, -0.2252106036908117, 0.0516423613182269, 0.26446219412609934, 0.0891323680698406, 0.2220230875071138, -0.3149140881374478, -0.0889526121551171, 0.2838231467583682, 0.15516552033368497, -0.12576631316915154, -0.01022773779259296, -0.25076277360785754, 0.11079429826058913, -0.15722264028154315, -0.056806945306016134, -0.06523264362913324, 0.20149373866152018, 0.028103771692258306, -0.361513191414997, -0.02080667103873566, 0.12110409026499838, 0.09186357285361738, 0.020470166869199603, -0.058771231217542665, -0.11783047064673155, 0.003098617057548836, -0.05718166257283883, 0.21981210203084628, 0.07718325912210275, -0.02612152310612146, -0.0433371594757773, 0.41061534637119623, -0.13848745208233595, -0.23731468846672216, 0.08561039242777042, -0.18824541548383422, -0.22364687698427588, 0.030956610629800707, 0.06042142700171098, 0.21284066026564688, -0.01211856799745874, 0.352830275472661, -0.19244421720504762, 0.11712161322357133, 0.05718959899386391, -0.06327189945732244, 0.03092237349774223, 0.06608253064914607, 0.07153396556386724, 0.13266246175335256, 0.010042147358763031, 0.04122384805232286, -0.3670902274549007, -0.18352803927846253, -0.17055107830092311, 0.17127067046239972, -0.05439610122666636, -0.10235082150320522, 0.3711575470864773, 0.0647667114622891, 0.21484260644065217, 0.1270624900702387, 0.18617786042013904, 0.0896054718294181, -0.004024313722038641, 0.13125165388919413, 0.05490097705333028, 0.19335329768073278, -0.08294821306481026, -0.18778464247589, -0.07246781173162162, 0.22727292833442334] |
1,803.0924 | Ultraflat bands and shear solitons in Moir\'e patterns of twisted
bilayer transition metal dichalcogenides | Ultraflat bands in twisted bilayers of two-dimensional materials have
potential to host strong correlations, including the Mott-insulating phase at
half-filling of the band. Using first principles density functional theory
calculations, we show the emergence of ultraflat bands at the valence band edge
in twisted bilayer MoS$_2$, a prototypical transition metal dichalcogenide. The
computed band widths, 5 meV and 23 meV for 56.5$^\circ$ and 3.5$^\circ$ twist
angles respectively, are comparable to that of twisted bilayer graphene near
'magic' angles. Large structural transformations in the Moir\'e patterns lead
to formation of shear solitons at stacking boundaries and strongly influence
the electronic structure. We extend our analysis for twisted bilayer MoS$_2$ to
show that flat bands can occur at the valence band edge of twisted bilayer
WS$_2$, MoSe$_2$ and WSe$_2$ as well.
| cond-mat.mtrl-sci | ultraflat bands in twisted bilayers of twodimensional materials have potential to host strong correlations including the mottinsulating phase at halffilling of the band using first principles density functional theory calculations we show the emergence of ultraflat bands at the valence band edge in twisted bilayer mos_2 a prototypical transition metal dichalcogenide the computed band widths 5 mev and 23 mev for 565circ and 35circ twist angles respectively are comparable to that of twisted bilayer graphene near magic angles large structural transformations in the moire patterns lead to formation of shear solitons at stacking boundaries and strongly influence the electronic structure we extend our analysis for twisted bilayer mos_2 to show that flat bands can occur at the valence band edge of twisted bilayer ws_2 mose_2 and wse_2 as well | [['ultraflat', 'bands', 'in', 'twisted', 'bilayers', 'of', 'twodimensional', 'materials', 'have', 'potential', 'to', 'host', 'strong', 'correlations', 'including', 'the', 'mottinsulating', 'phase', 'at', 'halffilling', 'of', 'the', 'band', 'using', 'first', 'principles', 'density', 'functional', 'theory', 'calculations', 'we', 'show', 'the', 'emergence', 'of', 'ultraflat', 'bands', 'at', 'the', 'valence', 'band', 'edge', 'in', 'twisted', 'bilayer', 'mos_2', 'a', 'prototypical', 'transition', 'metal', 'dichalcogenide', 'the', 'computed', 'band', 'widths', '5', 'mev', 'and', '23', 'mev', 'for', '565circ', 'and', '35circ', 'twist', 'angles', 'respectively', 'are', 'comparable', 'to', 'that', 'of', 'twisted', 'bilayer', 'graphene', 'near', 'magic', 'angles', 'large', 'structural', 'transformations', 'in', 'the', 'moire', 'patterns', 'lead', 'to', 'formation', 'of', 'shear', 'solitons', 'at', 'stacking', 'boundaries', 'and', 'strongly', 'influence', 'the', 'electronic', 'structure', 'we', 'extend', 'our', 'analysis', 'for', 'twisted', 'bilayer', 'mos_2', 'to', 'show', 'that', 'flat', 'bands', 'can', 'occur', 'at', 'the', 'valence', 'band', 'edge', 'of', 'twisted', 'bilayer', 'ws_2', 'mose_2', 'and', 'wse_2', 'as', 'well']] | [-0.1746898059027444, 0.19618314656963776, 0.006508399563244893, 0.06152509171079146, 0.018378781741830608, -0.14680258920270717, 0.11671519527135388, 0.5002210248931078, -0.26306056681823975, -0.29823231311729614, -0.04078123025010427, -0.320727759230067, -0.18402767033967393, 0.11380836972239194, 0.07950949871758439, 0.010601466106891166, 0.02515997824684746, -0.17739061677275458, -0.15579676026754896, -0.14176238683921838, 0.3017818426633312, -0.008894034688637475, 0.3284565648791613, 0.13418227720831055, -0.07343701731588226, 0.022870005792356096, 0.16548008417339588, -0.005476928934513126, -0.20087830744944313, 0.04904322503352887, 0.24952298775860982, -0.23974716707743937, 0.15611321409414813, -0.44456934538902715, -0.17972621311128023, -0.08052233087255445, 0.11424024609732442, 0.12040909227653174, -0.027481534343678504, -0.2894171862062649, 0.09507389073405648, -0.15729872550218715, -0.1334302443647175, -0.0550177980794615, -0.02454924566700356, -0.034779129273374565, -0.19699507704217467, 0.13679577754010097, -0.04606435886580584, 0.08862838436601805, -0.12856783719507803, -0.18803502561786445, -0.22584626385832962, 0.08502631539158756, 0.03324167086611851, 0.024159553824574687, 0.18214326526140212, -0.11617403690252104, -0.1269373921350052, 0.42361262867052574, -0.0516663039161358, -0.04290256700187456, 0.15648499458438891, -0.23295285094718565, -0.11628121420108073, 0.18071243186932406, 0.11706442769354908, 0.08177643052840722, -0.028501720502845274, 0.0459197231066355, -0.06221457586525503, 0.16637418287245964, 0.11043413367224275, 0.12326544400275452, 0.284398881438392, 0.1485289888587431, 0.053433563547514495, 0.12152937620703597, -0.17263786986586638, 0.0014348675504152197, -0.19481255645951023, -0.15702634652916458, -0.1930518341869174, 0.07659178901758423, -0.06758580440828155, -0.23539197621721542, 0.47268404085116345, 0.05269775191982262, 0.16241450764846377, -0.03908776313983253, 0.17243210117067065, 0.09447298662780668, 0.12030402195887291, 0.0239258314431936, 0.28860437910771, 0.16329470813980151, 0.07524790553725325, -0.20096369511156809, -0.049784560629632324, 0.015362642394393333] |
1,803.09241 | The axial symmetry of Kerr without the rigidity theorem | Local condition that imply the no-hair property of black holes are completed.
The conditions take the form of constraints on the geometry of the
2-dimensional crossover surface of black hole horizon. They imply also the
axial symmetry without the rigidity theorem. This is the new result contained
in this letter. The family of the solutions to our constraints is 2-dimensional
and can be parametrized by the area and angular momentum. The constraints are
induced by our assumption that the horizon is of the Petrov type D. Our result
applies to all the bifurcated Killing horizons: inner/outer black hole horizons
as well as cosmological horizons. Vacuum spacetimes with a given cosmological
constant can be reconstructed from our solutions via Racz's black hole
holograph.
| gr-qc hep-th | local condition that imply the nohair property of black holes are completed the conditions take the form of constraints on the geometry of the 2dimensional crossover surface of black hole horizon they imply also the axial symmetry without the rigidity theorem this is the new result contained in this letter the family of the solutions to our constraints is 2dimensional and can be parametrized by the area and angular momentum the constraints are induced by our assumption that the horizon is of the petrov type d our result applies to all the bifurcated killing horizons innerouter black hole horizons as well as cosmological horizons vacuum spacetimes with a given cosmological constant can be reconstructed from our solutions via raczs black hole holograph | [['local', 'condition', 'that', 'imply', 'the', 'nohair', 'property', 'of', 'black', 'holes', 'are', 'completed', 'the', 'conditions', 'take', 'the', 'form', 'of', 'constraints', 'on', 'the', 'geometry', 'of', 'the', '2dimensional', 'crossover', 'surface', 'of', 'black', 'hole', 'horizon', 'they', 'imply', 'also', 'the', 'axial', 'symmetry', 'without', 'the', 'rigidity', 'theorem', 'this', 'is', 'the', 'new', 'result', 'contained', 'in', 'this', 'letter', 'the', 'family', 'of', 'the', 'solutions', 'to', 'our', 'constraints', 'is', '2dimensional', 'and', 'can', 'be', 'parametrized', 'by', 'the', 'area', 'and', 'angular', 'momentum', 'the', 'constraints', 'are', 'induced', 'by', 'our', 'assumption', 'that', 'the', 'horizon', 'is', 'of', 'the', 'petrov', 'type', 'd', 'our', 'result', 'applies', 'to', 'all', 'the', 'bifurcated', 'killing', 'horizons', 'innerouter', 'black', 'hole', 'horizons', 'as', 'well', 'as', 'cosmological', 'horizons', 'vacuum', 'spacetimes', 'with', 'a', 'given', 'cosmological', 'constant', 'can', 'be', 'reconstructed', 'from', 'our', 'solutions', 'via', 'raczs', 'black', 'hole', 'holograph']] | [-0.1643275217160829, 0.0834352571944406, -0.10100565081046632, 0.09461812762455045, -0.12031689204067793, -0.12248534675733733, -0.02093919569026094, 0.26334792292438264, -0.21445089278835033, -0.29538059040657744, 0.1556736236437674, -0.27313829023845126, -0.08362539220324233, 0.20215503530084225, -0.07958094120672173, 0.04062992421340598, 0.02468977263389725, 0.02743960137301979, -0.10017829179121104, -0.2609140826947217, 0.42558510333669086, 0.06640512103692067, 0.23788481271125314, 0.04698235189064968, 0.10582170803638652, -0.010823046376790144, 0.029802759101014, 0.10248268347171959, -0.18594525480118085, 0.05361160692905099, 0.18421228395867323, 0.15686408750143302, 0.16585955984336287, -0.40830574956653287, -0.23496887063384364, 0.07940888691170156, 0.13029537004349398, 0.1678569987377783, -0.07855969698126004, -0.29559050909866974, 0.10103273642641947, -0.17638105807887497, -0.1825090161455441, -0.029812586147430514, 0.006250957619737495, -0.010414518708409357, -0.22297061918965302, 0.14002856420721543, 0.1409232518145014, -0.08466381785913932, -0.15006451128620255, -0.028990437072213, -0.07562722775446297, 0.09615654763111398, 0.15763739998498547, 0.0224240934822616, 0.1585437400999656, -0.05880061152568164, -0.12213323821702372, 0.3406126026986821, -0.03419046946762761, -0.2255342525318419, 0.13249786574901504, -0.22725802646903706, -0.09248127081731627, 0.1059842483479191, 0.11997832961318906, 0.20357961654047335, -0.13679195439812442, 0.1704485053071475, -0.05207160068435348, 0.11641799904837095, 0.12520090908712653, 0.05032190127867805, 0.34891338350081985, 0.0761374302491284, 0.07894228843487183, 0.11712134218282136, -0.04404950505776777, -0.055747962538980345, -0.38397742299101323, -0.15633354528060506, -0.17939539567070958, 0.10783094456149958, -0.18493913659563266, -0.16292433981006302, 0.31876060246366794, 0.05904207605491431, 0.2060198476538062, 0.06091356279462199, 0.20703143709737154, 0.07329583829095633, 0.06644856629023436, 0.10763834086285273, 0.33214696502882585, 0.10422140369499641, 0.10880849774049456, -0.21328222746422038, -0.013084005645268466, 0.11579091179430916] |
1,803.09242 | Controlling Dynamical Quantum Phase Transitions | We study the dynamics arising from a double quantum quench where the
parameters of a given Hamiltonian are abruptly changed from being in an
equilibrium phase A to a different phase B and back (A$\to$B$\to$A). As
prototype models, we consider the (integrable) transverse field Ising as well
as the (non-integrable) ANNNI model. The return amplitude features
non-analyticities after the first quench through the equilibrium quantum
critical point (A$\to$B), which is routinely taken as a signature of passing
through a so-called dynamical quantum phase transition. We demonstrate that
non-analyticities after the second quench (B$\to$A) can be avoided and
reestablished in a recurring manner upon increasing the time $T$ spent in phase
B. The system retains an infinite memory of its past state, and one has the
intriguing opportunity to control at will whether or not dynamical quantum
phase transitions appear after the second quench.
| cond-mat.stat-mech cond-mat.quant-gas cond-mat.str-el quant-ph | we study the dynamics arising from a double quantum quench where the parameters of a given hamiltonian are abruptly changed from being in an equilibrium phase a to a different phase b and back atobtoa as prototype models we consider the integrable transverse field ising as well as the nonintegrable annni model the return amplitude features nonanalyticities after the first quench through the equilibrium quantum critical point atob which is routinely taken as a signature of passing through a socalled dynamical quantum phase transition we demonstrate that nonanalyticities after the second quench btoa can be avoided and reestablished in a recurring manner upon increasing the time t spent in phase b the system retains an infinite memory of its past state and one has the intriguing opportunity to control at will whether or not dynamical quantum phase transitions appear after the second quench | [['we', 'study', 'the', 'dynamics', 'arising', 'from', 'a', 'double', 'quantum', 'quench', 'where', 'the', 'parameters', 'of', 'a', 'given', 'hamiltonian', 'are', 'abruptly', 'changed', 'from', 'being', 'in', 'an', 'equilibrium', 'phase', 'a', 'to', 'a', 'different', 'phase', 'b', 'and', 'back', 'atobtoa', 'as', 'prototype', 'models', 'we', 'consider', 'the', 'integrable', 'transverse', 'field', 'ising', 'as', 'well', 'as', 'the', 'nonintegrable', 'annni', 'model', 'the', 'return', 'amplitude', 'features', 'nonanalyticities', 'after', 'the', 'first', 'quench', 'through', 'the', 'equilibrium', 'quantum', 'critical', 'point', 'atob', 'which', 'is', 'routinely', 'taken', 'as', 'a', 'signature', 'of', 'passing', 'through', 'a', 'socalled', 'dynamical', 'quantum', 'phase', 'transition', 'we', 'demonstrate', 'that', 'nonanalyticities', 'after', 'the', 'second', 'quench', 'btoa', 'can', 'be', 'avoided', 'and', 'reestablished', 'in', 'a', 'recurring', 'manner', 'upon', 'increasing', 'the', 'time', 't', 'spent', 'in', 'phase', 'b', 'the', 'system', 'retains', 'an', 'infinite', 'memory', 'of', 'its', 'past', 'state', 'and', 'one', 'has', 'the', 'intriguing', 'opportunity', 'to', 'control', 'at', 'will', 'whether', 'or', 'not', 'dynamical', 'quantum', 'phase', 'transitions', 'appear', 'after', 'the', 'second', 'quench']] | [-0.1478957017218428, 0.21939737265451445, -0.13149045968228684, 0.045226898035200844, 0.0013095119768487555, -0.17992897114350592, 0.08101280972228518, 0.3289336551113852, -0.30873438468136427, -0.25618512172784125, 0.13188735745996902, -0.2657017492722454, -0.14504534430036853, 0.1487649357312226, 0.019610962072121246, 0.056457976850132194, 0.024094053118356638, 0.07943132925346227, -0.13527100126624905, -0.21507141770229543, 0.2894978978405041, 0.0310543728227328, 0.22257723834398868, 0.010498207867411631, 0.07733646821829357, 0.023916877568366805, 0.08447433572250053, 0.016290527056636556, -0.11576446981827238, -0.07155770752911589, 0.2088787956707165, 0.06691794376155095, 0.2726156390823495, -0.4428176546602377, -0.21834420086815953, 0.11354578482486041, 0.1596785520802119, 0.1636248596287, -0.028425156155468097, -0.29765355783913816, -0.005198865940993918, -0.17687725106786403, -0.1394974468741566, -0.07162547507988555, 0.018884995883230917, -0.009282515778405859, -0.22044059572259098, 0.06950322382617742, 0.09368866092034815, 0.05810358806380204, -0.02428891706097472, -0.009388035332085565, -0.05002138427225873, 0.1602483127582153, 0.016929338609666698, 0.08924020365312961, 0.14989099875092507, -0.14413897433052106, -0.12530706035904587, 0.3754393416323832, -0.07590649257680135, -0.08767176744128977, 0.17262567637953907, -0.14505685401548232, -0.11519682756625116, 0.13774220141183052, 0.13891354325959193, 0.07510444323083253, -0.13563838547062396, 0.07848120139387901, 0.0344360088754911, 0.15701990851521258, -0.007697519852912851, 0.010978952327942743, 0.2861080820672214, 0.15497240422160496, 0.03154842090069516, 0.20656617876624556, -0.07311385479156993, -0.20079528039786965, -0.30520587147080475, -0.13874082283468203, -0.20599328161749456, 0.10614917820130358, -0.04785751535725597, -0.17152581747754345, 0.4375791646540165, 0.13305880726381605, 0.2408113377634436, -0.016880606774273995, 0.25735191361246895, 0.16221092029674244, 0.03688891989627986, 0.04824110927293077, 0.23574269972741604, 0.1010404981938856, 0.14625709435370352, -0.248532172036773, 0.056314793897243885, 0.06678236825391651] |
1,803.09243 | On algebraic properties of low rank approximations of Prony systems | We consider the reconstruction of spike train signals of the form $$F(x) =
\sum_{i=1}^d a_i \delta(x-x_i),$$ from their moments measurements $m_k(F)=\int
x^k F(x) dx = \sum_{i=1}^d a_ix^k$. When some of the nodes $x_i$ near collide
the inversion becomes unstable. Given noisy moments measurements, a typical
consequence is that reconstruction algorithms estimate the signal $F$ with a
signal having fewer nodes, $\tilde{F}$. We derive lower bounds for the moments
difference between a signal $F$ with $d$ nodes and a signal $\tilde{F}$ with
strictly less nodes, $l$. Next we consider the geometry of the non generic case
of $d$ nodes signals $F$, for which there exists an $l<d$ nodes signal
$\tilde{F}$, with moments \begin{align*}
m_0(\tilde{F})=m_{0}(F),\ldots,m_{p}(\tilde{F})=m_{p}(F),&& p>2l-1 .
\end{align*} We give a complete description for the case of a general $d$,
$l=1$ and $p=2$. We give a reference for the case $p=2l-1$ which can be
inferred from earlier work.
| math.CA | we consider the reconstruction of spike train signals of the form fx sum_i1d a_i deltaxx_i from their moments measurements m_kfint xk fx dx sum_i1d a_ixk when some of the nodes x_i near collide the inversion becomes unstable given noisy moments measurements a typical consequence is that reconstruction algorithms estimate the signal f with a signal having fewer nodes tildef we derive lower bounds for the moments difference between a signal f with d nodes and a signal tildef with strictly less nodes l next we consider the geometry of the non generic case of d nodes signals f for which there exists an ld nodes signal tildef with moments beginalign m_0tildefm_0fldotsm_ptildefm_pf p2l1 endalign we give a complete description for the case of a general d l1 and p2 we give a reference for the case p2l1 which can be inferred from earlier work | [['we', 'consider', 'the', 'reconstruction', 'of', 'spike', 'train', 'signals', 'of', 'the', 'form', 'fx', 'sum_i1d', 'a_i', 'deltaxx_i', 'from', 'their', 'moments', 'measurements', 'm_kfint', 'xk', 'fx', 'dx', 'sum_i1d', 'a_ixk', 'when', 'some', 'of', 'the', 'nodes', 'x_i', 'near', 'collide', 'the', 'inversion', 'becomes', 'unstable', 'given', 'noisy', 'moments', 'measurements', 'a', 'typical', 'consequence', 'is', 'that', 'reconstruction', 'algorithms', 'estimate', 'the', 'signal', 'f', 'with', 'a', 'signal', 'having', 'fewer', 'nodes', 'tildef', 'we', 'derive', 'lower', 'bounds', 'for', 'the', 'moments', 'difference', 'between', 'a', 'signal', 'f', 'with', 'd', 'nodes', 'and', 'a', 'signal', 'tildef', 'with', 'strictly', 'less', 'nodes', 'l', 'next', 'we', 'consider', 'the', 'geometry', 'of', 'the', 'non', 'generic', 'case', 'of', 'd', 'nodes', 'signals', 'f', 'for', 'which', 'there', 'exists', 'an', 'ld', 'nodes', 'signal', 'tildef', 'with', 'moments', 'beginalign', 'm_0tildefm_0fldotsm_ptildefm_pf', 'p2l1', 'endalign', 'we', 'give', 'a', 'complete', 'description', 'for', 'the', 'case', 'of', 'a', 'general', 'd', 'l1', 'and', 'p2', 'we', 'give', 'a', 'reference', 'for', 'the', 'case', 'p2l1', 'which', 'can', 'be', 'inferred', 'from', 'earlier', 'work']] | [-0.22398228728738817, 0.0841986425044867, -0.026244191331383976, 0.03759306056198893, -0.05224858922208997, -0.19691949728133995, 0.04883114484887894, 0.33213610972102353, -0.278704442257615, -0.22261230870946377, 0.06639215085938897, -0.3601897814972461, -0.10979633735015354, 0.13801127146301873, -0.008269566630917614, -0.014222015088518569, 0.0481691596256839, 0.13108417436318553, -0.09225000915762065, -0.2126484597607961, 0.2640434897477752, -0.032288882879294, 0.18595502207703565, -0.024199777552723022, 0.08601531391099528, 0.01707131354107886, 0.02866334119386485, -0.029382669245419296, -0.18806913252980018, 0.06891091630551154, 0.2602493439166658, 0.13818003805489212, 0.23862774294220668, -0.4035742129266694, -0.1451576375723074, 0.2365937856798089, 0.11517957293603948, 0.04621215049764547, -0.033102809040903354, -0.26843042155403807, 0.10007504943211604, -0.08493422409789501, -0.10268314292087503, -0.03187955145224713, 0.08266900940730736, 0.05588506638625826, -0.40239461666762666, 0.10376933113793316, 0.09843710797798375, 0.05273686679404067, -0.015057014402649973, -0.161691569634612, -0.027096225660753207, 0.0741081767965638, 0.019967990050065346, 0.10949448129310664, 0.06650515230359051, -0.07983938486322059, -0.044211020187029375, 0.3385687366100973, -0.06713049348943151, -0.23984470665184915, 0.08971192020976888, -0.17640805731534256, -0.14023155114188304, 0.12382647995769545, 0.1722701072078738, 0.14296445000471306, -0.10046693745992515, 0.1144624934557056, -0.042367713465152876, 0.15135601172696098, 0.08250865742118786, 0.03242727233294357, 0.13658210648851388, 0.06168586362669568, 0.12394932645712169, 0.12583095816966228, -0.106985758655988, 0.017113892260291006, -0.35308846876116307, -0.10685393928577179, -0.20833643257577458, 0.10340164676713555, -0.12260779173917347, -0.13063033363036136, 0.3565895226395999, 0.07804269889754284, 0.25558272814141936, 0.10982505149592686, 0.27766362090672675, 0.14567298253667474, -0.0015671355253341944, 0.11567174657956576, 0.15338644675469276, 0.1584473948561303, 0.0450599851509374, -0.14265065028102716, 0.07202811361007068, 0.06400131723890756] |
1,803.09244 | Proximity-reduced range of internal phase differences in double
Josephson junctions with closely spaced interfaces | A substantial influence of the proximity and pair breaking effects on the
range of internal phase differences is shown to take place in symmetric double
Josephson junctions with closely spaced interfaces and to affect the evolution
of the supercurrent j with the changing central lead's length L. If the phase
difference phi between the external leads is controlled and L exceeds a few
coherence lengths, the regime of interchanging modes is established. The range
of the phase differences across the two individual interfaces is reduced with
decreasing L, and the states of the higher energy mode are gradually
eliminated. With a further decrease of L the regime of interchanging modes is
destroyed along with the asymmetric mode. The conventional single junction
current-phase relation j(phi) is eventually established and the condensate
states' doubling is fully removed at very small L.
| cond-mat.supr-con cond-mat.mes-hall | a substantial influence of the proximity and pair breaking effects on the range of internal phase differences is shown to take place in symmetric double josephson junctions with closely spaced interfaces and to affect the evolution of the supercurrent j with the changing central leads length l if the phase difference phi between the external leads is controlled and l exceeds a few coherence lengths the regime of interchanging modes is established the range of the phase differences across the two individual interfaces is reduced with decreasing l and the states of the higher energy mode are gradually eliminated with a further decrease of l the regime of interchanging modes is destroyed along with the asymmetric mode the conventional single junction currentphase relation jphi is eventually established and the condensate states doubling is fully removed at very small l | [['a', 'substantial', 'influence', 'of', 'the', 'proximity', 'and', 'pair', 'breaking', 'effects', 'on', 'the', 'range', 'of', 'internal', 'phase', 'differences', 'is', 'shown', 'to', 'take', 'place', 'in', 'symmetric', 'double', 'josephson', 'junctions', 'with', 'closely', 'spaced', 'interfaces', 'and', 'to', 'affect', 'the', 'evolution', 'of', 'the', 'supercurrent', 'j', 'with', 'the', 'changing', 'central', 'leads', 'length', 'l', 'if', 'the', 'phase', 'difference', 'phi', 'between', 'the', 'external', 'leads', 'is', 'controlled', 'and', 'l', 'exceeds', 'a', 'few', 'coherence', 'lengths', 'the', 'regime', 'of', 'interchanging', 'modes', 'is', 'established', 'the', 'range', 'of', 'the', 'phase', 'differences', 'across', 'the', 'two', 'individual', 'interfaces', 'is', 'reduced', 'with', 'decreasing', 'l', 'and', 'the', 'states', 'of', 'the', 'higher', 'energy', 'mode', 'are', 'gradually', 'eliminated', 'with', 'a', 'further', 'decrease', 'of', 'l', 'the', 'regime', 'of', 'interchanging', 'modes', 'is', 'destroyed', 'along', 'with', 'the', 'asymmetric', 'mode', 'the', 'conventional', 'single', 'junction', 'currentphase', 'relation', 'jphi', 'is', 'eventually', 'established', 'and', 'the', 'condensate', 'states', 'doubling', 'is', 'fully', 'removed', 'at', 'very', 'small', 'l']] | [-0.24369886362667215, 0.23647229476972556, -0.04351916511301471, 0.02891125693404712, -0.03596507669707332, -0.15228354396539734, 0.07280385946325636, 0.3518896017143195, -0.2845464568156347, -0.29754600055907726, 0.03480214931040654, -0.2940544595174733, -0.05295213102530554, 0.16424421706109596, 0.02273742502836658, -0.029912224796553737, 0.018546484729020502, 0.024814921223538386, -0.09815011181526904, -0.1682997257214227, 0.30968740420322194, 0.024434671261542137, 0.324271739017689, 0.05918617415235197, 0.053928882850119646, -0.010939148188711658, 0.001267611141242891, 0.016404689683264, -0.10896729489306001, 0.02069897910415885, 0.1920358051257811, -0.04190631507286172, 0.2308478589377386, -0.430121650745114, -0.16079445411585164, 0.08975779048080067, 0.16062043280769542, 0.08686320827235368, 0.022642987769385198, -0.26323519316803423, 0.07627374947024174, -0.13147637335308862, -0.12174639804791257, 0.013331446575550295, 0.06581441802140191, 0.011719878019242408, -0.24655442119395132, 0.10248716022457471, 0.07383751413088105, 0.040454972980932584, 0.02244332231574511, -0.08657196537455839, -0.09354872846466711, 0.12548513218874394, 0.04350436343007433, 0.06009041264036791, 0.14156269340393998, -0.10314471544044615, -0.03293617407409407, 0.31417636743498795, -0.07060179074140761, -0.16448596398607432, 0.18810532652109646, -0.1746042168786307, -0.026756878489990244, 0.15786539816143488, 0.07748822065190875, 0.0696246713440088, -0.07050200316572575, 0.06850349626180602, 0.02737489717898609, 0.1718917620333126, 0.09552219892490199, 0.08254106764902742, 0.2500486530450662, 0.16967145243254256, 0.05427593238385421, 0.17058403956831145, -0.09752897522747249, -0.12221077878343062, -0.3097535680523879, -0.11186754420607371, -0.14529510343693558, -0.0011333347559511233, -0.061751443924438446, -0.13680667498901908, 0.3787784816985347, 0.06879265852969327, 0.23450230664352503, 0.015404280819285245, 0.23431001699080678, 0.17576778388629072, 0.11339599640182346, 0.02382489960479865, 0.2614315946673532, 0.1678867278555274, 0.09962340972257322, -0.3133421480059356, 0.056706728232796676, -0.005658273935224191] |
1,803.09245 | On comparison between relative log de Rham-Witt cohomology and relative
log crystalline cohomology | In this article, we prove the comparison theorem between the relative log de
Rham-Witt cohomology and the relative log crystalline cohomology for a log
smooth saturated morphism of fs log schemes satisfying certain condition. Our
result covers the case where the base fs log scheme is etale locally log smooth
over a scheme with trivial log structure or the case where the base fs log
scheme is hollow, and so it generalizes the previously known results of
Matsuue. In Appendix, we prove that our relative log de Rham-Witt complex and
our comparison map are compatible with those of Hyodo-Kato.
| math.NT math.AG | in this article we prove the comparison theorem between the relative log de rhamwitt cohomology and the relative log crystalline cohomology for a log smooth saturated morphism of fs log schemes satisfying certain condition our result covers the case where the base fs log scheme is etale locally log smooth over a scheme with trivial log structure or the case where the base fs log scheme is hollow and so it generalizes the previously known results of matsuue in appendix we prove that our relative log de rhamwitt complex and our comparison map are compatible with those of hyodokato | [['in', 'this', 'article', 'we', 'prove', 'the', 'comparison', 'theorem', 'between', 'the', 'relative', 'log', 'de', 'rhamwitt', 'cohomology', 'and', 'the', 'relative', 'log', 'crystalline', 'cohomology', 'for', 'a', 'log', 'smooth', 'saturated', 'morphism', 'of', 'fs', 'log', 'schemes', 'satisfying', 'certain', 'condition', 'our', 'result', 'covers', 'the', 'case', 'where', 'the', 'base', 'fs', 'log', 'scheme', 'is', 'etale', 'locally', 'log', 'smooth', 'over', 'a', 'scheme', 'with', 'trivial', 'log', 'structure', 'or', 'the', 'case', 'where', 'the', 'base', 'fs', 'log', 'scheme', 'is', 'hollow', 'and', 'so', 'it', 'generalizes', 'the', 'previously', 'known', 'results', 'of', 'matsuue', 'in', 'appendix', 'we', 'prove', 'that', 'our', 'relative', 'log', 'de', 'rhamwitt', 'complex', 'and', 'our', 'comparison', 'map', 'are', 'compatible', 'with', 'those', 'of', 'hyodokato']] | [-0.1805194966228945, -0.007216428211719102, -0.10160596684163094, 0.06925526340800926, -0.032980988289191555, -0.1709165678036456, 0.0553187393507331, 0.3424434234597245, -0.27825572326950426, -0.28499038038509233, 0.030528428439259986, -0.23196096264053973, -0.13833193412782357, 0.24923307323894864, -0.16886973738366243, -0.03503832503278949, -9.203780138370942e-05, 0.04835920923446514, -0.08936419682719801, -0.3332218173677482, 0.401297803702099, -0.00156427229925686, 0.27208196918470595, 0.005551597711687185, 0.09434685123637698, -0.01901329445833226, -0.02320786457204697, -0.05011506460378973, -0.17105425456433368, 0.1078496909419987, 0.332264556663529, 0.01672761155558484, 0.14787130381161234, -0.31362772231199304, -0.13965026725425708, 0.14997427130464883, 0.0727447067453925, 0.026450175193271468, 0.046953566942592055, -0.21546113478228907, 0.17073110035116956, -0.15748575623432287, -0.11909329197226967, -0.03903034509026578, -0.0053787239665659715, 0.06284791371805967, -0.25912720312623366, 0.023833568885029122, 0.09492302721487156, 0.09110617399576823, -0.03378651903143951, -0.053601093124598265, -0.06881130761609469, 0.016579694354583566, -0.02222481317228961, 0.13935232725070448, 0.08748783359817248, -0.04632687141729177, -0.02843057234030293, 0.3587829279428234, -0.13530202697943516, -0.12080442249698907, 0.14558598977675166, -0.12077986846240807, -0.13894934708499634, 0.11560779463556804, 0.014196503631846637, 0.2759281212311922, 0.07529282012932972, 0.20574381536797012, -0.08359219736362598, 0.1819630708564453, 0.16305403767286666, 0.027772847387217442, 0.023051156415318956, 0.12043694438583845, 0.10690450780473802, 0.03445387161954553, -0.04236223592841047, -0.11430917185617193, -0.3769458211288426, -0.25280554003405326, -0.07885952620548481, 0.10577575894718876, -0.1345206525466911, -0.1414801596321774, 0.29861702903668186, 0.03769885840331565, 0.27007399959375666, 0.162291831075575, 0.2955987877687629, 0.07308422141038451, -0.026723820364520867, 0.13040097959681737, 0.08379350954248589, 0.15627280300559135, 0.012962935733542378, -0.15862713373570267, 0.02301180593156237, 0.1468308954499662] |
1,803.09246 | Ground states of the $L^2$-critical NLS equation with localized
nonlinearity on a tadpole graph | The paper aims at giving a first insight on the existence/nonexistence of
ground states for the $L^2$-critical NLS equation on metric graphs with
localized nonlinearity. In particular, we focus on the tadpole graph, which,
albeit being a toy model, allows to point out some specific features of the
problem, whose understanding will be useful for future investigations.
| math.AP | the paper aims at giving a first insight on the existencenonexistence of ground states for the l2critical nls equation on metric graphs with localized nonlinearity in particular we focus on the tadpole graph which albeit being a toy model allows to point out some specific features of the problem whose understanding will be useful for future investigations | [['the', 'paper', 'aims', 'at', 'giving', 'a', 'first', 'insight', 'on', 'the', 'existencenonexistence', 'of', 'ground', 'states', 'for', 'the', 'l2critical', 'nls', 'equation', 'on', 'metric', 'graphs', 'with', 'localized', 'nonlinearity', 'in', 'particular', 'we', 'focus', 'on', 'the', 'tadpole', 'graph', 'which', 'albeit', 'being', 'a', 'toy', 'model', 'allows', 'to', 'point', 'out', 'some', 'specific', 'features', 'of', 'the', 'problem', 'whose', 'understanding', 'will', 'be', 'useful', 'for', 'future', 'investigations']] | [-0.12677442552031656, 0.04636429851106776, -0.10959529701064814, 0.08939769119024277, -0.13294997373432443, -0.1661588792247992, 0.0469493297655789, 0.32085141268346395, -0.2203097630357533, -0.2645296877854618, 0.1572937566211055, -0.30715375053395083, -0.1681677060561222, 0.19981405779049455, -0.02248370999535709, 0.05396496746362301, 0.09159099013062619, 0.08517056283655397, -0.03433986985239021, -0.21663965669862942, 0.3882167915029353, 0.05360943556093333, 0.22465125610234968, 0.1056310313247275, 0.05881160063048204, -0.021172396438359692, -0.004855604353156595, 0.0033034745750850753, -0.16036170832108168, 0.1071868382099829, 0.216757934932646, 0.07756215074965567, 0.29712780140209616, -0.44653047464395823, -0.2187951523810625, 0.13046013304489879, 0.14970601109885856, 0.15979397676582857, -0.036663754163064846, -0.34019698594745834, 0.05561586104541723, -0.05946401126270199, -0.1566768264430657, -0.07893797747071898, -0.0052448478527367115, -0.019402476648489635, -0.23694370072661786, 0.014979514040118247, 0.0843320878032644, -0.002769134464886105, -0.08826656889664662, -0.10685962230465457, -0.01998934255945578, 0.10908603977836799, -0.010009984430660935, 0.04190201945439504, 0.026326824486124934, -0.16943058763679705, -0.08486551896816022, 0.40601038249830407, -0.031887648349399104, -0.20966197958771596, 0.16271793609076554, -0.14202215297049597, -0.1903042348363159, 0.0824922390216798, 0.21776364564797596, 0.12445837950431987, -0.15070452243232643, 0.0846447781251188, -0.03562586908147, 0.13110876107525096, 0.03249797809934407, 0.04521139619643228, 0.24221750883091436, 0.22424250723091527, 0.1013605600598742, 0.1629130030826976, -0.022922225365938062, -0.09707886516525034, -0.31819161452483713, -0.09746716986818794, -0.14261319612463316, 0.07796308352497586, -0.09889386154776603, -0.15346288350982623, 0.4876056523960933, 0.14425876198705131, 0.19429133029393197, 0.04438480173376503, 0.22290950346934169, 0.12498294302311383, -0.005312008080644566, 0.04470975529361647, 0.2111790503335406, 0.09032744887333952, 0.09968896489590406, -0.1863689411415212, 0.042444686237886026, 0.09956386915751193] |
1,803.09247 | Qualitative behavior of cosmological models combining various matter
fields | The late time accelerated expansion of the universe can be realized using
scalar fields with given self-interacting potentials. Here we consider a
straightforward approach where a three cosmic fluid mixture is assumed. The
fluids are standard matter perfect fluid, dark matter, and a scalar field with
the role of dark energy. A dynamical system analysis is developed in this
context. A central role is played by the equation of state $\omega_{eff}$ which
determines the acceleration phase of the models. Determining the domination of
a particular fluid at certain stages of the universe history by stability
analysis allows, in principle, to establish the succession of the various
cosmological eras.
| gr-qc | the late time accelerated expansion of the universe can be realized using scalar fields with given selfinteracting potentials here we consider a straightforward approach where a three cosmic fluid mixture is assumed the fluids are standard matter perfect fluid dark matter and a scalar field with the role of dark energy a dynamical system analysis is developed in this context a central role is played by the equation of state omega_eff which determines the acceleration phase of the models determining the domination of a particular fluid at certain stages of the universe history by stability analysis allows in principle to establish the succession of the various cosmological eras | [['the', 'late', 'time', 'accelerated', 'expansion', 'of', 'the', 'universe', 'can', 'be', 'realized', 'using', 'scalar', 'fields', 'with', 'given', 'selfinteracting', 'potentials', 'here', 'we', 'consider', 'a', 'straightforward', 'approach', 'where', 'a', 'three', 'cosmic', 'fluid', 'mixture', 'is', 'assumed', 'the', 'fluids', 'are', 'standard', 'matter', 'perfect', 'fluid', 'dark', 'matter', 'and', 'a', 'scalar', 'field', 'with', 'the', 'role', 'of', 'dark', 'energy', 'a', 'dynamical', 'system', 'analysis', 'is', 'developed', 'in', 'this', 'context', 'a', 'central', 'role', 'is', 'played', 'by', 'the', 'equation', 'of', 'state', 'omega_eff', 'which', 'determines', 'the', 'acceleration', 'phase', 'of', 'the', 'models', 'determining', 'the', 'domination', 'of', 'a', 'particular', 'fluid', 'at', 'certain', 'stages', 'of', 'the', 'universe', 'history', 'by', 'stability', 'analysis', 'allows', 'in', 'principle', 'to', 'establish', 'the', 'succession', 'of', 'the', 'various', 'cosmological', 'eras']] | [-0.1703008679345388, 0.17751428934193594, -0.16888208563991444, 0.055641299706487055, -0.05864066245568985, -0.08506211908900661, -0.06519771175657364, 0.26494180107558213, -0.23469476053422247, -0.32729661412951017, 0.06654437679875021, -0.19255086068827681, -0.0749841412050753, 0.1228600386098993, 0.039634983439032954, -0.005500337057229545, 0.0101945397987543, 0.055774134435018316, -0.002631856137196775, -0.25157628522504605, 0.36038081717561, 0.08641806017193529, 0.23797967481961543, -0.0006181917032571855, 0.13635221835127392, -0.026996255662568188, -0.04414809260655333, 0.034717059939996235, -0.17661130774542, 0.05247861261401946, 0.19581175425793373, 0.10320329640267624, 0.2794180917424253, -0.4434969235315091, -0.2820460184873944, 0.1846011467477419, 0.13867745506879012, 0.12310224338068144, -0.09592160949035099, -0.25646199427407096, 0.02104851861561959, -0.17388158194996692, -0.13364632415619712, -0.03185298862970538, -0.019674309304078902, -0.0002646879939776328, -0.24843908123740996, 0.1436068506575086, 0.020209610757269222, -0.03273998926980076, -0.09179351615549186, -0.046050358678998975, 0.013163924931884848, 0.04778112254657403, 0.06349871383389216, 0.010531993893285593, 0.16837115022698762, -0.19814860110852384, -0.0708390303081143, 0.4431797281528513, -0.13996692607071493, -0.14285082037181215, 0.17019057991759232, -0.12076078552787227, -0.10255633532155857, 0.09779472537856135, 0.13390258648777725, 0.11807018857345813, -0.16147140527351034, 0.1492314325484956, 0.007966336173315844, 0.1383930470587479, 0.07282191279982389, -0.023303088507856482, 0.3128459080881267, 0.194132569153293, -0.004779231230107446, 0.11565358084260004, -0.02523122142776157, -0.14808324457111735, -0.35235561592573367, -0.19421128018034828, -0.17203080465292764, 0.023355909037895292, -0.14309438307652642, -0.15973549174075877, 0.40132645210596146, 0.08521843911579775, 0.14906112915681055, -0.019148994727637963, 0.2720941240485344, 0.10120066779631155, -0.04136450954764667, 0.07153559944816623, 0.28231861360836774, 0.18601844718041657, 0.14508775211611968, -0.22259349916000953, 0.028632428768711787, 0.08094070042931924] |
1,803.09248 | Construction of nice nilpotent Lie groups | We illustrate an algorithm to classify nice nilpotent Lie algebras of
dimension $n$ up to a suitable notion of equivalence; applying the algorithm,
we obtain complete listings for $n\leq9$. On every nilpotent Lie algebra of
dimension $\leq 7$, we determine the number of inequivalent nice bases, which
can be $0$, $1$, or $2$.
We show that any nilpotent Lie algebra of dimension $n$ has at most countably
many inequivalent nice bases.
| math.DG | we illustrate an algorithm to classify nice nilpotent lie algebras of dimension n up to a suitable notion of equivalence applying the algorithm we obtain complete listings for nleq9 on every nilpotent lie algebra of dimension leq 7 we determine the number of inequivalent nice bases which can be 0 1 or 2 we show that any nilpotent lie algebra of dimension n has at most countably many inequivalent nice bases | [['we', 'illustrate', 'an', 'algorithm', 'to', 'classify', 'nice', 'nilpotent', 'lie', 'algebras', 'of', 'dimension', 'n', 'up', 'to', 'a', 'suitable', 'notion', 'of', 'equivalence', 'applying', 'the', 'algorithm', 'we', 'obtain', 'complete', 'listings', 'for', 'nleq9', 'on', 'every', 'nilpotent', 'lie', 'algebra', 'of', 'dimension', 'leq', '7', 'we', 'determine', 'the', 'number', 'of', 'inequivalent', 'nice', 'bases', 'which', 'can', 'be', '0', '1', 'or', '2', 'we', 'show', 'that', 'any', 'nilpotent', 'lie', 'algebra', 'of', 'dimension', 'n', 'has', 'at', 'most', 'countably', 'many', 'inequivalent', 'nice', 'bases']] | [-0.16405956178221484, 0.07246486598180614, -0.03517104074699988, 0.04456957967453439, -0.11903023174767133, -0.1953839799979518, -0.04126208465100384, 0.4016307034647801, -0.3103171105801561, -0.23563471352550344, 0.09881440871460757, -0.24180120838360047, -0.1008792262832621, 0.1814535655520699, -0.11424498927687675, -0.06718379962684351, 0.04644893275075395, 0.1661586828897117, -0.12977298661003964, -0.3440266368569623, 0.37381037899201186, -0.066650104240029, 0.18752432032160357, -0.015203851058711889, 0.17596264624259841, 0.005722985189722877, 0.021226363164753143, -0.011922497958154745, -0.16954510128111203, 0.10987836572433442, 0.31785807744140776, 0.13510012022272067, 0.22519039055070197, -0.31427584358115523, -0.05275796409401203, 0.24083031793977594, 0.21445999933328008, 0.052177698202234446, 0.005821671138491324, -0.22731159624158287, 0.14925584570885125, -0.18736294392024128, -0.1805079129301536, -0.13539281534031034, 0.10495858607997358, -0.07353537591357887, -0.2629819319740882, -0.01790776906508795, 0.09420346854333307, 0.1643187896886342, -0.05661009262237226, -0.1507951097878952, -0.09386758647636104, 0.08767669531024835, -0.10120024347126903, -0.006206639547189566, 0.07906331918054772, 0.017737674021857306, -0.20921690899773804, 0.3373572391221746, 0.03200202300147691, -0.18468479972175308, 0.17489232222588968, -0.21555923379328049, -0.25421241143534723, 0.13402997441327488, 0.0898651039805001, 0.17948486074857728, -0.03244457695580704, 0.25209459701133236, -0.14239845184845404, 0.07246485292176966, 0.14014154974318727, 0.013617765060035696, 0.08312936371821962, 0.12070458719480626, 0.10454321733239749, 0.06601843396431281, 0.09511516806931877, 0.06611906394729732, -0.3666560335058561, -0.20067652515594808, -0.13423048266747467, 0.14968992100084122, -0.1923923795504994, -0.1353660864676808, 0.36977639107007376, 0.15294546266020814, 0.19356721705219276, 0.11407273876133152, 0.1565996956237605, 0.04055013831271987, 0.10928146968739973, 0.1294585239588165, 0.10429895129448301, 0.21818543296359794, -0.11641802522681759, -0.08491303429374812, -0.10768894873507007, 0.20464594268672903] |
1,803.09249 | LTE-advanced simulation framework based on OMNeT++ | Long Term Evolution-Advanced (LTE-Advanced) is the most recent mobile
telecommunication technology proposed by 3GPP. LTE-Advanced is applied in some
countries, but still in development and testing phase, because of that, a
simulation model is needed to test this technology. This paper introduces a
LTE-Advanced simulation framework based on OMNeT++ IDE (open source). The
proposed framework test results showed that it is working properly and ready to
be used. This framework can be considered as the beginning of the LTE-Advanced
simulation model based on OMNeT++.
| cs.NI | long term evolutionadvanced lteadvanced is the most recent mobile telecommunication technology proposed by 3gpp lteadvanced is applied in some countries but still in development and testing phase because of that a simulation model is needed to test this technology this paper introduces a lteadvanced simulation framework based on omnet ide open source the proposed framework test results showed that it is working properly and ready to be used this framework can be considered as the beginning of the lteadvanced simulation model based on omnet | [['long', 'term', 'evolutionadvanced', 'lteadvanced', 'is', 'the', 'most', 'recent', 'mobile', 'telecommunication', 'technology', 'proposed', 'by', '3gpp', 'lteadvanced', 'is', 'applied', 'in', 'some', 'countries', 'but', 'still', 'in', 'development', 'and', 'testing', 'phase', 'because', 'of', 'that', 'a', 'simulation', 'model', 'is', 'needed', 'to', 'test', 'this', 'technology', 'this', 'paper', 'introduces', 'a', 'lteadvanced', 'simulation', 'framework', 'based', 'on', 'omnet', 'ide', 'open', 'source', 'the', 'proposed', 'framework', 'test', 'results', 'showed', 'that', 'it', 'is', 'working', 'properly', 'and', 'ready', 'to', 'be', 'used', 'this', 'framework', 'can', 'be', 'considered', 'as', 'the', 'beginning', 'of', 'the', 'lteadvanced', 'simulation', 'model', 'based', 'on', 'omnet']] | [-0.09861229923054841, 0.012226471189586889, -0.06749555490733612, 0.031505395765028275, -0.058809420914344844, -0.20191764781650687, -0.007250628493715166, 0.3939362402916664, -0.19490563723818577, -0.30311281426942777, 0.1539290852683951, -0.186447408757106, -0.20648084284870752, 0.24158848838470431, -0.08823787662688465, 0.08861763839238501, 0.10232914318995816, -0.022639996649342634, 0.05372147509201784, -0.28692665448900134, 0.23112656777015045, 0.15305565387409711, 0.3756275702866593, 0.10183891744375051, 0.05324823221945692, -0.05785259027366659, -0.07415252086329496, -0.020118843248513128, -0.06551149662205023, 0.11072615149134349, 0.3086580458718042, 0.1844714281559434, 0.3474685512926607, -0.443343621589953, -0.2731711952836208, 0.02865456295244041, 0.11871182720088178, 0.061029376584060845, -0.08252770303183102, -0.3246698347585542, 0.1407382824524705, -0.3137934343734135, -0.09199543966401723, -0.015042090308443654, -0.04751374031461421, -0.007814463410925652, -0.26906695274547454, -0.04293224570435649, 0.010434116726520145, 0.023360379439379488, -0.01658661677391224, -0.06767433973506004, 0.05581944003435118, 0.13429719424762188, 0.03358514634393422, 0.062135740770914015, 0.09009811313201983, -0.06378854410113058, -0.13637055310287646, 0.4071612756788021, -0.053440764058558715, -0.18573769981351992, 0.17144458570761517, -0.029815240391707493, -0.15167016157370417, 0.01205627805375982, 0.2042544476557634, 0.05526574893987605, -0.2546425175068656, 0.10048225311246435, -0.008127935042250015, 0.2046443355045215, -0.0014245160411865939, -0.027747772345762877, 0.18131455363306617, 0.31023857773592073, 0.014211882182973482, 0.10463001376150974, -0.0666598128515207, -0.1522129120393878, -0.28811762308967964, -0.15245223036479383, -0.17993756325449795, -0.011548447367247371, 0.005449054449854884, -0.11027282760256812, 0.38912495284984333, 0.25267715359084486, 0.053902837237165796, 0.04077422643985344, 0.3668311271106913, 0.05668300344647529, 0.12602178171454442, 0.11187688399860192, 0.1943566024132278, 0.05471962851671768, 0.18312525357829318, -0.14139448329972634, 0.09223616659680071, 0.018077547850442074] |
1,803.0925 | Kinetics, pseudo-kinetics, uncertainty principle and quantum 1/f noise | 1/f noise at arbitrary low frequences is the way of existence of
irreversibility in thermal motion governed by reversible laws of mechanics.
This statement not once was confirmed in statistical mechanics beyond its
traditional kinetical roughenings. Here we point out that in case of quantum
statistical mechanics in principle it is sufficient to avoid such the
roughening as the "Fermi golden rule". This means taking into account the
time-energy uncertainty principle (time-frequency one in classical limit) and
thus uncertainties in characteristics of real collisions and scatterings of
particles and/or quanta. We consider the resulting "pseudo-kinetics" and
demonstrate how it produces quantum 1/f-noise
| cond-mat.stat-mech quant-ph | 1f noise at arbitrary low frequences is the way of existence of irreversibility in thermal motion governed by reversible laws of mechanics this statement not once was confirmed in statistical mechanics beyond its traditional kinetical roughenings here we point out that in case of quantum statistical mechanics in principle it is sufficient to avoid such the roughening as the fermi golden rule this means taking into account the timeenergy uncertainty principle timefrequency one in classical limit and thus uncertainties in characteristics of real collisions and scatterings of particles andor quanta we consider the resulting pseudokinetics and demonstrate how it produces quantum 1fnoise | [['1f', 'noise', 'at', 'arbitrary', 'low', 'frequences', 'is', 'the', 'way', 'of', 'existence', 'of', 'irreversibility', 'in', 'thermal', 'motion', 'governed', 'by', 'reversible', 'laws', 'of', 'mechanics', 'this', 'statement', 'not', 'once', 'was', 'confirmed', 'in', 'statistical', 'mechanics', 'beyond', 'its', 'traditional', 'kinetical', 'roughenings', 'here', 'we', 'point', 'out', 'that', 'in', 'case', 'of', 'quantum', 'statistical', 'mechanics', 'in', 'principle', 'it', 'is', 'sufficient', 'to', 'avoid', 'such', 'the', 'roughening', 'as', 'the', 'fermi', 'golden', 'rule', 'this', 'means', 'taking', 'into', 'account', 'the', 'timeenergy', 'uncertainty', 'principle', 'timefrequency', 'one', 'in', 'classical', 'limit', 'and', 'thus', 'uncertainties', 'in', 'characteristics', 'of', 'real', 'collisions', 'and', 'scatterings', 'of', 'particles', 'andor', 'quanta', 'we', 'consider', 'the', 'resulting', 'pseudokinetics', 'and', 'demonstrate', 'how', 'it', 'produces', 'quantum', '1fnoise']] | [-0.07835393863177159, 0.18432072925847023, -0.1333874640101567, 0.10892202122602612, -0.016081980324815958, -0.1268060218100436, 0.08376167526468635, 0.29606280647218225, -0.3018015940021723, -0.28469318717718123, 0.030798797040479258, -0.2704015766456723, -0.1360474329488352, 0.2008591318037361, -0.08476281869225204, 0.06431044968485367, 0.040522560751996936, -0.00676886442117393, -0.021783835168462246, -0.18660732965683566, 0.2747338437149301, 0.07763090816093608, 0.2850390156800859, 0.05433061870280653, 0.13069742332678289, 0.0485785107081756, -0.0006104357377626001, 0.03752799156587571, -0.10298953518540657, 0.0339931629577768, 0.25208796209190043, 0.07351706524379552, 0.24449970773421228, -0.4275819239579141, -0.23725145583041013, 0.12110304732806981, 0.12054804032319226, 0.13105542595963926, 0.017154625253751873, -0.2704215497546829, 0.03984133298275992, -0.13415810794802382, -0.1606802278693067, -0.06928177003050223, 0.013849373937118799, -0.03626333578955382, -0.18626333002466708, 0.15918471111916005, 0.14275444874539972, 0.06496478546410799, -0.016656870732549577, -0.057454492854885755, 0.01514977843966335, 0.08750783379655332, 0.04303449990053196, -0.05339509486686438, 0.16542851142352447, -0.10050754945841618, -0.11566937434952707, 0.4431022071815096, -0.004316096492111683, -0.21739561314694583, 0.1469375112769194, -0.16950715072918685, -0.15708507726900278, 0.13484444447560237, 0.11050399834988639, 0.030794491050764917, -0.17677933846600355, 0.09993422257801285, 0.03122560846619308, 0.13649715056555578, 0.06278714846819639, 0.0574454322271049, 0.22820746100042016, 0.14748854039004072, 0.016937971357256176, 0.13213214604649692, -0.09407162190880626, -0.16762948057847096, -0.35869367892388254, -0.1775079189101234, -0.21207181856501847, 0.12572009237497694, -0.06560030072767403, -0.13349095271900296, 0.29708248312585056, 0.1667267879046267, 0.14257498943246902, 0.026572478068992496, 0.2776159636117518, 0.17283205980958882, 0.024427517247386277, 0.04137769605498761, 0.28168461441993714, 0.15669645115965977, 0.09880350393708795, -0.2285155729856342, 0.04273418595083058, 0.03099197970237583] |
1,803.09251 | The DEIMOS 10k spectroscopic survey catalog of the COSMOS field | We present a catalog of 10718 objects in the COSMOS field observed through
multi-slit spectroscopy with the Deep Imaging Multi-Object Spectrograph
(DEIMOS) on the Keck II telescope in the wavelength range ~5500-9800A. The
catalog contains 6617 objects with high-quality spectra (two or more spectral
features), and 1798 objects with a single spectroscopic feature confirmed by
the photometric redshift. For 2024 typically faint objects we could not obtain
reliable redshifts. The objects have been selected from a variety of input
catalogs based on multi-wavelength observations in the field, and thus have a
diverse selection function, which enables the study of the diversity in the
galaxy population. The magnitude distribution of our objects is peaked at
I_AB~23 and K_AB~21, with a secondary peak at K_AB~24. We sample a broad
redshift distribution in the range 0<z<6, with one peak at z~1, and another one
around z~4. We have identified 13 redshift spikes at z>0.65 with chance
probabilities <4xE-4$, some of which are clearly related to protocluster
structures of sizes >10 Mpc. An object-to-object comparison with a multitude of
other spectroscopic samples in the same field shows that our DEIMOS sample is
among the best in terms of fraction of spectroscopic failures and relative
redshift accuracy. We have determined the fraction of spectroscopic blends to
about 0.8% in our sample. This is likely a lower limit and at any rate well
below the most pessimistic expectations. Interestingly, we find evidence for
strong lensing of Ly-alpha background emitters within the slits of 12 of our
target galaxies, increasing their apparent density by about a factor of 4.
| astro-ph.GA astro-ph.CO | we present a catalog of 10718 objects in the cosmos field observed through multislit spectroscopy with the deep imaging multiobject spectrograph deimos on the keck ii telescope in the wavelength range 55009800a the catalog contains 6617 objects with highquality spectra two or more spectral features and 1798 objects with a single spectroscopic feature confirmed by the photometric redshift for 2024 typically faint objects we could not obtain reliable redshifts the objects have been selected from a variety of input catalogs based on multiwavelength observations in the field and thus have a diverse selection function which enables the study of the diversity in the galaxy population the magnitude distribution of our objects is peaked at i_ab23 and k_ab21 with a secondary peak at k_ab24 we sample a broad redshift distribution in the range 0z6 with one peak at z1 and another one around z4 we have identified 13 redshift spikes at z065 with chance probabilities 4xe4 some of which are clearly related to protocluster structures of sizes 10 mpc an objecttoobject comparison with a multitude of other spectroscopic samples in the same field shows that our deimos sample is among the best in terms of fraction of spectroscopic failures and relative redshift accuracy we have determined the fraction of spectroscopic blends to about 08 in our sample this is likely a lower limit and at any rate well below the most pessimistic expectations interestingly we find evidence for strong lensing of lyalpha background emitters within the slits of 12 of our target galaxies increasing their apparent density by about a factor of 4 | [['we', 'present', 'a', 'catalog', 'of', '10718', 'objects', 'in', 'the', 'cosmos', 'field', 'observed', 'through', 'multislit', 'spectroscopy', 'with', 'the', 'deep', 'imaging', 'multiobject', 'spectrograph', 'deimos', 'on', 'the', 'keck', 'ii', 'telescope', 'in', 'the', 'wavelength', 'range', '55009800a', 'the', 'catalog', 'contains', '6617', 'objects', 'with', 'highquality', 'spectra', 'two', 'or', 'more', 'spectral', 'features', 'and', '1798', 'objects', 'with', 'a', 'single', 'spectroscopic', 'feature', 'confirmed', 'by', 'the', 'photometric', 'redshift', 'for', '2024', 'typically', 'faint', 'objects', 'we', 'could', 'not', 'obtain', 'reliable', 'redshifts', 'the', 'objects', 'have', 'been', 'selected', 'from', 'a', 'variety', 'of', 'input', 'catalogs', 'based', 'on', 'multiwavelength', 'observations', 'in', 'the', 'field', 'and', 'thus', 'have', 'a', 'diverse', 'selection', 'function', 'which', 'enables', 'the', 'study', 'of', 'the', 'diversity', 'in', 'the', 'galaxy', 'population', 'the', 'magnitude', 'distribution', 'of', 'our', 'objects', 'is', 'peaked', 'at', 'i_ab23', 'and', 'k_ab21', 'with', 'a', 'secondary', 'peak', 'at', 'k_ab24', 'we', 'sample', 'a', 'broad', 'redshift', 'distribution', 'in', 'the', 'range', '0z6', 'with', 'one', 'peak', 'at', 'z1', 'and', 'another', 'one', 'around', 'z4', 'we', 'have', 'identified', '13', 'redshift', 'spikes', 'at', 'z065', 'with', 'chance', 'probabilities', '4xe4', 'some', 'of', 'which', 'are', 'clearly', 'related', 'to', 'protocluster', 'structures', 'of', 'sizes', '10', 'mpc', 'an', 'objecttoobject', 'comparison', 'with', 'a', 'multitude', 'of', 'other', 'spectroscopic', 'samples', 'in', 'the', 'same', 'field', 'shows', 'that', 'our', 'deimos', 'sample', 'is', 'among', 'the', 'best', 'in', 'terms', 'of', 'fraction', 'of', 'spectroscopic', 'failures', 'and', 'relative', 'redshift', 'accuracy', 'we', 'have', 'determined', 'the', 'fraction', 'of', 'spectroscopic', 'blends', 'to', 'about', '08', 'in', 'our', 'sample', 'this', 'is', 'likely', 'a', 'lower', 'limit', 'and', 'at', 'any', 'rate', 'well', 'below', 'the', 'most', 'pessimistic', 'expectations', 'interestingly', 'we', 'find', 'evidence', 'for', 'strong', 'lensing', 'of', 'lyalpha', 'background', 'emitters', 'within', 'the', 'slits', 'of', '12', 'of', 'our', 'target', 'galaxies', 'increasing', 'their', 'apparent', 'density', 'by', 'about', 'a', 'factor', 'of', '4']] | [-0.057201113366853996, 0.06682400082314952, -0.08757429536027733, 0.0445060778306364, -0.0852728763797371, -0.06898864437898174, 0.07362825584791009, 0.4461305358324402, -0.13499432711640028, -0.3895444643373291, 0.05530049192968236, -0.3295685848899821, -0.026620378678975005, 0.21649300986034578, -0.02119802631881781, -0.01448835256733289, 0.06835683972923114, -0.04361836686021966, -0.023404621703923833, -0.2805488950856275, 0.3025538329736243, 0.08485602767217107, 0.22530302869890592, -0.049281471860125776, 0.10895458719144438, -0.04435454714973818, -0.08777544235399123, 0.013999347427910439, -0.13497175770562322, 0.06259385461633837, 0.2653610221644531, 0.12322330693876761, 0.2664158590699279, -0.2775334159536172, -0.19026296025887943, 0.06330494601604376, 0.18577842616526655, 0.08753152825109761, -0.06341331543915503, -0.2961291750936314, 0.10587062825364883, -0.13591353871145326, -0.14031217688182007, 0.05333414047238121, 0.016040328055775415, 0.06126769648615791, -0.20828765977621655, 0.11737049911681079, -0.030323774994538453, 0.1314137576097377, -0.09594129527604944, -0.12401539798060707, -0.046353650302355456, 0.09870939267178376, -0.011653905094586775, 0.05712121029523411, 0.11884221219811444, -0.1831628917706291, -0.03989344521320981, 0.3601516452527699, -0.06722802530465172, -0.016686067359701122, 0.21555104508884107, -0.2361559462498931, -0.18050501541635688, 0.17238313306841363, 0.1646446174420344, 0.1353366211383394, -0.15697975706511227, 0.00806449788266995, -0.012426381877915891, 0.25334876675119034, 0.02724343293812126, 0.10416617707261146, 0.28190885972260504, 0.1208532289123567, 0.03495589641911923, 0.09625016901859347, -0.23859712454425389, 0.005064369483432162, -0.2591290780119309, -0.1022612082008489, -0.147376493212646, 0.06924946970301148, -0.1413844467169838, -0.11999175926785945, 0.37013312335876936, 0.13768742224490343, 0.24720669932421585, 0.10215823798776107, 0.26429341433483156, 0.07219932856518313, 0.13879525069735743, 0.03896294913323264, 0.3083963461172661, 0.10903086586514228, 0.07011726045712122, -0.1594459580919929, 0.04199688193251112, -0.04039535292175187] |
1,803.09252 | Investigation of a sample of carbon-enhanced metal-poor stars observed
with FORS and GMOS | Carbon-enhanced metal-poor (CEMP) stars represent a sizeable fraction of all
known metal-poor stars in the Galaxy. Their formation and composition remains a
significant topic of investigation within the stellar astrophysics community.
We analysed a sample of low-resolution spectra of 30 dwarf stars, obtained
using the the visual and near UV FOcal Reducer and low dispersion Spectrograph
for the Very Large Telescope (FORS/VLT) of the European Southern Observatory
(ESO) and the Gemini Multi-Object Spectrographs (GMOS) at the GEMINI telescope,
to derive their metallicity and carbon abundance. We derived C and Ca from all
spectra, and Fe and Ba from the majority of the stars. We have extended the
population statistics of CEMP stars and have confirmed that in general, stars
with a high C abundance belonging to the high C band show a high Ba-content
(CEMP-s or -r/s), while stars with a normal C-abundance or that are C-rich, but
belong to the low C band, are normal in Ba (CEMP-no).
| astro-ph.SR | carbonenhanced metalpoor cemp stars represent a sizeable fraction of all known metalpoor stars in the galaxy their formation and composition remains a significant topic of investigation within the stellar astrophysics community we analysed a sample of lowresolution spectra of 30 dwarf stars obtained using the the visual and near uv focal reducer and low dispersion spectrograph for the very large telescope forsvlt of the european southern observatory eso and the gemini multiobject spectrographs gmos at the gemini telescope to derive their metallicity and carbon abundance we derived c and ca from all spectra and fe and ba from the majority of the stars we have extended the population statistics of cemp stars and have confirmed that in general stars with a high c abundance belonging to the high c band show a high bacontent cemps or rs while stars with a normal cabundance or that are crich but belong to the low c band are normal in ba cempno | [['carbonenhanced', 'metalpoor', 'cemp', 'stars', 'represent', 'a', 'sizeable', 'fraction', 'of', 'all', 'known', 'metalpoor', 'stars', 'in', 'the', 'galaxy', 'their', 'formation', 'and', 'composition', 'remains', 'a', 'significant', 'topic', 'of', 'investigation', 'within', 'the', 'stellar', 'astrophysics', 'community', 'we', 'analysed', 'a', 'sample', 'of', 'lowresolution', 'spectra', 'of', '30', 'dwarf', 'stars', 'obtained', 'using', 'the', 'the', 'visual', 'and', 'near', 'uv', 'focal', 'reducer', 'and', 'low', 'dispersion', 'spectrograph', 'for', 'the', 'very', 'large', 'telescope', 'forsvlt', 'of', 'the', 'european', 'southern', 'observatory', 'eso', 'and', 'the', 'gemini', 'multiobject', 'spectrographs', 'gmos', 'at', 'the', 'gemini', 'telescope', 'to', 'derive', 'their', 'metallicity', 'and', 'carbon', 'abundance', 'we', 'derived', 'c', 'and', 'ca', 'from', 'all', 'spectra', 'and', 'fe', 'and', 'ba', 'from', 'the', 'majority', 'of', 'the', 'stars', 'we', 'have', 'extended', 'the', 'population', 'statistics', 'of', 'cemp', 'stars', 'and', 'have', 'confirmed', 'that', 'in', 'general', 'stars', 'with', 'a', 'high', 'c', 'abundance', 'belonging', 'to', 'the', 'high', 'c', 'band', 'show', 'a', 'high', 'bacontent', 'cemps', 'or', 'rs', 'while', 'stars', 'with', 'a', 'normal', 'cabundance', 'or', 'that', 'are', 'crich', 'but', 'belong', 'to', 'the', 'low', 'c', 'band', 'are', 'normal', 'in', 'ba', 'cempno']] | [-0.032911278650010374, 0.12141997149439564, -0.04491563743146457, 0.06446036619614738, -0.1168838128844976, -0.09966970349596754, 0.10873308545868297, 0.43229476341111644, -0.13338227269453276, -0.3723225304560297, 0.015687860387590992, -0.32362792829561765, -0.012189807768489953, 0.18592382451537165, -0.07024075676520966, -0.0709418128733968, 0.15276110652911293, -0.06800569859659596, -0.021930630632474496, -0.3059669745504666, 0.2829775437727499, 0.06783513541802004, 0.18352096403243057, -0.10691151409083681, 0.03447641318984282, -0.15172572791332434, -0.07518397112655792, -0.010945007579466388, -0.12159038756228464, 0.06462738435762892, 0.30845762470553206, 0.1380319403348028, 0.19698091529926676, -0.29140876732434995, -0.14693676860130667, 0.014112072601576282, 0.1863880531126811, 0.016381849908525016, -0.12156901524511943, -0.2658266772866059, 0.09954487147650556, -0.15419268933166363, -0.18547524985186992, 0.06737526802636779, 0.025125350616279112, 0.08054443866950252, -0.22332079175883418, 0.04990317215653623, -0.018567755118392076, 0.19494406106009796, -0.1434905148837211, -0.2068684211788272, -0.12183147123540236, 0.10001130595767668, -0.026404214629927165, -0.0033533727512161018, 0.06499612408320889, -0.1493622463338884, 0.06476741595561528, 0.442957563159667, -0.1541561777733124, 0.0759406800479717, 0.22874674465949202, -0.27664031217669605, -0.22998844221409315, 0.10565624375097976, 0.1842700826466843, 0.1976603296701055, -0.18206488535069165, 0.08387649217086612, -0.022708801591211254, 0.17088484287167052, 0.07191633204870211, 0.09448677901993136, 0.3205709773691217, 0.10580076388777442, -0.008176850779337963, 0.02329486321693488, -0.3100628330829037, -0.005249989094438067, -0.18359941895680418, -0.17298198685533467, -0.08361819260872332, 0.03942396031146881, -0.1303375231799674, -0.16910534914120273, 0.3233349896451328, 0.04724712649087427, 0.19385951720578537, 0.025809816265727873, 0.2653671127245732, 0.0746043083386994, 0.161628902335147, 0.0942050180854691, 0.30590517077428897, 0.2151136628091098, 0.12894826178412266, -0.2628606817370672, 0.0763246662926617, -0.03340754125290995] |
1,803.09253 | Boundary behavior for random walks in cones | We study the asymptotic behavior of zero-drift random walks confined to
multidimensional convex cones, when the endpoint is close to the boundary. We
derive a local limit theorem in the fluctuation regime.
| math.PR | we study the asymptotic behavior of zerodrift random walks confined to multidimensional convex cones when the endpoint is close to the boundary we derive a local limit theorem in the fluctuation regime | [['we', 'study', 'the', 'asymptotic', 'behavior', 'of', 'zerodrift', 'random', 'walks', 'confined', 'to', 'multidimensional', 'convex', 'cones', 'when', 'the', 'endpoint', 'is', 'close', 'to', 'the', 'boundary', 'we', 'derive', 'a', 'local', 'limit', 'theorem', 'in', 'the', 'fluctuation', 'regime']] | [-0.15826872999969055, 0.13414045347599313, -0.15178323100553825, 0.11024267229731777, -0.030351280060131103, -0.1289947406767169, 0.1250041747407522, 0.3155820998363197, -0.286679987788375, -0.1294770439271815, 0.13163272263409453, -0.30520191992400214, -0.14004581957124174, 0.13562033727794187, -0.09817328261851799, 0.08929231873480603, 0.007091196763212793, 0.021744592202594504, -0.07833491644123569, -0.1979982685588766, 0.29416809196118265, -0.019324251712532714, 0.292548420955427, 0.0629801998147741, 0.037086793017806485, 0.06416524841915816, 0.04335479051223956, 0.042858274304308, -0.21707856954890303, 0.07605451704876032, 0.20049105386715382, -0.05488630587933585, 0.27497913998377044, -0.3953957441262901, -0.17103474168106914, 0.1726450523128733, 0.1518400243949145, 0.09218212464475073, 0.040839332817995455, -0.28655474120751023, 0.0814558713518636, -0.05487376597011462, -0.2637740846257657, -0.012242335476912558, -0.02342489914735779, 0.05211215249437373, -0.30612136679701507, 0.1122410055832006, 0.1275504981749691, 0.01918265771382721, -0.036159363080514595, -0.011042668134905398, 0.036057496268767864, 0.12791312799981824, 0.07795118074136553, -0.004236319808114786, 0.12295038302545436, -0.09999867072656343, -0.07618285115313483, 0.33442949544405565, -0.06874060769041535, -0.20899930404993938, 0.19428511676960625, -0.27519429140374996, -0.12310745622380637, 0.09403858717996627, 0.21024732029763982, 0.1667642919201171, -0.16959830047062496, 0.1500243266345933, -0.08896477147573023, 0.049231854383833706, 0.06897690493497066, 0.04318239536951296, 0.17429772243485786, 0.1357346402000985, 0.13098112063016742, 0.2600919120013714, -0.08690647431649268, -0.1826094522839412, -0.32827225492656, -0.12229568848852068, -0.21748638903954998, 0.10510849984711967, -0.17919207486556843, -0.25574168644379824, 0.32496734568849206, 0.1340445341920713, 0.19483287440380082, 0.13468581991037354, 0.2142361826263368, 0.1976877676206641, -0.06693043824634515, 0.11598589851928409, 0.21419971049181186, 0.20308299927273765, 0.08382208866532892, -0.18246191930370514, -0.001782393708708696, 0.18277413767646067] |
1,803.09254 | A theory of the phenomenology of multipopulation genetic algorithm with
an application to the Ising model | Genetic algorithm (GA) is a stochastic metaheuristic process consisting on
the evolution of a population of candidate solutions for a given optimization
problem. By extension, multipopulation genetic algorithm (MPGA) aims for
efficiency by evolving many populations, or islands, in parallel and performing
migrations between them periodically. The connectivity between islands
constrains the directions of migration and characterizes MPGA as a dynamic
process over a network. As such, predicting the evolution of the quality of the
solutions is a difficult challenge, implying in the waste of computer resources
and energy when the parameters are inadequate. By using models derived from
statistical mechanics, this work aims to estimate equations for the study of
dynamics in relation to the connectivity in MPGA. To illustrate the importance
of understanding MPGA, we show its application as an efficient alternative to
the thermalization phase of Metropolis-Hastings algorithm applied to the Ising
model.
| cs.NE cond-mat.stat-mech | genetic algorithm ga is a stochastic metaheuristic process consisting on the evolution of a population of candidate solutions for a given optimization problem by extension multipopulation genetic algorithm mpga aims for efficiency by evolving many populations or islands in parallel and performing migrations between them periodically the connectivity between islands constrains the directions of migration and characterizes mpga as a dynamic process over a network as such predicting the evolution of the quality of the solutions is a difficult challenge implying in the waste of computer resources and energy when the parameters are inadequate by using models derived from statistical mechanics this work aims to estimate equations for the study of dynamics in relation to the connectivity in mpga to illustrate the importance of understanding mpga we show its application as an efficient alternative to the thermalization phase of metropolishastings algorithm applied to the ising model | [['genetic', 'algorithm', 'ga', 'is', 'a', 'stochastic', 'metaheuristic', 'process', 'consisting', 'on', 'the', 'evolution', 'of', 'a', 'population', 'of', 'candidate', 'solutions', 'for', 'a', 'given', 'optimization', 'problem', 'by', 'extension', 'multipopulation', 'genetic', 'algorithm', 'mpga', 'aims', 'for', 'efficiency', 'by', 'evolving', 'many', 'populations', 'or', 'islands', 'in', 'parallel', 'and', 'performing', 'migrations', 'between', 'them', 'periodically', 'the', 'connectivity', 'between', 'islands', 'constrains', 'the', 'directions', 'of', 'migration', 'and', 'characterizes', 'mpga', 'as', 'a', 'dynamic', 'process', 'over', 'a', 'network', 'as', 'such', 'predicting', 'the', 'evolution', 'of', 'the', 'quality', 'of', 'the', 'solutions', 'is', 'a', 'difficult', 'challenge', 'implying', 'in', 'the', 'waste', 'of', 'computer', 'resources', 'and', 'energy', 'when', 'the', 'parameters', 'are', 'inadequate', 'by', 'using', 'models', 'derived', 'from', 'statistical', 'mechanics', 'this', 'work', 'aims', 'to', 'estimate', 'equations', 'for', 'the', 'study', 'of', 'dynamics', 'in', 'relation', 'to', 'the', 'connectivity', 'in', 'mpga', 'to', 'illustrate', 'the', 'importance', 'of', 'understanding', 'mpga', 'we', 'show', 'its', 'application', 'as', 'an', 'efficient', 'alternative', 'to', 'the', 'thermalization', 'phase', 'of', 'metropolishastings', 'algorithm', 'applied', 'to', 'the', 'ising', 'model']] | [-0.10479155818179045, 0.05915481111519948, -0.08300558740451727, 0.09023935175736532, -0.03416895363097117, -0.10627664346885804, 0.07539110517205849, 0.35721494284241573, -0.2990518470505278, -0.3543886193393232, 0.09036647634619005, -0.2281105674975488, -0.17771071858412255, 0.18568693946932174, -0.044912557922979844, 0.06093766126894928, 0.06925636554321861, -0.009539677043866417, -0.015781115418402096, -0.21775122807195332, 0.27704166586683066, 0.09289495585775737, 0.28655286181290723, -0.006774258133253618, 0.10185089998891296, 0.0039088808794263494, -0.012314627049108073, 0.01666959401854786, -0.11037270015277836, 0.13101698800663095, 0.25365262813436057, 0.17985451624294974, 0.3289502623095496, -0.4325960687974034, -0.20922159453956027, 0.1003805151630244, 0.16181321202259835, 0.10618069821853854, -0.052436668292638426, -0.23767276323234585, 0.06089671683331875, -0.14422584245657574, -0.1124604337191694, -0.04399866016249951, 0.021033199644354107, 0.046877796422013986, -0.27328726524257496, 0.07192310715598144, 0.04872733784507807, 0.055417157837176975, -0.07906879159089254, -0.07144443639426505, -0.0003369576552857275, 0.12767551377298444, 0.04512987397523431, 0.006316251936368644, 0.12001517641179468, -0.15457640548255805, -0.15552605977537085, 0.3914718296289546, -0.04116132731983208, -0.19757771230468604, 0.20687111127923868, -0.04992735516343725, -0.1301373818742545, 0.1010539017566671, 0.20695843559064686, 0.11374842333734954, -0.19024274396051874, 0.07950314020376002, 0.029566923417916446, 0.12666324953778252, -0.010429103750327271, -0.04189458599135484, 0.21230698692969568, 0.24914844838538755, 0.08968275402033102, 0.16070007245145637, -0.06517537902384415, -0.1546965920021885, -0.21379718910073478, -0.16570454345990535, -0.17444330476198908, 0.0342562766207465, -0.09717730784197481, -0.1685339235700667, 0.4181960503752535, 0.17362453694110863, 0.1889029718004167, 0.04808020651059812, 0.2801590289869537, 0.07149462781173548, 0.038968796510096285, 0.08142764224792026, 0.16444779885135438, 0.12109998418241484, 0.10675822734459597, -0.2581853538461361, 0.121871095897043, 0.060561458809837085] |
1,803.09255 | Improvement of heat exchanger efficiency by using hydraulic and thermal
entrance regions | This study investigates one of the possible approaches of improvement of heat
exchangers efficiency. Literature review shows that most approaches of
improvement are based on the heat transfer surface increasing and
laminar-to-turbulent flow transition using different types of riffles forming
and shaped inserts. In this article, a novel approach to the heat transfer
intensification was employed. The main hypothesis is that applying of
multi-chamber design of heat exchanger - ordinary shell-and-tube regions
intersperse with common for all tubes regions - will help to improve the
utilization of the entrance hydraulic and thermal regions thereby receive
higher heat transfer coefficients and higher heat capacity of the heat exchange
device. To prove the hypotheses we take the following steps. Firstly,
development of the new geometry of the heat-exchanger design - multi chambers
construction. Secondly, proving of the higher efficiency of novel design
comparing to ordinary design by analytical calculations. Thirdly, numerical
simulation of the heat exchange process and fluids flow in both types of heat
exchangers that proves the analytical solution.
| physics.app-ph physics.comp-ph | this study investigates one of the possible approaches of improvement of heat exchangers efficiency literature review shows that most approaches of improvement are based on the heat transfer surface increasing and laminartoturbulent flow transition using different types of riffles forming and shaped inserts in this article a novel approach to the heat transfer intensification was employed the main hypothesis is that applying of multichamber design of heat exchanger ordinary shellandtube regions intersperse with common for all tubes regions will help to improve the utilization of the entrance hydraulic and thermal regions thereby receive higher heat transfer coefficients and higher heat capacity of the heat exchange device to prove the hypotheses we take the following steps firstly development of the new geometry of the heatexchanger design multi chambers construction secondly proving of the higher efficiency of novel design comparing to ordinary design by analytical calculations thirdly numerical simulation of the heat exchange process and fluids flow in both types of heat exchangers that proves the analytical solution | [['this', 'study', 'investigates', 'one', 'of', 'the', 'possible', 'approaches', 'of', 'improvement', 'of', 'heat', 'exchangers', 'efficiency', 'literature', 'review', 'shows', 'that', 'most', 'approaches', 'of', 'improvement', 'are', 'based', 'on', 'the', 'heat', 'transfer', 'surface', 'increasing', 'and', 'laminartoturbulent', 'flow', 'transition', 'using', 'different', 'types', 'of', 'riffles', 'forming', 'and', 'shaped', 'inserts', 'in', 'this', 'article', 'a', 'novel', 'approach', 'to', 'the', 'heat', 'transfer', 'intensification', 'was', 'employed', 'the', 'main', 'hypothesis', 'is', 'that', 'applying', 'of', 'multichamber', 'design', 'of', 'heat', 'exchanger', 'ordinary', 'shellandtube', 'regions', 'intersperse', 'with', 'common', 'for', 'all', 'tubes', 'regions', 'will', 'help', 'to', 'improve', 'the', 'utilization', 'of', 'the', 'entrance', 'hydraulic', 'and', 'thermal', 'regions', 'thereby', 'receive', 'higher', 'heat', 'transfer', 'coefficients', 'and', 'higher', 'heat', 'capacity', 'of', 'the', 'heat', 'exchange', 'device', 'to', 'prove', 'the', 'hypotheses', 'we', 'take', 'the', 'following', 'steps', 'firstly', 'development', 'of', 'the', 'new', 'geometry', 'of', 'the', 'heatexchanger', 'design', 'multi', 'chambers', 'construction', 'secondly', 'proving', 'of', 'the', 'higher', 'efficiency', 'of', 'novel', 'design', 'comparing', 'to', 'ordinary', 'design', 'by', 'analytical', 'calculations', 'thirdly', 'numerical', 'simulation', 'of', 'the', 'heat', 'exchange', 'process', 'and', 'fluids', 'flow', 'in', 'both', 'types', 'of', 'heat', 'exchangers', 'that', 'proves', 'the', 'analytical', 'solution']] | [-0.11364059368158445, 0.060321270122529906, -0.03638183202257414, -0.007311734061223862, -0.07223395759131233, -0.12910998724629544, 0.06692269505601536, 0.3398615458203148, -0.251904726100577, -0.29902874081869796, 0.10343440636375383, -0.2895284652112886, -0.12120558146995841, 0.25064738508009643, -0.05679510719502813, 0.05085855486239964, 0.056565056280718624, -0.013566777380069067, -0.07436321201724246, -0.2143313243722349, 0.3186244201257916, 0.09639517538980838, 0.35224581586962644, 0.08566825533217173, 0.08918547502038943, -0.04053572317345376, -0.05015202674249107, 0.006813073683632938, -0.1586593573882535, 0.16811624747855258, 0.24099619515051643, 0.06852665018615958, 0.24076917108742554, -0.4601031914467643, -0.2716498917104045, 0.05932750992199829, 0.11333436562045494, 0.052976182353414274, -0.051460123625926765, -0.17026941630806477, 0.07999613015923901, -0.16699873104097288, -0.08611481855737697, -0.06880373347756322, -0.030578009989912523, 0.055157470168328726, -0.26140984495747493, 0.0620437643799268, 0.09106406638901567, 0.022037881119003552, -0.06714903515552176, -0.1438555647504796, 0.0015650532591196657, 0.17166102014801984, 0.04018462130330657, -0.031055881131863212, 0.15868507452206287, -0.14065174900418137, -0.11365366665692143, 0.29741442574908034, -0.0501481450099978, -0.18056126158474517, 0.19340387360618502, -0.12526094227846415, -0.06198674210410085, 0.14699219473233402, 0.17774241256379048, 0.1183477184946643, -0.1883326857593596, -0.0065469806646054, 0.033655270489869764, 0.10889927019576537, 0.08207213072294792, -0.029558310028811218, 0.18902563170009962, 0.21479603488203938, 0.05087610244168186, 0.22365986050158007, -0.08073677326855393, -0.1172849223924018, -0.29231146602188607, -0.2332416318110233, -0.13627816955744648, 0.0400420398339972, -0.0765875166197603, -0.1385281137162191, 0.37264739300347177, 0.18165035435409954, 0.14356075044709937, 0.0007060981052784831, 0.33594334614891674, 0.11404142759031861, 0.04645755165577952, 0.10092997457546417, 0.20350735119766802, 0.15362464765406733, 0.1900435353834982, -0.2810651831531703, 0.045456918847798566, 0.06602355667269943] |
1,803.09256 | Detecting Heads using Feature Refine Net and Cascaded Multi-Scale
Architecture | This paper presents a method that can accurately detect heads especially
small heads under the indoor scene. To achieve this, we propose a novel method,
Feature Refine Net (FRN), and a cascaded multi-scale architecture. FRN exploits
the multi-scale hierarchical features created by deep convolutional neural
networks. The proposed channel weighting method enables FRN to make use of
features alternatively and effectively. To improve the performance of small
head detection, we propose a cascaded multi-scale architecture which has two
detectors. One called global detector is responsible for detecting large
objects and acquiring the global distribution information. The other called
local detector is designed for small objects detection and makes use of the
information provided by global detector. Due to the lack of head detection
datasets, we have collected and labeled a new large dataset named SCUT-HEAD
which includes 4405 images with 111251 heads annotated. Experiments show that
our method has achieved state-of-the-art performance on SCUT-HEAD.
| cs.CV | this paper presents a method that can accurately detect heads especially small heads under the indoor scene to achieve this we propose a novel method feature refine net frn and a cascaded multiscale architecture frn exploits the multiscale hierarchical features created by deep convolutional neural networks the proposed channel weighting method enables frn to make use of features alternatively and effectively to improve the performance of small head detection we propose a cascaded multiscale architecture which has two detectors one called global detector is responsible for detecting large objects and acquiring the global distribution information the other called local detector is designed for small objects detection and makes use of the information provided by global detector due to the lack of head detection datasets we have collected and labeled a new large dataset named scuthead which includes 4405 images with 111251 heads annotated experiments show that our method has achieved stateoftheart performance on scuthead | [['this', 'paper', 'presents', 'a', 'method', 'that', 'can', 'accurately', 'detect', 'heads', 'especially', 'small', 'heads', 'under', 'the', 'indoor', 'scene', 'to', 'achieve', 'this', 'we', 'propose', 'a', 'novel', 'method', 'feature', 'refine', 'net', 'frn', 'and', 'a', 'cascaded', 'multiscale', 'architecture', 'frn', 'exploits', 'the', 'multiscale', 'hierarchical', 'features', 'created', 'by', 'deep', 'convolutional', 'neural', 'networks', 'the', 'proposed', 'channel', 'weighting', 'method', 'enables', 'frn', 'to', 'make', 'use', 'of', 'features', 'alternatively', 'and', 'effectively', 'to', 'improve', 'the', 'performance', 'of', 'small', 'head', 'detection', 'we', 'propose', 'a', 'cascaded', 'multiscale', 'architecture', 'which', 'has', 'two', 'detectors', 'one', 'called', 'global', 'detector', 'is', 'responsible', 'for', 'detecting', 'large', 'objects', 'and', 'acquiring', 'the', 'global', 'distribution', 'information', 'the', 'other', 'called', 'local', 'detector', 'is', 'designed', 'for', 'small', 'objects', 'detection', 'and', 'makes', 'use', 'of', 'the', 'information', 'provided', 'by', 'global', 'detector', 'due', 'to', 'the', 'lack', 'of', 'head', 'detection', 'datasets', 'we', 'have', 'collected', 'and', 'labeled', 'a', 'new', 'large', 'dataset', 'named', 'scuthead', 'which', 'includes', '4405', 'images', 'with', '111251', 'heads', 'annotated', 'experiments', 'show', 'that', 'our', 'method', 'has', 'achieved', 'stateoftheart', 'performance', 'on', 'scuthead']] | [-0.07651957832080225, 0.006065887042833184, -0.08054266669571597, 0.021698441282408127, -0.11830498051323884, -0.18675308608887903, 0.0037827130309953695, 0.41633009600965, -0.2471852815426294, -0.34717301188641236, 0.07071727351748094, -0.26411887007882656, -0.1915258816474222, 0.14843725821231524, -0.1314281374246918, 0.07267936202234879, 0.15916494967181558, 0.024314425577292378, -0.029022942477565827, -0.19747209942141017, 0.29415869819684975, 0.0827118320564434, 0.3803860234306348, 0.03273841068040678, 0.20804640607883698, -0.02598068407360489, -0.08013549293021345, 0.0035016013445048934, -0.022670350263118033, 0.19479741963298855, 0.2754887391609565, 0.1953448230903349, 0.2996124817761562, -0.4162015962562468, -0.22974490376793785, 0.08997611605272388, 0.14376738964000235, 0.09963135198554693, -0.07266900053676464, -0.3716424810175864, 0.1492415666626458, -0.19463491058655527, -0.028769797254053087, -0.14290468320127156, -0.04296469248273095, -0.02210147266233007, -0.303017649929107, 0.041584096959983274, 0.038468905026093125, 0.022092453642002005, -0.01746477216593181, -0.07728031996193509, 0.05738344835888422, 0.15804057129479895, -0.05310430294920425, 0.008770915147669565, 0.13887582363141393, -0.1769734676865651, -0.10975196387692793, 0.3298315752717043, -0.06076279363675129, -0.19669727248753366, 0.21193103362622653, -0.04209847356630674, -0.13883812648447735, 0.13807522726942176, 0.24986616877949988, 0.13955891701556272, -0.18165024208361344, -0.036826056020029065, -0.04622541545020626, 0.19736460218859825, 0.04053804267117667, 0.017552841701452306, 0.18098732244704438, 0.27902272187438576, 0.06454850471345708, 0.19134569754292077, -0.28376106641316323, -0.0024636965059977494, -0.2011491542817741, -0.0951485675482067, -0.19733281703110758, -0.061716338207124924, -0.05146738470773697, -0.13766937805894788, 0.41902918472812073, 0.2428689404107038, 0.221360299969092, 0.09494624479784822, 0.3536010034881927, 0.007051801289715465, 0.18799207706793847, 0.08676714183676322, 0.19984092118082852, -0.0015169482813864354, 0.10711078650459943, -0.16626357672418413, 0.09621274347312206, 0.08108452629816058] |
1,803.09257 | DEFenD: A Secure and Privacy-Preserving Decentralized System for Freight
Declaration | Millions of shipping containers filled with goods move around the world every
day. Before such a container may enter a trade bloc, the customs agency of the
goods' destination country must ensure that it does not contain illegal or
mislabeled goods. Due to the high volume of containers, customs agencies make a
selection of containers to audit through a risk analysis procedure. Customs
agencies perform risk analysis using data sourced from a centralized system
that is potentially vulnerable to manipulation and malpractice. Therefore we
propose an alternative: DEFenD, a decentralized system that stores data about
goods and containers in a secure and privacy-preserving manner. In our system,
economic operators make claims to the network about goods they insert into or
remove from containers, and encrypt these claims so that they can only be read
by the destination country's customs agency. Economic operators also make
unencrypted claims about containers with which they interact. Unencrypted
claims can be validated by the entire network of customs agencies. Our key
contribution is a data partitioning scheme and several protocols that enable
such a system to utilize blockchain and its powerful validation principle,
while also preserving the privacy of the involved economic operators. Using our
protocol, customs agencies can improve their risk analysis and economic
operators can get through customs with less delay. We also present a reference
implementation built with Hyperledger Fabric and analyze to what extent our
implementation meets the requirements in terms of privacy-preservation,
security, scalability, and decentralization.
| cs.CR | millions of shipping containers filled with goods move around the world every day before such a container may enter a trade bloc the customs agency of the goods destination country must ensure that it does not contain illegal or mislabeled goods due to the high volume of containers customs agencies make a selection of containers to audit through a risk analysis procedure customs agencies perform risk analysis using data sourced from a centralized system that is potentially vulnerable to manipulation and malpractice therefore we propose an alternative defend a decentralized system that stores data about goods and containers in a secure and privacypreserving manner in our system economic operators make claims to the network about goods they insert into or remove from containers and encrypt these claims so that they can only be read by the destination countrys customs agency economic operators also make unencrypted claims about containers with which they interact unencrypted claims can be validated by the entire network of customs agencies our key contribution is a data partitioning scheme and several protocols that enable such a system to utilize blockchain and its powerful validation principle while also preserving the privacy of the involved economic operators using our protocol customs agencies can improve their risk analysis and economic operators can get through customs with less delay we also present a reference implementation built with hyperledger fabric and analyze to what extent our implementation meets the requirements in terms of privacypreservation security scalability and decentralization | [['millions', 'of', 'shipping', 'containers', 'filled', 'with', 'goods', 'move', 'around', 'the', 'world', 'every', 'day', 'before', 'such', 'a', 'container', 'may', 'enter', 'a', 'trade', 'bloc', 'the', 'customs', 'agency', 'of', 'the', 'goods', 'destination', 'country', 'must', 'ensure', 'that', 'it', 'does', 'not', 'contain', 'illegal', 'or', 'mislabeled', 'goods', 'due', 'to', 'the', 'high', 'volume', 'of', 'containers', 'customs', 'agencies', 'make', 'a', 'selection', 'of', 'containers', 'to', 'audit', 'through', 'a', 'risk', 'analysis', 'procedure', 'customs', 'agencies', 'perform', 'risk', 'analysis', 'using', 'data', 'sourced', 'from', 'a', 'centralized', 'system', 'that', 'is', 'potentially', 'vulnerable', 'to', 'manipulation', 'and', 'malpractice', 'therefore', 'we', 'propose', 'an', 'alternative', 'defend', 'a', 'decentralized', 'system', 'that', 'stores', 'data', 'about', 'goods', 'and', 'containers', 'in', 'a', 'secure', 'and', 'privacypreserving', 'manner', 'in', 'our', 'system', 'economic', 'operators', 'make', 'claims', 'to', 'the', 'network', 'about', 'goods', 'they', 'insert', 'into', 'or', 'remove', 'from', 'containers', 'and', 'encrypt', 'these', 'claims', 'so', 'that', 'they', 'can', 'only', 'be', 'read', 'by', 'the', 'destination', 'countrys', 'customs', 'agency', 'economic', 'operators', 'also', 'make', 'unencrypted', 'claims', 'about', 'containers', 'with', 'which', 'they', 'interact', 'unencrypted', 'claims', 'can', 'be', 'validated', 'by', 'the', 'entire', 'network', 'of', 'customs', 'agencies', 'our', 'key', 'contribution', 'is', 'a', 'data', 'partitioning', 'scheme', 'and', 'several', 'protocols', 'that', 'enable', 'such', 'a', 'system', 'to', 'utilize', 'blockchain', 'and', 'its', 'powerful', 'validation', 'principle', 'while', 'also', 'preserving', 'the', 'privacy', 'of', 'the', 'involved', 'economic', 'operators', 'using', 'our', 'protocol', 'customs', 'agencies', 'can', 'improve', 'their', 'risk', 'analysis', 'and', 'economic', 'operators', 'can', 'get', 'through', 'customs', 'with', 'less', 'delay', 'we', 'also', 'present', 'a', 'reference', 'implementation', 'built', 'with', 'hyperledger', 'fabric', 'and', 'analyze', 'to', 'what', 'extent', 'our', 'implementation', 'meets', 'the', 'requirements', 'in', 'terms', 'of', 'privacypreservation', 'security', 'scalability', 'and', 'decentralization']] | [-0.1166832656997097, 0.04078585102855336, -0.10431688242356248, 0.08045183818094523, -0.12177962130238491, -0.1824138059330029, 0.17074940763167826, 0.3689232958505324, -0.2585839891420087, -0.3060649816340547, 0.17583515290199303, -0.3339423528679351, -0.10641743798126899, 0.15178495822133634, -0.17827455630162503, 0.01051262964857023, 0.06397690388801833, -0.01566073678744336, 0.08175763992613515, -0.32948144907093935, 0.2788846533058393, 0.07664172775093163, 0.3158830026310407, 0.06260116186704699, 0.09294527111910056, 0.012755687357062792, -0.06570452226837434, 0.00882374086299896, -0.049929845640683077, 0.15769258286681867, 0.31743993645162905, 0.2641770186762106, 0.37375436419984553, -0.4865531989658863, -0.1382328961574571, 0.104431113224416, 0.12241800158943345, 0.052429566249285436, -0.013548306072115655, -0.3200895521804933, 0.06992442127387229, -0.28137334293084376, -0.12827949913888714, -0.13570987730006862, -0.04041985650920703, 0.02081324406819062, -0.2411848238832128, -0.023655229493596105, -0.02299528291384591, 0.05205055558486137, -0.0405202885617396, -0.047191282522266474, -0.07536934471568017, 0.20036722501461599, 0.05271574852200664, -0.01722712790814978, 0.2091788789425405, -0.10377816138486189, -0.13579971749052533, 0.3966098078905143, 0.02088618875155604, -0.17600687603135895, 0.1505069855526771, -0.048252024820331876, -0.1293234518318384, 0.07606502799828332, 0.2211304511799197, 0.040932368248491925, -0.20767629230243526, 0.004047922038793094, -0.03104655666710294, 0.21636187685894917, 0.08199265684811323, 0.03781901241840446, 0.18889688522123346, 0.1471387286432943, 0.1296487464437004, 0.1069618049141576, -0.0026814840824865714, -0.10391915267015375, -0.2351740975267958, -0.1737892147157402, -0.132735601084958, 0.04541182804648524, -0.07275717068463328, -0.12333733289089902, 0.3091494060094473, 0.19689610702547858, 0.09969978350426668, 0.043409743503860496, 0.3770707405846172, -0.011262102292735145, 0.14140944783216175, 0.1520675581376394, 0.1712943393532641, -0.03610745922859183, 0.1857381347818603, -0.09950034795243792, 0.16481913421568045, -0.02505351739322267] |
1,803.09258 | Evolutionary n-level Hypergraph Partitioning with Adaptive Coarsening | Hypergraph partitioning is an NP-hard problem that occurs in many computer
science applications where it is necessary to reduce large problems into a
number of smaller, computationally tractable sub-problems. Current techniques
use a multilevel approach wherein an initial partitioning is performed after
compressing the hypergraph to a predetermined level. This level is typically
chosen to produce very coarse hypergraphs in which heuristic algorithms are
fast and effective. This article presents a novel memetic algorithm which
remains effective on larger initial hypergraphs. This enables the exploitation
of information that can be lost during coarsening and results in improved final
solution quality. We use this algorithm to present an empirical analysis of the
space of possible initial hypergraphs in terms of its searchability at
different levels of coarsening. We find that the best results arise at
coarsening levels unique to each hypergraph. Based on this, we introduce an
adaptive scheme that stops coarsening when the rate of information loss in a
hypergraph becomes non-linear and show that this produces further improvements.
The results show that we have identified a valuable role for evolutionary
algorithms within the current state-of-the-art hypergraph partitioning
framework.
| cs.NE cs.DC | hypergraph partitioning is an nphard problem that occurs in many computer science applications where it is necessary to reduce large problems into a number of smaller computationally tractable subproblems current techniques use a multilevel approach wherein an initial partitioning is performed after compressing the hypergraph to a predetermined level this level is typically chosen to produce very coarse hypergraphs in which heuristic algorithms are fast and effective this article presents a novel memetic algorithm which remains effective on larger initial hypergraphs this enables the exploitation of information that can be lost during coarsening and results in improved final solution quality we use this algorithm to present an empirical analysis of the space of possible initial hypergraphs in terms of its searchability at different levels of coarsening we find that the best results arise at coarsening levels unique to each hypergraph based on this we introduce an adaptive scheme that stops coarsening when the rate of information loss in a hypergraph becomes nonlinear and show that this produces further improvements the results show that we have identified a valuable role for evolutionary algorithms within the current stateoftheart hypergraph partitioning framework | [['hypergraph', 'partitioning', 'is', 'an', 'nphard', 'problem', 'that', 'occurs', 'in', 'many', 'computer', 'science', 'applications', 'where', 'it', 'is', 'necessary', 'to', 'reduce', 'large', 'problems', 'into', 'a', 'number', 'of', 'smaller', 'computationally', 'tractable', 'subproblems', 'current', 'techniques', 'use', 'a', 'multilevel', 'approach', 'wherein', 'an', 'initial', 'partitioning', 'is', 'performed', 'after', 'compressing', 'the', 'hypergraph', 'to', 'a', 'predetermined', 'level', 'this', 'level', 'is', 'typically', 'chosen', 'to', 'produce', 'very', 'coarse', 'hypergraphs', 'in', 'which', 'heuristic', 'algorithms', 'are', 'fast', 'and', 'effective', 'this', 'article', 'presents', 'a', 'novel', 'memetic', 'algorithm', 'which', 'remains', 'effective', 'on', 'larger', 'initial', 'hypergraphs', 'this', 'enables', 'the', 'exploitation', 'of', 'information', 'that', 'can', 'be', 'lost', 'during', 'coarsening', 'and', 'results', 'in', 'improved', 'final', 'solution', 'quality', 'we', 'use', 'this', 'algorithm', 'to', 'present', 'an', 'empirical', 'analysis', 'of', 'the', 'space', 'of', 'possible', 'initial', 'hypergraphs', 'in', 'terms', 'of', 'its', 'searchability', 'at', 'different', 'levels', 'of', 'coarsening', 'we', 'find', 'that', 'the', 'best', 'results', 'arise', 'at', 'coarsening', 'levels', 'unique', 'to', 'each', 'hypergraph', 'based', 'on', 'this', 'we', 'introduce', 'an', 'adaptive', 'scheme', 'that', 'stops', 'coarsening', 'when', 'the', 'rate', 'of', 'information', 'loss', 'in', 'a', 'hypergraph', 'becomes', 'nonlinear', 'and', 'show', 'that', 'this', 'produces', 'further', 'improvements', 'the', 'results', 'show', 'that', 'we', 'have', 'identified', 'a', 'valuable', 'role', 'for', 'evolutionary', 'algorithms', 'within', 'the', 'current', 'stateoftheart', 'hypergraph', 'partitioning', 'framework']] | [-0.09196218496518672, 0.0810194380714425, -0.11778583175443585, 0.06628797569671872, -0.07278315190265261, -0.13746922019938076, 0.05414553102667606, 0.40410480472855465, -0.29738528053793645, -0.3321209589127826, 0.0951044599974661, -0.1911237074441656, -0.16079382199754633, 0.1588124077466548, -0.10779668411816515, 0.043940196446667884, 0.1510455396627544, 0.005015406112073275, -0.03924527272327049, -0.29983126075578626, 0.2837497733691067, 0.06404261606025988, 0.2911793755517691, 0.0689018719051053, 0.09654996676922396, -0.0021471371751022404, -0.0020628278907487, 0.07481264167021166, -0.1602291258620363, 0.13764443673826657, 0.28342650501579836, 0.2039358098079603, 0.34711726145848393, -0.4272389062803495, -0.17498155251803202, 0.11510494470635735, 0.18109036349844207, 0.16325201675672793, -0.05002086513636328, -0.21514432045025011, 0.1267080207000531, -0.13453389004996372, -0.05523241629759983, -0.09051633305064151, 0.010885430105700694, -0.02269517198554856, -0.3184011384466584, 0.02846608052575941, 0.062287464679992466, 0.0031380192549140366, -0.01377196291217669, -0.13849380414036136, 0.022761345052569316, 0.10015579854540413, -0.014573970381336818, 0.044070123788770094, 0.1056497683305116, -0.13908496708609164, -0.13494814157722487, 0.3579605147735309, -0.02238054622812246, -0.18596856578354226, 0.17889390212592113, -0.036352797768635564, -0.20022389852742434, 0.15429709202526187, 0.19122040711057486, 0.14460033910945255, -0.11945429796554091, 0.052098452190255065, -0.04659443511011661, 0.18896961431191475, 0.05012496241378209, 0.030853704153929674, 0.1442318160022811, 0.24972836809631968, 0.14922977482287766, 0.17436950088899938, -0.03389440045972902, -0.08961197063751844, -0.2482814873376536, -0.11121369945624518, -0.20089650163106698, -0.005127849385620307, -0.13324178672476028, -0.17711505263294808, 0.39607421450862257, 0.20952939089367945, 0.20158559623021613, 0.05281314732403391, 0.3276928308020745, 0.09970366746610987, 0.030287909761278167, 0.12130240557306303, 0.18113702599996473, 0.05906199507301959, 0.08851789508665366, -0.19038054583379851, 0.0725933447302807, 0.07458491924726379] |
1,803.09259 | Dynamics on the Wandering Components of the Fatou Set of Three
Transcendental Entire Functions and Their Composites | We prove that there exist three transcendental entire functions that have
infinite number of domains which lie in the wandering component of each of
these functions and their composites. This result is a generalization of the
result of Dinesh Kumar, Gopal Datt and Sanjay Kumar. In particular, they proved
that there exist two transcendental entire functions that have infinite number
of domains which lie in the wandering components of each of these functions and
their composites.
| math.DS | we prove that there exist three transcendental entire functions that have infinite number of domains which lie in the wandering component of each of these functions and their composites this result is a generalization of the result of dinesh kumar gopal datt and sanjay kumar in particular they proved that there exist two transcendental entire functions that have infinite number of domains which lie in the wandering components of each of these functions and their composites | [['we', 'prove', 'that', 'there', 'exist', 'three', 'transcendental', 'entire', 'functions', 'that', 'have', 'infinite', 'number', 'of', 'domains', 'which', 'lie', 'in', 'the', 'wandering', 'component', 'of', 'each', 'of', 'these', 'functions', 'and', 'their', 'composites', 'this', 'result', 'is', 'a', 'generalization', 'of', 'the', 'result', 'of', 'dinesh', 'kumar', 'gopal', 'datt', 'and', 'sanjay', 'kumar', 'in', 'particular', 'they', 'proved', 'that', 'there', 'exist', 'two', 'transcendental', 'entire', 'functions', 'that', 'have', 'infinite', 'number', 'of', 'domains', 'which', 'lie', 'in', 'the', 'wandering', 'components', 'of', 'each', 'of', 'these', 'functions', 'and', 'their', 'composites']] | [-0.1817557768151164, 0.12690032583350935, -0.08735678264250359, 0.03345845684409141, -0.04116837690273921, -0.06552869221195579, 0.01850198951860269, 0.3588486549258232, -0.2476928231950539, -0.24431953263779482, 0.11978092073579319, -0.24564231678843498, -0.19182539471735557, 0.23855224582056203, -0.017283638752996922, 0.016980668231844902, 0.017994674493869146, 0.0069393309454123175, -0.034624538218292096, -0.3270802827179432, 0.37012179609388113, -0.14238096992174784, 0.19326875880360603, 0.07114476015170415, 0.10101583708698551, -0.005330964991201957, -0.01560608807951212, 0.008652194952592254, -0.11156913034811926, 0.12172400339196125, 0.30368047900497913, 0.14632030326562623, 0.29490162048488855, -0.36876237702866393, -0.18634434880067904, 0.19757576086868842, 0.16300377858181794, -0.0038639244468261797, -0.03331824177565674, -0.19639400601387025, 0.1225277991220355, -0.16789359984919427, -0.13894839297359188, -0.050453700497746466, 0.0671615111331145, 0.13229307542244592, -0.18475791407128175, 0.04386309334387382, 0.16069488999744255, 0.06430883554217871, -0.09316468096027772, -0.13733926193167767, -0.06242279766748349, 0.1402777677339812, 0.058589211165284115, 0.03810382322097818, 0.0517580831112961, -0.10802735052692393, -0.12838637235263983, 0.2893354435265064, 0.005619038186656932, -0.25081630401313304, 0.21609014675642052, -0.18528223352506756, -0.17342980017264684, 0.11540543050815662, 0.11234470418343942, 0.13502044829229515, -0.07485722563229501, 0.12994151327526196, -0.15283518974979718, 0.10274927401915193, 0.14997512305776278, 0.04088822769622008, 0.13871906588474908, 0.04283488056001564, 0.0735708425588867, 0.11851540471116702, 0.05958168563743432, -0.04326817700639367, -0.3029178734868765, -0.16546308015162747, -0.1885506585923334, 0.05860481171558301, -0.09590164371397501, -0.26124145853022734, 0.4246920455247164, 0.10193716662625472, 0.19534234588344893, 0.06449645267489056, 0.17804874181747438, 0.10293472188214461, 0.10362531662608186, 0.08398016885543863, 0.20965370499528946, 0.14918073657900094, 0.03034952811896801, -0.12160486788178483, 0.006688153383632501, 0.06888365321482222] |
1,803.0926 | Depleted Fully Monolithic Active CMOS Pixel Sensors (DMAPS) in High
Resistivity 150~nm Technology for LHC | Depleted monolithic CMOS active pixel sensors (DMAPS) have been developed in
order to demonstrate their suitability as pixel detectors in the outer layers
of a toroidal LHC apparatus inner tracker (ATLAS ITk) pixel detector in the
high-luminosity large hadron collider (HL-LHC). Two prototypes have been
fabricated using 150 nm CMOS technology on high resistivity (> 2 k$\Omega$
$cm^2$) wafers. The chip size is equivalent to that of the current ATLAS pixel
detector readout chip. One of the prototypes is used for detailed
characterization of the sensor and the analog readout of the DMAPS. The other
is a fully monolithic DMAPS including fast readout digital logic that handles
the required hit rate. In order to yield a strong homogeneous electric field
within the sensor volume, thinning of the wafer was tested. The prototypes were
irradiated with X-ray up to a total ionization dose (TID) of 50 Mrad and with
neutrons up to non-ionizing energy loss (NIEL) of $10^{15}$ $n_{eq}/cm^2$. The
analog readout circuitry maintained its performance after TID irradiation, and
the hit-efficiency at > $10^7$ noise occupancy was as high as 98.9 % after NIEL
irradiation.
| physics.ins-det | depleted monolithic cmos active pixel sensors dmaps have been developed in order to demonstrate their suitability as pixel detectors in the outer layers of a toroidal lhc apparatus inner tracker atlas itk pixel detector in the highluminosity large hadron collider hllhc two prototypes have been fabricated using 150 nm cmos technology on high resistivity 2 komega cm2 wafers the chip size is equivalent to that of the current atlas pixel detector readout chip one of the prototypes is used for detailed characterization of the sensor and the analog readout of the dmaps the other is a fully monolithic dmaps including fast readout digital logic that handles the required hit rate in order to yield a strong homogeneous electric field within the sensor volume thinning of the wafer was tested the prototypes were irradiated with xray up to a total ionization dose tid of 50 mrad and with neutrons up to nonionizing energy loss niel of 1015 n_eqcm2 the analog readout circuitry maintained its performance after tid irradiation and the hitefficiency at 107 noise occupancy was as high as 989 after niel irradiation | [['depleted', 'monolithic', 'cmos', 'active', 'pixel', 'sensors', 'dmaps', 'have', 'been', 'developed', 'in', 'order', 'to', 'demonstrate', 'their', 'suitability', 'as', 'pixel', 'detectors', 'in', 'the', 'outer', 'layers', 'of', 'a', 'toroidal', 'lhc', 'apparatus', 'inner', 'tracker', 'atlas', 'itk', 'pixel', 'detector', 'in', 'the', 'highluminosity', 'large', 'hadron', 'collider', 'hllhc', 'two', 'prototypes', 'have', 'been', 'fabricated', 'using', '150', 'nm', 'cmos', 'technology', 'on', 'high', 'resistivity', '2', 'komega', 'cm2', 'wafers', 'the', 'chip', 'size', 'is', 'equivalent', 'to', 'that', 'of', 'the', 'current', 'atlas', 'pixel', 'detector', 'readout', 'chip', 'one', 'of', 'the', 'prototypes', 'is', 'used', 'for', 'detailed', 'characterization', 'of', 'the', 'sensor', 'and', 'the', 'analog', 'readout', 'of', 'the', 'dmaps', 'the', 'other', 'is', 'a', 'fully', 'monolithic', 'dmaps', 'including', 'fast', 'readout', 'digital', 'logic', 'that', 'handles', 'the', 'required', 'hit', 'rate', 'in', 'order', 'to', 'yield', 'a', 'strong', 'homogeneous', 'electric', 'field', 'within', 'the', 'sensor', 'volume', 'thinning', 'of', 'the', 'wafer', 'was', 'tested', 'the', 'prototypes', 'were', 'irradiated', 'with', 'xray', 'up', 'to', 'a', 'total', 'ionization', 'dose', 'tid', 'of', '50', 'mrad', 'and', 'with', 'neutrons', 'up', 'to', 'nonionizing', 'energy', 'loss', 'niel', 'of', '1015', 'n_eqcm2', 'the', 'analog', 'readout', 'circuitry', 'maintained', 'its', 'performance', 'after', 'tid', 'irradiation', 'and', 'the', 'hitefficiency', 'at', '107', 'noise', 'occupancy', 'was', 'as', 'high', 'as', '989', 'after', 'niel', 'irradiation']] | [-0.024288441756873995, 0.15517890012246757, 0.021859703184162055, -0.052567367209764765, 0.03603835733998464, -0.17488838871683698, -0.026908756627377062, 0.448253795450543, -0.16219710285945163, -0.40519770310203757, 0.09481860141756106, -0.332238615176625, 0.038926660968248025, 0.21146014428733545, -0.09556461744993225, 0.1530831334440331, 0.05093612004771252, -0.04696275304117914, -0.06778685849942061, -0.24272682860388178, 0.14569838878503122, 0.17883437162635651, 0.30783072685776536, 0.030662440720595707, 0.19565897728239304, -0.0632728337373286, 0.0029941603145176203, -0.026678648769587938, -0.06586751456088477, 0.05712557353323083, 0.28981067248856784, 0.043876255389035404, 0.21332922488327513, -0.4810239766204719, -0.13320456312979617, 0.025892431021909853, 0.06973321803392668, -0.020174952208460696, -0.09301947311495652, -0.2609206278157518, 0.14821817369575904, -0.23041541286800776, -0.0857273813450287, 0.04349576905421213, -0.0019948651778732957, 0.016548555843449757, -0.23187061342235799, -0.012205702738929026, 0.009147624337263611, 0.039641451524076624, -0.020261160250449585, -0.14003279355987494, -0.020332705628291512, 0.057882261786671635, -0.09345981621476744, 0.05239734616521643, 0.31048780385126973, -0.12150114156223463, -0.10553246584479074, 0.24938699936504521, -0.0064536968029994335, -0.09901314161368002, 0.15884082491164872, -0.20273873010825222, -0.03171837247794916, 0.24054981983596077, 0.19277745585255737, 0.05659014464340569, -0.21134815491653608, 0.05113211950159874, 0.09338945333038082, 0.254271024301679, 0.1291588946574918, 0.06122297042973072, 0.20296253145476856, 0.33090907832522726, 0.06464602386589208, 0.1522183706745948, -0.2535893935845259, 0.039433139833642265, -0.315673804940342, -0.15918199594894125, -0.144508958439142, 0.043097164693484034, -0.045598352734190516, -0.1271897476650157, 0.3767461182333488, 0.1371534929960678, 0.14281988832636516, -0.02456438995239155, 0.3707036287189353, 0.05293046086524917, 0.19216795871629205, -0.024249099633410105, 0.31085724179833635, 0.16113135479622165, 0.17639268294667557, -0.19161200912113593, 0.04647679807288953, 0.0018377288512226955] |
1,803.09261 | Some remarks on the model of rigid heat conductor with memory: unbounded
heat relaxation function | The model of rigid linear heat conductor with memory is reconsidered
focussing the interest on the heat relaxation function. Thus, the definitions
of heat flux and thermal work are revised to understand where changes are
required when the heat flux relaxation function $k$ is assumed to be unbounded
at the initial time $t=0$. That is, it is represented by a regular integrable
function, namely $k\in L^1(\R^+)$, but its time derivative is not integrable,
that is $\dot k\notin L^1(\R^+)$. Notably, also under these relaxed assumptions
on $k$, whenever the heat flux is the same also the related thermal work is the
same. Thus, also in the case under investigation, the notion of equivalence is
introduced and its physical relevance is pointed out.
| math-ph math.MP | the model of rigid linear heat conductor with memory is reconsidered focussing the interest on the heat relaxation function thus the definitions of heat flux and thermal work are revised to understand where changes are required when the heat flux relaxation function k is assumed to be unbounded at the initial time t0 that is it is represented by a regular integrable function namely kin l1r but its time derivative is not integrable that is dot knotin l1r notably also under these relaxed assumptions on k whenever the heat flux is the same also the related thermal work is the same thus also in the case under investigation the notion of equivalence is introduced and its physical relevance is pointed out | [['the', 'model', 'of', 'rigid', 'linear', 'heat', 'conductor', 'with', 'memory', 'is', 'reconsidered', 'focussing', 'the', 'interest', 'on', 'the', 'heat', 'relaxation', 'function', 'thus', 'the', 'definitions', 'of', 'heat', 'flux', 'and', 'thermal', 'work', 'are', 'revised', 'to', 'understand', 'where', 'changes', 'are', 'required', 'when', 'the', 'heat', 'flux', 'relaxation', 'function', 'k', 'is', 'assumed', 'to', 'be', 'unbounded', 'at', 'the', 'initial', 'time', 't0', 'that', 'is', 'it', 'is', 'represented', 'by', 'a', 'regular', 'integrable', 'function', 'namely', 'kin', 'l1r', 'but', 'its', 'time', 'derivative', 'is', 'not', 'integrable', 'that', 'is', 'dot', 'knotin', 'l1r', 'notably', 'also', 'under', 'these', 'relaxed', 'assumptions', 'on', 'k', 'whenever', 'the', 'heat', 'flux', 'is', 'the', 'same', 'also', 'the', 'related', 'thermal', 'work', 'is', 'the', 'same', 'thus', 'also', 'in', 'the', 'case', 'under', 'investigation', 'the', 'notion', 'of', 'equivalence', 'is', 'introduced', 'and', 'its', 'physical', 'relevance', 'is', 'pointed', 'out']] | [-0.11751596109118036, 0.15393853271457036, -0.06681203796655279, 0.06453759176464181, -0.0911409728640829, -0.14623404527852726, 0.018601529525346622, 0.36524305575765853, -0.30041299916588327, -0.2335852809742955, 0.135132289431943, -0.27390668334146917, -0.09663781790786292, 0.20924011819364796, -0.04616937842912787, 0.03791944378090268, 0.01717045100421206, 0.09421689560529121, -0.06916845825593149, -0.25627632031586667, 0.32069842205652277, 0.06395988034715583, 0.2483908489292626, 0.10042724190645443, 0.0756714608412513, -0.03852981532161886, -0.002325686260534466, 0.01939445172151751, -0.15291083275885534, 0.022640707944522224, 0.21047630676737994, 0.03963854713827249, 0.24898264690664065, -0.3968944519080899, -0.22544119432414614, 0.12618221753577064, 0.06037753152137638, 0.027872609082332328, 0.03547402133218452, -0.20187176461331546, 0.0722791758897014, -0.08153165457770228, -0.11237949060953477, -0.04828870012078527, 0.07643795491019187, 0.021013616849783777, -0.2649818753923697, 0.1002287053676757, 0.12983416250237256, 0.014182367077297416, -0.09230422484014984, -0.09617971408003864, -0.054361969838688566, 0.06517699591296894, 0.06659161205084087, 0.07034089632547838, 0.1542775159055167, -0.08569995559798169, -0.025973363213764488, 0.3532284686326488, -0.053817315500475894, -0.24163154608085136, 0.16812929123724726, -0.1514011535000764, -0.11236577978827182, 0.11351474676711938, 0.06500628221133524, 0.1146232540534486, -0.19208945248197584, 0.14205770708585913, -0.05685666273540455, 0.13117873919973813, 0.05209931614231472, 0.03203771170613564, 0.18792457146231423, 0.1472462852031362, 0.08857322511963608, 0.1741573450854048, -0.037724338144772065, -0.12005660839548166, -0.33004476962811197, -0.1628299660303376, -0.22196132353841797, 0.1129681644058057, -0.048890715206863576, -0.1326731374662385, 0.35733467342008735, 0.12958505442019644, 0.163536593094776, 0.04842632436693823, 0.26141777375428205, 0.20788768198040952, 0.05579142680599485, 0.10657387681705646, 0.1934527765501537, 0.15641516909264952, 0.12360536558399639, -0.26840506310089807, 0.09149925358793583, 0.04870721550796889] |
1,803.09262 | On the pro-$p$-Iwahori invariants of supersingular representations of
unramified $U(2, 1)$ | Let $G$ be the unramified unitary group $U(2, 1)(E/F)$ over a non-archimedean
local field $F$ of odd residue characteristic $p$. In this paper, for any
supersingular representation of $G$ that contains the Steinberg weight, we
prove its pro-$p$-Iwahori invariants, as a right module over the
pro-$p$-Iwahori--Hecke algebra of $G$, is \emph{not} simple.
| math.RT math.NT | let g be the unramified unitary group u2 1ef over a nonarchimedean local field f of odd residue characteristic p in this paper for any supersingular representation of g that contains the steinberg weight we prove its propiwahori invariants as a right module over the propiwahorihecke algebra of g is emphnot simple | [['let', 'g', 'be', 'the', 'unramified', 'unitary', 'group', 'u2', '1ef', 'over', 'a', 'nonarchimedean', 'local', 'field', 'f', 'of', 'odd', 'residue', 'characteristic', 'p', 'in', 'this', 'paper', 'for', 'any', 'supersingular', 'representation', 'of', 'g', 'that', 'contains', 'the', 'steinberg', 'weight', 'we', 'prove', 'its', 'propiwahori', 'invariants', 'as', 'a', 'right', 'module', 'over', 'the', 'propiwahorihecke', 'algebra', 'of', 'g', 'is', 'emphnot', 'simple']] | [-0.2858551883210356, 0.07705163425886824, -0.18946866524549058, -0.025486444329054884, -0.12725776996320257, -0.17430442364778942, -0.06282601973641878, 0.3117545754290544, -0.3850247208387233, -0.15565911021370155, -0.0011346334112414087, -0.20178153014813477, -0.10910161423425262, 0.19480117579671338, -0.15733678692665237, -0.12534112352631593, 0.0036496449835025347, 0.2736523855620852, -0.08782337836545104, -0.3186476235277951, 0.34998592655532634, -0.07447990929134764, 0.13616813314953247, 0.01962061380394376, 0.09542652789073494, 0.08715763230485699, 0.04631964052812411, -0.07058278980772369, -0.13511924945837214, 0.05605754518406824, 0.4195142698724969, 0.04930020411624215, 0.2568389562030251, -0.3510567454549556, -0.12400147815843901, 0.3285104530111242, 0.1416270655239574, -0.0988793650892778, 0.032703971942492686, -0.2525890580727719, 0.1928426324694346, -0.24472667910875037, -0.13213927750117505, -0.05443495829016543, 0.17280829960453467, -0.05591493930954199, -0.3000392818536896, -0.011968935141339898, 0.11412945131842907, 0.2516726419652024, -0.056269949823707484, -0.14940090712088233, -0.0840615222338014, 0.017033679840656426, -0.07926597099196023, 0.14944514790057348, 0.11077293767952003, -0.12638737014080667, -0.07552576695497219, 0.36345081862348777, -0.1152730960972034, -0.16001117654377595, 0.0412315485210946, -0.20936183251727086, -0.12668336440737432, 0.10030681720504966, 0.04293123689086105, 0.18890582884733492, 0.046638717086842425, 0.325101699321889, -0.20600429728913766, 0.043686477646518215, 0.07147409141851732, -0.057327170310040504, 0.09537497868474859, -0.00746737429066203, 0.10305593476200905, 0.09501015955286746, 0.04914340806695131, 0.1308854787897032, -0.4346227150123853, -0.19537228567955586, -0.1407905545157309, 0.20995881858470966, -0.11481182158100776, -0.15105999452778354, 0.5034508160673655, 0.06271029609398773, 0.13654643286561344, 0.16768835780497354, 0.15872317579431602, 0.07687097481371333, 0.09926639353104222, 0.10894025681437387, -0.02896091664353242, 0.29260260241034514, -0.1485781005019537, -0.1757190566456232, -0.048466828398187105, 0.22713354015006468] |
1,803.09263 | P2P-NET: Bidirectional Point Displacement Net for Shape Transform | We introduce P2P-NET, a general-purpose deep neural network which learns
geometric transformations between point-based shape representations from two
domains, e.g., meso-skeletons and surfaces, partial and complete scans, etc.
The architecture of the P2P-NET is that of a bi-directional point displacement
network, which transforms a source point set to a target point set with the
same cardinality, and vice versa, by applying point-wise displacement vectors
learned from data. P2P-NET is trained on paired shapes from the source and
target domains, but without relying on point-to-point correspondences between
the source and target point sets. The training loss combines two
uni-directional geometric losses, each enforcing a shape-wise similarity
between the predicted and the target point sets, and a cross-regularization
term to encourage consistency between displacement vectors going in opposite
directions. We develop and present several different applications enabled by
our general-purpose bidirectional P2P-NET to highlight the effectiveness,
versatility, and potential of our network in solving a variety of point-based
shape transformation problems.
| cs.GR cs.CV | we introduce p2pnet a generalpurpose deep neural network which learns geometric transformations between pointbased shape representations from two domains eg mesoskeletons and surfaces partial and complete scans etc the architecture of the p2pnet is that of a bidirectional point displacement network which transforms a source point set to a target point set with the same cardinality and vice versa by applying pointwise displacement vectors learned from data p2pnet is trained on paired shapes from the source and target domains but without relying on pointtopoint correspondences between the source and target point sets the training loss combines two unidirectional geometric losses each enforcing a shapewise similarity between the predicted and the target point sets and a crossregularization term to encourage consistency between displacement vectors going in opposite directions we develop and present several different applications enabled by our generalpurpose bidirectional p2pnet to highlight the effectiveness versatility and potential of our network in solving a variety of pointbased shape transformation problems | [['we', 'introduce', 'p2pnet', 'a', 'generalpurpose', 'deep', 'neural', 'network', 'which', 'learns', 'geometric', 'transformations', 'between', 'pointbased', 'shape', 'representations', 'from', 'two', 'domains', 'eg', 'mesoskeletons', 'and', 'surfaces', 'partial', 'and', 'complete', 'scans', 'etc', 'the', 'architecture', 'of', 'the', 'p2pnet', 'is', 'that', 'of', 'a', 'bidirectional', 'point', 'displacement', 'network', 'which', 'transforms', 'a', 'source', 'point', 'set', 'to', 'a', 'target', 'point', 'set', 'with', 'the', 'same', 'cardinality', 'and', 'vice', 'versa', 'by', 'applying', 'pointwise', 'displacement', 'vectors', 'learned', 'from', 'data', 'p2pnet', 'is', 'trained', 'on', 'paired', 'shapes', 'from', 'the', 'source', 'and', 'target', 'domains', 'but', 'without', 'relying', 'on', 'pointtopoint', 'correspondences', 'between', 'the', 'source', 'and', 'target', 'point', 'sets', 'the', 'training', 'loss', 'combines', 'two', 'unidirectional', 'geometric', 'losses', 'each', 'enforcing', 'a', 'shapewise', 'similarity', 'between', 'the', 'predicted', 'and', 'the', 'target', 'point', 'sets', 'and', 'a', 'crossregularization', 'term', 'to', 'encourage', 'consistency', 'between', 'displacement', 'vectors', 'going', 'in', 'opposite', 'directions', 'we', 'develop', 'and', 'present', 'several', 'different', 'applications', 'enabled', 'by', 'our', 'generalpurpose', 'bidirectional', 'p2pnet', 'to', 'highlight', 'the', 'effectiveness', 'versatility', 'and', 'potential', 'of', 'our', 'network', 'in', 'solving', 'a', 'variety', 'of', 'pointbased', 'shape', 'transformation', 'problems']] | [-0.07180868083711975, 0.02354755887322745, -0.0705113379005936, 0.05263252436942688, -0.11820870141386036, -0.14669938894228973, 0.0860619785569632, 0.4499018618831067, -0.341986714891947, -0.2867506193530977, 0.05410822045063944, -0.2850153069456766, -0.1701355619522132, 0.18091549112752175, -0.07747413875285987, 0.0745425982382979, 0.09064938555987682, 0.017954634235590506, -0.13285606951974807, -0.18753474241324292, 0.3587081272534694, -0.02015731488017122, 0.35615487512984095, 0.011892726165865352, 0.175427315158289, 0.02752666698270448, -0.01853045000795536, 0.008538125567049215, -0.028093129782249728, 0.18831986864245717, 0.24280011694237685, 0.18041933469391266, 0.27767780653177315, -0.42906520601100984, -0.214415461847308, 0.10177831513403802, 0.08668123210131881, 0.0939194432898739, -0.04749999198377441, -0.32886516980850583, 0.06786561499284521, -0.10708772642745572, -0.031124341107347304, -0.09343418233084735, -0.016302507243914067, 0.057129807125148216, -0.28138399625083604, 0.004110730506822128, 0.07778636744589942, 0.0764182942406316, -0.052349960249047846, -0.10361755401441816, -0.030541969526998083, 0.1632636235493004, 0.00953326112098375, 0.08595105035788124, 0.11663144991205186, -0.14952939647326993, -0.13017885734113585, 0.34950040003794963, -0.024404827114765586, -0.2543702778305597, 0.21397002856988626, -0.03972353978723193, -0.07829460535779785, 0.0980125572072686, 0.20551359539504524, 0.09382483066255405, -0.15082683920516235, 0.019508709885983782, -0.019556298134195956, 0.16484439130194017, 0.10175199979607752, -0.01207032125549996, 0.2078474310507025, 0.17632523357607188, 0.07185706211799744, 0.17875830587118294, -0.15550014639130919, -0.07833046047165278, -0.3031112663388537, -0.08482961862638688, -0.18149938953559916, -0.02871940034340806, -0.11372121156700872, -0.13466885444933585, 0.39953855219872514, 0.15065021247597069, 0.2534247482059061, 0.09511676719738467, 0.29003690461076465, 0.01853755898021049, 0.0752893132654428, 0.1026211280381651, 0.16146242908041947, 0.05307546156239073, 0.10104682109360198, -0.15700678822323444, 0.04798318233317251, 0.09502192940800243] |
1,803.09264 | Searching for H$_{\alpha}$ emitting sources around MWC758: SPHERE/ZIMPOL
high-contrast imaging | MWC758 is a young star surrounded by a transitional disk. Recently, a
protoplanet candidate has been detected around MWC758 through high-resolution
$L'$-band observations. The candidate is located inside the disk cavity at a
separation of $\sim$111 mas from the central star, and at an average position
angle of $\sim$165.5 degrees. We have performed simultaneous adaptive optics
observations of MWC758 in the H$_{\alpha}$ line and the adjacent continuum
using SPHERE/ZIMPOL at the Very Large Telescope (VLT). We aim at detecting
accreting protoplanet candidates through spectral angular differential imaging
observations. The data analysis does not reveal any H$_{\alpha}$ signal around
the target. The derived contrast curve in the B_Ha filter allows us to derive a
5$\sigma$ upper limit of $\sim$7.6 mag at 111 mas, the separation of the
previously detected planet candidate. This contrast translates into a
H$_{\alpha}$ line luminosity of $L_{\rm H_{\alpha}}\lesssim$ 5$\times$10$^{-5}$
$L_{\odot}$ at 111 mas, and an accretion luminosity of $L_{acc}
<$3.7$\times$10$^{-4}\,L_{\odot}$. For the predicted mass range of MWC758b,
0.5-5 $M_{\rm Jup}$, this implies accretion rates of $\dot M \lesssim$
3.4$\times$(10$^{-8}$-10$^{-9})\,M_{\odot}/yr$, for an average planet radius of
1.1 $R_{\rm Jup}$. Therefore, our estimates are consistent with the predictions
of accreting circumplanetary accretion models for $R_{\rm in} = 1 R_{\rm Jup}$.
In any case, the non-detection of any H$_{\alpha}$ emitting source in the
ZIMPOL images does not allow us to unveil the true nature of the $L'$ detected
source.
| astro-ph.SR astro-ph.EP | mwc758 is a young star surrounded by a transitional disk recently a protoplanet candidate has been detected around mwc758 through highresolution lband observations the candidate is located inside the disk cavity at a separation of sim111 mas from the central star and at an average position angle of sim1655 degrees we have performed simultaneous adaptive optics observations of mwc758 in the h_alpha line and the adjacent continuum using spherezimpol at the very large telescope vlt we aim at detecting accreting protoplanet candidates through spectral angular differential imaging observations the data analysis does not reveal any h_alpha signal around the target the derived contrast curve in the b_ha filter allows us to derive a 5sigma upper limit of sim76 mag at 111 mas the separation of the previously detected planet candidate this contrast translates into a h_alpha line luminosity of l_rm h_alphalesssim 5times105 l_odot at 111 mas and an accretion luminosity of l_acc 37times104l_odot for the predicted mass range of mwc758b 055 m_rm jup this implies accretion rates of dot m lesssim 34times108109m_odotyr for an average planet radius of 11 r_rm jup therefore our estimates are consistent with the predictions of accreting circumplanetary accretion models for r_rm in 1 r_rm jup in any case the nondetection of any h_alpha emitting source in the zimpol images does not allow us to unveil the true nature of the l detected source | [['mwc758', 'is', 'a', 'young', 'star', 'surrounded', 'by', 'a', 'transitional', 'disk', 'recently', 'a', 'protoplanet', 'candidate', 'has', 'been', 'detected', 'around', 'mwc758', 'through', 'highresolution', 'lband', 'observations', 'the', 'candidate', 'is', 'located', 'inside', 'the', 'disk', 'cavity', 'at', 'a', 'separation', 'of', 'sim111', 'mas', 'from', 'the', 'central', 'star', 'and', 'at', 'an', 'average', 'position', 'angle', 'of', 'sim1655', 'degrees', 'we', 'have', 'performed', 'simultaneous', 'adaptive', 'optics', 'observations', 'of', 'mwc758', 'in', 'the', 'h_alpha', 'line', 'and', 'the', 'adjacent', 'continuum', 'using', 'spherezimpol', 'at', 'the', 'very', 'large', 'telescope', 'vlt', 'we', 'aim', 'at', 'detecting', 'accreting', 'protoplanet', 'candidates', 'through', 'spectral', 'angular', 'differential', 'imaging', 'observations', 'the', 'data', 'analysis', 'does', 'not', 'reveal', 'any', 'h_alpha', 'signal', 'around', 'the', 'target', 'the', 'derived', 'contrast', 'curve', 'in', 'the', 'b_ha', 'filter', 'allows', 'us', 'to', 'derive', 'a', '5sigma', 'upper', 'limit', 'of', 'sim76', 'mag', 'at', '111', 'mas', 'the', 'separation', 'of', 'the', 'previously', 'detected', 'planet', 'candidate', 'this', 'contrast', 'translates', 'into', 'a', 'h_alpha', 'line', 'luminosity', 'of', 'l_rm', 'h_alphalesssim', '5times105', 'l_odot', 'at', '111', 'mas', 'and', 'an', 'accretion', 'luminosity', 'of', 'l_acc', '37times104l_odot', 'for', 'the', 'predicted', 'mass', 'range', 'of', 'mwc758b', '055', 'm_rm', 'jup', 'this', 'implies', 'accretion', 'rates', 'of', 'dot', 'm', 'lesssim', '34times108109m_odotyr', 'for', 'an', 'average', 'planet', 'radius', 'of', '11', 'r_rm', 'jup', 'therefore', 'our', 'estimates', 'are', 'consistent', 'with', 'the', 'predictions', 'of', 'accreting', 'circumplanetary', 'accretion', 'models', 'for', 'r_rm', 'in', '1', 'r_rm', 'jup', 'in', 'any', 'case', 'the', 'nondetection', 'of', 'any', 'h_alpha', 'emitting', 'source', 'in', 'the', 'zimpol', 'images', 'does', 'not', 'allow', 'us', 'to', 'unveil', 'the', 'true', 'nature', 'of', 'the', 'l', 'detected', 'source']] | [-0.09708569000835891, 0.05662002442513439, -0.06219006041148761, 0.041483047279856494, -0.0953797613992146, -0.12866010619243523, 0.05111880110931239, 0.4068848331173597, -0.1299046978211819, -0.3649600669489922, 0.09631290661038931, -0.3021203633325058, 0.03834219796578861, 0.2005662197574369, -0.05066912702435779, -0.002805913571973105, 0.07747178234454656, -0.057507867272523744, -0.07616771251667996, -0.15971738390365867, 0.23377581115975674, 0.10249989988861254, 0.09908525023068226, 0.005153590830059739, 0.07591637607277392, -0.058121344598738044, -0.04663228348572948, -0.06908802306782957, -0.19608750901403124, 0.01740779280075216, 0.2494577726111193, 0.10488962191828266, 0.214050887121089, -0.30929346964065285, -0.15828516131145293, 0.05105601485004766, 0.18917845592567664, -0.04232568699847655, -0.014335103359216035, -0.2795837162469455, 0.062401397719031186, -0.16383229899283097, -0.1881253519452068, 0.12635985289087837, 0.10831206344903933, -0.030502680624071677, -0.2752186228282045, 0.12406958110508853, 0.042406739955343234, 0.10956639783792009, -0.1249755776959507, -0.08932491155081168, -0.07339305596516325, 0.0450233260047966, -0.03244491211014909, 0.10979502706637455, 0.19041703975138566, -0.10559824145155715, -0.016744973496659786, 0.3571248515509069, -0.11085994107027848, -0.016792517735387896, 0.21406866589389104, -0.2434205587314618, -0.15664935912066433, 0.21140965589464786, 0.15229508587727397, 0.15437097949613524, -0.14417193557328736, 0.02046111686420543, -0.043169749266707115, 0.2754166651420664, 0.07634652595230806, 0.06287218756378032, 0.4042302227772034, 0.12221720548837471, 0.02584196431751086, 0.06301435065950763, -0.3346250579767936, -0.018286712780733266, -0.23756701399798733, -0.10850585216492717, -0.16291846246731276, 0.0907759486495985, -0.14755989088413887, -0.06081545597303088, 0.2825447593622648, 0.12512394286291506, 0.2377077204433295, 0.05231263952724099, 0.2536463359609951, 0.10806857583769555, 0.13704257236630027, 0.14748815799484383, 0.3420097370724286, 0.17123681761697773, 0.10369537284950146, -0.24540812564858547, 0.046863209970209166, 0.0007717732239413906] |
1,803.09265 | Entropy production and rectification efficiency in colloids transport
along a pulsating channel | We study the current rectification of particles moving in a pulsating channel
under the in uence of an applied force. We have shown the existence of diferent
rectification scenarios in which entropic and energetic effects compete. The
effect can be quantified by means of a rectification coefficient that is
analyzed in terms of the force, the frequency and the diffusion coefficient.
The energetic cost of the motion of the particles expressed in terms of the
entropy production depends on the importance of the entropic contribution to
the total force. Rectification is more important at low values of the applied
force when entropic effects become dominant. In this regime, the entropy
production is not invariant under reversal of the applied force. The phenomenon
observed could be used to optimize transport in microfluidic devices or in
biological channels.
| cond-mat.soft | we study the current rectification of particles moving in a pulsating channel under the in uence of an applied force we have shown the existence of diferent rectification scenarios in which entropic and energetic effects compete the effect can be quantified by means of a rectification coefficient that is analyzed in terms of the force the frequency and the diffusion coefficient the energetic cost of the motion of the particles expressed in terms of the entropy production depends on the importance of the entropic contribution to the total force rectification is more important at low values of the applied force when entropic effects become dominant in this regime the entropy production is not invariant under reversal of the applied force the phenomenon observed could be used to optimize transport in microfluidic devices or in biological channels | [['we', 'study', 'the', 'current', 'rectification', 'of', 'particles', 'moving', 'in', 'a', 'pulsating', 'channel', 'under', 'the', 'in', 'uence', 'of', 'an', 'applied', 'force', 'we', 'have', 'shown', 'the', 'existence', 'of', 'diferent', 'rectification', 'scenarios', 'in', 'which', 'entropic', 'and', 'energetic', 'effects', 'compete', 'the', 'effect', 'can', 'be', 'quantified', 'by', 'means', 'of', 'a', 'rectification', 'coefficient', 'that', 'is', 'analyzed', 'in', 'terms', 'of', 'the', 'force', 'the', 'frequency', 'and', 'the', 'diffusion', 'coefficient', 'the', 'energetic', 'cost', 'of', 'the', 'motion', 'of', 'the', 'particles', 'expressed', 'in', 'terms', 'of', 'the', 'entropy', 'production', 'depends', 'on', 'the', 'importance', 'of', 'the', 'entropic', 'contribution', 'to', 'the', 'total', 'force', 'rectification', 'is', 'more', 'important', 'at', 'low', 'values', 'of', 'the', 'applied', 'force', 'when', 'entropic', 'effects', 'become', 'dominant', 'in', 'this', 'regime', 'the', 'entropy', 'production', 'is', 'not', 'invariant', 'under', 'reversal', 'of', 'the', 'applied', 'force', 'the', 'phenomenon', 'observed', 'could', 'be', 'used', 'to', 'optimize', 'transport', 'in', 'microfluidic', 'devices', 'or', 'in', 'biological', 'channels']] | [-0.1569162241591103, 0.19354504885535895, -0.09159565909067169, 0.05586880532791838, -0.016938669536851674, -0.09367963079335716, -0.0015403034213865314, 0.323517472606481, -0.3058380040970138, -0.26333325420615866, 0.03368517439915141, -0.26290460696841095, -0.13585925093845136, 0.22622926135698115, -0.05438391480814008, 0.03833556394634156, 0.013266359876177055, 0.05295525641207967, 0.039302789013377415, -0.20769344173330703, 0.27363734750970786, 0.07932396302182015, 0.3000323473927839, 0.13319893629094998, 0.11526959515108234, 0.004282031229676624, 0.005183507185874452, 0.09044242009986192, -0.13871835731167856, 0.085951816115994, 0.19076860122560688, -0.009766417041913989, 0.2258751918698716, -0.43090153370490847, -0.22663244503714583, 0.1256311034085229, 0.13380773655679898, 0.0881609400787377, -0.06088079989047615, -0.23241793810773423, 0.03339407610131756, -0.1575821937294677, -0.09584160503982275, -0.04041598950382596, 0.039632719828445906, 0.04314153483788045, -0.27986390067278133, 0.1461489215520594, 0.05514127021374674, 0.04630163346540511, -0.07069135728253219, -0.09407753448912819, -0.01341320896822521, 0.12780842212176888, 0.1019494396100259, -0.005363071809851509, 0.21986888355561807, -0.18134318057769527, -0.11333858955528259, 0.40645784197156043, -0.09142746384002427, -0.2578927473825709, 0.1751345216372797, -0.14505802742411, -0.07546326159910463, 0.13437274946858557, 0.18957805194933078, 0.11266866014749907, -0.18011347175139664, 0.02712220746637767, 0.047895586275605154, 0.11918184417299926, 0.08015737911302816, 0.06552272188299171, 0.19661914945840286, 0.15022057146073647, 0.06281612384961643, 0.20199388649609104, -0.1254886464020648, -0.09246170007185463, -0.2861723502385704, -0.16843053573222064, -0.18171791003003498, 0.05672670921205067, -0.06888298710413544, -0.11070615107168766, 0.36151587559759396, 0.16941449521640178, 0.16958786158219857, -0.0401969192085637, 0.2882046154871419, 0.16363831380894064, 0.09924424270181642, 0.03067498718155548, 0.31576593673568876, 0.14055905488545678, 0.11932793785201605, -0.306310411724125, 0.14397229384699398, 0.027528453243362224] |
1,803.09266 | New SOCP relaxation and branching rule for bipartite bilinear programs | A bipartite bilinear program (BBP) is a quadratically constrained quadratic
optimization problem where the variables can be partitioned into two sets such
that fixing the variables in any one of the sets results in a linear program.
We propose a new second order cone representable (SOCP) relaxation for BBP,
which we show is stronger than the standard SDP relaxation intersected with the
boolean quadratic polytope. We then propose a new branching rule inspired by
the construction of the SOCP relaxation. We describe a new application of BBP
called as the finite element model updating problem, which is a fundamental
problem in structural engineering. Our computational experiments on this
problem class show that the new branching rule together with an polyhedral
outer approximation of the SOCP relaxation outperforms a state-of-the-art
commercial global solver in obtaining dual bounds.
| math.OC | a bipartite bilinear program bbp is a quadratically constrained quadratic optimization problem where the variables can be partitioned into two sets such that fixing the variables in any one of the sets results in a linear program we propose a new second order cone representable socp relaxation for bbp which we show is stronger than the standard sdp relaxation intersected with the boolean quadratic polytope we then propose a new branching rule inspired by the construction of the socp relaxation we describe a new application of bbp called as the finite element model updating problem which is a fundamental problem in structural engineering our computational experiments on this problem class show that the new branching rule together with an polyhedral outer approximation of the socp relaxation outperforms a stateoftheart commercial global solver in obtaining dual bounds | [['a', 'bipartite', 'bilinear', 'program', 'bbp', 'is', 'a', 'quadratically', 'constrained', 'quadratic', 'optimization', 'problem', 'where', 'the', 'variables', 'can', 'be', 'partitioned', 'into', 'two', 'sets', 'such', 'that', 'fixing', 'the', 'variables', 'in', 'any', 'one', 'of', 'the', 'sets', 'results', 'in', 'a', 'linear', 'program', 'we', 'propose', 'a', 'new', 'second', 'order', 'cone', 'representable', 'socp', 'relaxation', 'for', 'bbp', 'which', 'we', 'show', 'is', 'stronger', 'than', 'the', 'standard', 'sdp', 'relaxation', 'intersected', 'with', 'the', 'boolean', 'quadratic', 'polytope', 'we', 'then', 'propose', 'a', 'new', 'branching', 'rule', 'inspired', 'by', 'the', 'construction', 'of', 'the', 'socp', 'relaxation', 'we', 'describe', 'a', 'new', 'application', 'of', 'bbp', 'called', 'as', 'the', 'finite', 'element', 'model', 'updating', 'problem', 'which', 'is', 'a', 'fundamental', 'problem', 'in', 'structural', 'engineering', 'our', 'computational', 'experiments', 'on', 'this', 'problem', 'class', 'show', 'that', 'the', 'new', 'branching', 'rule', 'together', 'with', 'an', 'polyhedral', 'outer', 'approximation', 'of', 'the', 'socp', 'relaxation', 'outperforms', 'a', 'stateoftheart', 'commercial', 'global', 'solver', 'in', 'obtaining', 'dual', 'bounds']] | [-0.11293150832181495, 0.04478288955589746, -0.09704636025879368, 0.06653730518711895, -0.1352434237658813, -0.15074024795938065, 0.06520544238361146, 0.30726770444615636, -0.3917698398342027, -0.2432301437263103, 0.12958235520465464, -0.22657696245518952, -0.17113750262925512, 0.19518627098124638, -0.05023808984825497, 0.06750715721521855, 0.06849006200825576, -0.006383641972206533, -0.14085307273233091, -0.2894602888263762, 0.2715511477641378, -0.03273464083288084, 0.21104266976608949, 0.03901740290251944, 0.12856950394651742, 0.02843602333108292, 0.04463052731914692, 0.09194740151082549, -0.09495349350671699, 0.14271072572805946, 0.2698327984921086, 0.1902111649944666, 0.3058053002340089, -0.407436824088697, -0.14222371260428404, 0.11531910619883359, 0.08988004567457691, 0.09617733608362922, -0.03581446135735057, -0.21699119736919836, 0.07782250917550888, -0.12253408578073825, -0.058247324226506275, -0.08091398362782509, -0.04436345116632497, -0.03030237032319693, -0.341927624800626, 0.026906052958699602, 0.09880565318813109, 0.009361671872765702, -0.06456687678719926, -0.1784914268851828, 0.04643674027208951, -0.008963172556832433, -0.00860023521561422, 0.06937772890224177, 0.0767868273807621, -0.05029770297936492, -0.19608702593712438, 0.38991046829751747, -0.07145632560647808, -0.24290666201918878, 0.14337140036086032, -0.0742596871294903, -0.18712177257882157, 0.12528857905828558, 0.2093139978207867, 0.1981597168932614, -0.1517768085348721, 0.12786407742361702, -0.14622916944105835, 0.1692052948398187, 0.02625090935993392, -0.01707581229001174, 0.13874331366027678, 0.22458916921374006, 0.16571279731921523, 0.2164346300320604, 0.002619660635365803, -0.12147793917478446, -0.31256300350651145, -0.1458719354826933, -0.19527115276158677, 0.021031855247736743, -0.11504943119293518, -0.15894760730289442, 0.39328352186609716, 0.08414961027515613, 0.1594372668202114, 0.1502050321244443, 0.31303057273736856, 0.15626837658654788, 0.08034604365992196, 0.10552902168744956, 0.19601421649156905, 0.10100847798543434, 0.024217842098818543, -0.2681644837055715, 0.0640797068070456, 0.15964624407591627] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.