id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0126 | q-Analogues of two "divergent" Ramanujan-type supercongruences | Guillera and Zudilin proved three "divergent" Ramanujan-type supercongruences
by means of the Wilf-Zeilberger algorithmic technique. In this paper, we prove
$q$-analogues of two of them via the $q$-WZ method. Additionally, we give
$q$-analogues of two related congruence of Sun, one is confirmed and the other
is conjectural.
| math.NT math.CO | guillera and zudilin proved three divergent ramanujantype supercongruences by means of the wilfzeilberger algorithmic technique in this paper we prove qanalogues of two of them via the qwz method additionally we give qanalogues of two related congruence of sun one is confirmed and the other is conjectural | [['guillera', 'and', 'zudilin', 'proved', 'three', 'divergent', 'ramanujantype', 'supercongruences', 'by', 'means', 'of', 'the', 'wilfzeilberger', 'algorithmic', 'technique', 'in', 'this', 'paper', 'we', 'prove', 'qanalogues', 'of', 'two', 'of', 'them', 'via', 'the', 'qwz', 'method', 'additionally', 'we', 'give', 'qanalogues', 'of', 'two', 'related', 'congruence', 'of', 'sun', 'one', 'is', 'confirmed', 'and', 'the', 'other', 'is', 'conjectural']] | [-0.16653194090046802, 0.05650046253775028, -0.15064439579672328, 0.12664357835595358, -0.08359615706858482, -0.15279878398522417, 0.04170349301978391, 0.32019907537292924, -0.26869477347490633, -0.26563981092198097, 0.08041255208019643, -0.29980091810067916, -0.2305174669562938, 0.25795001847709115, -0.10296351535919498, 0.05476627412668251, 0.02384876081363318, 0.006560995778504839, -0.0540394944515317, -0.3572281489663936, 0.3786043550006728, -0.08358491198382677, 0.189877654009677, 0.09222058190944347, 0.09749730162203629, -0.00686915091268639, -0.11918368995031144, -0.05480997135585293, -0.16778607977593832, 0.1797629082179133, 0.22945498220345123, 0.13937382932574033, 0.25936105833487944, -0.3744884543120861, -0.041222123379640756, 0.0684729255042336, 0.1853887399242438, 0.028116933179107753, -0.04655519946716092, -0.24426181083346934, 0.08644852203693479, -0.18401490254922115, -0.1638270440273621, -0.11276434365897736, -0.0018295124173164368, 0.07864719777903025, -0.24793981657700337, 0.07058806101137653, 0.11342499203028832, 0.13059212124728142, -0.031154786191999594, -0.18658121362170008, 0.0797777559132652, 0.06850114821436558, 0.12179344841972628, -0.048607433323768226, -0.02819189084495636, -0.06236408527524389, -0.19194653878939597, 0.3170545531555693, 0.013825894581114358, -0.13776950367746202, 0.14649924259890426, -0.12778749595336775, -0.2508342138471756, 0.05066277784235934, 0.010723883583349116, 0.19970319552862265, -0.12927274253377888, 0.05287834091181372, -0.13054825714293947, 0.03191055447616158, 0.2207774313245999, -0.03169089234731299, 0.10457929108846695, 0.04157207884449274, 0.01007288951981575, 0.2300267905564087, -0.02535596596475869, -0.002269559955977379, -0.26034847084195056, -0.25464445688920295, -0.14162147078821632, 0.04814158474649996, -0.09074516104660592, -0.1078001153754427, 0.3923193182637717, 0.14827626349622422, 0.13199047482711204, 0.10064068850763935, 0.22102887694664458, 0.09509123679983647, -0.013034283797791663, 0.0013824495823776468, 0.1778770074089791, 0.18807433863130815, 0.01184356597034221, -0.14849074569312817, -0.02485079868161615, 0.26240777426419104] |
1,802.01261 | Enhancement of cooperation through conformity-driven reproductive
ability | We propose a conformity-driven reproductive ability in which an individual
$i$ is more (less) likely to imitate a neighbor $j$'s strategy if $j$'s
strategy is majority (minority) in $i$'s neighborhood. The results on the
evolutionary spatial prisoner's dilemma game show that, compared to homogeneous
reproductive ability, conformity-driven reproductive ability can greatly
enhance cooperation. This finding is robust with respect to different types of
network structures (including square lattice and scale-free network) and to
different ways of strategy updating (including synchronous and asynchronous
strategy updating).
| physics.soc-ph | we propose a conformitydriven reproductive ability in which an individual i is more less likely to imitate a neighbor js strategy if js strategy is majority minority in is neighborhood the results on the evolutionary spatial prisoners dilemma game show that compared to homogeneous reproductive ability conformitydriven reproductive ability can greatly enhance cooperation this finding is robust with respect to different types of network structures including square lattice and scalefree network and to different ways of strategy updating including synchronous and asynchronous strategy updating | [['we', 'propose', 'a', 'conformitydriven', 'reproductive', 'ability', 'in', 'which', 'an', 'individual', 'i', 'is', 'more', 'less', 'likely', 'to', 'imitate', 'a', 'neighbor', 'js', 'strategy', 'if', 'js', 'strategy', 'is', 'majority', 'minority', 'in', 'is', 'neighborhood', 'the', 'results', 'on', 'the', 'evolutionary', 'spatial', 'prisoners', 'dilemma', 'game', 'show', 'that', 'compared', 'to', 'homogeneous', 'reproductive', 'ability', 'conformitydriven', 'reproductive', 'ability', 'can', 'greatly', 'enhance', 'cooperation', 'this', 'finding', 'is', 'robust', 'with', 'respect', 'to', 'different', 'types', 'of', 'network', 'structures', 'including', 'square', 'lattice', 'and', 'scalefree', 'network', 'and', 'to', 'different', 'ways', 'of', 'strategy', 'updating', 'including', 'synchronous', 'and', 'asynchronous', 'strategy', 'updating']] | [-0.09051484140495415, 0.08356550170563944, -0.07711125668581753, 0.058780089573701844, -0.1133903568233585, -0.23208823056137634, 0.11668771385614361, 0.4614511366900323, -0.27906163039595067, -0.28811676420861787, 0.03526551486270148, -0.22296698602093828, -0.24940295588402522, 0.05321165050069491, -0.1595226305736495, -0.06603091101126102, 0.0591105030339566, 0.01423169679695829, 0.05126975946560768, -0.3327663316019988, 0.28601080955593805, 0.05410396718486611, 0.3119335136309798, -0.043008708902302066, 0.08767183850951758, 0.013383610320964917, -0.037911655281537344, 0.053347555973145756, -0.07437152539456465, 0.11763352137465215, 0.24710809599075997, 0.18863662117620975, 0.3964922400634913, -0.40016041993207874, -0.1578039573062034, 0.17350125560603505, 0.1751692680797229, 0.14784911386197477, 0.03476870932233093, -0.2703243664111055, 0.1310003391893891, -0.2101684766488948, -0.08823080599263665, -0.06451113725571693, 0.021631642000838405, 0.059877938036585136, -0.312536864541471, 0.016174132059816094, 0.03258231557473274, 0.03249141097157484, -0.03845740492743928, -0.151420412951016, -0.059839572358344285, 0.14647903651486904, 0.015852278198248575, -0.008324957419452923, 0.15542211767197364, -0.15450993774270283, -0.1788076746465993, 0.3655212487848032, -0.02182698750957137, -0.19491976131463334, 0.24021088376286484, -0.07927563586937529, -0.0750271937521618, 0.08616579295180384, 0.15335920605416287, 0.10504106592963494, -0.1443923845820661, -0.0447977718895778, -0.01667794198285611, 0.16865964575360218, 0.023273576915796314, 0.028448308388414306, 0.16840235547473034, 0.24293552857956716, 0.16946025882359772, 0.07352501594661069, -0.07996018232855324, -0.21268726290491896, -0.13924718436984612, -0.09808549881424933, -0.15307016729465908, 0.019559625602726425, -0.12000945340679166, -0.11333833668114883, 0.37975909525439855, 0.17938377070684164, 0.14605722119588227, 0.09196394819550083, 0.2686331454841864, 0.004113160960731052, 0.06470462818452645, 0.05655244944084968, 0.172647565364882, 0.0747164380736649, 0.11517691560133937, -0.26911613028053016, 0.17702336380967781, 0.02894711456749411] |
1,802.01262 | Development of c-means Clustering Based Adaptive Fuzzy Controller for A
Flapping Wing Micro Air Vehicle | Advanced and accurate modelling of a Flapping Wing Micro Air Vehicle (FW MAV)
and its control is one of the recent research topics related to the field of
autonomous Unmanned Aerial Vehicles (UAVs). In this work, a four wing
Natureinspired (NI) FW MAV is modeled and controlled inspiring by its advanced
features like quick flight, vertical take-off and landing, hovering, and fast
turn, and enhanced manoeuvrability when contrasted with comparable-sized fixed
and rotary wing UAVs. The Fuzzy C-Means (FCM) clustering algorithm is utilized
to demonstrate the NIFW MAV model, which has points of interest over first
principle based modelling since it does not depend on the system dynamics,
rather based on data and can incorporate various uncertainties like sensor
error. The same clustering strategy is used to develop an adaptive fuzzy
controller. The controller is then utilized to control the altitude of the NIFW
MAV, that can adapt with environmental disturbances by tuning the antecedent
and consequent parameters of the fuzzy system.
| cs.SY | advanced and accurate modelling of a flapping wing micro air vehicle fw mav and its control is one of the recent research topics related to the field of autonomous unmanned aerial vehicles uavs in this work a four wing natureinspired ni fw mav is modeled and controlled inspiring by its advanced features like quick flight vertical takeoff and landing hovering and fast turn and enhanced manoeuvrability when contrasted with comparablesized fixed and rotary wing uavs the fuzzy cmeans fcm clustering algorithm is utilized to demonstrate the nifw mav model which has points of interest over first principle based modelling since it does not depend on the system dynamics rather based on data and can incorporate various uncertainties like sensor error the same clustering strategy is used to develop an adaptive fuzzy controller the controller is then utilized to control the altitude of the nifw mav that can adapt with environmental disturbances by tuning the antecedent and consequent parameters of the fuzzy system | [['advanced', 'and', 'accurate', 'modelling', 'of', 'a', 'flapping', 'wing', 'micro', 'air', 'vehicle', 'fw', 'mav', 'and', 'its', 'control', 'is', 'one', 'of', 'the', 'recent', 'research', 'topics', 'related', 'to', 'the', 'field', 'of', 'autonomous', 'unmanned', 'aerial', 'vehicles', 'uavs', 'in', 'this', 'work', 'a', 'four', 'wing', 'natureinspired', 'ni', 'fw', 'mav', 'is', 'modeled', 'and', 'controlled', 'inspiring', 'by', 'its', 'advanced', 'features', 'like', 'quick', 'flight', 'vertical', 'takeoff', 'and', 'landing', 'hovering', 'and', 'fast', 'turn', 'and', 'enhanced', 'manoeuvrability', 'when', 'contrasted', 'with', 'comparablesized', 'fixed', 'and', 'rotary', 'wing', 'uavs', 'the', 'fuzzy', 'cmeans', 'fcm', 'clustering', 'algorithm', 'is', 'utilized', 'to', 'demonstrate', 'the', 'nifw', 'mav', 'model', 'which', 'has', 'points', 'of', 'interest', 'over', 'first', 'principle', 'based', 'modelling', 'since', 'it', 'does', 'not', 'depend', 'on', 'the', 'system', 'dynamics', 'rather', 'based', 'on', 'data', 'and', 'can', 'incorporate', 'various', 'uncertainties', 'like', 'sensor', 'error', 'the', 'same', 'clustering', 'strategy', 'is', 'used', 'to', 'develop', 'an', 'adaptive', 'fuzzy', 'controller', 'the', 'controller', 'is', 'then', 'utilized', 'to', 'control', 'the', 'altitude', 'of', 'the', 'nifw', 'mav', 'that', 'can', 'adapt', 'with', 'environmental', 'disturbances', 'by', 'tuning', 'the', 'antecedent', 'and', 'consequent', 'parameters', 'of', 'the', 'fuzzy', 'system']] | [-0.11473773198448262, 0.08956157393343879, -0.08985427584288255, 0.009572973442644631, -0.11943603248288562, -0.19247146236634105, 0.025181637901180196, 0.4169764440717562, -0.2616394599577494, -0.3545152513667613, 0.1365602858585698, -0.22858203858658438, -0.1853377666418095, 0.21492708967442173, -0.16780150201136493, 0.10628837880271387, 0.05441762292874778, 0.01739998742551455, 0.037234735055738745, -0.16973962657352756, 0.22327969956018454, 0.09494075829561495, 0.28231907464598993, -0.003807301296260934, 0.18023706556212907, 0.01471252802103383, -0.021667283344662416, 0.03452227452957311, -0.07594672767922273, 0.13093581356975081, 0.2404052521330568, 0.15062668658031514, 0.3189867847312078, -0.45339397671954623, -0.2072096044408544, 0.0812070783397546, 0.14459856543484959, 0.025364830771478702, -0.019555240914916748, -0.36854610112993597, 0.07387479398774463, -0.19351048755559064, -0.12284121384153014, -0.054993839544952856, 0.028336199671879364, 0.09509759687426143, -0.2604509516598645, -0.05734244177891117, 0.018068876345905493, 0.08328532046820007, -0.08633637648960282, -0.06973079785722185, -0.023776756184404047, 0.14805651860514438, 0.04301023713837278, 0.03833557677062802, 0.26052678971252635, -0.10818028674349657, -0.11599138916511112, 0.4059225014592492, 0.002494685914156572, -0.2019961734929081, 0.17393336016333327, -0.03549434045481982, -0.08087219499379585, 0.11646415211067025, 0.20736351229379293, 0.105490068123096, -0.14044343018671865, 0.016910787999451324, 0.024978858067320205, 0.17002726710875923, 0.03126901930561231, -0.05718444018923449, 0.1702163154288611, 0.22891438537154277, 0.17322217832749956, 0.0738150462429127, -0.15111138992620715, -0.11559086807991771, -0.18880424622750883, -0.11187159057050203, -0.1514929331921088, -0.05895561276802884, -0.06407139356511296, -0.13327725500281337, 0.37790914382434115, 0.20722290903693005, 0.14545875575112285, 0.031200446028104227, 0.38456123469268566, 0.08390147854433448, 0.05119214332867531, 0.06532584490113945, 0.2285948335595792, 0.060763066048798324, 0.1712909510392848, -0.24961108155109268, 0.10231755190139413, 0.05390654948873902] |
1,802.01263 | Models for characterizing the transition among anomalous diffusions with
different diffusion exponents | Based on the theory of continuous time random walks (CTRW), we build the
models of characterizing the transitions among anomalous diffusions with
different diffusion exponents, often observed in natural world. In the CTRW
framework, we take the waiting time probability density function (PDF) as an
infinite series in three parameter Mittag-Leffler functions. According to the
models, the mean squared displacement of the process is analytically obtained
and numerically verified, in particular, the trend of its transition is shown;
furthermore the stochastic representation of the process is presented and the
positiveness of the PDF of the position of the particles is strictly proved.
Finally, the fractional moments of the model are calculated, and the analytical
solutions of the model with external harmonic potential are obtained and some
applications are proposed.
| cond-mat.stat-mech math-ph math.MP | based on the theory of continuous time random walks ctrw we build the models of characterizing the transitions among anomalous diffusions with different diffusion exponents often observed in natural world in the ctrw framework we take the waiting time probability density function pdf as an infinite series in three parameter mittagleffler functions according to the models the mean squared displacement of the process is analytically obtained and numerically verified in particular the trend of its transition is shown furthermore the stochastic representation of the process is presented and the positiveness of the pdf of the position of the particles is strictly proved finally the fractional moments of the model are calculated and the analytical solutions of the model with external harmonic potential are obtained and some applications are proposed | [['based', 'on', 'the', 'theory', 'of', 'continuous', 'time', 'random', 'walks', 'ctrw', 'we', 'build', 'the', 'models', 'of', 'characterizing', 'the', 'transitions', 'among', 'anomalous', 'diffusions', 'with', 'different', 'diffusion', 'exponents', 'often', 'observed', 'in', 'natural', 'world', 'in', 'the', 'ctrw', 'framework', 'we', 'take', 'the', 'waiting', 'time', 'probability', 'density', 'function', 'pdf', 'as', 'an', 'infinite', 'series', 'in', 'three', 'parameter', 'mittagleffler', 'functions', 'according', 'to', 'the', 'models', 'the', 'mean', 'squared', 'displacement', 'of', 'the', 'process', 'is', 'analytically', 'obtained', 'and', 'numerically', 'verified', 'in', 'particular', 'the', 'trend', 'of', 'its', 'transition', 'is', 'shown', 'furthermore', 'the', 'stochastic', 'representation', 'of', 'the', 'process', 'is', 'presented', 'and', 'the', 'positiveness', 'of', 'the', 'pdf', 'of', 'the', 'position', 'of', 'the', 'particles', 'is', 'strictly', 'proved', 'finally', 'the', 'fractional', 'moments', 'of', 'the', 'model', 'are', 'calculated', 'and', 'the', 'analytical', 'solutions', 'of', 'the', 'model', 'with', 'external', 'harmonic', 'potential', 'are', 'obtained', 'and', 'some', 'applications', 'are', 'proposed']] | [-0.09741007895281091, 0.1409241739605678, -0.10578011771548511, 0.0769886757246755, 0.009887701391365177, -0.09091851664995847, 0.015834704988145147, 0.38298235325117475, -0.2689347460418362, -0.25213593186796174, 0.08476221758525732, -0.2861544941885888, -0.16899999384154646, 0.1712232766088185, -0.0005928139732934015, 0.12734515507580974, -0.010720485859268974, 0.0696655463412866, -0.03476471156459446, -0.23576142496696506, 0.29129771975612684, 0.02790506096744491, 0.2885393670655412, 0.03621694847288029, 0.11479354566035345, -0.0205987853741692, -0.06858774696841345, -0.0019259646038236927, -0.13727683858411718, 0.088903333829326, 0.1763139892134986, 0.07949185971704911, 0.24481363430648118, -0.42257889937753823, -0.22473366460365843, 0.11492895338027341, 0.12572609485544864, 0.06699790108169235, -0.009773642471774893, -0.3125583168494609, 0.031596795912081185, -0.1482105805112641, -0.15602053065473834, -0.06379378100770504, 0.052211319641462826, 0.10899073977290487, -0.2916070146182942, 0.11307507096392702, 0.04548783906439478, 0.01579714583796124, -0.08699640464317415, -0.13007152843462347, -0.023820201638912738, 0.12961294432351178, 0.0908399013782499, -0.013146960663847452, 0.11107708701806128, -0.12179646371952221, -0.13651366725693956, 0.3734949038241261, -0.07804206317848374, -0.24494370373413543, 0.14268679688901229, -0.2054654764726238, -0.10338365220529742, 0.10718915266230299, 0.162255790026844, 0.1260219136065291, -0.17626213402191335, 0.10642456393075254, -0.0002522754975659556, 0.10047185503112427, 0.017149605660143404, -0.013665886927944746, 0.13550281911626344, 0.1512943899327557, 0.031309096389919404, 0.1458651364903695, -0.07858955394296163, -0.197223420662791, -0.3323534729966331, -0.1578088221573379, -0.22975286073953838, 0.002093287897765521, -0.15915645692856664, -0.17989396293852442, 0.4081589680475493, 0.16533778458400522, 0.20003651621094506, 0.133065464233171, 0.2443622339502439, 0.24052626089023268, -0.009605203982615886, 0.04059314659738899, 0.18443713126123826, 0.14053193808446618, 0.11605768071942378, -0.19247930026938057, 0.10704710625306985, 0.0694297133681415] |
1,802.01264 | Self-dual Einstein ACH metrics and CR GJMS operators in dimension three | By refining Matsumoto's construction of Einstein ACH metrics, we construct a
one parameter family of ACH metrics which solve the Einstein equation to
infinite order and have a given three dimensional CR structure at infinity.
When the parameter is 0, the metric is self-dual to infinite order. As an
application, we give another proof of the fact that three dimensional CR
manifolds admit CR invariant powers of the sublaplacian (CR GJMS operators) of
all orders, which has been proved by Gover-Graham. We also prove the
convergence of the formal solutions when the CR structure is real analytic.
| math.DG math.CV | by refining matsumotos construction of einstein ach metrics we construct a one parameter family of ach metrics which solve the einstein equation to infinite order and have a given three dimensional cr structure at infinity when the parameter is 0 the metric is selfdual to infinite order as an application we give another proof of the fact that three dimensional cr manifolds admit cr invariant powers of the sublaplacian cr gjms operators of all orders which has been proved by govergraham we also prove the convergence of the formal solutions when the cr structure is real analytic | [['by', 'refining', 'matsumotos', 'construction', 'of', 'einstein', 'ach', 'metrics', 'we', 'construct', 'a', 'one', 'parameter', 'family', 'of', 'ach', 'metrics', 'which', 'solve', 'the', 'einstein', 'equation', 'to', 'infinite', 'order', 'and', 'have', 'a', 'given', 'three', 'dimensional', 'cr', 'structure', 'at', 'infinity', 'when', 'the', 'parameter', 'is', '0', 'the', 'metric', 'is', 'selfdual', 'to', 'infinite', 'order', 'as', 'an', 'application', 'we', 'give', 'another', 'proof', 'of', 'the', 'fact', 'that', 'three', 'dimensional', 'cr', 'manifolds', 'admit', 'cr', 'invariant', 'powers', 'of', 'the', 'sublaplacian', 'cr', 'gjms', 'operators', 'of', 'all', 'orders', 'which', 'has', 'been', 'proved', 'by', 'govergraham', 'we', 'also', 'prove', 'the', 'convergence', 'of', 'the', 'formal', 'solutions', 'when', 'the', 'cr', 'structure', 'is', 'real', 'analytic']] | [-0.16080962864604467, 0.06909332289690913, -0.04630744902048415, 0.07443186841434606, -0.09956189727866634, -0.13617791585663022, -0.06997046056979646, 0.32546276930952445, -0.24535600018377104, -0.23299134229697907, 0.11446974785455193, -0.30025994156797725, -0.15320137224625796, 0.16749717783144055, -0.000853987856923292, 0.02163646960980259, -0.0023073289048625156, 0.10572647244650095, -0.1296856088374625, -0.3056693159014685, 0.45649557407280855, 0.028912803119358916, 0.23894015062251128, 0.05852030305929171, 0.1380861630926423, -0.07679415839569022, 0.0064991231010935735, 0.03541773775335363, -0.1681120294116075, 0.12531350988623066, 0.27061918017958914, 0.08985302426056781, 0.22259202099424633, -0.33997939319427434, -0.24670516099255715, 0.13714149520577243, 0.13319921348496186, 0.05646439870421697, 0.0022993348126571314, -0.26778574456693605, 0.14118657121192277, -0.15927518684960282, -0.1890888000295187, -0.08848193483815218, 0.013941434270236641, 0.012233234107649574, -0.25023881213686155, -0.011249946311788031, 0.1490984044309395, 0.04175780543785853, -0.12703537217263752, -0.09060499162296765, -0.02728852227179838, 0.0808459566936411, 0.07774914964344741, 0.02867090656460884, 0.03240424804486489, 0.007008456464215366, -0.12560812484298367, 0.35658345397860103, -0.08046402686401659, -0.2687751100747846, 0.14387117810110794, -0.12638942847843282, -0.14205262195901014, 0.12258451993693598, 0.11587432958185673, 0.15826376663365713, -0.10736885837377486, 0.23483831132701502, -0.037751196505269036, 0.10227914474671707, 0.11677309150885169, -0.001092391787096858, 0.07902755161679427, 0.08020879816710173, 0.1590669218688466, 0.11337344864053496, 0.004238809900319514, -0.06579769254797914, -0.29720349004492164, -0.22897470287261967, -0.144076596864276, 0.1862192113379327, -0.17704397932038773, -0.20342574473276423, 0.36541923593419295, 0.03809587347374569, 0.19408938957591695, 0.06062043298394807, 0.242483349997201, 0.1356751946817288, 0.019232624533591054, 0.1023078071642279, 0.1918533159478102, 0.16352376643044408, 0.06406000518472865, -0.1440461797901662, -0.01665416745042118, 0.20574777070820952] |
1,802.01265 | Convex and Sequential Effect Algebras | We present a mathematical framework for quantum mechanics in which the basic
entities and operations have physical significance. In this framework the
primitive concepts are states and effects and the resulting mathematical
structure is a convex effect algebra. We characterize the convex effect
algebras that are classical and those that are quantum mechanical. The quantum
mechanical ones are those that can be represented on a complex Hilbert space.
We next introduce the sequential product of effects to form a convex sequential
effect algebra. This product makes it possible to study conditional
probabilities and expectations.
| quant-ph | we present a mathematical framework for quantum mechanics in which the basic entities and operations have physical significance in this framework the primitive concepts are states and effects and the resulting mathematical structure is a convex effect algebra we characterize the convex effect algebras that are classical and those that are quantum mechanical the quantum mechanical ones are those that can be represented on a complex hilbert space we next introduce the sequential product of effects to form a convex sequential effect algebra this product makes it possible to study conditional probabilities and expectations | [['we', 'present', 'a', 'mathematical', 'framework', 'for', 'quantum', 'mechanics', 'in', 'which', 'the', 'basic', 'entities', 'and', 'operations', 'have', 'physical', 'significance', 'in', 'this', 'framework', 'the', 'primitive', 'concepts', 'are', 'states', 'and', 'effects', 'and', 'the', 'resulting', 'mathematical', 'structure', 'is', 'a', 'convex', 'effect', 'algebra', 'we', 'characterize', 'the', 'convex', 'effect', 'algebras', 'that', 'are', 'classical', 'and', 'those', 'that', 'are', 'quantum', 'mechanical', 'the', 'quantum', 'mechanical', 'ones', 'are', 'those', 'that', 'can', 'be', 'represented', 'on', 'a', 'complex', 'hilbert', 'space', 'we', 'next', 'introduce', 'the', 'sequential', 'product', 'of', 'effects', 'to', 'form', 'a', 'convex', 'sequential', 'effect', 'algebra', 'this', 'product', 'makes', 'it', 'possible', 'to', 'study', 'conditional', 'probabilities', 'and', 'expectations']] | [-0.10100990607145618, 0.13408552160724363, -0.1114668853858367, 0.1148499161577189, -0.11198702492216166, -0.10375343293367707, 0.017085262742686146, 0.3767864682731476, -0.3435547883235949, -0.23902046571465882, 0.10480669501827079, -0.25973533469430626, -0.22610530829889344, 0.16921138404521774, -0.09786915485350851, 0.05883005092990525, 0.06434339210836891, 0.04147676702717597, -0.08826748867571216, -0.2178253728916195, 0.35910237402694817, 0.013668439934337313, 0.25129691904727763, 0.00931000885395135, 0.07077959360198137, 0.006982354858414607, 0.01753396734080099, 0.06794973399875279, -0.10549424381478023, 0.14704779846323754, 0.2738743414706055, 0.15751936812290646, 0.28231655370240955, -0.4574003631566116, -0.17205861403032185, 0.12016006076629175, 0.05603046385333576, 0.11515052004517898, -0.015554054953564118, -0.26537051275768814, 0.03626144919148151, -0.189182856283646, -0.06156332814877734, -0.12195438505249455, 0.007862719271252764, -0.048129038109959284, -0.2505520412461842, 0.049043885907752716, 0.06501611012053933, 0.06127352730192719, -0.04558155608383265, -0.09744988850496233, 0.013655502527476625, 0.10309636132157546, -0.06574018463304147, -0.015643571104676006, 0.18583972419195988, -0.07410157226432273, -0.19987052177237544, 0.39972935888440686, 0.03453454145470614, -0.2712463573626976, 0.18558611702966563, -0.15108392801274487, -0.1627168697800408, 0.05532587951227547, 0.16546251018719865, 0.09696376662047461, -0.15411017659836093, 0.10886163217141888, -0.059070191445185785, 0.06956611706459141, 0.005984919016903385, 0.10918898402435824, 0.193618147911385, 0.12735795031767339, -0.008102630985841314, 0.16836825618396534, -0.015945342500654467, -0.17064569252505998, -0.32152441319355624, -0.20783815038529166, -0.12891542831277278, 0.06340736934439616, -0.060069292054748154, -0.1787491300467778, 0.37604569479515976, 0.1332671202247358, 0.15472080166194033, 0.07786754696218773, 0.28432670134575444, 0.12645156289193224, 0.07660972035707946, 0.04126840978959932, 0.22560624609840044, 0.1667378852540191, 0.013343322219604508, -0.16434081506598344, 0.0776775981685979, 0.09012933616387717] |
1,802.01266 | Multi-snapshot Newtonized Orthogonal Matching Pursuit for Line Spectrum
Estimation with Multiple Measurement Vectors | In this paper, multi-snapshot Newtonized orthogonal matching pursuit (MNOMP)
algorithm is proposed to deal with the line spectrum estimation with multiple
measurement vectors (MMVs). MNOMP has the low computation complexity and
state-of-the-art performance advantage of NOMP, and also includes two key
steps: Detecting a new sinusoid on an oversampled discrete Fourier transform
(DFT) grid and refining the parameters of already detected sinusoids to avoid
the problem of basis mismatch. We provide a stopping criterion based on the
overestimating probability of the model order. In addition, the convergence of
the proposed algorithm is also proved. Finally, numerical results are conducted
to show that the performance of MNOMP benefits from MMVs, and the effectiveness
of MNOMP when compared against the state-of-the-art algorithms in terms of
frequency estimation accuracy and computation complexity.
| cs.IT math.IT | in this paper multisnapshot newtonized orthogonal matching pursuit mnomp algorithm is proposed to deal with the line spectrum estimation with multiple measurement vectors mmvs mnomp has the low computation complexity and stateoftheart performance advantage of nomp and also includes two key steps detecting a new sinusoid on an oversampled discrete fourier transform dft grid and refining the parameters of already detected sinusoids to avoid the problem of basis mismatch we provide a stopping criterion based on the overestimating probability of the model order in addition the convergence of the proposed algorithm is also proved finally numerical results are conducted to show that the performance of mnomp benefits from mmvs and the effectiveness of mnomp when compared against the stateoftheart algorithms in terms of frequency estimation accuracy and computation complexity | [['in', 'this', 'paper', 'multisnapshot', 'newtonized', 'orthogonal', 'matching', 'pursuit', 'mnomp', 'algorithm', 'is', 'proposed', 'to', 'deal', 'with', 'the', 'line', 'spectrum', 'estimation', 'with', 'multiple', 'measurement', 'vectors', 'mmvs', 'mnomp', 'has', 'the', 'low', 'computation', 'complexity', 'and', 'stateoftheart', 'performance', 'advantage', 'of', 'nomp', 'and', 'also', 'includes', 'two', 'key', 'steps', 'detecting', 'a', 'new', 'sinusoid', 'on', 'an', 'oversampled', 'discrete', 'fourier', 'transform', 'dft', 'grid', 'and', 'refining', 'the', 'parameters', 'of', 'already', 'detected', 'sinusoids', 'to', 'avoid', 'the', 'problem', 'of', 'basis', 'mismatch', 'we', 'provide', 'a', 'stopping', 'criterion', 'based', 'on', 'the', 'overestimating', 'probability', 'of', 'the', 'model', 'order', 'in', 'addition', 'the', 'convergence', 'of', 'the', 'proposed', 'algorithm', 'is', 'also', 'proved', 'finally', 'numerical', 'results', 'are', 'conducted', 'to', 'show', 'that', 'the', 'performance', 'of', 'mnomp', 'benefits', 'from', 'mmvs', 'and', 'the', 'effectiveness', 'of', 'mnomp', 'when', 'compared', 'against', 'the', 'stateoftheart', 'algorithms', 'in', 'terms', 'of', 'frequency', 'estimation', 'accuracy', 'and', 'computation', 'complexity']] | [-0.09057928919214611, -0.030439303515460016, -0.08329558902773862, 0.007459751800489576, -0.051365524642313865, -0.11920725178314633, 0.0625580676150862, 0.3862783709295498, -0.22851085801096271, -0.2975942577964576, 0.1278462430630096, -0.2367032772117807, -0.1678758845908221, 0.22047158685204205, -0.11575222981131686, 0.12738156554743993, 0.10626703845842402, 0.020688053583518724, -0.0941577126292779, -0.29673025719194257, 0.24249863553821116, 0.09809129663504833, 0.3344339456033799, -0.001235559869687571, 0.10057770982812214, -0.006408161696681912, -0.07085694998589366, 0.0037252982255331305, -0.06289359767653468, 0.13232849990721618, 0.25121551631884864, 0.16586877846820308, 0.3009858828673298, -0.3759102662231109, -0.1843638468575267, 0.09841830864577561, 0.1627924837652132, 0.07639794829193243, -0.055612304191964196, -0.2958016315828864, 0.10704414874257505, -0.14288233510081388, -0.04798406742643132, -0.10039386548852736, -0.04797763842367386, 0.023669469430176324, -0.31304694427711555, 0.05400540545635113, 0.032419273331977944, 0.04331297123472589, -0.05271684138696323, -0.17036759677386387, 0.04915469093609226, 0.09993163961849479, 0.05339529825818487, 0.019550754042530014, 0.06106794999629014, -0.07923372246346674, -0.1761396036216224, 0.37437592565926703, -0.06343853340417421, -0.2191352378883825, 0.16244404028213127, -0.08908973397531857, -0.12551665220178607, 0.15171439347196689, 0.19227531133580578, 0.08841097773532852, -0.08324790943394571, 0.06428342728939651, -0.015776656474196172, 0.16690028814035793, 0.07869968535883944, 0.042175764257680305, 0.09601087535211686, 0.1724628914461666, 0.08759765939916982, 0.14725330215517807, -0.14396719111205447, -0.07535695771924979, -0.22698238771228307, -0.12123149873818768, -0.23006781551611516, -0.07283603642569032, -0.11818853927748693, -0.13548770064646884, 0.42222336674643346, 0.19791805992253095, 0.1793336373927115, 0.11911360213403092, 0.3902946474795887, 0.1206547281769819, 0.003309983837728699, 0.08404267622273444, 0.1985112745206543, 0.11532055369403228, 0.041639124032456516, -0.25334111286161193, 0.06705942669118098, 0.08455002718684516] |
1,802.01267 | ClassSim: Similarity between Classes Defined by Misclassification Ratios
of Trained Classifiers | Deep neural networks (DNNs) have achieved exceptional performances in many
tasks, particularly, in supervised classification tasks. However, achievements
with supervised classification tasks are based on large datasets with
well-separated classes. Typically, real-world applications involve wild
datasets that include similar classes; thus, evaluating similarities between
classes and understanding relations among classes are important. To address
this issue, a similarity metric, ClassSim, based on the misclassification
ratios of trained DNNs is proposed herein. We conducted image recognition
experiments to demonstrate that the proposed method provides better
similarities compared with existing methods and is useful for classification
problems. Source code including all experimental results is available at
https://github.com/karino2/ClassSim/.
| cs.CV stat.ML | deep neural networks dnns have achieved exceptional performances in many tasks particularly in supervised classification tasks however achievements with supervised classification tasks are based on large datasets with wellseparated classes typically realworld applications involve wild datasets that include similar classes thus evaluating similarities between classes and understanding relations among classes are important to address this issue a similarity metric classsim based on the misclassification ratios of trained dnns is proposed herein we conducted image recognition experiments to demonstrate that the proposed method provides better similarities compared with existing methods and is useful for classification problems source code including all experimental results is available at httpsgithubcomkarino2classsim | [['deep', 'neural', 'networks', 'dnns', 'have', 'achieved', 'exceptional', 'performances', 'in', 'many', 'tasks', 'particularly', 'in', 'supervised', 'classification', 'tasks', 'however', 'achievements', 'with', 'supervised', 'classification', 'tasks', 'are', 'based', 'on', 'large', 'datasets', 'with', 'wellseparated', 'classes', 'typically', 'realworld', 'applications', 'involve', 'wild', 'datasets', 'that', 'include', 'similar', 'classes', 'thus', 'evaluating', 'similarities', 'between', 'classes', 'and', 'understanding', 'relations', 'among', 'classes', 'are', 'important', 'to', 'address', 'this', 'issue', 'a', 'similarity', 'metric', 'classsim', 'based', 'on', 'the', 'misclassification', 'ratios', 'of', 'trained', 'dnns', 'is', 'proposed', 'herein', 'we', 'conducted', 'image', 'recognition', 'experiments', 'to', 'demonstrate', 'that', 'the', 'proposed', 'method', 'provides', 'better', 'similarities', 'compared', 'with', 'existing', 'methods', 'and', 'is', 'useful', 'for', 'classification', 'problems', 'source', 'code', 'including', 'all', 'experimental', 'results', 'is', 'available', 'at', 'httpsgithubcomkarino2classsim']] | [-0.03033764158981373, -0.06246733147135565, -0.023922039462633216, 0.10191654083680687, -0.09068236616666167, -0.2319617207247981, -0.01218142869511565, 0.509628912126555, -0.1928711981847159, -0.38079008199636216, 0.08304279805974836, -0.3073696371493409, -0.21797784235219933, 0.32265348651093767, -0.1425542487554903, 0.11178625510209828, 0.23874424690905127, 0.03257375804128722, -0.11859512464957113, -0.3657938779695683, 0.3277008122113506, 0.009127140368133765, 0.4150958137442041, 0.061090863472556024, 0.0938979723418439, -0.10108490916222189, -0.057692308797166476, 0.009360336892993993, -0.021489759903311846, 0.18851813880129925, 0.3986637788345513, 0.18223607788784701, 0.29912879507315066, -0.35162806020850695, -0.24156841167330162, 0.14675308025252182, 0.13522094912551236, 0.06348557968525605, -0.04133030881390916, -0.35439353053756417, 0.09663705678783285, -0.09730010122304909, 0.06186785861777449, -0.20974225076186714, 0.0013217860290292397, 0.03208344126599434, -0.23696854898651826, 0.06620635374141767, 0.06768498460714732, 0.11772707481732936, -0.036847861429441325, -0.17432184373164206, 0.0820024128849573, 0.19551428632123521, 0.07692357017296972, 0.007468881921896946, 0.11114308753195536, -0.20997227240326696, -0.20389517846526306, 0.3746193665468577, -0.023000265363133647, -0.20999131851730127, 0.29750329945507703, 0.025045475126831855, -0.22362686498361883, 0.07800228179441494, 0.2530599398429967, 0.13338222702314118, -0.14409993672110502, 0.008412450600587266, -0.04943995296195584, 0.1513548895752835, 0.04752274035494232, 0.02032714824698576, 0.19070916986929307, 0.303775127651622, -0.04864315435265471, 0.13758797823559962, -0.11019822593000762, -0.06590012864444802, -0.16984444022974343, -0.03747849964120796, -0.1786417985545218, -0.06052415418321068, -0.1073156630581367, -0.10311423790713464, 0.3787537081149018, 0.24166534415636104, 0.19068768909833964, 0.10736127678775093, 0.3251843538171458, -0.026376947629473454, 0.15720604910307284, 0.09926086151972413, 0.1966028849139936, 0.027406165988898827, 0.09228101827529739, -0.15158274418050513, 0.0736336902109454, 0.056501798218712936] |
1,802.01268 | ASMCNN: An Efficient Brain Extraction Using Active Shape Model and
Convolutional Neural Networks | Brain extraction (skull stripping) is a challenging problem in neuroimaging.
It is due to the variability in conditions from data acquisition or
abnormalities in images, making brain morphology and intensity characteristics
changeable and complicated. In this paper, we propose an algorithm for skull
stripping in Magnetic Resonance Imaging (MRI) scans, namely ASMCNN, by
combining the Active Shape Model (ASM) and Convolutional Neural Network (CNN)
for taking full of their advantages to achieve remarkable results. Instead of
working with 3D structures, we process 2D image sequences in the sagittal
plane. First, we divide images into different groups such that, in each group,
shapes and structures of brain boundaries have similar appearances. Second, a
modified version of ASM is used to detect brain boundaries by utilizing prior
knowledge of each group. Finally, CNN and post-processing methods, including
Conditional Random Field (CRF), Gaussian processes, and several special rules
are applied to refine the segmentation contours. Experimental results show that
our proposed method outperforms current state-of-the-art algorithms by a
significant margin in all experiments.
| cs.CV | brain extraction skull stripping is a challenging problem in neuroimaging it is due to the variability in conditions from data acquisition or abnormalities in images making brain morphology and intensity characteristics changeable and complicated in this paper we propose an algorithm for skull stripping in magnetic resonance imaging mri scans namely asmcnn by combining the active shape model asm and convolutional neural network cnn for taking full of their advantages to achieve remarkable results instead of working with 3d structures we process 2d image sequences in the sagittal plane first we divide images into different groups such that in each group shapes and structures of brain boundaries have similar appearances second a modified version of asm is used to detect brain boundaries by utilizing prior knowledge of each group finally cnn and postprocessing methods including conditional random field crf gaussian processes and several special rules are applied to refine the segmentation contours experimental results show that our proposed method outperforms current stateoftheart algorithms by a significant margin in all experiments | [['brain', 'extraction', 'skull', 'stripping', 'is', 'a', 'challenging', 'problem', 'in', 'neuroimaging', 'it', 'is', 'due', 'to', 'the', 'variability', 'in', 'conditions', 'from', 'data', 'acquisition', 'or', 'abnormalities', 'in', 'images', 'making', 'brain', 'morphology', 'and', 'intensity', 'characteristics', 'changeable', 'and', 'complicated', 'in', 'this', 'paper', 'we', 'propose', 'an', 'algorithm', 'for', 'skull', 'stripping', 'in', 'magnetic', 'resonance', 'imaging', 'mri', 'scans', 'namely', 'asmcnn', 'by', 'combining', 'the', 'active', 'shape', 'model', 'asm', 'and', 'convolutional', 'neural', 'network', 'cnn', 'for', 'taking', 'full', 'of', 'their', 'advantages', 'to', 'achieve', 'remarkable', 'results', 'instead', 'of', 'working', 'with', '3d', 'structures', 'we', 'process', '2d', 'image', 'sequences', 'in', 'the', 'sagittal', 'plane', 'first', 'we', 'divide', 'images', 'into', 'different', 'groups', 'such', 'that', 'in', 'each', 'group', 'shapes', 'and', 'structures', 'of', 'brain', 'boundaries', 'have', 'similar', 'appearances', 'second', 'a', 'modified', 'version', 'of', 'asm', 'is', 'used', 'to', 'detect', 'brain', 'boundaries', 'by', 'utilizing', 'prior', 'knowledge', 'of', 'each', 'group', 'finally', 'cnn', 'and', 'postprocessing', 'methods', 'including', 'conditional', 'random', 'field', 'crf', 'gaussian', 'processes', 'and', 'several', 'special', 'rules', 'are', 'applied', 'to', 'refine', 'the', 'segmentation', 'contours', 'experimental', 'results', 'show', 'that', 'our', 'proposed', 'method', 'outperforms', 'current', 'stateoftheart', 'algorithms', 'by', 'a', 'significant', 'margin', 'in', 'all', 'experiments']] | [-0.02284795594055167, 0.016994946328430578, -0.07545016163728646, 0.06425029477254585, -0.10455444228515778, -0.12217258246472248, -0.007018358941939412, 0.4815224461070091, -0.24898320319097952, -0.31239038603325214, 0.082280783168696, -0.24950481207280822, -0.22330778608093116, 0.20176302886446773, -0.1313517613091214, 0.07610637911722153, 0.12501830152461868, 0.009706927722419155, -0.0583981244401874, -0.24629151680680356, 0.29107025316255114, 0.011215467091385253, 0.3343212437049965, -0.026691560032805043, 0.1101612730107419, 0.001765732345523963, -0.04436600133817996, 0.018689341592129195, -0.07652852737894847, 0.13024547545600285, 0.287790339065374, 0.16370685386454917, 0.27089419692324906, -0.47012644244589397, -0.25856639503018475, 0.07101366554315273, 0.15379314181620818, 0.0892468378465821, -0.04229152235670908, -0.34740298677417697, 0.09597427138959515, -0.10910485126353668, -0.005862251987691814, -0.09922197956108618, -0.022196520881082576, -0.011596372213280765, -0.2841982779192281, 0.08958689547584739, 0.06580662117815837, 0.10002475093014142, -0.11836966136250006, -0.08925406124233407, 0.015599709261792915, 0.17740058233085249, 0.019954895113488746, 0.06091879097436219, 0.16732974580252136, -0.209917839893454, -0.14055439353970117, 0.32632340693063816, -0.011894633032907815, -0.19342061027487706, 0.1867731791485608, -0.12088273957470906, -0.15961504047020122, 0.15723523475882767, 0.2017050296641313, 0.09122148532828195, -0.1431971010834684, 0.0070470762638838065, -0.02035700990446463, 0.17188707229642738, 0.08018951882338206, -0.05556177107628281, 0.1588591726899103, 0.22633499853290925, 0.0017884562212902193, 0.16748304664813116, -0.20783017072881732, -0.03501949562090476, -0.20547331300338167, -0.1065452084160195, -0.16899561443636138, -0.06271746244141005, -0.10327368222963004, -0.157353692537879, 0.4360678604274944, 0.21481159822905116, 0.21637447590863237, 0.04277848160895244, 0.3577379041941032, 0.006621649977888846, 0.14223115673335546, 0.05382846328071677, 0.16043301219996836, 0.0873946490320074, 0.09328935235275848, -0.16481850935802686, 0.07609727778802654, 0.04902270854555467] |
1,802.01269 | Perfect Diffraction with Bianisotropic Metagratings | One highly desirable function of a diffraction grating is its ability to
deflect incident light into a specific diffraction order with near-perfect
efficiency. While such asymmetry can be achieved in a variety of ways, e.g., by
using a sawtooth (blazed) geometry, a recently emerged approach is to use a
planar metagrating comprised of designer multi-resonant periodic units
(metamolecules). Here we demonstrate that a bianisotropic unit cell supporting
four resonances interfering in the far field can be used as a building block
for achieving the prefect deflection. A coupled mode analysis shows that these
modes provide a small number of orthogonal electromagnetic radiation patterns
that are needed to suppress transmission/reflection into all but one
diffraction order. Bianisotropy caused by a mirror symmetry breaking enables a
normally incident wave to excite, through near-field couplings, two otherwise
"dark" resonant modes. We design and experimentally realize bianisotropic
metamolecules which are sub-wavelength in all three dimensions, and whose
optical properties are desensitized to fabrication imperfections by their
geometric simplicity. We show that optical beams tightly focused onto the
metagratings with just a few unit cells can also be asymmetrically deflected
with high efficiency, paving the way for compact broadband optical devices.
| physics.optics | one highly desirable function of a diffraction grating is its ability to deflect incident light into a specific diffraction order with nearperfect efficiency while such asymmetry can be achieved in a variety of ways eg by using a sawtooth blazed geometry a recently emerged approach is to use a planar metagrating comprised of designer multiresonant periodic units metamolecules here we demonstrate that a bianisotropic unit cell supporting four resonances interfering in the far field can be used as a building block for achieving the prefect deflection a coupled mode analysis shows that these modes provide a small number of orthogonal electromagnetic radiation patterns that are needed to suppress transmissionreflection into all but one diffraction order bianisotropy caused by a mirror symmetry breaking enables a normally incident wave to excite through nearfield couplings two otherwise dark resonant modes we design and experimentally realize bianisotropic metamolecules which are subwavelength in all three dimensions and whose optical properties are desensitized to fabrication imperfections by their geometric simplicity we show that optical beams tightly focused onto the metagratings with just a few unit cells can also be asymmetrically deflected with high efficiency paving the way for compact broadband optical devices | [['one', 'highly', 'desirable', 'function', 'of', 'a', 'diffraction', 'grating', 'is', 'its', 'ability', 'to', 'deflect', 'incident', 'light', 'into', 'a', 'specific', 'diffraction', 'order', 'with', 'nearperfect', 'efficiency', 'while', 'such', 'asymmetry', 'can', 'be', 'achieved', 'in', 'a', 'variety', 'of', 'ways', 'eg', 'by', 'using', 'a', 'sawtooth', 'blazed', 'geometry', 'a', 'recently', 'emerged', 'approach', 'is', 'to', 'use', 'a', 'planar', 'metagrating', 'comprised', 'of', 'designer', 'multiresonant', 'periodic', 'units', 'metamolecules', 'here', 'we', 'demonstrate', 'that', 'a', 'bianisotropic', 'unit', 'cell', 'supporting', 'four', 'resonances', 'interfering', 'in', 'the', 'far', 'field', 'can', 'be', 'used', 'as', 'a', 'building', 'block', 'for', 'achieving', 'the', 'prefect', 'deflection', 'a', 'coupled', 'mode', 'analysis', 'shows', 'that', 'these', 'modes', 'provide', 'a', 'small', 'number', 'of', 'orthogonal', 'electromagnetic', 'radiation', 'patterns', 'that', 'are', 'needed', 'to', 'suppress', 'transmissionreflection', 'into', 'all', 'but', 'one', 'diffraction', 'order', 'bianisotropy', 'caused', 'by', 'a', 'mirror', 'symmetry', 'breaking', 'enables', 'a', 'normally', 'incident', 'wave', 'to', 'excite', 'through', 'nearfield', 'couplings', 'two', 'otherwise', 'dark', 'resonant', 'modes', 'we', 'design', 'and', 'experimentally', 'realize', 'bianisotropic', 'metamolecules', 'which', 'are', 'subwavelength', 'in', 'all', 'three', 'dimensions', 'and', 'whose', 'optical', 'properties', 'are', 'desensitized', 'to', 'fabrication', 'imperfections', 'by', 'their', 'geometric', 'simplicity', 'we', 'show', 'that', 'optical', 'beams', 'tightly', 'focused', 'onto', 'the', 'metagratings', 'with', 'just', 'a', 'few', 'unit', 'cells', 'can', 'also', 'be', 'asymmetrically', 'deflected', 'with', 'high', 'efficiency', 'paving', 'the', 'way', 'for', 'compact', 'broadband', 'optical', 'devices']] | [-0.16617834918101185, 0.18952282047260324, -0.050984294624162874, -0.016552387669026777, -0.13195698936968775, -0.17138229321916493, 0.012073985591402506, 0.46616698598622214, -0.25052109439572207, -0.30142427148886636, 0.07078648310651224, -0.271586352103979, -0.1642532405557529, 0.2316442923477794, -0.01717681094661963, 0.07079327172494009, 0.0024095411660097427, -0.051439155641970984, 0.014004788256953565, -0.16177451439030774, 0.2383717803726429, 0.023834235458967408, 0.3127941826527121, 0.026581593794505854, 0.10257284828860845, 0.0347924888236757, 0.0703889171554878, 0.02279545509372838, -0.05029646482847854, 0.1311141325027815, 0.23251377882516697, 0.028380017428259765, 0.20732079455225103, -0.47831217297002415, -0.24055658731305476, 0.05784255051177603, 0.18959635735169583, 0.1206999162564824, -0.10069705732166767, -0.23957166311388112, 0.06996222528776307, -0.12343666263694437, -0.1696413510551941, -0.0948576113441959, -0.05281070940290359, 0.03389476870432524, -0.2779291402786134, -0.024541567183219665, 0.03584698420160507, 0.02122642530356439, -0.00023708697825691624, -0.03635870246691819, -0.03321097402035126, 0.06666509844410252, -0.024495846753445814, -0.010962670208049976, 0.15430503799663192, -0.09512043291850168, -0.11020012891213457, 0.4126719148498152, -0.031097543545837075, -0.21442431058943728, 0.16626621531477026, -0.16009379979888244, -0.02935367514502865, 0.19004962706762574, 0.18495716418054106, 0.10304569369372056, -0.14330958064742938, -0.0026228851169509317, -0.01105108951705173, 0.20242480277107572, 0.1576787800996146, 0.12220763916634403, 0.2964278366226627, 0.17450842965983462, 0.039848248849679926, 0.16464264563591297, -0.09254246727178557, 0.001886740300747357, -0.23768668376118401, -0.11840021437300104, -0.15741394231335273, 0.04579902989562656, -0.06753899201868656, -0.15497228717051295, 0.40315822515712707, 0.09998796326329526, 0.17958378428545763, -0.031269890361356224, 0.3477610970315124, 0.08325956922502029, 0.12818243813211555, 0.015528827739347304, 0.2958002394523795, 0.14809121755640764, 0.06536561091150138, -0.2069547653081827, -0.019725019326053406, -0.022321703751115318] |
1,802.0127 | The Social Structure of Consensus in Scientific Review | Personal connections between creators and evaluators of scientific works are
ubiquitous, and the possibility of bias ever-present. Although connections have
been shown to bias prospective judgments of (uncertain) future performance, it
is unknown whether such biases occur in the much more concrete task of
assessing the scientific validity of already completed work, and if so, why.
This study presents evidence that personal connections between authors and
reviewers of neuroscience manuscripts are associated with biased judgments and
explores the mechanisms driving the effect. Using reviews from 7,981
neuroscience manuscripts submitted to the journal PLOS ONE, which instructs
reviewers to evaluate manuscripts only on scientific validity, we find that
reviewers favored authors close in the co-authorship network by ~0.11 points on
a 1.0 - 4.0 scale for each step of proximity. PLOS ONE's validity-focused
review and the substantial amount of favoritism shown by distant vs. very
distant reviewers, both of whom should have little to gain from nepotism, point
to the central role of substantive disagreements between scientists in
different "schools of thought." The results suggest that removing bias from
peer review cannot be accomplished simply by recusing the closely-connected
reviewers, and highlight the value of recruiting reviewers embedded in diverse
professional networks.
| cs.DL | personal connections between creators and evaluators of scientific works are ubiquitous and the possibility of bias everpresent although connections have been shown to bias prospective judgments of uncertain future performance it is unknown whether such biases occur in the much more concrete task of assessing the scientific validity of already completed work and if so why this study presents evidence that personal connections between authors and reviewers of neuroscience manuscripts are associated with biased judgments and explores the mechanisms driving the effect using reviews from 7981 neuroscience manuscripts submitted to the journal plos one which instructs reviewers to evaluate manuscripts only on scientific validity we find that reviewers favored authors close in the coauthorship network by 011 points on a 10 40 scale for each step of proximity plos ones validityfocused review and the substantial amount of favoritism shown by distant vs very distant reviewers both of whom should have little to gain from nepotism point to the central role of substantive disagreements between scientists in different schools of thought the results suggest that removing bias from peer review cannot be accomplished simply by recusing the closelyconnected reviewers and highlight the value of recruiting reviewers embedded in diverse professional networks | [['personal', 'connections', 'between', 'creators', 'and', 'evaluators', 'of', 'scientific', 'works', 'are', 'ubiquitous', 'and', 'the', 'possibility', 'of', 'bias', 'everpresent', 'although', 'connections', 'have', 'been', 'shown', 'to', 'bias', 'prospective', 'judgments', 'of', 'uncertain', 'future', 'performance', 'it', 'is', 'unknown', 'whether', 'such', 'biases', 'occur', 'in', 'the', 'much', 'more', 'concrete', 'task', 'of', 'assessing', 'the', 'scientific', 'validity', 'of', 'already', 'completed', 'work', 'and', 'if', 'so', 'why', 'this', 'study', 'presents', 'evidence', 'that', 'personal', 'connections', 'between', 'authors', 'and', 'reviewers', 'of', 'neuroscience', 'manuscripts', 'are', 'associated', 'with', 'biased', 'judgments', 'and', 'explores', 'the', 'mechanisms', 'driving', 'the', 'effect', 'using', 'reviews', 'from', '7981', 'neuroscience', 'manuscripts', 'submitted', 'to', 'the', 'journal', 'plos', 'one', 'which', 'instructs', 'reviewers', 'to', 'evaluate', 'manuscripts', 'only', 'on', 'scientific', 'validity', 'we', 'find', 'that', 'reviewers', 'favored', 'authors', 'close', 'in', 'the', 'coauthorship', 'network', 'by', '011', 'points', 'on', 'a', '10', '40', 'scale', 'for', 'each', 'step', 'of', 'proximity', 'plos', 'ones', 'validityfocused', 'review', 'and', 'the', 'substantial', 'amount', 'of', 'favoritism', 'shown', 'by', 'distant', 'vs', 'very', 'distant', 'reviewers', 'both', 'of', 'whom', 'should', 'have', 'little', 'to', 'gain', 'from', 'nepotism', 'point', 'to', 'the', 'central', 'role', 'of', 'substantive', 'disagreements', 'between', 'scientists', 'in', 'different', 'schools', 'of', 'thought', 'the', 'results', 'suggest', 'that', 'removing', 'bias', 'from', 'peer', 'review', 'can', 'not', 'be', 'accomplished', 'simply', 'by', 'recusing', 'the', 'closelyconnected', 'reviewers', 'and', 'highlight', 'the', 'value', 'of', 'recruiting', 'reviewers', 'embedded', 'in', 'diverse', 'professional', 'networks']] | [-0.08426804662868853, 0.07186367593204536, -0.04263222759334266, 0.09270645757229422, -0.1590511645447477, -0.14639271566169196, 0.11527304457699133, 0.39508241213631207, -0.20701821946874638, -0.39313210980248103, 0.04207779809851483, -0.3330842619998201, -0.17922838773580768, 0.19279819671395543, -0.1309168516412415, -0.037664693214122184, 0.09497156310448338, 0.026175546195112205, 0.01882164624075259, -0.34527682113995406, 0.3142573068551908, 0.10894550343379757, 0.2989182914914516, 0.06799516818347431, 0.02480170779294502, -0.05102278342697152, -0.13546382840888263, 0.030554722920698375, -0.09487659857781376, 0.12428693972743084, 0.3373120552612005, 0.16942186994272904, 0.41797300062359777, -0.42154884877789595, -0.15986365408974648, 0.07161492135536474, 0.11600349821046298, 0.06655898638280004, -0.03630770064943865, -0.32872597298343775, 0.06880072389875874, -0.19271481367712132, -0.047352742797903115, -0.0467154987825336, 0.0755053478042562, 0.018658070818835464, -0.15640390343576444, 0.06558532693758985, 0.03275234674441576, 0.14085683182146647, 0.0003165502330467937, -0.16575784995669718, -0.004642727330379037, 0.21412873071344182, 0.1230543292503388, 0.025184410620660423, 0.1374281704222528, -0.1751852636505849, -0.15976026092317938, 0.36986361567857606, 0.03284254735855736, -0.15181876954096335, 0.2110925914239857, -0.11556502012063177, -0.1373801759035246, 0.02555317599515473, 0.16720732616208644, 0.03543389317707211, -0.18914543798779548, -0.0005313325103083956, 0.006375083136064979, 0.18599867680642476, 0.09209918345414518, -0.01114022053853812, 0.25246440091283834, 0.13331050092950086, -0.00380967402840175, 0.08396225745865347, 0.00436313545330177, -0.08694216233606067, -0.2209763390196459, -0.11808615833813996, -0.16048041551709552, 0.05952723711017852, -0.0317749087353796, -0.1025406912156513, 0.36039037121280193, 0.22114176403608193, 0.15947318103088795, -0.011185585945456994, 0.2575691518477793, -0.007162538926745883, 0.08240692766246192, 0.06227642907802403, 0.25820488636771943, 0.059924938055913576, 0.1377410022967358, -0.12751312507050547, 0.15436962822471098, -0.024023061197459093] |
1,802.01271 | Stochastic control and non-equilibrium thermodynamics: fundamental
limits | We consider damped stochastic systems in a controlled (time-varying)
quadratic potential and study their transition between specified
Gibbs-equilibria states in finite time. By the second law of thermodynamics,
the minimum amount of work needed to transition from one equilibrium state to
another is the difference between the Helmholtz free energy of the two states
and can only be achieved by a reversible (infinitely slow) process. The minimal
gap between the work needed in a finite-time transition and the work during a
reversible one, turns out to equal the square of the optimal mass transport
(Wasserstein-2) distance between the two end-point distributions times the
inverse of the duration needed for the transition. This result, in fact,
relates non-equilibrium optimal control strategies (protocols) to gradient
flows of entropy functionals via and the Jordan-Kinderlehrer-Otto scheme. The
purpose of this paper is to introduce ideas and results from the emerging field
of stochastic thermodynamics in the setting of classical regulator theory, and
to draw connections and derive such fundamental relations from a control
perspective in a multivariable setting.
| cond-mat.stat-mech cs.SY math.OC | we consider damped stochastic systems in a controlled timevarying quadratic potential and study their transition between specified gibbsequilibria states in finite time by the second law of thermodynamics the minimum amount of work needed to transition from one equilibrium state to another is the difference between the helmholtz free energy of the two states and can only be achieved by a reversible infinitely slow process the minimal gap between the work needed in a finitetime transition and the work during a reversible one turns out to equal the square of the optimal mass transport wasserstein2 distance between the two endpoint distributions times the inverse of the duration needed for the transition this result in fact relates nonequilibrium optimal control strategies protocols to gradient flows of entropy functionals via and the jordankinderlehrerotto scheme the purpose of this paper is to introduce ideas and results from the emerging field of stochastic thermodynamics in the setting of classical regulator theory and to draw connections and derive such fundamental relations from a control perspective in a multivariable setting | [['we', 'consider', 'damped', 'stochastic', 'systems', 'in', 'a', 'controlled', 'timevarying', 'quadratic', 'potential', 'and', 'study', 'their', 'transition', 'between', 'specified', 'gibbsequilibria', 'states', 'in', 'finite', 'time', 'by', 'the', 'second', 'law', 'of', 'thermodynamics', 'the', 'minimum', 'amount', 'of', 'work', 'needed', 'to', 'transition', 'from', 'one', 'equilibrium', 'state', 'to', 'another', 'is', 'the', 'difference', 'between', 'the', 'helmholtz', 'free', 'energy', 'of', 'the', 'two', 'states', 'and', 'can', 'only', 'be', 'achieved', 'by', 'a', 'reversible', 'infinitely', 'slow', 'process', 'the', 'minimal', 'gap', 'between', 'the', 'work', 'needed', 'in', 'a', 'finitetime', 'transition', 'and', 'the', 'work', 'during', 'a', 'reversible', 'one', 'turns', 'out', 'to', 'equal', 'the', 'square', 'of', 'the', 'optimal', 'mass', 'transport', 'wasserstein2', 'distance', 'between', 'the', 'two', 'endpoint', 'distributions', 'times', 'the', 'inverse', 'of', 'the', 'duration', 'needed', 'for', 'the', 'transition', 'this', 'result', 'in', 'fact', 'relates', 'nonequilibrium', 'optimal', 'control', 'strategies', 'protocols', 'to', 'gradient', 'flows', 'of', 'entropy', 'functionals', 'via', 'and', 'the', 'jordankinderlehrerotto', 'scheme', 'the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'introduce', 'ideas', 'and', 'results', 'from', 'the', 'emerging', 'field', 'of', 'stochastic', 'thermodynamics', 'in', 'the', 'setting', 'of', 'classical', 'regulator', 'theory', 'and', 'to', 'draw', 'connections', 'and', 'derive', 'such', 'fundamental', 'relations', 'from', 'a', 'control', 'perspective', 'in', 'a', 'multivariable', 'setting']] | [-0.12317410556026169, 0.1475385516011183, -0.10093843613918117, 0.06345393485159384, -0.01603880020213782, -0.131913752898014, 0.11495154782472922, 0.3112981254625204, -0.32659296011632966, -0.29040498305327456, 0.0838013056785439, -0.25805074603679035, -0.14265073411102067, 0.1791394202999577, -0.06008351754364854, 0.0848871223746955, 0.0006381797178976798, 0.03207400598633238, -0.08217576460850914, -0.19037596281144142, 0.3375114900264566, 0.04051152126718248, 0.28487757855294155, 0.05161453488903124, 0.11264510037285959, -0.006091785998045968, -0.007069033947423359, 0.0029954505684607895, -0.16873701716197193, 0.13269058545591106, 0.24397592138595922, 0.07475978731463066, 0.30529089540113946, -0.4248251763382399, -0.20545478472539971, 0.1436740547456278, 0.09343644598535278, 0.10933436504888182, -0.02449125411914866, -0.2094237772920142, 0.045868793388726355, -0.1521806357067746, -0.12510800228226726, -0.0285692652418262, 0.0027224857816364983, 0.030536718089187335, -0.2587033265614828, 0.10122642925848936, 0.08752002278908097, 0.030119985858829034, -0.05215690564229611, -0.04422592754728791, -0.007343913409643608, 0.15304463020945774, 0.05785662019702692, 0.014861379662593235, 0.11244827693845065, -0.10576319113115355, -0.13171276193639705, 0.3511182662244951, -0.06546728722643473, -0.18133608074158947, 0.17139735353324628, -0.11643154727095857, -0.09219931274103378, 0.10514446021988988, 0.17026049728542997, 0.14143868842697332, -0.1822969882010154, 0.07930295581887664, 0.022394572691507422, 0.14578258690042045, 0.03673849784569933, 0.007066388862110631, 0.18279955237299725, 0.11848398916574054, 0.11659560520255755, 0.1805472462660111, -0.025048316562026093, -0.2016136451742768, -0.3333622639503524, -0.16955745412437837, -0.18458500114737908, 0.06536022258849782, -0.06909472174275293, -0.13425715269407829, 0.37945734175948564, 0.1370710818728868, 0.19861978988400042, 0.06376425623005483, 0.2703390903232587, 0.15113248076354494, 0.01670276337152487, 0.06313830088134963, 0.23438749849833979, 0.1758452568558513, 0.12250094508719926, -0.24917735477516292, 0.048312757718726736, 0.08977093248805731] |
1,802.01272 | Corner transport upwind lattice Boltzmann model for bubble cavitation | Aiming to study the bubble cavitation problem in quiescent and sheared
liquids, a third-order isothermal lattice Boltzmann (LB) model that describes a
two-dimensional ($2D$) fluid obeying the van der Waals equation of state, is
introduced. The evolution equations for the distribution functions in this
off-lattice model with 16 velocities are solved using the corner transport
upwind (CTU) numerical scheme on large square lattices (up to $6144 \times
6144$ nodes). The numerical viscosity and the regularization of the model are
discussed for first and second order CTU schemes finding that the latter choice
allows to obtain a very accurate phase diagram of a nonideal fluid. In a
quiescent liquid, the present model allows to recover the solution of the $2D$
Rayleigh-Plesset equation for a growing vapor bubble. In a sheared liquid, we
investigated the evolution of the total bubble area, the bubble deformation and
the bubble tilt angle, for various values of the shear rate. A linear relation
between the dimensionless deformation coefficient $D$ and the capillary number
$Ca$ is found at small $Ca$ but with a different factor than in equilibrium
liquids. A non-linear regime is observed for $Ca \gtrsim 0.2$.
| physics.comp-ph cond-mat.soft | aiming to study the bubble cavitation problem in quiescent and sheared liquids a thirdorder isothermal lattice boltzmann lb model that describes a twodimensional 2d fluid obeying the van der waals equation of state is introduced the evolution equations for the distribution functions in this offlattice model with 16 velocities are solved using the corner transport upwind ctu numerical scheme on large square lattices up to 6144 times 6144 nodes the numerical viscosity and the regularization of the model are discussed for first and second order ctu schemes finding that the latter choice allows to obtain a very accurate phase diagram of a nonideal fluid in a quiescent liquid the present model allows to recover the solution of the 2d rayleighplesset equation for a growing vapor bubble in a sheared liquid we investigated the evolution of the total bubble area the bubble deformation and the bubble tilt angle for various values of the shear rate a linear relation between the dimensionless deformation coefficient d and the capillary number ca is found at small ca but with a different factor than in equilibrium liquids a nonlinear regime is observed for ca gtrsim 02 | [['aiming', 'to', 'study', 'the', 'bubble', 'cavitation', 'problem', 'in', 'quiescent', 'and', 'sheared', 'liquids', 'a', 'thirdorder', 'isothermal', 'lattice', 'boltzmann', 'lb', 'model', 'that', 'describes', 'a', 'twodimensional', '2d', 'fluid', 'obeying', 'the', 'van', 'der', 'waals', 'equation', 'of', 'state', 'is', 'introduced', 'the', 'evolution', 'equations', 'for', 'the', 'distribution', 'functions', 'in', 'this', 'offlattice', 'model', 'with', '16', 'velocities', 'are', 'solved', 'using', 'the', 'corner', 'transport', 'upwind', 'ctu', 'numerical', 'scheme', 'on', 'large', 'square', 'lattices', 'up', 'to', '6144', 'times', '6144', 'nodes', 'the', 'numerical', 'viscosity', 'and', 'the', 'regularization', 'of', 'the', 'model', 'are', 'discussed', 'for', 'first', 'and', 'second', 'order', 'ctu', 'schemes', 'finding', 'that', 'the', 'latter', 'choice', 'allows', 'to', 'obtain', 'a', 'very', 'accurate', 'phase', 'diagram', 'of', 'a', 'nonideal', 'fluid', 'in', 'a', 'quiescent', 'liquid', 'the', 'present', 'model', 'allows', 'to', 'recover', 'the', 'solution', 'of', 'the', '2d', 'rayleighplesset', 'equation', 'for', 'a', 'growing', 'vapor', 'bubble', 'in', 'a', 'sheared', 'liquid', 'we', 'investigated', 'the', 'evolution', 'of', 'the', 'total', 'bubble', 'area', 'the', 'bubble', 'deformation', 'and', 'the', 'bubble', 'tilt', 'angle', 'for', 'various', 'values', 'of', 'the', 'shear', 'rate', 'a', 'linear', 'relation', 'between', 'the', 'dimensionless', 'deformation', 'coefficient', 'd', 'and', 'the', 'capillary', 'number', 'ca', 'is', 'found', 'at', 'small', 'ca', 'but', 'with', 'a', 'different', 'factor', 'than', 'in', 'equilibrium', 'liquids', 'a', 'nonlinear', 'regime', 'is', 'observed', 'for', 'ca', 'gtrsim', '02']] | [-0.1368041730995402, 0.14151695583756838, -0.07075350257416904, 0.010842533328653318, -0.01940648536153957, -0.1509812085216387, 0.027439098090240584, 0.31596338459889706, -0.26165407568372356, -0.27320454862573385, 0.06559989142721685, -0.2775031145132105, -0.10558996720883157, 0.15780191623888598, 0.030913646762010628, 0.08728927232671581, 0.006116135931495792, -0.049197598365354915, -0.08033525620962625, -0.2117106472605264, 0.25937996801758106, 0.05228915023349265, 0.2898956817423642, 0.02653035249790245, 0.13018217653460332, -0.05976438891942276, 0.0021999318064897474, 0.07510429823098226, -0.2392705441687984, 0.04888287191925307, 0.20328197209774004, -0.039510025779341214, 0.2402172970575773, -0.42555066724234697, -0.23521393200587384, 0.022347949145371533, 0.11992327796285533, 0.13445542009147518, -0.02556390328227185, -0.2107188034051766, 0.03399971207477035, -0.1852000610261707, -0.1569254443306032, -0.04142891599050679, 0.042830363452356524, 0.029201991974037257, -0.2645840516986803, 0.16067867723649554, 0.008680792665596642, 0.038475486435269185, -0.09319913515233537, -0.08740114662503697, -0.035323384927990434, 0.04908476043151233, 0.005317544814501523, 0.024383116404998913, 0.1331455605982252, -0.1704362952503917, -0.014709787218982636, 0.44031534657486915, -0.059223598864978466, -0.18620009807606486, 0.17827498379860718, -0.1640572166216623, -0.06472631913661, 0.18834990879803584, 0.14929275620845756, 0.10313414493093041, -0.10356952527450174, 0.043783694053134585, -0.06358441498821737, 0.1760090304616624, 0.07021465647175752, -0.07579663580195754, 0.184730520118418, 0.1941612240741351, 0.03695749650411893, 0.13580739956729465, -0.1350077992653796, -0.14559485470261718, -0.2780539627182078, -0.18023200182746107, -0.1702987348114711, 0.03002992703662259, -0.13985703467884825, -0.19652830836843427, 0.34243627659024056, 0.08349110183661988, 0.16648923625855058, 0.046907380568253665, 0.24175400891053583, 0.103610346398526, 0.025572769290216617, 0.10284266534690496, 0.2531723284545959, 0.16450564312524313, 0.14919367252424828, -0.2683320839650727, 0.03520006102543929, 0.15279534319049987] |
1,802.01273 | Face recognition for monitoring operator shift in railways | Train Pilot is a very tedious and stressful job. Pilots must be vigilant at
all times and its easy for them to lose track of time of shift. In countries
like USA the pilots are mandated by law to adhere to 8 hour shifts. If they
exceed 8 hours of shift the railroads may be penalized for over-tiring their
drivers. The problem happens when the 8 hour shift may end in middle of a
journey. In such case, the new drivers must be moved to the location locomotive
is operating for shift change. Hence accurate monitoring of drivers during
their shift and making sure the shifts are scheduled correctly is very
important for railroads. Here we propose an automated camera system that uses
camera mounted inside Locomotive cabs to continuously record video feeds. These
feeds are analyzed in real time to detect the face of driver and recognize the
driver using state of the art deep Learning techniques. The outcome is an
increased safety of train pilots. Cameras continuously capture video from
inside the cab which is stored on an on board data acquisition device. Using
advanced computer vision and deep learning techniques the videos are analyzed
at regular intervals to detect presence of the pilot and identify the pilot.
Using a time based analysis, it is identified for how long that shift has been
active. If this time exceeds allocated shift time an alert is sent to the
dispatch to adjust shift hours.
| cs.CV | train pilot is a very tedious and stressful job pilots must be vigilant at all times and its easy for them to lose track of time of shift in countries like usa the pilots are mandated by law to adhere to 8 hour shifts if they exceed 8 hours of shift the railroads may be penalized for overtiring their drivers the problem happens when the 8 hour shift may end in middle of a journey in such case the new drivers must be moved to the location locomotive is operating for shift change hence accurate monitoring of drivers during their shift and making sure the shifts are scheduled correctly is very important for railroads here we propose an automated camera system that uses camera mounted inside locomotive cabs to continuously record video feeds these feeds are analyzed in real time to detect the face of driver and recognize the driver using state of the art deep learning techniques the outcome is an increased safety of train pilots cameras continuously capture video from inside the cab which is stored on an on board data acquisition device using advanced computer vision and deep learning techniques the videos are analyzed at regular intervals to detect presence of the pilot and identify the pilot using a time based analysis it is identified for how long that shift has been active if this time exceeds allocated shift time an alert is sent to the dispatch to adjust shift hours | [['train', 'pilot', 'is', 'a', 'very', 'tedious', 'and', 'stressful', 'job', 'pilots', 'must', 'be', 'vigilant', 'at', 'all', 'times', 'and', 'its', 'easy', 'for', 'them', 'to', 'lose', 'track', 'of', 'time', 'of', 'shift', 'in', 'countries', 'like', 'usa', 'the', 'pilots', 'are', 'mandated', 'by', 'law', 'to', 'adhere', 'to', '8', 'hour', 'shifts', 'if', 'they', 'exceed', '8', 'hours', 'of', 'shift', 'the', 'railroads', 'may', 'be', 'penalized', 'for', 'overtiring', 'their', 'drivers', 'the', 'problem', 'happens', 'when', 'the', '8', 'hour', 'shift', 'may', 'end', 'in', 'middle', 'of', 'a', 'journey', 'in', 'such', 'case', 'the', 'new', 'drivers', 'must', 'be', 'moved', 'to', 'the', 'location', 'locomotive', 'is', 'operating', 'for', 'shift', 'change', 'hence', 'accurate', 'monitoring', 'of', 'drivers', 'during', 'their', 'shift', 'and', 'making', 'sure', 'the', 'shifts', 'are', 'scheduled', 'correctly', 'is', 'very', 'important', 'for', 'railroads', 'here', 'we', 'propose', 'an', 'automated', 'camera', 'system', 'that', 'uses', 'camera', 'mounted', 'inside', 'locomotive', 'cabs', 'to', 'continuously', 'record', 'video', 'feeds', 'these', 'feeds', 'are', 'analyzed', 'in', 'real', 'time', 'to', 'detect', 'the', 'face', 'of', 'driver', 'and', 'recognize', 'the', 'driver', 'using', 'state', 'of', 'the', 'art', 'deep', 'learning', 'techniques', 'the', 'outcome', 'is', 'an', 'increased', 'safety', 'of', 'train', 'pilots', 'cameras', 'continuously', 'capture', 'video', 'from', 'inside', 'the', 'cab', 'which', 'is', 'stored', 'on', 'an', 'on', 'board', 'data', 'acquisition', 'device', 'using', 'advanced', 'computer', 'vision', 'and', 'deep', 'learning', 'techniques', 'the', 'videos', 'are', 'analyzed', 'at', 'regular', 'intervals', 'to', 'detect', 'presence', 'of', 'the', 'pilot', 'and', 'identify', 'the', 'pilot', 'using', 'a', 'time', 'based', 'analysis', 'it', 'is', 'identified', 'for', 'how', 'long', 'that', 'shift', 'has', 'been', 'active', 'if', 'this', 'time', 'exceeds', 'allocated', 'shift', 'time', 'an', 'alert', 'is', 'sent', 'to', 'the', 'dispatch', 'to', 'adjust', 'shift', 'hours']] | [-0.09992323199372333, 0.13461029163102808, -0.08255918613930115, 0.04514729177460473, -0.11386296850219062, -0.18772789056761643, 0.059349433211619305, 0.4424350437604719, -0.2670279709323321, -0.3492027610739685, 0.17191077238370361, -0.2891263945656733, -0.1007107895695501, 0.21046842713054623, -0.1536199764153104, 0.005308107812620638, 0.09955338371722143, 0.08473046954123327, -0.012685724273956393, -0.26889735163169287, 0.22587241794158985, 0.07486169879710869, 0.2944958785063982, -0.020211238517529435, 0.10865779255790858, 0.02373465360286013, -0.03643944510546179, -0.0575345794175878, -0.031221533594032607, 0.07428053900965494, 0.3128431213247387, 0.18537833504168003, 0.3166469795602554, -0.44848987112519306, -0.16507608352282654, 0.09972051121275335, 0.13593162055804736, 0.05356992972744514, -0.00435832582812741, -0.3141984056993752, 0.0997923733321605, -0.16038196798942891, -0.10094883300770273, -0.03807965588828725, 0.048098774211013634, 0.02430511408565957, -0.2525070112020375, -0.005307728258429149, -0.02155801843000967, 0.0741120184399954, -0.06887217867140248, -0.04948833431625056, 0.00989942162569781, 0.25535098587245675, 0.04697069705467778, 0.052206263256569706, 0.1762083406433647, -0.10748819123336532, -0.07959723383583006, 0.364526736053711, -0.021336185247297187, -0.11897446240735367, 0.16673866625005235, -0.09477214439323654, -0.11180242506771372, 0.16971221560451352, 0.23376563800749878, 0.09333440662068128, -0.15141379008762618, -0.01784297123306082, 0.02978617415060155, 0.2252299793049264, 0.08986530136010407, -0.00925780018986061, 0.20409072456122548, 0.18950777210260708, 0.08249421125477172, 0.09825566718057795, -0.15196263835846385, -0.06460323045221866, -0.23394287006887357, -0.10834660681405099, -0.16901673662903577, -0.0017934939129385377, -0.007138433354190999, -0.09470356392018774, 0.372537121057909, 0.18224335320910953, 0.15085601096075993, 0.04655817578165359, 0.3422824707066203, 0.10568289948558365, 0.1394507240584511, 0.0771187459926625, 0.21528185095825833, -0.013756639860213998, 0.18669408479937324, -0.18823430917145292, 0.0955149205631496, 0.0018678028075409662] |
1,802.01274 | Dream Formulations and Deep Neural Networks: Humanistic Themes in the
Iconology of the Machine-Learned Image | This paper addresses the interpretability of deep learning-enabled image
recognition processes in computer vision science in relation to theories in art
history and cognitive psychology on the vision-related perceptual capabilities
of humans. Examination of what is determinable about the machine-learned image
in comparison to humanistic theories of visual perception, particularly in
regard to art historian Erwin Panofsky's methodology for image analysis and
psychologist Eleanor Rosch's theory of graded categorization according to
prototypes, finds that there are surprising similarities between the two that
suggest that researchers in the arts and the sciences would have much to
benefit from closer collaborations. Utilizing the examples of Google's
DeepDream and the Machine Learning and Perception Lab at Georgia Tech's
Grad-CAM: Gradient-weighted Class Activation Mapping programs, this study
suggests that a revival of art historical research in iconography and formalism
in the age of AI is essential for shaping the future navigation and
interpretation of all machine-learned images, given the rapid developments in
image recognition technologies.
| cs.CY cs.AI cs.CV | this paper addresses the interpretability of deep learningenabled image recognition processes in computer vision science in relation to theories in art history and cognitive psychology on the visionrelated perceptual capabilities of humans examination of what is determinable about the machinelearned image in comparison to humanistic theories of visual perception particularly in regard to art historian erwin panofskys methodology for image analysis and psychologist eleanor roschs theory of graded categorization according to prototypes finds that there are surprising similarities between the two that suggest that researchers in the arts and the sciences would have much to benefit from closer collaborations utilizing the examples of googles deepdream and the machine learning and perception lab at georgia techs gradcam gradientweighted class activation mapping programs this study suggests that a revival of art historical research in iconography and formalism in the age of ai is essential for shaping the future navigation and interpretation of all machinelearned images given the rapid developments in image recognition technologies | [['this', 'paper', 'addresses', 'the', 'interpretability', 'of', 'deep', 'learningenabled', 'image', 'recognition', 'processes', 'in', 'computer', 'vision', 'science', 'in', 'relation', 'to', 'theories', 'in', 'art', 'history', 'and', 'cognitive', 'psychology', 'on', 'the', 'visionrelated', 'perceptual', 'capabilities', 'of', 'humans', 'examination', 'of', 'what', 'is', 'determinable', 'about', 'the', 'machinelearned', 'image', 'in', 'comparison', 'to', 'humanistic', 'theories', 'of', 'visual', 'perception', 'particularly', 'in', 'regard', 'to', 'art', 'historian', 'erwin', 'panofskys', 'methodology', 'for', 'image', 'analysis', 'and', 'psychologist', 'eleanor', 'roschs', 'theory', 'of', 'graded', 'categorization', 'according', 'to', 'prototypes', 'finds', 'that', 'there', 'are', 'surprising', 'similarities', 'between', 'the', 'two', 'that', 'suggest', 'that', 'researchers', 'in', 'the', 'arts', 'and', 'the', 'sciences', 'would', 'have', 'much', 'to', 'benefit', 'from', 'closer', 'collaborations', 'utilizing', 'the', 'examples', 'of', 'googles', 'deepdream', 'and', 'the', 'machine', 'learning', 'and', 'perception', 'lab', 'at', 'georgia', 'techs', 'gradcam', 'gradientweighted', 'class', 'activation', 'mapping', 'programs', 'this', 'study', 'suggests', 'that', 'a', 'revival', 'of', 'art', 'historical', 'research', 'in', 'iconography', 'and', 'formalism', 'in', 'the', 'age', 'of', 'ai', 'is', 'essential', 'for', 'shaping', 'the', 'future', 'navigation', 'and', 'interpretation', 'of', 'all', 'machinelearned', 'images', 'given', 'the', 'rapid', 'developments', 'in', 'image', 'recognition', 'technologies']] | [-0.020547930755081677, 0.024283713025168605, -0.09579777014441788, 0.07055012265881223, -0.13412291142909277, -0.13226992117481368, -0.00718443634273905, 0.41473512953567887, -0.2361515313386917, -0.3532970921557036, 0.06280365489843873, -0.296159585412111, -0.23056345761513278, 0.22189489482045774, -0.1698329841057139, 0.042867074786655364, 0.11849051439653963, 0.06264073178791742, -0.05597685276560726, -0.2503061305190767, 0.2672719138674438, 0.05977350590100902, 0.3464586773166253, 0.04161611860918422, 0.07169511311597401, -0.0012269139811847238, -0.07804445990271146, -0.040951838123944456, -0.08999090288510365, 0.1980563276766559, 0.3902179703086374, 0.2856281593111494, 0.3563958754823093, -0.4020171706414511, -0.2014225131268763, 0.04617932709835229, 0.13798454172849176, 0.06107207567941758, -0.05900392542638245, -0.35077194426088565, 0.04772873431849744, -0.1640967219887722, -0.025453235593534285, -0.06516654306061326, 0.06758077145298763, -0.028491945776547636, -0.1766171787955588, 0.007032533376402552, 0.06318932004393109, 0.16559178771811628, -0.08789030823165611, -0.12723314172678415, 0.04180570036593464, 0.18393930756081375, 0.045121889120538626, 0.08082892206016808, 0.14588545366761185, -0.2800914122632915, -0.18881635105597877, 0.3738621276232504, -0.004611201707514063, -0.1200110369992833, 0.22969036044012153, -0.11594231790307188, -0.20419970988145758, 0.04883077222132875, 0.20662187167233037, 0.04356971656933667, -0.14113012847965659, 0.03398867568579472, -0.016995632337526448, 0.14508290838810706, 0.06583119204132667, 0.004755038604320538, 0.22499085939339092, 0.22752128386749856, -0.022903678766001138, 0.08987272933365838, -0.04967703596208124, -0.1138341278498692, -0.20186109308513903, -0.15964796039439652, -0.1428909161255785, -0.0036230873879826357, -0.04824481207150741, -0.10554975342726515, 0.3906348935208253, 0.265270298965756, 0.11522935849479249, 0.03892488904417522, 0.30587427552428936, -0.004190667274017488, 0.09825381612435223, 0.022935587424604643, 0.21025097649093838, 0.05686232484276256, 0.19203161850511546, -0.1648222462138942, 0.08662868098547352, 0.03371938002246973] |
1,802.01275 | All principal congruence link groups | We enumerate all the principal congruence link complements in $S^3$, there by
answering a question of W. Thurston.
Related articles: "Technical Report: All Principal Congruence Link Groups"
(arXiv:1902.04722), "All Known Principal Congruence Links" (arXiv:1902.04426).
| math.GT | we enumerate all the principal congruence link complements in s3 there by answering a question of w thurston related articles technical report all principal congruence link groups arxiv190204722 all known principal congruence links arxiv190204426 | [['we', 'enumerate', 'all', 'the', 'principal', 'congruence', 'link', 'complements', 'in', 's3', 'there', 'by', 'answering', 'a', 'question', 'of', 'w', 'thurston', 'related', 'articles', 'technical', 'report', 'all', 'principal', 'congruence', 'link', 'groups', 'arxiv190204722', 'all', 'known', 'principal', 'congruence', 'links', 'arxiv190204426']] | [-0.3510800672811456, 0.057900681320461445, 0.024263460654765368, 0.0787423682922963, -0.1745178327691974, -0.21050299917988013, 0.05218523401708808, 0.3428637774195522, -0.32649797876365483, -0.23341537348460406, 0.0649887247091101, -0.3239909982075915, -0.16786918105208315, 0.184524549607886, -0.11027370125520974, 0.03192723315441981, 0.0980498103890568, 0.07467099133646116, -0.04034207499353215, -0.37250730337109417, 0.4251060220558429, -0.048619780092849396, 0.25932926806854084, 0.04444361705100164, 0.04980437640915625, 0.052785155196033884, -0.21277488226769492, -0.04046829149592668, -0.20874316996196285, 0.12926614042953588, 0.3692448998335749, 0.11457898651133291, 0.19439856769167818, -0.2770702892448753, -0.09843477555841673, 0.1947226048578159, 0.17559547658311203, -0.103981130203465, 0.06490733823738992, -0.2250865459209308, 0.056153717887355015, -0.12283140019280836, -0.09643824434897397, -0.09247136814519763, 0.05486551015928853, 0.012146058666985482, -0.004712020017905161, -0.00038627866888418794, 0.15019449748797342, 0.19328544937889092, -0.023590630109538324, -0.12211562413722277, 0.04626492214447353, 0.16722961647610646, 0.12683471495984122, 0.06307971761270892, 0.05489318045147229, -0.026436348736751825, -0.21542245510499924, 0.3999459818005562, 0.01955194878973998, -0.1911866000154987, 0.1459404320921749, -0.13182913009950425, -0.3442263922188431, 0.13978901760128792, -0.009872859925962985, 0.032684899517335, -0.044361321663018316, 0.12850358086870983, -0.22958602671860717, 0.07891818993084598, 0.22881042293738574, -0.08624859870178625, 0.14667276994441636, 0.01383987592998892, 0.037521528865909204, 0.14382658031536266, 0.10883195159840398, 0.1102022623817902, -0.3390671843662858, -0.26847795766661875, -0.1030779989923758, 0.1672024174768012, -0.08562054531648755, -0.17164332042011665, 0.4060546807013452, 0.0554554283444304, 0.13562128401827067, 0.14162849241984077, 0.20462518605199875, -0.11608480347786099, 0.015860820763009542, 0.1460931910551153, 0.08517275570193306, 0.2434417970944196, -0.0902202675351873, -0.07065401544241467, -0.013171925878850743, 0.20387852084240876] |
1,802.01276 | Strong Decays of the Orbitally Excited Scalar $D^{*}_{0}$ Mesons | We calculate the two-body strong decays of the orbitally excited scalar
mesons $D_0^*(2400)$ and $D_J^*(3000)$ by using the relativistic Bethe-Salpeter
(BS) method. $D_J^*(3000)$ was observed recently by the LHCb Collaboration, the
quantum number of which has not been determined yet. In this paper, we assume
that it is the $0^+(2P)$ state and obtain the transition amplitude by using the
PCAC relation, low-energy theorem and effective Lagrangian method. For the $1P$
state, the total widths of $D_0^*(2400)^{0}$ and $ D_0^*(2400)^+$ are 226 MeV
and 246 MeV, respectively. With the assumption of $0^+(2P)$ state, the widths
of $D_J^*(3000)^0$ and $D_J^*(3000)^+$ are both about 131 MeV, which is close
to the present experimental data. Therefore, $D_J^*(3000)$ is a strong
candidate for the $2^3P_0$ state.
| hep-ph | we calculate the twobody strong decays of the orbitally excited scalar mesons d_02400 and d_j3000 by using the relativistic bethesalpeter bs method d_j3000 was observed recently by the lhcb collaboration the quantum number of which has not been determined yet in this paper we assume that it is the 02p state and obtain the transition amplitude by using the pcac relation lowenergy theorem and effective lagrangian method for the 1p state the total widths of d_024000 and d_02400 are 226 mev and 246 mev respectively with the assumption of 02p state the widths of d_j30000 and d_j3000 are both about 131 mev which is close to the present experimental data therefore d_j3000 is a strong candidate for the 23p_0 state | [['we', 'calculate', 'the', 'twobody', 'strong', 'decays', 'of', 'the', 'orbitally', 'excited', 'scalar', 'mesons', 'd_02400', 'and', 'd_j3000', 'by', 'using', 'the', 'relativistic', 'bethesalpeter', 'bs', 'method', 'd_j3000', 'was', 'observed', 'recently', 'by', 'the', 'lhcb', 'collaboration', 'the', 'quantum', 'number', 'of', 'which', 'has', 'not', 'been', 'determined', 'yet', 'in', 'this', 'paper', 'we', 'assume', 'that', 'it', 'is', 'the', '02p', 'state', 'and', 'obtain', 'the', 'transition', 'amplitude', 'by', 'using', 'the', 'pcac', 'relation', 'lowenergy', 'theorem', 'and', 'effective', 'lagrangian', 'method', 'for', 'the', '1p', 'state', 'the', 'total', 'widths', 'of', 'd_024000', 'and', 'd_02400', 'are', '226', 'mev', 'and', '246', 'mev', 'respectively', 'with', 'the', 'assumption', 'of', '02p', 'state', 'the', 'widths', 'of', 'd_j30000', 'and', 'd_j3000', 'are', 'both', 'about', '131', 'mev', 'which', 'is', 'close', 'to', 'the', 'present', 'experimental', 'data', 'therefore', 'd_j3000', 'is', 'a', 'strong', 'candidate', 'for', 'the', '23p_0', 'state']] | [-0.09472500373665084, 0.22708261290835774, -0.07270895244561645, 0.10436860663999413, -0.03684584332533523, -0.12908786677349454, 0.08303755877786276, 0.3377400635001369, -0.1698502322547456, -0.32183367868837637, 0.018072589446838278, -0.3286595499923087, -0.03804050656990745, 0.10799587444097807, 0.09853209925887103, 0.1010028717155831, 0.08514090699072067, 0.04746968585313258, -0.03111417025415243, -0.1697597452200567, 0.3111632298041358, 0.020387775672382764, 0.2339561783358391, 0.14315340657217, 0.02187846084503441, -0.015965720638632774, 0.03156152307891693, -0.06196656121681325, -0.11813520390420215, 0.07666654852975129, 0.19473822802926102, 0.09336033785659979, 0.1760867653080286, -0.3238380591934308, -0.13022283475814211, 0.0920833997392597, 0.1400939708806447, 0.11207216753003497, -0.014075477106066851, -0.4060083154397897, 0.1597282730329495, -0.18674632588910878, -0.1265516981211865, -0.09810694212812342, 0.03628274831825342, -0.03321963980093471, -0.273989583313879, 0.13516830530840482, -0.03606632977533035, 0.006447219405259587, -0.09173710675687234, -0.21614173998355737, -0.050886334284232594, 0.039476271296859294, 0.07016453289617904, 0.09668822179779284, 0.07476143637656146, -0.09855293001756708, -0.11567926901277219, 0.36390793941214555, -0.06484599238755102, -0.1277701831509809, 0.1081381800895931, -0.13462342809424058, -0.09048742001764795, 0.15375781616466677, 0.11480201503787285, 0.08128460660043499, -0.18832162600488234, 0.08442020614563814, -0.07139604636587393, 0.17245895937323952, 0.05110069556941844, 0.07042155728842585, 0.15126719117228293, 0.13625938600550094, -0.049942806442705996, 0.07425708053872371, -0.12994094503024578, -0.08125853594233337, -0.29601875070530254, -0.11367623794338323, -0.1517284700495756, 0.06326972869581556, 0.020278291606382094, -0.06406990216615108, 0.37821551968749517, 0.06003400624498852, 0.2266083840583252, 0.008335061848927766, 0.26148512956694275, 0.16112853650353912, 0.03920232388389926, 0.11089783471722442, 0.3564940550846882, 0.23323017571710497, 0.11342154647836573, -0.2805684316927233, 0.039104140451193876, 0.03364347428497341] |
1,802.01277 | Strong calmness of perturbed KKT system for a class of conic programming
with degenerate solutions | This paper is concerned with the strong calmness of the KKT solution mapping
for a class of canonically perturbed conic programming, which plays a central
role in achieving fast convergence under situations when the Lagrange
multiplier associated to a solution of these conic optimization problems is not
unique. We show that the strong calmness of the KKT solution mapping is
equivalent to a local error bound for solutions of perturbed KKT system, and is
also equivalent to the pseudo-isolated calmness of the stationary point mapping
along with the calmness of the multiplier set map at the corresponding
reference point. Sufficient conditions are also provided for the strong
calmness by establishing the pseudo-isolated calmness of the stationary point
mapping in terms of the noncriticality of the associated multiplier, and the
calmness of the multiplier set mapping in terms of a relative interior
condition for the multiplier set. These results cover and extend the existing
ones in \cite{Hager99,Izmailov12} for nonlinear programming and in
\cite{Cui16,Zhang17} for semidefinite programming.
| math.OC | this paper is concerned with the strong calmness of the kkt solution mapping for a class of canonically perturbed conic programming which plays a central role in achieving fast convergence under situations when the lagrange multiplier associated to a solution of these conic optimization problems is not unique we show that the strong calmness of the kkt solution mapping is equivalent to a local error bound for solutions of perturbed kkt system and is also equivalent to the pseudoisolated calmness of the stationary point mapping along with the calmness of the multiplier set map at the corresponding reference point sufficient conditions are also provided for the strong calmness by establishing the pseudoisolated calmness of the stationary point mapping in terms of the noncriticality of the associated multiplier and the calmness of the multiplier set mapping in terms of a relative interior condition for the multiplier set these results cover and extend the existing ones in citehager99izmailov12 for nonlinear programming and in citecui16zhang17 for semidefinite programming | [['this', 'paper', 'is', 'concerned', 'with', 'the', 'strong', 'calmness', 'of', 'the', 'kkt', 'solution', 'mapping', 'for', 'a', 'class', 'of', 'canonically', 'perturbed', 'conic', 'programming', 'which', 'plays', 'a', 'central', 'role', 'in', 'achieving', 'fast', 'convergence', 'under', 'situations', 'when', 'the', 'lagrange', 'multiplier', 'associated', 'to', 'a', 'solution', 'of', 'these', 'conic', 'optimization', 'problems', 'is', 'not', 'unique', 'we', 'show', 'that', 'the', 'strong', 'calmness', 'of', 'the', 'kkt', 'solution', 'mapping', 'is', 'equivalent', 'to', 'a', 'local', 'error', 'bound', 'for', 'solutions', 'of', 'perturbed', 'kkt', 'system', 'and', 'is', 'also', 'equivalent', 'to', 'the', 'pseudoisolated', 'calmness', 'of', 'the', 'stationary', 'point', 'mapping', 'along', 'with', 'the', 'calmness', 'of', 'the', 'multiplier', 'set', 'map', 'at', 'the', 'corresponding', 'reference', 'point', 'sufficient', 'conditions', 'are', 'also', 'provided', 'for', 'the', 'strong', 'calmness', 'by', 'establishing', 'the', 'pseudoisolated', 'calmness', 'of', 'the', 'stationary', 'point', 'mapping', 'in', 'terms', 'of', 'the', 'noncriticality', 'of', 'the', 'associated', 'multiplier', 'and', 'the', 'calmness', 'of', 'the', 'multiplier', 'set', 'mapping', 'in', 'terms', 'of', 'a', 'relative', 'interior', 'condition', 'for', 'the', 'multiplier', 'set', 'these', 'results', 'cover', 'and', 'extend', 'the', 'existing', 'ones', 'in', 'citehager99izmailov12', 'for', 'nonlinear', 'programming', 'and', 'in', 'citecui16zhang17', 'for', 'semidefinite', 'programming']] | [-0.1351811841292226, -0.07432860901408615, -0.05712546061099686, 0.05919113888922986, -0.04642252705164068, -0.14368010138780435, 0.021607143689461792, 0.30395306224547186, -0.34773513445665377, -0.21447317776565225, 0.17935241421905884, -0.271085385857902, -0.12047749961963537, 0.21183858355738638, -0.08376293867444677, 0.12549949446056755, 0.06639875871308656, 0.03385683109199083, -0.1499088172680085, -0.20268330055069156, 0.39527342076303423, 0.028290598838364486, 0.21666361680774956, 0.04272122677489363, 0.1382850690438233, -0.017722560074006827, 0.026804933466179216, 0.05006522511461784, -0.11096117410127121, 0.11585501447805892, 0.26307497478541425, 0.1521174470454408, 0.3277138383677287, -0.38174841495162826, -0.11668679480851622, 0.12337697851500526, 0.07803075152929433, 0.020901720401807832, -0.08960995921049475, -0.2851276973505383, 0.15865445779115886, -0.0478768258280358, -0.14535655789308666, -0.051826806912511035, -0.024617788815720482, 0.08780733162729917, -0.35423232212674266, 0.03488502034487966, 0.12140523836542512, 0.07091071768461363, -0.12815916223844848, -0.06135230137379435, -0.010223216416244829, 0.08861924583466163, 0.024236897038446264, 0.06488053266086286, 0.09684361705248481, -0.12528247366115589, -0.05051184958714691, 0.35896960188062016, -0.05495970789198503, -0.2694829728653921, 0.2016398854009946, -0.0983323630506624, -0.1218310235464448, 0.16066832436965953, 0.13567609280949425, 0.16094766043832306, -0.1751644593271787, 0.15367574673232778, -0.0899770804275961, 0.1095818703622132, 0.0640119112513219, 0.03222489743985189, 0.1933694655185577, 0.11281466657752807, 0.2604397345820199, 0.1790392949254547, -0.03962251992667707, -0.09774706655569514, -0.3702843694467537, -0.18563379527117352, -0.14810608897173072, 0.03847477735630858, -0.11369334065799329, -0.1918987803535698, 0.40546513597773076, 0.11130980538169605, 0.12107072494091084, 0.10860781367616554, 0.22367560574264259, 0.18942151542581973, 0.006994848324691657, 0.08450434906466037, 0.24606506749756218, 0.16375946961574672, 0.06465459535742954, -0.24423485380013166, 0.02857467609093241, 0.1752142703626305] |
1,802.01278 | Hierarchical environment-assisted dynamical speedup control | We investigate the qubit in the hierarchical environment where the first
level is just one lossy cavity while the second level is the N-coupled lossy
cavities. In the weak coupling regime between the qubit and the first level
environment, the dynamics crossovers from the original Markovian to the new
non-Markovian and from no-speedup to speedup can be realized by controlling the
hierarchical environment, i.e., manipulating the number of cavities or the
coupling strength between two nearest-neighbor cavities in the second level
environment. And we find that the coupling strength between two
nearest-neighbor cavities and the number of cavities in the second level
environment have the opposite effect on the non-Markovian dynamics and speedup
evolution of the qubit. In addition, in the case of strong coupling between the
qubit and the first level environment, we can be surprised to find that,
compared with the original non-Markovian dynamics, the added second level
environment cannot play a beneficial role on the speedup of the dynamics of the
system.
| quant-ph | we investigate the qubit in the hierarchical environment where the first level is just one lossy cavity while the second level is the ncoupled lossy cavities in the weak coupling regime between the qubit and the first level environment the dynamics crossovers from the original markovian to the new nonmarkovian and from nospeedup to speedup can be realized by controlling the hierarchical environment ie manipulating the number of cavities or the coupling strength between two nearestneighbor cavities in the second level environment and we find that the coupling strength between two nearestneighbor cavities and the number of cavities in the second level environment have the opposite effect on the nonmarkovian dynamics and speedup evolution of the qubit in addition in the case of strong coupling between the qubit and the first level environment we can be surprised to find that compared with the original nonmarkovian dynamics the added second level environment cannot play a beneficial role on the speedup of the dynamics of the system | [['we', 'investigate', 'the', 'qubit', 'in', 'the', 'hierarchical', 'environment', 'where', 'the', 'first', 'level', 'is', 'just', 'one', 'lossy', 'cavity', 'while', 'the', 'second', 'level', 'is', 'the', 'ncoupled', 'lossy', 'cavities', 'in', 'the', 'weak', 'coupling', 'regime', 'between', 'the', 'qubit', 'and', 'the', 'first', 'level', 'environment', 'the', 'dynamics', 'crossovers', 'from', 'the', 'original', 'markovian', 'to', 'the', 'new', 'nonmarkovian', 'and', 'from', 'nospeedup', 'to', 'speedup', 'can', 'be', 'realized', 'by', 'controlling', 'the', 'hierarchical', 'environment', 'ie', 'manipulating', 'the', 'number', 'of', 'cavities', 'or', 'the', 'coupling', 'strength', 'between', 'two', 'nearestneighbor', 'cavities', 'in', 'the', 'second', 'level', 'environment', 'and', 'we', 'find', 'that', 'the', 'coupling', 'strength', 'between', 'two', 'nearestneighbor', 'cavities', 'and', 'the', 'number', 'of', 'cavities', 'in', 'the', 'second', 'level', 'environment', 'have', 'the', 'opposite', 'effect', 'on', 'the', 'nonmarkovian', 'dynamics', 'and', 'speedup', 'evolution', 'of', 'the', 'qubit', 'in', 'addition', 'in', 'the', 'case', 'of', 'strong', 'coupling', 'between', 'the', 'qubit', 'and', 'the', 'first', 'level', 'environment', 'we', 'can', 'be', 'surprised', 'to', 'find', 'that', 'compared', 'with', 'the', 'original', 'nonmarkovian', 'dynamics', 'the', 'added', 'second', 'level', 'environment', 'can', 'not', 'play', 'a', 'beneficial', 'role', 'on', 'the', 'speedup', 'of', 'the', 'dynamics', 'of', 'the', 'system']] | [-0.17058775573968887, 0.14024961628584248, -0.016749754914957466, 0.009250260228432264, 0.012652764957800338, -0.1533056170905404, 0.05244904361651138, 0.38132796549435816, -0.2781393949281086, -0.31618310013842404, 0.03967078483494168, -0.24651509256977022, -0.12273018124908434, 0.18086478895451308, 0.03217992737508294, -0.013590246560334257, 0.04815946724265814, 0.04668058139328478, -0.02944066690168146, -0.23722417546069305, 0.33301894261755727, 0.07691778838634492, 0.2827247777050643, 0.039116096063375926, 0.09302589856652599, -0.02887627891490631, 0.09002946924531098, -0.021810078767664505, -0.023573356382566447, 0.0801738682174773, 0.1882622942949335, 0.019715627474766788, 0.3155872328940666, -0.46768352314829825, -0.159645993286518, 0.08172578666302742, 0.11954793465521299, 0.1535657620212684, -0.009395575183302616, -0.3342022116422992, -0.002647541937502948, -0.15446794865032037, -0.07003074968233705, -0.032426126970147545, -0.029820242580590826, 0.007017883928986548, -0.2304033661797417, 0.09204349126949003, 0.08377448398281227, 0.0037703093479980123, -0.0025759655474261803, -0.016974810428324747, -0.017464300233757855, 0.20437651604385765, -0.024098128071901474, -0.0016723820200599167, 0.1553254985419864, -0.17368491716457135, -0.10950060293473529, 0.36349359754698746, -0.12608047365775388, -0.190876775686488, 0.22639050549460632, -0.18725149448340137, -0.09473205441891244, 0.07795152161834817, 0.1934333366849883, 0.03255266840710785, -0.16222321713399707, 0.07121720153513844, 0.030619475375296492, 0.2319634912902433, 0.04496334610563336, 0.07921877168683392, 0.17968854922801256, 0.1852013696881124, 0.04655813389231987, 0.20778516782588805, -0.08184770998601434, -0.1491121744257257, -0.2951146736176628, -0.14296957002670477, -0.17761124687438662, 0.026486194990557675, -0.11544368202096049, -0.1050883090462197, 0.402309652415076, 0.18725603211276007, 0.1879978304390203, -0.007375982725484805, 0.2768418987225177, 0.14009102706543425, 0.05913803898235501, 0.08168570752763613, 0.30021535408485567, 0.12392186930713554, 0.046550852310081776, -0.3155299252724614, 0.06685946344426184, 0.016156574493894973] |
1,802.01279 | Zero-Shot Kernel Learning | In this paper, we address an open problem of zero-shot learning. Its
principle is based on learning a mapping that associates feature vectors
extracted from i.e. images and attribute vectors that describe objects and/or
scenes of interest. In turns, this allows classifying unseen object classes
and/or scenes by matching feature vectors via mapping to a newly defined
attribute vector describing a new class. Due to importance of such a learning
task, there exist many methods that learn semantic, probabilistic, linear or
piece-wise linear mappings. In contrast, we apply well-established kernel
methods to learn a non-linear mapping between the feature and attribute spaces.
We propose an easy learning objective inspired by the Linear Discriminant
Analysis, Kernel-Target Alignment and Kernel Polarization methods that promotes
incoherence. We evaluate performance of our algorithm on the Polynomial as well
as shift-invariant Gaussian and Cauchy kernels. Despite simplicity of our
approach, we obtain state-of-the-art results on several zero-shot learning
datasets and benchmarks including a recent AWA2 dataset.
| cs.CV | in this paper we address an open problem of zeroshot learning its principle is based on learning a mapping that associates feature vectors extracted from ie images and attribute vectors that describe objects andor scenes of interest in turns this allows classifying unseen object classes andor scenes by matching feature vectors via mapping to a newly defined attribute vector describing a new class due to importance of such a learning task there exist many methods that learn semantic probabilistic linear or piecewise linear mappings in contrast we apply wellestablished kernel methods to learn a nonlinear mapping between the feature and attribute spaces we propose an easy learning objective inspired by the linear discriminant analysis kerneltarget alignment and kernel polarization methods that promotes incoherence we evaluate performance of our algorithm on the polynomial as well as shiftinvariant gaussian and cauchy kernels despite simplicity of our approach we obtain stateoftheart results on several zeroshot learning datasets and benchmarks including a recent awa2 dataset | [['in', 'this', 'paper', 'we', 'address', 'an', 'open', 'problem', 'of', 'zeroshot', 'learning', 'its', 'principle', 'is', 'based', 'on', 'learning', 'a', 'mapping', 'that', 'associates', 'feature', 'vectors', 'extracted', 'from', 'ie', 'images', 'and', 'attribute', 'vectors', 'that', 'describe', 'objects', 'andor', 'scenes', 'of', 'interest', 'in', 'turns', 'this', 'allows', 'classifying', 'unseen', 'object', 'classes', 'andor', 'scenes', 'by', 'matching', 'feature', 'vectors', 'via', 'mapping', 'to', 'a', 'newly', 'defined', 'attribute', 'vector', 'describing', 'a', 'new', 'class', 'due', 'to', 'importance', 'of', 'such', 'a', 'learning', 'task', 'there', 'exist', 'many', 'methods', 'that', 'learn', 'semantic', 'probabilistic', 'linear', 'or', 'piecewise', 'linear', 'mappings', 'in', 'contrast', 'we', 'apply', 'wellestablished', 'kernel', 'methods', 'to', 'learn', 'a', 'nonlinear', 'mapping', 'between', 'the', 'feature', 'and', 'attribute', 'spaces', 'we', 'propose', 'an', 'easy', 'learning', 'objective', 'inspired', 'by', 'the', 'linear', 'discriminant', 'analysis', 'kerneltarget', 'alignment', 'and', 'kernel', 'polarization', 'methods', 'that', 'promotes', 'incoherence', 'we', 'evaluate', 'performance', 'of', 'our', 'algorithm', 'on', 'the', 'polynomial', 'as', 'well', 'as', 'shiftinvariant', 'gaussian', 'and', 'cauchy', 'kernels', 'despite', 'simplicity', 'of', 'our', 'approach', 'we', 'obtain', 'stateoftheart', 'results', 'on', 'several', 'zeroshot', 'learning', 'datasets', 'and', 'benchmarks', 'including', 'a', 'recent', 'awa2', 'dataset']] | [-0.041148321908985964, -0.015597824888936884, -0.07546580428024754, 0.07423318887886125, -0.1485166076483438, -0.15694436650337593, 0.022227670424763347, 0.4507861633668654, -0.31143048651283606, -0.27626237671356646, 0.0696782549690397, -0.24391682179275448, -0.2266126814080053, 0.21177974708989494, -0.1438823028431216, 0.09478122809268825, 0.11431974414372234, 0.033943473908584564, -0.11340710701770149, -0.23545448470758856, 0.38480743724358035, -0.013887970359064639, 0.3249647434524377, 0.007980277025490068, 0.19758179004638804, 0.0014276802103267983, -0.07441759853827534, 0.0035859410556440706, -0.040722051122611444, 0.19542372391806567, 0.3627264674170874, 0.218121874606004, 0.3172308215638623, -0.3409348454675637, -0.22294113535317592, 0.12712501311616506, 0.1057005627953913, 0.09678363828652436, -0.04762755595365888, -0.3489949977607466, 0.05066016796190524, -0.1390858502360061, 0.005274171750897949, -0.19378134461003355, -0.024731028910173335, -0.024373094830662013, -0.30336995056713933, 0.027158099197549745, 0.1450018087263743, 0.08606825700899208, -0.09554068646939413, -0.09736192665004637, 0.07158428123075282, 0.10871021054554149, 0.03549550758471014, 0.08157323162595276, 0.11090072479273658, -0.17796959770453213, -0.17710761616326637, 0.37432336336351, -0.08121592879178934, -0.2310285804080195, 0.25030006917804715, -0.013664589692052687, -0.14411511602665997, 0.06795332290348596, 0.2459160482743755, 0.16136186503863428, -0.13830125302774832, 0.08209188792206987, -0.09492205370916054, 0.16572057633529766, 0.0639055136256502, -0.007997055391024332, 0.17471184731839456, 0.19170007755456026, 0.05192431858413329, 0.17556195994693552, -0.12400869335251627, -0.06323838040807458, -0.21357650408754125, -0.11138406437785306, -0.21519992594112408, -0.029247619927627967, -0.12021464350937094, -0.17025554694355377, 0.4042388151981868, 0.23075140286237, 0.27517347982502544, 0.11321714146179147, 0.28527946244576013, 0.0332058826868888, 0.09585843473032582, 0.08939587622553517, 0.1563369405881531, 0.07478827732265927, 0.07309176571725402, -0.16437416286025835, 0.07745872301820782, 0.09981878378021065] |
1,802.0128 | NV-Metamaterial: Tunable Quantum Hyperbolic Metamaterial Using
Nitrogen-Vacancy Centers in Diamond | We show that nitrogen-vacancy (NV) centers in diamond can produce a novel
quantum hyperbolic metamaterial. We demonstrate that a hyperbolic dispersion
relation in diamond with NV centers can be engineered and dynamically tuned by
applying a magnetic field. This quantum hyperbolic metamaterial with a tunable
window for the negative refraction allows for the construction of a superlens
beyond the diffraction limit. In addition to subwavelength imaging, this
NV-metamaterial can be used in spontaneous emission enhancement, heat transport
and acoustics, analogue cosmology, and lifetime engineering. Therefore, our
proposal interlinks the two hotspot fields, i.e., NV centers and metamaterials.
| physics.app-ph cond-mat.mes-hall physics.optics quant-ph | we show that nitrogenvacancy nv centers in diamond can produce a novel quantum hyperbolic metamaterial we demonstrate that a hyperbolic dispersion relation in diamond with nv centers can be engineered and dynamically tuned by applying a magnetic field this quantum hyperbolic metamaterial with a tunable window for the negative refraction allows for the construction of a superlens beyond the diffraction limit in addition to subwavelength imaging this nvmetamaterial can be used in spontaneous emission enhancement heat transport and acoustics analogue cosmology and lifetime engineering therefore our proposal interlinks the two hotspot fields ie nv centers and metamaterials | [['we', 'show', 'that', 'nitrogenvacancy', 'nv', 'centers', 'in', 'diamond', 'can', 'produce', 'a', 'novel', 'quantum', 'hyperbolic', 'metamaterial', 'we', 'demonstrate', 'that', 'a', 'hyperbolic', 'dispersion', 'relation', 'in', 'diamond', 'with', 'nv', 'centers', 'can', 'be', 'engineered', 'and', 'dynamically', 'tuned', 'by', 'applying', 'a', 'magnetic', 'field', 'this', 'quantum', 'hyperbolic', 'metamaterial', 'with', 'a', 'tunable', 'window', 'for', 'the', 'negative', 'refraction', 'allows', 'for', 'the', 'construction', 'of', 'a', 'superlens', 'beyond', 'the', 'diffraction', 'limit', 'in', 'addition', 'to', 'subwavelength', 'imaging', 'this', 'nvmetamaterial', 'can', 'be', 'used', 'in', 'spontaneous', 'emission', 'enhancement', 'heat', 'transport', 'and', 'acoustics', 'analogue', 'cosmology', 'and', 'lifetime', 'engineering', 'therefore', 'our', 'proposal', 'interlinks', 'the', 'two', 'hotspot', 'fields', 'ie', 'nv', 'centers', 'and', 'metamaterials']] | [-0.09200093211499431, 0.1973494891038475, -0.03798231344747668, 0.008270084589942902, -0.07768491775883983, -0.15896029521536548, 0.029321281719603576, 0.5038736774586141, -0.2664758973599722, -0.2922147338395007, 0.04965261787583586, -0.2905878594830635, -0.14951702867013714, 0.241081417077415, -0.051410525061025204, 0.046082362513213106, 0.006531658339857434, -0.056969406236021314, 0.0010712373429366078, -0.1163671536972591, 0.27823738708684687, -0.00439605700254712, 0.38242407659223926, 0.1057639022086126, 0.12057243775052484, 0.013275019204229466, 0.11163849723622359, 0.07023561594542116, -0.07514434148212483, 0.16479335426508138, 0.29049077988990274, -0.017230751909664832, 0.21968810462324959, -0.39727626692911144, -0.2827200852840785, 0.08812038350151852, 0.21232798945372147, 0.19783822426203793, -0.17577017410076223, -0.3007690382267659, 0.03988337846870612, -0.10249017792132993, -0.17933967943827156, -0.06599402108986396, -0.08360936786993989, -0.030236697687845055, -0.229781988421261, 0.0011116363214872156, 0.06031331452929104, 0.0379440662751828, -0.05299500107563896, 0.013821813627146184, 0.022165038130575947, 0.04330226731569079, -0.10513360507381246, 0.0037450057376797, 0.23901549266884103, -0.09560413102857031, -0.1842467316891998, 0.3834888474278462, -0.09342729781443875, -0.1333400201498686, 0.130829566604613, -0.16645538505205573, -0.03614310056824858, 0.08892647260411952, 0.18587938845545673, 0.11391627191430113, -0.13627515916596167, 0.06606533180214076, -0.015515485537738035, 0.187554871411218, 0.1339185361963852, 0.08197544807141337, 0.2780454970003727, 0.16029677510960028, 0.09182848217218027, 0.1648931506133522, -0.11565334527282782, -0.0035115249338559806, -0.21944914274111701, -0.21133989586845323, -0.19814180530859934, 0.11862754141717839, -0.14680236496921376, -0.1768796908824394, 0.363421990248753, 0.1476605265197577, 0.13703295689386627, -0.05636314167153008, 0.2546698668714574, 0.11253749872715464, 0.15604002369218506, 0.045798395168579496, 0.2815000883517011, 0.19714713490733024, 0.10334633444047843, -0.297593455882937, -0.08385606850515614, -0.021764308466420818] |
1,802.01281 | Randomized Transmission Protocols for Protection against Jamming Attacks
in Multi-Agent Consensus | Multi-agent consensus under jamming attacks is investigated. Specifically,
inter-agent communications over a network are assumed to fail at certain times
due to jamming of transmissions by a malicious attacker. A new stochastic
communication protocol is proposed to achieve finite-time practical consensus
between agents. In this protocol, communication attempt times of agents are
randomized and unknown by the attacker until after the agents make their
communication attempts. Through a probabilistic analysis, we show that the
proposed communication protocol, when combined with a stochastic ternary
control law, allows agents to achieve consensus regardless of the frequency of
attacks. We demonstrate the efficacy of our results by considering two
different strategies of the jamming attacker: a deterministic attack strategy
and a more malicious communication-aware attack strategy.
| cs.SY | multiagent consensus under jamming attacks is investigated specifically interagent communications over a network are assumed to fail at certain times due to jamming of transmissions by a malicious attacker a new stochastic communication protocol is proposed to achieve finitetime practical consensus between agents in this protocol communication attempt times of agents are randomized and unknown by the attacker until after the agents make their communication attempts through a probabilistic analysis we show that the proposed communication protocol when combined with a stochastic ternary control law allows agents to achieve consensus regardless of the frequency of attacks we demonstrate the efficacy of our results by considering two different strategies of the jamming attacker a deterministic attack strategy and a more malicious communicationaware attack strategy | [['multiagent', 'consensus', 'under', 'jamming', 'attacks', 'is', 'investigated', 'specifically', 'interagent', 'communications', 'over', 'a', 'network', 'are', 'assumed', 'to', 'fail', 'at', 'certain', 'times', 'due', 'to', 'jamming', 'of', 'transmissions', 'by', 'a', 'malicious', 'attacker', 'a', 'new', 'stochastic', 'communication', 'protocol', 'is', 'proposed', 'to', 'achieve', 'finitetime', 'practical', 'consensus', 'between', 'agents', 'in', 'this', 'protocol', 'communication', 'attempt', 'times', 'of', 'agents', 'are', 'randomized', 'and', 'unknown', 'by', 'the', 'attacker', 'until', 'after', 'the', 'agents', 'make', 'their', 'communication', 'attempts', 'through', 'a', 'probabilistic', 'analysis', 'we', 'show', 'that', 'the', 'proposed', 'communication', 'protocol', 'when', 'combined', 'with', 'a', 'stochastic', 'ternary', 'control', 'law', 'allows', 'agents', 'to', 'achieve', 'consensus', 'regardless', 'of', 'the', 'frequency', 'of', 'attacks', 'we', 'demonstrate', 'the', 'efficacy', 'of', 'our', 'results', 'by', 'considering', 'two', 'different', 'strategies', 'of', 'the', 'jamming', 'attacker', 'a', 'deterministic', 'attack', 'strategy', 'and', 'a', 'more', 'malicious', 'communicationaware', 'attack', 'strategy']] | [-0.24345681991530355, 0.0411906107555984, -0.10342478525362969, 0.019001271330554615, -0.054955439566354444, -0.3062343277165863, 0.19222462775064555, 0.4009223824397214, -0.2617738779361655, -0.28274791415144757, 0.08371396251003886, -0.2178366533197828, -0.22536490133365358, 0.12301442800922607, -0.16747925775049904, 0.1313661653548479, -0.007626831122651332, 0.03480591228973817, 0.03558057336594788, -0.3398570433993468, 0.2900450704051409, 0.06193175122929298, 0.2866171990498537, 0.0016751384672072784, 0.11435481580731467, 0.03336647741981154, -0.001650675820807616, -0.01882853900646503, -0.1140488862513486, 0.04193105295345914, 0.35460355905134505, 0.1994436557851429, 0.38675454894943934, -0.4494296186792899, -0.20598387415520847, 0.1556299766449909, 0.11119214528404948, 0.16806099494508414, -0.007216791121305224, -0.36020237707146785, 0.16172007955156448, -0.25624199266871056, -0.04079574146554086, -0.04502795093003812, -0.04800435951418751, 0.07719548102619687, -0.3022193703507035, -0.0238216918347994, 0.05155711925429542, 0.05249651580503801, -0.007835538336170489, 0.011787973586621323, 0.04475148271095401, 0.14198619067953802, 0.03640759698062287, -0.0609354060209485, 0.21076156218759565, -0.10530305681636602, -0.20778116062226729, 0.3431008169351797, 0.039380922690185345, -0.15138753094096152, 0.1682161894471695, 0.017075166920184848, -0.10185984560152198, 0.1509839956974232, 0.2541531524204505, 0.08078161597270112, -0.1839242298445878, -0.00476708569151266, -0.012961703329914954, 0.20693965168666034, 0.04735676518724701, 0.03349857961728684, 0.10765134627605236, 0.19293290215953277, 0.2134010149923161, 0.10419407255788583, -0.03893121641613846, -0.17663636475014008, -0.20875506813266897, -0.09200677817036224, -0.2066999583285514, 0.05381781020016235, -0.09640553825306782, -0.035391222810509, 0.34858766536614516, 0.19854523339195224, 0.140836213700231, 0.163688491704321, 0.4090319185298148, -0.001665435999260867, 0.009804154218106372, 0.1596576777472335, 0.24448751627772336, 0.04089987339126325, 0.11822997870934536, -0.19907766398860188, 0.21238525410190345, -0.02912420452746555] |
1,802.01282 | Coordinated Exploration in Concurrent Reinforcement Learning | We consider a team of reinforcement learning agents that concurrently learn
to operate in a common environment. We identify three properties - adaptivity,
commitment, and diversity - which are necessary for efficient coordinated
exploration and demonstrate that straightforward extensions to single-agent
optimistic and posterior sampling approaches fail to satisfy them. As an
alternative, we propose seed sampling, which extends posterior sampling in a
manner that meets these requirements. Simulation results investigate how
per-agent regret decreases as the number of agents grows, establishing
substantial advantages of seed sampling over alternative exploration schemes.
| cs.AI | we consider a team of reinforcement learning agents that concurrently learn to operate in a common environment we identify three properties adaptivity commitment and diversity which are necessary for efficient coordinated exploration and demonstrate that straightforward extensions to singleagent optimistic and posterior sampling approaches fail to satisfy them as an alternative we propose seed sampling which extends posterior sampling in a manner that meets these requirements simulation results investigate how peragent regret decreases as the number of agents grows establishing substantial advantages of seed sampling over alternative exploration schemes | [['we', 'consider', 'a', 'team', 'of', 'reinforcement', 'learning', 'agents', 'that', 'concurrently', 'learn', 'to', 'operate', 'in', 'a', 'common', 'environment', 'we', 'identify', 'three', 'properties', 'adaptivity', 'commitment', 'and', 'diversity', 'which', 'are', 'necessary', 'for', 'efficient', 'coordinated', 'exploration', 'and', 'demonstrate', 'that', 'straightforward', 'extensions', 'to', 'singleagent', 'optimistic', 'and', 'posterior', 'sampling', 'approaches', 'fail', 'to', 'satisfy', 'them', 'as', 'an', 'alternative', 'we', 'propose', 'seed', 'sampling', 'which', 'extends', 'posterior', 'sampling', 'in', 'a', 'manner', 'that', 'meets', 'these', 'requirements', 'simulation', 'results', 'investigate', 'how', 'peragent', 'regret', 'decreases', 'as', 'the', 'number', 'of', 'agents', 'grows', 'establishing', 'substantial', 'advantages', 'of', 'seed', 'sampling', 'over', 'alternative', 'exploration', 'schemes']] | [-0.105627930733595, 0.06478588902172397, -0.07741756705839313, 0.11330086939178115, -0.15073868835847196, -0.1711522846409444, 0.11874235107228578, 0.4815879004976053, -0.287878167763185, -0.34391520345018484, 0.06967264287477212, -0.18365170542946022, -0.13688092086506023, 0.1439005367436938, -0.1538312410349759, 0.03392019510018022, 0.06635619575429834, -0.031113250092132373, -0.03555106611535204, -0.29754994621531766, 0.2394013782764335, 0.089021525356207, 0.31277206035728533, -0.08062877946041441, 0.1388303258919335, 0.030072764823150435, -0.008152324834830662, 0.00946414158574902, -0.1581534468293356, 0.11446138020353706, 0.34512789890672385, 0.25636380894130534, 0.4061338235781099, -0.41209575726409975, -0.20242655296087936, 0.12616823786304573, 0.1715071569929381, 0.07912016855919043, -0.07690510912432094, -0.2175325338801976, 0.0638869140386121, -0.2183570864013909, -0.06337520433066601, -0.16525209626036413, -0.0753673559638117, 0.041647441209074154, -0.3581205378757434, -0.021439485021688964, 0.07110218240178368, 0.0040856498644132625, -0.0366035661597349, -0.10031705854062954, 0.056717111504103024, 0.12766664972256744, 0.03792596793226019, 0.010652454109506661, 0.15480982393465853, -0.11751404241920355, -0.190291432967263, 0.32280906428991074, 0.00890250394141741, -0.16997109704815752, 0.24626884883625455, -0.01959315852753902, -0.1723255585680266, 0.10139397713303398, 0.22421407744581445, 0.1263519740255361, -0.1287227790865503, 0.04446174325792608, -0.025394199282621568, 0.12970540166068611, 0.05306927837023323, 0.06510781762033199, 0.13432043837906604, 0.20807328745408843, 0.17102867523940762, 0.12859534129259712, -0.0240889087877252, -0.1852944937764845, -0.2493829518109246, -0.15354915596335456, -0.16844161521653864, -0.006385267869140325, -0.1149733041858188, -0.12880733131193634, 0.3136858620335547, 0.28115617925447695, 0.18579146218371023, 0.1614395182166416, 0.3433656589326899, 0.03302163636740925, 0.0487697445421239, 0.11644773904673672, 0.1989025962604419, 0.03890518921563465, 0.03805133513452255, -0.18065186759477922, 0.11455256778098057, -0.01081767012208198] |
1,802.01283 | Asymptotic depth of Ext modules over complete intersection rings | Let $(A,\mathfrak{m})$ be a local complete intersection ring and let $I$ be
an ideal in $A$. Let $M, N$ be finitely generated $A$-modules. Then for $l =
0,1$, the values $depth \ Ext^{2i+l}_A(M, N/I^nN)$ become independent of $i, n$
for $i,n \gg 0$. We also show that if $\mathfrak{p}$ is a prime ideal in $A$
then the $j^{th}$ Bass numbers $\mu_j\big(\mathfrak{p},\
Ext^{2i+l}_A(M,N/{I^nN})\big)$ has polynomial growth in $(n,i)$ with rational
coefficients for all sufficiently large $(n,i)$.
| math.AC | let amathfrakm be a local complete intersection ring and let i be an ideal in a let m n be finitely generated amodules then for l 01 the values depth ext2il_am ninn become independent of i n for in gg 0 we also show that if mathfrakp is a prime ideal in a then the jth bass numbers mu_jbigmathfrakp ext2il_amninnbig has polynomial growth in ni with rational coefficients for all sufficiently large ni | [['let', 'amathfrakm', 'be', 'a', 'local', 'complete', 'intersection', 'ring', 'and', 'let', 'i', 'be', 'an', 'ideal', 'in', 'a', 'let', 'm', 'n', 'be', 'finitely', 'generated', 'amodules', 'then', 'for', 'l', '01', 'the', 'values', 'depth', 'ext2il_am', 'ninn', 'become', 'independent', 'of', 'i', 'n', 'for', 'in', 'gg', '0', 'we', 'also', 'show', 'that', 'if', 'mathfrakp', 'is', 'a', 'prime', 'ideal', 'in', 'a', 'then', 'the', 'jth', 'bass', 'numbers', 'mu_jbigmathfrakp', 'ext2il_amninnbig', 'has', 'polynomial', 'growth', 'in', 'ni', 'with', 'rational', 'coefficients', 'for', 'all', 'sufficiently', 'large', 'ni']] | [-0.170904875310537, 0.1627376120489706, -0.0456864772098405, -0.03494717056164518, -0.025821605291483658, -0.23227872036929642, -0.07775629539308804, 0.31798485684474664, -0.36573888648833547, -0.1426483257740204, 0.06753598250714796, -0.30570476087076326, -0.04238993238790759, 0.20309517657317752, -0.04651950861194304, -0.08872346567202061, 0.01709956569331033, 0.10868588224319475, 0.0007844052310766918, -0.319903440863709, 0.2986565025523305, -0.05938897453514593, 0.13906984814841833, 0.00860220683472497, 0.07346659595412867, 0.004833653256563204, 0.05283549686095544, 0.08678990368664796, -0.21065176216205664, 0.03952963590355856, 0.3479127564866628, 0.07798424677197804, 0.2849628451612911, -0.38387211047645126, -0.0552524034831939, 0.2643229036591947, 0.2067063321525763, -0.06230633886797088, -0.013330006416487907, -0.1680562164368374, 0.2547232267446816, -0.1662308090166854, -0.16678447439335287, -0.03700746190068977, 0.2399546846215214, 0.06253934725204349, -0.43015287518501283, -0.0822785767098789, 0.0844838177253093, 0.1629130852142615, -0.0028476650859894496, -0.14591299115813205, -0.07086660478131047, 0.043929863017651116, -0.10176576191359865, 0.06257997223043016, 0.03458250840360831, -0.07134054913850767, -0.05901528744559203, 0.36631822335932934, -0.12483320824269738, -0.234060439114858, 0.06901468196883798, -0.25856426089469875, -0.11965609541428941, 0.13663142558985522, 0.05411983654692969, 0.1399302173671978, 0.008401573303022556, 0.2627449720025262, -0.15414538742708309, 0.14091702558299793, 0.0605837286716061, -0.015831975592300297, 0.1913517587419067, 0.08012810389877163, 0.07724073547246267, 0.07335756009477856, -0.03175758740731648, 0.11310666896003697, -0.343797961303166, -0.22349732906690667, -0.23563364900681855, 0.214700969401747, -0.14108203538406608, -0.11020120312459766, 0.3061652234356318, 0.08011571405056332, 0.24077776046604932, 0.09931714779564313, 0.22035916479570525, 0.08453550296170372, 0.010073248193865375, 0.11988444493950477, 0.03827925134184105, 0.17876627250973667, -0.04420805858182056, -0.10726763020502403, 0.026892734432060805, 0.144542373690222] |
1,802.01284 | Task-Aware Compressed Sensing with Generative Adversarial Networks | In recent years, neural network approaches have been widely adopted for
machine learning tasks, with applications in computer vision. More recently,
unsupervised generative models based on neural networks have been successfully
applied to model data distributions via low-dimensional latent spaces. In this
paper, we use Generative Adversarial Networks (GANs) to impose structure in
compressed sensing problems, replacing the usual sparsity constraint. We
propose to train the GANs in a task-aware fashion, specifically for
reconstruction tasks. We also show that it is possible to train our model
without using any (or much) non-compressed data. Finally, we show that the
latent space of the GAN carries discriminative information and can further be
regularized to generate input features for general inference tasks. We
demonstrate the effectiveness of our method on a variety of reconstruction and
classification problems.
| cs.LG stat.ML | in recent years neural network approaches have been widely adopted for machine learning tasks with applications in computer vision more recently unsupervised generative models based on neural networks have been successfully applied to model data distributions via lowdimensional latent spaces in this paper we use generative adversarial networks gans to impose structure in compressed sensing problems replacing the usual sparsity constraint we propose to train the gans in a taskaware fashion specifically for reconstruction tasks we also show that it is possible to train our model without using any or much noncompressed data finally we show that the latent space of the gan carries discriminative information and can further be regularized to generate input features for general inference tasks we demonstrate the effectiveness of our method on a variety of reconstruction and classification problems | [['in', 'recent', 'years', 'neural', 'network', 'approaches', 'have', 'been', 'widely', 'adopted', 'for', 'machine', 'learning', 'tasks', 'with', 'applications', 'in', 'computer', 'vision', 'more', 'recently', 'unsupervised', 'generative', 'models', 'based', 'on', 'neural', 'networks', 'have', 'been', 'successfully', 'applied', 'to', 'model', 'data', 'distributions', 'via', 'lowdimensional', 'latent', 'spaces', 'in', 'this', 'paper', 'we', 'use', 'generative', 'adversarial', 'networks', 'gans', 'to', 'impose', 'structure', 'in', 'compressed', 'sensing', 'problems', 'replacing', 'the', 'usual', 'sparsity', 'constraint', 'we', 'propose', 'to', 'train', 'the', 'gans', 'in', 'a', 'taskaware', 'fashion', 'specifically', 'for', 'reconstruction', 'tasks', 'we', 'also', 'show', 'that', 'it', 'is', 'possible', 'to', 'train', 'our', 'model', 'without', 'using', 'any', 'or', 'much', 'noncompressed', 'data', 'finally', 'we', 'show', 'that', 'the', 'latent', 'space', 'of', 'the', 'gan', 'carries', 'discriminative', 'information', 'and', 'can', 'further', 'be', 'regularized', 'to', 'generate', 'input', 'features', 'for', 'general', 'inference', 'tasks', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'method', 'on', 'a', 'variety', 'of', 'reconstruction', 'and', 'classification', 'problems']] | [0.03200210556580468, -0.018102903724332948, -0.09863512185087106, 0.08759326108948405, -0.14255709906941966, -0.16985206830462343, -0.018755906225616268, 0.5111618986479322, -0.30428773699734446, -0.3281380015257326, 0.07201833935030841, -0.2377861252726805, -0.25951401044131445, 0.19584596542732552, -0.16119288532518522, 0.1433442019458328, 0.1451150690086354, 0.057508877942450624, -0.10172257238090444, -0.3171897176793195, 0.3313311555079724, 0.013569658860228116, 0.38129406957361933, -0.00946146598842023, 0.14312463461183347, -0.03802110758764123, 0.026694361106457568, -0.009828709385618637, -0.06393336901089783, 0.21072875952726244, 0.3257292808217394, 0.23723709735585222, 0.3479160218293029, -0.4598408453516606, -0.3550734552869895, 0.1513961226980489, 0.13834798510389446, 0.1429520019179532, -0.055218591901523596, -0.3288632964057134, 0.1177536772504533, -0.16998930680880645, 0.0762797446249235, -0.21698706018426842, -0.04310933636725509, -0.03177072186612951, -0.3233133786435841, 0.021102918702119933, 0.07608593414236504, 0.03946787921389691, -0.04895477918505361, -0.09493117830348446, 0.03100860756436797, 0.10936127922889825, 0.04126339820931364, 0.06463158090294276, 0.10110607502729933, -0.18341975397897772, -0.19427966839140212, 0.33972098953545765, -0.05366446522827771, -0.24935758907958003, 0.18561465398380464, -0.002401156550539391, -0.22084534695088387, 0.04577957688221582, 0.2966206818819046, 0.13593382378549954, -0.1464651975210903, 0.04297777611492692, -0.05930190184503738, 0.15397359559634574, 0.02029992303902045, -0.02698348044318014, 0.14391673098824204, 0.2699750059571369, 0.0323668838184523, 0.16457197555127254, -0.15355389292134827, -0.06248642538001943, -0.16252545596107393, -0.07045439293930181, -0.22331437391151948, -0.016169956755733357, -0.07545953111603149, -0.1262421204351393, 0.4036514198624606, 0.259193260322458, 0.23404683567289458, 0.09954368513553663, 0.35596412051945253, 0.042166441358639895, 0.13428218530743083, 0.1111635419897231, 0.1872475734400682, 0.07300862662942338, 0.1278265235399393, -0.1007009455435244, 0.07227384334314559, 0.03272071435235273] |
1,802.01285 | Intrinsic spin-orbit torque arising from Berry curvature in
metallic-magnet/Cu-oxide interface | We report the observation of the intrinsic damping-like spin-orbit torque
(SOT) arising from the Berry curvature in metallic-magnet/CuO$_x$
heterostructures. We show that a robust damping-like SOT, an order of magnitude
larger than a field-like SOT, is generated in the heterostructure despite the
absence of the bulk spin-orbit effect in the CuO$_x$ layer. Furthermore, by
tuning the interface oxidation level, we demonstrate that the field-like SOT
changes drastically and even switches its sign, which originates from oxygen
modulated spin-dependent disorder. These results provide an important
information for fundamental understanding of the physics of the SOTs.
| cond-mat.mtrl-sci cond-mat.mes-hall | we report the observation of the intrinsic dampinglike spinorbit torque sot arising from the berry curvature in metallicmagnetcuo_x heterostructures we show that a robust dampinglike sot an order of magnitude larger than a fieldlike sot is generated in the heterostructure despite the absence of the bulk spinorbit effect in the cuo_x layer furthermore by tuning the interface oxidation level we demonstrate that the fieldlike sot changes drastically and even switches its sign which originates from oxygen modulated spindependent disorder these results provide an important information for fundamental understanding of the physics of the sots | [['we', 'report', 'the', 'observation', 'of', 'the', 'intrinsic', 'dampinglike', 'spinorbit', 'torque', 'sot', 'arising', 'from', 'the', 'berry', 'curvature', 'in', 'metallicmagnetcuo_x', 'heterostructures', 'we', 'show', 'that', 'a', 'robust', 'dampinglike', 'sot', 'an', 'order', 'of', 'magnitude', 'larger', 'than', 'a', 'fieldlike', 'sot', 'is', 'generated', 'in', 'the', 'heterostructure', 'despite', 'the', 'absence', 'of', 'the', 'bulk', 'spinorbit', 'effect', 'in', 'the', 'cuo_x', 'layer', 'furthermore', 'by', 'tuning', 'the', 'interface', 'oxidation', 'level', 'we', 'demonstrate', 'that', 'the', 'fieldlike', 'sot', 'changes', 'drastically', 'and', 'even', 'switches', 'its', 'sign', 'which', 'originates', 'from', 'oxygen', 'modulated', 'spindependent', 'disorder', 'these', 'results', 'provide', 'an', 'important', 'information', 'for', 'fundamental', 'understanding', 'of', 'the', 'physics', 'of', 'the', 'sots']] | [-0.23340046881576595, 0.14298532742016148, 0.005265267181169727, 0.005832688522312547, -0.09891186294186374, -0.08484666756576979, 0.03575242563079962, 0.4045717281937275, -0.3129058675840497, -0.34104968449505774, 0.0074257480509518446, -0.24824581861637696, -0.22387855492137454, 0.26110476942773425, -0.010346209245693424, -0.06635663917594407, -2.0763087693763815e-05, -0.10798047736265605, -0.08903644034264448, -0.1754431410935586, 0.30043119662213547, -0.0005536178714069335, 0.3040159468199936, 0.10958855081876011, 0.05705920932814479, -0.009613809487073804, 0.091610493776186, -0.0070593275494225645, -0.10203686212116736, 0.1091383052933689, 0.17714191920316333, -0.15344232783536427, 0.1919224158530636, -0.5005747673668616, -0.15944993092726573, -0.0295371387872602, 0.0959482346256466, 0.17132242502133443, -0.10319754199388073, -0.30770579511907115, 0.0005888731178382169, -0.14501579107878648, -0.06291105213534573, -0.09168094704332559, 0.03440792135813314, -0.07799854629632572, -0.2826885428765546, 0.057423636575391436, 0.16423897197186624, 0.11478942117410833, -0.09353279778050543, -0.15258133240327562, -0.1490412915236843, 0.11549736461829921, 0.10838858055143172, 0.05035390305799766, 0.2091129524025904, -0.1608668367666921, -0.13745094836264363, 0.3413603714687507, -0.1060453380134435, -0.11910517543108891, 0.10472181531013516, -0.1912938801865296, -0.024252193397842348, 0.11632533721706789, 0.13503782880877185, 0.08219798383114445, -0.11882015430044544, 0.09881250836580242, 0.013886286836603413, 0.1883456125733969, -0.026746164359476254, 0.0986910713026705, 0.2424280829930111, 0.17669957302796716, 0.08718220302430184, 0.12856374535982942, -0.18073031026616934, -0.02163302361631118, -0.20577131151019232, -0.15477135144022253, -0.25673888414419943, 0.10708160761556507, -0.11056607817891231, -0.1411667515564224, 0.4262439423119244, 0.26266790013355407, 0.14979484291119582, -0.05976989588310497, 0.32488639664876723, 0.1586851601175073, 0.12510274083900225, 0.024163428936963497, 0.35471466659193696, 0.13121166654467664, 0.13942630033251707, -0.3684780663410809, 0.15952999292336323, -0.011578193926454886] |
1,802.01286 | Data Augmentation of Railway Images for Track Inspection | Regular maintenance of all the assets is pivotal for proper functioning of
railway. Manual maintenance can be very cumbersome and leave room for errors.
Track anomalies like vegetation overgrowth, sun kinks affect the track
construct and result in unequal load transfer, imbalanced lateral forces on
tracks which causes further deterioration of tracks and can ultimately result
in derailment of locomotive. Hence there is a need to continuously monitor rail
track health. Track anomalies are rare with the skew as high as one anomaly in
millions of good images. We propose a method to build training data that will
make our algorithms more robust and help us detect real world track issues. The
data augmentation will have a direct effect in making us detect better
anomalies and hence improve time for railroads that is spent in manual
inspection. This paper talks about a real world use case of detecting railway
track defects from a camera mounted on a moving locomotive and tracking their
locations. The camera is engineered to withstand the environment factors on a
moving train and provide a consistent steady image at around 30 frames per
second. An image simulation pipeline of track detection, region of interest
selection, augmenting image for anomalies is implemented. Training images are
simulated for sun kink and vegetation overgrowth. Inception V3 model pretrained
on Imagenet dataset is finetuned for a 2 class classification. For the case of
vegetation overgrowth, the model generalizes well on actual vegetation images,
though it was trained and validated solely on simulated images which might have
different distribution than the actual vegetation. Sun kink classifier can
classify professionally simulated sun kink videos with a precision of 97.5%.
| cs.CV | regular maintenance of all the assets is pivotal for proper functioning of railway manual maintenance can be very cumbersome and leave room for errors track anomalies like vegetation overgrowth sun kinks affect the track construct and result in unequal load transfer imbalanced lateral forces on tracks which causes further deterioration of tracks and can ultimately result in derailment of locomotive hence there is a need to continuously monitor rail track health track anomalies are rare with the skew as high as one anomaly in millions of good images we propose a method to build training data that will make our algorithms more robust and help us detect real world track issues the data augmentation will have a direct effect in making us detect better anomalies and hence improve time for railroads that is spent in manual inspection this paper talks about a real world use case of detecting railway track defects from a camera mounted on a moving locomotive and tracking their locations the camera is engineered to withstand the environment factors on a moving train and provide a consistent steady image at around 30 frames per second an image simulation pipeline of track detection region of interest selection augmenting image for anomalies is implemented training images are simulated for sun kink and vegetation overgrowth inception v3 model pretrained on imagenet dataset is finetuned for a 2 class classification for the case of vegetation overgrowth the model generalizes well on actual vegetation images though it was trained and validated solely on simulated images which might have different distribution than the actual vegetation sun kink classifier can classify professionally simulated sun kink videos with a precision of 975 | [['regular', 'maintenance', 'of', 'all', 'the', 'assets', 'is', 'pivotal', 'for', 'proper', 'functioning', 'of', 'railway', 'manual', 'maintenance', 'can', 'be', 'very', 'cumbersome', 'and', 'leave', 'room', 'for', 'errors', 'track', 'anomalies', 'like', 'vegetation', 'overgrowth', 'sun', 'kinks', 'affect', 'the', 'track', 'construct', 'and', 'result', 'in', 'unequal', 'load', 'transfer', 'imbalanced', 'lateral', 'forces', 'on', 'tracks', 'which', 'causes', 'further', 'deterioration', 'of', 'tracks', 'and', 'can', 'ultimately', 'result', 'in', 'derailment', 'of', 'locomotive', 'hence', 'there', 'is', 'a', 'need', 'to', 'continuously', 'monitor', 'rail', 'track', 'health', 'track', 'anomalies', 'are', 'rare', 'with', 'the', 'skew', 'as', 'high', 'as', 'one', 'anomaly', 'in', 'millions', 'of', 'good', 'images', 'we', 'propose', 'a', 'method', 'to', 'build', 'training', 'data', 'that', 'will', 'make', 'our', 'algorithms', 'more', 'robust', 'and', 'help', 'us', 'detect', 'real', 'world', 'track', 'issues', 'the', 'data', 'augmentation', 'will', 'have', 'a', 'direct', 'effect', 'in', 'making', 'us', 'detect', 'better', 'anomalies', 'and', 'hence', 'improve', 'time', 'for', 'railroads', 'that', 'is', 'spent', 'in', 'manual', 'inspection', 'this', 'paper', 'talks', 'about', 'a', 'real', 'world', 'use', 'case', 'of', 'detecting', 'railway', 'track', 'defects', 'from', 'a', 'camera', 'mounted', 'on', 'a', 'moving', 'locomotive', 'and', 'tracking', 'their', 'locations', 'the', 'camera', 'is', 'engineered', 'to', 'withstand', 'the', 'environment', 'factors', 'on', 'a', 'moving', 'train', 'and', 'provide', 'a', 'consistent', 'steady', 'image', 'at', 'around', '30', 'frames', 'per', 'second', 'an', 'image', 'simulation', 'pipeline', 'of', 'track', 'detection', 'region', 'of', 'interest', 'selection', 'augmenting', 'image', 'for', 'anomalies', 'is', 'implemented', 'training', 'images', 'are', 'simulated', 'for', 'sun', 'kink', 'and', 'vegetation', 'overgrowth', 'inception', 'v3', 'model', 'pretrained', 'on', 'imagenet', 'dataset', 'is', 'finetuned', 'for', 'a', '2', 'class', 'classification', 'for', 'the', 'case', 'of', 'vegetation', 'overgrowth', 'the', 'model', 'generalizes', 'well', 'on', 'actual', 'vegetation', 'images', 'though', 'it', 'was', 'trained', 'and', 'validated', 'solely', 'on', 'simulated', 'images', 'which', 'might', 'have', 'different', 'distribution', 'than', 'the', 'actual', 'vegetation', 'sun', 'kink', 'classifier', 'can', 'classify', 'professionally', 'simulated', 'sun', 'kink', 'videos', 'with', 'a', 'precision', 'of', '975']] | [-0.06911565617314415, 0.09796488638980934, -0.05921329309914214, 0.07557406376447152, -0.09824148130717449, -0.1791542702761524, 0.02755885241937316, 0.4219963208264554, -0.20186928338757867, -0.3872550278565836, 0.1393993306011533, -0.291015463150762, -0.13116447668731052, 0.21393193863306004, -0.1563467501087109, 0.039881937572268586, 0.15718253600765827, 0.04974825329633534, -0.02640510040205283, -0.262761512420742, 0.23386624671765924, 0.07772786705922806, 0.31536233183063755, 0.024288099396987298, 0.10465488906963208, -0.02866888532098988, -0.06563484115233571, -0.01439581623818685, -0.03312864255720946, 0.08036423089497115, 0.27669519851058183, 0.1448646047537548, 0.23247648277471267, -0.4424484477240579, -0.2177039741787266, 0.10250563993175861, 0.14262688240046456, 0.09070558653764481, -0.04313980296132489, -0.33647761740200627, 0.09541336565853402, -0.14532770541765969, -0.08504276809266631, -0.09168187824383862, 0.02259134627972807, -0.01486647426989602, -0.255197631750787, 0.057282435522828294, -0.0066400558132147045, 0.10427218648737015, -0.07566930745839266, -0.06198388744744099, -0.0577824709698262, 0.2255475111944527, 0.025687331864980154, 0.06159423133156629, 0.20895334294348256, -0.15925385139332848, -0.09892045543613148, 0.3833022139872347, -0.03893976576613903, -0.16276570900834236, 0.2037093025478383, -0.08319155367709938, -0.11069037914292934, 0.1527428016291817, 0.24506861965309842, 0.09291767892226012, -0.1473471316801458, -0.0316340345042482, -0.019742937026030992, 0.17936224259758898, 0.09880829105382308, -0.057649102311628446, 0.2318156601950217, 0.22189405221418085, 0.060859322072585056, 0.11561783929296604, -0.1773041419286469, -0.030643242118806185, -0.22575158162575404, -0.1324826681983089, -0.1455858055849321, -0.009483031106907673, -0.07139582550793, -0.17729558667843817, 0.3945020817872473, 0.21502378359705962, 0.1916675219469492, 0.05019642376098849, 0.3032212099228525, -0.02241728586163237, 0.12425536732525574, 0.05208585376343572, 0.1763533282367721, -0.001794127417923311, 0.15007297916628676, -0.18557917094372955, 0.09647724241014513, 0.018237569043244695] |
1,802.01287 | Burst detection methods | `Bursting', defined as periods of high frequency firing of a neuron separated
by periods of quiescence, has been observed in various neuronal systems, both
\textit{in vitro} and \textit{in vivo}. It has been associated with a range of
neuronal processes, including efficient information transfer and the formation
of functional networks during development, and has been shown to be sensitive
to genetic and pharmacological manipulations. Accurate detection of periods of
bursting activity is thus an important aspect of characterising both
spontaneous and evoked neuronal network activity. A wide variety of
computational methods have been developed to detect periods of bursting in
spike trains recorded from neuronal networks. In this chapter, we review
several of the most popular and successful of these methods.
| q-bio.NC | bursting defined as periods of high frequency firing of a neuron separated by periods of quiescence has been observed in various neuronal systems both textitin vitro and textitin vivo it has been associated with a range of neuronal processes including efficient information transfer and the formation of functional networks during development and has been shown to be sensitive to genetic and pharmacological manipulations accurate detection of periods of bursting activity is thus an important aspect of characterising both spontaneous and evoked neuronal network activity a wide variety of computational methods have been developed to detect periods of bursting in spike trains recorded from neuronal networks in this chapter we review several of the most popular and successful of these methods | [['bursting', 'defined', 'as', 'periods', 'of', 'high', 'frequency', 'firing', 'of', 'a', 'neuron', 'separated', 'by', 'periods', 'of', 'quiescence', 'has', 'been', 'observed', 'in', 'various', 'neuronal', 'systems', 'both', 'textitin', 'vitro', 'and', 'textitin', 'vivo', 'it', 'has', 'been', 'associated', 'with', 'a', 'range', 'of', 'neuronal', 'processes', 'including', 'efficient', 'information', 'transfer', 'and', 'the', 'formation', 'of', 'functional', 'networks', 'during', 'development', 'and', 'has', 'been', 'shown', 'to', 'be', 'sensitive', 'to', 'genetic', 'and', 'pharmacological', 'manipulations', 'accurate', 'detection', 'of', 'periods', 'of', 'bursting', 'activity', 'is', 'thus', 'an', 'important', 'aspect', 'of', 'characterising', 'both', 'spontaneous', 'and', 'evoked', 'neuronal', 'network', 'activity', 'a', 'wide', 'variety', 'of', 'computational', 'methods', 'have', 'been', 'developed', 'to', 'detect', 'periods', 'of', 'bursting', 'in', 'spike', 'trains', 'recorded', 'from', 'neuronal', 'networks', 'in', 'this', 'chapter', 'we', 'review', 'several', 'of', 'the', 'most', 'popular', 'and', 'successful', 'of', 'these', 'methods']] | [-0.09765795452428089, 0.1265413592725963, -0.03401005931664258, 0.06650202831175799, -0.042094293811048074, -0.14639868639642373, -0.02170800358095827, 0.44746606502061087, -0.21316471945901866, -0.31275451093291246, 0.13432882732886356, -0.20866531085242362, -0.27529614805243907, 0.26513089853494115, -0.0885017226023289, 0.09661898822232615, 0.06382934862437348, 0.04630924802040681, 0.02680979375727475, -0.21004287854399686, 0.20140260830521584, 0.0552548167295754, 0.2997619575976084, 0.013760648760944605, 0.13141547876875848, -0.08016068521343793, -0.043208371366684636, -0.028289321353076956, -0.07546184425397466, 0.14435785373207183, 0.33630269512844585, 0.18028014535084366, 0.3114129884013285, -0.5223501931099842, -0.3351356670260429, 0.11567324039642699, 0.16452528190566226, 0.10955266941649218, -0.035710579327618085, -0.2749118951149285, 0.08636269359849394, -0.1939426561410073, -0.04119602250478541, -0.10936852723825723, 0.13422383150512662, 0.09660820551216602, -0.22378919003531336, 0.09541114936582744, 0.01427216822145662, 0.15180372151080518, -0.06922850627258109, -0.049822455718337245, -0.022501032949852135, 0.20180730457650498, 0.07979577757068909, 0.02849122307767781, 0.17145329380485538, -0.15521130886821385, -0.17154226689599456, 0.2690934033715166, -0.020129387067087615, -0.07173175984062255, 0.2734136211996277, -0.12275160954353244, -0.1790900620360238, 0.16310340585575128, 0.1984932018443942, 0.09189512203253496, -0.20821522548309682, -0.04082658493716736, 0.06034195191847781, 0.19499127451951306, 0.1083110309050729, 0.040832110696161786, 0.21248586809961126, 0.2857667374735077, -0.03498074876260944, 0.09990880725187405, -0.15330669397226301, -0.08192687377062005, -0.15601912053728786, -0.04625099369720071, -0.13782210178129997, 0.04708479741821066, -0.02620731191636878, -0.1341454906318783, 0.4812460013005572, 0.08536194958724082, 0.2014230275041579, 0.01580121354587997, 0.2277817169825236, 0.07935603337343006, 0.10064657044907412, -0.010905579846197118, 0.21847134941878418, 0.15844685981088938, 0.1391283338656649, -0.22475208367492694, 0.15757095105558014, -0.04611427480510125] |
1,802.01288 | Network Community Detection with A Successive Spectral Relaxation Method | With invaluable theoretical and practical benefits, the problem of
partitioning networks for community structures has attracted significant
research attention in scientific and engineering disciplines. In literature,
Newman's modularity measure is routinely applied to quantify the quality of a
given partition, and thereby maximizing the measure provides a principled way
of detecting communities in networks. Unfortunately, the exact optimization of
the measure is computationally NP-complete and only applicable to very small
networks. Approximation approaches have to be sought to scale to large
networks. To address the computational issue, we proposed a new method to
identify the partition decisions. Coupled with an iterative rounding strategy
and a fast constrained power method, our work achieves tight and effective
spectral relaxations. The proposed method was evaluated thoroughly on both real
and synthetic networks. Compared with state-of-the-art approaches, the method
obtained comparable, if not better, qualities. Meanwhile, it is highly suitable
for parallel execution and reported a nearly linear improvement in running
speed when increasing the number of computing nodes, which thereby provides a
practical tool for partitioning very large networks.
| cs.SI physics.soc-ph | with invaluable theoretical and practical benefits the problem of partitioning networks for community structures has attracted significant research attention in scientific and engineering disciplines in literature newmans modularity measure is routinely applied to quantify the quality of a given partition and thereby maximizing the measure provides a principled way of detecting communities in networks unfortunately the exact optimization of the measure is computationally npcomplete and only applicable to very small networks approximation approaches have to be sought to scale to large networks to address the computational issue we proposed a new method to identify the partition decisions coupled with an iterative rounding strategy and a fast constrained power method our work achieves tight and effective spectral relaxations the proposed method was evaluated thoroughly on both real and synthetic networks compared with stateoftheart approaches the method obtained comparable if not better qualities meanwhile it is highly suitable for parallel execution and reported a nearly linear improvement in running speed when increasing the number of computing nodes which thereby provides a practical tool for partitioning very large networks | [['with', 'invaluable', 'theoretical', 'and', 'practical', 'benefits', 'the', 'problem', 'of', 'partitioning', 'networks', 'for', 'community', 'structures', 'has', 'attracted', 'significant', 'research', 'attention', 'in', 'scientific', 'and', 'engineering', 'disciplines', 'in', 'literature', 'newmans', 'modularity', 'measure', 'is', 'routinely', 'applied', 'to', 'quantify', 'the', 'quality', 'of', 'a', 'given', 'partition', 'and', 'thereby', 'maximizing', 'the', 'measure', 'provides', 'a', 'principled', 'way', 'of', 'detecting', 'communities', 'in', 'networks', 'unfortunately', 'the', 'exact', 'optimization', 'of', 'the', 'measure', 'is', 'computationally', 'npcomplete', 'and', 'only', 'applicable', 'to', 'very', 'small', 'networks', 'approximation', 'approaches', 'have', 'to', 'be', 'sought', 'to', 'scale', 'to', 'large', 'networks', 'to', 'address', 'the', 'computational', 'issue', 'we', 'proposed', 'a', 'new', 'method', 'to', 'identify', 'the', 'partition', 'decisions', 'coupled', 'with', 'an', 'iterative', 'rounding', 'strategy', 'and', 'a', 'fast', 'constrained', 'power', 'method', 'our', 'work', 'achieves', 'tight', 'and', 'effective', 'spectral', 'relaxations', 'the', 'proposed', 'method', 'was', 'evaluated', 'thoroughly', 'on', 'both', 'real', 'and', 'synthetic', 'networks', 'compared', 'with', 'stateoftheart', 'approaches', 'the', 'method', 'obtained', 'comparable', 'if', 'not', 'better', 'qualities', 'meanwhile', 'it', 'is', 'highly', 'suitable', 'for', 'parallel', 'execution', 'and', 'reported', 'a', 'nearly', 'linear', 'improvement', 'in', 'running', 'speed', 'when', 'increasing', 'the', 'number', 'of', 'computing', 'nodes', 'which', 'thereby', 'provides', 'a', 'practical', 'tool', 'for', 'partitioning', 'very', 'large', 'networks']] | [-0.08586133321990598, -0.014172030650446355, -0.06436910331831314, 0.07288371184668821, -0.10410538137445903, -0.18274428020454667, 0.06763903160092676, 0.41566648336910555, -0.2603024890810378, -0.3593185204822062, 0.08088291141691363, -0.23383350556700447, -0.18297692042754285, 0.23318320586324923, -0.07757790286400863, 0.12653612551300533, 0.11748972173187543, -0.005777619159992107, -0.04297096760340289, -0.2881103998568671, 0.2329278509211938, 0.11817003398424607, 0.3780574867269024, 0.08952324639804746, 0.09084694462415593, -0.035439411286709153, -0.03860555788692595, 0.08170642183077606, -0.0850707439068091, 0.18790335882261966, 0.3133491672977636, 0.19218168834975752, 0.3551001588268925, -0.4050515178241767, -0.21295947310599414, 0.12893984673031478, 0.15377268730398183, 0.0984071336193169, -0.04914218248780922, -0.2648224223521538, 0.11120984537476696, -0.14545452157670463, -0.0699240068603434, -0.15567848483624402, 0.023459646106030876, -0.01415065848810958, -0.2767787470180668, 0.012684362655239634, 0.0014605749304543926, 0.024350274121388793, -0.01258428754888221, -0.1401594922089399, 0.053776559626302595, 0.14537879752093763, 0.048550646568235774, 0.057509400155554016, 0.09148611135738478, -0.13416055556114193, -0.13299193711678858, 0.3999226455185139, -0.033237694421338594, -0.2140342056730085, 0.21118933547933755, -0.0317926069996743, -0.16661314240693834, 0.13812287998470393, 0.21440936967899854, 0.1232493190089537, -0.14826138002246642, 0.054472205745035106, -0.006329141616085756, 0.15686705955621702, 0.03896750064714896, 0.01629112426599022, 0.15104030097162732, 0.24045437313907314, 0.12414319576584437, 0.14305782621985683, -0.05151823783605571, -0.10140840615548025, -0.1529601760538009, -0.10665470167176946, -0.23218472455681133, -0.015797008344799742, -0.11680046767088986, -0.1663133492666847, 0.4076632039663805, 0.1796358221697367, 0.16444881713356485, 0.10678785650485555, 0.3553484388394281, 0.08858773205495461, 0.0944160022739776, 0.10127183037481947, 0.21352637889107096, 0.11341170326870104, 0.11927089622688734, -0.18392967000107258, 0.09154544357178648, -0.0035295491715342823] |
1,802.01289 | On Distributed Algorithms for Cost-Efficient Data Center Placement in
Cloud Computing | The increasing popularity of cloud computing has resulted in a proliferation
of data centers. Effective placement of data centers improves network
performance and minimizes clients' perceived latency. The problem of
determining the optimal placement of data centers in a large network is a
classical uncapacitated $k$-median problem. Traditional works have focused on
centralized algorithms, which requires knowledge of the overall network
topology and information about the customers' service demands. Moreover,
centralized algorithms are computationally expensive and do not scale well with
the size of the network. We propose a fully distributed algorithm with linear
complexity to optimize the locations of data centers. The proposed algorithm
utilizes an iterative two-step optimization approach. Specifically, in each
iteration, it first partitions the whole network into $k$ regions through a
distributed partitioning algorithm; then within each region, it determines the
local approximate optimal location through a distributed message-passing
algorithm. When the underlying network is a tree topology, we show that the
overall cost is monotonically decreasing between successive iterations and the
proposed algorithm converges in a finite number of iterations. Extensive
simulations on both synthetic and real Internet topologies show that the
proposed algorithm achieves performance comparable with that of centralized
algorithms that require global information and have higher computational
complexity.
| cs.NI | the increasing popularity of cloud computing has resulted in a proliferation of data centers effective placement of data centers improves network performance and minimizes clients perceived latency the problem of determining the optimal placement of data centers in a large network is a classical uncapacitated kmedian problem traditional works have focused on centralized algorithms which requires knowledge of the overall network topology and information about the customers service demands moreover centralized algorithms are computationally expensive and do not scale well with the size of the network we propose a fully distributed algorithm with linear complexity to optimize the locations of data centers the proposed algorithm utilizes an iterative twostep optimization approach specifically in each iteration it first partitions the whole network into k regions through a distributed partitioning algorithm then within each region it determines the local approximate optimal location through a distributed messagepassing algorithm when the underlying network is a tree topology we show that the overall cost is monotonically decreasing between successive iterations and the proposed algorithm converges in a finite number of iterations extensive simulations on both synthetic and real internet topologies show that the proposed algorithm achieves performance comparable with that of centralized algorithms that require global information and have higher computational complexity | [['the', 'increasing', 'popularity', 'of', 'cloud', 'computing', 'has', 'resulted', 'in', 'a', 'proliferation', 'of', 'data', 'centers', 'effective', 'placement', 'of', 'data', 'centers', 'improves', 'network', 'performance', 'and', 'minimizes', 'clients', 'perceived', 'latency', 'the', 'problem', 'of', 'determining', 'the', 'optimal', 'placement', 'of', 'data', 'centers', 'in', 'a', 'large', 'network', 'is', 'a', 'classical', 'uncapacitated', 'kmedian', 'problem', 'traditional', 'works', 'have', 'focused', 'on', 'centralized', 'algorithms', 'which', 'requires', 'knowledge', 'of', 'the', 'overall', 'network', 'topology', 'and', 'information', 'about', 'the', 'customers', 'service', 'demands', 'moreover', 'centralized', 'algorithms', 'are', 'computationally', 'expensive', 'and', 'do', 'not', 'scale', 'well', 'with', 'the', 'size', 'of', 'the', 'network', 'we', 'propose', 'a', 'fully', 'distributed', 'algorithm', 'with', 'linear', 'complexity', 'to', 'optimize', 'the', 'locations', 'of', 'data', 'centers', 'the', 'proposed', 'algorithm', 'utilizes', 'an', 'iterative', 'twostep', 'optimization', 'approach', 'specifically', 'in', 'each', 'iteration', 'it', 'first', 'partitions', 'the', 'whole', 'network', 'into', 'k', 'regions', 'through', 'a', 'distributed', 'partitioning', 'algorithm', 'then', 'within', 'each', 'region', 'it', 'determines', 'the', 'local', 'approximate', 'optimal', 'location', 'through', 'a', 'distributed', 'messagepassing', 'algorithm', 'when', 'the', 'underlying', 'network', 'is', 'a', 'tree', 'topology', 'we', 'show', 'that', 'the', 'overall', 'cost', 'is', 'monotonically', 'decreasing', 'between', 'successive', 'iterations', 'and', 'the', 'proposed', 'algorithm', 'converges', 'in', 'a', 'finite', 'number', 'of', 'iterations', 'extensive', 'simulations', 'on', 'both', 'synthetic', 'and', 'real', 'internet', 'topologies', 'show', 'that', 'the', 'proposed', 'algorithm', 'achieves', 'performance', 'comparable', 'with', 'that', 'of', 'centralized', 'algorithms', 'that', 'require', 'global', 'information', 'and', 'have', 'higher', 'computational', 'complexity']] | [-0.1467135404214119, -0.013508342208095, -0.057584644012953996, 0.02962454336139729, -0.08052168115253609, -0.15593580630549414, 0.1294189108612133, 0.43085994116134113, -0.28559431019306614, -0.35100715823813483, 0.09834596437710261, -0.24519034948622906, -0.16939892812411567, 0.14847404125837185, -0.11304933999359702, 0.10424324395674942, 0.10655840466897819, 0.06005384578259329, -0.05771880257633742, -0.3201529968008039, 0.26075517860970093, 0.09239493540357709, 0.38167069712878715, 0.019733907335442332, 0.12221512862240473, 0.00958614994525802, -0.027752651657531227, 0.04504561820292422, -0.053929629762221695, 0.1358423913763791, 0.278546791303237, 0.2476682278647083, 0.35628163379927474, -0.44439570747927765, -0.16268537215638798, 0.13198292133812276, 0.18533241143900056, 0.08725516284998182, -0.033344114225713206, -0.2445589199061573, 0.12964481541634973, -0.1384360482061399, -0.029444993887510564, -0.04439640647038853, -0.03184368293327482, 0.054365047441507525, -0.30731965792207905, 0.011542564522725831, -0.007383234189274375, 0.006321325845305543, -0.04503456825122759, -0.10497285632173652, 0.004337789822630765, 0.1464024383355672, 0.005445116200677799, 0.04075213388600589, 0.17290276355123607, -0.08906335582515755, -0.16569220127396123, 0.35373160645257734, 0.019210521041771064, -0.18011095373135438, 0.14826192894437606, -0.025986651588537267, -0.15410004438413982, 0.1808398273865724, 0.22919935245386883, 0.11661887205102378, -0.12503091773561795, 0.10743560128033179, -0.05674432821803533, 0.17933190565619275, 0.014677836536092387, 0.019111941052276805, 0.10786216264109212, 0.2548724221512602, 0.1916447613660498, 0.14162651096934065, -0.07089107474205332, -0.14085955313825305, -0.18166236082487852, -0.11855541195288516, -0.24118211512017437, -0.053513700657584345, -0.17970121577609857, -0.1638105769938641, 0.36855785196404095, 0.15840927692965923, 0.20318088234640694, 0.1282473762282328, 0.3955788074268235, 0.06215771071439618, 0.08574168896302581, 0.2164622753912556, 0.1481289373082137, 0.01767480211413425, 0.13905205112653626, -0.23631297484049257, 0.11506657901665439, 0.060537611062364015] |
1,802.0129 | Deep Learning-based Channel Estimation for Beamspace mmWave Massive MIMO
Systems | Channel estimation is very challenging when the receiver is equipped with a
limited number of radio-frequency (RF) chains in beamspace millimeter-wave
(mmWave) massive multiple-input and multiple-output systems. To solve this
problem, we exploit a learned denoising-based approximate message passing
(LDAMP) network. This neural network can learn channel structure and estimate
channel from a large number of training data. Furthermore, we provide an
analytical framework on the asymptotic performance of the channel estimator.
Based on our analysis and simulation results, the LDAMP neural network
significantly outperforms state-of-the-art compressed sensingbased algorithms
even when the receiver is equipped with a small number of RF chains. Therefore,
deep learning is a powerful tool for channel estimation in mmWave
communications.
| cs.IT math.IT | channel estimation is very challenging when the receiver is equipped with a limited number of radiofrequency rf chains in beamspace millimeterwave mmwave massive multipleinput and multipleoutput systems to solve this problem we exploit a learned denoisingbased approximate message passing ldamp network this neural network can learn channel structure and estimate channel from a large number of training data furthermore we provide an analytical framework on the asymptotic performance of the channel estimator based on our analysis and simulation results the ldamp neural network significantly outperforms stateoftheart compressed sensingbased algorithms even when the receiver is equipped with a small number of rf chains therefore deep learning is a powerful tool for channel estimation in mmwave communications | [['channel', 'estimation', 'is', 'very', 'challenging', 'when', 'the', 'receiver', 'is', 'equipped', 'with', 'a', 'limited', 'number', 'of', 'radiofrequency', 'rf', 'chains', 'in', 'beamspace', 'millimeterwave', 'mmwave', 'massive', 'multipleinput', 'and', 'multipleoutput', 'systems', 'to', 'solve', 'this', 'problem', 'we', 'exploit', 'a', 'learned', 'denoisingbased', 'approximate', 'message', 'passing', 'ldamp', 'network', 'this', 'neural', 'network', 'can', 'learn', 'channel', 'structure', 'and', 'estimate', 'channel', 'from', 'a', 'large', 'number', 'of', 'training', 'data', 'furthermore', 'we', 'provide', 'an', 'analytical', 'framework', 'on', 'the', 'asymptotic', 'performance', 'of', 'the', 'channel', 'estimator', 'based', 'on', 'our', 'analysis', 'and', 'simulation', 'results', 'the', 'ldamp', 'neural', 'network', 'significantly', 'outperforms', 'stateoftheart', 'compressed', 'sensingbased', 'algorithms', 'even', 'when', 'the', 'receiver', 'is', 'equipped', 'with', 'a', 'small', 'number', 'of', 'rf', 'chains', 'therefore', 'deep', 'learning', 'is', 'a', 'powerful', 'tool', 'for', 'channel', 'estimation', 'in', 'mmwave', 'communications']] | [-0.2159195637087459, -0.004942870094395323, -0.026278865167304225, 0.017096312392664993, -0.1135100913800947, -0.28491530266549925, 0.04538726664512702, 0.4376803818685205, -0.24823619245511033, -0.2683521077684734, 0.11474244818698777, -0.22870541936920388, -0.2098180813537708, 0.18570202789876772, -0.09891620211141265, 0.10104120662840813, 0.154706735605293, 0.03886045371612493, -0.0582043261429214, -0.2148074993762471, 0.25447762406825936, 0.1305864581086612, 0.38456994369626046, -0.02434509055607993, 0.12759543418094677, 0.02560763485000833, -0.005578206923952245, -0.06479191434589902, -0.06745622865552002, 0.1419388618796011, 0.3625661271907713, 0.21466054039318924, 0.2904969510278138, -0.43021342180993244, -0.2754383421482761, 0.10696116234783246, 0.19683085591937213, 0.11222858113520172, -0.030023926773877895, -0.3270153880443262, 0.14020991462647267, -0.24543233700906453, 0.02582906197513575, -0.013435634557643662, -0.13639235791304838, 0.02116163275811983, -0.3694650313842272, -0.004682600482002548, 0.005303165747824571, 0.052359926894955014, 0.004489889469645594, -0.12924722290557364, 0.08108652607618791, 0.12202085018734975, 0.0015504714749429538, 0.0416374634725482, 0.08902907831513364, -0.1433493156593455, -0.06295496722602326, 0.2923620637830185, -0.05062083690224782, -0.2646379212403427, 0.18236201918613085, -0.04491364559887544, -0.12337483722392632, 0.17019914789479632, 0.31795177622850096, 0.07393306066160617, -0.1776129426816782, 0.04132441584192945, -0.047118041198700666, 0.19795325802558142, 0.014318070131475511, 0.09345071216964203, 0.1378198057534578, 0.29267290889326, 0.10739563012333668, 0.16214026439651522, -0.20224484233793033, -0.06553555979676869, -0.15589122070890407, -0.09622207368602571, -0.27652098970366235, -0.0038523098848679146, -0.11764289371874284, -0.09370225860861271, 0.351286403130254, 0.17700271138354487, 0.1216373283173079, 0.16605112901281405, 0.437635504891691, 0.05135435305798993, 0.07679875010229728, 0.16603161805187877, 0.1830847893173442, 0.17436965568719998, 0.12749707306046848, -0.18631392066043032, 0.05296291636060114, -0.05283710663409337] |
1,802.01291 | Plasmonic physics of 2D crystalline materials | Collective modes of doped two-dimensional crystalline materials, namely
graphene, MoS$_2$ and phosphorene, both monolayer and bilayer structures, are
explored using the density functional theory simulations together with the
random phase approximation. The many-body dielectric functions of the materials
are calculated using an {\it ab initio} based model involving
material-realistic physical properties. Having calculated the electron
energy-loss, we calculate the collective modes of each material considering the
in-phase and out-of-phase modes for bilayer structures. Furthermore, owing to
many band structures and intreband transitions, we also find high-energy
excitations in the systems. We explain that the material-specific dielectric
function considering the polarizability of the crystalline material such as
MoS$_2$ are needed to obtain realistic plasmon dispersions. For each material
studied here, we find different collective modes and describe their physical
origins.
| cond-mat.mes-hall cond-mat.mtrl-sci | collective modes of doped twodimensional crystalline materials namely graphene mos_2 and phosphorene both monolayer and bilayer structures are explored using the density functional theory simulations together with the random phase approximation the manybody dielectric functions of the materials are calculated using an it ab initio based model involving materialrealistic physical properties having calculated the electron energyloss we calculate the collective modes of each material considering the inphase and outofphase modes for bilayer structures furthermore owing to many band structures and intreband transitions we also find highenergy excitations in the systems we explain that the materialspecific dielectric function considering the polarizability of the crystalline material such as mos_2 are needed to obtain realistic plasmon dispersions for each material studied here we find different collective modes and describe their physical origins | [['collective', 'modes', 'of', 'doped', 'twodimensional', 'crystalline', 'materials', 'namely', 'graphene', 'mos_2', 'and', 'phosphorene', 'both', 'monolayer', 'and', 'bilayer', 'structures', 'are', 'explored', 'using', 'the', 'density', 'functional', 'theory', 'simulations', 'together', 'with', 'the', 'random', 'phase', 'approximation', 'the', 'manybody', 'dielectric', 'functions', 'of', 'the', 'materials', 'are', 'calculated', 'using', 'an', 'it', 'ab', 'initio', 'based', 'model', 'involving', 'materialrealistic', 'physical', 'properties', 'having', 'calculated', 'the', 'electron', 'energyloss', 'we', 'calculate', 'the', 'collective', 'modes', 'of', 'each', 'material', 'considering', 'the', 'inphase', 'and', 'outofphase', 'modes', 'for', 'bilayer', 'structures', 'furthermore', 'owing', 'to', 'many', 'band', 'structures', 'and', 'intreband', 'transitions', 'we', 'also', 'find', 'highenergy', 'excitations', 'in', 'the', 'systems', 'we', 'explain', 'that', 'the', 'materialspecific', 'dielectric', 'function', 'considering', 'the', 'polarizability', 'of', 'the', 'crystalline', 'material', 'such', 'as', 'mos_2', 'are', 'needed', 'to', 'obtain', 'realistic', 'plasmon', 'dispersions', 'for', 'each', 'material', 'studied', 'here', 'we', 'find', 'different', 'collective', 'modes', 'and', 'describe', 'their', 'physical', 'origins']] | [-0.1439790908152645, 0.18241420701735933, -0.06119441895134514, 0.038886802416527644, -0.013245218418887816, -0.13596445626171771, 0.05115563083654706, 0.4540348867449211, -0.2539162860412034, -0.25602721532050055, -0.04123345806601719, -0.33292287852964364, -0.215779957419727, 0.15428316953693866, 0.10275960291619413, 0.06538198798807571, -0.018378524648142047, -0.086457142022482, -0.09516952715603111, -0.12969786331677824, 0.27895374469153467, 0.005817960925924126, 0.29841927277084324, 0.0652054185338784, 0.029352032139286166, 0.02432258350745542, 0.08325497763689782, 0.024855574476532638, -0.19520095971012097, 0.08403505635578767, 0.24970058315011556, -0.10850500775995897, 0.18880657365662046, -0.5171911769139115, -0.23673626855452312, -0.018229367116873618, 0.14033541102617164, 0.1566356226503558, -0.05375079133773397, -0.24697734804067295, 0.041773353314056294, -0.145284785219701, -0.12481027591638849, -0.15266945535404375, -0.022875388825923437, 0.04856182299045031, -0.21149063140910584, 0.0750451005276318, -0.03831537589576328, 0.05596258023768996, -0.1792185329941276, -0.16147856716634124, -0.10849023607624986, 0.07178230305453326, 0.04923933444206341, -0.054981324577966006, 0.22270389746699948, -0.1123291655057983, -0.10741516992129618, 0.4659476336601074, -0.006185935053508729, -0.14318902055674698, 0.19480857353300962, -0.17915955782518722, -0.07371880397931818, 0.12195069067456643, 0.1330760005553202, 0.09560000248529832, -0.13408473039544333, 0.052424911400066776, -0.014837515202998475, 0.15977197950996924, 0.05841729742496682, 0.16459551158550312, 0.23660785287211183, 0.17116792907484069, -0.06066043843065927, 0.13278659004936344, -0.09800739217462251, -0.012551286847156007, -0.19683464696936426, -0.17226743642459041, -0.21930780383809179, 0.017866960261017084, -0.08038499249357756, -0.2449077599158045, 0.4599511423584772, 0.09591949377499986, 0.1403672521628323, -0.03834974798701296, 0.2395671699050581, 0.1434787441203298, 0.05872717357124202, 0.011183528375113383, 0.29451980434168945, 0.19142707135506498, 0.04728943393274676, -0.26273792194842827, 0.018057371184113435, -0.007855162603846111] |
1,802.01292 | Rate-Energy Region in Wireless Information and Power Transfer: New
Receiver Architecture and Practical Modulation | When simultaneous wireless information and power transfer is carried out, a
fundamental tradeoff between achievable rate and harvested energy exists
because the received power is used for two different purposes. The tradeoff is
well characterized by the rate-energy region, and several techniques have been
proposed to improve the achievable rate-energy region. However, the existing
techniques still have a considerable loss in either energy or rate and thus the
known achievable rate-energy regions are far from the ideal one. Deriving tight
upper and lower bounds on the rate-energy region of our proposed scheme, we
prove that the rate-energy region can be expanded almost to the ideal upper
bound. Contrary to the existing techniques, in the proposed scheme, the
information decoding circuit not only extracts amplitude and phase information
but also combines the extracted information with the amplitude information
obtained from the rectified signal. Consequently, the required energy for
decoding can be minimized, and thus the proposed scheme achieves a near-optimal
rate-energy region, which implies that the fundamental tradeoff in the
achievable rate-energy region is nearly eliminated. To practically account for
the theoretically achievable rate-energy region, we also present practical
examples with an $M$-ary multi-level circular QAM with Gaussian maximum
likelihood detection.
| cs.IT math.IT | when simultaneous wireless information and power transfer is carried out a fundamental tradeoff between achievable rate and harvested energy exists because the received power is used for two different purposes the tradeoff is well characterized by the rateenergy region and several techniques have been proposed to improve the achievable rateenergy region however the existing techniques still have a considerable loss in either energy or rate and thus the known achievable rateenergy regions are far from the ideal one deriving tight upper and lower bounds on the rateenergy region of our proposed scheme we prove that the rateenergy region can be expanded almost to the ideal upper bound contrary to the existing techniques in the proposed scheme the information decoding circuit not only extracts amplitude and phase information but also combines the extracted information with the amplitude information obtained from the rectified signal consequently the required energy for decoding can be minimized and thus the proposed scheme achieves a nearoptimal rateenergy region which implies that the fundamental tradeoff in the achievable rateenergy region is nearly eliminated to practically account for the theoretically achievable rateenergy region we also present practical examples with an mary multilevel circular qam with gaussian maximum likelihood detection | [['when', 'simultaneous', 'wireless', 'information', 'and', 'power', 'transfer', 'is', 'carried', 'out', 'a', 'fundamental', 'tradeoff', 'between', 'achievable', 'rate', 'and', 'harvested', 'energy', 'exists', 'because', 'the', 'received', 'power', 'is', 'used', 'for', 'two', 'different', 'purposes', 'the', 'tradeoff', 'is', 'well', 'characterized', 'by', 'the', 'rateenergy', 'region', 'and', 'several', 'techniques', 'have', 'been', 'proposed', 'to', 'improve', 'the', 'achievable', 'rateenergy', 'region', 'however', 'the', 'existing', 'techniques', 'still', 'have', 'a', 'considerable', 'loss', 'in', 'either', 'energy', 'or', 'rate', 'and', 'thus', 'the', 'known', 'achievable', 'rateenergy', 'regions', 'are', 'far', 'from', 'the', 'ideal', 'one', 'deriving', 'tight', 'upper', 'and', 'lower', 'bounds', 'on', 'the', 'rateenergy', 'region', 'of', 'our', 'proposed', 'scheme', 'we', 'prove', 'that', 'the', 'rateenergy', 'region', 'can', 'be', 'expanded', 'almost', 'to', 'the', 'ideal', 'upper', 'bound', 'contrary', 'to', 'the', 'existing', 'techniques', 'in', 'the', 'proposed', 'scheme', 'the', 'information', 'decoding', 'circuit', 'not', 'only', 'extracts', 'amplitude', 'and', 'phase', 'information', 'but', 'also', 'combines', 'the', 'extracted', 'information', 'with', 'the', 'amplitude', 'information', 'obtained', 'from', 'the', 'rectified', 'signal', 'consequently', 'the', 'required', 'energy', 'for', 'decoding', 'can', 'be', 'minimized', 'and', 'thus', 'the', 'proposed', 'scheme', 'achieves', 'a', 'nearoptimal', 'rateenergy', 'region', 'which', 'implies', 'that', 'the', 'fundamental', 'tradeoff', 'in', 'the', 'achievable', 'rateenergy', 'region', 'is', 'nearly', 'eliminated', 'to', 'practically', 'account', 'for', 'the', 'theoretically', 'achievable', 'rateenergy', 'region', 'we', 'also', 'present', 'practical', 'examples', 'with', 'an', 'mary', 'multilevel', 'circular', 'qam', 'with', 'gaussian', 'maximum', 'likelihood', 'detection']] | [-0.1527449296391569, 0.04371154679283791, -0.04061396740144119, 0.07963081389665604, -0.036210095160640776, -0.18350931313761976, 0.13771803586976603, 0.373947104467079, -0.2778475258941762, -0.3156579722650349, 0.12867165081901477, -0.23214232616359368, -0.1369188074406702, 0.26150332147139127, -0.0890798212889058, 0.07819184230000246, 0.027654878576286138, 0.05822217918001115, -0.06513797992782201, -0.26113847565371545, 0.25098144602961836, 0.1658891487540677, 0.3753873366024345, 0.08253544441889972, 0.1049511921969679, -0.045193228813586755, -0.010320335594005883, -0.0040856730751693245, -0.1879756327978248, 0.11171248188504251, 0.31410314394161104, 0.19288633964955806, 0.24029905449133365, -0.3551664566504769, -0.24989227769896388, 0.1190130872168811, 0.21323876428825314, 0.0816582371009281, -0.05767378693155479, -0.24289264076622202, 0.09143916072789579, -0.17126820916077123, -0.02591016635997221, -0.04105561959790066, -0.06862919036066159, 0.008909676570328883, -0.34590212339768184, 0.049384466975170654, 0.06492740105415579, -0.00023118438926758244, -0.017881074646720663, -0.1372415291867219, 0.004480048180557788, 0.1590461099772074, 0.00697233987506479, 0.009697621457162313, 0.10274625087506138, -0.10191528199939057, -0.07299276862526312, 0.30524825126864014, -0.015634130832040682, -0.2159721767285373, 0.11621286139939911, -0.13874675435363315, -0.04348209578776732, 0.20891631258185953, 0.15572070115827955, 0.0806115244445391, -0.15257351822430792, 0.046418100838491225, -0.014531246756669135, 0.20167910164222122, 0.09216066813562065, 0.1354133615968749, 0.16014220144134014, 0.14830115320160986, 0.11019155119778588, 0.17394923556013964, -0.14355122702079826, -0.12223916795686819, -0.23880259814206511, -0.07842274415917927, -0.21754235020373017, -0.05867345117374498, -0.10646950330767141, -0.03185282248014119, 0.3337102025126114, 0.13403772309538908, 0.14594282862613908, 0.07365776911436114, 0.3896641779661877, 0.12804076730564704, 0.05899563805491198, 0.16717788715381177, 0.3332017891056603, 0.08491303404909559, 0.06899713624006835, -0.2074549221788766, 0.07569259390002117, 0.03404710656264797] |
1,802.01293 | Ice loss from the interior of small airless bodies according to an
idealized model | Ice in main belt asteroids and Near Earth Objects (NEOs) is of scientific and
resource exploration interest, but small airless bodies gradually lose their
ice to space by outward diffusion. Here, we quantitatively estimate the time it
takes a porous airless body to lose all of its interior ice, based on an
analytic solution for the interior temperature field of bodies in stable
orbits. Without latent heat, the average surface temperature, which is lower
than the classic effective temperature, is representative of the body interior
and hence an appropriate temperature to evaluate desiccation time scales. In a
spherically averaged model, an explicit analytic solution is obtained for the
depth to ice as a function of time and the time to complete desiccation. Half
of the ice volume is lost after 11% of this time. A bilobate structure emerges
from the strong latitude dependence of desiccation rates. Cold polar regions
can harbor subsurface ice, even when the body center does not. Latent heat
retards ice loss, and we obtain a succinct expression for the temperature
difference between the surface and the ice. In the outer main belt, nearly all
bodies 10~km in size or larger should have been able to retain ice in their
interiors over the age of the solar system. Each of the following factors
favors the presence of ice inside NEOs: a semi-major axis in the outer belt or
beyond, a mantle of very low thermal inertia, a young age, or a small and
stable axis tilt.
| astro-ph.EP | ice in main belt asteroids and near earth objects neos is of scientific and resource exploration interest but small airless bodies gradually lose their ice to space by outward diffusion here we quantitatively estimate the time it takes a porous airless body to lose all of its interior ice based on an analytic solution for the interior temperature field of bodies in stable orbits without latent heat the average surface temperature which is lower than the classic effective temperature is representative of the body interior and hence an appropriate temperature to evaluate desiccation time scales in a spherically averaged model an explicit analytic solution is obtained for the depth to ice as a function of time and the time to complete desiccation half of the ice volume is lost after 11 of this time a bilobate structure emerges from the strong latitude dependence of desiccation rates cold polar regions can harbor subsurface ice even when the body center does not latent heat retards ice loss and we obtain a succinct expression for the temperature difference between the surface and the ice in the outer main belt nearly all bodies 10km in size or larger should have been able to retain ice in their interiors over the age of the solar system each of the following factors favors the presence of ice inside neos a semimajor axis in the outer belt or beyond a mantle of very low thermal inertia a young age or a small and stable axis tilt | [['ice', 'in', 'main', 'belt', 'asteroids', 'and', 'near', 'earth', 'objects', 'neos', 'is', 'of', 'scientific', 'and', 'resource', 'exploration', 'interest', 'but', 'small', 'airless', 'bodies', 'gradually', 'lose', 'their', 'ice', 'to', 'space', 'by', 'outward', 'diffusion', 'here', 'we', 'quantitatively', 'estimate', 'the', 'time', 'it', 'takes', 'a', 'porous', 'airless', 'body', 'to', 'lose', 'all', 'of', 'its', 'interior', 'ice', 'based', 'on', 'an', 'analytic', 'solution', 'for', 'the', 'interior', 'temperature', 'field', 'of', 'bodies', 'in', 'stable', 'orbits', 'without', 'latent', 'heat', 'the', 'average', 'surface', 'temperature', 'which', 'is', 'lower', 'than', 'the', 'classic', 'effective', 'temperature', 'is', 'representative', 'of', 'the', 'body', 'interior', 'and', 'hence', 'an', 'appropriate', 'temperature', 'to', 'evaluate', 'desiccation', 'time', 'scales', 'in', 'a', 'spherically', 'averaged', 'model', 'an', 'explicit', 'analytic', 'solution', 'is', 'obtained', 'for', 'the', 'depth', 'to', 'ice', 'as', 'a', 'function', 'of', 'time', 'and', 'the', 'time', 'to', 'complete', 'desiccation', 'half', 'of', 'the', 'ice', 'volume', 'is', 'lost', 'after', '11', 'of', 'this', 'time', 'a', 'bilobate', 'structure', 'emerges', 'from', 'the', 'strong', 'latitude', 'dependence', 'of', 'desiccation', 'rates', 'cold', 'polar', 'regions', 'can', 'harbor', 'subsurface', 'ice', 'even', 'when', 'the', 'body', 'center', 'does', 'not', 'latent', 'heat', 'retards', 'ice', 'loss', 'and', 'we', 'obtain', 'a', 'succinct', 'expression', 'for', 'the', 'temperature', 'difference', 'between', 'the', 'surface', 'and', 'the', 'ice', 'in', 'the', 'outer', 'main', 'belt', 'nearly', 'all', 'bodies', '10km', 'in', 'size', 'or', 'larger', 'should', 'have', 'been', 'able', 'to', 'retain', 'ice', 'in', 'their', 'interiors', 'over', 'the', 'age', 'of', 'the', 'solar', 'system', 'each', 'of', 'the', 'following', 'factors', 'favors', 'the', 'presence', 'of', 'ice', 'inside', 'neos', 'a', 'semimajor', 'axis', 'in', 'the', 'outer', 'belt', 'or', 'beyond', 'a', 'mantle', 'of', 'very', 'low', 'thermal', 'inertia', 'a', 'young', 'age', 'or', 'a', 'small', 'and', 'stable', 'axis', 'tilt']] | [-0.0970441736234165, 0.19015986241565513, -0.08409045343231185, 0.057924116887788035, -0.06379923260306626, -0.020665662894287264, 0.055113490255751525, 0.34671092645291346, -0.2523412337044187, -0.3140805364347037, 0.1321740860402786, -0.2509000516893065, -0.0772750420015713, 0.17030256682722625, -0.0865006866849899, -0.005923856388502586, 0.04722074831762991, 0.032939484245218635, -0.05899838430070165, -0.2288089426726792, 0.25183295595354915, 0.08311557500757816, 0.16359606355583683, 0.05468672438221703, 0.09640575011062574, -0.06423345406097454, 0.027679265609542168, 0.004831352878813575, -0.1649932848050233, 0.09218178813282146, 0.21983381530483176, 0.0871127120768053, 0.2149944264043392, -0.4485609728700844, -0.23760061673483396, 0.09171043964286137, 0.11399486118433885, 0.09221593534057758, -0.023718021574886478, -0.21563634790487618, 0.033088969347257934, -0.1539834411029356, -0.20683034746318563, 0.009725059881941023, 0.10631418562574634, -0.023043089615457868, -0.22832279260378766, 0.11152401950477293, 0.11178196405610406, 0.09758747405331417, -0.1763518050955384, -0.17812231818883095, -0.10049037585768056, 0.13810965920067728, 0.06720241125935808, 0.017344556683412636, 0.21393634423980093, -0.09756946512569845, 0.02137162435769915, 0.4084300260830027, -0.07843730233668819, -0.12387504588707862, 0.2368410928184204, -0.2315716311638524, -0.025716867686873937, 0.22133020510388365, 0.20447172601445462, 0.13318638799872892, -0.13387268177196468, 0.034960173361585946, -0.05052040370151281, 0.17955090373242086, 0.10187394314830801, -0.00022481368428253266, 0.3279253053553702, 0.1821928766105384, 0.09503401689938303, 0.12954609376031448, -0.1609485708822283, -0.11433191628505786, -0.21123526424513644, -0.19495654370014867, -0.17868273360579906, 0.023658039706656767, -0.12542818801578773, -0.1953656011374773, 0.31763626999608857, 0.10587579548082139, 0.19673997188832268, 0.025933002842212446, 0.30388664757743117, 0.022411546430056804, 0.10782079478486414, 0.13689097089330146, 0.25940901383450893, 0.11225945744513867, 0.11531261289744717, -0.23648031616170168, 0.13080953973453927, 0.02830400133512944] |
1,802.01294 | Realization of a spin wave switch based on the Spin-Transfer-Torque
effect | We investigate the amplification of externally excited spin waves via the
Spin-Transfer-Torque (STT) effect in combination with the Spin-Hall-Effect
(SHE) employing short current pulses. The results reveal that, in the case of
an overcompensation of the spin wave damping, a strong nonlinear shift of the
spin wave frequency spectrum occurs. In particular, this shift affects the spin
wave amplification using the SHE-STT effect. In contrast, this effect allows
for the realization of a spin wave switch. By determining the corresponding
working point, an efficient spin wave excitation is only possible in the
presence of the SHE-STT effect yielding an increased spin wave intensity of a
factor of 20 compared to the absence of the SHE-STT effect.
| cond-mat.mes-hall | we investigate the amplification of externally excited spin waves via the spintransfertorque stt effect in combination with the spinhalleffect she employing short current pulses the results reveal that in the case of an overcompensation of the spin wave damping a strong nonlinear shift of the spin wave frequency spectrum occurs in particular this shift affects the spin wave amplification using the shestt effect in contrast this effect allows for the realization of a spin wave switch by determining the corresponding working point an efficient spin wave excitation is only possible in the presence of the shestt effect yielding an increased spin wave intensity of a factor of 20 compared to the absence of the shestt effect | [['we', 'investigate', 'the', 'amplification', 'of', 'externally', 'excited', 'spin', 'waves', 'via', 'the', 'spintransfertorque', 'stt', 'effect', 'in', 'combination', 'with', 'the', 'spinhalleffect', 'she', 'employing', 'short', 'current', 'pulses', 'the', 'results', 'reveal', 'that', 'in', 'the', 'case', 'of', 'an', 'overcompensation', 'of', 'the', 'spin', 'wave', 'damping', 'a', 'strong', 'nonlinear', 'shift', 'of', 'the', 'spin', 'wave', 'frequency', 'spectrum', 'occurs', 'in', 'particular', 'this', 'shift', 'affects', 'the', 'spin', 'wave', 'amplification', 'using', 'the', 'shestt', 'effect', 'in', 'contrast', 'this', 'effect', 'allows', 'for', 'the', 'realization', 'of', 'a', 'spin', 'wave', 'switch', 'by', 'determining', 'the', 'corresponding', 'working', 'point', 'an', 'efficient', 'spin', 'wave', 'excitation', 'is', 'only', 'possible', 'in', 'the', 'presence', 'of', 'the', 'shestt', 'effect', 'yielding', 'an', 'increased', 'spin', 'wave', 'intensity', 'of', 'a', 'factor', 'of', '20', 'compared', 'to', 'the', 'absence', 'of', 'the', 'shestt', 'effect']] | [-0.2281914326359301, 0.19132462643116516, -0.005420468795787671, 0.022502718921871213, -0.08633304783544535, -0.03513703972968305, 0.03165412447736438, 0.3424282646256274, -0.26374343200586736, -0.2510513591515864, 0.05339553890747805, -0.2501063426829331, -0.13092633291822056, 0.22947678909283772, 0.07970706040665893, -0.014689178045453697, -0.022632438772547926, 0.02136482399133644, -0.07497833339133148, -0.11015162565904732, 0.30188425338088437, 0.0855764335639582, 0.3154541846196135, 0.05066938232630491, 0.10740195304669183, 0.08176363344256092, 0.04184910041633351, -0.023751031282229412, -0.0819195613583298, 0.03235185469083231, 0.1934706663034439, -0.01618227361227739, 0.2290820298266822, -0.45957282244966463, -0.21658158240888012, 0.04905128760407839, 0.11138187790217263, 0.22527351254468847, -0.07498879879632772, -0.27673660260263894, -0.004489327034238598, -0.19478412956031488, -0.16317506371756438, 3.028110486097987e-05, 0.022636637416796695, 0.00020945203843815573, -0.27493735890963983, 0.10788845228320308, 0.12308334072396723, 0.034263138370267274, -0.03882426409711178, -0.0650531181800661, -0.052772319024621414, 0.07076808991279968, 0.05935899650975098, 0.06615322771289482, 0.13159908520073854, -0.1568643313969068, -0.16023052025662637, 0.32587773869906006, -0.13163145048872985, -0.1767166085011358, 0.10652773715314809, -0.1868317456843717, -0.022965155390356186, 0.17429210687586075, 0.159524266403329, 0.10428389401881602, -0.08321310705324667, 0.025319867076930302, 0.01911746319217792, 0.1867131197050812, 0.10972733066642079, 0.09118282770866463, 0.24036286864429712, 0.18568657171422745, 0.055293007480815566, 0.16559842591633586, -0.1675730013170135, -0.04086001334232198, -0.22980101440833975, -0.13029699534547098, -0.19187085446098756, 0.0927686394728692, -0.04047426118130057, -0.11700737676262085, 0.44435676456637807, 0.1797512191676952, 0.13191604703375748, -0.037742837973226036, 0.2845274072846976, 0.2236667375947381, 0.05084143962775325, 0.02455234703816602, 0.3165978491306305, 0.18381311884350626, 0.08705326490473517, -0.3661516675231818, 0.07500324501748325, -0.04721595856746466] |
1,802.01295 | Hypersurfaces with vanishing hessian via Dual Cayley Trick | We present a general construction of hypersurfaces with vanishing hessian,
starting from any irreducible non-degenerate variety whose dual variety is a
hypersurface and based on the so called Dual Cayley Trick. The geometrical
properties of these hypersurfaces are different from the known series
constructed until now. In particular, their dual varieties can have arbitrary
codimension in the image of the associated polar map.
| math.AG math.AC | we present a general construction of hypersurfaces with vanishing hessian starting from any irreducible nondegenerate variety whose dual variety is a hypersurface and based on the so called dual cayley trick the geometrical properties of these hypersurfaces are different from the known series constructed until now in particular their dual varieties can have arbitrary codimension in the image of the associated polar map | [['we', 'present', 'a', 'general', 'construction', 'of', 'hypersurfaces', 'with', 'vanishing', 'hessian', 'starting', 'from', 'any', 'irreducible', 'nondegenerate', 'variety', 'whose', 'dual', 'variety', 'is', 'a', 'hypersurface', 'and', 'based', 'on', 'the', 'so', 'called', 'dual', 'cayley', 'trick', 'the', 'geometrical', 'properties', 'of', 'these', 'hypersurfaces', 'are', 'different', 'from', 'the', 'known', 'series', 'constructed', 'until', 'now', 'in', 'particular', 'their', 'dual', 'varieties', 'can', 'have', 'arbitrary', 'codimension', 'in', 'the', 'image', 'of', 'the', 'associated', 'polar', 'map']] | [-0.1362308662177788, 0.07281067704279272, -0.10418738377472711, 0.025488280759577358, -0.10538497502132067, -0.13581712609009136, -0.06771509353226672, 0.34316924477498684, -0.2955856069863316, -0.19226748786038822, 0.1572910349572166, -0.22904878582746263, -0.19052792937746124, 0.18592528632235905, -0.12249189862124031, 0.027340591530359927, 0.03137452548576726, 0.10833357785281444, -0.15461460629566795, -0.28024096313923125, 0.4297641696674483, -0.0218620892495863, 0.2597990881370765, 0.04058278863510442, 0.1701348146039342, 0.00922123704194313, -0.006271916057264048, 0.014741095426004557, -0.13914284473728566, 0.15101721812601362, 0.2808010139103447, 0.1267612916121762, 0.16102275565000518, -0.4151289951765821, -0.17905389482390122, 0.2093864929038174, 0.13080138399723976, 0.08983493064131055, -0.038862171917340704, -0.23834195124014976, 0.07393256814352103, -0.12861025824196756, -0.18720088582781572, -0.08888149461043733, -0.024597364012151957, 0.05078448632192458, -0.17656194813372122, -0.0234970704075836, 0.06853246334053222, 0.12762309721345821, -0.0459860578171968, -0.11969345434576213, -0.09346208906924677, 0.07217738083342001, -0.02293575663370864, 0.07497303935122632, 0.06820365754030054, -0.0841943067794163, -0.09721605305279059, 0.3579175686020227, -0.036089721091446425, -0.24619997774679508, 0.18143783049983164, -0.12805931197686327, -0.1528165613241967, 0.16932370353283155, 0.15498528931112515, 0.2068800206133534, -0.09326247525002275, 0.17109490312277414, -0.0810144752382286, 0.005590124720973628, 0.09832756155510507, 0.007468083914968052, 0.2087232216763946, 0.03756634460481268, 0.042443510200384824, 0.17163942444566932, -0.03999731142216155, -0.10155776378122114, -0.36008988480482784, -0.14957452929876228, -0.19591404201965484, 0.14830808221761668, -0.15903927277868785, -0.21050053501560811, 0.40170156423534664, 0.040492146002453946, 0.2214975416482914, 0.07363876492701589, 0.22259212616417143, 0.035621325041921365, 0.06950361671532312, 0.07290434697642922, 0.19028885887255745, 0.16172294448765498, -0.011222208547036327, -0.11560277753261967, 0.016578218493137568, 0.19398900714244635] |
1,802.01296 | The Topological Period-Index Conjecture for spin$^c$ 6-manifolds | The Topological Period-Index Conjecture is an hypothesis which relates the
period and index of elements of the cohomological Brauer group of a space. It
was identified by Antieau and Williams as a topological analogue of the
Period-Index Conjecture for function fields.
In this paper we show that the Topological Period-Index Conjecture holds and
is in general sharp for spin$^c$ 6-manifolds. We also show that it fails in
general for 6-manifolds.
| math.AT | the topological periodindex conjecture is an hypothesis which relates the period and index of elements of the cohomological brauer group of a space it was identified by antieau and williams as a topological analogue of the periodindex conjecture for function fields in this paper we show that the topological periodindex conjecture holds and is in general sharp for spinc 6manifolds we also show that it fails in general for 6manifolds | [['the', 'topological', 'periodindex', 'conjecture', 'is', 'an', 'hypothesis', 'which', 'relates', 'the', 'period', 'and', 'index', 'of', 'elements', 'of', 'the', 'cohomological', 'brauer', 'group', 'of', 'a', 'space', 'it', 'was', 'identified', 'by', 'antieau', 'and', 'williams', 'as', 'a', 'topological', 'analogue', 'of', 'the', 'periodindex', 'conjecture', 'for', 'function', 'fields', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'topological', 'periodindex', 'conjecture', 'holds', 'and', 'is', 'in', 'general', 'sharp', 'for', 'spinc', '6manifolds', 'we', 'also', 'show', 'that', 'it', 'fails', 'in', 'general', 'for', '6manifolds']] | [-0.20120110784856868, 0.12117447307121308, -0.13007946788732494, 0.11981099321939317, -0.07797928840986319, -0.10989780777267047, -0.010974004024839295, 0.2985175771572228, -0.2767450601926872, -0.27090351181104777, 0.06752154290443287, -0.19482868133179312, -0.2500192800802844, 0.22726685963571072, -0.17132707661283866, -0.0007691782766154834, -0.017821062356233597, 0.05065442888132696, -0.07337300421537034, -0.3127701620438269, 0.41524087360927037, -0.0480883943981358, 0.26588383821238365, 0.14137160666952175, 0.0657015466330839, 0.05387297411715346, 0.021482919904519802, 0.010812178433323945, -0.15169255124908107, 0.11799336241175687, 0.2422767125336187, 0.0833377571377371, 0.17195336025740418, -0.33207846895924636, -0.18944097532158985, 0.13469315550423094, 0.08589718783540386, 0.07321449551631563, -0.059522464059825454, -0.26522455774247644, 0.1685244260089738, -0.1466374121739396, -0.20525715458206834, -0.05677386045988117, 0.1006811977563692, -0.06363091564604215, -0.24103459832923754, 0.0529843624377723, 0.13515590637689456, 0.0859967984857836, -0.09721744055194514, -0.04661861140547054, -0.05360894066148571, 0.09038389487458127, 0.02345480295563383, 0.06232831568091309, -0.014719846698322466, -0.10822005191751356, -0.1714674641644316, 0.3522868392190763, -0.08723887834431869, -0.16741116464670217, 0.10804040503821202, -0.14552067891428513, -0.23943779582956007, 0.08437127577407019, 0.049551301023789816, 0.1553337129747628, -0.0011178598473114627, 0.18913798221536646, -0.18345293429281032, 0.09593656343807067, 0.10561067634927375, -0.02159920318018911, 0.15137834282858031, 0.07445602267980575, 0.12461661006028797, 0.1640994832119239, 0.0009194299312574523, -0.005433529395876186, -0.3317836169419544, -0.33415873938107066, -0.168256707828758, 0.11815208679264677, -0.06803535095885828, -0.18327115069010427, 0.40902359798949744, 0.09956905134022236, 0.14736902196226376, 0.11734029489868719, 0.19209901959236178, 0.11480446223535441, 0.03230914463492809, 0.06699616843834519, 0.17864780907652208, 0.24554328614446733, 0.015082466948245252, -0.13096007634220377, 0.001381849670516593, 0.1788312220347247] |
1,802.01297 | On a gauge action on sigma model solitons | In this paper we consider a gauge action on sigma model solitons over
noncommutative tori as source spaces, with a target space made of two points
introduced in \cite{DKL:Sigma}. Using new classes of solitons from Gabor
frames, we quantify the condition about how to gauge a Gaussian to a prescribed
Gabor frame.
| math.OA | in this paper we consider a gauge action on sigma model solitons over noncommutative tori as source spaces with a target space made of two points introduced in citedklsigma using new classes of solitons from gabor frames we quantify the condition about how to gauge a gaussian to a prescribed gabor frame | [['in', 'this', 'paper', 'we', 'consider', 'a', 'gauge', 'action', 'on', 'sigma', 'model', 'solitons', 'over', 'noncommutative', 'tori', 'as', 'source', 'spaces', 'with', 'a', 'target', 'space', 'made', 'of', 'two', 'points', 'introduced', 'in', 'citedklsigma', 'using', 'new', 'classes', 'of', 'solitons', 'from', 'gabor', 'frames', 'we', 'quantify', 'the', 'condition', 'about', 'how', 'to', 'gauge', 'a', 'gaussian', 'to', 'a', 'prescribed', 'gabor', 'frame']] | [-0.12232267602766846, 0.0942993893781129, -0.11159489652959119, 0.1010677258862986, -0.05336908172523858, -0.1197604402972787, 0.012301372987327768, 0.43706004518796415, -0.24410575982548444, -0.19737607412332414, 0.06940603368988663, -0.22917844532240256, -0.15696652672783123, 0.1636793856719034, -0.156928883975043, 0.07197715826880406, 0.03660672377137577, 0.0856020530576215, -0.12731335587872594, -0.2556393904766689, 0.41840009321915167, -0.0005127429030835629, 0.20724213641027317, -0.04103551377706668, 0.16655360032603436, 0.02808054133920985, -0.04979470978472747, -0.01810257727629505, -0.16248691869972676, 0.15099767527049957, 0.23514797584628502, 0.07501479945894257, 0.27191151978046285, -0.36548645063942553, -0.2483681633739787, 0.13931945705895915, 0.11504673588947922, 0.10938943172896318, -0.023405910170564027, -0.3880125913111603, 0.060285783760870494, -0.13361568157287204, -0.09479490836041377, -0.05584389579427593, -0.005135848616048985, 0.0009491869577151887, -0.2633666847193358, -0.017660012459565028, 0.0926805489751346, 0.09542653275032838, -0.10771404044227857, 0.007722603157162666, -0.0032950994722983416, 0.046629889082967065, 0.06544427719314162, 0.08028648837524302, 0.08012396077095878, -0.10499222707642498, -0.12119201733274203, 0.43906014398032545, -0.1437301564888627, -0.33803240830699605, 0.15240398565234214, -0.10331279647481792, -0.12381672935432517, 0.07947031550072864, 0.2324980522195498, 0.11586641509305029, -0.1200511963197998, 0.08436916979468044, -0.12134864499025486, 0.17678370003533714, 0.17455652295885718, 0.06954525876790285, 0.20232765548223375, 0.10154769945816666, 0.07927506555821381, 0.17993560447996737, -0.0727203177041648, -0.07934543636842065, -0.38869887062658864, -0.13381921574838607, -0.15792997539335607, 0.046293559192004154, -0.0781833646709428, -0.1429980551531794, 0.4401323649867931, 0.11722678230965838, 0.23896922392989783, 0.06662085493478705, 0.17239069349278568, 0.023262713786999824, 0.050045072502803566, 0.056940574929410334, 0.14851979224705228, 0.1640535433840591, 0.06031540390241014, -0.08898909990310523, -0.1572685776387944, 0.1736061164981448] |
1,802.01298 | Electron shakeoff following the \b{eta}+ decay of 19Ne+ and 35Ar+
trapped ions | The electron shakeoff of 19F and 35Cl atoms resulting from the \b{eta}+ decay
of 19Ne+ and 35Ar+ ions has been investigated using a Paul trap coupled to a
time of flight recoil-ion spectrometer. The charge-state distributions of the
recoiling daughter nuclei were compared to theoretical calculations based on
the sudden approximation and accounting for subsequent Auger processes. The
excellent agreement obtained for 35Cl is not reproduced in 19F. The shortcoming
is attributed to the inaccuracy of the independent particle model employed to
calculate the primary shakeoff probabilities in systems with rather low atomic
numbers. This calls for more elaborate calculations, including explicitly the
electron-electron correlations.
| nucl-ex | the electron shakeoff of 19f and 35cl atoms resulting from the beta decay of 19ne and 35ar ions has been investigated using a paul trap coupled to a time of flight recoilion spectrometer the chargestate distributions of the recoiling daughter nuclei were compared to theoretical calculations based on the sudden approximation and accounting for subsequent auger processes the excellent agreement obtained for 35cl is not reproduced in 19f the shortcoming is attributed to the inaccuracy of the independent particle model employed to calculate the primary shakeoff probabilities in systems with rather low atomic numbers this calls for more elaborate calculations including explicitly the electronelectron correlations | [['the', 'electron', 'shakeoff', 'of', '19f', 'and', '35cl', 'atoms', 'resulting', 'from', 'the', 'beta', 'decay', 'of', '19ne', 'and', '35ar', 'ions', 'has', 'been', 'investigated', 'using', 'a', 'paul', 'trap', 'coupled', 'to', 'a', 'time', 'of', 'flight', 'recoilion', 'spectrometer', 'the', 'chargestate', 'distributions', 'of', 'the', 'recoiling', 'daughter', 'nuclei', 'were', 'compared', 'to', 'theoretical', 'calculations', 'based', 'on', 'the', 'sudden', 'approximation', 'and', 'accounting', 'for', 'subsequent', 'auger', 'processes', 'the', 'excellent', 'agreement', 'obtained', 'for', '35cl', 'is', 'not', 'reproduced', 'in', '19f', 'the', 'shortcoming', 'is', 'attributed', 'to', 'the', 'inaccuracy', 'of', 'the', 'independent', 'particle', 'model', 'employed', 'to', 'calculate', 'the', 'primary', 'shakeoff', 'probabilities', 'in', 'systems', 'with', 'rather', 'low', 'atomic', 'numbers', 'this', 'calls', 'for', 'more', 'elaborate', 'calculations', 'including', 'explicitly', 'the', 'electronelectron', 'correlations']] | [-0.027293325100271475, 0.19880988162365698, -0.05503916608480116, 0.1131944573406751, 0.07232201842901607, -0.1381271091334167, 0.06345564097476503, 0.363874203241652, -0.16768015351678645, -0.292726964255174, -0.030308512234616846, -0.3272811222644079, 0.006572872936903011, 0.19554362617588292, 0.047493896775302434, 0.08237308398598717, 0.06427130649487177, -0.02769053964653895, -0.07032171673629256, -0.1493427970502082, 0.23456263492948243, 0.17837034252782663, 0.25551655705840814, 0.06863942144749065, 0.07047852666693784, 0.056277779065116884, -0.01785479530780798, -0.026160883934547505, -0.12756862447907527, 0.09852805685229776, 0.2207809763938366, 0.028640929264102374, 0.20110295545753268, -0.47773272199999717, -0.18308187930711678, 0.06386749511362896, 0.17684554940178282, 0.13356902958115652, -0.08778410722859137, -0.2919878922491556, 0.0071619894444232895, -0.1962161346560433, -0.13402402564838883, -0.08076178900276622, 0.01678590920886823, 0.08278123896480316, -0.27982157267009217, 0.09294582017741743, 0.008220819397164243, 0.04813912938712054, -0.11071876851575715, -0.17730638153207975, 0.013089730246879516, 0.08041440355369732, 0.06442220590099515, 0.011540582623066648, 0.1904923414368005, -0.03321701958553777, -0.11275055613867672, 0.39185703219430124, -0.049654039407947236, -0.1115698683208653, 0.1571257918829187, -0.2097443766132485, -0.11287289368698285, 0.20955554392366182, 0.13071313789890457, 0.10807341239193366, -0.1698634237228405, 0.06713683102695671, 0.027130390362193186, 0.17757343044061036, 0.06932812256761411, 0.03536880555101171, 0.1470372342327166, 0.15673063430890796, -0.06374656186394748, 0.09121536419150375, -0.16303568958925704, -0.09262942339160612, -0.2262204337155535, -0.11862450324531112, -0.16664309308287642, 0.034368717473227575, 0.01528935446667241, -0.11356680818966457, 0.36868846811620254, 0.07758435326672736, 0.1930481113537791, -0.04863494519099948, 0.2786529381981208, 0.12762855406229695, 0.03829108566223156, -0.011536821638721795, 0.2835899538493582, 0.20984677349971165, 0.08366139394098095, -0.31238739105784114, 0.12069652032195813, 0.01941296871130665] |
1,802.01299 | Linear relations among asymptotic frequencies in continued fractions | Let $H(m,d)$ denote the asymptotic frequency of the natural numbers $k\equiv
d \mod m$ in the continued fraction expansions of almost all numbers
$x\in[0,1)$. For a fixed number $m\ge 4$, we study $\mathbb Q$-linear relations
among the numbers $H(m,d)$, $1\le d\le m-3$, i.e., vectors
$(c_1,\ldots,c_{m-3})\in\mathbb Q^{m-3}$ such that $$
\sum_{d=1}^{m-3} c_dH(m,d)=0. $$ We restrict ourselves to the symmetric case
$c_d=c_{m-2-d}$. In the end, we obtain a basis of the $\mathbb Q$-vector space
of these relations for prime powers $m$ and for $m=pq$, where $p\ne q$ are
primes.
| math.NT | let hmd denote the asymptotic frequency of the natural numbers kequiv d mod m in the continued fraction expansions of almost all numbers xin01 for a fixed number mge 4 we study mathbb qlinear relations among the numbers hmd 1le dle m3 ie vectors c_1ldotsc_m3inmathbb qm3 such that sum_d1m3 c_dhmd0 we restrict ourselves to the symmetric case c_dc_m2d in the end we obtain a basis of the mathbb qvector space of these relations for prime powers m and for mpq where pne q are primes | [['let', 'hmd', 'denote', 'the', 'asymptotic', 'frequency', 'of', 'the', 'natural', 'numbers', 'kequiv', 'd', 'mod', 'm', 'in', 'the', 'continued', 'fraction', 'expansions', 'of', 'almost', 'all', 'numbers', 'xin01', 'for', 'a', 'fixed', 'number', 'mge', '4', 'we', 'study', 'mathbb', 'qlinear', 'relations', 'among', 'the', 'numbers', 'hmd', '1le', 'dle', 'm3', 'ie', 'vectors', 'c_1ldotsc_m3inmathbb', 'qm3', 'such', 'that', 'sum_d1m3', 'c_dhmd0', 'we', 'restrict', 'ourselves', 'to', 'the', 'symmetric', 'case', 'c_dc_m2d', 'in', 'the', 'end', 'we', 'obtain', 'a', 'basis', 'of', 'the', 'mathbb', 'qvector', 'space', 'of', 'these', 'relations', 'for', 'prime', 'powers', 'm', 'and', 'for', 'mpq', 'where', 'pne', 'q', 'are', 'primes']] | [-0.2827110320678912, 0.15148136212374083, -0.019234383199363946, 0.029776556135038844, -0.03489758094365243, -0.10668061203978141, 0.03696076431078836, 0.30057849912554957, -0.24159538621315732, -0.2322844434529543, 0.06507708576100413, -0.3113778910948895, -0.0916041750810109, 0.19297375487803947, -0.0531621607762645, -0.002416480993269943, -0.02965273194713518, 0.11203559839632363, -0.04642189906153362, -0.29721610583364966, 0.31393083655275406, -0.11785366125404835, 0.14424307270528516, -0.07005548826418817, 0.060782228491734716, 0.034253315342357385, 0.009906400390900672, -0.03822110524088203, -0.20947769397507726, 0.08978436075849458, 0.29707670698990113, 0.11365214560646564, 0.25716138039715586, -0.37201539575471543, -0.08810443374095485, 0.2739661723491736, 0.21274716513289604, -0.0844471883843653, 0.03887256911257282, -0.1868273163359845, 0.16751410133438185, -0.17246574172750115, -0.18450969838304446, -0.0703055372228846, 0.16884318387601524, 0.09141660513414536, -0.3620877130131703, 0.009898679424077272, 0.08747399800922721, 0.11573756041470915, -0.053464010401512496, -0.22551154860993847, -0.017986922786803916, 0.11408594761160203, -0.023419701016973705, 0.037011176769738086, -0.00719396629719995, -0.08997010996681638, -0.044585711424588226, 0.37368091095704586, -0.016721908014733344, -0.22285355678759516, 0.08994609830551781, -0.2756221099116374, -0.16084706906040083, 0.0988650490398868, 0.14377980385033878, 0.1739411990507506, 0.024102003848929597, 0.20052547405866789, -0.10522078340873123, 0.13554986458475468, 0.15827064593322576, 0.02924622250138782, 0.12721484242938458, 0.017506964807398617, 0.023147954174783082, 0.1095192566222977, -0.06332554446416908, 0.032330121047561985, -0.352465878878138, -0.1905057442141697, -0.18357372286409374, 0.1311835950560635, -0.17299231199413043, -0.09661929753492586, 0.27208357203635386, 0.0683415608771611, 0.1911949872970581, 0.15338990064337849, 0.1944088718155399, 0.060479723678145095, 0.012742706440621986, 0.09360736964736134, 0.07271831181715242, 0.1684079066850245, 0.0006921517240698449, -0.1221648875856772, -0.07770465957000852, 0.15730789084336722] |
1,802.013 | Star Edge Coloring of the Cartesian Product of Graphs | A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such
that every path and cycle of length four in $G$ uses at least three different
colors. The star chromatic index of a graph $G$, is the smallest integer $k$
for which $G$ admits a star edge coloring with $k$ colors. In this paper, we
first obtain some upper bounds for the star chromatic index of the Cartesian
product of two graphs. We then determine the exact value of the star chromatic
index of $2$-dimensional grids. We also obtain some upper bounds on the star
chromatic index of the Cartesian product of a path with a cycle,
$d$-dimensional grids, $d$-dimensional hypercubes and $d$-dimensional toroidal
grids, for every positive integer $d$.
| math.CO | a star edge coloring of a graph g is a proper edge coloring of g such that every path and cycle of length four in g uses at least three different colors the star chromatic index of a graph g is the smallest integer k for which g admits a star edge coloring with k colors in this paper we first obtain some upper bounds for the star chromatic index of the cartesian product of two graphs we then determine the exact value of the star chromatic index of 2dimensional grids we also obtain some upper bounds on the star chromatic index of the cartesian product of a path with a cycle ddimensional grids ddimensional hypercubes and ddimensional toroidal grids for every positive integer d | [['a', 'star', 'edge', 'coloring', 'of', 'a', 'graph', 'g', 'is', 'a', 'proper', 'edge', 'coloring', 'of', 'g', 'such', 'that', 'every', 'path', 'and', 'cycle', 'of', 'length', 'four', 'in', 'g', 'uses', 'at', 'least', 'three', 'different', 'colors', 'the', 'star', 'chromatic', 'index', 'of', 'a', 'graph', 'g', 'is', 'the', 'smallest', 'integer', 'k', 'for', 'which', 'g', 'admits', 'a', 'star', 'edge', 'coloring', 'with', 'k', 'colors', 'in', 'this', 'paper', 'we', 'first', 'obtain', 'some', 'upper', 'bounds', 'for', 'the', 'star', 'chromatic', 'index', 'of', 'the', 'cartesian', 'product', 'of', 'two', 'graphs', 'we', 'then', 'determine', 'the', 'exact', 'value', 'of', 'the', 'star', 'chromatic', 'index', 'of', '2dimensional', 'grids', 'we', 'also', 'obtain', 'some', 'upper', 'bounds', 'on', 'the', 'star', 'chromatic', 'index', 'of', 'the', 'cartesian', 'product', 'of', 'a', 'path', 'with', 'a', 'cycle', 'ddimensional', 'grids', 'ddimensional', 'hypercubes', 'and', 'ddimensional', 'toroidal', 'grids', 'for', 'every', 'positive', 'integer', 'd']] | [-0.2272828359901905, 0.1512972819954157, -0.0834947125054896, -0.0086473325220868, -0.13130999130010604, -0.12271731458231806, 0.06461203662399202, 0.39685591879114507, -0.20826512472331524, -0.3368841746598482, 0.11110364572145044, -0.2868765906393528, -0.1223836869597435, 0.10846164791285992, -0.10534213139303028, 0.0014758891500532628, 0.11717232347652316, 0.11913648959994316, 0.026103141395375132, -0.24552103688800708, 0.29767750354111194, -0.08995324857532978, 0.11582046526670456, 0.0716703629642725, 0.06494882989488542, 0.009764031723141671, -0.04246141750738025, 0.1131751144528389, -0.2568939301467617, 0.09021130143012851, 0.21736292576789856, 0.13965420599654316, 0.20818581718206405, -0.3540182984224521, -0.1629789104387164, 0.18611253970116376, 0.07453021045774222, -0.03164319173526019, -0.0016639173375442625, -0.13456329058110714, 0.13211409809812905, -0.1547569489721209, -0.10537268241494895, 0.10380764634907245, 0.18339033422619105, 0.0015750754624605178, -0.3302403277158737, -0.053694143468746916, 0.0989848678857088, 0.0693129982384853, 0.038516357839107514, -0.1910132430419326, -0.07917806774377822, 0.11033226632699371, -0.11170117804780602, 0.08036681819614024, -0.009186485120095313, -0.13565650081448258, -0.19422988214716316, 0.4210671104118228, -0.06926147691905499, -0.12732164013385772, 0.08151108479499816, -0.19313487616181374, -0.19707117012888192, 0.11021598005667328, 0.14048427158594132, 0.20079538506269454, -0.02600392546877265, 0.1051488721286878, -0.1421029958575964, 0.1165488609187305, 0.14753352020680904, 0.04439255065098405, 0.19258042183483484, 0.09266634140722453, 0.23178669456392526, 0.21289918176084757, -0.07320443425886333, 0.05923635461553931, -0.2832663553357124, -0.12501309585850687, -0.2603907110951841, 0.08357726168259978, -0.27744687733403406, -0.22363918454013765, 0.417059431836009, 0.03933254343271256, 0.14353949746489525, 0.1111467012623325, 0.2879996423125267, 0.1404216199591756, 0.010130063293501735, 0.20807886639237405, 0.09338670657062903, 0.2409829166950658, -0.06328314346075058, -0.193319614443928, -0.01302502765879035, 0.2082364243865013] |
1,802.01301 | Comparison of computer systems and ranking criteria for automatic
melanoma detection in dermoscopic images | Melanoma is the deadliest form of skin cancer. Computer systems can assist in
melanoma detection, but are not widespread in clinical practice. In 2016, an
open challenge in classification of dermoscopic images of skin lesions was
announced. A training set of 900 images with corresponding class labels and
semi-automatic/manual segmentation masks was released for the challenge. An
independent test set of 379 images was used to rank the participants. This
article demonstrates the impact of ranking criteria, segmentation method and
classifier, and highlights the clinical perspective. We compare five different
measures for diagnostic accuracy by analysing the resulting ranking of the
computer systems in the challenge. Choice of performance measure had great
impact on the ranking. Systems that were ranked among the top three for one
measure, dropped to the bottom half when changing performance measure. Nevus
Doctor, a computer system previously developed by the authors, was used to
investigate the impact of segmentation and classifier. The unexpected small
impact of automatic versus semi-automatic/manual segmentation suggests that
improvements of the automatic segmentation method w.r.t. resemblance to
semi-automatic/manual segmentation will not improve diagnostic accuracy
substantially. A small set of similar classification algorithms are used to
investigate the impact of classifier on the diagnostic accuracy. The
variability in diagnostic accuracy for different classifier algorithms was
larger than the variability for segmentation methods, and suggests a focus for
future investigations. From a clinical perspective, the misclassification of a
melanoma as benign has far greater cost than the misclassification of a benign
lesion. For computer systems to have clinical impact, their performance should
be ranked by a high-sensitivity measure.
| stat.ML | melanoma is the deadliest form of skin cancer computer systems can assist in melanoma detection but are not widespread in clinical practice in 2016 an open challenge in classification of dermoscopic images of skin lesions was announced a training set of 900 images with corresponding class labels and semiautomaticmanual segmentation masks was released for the challenge an independent test set of 379 images was used to rank the participants this article demonstrates the impact of ranking criteria segmentation method and classifier and highlights the clinical perspective we compare five different measures for diagnostic accuracy by analysing the resulting ranking of the computer systems in the challenge choice of performance measure had great impact on the ranking systems that were ranked among the top three for one measure dropped to the bottom half when changing performance measure nevus doctor a computer system previously developed by the authors was used to investigate the impact of segmentation and classifier the unexpected small impact of automatic versus semiautomaticmanual segmentation suggests that improvements of the automatic segmentation method wrt resemblance to semiautomaticmanual segmentation will not improve diagnostic accuracy substantially a small set of similar classification algorithms are used to investigate the impact of classifier on the diagnostic accuracy the variability in diagnostic accuracy for different classifier algorithms was larger than the variability for segmentation methods and suggests a focus for future investigations from a clinical perspective the misclassification of a melanoma as benign has far greater cost than the misclassification of a benign lesion for computer systems to have clinical impact their performance should be ranked by a highsensitivity measure | [['melanoma', 'is', 'the', 'deadliest', 'form', 'of', 'skin', 'cancer', 'computer', 'systems', 'can', 'assist', 'in', 'melanoma', 'detection', 'but', 'are', 'not', 'widespread', 'in', 'clinical', 'practice', 'in', '2016', 'an', 'open', 'challenge', 'in', 'classification', 'of', 'dermoscopic', 'images', 'of', 'skin', 'lesions', 'was', 'announced', 'a', 'training', 'set', 'of', '900', 'images', 'with', 'corresponding', 'class', 'labels', 'and', 'semiautomaticmanual', 'segmentation', 'masks', 'was', 'released', 'for', 'the', 'challenge', 'an', 'independent', 'test', 'set', 'of', '379', 'images', 'was', 'used', 'to', 'rank', 'the', 'participants', 'this', 'article', 'demonstrates', 'the', 'impact', 'of', 'ranking', 'criteria', 'segmentation', 'method', 'and', 'classifier', 'and', 'highlights', 'the', 'clinical', 'perspective', 'we', 'compare', 'five', 'different', 'measures', 'for', 'diagnostic', 'accuracy', 'by', 'analysing', 'the', 'resulting', 'ranking', 'of', 'the', 'computer', 'systems', 'in', 'the', 'challenge', 'choice', 'of', 'performance', 'measure', 'had', 'great', 'impact', 'on', 'the', 'ranking', 'systems', 'that', 'were', 'ranked', 'among', 'the', 'top', 'three', 'for', 'one', 'measure', 'dropped', 'to', 'the', 'bottom', 'half', 'when', 'changing', 'performance', 'measure', 'nevus', 'doctor', 'a', 'computer', 'system', 'previously', 'developed', 'by', 'the', 'authors', 'was', 'used', 'to', 'investigate', 'the', 'impact', 'of', 'segmentation', 'and', 'classifier', 'the', 'unexpected', 'small', 'impact', 'of', 'automatic', 'versus', 'semiautomaticmanual', 'segmentation', 'suggests', 'that', 'improvements', 'of', 'the', 'automatic', 'segmentation', 'method', 'wrt', 'resemblance', 'to', 'semiautomaticmanual', 'segmentation', 'will', 'not', 'improve', 'diagnostic', 'accuracy', 'substantially', 'a', 'small', 'set', 'of', 'similar', 'classification', 'algorithms', 'are', 'used', 'to', 'investigate', 'the', 'impact', 'of', 'classifier', 'on', 'the', 'diagnostic', 'accuracy', 'the', 'variability', 'in', 'diagnostic', 'accuracy', 'for', 'different', 'classifier', 'algorithms', 'was', 'larger', 'than', 'the', 'variability', 'for', 'segmentation', 'methods', 'and', 'suggests', 'a', 'focus', 'for', 'future', 'investigations', 'from', 'a', 'clinical', 'perspective', 'the', 'misclassification', 'of', 'a', 'melanoma', 'as', 'benign', 'has', 'far', 'greater', 'cost', 'than', 'the', 'misclassification', 'of', 'a', 'benign', 'lesion', 'for', 'computer', 'systems', 'to', 'have', 'clinical', 'impact', 'their', 'performance', 'should', 'be', 'ranked', 'by', 'a', 'highsensitivity', 'measure']] | [-0.012456824424905035, -0.018159154705364996, -0.052082251173110224, 0.09204125413143972, -0.07035809886764806, -0.14830906677920863, 0.06561527887868854, 0.3943980460968923, -0.16505425558337625, -0.36091471186329455, 0.10560141348429376, -0.3133397211426131, -0.1349593488604955, 0.24434554821016477, -0.1673405827321815, 0.09337025246020618, 0.14028349290250466, 0.059846950616283374, -0.035656331181921554, -0.3348139861317457, 0.268759412489357, 0.06542176385937294, 0.3579049694615434, 0.06149600583813944, 0.05946454366423049, -0.05287190636461776, -0.07873684064537849, 0.015274683227938301, -0.06936540491192575, 0.13833285620676866, 0.31016402463340814, 0.20659979830936964, 0.3589729371252206, -0.32971092333779933, -0.2031318681630886, 0.11377987438496553, 0.1295805077938328, 0.07190945230222325, -0.030014421111236343, -0.34015308408031486, 0.10691989330324467, -0.16361495496898468, -0.034212827953105825, -0.07456073884079058, 0.03620554889214032, -0.022840328837903042, -0.25435202528880735, 0.07113911479641244, 0.020454032352097543, 0.14929450141301132, -0.08648380197777922, -0.14302470491856406, 0.018864514142766877, 0.21191494885166526, 0.02988064301657086, 0.08681721225576387, 0.17466753531985407, -0.2029511011530698, -0.1379374954181741, 0.3700300367057042, -0.006234277137840729, -0.17986625447904445, 0.2187934045381141, -0.10243127729286844, -0.14415209604040632, 0.13165058000188953, 0.23592373999406777, 0.09478891426444774, -0.17094706049444866, -0.056264712896312255, 0.015210611831159595, 0.18219655698543097, 0.08640261182456084, -0.05930500636492276, 0.18666047798908966, 0.2662016750910794, -0.017068158488782157, 0.1580830334575917, -0.1738065668698049, 0.020872526614100866, -0.19508094648777877, -0.1534913636849455, -0.14624035740974095, -0.03161565275799114, -0.07246831798599813, -0.16538197298024623, 0.40340545586802345, 0.21053827262026661, 0.15259332914028387, 0.02756436710632494, 0.2962556524518526, 0.01344535123959913, 0.10514455511846156, 0.0023262992395826107, 0.2578125344923223, 0.030506382313258244, 0.08995514680754464, -0.18362164331143194, 0.14771672718859505, 0.061973105996126696] |
1,802.01302 | Average Case tractability of multivariate approximation with Gaussian
kernels | We study the problem of approximating functions of $d$ variables in the
average case setting for the $L_2$ space $L_{2,d}$ with the standard Gaussian
weight equipped with a zero-mean Gaussian measure. The covariance kernel of
this Gaussian measure takes the form of a Gaussian kernel with non-increasing
positive shape parameters $\gamma_j^2$ for $j = 1, 2, \dots, d$. The error of
approximation is defined in the norm of $L_{2,d}$. We study the average case
error of algorithms that use at most $n$ arbitrary continuous linear
functionals. The information complexity $n(\varepsilon, d)$ is defined as the
minimal number of linear functionals which are needed to find an algorithm
whose average case error is at most $\varepsilon$. We study different notions
of tractability or exponentially-convergent tractability (EC-tractability)
which the information complexity $n(\varepsilon, d)$ describe how behaves as a
function of $d$ and $\varepsilon^{-1}$ or as one of $d$ and
$(1+\ln\varepsilon^{-1})$.
We find necessary and sufficient conditions on various notions of
tractability and EC-tractability in terms of shape parameters. In particular,
for any positive $s>0$ and $t\in(0,1)$ we obtain that the sufficient and
necessary condition on $\gamma^2_ j$ for which
$$\lim_{d+\varepsilon^{-1}\to\infty}\frac{n(\varepsilon,d)}{\varepsilon^{-s}+d^t}=0$$
holds is $$ \lim_{j\to \infty}j^{1-t}\gamma_j^2\,\ln^+ \gamma_j^{-2}=0,$$where
$\ln^+ x=\max(1,\ln x)$.
| math.NA | we study the problem of approximating functions of d variables in the average case setting for the l_2 space l_2d with the standard gaussian weight equipped with a zeromean gaussian measure the covariance kernel of this gaussian measure takes the form of a gaussian kernel with nonincreasing positive shape parameters gamma_j2 for j 1 2 dots d the error of approximation is defined in the norm of l_2d we study the average case error of algorithms that use at most n arbitrary continuous linear functionals the information complexity nvarepsilon d is defined as the minimal number of linear functionals which are needed to find an algorithm whose average case error is at most varepsilon we study different notions of tractability or exponentiallyconvergent tractability ectractability which the information complexity nvarepsilon d describe how behaves as a function of d and varepsilon1 or as one of d and 1lnvarepsilon1 we find necessary and sufficient conditions on various notions of tractability and ectractability in terms of shape parameters in particular for any positive s0 and tin01 we obtain that the sufficient and necessary condition on gamma2_ j for which lim_dvarepsilon1toinftyfracnvarepsilondvarepsilonsdt0 holds is lim_jto inftyj1tgamma_j2ln gamma_j20where ln xmax1ln x | [['we', 'study', 'the', 'problem', 'of', 'approximating', 'functions', 'of', 'd', 'variables', 'in', 'the', 'average', 'case', 'setting', 'for', 'the', 'l_2', 'space', 'l_2d', 'with', 'the', 'standard', 'gaussian', 'weight', 'equipped', 'with', 'a', 'zeromean', 'gaussian', 'measure', 'the', 'covariance', 'kernel', 'of', 'this', 'gaussian', 'measure', 'takes', 'the', 'form', 'of', 'a', 'gaussian', 'kernel', 'with', 'nonincreasing', 'positive', 'shape', 'parameters', 'gamma_j2', 'for', 'j', '1', '2', 'dots', 'd', 'the', 'error', 'of', 'approximation', 'is', 'defined', 'in', 'the', 'norm', 'of', 'l_2d', 'we', 'study', 'the', 'average', 'case', 'error', 'of', 'algorithms', 'that', 'use', 'at', 'most', 'n', 'arbitrary', 'continuous', 'linear', 'functionals', 'the', 'information', 'complexity', 'nvarepsilon', 'd', 'is', 'defined', 'as', 'the', 'minimal', 'number', 'of', 'linear', 'functionals', 'which', 'are', 'needed', 'to', 'find', 'an', 'algorithm', 'whose', 'average', 'case', 'error', 'is', 'at', 'most', 'varepsilon', 'we', 'study', 'different', 'notions', 'of', 'tractability', 'or', 'exponentiallyconvergent', 'tractability', 'ectractability', 'which', 'the', 'information', 'complexity', 'nvarepsilon', 'd', 'describe', 'how', 'behaves', 'as', 'a', 'function', 'of', 'd', 'and', 'varepsilon1', 'or', 'as', 'one', 'of', 'd', 'and', '1lnvarepsilon1', 'we', 'find', 'necessary', 'and', 'sufficient', 'conditions', 'on', 'various', 'notions', 'of', 'tractability', 'and', 'ectractability', 'in', 'terms', 'of', 'shape', 'parameters', 'in', 'particular', 'for', 'any', 'positive', 's0', 'and', 'tin01', 'we', 'obtain', 'that', 'the', 'sufficient', 'and', 'necessary', 'condition', 'on', 'gamma2_', 'j', 'for', 'which', 'lim_dvarepsilon1toinftyfracnvarepsilondvarepsilonsdt0', 'holds', 'is', 'lim_jto', 'inftyj1tgamma_j2ln', 'gamma_j20where', 'ln', 'xmax1ln', 'x']] | [-0.12918490335043217, 0.0685276332016361, -0.0419679881742136, 0.07052790503508437, -0.003728812451889688, -0.17045191848851943, 0.026601937854335317, 0.3578735086689326, -0.2640761663142994, -0.2617809675281515, 0.09825218505150562, -0.25643180998898035, -0.133631938264227, 0.15706057497426062, -0.060688041913247594, 0.08829705593478236, 0.002353336212753847, 0.09117760338593979, -0.10639276504013184, -0.28094821907202333, 0.3140628911856864, 0.0025275902872955477, 0.1938221529368437, 0.025388011411839242, 0.11564708859282168, 0.03637513980470799, -0.008775469504699514, -0.0025721415148959874, -0.19991204868160453, 0.08920334092108533, 0.21636527916668236, 0.14884402863681317, 0.31886153931956035, -0.3603974559168155, -0.16117271002684092, 0.19338179491963742, 0.10722839563355051, 0.010758467287303427, 0.05298120946673727, -0.21350419108403496, 0.10812526817206998, -0.09539681931305126, -0.1222851060934969, -0.061788294580135794, 0.06816152850971431, 0.04635267767023195, -0.3715225981800137, 0.08921988388976536, 0.11723276227460923, 0.04833915018904451, -0.04502947197572605, -0.1700020236542096, 0.008451055797647584, 0.09278350100928062, 0.00611764816315593, 0.07718486715032644, 0.0690492541264944, -0.10740546652971691, -0.08296448950831954, 0.34257462387652815, -0.08816473236357844, -0.2705345453014849, 0.1370586929792488, -0.16035098398255335, -0.1208910608638984, 0.0878467188594309, 0.1786222744103823, 0.13125882767191208, -0.0844288050722507, 0.16617952610454145, -0.05271990672760719, 0.14502411574074947, 0.07930154442107556, 0.08384448491741676, 0.05613539889454842, 0.11121329797456997, 0.13307937972902043, 0.14593096377479065, -0.06720329738800992, -0.05652116967012753, -0.35659970983460143, -0.1674593617120204, -0.22505985928976255, 0.06210422434315488, -0.15603651008773217, -0.17756894654216798, 0.3379479742546037, 0.07302700485027319, 0.2225113878832073, 0.13528275578093993, 0.2459653113748425, 0.12773684445466543, -0.0062004732207168595, 0.11884843715894464, 0.12315948554755163, 0.15072882352774408, 0.012233411651608106, -0.18580294008794668, 0.09000669713462452, 0.06458163651562221] |
1,802.01303 | Global existence and Asymptotic behavior for a system of wave equation
in presence of distributed delay term | In this paper, we consider the following viscoelastic coupled wave equation
with a delay term: $$ \begin{gathered} u_{tt}(x,t)-Lu(x,t)-\int_0^t
g_1(t-\sigma)L u(x,\sigma)d\sigma + \mu_{1}u_{t}(x,t) + \int_{\tau_1}^{\tau_2}
\mu_2(s)u_{t}(x,t-s)ds + f_1(u,\upsilon)=0, \\ \upsilon_{tt}(x,t) -
L\upsilon(x,t) - \int_0^t g_{2}(t-\sigma)L \upsilon(x,\sigma)d\sigma +
\mu_3\upsilon_t(x,t) + \int_{\tau_1}^{\tau_2} \mu_4(s)\upsilon_{t}(x,t-s)ds +
f_{2}(u,\upsilon)=0, \end{gathered} $$ in a bounded domain. Under appropriate
conditions on $\mu_{1}$, $\mu_{2}$, $\mu_{3}$ and $\mu_{4}$, we prove global
existence result by combining the energy method with the Faedo-Galerkin's
procedure. In addition , we focus on asymptotic behavior by using an
appropriate Lyapunov functional.
| math.AP | in this paper we consider the following viscoelastic coupled wave equation with a delay term begingathered u_ttxtluxtint_0t g_1tsigmal uxsigmadsigma mu_1u_txt int_tau_1tau_2 mu_2su_txtsds f_1uupsilon0 upsilon_ttxt lupsilonxt int_0t g_2tsigmal upsilonxsigmadsigma mu_3upsilon_txt int_tau_1tau_2 mu_4supsilon_txtsds f_2uupsilon0 endgathered in a bounded domain under appropriate conditions on mu_1 mu_2 mu_3 and mu_4 we prove global existence result by combining the energy method with the faedogalerkins procedure in addition we focus on asymptotic behavior by using an appropriate lyapunov functional | [['in', 'this', 'paper', 'we', 'consider', 'the', 'following', 'viscoelastic', 'coupled', 'wave', 'equation', 'with', 'a', 'delay', 'term', 'begingathered', 'u_ttxtluxtint_0t', 'g_1tsigmal', 'uxsigmadsigma', 'mu_1u_txt', 'int_tau_1tau_2', 'mu_2su_txtsds', 'f_1uupsilon0', 'upsilon_ttxt', 'lupsilonxt', 'int_0t', 'g_2tsigmal', 'upsilonxsigmadsigma', 'mu_3upsilon_txt', 'int_tau_1tau_2', 'mu_4supsilon_txtsds', 'f_2uupsilon0', 'endgathered', 'in', 'a', 'bounded', 'domain', 'under', 'appropriate', 'conditions', 'on', 'mu_1', 'mu_2', 'mu_3', 'and', 'mu_4', 'we', 'prove', 'global', 'existence', 'result', 'by', 'combining', 'the', 'energy', 'method', 'with', 'the', 'faedogalerkins', 'procedure', 'in', 'addition', 'we', 'focus', 'on', 'asymptotic', 'behavior', 'by', 'using', 'an', 'appropriate', 'lyapunov', 'functional']] | [-0.19338352909605755, 0.08315723719664547, -0.08653433504514396, 0.02190717491688893, -0.03201016098702032, -0.12888439666283757, 0.01809154833430065, 0.3405063665929463, -0.2579378817034395, -0.17330342433170268, 0.13398956584441885, -0.27391366062587813, -0.1941537193386211, 0.15751308395952118, -0.08076994960081943, 0.10287555687848413, 0.03847306838520525, 0.05447840397506585, -0.034917857481591534, -0.1699066480515492, 0.3954723162756285, -0.06037931438339384, 0.2219692773855569, 0.036837956593412775, 0.13631675827006498, 0.037916292873488966, 0.0341010614494352, -0.014549594629850043, -0.2809997554602951, 0.05446412133281691, 0.17462623097705082, 0.04675785219705288, 0.3223264079802392, -0.4278815516777206, -0.1796635480662971, 0.1214569464015464, 0.10544353494780105, -0.011007267654987803, -0.029735106723628155, -0.3129174737749915, 0.10781355787542436, -0.1547621216690331, -0.18374264660177, -0.04796819664178449, -0.01954272987419053, 0.08841205940157044, -0.3531370033232266, 0.1448151762515568, 0.05138911661414201, 0.03788900795278319, -0.13585976571694278, -0.10262733063121375, 0.026063770398889716, 0.011429053527025277, 0.08384245971274938, 0.05506696632099256, 0.02658845042286996, -0.06070754365390984, -0.026381419211822122, 0.29363061589793416, -0.14786202757080136, -0.2911014221608639, 0.08479834243393782, -0.10128830329171921, -0.16761177420420081, 0.04643527428178411, 0.1396769311303567, 0.1595723098307325, -0.18101974230325013, 0.18453736259222128, -0.019689327759184187, 0.14161364634504967, 0.11987690802402141, -0.002043451117188261, 0.05544520077181228, 0.15964377595503865, 0.11735281257547046, 0.14821351509492256, -0.01920421575216511, -0.04989835722862106, -0.34047015285805654, -0.11879639588949974, -0.15506136348765148, 0.12524024009977247, -0.10065530001143966, -0.1131781485715979, 0.36380283204479175, 0.11041886057181839, 0.17536846652071467, 0.11868976206077557, 0.22043388996992194, 0.1910029269035971, -0.0720200421198745, 0.08945301196358182, 0.1511538540535982, 0.10728180677254211, 0.1281295847311093, -0.26564231580286696, 0.03341917091523085, 0.15681040116351938] |
1,802.01304 | Integrability of the geodesic flow on the resolved conifolds over
Sasaki-Einstein space $T^{1,1}$ | Methods of Hamiltonian dynamics are applied to study the geodesic flow on the
resolved conifolds over Sasaki-Einstein space $T^{1,1}$. We construct
explicitly the constants of motion and prove complete integrability of
geodesics in the five-dimensional Sasaki-Einstein space $T^{1,1}$ and its
Calabi-Yau metric cone. The singularity at the apex of the metric cone can be
smoothed out in two different ways. Using the small resolution the geodesic
motion on the resolved conifold remains completely integrable. Instead, in the
case of the deformation of the conifold the complete integrability is lost.
| hep-th | methods of hamiltonian dynamics are applied to study the geodesic flow on the resolved conifolds over sasakieinstein space t11 we construct explicitly the constants of motion and prove complete integrability of geodesics in the fivedimensional sasakieinstein space t11 and its calabiyau metric cone the singularity at the apex of the metric cone can be smoothed out in two different ways using the small resolution the geodesic motion on the resolved conifold remains completely integrable instead in the case of the deformation of the conifold the complete integrability is lost | [['methods', 'of', 'hamiltonian', 'dynamics', 'are', 'applied', 'to', 'study', 'the', 'geodesic', 'flow', 'on', 'the', 'resolved', 'conifolds', 'over', 'sasakieinstein', 'space', 't11', 'we', 'construct', 'explicitly', 'the', 'constants', 'of', 'motion', 'and', 'prove', 'complete', 'integrability', 'of', 'geodesics', 'in', 'the', 'fivedimensional', 'sasakieinstein', 'space', 't11', 'and', 'its', 'calabiyau', 'metric', 'cone', 'the', 'singularity', 'at', 'the', 'apex', 'of', 'the', 'metric', 'cone', 'can', 'be', 'smoothed', 'out', 'in', 'two', 'different', 'ways', 'using', 'the', 'small', 'resolution', 'the', 'geodesic', 'motion', 'on', 'the', 'resolved', 'conifold', 'remains', 'completely', 'integrable', 'instead', 'in', 'the', 'case', 'of', 'the', 'deformation', 'of', 'the', 'conifold', 'the', 'complete', 'integrability', 'is', 'lost']] | [-0.187562448684168, 0.04110431190308058, -0.10589511711882908, 0.1094111797119899, -0.08662728797853662, -0.10222885354285997, -0.05331081755229094, 0.3686909623276652, -0.27756928445331835, -0.18739790172221954, 0.13392197236737885, -0.26039509305709535, -0.13887712196708563, 0.12954747787378518, -0.11538208087676027, 0.03303319269077057, 0.0750318872114497, 0.035529204236155146, -0.15406978074879793, -0.3032557275721782, 0.4284167714584409, 0.008952094641663893, 0.23459791387117396, 0.04547870275041277, 0.16446720176700796, -0.0094140363854534, -0.006604748118794366, 0.041442057331683886, -0.1938108767885087, 0.079113799046589, 0.2181788080115541, 0.07738968411596554, 0.10758402582592844, -0.4221073592688595, -0.19855347869059678, 0.0889927112874104, 0.16570074862298254, 0.09802907667635533, 0.06589702394361911, -0.31018956851350205, 0.03530704603122359, -0.055561186369048075, -0.21977296674603156, -0.10332404345985544, -0.012596492184681838, -0.056144392978546495, -0.11038636700825745, 0.06403639378402842, 0.04052319913432839, 0.057201850238475904, -0.09847009880599053, -0.012964100001400776, -0.11014077072084118, 0.08798448958046985, 0.07401718951374543, 0.07462334470938514, 0.10013378351361732, -0.09075607199305563, -0.09072698661181133, 0.36238678555224046, -0.05420784791539099, -0.29800255383166036, 0.09430683491322515, -0.19480034475622887, -0.12443631390904945, 0.16659133373812007, 0.10645549762156907, 0.26574216638639403, -0.09762546106168393, 0.1971255532044687, -0.005475136147958509, 0.06246791854029877, 0.13910861674884564, 0.0022933335472526176, 0.2219307150461533, 0.13318318932243947, 0.09823593695574764, 0.12468931801863056, -0.1121017811819911, -0.13982283081231492, -0.3999327639892195, -0.1417297955937265, -0.14948553935195621, 0.18948488211615033, -0.19060586670150698, -0.16469405299533954, 0.38691437170249565, 0.012729233439509453, 0.21325790434238617, 0.0434743961832078, 0.2263597519545073, 0.019223242872551585, 0.040729402554001704, 0.0674319518049865, 0.257386987714955, 0.12557494578087766, 0.07166538250323887, -0.2493857642494435, -0.10329696258760235, 0.18921689432784078] |
1,802.01305 | Micromagnetic view on ultrafast magnon generation by femtosecond spin
current pulses | In this Article we discuss a micromagnetic modelling approach to describe the
ultrafast spin-transfer torque excitation of coherent and incoherent magnons on
the nanoscale. Implementing the action of a femtosecond spin current pulse
entering an orthogonally magnetized thin ferromagnetic film, we reproduce
recent experimental results and reveal the factors responsible for the unequal
excitation efficiency of various spin waves. Our findings are in an excellent
agreement with the results of an analytical description of spin-wave excitation
based on classical kinetic equations. Furthermore, we suggest an experimental
design allowing for the excitation of laterally propagating spin waves beyond
the optical diffraction limit. Our findings demonstrate that the classical
micromagnetic picture retains its predictive and interpretative power on
femtosecond temporal and nanometer spatial scales.
| cond-mat.mes-hall | in this article we discuss a micromagnetic modelling approach to describe the ultrafast spintransfer torque excitation of coherent and incoherent magnons on the nanoscale implementing the action of a femtosecond spin current pulse entering an orthogonally magnetized thin ferromagnetic film we reproduce recent experimental results and reveal the factors responsible for the unequal excitation efficiency of various spin waves our findings are in an excellent agreement with the results of an analytical description of spinwave excitation based on classical kinetic equations furthermore we suggest an experimental design allowing for the excitation of laterally propagating spin waves beyond the optical diffraction limit our findings demonstrate that the classical micromagnetic picture retains its predictive and interpretative power on femtosecond temporal and nanometer spatial scales | [['in', 'this', 'article', 'we', 'discuss', 'a', 'micromagnetic', 'modelling', 'approach', 'to', 'describe', 'the', 'ultrafast', 'spintransfer', 'torque', 'excitation', 'of', 'coherent', 'and', 'incoherent', 'magnons', 'on', 'the', 'nanoscale', 'implementing', 'the', 'action', 'of', 'a', 'femtosecond', 'spin', 'current', 'pulse', 'entering', 'an', 'orthogonally', 'magnetized', 'thin', 'ferromagnetic', 'film', 'we', 'reproduce', 'recent', 'experimental', 'results', 'and', 'reveal', 'the', 'factors', 'responsible', 'for', 'the', 'unequal', 'excitation', 'efficiency', 'of', 'various', 'spin', 'waves', 'our', 'findings', 'are', 'in', 'an', 'excellent', 'agreement', 'with', 'the', 'results', 'of', 'an', 'analytical', 'description', 'of', 'spinwave', 'excitation', 'based', 'on', 'classical', 'kinetic', 'equations', 'furthermore', 'we', 'suggest', 'an', 'experimental', 'design', 'allowing', 'for', 'the', 'excitation', 'of', 'laterally', 'propagating', 'spin', 'waves', 'beyond', 'the', 'optical', 'diffraction', 'limit', 'our', 'findings', 'demonstrate', 'that', 'the', 'classical', 'micromagnetic', 'picture', 'retains', 'its', 'predictive', 'and', 'interpretative', 'power', 'on', 'femtosecond', 'temporal', 'and', 'nanometer', 'spatial', 'scales']] | [-0.15267422129629088, 0.16296786667261898, -0.08471663831542323, 0.010242791517187277, -0.07088337809259652, -0.07467507777094352, 0.003944253961204506, 0.4542796848586104, -0.24067856361097123, -0.25667207199530523, 0.009504092407444317, -0.2719938159237051, -0.09679027763225155, 0.29249322839600383, 0.05052907183980111, 0.04300591203987171, 0.021002443556933374, -0.07262346931145389, -0.031503182345405834, -0.1186308878996733, 0.25851052778879885, 0.0655980468615527, 0.345332965844494, 0.10331212436364291, 0.11955761639248641, 0.025790989036351197, 0.019792567793524167, -0.04932565664964133, -0.16840982070550767, 0.12130042647400902, 0.24027261380716913, -0.0472521834565922, 0.18985444059992423, -0.5510245018073769, -0.24755193599925346, -0.07236501047349311, 0.17371495677655388, 0.1921144281361313, -0.08077650875918048, -0.2721884512632597, 0.02033507953479993, -0.17193125037201604, -0.15120685650951793, -0.1244616670014917, -0.031906563567272464, 0.048548987533202484, -0.2510526157313477, 0.0630164287037781, 0.11992624415023649, 0.0746129408066512, -0.11557802375211365, -0.06938539550364872, -0.044386503616344095, 0.051015545285810704, 0.03379963964870825, 0.018313179208637505, 0.1653269652437541, -0.13616265707313405, -0.18245182099339904, 0.3193811074235156, -0.06356343722398408, -0.12001810000720815, 0.16087392572366985, -0.19128624586480075, -0.042425669767878586, 0.126331889234697, 0.11849691685514341, 0.12082140526703758, -0.11318552254348016, 0.01861832128097227, -0.02726456439733261, 0.22796566256123488, 0.0642246787749292, 0.09501128142539052, 0.25560634203071964, 0.26143273182946153, -0.02186844929991687, 0.12590910107676, -0.11469332632784289, -0.09628991260323062, -0.2752726173455842, -0.09908814415465429, -0.17946112287788057, 0.057065988700936134, -0.11651757607555216, -0.12418629455028987, 0.4425131352160309, 0.22282742659588053, 0.11875118253767857, 0.025026862942766338, 0.33248664160091124, 0.12866542044240736, -0.0023392711758430376, 0.031248101766114353, 0.27096999609903966, 0.19229772073201468, 0.1021812568652705, -0.3440704548303954, 0.0012862910220750653, -0.05157386624353526] |
1,802.01306 | Hybrid systems for the generation of non-classical mechanical states via
quadratic interactions | We present a method to implement two-phonon interactions between mechanical
resonators and spin qubits in hybrid setups, and show that these systems can be
applied for the generation of nonclassical mechanical states even in the
presence of dissipation. In particular, we demonstrate that the implementation
of a two-phonon Jaynes-Cummings Hamiltonian under coherent driving of the qubit
yields a dissipative phase transition with similarities to the one predicted in
the model of the degenerate parametric oscillator: beyond a certain threshold
in the driving amplitude, the driven-dissipative system sustains a mixed steady
state consisting of a `jumping cat', i.e., a cat state undergoing random jumps
between two phases. We consider realistic setups and show that, in samples
within reach of current technology, the system features non-classical transient
states, characterized by a negative Wigner function, that persist during
timescales of fractions of a second.
| quant-ph | we present a method to implement twophonon interactions between mechanical resonators and spin qubits in hybrid setups and show that these systems can be applied for the generation of nonclassical mechanical states even in the presence of dissipation in particular we demonstrate that the implementation of a twophonon jaynescummings hamiltonian under coherent driving of the qubit yields a dissipative phase transition with similarities to the one predicted in the model of the degenerate parametric oscillator beyond a certain threshold in the driving amplitude the drivendissipative system sustains a mixed steady state consisting of a jumping cat ie a cat state undergoing random jumps between two phases we consider realistic setups and show that in samples within reach of current technology the system features nonclassical transient states characterized by a negative wigner function that persist during timescales of fractions of a second | [['we', 'present', 'a', 'method', 'to', 'implement', 'twophonon', 'interactions', 'between', 'mechanical', 'resonators', 'and', 'spin', 'qubits', 'in', 'hybrid', 'setups', 'and', 'show', 'that', 'these', 'systems', 'can', 'be', 'applied', 'for', 'the', 'generation', 'of', 'nonclassical', 'mechanical', 'states', 'even', 'in', 'the', 'presence', 'of', 'dissipation', 'in', 'particular', 'we', 'demonstrate', 'that', 'the', 'implementation', 'of', 'a', 'twophonon', 'jaynescummings', 'hamiltonian', 'under', 'coherent', 'driving', 'of', 'the', 'qubit', 'yields', 'a', 'dissipative', 'phase', 'transition', 'with', 'similarities', 'to', 'the', 'one', 'predicted', 'in', 'the', 'model', 'of', 'the', 'degenerate', 'parametric', 'oscillator', 'beyond', 'a', 'certain', 'threshold', 'in', 'the', 'driving', 'amplitude', 'the', 'drivendissipative', 'system', 'sustains', 'a', 'mixed', 'steady', 'state', 'consisting', 'of', 'a', 'jumping', 'cat', 'ie', 'a', 'cat', 'state', 'undergoing', 'random', 'jumps', 'between', 'two', 'phases', 'we', 'consider', 'realistic', 'setups', 'and', 'show', 'that', 'in', 'samples', 'within', 'reach', 'of', 'current', 'technology', 'the', 'system', 'features', 'nonclassical', 'transient', 'states', 'characterized', 'by', 'a', 'negative', 'wigner', 'function', 'that', 'persist', 'during', 'timescales', 'of', 'fractions', 'of', 'a', 'second']] | [-0.1825488387072023, 0.22236886716791238, -0.06214319575282395, 0.028056467975141375, 0.05411910217219026, -0.18024886473815174, 0.06919658169850496, 0.3650148056962706, -0.2449143159183416, -0.2399959382188262, 0.02961003854177258, -0.23029946040441382, -0.14619294366409594, 0.22855813248935056, 0.0024348767895370407, 0.0529097476594335, 0.0919227135922522, 0.005161182591625562, -0.05982690813937984, -0.1688299502364974, 0.309265875828895, -0.04863118795605363, 0.2928316788615804, -0.024811329771285705, 0.12716366472267646, -0.027368227751888023, 0.1102719835719054, -0.014484002657815919, -0.07460538108200694, 0.06456743005303177, 0.2188282251516555, 0.044798133188052806, 0.28487759448772837, -0.44265703922996286, -0.22415870925451212, 0.10266943534023742, 0.10433466825324626, 0.19161044222348972, -0.02354228330432629, -0.3059887752821999, -0.0019189040820570067, -0.2010212740200367, -0.1419496852409174, -0.10243220600557137, 0.017840811117479566, 0.0221455730373991, -0.26341665712522067, 0.11620447809431464, 0.08438936659590678, 0.018818046228880895, -0.057314299575403224, -0.027133774879249804, -0.032595797938935404, 0.08979786130276027, -0.06623315454604342, -0.04177629286489377, 0.14450916071159844, -0.1828660407163044, -0.16276757375185266, 0.36349565208788814, -0.10963010363749737, -0.16106118363533037, 0.19381298656832982, -0.16636627985497668, -0.09440347125608448, 0.11957548572582767, 0.1593721348078961, 0.07206028892084006, -0.11205801944717342, 0.005106899235480141, 0.00792591624516756, 0.20533510110611822, 0.046074946977343434, 0.09192426555545617, 0.2130307371510153, 0.18841400265805952, 0.04015066912595896, 0.21489598739360533, -0.07387743131356671, -0.15334451958167214, -0.30856225126611186, -0.13655675106338416, -0.19125974862605122, 0.08060176032578824, -0.02004138999158295, -0.1651323148419301, 0.4436339701638154, 0.1511936678108594, 0.1794216688722372, -0.008578317426475333, 0.2588497001821413, 0.13625362611884342, 0.03136475089646823, 0.030685249518715374, 0.28743331669994915, 0.15205314196315958, 0.07349636893164604, -0.2946349169734076, 0.031404511894905236, -0.010397804078046588] |
1,802.01307 | Asian Option Pricing with Orthogonal Polynomials | In this paper we derive a series expansion for the price of a continuously
sampled arithmetic Asian option in the Black-Scholes setting. The expansion is
based on polynomials that are orthogonal with respect to the log-normal
distribution. All terms in the series are fully explicit and no numerical
integration nor any special functions are involved. We provide sufficient
conditions to guarantee convergence of the series. The moment indeterminacy of
the log-normal distribution introduces an asymptotic bias in the series,
however we show numerically that the bias can safely be ignored in practice.
| q-fin.PR q-fin.CP q-fin.MF | in this paper we derive a series expansion for the price of a continuously sampled arithmetic asian option in the blackscholes setting the expansion is based on polynomials that are orthogonal with respect to the lognormal distribution all terms in the series are fully explicit and no numerical integration nor any special functions are involved we provide sufficient conditions to guarantee convergence of the series the moment indeterminacy of the lognormal distribution introduces an asymptotic bias in the series however we show numerically that the bias can safely be ignored in practice | [['in', 'this', 'paper', 'we', 'derive', 'a', 'series', 'expansion', 'for', 'the', 'price', 'of', 'a', 'continuously', 'sampled', 'arithmetic', 'asian', 'option', 'in', 'the', 'blackscholes', 'setting', 'the', 'expansion', 'is', 'based', 'on', 'polynomials', 'that', 'are', 'orthogonal', 'with', 'respect', 'to', 'the', 'lognormal', 'distribution', 'all', 'terms', 'in', 'the', 'series', 'are', 'fully', 'explicit', 'and', 'no', 'numerical', 'integration', 'nor', 'any', 'special', 'functions', 'are', 'involved', 'we', 'provide', 'sufficient', 'conditions', 'to', 'guarantee', 'convergence', 'of', 'the', 'series', 'the', 'moment', 'indeterminacy', 'of', 'the', 'lognormal', 'distribution', 'introduces', 'an', 'asymptotic', 'bias', 'in', 'the', 'series', 'however', 'we', 'show', 'numerically', 'that', 'the', 'bias', 'can', 'safely', 'be', 'ignored', 'in', 'practice']] | [-0.1367231899993899, 0.028745219867034946, -0.1345244016467958, 0.11245305569457781, -0.07939701133316544, -0.05192447935595461, 0.038016968330181124, 0.41267659240807203, -0.2695333346909256, -0.2354391861040115, 0.15717103716325137, -0.2228887826836992, -0.14215156573640264, 0.19622070273718514, -0.10867657694641662, 0.04938550843634521, 0.021388196502812207, 0.008543630781312695, -0.06863433785189915, -0.310841573179578, 0.28812764526177803, 0.042642002360915525, 0.26343594984981517, 0.00506247468697636, 0.09235987026730309, -0.03127761448622155, -0.03475167172323183, -0.006849416091901493, -0.11265894634546028, 0.10171648834670044, 0.23966796760973724, 0.09174259445812229, 0.3003014905135269, -0.4415567781897667, -0.13909377490737193, 0.13676485504307176, 0.16330690555902116, 0.07120476926818652, -0.01337565359300124, -0.20789755363543722, 0.0619445979271246, -0.20390724489951265, -0.13350375094855932, -0.12580194622379445, -0.030897857395441108, 0.10777711702647376, -0.3497364734319727, 0.0959617430344224, 0.0372167050069117, 0.08668481650681276, -0.023379975060537538, -0.1128069772992445, 0.04917780195018682, 0.121892583450181, 0.08168070338939762, -0.024064689439356975, 0.04929870415893991, -0.08206722665446527, -0.07573468549399757, 0.3588981967237171, -0.08513231272809207, -0.2735335255325165, 0.10325292442702567, -0.2267326185297545, -0.15772165738187893, 0.10709551973496159, 0.14574070220165278, 0.09603581371028787, -0.17395712924189866, 0.11855734917069481, -0.03881446834977554, 0.1296561021691836, 0.09026882681570461, -0.011105812659598481, 0.1578603352156832, 0.07044567141438955, 0.07739894082339521, 0.14181803283155087, -0.032354739476906376, -0.13424473064040524, -0.3689577848873223, -0.13917060725488345, -0.1872643688503835, 0.02120428589557338, -0.1200096078681109, -0.2149785599246135, 0.37296697566204745, 0.1536637390103272, 0.18191588771752204, 0.11644447703197923, 0.283813883671942, 0.20764329770526788, -0.01396192025150294, 0.08981173899804201, 0.16977549142852102, 0.07174473428471095, 0.08108935718242404, -0.16897889744849753, 0.16007030817538337, 0.05944391010511343] |
1,802.01308 | Truthful ownership transfer with expert advice: Blending mechanism
design with and without money | When a company undergoes a merger or transfers its ownership, the existing
governing body has an opinion on which buyer should take over as the new owner.
Similar situations occur while assigning the host of big sports tournaments,
like the World Cup or the Olympics. In all these settings, the values of the
external bidders are as important as the opinions of the internal experts.
Motivated by such scenarios, we consider a social welfare maximizing approach
to design and analyze truthful mechanisms in {\em hybrid social choice}
settings, where payments can be imposed to the bidders, but not to the experts.
Since this problem is a combination of mechanism design with and without
monetary transfers, classical solutions like VCG cannot be applied, making this
a novel mechanism design problem. We consider the simple but fundamental
scenario with one expert and two bidders, and provide tight approximation
guarantees of the optimal social welfare. We distinguish between mechanisms
that use ordinal and cardinal information, as well as between mechanisms that
base their decisions on one of the two sides (either the bidders or the expert)
or both. Our analysis shows that the cardinal setting is quite rich and admits
several non-trivial randomized truthful mechanisms, and also allows for
closer-to-optimal welfare guarantees.
| cs.GT | when a company undergoes a merger or transfers its ownership the existing governing body has an opinion on which buyer should take over as the new owner similar situations occur while assigning the host of big sports tournaments like the world cup or the olympics in all these settings the values of the external bidders are as important as the opinions of the internal experts motivated by such scenarios we consider a social welfare maximizing approach to design and analyze truthful mechanisms in em hybrid social choice settings where payments can be imposed to the bidders but not to the experts since this problem is a combination of mechanism design with and without monetary transfers classical solutions like vcg cannot be applied making this a novel mechanism design problem we consider the simple but fundamental scenario with one expert and two bidders and provide tight approximation guarantees of the optimal social welfare we distinguish between mechanisms that use ordinal and cardinal information as well as between mechanisms that base their decisions on one of the two sides either the bidders or the expert or both our analysis shows that the cardinal setting is quite rich and admits several nontrivial randomized truthful mechanisms and also allows for closertooptimal welfare guarantees | [['when', 'a', 'company', 'undergoes', 'a', 'merger', 'or', 'transfers', 'its', 'ownership', 'the', 'existing', 'governing', 'body', 'has', 'an', 'opinion', 'on', 'which', 'buyer', 'should', 'take', 'over', 'as', 'the', 'new', 'owner', 'similar', 'situations', 'occur', 'while', 'assigning', 'the', 'host', 'of', 'big', 'sports', 'tournaments', 'like', 'the', 'world', 'cup', 'or', 'the', 'olympics', 'in', 'all', 'these', 'settings', 'the', 'values', 'of', 'the', 'external', 'bidders', 'are', 'as', 'important', 'as', 'the', 'opinions', 'of', 'the', 'internal', 'experts', 'motivated', 'by', 'such', 'scenarios', 'we', 'consider', 'a', 'social', 'welfare', 'maximizing', 'approach', 'to', 'design', 'and', 'analyze', 'truthful', 'mechanisms', 'in', 'em', 'hybrid', 'social', 'choice', 'settings', 'where', 'payments', 'can', 'be', 'imposed', 'to', 'the', 'bidders', 'but', 'not', 'to', 'the', 'experts', 'since', 'this', 'problem', 'is', 'a', 'combination', 'of', 'mechanism', 'design', 'with', 'and', 'without', 'monetary', 'transfers', 'classical', 'solutions', 'like', 'vcg', 'can', 'not', 'be', 'applied', 'making', 'this', 'a', 'novel', 'mechanism', 'design', 'problem', 'we', 'consider', 'the', 'simple', 'but', 'fundamental', 'scenario', 'with', 'one', 'expert', 'and', 'two', 'bidders', 'and', 'provide', 'tight', 'approximation', 'guarantees', 'of', 'the', 'optimal', 'social', 'welfare', 'we', 'distinguish', 'between', 'mechanisms', 'that', 'use', 'ordinal', 'and', 'cardinal', 'information', 'as', 'well', 'as', 'between', 'mechanisms', 'that', 'base', 'their', 'decisions', 'on', 'one', 'of', 'the', 'two', 'sides', 'either', 'the', 'bidders', 'or', 'the', 'expert', 'or', 'both', 'our', 'analysis', 'shows', 'that', 'the', 'cardinal', 'setting', 'is', 'quite', 'rich', 'and', 'admits', 'several', 'nontrivial', 'randomized', 'truthful', 'mechanisms', 'and', 'also', 'allows', 'for', 'closertooptimal', 'welfare', 'guarantees']] | [-0.11960979894891996, 0.046851213328035116, -0.07568927750027066, 0.10530424989165592, -0.175887480030576, -0.2039681292856424, 0.13626173762582314, 0.4092982473814388, -0.29105016825783053, -0.2950493811170735, 0.0996650660886211, -0.2817485563047748, -0.16036812166692288, 0.15103941444869032, -0.10673584949456905, -0.007334495723817351, 0.03596848591273143, 0.04956031240799696, 0.05413788814475296, -0.28094455502085103, 0.35104244860762546, 0.021963360102214453, 0.2855399824627653, 0.05626854191324785, 0.09329701656404366, 0.02852156152708526, 0.025924985605051392, 0.024859272090620117, -0.11796916183025068, 0.08684920719167458, 0.3296829711547808, 0.20721668424753195, 0.3686444217642172, -0.4295606072925245, -0.14772626217543794, 0.15692243332479988, 0.08492093984122304, 0.05481868912855778, -0.035336211897459543, -0.2315162195596826, 0.056771978517575414, -0.2096498900485274, -0.04901055757036549, -0.09241718645140742, -0.04979446047524873, 0.019112943117696186, -0.33878631335148435, 0.0048643600664371135, 0.07306994164070676, 0.02074706942092574, -0.08351393215860681, -0.1306612674062225, -0.0005197926718545588, 0.18517399792691455, 0.10746192734891273, -0.02770076968103344, 0.15430752999866693, -0.1698914851467504, -0.21892038954234722, 0.45806133215935035, 0.024999543669651392, -0.18807887907349394, 0.1905646611018436, -0.08402147040572619, -0.1157943114714082, 0.046705784718394636, 0.19201258503950008, 0.0960041705271648, -0.12913875569151903, 0.03329541963334619, -0.0946556585793535, 0.17765902748730247, 0.07852818868479482, 0.03003658501333312, 0.17920489031955172, 0.15720216862514222, 0.12477965258690195, 0.10045251037488785, 0.04029754762265956, -0.13993625200473878, -0.24695318721181325, -0.11193001581329193, -0.14683226662026228, 0.07606888856835169, -0.12296119109905965, -0.14542491261682441, 0.35524279248798224, 0.12345876280551456, 0.17099513203957292, 0.06732696960579924, 0.33806570446894074, 0.049141491634624175, 0.03767436245371672, 0.09603949039662034, 0.22180787979683095, -0.0327581128798443, 0.10928384333450133, -0.15056354478981934, 0.19857272747948623, -0.005008338929407976] |
1,802.01309 | Scale Selection in the Stratified Convection of the Solar Photosphere | We examine the role of stratification in determining the scale for turbulent
anelastic convection. Motivated by the range of scales observed in convection
at the solar photosphere, we perform local numerical simulations of convection
for a range of density contrasts in large domains. We analyse both the Eulerian
and Lagrangian statistics of the convection and demonstrate that increasing the
stratification shifts the scale of the most energetic structures in the flow to
smaller scales; furthermore, the relative amplitude of vertical to horizontal
flows in the convection decreases with increasing stratification. We discuss
the implications of our results to the issue of solar mesogranulation.
| astro-ph.SR | we examine the role of stratification in determining the scale for turbulent anelastic convection motivated by the range of scales observed in convection at the solar photosphere we perform local numerical simulations of convection for a range of density contrasts in large domains we analyse both the eulerian and lagrangian statistics of the convection and demonstrate that increasing the stratification shifts the scale of the most energetic structures in the flow to smaller scales furthermore the relative amplitude of vertical to horizontal flows in the convection decreases with increasing stratification we discuss the implications of our results to the issue of solar mesogranulation | [['we', 'examine', 'the', 'role', 'of', 'stratification', 'in', 'determining', 'the', 'scale', 'for', 'turbulent', 'anelastic', 'convection', 'motivated', 'by', 'the', 'range', 'of', 'scales', 'observed', 'in', 'convection', 'at', 'the', 'solar', 'photosphere', 'we', 'perform', 'local', 'numerical', 'simulations', 'of', 'convection', 'for', 'a', 'range', 'of', 'density', 'contrasts', 'in', 'large', 'domains', 'we', 'analyse', 'both', 'the', 'eulerian', 'and', 'lagrangian', 'statistics', 'of', 'the', 'convection', 'and', 'demonstrate', 'that', 'increasing', 'the', 'stratification', 'shifts', 'the', 'scale', 'of', 'the', 'most', 'energetic', 'structures', 'in', 'the', 'flow', 'to', 'smaller', 'scales', 'furthermore', 'the', 'relative', 'amplitude', 'of', 'vertical', 'to', 'horizontal', 'flows', 'in', 'the', 'convection', 'decreases', 'with', 'increasing', 'stratification', 'we', 'discuss', 'the', 'implications', 'of', 'our', 'results', 'to', 'the', 'issue', 'of', 'solar', 'mesogranulation']] | [-0.15683911988529767, 0.20612630693386624, -0.03047110174231014, 0.09941658515085294, -0.027484570855943902, 0.04943176539777552, 0.006255983989866613, 0.29692890625266194, -0.2953823272882536, -0.3359270601090297, 0.07436189343768525, -0.21255002663588352, -0.11399240786372458, 0.21647658557133767, -0.040325374053158225, 0.032444528083642496, 0.058857182591487554, -0.05707676144479548, -0.057134673494429696, -0.1591218683769185, 0.34257560721553354, 0.10474813484939412, 0.24701045167822283, 0.050723553101703955, 0.059122024854482376, -0.12895140095017127, -0.08236437831164418, 0.07572438303060215, -0.17935302841186906, 0.09168179750948854, 0.1953320520188551, 0.05958568349986979, 0.26799475756085034, -0.48437832346529636, -0.29648792194722456, 0.03930439257506028, 0.1786965292887491, 0.10148855273440047, -0.011786941866146273, -0.16469903978365427, 0.11089720493815478, -0.12218384422108676, -0.12668491764337692, -0.012437227489517151, 0.03915416396864988, 0.04552872085636391, -0.26765742740657145, 0.11005108772767978, 0.04786542977820415, 0.16593279411057824, -0.10294324818781568, -0.1017454528313094, -0.08557818134233934, 0.13996735562380935, 0.10946838563145364, -0.031071796023187416, 0.15866076797066095, -0.18866779051214747, 0.008635650759617102, 0.4207562328976335, -0.11526922418654544, -0.15607350502497724, 0.19836737965097995, -0.2352491235134454, -0.09507603463219497, 0.11555915252583608, 0.20446686651919363, 0.12482096840745037, 0.003552835109164414, 0.02287530018247266, -0.0565919903642724, 0.1377512576573899, 0.07122503497719186, -0.04040504415130731, 0.19320542338186675, 0.23172009994899764, 0.09599310027218415, 0.1028301896984029, -0.1936621589188292, -0.12398438385769146, -0.2781256247510754, -0.13707476722311626, -0.09917814611882261, -0.026547364122008237, -0.13107163555783363, -0.195797615924181, 0.39595635701875087, 0.22209515062260252, 0.2172983441755031, 0.03648839869030109, 0.27539442206543047, 0.09855608011311083, 0.056724739270013515, 0.11008389252554444, 0.2970055317849789, 0.21303153091146457, 0.16453125768621424, -0.3152420054578665, 0.017280332093099947, 0.04884650472334577] |
1,802.0131 | A mathematical solve on the three-interfering-resonances' parameters | The multiple-solution problem in determining the
three-interfering-resonances' parameters from a fit to an experimentally
measured distribution is considered in a mathematical viewpoint. In this paper
it is shown that there are four numerical solutions for the fit with three
coherent Breit-Wigner functions. Although the explicit analytical formulae can
not be derived in this case, we provide some constraint equations between the
four solutions. For the cases of nonrelativistic and relativistic Breit-Wigner
forms of amplitude functions, numerical method is provided to derive the other
solutions from the already obtained one based on the obtained constraint
equations. In real experimental measurements with more complicated amplitude
forms similar to Breit-Wigner functions, the same method can be deduced and
performed to get numerical solutions. The well agreement between the solved
solutions using this mathematical method and those from the fit directly
verifies the correctness of the supplied constraint equations and mathematical
methodology.
| hep-ph hep-ex | the multiplesolution problem in determining the threeinterferingresonances parameters from a fit to an experimentally measured distribution is considered in a mathematical viewpoint in this paper it is shown that there are four numerical solutions for the fit with three coherent breitwigner functions although the explicit analytical formulae can not be derived in this case we provide some constraint equations between the four solutions for the cases of nonrelativistic and relativistic breitwigner forms of amplitude functions numerical method is provided to derive the other solutions from the already obtained one based on the obtained constraint equations in real experimental measurements with more complicated amplitude forms similar to breitwigner functions the same method can be deduced and performed to get numerical solutions the well agreement between the solved solutions using this mathematical method and those from the fit directly verifies the correctness of the supplied constraint equations and mathematical methodology | [['the', 'multiplesolution', 'problem', 'in', 'determining', 'the', 'threeinterferingresonances', 'parameters', 'from', 'a', 'fit', 'to', 'an', 'experimentally', 'measured', 'distribution', 'is', 'considered', 'in', 'a', 'mathematical', 'viewpoint', 'in', 'this', 'paper', 'it', 'is', 'shown', 'that', 'there', 'are', 'four', 'numerical', 'solutions', 'for', 'the', 'fit', 'with', 'three', 'coherent', 'breitwigner', 'functions', 'although', 'the', 'explicit', 'analytical', 'formulae', 'can', 'not', 'be', 'derived', 'in', 'this', 'case', 'we', 'provide', 'some', 'constraint', 'equations', 'between', 'the', 'four', 'solutions', 'for', 'the', 'cases', 'of', 'nonrelativistic', 'and', 'relativistic', 'breitwigner', 'forms', 'of', 'amplitude', 'functions', 'numerical', 'method', 'is', 'provided', 'to', 'derive', 'the', 'other', 'solutions', 'from', 'the', 'already', 'obtained', 'one', 'based', 'on', 'the', 'obtained', 'constraint', 'equations', 'in', 'real', 'experimental', 'measurements', 'with', 'more', 'complicated', 'amplitude', 'forms', 'similar', 'to', 'breitwigner', 'functions', 'the', 'same', 'method', 'can', 'be', 'deduced', 'and', 'performed', 'to', 'get', 'numerical', 'solutions', 'the', 'well', 'agreement', 'between', 'the', 'solved', 'solutions', 'using', 'this', 'mathematical', 'method', 'and', 'those', 'from', 'the', 'fit', 'directly', 'verifies', 'the', 'correctness', 'of', 'the', 'supplied', 'constraint', 'equations', 'and', 'mathematical', 'methodology']] | [-0.07818410269200143, 0.002178003113797223, -0.13379091307596894, 0.11518712949362539, -0.07110065143859508, -0.14187216279128578, 0.015334852813540318, 0.32149054540232536, -0.2476825521273703, -0.3151701894924551, 0.0821675120553534, -0.2703103548498685, -0.14593287364446692, 0.26851598406685706, 0.0007486547292748681, 0.09065852376955505, 0.07693501864498078, 0.019407822228025735, -0.10659348974036066, -0.21753636813488136, 0.30047515721130025, 0.005577739372494675, 0.25508031899705025, 0.032788737965304224, 0.08446198770915772, -0.04165529360880657, -0.046863773894705335, 0.02769070926374947, -0.15561963236744422, 0.10721650725898972, 0.24657316977351423, 0.1397082256459608, 0.170130038950719, -0.4473348012776906, -0.19022073881814675, 0.0611211151948997, 0.16150504485945547, 0.12906074486546168, -0.03901410577345567, -0.2761986555933927, 0.0651004977530616, -0.16103369661220382, -0.16927031526456074, -0.09047766695065158, -0.02603272197540013, 0.03451973704389949, -0.3053765180394003, 0.07481230777643975, -0.01374360172594359, 0.021039168955441438, -0.13186736680808014, -0.14050176489439342, 0.005239467591135984, 0.09201490986129256, 0.08069563700760506, -0.00014992373152857735, 0.04569468882606447, -0.1122243889420591, -0.082644990753053, 0.392511887089381, -0.055085556217323556, -0.2957179153252545, 0.14829235231237753, -0.14169011647705318, -0.11898599769983466, 0.12836113672063618, 0.10262831143059191, 0.11960960007161789, -0.1932803833236297, 0.059447988327655965, -0.07117146539318116, 0.15545269051728275, 0.08806037887943541, -0.018838547072406987, 0.132753847084534, 0.0936032792333146, 0.005304789939597502, 0.128103340026799, -0.012944787327314213, -0.12463181593208289, -0.3305649510172962, -0.0668708858916498, -0.1618704222725565, 0.014163235524058702, -0.0821010451981652, -0.13486958181918726, 0.3858373082768755, 0.12554515711963177, 0.19732543323695861, 0.06710894678903072, 0.3117669574967047, 0.21730531216044688, 0.035324840846021666, 0.05988327441356924, 0.28106306899805417, 0.13816049807787348, 0.100317840332456, -0.19189767149549458, 0.062269827005687825, 0.0683151236323475] |
1,802.01311 | Non-surjective Gaussian maps for singular curves on K3 surfaces | Let $(S,L)$ be a polarized K3 surface with $\mathrm{Pic}(S) = \mathbb{Z}[L]$
and $L\cdot L=2g-2$, let $C$ be a nonsingular curve of genus $g-1$ and let
$f:C\to S$ be such that $f(C) \in \vert L \vert$. We prove that the Gaussian
map $\Phi_{\omega_C(-T)}$ is non-surjective, where $T$ is the degree two
divisor over the singular point $x$ of $f(C)$. This generalizes a result of
Kemeny with an entirely different proof. It uses the very ampleness of $C$ on
the blown-up surface $\widetilde S$ of $S$ at $x$ and a theorem of L'vovski.
| math.AG | let sl be a polarized k3 surface with mathrmpics mathbbzl and lcdot l2g2 let c be a nonsingular curve of genus g1 and let fcto s be such that fc in vert l vert we prove that the gaussian map phi_omega_ct is nonsurjective where t is the degree two divisor over the singular point x of fc this generalizes a result of kemeny with an entirely different proof it uses the very ampleness of c on the blownup surface widetilde s of s at x and a theorem of lvovski | [['let', 'sl', 'be', 'a', 'polarized', 'k3', 'surface', 'with', 'mathrmpics', 'mathbbzl', 'and', 'lcdot', 'l2g2', 'let', 'c', 'be', 'a', 'nonsingular', 'curve', 'of', 'genus', 'g1', 'and', 'let', 'fcto', 's', 'be', 'such', 'that', 'fc', 'in', 'vert', 'l', 'vert', 'we', 'prove', 'that', 'the', 'gaussian', 'map', 'phi_omega_ct', 'is', 'nonsurjective', 'where', 't', 'is', 'the', 'degree', 'two', 'divisor', 'over', 'the', 'singular', 'point', 'x', 'of', 'fc', 'this', 'generalizes', 'a', 'result', 'of', 'kemeny', 'with', 'an', 'entirely', 'different', 'proof', 'it', 'uses', 'the', 'very', 'ampleness', 'of', 'c', 'on', 'the', 'blownup', 'surface', 'widetilde', 's', 'of', 's', 'at', 'x', 'and', 'a', 'theorem', 'of', 'lvovski']] | [-0.19279197533073467, 0.12650845815623207, -0.14248782472121854, -0.034696131981205365, -0.02606671148109748, -0.2508642998264106, 0.04447208057959066, 0.3080625984124666, -0.3236220617897722, -0.1842794216990601, 0.06921214750984164, -0.2777383926346205, -0.08811161940007708, 0.2182658850594402, -0.11449153912470264, -0.08506342771917928, 0.019500019992593418, 0.10764243199251765, -0.07600664146526089, -0.27780512443115546, 0.33690150406991326, -0.09153663382126387, 0.17108857687995876, 0.08754770104708366, 0.11249732945742476, 0.01329744561997697, 0.05255434951788291, -0.0334113682268274, -0.14983199138907027, 0.11182036976394959, 0.2926434737705994, 0.1038896166854863, 0.1748050574299901, -0.30393772487810183, -0.16739200647692953, 0.23055837218389783, 0.07784224320527945, -0.05798501534344152, 0.06527383791331505, -0.22911674080979685, 0.17058542007742838, -0.08856816791139441, -0.18532770705344373, -0.015698062743298536, 0.10790249484125525, 0.025966293817429348, -0.3057707175395863, -0.02424739681314244, 0.11011246892861849, 0.11392463856311731, 0.047621208844099976, -0.16364025743136745, -0.127348636065848, -0.014908789115589719, 0.0006615651533180892, 0.21728527993180377, 0.049626065185293555, -0.05296924156082664, -0.03543929192562436, 0.3187831693009452, -0.14430856281285023, -0.18118795069194463, 0.11143213366483186, -0.1660095420666039, -0.10719650480246475, 0.12754882485497482, 0.09369806148826557, 0.22327935010151462, -0.005012542962334877, 0.24914892066370284, -0.11755809118581373, 0.11478045359856265, 0.09254785686688022, -0.04629607914492141, 0.16147914078752618, 0.10175740339679556, 0.10548403970680612, 0.08000344694944012, -0.09308318398773757, 0.05829342107591761, -0.4077221603934155, -0.18497975310818346, -0.18265803182107765, 0.22522172583050507, -0.11877013624291786, -0.13897973992103754, 0.3588172691592643, 0.00591149385801928, 0.2501608693517398, 0.09771052985127236, 0.19262693180204477, 0.0655548888323612, 0.0034040899224427722, 0.120552574750036, 0.04970116436828014, 0.19643295680979528, -0.03986563686914959, -0.16593006469287672, 0.014966725555876659, 0.15698325565777893] |
1,802.01312 | Competitive Online Algorithms for Resource Allocation over the Positive
Semidefinite Cone | We consider a new and general online resource allocation problem, where the
goal is to maximize a function of a positive semidefinite (PSD) matrix with a
scalar budget constraint. The problem data arrives online, and the algorithm
needs to make an irrevocable decision at each step. Of particular interest are
classic experiment design problems in the online setting, with the algorithm
deciding whether to allocate budget to each experiment as new experiments
become available sequentially.
We analyze two greedy primal-dual algorithms and provide bounds on their
competitive ratios. Our analysis relies on a smooth surrogate of the objective
function that needs to satisfy a new diminishing returns (PSD-DR) property
(that its gradient is order-reversing with respect to the PSD cone). Using the
representation for monotone maps on the PSD cone given by L\"owner's theorem,
we obtain a convex parametrization of the family of functions satisfying
PSD-DR. We then formulate a convex optimization problem to directly optimize
our competitive ratio bound over this set. This design problem can be solved
offline before the data start arriving. The online algorithm that uses the
designed smoothing is tailored to the given cost function, and enjoys a
competitive ratio at least as good as our optimized bound. We provide examples
of computing the smooth surrogate for D-optimal and A-optimal experiment
design, and demonstrate the performance of the custom-designed algorithm.
| math.OC cs.DS | we consider a new and general online resource allocation problem where the goal is to maximize a function of a positive semidefinite psd matrix with a scalar budget constraint the problem data arrives online and the algorithm needs to make an irrevocable decision at each step of particular interest are classic experiment design problems in the online setting with the algorithm deciding whether to allocate budget to each experiment as new experiments become available sequentially we analyze two greedy primaldual algorithms and provide bounds on their competitive ratios our analysis relies on a smooth surrogate of the objective function that needs to satisfy a new diminishing returns psddr property that its gradient is orderreversing with respect to the psd cone using the representation for monotone maps on the psd cone given by lowners theorem we obtain a convex parametrization of the family of functions satisfying psddr we then formulate a convex optimization problem to directly optimize our competitive ratio bound over this set this design problem can be solved offline before the data start arriving the online algorithm that uses the designed smoothing is tailored to the given cost function and enjoys a competitive ratio at least as good as our optimized bound we provide examples of computing the smooth surrogate for doptimal and aoptimal experiment design and demonstrate the performance of the customdesigned algorithm | [['we', 'consider', 'a', 'new', 'and', 'general', 'online', 'resource', 'allocation', 'problem', 'where', 'the', 'goal', 'is', 'to', 'maximize', 'a', 'function', 'of', 'a', 'positive', 'semidefinite', 'psd', 'matrix', 'with', 'a', 'scalar', 'budget', 'constraint', 'the', 'problem', 'data', 'arrives', 'online', 'and', 'the', 'algorithm', 'needs', 'to', 'make', 'an', 'irrevocable', 'decision', 'at', 'each', 'step', 'of', 'particular', 'interest', 'are', 'classic', 'experiment', 'design', 'problems', 'in', 'the', 'online', 'setting', 'with', 'the', 'algorithm', 'deciding', 'whether', 'to', 'allocate', 'budget', 'to', 'each', 'experiment', 'as', 'new', 'experiments', 'become', 'available', 'sequentially', 'we', 'analyze', 'two', 'greedy', 'primaldual', 'algorithms', 'and', 'provide', 'bounds', 'on', 'their', 'competitive', 'ratios', 'our', 'analysis', 'relies', 'on', 'a', 'smooth', 'surrogate', 'of', 'the', 'objective', 'function', 'that', 'needs', 'to', 'satisfy', 'a', 'new', 'diminishing', 'returns', 'psddr', 'property', 'that', 'its', 'gradient', 'is', 'orderreversing', 'with', 'respect', 'to', 'the', 'psd', 'cone', 'using', 'the', 'representation', 'for', 'monotone', 'maps', 'on', 'the', 'psd', 'cone', 'given', 'by', 'lowners', 'theorem', 'we', 'obtain', 'a', 'convex', 'parametrization', 'of', 'the', 'family', 'of', 'functions', 'satisfying', 'psddr', 'we', 'then', 'formulate', 'a', 'convex', 'optimization', 'problem', 'to', 'directly', 'optimize', 'our', 'competitive', 'ratio', 'bound', 'over', 'this', 'set', 'this', 'design', 'problem', 'can', 'be', 'solved', 'offline', 'before', 'the', 'data', 'start', 'arriving', 'the', 'online', 'algorithm', 'that', 'uses', 'the', 'designed', 'smoothing', 'is', 'tailored', 'to', 'the', 'given', 'cost', 'function', 'and', 'enjoys', 'a', 'competitive', 'ratio', 'at', 'least', 'as', 'good', 'as', 'our', 'optimized', 'bound', 'we', 'provide', 'examples', 'of', 'computing', 'the', 'smooth', 'surrogate', 'for', 'doptimal', 'and', 'aoptimal', 'experiment', 'design', 'and', 'demonstrate', 'the', 'performance', 'of', 'the', 'customdesigned', 'algorithm']] | [-0.06576913867600997, -0.0010244605704257683, -0.103170599047128, 0.06946589381198061, -0.13323546512754042, -0.19814065573611736, 0.07923991156057057, 0.4103944141735143, -0.2991913931377466, -0.30125101774903806, 0.13727141614541863, -0.26421202533469107, -0.15771658386880608, 0.18399462497672026, -0.09333861504384888, 0.117794943185922, 0.07707841240805094, 0.027247893179489106, -0.0788280591078942, -0.3043855478012968, 0.2981855074562876, 0.08198365622571765, 0.26959809668951, 0.05312405884445482, 0.1491245452310439, 0.02472105956607135, -0.005132547049311245, 0.0197720462873979, -0.11816705232681242, 0.12722177172576665, 0.29459844554999987, 0.2547875910750987, 0.3403084873150817, -0.3932389530265545, -0.11345055035728911, 0.16038235394918932, 0.09135058850640924, 0.041471290710119055, -0.0700800693776634, -0.21402520255181487, 0.0988615460478755, -0.12031089622452187, -0.0658452805745595, -0.07278135261235283, -0.04997861039127336, 0.014196606734537858, -0.37138963144088805, -0.015696945961260624, 0.011677183271406611, -0.026322328047033383, -0.066198985318386, -0.15269434407317903, 0.05490116787564862, 0.09287374931692476, 0.023095825280380254, 0.06543426981118546, 0.11730610006676795, -0.07366659506244977, -0.14160034076870323, 0.3694494174625787, -0.058109542459349725, -0.2404062027516754, 0.12220341514069337, -0.03942908355736512, -0.1390514206997382, 0.12071168301115438, 0.24961895920392888, 0.15072014897481242, -0.12589985484595623, 0.05929171285255825, -0.08618287554150655, 0.16438074099451236, 0.025054869239924334, -0.008113016604890654, 0.137096400959459, 0.1929774849953322, 0.18954674566149995, 0.19243044115450533, -0.018488412834662158, -0.06655493580982623, -0.28944783859715, -0.1339463116794265, -0.216801543525867, 0.002625653616804212, -0.11856479666181714, -0.14661751363077724, 0.3853876157851698, 0.1087682516733811, 0.19656730183888846, 0.1615363560541796, 0.3364480324423634, 0.13307564055257123, 0.018734964554619895, 0.10837642178816445, 0.19584689092521676, 0.06267948422738615, 0.0796378322604484, -0.21358172610326934, 0.09847206311016406, 0.08072522076915933] |
1,802.01313 | All-depth dispersion cancellation in spectral domain optical coherence
tomography using numerical intensity correlations | In ultra-high resolution (UHR-) optical coherence tomography (OCT) group
velocity dispersion (GVD) must be corrected for in order to approach the
theoretical resolution limit. One approach promises not only compensation, but
complete annihilation of even order dispersion effects, and that at all sample
depths. This approach has hitherto been demonstrated with an experimentally
demanding 'balanced detection' configuration based on using two detectors. We
demonstrate intensity correlation (IC) OCT using a conventional spectral domain
(SD) UHR-OCT system with a single detector. IC-SD-OCT configurations exhibit
cross term ghost images and a reduced axial range, half of that of conventional
SD-OCT. We demonstrate that both shortcomings can be removed by applying a
novel generic artefact reduction algorithm and using analytic interferograms.
We show the superiority of IC-SD-OCT compared to conventional SD-OCT by showing
how IC-SD-OCT is able to image spatial structures behind a strongly dispersive
silicon wafer. Finally, we question the resolution enhancement of square root 2
that IC-SD-OCT is often believed to have compared to SD-OCT. We show that this
is simply the effect of squaring the reflectivity profile as a natural result
of processing the product of two intensity spectra instead of a single
spectrum.
| physics.optics physics.bio-ph | in ultrahigh resolution uhr optical coherence tomography oct group velocity dispersion gvd must be corrected for in order to approach the theoretical resolution limit one approach promises not only compensation but complete annihilation of even order dispersion effects and that at all sample depths this approach has hitherto been demonstrated with an experimentally demanding balanced detection configuration based on using two detectors we demonstrate intensity correlation ic oct using a conventional spectral domain sd uhroct system with a single detector icsdoct configurations exhibit cross term ghost images and a reduced axial range half of that of conventional sdoct we demonstrate that both shortcomings can be removed by applying a novel generic artefact reduction algorithm and using analytic interferograms we show the superiority of icsdoct compared to conventional sdoct by showing how icsdoct is able to image spatial structures behind a strongly dispersive silicon wafer finally we question the resolution enhancement of square root 2 that icsdoct is often believed to have compared to sdoct we show that this is simply the effect of squaring the reflectivity profile as a natural result of processing the product of two intensity spectra instead of a single spectrum | [['in', 'ultrahigh', 'resolution', 'uhr', 'optical', 'coherence', 'tomography', 'oct', 'group', 'velocity', 'dispersion', 'gvd', 'must', 'be', 'corrected', 'for', 'in', 'order', 'to', 'approach', 'the', 'theoretical', 'resolution', 'limit', 'one', 'approach', 'promises', 'not', 'only', 'compensation', 'but', 'complete', 'annihilation', 'of', 'even', 'order', 'dispersion', 'effects', 'and', 'that', 'at', 'all', 'sample', 'depths', 'this', 'approach', 'has', 'hitherto', 'been', 'demonstrated', 'with', 'an', 'experimentally', 'demanding', 'balanced', 'detection', 'configuration', 'based', 'on', 'using', 'two', 'detectors', 'we', 'demonstrate', 'intensity', 'correlation', 'ic', 'oct', 'using', 'a', 'conventional', 'spectral', 'domain', 'sd', 'uhroct', 'system', 'with', 'a', 'single', 'detector', 'icsdoct', 'configurations', 'exhibit', 'cross', 'term', 'ghost', 'images', 'and', 'a', 'reduced', 'axial', 'range', 'half', 'of', 'that', 'of', 'conventional', 'sdoct', 'we', 'demonstrate', 'that', 'both', 'shortcomings', 'can', 'be', 'removed', 'by', 'applying', 'a', 'novel', 'generic', 'artefact', 'reduction', 'algorithm', 'and', 'using', 'analytic', 'interferograms', 'we', 'show', 'the', 'superiority', 'of', 'icsdoct', 'compared', 'to', 'conventional', 'sdoct', 'by', 'showing', 'how', 'icsdoct', 'is', 'able', 'to', 'image', 'spatial', 'structures', 'behind', 'a', 'strongly', 'dispersive', 'silicon', 'wafer', 'finally', 'we', 'question', 'the', 'resolution', 'enhancement', 'of', 'square', 'root', '2', 'that', 'icsdoct', 'is', 'often', 'believed', 'to', 'have', 'compared', 'to', 'sdoct', 'we', 'show', 'that', 'this', 'is', 'simply', 'the', 'effect', 'of', 'squaring', 'the', 'reflectivity', 'profile', 'as', 'a', 'natural', 'result', 'of', 'processing', 'the', 'product', 'of', 'two', 'intensity', 'spectra', 'instead', 'of', 'a', 'single', 'spectrum']] | [-0.07246188718655157, 0.0715640128654525, -0.09904714551341441, 0.04323930676952101, -0.05488392622594136, -0.12475510420920999, -0.010687023913727823, 0.4572114883826028, -0.24214390244517361, -0.3087805873863207, 0.09023369247088996, -0.2703964366750388, -0.15288844577171215, 0.21302403899548172, -0.0674776168379299, 0.04910340431037109, 0.06905965010720166, -0.0006823015756924281, -0.08707717045140692, -0.2238567609936431, 0.2779842344263914, 0.05765464064333895, 0.33596213050810714, 0.05851303384826547, 0.12335490315166042, -0.0030322100978570307, -0.0016256664014306188, 0.06552808218126752, -0.056337381199162186, 0.08801990600552448, 0.2214421966826044, 0.0754943790025865, 0.2145495052934269, -0.389849015991448, -0.2308052754768929, 0.07540375585955827, 0.18134567299473686, 0.09533821853338596, -0.04230806374557547, -0.2646039504769076, 0.09914949718267493, -0.15883436299063572, -0.10097049473131978, -0.07278755198223229, -0.021637862209187456, -0.03172885956837959, -0.24642053434442843, 0.08158722212634135, 0.03558799014717806, 0.06373231951867413, -0.030259942653896192, -0.0861179212500706, 0.00855112148055173, 0.07044340625532772, -0.03486148211937014, 0.024201262521451897, 0.12030510108236261, -0.12065703570530702, -0.11637073598613665, 0.36710748836858986, -0.08313267091625207, -0.17082099178469903, 0.1547701364759951, -0.16518102951477445, -0.05711201496167857, 0.1863505157219611, 0.11831438160722249, 0.09135083309806806, -0.12956286543865025, 0.022651398170093727, -0.000585327987059874, 0.24689077520647, 0.1071498649502077, 0.062122708240514336, 0.1596357797118883, 0.18489610805469037, 0.0353846404660666, 0.11571099391007873, -0.18206406045661874, -0.00946057957870713, -0.2418415828886413, -0.12588527719682255, -0.18437221720778701, 0.053831418488998584, -0.053866852089038395, -0.12318797217749212, 0.3640070637188775, 0.17332094062369355, 0.17833340037302067, 0.025819250435289955, 0.35317831261793975, 0.1215404785357022, 0.12252968275132253, 0.015645045357439474, 0.25472958562607617, 0.10697611519879632, 0.07241231948677354, -0.23086343844872467, 0.004637111513635393, 0.03512679117422109] |
1,802.01314 | The Photometric Maximum in Cosmicflows-2 | Based on well known photometric rules for the number of galaxies as function
of the distance in Mpc we model the so called "Great Wall" which is visible on
the Cosmicflows-2 catalog. The gravitational field is evaluated at the light of
the shell theorem and a finite value for the gravitational field is numerically
derived.
| astro-ph.CO | based on well known photometric rules for the number of galaxies as function of the distance in mpc we model the so called great wall which is visible on the cosmicflows2 catalog the gravitational field is evaluated at the light of the shell theorem and a finite value for the gravitational field is numerically derived | [['based', 'on', 'well', 'known', 'photometric', 'rules', 'for', 'the', 'number', 'of', 'galaxies', 'as', 'function', 'of', 'the', 'distance', 'in', 'mpc', 'we', 'model', 'the', 'so', 'called', 'great', 'wall', 'which', 'is', 'visible', 'on', 'the', 'cosmicflows2', 'catalog', 'the', 'gravitational', 'field', 'is', 'evaluated', 'at', 'the', 'light', 'of', 'the', 'shell', 'theorem', 'and', 'a', 'finite', 'value', 'for', 'the', 'gravitational', 'field', 'is', 'numerically', 'derived']] | [-0.0904910425316881, 0.06443443459204652, -0.1058199167505584, 0.08150829885959286, -0.09747124786742709, -0.027832638446918943, 0.043771854567934164, 0.36810227293859826, -0.21159336736256426, -0.29953237358819357, 0.10532145730897106, -0.25448047430677845, -0.09821430478583683, 0.24231760330413551, -0.01389541993425651, 0.03756498405921527, 0.007823651741174135, 0.06782409351488405, -0.01769746123728427, -0.22978438155894929, 0.3198977521366694, 0.04635466371070255, 0.25490563237531616, 0.060611691952429034, 0.14881933206184345, 0.015725843371315436, -0.061581292104992, 0.039372688210145994, -0.12526883946054362, 0.04519800865514712, 0.14392169405790892, 0.13473378409716216, 0.24085246288979595, -0.34531442695720627, -0.20591494209048422, 0.08598195827693086, 0.13825750489803879, 0.12423858368896287, -0.042734332437711686, -0.3099239041182128, 0.11436829679560932, -0.14783532777377828, -0.16692285866222598, 0.04046652015637268, 0.05967899069444022, 0.054876712819730694, -0.22998816464096308, 0.08493704729374837, -0.019967047580179167, 0.08310735728591681, -0.07639343736862594, -0.11269004129889336, -0.04185771640305492, 0.08203380547717891, 0.05122314552903514, 0.10929691696708853, 0.1379561353305524, -0.16638986935669725, -0.03114811625670303, 0.4314869604327462, -0.0815675725102086, -0.12512225158173929, 0.13481010760349985, -0.1324250360273502, -0.0755326733247123, 0.07601586559956724, 0.16616601435975595, 0.16175454641396012, -0.15969299199906262, 0.10119271124183962, -0.04532501938837496, 0.16452277031176807, 0.025081425363367254, 0.04983943070877682, 0.2540376780046658, 0.14306180023334242, 0.045893425562165004, 0.13506927436894992, -0.18283724209971047, -0.07083490971814502, -0.3352492491629991, -0.09243380908261646, -0.25464310043237426, 0.008151021261106837, -0.12489322848083578, -0.19739750588143415, 0.3926140947775407, 0.11907873074100776, 0.138761743780924, 0.10113395727874541, 0.30215564810416917, 0.12117151856972751, 0.13454217042096636, 0.07370046212083914, 0.3486993458968672, 0.15018890559757975, 0.04954914374446327, -0.20220752719959076, 0.015275889084759084, 0.08788110835647041] |
1,802.01315 | Gosig: Scalable Byzantine Consensus on Adversarial Wide Area Network for
Blockchains | Existing Byzantine fault tolerance (BFT) protocols face significant
challenges in the consortium blockchain scenario. On the one hand, we can make
little assumptions about the reliability and security of the underlying
Internet. On the other hand, the applications on consortium blockchains demand
a system as scalable as the Bit-coin but providing much higher performance, as
well as provable safety. We present a new BFT protocol, Gosig, that combines
crypto-based secret leader selection and multi-round voting in the protocol
layer with implementation layer optimizations such as gossip-based message
propagation. In particular, Gosig guarantees safety even in a network fully
controlled by adversaries, while providing provable liveness with
easy-to-achieve network connectivity assumption. On a wide area testbed
consisting of 140 Amazon EC2 servers spanning 14 cities on five continents, we
show that Gosig can achieve over 4,000 transactions per second with less than 1
minute transaction confirmation time.
| cs.DC | existing byzantine fault tolerance bft protocols face significant challenges in the consortium blockchain scenario on the one hand we can make little assumptions about the reliability and security of the underlying internet on the other hand the applications on consortium blockchains demand a system as scalable as the bitcoin but providing much higher performance as well as provable safety we present a new bft protocol gosig that combines cryptobased secret leader selection and multiround voting in the protocol layer with implementation layer optimizations such as gossipbased message propagation in particular gosig guarantees safety even in a network fully controlled by adversaries while providing provable liveness with easytoachieve network connectivity assumption on a wide area testbed consisting of 140 amazon ec2 servers spanning 14 cities on five continents we show that gosig can achieve over 4000 transactions per second with less than 1 minute transaction confirmation time | [['existing', 'byzantine', 'fault', 'tolerance', 'bft', 'protocols', 'face', 'significant', 'challenges', 'in', 'the', 'consortium', 'blockchain', 'scenario', 'on', 'the', 'one', 'hand', 'we', 'can', 'make', 'little', 'assumptions', 'about', 'the', 'reliability', 'and', 'security', 'of', 'the', 'underlying', 'internet', 'on', 'the', 'other', 'hand', 'the', 'applications', 'on', 'consortium', 'blockchains', 'demand', 'a', 'system', 'as', 'scalable', 'as', 'the', 'bitcoin', 'but', 'providing', 'much', 'higher', 'performance', 'as', 'well', 'as', 'provable', 'safety', 'we', 'present', 'a', 'new', 'bft', 'protocol', 'gosig', 'that', 'combines', 'cryptobased', 'secret', 'leader', 'selection', 'and', 'multiround', 'voting', 'in', 'the', 'protocol', 'layer', 'with', 'implementation', 'layer', 'optimizations', 'such', 'as', 'gossipbased', 'message', 'propagation', 'in', 'particular', 'gosig', 'guarantees', 'safety', 'even', 'in', 'a', 'network', 'fully', 'controlled', 'by', 'adversaries', 'while', 'providing', 'provable', 'liveness', 'with', 'easytoachieve', 'network', 'connectivity', 'assumption', 'on', 'a', 'wide', 'area', 'testbed', 'consisting', 'of', '140', 'amazon', 'ec2', 'servers', 'spanning', '14', 'cities', 'on', 'five', 'continents', 'we', 'show', 'that', 'gosig', 'can', 'achieve', 'over', '4000', 'transactions', 'per', 'second', 'with', 'less', 'than', '1', 'minute', 'transaction', 'confirmation', 'time']] | [-0.22515601222242776, -0.026888505947487106, -0.014607876671301522, 0.025018631679744555, -0.07315262585621456, -0.25914774669559093, 0.15111975938178085, 0.38787031959228474, -0.23614725293270472, -0.3742955716005687, 0.16389133553100943, -0.278451852628897, -0.09823165822589514, 0.20285396950303353, -0.15539208510248312, 0.10521226823972217, 0.08042525544206627, 0.03937705691968059, 0.03972274482988849, -0.329321645765469, 0.23330036794831013, 0.06873804732739669, 0.331047407968034, 0.08601878642522055, 0.07984999181092556, 0.00660911432692203, 0.030034038193266967, -0.016023942118446374, -0.05767450942146062, 0.10654779983170587, 0.28566171080195185, 0.22279794287610927, 0.35581654120108175, -0.45393354242731787, -0.17270760045483194, 0.04889706289857337, 0.12735353400609617, 0.07574392453253526, -0.03404995523601899, -0.3121905150245233, 0.11560719306741295, -0.27562234261382274, -0.04468281338762107, -0.07535848765923031, -0.04333194500670351, 0.02071170689847224, -0.22002152028525698, -0.005690972050973054, 0.0070979903267439585, 0.09538331681477098, 0.0004446429650074449, -0.07602082779550733, -0.002880208309065422, 0.13003187486259588, -0.005386778834308016, 0.013887686626825097, 0.20069812066403442, -0.12135317935768901, -0.19288131437938788, 0.3862643736575184, -0.020157412096460606, -0.0975735373088512, 0.17188223362258026, -0.022422457207596443, -0.1937422222104566, 0.05745288292267199, 0.21030678691920535, 0.06511460408118779, -0.15961947319065703, 0.009496499519345575, -0.04482891793555484, 0.2671971751955049, 0.07476234887967464, 0.10695166643708945, 0.12769288499518458, 0.24389229123801764, 0.15697056185775277, 0.10677347572175144, -0.039500703860138514, -0.1429964785239306, -0.22889184640270882, -0.14097916864115617, -0.14748290271080775, 0.026906241624262826, -0.1494725330184808, -0.12620720488806095, 0.37220620372300517, 0.193260023383231, 0.10694140429640639, 0.12163585478375698, 0.4176718776274858, -0.0399255527352015, 0.12331708610732237, 0.18348936958174253, 0.18868865716303218, -0.014072014595349801, 0.1591750700644956, -0.08678488153783637, 0.18826295607241578, -0.015122303960780644] |
1,802.01316 | Study of Realistic Antenna Patterns in 5G mmWave Cellular Scenarios | Large antenna arrays and millimeter-wave (mmWave) frequencies have been
attracting growing attention as possible candidates to meet the high
requirements of future 5G mobile networks. In view of the large path loss
attenuation in these bands, beamforming techniques that create a beam in the
direction of the user equipment are essential to perform the transmission. For
this purpose, in this paper, we aim at characterizing realistic antenna
radiation patterns, motivated by the need to properly capture mmWave
propagation behaviors and understand the achievable performance in 5G cellular
scenarios. In particular, we highlight how the performance changes with the
radiation pattern used. Consequently, we conclude that it is crucial to use an
accurate and realistic radiation model for proper performance assessment and
system dimensioning.
| cs.NI cs.IT math.IT | large antenna arrays and millimeterwave mmwave frequencies have been attracting growing attention as possible candidates to meet the high requirements of future 5g mobile networks in view of the large path loss attenuation in these bands beamforming techniques that create a beam in the direction of the user equipment are essential to perform the transmission for this purpose in this paper we aim at characterizing realistic antenna radiation patterns motivated by the need to properly capture mmwave propagation behaviors and understand the achievable performance in 5g cellular scenarios in particular we highlight how the performance changes with the radiation pattern used consequently we conclude that it is crucial to use an accurate and realistic radiation model for proper performance assessment and system dimensioning | [['large', 'antenna', 'arrays', 'and', 'millimeterwave', 'mmwave', 'frequencies', 'have', 'been', 'attracting', 'growing', 'attention', 'as', 'possible', 'candidates', 'to', 'meet', 'the', 'high', 'requirements', 'of', 'future', '5g', 'mobile', 'networks', 'in', 'view', 'of', 'the', 'large', 'path', 'loss', 'attenuation', 'in', 'these', 'bands', 'beamforming', 'techniques', 'that', 'create', 'a', 'beam', 'in', 'the', 'direction', 'of', 'the', 'user', 'equipment', 'are', 'essential', 'to', 'perform', 'the', 'transmission', 'for', 'this', 'purpose', 'in', 'this', 'paper', 'we', 'aim', 'at', 'characterizing', 'realistic', 'antenna', 'radiation', 'patterns', 'motivated', 'by', 'the', 'need', 'to', 'properly', 'capture', 'mmwave', 'propagation', 'behaviors', 'and', 'understand', 'the', 'achievable', 'performance', 'in', '5g', 'cellular', 'scenarios', 'in', 'particular', 'we', 'highlight', 'how', 'the', 'performance', 'changes', 'with', 'the', 'radiation', 'pattern', 'used', 'consequently', 'we', 'conclude', 'that', 'it', 'is', 'crucial', 'to', 'use', 'an', 'accurate', 'and', 'realistic', 'radiation', 'model', 'for', 'proper', 'performance', 'assessment', 'and', 'system', 'dimensioning']] | [-0.1761514023779248, 0.06067291923007848, 0.012872957348126948, 0.059541200017897276, -0.08702562744085623, -0.15227099638659417, 0.040602109094937826, 0.460261029374693, -0.22082646476574302, -0.295862066798003, 0.06829853659321562, -0.25133447978660706, -0.2110185828495286, 0.19188314721525868, -0.09313610466424285, 0.10083936953801677, 0.07958855583309764, -0.03567485946488029, 0.004493524456241478, -0.19394361846171682, 0.2825678305215831, 0.1742406596649226, 0.38769383754248055, 0.0649586795427935, 0.02229407210197826, -0.014869380418620095, -0.03614272573220778, -0.034492798248018194, -0.12037988198858145, 0.1258851860199011, 0.3532421160640755, 0.1710220252758089, 0.2759858264125944, -0.4601456742370274, -0.2795229469685308, 0.10094781185318602, 0.16211728775510337, 0.06731758618015583, -0.0658535456580178, -0.2408717966873229, 0.11374138419968795, -0.21740464610994104, -0.14891145368129377, -0.024461454716586787, -0.019228443821392407, 0.05272809021190051, -0.28384336182985803, -0.06665605092724043, -0.012848566078043324, 0.05146725067671964, -0.032538941345836334, -0.06110278658315206, 0.03340241916447393, 0.20536851266217304, 0.02984919404796499, 0.0024882348867632993, 0.08617048396736504, -0.14926287897188611, -0.07694542947096553, 0.4297346883430714, 0.003930839837710486, -0.2280569273554455, 0.18658829657872003, -0.1469278451416365, -0.1294183454029565, 0.15798411737110965, 0.27748885691521796, 0.05101181392565491, -0.1886038598112338, -0.0058357139729432825, 0.06029250037409668, 0.12803759741619591, 0.07471515507081418, 0.11914281523975778, 0.25222376590516327, 0.24200255593201675, 0.08694907143992198, 0.11283935814323585, -0.15004999979543007, -0.04113198841053129, -0.2171274923598318, -0.11067038853697732, -0.16660695773269224, 0.008674593805146168, -0.05662678231294002, -0.09368062708375414, 0.3881834444203755, 0.23944039488347565, 0.11248030656346733, 0.04671951141056976, 0.3840252087353085, 0.07766402112528288, 0.09471658647544985, 0.05163139696573702, 0.25272718346507356, 0.053404899844066885, 0.1748806676492322, -0.20819881595425097, 0.039587428066425207, -0.07665184927665121] |
1,802.01317 | Convergence and completeness for square-well Stark resonant state
expansions | In this paper we investigate the completeness of the Stark resonant
eigenstates for a particle in a square-well potential. We find that the
resonant state expansions for target functions converge inside the potential
well and that the existence of this convergence does not depend on the depth of
the potential well. By analyzing the asymptotic form of the terms in these
expansions we prove some results on the relation between smoothness of target
functions and the rate of convergence of the corresponding resonant state
expansion.
| quant-ph | in this paper we investigate the completeness of the stark resonant eigenstates for a particle in a squarewell potential we find that the resonant state expansions for target functions converge inside the potential well and that the existence of this convergence does not depend on the depth of the potential well by analyzing the asymptotic form of the terms in these expansions we prove some results on the relation between smoothness of target functions and the rate of convergence of the corresponding resonant state expansion | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'completeness', 'of', 'the', 'stark', 'resonant', 'eigenstates', 'for', 'a', 'particle', 'in', 'a', 'squarewell', 'potential', 'we', 'find', 'that', 'the', 'resonant', 'state', 'expansions', 'for', 'target', 'functions', 'converge', 'inside', 'the', 'potential', 'well', 'and', 'that', 'the', 'existence', 'of', 'this', 'convergence', 'does', 'not', 'depend', 'on', 'the', 'depth', 'of', 'the', 'potential', 'well', 'by', 'analyzing', 'the', 'asymptotic', 'form', 'of', 'the', 'terms', 'in', 'these', 'expansions', 'we', 'prove', 'some', 'results', 'on', 'the', 'relation', 'between', 'smoothness', 'of', 'target', 'functions', 'and', 'the', 'rate', 'of', 'convergence', 'of', 'the', 'corresponding', 'resonant', 'state', 'expansion']] | [-0.1084357567021952, 0.07500286762301317, -0.08763223760487403, 0.07287358011338202, 0.002741937531048761, -0.024321903934811845, 0.07910618237082792, 0.34562132737654094, -0.250621177935425, -0.24102941249661586, 0.08722085356301464, -0.2723087811952128, -0.13757866682649098, 0.17324935985208653, -0.006364007031216341, 0.06562875610064058, 0.04686587091042277, 0.0785217765992617, -0.09557312799836783, -0.21439692474463407, 0.36157820358434145, 0.025831702044781517, 0.2532294412746149, 0.10290737130186137, 0.08457529970499522, 0.029139112045659738, 0.02841722131432856, -0.031639799492104964, -0.16215840867970494, 0.11897402755258714, 0.17359464098425473, 0.09991729258121375, 0.26890446320176126, -0.3946951770607163, -0.15157591724658714, 0.12646324609899345, 0.18407770593595854, 0.09671738889506634, -0.04992999158361379, -0.27233281926635433, 0.06900524122311788, -0.1429926727734068, -0.17094566796303673, -0.11002904040848507, -0.009469331516062511, 0.14943828245296198, -0.25990929091349246, 0.10112411574844052, 0.08631320600945722, 0.029248103784287677, -0.1288309765212676, -0.08814296560252415, 0.0034363045740653485, 0.11683687136563307, 0.051402494026457565, -0.01652983607833876, 0.0872320793733439, -0.178053428205278, -0.06189666249624946, 0.3365875859238098, -0.11458106855040087, -0.22744665272972164, 0.19202930565704318, -0.21622707780231448, -0.09367287763230064, 0.083645749924814, 0.1666731425177525, 0.1472174118327744, -0.11026414328199975, 0.1281279350672027, -0.022790126075201176, 0.13162212760790307, 0.11640892746474812, 0.06296681488918908, 0.15633118331213208, 0.11313604414463044, 0.07170039790216834, 0.16304205599350527, -0.0662307797712, -0.10562338841640774, -0.37184464918339954, -0.15510783668826608, -0.19289180184988414, 0.010917689062497469, -0.1099365535462686, -0.21866559210945577, 0.4299555598018581, 0.1375027481904801, 0.22909746187574723, 0.07751108867061489, 0.261682318282478, 0.18104691147146856, 0.02087977387230186, 0.05752235918360598, 0.2933997721537975, 0.11820144240525277, 0.061374575513250686, -0.2759749107706525, 0.06832143269369707, 0.06841438916676185] |
1,802.01318 | Unary negation fragment with equivalence relations has the finite model
property | We consider an extension of the unary negation fragment of first-order logic
in which arbitrarily many binary symbols may be required to be interpreted as
equivalence relations. We show that this extension has the finite model
property. More specifically, we show that every satisfiable formula has a model
of at most doubly exponential size. We argue that the satisfiability (= finite
satisfiability) problem for this logic is TwoExpTime-complete. We also transfer
our results to a restricted variant of the guarded negation fragment with
equivalence relations.
| cs.LO | we consider an extension of the unary negation fragment of firstorder logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations we show that this extension has the finite model property more specifically we show that every satisfiable formula has a model of at most doubly exponential size we argue that the satisfiability finite satisfiability problem for this logic is twoexptimecomplete we also transfer our results to a restricted variant of the guarded negation fragment with equivalence relations | [['we', 'consider', 'an', 'extension', 'of', 'the', 'unary', 'negation', 'fragment', 'of', 'firstorder', 'logic', 'in', 'which', 'arbitrarily', 'many', 'binary', 'symbols', 'may', 'be', 'required', 'to', 'be', 'interpreted', 'as', 'equivalence', 'relations', 'we', 'show', 'that', 'this', 'extension', 'has', 'the', 'finite', 'model', 'property', 'more', 'specifically', 'we', 'show', 'that', 'every', 'satisfiable', 'formula', 'has', 'a', 'model', 'of', 'at', 'most', 'doubly', 'exponential', 'size', 'we', 'argue', 'that', 'the', 'satisfiability', 'finite', 'satisfiability', 'problem', 'for', 'this', 'logic', 'is', 'twoexptimecomplete', 'we', 'also', 'transfer', 'our', 'results', 'to', 'a', 'restricted', 'variant', 'of', 'the', 'guarded', 'negation', 'fragment', 'with', 'equivalence', 'relations']] | [-0.11649801647879678, 0.10334964675694867, -0.0915529347888856, 0.16738129796948373, -0.1280960893729724, -0.1626058391867632, 0.06943092591701502, 0.36143422768597144, -0.357352990944623, -0.23758309527513494, 0.06631552832234786, -0.260517579065748, -0.11660571032798434, 0.15718981056440487, -0.09878886675150751, 0.06475406191283725, 0.04954057129335601, 0.09291122997381601, -0.07462987764906812, -0.22881622756382516, 0.3055018297065588, -0.04781788794032062, 0.1865194649603891, 0.04659697504332626, 0.07656903504898929, 0.050422706562711535, 0.08929068298382034, 0.109624663480075, -0.07893929578472947, 0.10116995564600206, 0.32459894192954863, 0.2543733063412, 0.28327031450413437, -0.40571102805552073, -0.15384195290831287, 0.1525505916271583, 0.11233259064246373, 0.1194286249530311, -0.03138677830087633, -0.23429626649307334, 0.1452366398669869, -0.26213974250951805, -0.06256551326936986, -0.06980543374925492, 0.07567426598215678, 0.013324929266629449, -0.24866736325693417, -0.04280331855007245, 0.2352242278081017, 0.044163423562310185, -0.055453733881901814, -0.05527501774345895, 0.044657278545088615, 0.01969781745763787, -0.02891900867408882, 0.004961901052619319, 0.04351025540872578, -0.07225075982236136, -0.17979504520084755, 0.3423087979745434, -0.0702239366427782, -0.2263037513728332, 0.12792811384957553, -0.13112988236573447, -0.24780245741313123, 0.08419332939413297, 0.0887234999899225, 0.1582246811117932, -0.09686289934149708, 0.14849063914538507, -0.1552975823294865, 0.2746469928849354, 0.1315132097666522, 0.03558676235422672, 0.17319739594037298, 0.17409124494676131, 0.049946552680395766, 0.25292410096714657, 0.011648754757570934, -0.09863747025738998, -0.33982555646763507, -0.1605818817947419, -0.08657628199904709, -0.015610969041934214, -0.0874729986100581, -0.19631632136921567, 0.3006571351763714, 0.18710434627130135, 0.15121441682890416, 0.23145718200003212, 0.25836275745721826, 0.19599808879331293, 0.13715883954820862, 0.036933513575900453, 0.14578318297975215, 0.1616506547812956, 0.01738642820953784, -0.19955721296684212, 0.1329709959934544, 0.11525784853666303] |
1,802.01319 | Test beam measurement of the first prototype of the fast silicon pixel
monolithic detector for the TT-PET project | The TT-PET collaboration is developing a PET scanner for small animals with
30 ps time-of-flight resolution and sub-millimetre 3D detection granularity.
The sensitive element of the scanner is a monolithic silicon pixel detector
based on state-of-the-art SiGe BiCMOS technology. The first ASIC prototype for
the TT-PET was produced and tested in the laboratory and with minimum ionizing
particles. The electronics exhibit an equivalent noise charge below 600 e- RMS
and a pulse rise time of less than 2 ns, in accordance with the simulations.
The pixels with a capacitance of 0.8 pF were measured to have a detection
efficiency greater than 99% and, although in the absence of the
post-processing, a time resolution of approximately 200 ps.
| physics.ins-det | the ttpet collaboration is developing a pet scanner for small animals with 30 ps timeofflight resolution and submillimetre 3d detection granularity the sensitive element of the scanner is a monolithic silicon pixel detector based on stateoftheart sige bicmos technology the first asic prototype for the ttpet was produced and tested in the laboratory and with minimum ionizing particles the electronics exhibit an equivalent noise charge below 600 e rms and a pulse rise time of less than 2 ns in accordance with the simulations the pixels with a capacitance of 08 pf were measured to have a detection efficiency greater than 99 and although in the absence of the postprocessing a time resolution of approximately 200 ps | [['the', 'ttpet', 'collaboration', 'is', 'developing', 'a', 'pet', 'scanner', 'for', 'small', 'animals', 'with', '30', 'ps', 'timeofflight', 'resolution', 'and', 'submillimetre', '3d', 'detection', 'granularity', 'the', 'sensitive', 'element', 'of', 'the', 'scanner', 'is', 'a', 'monolithic', 'silicon', 'pixel', 'detector', 'based', 'on', 'stateoftheart', 'sige', 'bicmos', 'technology', 'the', 'first', 'asic', 'prototype', 'for', 'the', 'ttpet', 'was', 'produced', 'and', 'tested', 'in', 'the', 'laboratory', 'and', 'with', 'minimum', 'ionizing', 'particles', 'the', 'electronics', 'exhibit', 'an', 'equivalent', 'noise', 'charge', 'below', '600', 'e', 'rms', 'and', 'a', 'pulse', 'rise', 'time', 'of', 'less', 'than', '2', 'ns', 'in', 'accordance', 'with', 'the', 'simulations', 'the', 'pixels', 'with', 'a', 'capacitance', 'of', '08', 'pf', 'were', 'measured', 'to', 'have', 'a', 'detection', 'efficiency', 'greater', 'than', '99', 'and', 'although', 'in', 'the', 'absence', 'of', 'the', 'postprocessing', 'a', 'time', 'resolution', 'of', 'approximately', '200', 'ps']] | [-0.03994587518365892, 0.14083299531067378, -0.026013175195649912, -0.010700259355666196, 0.036574347833495426, -0.16711782001201872, -0.019146667301411863, 0.4193057708826888, -0.14356938465295926, -0.4140062931641612, 0.08189797672827769, -0.3308773737259047, 0.015599646532665129, 0.22181063712493557, -0.04925173601216596, 0.0669899931339466, 0.08726619168630113, 0.017626626327957796, -0.07730309145687067, -0.17057800180400196, 0.16940451098565498, 0.17462897013224984, 0.30261485968594964, 0.03233027753885835, 0.18026095476892331, -0.05850178202330742, -0.04213074931226995, -2.5697368318619935e-05, -0.08188026273704094, 0.07710558210054169, 0.2481474050199208, 0.052871866746927086, 0.2212290338847948, -0.42544489144954994, -0.1652018184773624, 0.06843310534630133, 0.08605330371621835, 0.02057188178372124, -0.0879043073039097, -0.285614808290468, 0.16710123082865838, -0.17247195193422554, -0.08192542143894926, 0.0635164566155847, 0.024091690969046044, 0.01769807186463605, -0.22999766009895173, 0.06435309277199533, -0.007889795531619987, 0.09994533174144833, -0.05383799056644025, -0.1375012351807369, 0.012848644604420532, 0.05186500948469114, -0.08327570790728635, 0.07398662265066219, 0.2117479699542341, -0.13058887003597033, -0.10828986401143281, 0.34674055643541657, -0.052406127169050035, -0.13952975599500148, 0.1602379798246345, -0.18845569177166274, -0.010887327340795942, 0.245359676460857, 0.1224994087814475, 0.11500871813572619, -0.14873829594529842, -0.008947748559749807, 0.05513377827212579, 0.3057412824229054, 0.12775555495172738, 0.0446806090640957, 0.18012974755433592, 0.29964815923316485, 0.04402988296528549, 0.09776197852941391, -0.2463982114629091, -0.009695579383886703, -0.25342924017661617, -0.18089005829634794, -0.15068880898837486, 0.0665706174083702, -0.08279748460538584, -0.09845336940058548, 0.41280309332777626, 0.16083768490377975, 0.14650640408306018, 0.049603088694098206, 0.3222534638222145, 0.06975195750229708, 0.13976617097733138, -0.005409741031167948, 0.25968225145024126, 0.11112719078588745, 0.16302547518406874, -0.19349276571656052, 0.037587716855594644, -0.03216884200987608] |
1,802.0132 | Frequency identification and asteroseismic analysis of the red giant KIC
9145955: fundamental parameters and helium core size | We have analyzed 18 quarters of long-cadence data of KIC 9145955 provided by
\emph{Kepler}, and extracted 61 oscillation frequencies from these high
precision photometric data. The oscillation frequencies include 7 $l = 0$
modes, 44 $l = 1$ modes, 7 $l = 2$ modes, and 3 $l = 3$ modes. We identify $l =
0$ modes as p modes and $l = 2$ modes as p-dominated modes. For $l = 1$ modes,
all of them are identified as mixed modes. These mixed modes can be used to
determine the size of the helium core. We conduct a series of asteroseismic
models and the size of the helium core is determined to be $M_{\rm He}$ = 0.210
$\pm$ 0.002 $M_{\odot}$ and $R_{\rm He}$ = 0.0307 $\pm$ 0.0002 $R_{\odot}$.
Furthermore, we find that only the acoustic radius $\tau_{0}$ can be precisely
determined with the asteroseismic method independently. The value of $\tau_{0}$
is determined to be 0.494 $\pm$ 0.001 days. By combining asteroseismic results
and spectroscopic observations, we obtain the best-fitting model. The physical
parameters of this model are $M$ = 1.24 $M_{\odot}$, $Z$ = 0.009, $\alpha$ =
2.0, $T_{\rm eff}$ = 5069 K, $\log g$ = 3.029, $R$ = 5.636 $R_{\odot}$, and $L$
= 18.759 $L_{\odot}$. In addition, we think that the observed frequency F39
(96.397 $\mu$Hz) is more appropriate to be identified as a mixed mode of the
most p-dominated.
| astro-ph.SR | we have analyzed 18 quarters of longcadence data of kic 9145955 provided by emphkepler and extracted 61 oscillation frequencies from these high precision photometric data the oscillation frequencies include 7 l 0 modes 44 l 1 modes 7 l 2 modes and 3 l 3 modes we identify l 0 modes as p modes and l 2 modes as pdominated modes for l 1 modes all of them are identified as mixed modes these mixed modes can be used to determine the size of the helium core we conduct a series of asteroseismic models and the size of the helium core is determined to be m_rm he 0210 pm 0002 m_odot and r_rm he 00307 pm 00002 r_odot furthermore we find that only the acoustic radius tau_0 can be precisely determined with the asteroseismic method independently the value of tau_0 is determined to be 0494 pm 0001 days by combining asteroseismic results and spectroscopic observations we obtain the bestfitting model the physical parameters of this model are m 124 m_odot z 0009 alpha 20 t_rm eff 5069 k log g 3029 r 5636 r_odot and l 18759 l_odot in addition we think that the observed frequency f39 96397 muhz is more appropriate to be identified as a mixed mode of the most pdominated | [['we', 'have', 'analyzed', '18', 'quarters', 'of', 'longcadence', 'data', 'of', 'kic', '9145955', 'provided', 'by', 'emphkepler', 'and', 'extracted', '61', 'oscillation', 'frequencies', 'from', 'these', 'high', 'precision', 'photometric', 'data', 'the', 'oscillation', 'frequencies', 'include', '7', 'l', '0', 'modes', '44', 'l', '1', 'modes', '7', 'l', '2', 'modes', 'and', '3', 'l', '3', 'modes', 'we', 'identify', 'l', '0', 'modes', 'as', 'p', 'modes', 'and', 'l', '2', 'modes', 'as', 'pdominated', 'modes', 'for', 'l', '1', 'modes', 'all', 'of', 'them', 'are', 'identified', 'as', 'mixed', 'modes', 'these', 'mixed', 'modes', 'can', 'be', 'used', 'to', 'determine', 'the', 'size', 'of', 'the', 'helium', 'core', 'we', 'conduct', 'a', 'series', 'of', 'asteroseismic', 'models', 'and', 'the', 'size', 'of', 'the', 'helium', 'core', 'is', 'determined', 'to', 'be', 'm_rm', 'he', '0210', 'pm', '0002', 'm_odot', 'and', 'r_rm', 'he', '00307', 'pm', '00002', 'r_odot', 'furthermore', 'we', 'find', 'that', 'only', 'the', 'acoustic', 'radius', 'tau_0', 'can', 'be', 'precisely', 'determined', 'with', 'the', 'asteroseismic', 'method', 'independently', 'the', 'value', 'of', 'tau_0', 'is', 'determined', 'to', 'be', '0494', 'pm', '0001', 'days', 'by', 'combining', 'asteroseismic', 'results', 'and', 'spectroscopic', 'observations', 'we', 'obtain', 'the', 'bestfitting', 'model', 'the', 'physical', 'parameters', 'of', 'this', 'model', 'are', 'm', '124', 'm_odot', 'z', '0009', 'alpha', '20', 't_rm', 'eff', '5069', 'k', 'log', 'g', '3029', 'r', '5636', 'r_odot', 'and', 'l', '18759', 'l_odot', 'in', 'addition', 'we', 'think', 'that', 'the', 'observed', 'frequency', 'f39', '96397', 'muhz', 'is', 'more', 'appropriate', 'to', 'be', 'identified', 'as', 'a', 'mixed', 'mode', 'of', 'the', 'most', 'pdominated']] | [-0.12773596421054495, 0.2215951400709611, -0.04779879436828196, 0.042149758967003084, -0.06469564812893912, -0.16973815347272447, 0.07810027627231803, 0.3440117683352494, -0.1995602958375679, -0.37731573635303395, 0.10017469518579451, -0.34047468231945505, 0.008293842343704366, 0.20608300455709602, -0.004859135220417889, 0.00531208048029462, 0.07389426202649568, -0.004915237682303641, -0.02614002719566953, -0.19579657465219497, 0.20588765485303068, 0.004084599106686145, 0.15138685408093763, -0.06852803801345389, -0.008226130111426934, -0.09006030303312511, -0.03993836375487196, -0.05356586591806263, -0.26619865403023674, -0.0028250469894307417, 0.2591846039753852, 0.13061884988281058, 0.20656937171773213, -0.2909198802327964, -0.15106228406245753, 0.06474728247877665, 0.19460955949432057, -0.00025225248324071487, 0.08979304231690505, -0.23262523040402588, 0.13034576945750947, -0.15042711389705357, -0.14296466688534654, -0.014070782496980051, 0.1353859848092969, -0.025292553181373856, -0.2968766046915112, 0.14301075978976924, 0.014980292501972943, 0.12769683785963712, -0.0827353509529153, -0.22883692351964915, -0.10153541141984666, 0.06961356614511914, 0.030493386435072597, 0.08756985785893914, 0.10019367493961642, 0.006122407463674501, -0.011454361682280716, 0.36285454114081295, -0.12333239037429959, -0.065172584701426, 0.1326976998550136, -0.16088863124662056, -0.10640642314002191, 0.1178676447195069, 0.13186521894957234, 0.1239397404988001, -0.08743143706957288, 0.027070107792856218, 0.030844167471727038, 0.26693111404140546, 0.09709515706068132, 0.04178580855269257, 0.24742005707067152, 0.11144698321160565, -0.029661482092129383, -0.0019090169222980011, -0.21224250999157226, 0.09500068052921717, -0.2884273185144837, -0.07568745810038796, -0.13803292152162347, 0.07446238843769562, -0.14043509548752875, -0.03909382627050324, 0.3427531288709582, 0.09778131026229481, 0.24968812358565629, 0.06433882393828798, 0.22422665722395588, 0.11804664697520799, 0.08167822878557916, 0.12096650142608802, 0.2866960161524575, 0.20581249894756007, 0.04561969765075823, -0.25293614345875276, -0.05451494495089098, 0.0012359581978582754] |
1,802.01321 | Simulation of multiphase porous media flows with minimizing movement and
finite volume schemes | The Wasserstein gradient flow structure of the PDE system governing
multiphase flows in porous media was recently highlighted in [C. Canc\`es, T.
O. Gallou\"et, and L. Monsaingeon, {\it Anal. PDE} 10(8):1845--1876, 2017]. The
model can thus be approximated by means of the minimizing movement (or JKO)
scheme, that we solve thanks to the ALG2-JKO scheme proposed in [J.-D. Benamou,
G. Carlier, and M. Laborde, {\it ESAIM Proc. Surveys}, 57:1--17, 2016]. The
numerical results are compared to a classical upstream mobility Finite Volume
scheme, for which strong stability properties can be established.
| math.NA math.AP | the wasserstein gradient flow structure of the pde system governing multiphase flows in porous media was recently highlighted in c cances t o gallouet and l monsaingeon it anal pde 10818451876 2017 the model can thus be approximated by means of the minimizing movement or jko scheme that we solve thanks to the alg2jko scheme proposed in jd benamou g carlier and m laborde it esaim proc surveys 57117 2016 the numerical results are compared to a classical upstream mobility finite volume scheme for which strong stability properties can be established | [['the', 'wasserstein', 'gradient', 'flow', 'structure', 'of', 'the', 'pde', 'system', 'governing', 'multiphase', 'flows', 'in', 'porous', 'media', 'was', 'recently', 'highlighted', 'in', 'c', 'cances', 't', 'o', 'gallouet', 'and', 'l', 'monsaingeon', 'it', 'anal', 'pde', '10818451876', '2017', 'the', 'model', 'can', 'thus', 'be', 'approximated', 'by', 'means', 'of', 'the', 'minimizing', 'movement', 'or', 'jko', 'scheme', 'that', 'we', 'solve', 'thanks', 'to', 'the', 'alg2jko', 'scheme', 'proposed', 'in', 'jd', 'benamou', 'g', 'carlier', 'and', 'm', 'laborde', 'it', 'esaim', 'proc', 'surveys', '57117', '2016', 'the', 'numerical', 'results', 'are', 'compared', 'to', 'a', 'classical', 'upstream', 'mobility', 'finite', 'volume', 'scheme', 'for', 'which', 'strong', 'stability', 'properties', 'can', 'be', 'established']] | [-0.10466919059568723, 0.027881920288945008, -0.08785369073928789, -0.001846240048275091, -0.06326370610487322, -0.14146546713553024, 0.024282905603434112, 0.35764690497240353, -0.31105464059036486, -0.3091842842634854, 0.11170121652972993, -0.2696086993484303, -0.1619779669360236, 0.18642728477120832, -0.10398100913220713, 0.0884507182162515, 0.03726415838342333, -0.08450625375248925, -0.015791669247000543, -0.27985022889536826, 0.2159150407465478, 0.06667279118542062, 0.2707172050194945, 0.04769443044016614, 0.11202343839740511, -0.04481594591823861, -0.04648021781318929, 0.08081892599503315, -0.15385319302063286, 0.07534574168506837, 0.24427168223963575, 0.04837232124233662, 0.28990885123967863, -0.3687001138947211, -0.27777418855653513, 0.05141156341144165, 0.08453694194403671, 0.0452199358828799, 0.003939016803362688, -0.3260341332034143, 0.11891017828223317, -0.1725346825090995, -0.12740113297314926, -0.07662304060880182, 0.05964727886021137, 0.06098962648836679, -0.29290661551288416, 0.11785850540713169, 0.08360295632290979, 0.03241572891860161, -0.04264370124884556, -0.09216034264969748, -0.07141848112088303, 0.04580334971556007, -0.008400352391533467, 0.059104401426021615, 0.06754109533070478, -0.06788209074198506, -0.0740695503962681, 0.3755914299034102, -0.08464829323997418, -0.18700442136113726, 0.18363042238579932, -0.07413660813675284, -0.058766083115018734, 0.1379497101053942, 0.20687031001935519, 0.15302178353818438, -0.1629001413110568, 0.13943244332074037, -0.08153462579722928, 0.11772937382852962, 0.08942839635947589, -0.08001517643069112, 0.05600357813717321, 0.1410189177529605, 0.10231767544999372, 0.045755605207252595, -0.04029515980970288, -0.1037487721011086, -0.2612398425685675, -0.17926504405561922, -0.1638470985385221, 0.052564216953658954, -0.058583724180840194, -0.0791757284382055, 0.2920398356594422, 0.10276964759700498, 0.15453341728899367, -0.010234689501081702, 0.21094046349821308, 0.12874686604279073, 0.004201553631330256, 0.18857598284172805, 0.2236352520994842, 0.19911474719654423, 0.1720526811645128, -0.24600010208763876, 0.044191513735757665, 0.1921543309053536] |
1,802.01322 | Poincare function for moduli of differential-geometric structures | The Poincare function is a compact form of counting moduli in local geometric
problems. We discuss its property in relation to V.Arnold's conjecture, and
derive this conjecture in the case when the pseudogroup acts algebraically and
transitively on the base. Then we survey the known counting results for
differential invariants and derive new formulae for several other
classification problems in geometry and analysis.
| math.DG | the poincare function is a compact form of counting moduli in local geometric problems we discuss its property in relation to varnolds conjecture and derive this conjecture in the case when the pseudogroup acts algebraically and transitively on the base then we survey the known counting results for differential invariants and derive new formulae for several other classification problems in geometry and analysis | [['the', 'poincare', 'function', 'is', 'a', 'compact', 'form', 'of', 'counting', 'moduli', 'in', 'local', 'geometric', 'problems', 'we', 'discuss', 'its', 'property', 'in', 'relation', 'to', 'varnolds', 'conjecture', 'and', 'derive', 'this', 'conjecture', 'in', 'the', 'case', 'when', 'the', 'pseudogroup', 'acts', 'algebraically', 'and', 'transitively', 'on', 'the', 'base', 'then', 'we', 'survey', 'the', 'known', 'counting', 'results', 'for', 'differential', 'invariants', 'and', 'derive', 'new', 'formulae', 'for', 'several', 'other', 'classification', 'problems', 'in', 'geometry', 'and', 'analysis']] | [-0.1524987899427933, 0.022616517589819023, -0.12663881716528727, 0.09786937616938245, -0.13463586130209507, -0.11895714728762546, 0.010038226542453612, 0.30878257859618435, -0.3049382949473276, -0.28674256971346274, 0.13060711514234782, -0.254036690784438, -0.19360106516509287, 0.26460871095168254, -0.11726668370406955, 0.010129510732029655, 0.007131609130620716, 0.07825404210316558, -0.11615322366537105, -0.2957876531948005, 0.3735653560969137, -0.051060767468786045, 0.2630071267673385, 0.10209967308835458, 0.08952804672862252, 0.05022179744311518, -0.06652089627459645, 0.0023124878324808614, -0.1774834194070389, 0.10827582901824385, 0.26120812780854685, 0.1403979152185662, 0.17005545961400192, -0.3894506637908278, -0.13478139557334926, 0.13483626104237872, 0.12709982244057522, 0.07729923490795397, -0.03467547914366268, -0.2603238256490459, 0.1123004496518162, -0.11969351679867794, -0.19974693774636235, -0.08133118596648978, 0.050745682978642084, 0.02645311853097331, -0.2109659382352425, 0.031366227908180125, 0.10028458461766282, 0.08064644906910197, -0.10859323543263599, -0.06090889895154584, 0.0007618267780109759, 0.09801386119356574, 0.018477621920136435, 0.0012510624008193131, 0.08309804992149433, -0.15000284778239625, -0.11122804482264685, 0.36575958853767765, -0.059345517885841186, -0.26352750543399805, 0.12916400110078674, -0.13772877573125786, -0.22249122859249193, 0.046470644119601216, 0.16086675387416635, 0.1958014636916379, -0.08684579428447778, 0.15058356476572132, -0.10665663364042918, 0.06603904576191018, 0.07743397373105249, 0.01672662440086565, 0.11284386661023862, 0.09172145287401133, 0.11008836699259136, 0.188603551529776, -0.052484973029594026, -0.07363649011559543, -0.3654382783288677, -0.18517345647447772, -0.09657521359622478, 0.09013248310281685, -0.10712280420252242, -0.16732585581860715, 0.3575118742695439, 0.07049988811054538, 0.1972245098609898, 0.13612932151168464, 0.2528853623136397, 0.11522236200154669, 0.03037145015062584, 0.052814188871472594, 0.17787647445596033, 0.21803587800147192, 0.010669666495232377, -0.16519587335830194, -0.017872560371254242, 0.19447109641717567] |
1,802.01323 | Using mixed many-body particle states to generate exact
$\mathcal{PT}$-symmetry in a time-dependent four-well system | Bose-Einstein condensates with balanced gain and loss in a double-well
potential have been shown to exhibit PT-symmetric states. As proposed by
Kreibich et al [Phys. Rev. A 87, 051601(R) (2013)], in the mean-field limit the
dynamical behaviour of this system, especially that of the PT-symmetric states,
can be simulated by embedding it into a Hermitian four-well system with
time-dependent parameters. In this paper we go beyond the mean-field
approximation and investigate many-body effects in this system, which are in
lowest order described by the single-particle density matrix. The conditions
for PT symmetry in the single-particle density matrix cannot be completely
fulfilled by using pure initial states. Here we show that it is mathematically
possible to achieve exact PT symmetry in the four-well many-body system in the
sense of the dynamical behaviour of the single-particle density matrix. In
contrast to previous work, for this purpose, we use mixed initial states
fulfilling certain constraints and use them to calculate the dynamics.
| quant-ph cond-mat.quant-gas nlin.CD | boseeinstein condensates with balanced gain and loss in a doublewell potential have been shown to exhibit ptsymmetric states as proposed by kreibich et al phys rev a 87 051601r 2013 in the meanfield limit the dynamical behaviour of this system especially that of the ptsymmetric states can be simulated by embedding it into a hermitian fourwell system with timedependent parameters in this paper we go beyond the meanfield approximation and investigate manybody effects in this system which are in lowest order described by the singleparticle density matrix the conditions for pt symmetry in the singleparticle density matrix cannot be completely fulfilled by using pure initial states here we show that it is mathematically possible to achieve exact pt symmetry in the fourwell manybody system in the sense of the dynamical behaviour of the singleparticle density matrix in contrast to previous work for this purpose we use mixed initial states fulfilling certain constraints and use them to calculate the dynamics | [['boseeinstein', 'condensates', 'with', 'balanced', 'gain', 'and', 'loss', 'in', 'a', 'doublewell', 'potential', 'have', 'been', 'shown', 'to', 'exhibit', 'ptsymmetric', 'states', 'as', 'proposed', 'by', 'kreibich', 'et', 'al', 'phys', 'rev', 'a', '87', '051601r', '2013', 'in', 'the', 'meanfield', 'limit', 'the', 'dynamical', 'behaviour', 'of', 'this', 'system', 'especially', 'that', 'of', 'the', 'ptsymmetric', 'states', 'can', 'be', 'simulated', 'by', 'embedding', 'it', 'into', 'a', 'hermitian', 'fourwell', 'system', 'with', 'timedependent', 'parameters', 'in', 'this', 'paper', 'we', 'go', 'beyond', 'the', 'meanfield', 'approximation', 'and', 'investigate', 'manybody', 'effects', 'in', 'this', 'system', 'which', 'are', 'in', 'lowest', 'order', 'described', 'by', 'the', 'singleparticle', 'density', 'matrix', 'the', 'conditions', 'for', 'pt', 'symmetry', 'in', 'the', 'singleparticle', 'density', 'matrix', 'can', 'not', 'be', 'completely', 'fulfilled', 'by', 'using', 'pure', 'initial', 'states', 'here', 'we', 'show', 'that', 'it', 'is', 'mathematically', 'possible', 'to', 'achieve', 'exact', 'pt', 'symmetry', 'in', 'the', 'fourwell', 'manybody', 'system', 'in', 'the', 'sense', 'of', 'the', 'dynamical', 'behaviour', 'of', 'the', 'singleparticle', 'density', 'matrix', 'in', 'contrast', 'to', 'previous', 'work', 'for', 'this', 'purpose', 'we', 'use', 'mixed', 'initial', 'states', 'fulfilling', 'certain', 'constraints', 'and', 'use', 'them', 'to', 'calculate', 'the', 'dynamics']] | [-0.08858652638912834, 0.14253196262596352, -0.10115777166068272, 0.03753597972989258, 0.019968494878343818, -0.11784670694508596, 0.027587063532211357, 0.34864330811297184, -0.20873014064529125, -0.29230353682530374, 0.03823289240244776, -0.25186495868336856, -0.19412204716354609, 0.09441097329353106, -0.03384570928536496, 0.11023831518027205, 0.03799128875651824, -0.010237914823440823, -0.10572212833198046, -0.24684902186265345, 0.32118490421500223, 0.03461629769665265, 0.25636614274245295, 0.05641995134555483, 0.03167883669898945, 0.028686558376739984, 0.0944642657223714, 0.019848739291957154, -0.129578900096353, 0.04273317256684667, 0.2462754930770786, 0.06112359521424386, 0.23675874695650437, -0.4491949608291751, -0.24191650000851858, 0.10342901750063559, 0.1344354786710966, 0.16597268908392965, -0.01622529919024955, -0.326810158431858, 0.04823113077191296, -0.23141693098927443, -0.18455674125591098, -0.1413069188407382, 0.041220447033901444, 0.01093174228093253, -0.2788270367338738, 0.1070768840423545, 0.05337265846224314, 0.01998897175064439, -0.04400541284853745, -0.07165317488072803, -0.029824752634414618, 0.05437016312132514, -0.03902907672363082, -0.00601633752069477, 0.08848757969373662, -0.10095962602059422, -0.0813335384917299, 0.3737136086613034, -0.07490878660779493, -0.22185263232146418, 0.1852807180030541, -0.143369331049481, -0.10648727141988445, 0.10654182067878966, 0.14608221090510018, 0.09808421576009044, -0.17122950087119854, 0.12146802638323703, -0.047980051533811074, 0.1501580625567468, 0.054143432600997715, 0.057507546170125566, 0.16014270411669598, 0.13671223502518293, 0.03897856233850906, 0.13766823464026381, -0.015922329830973695, -0.15938531350690005, -0.26751907151953885, -0.12992926503886007, -0.23421291414349568, 0.06899537083573139, 0.01802927383055849, -0.13118994848728735, 0.41445613782501445, 0.15955525402963724, 0.21507189139934643, 0.00495794932899774, 0.22494436384606287, 0.1844409133517037, 0.01916470510721113, 0.06875146063243819, 0.289999483200083, 0.15281303535484997, 0.09084959563641053, -0.2670268734767682, 0.0006700614247611671, 0.055363742504327455] |
1,802.01324 | A study on downward half Cauchy sequences | In this paper, we introduce and investigate the concepts of down continuity
and down compactness. A real valued function $f$ on a subset $E$ of $\R$, the
set of real numbers is down continuous if it preserves downward half Cauchy
sequences, i.e. the sequence $(f(\alpha_{n}))$ is downward half Cauchy whenever
$(\alpha_{n})$ is a downward half Cauchy sequence of points in $E$, where a
sequence $(\alpha_{ k})$ of points in $\R$ is called downward half Cauchy if
for every $\varepsilon>0$ there exists an $n_{0}\in{\N}$ such that
$\alpha_{m}-\alpha_{n} <\varepsilon$ for $m \geq n \geq n_0$. It turns out that
the set of down continuous functions is a proper subset of the set of
continuous functions.
| math.FA | in this paper we introduce and investigate the concepts of down continuity and down compactness a real valued function f on a subset e of r the set of real numbers is down continuous if it preserves downward half cauchy sequences ie the sequence falpha_n is downward half cauchy whenever alpha_n is a downward half cauchy sequence of points in e where a sequence alpha_ k of points in r is called downward half cauchy if for every varepsilon0 there exists an n_0inn such that alpha_malpha_n varepsilon for m geq n geq n_0 it turns out that the set of down continuous functions is a proper subset of the set of continuous functions | [['in', 'this', 'paper', 'we', 'introduce', 'and', 'investigate', 'the', 'concepts', 'of', 'down', 'continuity', 'and', 'down', 'compactness', 'a', 'real', 'valued', 'function', 'f', 'on', 'a', 'subset', 'e', 'of', 'r', 'the', 'set', 'of', 'real', 'numbers', 'is', 'down', 'continuous', 'if', 'it', 'preserves', 'downward', 'half', 'cauchy', 'sequences', 'ie', 'the', 'sequence', 'falpha_n', 'is', 'downward', 'half', 'cauchy', 'whenever', 'alpha_n', 'is', 'a', 'downward', 'half', 'cauchy', 'sequence', 'of', 'points', 'in', 'e', 'where', 'a', 'sequence', 'alpha_', 'k', 'of', 'points', 'in', 'r', 'is', 'called', 'downward', 'half', 'cauchy', 'if', 'for', 'every', 'varepsilon0', 'there', 'exists', 'an', 'n_0inn', 'such', 'that', 'alpha_malpha_n', 'varepsilon', 'for', 'm', 'geq', 'n', 'geq', 'n_0', 'it', 'turns', 'out', 'that', 'the', 'set', 'of', 'down', 'continuous', 'functions', 'is', 'a', 'proper', 'subset', 'of', 'the', 'set', 'of', 'continuous', 'functions']] | [-0.18651451796970583, 0.1534171421050401, -0.04504206913036548, 0.03802127559161322, -0.03921145082620735, -0.0938806514086371, 0.0944526903288947, 0.3440091135488315, -0.33132702655751595, -0.18284858016466551, 0.10574545222863724, -0.33705674906007266, -0.10452823538375511, 0.18459301851478152, -0.04492274529025467, 0.017754827963653953, 0.04676932938904925, 0.09404484416273508, -0.07124648506922478, -0.21709700887811118, 0.33664730252190067, -0.12313551164486192, 0.16673462449318982, 0.004178714667531577, 0.14301694361492992, 0.006144874737682667, 0.011323669599369169, 0.010246413675221529, -0.15660804919541327, 0.02416725361042402, 0.2141047901389274, 0.15980879152616995, 0.38926330943676557, -0.32476107806935695, -0.13099372666329145, 0.23571059469832106, 0.1311976716091687, -0.05215009431651031, 0.004496406893965534, -0.1981351407922127, 0.20703645967031745, -0.0682944580076847, -0.15246811193117701, -0.033252708076245405, 0.17573216066441752, 0.03131589066575874, -0.30929466213353657, 0.026320611947978086, 0.1319022354415872, 0.07072899245064367, -0.04002276383742521, -0.11200002178719098, -0.0736987099580636, 0.07362646913071248, 0.021721905924972484, 0.14886378955350005, 0.04214526312796145, -0.05488293828146363, -0.005638153275305574, 0.3793744470924139, -0.06646051351510157, -0.24067964068698613, 0.0866096848600798, -0.213658632397313, -0.12068864678625356, 0.15458571516316044, 0.08216183697804809, 0.17097346024079757, -0.0656771120784635, 0.2121006858736192, -0.13401048857115463, 0.20018955160101706, 0.11753354515372352, -0.04451979113404046, 0.20420433419798925, 0.13319218484684825, 0.18090345452285625, 0.1197337265020575, -0.04366342303216119, -0.009659904042597521, -0.4012778111479499, -0.18094165651974353, -0.20674493599005722, 0.15360469663177023, -0.10735293255923105, -0.21669264056465842, 0.32977904071925546, 0.08616860908117484, 0.22738357155837796, 0.12335515206002376, 0.20703753497430377, 0.14817669917974854, -0.008171079073905607, 0.12483500022102487, 0.06508528690319508, 0.09385692474051294, 0.053375520823862065, -0.12377414619973437, 0.014473127345131202, 0.11225795602764596] |
1,802.01325 | Optimal bounds on codes for location in circulant graphs | Identifying and locating-dominating codes have been studied widely in
circulant graphs of type $C_n(1,2,3,\dots, r)$ over the recent years. In 2013,
Ghebleh and Niepel studied locating-dominating and identifying codes in the
circulant graphs $C_n(1,d)$ for $d=3$ and proposed as an open question the case
of $d > 3$. In this paper we study identifying, locating-dominating and
self-identifying codes in the graphs $C_n(1,d)$, $C_n(1,d-1,d)$ and
$C_n(1,d-1,d,d+1)$. We give a new method to study lower bounds for these three
codes in the circulant graphs using suitable grids. Moreover, we show that
these bounds are attained for infinitely many parameters $n$ and $d$. In
addition, new approaches are provided which give the exact values for the
optimal self-identifying codes in $C_n(1,3)$ and $C_n(1,4).$
| cs.DM math.CO | identifying and locatingdominating codes have been studied widely in circulant graphs of type c_n123dots r over the recent years in 2013 ghebleh and niepel studied locatingdominating and identifying codes in the circulant graphs c_n1d for d3 and proposed as an open question the case of d 3 in this paper we study identifying locatingdominating and selfidentifying codes in the graphs c_n1d c_n1d1d and c_n1d1dd1 we give a new method to study lower bounds for these three codes in the circulant graphs using suitable grids moreover we show that these bounds are attained for infinitely many parameters n and d in addition new approaches are provided which give the exact values for the optimal selfidentifying codes in c_n13 and c_n14 | [['identifying', 'and', 'locatingdominating', 'codes', 'have', 'been', 'studied', 'widely', 'in', 'circulant', 'graphs', 'of', 'type', 'c_n123dots', 'r', 'over', 'the', 'recent', 'years', 'in', '2013', 'ghebleh', 'and', 'niepel', 'studied', 'locatingdominating', 'and', 'identifying', 'codes', 'in', 'the', 'circulant', 'graphs', 'c_n1d', 'for', 'd3', 'and', 'proposed', 'as', 'an', 'open', 'question', 'the', 'case', 'of', 'd', '3', 'in', 'this', 'paper', 'we', 'study', 'identifying', 'locatingdominating', 'and', 'selfidentifying', 'codes', 'in', 'the', 'graphs', 'c_n1d', 'c_n1d1d', 'and', 'c_n1d1dd1', 'we', 'give', 'a', 'new', 'method', 'to', 'study', 'lower', 'bounds', 'for', 'these', 'three', 'codes', 'in', 'the', 'circulant', 'graphs', 'using', 'suitable', 'grids', 'moreover', 'we', 'show', 'that', 'these', 'bounds', 'are', 'attained', 'for', 'infinitely', 'many', 'parameters', 'n', 'and', 'd', 'in', 'addition', 'new', 'approaches', 'are', 'provided', 'which', 'give', 'the', 'exact', 'values', 'for', 'the', 'optimal', 'selfidentifying', 'codes', 'in', 'c_n13', 'and', 'c_n14']] | [-0.14918786377083879, 0.07658379215042858, 0.007287493260862591, 0.09044777240650309, 0.026117693246887612, -0.18757534481434002, -0.0015283417793594905, 0.39267251046525464, -0.2439909401676945, -0.3301762626380534, 0.16354631434975042, -0.2669233718366773, -0.16745900626395, 0.2325298725207848, -0.0780384318886308, 0.10455241940639229, 0.08663294984547941, 0.03880386863340129, -0.06763178973274121, -0.34262629165439995, 0.31841240249372815, 0.06441266663154369, 0.1908141708563644, 0.08256681699322553, 0.03509680792555079, -0.014883557307273821, -0.06064484263392719, 0.039244247403264314, -0.23560660011755136, 0.1388580366268519, 0.29620403978294013, 0.16638836256849268, 0.2034631592498438, -0.376015655780295, -0.20561073498112392, 0.15282989858842647, 0.15283025326291183, 0.12121987059137675, -0.0486955058358207, -0.20606255845737284, 0.15275432343116482, -0.15149820907259579, -0.04529964313255035, -0.05640713399095746, 0.10344899469264993, 0.02396248162279392, -0.29837915329849934, -0.02558905315828753, 0.09196775672571347, 0.08297133551457443, -0.009539415816533135, -0.2031720800593764, 0.07401292132599666, 0.13292830103907632, -0.0053525794431701435, -0.004183541729559636, -0.061064124610778446, -0.07897839969368065, -0.17544513809503065, 0.31777187076875485, -0.005810009869369301, -0.18067612806083383, 0.14359264907129277, -0.09664912070441353, -0.20553196514411284, 0.05492729195897039, 0.20193005497525404, 0.18278421740978956, -0.12402486453789312, 0.14375360490468977, -0.09650230735775318, 0.07247753107714727, 0.11825932409647885, 0.06000689529973242, 0.08745504116958326, 0.09328594672921542, 0.06589155746277774, 0.1692539570215452, -0.032123973442090524, -0.028711339857362142, -0.2338668478166198, -0.11930831123525193, -0.1759736272716173, -0.0016536161299325056, -0.14390838029479758, -0.18226485687459038, 0.43265558530886966, 0.14184049262270867, 0.162298052345176, 0.06942389291388125, 0.18466179364209845, 0.0005195354361103864, 0.054980827336040164, 0.23035903102172925, 0.18261818504296579, 0.17851336382597954, -0.003283739984580861, -0.14149150473845973, 0.020126001823374682, 0.11896484292338828] |
1,802.01326 | Beyond-PFA Casimir Force between two spheres at finite temperature | A recent experiment [J.L. Garrett et al., Phys. Rev. Lett {\bf 120}, 040401
(2018)] measured for the first time the gradient of the Casimir force between
two gold spheres at room temperature. The theoretical analysis of the data was
carried out using the standard Proximity Force Approximation (PFA). A fit of
the data, using a parametrization of the force valid for the sphere-plate
geometry, was used by the authors to place a bound on deviations from PFA.
Motivated by this work, we compute the Casimir force between two gold spheres
at finite temperature. The semi-analytic formula for the Casimir force that we
construct is valid for all separations, and can be easily used to interpret
future experiments in both the sphere-plate and sphere-sphere configurations.
We describe the correct parametrization of the corrections to PFA for two
spheres that should be used in data analysis.
| quant-ph | a recent experiment jl garrett et al phys rev lett bf 120 040401 2018 measured for the first time the gradient of the casimir force between two gold spheres at room temperature the theoretical analysis of the data was carried out using the standard proximity force approximation pfa a fit of the data using a parametrization of the force valid for the sphereplate geometry was used by the authors to place a bound on deviations from pfa motivated by this work we compute the casimir force between two gold spheres at finite temperature the semianalytic formula for the casimir force that we construct is valid for all separations and can be easily used to interpret future experiments in both the sphereplate and spheresphere configurations we describe the correct parametrization of the corrections to pfa for two spheres that should be used in data analysis | [['a', 'recent', 'experiment', 'jl', 'garrett', 'et', 'al', 'phys', 'rev', 'lett', 'bf', '120', '040401', '2018', 'measured', 'for', 'the', 'first', 'time', 'the', 'gradient', 'of', 'the', 'casimir', 'force', 'between', 'two', 'gold', 'spheres', 'at', 'room', 'temperature', 'the', 'theoretical', 'analysis', 'of', 'the', 'data', 'was', 'carried', 'out', 'using', 'the', 'standard', 'proximity', 'force', 'approximation', 'pfa', 'a', 'fit', 'of', 'the', 'data', 'using', 'a', 'parametrization', 'of', 'the', 'force', 'valid', 'for', 'the', 'sphereplate', 'geometry', 'was', 'used', 'by', 'the', 'authors', 'to', 'place', 'a', 'bound', 'on', 'deviations', 'from', 'pfa', 'motivated', 'by', 'this', 'work', 'we', 'compute', 'the', 'casimir', 'force', 'between', 'two', 'gold', 'spheres', 'at', 'finite', 'temperature', 'the', 'semianalytic', 'formula', 'for', 'the', 'casimir', 'force', 'that', 'we', 'construct', 'is', 'valid', 'for', 'all', 'separations', 'and', 'can', 'be', 'easily', 'used', 'to', 'interpret', 'future', 'experiments', 'in', 'both', 'the', 'sphereplate', 'and', 'spheresphere', 'configurations', 'we', 'describe', 'the', 'correct', 'parametrization', 'of', 'the', 'corrections', 'to', 'pfa', 'for', 'two', 'spheres', 'that', 'should', 'be', 'used', 'in', 'data', 'analysis']] | [-0.07846327330076343, 0.07403597312966465, -0.14336843089970192, 0.042307264391436346, -0.05200612429406545, -0.09246375534631726, 0.05018801725236699, 0.34205571085395703, -0.18384930146728745, -0.3256254736366423, 0.002261409644334991, -0.30403455971584964, -0.11309135907665929, 0.2587274945496271, -0.01893335482519534, 0.07069717213744298, 0.012033552077708818, -0.02497264519075139, -0.060471994019786104, -0.23777436147469821, 0.25251271773595363, 0.10247221687879776, 0.28065583963568014, 0.10722561569936159, 0.06802094588622115, 0.026771148886635072, -0.00725623074039403, 0.06467041346089293, -0.20411138943776072, 0.07699075867680626, 0.22641178215821534, 0.011811167858670361, 0.19555686200813702, -0.4481962473364547, -0.17783182996532154, 0.09099967853398994, 0.03024371091224667, 0.14536310330731794, -0.005720282928248505, -0.28360246040392667, 0.04604918884150619, -0.18719870312553313, -0.12471497870541902, -0.10590345671193467, 0.07106315515314539, -0.020982531196851697, -0.2865033323832904, 0.100715270183476, 0.05008584081224399, 0.06415242369985208, -0.047005099231480725, -0.10970044233060132, 0.040361494323911354, 0.10254682579478766, 0.021931698550664198, 0.0645782900780129, 0.14360099940515486, -0.0275525933555198, -0.10411705406537901, 0.3662943716885315, -0.0980210612033261, -0.16767457575770095, 0.19502560695400462, -0.11479801079258323, -0.08217869429629193, 0.0808381838659342, 0.15501383558148518, 0.11597355972238195, -0.19263819645210686, 0.10900031303349857, -0.03504284064143172, 0.14533874025477822, 0.15268152158953147, -0.11744130242408977, 0.18174473193034324, 0.11230162487643408, -0.017301643783058453, 0.11764241009061355, -0.13200328775888515, -0.07974625463126965, -0.33990603360062877, -0.14531844985200829, -0.23302423161658226, 0.009298021350534529, -0.048073665470332747, -0.11765228028848974, 0.3078978574032792, 0.17055814996193577, 0.21100584101966685, 0.044739889200880296, 0.2919209044517225, 0.06124547610913093, 0.06510837369488501, 0.06497587888022988, 0.33993154659401625, 0.13702976377357523, 0.09052129007694829, -0.20570665086011608, -0.00673823010017966, 0.09138475529875399] |
1,802.01327 | Voltage-Controlled Superconducting Quantum Bus | We demonstrate the ability of an epitaxial semiconductor-superconductor
nanowire to serve as a field-effect switch to tune a superconducting cavity.
Two superconducting gatemon qubits are coupled to the cavity, which acts as a
quantum bus. Using a gate voltage to control the superconducting switch yields
up to a factor of 8 change in qubit-qubit coupling between the on and off
states without detrimental effect on qubit coherence. High-bandwidth operation
of the coupling switch on nanosecond timescales degrades qubit coherence.
| cond-mat.mes-hall cond-mat.supr-con quant-ph | we demonstrate the ability of an epitaxial semiconductorsuperconductor nanowire to serve as a fieldeffect switch to tune a superconducting cavity two superconducting gatemon qubits are coupled to the cavity which acts as a quantum bus using a gate voltage to control the superconducting switch yields up to a factor of 8 change in qubitqubit coupling between the on and off states without detrimental effect on qubit coherence highbandwidth operation of the coupling switch on nanosecond timescales degrades qubit coherence | [['we', 'demonstrate', 'the', 'ability', 'of', 'an', 'epitaxial', 'semiconductorsuperconductor', 'nanowire', 'to', 'serve', 'as', 'a', 'fieldeffect', 'switch', 'to', 'tune', 'a', 'superconducting', 'cavity', 'two', 'superconducting', 'gatemon', 'qubits', 'are', 'coupled', 'to', 'the', 'cavity', 'which', 'acts', 'as', 'a', 'quantum', 'bus', 'using', 'a', 'gate', 'voltage', 'to', 'control', 'the', 'superconducting', 'switch', 'yields', 'up', 'to', 'a', 'factor', 'of', '8', 'change', 'in', 'qubitqubit', 'coupling', 'between', 'the', 'on', 'and', 'off', 'states', 'without', 'detrimental', 'effect', 'on', 'qubit', 'coherence', 'highbandwidth', 'operation', 'of', 'the', 'coupling', 'switch', 'on', 'nanosecond', 'timescales', 'degrades', 'qubit', 'coherence']] | [-0.25513350631145737, 0.22034672129758534, 0.005636040427828137, -0.05881322891144907, -0.022134979031508482, -0.29532284353258487, 0.16178448288406752, 0.45557852491406325, -0.2362525743562021, -0.3228713980982009, -0.020615458171637846, -0.25203735472728744, -0.045754912391870836, 0.3006803013761587, -0.008028423602256593, 0.04338057689321569, -0.0008769923750358292, -0.04787596084083183, -0.09802518683910087, -0.19283530958397668, 0.2334802679045574, 0.03602000310739997, 0.37804580159202406, 0.0739825101675395, 0.13595141483547427, -0.05193795750059093, 0.19243002720059285, -0.08491658703482981, -0.04447414267136232, 0.02464266452286982, 0.2440883128320256, -0.0655753912250924, 0.24961562258415396, -0.5189714568513858, -0.14765179085344832, 0.01864091971965766, 0.12595271550802678, 0.18011044468465437, 0.002006764819880924, -0.31533541414839555, 0.015098307128476946, -0.18347123405848972, -0.034839748110197764, -0.05623511726602535, -0.033368730728950684, -0.029371637792055365, -0.2636517989331314, -0.021593937278972773, 0.04754372747449935, 0.02258533056636777, 0.051501003748301084, 0.03367963453306805, -0.016551546457730517, 0.11143401736147478, -0.08771598258621613, 0.04668214056593708, 0.3071076116300648, -0.06215114983482451, -0.18108991061962104, 0.2483111619713563, -0.07848364469017598, -0.14891291722136585, 0.14539050657443608, -0.0758649623476461, 0.03137855301905848, 0.05297989954676809, 0.17295521513052, 0.041137628221907946, -0.12479670915186783, 0.007622898072210624, 0.10356222682549984, 0.29344271863751775, 0.10720266614557256, 0.18486561472940294, 0.19897375604184933, 0.2652790132037635, 0.1310750575558595, 0.21875201919575846, -0.09684093417069298, -0.0674767366881612, -0.2616889813466917, -0.17017731180155202, -0.2154590485122385, 0.17361293389179, -0.053818815198978937, -0.18755148988971604, 0.4462502653816644, 0.15363256149494997, 0.16186357670333945, -0.06506444699914914, 0.28999265747828573, 0.11661038563964016, 0.16674466444108682, 0.004666879466628727, 0.27589381700735305, 0.22213535548388202, 0.05647595166051878, -0.3985272959873811, 0.029131745347823902, -0.07700023903876921] |
1,802.01328 | Using rxncon to develop rule based models | We present a protocol for building, validating and simulating models of
signal transduction networks. These networks are challenging modelling targets
due to the combinatorial complexity and sparse data, which have made it a major
challenge even to formalise the current knowledge. To address this, the
community has developed methods to model biomolecular reaction networks based
on site dynamics. The strength of this approach is that reactions and states
can be defined at variable resolution, which makes it possible to adapt the
model resolution to the empirical data. This improves both scalability and
accuracy, making it possible to formalise large models of signal transduction
networks. Here, we present a method to build and validate large models of
signal transduction networks. The workflow is based on rxncon, the
reaction-contingency language. In a five-step process, we create a mechanistic
network model, convert it into an executable Boolean model, use the Boolean
model to evaluate and improve the network, and finally export the rxncon model
into a rule based format. We provide an introduction to the rxncon language and
an annotated, step-by-step protocol for the workflow. Finally, we create a
small model of the insulin signalling pathway to illustrate the protocol,
together with some of the challenges - and some of their solutions - in
modelling signal transduction.
| q-bio.MN | we present a protocol for building validating and simulating models of signal transduction networks these networks are challenging modelling targets due to the combinatorial complexity and sparse data which have made it a major challenge even to formalise the current knowledge to address this the community has developed methods to model biomolecular reaction networks based on site dynamics the strength of this approach is that reactions and states can be defined at variable resolution which makes it possible to adapt the model resolution to the empirical data this improves both scalability and accuracy making it possible to formalise large models of signal transduction networks here we present a method to build and validate large models of signal transduction networks the workflow is based on rxncon the reactioncontingency language in a fivestep process we create a mechanistic network model convert it into an executable boolean model use the boolean model to evaluate and improve the network and finally export the rxncon model into a rule based format we provide an introduction to the rxncon language and an annotated stepbystep protocol for the workflow finally we create a small model of the insulin signalling pathway to illustrate the protocol together with some of the challenges and some of their solutions in modelling signal transduction | [['we', 'present', 'a', 'protocol', 'for', 'building', 'validating', 'and', 'simulating', 'models', 'of', 'signal', 'transduction', 'networks', 'these', 'networks', 'are', 'challenging', 'modelling', 'targets', 'due', 'to', 'the', 'combinatorial', 'complexity', 'and', 'sparse', 'data', 'which', 'have', 'made', 'it', 'a', 'major', 'challenge', 'even', 'to', 'formalise', 'the', 'current', 'knowledge', 'to', 'address', 'this', 'the', 'community', 'has', 'developed', 'methods', 'to', 'model', 'biomolecular', 'reaction', 'networks', 'based', 'on', 'site', 'dynamics', 'the', 'strength', 'of', 'this', 'approach', 'is', 'that', 'reactions', 'and', 'states', 'can', 'be', 'defined', 'at', 'variable', 'resolution', 'which', 'makes', 'it', 'possible', 'to', 'adapt', 'the', 'model', 'resolution', 'to', 'the', 'empirical', 'data', 'this', 'improves', 'both', 'scalability', 'and', 'accuracy', 'making', 'it', 'possible', 'to', 'formalise', 'large', 'models', 'of', 'signal', 'transduction', 'networks', 'here', 'we', 'present', 'a', 'method', 'to', 'build', 'and', 'validate', 'large', 'models', 'of', 'signal', 'transduction', 'networks', 'the', 'workflow', 'is', 'based', 'on', 'rxncon', 'the', 'reactioncontingency', 'language', 'in', 'a', 'fivestep', 'process', 'we', 'create', 'a', 'mechanistic', 'network', 'model', 'convert', 'it', 'into', 'an', 'executable', 'boolean', 'model', 'use', 'the', 'boolean', 'model', 'to', 'evaluate', 'and', 'improve', 'the', 'network', 'and', 'finally', 'export', 'the', 'rxncon', 'model', 'into', 'a', 'rule', 'based', 'format', 'we', 'provide', 'an', 'introduction', 'to', 'the', 'rxncon', 'language', 'and', 'an', 'annotated', 'stepbystep', 'protocol', 'for', 'the', 'workflow', 'finally', 'we', 'create', 'a', 'small', 'model', 'of', 'the', 'insulin', 'signalling', 'pathway', 'to', 'illustrate', 'the', 'protocol', 'together', 'with', 'some', 'of', 'the', 'challenges', 'and', 'some', 'of', 'their', 'solutions', 'in', 'modelling', 'signal', 'transduction']] | [-0.06403466934416557, 0.008649286720998281, -0.06056881802704437, 0.06572806867924129, -0.1024519702733022, -0.16963194474639698, 0.07835555802236237, 0.4002901132249437, -0.295563420166054, -0.32089938617960256, 0.08612904009426904, -0.22691412555203902, -0.19328712135270873, 0.18895336002292404, -0.0733526531712845, 0.06816588467984544, 0.09985333606512485, 0.013503267709083052, 0.03129369158508676, -0.22802347004395948, 0.27195401402119707, 0.09833964752916123, 0.3076909067113641, 0.0757154066819627, 0.13079472957068605, -0.04215135655732234, -0.030904552356397372, -0.03531912498515964, -0.10199217509961234, 0.17333303437478867, 0.2775603169091017, 0.23351872632262335, 0.27147277012926424, -0.47230401765488933, -0.22587012550550825, 0.11562413255070553, 0.10801930957632713, 0.16953912251673073, -0.02009326245931476, -0.28209800873463753, 0.09064966432917951, -0.193554194866993, -0.043124849400461004, -0.13800223412265852, 0.0007641726709743388, 0.006596536313788304, -0.27454367730550255, -0.005787534431788311, 0.07336988624172082, 0.043399004464289306, -0.058951755970858825, -0.07913313216145781, 0.0006640444981967104, 0.15297608213583053, -0.00691055998570833, 0.029864098657263548, 0.12982185003877356, -0.1382543743492236, -0.1484400601527914, 0.37288619652037375, -0.021141698622029997, -0.21316722359274343, 0.19822752614223102, -0.026327641371867102, -0.16853733744882754, 0.08598573581796687, 0.2263382954712763, 0.07283398733028515, -0.1946346741434522, 0.027393539504300343, 0.013113674840126275, 0.21647262864997743, 0.0060381629345364765, -0.016992042099359617, 0.17025092422467838, 0.2838307835572174, 0.011127379090609074, 0.14728128802311558, -0.08056123928339066, -0.08666809313208906, -0.22648809690434504, -0.13952899885902367, -0.158781076061994, 0.0014410911964349697, -0.06091157398764563, -0.16631811056661275, 0.39816815623245533, 0.24378446388274644, 0.20118369957458634, 0.10610063493988914, 0.3332421542697043, 0.06672559729755208, 0.09043875128285676, 0.025726553118871568, 0.1716075892137006, 0.11938272666415614, 0.11987343664894595, -0.1722696727115255, 0.09310168878978639, 0.008364692286221902] |
1,802.01329 | Reshaping of a Janus ring | We consider reshaping of closed Janus filaments acquiring intrinsic curvature
upon actuation of an active component -- a nematic elastomer elongating upon
phase transition. Linear stability analysis establishes instability thresholds
of circles with no imposed twist, dependent on the ratio $q$ of the intrinsic
curvature to the inverse radius of the original circle. Twisted circles are
proven to be absolutely unstable but the linear analysis well predicts the
dependence of the looping number of the emerging configurations on the imposed
twist. Modeling stable configurations by relaxing numerically the overall
elastic energy detects multiple stable and metastable states with different
looping numbers. The bifurcation of untwisted circles turns out to be
subcritical, so that nonplanar shapes with a lower energy exist at $q$ below
the critical value. The looping number of stable shapes generally increases
with $q$.
| cond-mat.soft | we consider reshaping of closed janus filaments acquiring intrinsic curvature upon actuation of an active component a nematic elastomer elongating upon phase transition linear stability analysis establishes instability thresholds of circles with no imposed twist dependent on the ratio q of the intrinsic curvature to the inverse radius of the original circle twisted circles are proven to be absolutely unstable but the linear analysis well predicts the dependence of the looping number of the emerging configurations on the imposed twist modeling stable configurations by relaxing numerically the overall elastic energy detects multiple stable and metastable states with different looping numbers the bifurcation of untwisted circles turns out to be subcritical so that nonplanar shapes with a lower energy exist at q below the critical value the looping number of stable shapes generally increases with q | [['we', 'consider', 'reshaping', 'of', 'closed', 'janus', 'filaments', 'acquiring', 'intrinsic', 'curvature', 'upon', 'actuation', 'of', 'an', 'active', 'component', 'a', 'nematic', 'elastomer', 'elongating', 'upon', 'phase', 'transition', 'linear', 'stability', 'analysis', 'establishes', 'instability', 'thresholds', 'of', 'circles', 'with', 'no', 'imposed', 'twist', 'dependent', 'on', 'the', 'ratio', 'q', 'of', 'the', 'intrinsic', 'curvature', 'to', 'the', 'inverse', 'radius', 'of', 'the', 'original', 'circle', 'twisted', 'circles', 'are', 'proven', 'to', 'be', 'absolutely', 'unstable', 'but', 'the', 'linear', 'analysis', 'well', 'predicts', 'the', 'dependence', 'of', 'the', 'looping', 'number', 'of', 'the', 'emerging', 'configurations', 'on', 'the', 'imposed', 'twist', 'modeling', 'stable', 'configurations', 'by', 'relaxing', 'numerically', 'the', 'overall', 'elastic', 'energy', 'detects', 'multiple', 'stable', 'and', 'metastable', 'states', 'with', 'different', 'looping', 'numbers', 'the', 'bifurcation', 'of', 'untwisted', 'circles', 'turns', 'out', 'to', 'be', 'subcritical', 'so', 'that', 'nonplanar', 'shapes', 'with', 'a', 'lower', 'energy', 'exist', 'at', 'q', 'below', 'the', 'critical', 'value', 'the', 'looping', 'number', 'of', 'stable', 'shapes', 'generally', 'increases', 'with', 'q']] | [-0.23658408416883536, 0.22283103288317324, -0.058322223672574315, 0.05852580215368006, -0.047029867123260544, -0.15019138259037088, 0.0402442402827243, 0.35259130947567796, -0.2654296944262805, -0.29320562963408453, 0.09059198624281972, -0.24775250254681816, -0.13478804928837, 0.1406837402118577, -0.013135049867021195, 0.06766293837205956, 0.017385370803445026, 0.04703156316859854, -0.04645796477691167, -0.17329419943141855, 0.3188264129648882, 0.04206487672506935, 0.3154957477969152, 0.02912427175583111, 0.058864124712568744, 0.0073172842876778705, 0.02647289788281476, 0.05316579677164555, -0.20039720990790993, 0.09327811933148446, 0.18427011159214157, 0.017050833130013886, 0.18346725218687895, -0.4137580676211251, -0.18363409175287448, 0.12717514137599478, 0.1668326293187285, 0.057700212410202734, 0.0052737365448761175, -0.2349007820469086, 0.07787440173431404, -0.09334697973293563, -0.2047879527038377, -0.07031231247992427, 0.05808747009270721, 0.038116423495941694, -0.2188676048596217, 0.08956894237134191, 0.07891633231623996, 0.06347149734609518, -0.09641376268980956, -0.1155974275191073, -0.12190969962178282, 0.0900633268433416, 0.10661488112527877, 0.0012951973687719415, 0.21735415668399247, -0.1273432158899528, -0.06248759120116355, 0.3190803859244894, -0.015184915755633955, -0.20141556277284745, 0.1360667838887484, -0.12818580426413703, -0.11035249170575602, 0.23406326802516425, 0.12041751060082957, 0.10472344483973252, 0.0024478395090058998, 0.06608464858899997, -0.001360741374945199, 0.18246212604593623, 0.15105302100311274, -0.04749977693254887, 0.24569621318606316, 0.14700326629940214, 0.1177704871804626, 0.1794975095273306, -0.07429213734964529, -0.14713864260939535, -0.29218233751728095, -0.07853901800871999, -0.12313461176688886, 0.07414850455501841, -0.1304205585994404, -0.23258079027205153, 0.3579007392559476, 0.03295574409594001, 0.23619770880064203, 0.056030584081869436, 0.2683413378859836, 0.104440002615943, 0.07086878602384349, 0.05814472744586291, 0.28615157809108493, 0.1328389671889858, 0.05569179033929551, -0.2394007076160051, 0.021094877033114984, 0.0687505880681177] |
1,802.0133 | Explicit singular minimal surface solutions for gravitational instantons | We construct a family of instanton metric obtained from new exact singular
solutions for minimal surfaces by noticing the correspondence between minimal
surfaces in the three dimesional Euclidean space and gravitational instantons
possessing two killing vectors. By Calabi's correspondence, we derive a family
of explicit maximal surface solution for spacelike surface with zero mean
curvature equation.
| math.DG gr-qc | we construct a family of instanton metric obtained from new exact singular solutions for minimal surfaces by noticing the correspondence between minimal surfaces in the three dimesional euclidean space and gravitational instantons possessing two killing vectors by calabis correspondence we derive a family of explicit maximal surface solution for spacelike surface with zero mean curvature equation | [['we', 'construct', 'a', 'family', 'of', 'instanton', 'metric', 'obtained', 'from', 'new', 'exact', 'singular', 'solutions', 'for', 'minimal', 'surfaces', 'by', 'noticing', 'the', 'correspondence', 'between', 'minimal', 'surfaces', 'in', 'the', 'three', 'dimesional', 'euclidean', 'space', 'and', 'gravitational', 'instantons', 'possessing', 'two', 'killing', 'vectors', 'by', 'calabis', 'correspondence', 'we', 'derive', 'a', 'family', 'of', 'explicit', 'maximal', 'surface', 'solution', 'for', 'spacelike', 'surface', 'with', 'zero', 'mean', 'curvature', 'equation']] | [-0.21189610109597976, 0.10762302971228824, -0.07851450240039932, 0.12446489439129696, -0.09884072866822992, -0.1649015122353116, -0.0046114334587140805, 0.30245718421481016, -0.21180234997882508, -0.22857570920937828, 0.07137184058072828, -0.32391498060730683, -0.21126347544070864, 0.16337793703340658, -0.07281182135920972, 0.08963628256294344, 0.02262489028674151, 0.06058045806795625, -0.1799776115471364, -0.2100793233008257, 0.44705864348049673, -0.09908891227678396, 0.26760612967024955, 0.0340450607951165, 0.20595461170056037, -0.01855387701237175, 0.018423748917744627, 0.02186353811443301, -0.2579388610153858, 0.18347323757396744, 0.2155579683104796, 0.0800110477555011, 0.1277923509977492, -0.41328523254820276, -0.24515674777337285, 0.17413455967990948, 0.12083924154285342, 0.12205101908849818, -0.06355274977561619, -0.2881395063263231, 0.049591431768411506, -0.11437932082584926, -0.23566375494868094, -0.09782886663119175, 0.023951780549915775, -0.04629432536395533, -0.16638486200411404, 0.07109757810498454, 0.02915937455171453, 0.09205053996161691, -0.15447824137351876, -0.07064491485341153, -0.0950514763992812, 0.053924138948787004, 0.10716155134806675, 0.06629607550400708, -0.003792961859809501, -0.08641754203043613, -0.08062374189362995, 0.2777245214944872, -0.14155838114675134, -0.35198424463825567, 0.0987601295013779, -0.13327322470390104, -0.0380799657182901, 0.15255619075781265, 0.11545211714526106, 0.20494348391158773, -0.15356502214646234, 0.19897806411505112, -0.0420742531423457, 0.013883637530463082, 0.17959052500581102, -0.009230606144618443, 0.23590187856461853, 0.020069181021036848, 0.12292503617105208, 0.15717522069046805, -0.019581059243396988, -0.13311563826365663, -0.421613304742745, -0.22395461484016518, -0.1606665357914088, 0.13933207280933857, -0.21154857320418938, -0.22857961574170207, 0.3458895328845496, -0.034162794098457586, 0.20839702783684647, 0.1379997577085825, 0.16212370667407022, 0.029575545159916925, 0.00928632662232433, 0.10315787236738418, 0.21312820653630687, 0.12959897776350512, -0.050186461004029424, -0.17237808769485646, -0.09618801982807261, 0.2618722300560746] |
1,802.01331 | Relaminarization by steady modification of the streamwise velocity
profile in a pipe | We show that a rather simple, steady modification of the streamwise velocity
profile in a pipe can lead to a complete collapse of turbulence and the flow
fully relaminarizes. Two different devices, a stationary obstacle (inset) and a
device to inject additional fluid through an annular gap close to the wall, are
used to control the flow. Both devices modify the streamwise velocity profile
such that the flow in the center of the pipe is decelerated and the flow in the
near wall region is accelerated. We present measurements with stereoscopic
particle image velocimetry to investigate and capture the development of the
relaminarizing flow downstream these devices and the specific circumstances
responsible for relaminarization. We find total relaminarization up to Reynolds
numbers of 6000, where the pressure drop in the downstream distance is reduced
by a factor of 3.4 due to relaminarization. In a smooth straight pipe the flow
remains completely laminar downstream of the control. Furthermore, we show that
transient (temporary) relaminarization in a spatially confined region right
downstream the devices occurs also at much higher Reynolds numbers, accompanied
by a significant drag reduction. The underlying physical mechanism of
relaminarization is attributed to a weakening of the near-wall turbulence
production cycle.
| physics.flu-dyn | we show that a rather simple steady modification of the streamwise velocity profile in a pipe can lead to a complete collapse of turbulence and the flow fully relaminarizes two different devices a stationary obstacle inset and a device to inject additional fluid through an annular gap close to the wall are used to control the flow both devices modify the streamwise velocity profile such that the flow in the center of the pipe is decelerated and the flow in the near wall region is accelerated we present measurements with stereoscopic particle image velocimetry to investigate and capture the development of the relaminarizing flow downstream these devices and the specific circumstances responsible for relaminarization we find total relaminarization up to reynolds numbers of 6000 where the pressure drop in the downstream distance is reduced by a factor of 34 due to relaminarization in a smooth straight pipe the flow remains completely laminar downstream of the control furthermore we show that transient temporary relaminarization in a spatially confined region right downstream the devices occurs also at much higher reynolds numbers accompanied by a significant drag reduction the underlying physical mechanism of relaminarization is attributed to a weakening of the nearwall turbulence production cycle | [['we', 'show', 'that', 'a', 'rather', 'simple', 'steady', 'modification', 'of', 'the', 'streamwise', 'velocity', 'profile', 'in', 'a', 'pipe', 'can', 'lead', 'to', 'a', 'complete', 'collapse', 'of', 'turbulence', 'and', 'the', 'flow', 'fully', 'relaminarizes', 'two', 'different', 'devices', 'a', 'stationary', 'obstacle', 'inset', 'and', 'a', 'device', 'to', 'inject', 'additional', 'fluid', 'through', 'an', 'annular', 'gap', 'close', 'to', 'the', 'wall', 'are', 'used', 'to', 'control', 'the', 'flow', 'both', 'devices', 'modify', 'the', 'streamwise', 'velocity', 'profile', 'such', 'that', 'the', 'flow', 'in', 'the', 'center', 'of', 'the', 'pipe', 'is', 'decelerated', 'and', 'the', 'flow', 'in', 'the', 'near', 'wall', 'region', 'is', 'accelerated', 'we', 'present', 'measurements', 'with', 'stereoscopic', 'particle', 'image', 'velocimetry', 'to', 'investigate', 'and', 'capture', 'the', 'development', 'of', 'the', 'relaminarizing', 'flow', 'downstream', 'these', 'devices', 'and', 'the', 'specific', 'circumstances', 'responsible', 'for', 'relaminarization', 'we', 'find', 'total', 'relaminarization', 'up', 'to', 'reynolds', 'numbers', 'of', '6000', 'where', 'the', 'pressure', 'drop', 'in', 'the', 'downstream', 'distance', 'is', 'reduced', 'by', 'a', 'factor', 'of', '34', 'due', 'to', 'relaminarization', 'in', 'a', 'smooth', 'straight', 'pipe', 'the', 'flow', 'remains', 'completely', 'laminar', 'downstream', 'of', 'the', 'control', 'furthermore', 'we', 'show', 'that', 'transient', 'temporary', 'relaminarization', 'in', 'a', 'spatially', 'confined', 'region', 'right', 'downstream', 'the', 'devices', 'occurs', 'also', 'at', 'much', 'higher', 'reynolds', 'numbers', 'accompanied', 'by', 'a', 'significant', 'drag', 'reduction', 'the', 'underlying', 'physical', 'mechanism', 'of', 'relaminarization', 'is', 'attributed', 'to', 'a', 'weakening', 'of', 'the', 'nearwall', 'turbulence', 'production', 'cycle']] | [-0.17688388417885262, 0.17987115677836002, -0.09751421389962998, 0.00874700861300646, -0.05536810899300888, -0.10803323403856081, 0.0004474108649410842, 0.3366977439194544, -0.31335619444691454, -0.293505667122127, 0.06854471891523699, -0.2256574959570247, -0.06910936913950401, 0.2027260464204632, -0.061508197047215156, 0.04882045076597519, 0.06298489225705588, 0.021556861494036187, -0.005433841400991867, -0.12516333244131223, 0.2612639186710193, 0.05667546161883833, 0.30857130415774514, 0.094314315245662, 0.09404987471620782, -0.09666241125876804, 0.005125282000056422, 0.06690725559451718, -0.1681337523692167, 0.06915749849476113, 0.18375198059660006, 0.025318841332348414, 0.2635271661214088, -0.4676939370202841, -0.23883416434510216, 0.04472399329176486, 0.18433277926057356, 0.09952874900773168, -0.05038566657429616, -0.23857074534511286, 0.10810004155345188, -0.18160079875131055, -0.13401950506400087, -0.002713179985743643, 0.03797919793967342, 0.03507566869738373, -0.24441936903052253, 0.12809779913044225, 0.060766892616019245, 0.07185248194820257, -0.057528962435645724, -0.0015293347907464692, -0.05421861484277957, 0.1165741304544234, 0.0649557405821103, 0.046688223778648244, 0.21596936459911267, -0.22094085702060556, -0.033254401509345756, 0.39050819399296355, -0.0487796077458649, -0.17436319536075345, 0.18960491712850583, -0.18281447661505773, -0.0186668896222358, 0.21336753580414938, 0.20789664318453116, 0.07640705109195839, -0.0912424570369064, -0.039712534280606816, -0.05606771640578691, 0.15558837392104624, 0.10943790008129534, -0.06700163175286218, 0.2080761446792743, 0.1585807833580835, 0.09730790853143052, 0.1638438458748088, -0.1709787895975607, -0.0861283754710901, -0.30858975138957845, -0.1581193263697816, -0.11993770148388415, 0.04039470193393835, -0.07308752412438371, -0.15343266246047352, 0.37829996789298437, 0.11701045787582315, 0.23009642676016925, -0.017779341732880267, 0.3128403895211839, 0.0967326574528931, 0.0739738859546297, 0.1510260559890493, 0.27691179347952993, 0.13464083686922815, 0.1764120496187064, -0.24572933570477226, 0.06860083706750728, 0.024688207001499093] |
1,802.01332 | Anisotropic strange stars in the Einstein-Maxwell spacetime | We present here a detailed analysis on the effects of charge on the
anisotropic strange star candidates by considering a spherically symmetric
interior spacetime metric. To obtain exact solution of the Einstein-Maxwell
field equations we have considered the anisotropic strange quark matter (SQM)
distribution governed by the simplified MIT bag equation of state (EOS),
$p=\frac{1}{3}\left( {\rho}-4\,B \right)$, where $B$ is the bag constant and
the distribution of the electrical charge is given as
$q(r)=Q\left({r}/{R}\right)^3=\alpha {r^3}$, where $\alpha$ is a constant. To
this end, to calculate different constants we have described the exterior
spacetime by the Reissner-Nordstr{\"o}m metric. By using the values of the
observed mass for the different strange star candidates we have maximized
anisotropic stress at the surface to predict the exact values of the radius for
the different values of $\alpha$ and a specific value of the bag constant.
Further, we perform different tests to study the physical validity and the
stability of the proposed stellar model. We found accumulation of the electric
charge distribution is maximum at the surface having electric charge of the
order ${{10}^{20}}~C$ and electric field of the order ${10}^{21-22}~V/cm$. To
study the different physical parameters and the effects of charge on the
anisotropic stellar system we have presented our analysis graphically and in
the tabular format by considering $LMC~X-4$ as the representative of the
strange star candidates.
| gr-qc | we present here a detailed analysis on the effects of charge on the anisotropic strange star candidates by considering a spherically symmetric interior spacetime metric to obtain exact solution of the einsteinmaxwell field equations we have considered the anisotropic strange quark matter sqm distribution governed by the simplified mit bag equation of state eos pfrac13left rho4b right where b is the bag constant and the distribution of the electrical charge is given as qrqleftrrright3alpha r3 where alpha is a constant to this end to calculate different constants we have described the exterior spacetime by the reissnernordstrom metric by using the values of the observed mass for the different strange star candidates we have maximized anisotropic stress at the surface to predict the exact values of the radius for the different values of alpha and a specific value of the bag constant further we perform different tests to study the physical validity and the stability of the proposed stellar model we found accumulation of the electric charge distribution is maximum at the surface having electric charge of the order 1020c and electric field of the order 102122vcm to study the different physical parameters and the effects of charge on the anisotropic stellar system we have presented our analysis graphically and in the tabular format by considering lmcx4 as the representative of the strange star candidates | [['we', 'present', 'here', 'a', 'detailed', 'analysis', 'on', 'the', 'effects', 'of', 'charge', 'on', 'the', 'anisotropic', 'strange', 'star', 'candidates', 'by', 'considering', 'a', 'spherically', 'symmetric', 'interior', 'spacetime', 'metric', 'to', 'obtain', 'exact', 'solution', 'of', 'the', 'einsteinmaxwell', 'field', 'equations', 'we', 'have', 'considered', 'the', 'anisotropic', 'strange', 'quark', 'matter', 'sqm', 'distribution', 'governed', 'by', 'the', 'simplified', 'mit', 'bag', 'equation', 'of', 'state', 'eos', 'pfrac13left', 'rho4b', 'right', 'where', 'b', 'is', 'the', 'bag', 'constant', 'and', 'the', 'distribution', 'of', 'the', 'electrical', 'charge', 'is', 'given', 'as', 'qrqleftrrright3alpha', 'r3', 'where', 'alpha', 'is', 'a', 'constant', 'to', 'this', 'end', 'to', 'calculate', 'different', 'constants', 'we', 'have', 'described', 'the', 'exterior', 'spacetime', 'by', 'the', 'reissnernordstrom', 'metric', 'by', 'using', 'the', 'values', 'of', 'the', 'observed', 'mass', 'for', 'the', 'different', 'strange', 'star', 'candidates', 'we', 'have', 'maximized', 'anisotropic', 'stress', 'at', 'the', 'surface', 'to', 'predict', 'the', 'exact', 'values', 'of', 'the', 'radius', 'for', 'the', 'different', 'values', 'of', 'alpha', 'and', 'a', 'specific', 'value', 'of', 'the', 'bag', 'constant', 'further', 'we', 'perform', 'different', 'tests', 'to', 'study', 'the', 'physical', 'validity', 'and', 'the', 'stability', 'of', 'the', 'proposed', 'stellar', 'model', 'we', 'found', 'accumulation', 'of', 'the', 'electric', 'charge', 'distribution', 'is', 'maximum', 'at', 'the', 'surface', 'having', 'electric', 'charge', 'of', 'the', 'order', '1020c', 'and', 'electric', 'field', 'of', 'the', 'order', '102122vcm', 'to', 'study', 'the', 'different', 'physical', 'parameters', 'and', 'the', 'effects', 'of', 'charge', 'on', 'the', 'anisotropic', 'stellar', 'system', 'we', 'have', 'presented', 'our', 'analysis', 'graphically', 'and', 'in', 'the', 'tabular', 'format', 'by', 'considering', 'lmcx4', 'as', 'the', 'representative', 'of', 'the', 'strange', 'star', 'candidates']] | [-0.107603263408137, 0.135700992896481, -0.07502490909106724, 0.05105311787723389, -0.07441667551132233, -0.07470564434058181, 0.037003188367431224, 0.31866905382477156, -0.1866857155170887, -0.3258389805286238, 0.05950443242457547, -0.28354536708801575, -0.05988619998777838, 0.12755569620546992, 0.01617693875333694, 0.05290423247708831, -0.018483378733061766, 0.07657901142494217, -0.09744415588418583, -0.2151436183386861, 0.3872040006668056, 0.024567351816859963, 0.25002544228472323, 0.0658948685948367, 0.08507071388672748, -0.03559689366335228, -0.009372951381002047, 0.043297099311023816, -0.2022382888930199, 0.052520910484214485, 0.16764435319194876, 0.06744022496027625, 0.18331057425337466, -0.38039679272466054, -0.21986817922251783, 0.065952495431536, 0.08529382882390987, 0.10029083161219342, -0.0739865349273444, -0.2831852897665714, 0.12220645349761938, -0.18351347162813528, -0.17104038370126798, -0.069004969611832, 0.05582274821774022, 0.04577105838090998, -0.27470606204003234, 0.10604995336451623, 0.024555174715723417, 0.0038756182487441663, -0.13668926119842656, -0.15651690847023506, -0.05301789273736471, 0.11484893395583524, 0.08878873675459885, 0.03591114897323457, 0.14009097313772054, -0.1528697071892537, -0.03275529470520103, 0.39827552602996363, -0.09284962682594591, -0.22268168635019972, 0.13043907004276709, -0.17888599057303375, -0.06661894868795662, 0.07297494012190531, 0.171560756934458, 0.15886475909161105, -0.16089625853075556, 0.08932597503190585, -0.03147930537135719, 0.14578238159118298, 0.0703329970065045, -0.0013506593018957334, 0.2641408206601563, 0.1525252046856655, -0.01563592201319936, 0.13557317753037498, -0.09089151861626638, -0.10174131908424233, -0.3141956891839022, -0.12884911961139064, -0.17144340160834395, 0.05453767753149049, -0.1604266426347666, -0.17193477481314445, 0.4171787674648296, 0.12522212467715835, 0.17578034342764176, -0.029729626112783403, 0.2690986654802, 0.1303236595324143, 0.03069678458016255, 0.0813878789824778, 0.2752947317867978, 0.15460400511276776, 0.12490976293099253, -0.26911757666018016, 0.03869171132712059, 0.056683054076375854] |
1,802.01333 | Concentration sets for multiple equal-depth wells potentials in the 2D
elliptic case | The formation of codimension-one interfaces for multiwell gradient-driven
problems is well-known and established in the scalar case, where the equation
is often referred to as the Allen-Cahn equation. The vectorial case in contrast
is quite open. This lack of results and insight is to a large extend related to
the absence of known appropriate monotonicity formula. In this paper, we focus
on the elliptic case in two dimensions, and introduce some methods which allow
to circumvent the lack of monotonicity formula. This methods lead, as expected,
to concentration on one-dimensional rectifiable sets.
| math.AP | the formation of codimensionone interfaces for multiwell gradientdriven problems is wellknown and established in the scalar case where the equation is often referred to as the allencahn equation the vectorial case in contrast is quite open this lack of results and insight is to a large extend related to the absence of known appropriate monotonicity formula in this paper we focus on the elliptic case in two dimensions and introduce some methods which allow to circumvent the lack of monotonicity formula this methods lead as expected to concentration on onedimensional rectifiable sets | [['the', 'formation', 'of', 'codimensionone', 'interfaces', 'for', 'multiwell', 'gradientdriven', 'problems', 'is', 'wellknown', 'and', 'established', 'in', 'the', 'scalar', 'case', 'where', 'the', 'equation', 'is', 'often', 'referred', 'to', 'as', 'the', 'allencahn', 'equation', 'the', 'vectorial', 'case', 'in', 'contrast', 'is', 'quite', 'open', 'this', 'lack', 'of', 'results', 'and', 'insight', 'is', 'to', 'a', 'large', 'extend', 'related', 'to', 'the', 'absence', 'of', 'known', 'appropriate', 'monotonicity', 'formula', 'in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'elliptic', 'case', 'in', 'two', 'dimensions', 'and', 'introduce', 'some', 'methods', 'which', 'allow', 'to', 'circumvent', 'the', 'lack', 'of', 'monotonicity', 'formula', 'this', 'methods', 'lead', 'as', 'expected', 'to', 'concentration', 'on', 'onedimensional', 'rectifiable', 'sets']] | [-0.11699099618050715, 0.03733953167988068, -0.045722539860593235, 0.10466111347752462, -0.09961790307526193, -0.14156331257064544, -0.007666319885807436, 0.3050600646428116, -0.2538747680272259, -0.2691101828519174, 0.14357550523203352, -0.25732980636150943, -0.1644329899598075, 0.2138914288301274, -0.12955610108379598, 0.06949728235359424, 0.02001233027903768, 0.02076793997295444, -0.05919615057317297, -0.22677300727430164, 0.3658742316715095, -0.04499904572477807, 0.26673525219540234, 0.12186470562997072, 0.05331725695008493, 0.002020689415866914, -0.007592384819872677, 0.012133471890474144, -0.17497463324917076, 0.1442596390565007, 0.253300319182808, 0.04588209153355464, 0.2639962764072191, -0.41822868536995805, -0.22186451939784962, 0.13764483225658414, 0.15705590940121075, 0.1126164928617705, -0.045442868816241135, -0.2403362532799213, 0.0684569896877055, -0.10350608959561214, -0.20027874566806966, -0.06926824022641244, -0.022573927219997604, 0.03571108411795095, -0.2619140569181384, 0.11301021068863085, 0.10516824204102665, 0.02119715535081923, -0.09407453936949858, -0.0842217067917733, 0.02128449693808089, 0.06950958127297623, 0.09821715168958611, 0.03290731843520442, 0.04727854671807069, -0.1141610671082795, -0.09858496774762424, 0.39334166265578696, -0.05610664788400754, -0.2789632961882845, 0.22124783269068954, -0.12006836736058492, -0.14806697945333208, 0.07025036112526836, 0.15270902143548365, 0.16499305103460085, -0.1507695628957742, 0.12276047494315603, -0.03866867800546891, 0.1087244798479293, 0.0805856770147448, 0.03179551454503899, 0.111852102285332, 0.14637431417308425, 0.11116647002611148, 0.20325673234132727, -0.024639448076334742, -0.134481439766798, -0.3100890249719985, -0.1599701412184083, -0.16441630539686783, 0.0699179491088928, -0.04936401782833855, -0.2141224989697904, 0.33493263275443536, 0.1656133098902343, 0.19166627230689579, 0.04092892647199535, 0.2624180810930936, 0.1392639592446832, 0.03596076875439157, 0.035523703248422266, 0.1914065791178196, 0.16923684341347087, 0.13165900184337617, -0.19854476778646526, 0.07059045519639293, 0.10244999490880771] |
1,802.01334 | Information Assisted Dictionary Learning for fMRI data analysis | In this paper, the task-related fMRI problem is treated in its matrix
factorization formulation, focused on the Dictionary Learning (DL) approach.
The new method allows the incorporation of a priori knowledge associated both
with the experimental design as well as with available brain Atlases. Moreover,
the proposed method can efficiently cope with uncertainties related to the HRF
modeling. In addition, the proposed method bypasses one of the major drawbacks
that are associated with DL methods; that is, the selection of the
sparsity-related regularization parameters. In our formulation, an alternative
sparsity promoting constraint is employed, that bears a direct relation to the
number of voxels in the spatial maps. Hence, the related parameters can be
tuned using information that is available from brain atlases. The proposed
method is evaluated against several other popular techniques, including GLM.
The obtained performance gains are reported via a novel realistic synthetic
fMRI dataset as well as real data that are related to a challenging
experimental design.
| stat.ML | in this paper the taskrelated fmri problem is treated in its matrix factorization formulation focused on the dictionary learning dl approach the new method allows the incorporation of a priori knowledge associated both with the experimental design as well as with available brain atlases moreover the proposed method can efficiently cope with uncertainties related to the hrf modeling in addition the proposed method bypasses one of the major drawbacks that are associated with dl methods that is the selection of the sparsityrelated regularization parameters in our formulation an alternative sparsity promoting constraint is employed that bears a direct relation to the number of voxels in the spatial maps hence the related parameters can be tuned using information that is available from brain atlases the proposed method is evaluated against several other popular techniques including glm the obtained performance gains are reported via a novel realistic synthetic fmri dataset as well as real data that are related to a challenging experimental design | [['in', 'this', 'paper', 'the', 'taskrelated', 'fmri', 'problem', 'is', 'treated', 'in', 'its', 'matrix', 'factorization', 'formulation', 'focused', 'on', 'the', 'dictionary', 'learning', 'dl', 'approach', 'the', 'new', 'method', 'allows', 'the', 'incorporation', 'of', 'a', 'priori', 'knowledge', 'associated', 'both', 'with', 'the', 'experimental', 'design', 'as', 'well', 'as', 'with', 'available', 'brain', 'atlases', 'moreover', 'the', 'proposed', 'method', 'can', 'efficiently', 'cope', 'with', 'uncertainties', 'related', 'to', 'the', 'hrf', 'modeling', 'in', 'addition', 'the', 'proposed', 'method', 'bypasses', 'one', 'of', 'the', 'major', 'drawbacks', 'that', 'are', 'associated', 'with', 'dl', 'methods', 'that', 'is', 'the', 'selection', 'of', 'the', 'sparsityrelated', 'regularization', 'parameters', 'in', 'our', 'formulation', 'an', 'alternative', 'sparsity', 'promoting', 'constraint', 'is', 'employed', 'that', 'bears', 'a', 'direct', 'relation', 'to', 'the', 'number', 'of', 'voxels', 'in', 'the', 'spatial', 'maps', 'hence', 'the', 'related', 'parameters', 'can', 'be', 'tuned', 'using', 'information', 'that', 'is', 'available', 'from', 'brain', 'atlases', 'the', 'proposed', 'method', 'is', 'evaluated', 'against', 'several', 'other', 'popular', 'techniques', 'including', 'glm', 'the', 'obtained', 'performance', 'gains', 'are', 'reported', 'via', 'a', 'novel', 'realistic', 'synthetic', 'fmri', 'dataset', 'as', 'well', 'as', 'real', 'data', 'that', 'are', 'related', 'to', 'a', 'challenging', 'experimental', 'design']] | [-0.024412159671192056, -0.006062043180918408, -0.06780348031315953, 0.0654218687559478, -0.11884292734757765, -0.14586489438952413, -0.0077676430919382256, 0.40253849735017866, -0.27642492147278974, -0.33236386473290624, 0.1136294773859845, -0.2529086377545354, -0.21543961336719802, 0.22458886468375566, -0.10259281177422963, 0.1029982452004333, 0.09915318132261745, 0.05082449411129346, -0.08258553736231988, -0.23035969360062153, 0.3117890648441971, 0.062033768137189325, 0.34515489957557294, 0.027979648381005973, 0.10376198645026306, -0.026922885444946587, -0.05611228631460108, 0.04126029366743751, -0.05236065336325737, 0.1830814791515877, 0.2930991793909925, 0.20705893797930913, 0.3117245050772908, -0.4119211260927841, -0.2593964094019611, 0.06161011148942634, 0.13388843294233083, 0.08967396268126322, -0.05241991205039085, -0.30374144002562387, 0.09042486802500208, -0.1442740551459792, -0.04142570446711034, -0.1351474130322458, -0.07786627516034059, -0.009561324899550527, -0.3173641323577613, 0.08267884739907458, 0.0002569577642134391, 0.033290999848395585, -0.07763191816447942, -0.15387222461577038, 0.009886791456665378, 0.1508269705085695, 0.07607858914270764, 0.050162540183373495, 0.11708336159499595, -0.10957018122207955, -0.1408905582589796, 0.37089882834407034, -0.03594546520762378, -0.24832322174333968, 0.19717598733550404, -0.036530537356156856, -0.12735177566937636, 0.1120809830899816, 0.1692660910426639, 0.11886995565728284, -0.16923777755582706, 0.061930698464857416, -0.03164471220516134, 0.17531514843576587, 0.005918780135107227, 0.001893628406105563, 0.11417387722904096, 0.21577392959152347, 0.038077823130879554, 0.1406649057604227, -0.13528033874972606, -0.0775899682455929, -0.2594120133871911, -0.08871678441646509, -0.2251635190565139, -0.060226560989121936, -0.0920935255524455, -0.13127528729382903, 0.3962041106889956, 0.20872856397763825, 0.21658498221368064, 0.0415225594479125, 0.36879778452275785, 0.07446539856136951, 0.12453818438225425, 0.023212729112128728, 0.18609612466134423, 0.10647373663377949, 0.09191241535374957, -0.22603334759551216, 0.10565738215082092, 0.016224473665351978] |
1,802.01335 | Spinup and Disruption of Interstellar Asteroids by Mechanical Torques,
and Implications for 1I/2017 U1 (`Oumuamua) | The discovery of the first interstellar asteroid, 1I/2017 U1 (`Oumuamua), has
opened a new era for research on interstellar objects. In this paper, we study
the rotational dynamics of interstellar asteroids (ISAs) of irregular shapes
moving through the interstellar gas. We find that regular mechanical torques
resulting from the bombardment of gas flow on the irregular body could be
important for the dynamics and destruction of ISAs. Mechanical torques can spin
up the ISA, resulting in the breakup of the original ISA into small binary
asteroids when the rotation rate exceeds the critical frequency. We find that
the breakup timescale is short for ISAs of highly irregular shapes and low
tensile strength. We apply our results to the first observed ISA, `Oumuamua,
and suggest that its extreme elongated shape may originate from a reassembly of
the binary fragments due to gravity along its journey in the interstellar
medium. The tumbling of `Oumuamua could have been induced by rotational
disruption due to mechanical torques. Finally, we discuss the survival
possibility of high-velocity asteroids presumably formed by tidal disruption of
planetary systems by the black hole at the Galactic center.
| astro-ph.GA astro-ph.EP | the discovery of the first interstellar asteroid 1i2017 u1 oumuamua has opened a new era for research on interstellar objects in this paper we study the rotational dynamics of interstellar asteroids isas of irregular shapes moving through the interstellar gas we find that regular mechanical torques resulting from the bombardment of gas flow on the irregular body could be important for the dynamics and destruction of isas mechanical torques can spin up the isa resulting in the breakup of the original isa into small binary asteroids when the rotation rate exceeds the critical frequency we find that the breakup timescale is short for isas of highly irregular shapes and low tensile strength we apply our results to the first observed isa oumuamua and suggest that its extreme elongated shape may originate from a reassembly of the binary fragments due to gravity along its journey in the interstellar medium the tumbling of oumuamua could have been induced by rotational disruption due to mechanical torques finally we discuss the survival possibility of highvelocity asteroids presumably formed by tidal disruption of planetary systems by the black hole at the galactic center | [['the', 'discovery', 'of', 'the', 'first', 'interstellar', 'asteroid', '1i2017', 'u1', 'oumuamua', 'has', 'opened', 'a', 'new', 'era', 'for', 'research', 'on', 'interstellar', 'objects', 'in', 'this', 'paper', 'we', 'study', 'the', 'rotational', 'dynamics', 'of', 'interstellar', 'asteroids', 'isas', 'of', 'irregular', 'shapes', 'moving', 'through', 'the', 'interstellar', 'gas', 'we', 'find', 'that', 'regular', 'mechanical', 'torques', 'resulting', 'from', 'the', 'bombardment', 'of', 'gas', 'flow', 'on', 'the', 'irregular', 'body', 'could', 'be', 'important', 'for', 'the', 'dynamics', 'and', 'destruction', 'of', 'isas', 'mechanical', 'torques', 'can', 'spin', 'up', 'the', 'isa', 'resulting', 'in', 'the', 'breakup', 'of', 'the', 'original', 'isa', 'into', 'small', 'binary', 'asteroids', 'when', 'the', 'rotation', 'rate', 'exceeds', 'the', 'critical', 'frequency', 'we', 'find', 'that', 'the', 'breakup', 'timescale', 'is', 'short', 'for', 'isas', 'of', 'highly', 'irregular', 'shapes', 'and', 'low', 'tensile', 'strength', 'we', 'apply', 'our', 'results', 'to', 'the', 'first', 'observed', 'isa', 'oumuamua', 'and', 'suggest', 'that', 'its', 'extreme', 'elongated', 'shape', 'may', 'originate', 'from', 'a', 'reassembly', 'of', 'the', 'binary', 'fragments', 'due', 'to', 'gravity', 'along', 'its', 'journey', 'in', 'the', 'interstellar', 'medium', 'the', 'tumbling', 'of', 'oumuamua', 'could', 'have', 'been', 'induced', 'by', 'rotational', 'disruption', 'due', 'to', 'mechanical', 'torques', 'finally', 'we', 'discuss', 'the', 'survival', 'possibility', 'of', 'highvelocity', 'asteroids', 'presumably', 'formed', 'by', 'tidal', 'disruption', 'of', 'planetary', 'systems', 'by', 'the', 'black', 'hole', 'at', 'the', 'galactic', 'center']] | [-0.13907605385410282, 0.1726444179583539, -0.10458596465128296, 0.044617544299863435, -0.07021499633853462, -0.0186395249973507, 0.0017178513075935932, 0.36015939783859763, -0.25961780457192674, -0.3017103837015345, 0.053974977919232454, -0.2426079221793074, -0.12911281319572887, 0.18624441254329174, -0.06785698812281554, 0.006155575307933217, 0.08005216522910137, -0.05630956511904902, -0.02635691044579676, -0.2134226870554638, 0.29974070846776857, 0.08861881922534172, 0.12752589054202582, 0.0009516252506960262, 0.09056380608068294, -0.04145717678314194, 0.01372789649758488, -0.04366923289180317, -0.1472598917006643, 0.08299905549675385, 0.16384683233101238, 0.10153695975524432, 0.2216326880288568, -0.4582655550614792, -0.22055383347454133, 0.055553661832744454, 0.154695593260298, 0.13826083368126382, -0.08909318468315487, -0.32121182419978916, 0.07221373569367681, -0.22933604420123108, -0.19091193180560986, -0.00010359772738624126, 0.13843933462185112, 0.04766812848368105, -0.17107272959571887, 0.09610832990716865, 0.10600413021165878, 0.05758177411762324, -0.1596429911404947, -0.08195606892943343, -0.07578035657408033, 0.08935591063732802, 0.10119415476219729, 0.03110326201768909, 0.24354191198994585, -0.1256180818816845, -0.043005842392263495, 0.46125951278063054, -0.03807803039037142, -0.050828149274704935, 0.24764495024437758, -0.20190433208846756, -0.13843247643176546, 0.19671422901484084, 0.23021108260071102, 0.08371396276089264, -0.14222219887914375, 0.017525464118467, -0.01203252817627954, 0.1430662081222684, 0.0781953743054591, 0.03897894648191063, 0.34842445751889906, 0.15835436150905963, 0.02181054656009903, 0.16222238128551558, -0.1929527529926495, -0.059613717916827805, -0.19625236537119256, -0.10969076832716769, -0.13651800994247945, 0.06797374188255995, -0.09226070417246368, -0.09657650754509613, 0.3417632828882717, 0.12296530782515085, 0.19364547996008966, -0.02038357068754812, 0.2802149979595808, 0.029604171695648395, 0.09781988515076476, 0.11484950142565797, 0.3314477371131169, 0.09235758007320753, 0.062291585011754504, -0.2891703420913124, 0.13630644634534467, 0.015320268387787361] |
1,802.01336 | Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle | We present a framework in Isabelle for verifying asymptotic time complexity
of imperative programs. We build upon an extension of Imperative HOL and its
separation logic to include running time. In addition to the basic arguments,
our framework is able to handle advanced techniques for time complexity
analysis, such as the use of the Akra-Bazzi theorem and amortized analysis.
Various automation is built and incorporated into the auto2 prover to reason
about separation logic with time credits, and to derive asymptotic behavior of
functions. As case studies, we verify the asymptotic time complexity (in
addition to functional correctness) of imperative algorithms and data
structures such as median of medians selection, Karatsuba's algorithm, and
splay trees.
| cs.LO | we present a framework in isabelle for verifying asymptotic time complexity of imperative programs we build upon an extension of imperative hol and its separation logic to include running time in addition to the basic arguments our framework is able to handle advanced techniques for time complexity analysis such as the use of the akrabazzi theorem and amortized analysis various automation is built and incorporated into the auto2 prover to reason about separation logic with time credits and to derive asymptotic behavior of functions as case studies we verify the asymptotic time complexity in addition to functional correctness of imperative algorithms and data structures such as median of medians selection karatsubas algorithm and splay trees | [['we', 'present', 'a', 'framework', 'in', 'isabelle', 'for', 'verifying', 'asymptotic', 'time', 'complexity', 'of', 'imperative', 'programs', 'we', 'build', 'upon', 'an', 'extension', 'of', 'imperative', 'hol', 'and', 'its', 'separation', 'logic', 'to', 'include', 'running', 'time', 'in', 'addition', 'to', 'the', 'basic', 'arguments', 'our', 'framework', 'is', 'able', 'to', 'handle', 'advanced', 'techniques', 'for', 'time', 'complexity', 'analysis', 'such', 'as', 'the', 'use', 'of', 'the', 'akrabazzi', 'theorem', 'and', 'amortized', 'analysis', 'various', 'automation', 'is', 'built', 'and', 'incorporated', 'into', 'the', 'auto2', 'prover', 'to', 'reason', 'about', 'separation', 'logic', 'with', 'time', 'credits', 'and', 'to', 'derive', 'asymptotic', 'behavior', 'of', 'functions', 'as', 'case', 'studies', 'we', 'verify', 'the', 'asymptotic', 'time', 'complexity', 'in', 'addition', 'to', 'functional', 'correctness', 'of', 'imperative', 'algorithms', 'and', 'data', 'structures', 'such', 'as', 'median', 'of', 'medians', 'selection', 'karatsubas', 'algorithm', 'and', 'splay', 'trees']] | [-0.08687733916622963, -0.017262597019828064, -0.1544359928750629, 0.13135635525421158, -0.11126332712898913, -0.1272818450162416, 0.11607479098816648, 0.374165264726208, -0.25675178446455676, -0.35318742994741914, 0.14994049948137744, -0.21368552119422116, -0.1279683988426481, 0.18471483275367828, -0.08011347192478481, 0.13433496787043273, 0.015823401748652065, 0.0011208429401577042, -0.039993311654318846, -0.25199963977527723, 0.23618234628648088, 0.05045645985458242, 0.25764368304762203, 0.04786134618661252, 0.08704967495654464, 0.0927854205416352, -0.0514054583965621, 0.02513511786073969, -0.10551406480290257, 0.10733882700534243, 0.3203732577691737, 0.24599264512296048, 0.30333179117817627, -0.4673245459991066, -0.11876827618515674, 0.049822427973706736, 0.12853335428435617, 0.09635885810686823, 0.004667447849274858, -0.26969865105613217, 0.1045838732296895, -0.16459546054804314, -0.13717227516565145, -0.13971062198183254, 0.024788860407282124, 0.0091002411668581, -0.2232329562192031, -0.011753153006889318, 0.12427519770796623, 0.04685514155170766, -0.01722401692052045, -0.10373473593867139, 0.016427129912476073, 0.12260758797964898, 0.056227557520431126, 0.015321113365261178, 0.10804169225963976, -0.046922459364092596, -0.18964799366107113, 0.34006393093436044, -0.06092907845557324, -0.15116695605479835, 0.20756771245750746, -0.04043293303989789, -0.20489151724777593, 0.05538860474929638, 0.21044295477239708, 0.12277801428398673, -0.1253349651713251, 0.10249127808798987, 0.04806123332430919, 0.23844966191079534, 0.07465746105044034, 0.07062704446345155, 0.10214467245774965, 0.22721513364006551, 0.048394403853372, 0.16767774906679334, -0.015166852610970014, -0.10918702199042105, -0.2914295892901065, -0.21366615529711308, -0.11430677048567879, -0.042421003244000305, -0.11763483696344529, -0.16914802448203167, 0.35469217100098993, 0.19356195595556577, 0.12027330168833335, 0.19684987057719314, 0.34848275424487757, 0.09821474689402078, 0.0820291746007442, 0.08736780458211638, 0.1357725413685681, 0.13944334053156668, 0.14178865917206726, -0.17531438792643153, 0.1132950465064169, 0.08245740396689558] |
1,802.01337 | All unital qubit channels are $4$-noisy operations | We show that any unital qubit channel can be implemented by letting the input
system interact unitarily with a $4$-dimensional environment in the maximally
mixed state and then tracing out the environment. We also provide an example
where the dimension of such an environment has to be at least $3$.
| quant-ph math-ph math.MP math.OA | we show that any unital qubit channel can be implemented by letting the input system interact unitarily with a 4dimensional environment in the maximally mixed state and then tracing out the environment we also provide an example where the dimension of such an environment has to be at least 3 | [['we', 'show', 'that', 'any', 'unital', 'qubit', 'channel', 'can', 'be', 'implemented', 'by', 'letting', 'the', 'input', 'system', 'interact', 'unitarily', 'with', 'a', '4dimensional', 'environment', 'in', 'the', 'maximally', 'mixed', 'state', 'and', 'then', 'tracing', 'out', 'the', 'environment', 'we', 'also', 'provide', 'an', 'example', 'where', 'the', 'dimension', 'of', 'such', 'an', 'environment', 'has', 'to', 'be', 'at', 'least', '3']] | [-0.09724649667739868, 0.1801228884939337, -0.08805652954615653, -0.033956411506514995, 0.018133611800149083, -0.21440628631971775, -0.02429063569754362, 0.4192655920982361, -0.29864704500883815, -0.24084141490980981, 0.13865137751912698, -0.267216025069356, -0.12025038938969373, 0.15387734569143505, -0.05069814533926546, -0.030847249506041407, 0.07091922283172608, 0.10912952308601234, -0.04534800743975211, -0.2702011351659894, 0.358591131567955, 0.03574832262471318, 0.1544658844731748, 0.012346723973751068, 0.12291325278580188, -0.0008258419251069427, 0.061554014142602684, 0.032648985143750905, -0.03874997977240127, 0.0036095921602100132, 0.25177299104630946, 0.1773713331995532, 0.22733739387243987, -0.4467490335553885, -0.18939571304246783, 0.1577238305658102, 0.16458254836499692, 0.1124842332676053, -0.033150937017053364, -0.3567774784937501, 0.09086428048089147, -0.233019807189703, -0.11195588338188828, -0.07960663693025709, -0.014114855853840709, -0.07509303137660027, -0.3115069137141109, -0.027091309619718233, 0.044929103278554976, 0.023316647596657275, -0.04763709271326661, -0.04963071342324838, -0.047681482741609216, 0.17446840612916276, -0.0801587119558826, 0.05627527231350541, 0.15267944967374206, -0.09306729154661297, -0.10830335789360106, 0.3248656549397856, -0.07192261009942741, -0.2791471663489938, 0.22233447608188725, -0.1330794753599912, -0.07570312123280018, 0.06632248429581523, 0.17713762572035194, 0.10178961504250765, -0.16460346668958664, 0.09700172992306762, -0.06839390151202679, 0.24674498062580824, -0.0023701953701674937, 0.0512536031100899, 0.1743876527249813, 0.11769829875789582, 0.11059155019000172, 0.19894271458964796, -0.011256264699622988, -0.06446214448660612, -0.31360214062035086, -0.21514744272455574, -0.1857318160869181, 0.12379927389323711, -0.08920014806994005, -0.07953370372764766, 0.34856954015791414, 0.1396165054757148, 0.19171441711485385, 0.014600672610104084, 0.2697930306941271, 0.12272542115300894, 0.05384271889925003, 0.15941369943320752, 0.1893095676158555, 0.09451192286331206, -0.014812993593513965, -0.1865508842933923, 0.02649675070308149, 0.015142429638653993] |
1,802.01338 | Shortest $k$-Disjoint Paths via Determinants | The well-known $k$-disjoint path problem ($k$-DPP) asks for pairwise
vertex-disjoint paths between $k$ specified pairs of vertices $(s_i, t_i)$ in a
given graph, if they exist. The decision version of the shortest $k$-DPP asks
for the length of the shortest (in terms of total length) such paths. Similarly
the search and counting versions ask for one such and the number of such
shortest set of paths, respectively.
We restrict attention to the shortest $k$-DPP instances on undirected planar
graphs where all sources and sinks lie on a single face or on a pair of faces.
We provide efficient sequential and parallel algorithms for the search versions
of the problem answering one of the main open questions raised by Colin de
Verdiere and Schrijver for the general one-face problem. We do so by providing
a randomised $NC^2$ algorithm along with an $O(n^{\omega})$ time randomised
sequential algorithm. We also obtain deterministic algorithms with similar
resource bounds for the counting and search versions.
In contrast, previously, only the sequential complexity of decision and
search versions of the "well-ordered" case has been studied. For the one-face
case, sequential versions of our routines have better running times for
constantly many terminals. In addition, the earlier best known sequential
algorithms (e.g. Borradaile et al.) were randomised while ours are also
deterministic.
The algorithms are based on a bijection between a shortest $k$-tuple of
disjoint paths in the given graph and cycle covers in a related digraph. This
allows us to non-trivially modify established techniques relating counting
cycle covers to the determinant. We further need to do a controlled
inclusion-exclusion to produce a polynomial sum of determinants such that all
"bad" cycle covers cancel out in the sum allowing us to count "good" cycle
covers.
| cs.DS | the wellknown kdisjoint path problem kdpp asks for pairwise vertexdisjoint paths between k specified pairs of vertices s_i t_i in a given graph if they exist the decision version of the shortest kdpp asks for the length of the shortest in terms of total length such paths similarly the search and counting versions ask for one such and the number of such shortest set of paths respectively we restrict attention to the shortest kdpp instances on undirected planar graphs where all sources and sinks lie on a single face or on a pair of faces we provide efficient sequential and parallel algorithms for the search versions of the problem answering one of the main open questions raised by colin de verdiere and schrijver for the general oneface problem we do so by providing a randomised nc2 algorithm along with an onomega time randomised sequential algorithm we also obtain deterministic algorithms with similar resource bounds for the counting and search versions in contrast previously only the sequential complexity of decision and search versions of the wellordered case has been studied for the oneface case sequential versions of our routines have better running times for constantly many terminals in addition the earlier best known sequential algorithms eg borradaile et al were randomised while ours are also deterministic the algorithms are based on a bijection between a shortest ktuple of disjoint paths in the given graph and cycle covers in a related digraph this allows us to nontrivially modify established techniques relating counting cycle covers to the determinant we further need to do a controlled inclusionexclusion to produce a polynomial sum of determinants such that all bad cycle covers cancel out in the sum allowing us to count good cycle covers | [['the', 'wellknown', 'kdisjoint', 'path', 'problem', 'kdpp', 'asks', 'for', 'pairwise', 'vertexdisjoint', 'paths', 'between', 'k', 'specified', 'pairs', 'of', 'vertices', 's_i', 't_i', 'in', 'a', 'given', 'graph', 'if', 'they', 'exist', 'the', 'decision', 'version', 'of', 'the', 'shortest', 'kdpp', 'asks', 'for', 'the', 'length', 'of', 'the', 'shortest', 'in', 'terms', 'of', 'total', 'length', 'such', 'paths', 'similarly', 'the', 'search', 'and', 'counting', 'versions', 'ask', 'for', 'one', 'such', 'and', 'the', 'number', 'of', 'such', 'shortest', 'set', 'of', 'paths', 'respectively', 'we', 'restrict', 'attention', 'to', 'the', 'shortest', 'kdpp', 'instances', 'on', 'undirected', 'planar', 'graphs', 'where', 'all', 'sources', 'and', 'sinks', 'lie', 'on', 'a', 'single', 'face', 'or', 'on', 'a', 'pair', 'of', 'faces', 'we', 'provide', 'efficient', 'sequential', 'and', 'parallel', 'algorithms', 'for', 'the', 'search', 'versions', 'of', 'the', 'problem', 'answering', 'one', 'of', 'the', 'main', 'open', 'questions', 'raised', 'by', 'colin', 'de', 'verdiere', 'and', 'schrijver', 'for', 'the', 'general', 'oneface', 'problem', 'we', 'do', 'so', 'by', 'providing', 'a', 'randomised', 'nc2', 'algorithm', 'along', 'with', 'an', 'onomega', 'time', 'randomised', 'sequential', 'algorithm', 'we', 'also', 'obtain', 'deterministic', 'algorithms', 'with', 'similar', 'resource', 'bounds', 'for', 'the', 'counting', 'and', 'search', 'versions', 'in', 'contrast', 'previously', 'only', 'the', 'sequential', 'complexity', 'of', 'decision', 'and', 'search', 'versions', 'of', 'the', 'wellordered', 'case', 'has', 'been', 'studied', 'for', 'the', 'oneface', 'case', 'sequential', 'versions', 'of', 'our', 'routines', 'have', 'better', 'running', 'times', 'for', 'constantly', 'many', 'terminals', 'in', 'addition', 'the', 'earlier', 'best', 'known', 'sequential', 'algorithms', 'eg', 'borradaile', 'et', 'al', 'were', 'randomised', 'while', 'ours', 'are', 'also', 'deterministic', 'the', 'algorithms', 'are', 'based', 'on', 'a', 'bijection', 'between', 'a', 'shortest', 'ktuple', 'of', 'disjoint', 'paths', 'in', 'the', 'given', 'graph', 'and', 'cycle', 'covers', 'in', 'a', 'related', 'digraph', 'this', 'allows', 'us', 'to', 'nontrivially', 'modify', 'established', 'techniques', 'relating', 'counting', 'cycle', 'covers', 'to', 'the', 'determinant', 'we', 'further', 'need', 'to', 'do', 'a', 'controlled', 'inclusionexclusion', 'to', 'produce', 'a', 'polynomial', 'sum', 'of', 'determinants', 'such', 'that', 'all', 'bad', 'cycle', 'covers', 'cancel', 'out', 'in', 'the', 'sum', 'allowing', 'us', 'to', 'count', 'good', 'cycle', 'covers']] | [-0.1408073608278452, 0.08346377305744884, -0.018354569141390838, 0.08526596720387009, -0.10214524751467656, -0.14988913375256946, 0.12356352832911296, 0.39445689936110284, -0.2794088277344902, -0.3454584500949649, 0.0866540746214418, -0.28175509627994366, -0.12702391016985834, 0.21289485951233977, -0.10405201052910545, 0.06892871652275466, 0.09836343373495361, 0.05785811744105255, 0.003983583342131978, -0.3066471786241891, 0.25257163147853134, -0.000658611417748034, 0.20558783710779002, 0.030137315778726286, 0.0834936437232601, 0.09796219995567096, -0.06791623567631985, 0.05456604081882688, -0.16580987170257483, 0.09462893651450738, 0.2590992202135062, 0.19347031760925246, 0.2347972465698452, -0.3964583897678595, -0.1329730392220275, 0.20952895235273494, 0.13889603012886356, 0.08398380078950948, 0.028993651502888598, -0.2084619878161094, 0.09131355505410789, -0.08208702947093924, -0.039793889341429654, 0.0005664669451006274, 0.055065268560105726, 0.03928389388541594, -0.2674848508969363, -0.01962038129992531, 0.08105609220284452, 0.014533779379942442, 0.02143553570183738, -0.1521078454813202, 0.04253206764244371, 0.13818497955879946, -0.015832674526286103, 0.05584313167815304, 0.034143821407686424, -0.08762712172311796, -0.23498636044435747, 0.36933831782274257, -0.014411271341183843, -0.16219066324427128, 0.17854960519414614, -0.057551285935561386, -0.19676963195120656, 0.13243869235157035, 0.12578784650597502, 0.1619013687555303, -0.11890052529543027, 0.1020796847119022, -0.10073798444096206, 0.11822023968771747, 0.15136926061111605, 0.009981311794035719, 0.15275460464173798, 0.12399212983695583, 0.14997542010496545, 0.1540770783709983, -0.006456454809974982, -0.1040777646709709, -0.2515264232137674, -0.15547760328869722, -0.15825985822286587, 0.029383546196590435, -0.11551607867982562, -0.20161561933350136, 0.3916018306788626, 0.1370867079345367, 0.19716627914021956, 0.12786874137398424, 0.25731394689258497, 0.06892987943951488, 0.05741225037672848, 0.15599709670479772, 0.12342688170651349, 0.11350924985405679, 0.03465735916284353, -0.1759595044627026, 0.0732324550820825, 0.1481782843944125] |
1,802.01339 | Observation of Topologically Protected States at Crystalline Phase
Boundaries in Single-layer WSe2 | Transition metal dichalcogenide (TMD) materials are unique in the wide
variety of structural and electronic phases they exhibit in the two-dimensional
(2D) single-layer limit. Here we show how such polymorphic flexibility can be
used to achieve topological states at highly ordered phase boundaries in a new
quantum spin Hall insulator (QSHI), 1T'-WSe2. We observe helical states at the
crystallographically-aligned interface between quantum a spin Hall insulating
domain of 1T'-WSe2 and a semiconducting domain of 1H-WSe2 in contiguous single
layers grown using molecular beam epitaxy (MBE). The QSHI nature of
single-layer 1T'-WSe2 was verified using ARPES to determine band inversion
around a 120 meV energy gap, as well as STM spectroscopy to directly image
helical edge-state formation. Using this new edge-state geometry we are able to
directly confirm the predicted penetration depth of a helical interface state
into the 2D bulk of a QSHI for a well-specified crystallographic direction. The
clean, well-ordered topological/trivial interfaces observed here create new
opportunities for testing predictions of the microscopic behavior of
topologically protected boundary states without the complication of structural
disorder.
| cond-mat.mtrl-sci | transition metal dichalcogenide tmd materials are unique in the wide variety of structural and electronic phases they exhibit in the twodimensional 2d singlelayer limit here we show how such polymorphic flexibility can be used to achieve topological states at highly ordered phase boundaries in a new quantum spin hall insulator qshi 1twse2 we observe helical states at the crystallographicallyaligned interface between quantum a spin hall insulating domain of 1twse2 and a semiconducting domain of 1hwse2 in contiguous single layers grown using molecular beam epitaxy mbe the qshi nature of singlelayer 1twse2 was verified using arpes to determine band inversion around a 120 mev energy gap as well as stm spectroscopy to directly image helical edgestate formation using this new edgestate geometry we are able to directly confirm the predicted penetration depth of a helical interface state into the 2d bulk of a qshi for a wellspecified crystallographic direction the clean wellordered topologicaltrivial interfaces observed here create new opportunities for testing predictions of the microscopic behavior of topologically protected boundary states without the complication of structural disorder | [['transition', 'metal', 'dichalcogenide', 'tmd', 'materials', 'are', 'unique', 'in', 'the', 'wide', 'variety', 'of', 'structural', 'and', 'electronic', 'phases', 'they', 'exhibit', 'in', 'the', 'twodimensional', '2d', 'singlelayer', 'limit', 'here', 'we', 'show', 'how', 'such', 'polymorphic', 'flexibility', 'can', 'be', 'used', 'to', 'achieve', 'topological', 'states', 'at', 'highly', 'ordered', 'phase', 'boundaries', 'in', 'a', 'new', 'quantum', 'spin', 'hall', 'insulator', 'qshi', '1twse2', 'we', 'observe', 'helical', 'states', 'at', 'the', 'crystallographicallyaligned', 'interface', 'between', 'quantum', 'a', 'spin', 'hall', 'insulating', 'domain', 'of', '1twse2', 'and', 'a', 'semiconducting', 'domain', 'of', '1hwse2', 'in', 'contiguous', 'single', 'layers', 'grown', 'using', 'molecular', 'beam', 'epitaxy', 'mbe', 'the', 'qshi', 'nature', 'of', 'singlelayer', '1twse2', 'was', 'verified', 'using', 'arpes', 'to', 'determine', 'band', 'inversion', 'around', 'a', '120', 'mev', 'energy', 'gap', 'as', 'well', 'as', 'stm', 'spectroscopy', 'to', 'directly', 'image', 'helical', 'edgestate', 'formation', 'using', 'this', 'new', 'edgestate', 'geometry', 'we', 'are', 'able', 'to', 'directly', 'confirm', 'the', 'predicted', 'penetration', 'depth', 'of', 'a', 'helical', 'interface', 'state', 'into', 'the', '2d', 'bulk', 'of', 'a', 'qshi', 'for', 'a', 'wellspecified', 'crystallographic', 'direction', 'the', 'clean', 'wellordered', 'topologicaltrivial', 'interfaces', 'observed', 'here', 'create', 'new', 'opportunities', 'for', 'testing', 'predictions', 'of', 'the', 'microscopic', 'behavior', 'of', 'topologically', 'protected', 'boundary', 'states', 'without', 'the', 'complication', 'of', 'structural', 'disorder']] | [-0.15086556724326192, 0.20048956009465665, -0.07556075659773216, 0.01585590033377146, -0.053985804369728, -0.18789012036179245, 0.08992916461074961, 0.4235276670419964, -0.31690626216774015, -0.2927377586408208, -0.008456175574489558, -0.2723350133158095, -0.14798196616727088, 0.1697365140981287, 0.046049854803787565, 0.095540585909099, -0.027685162213218838, -0.13931830632018632, -0.13982622259920036, -0.14608040657135304, 0.28168951709294454, -0.03429271174386015, 0.3648175416011149, 0.08125860555948497, 0.024016590233645992, -0.026184265508487736, 0.15836958521318048, 0.03940184910556879, -0.18628128666173796, 0.049763161547538216, 0.28774105970769176, -0.11458635811651147, 0.15887468395722582, -0.4899340780644581, -0.21274762268274508, -0.05551958348114985, 0.12760242641349484, 0.16179988035081147, -0.10439634348410343, -0.33248924597798063, 0.10451079605430921, -0.12940143497564413, -0.11493081094204695, -0.10515566087654396, -0.05918337707809205, -0.06926101114301161, -0.1948909021287771, 0.08099595746881831, 0.024119619367745888, 0.100818035777875, -0.06666212473278758, -0.08750759488260694, -0.13657139976182417, 0.10515939487390563, -0.0228424961819185, 0.04515014783995783, 0.15841831777234103, -0.14975673898562103, -0.15454215379217748, 0.3520460017453665, -0.01586660799562353, -0.11442964767566187, 0.20460026846725585, -0.18543972016250965, -0.08142102611433158, 0.16820172661508637, 0.11524964580794089, 0.09295642200654008, -0.09928606363580744, 0.05618956540349935, -0.032493714401739295, 0.196146748146449, 0.05547400395086185, 0.09086886691678872, 0.303254012890888, 0.20838332001184082, 0.035477291302883934, 0.17699481006751866, -0.15852410268458678, -0.02008596885596113, -0.19898414455525493, -0.2494650034959182, -0.26082312410975667, 0.08479494232438162, -0.0286610593790812, -0.24747025019532048, 0.4447517020938297, 0.12569365431166565, 0.17770772223426404, -0.06393794921071579, 0.21529034737513625, 0.05714890864897177, 0.06660744603994254, 0.009560256305247032, 0.21577400253983964, 0.1400495855453499, 0.09920739537458224, -0.23484497491321152, 0.09084749503874745, -0.012355981519092517] |
1,802.0134 | Experimental Constraints On The Fatigue of Icy Satellite Lithospheres by
Tidal Forces | Fatigue can cause materials that undergo cyclic loading to experience brittle
failure at much lower stresses than under monotonic loading. We propose that
the lithospheres of icy satellites could become fatigued and thus weakened by
cyclical tidal stresses. To test this hypothesis, we performed a series of
laboratory experiments to measure the fatigue of water ice at temperatures of
$198$ K and $233$ K and at a loading frequency of $1$ Hz. We find that ice is
\textit{not} susceptible to fatigue at our experimental conditions and that the
brittle failure stress does not decrease with increasing number of loading
cycles. Even though fatigue was not observed at our experimental conditions,
colder temperatures, lower loading frequencies, and impurities in the ice
shells of icy satellites may increase the likelihood of fatigue crack growth.
We also explore other mechanisms that may explain the weak behavior of the
lithospheres of some icy satellites.
| astro-ph.EP | fatigue can cause materials that undergo cyclic loading to experience brittle failure at much lower stresses than under monotonic loading we propose that the lithospheres of icy satellites could become fatigued and thus weakened by cyclical tidal stresses to test this hypothesis we performed a series of laboratory experiments to measure the fatigue of water ice at temperatures of 198 k and 233 k and at a loading frequency of 1 hz we find that ice is textitnot susceptible to fatigue at our experimental conditions and that the brittle failure stress does not decrease with increasing number of loading cycles even though fatigue was not observed at our experimental conditions colder temperatures lower loading frequencies and impurities in the ice shells of icy satellites may increase the likelihood of fatigue crack growth we also explore other mechanisms that may explain the weak behavior of the lithospheres of some icy satellites | [['fatigue', 'can', 'cause', 'materials', 'that', 'undergo', 'cyclic', 'loading', 'to', 'experience', 'brittle', 'failure', 'at', 'much', 'lower', 'stresses', 'than', 'under', 'monotonic', 'loading', 'we', 'propose', 'that', 'the', 'lithospheres', 'of', 'icy', 'satellites', 'could', 'become', 'fatigued', 'and', 'thus', 'weakened', 'by', 'cyclical', 'tidal', 'stresses', 'to', 'test', 'this', 'hypothesis', 'we', 'performed', 'a', 'series', 'of', 'laboratory', 'experiments', 'to', 'measure', 'the', 'fatigue', 'of', 'water', 'ice', 'at', 'temperatures', 'of', '198', 'k', 'and', '233', 'k', 'and', 'at', 'a', 'loading', 'frequency', 'of', '1', 'hz', 'we', 'find', 'that', 'ice', 'is', 'textitnot', 'susceptible', 'to', 'fatigue', 'at', 'our', 'experimental', 'conditions', 'and', 'that', 'the', 'brittle', 'failure', 'stress', 'does', 'not', 'decrease', 'with', 'increasing', 'number', 'of', 'loading', 'cycles', 'even', 'though', 'fatigue', 'was', 'not', 'observed', 'at', 'our', 'experimental', 'conditions', 'colder', 'temperatures', 'lower', 'loading', 'frequencies', 'and', 'impurities', 'in', 'the', 'ice', 'shells', 'of', 'icy', 'satellites', 'may', 'increase', 'the', 'likelihood', 'of', 'fatigue', 'crack', 'growth', 'we', 'also', 'explore', 'other', 'mechanisms', 'that', 'may', 'explain', 'the', 'weak', 'behavior', 'of', 'the', 'lithospheres', 'of', 'some', 'icy', 'satellites']] | [-0.1352076483797282, 0.24675068626801172, -0.08882383031460146, 0.020494510304803648, -0.060528729977086186, -0.10154284562294681, 0.07565244506734113, 0.3864063955253611, -0.21622768466050427, -0.29108087248479325, 0.08814243241446093, -0.25408044286072257, -0.1217047850213324, 0.19410591203719377, -0.0828193982814749, 0.009203589356814822, 0.05393717974036311, -0.03294325418847924, -0.06226971081147591, -0.27796059450445076, 0.20938420880120248, 0.11167245408209661, 0.2816730951021115, 0.07821994142063583, 0.017110496764071285, -0.08881463591164598, 0.08238011769484728, 0.0027330671064555645, -0.18126253811919013, 0.017029875659694275, 0.2551839575196694, 0.06053128494415432, 0.2470186198502779, -0.5137505715278288, -0.23156270377958815, 0.11160682721218715, 0.09009085157110046, 0.07869290440964202, 0.003442019560219099, -0.19234657905452573, 0.10567362355068326, -0.1634553169971332, -0.15346771452886362, -0.007831178611765304, 0.07594113173894584, -0.014066894370674467, -0.2619667282537557, 0.12372601507522632, 0.09796893780119717, 0.14196364348754287, -0.1471527185011655, -0.1256813614287724, -0.06176751867402345, 0.04901012024531762, 0.12564692188364765, -0.026690376109715242, 0.27262143819282453, -0.07842912651288013, 0.0011974592382709185, 0.4176848292350769, -0.030630861203050395, -0.06301855335943402, 0.28499630066255727, -0.19296497597980003, -0.10643526565283537, 0.20794164841994645, 0.19133761927485465, 0.024836785656710467, -0.10708105565281585, -0.09831488287270379, 0.02797454361182948, 0.14576821049830566, 0.1375714981132963, -0.04332021227184062, 0.23820311247060696, 0.15466139166926343, 0.03778861245450874, 0.13289896192688805, -0.12161696176975965, 0.031067281574942172, -0.2494685715312759, -0.14224971864993374, -0.14935295349918307, 0.03770960702425024, -0.10768686252597642, -0.1400068789635164, 0.3018391547103723, 0.16958193452252696, 0.16172524424269796, 0.07138038788766911, 0.24790580459870398, 0.05177261343691498, 0.11033449789742007, 0.06626698756900927, 0.2893067227655168, 0.05860913332086057, 0.0976251112021661, -0.26535805765849846, 0.19565718540921806, -0.04004493321912984] |
1,802.01341 | Two Optical Coherence Tomography Systems detect Topical Gold
Nanoparticles in Hair follicles, Sweat Ducts and Measure Epidermis | Optical coherence tomography (OCT) is an established imaging technology for
in vivo skin investigation. Topical application of gold nanoshells (GNS)
provides contrast enhancement in OCT by generating a strong hyperreflective
signal from hair follicles and sweat glands, which are the natural skin
openings. This study explores the utility of 150 nm diameter GNS as contrast
agent for OCT imaging. GNS was massaged into skin and examined in four skin
areas of 11 healthy participants. A commercial OCT system and a prototype with
3 micron resolution (UHR-OCT) were employed to detect potential benefits of
increased resolution and variability in intensity generated from GNS. In both
OCT-systems GNS enhanced contrast from hair follicles and sweat ducts. Highest
average penetration depth of GNS was in armpit 0.64 mm plus/minus 0.17, maximum
penetration depth was 1.20 mm in hair follicles and 15-40 microns in sweat
ducts. Pixel intensity generated from GNS in hair follicles was significantly
higher in UHR-OCT images (p=0.002) and epidermal thickness significantly lower
0.14 vs. 0.16 mm (p=0.027). Hence topical application of GNS increases OCT
signals from natural skin openings. GNS may also increase sensitivity in OCT
diagnosis of certain skin diseases, which is to be examined in future studies.
| physics.med-ph | optical coherence tomography oct is an established imaging technology for in vivo skin investigation topical application of gold nanoshells gns provides contrast enhancement in oct by generating a strong hyperreflective signal from hair follicles and sweat glands which are the natural skin openings this study explores the utility of 150 nm diameter gns as contrast agent for oct imaging gns was massaged into skin and examined in four skin areas of 11 healthy participants a commercial oct system and a prototype with 3 micron resolution uhroct were employed to detect potential benefits of increased resolution and variability in intensity generated from gns in both octsystems gns enhanced contrast from hair follicles and sweat ducts highest average penetration depth of gns was in armpit 064 mm plusminus 017 maximum penetration depth was 120 mm in hair follicles and 1540 microns in sweat ducts pixel intensity generated from gns in hair follicles was significantly higher in uhroct images p0002 and epidermal thickness significantly lower 014 vs 016 mm p0027 hence topical application of gns increases oct signals from natural skin openings gns may also increase sensitivity in oct diagnosis of certain skin diseases which is to be examined in future studies | [['optical', 'coherence', 'tomography', 'oct', 'is', 'an', 'established', 'imaging', 'technology', 'for', 'in', 'vivo', 'skin', 'investigation', 'topical', 'application', 'of', 'gold', 'nanoshells', 'gns', 'provides', 'contrast', 'enhancement', 'in', 'oct', 'by', 'generating', 'a', 'strong', 'hyperreflective', 'signal', 'from', 'hair', 'follicles', 'and', 'sweat', 'glands', 'which', 'are', 'the', 'natural', 'skin', 'openings', 'this', 'study', 'explores', 'the', 'utility', 'of', '150', 'nm', 'diameter', 'gns', 'as', 'contrast', 'agent', 'for', 'oct', 'imaging', 'gns', 'was', 'massaged', 'into', 'skin', 'and', 'examined', 'in', 'four', 'skin', 'areas', 'of', '11', 'healthy', 'participants', 'a', 'commercial', 'oct', 'system', 'and', 'a', 'prototype', 'with', '3', 'micron', 'resolution', 'uhroct', 'were', 'employed', 'to', 'detect', 'potential', 'benefits', 'of', 'increased', 'resolution', 'and', 'variability', 'in', 'intensity', 'generated', 'from', 'gns', 'in', 'both', 'octsystems', 'gns', 'enhanced', 'contrast', 'from', 'hair', 'follicles', 'and', 'sweat', 'ducts', 'highest', 'average', 'penetration', 'depth', 'of', 'gns', 'was', 'in', 'armpit', '064', 'mm', 'plusminus', '017', 'maximum', 'penetration', 'depth', 'was', '120', 'mm', 'in', 'hair', 'follicles', 'and', '1540', 'microns', 'in', 'sweat', 'ducts', 'pixel', 'intensity', 'generated', 'from', 'gns', 'in', 'hair', 'follicles', 'was', 'significantly', 'higher', 'in', 'uhroct', 'images', 'p0002', 'and', 'epidermal', 'thickness', 'significantly', 'lower', '014', 'vs', '016', 'mm', 'p0027', 'hence', 'topical', 'application', 'of', 'gns', 'increases', 'oct', 'signals', 'from', 'natural', 'skin', 'openings', 'gns', 'may', 'also', 'increase', 'sensitivity', 'in', 'oct', 'diagnosis', 'of', 'certain', 'skin', 'diseases', 'which', 'is', 'to', 'be', 'examined', 'in', 'future', 'studies']] | [-0.011089286134273816, 0.14562868263567977, -0.026019957890877358, 0.024025871710350307, -0.013145513895851297, -0.11279378058866431, -0.019150613600579208, 0.39698447711192647, -0.19384659067608226, -0.3302929072640836, 0.12544360880095226, -0.32519811720420155, -0.13486279329428305, 0.1938001485923544, -0.18036882486194372, 0.025162290542935714, 0.036163438745559405, 0.011580784949593437, 0.01785895761030798, -0.16835535826006284, 0.17628513657225248, 0.04256762119789178, 0.37170571397321345, 0.061651272548792456, 0.09735639055240124, 0.014240609024925969, -0.039164535467250225, 0.031350242422941405, -0.12199507037592598, 0.12562637099517115, 0.3163210242891159, 0.12540372573436262, 0.22979294134017367, -0.3899884348281492, -0.1979506420258146, 0.056322013047070074, 0.16120067486145462, 0.019936311441378144, 0.00547319330358639, -0.31640502168104434, 0.07045729550837468, -0.10398545241795289, -0.07412808025793101, 0.05052270289056767, 0.09400744020568733, -0.030613764290673993, -0.2594851941374751, 0.1502239436160427, -0.03114922411309985, 0.18545839689337673, -0.15277409257892616, -0.1463204579660669, -0.025581455307129103, 0.13703273177051392, -0.03422043418559508, 0.09763487582572569, 0.2014881782615796, -0.20179010671085845, -0.053506384309058866, 0.27310597653715657, -0.03791238759011508, -0.07715303152799606, 0.1554859189555431, -0.17318186569385804, -0.01700818879270138, 0.21502933045610403, 0.13931902549707165, 0.09164974601605, -0.1257533608422352, -0.03142751547454212, 0.0036897698536706275, 0.2941586412823735, 0.20723699301672288, 0.033837777314086756, 0.17786447297638425, 0.24573598359293566, 0.0062360040986767186, 0.15463400952076206, -0.2452833395308027, 0.016362762527588087, -0.18478362002881626, -0.17290393845297589, -0.10734391317058067, 0.06097510567782686, -0.10596268793802338, -0.08528884720916931, 0.34300021004075043, 0.14348407947541908, 0.13363997308203043, 0.016898748600401747, 0.25263054479295627, 0.003250216154787594, 0.16762157474907163, -0.044444246532825325, 0.2653319960483947, 0.10672102931286925, 0.15879662105670342, -0.1936409192517973, -0.0011669612880676793, 0.00047694450865189234] |
1,802.01342 | Instanton dominance over $\alpha_s$ at low momenta from lattice QCD
simulations at $N_f=0$, $N_f=2+1$ and $N_f=2+1+1$ | We report on an instanton-based analysis of the gluon Green functions in the
Landau gauge for low momenta; in particular we use lattice results for
$\alpha_s$ in the symmetric momentum subtraction scheme (${\rm MOM}$) for
large-volume lattice simulations. We have exploited quenched gauge field
configurations, $N_f=0$, with both Wilson and tree-level Symanzik improved
actions, and unquenched ones with $N_f=2+1$ and $N_f=2+1+1$ dynamical flavors
(domain wall and twisted-mass fermions, respectively).
We show that the dominance of instanton correlations on the low-momenta gluon
Green functions can be applied to the determination of phenomenological
parameters of the instanton liquid and, eventually, to a determination of the
lattice spacing.
We furthermore apply the Gradient Flow to remove short-distance fluctuations.
The Gradient Flow gets rid of the QCD scale, $\Lambda_{\rm QCD}$, and reveals
that the instanton prediction extents to large momenta. For those gauge field
configurations free of quantum fluctuations, the direct study of topological
charge density shows the appearance of large-scale lumps that can be identified
as instantons, giving access to a direct study of the instanton density and
size distribution that is compatible with those extracted from the analysis of
the Green functions.
| hep-lat hep-ph | we report on an instantonbased analysis of the gluon green functions in the landau gauge for low momenta in particular we use lattice results for alpha_s in the symmetric momentum subtraction scheme rm mom for largevolume lattice simulations we have exploited quenched gauge field configurations n_f0 with both wilson and treelevel symanzik improved actions and unquenched ones with n_f21 and n_f211 dynamical flavors domain wall and twistedmass fermions respectively we show that the dominance of instanton correlations on the lowmomenta gluon green functions can be applied to the determination of phenomenological parameters of the instanton liquid and eventually to a determination of the lattice spacing we furthermore apply the gradient flow to remove shortdistance fluctuations the gradient flow gets rid of the qcd scale lambda_rm qcd and reveals that the instanton prediction extents to large momenta for those gauge field configurations free of quantum fluctuations the direct study of topological charge density shows the appearance of largescale lumps that can be identified as instantons giving access to a direct study of the instanton density and size distribution that is compatible with those extracted from the analysis of the green functions | [['we', 'report', 'on', 'an', 'instantonbased', 'analysis', 'of', 'the', 'gluon', 'green', 'functions', 'in', 'the', 'landau', 'gauge', 'for', 'low', 'momenta', 'in', 'particular', 'we', 'use', 'lattice', 'results', 'for', 'alpha_s', 'in', 'the', 'symmetric', 'momentum', 'subtraction', 'scheme', 'rm', 'mom', 'for', 'largevolume', 'lattice', 'simulations', 'we', 'have', 'exploited', 'quenched', 'gauge', 'field', 'configurations', 'n_f0', 'with', 'both', 'wilson', 'and', 'treelevel', 'symanzik', 'improved', 'actions', 'and', 'unquenched', 'ones', 'with', 'n_f21', 'and', 'n_f211', 'dynamical', 'flavors', 'domain', 'wall', 'and', 'twistedmass', 'fermions', 'respectively', 'we', 'show', 'that', 'the', 'dominance', 'of', 'instanton', 'correlations', 'on', 'the', 'lowmomenta', 'gluon', 'green', 'functions', 'can', 'be', 'applied', 'to', 'the', 'determination', 'of', 'phenomenological', 'parameters', 'of', 'the', 'instanton', 'liquid', 'and', 'eventually', 'to', 'a', 'determination', 'of', 'the', 'lattice', 'spacing', 'we', 'furthermore', 'apply', 'the', 'gradient', 'flow', 'to', 'remove', 'shortdistance', 'fluctuations', 'the', 'gradient', 'flow', 'gets', 'rid', 'of', 'the', 'qcd', 'scale', 'lambda_rm', 'qcd', 'and', 'reveals', 'that', 'the', 'instanton', 'prediction', 'extents', 'to', 'large', 'momenta', 'for', 'those', 'gauge', 'field', 'configurations', 'free', 'of', 'quantum', 'fluctuations', 'the', 'direct', 'study', 'of', 'topological', 'charge', 'density', 'shows', 'the', 'appearance', 'of', 'largescale', 'lumps', 'that', 'can', 'be', 'identified', 'as', 'instantons', 'giving', 'access', 'to', 'a', 'direct', 'study', 'of', 'the', 'instanton', 'density', 'and', 'size', 'distribution', 'that', 'is', 'compatible', 'with', 'those', 'extracted', 'from', 'the', 'analysis', 'of', 'the', 'green', 'functions']] | [-0.1503892817264913, 0.22364883134945748, -0.13939302776694174, 0.09872366075073123, -0.029488277741658846, -0.042220795571828555, 0.04756602791113485, 0.3838908562093581, -0.15677474148963627, -0.22965890423848145, 0.07241402810843857, -0.27276929642999004, -0.08413269959243112, 0.10490566598937699, 0.03112380608033977, 0.06103336603049875, 0.04219790793661224, -0.02468383552408532, -0.11501309983432292, -0.2208915615944486, 0.3490399783857069, 0.013958175205257967, 0.27872679860233085, 0.14321384448558092, 0.061754947305215815, 0.03380619774474517, -0.06531985954283491, 0.011734239801176284, -0.1350885579639764, 0.07365906717819407, 0.1670472376146599, -0.007551452922435649, 0.12200975829833433, -0.380885412691063, -0.20058245079493836, 0.062458393192163814, 0.1586047135244467, 0.14896481814794243, -0.019614919142699555, -0.27346748418640343, 0.09118511360044833, -0.1917804794909898, -0.1701429435070359, -0.15725942361413647, -0.04132426107228783, -0.00899081628932005, -0.31376951576063505, 0.0740531998318865, -0.07072838874071175, 0.03280499545691878, -0.02050163352886509, -0.1822175683453679, -0.06262921479922769, 0.12881656883615314, 0.10803026039655761, 0.107963273019873, 0.15074402727921934, -0.227369268375792, -0.14267850071436872, 0.41235797399851054, -0.09187453808814386, -0.1990321191615964, 0.1459933225825233, -0.1753764890808318, -0.1305373245384544, 0.1260064888838602, 0.1633874945146473, 0.11051917921163534, -0.10816908457475763, 0.11040344210264984, -0.041372593146087114, 0.18082562313954298, 0.08977083256468177, 0.042210179067363865, 0.21231556859259543, 0.10032791356972762, 0.03436861604476642, 0.12100312924992881, -0.05469896968968801, -0.15463566533044765, -0.3257513095575728, -0.09070555778269312, -0.16355870339504786, 0.103834884384598, -0.143736556251181, -0.1771013728777976, 0.38287015350381953, 0.15400489826784713, 0.19812445191323366, 0.051521198618176736, 0.25349328722804787, 0.10684959317349192, 0.11629774312145616, 0.038100879823200796, 0.21432298992294818, 0.15590990747227088, 0.09760990267815559, -0.3176869645383895, -0.12078280071973016, 0.14595683063135334] |
1,802.01343 | Chemical analysis of three barium stars: HD 51959, HD 88035, HD 121447 | We present elemental abundance results from high resolution spectral analysis
of three nitrogen-enhanced barium stars. The analysis is based on spectra
obtained with the FEROS attached to 1.52m telescope at ESO, Chile. The spectral
resolution is R~48000 and the spectral coverage spans from 3500-9000\AA\,. For
the objects HD 51959 and HD 88035, we present the first time abundance analyses
results. Although a few studies are available in literature on the object HD
121447, the results are significantly different from each other. We have
therefore carried out a detailed chemical composition study for this object
based on a high resolution spectrum with high S/N ratio, for a better
understanding of the origin of the abundance patterns observed in this star.
Stellar atmospheric parameters, the effective temperature, surface gravity,
microturbulence and metallicity of the stars are determined from the LTE
analysis using model atmospheres. The metallicity of HD 51959 and HD 88035 are
found to be near-solar; they exhibit enhanced abundances of neutron-capture
elements. HD 121447 is found to be moderately metal-poor with [Fe/H]=-0.65.
While carbon is near-solar in the other two objects, HD 121447 shows carbon
enhancement at a level, [C/Fe]=0.82. Neutron-capture elements are highly
enhanced with [X/Fe]>2 (X: Ba, La, Pr, Nd, Sm) in this object. The alpha- and
iron-peak elements show abundances very similar to field giants with the same
metallicity. From kinematic analysis all the three objects are found to be
members of thin disk population with a high probability of 0.99, 0.99 and 0.92
for HD 51959, HD 88035 and HD 121447 respectively.
| astro-ph.SR | we present elemental abundance results from high resolution spectral analysis of three nitrogenenhanced barium stars the analysis is based on spectra obtained with the feros attached to 152m telescope at eso chile the spectral resolution is r48000 and the spectral coverage spans from 35009000aa for the objects hd 51959 and hd 88035 we present the first time abundance analyses results although a few studies are available in literature on the object hd 121447 the results are significantly different from each other we have therefore carried out a detailed chemical composition study for this object based on a high resolution spectrum with high sn ratio for a better understanding of the origin of the abundance patterns observed in this star stellar atmospheric parameters the effective temperature surface gravity microturbulence and metallicity of the stars are determined from the lte analysis using model atmospheres the metallicity of hd 51959 and hd 88035 are found to be nearsolar they exhibit enhanced abundances of neutroncapture elements hd 121447 is found to be moderately metalpoor with feh065 while carbon is nearsolar in the other two objects hd 121447 shows carbon enhancement at a level cfe082 neutroncapture elements are highly enhanced with xfe2 x ba la pr nd sm in this object the alpha and ironpeak elements show abundances very similar to field giants with the same metallicity from kinematic analysis all the three objects are found to be members of thin disk population with a high probability of 099 099 and 092 for hd 51959 hd 88035 and hd 121447 respectively | [['we', 'present', 'elemental', 'abundance', 'results', 'from', 'high', 'resolution', 'spectral', 'analysis', 'of', 'three', 'nitrogenenhanced', 'barium', 'stars', 'the', 'analysis', 'is', 'based', 'on', 'spectra', 'obtained', 'with', 'the', 'feros', 'attached', 'to', '152m', 'telescope', 'at', 'eso', 'chile', 'the', 'spectral', 'resolution', 'is', 'r48000', 'and', 'the', 'spectral', 'coverage', 'spans', 'from', '35009000aa', 'for', 'the', 'objects', 'hd', '51959', 'and', 'hd', '88035', 'we', 'present', 'the', 'first', 'time', 'abundance', 'analyses', 'results', 'although', 'a', 'few', 'studies', 'are', 'available', 'in', 'literature', 'on', 'the', 'object', 'hd', '121447', 'the', 'results', 'are', 'significantly', 'different', 'from', 'each', 'other', 'we', 'have', 'therefore', 'carried', 'out', 'a', 'detailed', 'chemical', 'composition', 'study', 'for', 'this', 'object', 'based', 'on', 'a', 'high', 'resolution', 'spectrum', 'with', 'high', 'sn', 'ratio', 'for', 'a', 'better', 'understanding', 'of', 'the', 'origin', 'of', 'the', 'abundance', 'patterns', 'observed', 'in', 'this', 'star', 'stellar', 'atmospheric', 'parameters', 'the', 'effective', 'temperature', 'surface', 'gravity', 'microturbulence', 'and', 'metallicity', 'of', 'the', 'stars', 'are', 'determined', 'from', 'the', 'lte', 'analysis', 'using', 'model', 'atmospheres', 'the', 'metallicity', 'of', 'hd', '51959', 'and', 'hd', '88035', 'are', 'found', 'to', 'be', 'nearsolar', 'they', 'exhibit', 'enhanced', 'abundances', 'of', 'neutroncapture', 'elements', 'hd', '121447', 'is', 'found', 'to', 'be', 'moderately', 'metalpoor', 'with', 'feh065', 'while', 'carbon', 'is', 'nearsolar', 'in', 'the', 'other', 'two', 'objects', 'hd', '121447', 'shows', 'carbon', 'enhancement', 'at', 'a', 'level', 'cfe082', 'neutroncapture', 'elements', 'are', 'highly', 'enhanced', 'with', 'xfe2', 'x', 'ba', 'la', 'pr', 'nd', 'sm', 'in', 'this', 'object', 'the', 'alpha', 'and', 'ironpeak', 'elements', 'show', 'abundances', 'very', 'similar', 'to', 'field', 'giants', 'with', 'the', 'same', 'metallicity', 'from', 'kinematic', 'analysis', 'all', 'the', 'three', 'objects', 'are', 'found', 'to', 'be', 'members', 'of', 'thin', 'disk', 'population', 'with', 'a', 'high', 'probability', 'of', '099', '099', 'and', '092', 'for', 'hd', '51959', 'hd', '88035', 'and', 'hd', '121447', 'respectively']] | [-0.0538274860770193, 0.08799548265412895, -0.05141298823889746, 0.014954945881409474, -0.032493148848277136, -0.12933143839403333, 0.05908000054379621, 0.4221194400581943, -0.14511827384288686, -0.3439221931034718, 0.03032956086191909, -0.3247593977577628, -0.028426954238879608, 0.18215033414113183, -0.08179667804842866, -0.02578205721168983, 0.13569113573029756, -0.022245436135041288, -0.0407273088089298, -0.24356596929900556, 0.2737285687487973, 0.08544066931636804, 0.16634674516944326, -0.040576031422279626, -0.008955629831421156, -0.15681070177463363, -0.04807168630274584, -0.012725865587117188, -0.1456922954226662, 0.08378524509484905, 0.25140583759778556, 0.11239094424814698, 0.12291460610792575, -0.2971564902241279, -0.22404981446749275, 0.017523205883622883, 0.17189400597100712, 0.02589925891020339, -0.0887227780125345, -0.2520251887928383, 0.139456629783724, -0.15049830007072784, -0.12346285859130293, 0.02552178384461607, 0.021087492354663156, 0.0277876800310657, -0.2857080902118121, 0.06265409181459873, -0.00981723197338828, 0.2026641682296828, -0.12755889674141702, -0.2204867632427917, -0.09147576504132796, 0.1119715892505717, -0.003212062402190529, -0.003016098688492937, 0.0919583638391617, -0.062287260853384895, 0.026648884891454443, 0.43759524105190933, -0.16958493458114535, -0.04480257857647962, 0.245316646498743, -0.22918850909992755, -0.19944998216150892, 0.13473302340858515, 0.11522852328134722, 0.19872064609266074, -0.16020581075008886, 0.028206901649366, -0.010525341866448878, 0.23144597359061003, 0.059400949570576685, 0.07893698769751417, 0.28765441273595116, 0.15764809358193432, 0.011978561373100991, 0.009673269823623962, -0.22837375217317735, -0.03093302954893663, -0.1486610533795746, -0.15526083982048697, -0.06998982678902191, 0.042187216448638425, -0.14571483791449832, -0.11509405023258817, 0.3182931666252476, 0.11484919325686273, 0.2249152016644162, 0.0072862666269089, 0.2993280158982987, 0.0974638314093964, 0.07997466579628774, 0.08527969419251222, 0.27471362076030925, 0.18058833881908382, 0.12460236119731855, -0.268355648956295, 0.10737893119105602, 0.02251466162191088] |
1,802.01344 | Continuous-Domain Solutions of Linear Inverse Problems with Tikhonov vs.
Generalized TV Regularization | We consider linear inverse problems that are formulated in the continuous
domain. The object of recovery is a function that is assumed to minimize a
convex objective functional. The solutions are constrained by imposing a
continuous-domain regularization. We derive the parametric form of the solution
(representer theorems) for Tikhonov (quadratic) and generalized total-variation
(gTV) regularizations. We show that, in both cases, the solutions are splines
that are intimately related to the regularization operator. In the Tikhonov
case, the solution is smooth and constrained to live in a fixed subspace that
depends on the measurement operator. By contrast, the gTV regularization
results in a sparse solution composed of only a few dictionary elements that
are upper-bounded by the number of measurements and independent of the
measurement operator. Our findings for the gTV regularization resonates with
the minimization of the $l_1$ norm, which is its discrete counterpart and also
produces sparse solutions. Finally, we find the experimental solutions for some
measurement models in one dimension. We discuss the special case when the gTV
regularization results in multiple solutions and devise an algorithm to find an
extreme point of the solution set which is guaranteed to be sparse.
| cs.IT math.IT | we consider linear inverse problems that are formulated in the continuous domain the object of recovery is a function that is assumed to minimize a convex objective functional the solutions are constrained by imposing a continuousdomain regularization we derive the parametric form of the solution representer theorems for tikhonov quadratic and generalized totalvariation gtv regularizations we show that in both cases the solutions are splines that are intimately related to the regularization operator in the tikhonov case the solution is smooth and constrained to live in a fixed subspace that depends on the measurement operator by contrast the gtv regularization results in a sparse solution composed of only a few dictionary elements that are upperbounded by the number of measurements and independent of the measurement operator our findings for the gtv regularization resonates with the minimization of the l_1 norm which is its discrete counterpart and also produces sparse solutions finally we find the experimental solutions for some measurement models in one dimension we discuss the special case when the gtv regularization results in multiple solutions and devise an algorithm to find an extreme point of the solution set which is guaranteed to be sparse | [['we', 'consider', 'linear', 'inverse', 'problems', 'that', 'are', 'formulated', 'in', 'the', 'continuous', 'domain', 'the', 'object', 'of', 'recovery', 'is', 'a', 'function', 'that', 'is', 'assumed', 'to', 'minimize', 'a', 'convex', 'objective', 'functional', 'the', 'solutions', 'are', 'constrained', 'by', 'imposing', 'a', 'continuousdomain', 'regularization', 'we', 'derive', 'the', 'parametric', 'form', 'of', 'the', 'solution', 'representer', 'theorems', 'for', 'tikhonov', 'quadratic', 'and', 'generalized', 'totalvariation', 'gtv', 'regularizations', 'we', 'show', 'that', 'in', 'both', 'cases', 'the', 'solutions', 'are', 'splines', 'that', 'are', 'intimately', 'related', 'to', 'the', 'regularization', 'operator', 'in', 'the', 'tikhonov', 'case', 'the', 'solution', 'is', 'smooth', 'and', 'constrained', 'to', 'live', 'in', 'a', 'fixed', 'subspace', 'that', 'depends', 'on', 'the', 'measurement', 'operator', 'by', 'contrast', 'the', 'gtv', 'regularization', 'results', 'in', 'a', 'sparse', 'solution', 'composed', 'of', 'only', 'a', 'few', 'dictionary', 'elements', 'that', 'are', 'upperbounded', 'by', 'the', 'number', 'of', 'measurements', 'and', 'independent', 'of', 'the', 'measurement', 'operator', 'our', 'findings', 'for', 'the', 'gtv', 'regularization', 'resonates', 'with', 'the', 'minimization', 'of', 'the', 'l_1', 'norm', 'which', 'is', 'its', 'discrete', 'counterpart', 'and', 'also', 'produces', 'sparse', 'solutions', 'finally', 'we', 'find', 'the', 'experimental', 'solutions', 'for', 'some', 'measurement', 'models', 'in', 'one', 'dimension', 'we', 'discuss', 'the', 'special', 'case', 'when', 'the', 'gtv', 'regularization', 'results', 'in', 'multiple', 'solutions', 'and', 'devise', 'an', 'algorithm', 'to', 'find', 'an', 'extreme', 'point', 'of', 'the', 'solution', 'set', 'which', 'is', 'guaranteed', 'to', 'be', 'sparse']] | [-0.10170714788568708, 0.027077700084415623, -0.06952845685270567, 0.06867473606044092, -0.07620058833764723, -0.14366953830736187, 0.007873958215499535, 0.370769415413722, -0.3138070937795326, -0.23138704151392747, 0.19043583082668006, -0.299943384128169, -0.18234245425615556, 0.16262590501767893, -0.11657974587347454, 0.09796954902002397, 0.0680961613292591, 0.04206079337745905, -0.10780908194824289, -0.24859026591771116, 0.3363681634529852, -0.002801188041503804, 0.23295213621324645, 0.022548483971219797, 0.12040872596478902, 0.005725215461391669, -0.007857048191512242, 0.026539512179881104, -0.0962643257114672, 0.1154390960979538, 0.25778665652534793, 0.13747449129702707, 0.3205859013809225, -0.3948430589949473, -0.21121855677129367, 0.1340710718662311, 0.11107413328658694, 0.06986191051964386, -0.04329369841740491, -0.22795563920233877, 0.10267013306251895, -0.10320686367937387, -0.09551749511215932, -0.10079257645620368, -0.04905826596973034, 0.03410420837865856, -0.36736814610851115, 0.09075139270101387, 0.04471009280054997, -0.023120618073078684, -0.14529242093424097, -0.11426918733363542, 0.03400406044555637, 0.027199633454289048, 0.07991336786415046, 0.05523723738793379, 0.07601553498803136, -0.12221827461288716, -0.0925601009792911, 0.34272844727622725, -0.0702799980304777, -0.30092472338046017, 0.15817240786571532, -0.09615024736103339, -0.1195676829546499, 0.08285680887802767, 0.15300059433166796, 0.1740378518923162, -0.13413243005208922, 0.12114346204415107, -0.07727905818476127, 0.15062025814654473, 0.0421915448581179, 0.025219092178994266, 0.0861434467518941, 0.12401907188244737, 0.15214984578331217, 0.1472799458917087, -0.05382384391776167, -0.09189035094892367, -0.3337401207037963, -0.10088371933819965, -0.22686034094016905, -0.012866196364092712, -0.1445467480168027, -0.1806033977856621, 0.37919014580906013, 0.1153359395189163, 0.22258232402464506, 0.07414570746059793, 0.2679281102254605, 0.18595296090703087, 0.05673212356483325, 0.08197154626489067, 0.24930530044157656, 0.11300258392539735, 0.030673136376460138, -0.2225210832993094, 0.025487078214997055, 0.12088810534168704] |
1,802.01345 | DP-GAN: Diversity-Promoting Generative Adversarial Network for
Generating Informative and Diversified Text | Existing text generation methods tend to produce repeated and "boring"
expressions. To tackle this problem, we propose a new text generation model,
called Diversity-Promoting Generative Adversarial Network (DP-GAN). The
proposed model assigns low reward for repeatedly generated text and high reward
for "novel" and fluent text, encouraging the generator to produce diverse and
informative text. Moreover, we propose a novel language-model based
discriminator, which can better distinguish novel text from repeated text
without the saturation problem compared with existing classifier-based
discriminators. The experimental results on review generation and dialogue
generation tasks demonstrate that our model can generate substantially more
diverse and informative text than existing baselines. The code is available at
https://github.com/lancopku/DPGAN
| cs.CL | existing text generation methods tend to produce repeated and boring expressions to tackle this problem we propose a new text generation model called diversitypromoting generative adversarial network dpgan the proposed model assigns low reward for repeatedly generated text and high reward for novel and fluent text encouraging the generator to produce diverse and informative text moreover we propose a novel languagemodel based discriminator which can better distinguish novel text from repeated text without the saturation problem compared with existing classifierbased discriminators the experimental results on review generation and dialogue generation tasks demonstrate that our model can generate substantially more diverse and informative text than existing baselines the code is available at httpsgithubcomlancopkudpgan | [['existing', 'text', 'generation', 'methods', 'tend', 'to', 'produce', 'repeated', 'and', 'boring', 'expressions', 'to', 'tackle', 'this', 'problem', 'we', 'propose', 'a', 'new', 'text', 'generation', 'model', 'called', 'diversitypromoting', 'generative', 'adversarial', 'network', 'dpgan', 'the', 'proposed', 'model', 'assigns', 'low', 'reward', 'for', 'repeatedly', 'generated', 'text', 'and', 'high', 'reward', 'for', 'novel', 'and', 'fluent', 'text', 'encouraging', 'the', 'generator', 'to', 'produce', 'diverse', 'and', 'informative', 'text', 'moreover', 'we', 'propose', 'a', 'novel', 'languagemodel', 'based', 'discriminator', 'which', 'can', 'better', 'distinguish', 'novel', 'text', 'from', 'repeated', 'text', 'without', 'the', 'saturation', 'problem', 'compared', 'with', 'existing', 'classifierbased', 'discriminators', 'the', 'experimental', 'results', 'on', 'review', 'generation', 'and', 'dialogue', 'generation', 'tasks', 'demonstrate', 'that', 'our', 'model', 'can', 'generate', 'substantially', 'more', 'diverse', 'and', 'informative', 'text', 'than', 'existing', 'baselines', 'the', 'code', 'is', 'available', 'at', 'httpsgithubcomlancopkudpgan']] | [0.012936438602680626, 0.03858190747229634, -0.026303456181677076, 0.13624218573609181, -0.1840410584537732, -0.20988851168973222, 0.011536151497952035, 0.4654470616699876, -0.26758696247093583, -0.33425501042658146, 0.029673665950729233, -0.3016054899398204, -0.15570054410512116, 0.20370360473716245, -0.15268914289520802, 0.06565195021664237, 0.14810217834111336, 0.04774736512141923, -0.013606730242352094, -0.24777108607268347, 0.29417699191987784, 0.02758261232494234, 0.3907811975458989, -0.0015590712931510564, 0.16730625007242836, -0.05904813198506966, -0.06491242182390713, -0.06095615838683705, -0.0612543970370704, 0.19288146957914504, 0.345997812578807, 0.2352012547429416, 0.3036668574907356, -0.43961951155886725, -0.23095551821369645, 0.07088083751197602, 0.12758209555502142, 0.15586704497649292, -0.08994022669516576, -0.35999191829280275, 0.1527596938755229, -0.20262698913916005, 0.10977444449137594, -0.17856824788189418, -0.04294464838594567, -0.012985879754089658, -0.3668476892886935, 0.003619897611405667, 0.0884649395593442, 0.009767523782143185, 0.004644106171588908, -0.12124850678568085, 0.042953927571222454, 0.14762159778845604, 0.03838565798270776, 0.1309255609783839, 0.09238442151622663, -0.18498537117596464, -0.16449719602829432, 0.381325942640369, -0.07691085823197526, -0.20924041890785694, 0.19460557890544133, -0.004458759204476132, -0.12603640425027357, 0.08585000883888554, 0.2476895376116977, 0.15483713713852135, -0.14167929598474288, -0.0751739531125651, -0.03272089678458534, 0.212009667100066, 0.03306154411722411, -0.0012011229824106973, 0.18732058726720982, 0.2346897714074936, 0.009240685215404441, 0.15412038780522305, -0.10492768304565132, -0.04369512265799819, -0.20709382803892498, -0.05431543956804383, -0.16744080526955626, -0.026638878071009443, -0.08432403027613831, -0.13223224455020852, 0.4147515795151661, 0.3118828663451446, 0.19751903035537433, 0.15353339236032487, 0.35543127849630946, 0.022573641078706057, 0.07208492900958066, 0.057335685764498136, 0.09703715883094717, -0.07666583876503077, 0.1423107088493133, -0.12174466502147953, 0.12547686735906446, 0.039480545386034356] |
1,802.01346 | Deep Neural Network-based Cooperative Visual Tracking through Multiple
Micro Aerial Vehicles | Multi-camera full-body pose capture of humans and animals in outdoor
environments is a highly challenging problem. Our approach to it involves a
team of cooperating micro aerial vehicles (MAVs) with on-board cameras only.
The key enabling-aspect of our approach is the on-board person detection and
tracking method. Recent state-of-the-art methods based on deep neural networks
(DNN) are highly promising in this context. However, real time DNNs are
severely constrained in input data dimensions, in contrast to available camera
resolutions. Therefore, DNNs often fail at objects with small scale or far away
from the camera, which are typical characteristics of a scenario with aerial
robots. Thus, the core problem addressed in this paper is how to achieve
on-board, real-time, continuous and accurate vision-based detections using DNNs
for visual person tracking through MAVs. Our solution leverages cooperation
among multiple MAVs. First, each MAV fuses its own detections with those
obtained by other MAVs to perform cooperative visual tracking. This allows for
predicting future poses of the tracked person, which are used to selectively
process only the relevant regions of future images, even at high resolutions.
Consequently, using our DNN-based detector we are able to continuously track
even distant humans with high accuracy and speed. We demonstrate the efficiency
of our approach through real robot experiments involving two aerial robots
tracking a person, while maintaining an active perception-driven formation. Our
solution runs fully on-board our MAV's CPU and GPU, with no remote processing.
ROS-based source code is provided for the benefit of the community.
| cs.RO eess.IV | multicamera fullbody pose capture of humans and animals in outdoor environments is a highly challenging problem our approach to it involves a team of cooperating micro aerial vehicles mavs with onboard cameras only the key enablingaspect of our approach is the onboard person detection and tracking method recent stateoftheart methods based on deep neural networks dnn are highly promising in this context however real time dnns are severely constrained in input data dimensions in contrast to available camera resolutions therefore dnns often fail at objects with small scale or far away from the camera which are typical characteristics of a scenario with aerial robots thus the core problem addressed in this paper is how to achieve onboard realtime continuous and accurate visionbased detections using dnns for visual person tracking through mavs our solution leverages cooperation among multiple mavs first each mav fuses its own detections with those obtained by other mavs to perform cooperative visual tracking this allows for predicting future poses of the tracked person which are used to selectively process only the relevant regions of future images even at high resolutions consequently using our dnnbased detector we are able to continuously track even distant humans with high accuracy and speed we demonstrate the efficiency of our approach through real robot experiments involving two aerial robots tracking a person while maintaining an active perceptiondriven formation our solution runs fully onboard our mavs cpu and gpu with no remote processing rosbased source code is provided for the benefit of the community | [['multicamera', 'fullbody', 'pose', 'capture', 'of', 'humans', 'and', 'animals', 'in', 'outdoor', 'environments', 'is', 'a', 'highly', 'challenging', 'problem', 'our', 'approach', 'to', 'it', 'involves', 'a', 'team', 'of', 'cooperating', 'micro', 'aerial', 'vehicles', 'mavs', 'with', 'onboard', 'cameras', 'only', 'the', 'key', 'enablingaspect', 'of', 'our', 'approach', 'is', 'the', 'onboard', 'person', 'detection', 'and', 'tracking', 'method', 'recent', 'stateoftheart', 'methods', 'based', 'on', 'deep', 'neural', 'networks', 'dnn', 'are', 'highly', 'promising', 'in', 'this', 'context', 'however', 'real', 'time', 'dnns', 'are', 'severely', 'constrained', 'in', 'input', 'data', 'dimensions', 'in', 'contrast', 'to', 'available', 'camera', 'resolutions', 'therefore', 'dnns', 'often', 'fail', 'at', 'objects', 'with', 'small', 'scale', 'or', 'far', 'away', 'from', 'the', 'camera', 'which', 'are', 'typical', 'characteristics', 'of', 'a', 'scenario', 'with', 'aerial', 'robots', 'thus', 'the', 'core', 'problem', 'addressed', 'in', 'this', 'paper', 'is', 'how', 'to', 'achieve', 'onboard', 'realtime', 'continuous', 'and', 'accurate', 'visionbased', 'detections', 'using', 'dnns', 'for', 'visual', 'person', 'tracking', 'through', 'mavs', 'our', 'solution', 'leverages', 'cooperation', 'among', 'multiple', 'mavs', 'first', 'each', 'mav', 'fuses', 'its', 'own', 'detections', 'with', 'those', 'obtained', 'by', 'other', 'mavs', 'to', 'perform', 'cooperative', 'visual', 'tracking', 'this', 'allows', 'for', 'predicting', 'future', 'poses', 'of', 'the', 'tracked', 'person', 'which', 'are', 'used', 'to', 'selectively', 'process', 'only', 'the', 'relevant', 'regions', 'of', 'future', 'images', 'even', 'at', 'high', 'resolutions', 'consequently', 'using', 'our', 'dnnbased', 'detector', 'we', 'are', 'able', 'to', 'continuously', 'track', 'even', 'distant', 'humans', 'with', 'high', 'accuracy', 'and', 'speed', 'we', 'demonstrate', 'the', 'efficiency', 'of', 'our', 'approach', 'through', 'real', 'robot', 'experiments', 'involving', 'two', 'aerial', 'robots', 'tracking', 'a', 'person', 'while', 'maintaining', 'an', 'active', 'perceptiondriven', 'formation', 'our', 'solution', 'runs', 'fully', 'onboard', 'our', 'mavs', 'cpu', 'and', 'gpu', 'with', 'no', 'remote', 'processing', 'rosbased', 'source', 'code', 'is', 'provided', 'for', 'the', 'benefit', 'of', 'the', 'community']] | [-0.10335066561773419, 0.026979180446418467, -0.019288891337811948, -0.011198657616470882, -0.10819254974089564, -0.21449303408619017, 0.014171580597292632, 0.4672806182652712, -0.23270666151680053, -0.4035849036611617, 0.10289573750225828, -0.27999391808832297, -0.16736072209943087, 0.22986439075903037, -0.17987463625706732, 0.10517285895510577, 0.18768724539736287, 0.03621282241307199, 0.025334525731392204, -0.2558275396004319, 0.2328438126081601, 0.08923068547423463, 0.28071141612622885, -0.004452521508559584, 0.18080438326665899, -0.01911735121719539, -0.027466616604477165, -0.011666929610073566, -0.005793779242550954, 0.16850512642320245, 0.357508915392682, 0.1750327572375536, 0.287031206201762, -0.47334585203230384, -0.22346906784642487, 0.08008918857108802, 0.15535678443219514, 0.053534103384241465, -0.048120130887720734, -0.42799908062815667, 0.09978175292303786, -0.16735465579945594, -0.05175623434968293, -0.08338682152610272, -0.02941904478473589, 0.013637487608240918, -0.25684222879260776, 0.009180955966003239, -0.03418230897560716, 0.0699793199095875, -0.08434098349208943, -0.03333831220120192, 0.03960458416864276, 0.25108586813230066, 0.01709638072911184, 0.032187513050623236, 0.19622813322022556, -0.2191753657022491, -0.10703204177552834, 0.3942825795337558, 0.018176356255076825, -0.1967761577423662, 0.26177279274631293, -0.08322331225778908, -0.1334714554809034, 0.13852236467599868, 0.21852105855941772, 0.17776697427406907, -0.16390033392608166, -0.010334547941340134, -0.015926347859203816, 0.18888579629082233, 0.04231172534450889, -0.0023998354119248687, 0.217544832250569, 0.25998914599278944, 0.10759315159916878, 0.06759633485251107, -0.18324027031380682, -0.08974380051810295, -0.1680442443571519, -0.10245581155837863, -0.17581038969941437, -0.05253329851944, -0.061335468327335545, -0.0756221120300761, 0.3533163712024689, 0.2639131556954235, 0.17626868922356517, 0.11118311804998667, 0.4417243468016386, -0.011606191082391889, 0.10525703527859878, 0.09228022532630711, 0.22165624324418604, -0.051818371871020646, 0.17166222130926326, -0.17959383244207128, 0.07846845982363447, 0.01221489694621414] |
1,802.01347 | Hartman-Wintner-type inequality for fractional differential equations
with k-Prabhakar derivative | In present paper, Hartman-Wintner-type inequality is established for a
nonlocal fractional boundary value problem involving k-Prabhakar fractional
derivative.
| math.CA | in present paper hartmanwintnertype inequality is established for a nonlocal fractional boundary value problem involving kprabhakar fractional derivative | [['in', 'present', 'paper', 'hartmanwintnertype', 'inequality', 'is', 'established', 'for', 'a', 'nonlocal', 'fractional', 'boundary', 'value', 'problem', 'involving', 'kprabhakar', 'fractional', 'derivative']] | [-0.1694371992831721, -0.0021248737843159366, -0.030224691384800655, 0.062253059086608976, -0.18623009247376637, -0.19365506616475828, -0.037469742388245374, 0.24374324477770748, -0.3030630262459026, -0.2981868933009751, 0.21841134713716148, -0.27038993182427745, -0.16394416593453465, 0.16811388950137532, -0.1336364207570167, 0.1501343137694194, -0.018161341767100728, 0.003619565025848501, -0.0774945980622707, -0.12229637056589127, 0.39299093712778654, -0.1824946904774098, 0.1162092862650752, 0.11103713819209267, 0.10729007937890642, -0.0549276758752325, -0.046524985309909374, 0.02438076979973737, -0.24642509910935426, 0.1642194532939945, 0.2245226379703073, -0.07888195269248065, 0.4046243236345403, -0.41550966319354143, -0.24937995172598781, 0.14921891837216475, 0.05429494830177111, -0.021418292842367116, -0.04910541413461461, -0.2877582627184251, -0.0181474117014338, -0.10692930721458704, -0.22227350764853113, -0.0044600870460271835, 0.09570755776675309, -0.09526691750130233, -0.40146515167811336, 0.36107718035140457, -0.007764743038398378, 0.00613807886838913, -0.10955450935837101, -0.15870278766926596, 0.0908840327140163, -0.0640849352485555, 0.0037792964756269663, 0.0344404544790878, -0.040880627793205136, -0.13405626869815238, -0.20193033270976124, 0.29825065235662107, -0.09013736532891498, -0.31852310030337644, -0.005346556248910287, -0.1307933218229343, -0.16321012465392842, -0.006142977044445989, 0.10790839300983969, 0.21401627241250346, -0.2318286704556907, 0.12183607980499372, -0.06558769962558632, 0.10832563902744476, 0.11748131265973344, 0.05920107136754429, 0.018792998319601312, 0.12972861703704386, 0.27914702125331936, 0.25708769283750477, -0.013293145429890822, -0.1807720117709216, -0.40768777359934416, -0.2579833159551901, -0.22168129594887004, 0.08216312067473636, -0.07334413732785512, -0.16327117164345348, 0.2893201108364498, 0.1057311756645932, 0.030891919364769233, 0.09198652076370575, 0.16830121177960844, 0.3533757575513685, -0.060900378862724584, -0.005118213128298521, 0.15711959993795438, 0.16397054077071302, 0.24851366789901957, -0.23735603780540473, 0.06207846255069051, 0.2537906127707923] |
1,802.01348 | The interplay of phonon and exciton-mediated superconductivity in hybrid
semiconductor-superconductor structures | We predict a strong enhancement of the critical temperature in a conventional
Bardeen-Cooper-Schrieffer (BCS) superconductor in the presence of a bosonic
condensate of exciton-polaritons. The effect depends strongly on the ratio of
the cutoff frequencies for phonon and exciton-polariton mediated BCS
superconductivity, respectively. We also discuss a possible design of hybrid
semiconductor-superconductor structures suitable for the experimental
observation of such an effect.
| cond-mat.supr-con | we predict a strong enhancement of the critical temperature in a conventional bardeencooperschrieffer bcs superconductor in the presence of a bosonic condensate of excitonpolaritons the effect depends strongly on the ratio of the cutoff frequencies for phonon and excitonpolariton mediated bcs superconductivity respectively we also discuss a possible design of hybrid semiconductorsuperconductor structures suitable for the experimental observation of such an effect | [['we', 'predict', 'a', 'strong', 'enhancement', 'of', 'the', 'critical', 'temperature', 'in', 'a', 'conventional', 'bardeencooperschrieffer', 'bcs', 'superconductor', 'in', 'the', 'presence', 'of', 'a', 'bosonic', 'condensate', 'of', 'excitonpolaritons', 'the', 'effect', 'depends', 'strongly', 'on', 'the', 'ratio', 'of', 'the', 'cutoff', 'frequencies', 'for', 'phonon', 'and', 'excitonpolariton', 'mediated', 'bcs', 'superconductivity', 'respectively', 'we', 'also', 'discuss', 'a', 'possible', 'design', 'of', 'hybrid', 'semiconductorsuperconductor', 'structures', 'suitable', 'for', 'the', 'experimental', 'observation', 'of', 'such', 'an', 'effect']] | [-0.23602186944786338, 0.22336034704541466, -0.05741359617921614, 0.0604534254551606, -0.07785816481637378, -0.1358896005117605, 0.12980110259095748, 0.3288988983559032, -0.19195459715481247, -0.21787971676507545, -0.03853550463569381, -0.27109068711738915, -0.14197398961762026, 0.18338835481253843, 0.03997284560013683, 0.03743808570077583, -0.05289951431745243, 0.012836422500831465, -0.10233445970375361, -0.19448643617497216, 0.36580647780342146, 0.008367655896431497, 0.3934378521817346, 0.1550547327478266, 0.02019466870584555, 0.0019088723816938938, 0.13806253661882253, 0.015386549117524297, -0.14980362283606682, 0.050704320276817004, 0.22701792465522885, -0.0699802041448082, 0.2238579347369171, -0.422622226877138, -0.23622307366120718, 0.049525919039883924, 0.15866486160385032, 0.17649558742320345, -0.07460887929342026, -0.2965791014834277, 0.007685923498244055, -0.1705632962046131, -0.12603739915310494, -0.031430136530205696, -0.014547430354380799, -0.01860129221853229, -0.2937270325661126, 0.10525937463605642, 0.05083158176632658, 0.07986062813189722, -0.08041497600835658, -0.11954899078362712, 0.007409167817733701, -0.030351165877354723, 0.008363661266142321, 0.001047201255606788, 0.14345782482996583, -0.18601697475288906, -0.09102895074794369, 0.3639567869775478, -0.15702355143824412, -0.08043140040770654, 0.1839997111969898, -0.09147098717550116, -0.04575939829491319, 0.11772936525484247, 0.12841466060208698, 0.0768943318361116, -0.09385719839783926, 0.05781565185527377, -0.05228056172810255, 0.19056800740861124, 0.006703782267117452, 0.17024409063460846, 0.29131488602668526, 0.2754226024563034, -0.0002437909945823072, 0.16237653885036707, -0.128666530795125, -0.059581238567085575, -0.2788556559732364, -0.14980962000235223, -0.19925807405736357, 0.03529778422577487, -0.046898041746434534, -0.20560916842171742, 0.390787394619697, 0.18098120703812567, 0.1995995707449413, -0.03366221658765308, 0.24197358016165033, 0.171715983985773, 0.06514613612765266, 0.0013330760111491527, 0.315840995434912, 0.15279639647492477, 0.0710536164171513, -0.38513068725625355, -0.018825138122924873, -0.005933904355662244] |
1,802.01349 | Lyapunov type inequality for discrete fractional boundary value problem | In this paper, we obtain Lyapunov type inequality for discrete fractional
boundary value problem.
| math.CA | in this paper we obtain lyapunov type inequality for discrete fractional boundary value problem | [['in', 'this', 'paper', 'we', 'obtain', 'lyapunov', 'type', 'inequality', 'for', 'discrete', 'fractional', 'boundary', 'value', 'problem']] | [-0.12302304963980402, -0.009018615619944674, -0.08650399112541761, 0.0738239258644171, -0.14785718039742538, -0.20337422617844172, 0.048843846731220504, 0.2627285506044115, -0.3931231860603605, -0.2511790699458548, 0.23268367469011406, -0.20406060905328818, -0.19053616800478526, 0.19071365593533432, -0.193443511080529, 0.17280487237232073, 0.011232611989336354, 0.007405992065157209, -0.07543026950276856, -0.16498545464128256, 0.42466758670551435, -0.18948443154139177, 0.19926099805161357, 0.06973073578306607, 0.04080788451912148, -0.03048540385706084, -0.006885224687201636, 0.016510386019945145, -0.30751748773868065, 0.16244155438783178, 0.25960188758160385, 0.013736608970378126, 0.37721874564886093, -0.35966467218739645, -0.18317775481513568, 0.25926406861149837, 0.13799222611955234, 0.04297622273276959, -0.03858316011194672, -0.263768837920257, 0.08526927076413163, -0.10998166853096336, -0.2539218914295946, 0.017655836950455393, 0.03288296437157052, -0.08334190797592912, -0.3906834285174097, 0.2813567537149148, 0.007225350609847477, 0.05262689059600234, -0.21069055769060338, -0.08281495501952511, 0.1060083657503128, -0.004430294569049563, 0.027677416734929596, -0.013957984213318144, -0.010578599193000368, -0.022055004041508904, -0.1558297368298684, 0.24016633204051427, 0.0010459206200071744, -0.3351351371301072, 0.01194153433399541, -0.10433402178542954, -0.24993462328399932, 0.005277051723429135, 0.2112145232302802, 0.16652594174125365, -0.17939125447134888, 0.13130390557593533, -0.12094147954901148, 0.11860093088554484, 0.10496337924684797, 0.07426976785063744, -0.015030499348150832, 0.08842132320361477, 0.29868520776342067, 0.22733492191348756, -0.030400389664074674, -0.11779676723693099, -0.39291703860674587, -0.254151727738125, -0.22395625018647738, 0.13571810429649694, -0.13503491629048117, -0.19927416582192695, 0.3597456248743193, 0.1173777926181044, 0.0717284882308117, 0.20345557940059475, 0.15276121481188706, 0.3066666635817715, -0.13807347802711384, 0.06985001645183989, 0.1853466805602823, 0.12068938543753964, 0.23364049814907567, -0.20342692280454294, -0.002041132322379521, 0.3159367188678256] |
1,802.0135 | On cubic difference equations with variable coefficients and fading
stochastic perturbations | We consider the stochastically perturbed cubic difference equation with
variable coefficients \[ x_{n+1}=x_n(1-h_nx_n^2)+\rho_{n+1}\xi_{n+1}, \quad
n\in \mathbb N,\quad x_0\in \mathbb R. \] Here $(\xi_n)_{n\in \mathbb N}$ is a
sequence of independent random variables, and $(\rho_n)_{n\in \mathbb N}$ and
$(h_n)_{n\in \mathbb N}$ are sequences of nonnegative real numbers. We can stop
the sequence $(h_n)_{n\in \mathbb N}$ after some random time $\mathcal N$ so it
becomes a constant sequence, where the common value is an
$\mathcal{F}_\mathcal{N}$-measurable random variable. We derive conditions on
the sequences $(h_n)_{n\in \mathbb N}$, $(\rho_n)_{n\in \mathbb N}$ and
$(\xi_n)_{n\in \mathbb N}$, which guarantee that $\lim_{n\to \infty} x_n$
exists almost surely (a.s.), and that the limit is equal to zero a.s. for any
initial value $ x_0\in \mathbb R$.
| math.NA | we consider the stochastically perturbed cubic difference equation with variable coefficients x_n1x_n1h_nx_n2rho_n1xi_n1 quad nin mathbb nquad x_0in mathbb r here xi_n_nin mathbb n is a sequence of independent random variables and rho_n_nin mathbb n and h_n_nin mathbb n are sequences of nonnegative real numbers we can stop the sequence h_n_nin mathbb n after some random time mathcal n so it becomes a constant sequence where the common value is an mathcalf_mathcalnmeasurable random variable we derive conditions on the sequences h_n_nin mathbb n rho_n_nin mathbb n and xi_n_nin mathbb n which guarantee that lim_nto infty x_n exists almost surely as and that the limit is equal to zero as for any initial value x_0in mathbb r | [['we', 'consider', 'the', 'stochastically', 'perturbed', 'cubic', 'difference', 'equation', 'with', 'variable', 'coefficients', 'x_n1x_n1h_nx_n2rho_n1xi_n1', 'quad', 'nin', 'mathbb', 'nquad', 'x_0in', 'mathbb', 'r', 'here', 'xi_n_nin', 'mathbb', 'n', 'is', 'a', 'sequence', 'of', 'independent', 'random', 'variables', 'and', 'rho_n_nin', 'mathbb', 'n', 'and', 'h_n_nin', 'mathbb', 'n', 'are', 'sequences', 'of', 'nonnegative', 'real', 'numbers', 'we', 'can', 'stop', 'the', 'sequence', 'h_n_nin', 'mathbb', 'n', 'after', 'some', 'random', 'time', 'mathcal', 'n', 'so', 'it', 'becomes', 'a', 'constant', 'sequence', 'where', 'the', 'common', 'value', 'is', 'an', 'mathcalf_mathcalnmeasurable', 'random', 'variable', 'we', 'derive', 'conditions', 'on', 'the', 'sequences', 'h_n_nin', 'mathbb', 'n', 'rho_n_nin', 'mathbb', 'n', 'and', 'xi_n_nin', 'mathbb', 'n', 'which', 'guarantee', 'that', 'lim_nto', 'infty', 'x_n', 'exists', 'almost', 'surely', 'as', 'and', 'that', 'the', 'limit', 'is', 'equal', 'to', 'zero', 'as', 'for', 'any', 'initial', 'value', 'x_0in', 'mathbb', 'r']] | [-0.2372984187846834, 0.17395697622679027, 0.014882193742827936, -0.04242196667367931, -0.002171227498911321, -0.2173431854356419, -0.03609083298202181, 0.3544752274385907, -0.32788862760221077, -0.12418914313682101, 0.13177586061964658, -0.35544706315479496, -0.09167696839537133, 0.11089622883168472, -0.07436354652216488, 0.062159822020806714, -0.01058931728316979, 0.1310577557337555, -0.042027204517613756, -0.3551816056334329, 0.26970436167479916, -0.15327826744284143, 0.16338244619440626, -0.053652667470107024, 0.10671961755407128, 0.009440681990236044, 0.0572666226039556, -0.07314813709870743, -0.22242294946243585, -0.05107114692853594, 0.2068685030014339, 0.09879371082583517, 0.29881010536443103, -0.36498829688538204, -0.13813666824611243, 0.3136808284050362, 0.25142368256453085, -0.06295780865158039, 0.01611758952600543, -0.23396050395782697, 0.14272114799823613, -0.03935603477928618, -0.1652316872453825, -0.008660323045809161, 0.20869475434618917, 0.08357309632172638, -0.45300287071043965, 0.006216051277111877, 0.11745776245370507, 0.03860599011829684, 0.008165049430152232, -0.19204330320724033, -0.05229230671274391, 0.09732966466637498, -0.016185882585969837, 0.19952689381739633, 0.05624802196610042, 0.03539793931625106, -0.0156503959601237, 0.3645708626136184, -0.13310238293118098, -0.2741946011273698, 0.04512706821022386, -0.1772012390026992, -0.18525661315599626, 0.09026014948771759, 0.09470997630533846, 0.2124781784432178, -0.015020440561188893, 0.2841917099579322, -0.13677698984445835, 0.17153920588739724, 0.08552061597477983, 0.02631184219128706, 0.10232573146508499, 0.04601238052868708, 0.07986090232787485, 0.0802816319194707, -0.002274778114885769, -0.03439058487896215, -0.3917039102451368, -0.11846222403797914, -0.22288031852380796, 0.2527706308375028, -0.20649767817918804, -0.18091458767144517, 0.2292329146780751, 0.08641550169030035, 0.23414232168261978, 0.19430596565679562, 0.1879483282682486, 0.11921947994481095, -0.066338155338202, 0.0819692214845087, -0.03277907911979128, 0.13641151774420657, 0.00578819590790028, -0.13480045632035895, 0.037648506835103034, 0.15340604928576135] |
1,802.01351 | Semimetal behavior of bilayer stanene | Stanene is a two-dimensional (2D) buckled honeycomb structure which has been
studied recently owing to its promising electronic properties for potential
electronic and spintronic applications in nanodevices. In this article, we
present a first-principles study of electronic properties of fluorinated
bilayer stanene. The effect of tensile strain, intrinsic spin-orbit, and van
der Waals interactions are considered within the framework of density
functional theory. The electronic band structure shows a very small overlap
between valence and conduction bands at the {\Gamma} point which is a
characteristic of semimetal in fluorinated bilayer stanene. A relatively high
value of tensile strain is needed to open an energy band gap in the electronic
band structure and the parity analysis reveals that the strained nanostructure
is a trivial insulator. According to our results, despite the monolayer
fluorinated stanene, the bilayer one is not an appropriate candidate for
topological insulator.
| cond-mat.mes-hall cond-mat.mtrl-sci physics.comp-ph | stanene is a twodimensional 2d buckled honeycomb structure which has been studied recently owing to its promising electronic properties for potential electronic and spintronic applications in nanodevices in this article we present a firstprinciples study of electronic properties of fluorinated bilayer stanene the effect of tensile strain intrinsic spinorbit and van der waals interactions are considered within the framework of density functional theory the electronic band structure shows a very small overlap between valence and conduction bands at the gamma point which is a characteristic of semimetal in fluorinated bilayer stanene a relatively high value of tensile strain is needed to open an energy band gap in the electronic band structure and the parity analysis reveals that the strained nanostructure is a trivial insulator according to our results despite the monolayer fluorinated stanene the bilayer one is not an appropriate candidate for topological insulator | [['stanene', 'is', 'a', 'twodimensional', '2d', 'buckled', 'honeycomb', 'structure', 'which', 'has', 'been', 'studied', 'recently', 'owing', 'to', 'its', 'promising', 'electronic', 'properties', 'for', 'potential', 'electronic', 'and', 'spintronic', 'applications', 'in', 'nanodevices', 'in', 'this', 'article', 'we', 'present', 'a', 'firstprinciples', 'study', 'of', 'electronic', 'properties', 'of', 'fluorinated', 'bilayer', 'stanene', 'the', 'effect', 'of', 'tensile', 'strain', 'intrinsic', 'spinorbit', 'and', 'van', 'der', 'waals', 'interactions', 'are', 'considered', 'within', 'the', 'framework', 'of', 'density', 'functional', 'theory', 'the', 'electronic', 'band', 'structure', 'shows', 'a', 'very', 'small', 'overlap', 'between', 'valence', 'and', 'conduction', 'bands', 'at', 'the', 'gamma', 'point', 'which', 'is', 'a', 'characteristic', 'of', 'semimetal', 'in', 'fluorinated', 'bilayer', 'stanene', 'a', 'relatively', 'high', 'value', 'of', 'tensile', 'strain', 'is', 'needed', 'to', 'open', 'an', 'energy', 'band', 'gap', 'in', 'the', 'electronic', 'band', 'structure', 'and', 'the', 'parity', 'analysis', 'reveals', 'that', 'the', 'strained', 'nanostructure', 'is', 'a', 'trivial', 'insulator', 'according', 'to', 'our', 'results', 'despite', 'the', 'monolayer', 'fluorinated', 'stanene', 'the', 'bilayer', 'one', 'is', 'not', 'an', 'appropriate', 'candidate', 'for', 'topological', 'insulator']] | [-0.19652157837279244, 0.10564702576913179, -0.056801703804214614, -0.008011238509223202, -0.037409706817319, -0.16235322616800354, 0.10984371055140703, 0.4477279240769955, -0.28797725537636626, -0.27542365570035243, -0.045812335887199476, -0.31208144791889936, -0.2269822874627102, 0.15318266704465108, 0.04154609312374507, 0.05737236518527627, 0.0015822864499770934, -0.13454991008944084, -0.11380474930532121, -0.1881335515774683, 0.2607374783935181, 0.056342187512200326, 0.3489315928357731, 0.15399740273844348, -0.02577673419889632, -0.008393779699367264, 0.19744924693885776, 0.03787402920670502, -0.19429251321824065, 0.11629705653629369, 0.2673647608413982, -0.23737006127905463, 0.2669048017689622, -0.4555042080658798, -0.2006319862816276, -0.06123338243924081, 0.06172020138506519, 0.1732631810931101, -0.09684539067610684, -0.2768650515224888, 0.12482745095621794, -0.17912047108822865, -0.09955817021222578, -0.10081465930448354, 0.02079258747269503, -0.04704882835924056, -0.17484200684096626, 0.09366301885650803, 0.0015151867345492872, 0.07997888930766647, -0.14292588049769014, -0.1575576199619617, -0.1526873073097603, 0.047691454891011946, 0.033302914727957815, 0.03882762348803226, 0.1945120292786871, -0.13662223988244981, -0.0893230125236894, 0.4643139068244232, -0.0021156090612445646, -0.09862207421489681, 0.1624525011963366, -0.12556671292016594, -0.11427677469651422, 0.14863598419793156, 0.07305341987133336, 0.038711232045898214, -0.12923823865720704, 0.15732397819616986, -0.018863498505096585, 0.18634893471304773, 0.01917741844307683, 0.13192635653993218, 0.278741019907304, 0.2404284581166899, 0.07837407638887978, 0.1371546796823774, -0.12033268375914001, 0.023387803898205876, -0.15585752069536182, -0.23523415781730567, -0.2985609472525539, 0.11449802266452025, -0.04542290134890613, -0.28222450132145444, 0.46928843929587555, 0.08634986804746506, 0.10338481660518381, -0.09021760135753236, 0.19502503369100546, 0.0888631149403712, 0.05834174025545104, 0.011296365093181117, 0.28562270214186153, 0.20048219011288085, 0.08391455162402256, -0.23447120660663737, 0.04957487553151117, -0.012161641182804791] |
1,802.01352 | Measurements and modeling of absorption by CO2+H2O mixtures in the
spectral region beyond the CO2 nu3-band head | In this work, we measured the absorption by CO2+H2O mixtures from 2400 to
2600 cm-1 which corresponds to the spectral region beyond the nu3 band head of
CO2. Transmission spectra of CO2 mixed with water vapor were recorded with a
high-resolution Fourier-transform spectrometer for various pressure,
temperature and concentration conditions. The continuum absorption by CO2 due
to the presence of water vapor was determined by subtracting from measured
spectra the contribution of local lines of both species, that of the continuum
of pure CO2 as well as of the self- and CO2-continua of water vapor induced by
the H2O-H2O and H2O-CO2 interactions. The obtained results are in very good
agreement with the unique previous measurement (in a narrower spectral range).
They confirm that the H2O-continuum of CO2 is significantly larger than that
observed for pure CO2. This continuum thus must be taken into account in
radiative transfer calculations for media involving CO2+H2O mixture. An
empirical model, using sub-Lorentzian line shapes based on some
temperature-dependent correction factors chi is proposed which enables an
accurate description of the experimental results.
| astro-ph.EP physics.chem-ph | in this work we measured the absorption by co2h2o mixtures from 2400 to 2600 cm1 which corresponds to the spectral region beyond the nu3 band head of co2 transmission spectra of co2 mixed with water vapor were recorded with a highresolution fouriertransform spectrometer for various pressure temperature and concentration conditions the continuum absorption by co2 due to the presence of water vapor was determined by subtracting from measured spectra the contribution of local lines of both species that of the continuum of pure co2 as well as of the self and co2continua of water vapor induced by the h2oh2o and h2oco2 interactions the obtained results are in very good agreement with the unique previous measurement in a narrower spectral range they confirm that the h2ocontinuum of co2 is significantly larger than that observed for pure co2 this continuum thus must be taken into account in radiative transfer calculations for media involving co2h2o mixture an empirical model using sublorentzian line shapes based on some temperaturedependent correction factors chi is proposed which enables an accurate description of the experimental results | [['in', 'this', 'work', 'we', 'measured', 'the', 'absorption', 'by', 'co2h2o', 'mixtures', 'from', '2400', 'to', '2600', 'cm1', 'which', 'corresponds', 'to', 'the', 'spectral', 'region', 'beyond', 'the', 'nu3', 'band', 'head', 'of', 'co2', 'transmission', 'spectra', 'of', 'co2', 'mixed', 'with', 'water', 'vapor', 'were', 'recorded', 'with', 'a', 'highresolution', 'fouriertransform', 'spectrometer', 'for', 'various', 'pressure', 'temperature', 'and', 'concentration', 'conditions', 'the', 'continuum', 'absorption', 'by', 'co2', 'due', 'to', 'the', 'presence', 'of', 'water', 'vapor', 'was', 'determined', 'by', 'subtracting', 'from', 'measured', 'spectra', 'the', 'contribution', 'of', 'local', 'lines', 'of', 'both', 'species', 'that', 'of', 'the', 'continuum', 'of', 'pure', 'co2', 'as', 'well', 'as', 'of', 'the', 'self', 'and', 'co2continua', 'of', 'water', 'vapor', 'induced', 'by', 'the', 'h2oh2o', 'and', 'h2oco2', 'interactions', 'the', 'obtained', 'results', 'are', 'in', 'very', 'good', 'agreement', 'with', 'the', 'unique', 'previous', 'measurement', 'in', 'a', 'narrower', 'spectral', 'range', 'they', 'confirm', 'that', 'the', 'h2ocontinuum', 'of', 'co2', 'is', 'significantly', 'larger', 'than', 'that', 'observed', 'for', 'pure', 'co2', 'this', 'continuum', 'thus', 'must', 'be', 'taken', 'into', 'account', 'in', 'radiative', 'transfer', 'calculations', 'for', 'media', 'involving', 'co2h2o', 'mixture', 'an', 'empirical', 'model', 'using', 'sublorentzian', 'line', 'shapes', 'based', 'on', 'some', 'temperaturedependent', 'correction', 'factors', 'chi', 'is', 'proposed', 'which', 'enables', 'an', 'accurate', 'description', 'of', 'the', 'experimental', 'results']] | [-0.00817963826270508, 0.13308187740605457, -0.03848827814583534, -0.002398563361327563, 0.03128168878943793, -0.0868067148274609, 0.057566394906856916, 0.41091171361505985, -0.20195637043033327, -0.3442637080645987, 0.07326840179806043, -0.2962613168837769, -0.052471812145584926, 0.1721492771830942, 0.011581244398008233, 0.017628493132069708, 0.0398459792137146, -0.060479261308376275, -0.019989395723678173, -0.1525866645973708, 0.27873958658942555, 0.10304658907066498, 0.2546454828019653, 0.112330612508314, 0.04811862478032708, -0.03458011765565191, -0.04111030389687845, 0.020111474612993854, -0.1411705450786394, 0.11108442635940655, 0.24557367622719278, 0.045493084333304845, 0.16727310829396758, -0.41574342051787033, -0.2717246315886067, 0.056602508654551846, 0.09228313067661864, 0.08867494164699954, -0.011930248358819102, -0.2666828172547477, 0.027297633779235185, -0.13391277561895548, -0.131587473867195, -0.04882852906627314, -0.009861928727477789, 0.0052647468740386625, -0.2927191879041493, 0.09980758223150457, 0.020703945179203792, 0.11785679972160973, -0.1468323739990592, -0.1878509121587766, -0.1071084072380992, 0.10380207736976445, 0.006982431372161955, -0.019615622466163975, 0.16958442638894278, -0.11405504874885082, -0.0330320238002709, 0.420214026506458, -0.1731842697801767, -0.0690800717690893, 0.20619694869699223, -0.17543880494444497, -0.07742937031068972, 0.2763982678550695, 0.10761450924245375, 0.10194642964850313, -0.16135349888886724, -0.002538629785246615, -0.059914154173540214, 0.21404722249135374, 0.09602591818464654, 0.031297208249993026, 0.2028204656285899, 0.13022949754127433, -0.0025439044620309556, 0.13498298621037974, -0.16376507744858307, -0.07242419279912221, -0.22594371920717615, -0.1479049640553837, -0.155219206727509, 0.027558358324957746, -0.06187369020896897, -0.11447569136574333, 0.34279648250767164, 0.09313140252904434, 0.21238189727067946, 0.0060063078866473265, 0.30432555928161104, 0.11932006505816908, 0.06841341916139104, 0.009580487879325769, 0.2679425982048269, 0.14577569806549165, 0.12365194025050316, -0.26144483884264313, 0.07472240363912923, -0.014092109368315765] |
1,802.01353 | Lie Transform--based Neural Networks for Dynamics Simulation and
Learning | In the article, we discuss the architecture of the polynomial neural network
that corresponds to the matrix representation of Lie transform. The matrix form
of Lie transform is an approximation of the general solution of the nonlinear
system of ordinary differential equations. The proposed architecture can be
trained with small data sets, extrapolate predictions outside the training
data, and provide a possibility for interpretation. We provide a theoretical
explanation of the proposed architecture, as well as demonstrate it in several
applications. We present the results of modeling and identification for both
simple and well-known dynamical systems, and more complicated examples from
price dynamics, chemistry, and accelerator physics. From a practical point of
view, we describe the training of a Lie transform--based neural network with a
small data set containing only 10 data points. We also demonstrate an
interpretation of the fitted neural network by converting it to a system of
differential equations.
| cs.NE cs.NA math.DS | in the article we discuss the architecture of the polynomial neural network that corresponds to the matrix representation of lie transform the matrix form of lie transform is an approximation of the general solution of the nonlinear system of ordinary differential equations the proposed architecture can be trained with small data sets extrapolate predictions outside the training data and provide a possibility for interpretation we provide a theoretical explanation of the proposed architecture as well as demonstrate it in several applications we present the results of modeling and identification for both simple and wellknown dynamical systems and more complicated examples from price dynamics chemistry and accelerator physics from a practical point of view we describe the training of a lie transformbased neural network with a small data set containing only 10 data points we also demonstrate an interpretation of the fitted neural network by converting it to a system of differential equations | [['in', 'the', 'article', 'we', 'discuss', 'the', 'architecture', 'of', 'the', 'polynomial', 'neural', 'network', 'that', 'corresponds', 'to', 'the', 'matrix', 'representation', 'of', 'lie', 'transform', 'the', 'matrix', 'form', 'of', 'lie', 'transform', 'is', 'an', 'approximation', 'of', 'the', 'general', 'solution', 'of', 'the', 'nonlinear', 'system', 'of', 'ordinary', 'differential', 'equations', 'the', 'proposed', 'architecture', 'can', 'be', 'trained', 'with', 'small', 'data', 'sets', 'extrapolate', 'predictions', 'outside', 'the', 'training', 'data', 'and', 'provide', 'a', 'possibility', 'for', 'interpretation', 'we', 'provide', 'a', 'theoretical', 'explanation', 'of', 'the', 'proposed', 'architecture', 'as', 'well', 'as', 'demonstrate', 'it', 'in', 'several', 'applications', 'we', 'present', 'the', 'results', 'of', 'modeling', 'and', 'identification', 'for', 'both', 'simple', 'and', 'wellknown', 'dynamical', 'systems', 'and', 'more', 'complicated', 'examples', 'from', 'price', 'dynamics', 'chemistry', 'and', 'accelerator', 'physics', 'from', 'a', 'practical', 'point', 'of', 'view', 'we', 'describe', 'the', 'training', 'of', 'a', 'lie', 'transformbased', 'neural', 'network', 'with', 'a', 'small', 'data', 'set', 'containing', 'only', '10', 'data', 'points', 'we', 'also', 'demonstrate', 'an', 'interpretation', 'of', 'the', 'fitted', 'neural', 'network', 'by', 'converting', 'it', 'to', 'a', 'system', 'of', 'differential', 'equations']] | [-0.08761257248069772, -0.016939095927419226, -0.08819436263078578, 0.06737502421770171, -0.09508646348350387, -0.1318882560444763, 0.030080547769198586, 0.3532085951270634, -0.2971425811931687, -0.31257744995558534, 0.10842165138456039, -0.2600109117338434, -0.2258868056845753, 0.2340002158093021, -0.05356853247595657, 0.07286238028226714, 0.10961052017304801, 0.045948914546706396, -0.07568760672247184, -0.21752671151127861, 0.32677083852774413, 0.02913059293611073, 0.26878985650469794, -0.0036716224276460707, 0.15090292292083368, -0.03797346525090305, -0.015213264866217383, -0.0151020958858824, -0.06464900784555395, 0.1493841866184467, 0.25964935103088227, 0.1839098372668224, 0.26150505068270785, -0.4441611943889017, -0.2010286360868792, 0.07514756621400777, 0.11512508112508313, 0.12324942741543055, -0.05706685634016283, -0.29424805654286357, 0.06288683753289086, -0.18329782994298607, -0.11394204826425075, -0.1395517907436251, -0.004074792417477032, 0.015545115582522397, -0.280931609995222, 0.025721643550289292, 0.06689297495770581, 0.05841698053317439, -0.08262529972891666, -0.10893497621949982, 0.01000085528664242, 0.09112257702815298, -0.020061367951137454, 0.006253318606851329, 0.10695178566904935, -0.13861012956936306, -0.11386544447343208, 0.3999755531059284, -0.050844645561913863, -0.2090493719243616, 0.16774742596010728, -0.11118840770857212, -0.12883769710376664, 0.10993408626803246, 0.22362052591205084, 0.08971008062546484, -0.18297315885597767, 0.06587348347123848, -0.0679580389773228, 0.1461685379998878, 0.004917550793738644, -0.003098828762104906, 0.17094476699084657, 0.263603339069768, 0.019490712405010862, 0.13832666009655345, -0.09017876933763833, -0.09031449596238274, -0.3252903584867262, -0.14271543611845883, -0.17608045516259918, 0.03329422583460415, -0.10650736440881078, -0.15680239397548384, 0.4085508499855151, 0.18255877748781227, 0.24603368238833928, 0.09254281798003879, 0.28868078224140364, 0.12377920003363167, 0.08556077086464747, 0.07323361118975108, 0.178753495409374, 0.12449363505584188, 0.11016898487363697, -0.16818836655415667, 0.018152485498974687, 0.05213056102787193] |
1,802.01354 | Interaction of phonons with discrete breather in strained graphene | We numerically analyze the interaction of small-amplitude phonon waves with
standing gap discrete breather (DB) in strained graphene. To make the system
support gap DB, strain is applied to create a gap in the phonon spectrum. We
only focus on the in-plane phonons and DB, so the issue is investigated under a
quasi-one-dimensional setup. It is found that, for the longitudinal sound waves
having frequencies below 6 THz, DB is transparent and thus no radiation of
energy from DB takes place; whereas for those sound waves with higher
frequencies within the acoustic (optical) phonon band, phonon is mainly
transmitted (reflected) by DB, and concomitantly, DB radiates its energy when
interacting with phonons. The latter case is supported by the fact that, the
sum of the transmitted and reflected phonon energy densities is noticeably
higher than that of the incident wave. Our results here may provide insight
into energy transport in graphene when the spatially localized nonlinear
vibration modes are presented.
| cond-mat.mes-hall physics.comp-ph | we numerically analyze the interaction of smallamplitude phonon waves with standing gap discrete breather db in strained graphene to make the system support gap db strain is applied to create a gap in the phonon spectrum we only focus on the inplane phonons and db so the issue is investigated under a quasionedimensional setup it is found that for the longitudinal sound waves having frequencies below 6 thz db is transparent and thus no radiation of energy from db takes place whereas for those sound waves with higher frequencies within the acoustic optical phonon band phonon is mainly transmitted reflected by db and concomitantly db radiates its energy when interacting with phonons the latter case is supported by the fact that the sum of the transmitted and reflected phonon energy densities is noticeably higher than that of the incident wave our results here may provide insight into energy transport in graphene when the spatially localized nonlinear vibration modes are presented | [['we', 'numerically', 'analyze', 'the', 'interaction', 'of', 'smallamplitude', 'phonon', 'waves', 'with', 'standing', 'gap', 'discrete', 'breather', 'db', 'in', 'strained', 'graphene', 'to', 'make', 'the', 'system', 'support', 'gap', 'db', 'strain', 'is', 'applied', 'to', 'create', 'a', 'gap', 'in', 'the', 'phonon', 'spectrum', 'we', 'only', 'focus', 'on', 'the', 'inplane', 'phonons', 'and', 'db', 'so', 'the', 'issue', 'is', 'investigated', 'under', 'a', 'quasionedimensional', 'setup', 'it', 'is', 'found', 'that', 'for', 'the', 'longitudinal', 'sound', 'waves', 'having', 'frequencies', 'below', '6', 'thz', 'db', 'is', 'transparent', 'and', 'thus', 'no', 'radiation', 'of', 'energy', 'from', 'db', 'takes', 'place', 'whereas', 'for', 'those', 'sound', 'waves', 'with', 'higher', 'frequencies', 'within', 'the', 'acoustic', 'optical', 'phonon', 'band', 'phonon', 'is', 'mainly', 'transmitted', 'reflected', 'by', 'db', 'and', 'concomitantly', 'db', 'radiates', 'its', 'energy', 'when', 'interacting', 'with', 'phonons', 'the', 'latter', 'case', 'is', 'supported', 'by', 'the', 'fact', 'that', 'the', 'sum', 'of', 'the', 'transmitted', 'and', 'reflected', 'phonon', 'energy', 'densities', 'is', 'noticeably', 'higher', 'than', 'that', 'of', 'the', 'incident', 'wave', 'our', 'results', 'here', 'may', 'provide', 'insight', 'into', 'energy', 'transport', 'in', 'graphene', 'when', 'the', 'spatially', 'localized', 'nonlinear', 'vibration', 'modes', 'are', 'presented']] | [-0.16671164767467417, 0.22435156318460941, -0.03752649530651979, 0.021677890042337822, -0.06167495814152062, -0.13137518694566097, 0.0826688014145475, 0.42793519475962966, -0.26003950129961595, -0.23399608511826955, 0.03125521435940755, -0.300276528194081, -0.11782076637609862, 0.22691937060444617, 0.03239814441622002, -0.010707992676543654, 0.058187369501683864, 0.003075246772095852, 0.0031357787564047614, -0.14574450576328674, 0.2661572879820596, 0.07003384381678188, 0.35505676596221747, 0.07371197952415968, 0.0530454653853667, 0.021011233296303545, 0.062084795579721685, -0.03783704332017805, -0.11748974126016946, 0.07118374738493002, 0.2750173046199052, -0.0465556246927008, 0.23754150244931224, -0.4294023486028891, -0.2702839850215241, 0.006757489329902455, 0.1546206647908548, 0.16682919003360439, -0.0011353806512488518, -0.2597403354579001, 0.0785444670036668, -0.1062909306041547, -0.11703615834121592, -0.004935510604991577, 0.004823411293909885, -0.00806197318888735, -0.20504988925822545, 0.1503462308901362, 0.0633412287425017, 0.03818088674161117, -0.10359605674966588, -0.12360278282649233, -0.11719254955678479, 0.031519569965530535, 0.056346437260799576, 0.00848460076667834, 0.13044018727669027, -0.08856014400516869, -0.04358840578352101, 0.41457554152002557, -0.0749817425898982, -0.15027949868672294, 0.16257913822628325, -0.16222244055534246, 0.06883073936915025, 0.24281015079468488, 0.1392563688219525, 0.047668851335765795, -0.11405064646005485, 0.031102019296668004, 0.03755164202311789, 0.23204883609141688, 0.16586471122282093, 0.11629798552276042, 0.21886793898884208, 0.1714789480138279, 0.038786299074126875, 0.15849059601750923, -0.10712535154016223, 0.0018351125399931334, -0.23686017802683637, -0.10973392616142519, -0.20089978931937366, 0.06767806980378736, -0.03357927683355229, -0.14000969936896582, 0.42935639528441244, 0.1295889439038092, 0.10428660108882468, 0.03326047429727623, 0.31610291977412996, 0.22320857805389097, 0.045570509904064235, 0.10853946003480815, 0.34710714222674144, 0.17220562531874747, 0.11311460597498808, -0.22804607973521343, -0.04868103784392588, -0.05810347852529958] |
1,802.01355 | A Galois connection between Turing jumps and limits | Limit computable functions can be characterized by Turing jumps on the input
side or limits on the output side. As a monad of this pair of adjoint
operations we obtain a problem that characterizes the low functions and dually
to this another problem that characterizes the functions that are computable
relative to the halting problem. Correspondingly, these two classes are the
largest classes of functions that can be pre or post composed to limit
computable functions without leaving the class of limit computable functions.
We transfer these observations to the lattice of represented spaces where it
leads to a formal Galois connection. We also formulate a version of this result
for computable metric spaces. Limit computability and computability relative to
the halting problem are notions that coincide for points and sequences, but
even restricted to continuous functions the former class is strictly larger
than the latter. On computable metric spaces we can characterize the functions
that are computable relative to the halting problem as those functions that are
limit computable with a modulus of continuity that is computable relative to
the halting problem. As a consequence of this result we obtain, for instance,
that Lipschitz continuous functions that are limit computable are automatically
computable relative to the halting problem. We also discuss 1-generic points as
the canonical points of continuity of limit computable functions, and we prove
that restricted to these points limit computable functions are computable
relative to the halting problem. Finally, we demonstrate how these results can
be applied in computable analysis.
| math.LO cs.LO | limit computable functions can be characterized by turing jumps on the input side or limits on the output side as a monad of this pair of adjoint operations we obtain a problem that characterizes the low functions and dually to this another problem that characterizes the functions that are computable relative to the halting problem correspondingly these two classes are the largest classes of functions that can be pre or post composed to limit computable functions without leaving the class of limit computable functions we transfer these observations to the lattice of represented spaces where it leads to a formal galois connection we also formulate a version of this result for computable metric spaces limit computability and computability relative to the halting problem are notions that coincide for points and sequences but even restricted to continuous functions the former class is strictly larger than the latter on computable metric spaces we can characterize the functions that are computable relative to the halting problem as those functions that are limit computable with a modulus of continuity that is computable relative to the halting problem as a consequence of this result we obtain for instance that lipschitz continuous functions that are limit computable are automatically computable relative to the halting problem we also discuss 1generic points as the canonical points of continuity of limit computable functions and we prove that restricted to these points limit computable functions are computable relative to the halting problem finally we demonstrate how these results can be applied in computable analysis | [['limit', 'computable', 'functions', 'can', 'be', 'characterized', 'by', 'turing', 'jumps', 'on', 'the', 'input', 'side', 'or', 'limits', 'on', 'the', 'output', 'side', 'as', 'a', 'monad', 'of', 'this', 'pair', 'of', 'adjoint', 'operations', 'we', 'obtain', 'a', 'problem', 'that', 'characterizes', 'the', 'low', 'functions', 'and', 'dually', 'to', 'this', 'another', 'problem', 'that', 'characterizes', 'the', 'functions', 'that', 'are', 'computable', 'relative', 'to', 'the', 'halting', 'problem', 'correspondingly', 'these', 'two', 'classes', 'are', 'the', 'largest', 'classes', 'of', 'functions', 'that', 'can', 'be', 'pre', 'or', 'post', 'composed', 'to', 'limit', 'computable', 'functions', 'without', 'leaving', 'the', 'class', 'of', 'limit', 'computable', 'functions', 'we', 'transfer', 'these', 'observations', 'to', 'the', 'lattice', 'of', 'represented', 'spaces', 'where', 'it', 'leads', 'to', 'a', 'formal', 'galois', 'connection', 'we', 'also', 'formulate', 'a', 'version', 'of', 'this', 'result', 'for', 'computable', 'metric', 'spaces', 'limit', 'computability', 'and', 'computability', 'relative', 'to', 'the', 'halting', 'problem', 'are', 'notions', 'that', 'coincide', 'for', 'points', 'and', 'sequences', 'but', 'even', 'restricted', 'to', 'continuous', 'functions', 'the', 'former', 'class', 'is', 'strictly', 'larger', 'than', 'the', 'latter', 'on', 'computable', 'metric', 'spaces', 'we', 'can', 'characterize', 'the', 'functions', 'that', 'are', 'computable', 'relative', 'to', 'the', 'halting', 'problem', 'as', 'those', 'functions', 'that', 'are', 'limit', 'computable', 'with', 'a', 'modulus', 'of', 'continuity', 'that', 'is', 'computable', 'relative', 'to', 'the', 'halting', 'problem', 'as', 'a', 'consequence', 'of', 'this', 'result', 'we', 'obtain', 'for', 'instance', 'that', 'lipschitz', 'continuous', 'functions', 'that', 'are', 'limit', 'computable', 'are', 'automatically', 'computable', 'relative', 'to', 'the', 'halting', 'problem', 'we', 'also', 'discuss', '1generic', 'points', 'as', 'the', 'canonical', 'points', 'of', 'continuity', 'of', 'limit', 'computable', 'functions', 'and', 'we', 'prove', 'that', 'restricted', 'to', 'these', 'points', 'limit', 'computable', 'functions', 'are', 'computable', 'relative', 'to', 'the', 'halting', 'problem', 'finally', 'we', 'demonstrate', 'how', 'these', 'results', 'can', 'be', 'applied', 'in', 'computable', 'analysis']] | [-0.10446192903396505, 0.12407526165598959, -0.09237737730365451, 0.16586085318268723, -0.07954711340529126, -0.10512026001728601, 0.08875411234229554, 0.3626696074337471, -0.3729863389593175, -0.21416826032131442, 0.11584849060122583, -0.25285293502681777, -0.13441270811384265, 0.24117046296889857, -0.11511894587453043, 0.061772730928219166, 0.03213259361053663, 0.03910576141490711, -0.1224258296342024, -0.2731416806845383, 0.38285966222651124, -0.05335391790415417, 0.20064619667534753, 0.07262925453682056, 0.10711953501899059, -0.0479174766425542, 0.0121406588985724, 0.05725346086913441, -0.1414008989999074, 0.11642927928290543, 0.2876014943467453, 0.19140538934702567, 0.27058680097051846, -0.36288551722220547, -0.1301008691409911, 0.20584395365774866, 0.12538047202158809, 0.06180979583071413, 0.03702570817673462, -0.2508982649351668, 0.14041119984411368, -0.12217171403705912, -0.09371677742295671, -0.11021197899648054, 0.026335773710894773, 0.04808245844383702, -0.27493452950652075, 0.03979568296606198, 0.11636766743213516, 0.03186560437673571, -0.08307975890595232, -0.06225490455211353, -0.013475999115566599, 0.13350406117319297, 0.014813850184638553, 0.08232220916231493, 0.11378019037253158, -0.11036257417670883, -0.11825927997953956, 0.3542687288434135, -0.05871370009850852, -0.27477061635389277, 0.19521227718594916, -0.12372064278607704, -0.15487592960304514, 0.08198860016702784, 0.13923540005577714, 0.14077536032102475, -0.09001276837148535, 0.11006572961408047, -0.10023169466257682, 0.1727548783065707, 0.12668075457244643, 0.08213002262747018, 0.1339696888508473, 0.05106198836638644, 0.11804556393607218, 0.20581994784260754, 0.026433842661025143, -0.11275197029288851, -0.34206975178837074, -0.13921870449997895, -0.1852997417486544, 0.04732910343894999, -0.09963793629357834, -0.22125904169300292, 0.33070376866926093, 0.13670180363059925, 0.17931134993665096, 0.20250545088825087, 0.23824358913006158, 0.20163804920221584, 0.01764588694199993, 0.07935884760511218, 0.19039558123533182, 0.12402524031592371, 0.0093024863043844, -0.13054230045728885, 0.0989464849167628, 0.1594942910706727] |
1,802.01356 | Di-Baryon from Instanton in Holographic QCD | We study the di-baryon in the holographic QCD. The di-baryon is composed of
six quarks and bound by the color interaction. In this paper, we adopt the
Sakai-Sugimoto (SS) model as the holographic QCD to study the di-baryon. The SS
model is formulated in a $\mathrm{D4}/\mathrm{D8}/\overline{\mathrm{D8}}$
system of the Type IIA string theory. It is expected that the di-baryon is
described by the 2-instanton configuration of the flavor symmetry on D8-branes
since the baryon number is identified as the instanton number. We will
construct the 't Hooft 2-instanton solution explicitly and use it to discuss
the stability of the di-baryon. An effective action of this model has not only
the Yang-Mills (YM) action but also the Chern-Simons (CS) action coming from
the CS action of probe D8-branes, and the CS action assigns $U(1)$ charges
associated with the baryon number to each instanton. As a result, we can see
that the di-baryon is unstable due to this $U(1)$ charge in the SS model.
| hep-th | we study the dibaryon in the holographic qcd the dibaryon is composed of six quarks and bound by the color interaction in this paper we adopt the sakaisugimoto ss model as the holographic qcd to study the dibaryon the ss model is formulated in a mathrmd4mathrmd8overlinemathrmd8 system of the type iia string theory it is expected that the dibaryon is described by the 2instanton configuration of the flavor symmetry on d8branes since the baryon number is identified as the instanton number we will construct the t hooft 2instanton solution explicitly and use it to discuss the stability of the dibaryon an effective action of this model has not only the yangmills ym action but also the chernsimons cs action coming from the cs action of probe d8branes and the cs action assigns u1 charges associated with the baryon number to each instanton as a result we can see that the dibaryon is unstable due to this u1 charge in the ss model | [['we', 'study', 'the', 'dibaryon', 'in', 'the', 'holographic', 'qcd', 'the', 'dibaryon', 'is', 'composed', 'of', 'six', 'quarks', 'and', 'bound', 'by', 'the', 'color', 'interaction', 'in', 'this', 'paper', 'we', 'adopt', 'the', 'sakaisugimoto', 'ss', 'model', 'as', 'the', 'holographic', 'qcd', 'to', 'study', 'the', 'dibaryon', 'the', 'ss', 'model', 'is', 'formulated', 'in', 'a', 'mathrmd4mathrmd8overlinemathrmd8', 'system', 'of', 'the', 'type', 'iia', 'string', 'theory', 'it', 'is', 'expected', 'that', 'the', 'dibaryon', 'is', 'described', 'by', 'the', '2instanton', 'configuration', 'of', 'the', 'flavor', 'symmetry', 'on', 'd8branes', 'since', 'the', 'baryon', 'number', 'is', 'identified', 'as', 'the', 'instanton', 'number', 'we', 'will', 'construct', 'the', 't', 'hooft', '2instanton', 'solution', 'explicitly', 'and', 'use', 'it', 'to', 'discuss', 'the', 'stability', 'of', 'the', 'dibaryon', 'an', 'effective', 'action', 'of', 'this', 'model', 'has', 'not', 'only', 'the', 'yangmills', 'ym', 'action', 'but', 'also', 'the', 'chernsimons', 'cs', 'action', 'coming', 'from', 'the', 'cs', 'action', 'of', 'probe', 'd8branes', 'and', 'the', 'cs', 'action', 'assigns', 'u1', 'charges', 'associated', 'with', 'the', 'baryon', 'number', 'to', 'each', 'instanton', 'as', 'a', 'result', 'we', 'can', 'see', 'that', 'the', 'dibaryon', 'is', 'unstable', 'due', 'to', 'this', 'u1', 'charge', 'in', 'the', 'ss', 'model']] | [-0.13898732696127677, 0.19135183361237826, -0.0865214972160988, 0.08813985925303737, -0.05487118815852803, -0.11940889258331024, 0.04398040570498022, 0.2844719834371198, -0.16636129777866954, -0.2577647275019507, 0.041429652063095054, -0.27488755977926604, -0.14732509237129865, 0.02537696860638094, -0.03285175384895772, 0.005686509084196541, -0.024629656294858235, 0.1416192950105283, -0.035377990434189203, -0.2496661264109512, 0.3156225806975633, 1.0748998325618899e-05, 0.24552841164079142, 0.09213724169266983, 0.06439876774476366, -0.022012108709136752, 0.0031043666108332064, -0.011308791523695178, -0.09780954134909751, 0.07712545917840871, 0.18850883296929496, 0.09786545937470166, 0.12006359119604555, -0.3876657720585788, -0.22194547107246537, 0.10830345529750544, 0.1615535151849715, 0.1797662767818811, -0.01445702669329678, -0.2896643871476191, 0.12018860302220521, -0.22828400063889553, -0.1432424531786801, -0.09210307801848058, 0.013948900902771061, -0.07952495443675181, -0.27943627536007615, 0.021123250397225922, -0.015756142973575905, -0.009522089416519825, -0.08725070829650745, -0.11802365235993002, -0.08241149422174655, 0.057691798584466304, 0.15071441292739618, 0.1532660616339063, 0.11294739685449402, -0.21365153155092914, -0.12941953536413714, 0.40012791144563264, -0.08662172586090215, -0.19807577538246185, 0.14012232665565466, -0.10451915321411762, -0.16002710344940888, 0.09119469026878754, 0.0937707178693797, 0.13750155839016256, -0.14578478517855362, 0.1861880601153536, -0.09100423824701527, 0.14589765921859824, 0.07169638041939054, 0.06277132093304803, 0.21888183679732476, 0.16960698298340582, 0.03371059872869472, 0.14230491138520354, -0.06401936436738669, -0.10948955518430713, -0.38104333983942495, -0.11740870521474711, -0.1581594113821615, 0.09398437468257302, -0.07621233136603184, -0.12993979135886852, 0.3765776157726227, 0.12036460395960241, 0.20091184519913904, -0.016792193542506478, 0.23531831444605536, 0.11200663071741807, 0.08325241848693363, 0.03350303186716871, 0.2518615064638528, 0.17452763264669072, 0.10533319320240468, -0.32405440783654543, -0.10157219817433853, 0.21106515190078187] |
1,802.01357 | Differential calculus on $\mathbf{h}$-deformed spaces | The ring $\text{Diff}_{\mathbf{h}}(n)$ of $\mathbf{h}$-deformed differential
operators appears in the theory of reduction algebras. In this thesis, we
construct the rings of generalized differential operators on the
$\mathbf{h}$-deformed vector spaces of $\mathfrak{gl}$-type. In contrast to the
$q$-deformed vector spaces for which the ring of differential operators is
unique up to an isomorphism, the general ring of $\mathbf{h}$-deformed
differential operators $\text{Diff}_{\mathbf{h},\sigma}(n)$ is labeled by a
rational function $\sigma$ in $n$ variables, satisfying an over-determined
system of finite-difference equations. We obtain the general solution of the
system. We show that the center of $\text{Diff}_{\mathbf{h},\sigma}(n)$ is a
ring of polynomials in $n$ variables. We construct an isomorphism between
certain localizations of $\text{Diff}_{\mathbf{h},\sigma}(n)$ and the Weyl
algebra $\text{W}_n$ extended by $n$ indeterminates. We present some conditions
for the irreducibility of the finite dimensional
$\text{Diff}_{\mathbf{h},\sigma}(n)$-modules. Finally, we discuss difficulties
for finding analogous constructions for the ring
$\text{Diff}_{\mathbf{h}}(n,N)$ formed by several copies of
$\text{Diff}_{\mathbf{h}}(n)$.
| math-ph math.MP math.QA math.RA math.RT | the ring textdiff_mathbfhn of mathbfhdeformed differential operators appears in the theory of reduction algebras in this thesis we construct the rings of generalized differential operators on the mathbfhdeformed vector spaces of mathfrakgltype in contrast to the qdeformed vector spaces for which the ring of differential operators is unique up to an isomorphism the general ring of mathbfhdeformed differential operators textdiff_mathbfhsigman is labeled by a rational function sigma in n variables satisfying an overdetermined system of finitedifference equations we obtain the general solution of the system we show that the center of textdiff_mathbfhsigman is a ring of polynomials in n variables we construct an isomorphism between certain localizations of textdiff_mathbfhsigman and the weyl algebra textw_n extended by n indeterminates we present some conditions for the irreducibility of the finite dimensional textdiff_mathbfhsigmanmodules finally we discuss difficulties for finding analogous constructions for the ring textdiff_mathbfhnn formed by several copies of textdiff_mathbfhn | [['the', 'ring', 'textdiff_mathbfhn', 'of', 'mathbfhdeformed', 'differential', 'operators', 'appears', 'in', 'the', 'theory', 'of', 'reduction', 'algebras', 'in', 'this', 'thesis', 'we', 'construct', 'the', 'rings', 'of', 'generalized', 'differential', 'operators', 'on', 'the', 'mathbfhdeformed', 'vector', 'spaces', 'of', 'mathfrakgltype', 'in', 'contrast', 'to', 'the', 'qdeformed', 'vector', 'spaces', 'for', 'which', 'the', 'ring', 'of', 'differential', 'operators', 'is', 'unique', 'up', 'to', 'an', 'isomorphism', 'the', 'general', 'ring', 'of', 'mathbfhdeformed', 'differential', 'operators', 'textdiff_mathbfhsigman', 'is', 'labeled', 'by', 'a', 'rational', 'function', 'sigma', 'in', 'n', 'variables', 'satisfying', 'an', 'overdetermined', 'system', 'of', 'finitedifference', 'equations', 'we', 'obtain', 'the', 'general', 'solution', 'of', 'the', 'system', 'we', 'show', 'that', 'the', 'center', 'of', 'textdiff_mathbfhsigman', 'is', 'a', 'ring', 'of', 'polynomials', 'in', 'n', 'variables', 'we', 'construct', 'an', 'isomorphism', 'between', 'certain', 'localizations', 'of', 'textdiff_mathbfhsigman', 'and', 'the', 'weyl', 'algebra', 'textw_n', 'extended', 'by', 'n', 'indeterminates', 'we', 'present', 'some', 'conditions', 'for', 'the', 'irreducibility', 'of', 'the', 'finite', 'dimensional', 'textdiff_mathbfhsigmanmodules', 'finally', 'we', 'discuss', 'difficulties', 'for', 'finding', 'analogous', 'constructions', 'for', 'the', 'ring', 'textdiff_mathbfhnn', 'formed', 'by', 'several', 'copies', 'of', 'textdiff_mathbfhn']] | [-0.2115606967700829, 0.05450272963422885, -0.05958466173451341, 0.039869468552585115, -0.04772192242220831, -0.10807796263358962, -0.04825447633301734, 0.29699559627153294, -0.33668315471609084, -0.21305635066466852, 0.10581274774019003, -0.26561615703968516, -0.13846690158366265, 0.16708518479439155, -0.09472857099059234, 0.018672339424727038, 0.015340597893465573, 0.09292381330931061, -0.1334225589812825, -0.27111891024864054, 0.433757578334312, -0.018625525133782656, 0.1813056489885588, -0.02075994039006846, 0.1407873327909431, 0.021898044814342554, -0.03107935881478266, -0.012227835107437322, -0.15272210279675766, 0.14414780598107568, 0.2784365894236851, 0.08108905499840391, 0.20970355948879266, -0.39824166723435195, -0.09534178588959114, 0.15183552332602862, 0.147120744350668, 0.061049379168150446, -0.03164725168608129, -0.265875621424155, 0.08360161797576388, -0.17277847815462402, -0.18880055595556616, -0.072207583828266, 0.08158810899763459, 0.0415831750109595, -0.305077731163359, 0.0166289643909205, 0.09422991570400101, 0.10291480337938583, -0.09553784913790057, -0.07347740358049969, -0.009390260335582663, 0.03801016048134737, -0.050101475521240016, -0.02008680924510872, 0.04873154793446228, -0.10072771877503969, -0.14928582119821032, 0.33546420230044866, -0.07750261507962804, -0.22724087687838876, 0.1069680384793122, -0.17297566647995527, -0.1424292481346974, 0.10173186567992391, 0.11336594997105044, 0.1700528802064864, -0.11002335885644589, 0.18105467809913484, -0.14434539026279056, 0.09466206020196821, 0.0769386970188836, 0.026836443588327825, 0.1215310406913771, 0.08991641284320766, 0.08715518614589597, 0.17234178883036677, 0.020364442766434183, -0.07901484932681598, -0.36495335397481077, -0.19770804577438214, -0.09792958676788799, 0.08274419759859292, -0.10835077869695608, -0.15827759129690452, 0.3891431348214687, 0.11687367733258058, 0.20682873248949019, 0.05193935814198815, 0.19723481592118844, 0.16247552589711758, 0.08930010877838226, 0.029881974193595454, 0.14217914282577931, 0.22587278011274642, 0.04280990138190838, -0.1867700532229591, -0.059870257303463036, 0.16867596394395534] |
1,802.01358 | A General Approach for Construction of Deterministic Compressive Sensing
Matrices | In this paper, deterministic construction of measurement matrices in
Compressive Sensing (CS) is considered. First, by employing the column
replacement concept, a theorem for construction of large minimum distance
linear codes containing all-one codewords is proposed. Then, by applying an
existing theorem over these linear codes, deterministic sensing matrices are
constructed. To evaluate this procedure, two examples of constructed sensing
matrices are presented. The first example contains a matrix of size
${{p}^{2}}\times {{p}^{3}}$ and coherence ${1}/{p}\;$, and the second one
comprises a matrix with the size $p\left( p-1 \right)\times {{p}^{3}}$ and
coherence ${1}/{\left( p-1 \right)}\;$, where $p$ is a prime integer. Based on
the Welch bound, both examples asymptotically achieve optimal results.
Moreover, by presenting a new theorem, the column replacement is used for
resizing any sensing matrix to a greater-size sensing matrix whose coherence is
calculated. Then, using an example, the outperformance of the proposed method
is compared to a well-known method. Simulation results show the satisfying
performance of the column replacement method either in created or resized
sensing matrices.
| eess.SP | in this paper deterministic construction of measurement matrices in compressive sensing cs is considered first by employing the column replacement concept a theorem for construction of large minimum distance linear codes containing allone codewords is proposed then by applying an existing theorem over these linear codes deterministic sensing matrices are constructed to evaluate this procedure two examples of constructed sensing matrices are presented the first example contains a matrix of size p2times p3 and coherence 1p and the second one comprises a matrix with the size pleft p1 righttimes p3 and coherence 1left p1 right where p is a prime integer based on the welch bound both examples asymptotically achieve optimal results moreover by presenting a new theorem the column replacement is used for resizing any sensing matrix to a greatersize sensing matrix whose coherence is calculated then using an example the outperformance of the proposed method is compared to a wellknown method simulation results show the satisfying performance of the column replacement method either in created or resized sensing matrices | [['in', 'this', 'paper', 'deterministic', 'construction', 'of', 'measurement', 'matrices', 'in', 'compressive', 'sensing', 'cs', 'is', 'considered', 'first', 'by', 'employing', 'the', 'column', 'replacement', 'concept', 'a', 'theorem', 'for', 'construction', 'of', 'large', 'minimum', 'distance', 'linear', 'codes', 'containing', 'allone', 'codewords', 'is', 'proposed', 'then', 'by', 'applying', 'an', 'existing', 'theorem', 'over', 'these', 'linear', 'codes', 'deterministic', 'sensing', 'matrices', 'are', 'constructed', 'to', 'evaluate', 'this', 'procedure', 'two', 'examples', 'of', 'constructed', 'sensing', 'matrices', 'are', 'presented', 'the', 'first', 'example', 'contains', 'a', 'matrix', 'of', 'size', 'p2times', 'p3', 'and', 'coherence', '1p', 'and', 'the', 'second', 'one', 'comprises', 'a', 'matrix', 'with', 'the', 'size', 'pleft', 'p1', 'righttimes', 'p3', 'and', 'coherence', '1left', 'p1', 'right', 'where', 'p', 'is', 'a', 'prime', 'integer', 'based', 'on', 'the', 'welch', 'bound', 'both', 'examples', 'asymptotically', 'achieve', 'optimal', 'results', 'moreover', 'by', 'presenting', 'a', 'new', 'theorem', 'the', 'column', 'replacement', 'is', 'used', 'for', 'resizing', 'any', 'sensing', 'matrix', 'to', 'a', 'greatersize', 'sensing', 'matrix', 'whose', 'coherence', 'is', 'calculated', 'then', 'using', 'an', 'example', 'the', 'outperformance', 'of', 'the', 'proposed', 'method', 'is', 'compared', 'to', 'a', 'wellknown', 'method', 'simulation', 'results', 'show', 'the', 'satisfying', 'performance', 'of', 'the', 'column', 'replacement', 'method', 'either', 'in', 'created', 'or', 'resized', 'sensing', 'matrices']] | [-0.10304610585684286, 0.09521505579965271, -0.032687168349238, 0.01112092065570109, 0.0064165972022558835, -0.20161555440692394, 0.024854944140979034, 0.3575116634574335, -0.2900784177431727, -0.24032607002676848, 0.15305425543132622, -0.26348226805053215, -0.16856547944275113, 0.1765109499286422, -0.10515582080629161, 0.08494300454279737, 0.036955428452176205, 0.0619307252797572, -0.12265350579503266, -0.2780667970121345, 0.2648228057249285, 0.04643300322487074, 0.2711521459524246, 0.0016016175614341217, 0.11649906338082955, 0.027576169692089453, -0.029483549670754547, -0.006266809841070105, -0.10033026040627566, 0.1259031381485436, 0.2744218185037265, 0.1774729114056112, 0.25860754178617806, -0.3726405789199121, -0.16703146439394914, 0.11758901931564597, 0.10566476677708767, 0.09474417824736413, -0.08821627138360567, -0.24644251724650315, 0.16259570237084786, -0.17714327970136176, -0.09267139045439442, -0.046836226894383264, 0.002951313933248029, -0.0031354828854091464, -0.3657607303822742, 0.020394386175800774, 0.07293350548647783, 0.038605729898656994, -0.05419985168195768, -0.18676543853738728, 0.0691479811198352, 0.07337687073741109, -0.03597666933201253, 0.009585096038576654, 0.10574252058971016, -0.025678652113514118, -0.1263039745773901, 0.35364027305999224, -0.05112188746057013, -0.20868962071699035, 0.09301656373256051, -0.07064341366674531, -0.11001695518874947, 0.1285791534026537, 0.12576774145435432, 0.1289755065268015, -0.10059085264254142, 0.10442891689188614, -0.09685603627551566, 0.17670667143538593, 0.10316371758578016, 0.024028198075864246, 0.08012122843441936, 0.12861356202184276, 0.10352789625141989, 0.14528407484416248, -0.07459546374809767, -0.05662791632160353, -0.2739944054491763, -0.14342968594762223, -0.28069789908168946, 0.04796743882445084, -0.12728628164186376, -0.14153731138828923, 0.35954914716455866, 0.11035414273741052, 0.18561710951959384, 0.09573724621030337, 0.31918958737788833, 0.08370655533748077, 0.07049895881346482, 0.08787363025305026, 0.1428256330463816, 0.20308561230708352, 0.023743790172396556, -0.17153041693741483, 0.03474188657230971, 0.14826308622654966] |
1,802.01359 | Numerical Analysis for Iterative Filtering with New Efficient
Implementations Based on FFT | Real life signals are in general non--stationary and non--linear. The
development of methods able to extract their hidden features in a fast and
reliable way is of high importance in many research fields. In this work we
tackle the problem of further analyzing the convergence of the Iterative
Filtering method both in a continuous and a discrete setting in order to
provide a comprehensive analysis of its behavior. Based on these results we
provide new ideas for efficient implementations of Iterative Filtering
algorithm which are based on Fast Fourier Transform (FFT), and the reduction of
the original iterative algorithm to a direct method.
| math.NA | real life signals are in general nonstationary and nonlinear the development of methods able to extract their hidden features in a fast and reliable way is of high importance in many research fields in this work we tackle the problem of further analyzing the convergence of the iterative filtering method both in a continuous and a discrete setting in order to provide a comprehensive analysis of its behavior based on these results we provide new ideas for efficient implementations of iterative filtering algorithm which are based on fast fourier transform fft and the reduction of the original iterative algorithm to a direct method | [['real', 'life', 'signals', 'are', 'in', 'general', 'nonstationary', 'and', 'nonlinear', 'the', 'development', 'of', 'methods', 'able', 'to', 'extract', 'their', 'hidden', 'features', 'in', 'a', 'fast', 'and', 'reliable', 'way', 'is', 'of', 'high', 'importance', 'in', 'many', 'research', 'fields', 'in', 'this', 'work', 'we', 'tackle', 'the', 'problem', 'of', 'further', 'analyzing', 'the', 'convergence', 'of', 'the', 'iterative', 'filtering', 'method', 'both', 'in', 'a', 'continuous', 'and', 'a', 'discrete', 'setting', 'in', 'order', 'to', 'provide', 'a', 'comprehensive', 'analysis', 'of', 'its', 'behavior', 'based', 'on', 'these', 'results', 'we', 'provide', 'new', 'ideas', 'for', 'efficient', 'implementations', 'of', 'iterative', 'filtering', 'algorithm', 'which', 'are', 'based', 'on', 'fast', 'fourier', 'transform', 'fft', 'and', 'the', 'reduction', 'of', 'the', 'original', 'iterative', 'algorithm', 'to', 'a', 'direct', 'method']] | [-0.06773418017201921, 0.0002100513660285658, -0.15664539182811832, 0.0726643777520224, -0.11485382844015811, -0.10354731785296237, 0.05243738110909618, 0.42065118396094126, -0.27632751148103657, -0.2912845041928361, 0.16654847375370418, -0.21264034704965296, -0.22149198967511358, 0.26191297731389407, -0.04864449180590296, 0.11274057182707163, 0.0596365373416632, 0.0028947313701580234, -0.0961944955283577, -0.2465211303488722, 0.23869256547751647, 0.05445381161729688, 0.31601346368467415, 0.004664374687211606, 0.10130763270449146, 0.01294047677961802, -0.11580893088548073, -0.02015527814301183, -0.06097519101837234, 0.20508043858046346, 0.26689385358262263, 0.17203573091407715, 0.3409760161800292, -0.43740032864644113, -0.19216761555414177, 0.07132066656084894, 0.15764493318907555, 0.13125368724328476, -0.10005652075814246, -0.27443648407289994, 0.11660393952274496, -0.11481796471781812, -0.07324017485314348, -0.1602215850997029, -0.03068034867620439, 0.03471489869808615, -0.29819082641449657, 0.07194340038701023, 0.08519728051145896, 0.036922240901051215, -0.04942700450050925, -0.07548558535009116, 0.09532580768364002, 0.11146162457095043, 0.03108968293448024, -0.005056573565172267, 0.08896695605922238, -0.10777344414964318, -0.14481199134674683, 0.36786319376918875, -0.05823086501094648, -0.21285777829261948, 0.20441498314889456, -0.06049768554806275, -0.17059623923387776, 0.1589234488681682, 0.2662720161680024, 0.16820793067335685, -0.14563167913482317, 0.06418518922562955, 0.005938690368230771, 0.12650131074784016, -0.011918481041505499, 0.02808398500964208, 0.13069091296022378, 0.19497164740459993, 0.09235100509560423, 0.13205553589669028, -0.07923096312250652, -0.0854323424435067, -0.2500132130005722, -0.17691837641799335, -0.19163402653688077, -0.03846060181176742, -0.07699405254363263, -0.1901592908481371, 0.44901892955152733, 0.2155868580691444, 0.19818433527088752, 0.03618608782343675, 0.3708808037443358, 0.12428152903878284, 0.014905015064869076, 0.07029010221199358, 0.1765015743632159, 0.12006424462368477, 0.1277581384604417, -0.2000402712480174, 0.020082503340198, 0.0871266055788881] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.