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.0256 | Cubic Preferences and the Character Admissibility Problem | In multiple-question referendum elections, the separability problem occurs
when a voter's preferences on some questions or proposals depend on the
predicted outcomes of others. The notion of separability formalizes the study
of interdependence in multidimensional preferences, and the character
admissibility problem deals with the construction of voter preferences with
given separability structures. In this paper, we develop a graph theoretic
approach to the character admissibilty problem, using Hamiltonian paths to
generate voter preferences. We apply this method specifically to the hypercube
graph, defining the class of cubic preferences. We then explore how the
algebraic structure of the group of symmetries of the hypercube impacts the
separability structures exhibited by cubic preferences. We prove that the
characters of cubic preferences satisfy set theoretic properties distinct from
those produced by previous methods, and we define two functions to construct
cubic preferences. Our results have potential applications to experimental work
involving election simulation.
| math.CO | in multiplequestion referendum elections the separability problem occurs when a voters preferences on some questions or proposals depend on the predicted outcomes of others the notion of separability formalizes the study of interdependence in multidimensional preferences and the character admissibility problem deals with the construction of voter preferences with given separability structures in this paper we develop a graph theoretic approach to the character admissibilty problem using hamiltonian paths to generate voter preferences we apply this method specifically to the hypercube graph defining the class of cubic preferences we then explore how the algebraic structure of the group of symmetries of the hypercube impacts the separability structures exhibited by cubic preferences we prove that the characters of cubic preferences satisfy set theoretic properties distinct from those produced by previous methods and we define two functions to construct cubic preferences our results have potential applications to experimental work involving election simulation | [['in', 'multiplequestion', 'referendum', 'elections', 'the', 'separability', 'problem', 'occurs', 'when', 'a', 'voters', 'preferences', 'on', 'some', 'questions', 'or', 'proposals', 'depend', 'on', 'the', 'predicted', 'outcomes', 'of', 'others', 'the', 'notion', 'of', 'separability', 'formalizes', 'the', 'study', 'of', 'interdependence', 'in', 'multidimensional', 'preferences', 'and', 'the', 'character', 'admissibility', 'problem', 'deals', 'with', 'the', 'construction', 'of', 'voter', 'preferences', 'with', 'given', 'separability', 'structures', 'in', 'this', 'paper', 'we', 'develop', 'a', 'graph', 'theoretic', 'approach', 'to', 'the', 'character', 'admissibilty', 'problem', 'using', 'hamiltonian', 'paths', 'to', 'generate', 'voter', 'preferences', 'we', 'apply', 'this', 'method', 'specifically', 'to', 'the', 'hypercube', 'graph', 'defining', 'the', 'class', 'of', 'cubic', 'preferences', 'we', 'then', 'explore', 'how', 'the', 'algebraic', 'structure', 'of', 'the', 'group', 'of', 'symmetries', 'of', 'the', 'hypercube', 'impacts', 'the', 'separability', 'structures', 'exhibited', 'by', 'cubic', 'preferences', 'we', 'prove', 'that', 'the', 'characters', 'of', 'cubic', 'preferences', 'satisfy', 'set', 'theoretic', 'properties', 'distinct', 'from', 'those', 'produced', 'by', 'previous', 'methods', 'and', 'we', 'define', 'two', 'functions', 'to', 'construct', 'cubic', 'preferences', 'our', 'results', 'have', 'potential', 'applications', 'to', 'experimental', 'work', 'involving', 'election', 'simulation']] | [-0.13015600918610923, 0.025730115047717723, -0.09970262586670434, 0.08615765253850728, -0.1695020300579951, -0.13160138916936798, 0.09563107712228701, 0.39036210776375446, -0.2949909055699288, -0.30264548837025995, 0.05547135730114634, -0.28391833900280244, -0.19607842121829572, 0.102338834399484, -0.1147940775642059, 0.03535370640269162, 0.0641971017615307, 0.05847802631644495, -0.043388569179059776, -0.3550613541847514, 0.387191015116813, -0.030269351250323272, 0.2648733396945684, 0.025601868195796774, 0.09001689140478637, 0.075896920401903, 0.0006595508182958868, 0.05629440693297242, -0.17957093912957514, 0.16389784699184007, 0.27112105529249064, 0.17910745108793896, 0.3237987110631903, -0.40563138881885763, -0.17623125726256314, 0.13682767187538963, 0.035963801017580725, 0.08839690934373659, -0.009046856957744032, -0.32256166588190016, 0.06877194439379761, -0.17197004270008545, -0.0991016076940218, -0.06841738052016137, -0.017767669042359862, 0.03117628354108861, -0.25039776872051256, 0.03446027568085182, 0.08793231451941728, 0.08000919694430976, -0.08445542192027197, -0.08938213696057952, -0.006502719591340462, 0.1093406606820684, 0.039197943773395666, -0.07267693340334566, 0.0894238992356664, -0.11942501623775723, -0.23065541487815322, 0.4242447540976557, 0.029568928098556078, -0.22689904355062734, 0.1428965033350775, -0.10968346896912627, -0.1981825336209192, 0.06066880782366099, 0.17886303954651492, 0.12632763565942995, -0.10540593567473466, 0.06475532270464796, -0.11917245979952132, 0.14603536083494256, 0.08414767738181672, 0.030164220074235443, 0.13668428491738518, 0.11375094857848181, 0.06461496505145634, 0.18509206382538998, 0.03209116942586765, -0.12567380143191992, -0.22945181382882515, -0.10848179448496757, -0.16075909520880688, 0.03492291002524954, -0.09488398230446334, -0.17734359056866983, 0.44426561116972224, 0.18076719416167913, 0.17424675848197518, 0.1062489278257462, 0.1957985301034825, 0.058973942305240314, 0.002215005971503838, 0.018778419084596955, 0.13776363370000172, 0.11650393029124845, 0.03267151394221407, -0.18895564896160824, 0.12602448211701575, 0.10144424768814804] |
1,802.02561 | Polisis: Automated Analysis and Presentation of Privacy Policies Using
Deep Learning | Privacy policies are the primary channel through which companies inform users
about their data collection and sharing practices. These policies are often
long and difficult to comprehend. Short notices based on information extracted
from privacy policies have been shown to be useful but face a significant
scalability hurdle, given the number of policies and their evolution over time.
Companies, users, researchers, and regulators still lack usable and scalable
tools to cope with the breadth and depth of privacy policies. To address these
hurdles, we propose an automated framework for privacy policy analysis
(Polisis). It enables scalable, dynamic, and multi-dimensional queries on
natural language privacy policies. At the core of Polisis is a privacy-centric
language model, built with 130K privacy policies, and a novel hierarchy of
neural-network classifiers that accounts for both high-level aspects and
fine-grained details of privacy practices. We demonstrate Polisis' modularity
and utility with two applications supporting structured and free-form querying.
The structured querying application is the automated assignment of privacy
icons from privacy policies. With Polisis, we can achieve an accuracy of 88.4%
on this task. The second application, PriBot, is the first freeform
question-answering system for privacy policies. We show that PriBot can produce
a correct answer among its top-3 results for 82% of the test questions. Using
an MTurk user study with 700 participants, we show that at least one of
PriBot's top-3 answers is relevant to users for 89% of the test questions.
| cs.CL cs.CR cs.HC | privacy policies are the primary channel through which companies inform users about their data collection and sharing practices these policies are often long and difficult to comprehend short notices based on information extracted from privacy policies have been shown to be useful but face a significant scalability hurdle given the number of policies and their evolution over time companies users researchers and regulators still lack usable and scalable tools to cope with the breadth and depth of privacy policies to address these hurdles we propose an automated framework for privacy policy analysis polisis it enables scalable dynamic and multidimensional queries on natural language privacy policies at the core of polisis is a privacycentric language model built with 130k privacy policies and a novel hierarchy of neuralnetwork classifiers that accounts for both highlevel aspects and finegrained details of privacy practices we demonstrate polisis modularity and utility with two applications supporting structured and freeform querying the structured querying application is the automated assignment of privacy icons from privacy policies with polisis we can achieve an accuracy of 884 on this task the second application pribot is the first freeform questionanswering system for privacy policies we show that pribot can produce a correct answer among its top3 results for 82 of the test questions using an mturk user study with 700 participants we show that at least one of pribots top3 answers is relevant to users for 89 of the test questions | [['privacy', 'policies', 'are', 'the', 'primary', 'channel', 'through', 'which', 'companies', 'inform', 'users', 'about', 'their', 'data', 'collection', 'and', 'sharing', 'practices', 'these', 'policies', 'are', 'often', 'long', 'and', 'difficult', 'to', 'comprehend', 'short', 'notices', 'based', 'on', 'information', 'extracted', 'from', 'privacy', 'policies', 'have', 'been', 'shown', 'to', 'be', 'useful', 'but', 'face', 'a', 'significant', 'scalability', 'hurdle', 'given', 'the', 'number', 'of', 'policies', 'and', 'their', 'evolution', 'over', 'time', 'companies', 'users', 'researchers', 'and', 'regulators', 'still', 'lack', 'usable', 'and', 'scalable', 'tools', 'to', 'cope', 'with', 'the', 'breadth', 'and', 'depth', 'of', 'privacy', 'policies', 'to', 'address', 'these', 'hurdles', 'we', 'propose', 'an', 'automated', 'framework', 'for', 'privacy', 'policy', 'analysis', 'polisis', 'it', 'enables', 'scalable', 'dynamic', 'and', 'multidimensional', 'queries', 'on', 'natural', 'language', 'privacy', 'policies', 'at', 'the', 'core', 'of', 'polisis', 'is', 'a', 'privacycentric', 'language', 'model', 'built', 'with', '130k', 'privacy', 'policies', 'and', 'a', 'novel', 'hierarchy', 'of', 'neuralnetwork', 'classifiers', 'that', 'accounts', 'for', 'both', 'highlevel', 'aspects', 'and', 'finegrained', 'details', 'of', 'privacy', 'practices', 'we', 'demonstrate', 'polisis', 'modularity', 'and', 'utility', 'with', 'two', 'applications', 'supporting', 'structured', 'and', 'freeform', 'querying', 'the', 'structured', 'querying', 'application', 'is', 'the', 'automated', 'assignment', 'of', 'privacy', 'icons', 'from', 'privacy', 'policies', 'with', 'polisis', 'we', 'can', 'achieve', 'an', 'accuracy', 'of', '884', 'on', 'this', 'task', 'the', 'second', 'application', 'pribot', 'is', 'the', 'first', 'freeform', 'questionanswering', 'system', 'for', 'privacy', 'policies', 'we', 'show', 'that', 'pribot', 'can', 'produce', 'a', 'correct', 'answer', 'among', 'its', 'top3', 'results', 'for', '82', 'of', 'the', 'test', 'questions', 'using', 'an', 'mturk', 'user', 'study', 'with', '700', 'participants', 'we', 'show', 'that', 'at', 'least', 'one', 'of', 'pribots', 'top3', 'answers', 'is', 'relevant', 'to', 'users', 'for', '89', 'of', 'the', 'test', 'questions']] | [-0.09029443728727625, -0.04736557667907773, -0.03848603865171366, 0.11399201990570873, -0.15025914292188083, -0.19535653533171268, 0.11531915096367927, 0.43601577682618764, -0.26803905676178474, -0.3862293609200006, 0.09746051531166156, -0.3030722216802075, -0.12860998465293186, 0.214439602100112, -0.17522223447053198, 0.10365849183897112, 0.0693793568938495, 0.029212445904441338, 0.012686436324122738, -0.32593661790039946, 0.32855607565650913, 0.06364807172460442, 0.3308651069149454, 0.08486145505919418, 0.10844846080364462, -0.01456952436896477, -0.04738241351070873, -0.011301542205755856, -0.07778190070849303, 0.194218828854587, 0.3769326286737193, 0.274974659110043, 0.3755423606234662, -0.3807171462856709, -0.12378329561745867, 0.015866765181751962, 0.1027252485187962, 0.09122838962852875, -0.057569584478326934, -0.33146123300365943, 0.13062234453143592, -0.1916516394413849, -0.02681204948495043, -0.1619155539952694, -0.03049610575854263, 0.006045404536149711, -0.2898858961929131, -0.021475219786504005, 0.035583279924615824, 0.10841542934761085, -0.03662746671062121, -0.0747861745841603, -0.0031985083040087783, 0.20836787508463764, 0.051363521637645036, -0.016376713339853636, 0.14961366775901394, -0.15584049222772903, -0.19681514654546342, 0.37517606871341297, 0.026985335355857388, -0.17054776392005225, 0.1757296015283073, -0.03542071073811422, -0.15483598305021432, 0.09254044179229977, 0.2499342874269287, 0.0912553578476481, -0.20505146634309215, 0.02500845795531975, -0.023806377696467842, 0.23413929847029455, 0.06772670724250852, 0.027927008073063607, 0.19156865598237577, 0.21521746131016853, 0.08420022756673713, 0.0733766749605259, -0.014389638473933682, -0.07521055362761972, -0.2076985318510932, -0.1420260528796055, -0.08793210094160539, 0.005800402257096102, -0.08730444300930917, -0.11757529921336793, 0.3824011526456935, 0.2257767468413457, 0.15983431670775122, 0.11001927020744064, 0.34109064819330864, 0.04200768177496626, 0.08875883890196998, 0.1424403754714381, 0.12638904047892133, -0.0029924652559009004, 0.16926040555241498, -0.14408060466397574, 0.151007179808902, -0.05078486611947734] |
1,802.02562 | Fair-by-design matching | Matching algorithms are used routinely to match donors to recipients for
solid organs transplantation, for the assignment of medical residents to
hospitals, record linkage in databases, scheduling jobs on machines, network
switching, online advertising, and image recognition, among others. Although
many optimal solutions may exist to a given matching problem, when the elements
that shall or not be included in a solution correspond to individuals, it
becomes of paramount importance that the solution be selected fairly. In this
paper we study individual fairness in matching problems. Given that many
maximum matchings may exist, each one satisfying a different set of
individuals, the only way to guarantee fairness is through randomization. Hence
we introduce the distributional maxmin fairness framework which provides, for
any given input instance, the strongest guarantee possible simultaneously for
all individuals in terms of satisfaction probability (the probability of being
matched in the solution). Specifically, a probability distribution over
feasible solutions is maxmin-fair if it is not possible to improve the
satisfaction probability of any individual without decreasing it for some other
individual which is no better off. In the special case of matchings in
bipartite graphs, our framework is equivalent to the egalitarian mechanism of
Bogomolnaia and Mouline. Our main contribution is a polynomial-time algorithm
for fair matching building on techniques from minimum cuts, and edge-coloring
algorithms for regular bipartite graphs, and transversal theory. For bipartite
graphs, our algorithm runs in $O((|V|^2 + |E||V|^{2/3}) \cdot (\log |V|)^2)$
expected time and scales to graphs with tens of millions of vertices and
hundreds of millions of edges. To the best of our knowledge, this provides the
first large-scale implementation of the egalitarian mechanism.
| cs.DS | matching algorithms are used routinely to match donors to recipients for solid organs transplantation for the assignment of medical residents to hospitals record linkage in databases scheduling jobs on machines network switching online advertising and image recognition among others although many optimal solutions may exist to a given matching problem when the elements that shall or not be included in a solution correspond to individuals it becomes of paramount importance that the solution be selected fairly in this paper we study individual fairness in matching problems given that many maximum matchings may exist each one satisfying a different set of individuals the only way to guarantee fairness is through randomization hence we introduce the distributional maxmin fairness framework which provides for any given input instance the strongest guarantee possible simultaneously for all individuals in terms of satisfaction probability the probability of being matched in the solution specifically a probability distribution over feasible solutions is maxminfair if it is not possible to improve the satisfaction probability of any individual without decreasing it for some other individual which is no better off in the special case of matchings in bipartite graphs our framework is equivalent to the egalitarian mechanism of bogomolnaia and mouline our main contribution is a polynomialtime algorithm for fair matching building on techniques from minimum cuts and edgecoloring algorithms for regular bipartite graphs and transversal theory for bipartite graphs our algorithm runs in ov2 ev23 cdot log v2 expected time and scales to graphs with tens of millions of vertices and hundreds of millions of edges to the best of our knowledge this provides the first largescale implementation of the egalitarian mechanism | [['matching', 'algorithms', 'are', 'used', 'routinely', 'to', 'match', 'donors', 'to', 'recipients', 'for', 'solid', 'organs', 'transplantation', 'for', 'the', 'assignment', 'of', 'medical', 'residents', 'to', 'hospitals', 'record', 'linkage', 'in', 'databases', 'scheduling', 'jobs', 'on', 'machines', 'network', 'switching', 'online', 'advertising', 'and', 'image', 'recognition', 'among', 'others', 'although', 'many', 'optimal', 'solutions', 'may', 'exist', 'to', 'a', 'given', 'matching', 'problem', 'when', 'the', 'elements', 'that', 'shall', 'or', 'not', 'be', 'included', 'in', 'a', 'solution', 'correspond', 'to', 'individuals', 'it', 'becomes', 'of', 'paramount', 'importance', 'that', 'the', 'solution', 'be', 'selected', 'fairly', 'in', 'this', 'paper', 'we', 'study', 'individual', 'fairness', 'in', 'matching', 'problems', 'given', 'that', 'many', 'maximum', 'matchings', 'may', 'exist', 'each', 'one', 'satisfying', 'a', 'different', 'set', 'of', 'individuals', 'the', 'only', 'way', 'to', 'guarantee', 'fairness', 'is', 'through', 'randomization', 'hence', 'we', 'introduce', 'the', 'distributional', 'maxmin', 'fairness', 'framework', 'which', 'provides', 'for', 'any', 'given', 'input', 'instance', 'the', 'strongest', 'guarantee', 'possible', 'simultaneously', 'for', 'all', 'individuals', 'in', 'terms', 'of', 'satisfaction', 'probability', 'the', 'probability', 'of', 'being', 'matched', 'in', 'the', 'solution', 'specifically', 'a', 'probability', 'distribution', 'over', 'feasible', 'solutions', 'is', 'maxminfair', 'if', 'it', 'is', 'not', 'possible', 'to', 'improve', 'the', 'satisfaction', 'probability', 'of', 'any', 'individual', 'without', 'decreasing', 'it', 'for', 'some', 'other', 'individual', 'which', 'is', 'no', 'better', 'off', 'in', 'the', 'special', 'case', 'of', 'matchings', 'in', 'bipartite', 'graphs', 'our', 'framework', 'is', 'equivalent', 'to', 'the', 'egalitarian', 'mechanism', 'of', 'bogomolnaia', 'and', 'mouline', 'our', 'main', 'contribution', 'is', 'a', 'polynomialtime', 'algorithm', 'for', 'fair', 'matching', 'building', 'on', 'techniques', 'from', 'minimum', 'cuts', 'and', 'edgecoloring', 'algorithms', 'for', 'regular', 'bipartite', 'graphs', 'and', 'transversal', 'theory', 'for', 'bipartite', 'graphs', 'our', 'algorithm', 'runs', 'in', 'ov2', 'ev23', 'cdot', 'log', 'v2', 'expected', 'time', 'and', 'scales', 'to', 'graphs', 'with', 'tens', 'of', 'millions', 'of', 'vertices', 'and', 'hundreds', 'of', 'millions', 'of', 'edges', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'provides', 'the', 'first', 'largescale', 'implementation', 'of', 'the', 'egalitarian', 'mechanism']] | [-0.11743403644974573, 0.03767516262265699, -0.05040906697539166, 0.08857200810998486, -0.1088812245636821, -0.16643679731442143, 0.11073137822859952, 0.41197690433252093, -0.25765499649603757, -0.3456896828484079, 0.08969642144560855, -0.30268300236335943, -0.11890213038493978, 0.15090017409125736, -0.11922311983878872, 0.0737567639452615, 0.1067316797905605, 0.08564696776271691, 0.036106799582682716, -0.3208962834519214, 0.26563114161015494, 0.02525291515332114, 0.279132350858703, 0.06012111491045993, 0.07621099220887789, 0.016662378109800067, 0.011983769945585516, 0.04153053472729269, -0.09507622308785854, 0.10901126947779745, 0.32964670792139544, 0.2321965596209043, 0.3111261063516552, -0.4072434319616244, -0.14067028577020005, 0.18607299830730165, 0.1331499742865528, 0.09519808627218283, -0.006222419073028538, -0.21285797082269187, 0.1278072391263797, -0.1362280187702212, -0.0547158045649556, -0.04378336768191844, 0.02214946492825982, 0.019099640949093135, -0.31795591413906027, 0.013557647818843816, 0.047513802230832375, 0.010335120935219846, -0.03946377630508763, -0.12488058411846593, 0.012279204133300048, 0.17033230950783104, 0.024317506264304102, 0.033083011258335106, 0.0782722102983329, -0.14138710162794815, -0.17198716026062413, 0.4147732898565456, 0.005652145578395369, -0.18458827156393112, 0.15557985623819046, -0.09290365833184266, -0.16424125379088467, 0.11549389814550738, 0.17669842287561274, 0.14827289103575023, -0.1681468957974219, 0.017310761653721966, -0.08281760602051949, 0.1555964769722509, 0.11102012643329387, 0.04215775602333921, 0.1482523300021722, 0.1642451954101697, 0.1622240261318217, 0.11269500798213285, 0.01363023294039703, -0.09268331764020177, -0.256048693588842, -0.12740141258957774, -0.17924102638784548, 0.012473773436446423, -0.14381000543207814, -0.17844805521615592, 0.39575362393488195, 0.1679976575512171, 0.15475459263842153, 0.11054843360522927, 0.29664654846258487, 0.061903576457083, 0.06439673771903029, 0.13882393731754547, 0.16839415613423114, 0.058864668356185965, 0.054488893073804785, -0.1776626491214654, 0.13308252868881773, 0.0401865833652003] |
1,802.02563 | A global linear and local superlinear/quadratic inexact non-interior
continuation method for variational inequalities | We use the concept of barrier-based smoothing approximations introduced in [
C. B. Chua and Z. Li, A barrier-based smoothing proximal point algorithm for
NCPs over closed convex cones, SIOPT 23(2), 2010] to extend the non-interior
continuation method proposed in [B. Chen and N. Xiu, A global linear and local
quadratic noninterior continuation method for nonlinear complementarity
problems based on Chen-Mangasarian smoothing functions, SIOPT 9(3), 1999] to an
inexact non-interior continuation method for variational inequalities over
general closed convex sets. Newton equations involved in the method are solved
inexactly to deal with high dimension problems. The method is proved to have
global linear and local superlinear/quadratic convergence under suitable
assumptions. We apply the method to non-negative orthants, positive
semidefinite cones, polyhedral sets, epigraphs of matrix operator norm cone and
epigraphs of matrix nuclear norm cone.
| math.OC | we use the concept of barrierbased smoothing approximations introduced in c b chua and z li a barrierbased smoothing proximal point algorithm for ncps over closed convex cones siopt 232 2010 to extend the noninterior continuation method proposed in b chen and n xiu a global linear and local quadratic noninterior continuation method for nonlinear complementarity problems based on chenmangasarian smoothing functions siopt 93 1999 to an inexact noninterior continuation method for variational inequalities over general closed convex sets newton equations involved in the method are solved inexactly to deal with high dimension problems the method is proved to have global linear and local superlinearquadratic convergence under suitable assumptions we apply the method to nonnegative orthants positive semidefinite cones polyhedral sets epigraphs of matrix operator norm cone and epigraphs of matrix nuclear norm cone | [['we', 'use', 'the', 'concept', 'of', 'barrierbased', 'smoothing', 'approximations', 'introduced', 'in', 'c', 'b', 'chua', 'and', 'z', 'li', 'a', 'barrierbased', 'smoothing', 'proximal', 'point', 'algorithm', 'for', 'ncps', 'over', 'closed', 'convex', 'cones', 'siopt', '232', '2010', 'to', 'extend', 'the', 'noninterior', 'continuation', 'method', 'proposed', 'in', 'b', 'chen', 'and', 'n', 'xiu', 'a', 'global', 'linear', 'and', 'local', 'quadratic', 'noninterior', 'continuation', 'method', 'for', 'nonlinear', 'complementarity', 'problems', 'based', 'on', 'chenmangasarian', 'smoothing', 'functions', 'siopt', '93', '1999', 'to', 'an', 'inexact', 'noninterior', 'continuation', 'method', 'for', 'variational', 'inequalities', 'over', 'general', 'closed', 'convex', 'sets', 'newton', 'equations', 'involved', 'in', 'the', 'method', 'are', 'solved', 'inexactly', 'to', 'deal', 'with', 'high', 'dimension', 'problems', 'the', 'method', 'is', 'proved', 'to', 'have', 'global', 'linear', 'and', 'local', 'superlinearquadratic', 'convergence', 'under', 'suitable', 'assumptions', 'we', 'apply', 'the', 'method', 'to', 'nonnegative', 'orthants', 'positive', 'semidefinite', 'cones', 'polyhedral', 'sets', 'epigraphs', 'of', 'matrix', 'operator', 'norm', 'cone', 'and', 'epigraphs', 'of', 'matrix', 'nuclear', 'norm', 'cone']] | [-0.0706074394765345, -0.05374920549458926, -0.08043464036576128, 0.09048829312327746, -0.07650641158321186, -0.1907747182224814, 0.03127072855508081, 0.3616201276435776, -0.3374422510623708, -0.20945866519053066, 0.10244317162743441, -0.25116006541941177, -0.1614954257506485, 0.18601040016243556, -0.10888240011618998, 0.14599743278178953, 0.04516945265345555, -0.06595090778782628, -0.16067240978556133, -0.32149799505626797, 0.2900540201147472, -0.02018776147353246, 0.19308957665864573, 0.04529971580845619, 0.14453054152261047, 0.0339503653130417, -0.02624243199895311, 0.04690530285531571, -0.130667019439371, 0.1339667212656573, 0.24984220283708178, 0.17642630189762248, 0.3412049022044538, -0.3682034831298025, -0.1295537622030597, 0.1326591084865307, 0.08564807457457248, 0.018086630054504463, -0.021537644484892655, -0.2776534373073706, 0.10070943061999374, -0.08146261600287337, -0.1574325940564723, -0.14970864880483428, 0.002381733771417066, 0.010036633227412639, -0.35818954132045655, 0.08146924977680962, 0.059502710119113886, 0.07448296020371153, -0.09411069362851462, -0.1720633152863571, 0.040028115737083876, -0.058443998558187674, 0.007488891727438099, 0.07499092099995569, 0.08100286552584485, 0.03749755142200598, -0.1209905089537396, 0.27447210344366896, -0.062349910152851976, -0.2704419015374567, 0.14991839595762244, -0.10237700839814051, -0.1347944777374877, 0.1362711123253842, 0.19769730700768137, 0.22015081548405097, -0.1257200125400047, 0.2135899871551866, -0.08605041273595386, 0.058248185569506235, 0.1117548476169376, -0.057717680799358184, 0.02756982685339854, 0.05065398871254428, 0.20238080377606465, 0.0842215470773609, -0.01429179987495527, -0.09972583778514142, -0.28210658420059354, -0.12265241092519093, -0.1967361029027436, 0.044589054976463934, -0.1415367224720907, -0.1747686948865316, 0.35532862621646627, 0.04092756540101385, 0.16029199590220264, 0.10239926394411272, 0.24020415231676534, 0.11098902483288675, 0.014890284209225075, 0.13435629870448457, 0.17689771401779936, 0.2190342364146521, 0.0722117532601342, -0.2197470545114011, -0.004337781322489779, 0.25553992955728355] |
1,802.02564 | Numerical Semigroups Generated by Concatenation of Arithmetic Sequences | We introduce the notion of numerical semigroups generated by concatenation of
arithmetic sequences and show that this class of numerical semigroups exhibit
multiple interesting behaviours.
| math.AC | we introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours | [['we', 'introduce', 'the', 'notion', 'of', 'numerical', 'semigroups', 'generated', 'by', 'concatenation', 'of', 'arithmetic', 'sequences', 'and', 'show', 'that', 'this', 'class', 'of', 'numerical', 'semigroups', 'exhibit', 'multiple', 'interesting', 'behaviours']] | [-0.16775516420602798, 0.14812493804842233, -0.06589290514588356, 0.13436799434479327, -0.018896690867841244, -0.09330638090148569, 0.024408569782972334, 0.4045747607946396, -0.3873390993475914, -0.2220421788096428, 0.09145105869509279, -0.2517714673280716, -0.2517927710339427, 0.28854440852999685, -0.11104503802955151, 0.06515674918889999, 0.12781898859888316, -0.020094367489218713, -0.1329320083092898, -0.2200754515454173, 0.41231130331754684, -0.036260045170783996, 0.20508086793124675, -0.01851496148854494, 0.12500109400600196, -0.06843615662306547, -0.09638835804536938, 0.00801650196313858, -0.1540107971537509, 0.14261774361133575, 0.29600939273834226, 0.13938088215887545, 0.3067562193609774, -0.40813991501927377, -0.19300841432064772, 0.15204955592751504, 0.09540825247764588, 0.019653362641111016, -0.11926160085946322, -0.2894033171981573, 0.19061654917895793, -0.1938279578089714, -0.08299132416956127, -0.18321525387465953, -0.013814298883080483, 0.1330862171947956, -0.25531607028096914, -0.005346793718636036, 0.19203984141349792, 0.16883766021579505, 0.034993814900517464, -0.037005738615989686, 0.04526520780287683, 0.05240122586488724, 0.04765342555940151, -0.14011051023378968, 0.07036337615922093, -0.02446666589938104, -0.22492809742689132, 0.30209868520498273, -0.009011497534811497, -0.21885219283401966, 0.1931027914583683, -0.15999090565368534, -0.1580009116232395, 0.14012221440672876, 0.0984189148247242, 0.16431447982788086, -0.03740859281271696, 0.08901079073315486, -0.18562416438013316, 0.12233517847955228, 0.11680073399096727, 0.09772829102352261, 0.12659264042973517, 0.10292484877631068, -0.004883983209729195, 0.2745484488084912, 0.08664494685828686, -0.10764191374182701, -0.33394814474740997, -0.11258068077266216, -0.10624948613345624, 0.05944423068314791, -0.11125393496768084, -0.2718053087592125, 0.40799410924315455, 0.1912634913623333, 0.13711899966001512, 0.2032508585229516, 0.16712620109319687, 0.08031177438795567, 0.007595643908716738, 0.03237798314541578, 0.04155297167599201, 0.13809115395881236, -0.001850483901798725, -0.22323046773672103, 0.04244415825232863, 0.19180030018091201] |
1,802.02565 | Applying Cooperative Machine Learning to Speed Up the Annotation of
Social Signals in Large Multi-modal Corpora | Scientific disciplines, such as Behavioural Psychology, Anthropology and
recently Social Signal Processing are concerned with the systematic exploration
of human behaviour. A typical work-flow includes the manual annotation (also
called coding) of social signals in multi-modal corpora of considerable size.
For the involved annotators this defines an exhausting and time-consuming task.
In the article at hand we present a novel method and also provide the tools to
speed up the coding procedure. To this end, we suggest and evaluate the use of
Cooperative Machine Learning (CML) techniques to reduce manual labelling
efforts by combining the power of computational capabilities and human
intelligence. The proposed CML strategy starts with a small number of labelled
instances and concentrates on predicting local parts first. Afterwards, a
session-independent classification model is created to finish the remaining
parts of the database. Confidence values are computed to guide the manual
inspection and correction of the predictions. To bring the proposed approach
into application we introduce NOVA - an open-source tool for collaborative and
machine-aided annotations. In particular, it gives labellers immediate access
to CML strategies and directly provides visual feedback on the results. Our
experiments show that the proposed method has the potential to significantly
reduce human labelling efforts.
| cs.HC cs.AI cs.LG stat.ML | scientific disciplines such as behavioural psychology anthropology and recently social signal processing are concerned with the systematic exploration of human behaviour a typical workflow includes the manual annotation also called coding of social signals in multimodal corpora of considerable size for the involved annotators this defines an exhausting and timeconsuming task in the article at hand we present a novel method and also provide the tools to speed up the coding procedure to this end we suggest and evaluate the use of cooperative machine learning cml techniques to reduce manual labelling efforts by combining the power of computational capabilities and human intelligence the proposed cml strategy starts with a small number of labelled instances and concentrates on predicting local parts first afterwards a sessionindependent classification model is created to finish the remaining parts of the database confidence values are computed to guide the manual inspection and correction of the predictions to bring the proposed approach into application we introduce nova an opensource tool for collaborative and machineaided annotations in particular it gives labellers immediate access to cml strategies and directly provides visual feedback on the results our experiments show that the proposed method has the potential to significantly reduce human labelling efforts | [['scientific', 'disciplines', 'such', 'as', 'behavioural', 'psychology', 'anthropology', 'and', 'recently', 'social', 'signal', 'processing', 'are', 'concerned', 'with', 'the', 'systematic', 'exploration', 'of', 'human', 'behaviour', 'a', 'typical', 'workflow', 'includes', 'the', 'manual', 'annotation', 'also', 'called', 'coding', 'of', 'social', 'signals', 'in', 'multimodal', 'corpora', 'of', 'considerable', 'size', 'for', 'the', 'involved', 'annotators', 'this', 'defines', 'an', 'exhausting', 'and', 'timeconsuming', 'task', 'in', 'the', 'article', 'at', 'hand', 'we', 'present', 'a', 'novel', 'method', 'and', 'also', 'provide', 'the', 'tools', 'to', 'speed', 'up', 'the', 'coding', 'procedure', 'to', 'this', 'end', 'we', 'suggest', 'and', 'evaluate', 'the', 'use', 'of', 'cooperative', 'machine', 'learning', 'cml', 'techniques', 'to', 'reduce', 'manual', 'labelling', 'efforts', 'by', 'combining', 'the', 'power', 'of', 'computational', 'capabilities', 'and', 'human', 'intelligence', 'the', 'proposed', 'cml', 'strategy', 'starts', 'with', 'a', 'small', 'number', 'of', 'labelled', 'instances', 'and', 'concentrates', 'on', 'predicting', 'local', 'parts', 'first', 'afterwards', 'a', 'sessionindependent', 'classification', 'model', 'is', 'created', 'to', 'finish', 'the', 'remaining', 'parts', 'of', 'the', 'database', 'confidence', 'values', 'are', 'computed', 'to', 'guide', 'the', 'manual', 'inspection', 'and', 'correction', 'of', 'the', 'predictions', 'to', 'bring', 'the', 'proposed', 'approach', 'into', 'application', 'we', 'introduce', 'nova', 'an', 'opensource', 'tool', 'for', 'collaborative', 'and', 'machineaided', 'annotations', 'in', 'particular', 'it', 'gives', 'labellers', 'immediate', 'access', 'to', 'cml', 'strategies', 'and', 'directly', 'provides', 'visual', 'feedback', 'on', 'the', 'results', 'our', 'experiments', 'show', 'that', 'the', 'proposed', 'method', 'has', 'the', 'potential', 'to', 'significantly', 'reduce', 'human', 'labelling', 'efforts']] | [-0.04529281559432695, 0.02002836914344422, -0.062390436056945754, 0.03544647762243779, -0.13612420367660807, -0.1412602465284701, 0.09628817475104325, 0.4069341387210497, -0.25190510274147365, -0.34865818229337125, 0.06341682293681677, -0.26498750504337953, -0.19413508117819825, 0.2078157616813959, -0.1511977014817594, 0.06498126413469581, 0.12255493206764335, 0.052090069575470396, -0.008334016653278204, -0.2667913468640335, 0.2682341594974144, 0.06778071431063153, 0.32375998041170895, 0.04847477619543171, 0.08700518075617689, -0.006990622620177062, -0.10921432265539223, -0.01264679161727484, -0.11167219302007281, 0.19163050165339673, 0.3264977950637521, 0.25415122495565695, 0.35890440388920886, -0.4130765757250104, -0.19156396989965468, 0.0717888751486548, 0.1388250558917406, 0.12441936698603208, -0.06162202969165658, -0.33015229750948205, 0.09010726079403826, -0.18039790665573296, -0.05209367656854412, -0.1266264014649182, 0.009010838077401289, -0.022578731698934405, -0.266214979034084, -0.0023521272253027342, 0.05491840902632519, 0.10899950134271376, -0.03960768093554238, -0.1099936626179709, 0.0320053469674634, 0.21232238976141224, 0.06279404918415314, 0.04641727229061337, 0.14725926469325723, -0.17057446998497558, -0.16429573643416287, 0.3745019268731017, 0.0037765842399082672, -0.17752044519585608, 0.21996293433904834, -0.03140829518942431, -0.1724613177131361, 0.116326646272334, 0.22102100761440485, 0.08389578090137362, -0.15920566495007543, 0.029710794592551906, 0.026597948359158723, 0.18627328886442, 0.030494169514818554, -0.02058631567451269, 0.1579241357490059, 0.24521412872489246, 0.031685318211695894, 0.16069780557766206, -0.07267770097698203, -0.06568994029049775, -0.2439469143349228, -0.13937720028563075, -0.1606292000216483, -0.03566341122510421, -0.06634828208912968, -0.149442603219699, 0.3791652317182045, 0.23126896164572303, 0.15030658069942424, 0.09383502953560717, 0.3492821055969492, 0.03883714040750591, 0.09905607460775594, 0.05557148623835082, 0.1682527363248197, 0.01180160198064141, 0.15335398633033037, -0.2148016050883073, 0.08012529624283166, 0.052621343218262735] |
1,802.02566 | Nash multiplicity sequences and Hironaka's order function | When $X$ is a $d$-dimensional variety defined over a field $k$ of
characteristic zero, a constructive resolution of singularities can be achieved
by successively lowering the maximum multiplicity via blow ups at smooth
equimultiple centers. This is done by stratifying the maximum multiplicity
locus of $X$ by means of the so called {\em resolution functions}. The most
important of these functions is what we know as {\em Hironaka's order function
in dimension $d$}. Actually, this function can be defined for varieties when
the base field is perfect; however if the characteristic of $k$ is positive,
the function is, in general, too coarse and does not provide enough information
so as to define a resolution. It is very natural to ask what the meaning of
this function is in this case, and to try to find refinements that could lead,
ultimately, to a resolution. In this paper we show that Hironaka's order
function in dimension $d$ can be read in terms of the {\em Nash multiplicity
sequences} introduced by Lejeune-Jalabert. Therefore, the function is intrinsic
to the variety and has a geometrical meaning in terms of its space of arcs.
| math.AG | when x is a ddimensional variety defined over a field k of characteristic zero a constructive resolution of singularities can be achieved by successively lowering the maximum multiplicity via blow ups at smooth equimultiple centers this is done by stratifying the maximum multiplicity locus of x by means of the so called em resolution functions the most important of these functions is what we know as em hironakas order function in dimension d actually this function can be defined for varieties when the base field is perfect however if the characteristic of k is positive the function is in general too coarse and does not provide enough information so as to define a resolution it is very natural to ask what the meaning of this function is in this case and to try to find refinements that could lead ultimately to a resolution in this paper we show that hironakas order function in dimension d can be read in terms of the em nash multiplicity sequences introduced by lejeunejalabert therefore the function is intrinsic to the variety and has a geometrical meaning in terms of its space of arcs | [['when', 'x', 'is', 'a', 'ddimensional', 'variety', 'defined', 'over', 'a', 'field', 'k', 'of', 'characteristic', 'zero', 'a', 'constructive', 'resolution', 'of', 'singularities', 'can', 'be', 'achieved', 'by', 'successively', 'lowering', 'the', 'maximum', 'multiplicity', 'via', 'blow', 'ups', 'at', 'smooth', 'equimultiple', 'centers', 'this', 'is', 'done', 'by', 'stratifying', 'the', 'maximum', 'multiplicity', 'locus', 'of', 'x', 'by', 'means', 'of', 'the', 'so', 'called', 'em', 'resolution', 'functions', 'the', 'most', 'important', 'of', 'these', 'functions', 'is', 'what', 'we', 'know', 'as', 'em', 'hironakas', 'order', 'function', 'in', 'dimension', 'd', 'actually', 'this', 'function', 'can', 'be', 'defined', 'for', 'varieties', 'when', 'the', 'base', 'field', 'is', 'perfect', 'however', 'if', 'the', 'characteristic', 'of', 'k', 'is', 'positive', 'the', 'function', 'is', 'in', 'general', 'too', 'coarse', 'and', 'does', 'not', 'provide', 'enough', 'information', 'so', 'as', 'to', 'define', 'a', 'resolution', 'it', 'is', 'very', 'natural', 'to', 'ask', 'what', 'the', 'meaning', 'of', 'this', 'function', 'is', 'in', 'this', 'case', 'and', 'to', 'try', 'to', 'find', 'refinements', 'that', 'could', 'lead', 'ultimately', 'to', 'a', 'resolution', 'in', 'this', 'paper', 'we', 'show', 'that', 'hironakas', 'order', 'function', 'in', 'dimension', 'd', 'can', 'be', 'read', 'in', 'terms', 'of', 'the', 'em', 'nash', 'multiplicity', 'sequences', 'introduced', 'by', 'lejeunejalabert', 'therefore', 'the', 'function', 'is', 'intrinsic', 'to', 'the', 'variety', 'and', 'has', 'a', 'geometrical', 'meaning', 'in', 'terms', 'of', 'its', 'space', 'of', 'arcs']] | [-0.12540057292974938, 0.09617581792057507, -0.12618995157548438, 0.08358726240004655, -0.08487219363712785, -0.10193594995711773, 0.02353133577372997, 0.3498547118854408, -0.31592326120303443, -0.2742408948837134, 0.08759459004202788, -0.2250467883915734, -0.15184952530187, 0.15918861231865195, -0.12070082815575892, 0.002281130481543384, 0.017155351786795392, 0.09332526861409726, -0.07025060152250623, -0.2875843663483109, 0.36244452068343186, 0.05265856128205698, 0.21577295195927262, 0.08326510963074508, 0.10892075174562042, 0.010924350423491979, 0.02184316071203698, 0.08041963991989312, -0.1410685396934496, 0.09045917926499097, 0.3012118898898797, 0.16069698275963742, 0.2673078981183824, -0.3451559322161807, -0.19315149496610046, 0.16932915556909783, 0.16819238744888002, 0.06070920289370906, 0.029787630340449078, -0.18354295135386997, 0.17104449012395606, -0.12387221183371606, -0.1556338514521639, -0.07758629871483044, 0.04690957110173133, 0.03458357972115101, -0.26546749020507804, 0.0029496568200922516, 0.08706251402735395, 0.08576773129472579, 0.010623476944159145, -0.08777043891506438, -0.023241098159579216, 0.0943431510869044, 0.016027283498761122, 0.10958299814032331, 0.06892374018699955, -0.1372512074066671, -0.08078390328249298, 0.3654699475373876, -0.060184814627208406, -0.25006985549800215, 0.17213147222039799, -0.20339513234991244, -0.0686403093890351, 0.15233067271087772, 0.10719086681295521, 0.15815031402325505, -0.1013094749945036, 0.12117297123906956, -0.062239271352097156, 0.15789164742208506, 0.10161784115350908, 0.03515999041720683, 0.19332863703104003, 0.11221275202654026, 0.10996837139858928, 0.11748940091415076, -0.04630142670597822, -0.01370254782072845, -0.3118203561802311, -0.18834946100062952, -0.20173163182550558, 0.13136766269495379, -0.06367582356886478, -0.1442517511073559, 0.36154522424287816, 0.09862327539465493, 0.25977615930051323, 0.029236318858921844, 0.26436181122033053, 0.13900582098633682, 0.07698889644557817, 0.043423204069277126, 0.18172943449170187, 0.10264161910871586, 0.060006044999075435, -0.16045887433066372, 0.08073225292677759, 0.09492181310499156] |
1,802.02567 | An improved multi-parametric programming algorithm for flux balance
analysis of metabolic networks | Flux balance analysis has proven an effective tool for analyzing metabolic
networks. In flux balance analysis, reaction rates and optimal pathways are
ascertained by solving a linear program, in which the growth rate is maximized
subject to mass-balance constraints. A variety of cell functions in response to
environmental stimuli can be quantified using flux balance analysis by
parameterizing the linear program with respect to extracellular conditions.
However, for most large, genome-scale metabolic networks of practical interest,
the resulting parametric problem has multiple and highly degenerate optimal
solutions, which are computationally challenging to handle. An improved
multi-parametric programming algorithm based on active-set methods is
introduced in this paper to overcome these computational difficulties.
Degeneracy and multiplicity are handled, respectively, by introducing
generalized inverses and auxiliary objective functions into the formulation of
the optimality conditions. These improvements are especially effective for
metabolic networks because their stoichiometry matrices are generally sparse;
thus, fast and efficient algorithms from sparse linear algebra can be leveraged
to compute generalized inverses and null-space bases. We illustrate the
application of our algorithm to flux balance analysis of metabolic networks by
studying a reduced metabolic model of Corynebacterium glutamicum and a
genome-scale model of Escherichia coli. We then demonstrate how the critical
regions resulting from these studies can be associated with optimal metabolic
modes and discuss the physical relevance of optimal pathways arising from
various auxiliary objective functions. Achieving more than five-fold
improvement in computational speed over existing multi-parametric programming
tools, the proposed algorithm proves promising in handling genome-scale
metabolic models.
| math.OC | flux balance analysis has proven an effective tool for analyzing metabolic networks in flux balance analysis reaction rates and optimal pathways are ascertained by solving a linear program in which the growth rate is maximized subject to massbalance constraints a variety of cell functions in response to environmental stimuli can be quantified using flux balance analysis by parameterizing the linear program with respect to extracellular conditions however for most large genomescale metabolic networks of practical interest the resulting parametric problem has multiple and highly degenerate optimal solutions which are computationally challenging to handle an improved multiparametric programming algorithm based on activeset methods is introduced in this paper to overcome these computational difficulties degeneracy and multiplicity are handled respectively by introducing generalized inverses and auxiliary objective functions into the formulation of the optimality conditions these improvements are especially effective for metabolic networks because their stoichiometry matrices are generally sparse thus fast and efficient algorithms from sparse linear algebra can be leveraged to compute generalized inverses and nullspace bases we illustrate the application of our algorithm to flux balance analysis of metabolic networks by studying a reduced metabolic model of corynebacterium glutamicum and a genomescale model of escherichia coli we then demonstrate how the critical regions resulting from these studies can be associated with optimal metabolic modes and discuss the physical relevance of optimal pathways arising from various auxiliary objective functions achieving more than fivefold improvement in computational speed over existing multiparametric programming tools the proposed algorithm proves promising in handling genomescale metabolic models | [['flux', 'balance', 'analysis', 'has', 'proven', 'an', 'effective', 'tool', 'for', 'analyzing', 'metabolic', 'networks', 'in', 'flux', 'balance', 'analysis', 'reaction', 'rates', 'and', 'optimal', 'pathways', 'are', 'ascertained', 'by', 'solving', 'a', 'linear', 'program', 'in', 'which', 'the', 'growth', 'rate', 'is', 'maximized', 'subject', 'to', 'massbalance', 'constraints', 'a', 'variety', 'of', 'cell', 'functions', 'in', 'response', 'to', 'environmental', 'stimuli', 'can', 'be', 'quantified', 'using', 'flux', 'balance', 'analysis', 'by', 'parameterizing', 'the', 'linear', 'program', 'with', 'respect', 'to', 'extracellular', 'conditions', 'however', 'for', 'most', 'large', 'genomescale', 'metabolic', 'networks', 'of', 'practical', 'interest', 'the', 'resulting', 'parametric', 'problem', 'has', 'multiple', 'and', 'highly', 'degenerate', 'optimal', 'solutions', 'which', 'are', 'computationally', 'challenging', 'to', 'handle', 'an', 'improved', 'multiparametric', 'programming', 'algorithm', 'based', 'on', 'activeset', 'methods', 'is', 'introduced', 'in', 'this', 'paper', 'to', 'overcome', 'these', 'computational', 'difficulties', 'degeneracy', 'and', 'multiplicity', 'are', 'handled', 'respectively', 'by', 'introducing', 'generalized', 'inverses', 'and', 'auxiliary', 'objective', 'functions', 'into', 'the', 'formulation', 'of', 'the', 'optimality', 'conditions', 'these', 'improvements', 'are', 'especially', 'effective', 'for', 'metabolic', 'networks', 'because', 'their', 'stoichiometry', 'matrices', 'are', 'generally', 'sparse', 'thus', 'fast', 'and', 'efficient', 'algorithms', 'from', 'sparse', 'linear', 'algebra', 'can', 'be', 'leveraged', 'to', 'compute', 'generalized', 'inverses', 'and', 'nullspace', 'bases', 'we', 'illustrate', 'the', 'application', 'of', 'our', 'algorithm', 'to', 'flux', 'balance', 'analysis', 'of', 'metabolic', 'networks', 'by', 'studying', 'a', 'reduced', 'metabolic', 'model', 'of', 'corynebacterium', 'glutamicum', 'and', 'a', 'genomescale', 'model', 'of', 'escherichia', 'coli', 'we', 'then', 'demonstrate', 'how', 'the', 'critical', 'regions', 'resulting', 'from', 'these', 'studies', 'can', 'be', 'associated', 'with', 'optimal', 'metabolic', 'modes', 'and', 'discuss', 'the', 'physical', 'relevance', 'of', 'optimal', 'pathways', 'arising', 'from', 'various', 'auxiliary', 'objective', 'functions', 'achieving', 'more', 'than', 'fivefold', 'improvement', 'in', 'computational', 'speed', 'over', 'existing', 'multiparametric', 'programming', 'tools', 'the', 'proposed', 'algorithm', 'proves', 'promising', 'in', 'handling', 'genomescale', 'metabolic', 'models']] | [-0.08476316242798468, 0.043824287282144984, -0.031491992680197915, 0.10088034590917809, -0.0691942863853737, -0.15428962618378655, 0.046211974658367655, 0.3764981942432415, -0.3003800867983724, -0.3198751718711777, 0.10855730816570391, -0.21011317712217864, -0.2370326794417841, 0.2352170424447173, -0.08961222932067892, 0.12236364206552343, 0.10706410400148127, -0.048706338694688704, -0.04388097395227911, -0.22979655608327854, 0.26161762079342255, 0.0910462463572104, 0.3199655151231185, 0.03720594392183961, 0.11391323911384606, -0.03802483909234907, -0.04404670189297388, 0.03886667954724371, -0.09982490362733462, 0.18627339759647535, 0.33691296249319763, 0.20249822541206544, 0.28450463780046403, -0.4621138935208797, -0.21724977324502395, 0.15133077609131024, 0.14748750579643197, 0.0992881571975655, -0.00908768399497762, -0.23325716670961044, 0.09048274895712172, -0.13784602741130614, -0.06570762529285969, -0.1562312127918833, -0.026180353440669556, 0.046673218688940525, -0.31542888886779397, 0.07459359526027194, 0.0009320443145014228, 0.08274986117058211, -0.09574729329740096, -0.14549208522981238, -0.04499934643593853, 0.11251410100117533, 0.06120938388168782, 0.0073597433239763, 0.16004437070486824, -0.1275948072674625, -0.12846686145926398, 0.3273058864655295, 0.004085761562092802, -0.26392480589648976, 0.1948564277401948, -0.04124967407228218, -0.14630849589501316, 0.15677689623534827, 0.2195744733219885, 0.1000113888576235, -0.22158850780697464, 0.06502422149152687, 0.027133883642298833, 0.13709006936932427, 0.06144269615123492, 0.000286653611034299, 0.1535176952011026, 0.18383367451754148, 0.08785411513166591, 0.1511222066451049, -0.018826118856345095, -0.10541159387249203, -0.2126655268359519, -0.10392261350468274, -0.14472636071011602, 0.03822290874548286, -0.12777626690674676, -0.12282907582509021, 0.3960442615096413, 0.11571756943354443, 0.15379518655771834, 0.09032933008838592, 0.2760708939906816, 0.11897176726502255, 0.06874835341318791, 0.062416476737578504, 0.18394554311609163, 0.14104662280500171, 0.08450174066589199, -0.25506718278518836, 0.11276465940953506, 0.05536880010058955] |
1,802.02568 | VISER: Visual Self-Regularization | In this work, we propose the use of large set of unlabeled images as a source
of regularization data for learning robust visual representation. Given a
visual model trained by a labeled dataset in a supervised fashion, we augment
our training samples by incorporating large number of unlabeled data and train
a semi-supervised model. We demonstrate that our proposed learning approach
leverages an abundance of unlabeled images and boosts the visual recognition
performance which alleviates the need to rely on large labeled datasets for
learning robust representation. To increment the number of image instances
needed to learn robust visual models in our approach, each labeled image
propagates its label to its nearest unlabeled image instances. These retrieved
unlabeled images serve as local perturbations of each labeled image to perform
Visual Self-Regularization (VISER). To retrieve such visual self regularizers,
we compute the cosine similarity in a semantic space defined by the penultimate
layer in a fully convolutional neural network. We use the publicly available
Yahoo Flickr Creative Commons 100M dataset as the source of our unlabeled image
set and propose a distributed approximate nearest neighbor algorithm to make
retrieval practical at that scale. Using the labeled instances and their
regularizer samples we show that we significantly improve object categorization
and localization performance on the MS COCO and Visual Genome datasets where
objects appear in context.
| cs.CV cs.LG | in this work we propose the use of large set of unlabeled images as a source of regularization data for learning robust visual representation given a visual model trained by a labeled dataset in a supervised fashion we augment our training samples by incorporating large number of unlabeled data and train a semisupervised model we demonstrate that our proposed learning approach leverages an abundance of unlabeled images and boosts the visual recognition performance which alleviates the need to rely on large labeled datasets for learning robust representation to increment the number of image instances needed to learn robust visual models in our approach each labeled image propagates its label to its nearest unlabeled image instances these retrieved unlabeled images serve as local perturbations of each labeled image to perform visual selfregularization viser to retrieve such visual self regularizers we compute the cosine similarity in a semantic space defined by the penultimate layer in a fully convolutional neural network we use the publicly available yahoo flickr creative commons 100m dataset as the source of our unlabeled image set and propose a distributed approximate nearest neighbor algorithm to make retrieval practical at that scale using the labeled instances and their regularizer samples we show that we significantly improve object categorization and localization performance on the ms coco and visual genome datasets where objects appear in context | [['in', 'this', 'work', 'we', 'propose', 'the', 'use', 'of', 'large', 'set', 'of', 'unlabeled', 'images', 'as', 'a', 'source', 'of', 'regularization', 'data', 'for', 'learning', 'robust', 'visual', 'representation', 'given', 'a', 'visual', 'model', 'trained', 'by', 'a', 'labeled', 'dataset', 'in', 'a', 'supervised', 'fashion', 'we', 'augment', 'our', 'training', 'samples', 'by', 'incorporating', 'large', 'number', 'of', 'unlabeled', 'data', 'and', 'train', 'a', 'semisupervised', 'model', 'we', 'demonstrate', 'that', 'our', 'proposed', 'learning', 'approach', 'leverages', 'an', 'abundance', 'of', 'unlabeled', 'images', 'and', 'boosts', 'the', 'visual', 'recognition', 'performance', 'which', 'alleviates', 'the', 'need', 'to', 'rely', 'on', 'large', 'labeled', 'datasets', 'for', 'learning', 'robust', 'representation', 'to', 'increment', 'the', 'number', 'of', 'image', 'instances', 'needed', 'to', 'learn', 'robust', 'visual', 'models', 'in', 'our', 'approach', 'each', 'labeled', 'image', 'propagates', 'its', 'label', 'to', 'its', 'nearest', 'unlabeled', 'image', 'instances', 'these', 'retrieved', 'unlabeled', 'images', 'serve', 'as', 'local', 'perturbations', 'of', 'each', 'labeled', 'image', 'to', 'perform', 'visual', 'selfregularization', 'viser', 'to', 'retrieve', 'such', 'visual', 'self', 'regularizers', 'we', 'compute', 'the', 'cosine', 'similarity', 'in', 'a', 'semantic', 'space', 'defined', 'by', 'the', 'penultimate', 'layer', 'in', 'a', 'fully', 'convolutional', 'neural', 'network', 'we', 'use', 'the', 'publicly', 'available', 'yahoo', 'flickr', 'creative', 'commons', '100m', 'dataset', 'as', 'the', 'source', 'of', 'our', 'unlabeled', 'image', 'set', 'and', 'propose', 'a', 'distributed', 'approximate', 'nearest', 'neighbor', 'algorithm', 'to', 'make', 'retrieval', 'practical', 'at', 'that', 'scale', 'using', 'the', 'labeled', 'instances', 'and', 'their', 'regularizer', 'samples', 'we', 'show', 'that', 'we', 'significantly', 'improve', 'object', 'categorization', 'and', 'localization', 'performance', 'on', 'the', 'ms', 'coco', 'and', 'visual', 'genome', 'datasets', 'where', 'objects', 'appear', 'in', 'context']] | [0.0005135928184595878, -0.027033901873037884, -0.028681888915347814, 0.08001910532773013, -0.16308355690063617, -0.16102868806040374, 0.07186120395202006, 0.4916304525305337, -0.30145980324804983, -0.37435793625232616, 0.03166041804181053, -0.31657601059351803, -0.15550923828743482, 0.16080535551159322, -0.1764084561414716, 0.06883960842747959, 0.19697417683623764, 0.0842104506688798, -0.02793847305403663, -0.3312594870381024, 0.3096702859800668, 0.004857542704281318, 0.33308271894695013, -0.021747736043125524, 0.16784686272892885, -0.04523072082699681, -0.06467222992431021, -0.02112595853043382, -0.0223315270380271, 0.22514651654572163, 0.3425336329394753, 0.25300454895007907, 0.3030457146499189, -0.3662075010063586, -0.207024690757752, 0.09049125470329628, 0.1384213537613615, 0.1326933723897621, -0.0739729753541426, -0.4270180224236351, 0.10068091255640861, -0.14992008698611384, 0.06799807923850124, -0.17754459132924844, -0.017424011121153198, -0.03447735223568341, -0.3246289809931888, 0.03513590852425104, 0.05750696035310827, 0.07840301286358169, -0.06289738134664771, -0.08028549952808384, 0.0031938993417962784, 0.19966064941873063, 0.01836629927674133, 0.07853573858643978, 0.14624813758672087, -0.22313518073480793, -0.11735735383644834, 0.36477240863268684, -0.06588958842536818, -0.21203739586653764, 0.2118334613563994, -0.010640756047493673, -0.151398655862418, 0.09098000143291303, 0.27613563818915543, 0.149155792124536, -0.16020249236989015, 0.003263152852307821, -0.10754673847836764, 0.22240237189005777, 0.055497174932216314, -0.029383292304761208, 0.15484203974196412, 0.26823793502833543, 0.015544653834666506, 0.19492993249470209, -0.20127393878399155, 0.014149232686083814, -0.21048756347626715, -0.0640415672897758, -0.2795167117486102, -0.051153542438804926, -0.16164660304766504, -0.18039153357154655, 0.36986823175979505, 0.2816315105272616, 0.2791937467033428, 0.1444525250908188, 0.3349107016178658, -0.04645839805499183, 0.15028085703376864, 0.09891155134936619, 0.11081428371417866, -0.034390538119639984, 0.1389180335587918, -0.1524294413701368, 0.048493160922320415, 0.07747772639730086] |
1,802.02569 | First-order structural transition and pressure-induced lattice/phonon
anomalies in Sr$_2$IrO$_4$ | We investigate the crystal structure and lattice vibrations of Sr$_2$IrO$_4$
by a combined phonon Raman scattering and x-ray powder diffraction experiment
under pressures up to $66$ GPa and room temperature. Density functional theory
(DFT) and $ab$-initio lattice dynamics calculations were also carried out. A
first-order structural phase transition associated with an $8$ % collapse of
the $c$-axis is observed at high pressures, with phase coexistence being
observed between $\sim 40$ and $55$ GPa. At lower pressures, lattice and phonon
anomalies were observed, reflecting crossovers between isostructural competing
states. A critical pressure of $P_1=17$ GPa is associated with: (i) a reduction
of lattice volume compressibility and a change of behavior of the tetragonal
$c/a$ ratio take place above $P_1$; (ii) a four-fold symmetry-breaking lattice
strain associated with lattice disorder; (iii) disappearance of two Raman
active modes (at $\sim 180$ and $\sim 260$ cm$^{-1}$); and (iv) development of
an asymmetric Fano lineshape for the $\sim 390$ cm$^{-1}$ mode. DFT indicates
that the phase above $P_1$ is most likely non-magnetic. Exploring the
similarities between iridate and cuprate physics, we argue that these
observations are consistent with the emergence of a rotational
symmetry-breaking electronic instability at $P_1$, providing hints for the
avoided metallization under pressure and supporting the hypothesis of possible
competing orders that are detrimental to superconductivity in this family.
Alternative scenarios for the transition at $P_1$ are also suggested and
critically discussed. Additional phonon and lattice anomalies in the tetragonal
phase are observed at $P_2=30$ and $P_3=40$ GPa, indicating further competing
phases that are stabilized at high pressures.
| cond-mat.str-el | we investigate the crystal structure and lattice vibrations of sr_2iro_4 by a combined phonon raman scattering and xray powder diffraction experiment under pressures up to 66 gpa and room temperature density functional theory dft and abinitio lattice dynamics calculations were also carried out a firstorder structural phase transition associated with an 8 collapse of the caxis is observed at high pressures with phase coexistence being observed between sim 40 and 55 gpa at lower pressures lattice and phonon anomalies were observed reflecting crossovers between isostructural competing states a critical pressure of p_117 gpa is associated with i a reduction of lattice volume compressibility and a change of behavior of the tetragonal ca ratio take place above p_1 ii a fourfold symmetrybreaking lattice strain associated with lattice disorder iii disappearance of two raman active modes at sim 180 and sim 260 cm1 and iv development of an asymmetric fano lineshape for the sim 390 cm1 mode dft indicates that the phase above p_1 is most likely nonmagnetic exploring the similarities between iridate and cuprate physics we argue that these observations are consistent with the emergence of a rotational symmetrybreaking electronic instability at p_1 providing hints for the avoided metallization under pressure and supporting the hypothesis of possible competing orders that are detrimental to superconductivity in this family alternative scenarios for the transition at p_1 are also suggested and critically discussed additional phonon and lattice anomalies in the tetragonal phase are observed at p_230 and p_340 gpa indicating further competing phases that are stabilized at high pressures | [['we', 'investigate', 'the', 'crystal', 'structure', 'and', 'lattice', 'vibrations', 'of', 'sr_2iro_4', 'by', 'a', 'combined', 'phonon', 'raman', 'scattering', 'and', 'xray', 'powder', 'diffraction', 'experiment', 'under', 'pressures', 'up', 'to', '66', 'gpa', 'and', 'room', 'temperature', 'density', 'functional', 'theory', 'dft', 'and', 'abinitio', 'lattice', 'dynamics', 'calculations', 'were', 'also', 'carried', 'out', 'a', 'firstorder', 'structural', 'phase', 'transition', 'associated', 'with', 'an', '8', 'collapse', 'of', 'the', 'caxis', 'is', 'observed', 'at', 'high', 'pressures', 'with', 'phase', 'coexistence', 'being', 'observed', 'between', 'sim', '40', 'and', '55', 'gpa', 'at', 'lower', 'pressures', 'lattice', 'and', 'phonon', 'anomalies', 'were', 'observed', 'reflecting', 'crossovers', 'between', 'isostructural', 'competing', 'states', 'a', 'critical', 'pressure', 'of', 'p_117', 'gpa', 'is', 'associated', 'with', 'i', 'a', 'reduction', 'of', 'lattice', 'volume', 'compressibility', 'and', 'a', 'change', 'of', 'behavior', 'of', 'the', 'tetragonal', 'ca', 'ratio', 'take', 'place', 'above', 'p_1', 'ii', 'a', 'fourfold', 'symmetrybreaking', 'lattice', 'strain', 'associated', 'with', 'lattice', 'disorder', 'iii', 'disappearance', 'of', 'two', 'raman', 'active', 'modes', 'at', 'sim', '180', 'and', 'sim', '260', 'cm1', 'and', 'iv', 'development', 'of', 'an', 'asymmetric', 'fano', 'lineshape', 'for', 'the', 'sim', '390', 'cm1', 'mode', 'dft', 'indicates', 'that', 'the', 'phase', 'above', 'p_1', 'is', 'most', 'likely', 'nonmagnetic', 'exploring', 'the', 'similarities', 'between', 'iridate', 'and', 'cuprate', 'physics', 'we', 'argue', 'that', 'these', 'observations', 'are', 'consistent', 'with', 'the', 'emergence', 'of', 'a', 'rotational', 'symmetrybreaking', 'electronic', 'instability', 'at', 'p_1', 'providing', 'hints', 'for', 'the', 'avoided', 'metallization', 'under', 'pressure', 'and', 'supporting', 'the', 'hypothesis', 'of', 'possible', 'competing', 'orders', 'that', 'are', 'detrimental', 'to', 'superconductivity', 'in', 'this', 'family', 'alternative', 'scenarios', 'for', 'the', 'transition', 'at', 'p_1', 'are', 'also', 'suggested', 'and', 'critically', 'discussed', 'additional', 'phonon', 'and', 'lattice', 'anomalies', 'in', 'the', 'tetragonal', 'phase', 'are', 'observed', 'at', 'p_230', 'and', 'p_340', 'gpa', 'indicating', 'further', 'competing', 'phases', 'that', 'are', 'stabilized', 'at', 'high', 'pressures']] | [-0.15990148670786608, 0.2679604714088898, -0.04963188747125161, 0.0026518110202492346, -0.029266916984130465, -0.14998933519209026, 0.15344180733044926, 0.42277560983267093, -0.25187574717491523, -0.27608455605213605, 0.034476704955263164, -0.3616580259755239, -0.10142711418059965, 0.11354313784238276, 0.09326965348159391, 0.010013457170561962, -0.03678695374678466, -0.038990186932053236, -0.12854151449573692, -0.19617421928671233, 0.24988704926935107, 0.050384996320298386, 0.3306209171922611, 0.08564858181293063, 0.027400948821441343, -0.07447463983581179, 0.10530833220307989, 0.015572581425427444, -0.18575094631073408, 0.006288857105703626, 0.2898777828954663, -0.06787228699873335, 0.18032967402795624, -0.3981053618358962, -0.2178647821109417, 0.006758575939336821, 0.08585091588449562, 0.08769924353737946, -0.03885482805356058, -0.259188212092138, 0.08126382278426299, -0.09697971817120792, -0.13117730083883675, -0.12024818778168299, -0.015666065740145906, -0.04779198553342934, -0.2390765129564984, 0.16712379971143074, 0.014692951123126678, 0.1964909525212288, -0.13623978210140078, -0.1727550076191417, -0.06993648704854653, -0.03101093468481734, 0.06251865056470879, 0.06692584319638886, 0.138588502096282, -0.057474338295241255, -0.1036540908750058, 0.43263091992966585, -0.008431300206298363, 0.03883409418446559, 0.20438839421914298, -0.18932147922428808, -0.11586476903776491, 0.25762569807868985, 0.07793466611335698, 0.027406294376031304, -0.08145334441163983, 0.009201005495260544, 0.0643299175814415, 0.19912710787482663, 0.10906833144448076, 0.03684610863782591, 0.2390185362134602, 0.1713231014303072, 0.005864158921342876, 0.10175670353425038, -0.14638308671996966, -0.0669796163891165, -0.2726851406642088, -0.12228588451306144, -0.13984330226138275, 0.03954720116102151, -0.11608740460464365, -0.12948129597556082, 0.3290672076149753, 0.10263467160476712, 0.19046437401797564, -0.045962815819722086, 0.1706623627248937, 0.08317579505022704, 0.04912480988608126, 0.0435045600983329, 0.25788776000447955, 0.1792143231945201, 0.08392735754346682, -0.3144408035228798, 0.04479819625276067, -0.0242822861067012] |
1,802.0257 | Fabrication and characterization of pH responsive nanoprobes based on
ion current rectification | In this study, we investigated the ionic current rectification of glass
nanopipettes modified with bovine serum albumin - glutaraldehyde (BSA-GA)
artificial membrane using solutions with various pHs. Ionic current
rectification is a phenomenon that is observed with nanopores as asymmetric I-V
curves, where the ionic currents recorded through a nanopore differ at the same
magnitude of applied electrical potentials biased with opposite polarities. The
results clearly showed that modifying the tip of a nanopipette results in a pH
dependent ionic current behavior. The proposed strategy is a facile method for
fabrication of a pH responsive nanoprobe that has a potential for intracellular
pH measurement.
| physics.chem-ph physics.ins-det | in this study we investigated the ionic current rectification of glass nanopipettes modified with bovine serum albumin glutaraldehyde bsaga artificial membrane using solutions with various phs ionic current rectification is a phenomenon that is observed with nanopores as asymmetric iv curves where the ionic currents recorded through a nanopore differ at the same magnitude of applied electrical potentials biased with opposite polarities the results clearly showed that modifying the tip of a nanopipette results in a ph dependent ionic current behavior the proposed strategy is a facile method for fabrication of a ph responsive nanoprobe that has a potential for intracellular ph measurement | [['in', 'this', 'study', 'we', 'investigated', 'the', 'ionic', 'current', 'rectification', 'of', 'glass', 'nanopipettes', 'modified', 'with', 'bovine', 'serum', 'albumin', 'glutaraldehyde', 'bsaga', 'artificial', 'membrane', 'using', 'solutions', 'with', 'various', 'phs', 'ionic', 'current', 'rectification', 'is', 'a', 'phenomenon', 'that', 'is', 'observed', 'with', 'nanopores', 'as', 'asymmetric', 'iv', 'curves', 'where', 'the', 'ionic', 'currents', 'recorded', 'through', 'a', 'nanopore', 'differ', 'at', 'the', 'same', 'magnitude', 'of', 'applied', 'electrical', 'potentials', 'biased', 'with', 'opposite', 'polarities', 'the', 'results', 'clearly', 'showed', 'that', 'modifying', 'the', 'tip', 'of', 'a', 'nanopipette', 'results', 'in', 'a', 'ph', 'dependent', 'ionic', 'current', 'behavior', 'the', 'proposed', 'strategy', 'is', 'a', 'facile', 'method', 'for', 'fabrication', 'of', 'a', 'ph', 'responsive', 'nanoprobe', 'that', 'has', 'a', 'potential', 'for', 'intracellular', 'ph', 'measurement']] | [-0.10483123715419103, 0.13744483309496633, -0.03548426558628824, -0.038907380443632456, 0.005210136072242213, -0.21960157671413733, 0.02970002471314122, 0.4160398495584434, -0.20261385054418854, -0.2669643313149173, 0.03966360025144383, -0.271036016129359, -0.1866812555292877, 0.19192848946241772, -0.04808137055449918, -0.011634279042482376, 0.029827607275151154, -0.05138465074603172, -0.008367821448665186, -0.15824219712293616, 0.15423259416631624, 0.009665205256668759, 0.34544037700648983, 0.13026083335645644, 0.14341819719137514, -0.02931133555316859, 0.06227212467495644, 0.11898305950065453, -0.13187643845773053, 0.11674848278783553, 0.2362313339482153, -0.04715589074197958, 0.20058309756146342, -0.45382986182127805, -0.2173367195543559, 0.04916134572304858, 0.11438750034636434, 0.15602022421308884, -0.12976053637890694, -0.2691532486282727, 0.08626129013467945, -0.12001142865412083, -0.1271219755449862, -0.01518186956059699, 0.040210696585549446, 0.1307129278378424, -0.26061810091977905, 0.1239539157215725, 0.011115835650878795, 0.09010704660642088, -0.1143802490048841, -0.1656843365681376, -0.06883488279680594, 0.06326985063987747, 0.03846649359226884, 0.021261731082774408, 0.32225666028520494, -0.16004349598341494, -0.09958361918289288, 0.2963209731833023, -0.11383867759586257, -0.18781414866038282, 0.17613438591726271, -0.12205951585543945, -0.050856852140414584, 0.16891862093881868, 0.06406611098917019, 0.10343746724081974, -0.195562069833863, 0.010638243587249342, -0.010891717228600207, 0.15672777162399143, 0.11961973706424675, -0.06447393202003748, 0.20055763986801692, 0.2404788171361182, 0.026803827689339716, 0.14641650621984703, -0.09209600172242989, -0.02219877876432649, -0.20367330665170563, -0.17297416795775586, -0.13348852262339173, 0.06984096654581234, -0.06609724663362346, -0.1753697411622852, 0.4303124688346596, 0.1268086458245913, 0.16797169964468361, -0.011326765260366979, 0.2659794619608232, 0.061672473498665746, 0.06489534313589626, -0.047535859536854366, 0.23182772969206175, 0.10254086709727406, 0.2078364973513446, -0.3250221467677358, 0.13859875823425896, 0.00031375838443636894] |
1,802.02571 | Bitewing Radiography Semantic Segmentation Base on Conditional
Generative Adversarial Nets | Currently, Segmentation of bitewing radiograpy images is a very challenging
task. The focus of the study is to segment it into caries, enamel, dentin,
pulp, crowns, restoration and root canal treatments. The main method of
semantic segmentation of bitewing radiograpy images at this stage is the
U-shaped deep convolution neural network, but its accuracy is low. in order to
improve the accuracy of semantic segmentation of bitewing radiograpy images,
this paper proposes the use of Conditional Generative Adversarial network
(cGAN) combined with U-shaped network structure (U-Net) approach to semantic
segmentation of bitewing radiograpy images. The experimental results show that
the accuracy of cGAN combined with U-Net is 69.7%, which is 13.3% higher than
the accuracy of u-shaped deep convolution neural network of 56.4%.
| cs.CV | currently segmentation of bitewing radiograpy images is a very challenging task the focus of the study is to segment it into caries enamel dentin pulp crowns restoration and root canal treatments the main method of semantic segmentation of bitewing radiograpy images at this stage is the ushaped deep convolution neural network but its accuracy is low in order to improve the accuracy of semantic segmentation of bitewing radiograpy images this paper proposes the use of conditional generative adversarial network cgan combined with ushaped network structure unet approach to semantic segmentation of bitewing radiograpy images the experimental results show that the accuracy of cgan combined with unet is 697 which is 133 higher than the accuracy of ushaped deep convolution neural network of 564 | [['currently', 'segmentation', 'of', 'bitewing', 'radiograpy', 'images', 'is', 'a', 'very', 'challenging', 'task', 'the', 'focus', 'of', 'the', 'study', 'is', 'to', 'segment', 'it', 'into', 'caries', 'enamel', 'dentin', 'pulp', 'crowns', 'restoration', 'and', 'root', 'canal', 'treatments', 'the', 'main', 'method', 'of', 'semantic', 'segmentation', 'of', 'bitewing', 'radiograpy', 'images', 'at', 'this', 'stage', 'is', 'the', 'ushaped', 'deep', 'convolution', 'neural', 'network', 'but', 'its', 'accuracy', 'is', 'low', 'in', 'order', 'to', 'improve', 'the', 'accuracy', 'of', 'semantic', 'segmentation', 'of', 'bitewing', 'radiograpy', 'images', 'this', 'paper', 'proposes', 'the', 'use', 'of', 'conditional', 'generative', 'adversarial', 'network', 'cgan', 'combined', 'with', 'ushaped', 'network', 'structure', 'unet', 'approach', 'to', 'semantic', 'segmentation', 'of', 'bitewing', 'radiograpy', 'images', 'the', 'experimental', 'results', 'show', 'that', 'the', 'accuracy', 'of', 'cgan', 'combined', 'with', 'unet', 'is', '697', 'which', 'is', '133', 'higher', 'than', 'the', 'accuracy', 'of', 'ushaped', 'deep', 'convolution', 'neural', 'network', 'of', '564']] | [-0.0238372436438336, -0.07731442670643207, -0.04469101679450298, 0.0659777652205075, -0.09124660448621592, -0.1453590822925211, -0.014410186367162854, 0.4834346793530906, -0.21898103097919375, -0.34117454419401094, 0.04497285040961884, -0.27701859034170384, -0.20192649897157414, 0.12130956476760386, -0.19380844325269955, 0.06875666211784787, 0.18249613690174749, 0.053374597323737796, -0.04593531705904752, -0.2814067564580254, 0.2763115718853889, 0.05354424199560794, 0.375911065249429, 0.046123924722406465, 0.1627004804837777, -0.08942658950757908, -0.018537933585142382, -0.044923633898104554, -0.03269344870771375, 0.20016458409181873, 0.28388762820634195, 0.16763998437901867, 0.3082935997288766, -0.39149133314485435, -0.2227955235675985, 0.0441779338518066, 0.1231022698224568, 0.051766154450769, 0.041271611059573096, -0.38377626015819977, 0.13300277202458838, -0.161534340304063, 0.04733710101668219, -0.07795846461581799, -0.03986578683185651, -0.04799746817977885, -0.2580147503524996, 0.09548498683257914, 0.09558455032281211, 0.06646084805309284, -0.059798425144599904, -0.10508239206277811, -0.014784183334101175, 0.15709435966507088, -0.009012011914193386, 0.17232291659408966, 0.12488895020119418, -0.26118078000498096, -0.0895749579305898, 0.32688373919637476, -0.03643742878885547, -0.15508807887949172, 0.1499464071477901, -0.051042989241799, -0.14825596110647177, 0.15824995843357728, 0.2046502660959959, 0.112205350382223, -0.1352295495982885, -0.04593654224085125, -0.04593203830547997, 0.18632626473964725, 0.07290213716933962, -0.06486258350625695, 0.13269633856663082, 0.3458750418952254, -0.004665260628766579, 0.18406623070029024, -0.24656792366342833, 0.0019007832819565398, -0.16924220986557423, -0.10698166798006316, -0.17381488821912008, -0.05657154836188086, -0.11720163867125177, -0.1728368580158128, 0.4339221356986243, 0.2250832264372682, 0.22069420712832055, 0.14563719452011445, 0.37199107528526765, 0.0038870807782914797, 0.16132863929693694, 0.03268292409579697, 0.15709568841046975, 0.041139500494283, 0.11898849627048877, -0.16320251600938987, 0.08012198003917383, 0.11246207413706379] |
1,802.02572 | Dynamical analysis on $f(R,\mathcal{G})$ cosmology | We use a dynamical system approach to study the cosmological viability of
$f(R,\mathcal{G})$ gravity theories. The method consists of formulating the
evolution equations as an autonomous system of ODEs, using suitable variables.
The formalism is applied to a class of models in which $f(R,\mathcal{G})\propto
R^{n}\mathcal{G}^{1-n}$ and its solutions and corresponding stability are
analysed in detail. New accelerating solutions that can be attractors in the
phase space are found. We also find that this class of models does not exhibit
a matter-dominated epoch, a solution which is inconsistent with current
cosmological observations.
| gr-qc hep-th | we use a dynamical system approach to study the cosmological viability of frmathcalg gravity theories the method consists of formulating the evolution equations as an autonomous system of odes using suitable variables the formalism is applied to a class of models in which frmathcalgpropto rnmathcalg1n and its solutions and corresponding stability are analysed in detail new accelerating solutions that can be attractors in the phase space are found we also find that this class of models does not exhibit a matterdominated epoch a solution which is inconsistent with current cosmological observations | [['we', 'use', 'a', 'dynamical', 'system', 'approach', 'to', 'study', 'the', 'cosmological', 'viability', 'of', 'frmathcalg', 'gravity', 'theories', 'the', 'method', 'consists', 'of', 'formulating', 'the', 'evolution', 'equations', 'as', 'an', 'autonomous', 'system', 'of', 'odes', 'using', 'suitable', 'variables', 'the', 'formalism', 'is', 'applied', 'to', 'a', 'class', 'of', 'models', 'in', 'which', 'frmathcalgpropto', 'rnmathcalg1n', 'and', 'its', 'solutions', 'and', 'corresponding', 'stability', 'are', 'analysed', 'in', 'detail', 'new', 'accelerating', 'solutions', 'that', 'can', 'be', 'attractors', 'in', 'the', 'phase', 'space', 'are', 'found', 'we', 'also', 'find', 'that', 'this', 'class', 'of', 'models', 'does', 'not', 'exhibit', 'a', 'matterdominated', 'epoch', 'a', 'solution', 'which', 'is', 'inconsistent', 'with', 'current', 'cosmological', 'observations']] | [-0.1467926608754343, 0.06271502055411536, -0.1317494820876654, 0.05833655925012413, -0.07110833924452073, -0.12348139249547019, -0.04341777613428369, 0.32595391981722266, -0.2304136638498206, -0.2918513452404001, 0.14013744605668518, -0.23083333787246701, -0.17896644872602788, 0.19351508790689909, -0.04380774188242602, 0.04317089532216843, 0.05458233832496773, 0.008216500695627392, -0.0932447186166295, -0.2519795600065878, 0.3515600501428871, 0.028760089355866224, 0.21692855339340364, -0.06959866251524412, 0.124298910547592, -0.10290294119648719, 0.002920420816837904, 0.09006324182284127, -0.13952997994554894, 0.057763443799333625, 0.2118850077847915, 0.15297024756711855, 0.2599248191383615, -0.3891284842923116, -0.2553093926248591, 0.12183669968665148, 0.15916307818856132, 0.16519368318526934, -0.048450096112707355, -0.2703201391399325, 0.0660971916709723, -0.1777865072042587, -0.1800781831438287, -0.11259997776301389, -0.0010537037604980255, 0.029922738658222422, -0.2633553329656382, 0.08128721602333008, 0.019319405071267313, -0.018371008472579917, -0.15257441951615966, -0.015686188031804195, -0.024726191708253006, 0.07219036993978734, 0.056031084601149965, 0.011684473436535074, 0.08384804920492213, -0.14594338993081468, -0.10825518457993363, 0.40925652399826584, -0.114296383725406, -0.21955797396694426, 0.19132060705019643, -0.11630246146801818, -0.1715712140450317, 0.09437021331631401, 0.1598650718263476, 0.1601294449666578, -0.19550539987433826, 0.12404069497401753, 0.00026271140642380444, 0.17610537695039188, 0.010114162281323015, 0.005711839487252945, 0.25916216896030675, 0.18701058093542128, 0.03143952963769101, 0.10825169966896221, -0.020491075398546926, -0.13347887933212385, -0.34052996803075075, -0.14765901401547585, -0.10910177706437332, 0.034946033453962536, -0.09510600650545702, -0.17611169986677974, 0.3944701557047665, 0.19232285611810204, 0.15856127523597371, 0.054209255888074466, 0.2337832794304979, 0.14896525167258393, 0.03568369986782415, 0.06759269076158826, 0.2760701638049959, 0.1083818426266773, 0.13013707746730677, -0.21499990485608578, 0.02760359515655744, 0.0913209538498705] |
1,802.02573 | Zorua: Enhancing Programming Ease, Portability, and Performance in GPUs
by Decoupling Programming Models from Resource Management | The application resource specification--a static specification of several
parameters such as the number of threads and the scratchpad memory usage per
thread block--forms a critical component of the existing GPU programming
models. This specification determines the performance of the application during
execution because the corresponding on-chip hardware resources are allocated
and managed purely based on this specification. This tight coupling between the
software-provided resource specification and resource management in hardware
leads to significant challenges in programming ease, portability, and
performance, as we demonstrate in this work.
Our goal in this work is to reduce the dependence of performance on the
software-provided resource specification to simultaneously alleviate the above
challenges. To this end, we introduce Zorua, a new resource virtualization
framework, that decouples the programmer-specified resource usage of a GPU
application from the actual allocation in the on-chip hardware resources. Zorua
enables this decoupling by virtualizing each resource transparently to the
programmer.
We demonstrate that by providing the illusion of more resources than
physically available, Zorua offers several important benefits: (i) Programming
Ease: Zorua eases the burden on the programmer to provide code that is tuned to
efficiently utilize the physically available on-chip resources. (ii)
Portability: Zorua alleviates the necessity of re-tuning an application's
resource usage when porting the application across GPU generations. (iii)
Performance: By dynamically allocating resources and carefully oversubscribing
them when necessary, Zorua improves or retains the performance of applications
that are already highly tuned to best utilize the resources. The holistic
virtualization provided by Zorua has many other potential uses which we
describe in this paper.
| cs.DC cs.AR | the application resource specificationa static specification of several parameters such as the number of threads and the scratchpad memory usage per thread blockforms a critical component of the existing gpu programming models this specification determines the performance of the application during execution because the corresponding onchip hardware resources are allocated and managed purely based on this specification this tight coupling between the softwareprovided resource specification and resource management in hardware leads to significant challenges in programming ease portability and performance as we demonstrate in this work our goal in this work is to reduce the dependence of performance on the softwareprovided resource specification to simultaneously alleviate the above challenges to this end we introduce zorua a new resource virtualization framework that decouples the programmerspecified resource usage of a gpu application from the actual allocation in the onchip hardware resources zorua enables this decoupling by virtualizing each resource transparently to the programmer we demonstrate that by providing the illusion of more resources than physically available zorua offers several important benefits i programming ease zorua eases the burden on the programmer to provide code that is tuned to efficiently utilize the physically available onchip resources ii portability zorua alleviates the necessity of retuning an applications resource usage when porting the application across gpu generations iii performance by dynamically allocating resources and carefully oversubscribing them when necessary zorua improves or retains the performance of applications that are already highly tuned to best utilize the resources the holistic virtualization provided by zorua has many other potential uses which we describe in this paper | [['the', 'application', 'resource', 'specificationa', 'static', 'specification', 'of', 'several', 'parameters', 'such', 'as', 'the', 'number', 'of', 'threads', 'and', 'the', 'scratchpad', 'memory', 'usage', 'per', 'thread', 'blockforms', 'a', 'critical', 'component', 'of', 'the', 'existing', 'gpu', 'programming', 'models', 'this', 'specification', 'determines', 'the', 'performance', 'of', 'the', 'application', 'during', 'execution', 'because', 'the', 'corresponding', 'onchip', 'hardware', 'resources', 'are', 'allocated', 'and', 'managed', 'purely', 'based', 'on', 'this', 'specification', 'this', 'tight', 'coupling', 'between', 'the', 'softwareprovided', 'resource', 'specification', 'and', 'resource', 'management', 'in', 'hardware', 'leads', 'to', 'significant', 'challenges', 'in', 'programming', 'ease', 'portability', 'and', 'performance', 'as', 'we', 'demonstrate', 'in', 'this', 'work', 'our', 'goal', 'in', 'this', 'work', 'is', 'to', 'reduce', 'the', 'dependence', 'of', 'performance', 'on', 'the', 'softwareprovided', 'resource', 'specification', 'to', 'simultaneously', 'alleviate', 'the', 'above', 'challenges', 'to', 'this', 'end', 'we', 'introduce', 'zorua', 'a', 'new', 'resource', 'virtualization', 'framework', 'that', 'decouples', 'the', 'programmerspecified', 'resource', 'usage', 'of', 'a', 'gpu', 'application', 'from', 'the', 'actual', 'allocation', 'in', 'the', 'onchip', 'hardware', 'resources', 'zorua', 'enables', 'this', 'decoupling', 'by', 'virtualizing', 'each', 'resource', 'transparently', 'to', 'the', 'programmer', 'we', 'demonstrate', 'that', 'by', 'providing', 'the', 'illusion', 'of', 'more', 'resources', 'than', 'physically', 'available', 'zorua', 'offers', 'several', 'important', 'benefits', 'i', 'programming', 'ease', 'zorua', 'eases', 'the', 'burden', 'on', 'the', 'programmer', 'to', 'provide', 'code', 'that', 'is', 'tuned', 'to', 'efficiently', 'utilize', 'the', 'physically', 'available', 'onchip', 'resources', 'ii', 'portability', 'zorua', 'alleviates', 'the', 'necessity', 'of', 'retuning', 'an', 'applications', 'resource', 'usage', 'when', 'porting', 'the', 'application', 'across', 'gpu', 'generations', 'iii', 'performance', 'by', 'dynamically', 'allocating', 'resources', 'and', 'carefully', 'oversubscribing', 'them', 'when', 'necessary', 'zorua', 'improves', 'or', 'retains', 'the', 'performance', 'of', 'applications', 'that', 'are', 'already', 'highly', 'tuned', 'to', 'best', 'utilize', 'the', 'resources', 'the', 'holistic', 'virtualization', 'provided', 'by', 'zorua', 'has', 'many', 'other', 'potential', 'uses', 'which', 'we', 'describe', 'in', 'this', 'paper']] | [-0.1547802524321354, 0.00031116475621356123, -0.03011208709876564, 0.017564658924111923, -0.15875027726806612, -0.19087859565674795, 0.11544998692971897, 0.3991598509512987, -0.29670261970000045, -0.38316512111472945, 0.09122718974552933, -0.18354765366733886, -0.09616649981700463, 0.2135578734525715, -0.146105866649112, 0.06324867209861715, 0.09437564221765223, -0.02901488596631, -0.035303790894583756, -0.28076479495829154, 0.2589332561981629, 0.11698171670244217, 0.35953621396338314, 0.09511844345625736, 0.04480876779031545, -0.026417328027558987, -0.008727725464778187, -0.06712252249876001, -0.05602282340330768, 0.1854637754720487, 0.31572853597868805, 0.2641023101771995, 0.37946786125759496, -0.4707414397339297, -0.16436481346550183, 0.041403414528447306, 0.1470505867442406, 0.054547851083977764, -0.0439295426688514, -0.23567040754184995, 0.06884949599892799, -0.24542966515463613, -0.059904582074169314, -0.11454277592353299, -0.028090459907043303, 0.0019117270642529144, -0.23911430247142504, -0.03532821845158152, 0.014384131097227538, 0.02759065889166342, -0.0190841387332225, -0.09154348981979843, 0.009630036092560796, 0.15066813399624768, 0.016828782294318806, -0.007996505875582535, 0.165749961912545, -0.13701061669334857, -0.1412211673348736, 0.38891552099849347, 0.017683770427793347, -0.2147470051096571, 0.20561502794626418, 0.014802669655125777, -0.16598160121071692, 0.06247451230937956, 0.18280548900084984, 0.024649286920346087, -0.1935743863087606, 0.10381510601073671, 0.06764631410734546, 0.21911010749870005, 0.060544316492909526, 0.10686460375090054, 0.1776752678980029, 0.2406240297456051, 0.08004285192188665, 0.21356758897592304, -0.010198107179628452, -0.09727474676756775, -0.25065684629647705, -0.1952153966936069, -0.18063608956602964, -0.02647163509844226, -0.08205025152597488, -0.1072931421145159, 0.4024960136254851, 0.2503473901467086, 0.0975180376205115, 0.11268332816228037, 0.4310972468079528, 0.05614512762669039, 0.1788388003870584, 0.16964205867585505, 0.12337345761294088, -0.02820183880308259, 0.17875419095963066, -0.2528416239374812, 0.07639981689330658, -0.04467636620007992] |
1,802.02574 | Transport of the light polarization in the weak gravitational wave
background | The influence of the weak gravitational wave on the light polarization is
considered. Oscillations in the direction of the polarization vector is found.
| gr-qc physics.optics | the influence of the weak gravitational wave on the light polarization is considered oscillations in the direction of the polarization vector is found | [['the', 'influence', 'of', 'the', 'weak', 'gravitational', 'wave', 'on', 'the', 'light', 'polarization', 'is', 'considered', 'oscillations', 'in', 'the', 'direction', 'of', 'the', 'polarization', 'vector', 'is', 'found']] | [-0.27465185395482444, 0.1840108432199644, -0.0378292177034461, 0.07250559926235481, -0.09460730850696564, 0.0004093912632569023, -0.032992871640169105, 0.346241420701794, -0.2883478574778723, -0.20313884564877852, 0.0395341274358899, -0.2679717937565368, -0.10876202421343845, 0.20886482557524805, 0.1116852881791799, 0.025650250057325415, -0.012013238854706287, 0.09342228434979916, -0.0318961922970155, -0.18655132145985312, 0.34615632753981196, 0.06553379677074112, 0.3415997983968776, 0.06537696978320247, 0.09318031629790431, 0.06852316882704264, -0.06174899726782156, 0.012643868994453678, 0.0030231205183435636, 0.03731357970315477, 0.09747408541000407, 0.08840995399362367, 0.18674911007932996, -0.39448541937314946, -0.24597199147810106, 0.09066764443464902, 0.08544667745413988, 0.18146186253136914, -0.04547049488325644, -0.3126684009380963, -0.00556678480833121, -0.014960061596787495, -0.1881992902768695, 0.04595226470542991, 0.06579268109255834, 0.07373547128847112, -0.23716722295174134, 0.10367570517827636, 0.019790341105798016, -0.013344003454498623, -0.07317327489347561, -0.09587438473396975, -0.10157411610302718, 0.012886105105280876, 0.14414330934295835, 0.1421901862056035, 0.11872859979453294, -0.1166854118320929, -0.08145920049561106, 0.4216625201313392, -0.15534368053625297, -0.22903903051400962, 0.08509111614978832, -0.2560112980072913, -0.039888848044464124, 0.13312407048500102, 0.22245185344439486, 0.12185869017696899, -0.08832768727417874, 0.049772493217302406, -0.018008322818786837, 0.15552589329688446, 0.08055808387048867, 0.08475729778570973, 0.30281797148611234, 0.13537001990429734, 0.05177053756525983, 0.13096048318497513, -0.19174238167824628, -0.010013676167506239, -0.3139930775632029, -0.09880690163244372, -0.16088184880335693, 0.03967090291363369, -0.0630151537935371, -0.14342207493989365, 0.487947553112779, 0.12461488054174444, 0.1109341207243826, -0.05788481041141178, 0.2956773779638436, 0.14991391215817598, 0.04005585513685061, 0.025715240520303665, 0.5115037566941717, 0.21706061049000078, 0.16267435100820402, -0.31399204163893085, 0.12031593566517466, -0.02556153694572656] |
1,802.02575 | New variable Stars from the Photographic Archive: Semi-automated
Discoveries, Attempts of Automatic Classification, and the New Field 104 Her | Using 172 plates taken with the 40-cm astrograph of the Sternberg
Astronomical Institute (Lomonosov Moscow University) in 1976-1994 and digitized
with the resolution of 2400 dpi, we discovered and studied 275 new variable
stars. We present the list of our new variables with all necessary information
concerning their brightness variations. As in our earlier studies, the new
discoveries show a rather large number of high-amplitude Delta Scuti variables,
predicting that many stars of this type remain not detected in the whole sky.
We also performed automated classification of the newly discovered variable
stars based on the Random Forest algorithm. The results of the automated
classification were compared to traditional classification and showed that
automated classification was possible even with noisy photographic data.
However, further improvement of automated techniques is needed, which is
especially important having in mind the very large numbers of new discoveries
expected from all-sky surveys.
| astro-ph.SR astro-ph.IM | using 172 plates taken with the 40cm astrograph of the sternberg astronomical institute lomonosov moscow university in 19761994 and digitized with the resolution of 2400 dpi we discovered and studied 275 new variable stars we present the list of our new variables with all necessary information concerning their brightness variations as in our earlier studies the new discoveries show a rather large number of highamplitude delta scuti variables predicting that many stars of this type remain not detected in the whole sky we also performed automated classification of the newly discovered variable stars based on the random forest algorithm the results of the automated classification were compared to traditional classification and showed that automated classification was possible even with noisy photographic data however further improvement of automated techniques is needed which is especially important having in mind the very large numbers of new discoveries expected from allsky surveys | [['using', '172', 'plates', 'taken', 'with', 'the', '40cm', 'astrograph', 'of', 'the', 'sternberg', 'astronomical', 'institute', 'lomonosov', 'moscow', 'university', 'in', '19761994', 'and', 'digitized', 'with', 'the', 'resolution', 'of', '2400', 'dpi', 'we', 'discovered', 'and', 'studied', '275', 'new', 'variable', 'stars', 'we', 'present', 'the', 'list', 'of', 'our', 'new', 'variables', 'with', 'all', 'necessary', 'information', 'concerning', 'their', 'brightness', 'variations', 'as', 'in', 'our', 'earlier', 'studies', 'the', 'new', 'discoveries', 'show', 'a', 'rather', 'large', 'number', 'of', 'highamplitude', 'delta', 'scuti', 'variables', 'predicting', 'that', 'many', 'stars', 'of', 'this', 'type', 'remain', 'not', 'detected', 'in', 'the', 'whole', 'sky', 'we', 'also', 'performed', 'automated', 'classification', 'of', 'the', 'newly', 'discovered', 'variable', 'stars', 'based', 'on', 'the', 'random', 'forest', 'algorithm', 'the', 'results', 'of', 'the', 'automated', 'classification', 'were', 'compared', 'to', 'traditional', 'classification', 'and', 'showed', 'that', 'automated', 'classification', 'was', 'possible', 'even', 'with', 'noisy', 'photographic', 'data', 'however', 'further', 'improvement', 'of', 'automated', 'techniques', 'is', 'needed', 'which', 'is', 'especially', 'important', 'having', 'in', 'mind', 'the', 'very', 'large', 'numbers', 'of', 'new', 'discoveries', 'expected', 'from', 'allsky', 'surveys']] | [-0.07413992357478306, 0.09627188310077807, -0.07397770743063163, 0.05174596764568594, -0.13021005453624238, -0.09692852098025939, 0.09927784968927807, 0.3520128443634429, -0.17493888820350476, -0.37951899662005656, 0.14908147341616096, -0.3035321609959716, -0.10999773214666211, 0.26414173487953996, -0.11511377272430529, 0.06163828875742802, 0.13368571372576007, 0.007423617839052969, -0.03155283712137326, -0.32056654252263966, 0.2493503501141431, 0.048813672045714594, 0.2543825108469242, -0.03718719280445251, 0.07820036044727606, 0.016282506687028117, -0.16465262538233938, 0.0158417099123808, -0.09753323592877944, 0.11238631893259783, 0.2883924283388191, 0.15589980435792078, 0.25654692310510446, -0.33916928258971596, -0.17593542457127398, 0.07633563002799543, 0.12264295078522595, 0.06648607655558228, -0.05021636461487458, -0.33123474040379125, 0.06568677399899861, -0.13643699321503036, -0.14684323411213937, -0.05676102726308464, 0.04320869438641635, 0.07332441383152313, -0.19979992068252292, 0.054607410820756985, 0.03038552051194671, 0.15507135032375222, -0.09005154206157745, -0.19080992754181328, -6.00026331233735e-05, 0.1461095391189819, 0.011263594788429485, 0.08872745768246272, 0.04131826446043188, -0.14244860096923298, -0.08666744582722483, 0.375261195599526, -0.06474775007963941, -0.04200497922189787, 0.201035513831255, -0.1646663067786365, -0.21826574723964848, 0.14116514653448953, 0.17285544953632112, 0.13973526450723003, -0.1943571349537811, 0.0014682186242402056, -0.028517819244135805, 0.190041443047931, 0.07916662656404332, 0.02364080206358007, 0.20950583151864763, 0.1944109807044369, -0.02012961340765627, 0.11338391754701797, -0.2308870612241353, 0.0007798450070015174, -0.25529327702892274, -0.12347955431244305, -0.14405191958752037, 0.023000864309775895, -0.053165892019989065, -0.14353583155668714, 0.3756165227339584, 0.1606019315544237, 0.14684312736305097, 0.018799772425111206, 0.2811060660315969, 0.011308166607865924, 0.1161144953807119, 0.0835834627236132, 0.27181656410375954, 0.11861477762169274, 0.15882418548916372, -0.14010930109569536, 0.04665626539234199, -0.004831159157919235] |
1,802.02576 | The Chemical Homogeneity of Sun-like Stars in the Solar Neighborhood | The compositions of stars are a critical diagnostic tool for many topics in
astronomy such as the evolution of our Galaxy, the formation of planets, and
the uniqueness of the Sun. Previous spectroscopic measurements indicate a large
intrinsic variation in the elemental abundance patterns of stars with similar
overall metal content. However, systematic errors arising from inaccuracies in
stellar models are known to be a limiting factor in such studies, and thus it
is uncertain to what extent the observed diversity of stellar abundance
patterns is real. Here we report the abundances of 30 elements with precisions
of 2% for 79 Sun-like stars within 100 parsecs. Systematic errors are minimized
in this study by focusing on solar twin stars and performing a line-by-line
differential analysis using high-resolution, high-signal-to-noise spectra. We
resolve [X/Fe] abundance trends in galactic chemical evolution at precisions of
$10^{-3}$ dex Gyr$^{-1}$ and reveal that stars with similar ages and
metallicities have nearly identical abundance patterns. Contrary to previous
results, we find that the ratios of carbon-to-oxygen and magnesium-to-silicon
in solar metallicity stars are homogeneous to within 10% throughout the solar
neighborhood, implying that exoplanets may exhibit much less compositional
diversity than previously thought. Finally, we demonstrate that the Sun has a
subtle deficiency in refractory material relative to >80% of solar twins (at
2$\sigma$ confidence), suggesting a possible signpost for planetary systems
like our own.
| astro-ph.SR astro-ph.EP | the compositions of stars are a critical diagnostic tool for many topics in astronomy such as the evolution of our galaxy the formation of planets and the uniqueness of the sun previous spectroscopic measurements indicate a large intrinsic variation in the elemental abundance patterns of stars with similar overall metal content however systematic errors arising from inaccuracies in stellar models are known to be a limiting factor in such studies and thus it is uncertain to what extent the observed diversity of stellar abundance patterns is real here we report the abundances of 30 elements with precisions of 2 for 79 sunlike stars within 100 parsecs systematic errors are minimized in this study by focusing on solar twin stars and performing a linebyline differential analysis using highresolution highsignaltonoise spectra we resolve xfe abundance trends in galactic chemical evolution at precisions of 103 dex gyr1 and reveal that stars with similar ages and metallicities have nearly identical abundance patterns contrary to previous results we find that the ratios of carbontooxygen and magnesiumtosilicon in solar metallicity stars are homogeneous to within 10 throughout the solar neighborhood implying that exoplanets may exhibit much less compositional diversity than previously thought finally we demonstrate that the sun has a subtle deficiency in refractory material relative to 80 of solar twins at 2sigma confidence suggesting a possible signpost for planetary systems like our own | [['the', 'compositions', 'of', 'stars', 'are', 'a', 'critical', 'diagnostic', 'tool', 'for', 'many', 'topics', 'in', 'astronomy', 'such', 'as', 'the', 'evolution', 'of', 'our', 'galaxy', 'the', 'formation', 'of', 'planets', 'and', 'the', 'uniqueness', 'of', 'the', 'sun', 'previous', 'spectroscopic', 'measurements', 'indicate', 'a', 'large', 'intrinsic', 'variation', 'in', 'the', 'elemental', 'abundance', 'patterns', 'of', 'stars', 'with', 'similar', 'overall', 'metal', 'content', 'however', 'systematic', 'errors', 'arising', 'from', 'inaccuracies', 'in', 'stellar', 'models', 'are', 'known', 'to', 'be', 'a', 'limiting', 'factor', 'in', 'such', 'studies', 'and', 'thus', 'it', 'is', 'uncertain', 'to', 'what', 'extent', 'the', 'observed', 'diversity', 'of', 'stellar', 'abundance', 'patterns', 'is', 'real', 'here', 'we', 'report', 'the', 'abundances', 'of', '30', 'elements', 'with', 'precisions', 'of', '2', 'for', '79', 'sunlike', 'stars', 'within', '100', 'parsecs', 'systematic', 'errors', 'are', 'minimized', 'in', 'this', 'study', 'by', 'focusing', 'on', 'solar', 'twin', 'stars', 'and', 'performing', 'a', 'linebyline', 'differential', 'analysis', 'using', 'highresolution', 'highsignaltonoise', 'spectra', 'we', 'resolve', 'xfe', 'abundance', 'trends', 'in', 'galactic', 'chemical', 'evolution', 'at', 'precisions', 'of', '103', 'dex', 'gyr1', 'and', 'reveal', 'that', 'stars', 'with', 'similar', 'ages', 'and', 'metallicities', 'have', 'nearly', 'identical', 'abundance', 'patterns', 'contrary', 'to', 'previous', 'results', 'we', 'find', 'that', 'the', 'ratios', 'of', 'carbontooxygen', 'and', 'magnesiumtosilicon', 'in', 'solar', 'metallicity', 'stars', 'are', 'homogeneous', 'to', 'within', '10', 'throughout', 'the', 'solar', 'neighborhood', 'implying', 'that', 'exoplanets', 'may', 'exhibit', 'much', 'less', 'compositional', 'diversity', 'than', 'previously', 'thought', 'finally', 'we', 'demonstrate', 'that', 'the', 'sun', 'has', 'a', 'subtle', 'deficiency', 'in', 'refractory', 'material', 'relative', 'to', '80', 'of', 'solar', 'twins', 'at', '2sigma', 'confidence', 'suggesting', 'a', 'possible', 'signpost', 'for', 'planetary', 'systems', 'like', 'our', 'own']] | [-0.03904965494262949, 0.14950643500542915, -0.030514794735813366, 0.09818428952609998, -0.05494689880557448, -0.025953910623303725, 0.09280161186232178, 0.40691593614107385, -0.1737542280902684, -0.42674654819448743, 0.03308603376773748, -0.31134984430770846, -0.07265887514991677, 0.20533338517754746, -0.09947406505097355, 0.006877005680788324, 0.10170984385526916, -0.04167752786506673, -0.07694002559499831, -0.26124742484634456, 0.28132938413515624, 0.060935717231967376, 0.1385463436913937, -0.03755255437780188, -0.011066106179860391, -0.1721261843612278, -0.07243493152782321, -0.00625913144224672, -0.14591660877622536, 0.05979070478500511, 0.26913315018542877, 0.14327591363882178, 0.20291037322858596, -0.3625158835470416, -0.23490068033575554, 0.041475740323429884, 0.19163663427259298, 0.06603888894886698, -0.1043122601782542, -0.2207054130103242, 0.10521144990189747, -0.13730378635535387, -0.15946080709196267, 0.025182199817497513, 0.0521145512694534, 0.03340572464671642, -0.2414837238811662, 0.13553062761469134, 0.02388267982295342, 0.19187014892806056, -0.11060760487773608, -0.1820094002203581, -0.060498035585688274, 0.1116155736345289, 0.022181626633148117, 0.004490237926145285, 0.15030685303494792, -0.07781782822933721, -0.019481362366745258, 0.45353192133656683, -0.11198908350275807, -0.052370754197765025, 0.2258212486331224, -0.2423347360577582, -0.18901402952502347, 0.0983688541511607, 0.1610177539284895, 0.14184918226817794, -0.168293804258502, -0.017456187654824082, -0.014112199972576506, 0.23255663162450171, 0.06547453084402607, 0.07541321360898186, 0.30270560407018215, 0.1593385596138052, 0.040777703470474574, 0.0071380345898553205, -0.17868078844149962, -0.07652118537366792, -0.1691655021859333, -0.1404456983757357, -0.058699633980514525, 0.07175536023910334, -0.14414255635462606, -0.13591623052930057, 0.3589498605168864, 0.18647348292485816, 0.22182135350821697, 0.028994141936318597, 0.28247889000840387, 0.05737141289210792, 0.1159816110626659, 0.07040690743294648, 0.3137479925083021, 0.17973837434182904, 0.09571832035245612, -0.2355490586985034, 0.1370786246494903, -0.0360945453457042] |
1,802.02577 | Supernova Neutrino Neutrino Astronomy | Modern neutrino facilities will be able to detect a large number of neutrinos
from the next Galactic supernova. We investigate the viability of the
triangulation method to locate a core-collapse supernova by employing the
neutrino arrival time differences at various detectors. We perform detailed
numerical fits in order to determine the uncertainties of these time
differences for the cases when the core collapses into a neutron star or a
black hole. We provide a global picture by combining all the relevant current
and future neutrino detectors. Our findings indicate that in the scenario of a
neutron star formation, supernova can be located with precision of 1.5 and 3.5
degrees in declination and right ascension, respectively. For the black hole
scenario, sub-degree precision can be reached.
| hep-ph astro-ph.HE hep-ex | modern neutrino facilities will be able to detect a large number of neutrinos from the next galactic supernova we investigate the viability of the triangulation method to locate a corecollapse supernova by employing the neutrino arrival time differences at various detectors we perform detailed numerical fits in order to determine the uncertainties of these time differences for the cases when the core collapses into a neutron star or a black hole we provide a global picture by combining all the relevant current and future neutrino detectors our findings indicate that in the scenario of a neutron star formation supernova can be located with precision of 15 and 35 degrees in declination and right ascension respectively for the black hole scenario subdegree precision can be reached | [['modern', 'neutrino', 'facilities', 'will', 'be', 'able', 'to', 'detect', 'a', 'large', 'number', 'of', 'neutrinos', 'from', 'the', 'next', 'galactic', 'supernova', 'we', 'investigate', 'the', 'viability', 'of', 'the', 'triangulation', 'method', 'to', 'locate', 'a', 'corecollapse', 'supernova', 'by', 'employing', 'the', 'neutrino', 'arrival', 'time', 'differences', 'at', 'various', 'detectors', 'we', 'perform', 'detailed', 'numerical', 'fits', 'in', 'order', 'to', 'determine', 'the', 'uncertainties', 'of', 'these', 'time', 'differences', 'for', 'the', 'cases', 'when', 'the', 'core', 'collapses', 'into', 'a', 'neutron', 'star', 'or', 'a', 'black', 'hole', 'we', 'provide', 'a', 'global', 'picture', 'by', 'combining', 'all', 'the', 'relevant', 'current', 'and', 'future', 'neutrino', 'detectors', 'our', 'findings', 'indicate', 'that', 'in', 'the', 'scenario', 'of', 'a', 'neutron', 'star', 'formation', 'supernova', 'can', 'be', 'located', 'with', 'precision', 'of', '15', 'and', '35', 'degrees', 'in', 'declination', 'and', 'right', 'ascension', 'respectively', 'for', 'the', 'black', 'hole', 'scenario', 'subdegree', 'precision', 'can', 'be', 'reached']] | [-0.0747873930579517, 0.12422617966681719, -0.037880971796810624, 0.13539121827110648, -0.07665662096068263, -0.07938919596374035, 0.08708757288753986, 0.3598488674759865, -0.21329327784851193, -0.34110239128023384, 0.11487611864972859, -0.3229494924545288, -0.0017878805687651037, 0.2296440093461424, 0.014561163224279881, -0.02837161706574261, 0.11445124403899536, 0.012490327874431387, -0.11893993998877704, -0.248585034025833, 0.2716926063746214, 0.1282265490181744, 0.1809490206092596, 0.020839213184081017, 0.08502208627085202, -0.08335866448283195, -0.049841080494225025, -0.00274509909831977, -0.1297278239103616, 0.02200562423467636, 0.2408082242355449, 0.18316358597576618, 0.1780133725851774, -0.4462544257864356, -0.21781251365691423, 0.11528191708214582, 0.16714226042665542, 0.08892509713210166, -0.0870118233282119, -0.2899474832192063, 0.09601491099735722, -0.23213720116205513, -0.17770243733376265, -0.009664451884105802, -0.04278236300498247, 0.040594875384587795, -0.25749825964681805, 0.07856477884203196, -0.029932868711650372, -0.037405075542628764, -0.0520024194563739, -0.1073589823320508, 0.02243565010372549, 0.11722641747933812, 0.051893899001181125, 0.04260753770545125, 0.12730293050967156, -0.12429175191372634, -0.08930188158713281, 0.42034327434375884, -0.03277118930127472, -0.10043712400645018, 0.1505551250949502, -0.24722029637172818, -0.1366601462624967, 0.11867374102026224, 0.18100164909427985, 0.11428938165679574, -0.14883223809173796, -0.0022393314889632165, 0.0026308443155139685, 0.1880674446672201, 0.07160185528546571, 0.029418947078695055, 0.37680946741998195, 0.22706435555778443, 0.055772929872386155, 0.03529309296887368, -0.22699493355536834, -0.016612246721982957, -0.31506332206353543, -0.10159410285507328, -0.1092739840419963, 0.07664375205535907, -0.12361149155872408, -0.058978331420570615, 0.38772966639697554, 0.1511339481808245, 0.17606212886422873, -0.0018367774989455938, 0.2717697839587927, 0.03322764577809721, 0.0449800277184695, 0.07226793128624559, 0.31732249856740236, 0.10857680432125925, 0.11497022827342153, -0.25179804117046295, 0.03739389067515731, 0.02558597563765943] |
1,802.02578 | Signatures of Cosmic Reionization on the 21cm 2- and 3-point Correlation
Function I: Quadratic Bias Modeling | The three-point correlation function (3PCF) of the 21cm brightness
temperature from the Epoch of Reionization (EoR) probes complementary
information to the commonly studied two-point correlation function (2PCF) about
the morphology of ionized regions. We investigate the 21cm 2PCF and 3PCF in
configuration space using semi-numerical simulations and test whether they can
be described by the local quadratic bias model. We find that fits of bias model
predictions for the 2PCF and 3PCF deviate from our measurements by $\sim 20\%$
at scales above the typical size of ionized regions ($\simeq 30$ Mpc) and at
early times with global neutral fractions of $\langle x_{\rm HI} \rangle
\gtrsim 0.7$. At later times and smaller scales these deviations increase
strongly, indicating a break down of the bias model. The 2PCF and 3PCF fits of
the linear bias parameter agree at the $10\%$ level for different EoR model
configurations. This agreement holds, when adding redshift space distortions to
the simulations. The relation between spatial fluctuations in the matter
density and the 21cm signal, as predicted by the bias model, is consistent with
direct measurements of this relation in simulations for large smoothing scales
($\gtrsim 30$ Mpc). From this latter test we conclude that negative amplitudes
of the 21cm 3PCF result from negative bias parameters, which describe the
anti-correlation between the matter over-densities and the 21cm signal during
the EoR. However, a more detailed interpretation of the bias parameters may
require a description of non-local contributions to the bias model.
| astro-ph.CO | the threepoint correlation function 3pcf of the 21cm brightness temperature from the epoch of reionization eor probes complementary information to the commonly studied twopoint correlation function 2pcf about the morphology of ionized regions we investigate the 21cm 2pcf and 3pcf in configuration space using seminumerical simulations and test whether they can be described by the local quadratic bias model we find that fits of bias model predictions for the 2pcf and 3pcf deviate from our measurements by sim 20 at scales above the typical size of ionized regions simeq 30 mpc and at early times with global neutral fractions of langle x_rm hi rangle gtrsim 07 at later times and smaller scales these deviations increase strongly indicating a break down of the bias model the 2pcf and 3pcf fits of the linear bias parameter agree at the 10 level for different eor model configurations this agreement holds when adding redshift space distortions to the simulations the relation between spatial fluctuations in the matter density and the 21cm signal as predicted by the bias model is consistent with direct measurements of this relation in simulations for large smoothing scales gtrsim 30 mpc from this latter test we conclude that negative amplitudes of the 21cm 3pcf result from negative bias parameters which describe the anticorrelation between the matter overdensities and the 21cm signal during the eor however a more detailed interpretation of the bias parameters may require a description of nonlocal contributions to the bias model | [['the', 'threepoint', 'correlation', 'function', '3pcf', 'of', 'the', '21cm', 'brightness', 'temperature', 'from', 'the', 'epoch', 'of', 'reionization', 'eor', 'probes', 'complementary', 'information', 'to', 'the', 'commonly', 'studied', 'twopoint', 'correlation', 'function', '2pcf', 'about', 'the', 'morphology', 'of', 'ionized', 'regions', 'we', 'investigate', 'the', '21cm', '2pcf', 'and', '3pcf', 'in', 'configuration', 'space', 'using', 'seminumerical', 'simulations', 'and', 'test', 'whether', 'they', 'can', 'be', 'described', 'by', 'the', 'local', 'quadratic', 'bias', 'model', 'we', 'find', 'that', 'fits', 'of', 'bias', 'model', 'predictions', 'for', 'the', '2pcf', 'and', '3pcf', 'deviate', 'from', 'our', 'measurements', 'by', 'sim', '20', 'at', 'scales', 'above', 'the', 'typical', 'size', 'of', 'ionized', 'regions', 'simeq', '30', 'mpc', 'and', 'at', 'early', 'times', 'with', 'global', 'neutral', 'fractions', 'of', 'langle', 'x_rm', 'hi', 'rangle', 'gtrsim', '07', 'at', 'later', 'times', 'and', 'smaller', 'scales', 'these', 'deviations', 'increase', 'strongly', 'indicating', 'a', 'break', 'down', 'of', 'the', 'bias', 'model', 'the', '2pcf', 'and', '3pcf', 'fits', 'of', 'the', 'linear', 'bias', 'parameter', 'agree', 'at', 'the', '10', 'level', 'for', 'different', 'eor', 'model', 'configurations', 'this', 'agreement', 'holds', 'when', 'adding', 'redshift', 'space', 'distortions', 'to', 'the', 'simulations', 'the', 'relation', 'between', 'spatial', 'fluctuations', 'in', 'the', 'matter', 'density', 'and', 'the', '21cm', 'signal', 'as', 'predicted', 'by', 'the', 'bias', 'model', 'is', 'consistent', 'with', 'direct', 'measurements', 'of', 'this', 'relation', 'in', 'simulations', 'for', 'large', 'smoothing', 'scales', 'gtrsim', '30', 'mpc', 'from', 'this', 'latter', 'test', 'we', 'conclude', 'that', 'negative', 'amplitudes', 'of', 'the', '21cm', '3pcf', 'result', 'from', 'negative', 'bias', 'parameters', 'which', 'describe', 'the', 'anticorrelation', 'between', 'the', 'matter', 'overdensities', 'and', 'the', '21cm', 'signal', 'during', 'the', 'eor', 'however', 'a', 'more', 'detailed', 'interpretation', 'of', 'the', 'bias', 'parameters', 'may', 'require', 'a', 'description', 'of', 'nonlocal', 'contributions', 'to', 'the', 'bias', 'model']] | [-0.05340722984907248, 0.11573123140833111, -0.07942711706292342, 0.12980010196257413, -0.031092005138682415, -0.06380985952822156, -0.001970015488160377, 0.37371486266616916, -0.22975449188856684, -0.3532793419206607, 0.02947491765466946, -0.3063970868414665, -0.044345681759773097, 0.17334968809488793, 0.10280015809293531, -0.014200352515679875, -0.010250364956980357, -0.11134828895914414, -0.11541300973673418, -0.2438543075137413, 0.27658093486674945, 0.13565047566977437, 0.2589745227644434, -0.0011799906563685566, 0.0755718184089227, -0.055063985679374976, -0.11794278177921279, 0.050744156272782275, -0.18196629921741808, -0.005694677868856072, 0.2134165814915504, 0.1132848101327402, 0.2049808396469252, -0.347765510306373, -0.18338643498651944, 0.11565484009591527, 0.16974632345811755, 0.11916578880303204, 0.006737604389168975, -0.28503780855251415, 0.04651139155803172, -0.15857207238842108, -0.11476497761867024, 0.005950335636267393, 0.009824392576625601, -0.00857307374254098, -0.29074060599334905, 0.24944202457440132, -0.022495569411252976, 0.048643211562655955, -0.008636750413494215, -0.11129049736229688, -0.04809231636568629, 0.07116693091976216, 0.017833505389299703, 0.08591548833611028, 0.21868248524518347, -0.18742183607823568, -0.008746068870274687, 0.35955098065305274, -0.10595350147207787, -0.07051822447435564, 0.12945448089635275, -0.23741413372927575, -0.15086984711405288, 0.10963603281645012, 0.16064065707231762, 0.030632799991418904, -0.10289551410376768, 0.0655567903867763, 0.004773517862080642, 0.28317028891722684, 0.04176099438408245, 0.03112884327078302, 0.2941956688672854, 0.08220633031460686, 0.08186495630070567, 0.05731000099665119, -0.15254662116797693, -0.009877264808832865, -0.3048265085965452, -0.04566917427220061, -0.1500849143218356, 0.07265901395652184, -0.19410911898334324, -0.11140068902130254, 0.40030566376603405, 0.20705591710370233, 0.2687094809924497, 0.1379030687036947, 0.3339329567016484, 0.10054831148113781, 0.08001008773314171, 0.035060399379886566, 0.2770221775996911, 0.15165934977446088, 0.057592198743149026, -0.2290111480034567, 0.0654550025189013, -0.032056140017764426] |
1,802.02579 | The Planes of Satellite Galaxies Problem, Suggested Solutions, and Open
Questions | Satellite galaxies of the Milky Way and of the Andromeda galaxy have been
found to preferentially align in significantly flattened planes of satellite
galaxies, and available velocity measurements are indicative of a preference of
satellites in those structures to co-orbit. There is increasing evidence that
such kinematically correlated satellite planes are also present around more
distant hosts. Detailed comparisons show that similarly anisotropic phase-space
distributions of sub-halos are exceedingly rare in cosmological simulations
based on the $\Lambda$CDM paradigm. Analogs to the observed systems have
frequencies of $\leq 0.5$ per cent in such simulations. In contrast to other
small-scale problems, the satellite planes issue is not strongly affected by
baryonic processes because the distribution of sub-halos on scales of hundreds
of kpc is dominated by gravitational effects. This makes the satellite planes
one of the most serious small-scale problem for $\Lambda$CDM. This review
summarizes the observational evidence for planes of satellite galaxies in the
Local Group and beyond, and provides an overview of how they compare to
cosmological simulations. It also discusses scenarios which aim at explaining
the coherence of satellite positions and orbits, and why they all are currently
unable to satisfactorily resolve the issue.
| astro-ph.GA astro-ph.CO | satellite galaxies of the milky way and of the andromeda galaxy have been found to preferentially align in significantly flattened planes of satellite galaxies and available velocity measurements are indicative of a preference of satellites in those structures to coorbit there is increasing evidence that such kinematically correlated satellite planes are also present around more distant hosts detailed comparisons show that similarly anisotropic phasespace distributions of subhalos are exceedingly rare in cosmological simulations based on the lambdacdm paradigm analogs to the observed systems have frequencies of leq 05 per cent in such simulations in contrast to other smallscale problems the satellite planes issue is not strongly affected by baryonic processes because the distribution of subhalos on scales of hundreds of kpc is dominated by gravitational effects this makes the satellite planes one of the most serious smallscale problem for lambdacdm this review summarizes the observational evidence for planes of satellite galaxies in the local group and beyond and provides an overview of how they compare to cosmological simulations it also discusses scenarios which aim at explaining the coherence of satellite positions and orbits and why they all are currently unable to satisfactorily resolve the issue | [['satellite', 'galaxies', 'of', 'the', 'milky', 'way', 'and', 'of', 'the', 'andromeda', 'galaxy', 'have', 'been', 'found', 'to', 'preferentially', 'align', 'in', 'significantly', 'flattened', 'planes', 'of', 'satellite', 'galaxies', 'and', 'available', 'velocity', 'measurements', 'are', 'indicative', 'of', 'a', 'preference', 'of', 'satellites', 'in', 'those', 'structures', 'to', 'coorbit', 'there', 'is', 'increasing', 'evidence', 'that', 'such', 'kinematically', 'correlated', 'satellite', 'planes', 'are', 'also', 'present', 'around', 'more', 'distant', 'hosts', 'detailed', 'comparisons', 'show', 'that', 'similarly', 'anisotropic', 'phasespace', 'distributions', 'of', 'subhalos', 'are', 'exceedingly', 'rare', 'in', 'cosmological', 'simulations', 'based', 'on', 'the', 'lambdacdm', 'paradigm', 'analogs', 'to', 'the', 'observed', 'systems', 'have', 'frequencies', 'of', 'leq', '05', 'per', 'cent', 'in', 'such', 'simulations', 'in', 'contrast', 'to', 'other', 'smallscale', 'problems', 'the', 'satellite', 'planes', 'issue', 'is', 'not', 'strongly', 'affected', 'by', 'baryonic', 'processes', 'because', 'the', 'distribution', 'of', 'subhalos', 'on', 'scales', 'of', 'hundreds', 'of', 'kpc', 'is', 'dominated', 'by', 'gravitational', 'effects', 'this', 'makes', 'the', 'satellite', 'planes', 'one', 'of', 'the', 'most', 'serious', 'smallscale', 'problem', 'for', 'lambdacdm', 'this', 'review', 'summarizes', 'the', 'observational', 'evidence', 'for', 'planes', 'of', 'satellite', 'galaxies', 'in', 'the', 'local', 'group', 'and', 'beyond', 'and', 'provides', 'an', 'overview', 'of', 'how', 'they', 'compare', 'to', 'cosmological', 'simulations', 'it', 'also', 'discusses', 'scenarios', 'which', 'aim', 'at', 'explaining', 'the', 'coherence', 'of', 'satellite', 'positions', 'and', 'orbits', 'and', 'why', 'they', 'all', 'are', 'currently', 'unable', 'to', 'satisfactorily', 'resolve', 'the', 'issue']] | [-0.13192209485524262, 0.10063972292200793, -0.07027643232916793, 0.13984166168643591, -0.10058219996161567, -0.052928123279259755, -0.014478342399860804, 0.39583580318169714, -0.19454073498371796, -0.3661096159965755, 0.04494370415997811, -0.3264446487029394, -0.07716513051627538, 0.23737246027837197, -0.03554264025714917, -0.010218235517804248, 0.050228229929239324, -0.06890071544211167, -0.050185984207126194, -0.28976538464044915, 0.30718002036595954, 0.11129812756314492, 0.20573394390999172, -0.054786130358488894, 0.04845045613698088, -0.06701816603159293, -0.10116083762393548, 0.0045595201615912795, -0.15828689845757954, 0.03949704339656119, 0.26886464920408354, 0.10775996268106004, 0.2312963327488456, -0.4294340253306123, -0.20042136826728565, 0.10109530498202031, 0.22880983064189936, 0.08714440122712404, -0.09312623504658217, -0.27349703225951927, 0.09556609401479363, -0.15835593727727731, -0.16294968630402135, 0.007813421076832291, 0.04101269593468318, 0.019619110135886915, -0.15468386452143582, 0.16468867586585334, 0.02177603712472587, 0.07891281083082924, -0.05898302121995351, -0.08167147420657178, -0.04311848091534697, 0.06515259419341023, 0.07061497534308821, 0.027794854619946234, 0.17442306287538928, -0.11555042179325262, -0.061102337741221376, 0.4720016299914091, -0.007281830175540959, -0.09002738974776525, 0.2382026301087955, -0.21980428473116495, -0.19443413955517685, 0.0733673414296787, 0.15383868686711558, 0.06909787992510992, -0.1423080262632515, 0.030923826633713757, -0.03666957080459748, 0.1866254574010292, 0.03056587948439977, 0.05430323973257775, 0.3329845407261298, 0.10382729643382706, 0.09472535823543485, 0.026105214617489717, -0.14408593053380267, -0.08310505952029369, -0.2136266561368337, -0.09955810732446993, -0.1360572260320903, -0.016651644224512915, -0.07434372264273967, -0.10290353492809794, 0.33815670711624896, 0.18747520366182122, 0.2545603328026258, 0.027087193806894505, 0.3311691091843666, 0.01172319358596817, 0.10772452889344632, 0.07509344196997773, 0.2979341625689696, 0.11959941154823471, 0.04136323942683446, -0.178683543844053, 0.0716989143536641, -0.05337124175559252] |
1,802.0258 | Interactions resolve state-dependence in a toy-model of AdS black holes | We show that the holographic description of a class of AdS black holes with
scalar hair involves dual field theories with a double well effective
potential. Black hole microstates have significant support around both vacua in
the dual, which correspond to perturbative degrees of freedom on opposite sides
of the horizon. A solvable toy-model version of this dual is given by a quantum
mechanical particle in a double well potential. In this we show explicitly that
the interactions replace the state-dependence that is needed to describe black
hole microstates in a low energy effective model involving the tensor product
of two decoupled harmonic oscillators. A naive number operator signals the
presence of a firewall but a careful construction of perturbative states and
operators extinguishes this.
| hep-th | we show that the holographic description of a class of ads black holes with scalar hair involves dual field theories with a double well effective potential black hole microstates have significant support around both vacua in the dual which correspond to perturbative degrees of freedom on opposite sides of the horizon a solvable toymodel version of this dual is given by a quantum mechanical particle in a double well potential in this we show explicitly that the interactions replace the statedependence that is needed to describe black hole microstates in a low energy effective model involving the tensor product of two decoupled harmonic oscillators a naive number operator signals the presence of a firewall but a careful construction of perturbative states and operators extinguishes this | [['we', 'show', 'that', 'the', 'holographic', 'description', 'of', 'a', 'class', 'of', 'ads', 'black', 'holes', 'with', 'scalar', 'hair', 'involves', 'dual', 'field', 'theories', 'with', 'a', 'double', 'well', 'effective', 'potential', 'black', 'hole', 'microstates', 'have', 'significant', 'support', 'around', 'both', 'vacua', 'in', 'the', 'dual', 'which', 'correspond', 'to', 'perturbative', 'degrees', 'of', 'freedom', 'on', 'opposite', 'sides', 'of', 'the', 'horizon', 'a', 'solvable', 'toymodel', 'version', 'of', 'this', 'dual', 'is', 'given', 'by', 'a', 'quantum', 'mechanical', 'particle', 'in', 'a', 'double', 'well', 'potential', 'in', 'this', 'we', 'show', 'explicitly', 'that', 'the', 'interactions', 'replace', 'the', 'statedependence', 'that', 'is', 'needed', 'to', 'describe', 'black', 'hole', 'microstates', 'in', 'a', 'low', 'energy', 'effective', 'model', 'involving', 'the', 'tensor', 'product', 'of', 'two', 'decoupled', 'harmonic', 'oscillators', 'a', 'naive', 'number', 'operator', 'signals', 'the', 'presence', 'of', 'a', 'firewall', 'but', 'a', 'careful', 'construction', 'of', 'perturbative', 'states', 'and', 'operators', 'extinguishes', 'this']] | [-0.15307189415954053, 0.1492947255373001, -0.08258296275744215, 0.10324996774923056, -0.06316423945315182, -0.16252797427400947, 0.03504221769422293, 0.2729970604777336, -0.16885849105194212, -0.2596450938656926, 0.07032523933984339, -0.3007669097483158, -0.1502201999798417, 0.13229031250160186, -0.0634509172514081, 0.013313699264079333, 0.032604776919353755, 0.09112702608667314, -0.0778535236697644, -0.20101139084994793, 0.3509786022529006, 0.06513916538935155, 0.2613542420119047, 0.048380015321075914, 0.13853644782677293, 0.03780900679435581, 0.05358563909679651, 0.07219948741421103, -0.09246509933000198, 0.10051626682700589, 0.23501345582213254, 0.07868411898240447, 0.23288629591464996, -0.4347590548619628, -0.2193352705517318, 0.10206799115240574, 0.1505378884971142, 0.16297022732254118, -0.08046795832831413, -0.22447775956988333, 0.042985024005174635, -0.24398125268518925, -0.15618505136296154, -0.07807564267143607, 0.0056706508630886675, -0.03750129094719887, -0.2379990896359086, 0.09275298286275938, 0.048286594891920685, -0.03647336203735904, -0.07597343409620226, -0.035987662583589555, -0.030697189833968876, 0.06751208247989417, 0.07963838371168822, 0.028739343617111446, 0.15402225836738945, -0.1504986299816519, -0.16358563312282787, 0.31844667221605777, -0.0534061056189239, -0.23879297902062535, 0.16724683578126132, -0.17539469904080032, -0.10946808250620961, 0.09871843932196497, 0.12307099658250809, 0.19314139907434583, -0.11965254544559867, 0.15611628346308135, -0.018863375289365648, 0.1583824061602354, 0.06749007489345968, 0.07935616767033934, 0.3408827637061477, 0.09384047017712147, 0.03624586925655603, 0.18880381205677987, 0.008933906899765134, -0.15957823866233228, -0.3646669970094226, -0.16294756023050286, -0.16981322622671724, 0.09622077994979918, -0.14637489720608574, -0.21743656205385922, 0.40627370958495884, 0.08910812654253096, 0.204627869552467, 0.02043978109676391, 0.23539047549819225, 0.10583193648606538, 0.08828184221684933, 0.05808486304245889, 0.2873596903756261, 0.1275833499757573, 0.08414916534349322, -0.24676363660860806, -0.1071707276366651, 0.12351146885752678] |
1,802.02581 | Self-consistent redshift estimation using correlation functions without
a spectroscopic reference sample | We present a new method to estimate redshift distributions and galaxy-dark
matter bias parameters using correlation functions in a fully data driven and
self-consistent manner. Unlike other machine learning, template, or correlation
redshift methods, this approach does not require a reference sample with known
redshifts. By measuring the projected cross- and auto- correlations of
different galaxy sub-samples, e.g., as chosen by simple cells in
color-magnitude space, we are able to estimate the galaxy-dark matter bias
model parameters, and the shape of the redshift distributions of each
sub-sample. This method fully marginalises over a flexible parameterisation of
the redshift distribution and galaxy-dark matter bias parameters of sub-samples
of galaxies, and thus provides a general Bayesian framework to incorporate
redshift uncertainty into the cosmological analysis in a data-driven,
consistent, and reproducible manner. This result is improved by an order of
magnitude by including cross-correlations with the CMB and with galaxy-galaxy
lensing.
We showcase how this method could be applied to real galaxies. By using
idealised data vectors, in which all galaxy-dark matter model parameters and
redshift distributions are known, this method is demonstrated to recover
unbiased estimates on important quantities, such as the offset $\Delta_z$
between the mean of the true and estimated redshift distribution and the 68\%
and 95\% and 99.5\% widths of the redshift distribution to an accuracy required
by current and future surveys.
| astro-ph.CO astro-ph.GA | we present a new method to estimate redshift distributions and galaxydark matter bias parameters using correlation functions in a fully data driven and selfconsistent manner unlike other machine learning template or correlation redshift methods this approach does not require a reference sample with known redshifts by measuring the projected cross and auto correlations of different galaxy subsamples eg as chosen by simple cells in colormagnitude space we are able to estimate the galaxydark matter bias model parameters and the shape of the redshift distributions of each subsample this method fully marginalises over a flexible parameterisation of the redshift distribution and galaxydark matter bias parameters of subsamples of galaxies and thus provides a general bayesian framework to incorporate redshift uncertainty into the cosmological analysis in a datadriven consistent and reproducible manner this result is improved by an order of magnitude by including crosscorrelations with the cmb and with galaxygalaxy lensing we showcase how this method could be applied to real galaxies by using idealised data vectors in which all galaxydark matter model parameters and redshift distributions are known this method is demonstrated to recover unbiased estimates on important quantities such as the offset delta_z between the mean of the true and estimated redshift distribution and the 68 and 95 and 995 widths of the redshift distribution to an accuracy required by current and future surveys | [['we', 'present', 'a', 'new', 'method', 'to', 'estimate', 'redshift', 'distributions', 'and', 'galaxydark', 'matter', 'bias', 'parameters', 'using', 'correlation', 'functions', 'in', 'a', 'fully', 'data', 'driven', 'and', 'selfconsistent', 'manner', 'unlike', 'other', 'machine', 'learning', 'template', 'or', 'correlation', 'redshift', 'methods', 'this', 'approach', 'does', 'not', 'require', 'a', 'reference', 'sample', 'with', 'known', 'redshifts', 'by', 'measuring', 'the', 'projected', 'cross', 'and', 'auto', 'correlations', 'of', 'different', 'galaxy', 'subsamples', 'eg', 'as', 'chosen', 'by', 'simple', 'cells', 'in', 'colormagnitude', 'space', 'we', 'are', 'able', 'to', 'estimate', 'the', 'galaxydark', 'matter', 'bias', 'model', 'parameters', 'and', 'the', 'shape', 'of', 'the', 'redshift', 'distributions', 'of', 'each', 'subsample', 'this', 'method', 'fully', 'marginalises', 'over', 'a', 'flexible', 'parameterisation', 'of', 'the', 'redshift', 'distribution', 'and', 'galaxydark', 'matter', 'bias', 'parameters', 'of', 'subsamples', 'of', 'galaxies', 'and', 'thus', 'provides', 'a', 'general', 'bayesian', 'framework', 'to', 'incorporate', 'redshift', 'uncertainty', 'into', 'the', 'cosmological', 'analysis', 'in', 'a', 'datadriven', 'consistent', 'and', 'reproducible', 'manner', 'this', 'result', 'is', 'improved', 'by', 'an', 'order', 'of', 'magnitude', 'by', 'including', 'crosscorrelations', 'with', 'the', 'cmb', 'and', 'with', 'galaxygalaxy', 'lensing', 'we', 'showcase', 'how', 'this', 'method', 'could', 'be', 'applied', 'to', 'real', 'galaxies', 'by', 'using', 'idealised', 'data', 'vectors', 'in', 'which', 'all', 'galaxydark', 'matter', 'model', 'parameters', 'and', 'redshift', 'distributions', 'are', 'known', 'this', 'method', 'is', 'demonstrated', 'to', 'recover', 'unbiased', 'estimates', 'on', 'important', 'quantities', 'such', 'as', 'the', 'offset', 'delta_z', 'between', 'the', 'mean', 'of', 'the', 'true', 'and', 'estimated', 'redshift', 'distribution', 'and', 'the', '68', 'and', '95', 'and', '995', 'widths', 'of', 'the', 'redshift', 'distribution', 'to', 'an', 'accuracy', 'required', 'by', 'current', 'and', 'future', 'surveys']] | [-0.025954245648920602, 0.05899419721507521, -0.11673974703548343, 0.11388143424067364, -0.1005624727508153, -0.08479341722834631, 0.04451801976704571, 0.44676986426877974, -0.19096303125843406, -0.3715490915700294, 0.01886328480811374, -0.2647110777740766, -0.06005966975239322, 0.2013715000263931, -0.010158962297802126, 0.07641060391116687, 0.03334079323914401, -0.07764547684096865, -0.07534902188542349, -0.2817562471593971, 0.31237518177658785, 0.08800808039917943, 0.27278641116156777, -0.047061446857177155, 0.1399273300079845, -0.006083437978564429, -0.1231209158382366, 0.037927308305760174, -0.17623447474073015, 0.06790213301220709, 0.2528468342248483, 0.1576902218948817, 0.24578332316637638, -0.2989109583721269, -0.21664597197585472, 0.12265771767644244, 0.1794599173977076, 0.11431888580877317, -0.05824170031337417, -0.3081943642573606, 0.040121302618510005, -0.19746382670148574, -0.0928212157575347, -0.0722579820170982, -0.026776847419179312, 0.054711425107338334, -0.28243313537885634, 0.1970972241189364, 0.006626166700568449, 0.035635293781524524, -0.06123514416581851, -0.11533580260947929, -0.032876793018658645, 0.10082420245765077, 0.015886825730766368, 0.0673358010951363, 0.1489331463173065, -0.13316865309752757, -0.05381509271527258, 0.38096708185288924, -0.08091993720829903, -0.16286413477168285, 0.14405981702397444, -0.15223155397948826, -0.13004082480568155, 0.042409184177813586, 0.20904756998269086, 0.07776464395595083, -0.1976215828243377, 0.02901136162992251, 0.042073762302087356, 0.22151511946244032, -0.023477590796184295, -0.0007777795021866041, 0.2660556531669239, 0.1087131718335773, 0.06138726804887743, 0.06209821796047826, -0.16780433359443642, -0.009961838857894431, -0.284912476723548, -0.07733513061131296, -0.16610365550202136, 0.017186087863917367, -0.1585348083183687, -0.15292837653292476, 0.4017796177213313, 0.19255788307782495, 0.2572205211638772, 0.1286991909837525, 0.34709553046767333, 0.08363287366747889, 0.08990406048334469, 0.0477186892260631, 0.25449311445533696, 0.1408968176588782, 0.019559793222080252, -0.15672537973815842, 0.09185651733215698, -0.011055889202647709] |
1,802.02582 | OGLE-2017-BLG-1434Lb: Eighth q < 1 * 10^-4 Mass-Ratio Microlens Planet
Confirms Turnover in Planet Mass-Ratio Function | We report the discovery of a cold Super-Earth planet (m_p=4.4 +/- 0.5
M_Earth) orbiting a low-mass (M=0.23 +/- 0.03 M_Sun) M dwarf at projected
separation a_perp = 1.18 +/- 0.10 AU, i.e., about 1.9 times the snow line. The
system is quite nearby for a microlensing planet, D_Lens = 0.86 +/- 0.09 kpc.
Indeed, it was the large lens-source relative parallax pi_rel=1.0 mas (combined
with the low mass M) that gave rise to the large, and thus well-measured,
"microlens parallax" that enabled these precise measurements.
OGLE-2017-BLG-1434Lb is the eighth microlensing planet with planet-host mass
ratio q < 1 * 10^-4.
We apply a new planet-detection sensitivity method, which is a variant of
"V/V_max", to seven of these eight planets to derive the mass-ratio function in
this regime. We find dN/d(ln q) ~ q^p, with p = 1.05 (+0.78,-0.68), which
confirms the "turnover" in the mass function found by Suzuki et al. relative to
the power law of opposite sign n = -0.93 +/- 0.13 at higher mass ratios q >~ 2
* 10^-4. We combine our result with that of Suzuki et al. to obtain p = 0.73
(+0.42,-0.34).
| astro-ph.EP | we report the discovery of a cold superearth planet m_p44 05 m_earth orbiting a lowmass m023 003 m_sun m dwarf at projected separation a_perp 118 010 au ie about 19 times the snow line the system is quite nearby for a microlensing planet d_lens 086 009 kpc indeed it was the large lenssource relative parallax pi_rel10 mas combined with the low mass m that gave rise to the large and thus wellmeasured microlens parallax that enabled these precise measurements ogle2017blg1434lb is the eighth microlensing planet with planethost mass ratio q 1 104 we apply a new planetdetection sensitivity method which is a variant of vv_max to seven of these eight planets to derive the massratio function in this regime we find dndln q qp with p 105 078068 which confirms the turnover in the mass function found by suzuki et al relative to the power law of opposite sign n 093 013 at higher mass ratios q 2 104 we combine our result with that of suzuki et al to obtain p 073 042034 | [['we', 'report', 'the', 'discovery', 'of', 'a', 'cold', 'superearth', 'planet', 'm_p44', '05', 'm_earth', 'orbiting', 'a', 'lowmass', 'm023', '003', 'm_sun', 'm', 'dwarf', 'at', 'projected', 'separation', 'a_perp', '118', '010', 'au', 'ie', 'about', '19', 'times', 'the', 'snow', 'line', 'the', 'system', 'is', 'quite', 'nearby', 'for', 'a', 'microlensing', 'planet', 'd_lens', '086', '009', 'kpc', 'indeed', 'it', 'was', 'the', 'large', 'lenssource', 'relative', 'parallax', 'pi_rel10', 'mas', 'combined', 'with', 'the', 'low', 'mass', 'm', 'that', 'gave', 'rise', 'to', 'the', 'large', 'and', 'thus', 'wellmeasured', 'microlens', 'parallax', 'that', 'enabled', 'these', 'precise', 'measurements', 'ogle2017blg1434lb', 'is', 'the', 'eighth', 'microlensing', 'planet', 'with', 'planethost', 'mass', 'ratio', 'q', '1', '104', 'we', 'apply', 'a', 'new', 'planetdetection', 'sensitivity', 'method', 'which', 'is', 'a', 'variant', 'of', 'vv_max', 'to', 'seven', 'of', 'these', 'eight', 'planets', 'to', 'derive', 'the', 'massratio', 'function', 'in', 'this', 'regime', 'we', 'find', 'dndln', 'q', 'qp', 'with', 'p', '105', '078068', 'which', 'confirms', 'the', 'turnover', 'in', 'the', 'mass', 'function', 'found', 'by', 'suzuki', 'et', 'al', 'relative', 'to', 'the', 'power', 'law', 'of', 'opposite', 'sign', 'n', '093', '013', 'at', 'higher', 'mass', 'ratios', 'q', '2', '104', 'we', 'combine', 'our', 'result', 'with', 'that', 'of', 'suzuki', 'et', 'al', 'to', 'obtain', 'p', '073', '042034']] | [-0.13648153304876315, 0.11521972213882864, -0.06221035322163343, 0.013768692180747166, -0.07590784961246841, -0.10756308425057103, 0.1068260479701816, 0.29959213642758276, -0.12663329228165648, -0.4428090811845669, 0.010406934449704187, -0.3126109983450511, -0.020157078017724588, 0.18529834022739947, -0.10114029714826583, 0.028156507160886014, 0.08113119572269734, -0.06315722028791372, -0.08347146451844656, -0.2711778079891311, 0.20869785313178518, 0.03963061271878403, 0.10875626793824181, 0.002571444379143594, 0.07155293664046829, -0.049887435792091615, -0.025516809654488628, -0.07249503312881903, -0.24501533929318006, 0.012696370263473086, 0.20696770439566795, 0.07620630899743576, 0.19248147182987027, -0.22211866375125414, -0.10374019873710322, 0.06625678837770552, 0.13884770296607757, -0.003352937373122023, -0.020340070957207076, -0.2616404911442216, 0.14710621283544847, -0.22849526773955273, -0.18619312192147067, 0.058817162325361834, 0.16564325437814528, -0.02981718299200847, -0.3023098228080753, 0.17301497309346728, 0.03682959061214725, 0.10142090061795205, -0.08103322013769121, -0.2029369695720518, -0.03012771634287977, 0.004242468887241557, -0.005608975331554012, 0.14288949890206346, 0.1545812417870842, 0.010203982033999637, -0.015865819552259165, 0.398207968682982, -0.11608546634808936, -0.04038221265641152, 0.19708899464846277, -0.25109284735004794, -0.14446992052364208, 0.17042076661406705, 0.1600571120969627, 0.1514373626818529, -0.12859459536515974, 0.006451621856588948, -0.03129991794932201, 0.2622989815149811, 0.11031965522505786, 0.00036407847944376826, 0.32542052140204414, 0.11692832091302123, 0.06187834942136847, -0.002030016743706905, -0.25270384952559005, 0.004879900243914952, -0.17800628421606407, -0.11503857188065358, -0.13768472290220893, 0.1194962725484012, -0.1724843351298443, -0.06425624656202715, 0.2842191750463653, 0.13332151270480522, 0.2750890771470343, 0.09024984629165071, 0.2433890717026467, 0.09364052705045435, 0.07453408543369733, 0.08417029791772143, 0.3353026630246036, 0.17834966291307605, 0.08278053049815796, -0.23755479338745186, 0.02023932131885972, 0.015839555635985953] |
1,802.02583 | The dragonfly nearby galaxies survey. Iv. A giant stellar disk in ngc
2841 | Neutral gas is commonly believed to dominate over stars in the outskirts of
galaxies, and investigations of the disk-halo interface are generally
considered to be in the domain of radio astronomy. This may simply be a
consequence of the fact that deep HI observations typically probe to a lower
mass surface density than visible wavelength data. This paper presents low
surface brightness optimized visible wavelength observations of the extreme
outskirts of the nearby spiral galaxy NGC 2841. We report the discovery of an
enormous low-surface brightness stellar disk in this object. When azimuthally
averaged, the stellar disk can be traced out to a radius of $\sim$70 kpc (5
$R_{25}$ or 23 inner disk scale lengths). The structure in the stellar disk
traces the morphology of HI emission and extended UV emission. Contrary to
expectations, the stellar mass surface density does not fall below that of the
gas mass surface density at any radius. In fact, at all radii greater than
$\sim$20 kpc, the ratio of the stellar to gas mass surface density is a
constant 3:1. Beyond $\sim$30 kpc, the low surface brightness stellar disk
begins to warp, which may be an indication of a physical connection between the
outskirts of the galaxy and infall from the circumgalactic medium. A
combination of stellar migration, accretion and in-situ star formation might be
responsible for building up the outer stellar disk, but whatever mechanisms
formed the outer disk must also explain the constant ratio between stellar and
gas mass in the outskirts of this galaxy.
| astro-ph.GA | neutral gas is commonly believed to dominate over stars in the outskirts of galaxies and investigations of the diskhalo interface are generally considered to be in the domain of radio astronomy this may simply be a consequence of the fact that deep hi observations typically probe to a lower mass surface density than visible wavelength data this paper presents low surface brightness optimized visible wavelength observations of the extreme outskirts of the nearby spiral galaxy ngc 2841 we report the discovery of an enormous lowsurface brightness stellar disk in this object when azimuthally averaged the stellar disk can be traced out to a radius of sim70 kpc 5 r_25 or 23 inner disk scale lengths the structure in the stellar disk traces the morphology of hi emission and extended uv emission contrary to expectations the stellar mass surface density does not fall below that of the gas mass surface density at any radius in fact at all radii greater than sim20 kpc the ratio of the stellar to gas mass surface density is a constant 31 beyond sim30 kpc the low surface brightness stellar disk begins to warp which may be an indication of a physical connection between the outskirts of the galaxy and infall from the circumgalactic medium a combination of stellar migration accretion and insitu star formation might be responsible for building up the outer stellar disk but whatever mechanisms formed the outer disk must also explain the constant ratio between stellar and gas mass in the outskirts of this galaxy | [['neutral', 'gas', 'is', 'commonly', 'believed', 'to', 'dominate', 'over', 'stars', 'in', 'the', 'outskirts', 'of', 'galaxies', 'and', 'investigations', 'of', 'the', 'diskhalo', 'interface', 'are', 'generally', 'considered', 'to', 'be', 'in', 'the', 'domain', 'of', 'radio', 'astronomy', 'this', 'may', 'simply', 'be', 'a', 'consequence', 'of', 'the', 'fact', 'that', 'deep', 'hi', 'observations', 'typically', 'probe', 'to', 'a', 'lower', 'mass', 'surface', 'density', 'than', 'visible', 'wavelength', 'data', 'this', 'paper', 'presents', 'low', 'surface', 'brightness', 'optimized', 'visible', 'wavelength', 'observations', 'of', 'the', 'extreme', 'outskirts', 'of', 'the', 'nearby', 'spiral', 'galaxy', 'ngc', '2841', 'we', 'report', 'the', 'discovery', 'of', 'an', 'enormous', 'lowsurface', 'brightness', 'stellar', 'disk', 'in', 'this', 'object', 'when', 'azimuthally', 'averaged', 'the', 'stellar', 'disk', 'can', 'be', 'traced', 'out', 'to', 'a', 'radius', 'of', 'sim70', 'kpc', '5', 'r_25', 'or', '23', 'inner', 'disk', 'scale', 'lengths', 'the', 'structure', 'in', 'the', 'stellar', 'disk', 'traces', 'the', 'morphology', 'of', 'hi', 'emission', 'and', 'extended', 'uv', 'emission', 'contrary', 'to', 'expectations', 'the', 'stellar', 'mass', 'surface', 'density', 'does', 'not', 'fall', 'below', 'that', 'of', 'the', 'gas', 'mass', 'surface', 'density', 'at', 'any', 'radius', 'in', 'fact', 'at', 'all', 'radii', 'greater', 'than', 'sim20', 'kpc', 'the', 'ratio', 'of', 'the', 'stellar', 'to', 'gas', 'mass', 'surface', 'density', 'is', 'a', 'constant', '31', 'beyond', 'sim30', 'kpc', 'the', 'low', 'surface', 'brightness', 'stellar', 'disk', 'begins', 'to', 'warp', 'which', 'may', 'be', 'an', 'indication', 'of', 'a', 'physical', 'connection', 'between', 'the', 'outskirts', 'of', 'the', 'galaxy', 'and', 'infall', 'from', 'the', 'circumgalactic', 'medium', 'a', 'combination', 'of', 'stellar', 'migration', 'accretion', 'and', 'insitu', 'star', 'formation', 'might', 'be', 'responsible', 'for', 'building', 'up', 'the', 'outer', 'stellar', 'disk', 'but', 'whatever', 'mechanisms', 'formed', 'the', 'outer', 'disk', 'must', 'also', 'explain', 'the', 'constant', 'ratio', 'between', 'stellar', 'and', 'gas', 'mass', 'in', 'the', 'outskirts', 'of', 'this', 'galaxy']] | [-0.0709513955689293, 0.11998702296741001, -0.08290030182018994, 0.0970184720473791, -0.09966220044468349, -0.020703352926107556, 0.00449597670120581, 0.4237240554890025, -0.1779257542646505, -0.3582435217851648, 0.05847871997540913, -0.23107133003360344, -0.009039567189894822, 0.18242872438555502, -0.039898805454623675, -0.04744178759074023, 0.010548627680892736, -0.10479412612821833, -0.090721204188991, -0.2528235446882578, 0.29864018117059243, 0.09876273195981693, 0.1171562861864687, 0.038244512423563734, 0.015415932560291716, -0.13752042951169074, -0.058980840942873015, -0.044753829771910496, -0.17472864976945368, 0.0397569035648709, 0.24197822915235526, 0.09830010980975044, 0.21830810705593717, -0.39558060509207926, -0.2272311055245018, 0.047731545017553646, 0.23914605569418357, 0.02544683163843887, -0.05504923758397004, -0.23132312611820316, 0.05842443126375261, -0.19743817469994115, -0.22902286840692943, 0.1573974867259325, 0.045694909599635444, -0.030561157027369903, -0.19105354578463404, 0.17664071337332335, 0.048877765776096246, 0.09885465496968802, -0.11427405497644523, -0.06619767214101648, -0.11087621012776207, 0.05627454221747878, 0.033143347811612774, 0.1098182923399766, 0.3023508161843824, -0.13975544294559586, 0.06170779684183037, 0.40083137433975935, -0.09394989530760665, -0.0002292971832589375, 0.2592872571680518, -0.2672337079604742, -0.11429566264947648, 0.16608032940522485, 0.18370389760648573, 0.0725470884618434, -0.14209501187845314, 0.02296192460305061, -0.060593792179363816, 0.24269814015892538, 0.09980944596716891, 0.058532445255946274, 0.4007871423593976, 0.07617348513065325, 0.09312342528047651, 0.0540746480448304, -0.24137939579910028, -0.03580527093533883, -0.22075625430799933, -0.10903553229530265, -0.13733689082379677, 0.08350543613485088, -0.16078639999113695, -0.12960266001640336, 0.3066938560908815, 0.07389234904206281, 0.26179863909708534, 0.037706379942953026, 0.33072036688433215, 0.07749014211038179, 0.1664278611150596, 0.1735311195644524, 0.3044998271780994, 0.20116587109466197, 0.04478282554088006, -0.25938769378179405, 0.07614122016222875, -0.025637281854294623] |
1,802.02584 | Energy is Entanglement | We compute the local second variation of the von Neumann entropy of a region
in theories with a gravity dual. For null variations our formula says that the
diagonal part of the Quantum Null Energy Condition is saturated in every state,
thus providing an equivalence between energy and entropy. We prove that the
formula holds at leading order in 1/N, and further argue that it will not be
affected at higher orders. We conjecture that the QNEC is saturated in all
interacting theories. We also discuss the special case of free theories, and
the implications of our formula for the Averaged Null Energy Condition, Quantum
Focusing Conjecture, and gravitational equations of motion. We show that the
leading-order gravitational equations of motion, Einstein's equations, are
equivalent to leading-order saturation of the QFC for Planck-width
deformations.
| hep-th | we compute the local second variation of the von neumann entropy of a region in theories with a gravity dual for null variations our formula says that the diagonal part of the quantum null energy condition is saturated in every state thus providing an equivalence between energy and entropy we prove that the formula holds at leading order in 1n and further argue that it will not be affected at higher orders we conjecture that the qnec is saturated in all interacting theories we also discuss the special case of free theories and the implications of our formula for the averaged null energy condition quantum focusing conjecture and gravitational equations of motion we show that the leadingorder gravitational equations of motion einsteins equations are equivalent to leadingorder saturation of the qfc for planckwidth deformations | [['we', 'compute', 'the', 'local', 'second', 'variation', 'of', 'the', 'von', 'neumann', 'entropy', 'of', 'a', 'region', 'in', 'theories', 'with', 'a', 'gravity', 'dual', 'for', 'null', 'variations', 'our', 'formula', 'says', 'that', 'the', 'diagonal', 'part', 'of', 'the', 'quantum', 'null', 'energy', 'condition', 'is', 'saturated', 'in', 'every', 'state', 'thus', 'providing', 'an', 'equivalence', 'between', 'energy', 'and', 'entropy', 'we', 'prove', 'that', 'the', 'formula', 'holds', 'at', 'leading', 'order', 'in', '1n', 'and', 'further', 'argue', 'that', 'it', 'will', 'not', 'be', 'affected', 'at', 'higher', 'orders', 'we', 'conjecture', 'that', 'the', 'qnec', 'is', 'saturated', 'in', 'all', 'interacting', 'theories', 'we', 'also', 'discuss', 'the', 'special', 'case', 'of', 'free', 'theories', 'and', 'the', 'implications', 'of', 'our', 'formula', 'for', 'the', 'averaged', 'null', 'energy', 'condition', 'quantum', 'focusing', 'conjecture', 'and', 'gravitational', 'equations', 'of', 'motion', 'we', 'show', 'that', 'the', 'leadingorder', 'gravitational', 'equations', 'of', 'motion', 'einsteins', 'equations', 'are', 'equivalent', 'to', 'leadingorder', 'saturation', 'of', 'the', 'qfc', 'for', 'planckwidth', 'deformations']] | [-0.16419270991074636, 0.1462761683616467, -0.10054115769698431, 0.09310433804757781, -0.03196843719123898, -0.11869477579384145, -0.0331618900312797, 0.2667951746231043, -0.22647075207301773, -0.23223909178636687, 0.06189541510985534, -0.28213385736772834, -0.12738275138269128, 0.1878978934224793, -0.045786480578861755, 0.026197455326249276, 0.044986450353189184, 0.09127540896205526, -0.10802847738080147, -0.2623177009417598, 0.34432535331794306, 0.03367686404188381, 0.27248788991578876, 0.12092889818411909, 0.12573310484955633, 0.009012255099903149, 0.024832977955334616, 0.0685668375371094, -0.15914376011199038, 0.10102871861667688, 0.20652416852982083, 0.10824980803317201, 0.22418900548753545, -0.42452300546049226, -0.19228824313828036, 0.11692015809896297, 0.09194898302491783, 0.14201758913100607, 0.013898766491057953, -0.2507108110090704, 0.10376615023863663, -0.1886561807521612, -0.20293081650524436, -0.05736286580366524, 0.043112830265908314, -0.022085284338046268, -0.26299675153848484, 0.13904466183879763, 0.11034767614866614, 0.011934061933841025, -0.12493220898077677, -0.03206210934970164, -0.04545086235354157, 0.07929232918580335, 0.06876469767281324, -0.005837233481522566, 0.08482434021447316, -0.15384512894639843, -0.10161072901569139, 0.3693077342542715, -0.0942509809440646, -0.21673764097084172, 0.11483859651743021, -0.2042608651213516, -0.1617930184076435, 0.09445344825901959, 0.07467074964643645, 0.16092177493019813, -0.09844369090449318, 0.13926206383665085, -0.029012775230676607, 0.11647901386442713, 0.10272436308555473, 0.043691091179931744, 0.20102572315057418, 0.04998090046044803, 0.08723612828880437, 0.1591740542492318, -0.03576659287599133, -0.11100828024922849, -0.42914130087745816, -0.20393413376007088, -0.14643881957771437, 0.08384330316520684, -0.11609532876260564, -0.15395236756176428, 0.31538165458022877, 0.1656501290832184, 0.12011986794790491, 0.10968596904181448, 0.23478543095962895, 0.18338954771686822, 0.038452571828646545, 0.09661844505795411, 0.27428868333143847, 0.1720987677511136, 0.06465515076827005, -0.23804511548447968, 0.0024732854252303006, 0.14365377402479262] |
1,802.02585 | Higher-Order Topology in Bismuth | The mathematical field of topology has become a framework to describe the
low-energy electronic structure of crystalline solids. A typical feature of a
bulk insulating three-dimensional topological crystal are conducting
two-dimensional surface states. This constitutes the topological bulk-boundary
correspondence. Here, we establish that the electronic structure of bismuth, an
element consistently described as bulk topologically trivial, is in fact
topological and follows a generalized bulk-boundary correspondence of
higher-order: not the surfaces of the crystal, but its hinges host
topologically protected conducting modes. These hinge modes are protected
against localization by time-reversal symmetry locally, and globally by the
three-fold rotational symmetry and inversion symmetry of the bismuth crystal.
We support our claim theoretically and experimentally. Our theoretical analysis
is based on symmetry arguments, topological indices, first-principle
calculations, and the recently introduced framework of topological quantum
chemistry. We provide supporting evidence from two complementary experimental
techniques. With scanning-tunneling spectroscopy, we probe the unique
signatures of the rotational symmetry of the one-dimensional states located at
step edges of the crystal surface. With Josephson interferometry, we
demonstrate their universal topological contribution to the electronic
transport. Our work establishes bismuth as a higher-order topological
insulator.
| cond-mat.mtrl-sci cond-mat.mes-hall | the mathematical field of topology has become a framework to describe the lowenergy electronic structure of crystalline solids a typical feature of a bulk insulating threedimensional topological crystal are conducting twodimensional surface states this constitutes the topological bulkboundary correspondence here we establish that the electronic structure of bismuth an element consistently described as bulk topologically trivial is in fact topological and follows a generalized bulkboundary correspondence of higherorder not the surfaces of the crystal but its hinges host topologically protected conducting modes these hinge modes are protected against localization by timereversal symmetry locally and globally by the threefold rotational symmetry and inversion symmetry of the bismuth crystal we support our claim theoretically and experimentally our theoretical analysis is based on symmetry arguments topological indices firstprinciple calculations and the recently introduced framework of topological quantum chemistry we provide supporting evidence from two complementary experimental techniques with scanningtunneling spectroscopy we probe the unique signatures of the rotational symmetry of the onedimensional states located at step edges of the crystal surface with josephson interferometry we demonstrate their universal topological contribution to the electronic transport our work establishes bismuth as a higherorder topological insulator | [['the', 'mathematical', 'field', 'of', 'topology', 'has', 'become', 'a', 'framework', 'to', 'describe', 'the', 'lowenergy', 'electronic', 'structure', 'of', 'crystalline', 'solids', 'a', 'typical', 'feature', 'of', 'a', 'bulk', 'insulating', 'threedimensional', 'topological', 'crystal', 'are', 'conducting', 'twodimensional', 'surface', 'states', 'this', 'constitutes', 'the', 'topological', 'bulkboundary', 'correspondence', 'here', 'we', 'establish', 'that', 'the', 'electronic', 'structure', 'of', 'bismuth', 'an', 'element', 'consistently', 'described', 'as', 'bulk', 'topologically', 'trivial', 'is', 'in', 'fact', 'topological', 'and', 'follows', 'a', 'generalized', 'bulkboundary', 'correspondence', 'of', 'higherorder', 'not', 'the', 'surfaces', 'of', 'the', 'crystal', 'but', 'its', 'hinges', 'host', 'topologically', 'protected', 'conducting', 'modes', 'these', 'hinge', 'modes', 'are', 'protected', 'against', 'localization', 'by', 'timereversal', 'symmetry', 'locally', 'and', 'globally', 'by', 'the', 'threefold', 'rotational', 'symmetry', 'and', 'inversion', 'symmetry', 'of', 'the', 'bismuth', 'crystal', 'we', 'support', 'our', 'claim', 'theoretically', 'and', 'experimentally', 'our', 'theoretical', 'analysis', 'is', 'based', 'on', 'symmetry', 'arguments', 'topological', 'indices', 'firstprinciple', 'calculations', 'and', 'the', 'recently', 'introduced', 'framework', 'of', 'topological', 'quantum', 'chemistry', 'we', 'provide', 'supporting', 'evidence', 'from', 'two', 'complementary', 'experimental', 'techniques', 'with', 'scanningtunneling', 'spectroscopy', 'we', 'probe', 'the', 'unique', 'signatures', 'of', 'the', 'rotational', 'symmetry', 'of', 'the', 'onedimensional', 'states', 'located', 'at', 'step', 'edges', 'of', 'the', 'crystal', 'surface', 'with', 'josephson', 'interferometry', 'we', 'demonstrate', 'their', 'universal', 'topological', 'contribution', 'to', 'the', 'electronic', 'transport', 'our', 'work', 'establishes', 'bismuth', 'as', 'a', 'higherorder', 'topological', 'insulator']] | [-0.18494754002895206, 0.17774413285453766, -0.12074349971831237, 0.016904493644343394, -0.0878119171719606, -0.14876480446638246, 0.0808020485797897, 0.37840566427790023, -0.2616797293536365, -0.26591455021775084, 0.02393910742125866, -0.2948659247694243, -0.1973119600614729, 0.14347053673945515, 0.005800913922537706, 0.09071826860155469, -0.044157830875452705, -0.07640665746646272, -0.11674236950194954, -0.17036380822476196, 0.31070923707325404, -0.021441790818138733, 0.37539825626085266, 0.09393580663017928, 0.012380645194973209, -0.030715511746606545, 0.04432408876815125, 0.014992692693455243, -0.16680065223500654, 0.12945716205040778, 0.26939122143912275, -0.055980782257393, 0.13943162039167395, -0.49119556568759054, -0.23051584495574629, -0.01991370922371157, 0.08930257271583143, 0.17756815730398032, -0.11735764823327037, -0.3322504631586765, 0.08982684282267368, -0.14842700241011028, -0.15990003017267507, -0.1456546550126452, -0.04491914192637379, -0.09258260409788865, -0.14359301684583586, 0.06504624030754999, 0.07570365244326623, 0.12927196037700542, -0.08181413377690325, -0.04004651479619114, -0.15707500330049937, 0.06827002880776203, 0.037111105620370885, 0.0120218689823033, 0.10750661960521125, -0.10082776330926112, -0.16866167781776503, 0.39598736842898163, -0.010492836407042648, -0.14237723870595034, 0.21457318836994665, -0.12138262924272566, -0.13504902492767493, 0.11925834404905082, 0.07425257867343087, 0.11596829041005358, -0.06746885638475712, 0.1062446163302842, -0.07145349215225953, 0.1595451350567409, -0.005469354179589764, 0.12667265586358936, 0.27077611372561045, 0.17363380589277336, 0.051763407441582164, 0.148512333736902, -0.09922962323885019, -0.0478259061953347, -0.30324892120950514, -0.23070096621829037, -0.27099629053110746, 0.055552030224307124, -0.02771245764903908, -0.22352517114854173, 0.4522134076761033, 0.07257100596631828, 0.14786213047336788, -0.03027523425162623, 0.2348025743420677, 0.08092625402434925, 0.049104452834121494, 0.027199599420112606, 0.26718359482535897, 0.18240435378331887, 0.01872131898141417, -0.26955285825166164, 0.022250622729035583, 0.08644253538651882] |
1,802.02586 | Detecting Stellar Lensing of Gravitational Waves with Ground-Based
Observatories | We investigate the ability of ground based gravitational wave observatories
to detect gravitational wave lensing events caused by stellar mass lenses. We
show that LIGO and Virgo possess the sensitivities required to detect lenses
with masses as small as $\sim 30 M_\odot$ provided that the gravitational wave
is observed with a signal-to-noise ratio of $\sim30$. Third generation
observatories will allow detection of gravitational wave lenses with masses of
$\sim 1 M_\odot$. Finally, we discuss the possibility of lensing by multiple
stars, as is the case if the gravitational radiation is passing through
galactic nucleus or a dense star cluster.
| astro-ph.HE gr-qc | we investigate the ability of ground based gravitational wave observatories to detect gravitational wave lensing events caused by stellar mass lenses we show that ligo and virgo possess the sensitivities required to detect lenses with masses as small as sim 30 m_odot provided that the gravitational wave is observed with a signaltonoise ratio of sim30 third generation observatories will allow detection of gravitational wave lenses with masses of sim 1 m_odot finally we discuss the possibility of lensing by multiple stars as is the case if the gravitational radiation is passing through galactic nucleus or a dense star cluster | [['we', 'investigate', 'the', 'ability', 'of', 'ground', 'based', 'gravitational', 'wave', 'observatories', 'to', 'detect', 'gravitational', 'wave', 'lensing', 'events', 'caused', 'by', 'stellar', 'mass', 'lenses', 'we', 'show', 'that', 'ligo', 'and', 'virgo', 'possess', 'the', 'sensitivities', 'required', 'to', 'detect', 'lenses', 'with', 'masses', 'as', 'small', 'as', 'sim', '30', 'm_odot', 'provided', 'that', 'the', 'gravitational', 'wave', 'is', 'observed', 'with', 'a', 'signaltonoise', 'ratio', 'of', 'sim30', 'third', 'generation', 'observatories', 'will', 'allow', 'detection', 'of', 'gravitational', 'wave', 'lenses', 'with', 'masses', 'of', 'sim', '1', 'm_odot', 'finally', 'we', 'discuss', 'the', 'possibility', 'of', 'lensing', 'by', 'multiple', 'stars', 'as', 'is', 'the', 'case', 'if', 'the', 'gravitational', 'radiation', 'is', 'passing', 'through', 'galactic', 'nucleus', 'or', 'a', 'dense', 'star', 'cluster']] | [-0.15623908807968043, 0.1575234452017931, 0.005176032300699841, 0.1201108122665454, -0.1269691480074379, 0.0036960865624926305, -0.021928004417192153, 0.36327925384646714, -0.12959684890158701, -0.3641452319506142, 0.05452076251491566, -0.3392724955567356, -0.09927997342310846, 0.21465557593513618, 0.07133545428561518, 0.0212095022269741, 0.0814942242389526, -0.023295063189127378, -0.08378414729506606, -0.23859072550943103, 0.34531091864813457, 0.10159189143980091, 0.11311860560354861, -0.005313658027252949, 0.10961321467590152, -0.04418549455956302, -0.03686938786672221, -0.02731064021719074, -0.11395487119517209, -0.029742380246670558, 0.2192554787892585, 0.23279697791381618, 0.22888794408716034, -0.37353073194096187, -0.19690763606981496, 0.10394410122035429, 0.16044539374280534, 0.08209338374059609, -0.0975760703370201, -0.3890970045667744, 0.1007857679323566, -0.24766291668544513, -0.2206405672536354, 0.0387379058890722, 0.021646235486247924, 0.11160932508570076, -0.23152585242018855, 0.12145497890852505, -0.03894591690840745, -0.05827579546644531, -0.08004665308434403, -0.038950856612769494, -0.03819676860226224, 0.012724133544704981, 0.07394421927753196, 0.10499962318613372, 0.1867642497327508, -0.13512786163130042, -0.05496757438011242, 0.4533071233467622, -0.11546804232468753, -0.05590715077752718, 0.187370926381625, -0.22621927435763858, -0.1304291378932469, 0.14564678424762356, 0.20222036453961123, 0.0928613383068957, -0.1324895637561426, -0.035017222491201164, 0.07289234821677604, 0.2561690886011065, 0.1575586533437323, 0.07744161362261182, 0.40333070447950653, 0.13598175979021823, 0.0908464458959196, 0.07704963467337868, -0.3112271023876589, 0.07368654863099859, -0.2401008879256698, -0.06768536961853805, -0.15634245305872438, 0.10208123680874423, -0.11233591912487743, -0.10674084961470781, 0.2963928264575173, 0.1621815093952899, 0.1296336827823196, 0.09477060939646278, 0.3301119375785794, 0.0839504914080743, 0.10913324514121721, 0.034950323867366996, 0.43414648140620704, 0.19260340083315217, 0.05044713614724877, -0.1890880738648426, -0.01093659797833875, -0.017013372667604172] |
1,802.02587 | Panchromatic SED modelling of spatially-resolved galaxies | We test the efficacy of the energy-balance spectral energy distribution (SED)
fitting code Magphys for recovering the spatially-resolved properties of a
simulated isolated disc galaxy, for which it was not designed. We perform
226,950 Magphys SED fits to regions between 0.2kpc and 25kpc in size across the
galaxy's disc, viewed from three different sight-lines, to probe how well
Magphys can recover key galaxy properties based on 21 bands of UV--far-infrared
model photometry. Magphys yields statistically acceptable fits to $> 99$ per
cent of the pixels within the $r$-band effective radius and between 59 and 77
per cent of pixels within 20kpc of the nucleus. Magphys is able to recover the
distribution of stellar mass, star formation rate (SFR), specific SFR, dust
luminosity, dust mass, and $V$-band attenuation reasonably well, especially
when the pixel size is $> \sim1$ kpc, whereas non-standard outputs (stellar
metallicity and mass-weighted age) are recovered less well. Accurate recovery
is more challenging in the smallest sub-regions of the disc (pixel scale $<
\sim 1$ kpc), where the energy balance criterion becomes increasingly
incorrect. Estimating integrated galaxy properties by summing the recovered
pixel values, the true integrated values of all parameters considered except
metallicity and age are well recovered at all spatial resolutions, ranging from
0.2kpc to integrating across the disc, albeit with some evidence for
resolution-dependent biases. These results must be considered when attempting
to analyse the structure of real galaxies with actual observational data, for
which the `ground truth' is unknown.
| astro-ph.GA | we test the efficacy of the energybalance spectral energy distribution sed fitting code magphys for recovering the spatiallyresolved properties of a simulated isolated disc galaxy for which it was not designed we perform 226950 magphys sed fits to regions between 02kpc and 25kpc in size across the galaxys disc viewed from three different sightlines to probe how well magphys can recover key galaxy properties based on 21 bands of uvfarinfrared model photometry magphys yields statistically acceptable fits to 99 per cent of the pixels within the rband effective radius and between 59 and 77 per cent of pixels within 20kpc of the nucleus magphys is able to recover the distribution of stellar mass star formation rate sfr specific sfr dust luminosity dust mass and vband attenuation reasonably well especially when the pixel size is sim1 kpc whereas nonstandard outputs stellar metallicity and massweighted age are recovered less well accurate recovery is more challenging in the smallest subregions of the disc pixel scale sim 1 kpc where the energy balance criterion becomes increasingly incorrect estimating integrated galaxy properties by summing the recovered pixel values the true integrated values of all parameters considered except metallicity and age are well recovered at all spatial resolutions ranging from 02kpc to integrating across the disc albeit with some evidence for resolutiondependent biases these results must be considered when attempting to analyse the structure of real galaxies with actual observational data for which the ground truth is unknown | [['we', 'test', 'the', 'efficacy', 'of', 'the', 'energybalance', 'spectral', 'energy', 'distribution', 'sed', 'fitting', 'code', 'magphys', 'for', 'recovering', 'the', 'spatiallyresolved', 'properties', 'of', 'a', 'simulated', 'isolated', 'disc', 'galaxy', 'for', 'which', 'it', 'was', 'not', 'designed', 'we', 'perform', '226950', 'magphys', 'sed', 'fits', 'to', 'regions', 'between', '02kpc', 'and', '25kpc', 'in', 'size', 'across', 'the', 'galaxys', 'disc', 'viewed', 'from', 'three', 'different', 'sightlines', 'to', 'probe', 'how', 'well', 'magphys', 'can', 'recover', 'key', 'galaxy', 'properties', 'based', 'on', '21', 'bands', 'of', 'uvfarinfrared', 'model', 'photometry', 'magphys', 'yields', 'statistically', 'acceptable', 'fits', 'to', '99', 'per', 'cent', 'of', 'the', 'pixels', 'within', 'the', 'rband', 'effective', 'radius', 'and', 'between', '59', 'and', '77', 'per', 'cent', 'of', 'pixels', 'within', '20kpc', 'of', 'the', 'nucleus', 'magphys', 'is', 'able', 'to', 'recover', 'the', 'distribution', 'of', 'stellar', 'mass', 'star', 'formation', 'rate', 'sfr', 'specific', 'sfr', 'dust', 'luminosity', 'dust', 'mass', 'and', 'vband', 'attenuation', 'reasonably', 'well', 'especially', 'when', 'the', 'pixel', 'size', 'is', 'sim1', 'kpc', 'whereas', 'nonstandard', 'outputs', 'stellar', 'metallicity', 'and', 'massweighted', 'age', 'are', 'recovered', 'less', 'well', 'accurate', 'recovery', 'is', 'more', 'challenging', 'in', 'the', 'smallest', 'subregions', 'of', 'the', 'disc', 'pixel', 'scale', 'sim', '1', 'kpc', 'where', 'the', 'energy', 'balance', 'criterion', 'becomes', 'increasingly', 'incorrect', 'estimating', 'integrated', 'galaxy', 'properties', 'by', 'summing', 'the', 'recovered', 'pixel', 'values', 'the', 'true', 'integrated', 'values', 'of', 'all', 'parameters', 'considered', 'except', 'metallicity', 'and', 'age', 'are', 'well', 'recovered', 'at', 'all', 'spatial', 'resolutions', 'ranging', 'from', '02kpc', 'to', 'integrating', 'across', 'the', 'disc', 'albeit', 'with', 'some', 'evidence', 'for', 'resolutiondependent', 'biases', 'these', 'results', 'must', 'be', 'considered', 'when', 'attempting', 'to', 'analyse', 'the', 'structure', 'of', 'real', 'galaxies', 'with', 'actual', 'observational', 'data', 'for', 'which', 'the', 'ground', 'truth', 'is', 'unknown']] | [0.014932037445153886, 0.04622345830672809, -0.06104621318906235, 0.15564247473569898, -0.05445249822126546, -0.10176737856915376, 0.010487698904277446, 0.44929976063819294, -0.17834096384855608, -0.41613710117526354, 0.060890603852264275, -0.26826331148234506, 0.02845495282927004, 0.18941174234011365, -0.06602637059792565, 0.030971640207159604, 0.043039647797801686, -0.08714476151120228, -0.0708175352808515, -0.2845692296522126, 0.2679311419002867, 0.10018219494183238, 0.18043779485863828, -0.029917683628900703, 0.08979077953320787, -0.06516375317102453, -0.09972220563795417, -0.029291040943159413, -0.16949600385366162, 0.043589312609401534, 0.2644368982485806, 0.149442613501742, 0.19414597377472093, -0.32907996586970206, -0.20053498063837955, 0.0658822166985677, 0.18928484220911437, 0.03991898536193427, -0.006166742372746133, -0.22137177875847555, 0.08161845493838579, -0.16776912053076862, -0.1597255244328456, 0.05647129591622312, 0.03990944267328208, 0.009907813994990041, -0.2629789944944302, 0.19923711402746752, -0.03420306580762068, 0.09933706993469968, -0.13171622665637794, -0.13758944744088997, -0.11945627636450809, 0.13482632533050493, 0.003547130949543013, 0.06657633493984273, 0.22730408793043655, -0.13162734991055913, 0.03757867626651811, 0.401876712590456, -0.04740602000723205, -0.08177150794460128, 0.17161152610691108, -0.2016695076483302, -0.10165319523415141, 0.12732772961705147, 0.13957829001228675, 0.07652138169699658, -0.18323339107143208, 0.0050326520761397354, -0.016892085102153943, 0.2825875282520428, 0.056232036615741283, 0.05058095328295167, 0.2928178969654255, 0.09564253729962123, 0.02864479759033808, 0.07053557723993435, -0.24765050981756456, -0.06417640994477551, -0.25992588115138154, -0.05759397503588844, -0.16560779046752336, 0.0761729196723536, -0.1901588435863232, -0.11899067315340896, 0.37780805776128545, 0.15340647752169995, 0.26462442164192906, 0.12379213711125582, 0.3246556316424782, 0.07174154622164981, 0.1305601908553702, 0.12088208143783656, 0.25121556119617405, 0.15396783799418093, 0.025319604109972714, -0.20209885663352906, 0.07925461585303613, -0.008662759746463659] |
1,802.02588 | Quantum edge modes in 3d gravity and 2+1d topological phases of matter | We analyze the edge mode structure of Euclidean three dimensional gravity
from within the quantum theory as embodied by a Ponzano-Regge-Turaev-Viro
discrete state sum with Gibbons-=-Hawking-York boundary conditions. This
structure is encoded in a pair of dual statistical models of the vertex and
face kind, which for specific choices of boundary conditions turn out to be
integrable. The duality is just the manifestation of a pervasive dual structure
which manifests at different levels of the classical and quantum theories.
Emphasis will be put on the geometrical interpretation of the edge modes which
leads in particular to the identification of the quantum analogue of Carlip's
would-be normal diffeomorphisms. We also provide a reinterpretation of our
construction in terms of a non-Abelian 2+1 topological phase with electric
boundary conditions.
| hep-th cond-mat.str-el gr-qc | we analyze the edge mode structure of euclidean three dimensional gravity from within the quantum theory as embodied by a ponzanoreggeturaevviro discrete state sum with gibbonshawkingyork boundary conditions this structure is encoded in a pair of dual statistical models of the vertex and face kind which for specific choices of boundary conditions turn out to be integrable the duality is just the manifestation of a pervasive dual structure which manifests at different levels of the classical and quantum theories emphasis will be put on the geometrical interpretation of the edge modes which leads in particular to the identification of the quantum analogue of carlips wouldbe normal diffeomorphisms we also provide a reinterpretation of our construction in terms of a nonabelian 21 topological phase with electric boundary conditions | [['we', 'analyze', 'the', 'edge', 'mode', 'structure', 'of', 'euclidean', 'three', 'dimensional', 'gravity', 'from', 'within', 'the', 'quantum', 'theory', 'as', 'embodied', 'by', 'a', 'ponzanoreggeturaevviro', 'discrete', 'state', 'sum', 'with', 'gibbonshawkingyork', 'boundary', 'conditions', 'this', 'structure', 'is', 'encoded', 'in', 'a', 'pair', 'of', 'dual', 'statistical', 'models', 'of', 'the', 'vertex', 'and', 'face', 'kind', 'which', 'for', 'specific', 'choices', 'of', 'boundary', 'conditions', 'turn', 'out', 'to', 'be', 'integrable', 'the', 'duality', 'is', 'just', 'the', 'manifestation', 'of', 'a', 'pervasive', 'dual', 'structure', 'which', 'manifests', 'at', 'different', 'levels', 'of', 'the', 'classical', 'and', 'quantum', 'theories', 'emphasis', 'will', 'be', 'put', 'on', 'the', 'geometrical', 'interpretation', 'of', 'the', 'edge', 'modes', 'which', 'leads', 'in', 'particular', 'to', 'the', 'identification', 'of', 'the', 'quantum', 'analogue', 'of', 'carlips', 'wouldbe', 'normal', 'diffeomorphisms', 'we', 'also', 'provide', 'a', 'reinterpretation', 'of', 'our', 'construction', 'in', 'terms', 'of', 'a', 'nonabelian', '21', 'topological', 'phase', 'with', 'electric', 'boundary', 'conditions']] | [-0.14961395280746123, 0.15096965931829007, -0.1262852433765869, 0.041092471145684754, -0.08837139526278609, -0.13246674456870153, 0.02026063496744009, 0.2834039115834804, -0.2533670899842585, -0.25412060655949137, 0.11512415595020034, -0.2151080844129273, -0.1737108158598107, 0.13212953172328454, -0.0704255239827381, 0.017813184930543815, 0.041204263803563894, 0.09398651828768567, -0.10160202188934717, -0.18904099686141496, 0.3600036680720569, 0.016527654110668377, 0.2975236722415993, 0.06433281402606221, 0.09372515253914845, -0.003222450468918338, 0.006834917901349919, 0.04947869303739733, -0.11694064887151831, 0.11892430162027715, 0.23833745488627756, 0.06437659463179964, 0.21233085394164342, -0.43715933952037067, -0.2134440918062677, 0.06732046165473995, 0.0966456946907639, 0.09526551896724703, -0.007616466100675069, -0.30980882486180655, 0.05867491464688635, -0.1408998565341804, -0.15172331194422903, -0.0362132741729655, -0.02576194039457256, -0.0712185097666132, -0.24220587236627508, 0.055715774470295326, 0.0738398508918989, 0.06076189514160866, -0.06333222778676639, -0.06089962264227252, -0.04843707414647003, 0.0983578592561008, 0.019002888882939245, 0.027685715214511943, 0.09363049206703658, -0.17462232399858685, -0.15196854735000265, 0.3947254427309547, -0.028763759829517867, -0.23257249399339633, 0.20029946320712388, -0.13522206127480974, -0.14283400545975874, 0.07176159492265137, 0.13149359454179094, 0.10784080144136197, -0.11954130461607645, 0.1304807535230389, -0.04400747824951799, 0.09505400256741614, 0.08213950652400002, 0.10487434214594522, 0.27459182565115275, 0.11452285182433174, 0.07351798097795201, 0.19524957333314455, -0.049274821973605346, -0.16027415513304905, -0.3905267742950292, -0.18203454528817914, -0.1520902151248828, 0.08845771914384963, -0.10012767747915831, -0.20237628973665692, 0.4192508659473369, 0.10230107529798896, 0.19779617431396174, -0.018633551417946047, 0.229838294524049, 0.14768934712952209, 0.07141483511539205, 0.018650072684053273, 0.20968676734131775, 0.15416741913132784, 0.041267553830356705, -0.23593878033681817, -0.011695804388543207, 0.14301003747442292] |
1,802.02589 | A Universal Entropy Profile for the Hot Atmospheres of Galaxies and
Clusters within $R_{2500}$ | We present atmospheric gas entropy profiles for 40 early type galaxies and
110 clusters spanning several decades of halo mass, atmospheric gas mass, radio
jet power, and galaxy type. We show that within $\sim 0.1R_{2500}$ the entropy
profiles of low-mass systems, including ellipticals, brightest cluster
galaxies, and spiral galaxies, scale approximately as $K\propto R^{2/3}$.
Beyond $\sim 0.1R_{2500}$ entropy profiles are slightly shallower than the $K
\propto R^{1.1}$ profile expected from gravitational collapse alone, indicating
that heating by AGN feedback extends well beyond the central galaxy. We show
that the $K\propto R^{2/3}$ entropy profile shape indicates that thermally
unstable cooling is balanced by heating where the inner cooling and free-fall
timescales approach a constant ratio. Hot atmospheres of elliptical galaxies
have a higher rate of heating per gas particle compared to central cluster
galaxies. This excess heating may explain why some central cluster galaxies are
forming stars while most early-type galaxies have experienced no significant
star formation for billions of years. We show that the entropy profiles of six
lenticular and spiral galaxies follow the $R^{2/3}$ form. The continuity
between central galaxies in clusters, giant ellipticals, and spirals suggests
perhaps that processes heating the atmospheres of elliptical and brightest
cluster galaxies are also active in spiral galaxies.
| astro-ph.CO astro-ph.GA | we present atmospheric gas entropy profiles for 40 early type galaxies and 110 clusters spanning several decades of halo mass atmospheric gas mass radio jet power and galaxy type we show that within sim 01r_2500 the entropy profiles of lowmass systems including ellipticals brightest cluster galaxies and spiral galaxies scale approximately as kpropto r23 beyond sim 01r_2500 entropy profiles are slightly shallower than the k propto r11 profile expected from gravitational collapse alone indicating that heating by agn feedback extends well beyond the central galaxy we show that the kpropto r23 entropy profile shape indicates that thermally unstable cooling is balanced by heating where the inner cooling and freefall timescales approach a constant ratio hot atmospheres of elliptical galaxies have a higher rate of heating per gas particle compared to central cluster galaxies this excess heating may explain why some central cluster galaxies are forming stars while most earlytype galaxies have experienced no significant star formation for billions of years we show that the entropy profiles of six lenticular and spiral galaxies follow the r23 form the continuity between central galaxies in clusters giant ellipticals and spirals suggests perhaps that processes heating the atmospheres of elliptical and brightest cluster galaxies are also active in spiral galaxies | [['we', 'present', 'atmospheric', 'gas', 'entropy', 'profiles', 'for', '40', 'early', 'type', 'galaxies', 'and', '110', 'clusters', 'spanning', 'several', 'decades', 'of', 'halo', 'mass', 'atmospheric', 'gas', 'mass', 'radio', 'jet', 'power', 'and', 'galaxy', 'type', 'we', 'show', 'that', 'within', 'sim', '01r_2500', 'the', 'entropy', 'profiles', 'of', 'lowmass', 'systems', 'including', 'ellipticals', 'brightest', 'cluster', 'galaxies', 'and', 'spiral', 'galaxies', 'scale', 'approximately', 'as', 'kpropto', 'r23', 'beyond', 'sim', '01r_2500', 'entropy', 'profiles', 'are', 'slightly', 'shallower', 'than', 'the', 'k', 'propto', 'r11', 'profile', 'expected', 'from', 'gravitational', 'collapse', 'alone', 'indicating', 'that', 'heating', 'by', 'agn', 'feedback', 'extends', 'well', 'beyond', 'the', 'central', 'galaxy', 'we', 'show', 'that', 'the', 'kpropto', 'r23', 'entropy', 'profile', 'shape', 'indicates', 'that', 'thermally', 'unstable', 'cooling', 'is', 'balanced', 'by', 'heating', 'where', 'the', 'inner', 'cooling', 'and', 'freefall', 'timescales', 'approach', 'a', 'constant', 'ratio', 'hot', 'atmospheres', 'of', 'elliptical', 'galaxies', 'have', 'a', 'higher', 'rate', 'of', 'heating', 'per', 'gas', 'particle', 'compared', 'to', 'central', 'cluster', 'galaxies', 'this', 'excess', 'heating', 'may', 'explain', 'why', 'some', 'central', 'cluster', 'galaxies', 'are', 'forming', 'stars', 'while', 'most', 'earlytype', 'galaxies', 'have', 'experienced', 'no', 'significant', 'star', 'formation', 'for', 'billions', 'of', 'years', 'we', 'show', 'that', 'the', 'entropy', 'profiles', 'of', 'six', 'lenticular', 'and', 'spiral', 'galaxies', 'follow', 'the', 'r23', 'form', 'the', 'continuity', 'between', 'central', 'galaxies', 'in', 'clusters', 'giant', 'ellipticals', 'and', 'spirals', 'suggests', 'perhaps', 'that', 'processes', 'heating', 'the', 'atmospheres', 'of', 'elliptical', 'and', 'brightest', 'cluster', 'galaxies', 'are', 'also', 'active', 'in', 'spiral', 'galaxies']] | [-0.05749188639524886, 0.11796454462455586, -0.06227672947159804, 0.15574842899827762, -0.07372507551575408, -0.04137749768572165, 0.01886097693646911, 0.4183258648377423, -0.07704696826027323, -0.3417440017356592, -0.0003781599282542718, -0.30824048525434644, -0.004900933368880229, 0.20294690666795598, -0.006504782175362183, -0.05178517138861649, 0.01538133617221177, -0.12641348069483488, -0.040717640052796066, -0.31061736840410065, 0.3020456230391146, 0.07069853769259199, 0.1494401252837669, -0.07910321457037593, 0.016091215721555238, -0.1438984181549327, -0.05557833933362774, -0.024141530918902445, -0.19906856375225698, -0.048443942365017444, 0.2232585496568194, 0.11879662366574813, 0.23957528873328485, -0.3838780319509918, -0.23637801291895846, 0.09251666568247054, 0.28399712391261595, 0.013909443014520495, -0.13193849165648264, -0.19298907320069916, 0.05204562625537316, -0.22952981211082993, -0.17612288522479289, 0.099015163843504, 0.07368641238038738, 0.05017080852104639, -0.1879039862485347, 0.2818671938951536, 0.07118109838327155, 0.09324998030320321, -0.10867100831819698, -0.08476073855269409, -0.10396937611763932, 0.014397352880241313, 0.010000680504805026, 0.06572623561277949, 0.3477869200766744, -0.14458788401223535, 0.021189862211673138, 0.4139989478166635, -0.04927948707015329, 0.09289499860731702, 0.252934470925681, -0.2449756971418894, -0.18285423958007538, 0.12587999851059387, 0.12989712760363722, 0.07908225208566542, -0.14042761946763552, -0.0483761154473006, -0.028269656558347612, 0.21836885577524265, 0.0712100017402668, 0.04652458850899825, 0.36017082013131585, 0.05472791622685013, 0.08808237508021514, 0.08386686845915392, -0.19556946843045345, -0.06308771404049669, -0.18460463253123796, -0.09205176078659646, -0.09456669186685901, 0.08310182366803215, -0.19008403152460518, -0.0847737101025368, 0.2957817193710784, 0.05198242583633948, 0.237133808470532, 0.11196269885084464, 0.3046696533439864, 0.0771232271531606, 0.16717503955884488, 0.2046396541306475, 0.306377866221666, 0.22228988489893942, 0.051529902997928874, -0.2865498302031911, 0.05178876496011428, -0.008339335779002047] |
1,802.0259 | Unlocking CO Depletion in Protoplanetary Disks I. The Warm Molecular
Layer | CO is commonly used as a tracer of the total gas mass in both the
interstellar medium and in protoplanetary disks. Recently there has been much
debate about the utility of CO as a mass tracer in disks. Observations of CO in
protoplanetary disks reveal a range of CO abundances, with measurements of low
CO to dust mass ratios in numerous systems. One possibility is that carbon is
removed from CO via chemistry. However, the full range of physical conditions
conducive to this chemical reprocessing is not well understood. We perform a
systematic survey of the time dependent chemistry in protoplanetary disks for
198 models with a range of physical conditions. We varying dust grain size
distribution, temperature, comic ray and X-ray ionization rate, disk mass, and
initial water abundance, detailing what physical conditions are necessary to
activate the various CO depletion mechanisms in the warm molecular layer. We
focus our analysis on the warm molecular layer in two regions: the outer disk
(100 au) well outside the CO snowline and the inner disk (19 au) just inside
the midplane CO snow line. After 1 Myr, we find that the majority of models
have a CO abundance relative to H$_2$ less than $10^{-4}$ in the outer disk,
while an abundance less than $10^{-5}$ requires the presence of cosmic rays.
Inside the CO snow line, significant depletion of CO only occurs in models with
a high cosmic ray rate. If cosmic rays are not present in young disks it is
difficult to chemically remove carbon from CO. Additionally, removing water
prior to CO depletion impedes the chemical processing of CO. Chemical
processing alone cannot explain current observations of low CO abundances.
Other mechanisms must also be involved.
| astro-ph.EP astro-ph.GA astro-ph.SR | co is commonly used as a tracer of the total gas mass in both the interstellar medium and in protoplanetary disks recently there has been much debate about the utility of co as a mass tracer in disks observations of co in protoplanetary disks reveal a range of co abundances with measurements of low co to dust mass ratios in numerous systems one possibility is that carbon is removed from co via chemistry however the full range of physical conditions conducive to this chemical reprocessing is not well understood we perform a systematic survey of the time dependent chemistry in protoplanetary disks for 198 models with a range of physical conditions we varying dust grain size distribution temperature comic ray and xray ionization rate disk mass and initial water abundance detailing what physical conditions are necessary to activate the various co depletion mechanisms in the warm molecular layer we focus our analysis on the warm molecular layer in two regions the outer disk 100 au well outside the co snowline and the inner disk 19 au just inside the midplane co snow line after 1 myr we find that the majority of models have a co abundance relative to h_2 less than 104 in the outer disk while an abundance less than 105 requires the presence of cosmic rays inside the co snow line significant depletion of co only occurs in models with a high cosmic ray rate if cosmic rays are not present in young disks it is difficult to chemically remove carbon from co additionally removing water prior to co depletion impedes the chemical processing of co chemical processing alone cannot explain current observations of low co abundances other mechanisms must also be involved | [['co', 'is', 'commonly', 'used', 'as', 'a', 'tracer', 'of', 'the', 'total', 'gas', 'mass', 'in', 'both', 'the', 'interstellar', 'medium', 'and', 'in', 'protoplanetary', 'disks', 'recently', 'there', 'has', 'been', 'much', 'debate', 'about', 'the', 'utility', 'of', 'co', 'as', 'a', 'mass', 'tracer', 'in', 'disks', 'observations', 'of', 'co', 'in', 'protoplanetary', 'disks', 'reveal', 'a', 'range', 'of', 'co', 'abundances', 'with', 'measurements', 'of', 'low', 'co', 'to', 'dust', 'mass', 'ratios', 'in', 'numerous', 'systems', 'one', 'possibility', 'is', 'that', 'carbon', 'is', 'removed', 'from', 'co', 'via', 'chemistry', 'however', 'the', 'full', 'range', 'of', 'physical', 'conditions', 'conducive', 'to', 'this', 'chemical', 'reprocessing', 'is', 'not', 'well', 'understood', 'we', 'perform', 'a', 'systematic', 'survey', 'of', 'the', 'time', 'dependent', 'chemistry', 'in', 'protoplanetary', 'disks', 'for', '198', 'models', 'with', 'a', 'range', 'of', 'physical', 'conditions', 'we', 'varying', 'dust', 'grain', 'size', 'distribution', 'temperature', 'comic', 'ray', 'and', 'xray', 'ionization', 'rate', 'disk', 'mass', 'and', 'initial', 'water', 'abundance', 'detailing', 'what', 'physical', 'conditions', 'are', 'necessary', 'to', 'activate', 'the', 'various', 'co', 'depletion', 'mechanisms', 'in', 'the', 'warm', 'molecular', 'layer', 'we', 'focus', 'our', 'analysis', 'on', 'the', 'warm', 'molecular', 'layer', 'in', 'two', 'regions', 'the', 'outer', 'disk', '100', 'au', 'well', 'outside', 'the', 'co', 'snowline', 'and', 'the', 'inner', 'disk', '19', 'au', 'just', 'inside', 'the', 'midplane', 'co', 'snow', 'line', 'after', '1', 'myr', 'we', 'find', 'that', 'the', 'majority', 'of', 'models', 'have', 'a', 'co', 'abundance', 'relative', 'to', 'h_2', 'less', 'than', '104', 'in', 'the', 'outer', 'disk', 'while', 'an', 'abundance', 'less', 'than', '105', 'requires', 'the', 'presence', 'of', 'cosmic', 'rays', 'inside', 'the', 'co', 'snow', 'line', 'significant', 'depletion', 'of', 'co', 'only', 'occurs', 'in', 'models', 'with', 'a', 'high', 'cosmic', 'ray', 'rate', 'if', 'cosmic', 'rays', 'are', 'not', 'present', 'in', 'young', 'disks', 'it', 'is', 'difficult', 'to', 'chemically', 'remove', 'carbon', 'from', 'co', 'additionally', 'removing', 'water', 'prior', 'to', 'co', 'depletion', 'impedes', 'the', 'chemical', 'processing', 'of', 'co', 'chemical', 'processing', 'alone', 'can', 'not', 'explain', 'current', 'observations', 'of', 'low', 'co', 'abundances', 'other', 'mechanisms', 'must', 'also', 'be', 'involved']] | [-0.04691063575077484, 0.1132760604893491, 0.030194056307968363, 0.05854498756114874, -0.029804869836037296, -0.04004856393808817, 0.04837119514576909, 0.4469363886979814, -0.22458322631286048, -0.35554847571323867, 0.044531159014084123, -0.2481709097119418, 0.0008141498125193946, 0.13685592105072672, -0.010408443820221472, -0.01172338282480148, 0.021089412547803714, -0.13963066176219294, -0.04646183276802094, -0.2525858790780779, 0.2873019388859008, 0.12182884045733781, 0.1258165690697444, 0.07481233142024289, -0.01366171986533926, -0.1749594103372964, -0.0426509121099474, -0.06699396899774775, -0.18471306475806853, 0.024561864478864062, 0.23132635053022443, 0.1088240521664663, 0.1902678077959355, -0.47276827071887484, -0.2801744489077128, 0.07620505256844419, 0.16377296348472323, 0.06392671904552612, -0.05182618856185054, -0.17796702887327492, 0.05859119141391618, -0.14279360627716584, -0.15875677225254606, 0.07704046937614316, 0.06363212865901435, 0.005265875559872932, -0.2279480374961741, 0.1117752905380758, 0.05357960861137008, 0.12202546611032368, -0.11391500377531069, -0.1614883845357244, -0.13214324822994955, 0.05729874948551554, 0.007344491517768349, 0.0466097155026118, 0.30572098705800776, -0.10743655603077223, 0.035061622308632065, 0.42872811229867075, -0.12717454125733563, -0.07977658676556296, 0.3007435600373907, -0.23504186524662354, -0.17328367016573504, 0.222599384166018, 0.11468459872807983, 0.13290797154993494, -0.16650697644735046, 0.01564519573307275, -0.03914761297564583, 0.23317095875445565, 0.09376788131555198, 0.05567262040366798, 0.35939963313163575, 0.1441258230292845, 0.049986758874972656, 0.074620991126506, -0.21297719790957192, -0.07991742513561134, -0.1869011304522978, -0.17780445345096577, -0.14430253212023786, 0.08328968844957972, -0.12114476729066757, -0.11219310742812653, 0.24922988304904037, 0.12461599533507789, 0.25983764829019973, -0.037517786270189216, 0.33616592530453193, 0.04059559112343327, 0.09958858845612677, 0.08987481478286927, 0.27023249715469283, 0.1636166215838965, 0.15652087651345659, -0.23192553588847115, 0.1655229458273859, -0.02941518106971598] |
1,802.02591 | Climbing to the top of the galactic mass ladder: evidence for frequent
prolate-like rotation among the most massive galaxies | We present the stellar velocity maps of 25 massive early type galaxies
located in dense environments observed with MUSE. Galaxies are selected to be
brighter than M_K=-25.7 magnitude, reside in the core of the Shapley Super
Cluster or be the brightest galaxy in clusters richer than the Virgo Cluster.
We thus targeted galaxies more massive than 10^12 Msun and larger than 10 kpc
(half-light radius). The velocity maps show a large variety of kinematic
features: oblate-like regular rotation, kinematically distinct cores and
various types of non-regular rotation. The kinematic misalignment angles show
that massive galaxies can be divided into two categories: those with small or
negligible misalignment, and those with misalignment consistent with being 90
degrees. Galaxies in this latter group, comprising just under half of our
galaxies, have prolate-like rotation (rotation around the major axis). Among
the brightest cluster galaxies the incidence of prolate-like rotation is 50 per
cent, while for a magnitude limited sub-sample of objects within the Shapley
Super Cluster (mostly satellites), 35 per cent of galaxies show prolate-like
rotation. Placing our galaxies on the mass - size diagram, we show that they
all fall on a branch extending almost an order of magnitude in mass and a
factor of 5 in size from the massive end early-type galaxies, previously
recognised as associated with major dissipation-less mergers. The presence of
galaxies with complex kinematics and, particularly, prolate-like rotators
suggests, according to current numerical simulations, that the most massive
galaxies grow predominantly through dissipation-less equal-mass mergers.
| astro-ph.GA | we present the stellar velocity maps of 25 massive early type galaxies located in dense environments observed with muse galaxies are selected to be brighter than m_k257 magnitude reside in the core of the shapley super cluster or be the brightest galaxy in clusters richer than the virgo cluster we thus targeted galaxies more massive than 1012 msun and larger than 10 kpc halflight radius the velocity maps show a large variety of kinematic features oblatelike regular rotation kinematically distinct cores and various types of nonregular rotation the kinematic misalignment angles show that massive galaxies can be divided into two categories those with small or negligible misalignment and those with misalignment consistent with being 90 degrees galaxies in this latter group comprising just under half of our galaxies have prolatelike rotation rotation around the major axis among the brightest cluster galaxies the incidence of prolatelike rotation is 50 per cent while for a magnitude limited subsample of objects within the shapley super cluster mostly satellites 35 per cent of galaxies show prolatelike rotation placing our galaxies on the mass size diagram we show that they all fall on a branch extending almost an order of magnitude in mass and a factor of 5 in size from the massive end earlytype galaxies previously recognised as associated with major dissipationless mergers the presence of galaxies with complex kinematics and particularly prolatelike rotators suggests according to current numerical simulations that the most massive galaxies grow predominantly through dissipationless equalmass mergers | [['we', 'present', 'the', 'stellar', 'velocity', 'maps', 'of', '25', 'massive', 'early', 'type', 'galaxies', 'located', 'in', 'dense', 'environments', 'observed', 'with', 'muse', 'galaxies', 'are', 'selected', 'to', 'be', 'brighter', 'than', 'm_k257', 'magnitude', 'reside', 'in', 'the', 'core', 'of', 'the', 'shapley', 'super', 'cluster', 'or', 'be', 'the', 'brightest', 'galaxy', 'in', 'clusters', 'richer', 'than', 'the', 'virgo', 'cluster', 'we', 'thus', 'targeted', 'galaxies', 'more', 'massive', 'than', '1012', 'msun', 'and', 'larger', 'than', '10', 'kpc', 'halflight', 'radius', 'the', 'velocity', 'maps', 'show', 'a', 'large', 'variety', 'of', 'kinematic', 'features', 'oblatelike', 'regular', 'rotation', 'kinematically', 'distinct', 'cores', 'and', 'various', 'types', 'of', 'nonregular', 'rotation', 'the', 'kinematic', 'misalignment', 'angles', 'show', 'that', 'massive', 'galaxies', 'can', 'be', 'divided', 'into', 'two', 'categories', 'those', 'with', 'small', 'or', 'negligible', 'misalignment', 'and', 'those', 'with', 'misalignment', 'consistent', 'with', 'being', '90', 'degrees', 'galaxies', 'in', 'this', 'latter', 'group', 'comprising', 'just', 'under', 'half', 'of', 'our', 'galaxies', 'have', 'prolatelike', 'rotation', 'rotation', 'around', 'the', 'major', 'axis', 'among', 'the', 'brightest', 'cluster', 'galaxies', 'the', 'incidence', 'of', 'prolatelike', 'rotation', 'is', '50', 'per', 'cent', 'while', 'for', 'a', 'magnitude', 'limited', 'subsample', 'of', 'objects', 'within', 'the', 'shapley', 'super', 'cluster', 'mostly', 'satellites', '35', 'per', 'cent', 'of', 'galaxies', 'show', 'prolatelike', 'rotation', 'placing', 'our', 'galaxies', 'on', 'the', 'mass', 'size', 'diagram', 'we', 'show', 'that', 'they', 'all', 'fall', 'on', 'a', 'branch', 'extending', 'almost', 'an', 'order', 'of', 'magnitude', 'in', 'mass', 'and', 'a', 'factor', 'of', '5', 'in', 'size', 'from', 'the', 'massive', 'end', 'earlytype', 'galaxies', 'previously', 'recognised', 'as', 'associated', 'with', 'major', 'dissipationless', 'mergers', 'the', 'presence', 'of', 'galaxies', 'with', 'complex', 'kinematics', 'and', 'particularly', 'prolatelike', 'rotators', 'suggests', 'according', 'to', 'current', 'numerical', 'simulations', 'that', 'the', 'most', 'massive', 'galaxies', 'grow', 'predominantly', 'through', 'dissipationless', 'equalmass', 'mergers']] | [-0.10304818069798932, 0.13585228923992376, -0.010190618432664531, 0.09017260834135539, -0.08679747988746267, -0.021427672097981885, -0.001020953637487217, 0.4087709839137771, -0.11053103015959695, -0.37596506736339713, 0.04076271588115279, -0.2831144831351542, -0.019110669291055784, 0.2099549479260132, -0.019713569740098486, -0.08123694324953012, 0.0646917062579196, -0.04872147743665894, -0.07296619589991368, -0.33804950578224835, 0.31148288816088676, 0.01680609306161542, 0.16406657625504625, -0.1460657225426275, 0.05414970270433744, -0.08376778955798506, -0.06823403845523196, 0.005418022404294944, -0.11587727463912911, 0.01178124627477974, 0.22900534537336903, 0.09521146252849783, 0.2416458766440964, -0.3517920119797705, -0.13261103655809794, 0.08624908747340787, 0.25736354815591944, 0.04752556345240039, -0.10033847823791343, -0.2868860950220255, 0.1199069098007252, -0.19443090183838324, -0.19702740961201187, 0.10512532102231814, 0.059305632850382387, 0.01432954650575757, -0.16760440078768424, 0.21559588090569629, 0.01736303968203625, 0.10726895729435713, -0.07275283281271142, -0.1287547791683365, -0.10665574406767718, 0.060795861798455954, 0.003221842741434712, 0.08790759966335812, 0.23876832878005091, -0.1420047399010585, -0.015000034543890052, 0.4401220426235984, 0.0032066549138995114, -0.017424698286818537, 0.266361677015912, -0.254607895758321, -0.17545802389816723, 0.11370824772024118, 0.1788096785736062, 0.11842030765795399, -0.12678951728665241, -0.04143254516378416, -0.033966973780302286, 0.23228629492933112, 0.07074335280605175, 0.05080077198162018, 0.33797691999442453, 0.10741442749660075, 0.07728005796235539, 0.07475117870135142, -0.1963809866676338, -0.06434522500939334, -0.19821343420459547, -0.08634903878449156, -0.08416909691536935, 0.07750302537654837, -0.20064468786083267, -0.08661632748260124, 0.3300133120870536, 0.09234493477348091, 0.24414447652615182, 0.10352868707618691, 0.3150410441136578, 0.050318717739329014, 0.22388563377544193, 0.1555983793067997, 0.31164101542662676, 0.18194221594367116, -0.007715874032602017, -0.19763711016678168, 0.029087110379014194, -0.04458644676468963] |
1,802.02592 | Fast estimation of orbital parameters in Milky-Way-like potentials | Orbital parameters, such as eccentricity and maximum vertical excursion, of
stars in the Milky Way are an important tool for understanding its dynamics and
evolution, but calculation of such parameters usually relies on
computationally-expensive numerical orbit integration. We present and test a
fast method for estimating these parameters using an application of the
St\"ackel fudge, used previously for the estimation of action-angle variables.
We show that the method is highly accurate, to a level of $<1\%$ in
eccentricity, over a large range of relevant orbits and in different Milky
Way-like potentials, and demonstrate its validity by estimating the
eccentricity distribution of the RAVE-TGAS data set and comparing it to that
from orbit integration. Using the method, the orbital characteristics of the
$\sim 7$ million $\textit{Gaia}$ DR2 stars with radial velocity measurements
are computed with Monte Carlo sampled errors in $\sim 116$ hours of
parallelised cpu time, at a speed that we estimate to be $\sim 3$ to $4$ orders
of magnitude faster than using numerical orbit integration. We demonstrate
using this catalogue that $\textit{Gaia}$ DR2 samples a large range of orbits
in the solar vicinity, down to those with $r_\mathrm{peri} \lesssim 2.5$ kpc,
and out to $r_\mathrm{ap} \gtrsim 13$ kpc. We also show that many of the
features present in orbital parameter space have a low mean $z_\mathrm{max}$,
suggesting that they likely result from disk dynamical effects.
| astro-ph.GA astro-ph.IM | orbital parameters such as eccentricity and maximum vertical excursion of stars in the milky way are an important tool for understanding its dynamics and evolution but calculation of such parameters usually relies on computationallyexpensive numerical orbit integration we present and test a fast method for estimating these parameters using an application of the stackel fudge used previously for the estimation of actionangle variables we show that the method is highly accurate to a level of 1 in eccentricity over a large range of relevant orbits and in different milky waylike potentials and demonstrate its validity by estimating the eccentricity distribution of the ravetgas data set and comparing it to that from orbit integration using the method the orbital characteristics of the sim 7 million textitgaia dr2 stars with radial velocity measurements are computed with monte carlo sampled errors in sim 116 hours of parallelised cpu time at a speed that we estimate to be sim 3 to 4 orders of magnitude faster than using numerical orbit integration we demonstrate using this catalogue that textitgaia dr2 samples a large range of orbits in the solar vicinity down to those with r_mathrmperi lesssim 25 kpc and out to r_mathrmap gtrsim 13 kpc we also show that many of the features present in orbital parameter space have a low mean z_mathrmmax suggesting that they likely result from disk dynamical effects | [['orbital', 'parameters', 'such', 'as', 'eccentricity', 'and', 'maximum', 'vertical', 'excursion', 'of', 'stars', 'in', 'the', 'milky', 'way', 'are', 'an', 'important', 'tool', 'for', 'understanding', 'its', 'dynamics', 'and', 'evolution', 'but', 'calculation', 'of', 'such', 'parameters', 'usually', 'relies', 'on', 'computationallyexpensive', 'numerical', 'orbit', 'integration', 'we', 'present', 'and', 'test', 'a', 'fast', 'method', 'for', 'estimating', 'these', 'parameters', 'using', 'an', 'application', 'of', 'the', 'stackel', 'fudge', 'used', 'previously', 'for', 'the', 'estimation', 'of', 'actionangle', 'variables', 'we', 'show', 'that', 'the', 'method', 'is', 'highly', 'accurate', 'to', 'a', 'level', 'of', '1', 'in', 'eccentricity', 'over', 'a', 'large', 'range', 'of', 'relevant', 'orbits', 'and', 'in', 'different', 'milky', 'waylike', 'potentials', 'and', 'demonstrate', 'its', 'validity', 'by', 'estimating', 'the', 'eccentricity', 'distribution', 'of', 'the', 'ravetgas', 'data', 'set', 'and', 'comparing', 'it', 'to', 'that', 'from', 'orbit', 'integration', 'using', 'the', 'method', 'the', 'orbital', 'characteristics', 'of', 'the', 'sim', '7', 'million', 'textitgaia', 'dr2', 'stars', 'with', 'radial', 'velocity', 'measurements', 'are', 'computed', 'with', 'monte', 'carlo', 'sampled', 'errors', 'in', 'sim', '116', 'hours', 'of', 'parallelised', 'cpu', 'time', 'at', 'a', 'speed', 'that', 'we', 'estimate', 'to', 'be', 'sim', '3', 'to', '4', 'orders', 'of', 'magnitude', 'faster', 'than', 'using', 'numerical', 'orbit', 'integration', 'we', 'demonstrate', 'using', 'this', 'catalogue', 'that', 'textitgaia', 'dr2', 'samples', 'a', 'large', 'range', 'of', 'orbits', 'in', 'the', 'solar', 'vicinity', 'down', 'to', 'those', 'with', 'r_mathrmperi', 'lesssim', '25', 'kpc', 'and', 'out', 'to', 'r_mathrmap', 'gtrsim', '13', 'kpc', 'we', 'also', 'show', 'that', 'many', 'of', 'the', 'features', 'present', 'in', 'orbital', 'parameter', 'space', 'have', 'a', 'low', 'mean', 'z_mathrmmax', 'suggesting', 'that', 'they', 'likely', 'result', 'from', 'disk', 'dynamical', 'effects']] | [-0.08666923966718189, 0.09562627596681393, -0.0826201932775023, 0.05262783036440461, -0.05603922257536657, -0.03417797416841495, 0.04831858153816678, 0.39319656388462526, -0.22189451330008783, -0.39116857400845867, 0.09040722322554627, -0.26992935120818273, -0.06709863058832914, 0.286664592618763, -0.024645167483998063, 0.05420721610789769, 0.12462425051645758, -0.043254805663309526, -0.09435513459019214, -0.24964815375694474, 0.24639077106050017, 0.039635534319261624, 0.12853533069626014, -0.046361060036101014, 0.11285963796763099, -0.024881667401392145, -0.025004296445071565, -0.00940613588123337, -0.16565564761335086, 0.08207286852120887, 0.20331340335126566, 0.10908878092180073, 0.2555616844204321, -0.3575846171359964, -0.17963132251341968, 0.04762272335522409, 0.1889474584079705, 0.08982878208709215, -0.03253019436098319, -0.26641105401254855, 0.12310300815027274, -0.21060220129480253, -0.17900811632612854, -0.08221308478563774, 0.08978572776374806, 0.0411464544678373, -0.2618516294792893, 0.1217759576942886, 0.01046082705410559, 0.1141252764937235, -0.07979350348094678, -0.13656590662555704, -0.038320189097638443, 0.08643006978049275, 0.04809426265429855, 0.06644687207010845, 0.15149176228234346, -0.06955117225879803, -0.053957801490988846, 0.39332654448558707, -0.08015542903876849, -0.13491675443557533, 0.18871466374236792, -0.2060876021839379, -0.13135998245810956, 0.13021228660363704, 0.18464497132871266, 0.14588612183329783, -0.1526373212213262, 0.027105949443206816, 0.02308526883591964, 0.20624027236252523, 0.05762619571760297, 0.019927392181021526, 0.22691882185608847, 0.146725294346522, 0.06547143275046048, 0.0517260124652239, -0.1983177975432357, -0.08998196969956293, -0.24552669943035912, -0.11686139580024246, -0.16345005247317854, 0.04989916066759698, -0.17017461956291818, -0.12793598595349717, 0.37885127593472134, 0.22364610759541392, 0.23181224628517935, 0.06434256371721858, 0.30785328726882916, 0.08429174091783612, 0.0855561138055886, 0.1350167893667406, 0.25279996170762126, 0.11106546506406241, 0.04105132413211062, -0.19607816492966126, 0.0414723929570755, 0.008728470079631734] |
1,802.02593 | Superfluid density of a photo-induced superconducting state | Nonequilibrium conditions offer novel routes to superconductivity that are
not available at equilibrium. For example, by engineering nonequilibrium
electronic populations, pairing may develop between electrons in different
energy bands. A concrete proposal has been made to photo-induce
superconductivity in a semiconductor, where pairing occurs between electrons in
the conduction and valence bands, even for repulsive interactions. Here, we
calculate the superfluid density for such a nonequilibrium paired state, and
find it to be positive for repulsive interactions and interband pairing. The
positivity of the superfluid density implies the stability of the photo-induced
superconducting state as well as the existence of the Meissner effect.
| cond-mat.supr-con | nonequilibrium conditions offer novel routes to superconductivity that are not available at equilibrium for example by engineering nonequilibrium electronic populations pairing may develop between electrons in different energy bands a concrete proposal has been made to photoinduce superconductivity in a semiconductor where pairing occurs between electrons in the conduction and valence bands even for repulsive interactions here we calculate the superfluid density for such a nonequilibrium paired state and find it to be positive for repulsive interactions and interband pairing the positivity of the superfluid density implies the stability of the photoinduced superconducting state as well as the existence of the meissner effect | [['nonequilibrium', 'conditions', 'offer', 'novel', 'routes', 'to', 'superconductivity', 'that', 'are', 'not', 'available', 'at', 'equilibrium', 'for', 'example', 'by', 'engineering', 'nonequilibrium', 'electronic', 'populations', 'pairing', 'may', 'develop', 'between', 'electrons', 'in', 'different', 'energy', 'bands', 'a', 'concrete', 'proposal', 'has', 'been', 'made', 'to', 'photoinduce', 'superconductivity', 'in', 'a', 'semiconductor', 'where', 'pairing', 'occurs', 'between', 'electrons', 'in', 'the', 'conduction', 'and', 'valence', 'bands', 'even', 'for', 'repulsive', 'interactions', 'here', 'we', 'calculate', 'the', 'superfluid', 'density', 'for', 'such', 'a', 'nonequilibrium', 'paired', 'state', 'and', 'find', 'it', 'to', 'be', 'positive', 'for', 'repulsive', 'interactions', 'and', 'interband', 'pairing', 'the', 'positivity', 'of', 'the', 'superfluid', 'density', 'implies', 'the', 'stability', 'of', 'the', 'photoinduced', 'superconducting', 'state', 'as', 'well', 'as', 'the', 'existence', 'of', 'the', 'meissner', 'effect']] | [-0.15713175709892824, 0.2457819057750579, -0.0920595717288608, 0.11512498383961835, -0.015645768179205582, -0.1767460014445038, 0.10592870200866635, 0.3615416436844948, -0.24081244223832504, -0.2682177816128847, -0.04139013895290244, -0.29917296902864304, -0.09601644524237485, 0.12548851837557787, 0.07317592574337732, -0.006909711299988541, -0.0324663949443154, -0.06403130609361292, -0.10780741549232631, -0.18336550841216467, 0.34394636958186486, -0.018564973668493693, 0.3220526611983993, 0.1835416914868051, 0.007149434711747956, 0.004451824440304371, 0.14295667370564294, 0.004038307200936438, -0.13948346546208837, 0.014376787536605758, 0.33008201575037815, -0.05926722440262804, 0.2516583104355677, -0.47204398092569655, -0.25452622349003273, 0.07481951587969093, 0.1289564798726221, 0.17198699206855256, -0.07710404699505533, -0.2820483204700704, -0.003128199996336282, -0.21368353221185724, -0.1322243597982361, -0.13768563356060642, 0.026808533853697546, 0.011457975036057742, -0.24829562258391272, 0.13379475169643326, 0.03996530080381419, 0.03927410973543392, -0.12461248381081426, -0.11009191876295411, -0.08794454048903098, 0.08181721043040596, 0.04126742721797483, 0.017841006261839088, 0.11988320119805562, -0.15249401550667668, -0.0866063846347546, 0.3547348033238962, -0.03161276681619941, -0.10380712738351046, 0.22929484119584548, -0.11201898061480482, -0.0591574483822344, 0.1402390367776445, 0.10342093841037125, 0.0387044398982114, -0.1365286048176219, 0.042910575699987956, -0.018607065915717806, 0.12383999019969726, 0.015984396002644185, 0.10985201504081488, 0.28759941228131936, 0.1837787927553347, 0.07814991948854866, 0.13452945682061926, -0.09539603362384352, -0.07185803268565932, -0.2677704502276859, -0.1806129821874563, -0.2499061903726418, 0.062379184242443056, 0.026391622335034042, -0.18843250227097458, 0.39028558234494287, 0.13975851268629608, 0.14599368059374754, -0.06127780658708325, 0.2351564989398116, 0.11264704437067424, 0.021680344238049955, 0.06092582311191894, 0.2811577095767682, 0.15911258002110187, 0.08671754367143206, -0.311198757403051, 0.07600501162063295, 0.03522933584646982] |
1,802.02594 | The Low-Frequency Radio Eclipses of the Black Widow Pulsar J1810+1744 | We have observed and analysed the eclipses of the black widow pulsar
J1810+1744 at low radio frequencies. Using LOw-Frequency ARray (LOFAR) and
Westerbork Synthesis Radio Telescope observations between 2011--2015 we have
measured variations in flux density, dispersion measure and scattering around
eclipses. High-time-resolution, simultaneous beamformed and interferometric
imaging LOFAR observations show concurrent disappearance of pulsations and
total flux from the source during the eclipses, with a $3\sigma$ upper limit of
36 mJy ($<10\%$ of the pulsar's averaged out-of-eclipse flux density). The
dispersion measure variations are highly asymmetric, suggesting a tail of
material swept back due to orbital motion. The egress deviations are variable
on timescales shorter than the 3.6 hr orbital period and are indicative of a
clumpy medium. Additional pulse broadening detected during egress is typically
$<20\%$ of the pulsar's spin period, showing no evidence of scattering the
pulses beyond detectability in the beamformed data. The eclipses, lasting
$\sim13\%$ of the orbit at 149 MHz, are shown to be frequency-dependent with
total duration scaling as $\propto\nu^{-0.41\pm0.03}$. The results are
discussed in the context of the physical parameters of the system, and an
examination of eclipse mechanisms reveals cyclotron-synchrotron absorption as
the most likely primary cause, although non-linear scattering mechanisms cannot
be quantitatively ruled out. The inferred mass loss rate is a similar
order-of-magnitude to the mean rate required to fully evaporate the companion
in a Hubble time.
| astro-ph.HE | we have observed and analysed the eclipses of the black widow pulsar j18101744 at low radio frequencies using lowfrequency array lofar and westerbork synthesis radio telescope observations between 20112015 we have measured variations in flux density dispersion measure and scattering around eclipses hightimeresolution simultaneous beamformed and interferometric imaging lofar observations show concurrent disappearance of pulsations and total flux from the source during the eclipses with a 3sigma upper limit of 36 mjy 10 of the pulsars averaged outofeclipse flux density the dispersion measure variations are highly asymmetric suggesting a tail of material swept back due to orbital motion the egress deviations are variable on timescales shorter than the 36 hr orbital period and are indicative of a clumpy medium additional pulse broadening detected during egress is typically 20 of the pulsars spin period showing no evidence of scattering the pulses beyond detectability in the beamformed data the eclipses lasting sim13 of the orbit at 149 mhz are shown to be frequencydependent with total duration scaling as proptonu041pm003 the results are discussed in the context of the physical parameters of the system and an examination of eclipse mechanisms reveals cyclotronsynchrotron absorption as the most likely primary cause although nonlinear scattering mechanisms cannot be quantitatively ruled out the inferred mass loss rate is a similar orderofmagnitude to the mean rate required to fully evaporate the companion in a hubble time | [['we', 'have', 'observed', 'and', 'analysed', 'the', 'eclipses', 'of', 'the', 'black', 'widow', 'pulsar', 'j18101744', 'at', 'low', 'radio', 'frequencies', 'using', 'lowfrequency', 'array', 'lofar', 'and', 'westerbork', 'synthesis', 'radio', 'telescope', 'observations', 'between', '20112015', 'we', 'have', 'measured', 'variations', 'in', 'flux', 'density', 'dispersion', 'measure', 'and', 'scattering', 'around', 'eclipses', 'hightimeresolution', 'simultaneous', 'beamformed', 'and', 'interferometric', 'imaging', 'lofar', 'observations', 'show', 'concurrent', 'disappearance', 'of', 'pulsations', 'and', 'total', 'flux', 'from', 'the', 'source', 'during', 'the', 'eclipses', 'with', 'a', '3sigma', 'upper', 'limit', 'of', '36', 'mjy', '10', 'of', 'the', 'pulsars', 'averaged', 'outofeclipse', 'flux', 'density', 'the', 'dispersion', 'measure', 'variations', 'are', 'highly', 'asymmetric', 'suggesting', 'a', 'tail', 'of', 'material', 'swept', 'back', 'due', 'to', 'orbital', 'motion', 'the', 'egress', 'deviations', 'are', 'variable', 'on', 'timescales', 'shorter', 'than', 'the', '36', 'hr', 'orbital', 'period', 'and', 'are', 'indicative', 'of', 'a', 'clumpy', 'medium', 'additional', 'pulse', 'broadening', 'detected', 'during', 'egress', 'is', 'typically', '20', 'of', 'the', 'pulsars', 'spin', 'period', 'showing', 'no', 'evidence', 'of', 'scattering', 'the', 'pulses', 'beyond', 'detectability', 'in', 'the', 'beamformed', 'data', 'the', 'eclipses', 'lasting', 'sim13', 'of', 'the', 'orbit', 'at', '149', 'mhz', 'are', 'shown', 'to', 'be', 'frequencydependent', 'with', 'total', 'duration', 'scaling', 'as', 'proptonu041pm003', 'the', 'results', 'are', 'discussed', 'in', 'the', 'context', 'of', 'the', 'physical', 'parameters', 'of', 'the', 'system', 'and', 'an', 'examination', 'of', 'eclipse', 'mechanisms', 'reveals', 'cyclotronsynchrotron', 'absorption', 'as', 'the', 'most', 'likely', 'primary', 'cause', 'although', 'nonlinear', 'scattering', 'mechanisms', 'can', 'not', 'be', 'quantitatively', 'ruled', 'out', 'the', 'inferred', 'mass', 'loss', 'rate', 'is', 'a', 'similar', 'orderofmagnitude', 'to', 'the', 'mean', 'rate', 'required', 'to', 'fully', 'evaporate', 'the', 'companion', 'in', 'a', 'hubble', 'time']] | [-0.15559559888750035, 0.15238591337671129, -0.06326997555414879, 0.10101323025834455, -0.09106593690340772, -0.09053844764689188, 0.08380819690177352, 0.4371765210838898, -0.2015207065941175, -0.3576038034496434, 0.13078472742843925, -0.2991034943202207, -0.06368400000798873, 0.2350253827935536, -0.03888644152300408, -0.0031291276831213193, 0.09534391517533473, -0.06694153383874749, -0.0562680206125159, -0.19196008691416247, 0.19841174789425395, 0.11661359930968954, 0.1744857634673365, 0.00015493601484691913, 0.06543355369796804, -0.04598645238505291, -0.08399502534161851, -0.05946752169304876, -0.07798889604507891, 0.010171725037241034, 0.23181175931084014, 0.0898856340973158, 0.1465572514673818, -0.39396552545929303, -0.23605047112191302, 0.06073833661650601, 0.1404036324782018, 0.01762472897448007, 0.020788408850221218, -0.2819806829547214, 0.02217393878556066, -0.18290691681632912, -0.1661680480239642, 0.06653584305213411, 0.0915466308273736, 0.04470190216093796, -0.20838369081198907, 0.13593219140429658, 0.008001216095313225, 0.09848901186082491, -0.15983608115099304, -0.10552319326275951, -0.04198871486428469, 0.0536317543520506, 0.0752591840830008, 0.04930875572634426, 0.14636140511194778, -0.07918452779610645, -0.06488850931606219, 0.34642390203600676, -0.11533170106590239, 0.0011314771616101134, 0.1730659928071284, -0.24792869683839217, -0.12293704949516295, 0.2614028371689997, 0.16424268437754608, 0.06464230040465749, -0.1664646331483441, -0.04605213732477626, 0.02214973068812509, 0.2775487756594556, 0.11288632725115193, 0.09861047171817329, 0.34950211810820947, 0.13848558807666597, 0.028660139349999014, 0.09894475643266616, -0.2955912940505695, -0.017495191354501484, -0.2268812423079615, -0.029623116840432, -0.13161226374298202, 0.09525213550499564, -0.09572598416649784, -0.09967114215566457, 0.37409964525386985, 0.12128956938605542, 0.18171220717003922, 0.05437335087958772, 0.3070981954860333, 0.14948427740644482, 0.08806641619728924, 0.10474378620541043, 0.33747581303291974, 0.1683347170427852, 0.12417499423396286, -0.25024949958945913, 0.09357991292744482, -0.05876724433363108] |
1,802.02595 | Unsupervised Typography Transfer | Traditional methods in Chinese typography synthesis view characters as an
assembly of radicals and strokes, but they rely on manual definition of the key
points, which is still time-costing. Some recent work on computer vision
proposes a brand new approach: to treat every Chinese character as an
independent and inseparable image, so the pre-processing and post-processing of
each character can be avoided. Then with a combination of a transfer network
and a discriminating network, one typography can be well transferred to
another. Despite the quite satisfying performance of the model, the training
process requires to be supervised, which means in the training data each
character in the source domain and the target domain needs to be perfectly
paired. Sometimes the pairing is time-costing, and sometimes there is no
perfect pairing, such as the pairing between traditional Chinese and simplified
Chinese characters. In this paper, we proposed an unsupervised typography
transfer method which doesn't need pairing.
| cs.CV | traditional methods in chinese typography synthesis view characters as an assembly of radicals and strokes but they rely on manual definition of the key points which is still timecosting some recent work on computer vision proposes a brand new approach to treat every chinese character as an independent and inseparable image so the preprocessing and postprocessing of each character can be avoided then with a combination of a transfer network and a discriminating network one typography can be well transferred to another despite the quite satisfying performance of the model the training process requires to be supervised which means in the training data each character in the source domain and the target domain needs to be perfectly paired sometimes the pairing is timecosting and sometimes there is no perfect pairing such as the pairing between traditional chinese and simplified chinese characters in this paper we proposed an unsupervised typography transfer method which doesnt need pairing | [['traditional', 'methods', 'in', 'chinese', 'typography', 'synthesis', 'view', 'characters', 'as', 'an', 'assembly', 'of', 'radicals', 'and', 'strokes', 'but', 'they', 'rely', 'on', 'manual', 'definition', 'of', 'the', 'key', 'points', 'which', 'is', 'still', 'timecosting', 'some', 'recent', 'work', 'on', 'computer', 'vision', 'proposes', 'a', 'brand', 'new', 'approach', 'to', 'treat', 'every', 'chinese', 'character', 'as', 'an', 'independent', 'and', 'inseparable', 'image', 'so', 'the', 'preprocessing', 'and', 'postprocessing', 'of', 'each', 'character', 'can', 'be', 'avoided', 'then', 'with', 'a', 'combination', 'of', 'a', 'transfer', 'network', 'and', 'a', 'discriminating', 'network', 'one', 'typography', 'can', 'be', 'well', 'transferred', 'to', 'another', 'despite', 'the', 'quite', 'satisfying', 'performance', 'of', 'the', 'model', 'the', 'training', 'process', 'requires', 'to', 'be', 'supervised', 'which', 'means', 'in', 'the', 'training', 'data', 'each', 'character', 'in', 'the', 'source', 'domain', 'and', 'the', 'target', 'domain', 'needs', 'to', 'be', 'perfectly', 'paired', 'sometimes', 'the', 'pairing', 'is', 'timecosting', 'and', 'sometimes', 'there', 'is', 'no', 'perfect', 'pairing', 'such', 'as', 'the', 'pairing', 'between', 'traditional', 'chinese', 'and', 'simplified', 'chinese', 'characters', 'in', 'this', 'paper', 'we', 'proposed', 'an', 'unsupervised', 'typography', 'transfer', 'method', 'which', 'doesnt', 'need', 'pairing']] | [-0.05346298911528863, 0.052223865370501256, -0.11455792735872511, 0.07978876969696251, -0.13997467607868458, -0.16111713950978776, 0.040830356331414304, 0.4011787485355645, -0.3280332062874306, -0.30451795077134, 0.07311522273432, -0.236849947126424, -0.15603455375983483, 0.22086497927480225, -0.1352908873102731, 0.004198732877947585, 0.11014319885996919, 0.05747423637536616, -0.057241412492170685, -0.2561464463482349, 0.33069024496450045, 0.04076958435977158, 0.3371599767284066, 0.022004650683550078, 0.08260729767799109, 0.002543914921618268, -0.0040608112414190975, -0.04015948440958715, -0.014042552240996384, 0.1500966491020175, 0.3231025860748357, 0.14654894168156746, 0.2893864291239213, -0.41709165769881035, -0.198677986275916, 0.12835969892482646, 0.15777201462366613, 0.13848503903726275, -0.03477801983640377, -0.2947323046886405, 0.07264700290302631, -0.20796565300925007, 0.00024813550579197267, -0.11179584559369711, -0.017748107515835488, -0.020447664629375816, -0.2745601713164326, 0.01036566401850067, 0.12623214744277955, 0.09129661813627904, -0.047701609623770604, -0.11553021413852381, 0.015118324885668319, 0.20204020378003323, 0.052558436199035066, 0.0658313974500725, 0.08802550347496031, -0.18396018678474613, -0.12580662890446975, 0.39915419757074, -0.022770728611576013, -0.22865954498011692, 0.21276718897370658, -0.029990079531178267, -0.11106514842614677, 0.08709220327338009, 0.12512278713109398, 0.1028219390655959, -0.14323722330019795, 0.028346562691510722, -0.048368731921453495, 0.2213807544348384, 0.07249118184086446, -0.02164090187760569, 0.20142639673115637, 0.20139839959154332, 0.03810884294045322, 0.12168228813124443, -0.09782932671639168, -0.04497529085713372, -0.25615438449141736, -0.16717905556331114, -0.23804865152958563, 0.01491947189959533, -0.024529556254647044, -0.18236892081772774, 0.3923648352402999, 0.14414364048979836, 0.19870610387228868, 0.011383627796259533, 0.3179708965962716, 0.06288499887987022, 0.12616297611327587, 0.07266067118943954, 0.14914894719806718, 0.014803876074676226, 0.10370220123406719, -0.152645392955153, 0.10446166527515363, 0.06465169536010697] |
1,802.02596 | Multipartite entanglement in spin chains and the Hyperdeterminant | A way to characterize multipartite entanglement in pure states of a spin
chain with $n$ sites and local dimension $d$ is by means of the Cayley
hyperdeterminant. The latter quantity is a polynomial constructed with the
components of the wave function $\psi_{i_1, \dots, i_n}$ which is invariant
under local unitary transformation. For spin 1/2 chains (i.e. $d=2$) with $n=2$
and $n=3$ sites, the hyperdeterminant coincides with the concurrence and the
tangle respectively. In this paper we consider spin chains with $n=4$ sites
where the hyperdeterminant is a polynomial of degree 24 containing around $2.8
\times 10^6$ terms. This huge object can be written in terms of more simple
polynomials $S$ and $T$ of degrees 8 and 12 respectively. In this paper we
compute $S$, $T$ and the hyperdeterminant for eigenstates of the following spin
chain Hamiltonians: the transverse Ising model, the XXZ Heisenberg model and
the Haldane-Shastry model. Those invariants are also computed for random
states, the ground states of random matrix Hamiltonians in the Wigner-Dyson
Gaussian ensembles and the quadripartite entangled states defined by Verstraete
et al. in 2002. Finally, we propose a generalization of the hyperdeterminant to
thermal density matrices. We observe how these polynomials are able to capture
the phase transitions present in the models studied as well as a subclass of
quadripartite entanglement present in the eigenstates.
| quant-ph cond-mat.stat-mech hep-th | a way to characterize multipartite entanglement in pure states of a spin chain with n sites and local dimension d is by means of the cayley hyperdeterminant the latter quantity is a polynomial constructed with the components of the wave function psi_i_1 dots i_n which is invariant under local unitary transformation for spin 12 chains ie d2 with n2 and n3 sites the hyperdeterminant coincides with the concurrence and the tangle respectively in this paper we consider spin chains with n4 sites where the hyperdeterminant is a polynomial of degree 24 containing around 28 times 106 terms this huge object can be written in terms of more simple polynomials s and t of degrees 8 and 12 respectively in this paper we compute s t and the hyperdeterminant for eigenstates of the following spin chain hamiltonians the transverse ising model the xxz heisenberg model and the haldaneshastry model those invariants are also computed for random states the ground states of random matrix hamiltonians in the wignerdyson gaussian ensembles and the quadripartite entangled states defined by verstraete et al in 2002 finally we propose a generalization of the hyperdeterminant to thermal density matrices we observe how these polynomials are able to capture the phase transitions present in the models studied as well as a subclass of quadripartite entanglement present in the eigenstates | [['a', 'way', 'to', 'characterize', 'multipartite', 'entanglement', 'in', 'pure', 'states', 'of', 'a', 'spin', 'chain', 'with', 'n', 'sites', 'and', 'local', 'dimension', 'd', 'is', 'by', 'means', 'of', 'the', 'cayley', 'hyperdeterminant', 'the', 'latter', 'quantity', 'is', 'a', 'polynomial', 'constructed', 'with', 'the', 'components', 'of', 'the', 'wave', 'function', 'psi_i_1', 'dots', 'i_n', 'which', 'is', 'invariant', 'under', 'local', 'unitary', 'transformation', 'for', 'spin', '12', 'chains', 'ie', 'd2', 'with', 'n2', 'and', 'n3', 'sites', 'the', 'hyperdeterminant', 'coincides', 'with', 'the', 'concurrence', 'and', 'the', 'tangle', 'respectively', 'in', 'this', 'paper', 'we', 'consider', 'spin', 'chains', 'with', 'n4', 'sites', 'where', 'the', 'hyperdeterminant', 'is', 'a', 'polynomial', 'of', 'degree', '24', 'containing', 'around', '28', 'times', '106', 'terms', 'this', 'huge', 'object', 'can', 'be', 'written', 'in', 'terms', 'of', 'more', 'simple', 'polynomials', 's', 'and', 't', 'of', 'degrees', '8', 'and', '12', 'respectively', 'in', 'this', 'paper', 'we', 'compute', 's', 't', 'and', 'the', 'hyperdeterminant', 'for', 'eigenstates', 'of', 'the', 'following', 'spin', 'chain', 'hamiltonians', 'the', 'transverse', 'ising', 'model', 'the', 'xxz', 'heisenberg', 'model', 'and', 'the', 'haldaneshastry', 'model', 'those', 'invariants', 'are', 'also', 'computed', 'for', 'random', 'states', 'the', 'ground', 'states', 'of', 'random', 'matrix', 'hamiltonians', 'in', 'the', 'wignerdyson', 'gaussian', 'ensembles', 'and', 'the', 'quadripartite', 'entangled', 'states', 'defined', 'by', 'verstraete', 'et', 'al', 'in', '2002', 'finally', 'we', 'propose', 'a', 'generalization', 'of', 'the', 'hyperdeterminant', 'to', 'thermal', 'density', 'matrices', 'we', 'observe', 'how', 'these', 'polynomials', 'are', 'able', 'to', 'capture', 'the', 'phase', 'transitions', 'present', 'in', 'the', 'models', 'studied', 'as', 'well', 'as', 'a', 'subclass', 'of', 'quadripartite', 'entanglement', 'present', 'in', 'the', 'eigenstates']] | [-0.1615564207399571, 0.22691329936496912, 0.0022650442297824404, 0.040107039248422634, 0.05620681860124354, -0.16634106554768302, 0.013188460644927215, 0.3389559893445535, -0.2339204116142355, -0.2726563718783754, 0.06769095909548924, -0.3077378685173409, -0.12450953729514203, 0.10956129113487391, 0.0046592824592318555, 0.05356342024593191, 0.023231648371703075, 0.05760152085303244, -0.10863397708162666, -0.27012588558824396, 0.2856535711833699, -0.0017418392383578148, 0.21741170387884431, 0.023327438788096927, 0.08940315584821457, 0.035511713690886446, 0.051356195798143746, -0.03328682538545267, -0.14056347213653764, 0.09718072464278191, 0.24980020887843155, 0.07485861109400338, 0.1335190124259415, -0.38395593251440335, -0.1433442061216655, 0.15115552553272044, 0.13607222172219985, 0.12851870842754248, 0.058490035071934635, -0.2914566474374045, 0.028696848872244697, -0.19605245977191688, -0.15776316922327335, -0.08484406874578615, 0.06935312494381585, -0.008479412645101547, -0.28242537829897957, 0.11533562101161475, 0.08708530743235976, 0.07608249309421146, 0.011381543007023124, -0.1161057926222301, -0.03988788877084682, 0.07436879784535531, -0.04001599248837341, 0.03876036891967736, 0.06969599643806842, -0.09690841864318248, -0.17671335114970466, 0.33863792099185624, -0.06161990463442635, -0.21476292151280424, 0.15374722008551048, -0.1552126111145216, -0.1581687473543835, 0.0686094875595617, 0.09709936456056312, 0.13916758832691067, -0.13441176056036386, 0.12197472234044901, -0.07653828274018121, 0.13908555053428492, 0.057182005866938695, 0.059928914859086614, 0.15467927320331165, 0.060201507819477806, 0.06372610458608753, 0.2287577421864791, -0.06098045088160275, -0.12392639379488007, -0.27840381685263393, -0.18812547147443348, -0.23974306671351026, 0.11532983192135526, -0.11463581831511957, -0.1360029310199686, 0.45594520345488987, 0.08479302898023723, 0.20980360140516, 0.07629849534026686, 0.15834334581159054, 0.11522920532892882, 0.02783291745422916, 0.10174848909161731, 0.1471070081164891, 0.21114967948100952, 0.03975602902302688, -0.2106982915823623, 0.0013512553488412365, 0.11405916322678836] |
1,802.02597 | Constructing three-dimensional photonic topological insulator using
two-dimensional ring resonator lattice with a synthetic frequency dimension | In the development of topological photonics, achieving three dimensional
topological insulators is of significant interest since it enables the
exploration of new topological physics with photons, and promises novel
photonic devices that are robust against disorders in three dimensions.
Previous theoretical proposals towards three dimensional topological insulators
utilize complex geometries that are challenging to implement. Here, based on
the concept of synthetic dimension, we show that a two-dimensional array of
ring resonators, which was previously demonstrated to exhibit a two-dimensional
topological insulator phase, in fact automatically becomes a three-dimensional
topological insulator, when the frequency dimension is taken into account.
Moreover, by modulating a few of the resonators, a screw dislocation along the
frequency axis can be created, which provides robust transport of photons along
the frequency axis. Demonstrating the physics of screw dislocation in a
topological system has been a significant challenge in solid state systems. Our
work indicates that the physics of three-dimensional topological insulator can
be explored in standard integrated photonics platforms, leading to
opportunities for novel devices that control the frequency of light.
| physics.optics | in the development of topological photonics achieving three dimensional topological insulators is of significant interest since it enables the exploration of new topological physics with photons and promises novel photonic devices that are robust against disorders in three dimensions previous theoretical proposals towards three dimensional topological insulators utilize complex geometries that are challenging to implement here based on the concept of synthetic dimension we show that a twodimensional array of ring resonators which was previously demonstrated to exhibit a twodimensional topological insulator phase in fact automatically becomes a threedimensional topological insulator when the frequency dimension is taken into account moreover by modulating a few of the resonators a screw dislocation along the frequency axis can be created which provides robust transport of photons along the frequency axis demonstrating the physics of screw dislocation in a topological system has been a significant challenge in solid state systems our work indicates that the physics of threedimensional topological insulator can be explored in standard integrated photonics platforms leading to opportunities for novel devices that control the frequency of light | [['in', 'the', 'development', 'of', 'topological', 'photonics', 'achieving', 'three', 'dimensional', 'topological', 'insulators', 'is', 'of', 'significant', 'interest', 'since', 'it', 'enables', 'the', 'exploration', 'of', 'new', 'topological', 'physics', 'with', 'photons', 'and', 'promises', 'novel', 'photonic', 'devices', 'that', 'are', 'robust', 'against', 'disorders', 'in', 'three', 'dimensions', 'previous', 'theoretical', 'proposals', 'towards', 'three', 'dimensional', 'topological', 'insulators', 'utilize', 'complex', 'geometries', 'that', 'are', 'challenging', 'to', 'implement', 'here', 'based', 'on', 'the', 'concept', 'of', 'synthetic', 'dimension', 'we', 'show', 'that', 'a', 'twodimensional', 'array', 'of', 'ring', 'resonators', 'which', 'was', 'previously', 'demonstrated', 'to', 'exhibit', 'a', 'twodimensional', 'topological', 'insulator', 'phase', 'in', 'fact', 'automatically', 'becomes', 'a', 'threedimensional', 'topological', 'insulator', 'when', 'the', 'frequency', 'dimension', 'is', 'taken', 'into', 'account', 'moreover', 'by', 'modulating', 'a', 'few', 'of', 'the', 'resonators', 'a', 'screw', 'dislocation', 'along', 'the', 'frequency', 'axis', 'can', 'be', 'created', 'which', 'provides', 'robust', 'transport', 'of', 'photons', 'along', 'the', 'frequency', 'axis', 'demonstrating', 'the', 'physics', 'of', 'screw', 'dislocation', 'in', 'a', 'topological', 'system', 'has', 'been', 'a', 'significant', 'challenge', 'in', 'solid', 'state', 'systems', 'our', 'work', 'indicates', 'that', 'the', 'physics', 'of', 'threedimensional', 'topological', 'insulator', 'can', 'be', 'explored', 'in', 'standard', 'integrated', 'photonics', 'platforms', 'leading', 'to', 'opportunities', 'for', 'novel', 'devices', 'that', 'control', 'the', 'frequency', 'of', 'light']] | [-0.1745066490177785, 0.1867887439121577, -0.06688164648684589, -0.03240853774927514, -0.07776066020596772, -0.1842181482855019, 0.009861572499920096, 0.41466456872876734, -0.22416986537229439, -0.27562800799073145, 0.05677331958114254, -0.25842430725407955, -0.1823259354516102, 0.25362783300013025, -0.04209719404319789, 0.09557649269911715, -0.0058831649155101995, -0.0671063347796338, -0.062705377725334, -0.2071763038137843, 0.27210334325321706, -0.01743530334417962, 0.3712069258617703, 0.07058153602569787, 0.06636703365604096, -0.05450611683905167, 0.04208433306617239, 0.04779028483409837, -0.09841725566899516, 0.13631998048036953, 0.26944246101828123, -0.023266003489631905, 0.2486535975476727, -0.4585717953797774, -0.27649670001251664, 0.016341427129439333, 0.1428616887212477, 0.1489388635104247, -0.12457432363788196, -0.3296154651325196, 0.07456247201083567, -0.1597410476639528, -0.11898767801027464, -0.11851406727708474, 0.03652409676578827, -0.06599287132319825, -0.19998829582155767, 0.020344396621856668, 0.05421592733447059, 0.061250031231214634, -0.038136039349410567, -0.05139551595956701, -0.06386272799070204, 0.09146228745339613, -0.009705319648756731, 0.027493590000217824, 0.1091970523038154, -0.12011178046445407, -0.20920628008157524, 0.4161092910270037, 0.006379675013952444, -0.15883865795066496, 0.21194320741845082, -0.13270540213984947, -0.09391998130277815, 0.15661259825256738, 0.19180131200648082, 0.05414132627001064, -0.10777384384222057, 0.08661293709056653, -0.0070680087876760144, 0.19214527661626396, 0.0013491615563080732, 0.10368841677501967, 0.2974642150485041, 0.23105544584607493, 0.07761584294299113, 0.18065578989097214, -0.10298430158815625, -0.07076608588580381, -0.23311573613054035, -0.23329554668849928, -0.2350360382697545, 0.05678632446903397, -0.0380436734464886, -0.18578756042800457, 0.44583344512449746, 0.1793921514677508, 0.14937949858457697, -0.05693416743518107, 0.30630366856613284, 0.08385808237918271, 0.10407522426579487, 0.021021356906699526, 0.2631410636743319, 0.1248061894558222, 0.09304472233105282, -0.18334028183942958, 0.001990727097356946, 0.031555122344467564] |
1,802.02598 | Generating Triples with Adversarial Networks for Scene Graph
Construction | Driven by successes in deep learning, computer vision research has begun to
move beyond object detection and image classification to more sophisticated
tasks like image captioning or visual question answering. Motivating such
endeavors is the desire for models to capture not only objects present in an
image, but more fine-grained aspects of a scene such as relationships between
objects and their attributes. Scene graphs provide a formal construct for
capturing these aspects of an image. Despite this, there have been only a few
recent efforts to generate scene graphs from imagery. Previous works limit
themselves to settings where bounding box information is available at train
time and do not attempt to generate scene graphs with attributes. In this paper
we propose a method, based on recent advancements in Generative Adversarial
Networks, to overcome these deficiencies. We take the approach of first
generating small subgraphs, each describing a single statement about a scene
from a specific region of the input image chosen using an attention mechanism.
By doing so, our method is able to produce portions of the scene graphs with
attribute information without the need for bounding box labels. Then, the
complete scene graph is constructed from these subgraphs. We show that our
model improves upon prior work in scene graph generation on state-of-the-art
data sets and accepted metrics. Further, we demonstrate that our model is
capable of handling a larger vocabulary size than prior work has attempted.
| cs.CV | driven by successes in deep learning computer vision research has begun to move beyond object detection and image classification to more sophisticated tasks like image captioning or visual question answering motivating such endeavors is the desire for models to capture not only objects present in an image but more finegrained aspects of a scene such as relationships between objects and their attributes scene graphs provide a formal construct for capturing these aspects of an image despite this there have been only a few recent efforts to generate scene graphs from imagery previous works limit themselves to settings where bounding box information is available at train time and do not attempt to generate scene graphs with attributes in this paper we propose a method based on recent advancements in generative adversarial networks to overcome these deficiencies we take the approach of first generating small subgraphs each describing a single statement about a scene from a specific region of the input image chosen using an attention mechanism by doing so our method is able to produce portions of the scene graphs with attribute information without the need for bounding box labels then the complete scene graph is constructed from these subgraphs we show that our model improves upon prior work in scene graph generation on stateoftheart data sets and accepted metrics further we demonstrate that our model is capable of handling a larger vocabulary size than prior work has attempted | [['driven', 'by', 'successes', 'in', 'deep', 'learning', 'computer', 'vision', 'research', 'has', 'begun', 'to', 'move', 'beyond', 'object', 'detection', 'and', 'image', 'classification', 'to', 'more', 'sophisticated', 'tasks', 'like', 'image', 'captioning', 'or', 'visual', 'question', 'answering', 'motivating', 'such', 'endeavors', 'is', 'the', 'desire', 'for', 'models', 'to', 'capture', 'not', 'only', 'objects', 'present', 'in', 'an', 'image', 'but', 'more', 'finegrained', 'aspects', 'of', 'a', 'scene', 'such', 'as', 'relationships', 'between', 'objects', 'and', 'their', 'attributes', 'scene', 'graphs', 'provide', 'a', 'formal', 'construct', 'for', 'capturing', 'these', 'aspects', 'of', 'an', 'image', 'despite', 'this', 'there', 'have', 'been', 'only', 'a', 'few', 'recent', 'efforts', 'to', 'generate', 'scene', 'graphs', 'from', 'imagery', 'previous', 'works', 'limit', 'themselves', 'to', 'settings', 'where', 'bounding', 'box', 'information', 'is', 'available', 'at', 'train', 'time', 'and', 'do', 'not', 'attempt', 'to', 'generate', 'scene', 'graphs', 'with', 'attributes', 'in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'based', 'on', 'recent', 'advancements', 'in', 'generative', 'adversarial', 'networks', 'to', 'overcome', 'these', 'deficiencies', 'we', 'take', 'the', 'approach', 'of', 'first', 'generating', 'small', 'subgraphs', 'each', 'describing', 'a', 'single', 'statement', 'about', 'a', 'scene', 'from', 'a', 'specific', 'region', 'of', 'the', 'input', 'image', 'chosen', 'using', 'an', 'attention', 'mechanism', 'by', 'doing', 'so', 'our', 'method', 'is', 'able', 'to', 'produce', 'portions', 'of', 'the', 'scene', 'graphs', 'with', 'attribute', 'information', 'without', 'the', 'need', 'for', 'bounding', 'box', 'labels', 'then', 'the', 'complete', 'scene', 'graph', 'is', 'constructed', 'from', 'these', 'subgraphs', 'we', 'show', 'that', 'our', 'model', 'improves', 'upon', 'prior', 'work', 'in', 'scene', 'graph', 'generation', 'on', 'stateoftheart', 'data', 'sets', 'and', 'accepted', 'metrics', 'further', 'we', 'demonstrate', 'that', 'our', 'model', 'is', 'capable', 'of', 'handling', 'a', 'larger', 'vocabulary', 'size', 'than', 'prior', 'work', 'has', 'attempted']] | [-0.02024619895064843, 0.004957823160761369, -0.06238166003159302, 0.055668258368421125, -0.1620239608181531, -0.1367851054773298, 0.03139095932407649, 0.4671875743993691, -0.24571258617401662, -0.377749371586931, 0.06345097556418716, -0.2962131250420773, -0.16301484071324823, 0.18257612389455619, -0.1958906904251575, 0.07141817283587718, 0.13856712231136656, 0.06820311809769154, -0.02518515817296668, -0.26708961676384574, 0.3291104751181233, 0.015241997019938553, 0.2746310739018837, 0.04065485565899676, 0.12033930812432125, -0.031968639087432825, -0.060815300982242, 0.013839590597991683, -0.09199314546203212, 0.18374337116256356, 0.3333957681904906, 0.2165264540064313, 0.3016170887296096, -0.4631148595049852, -0.2863487979013692, 0.12017013206676885, 0.14680096661934175, 0.14498319758978837, -0.06034496384870922, -0.33465963582402614, 0.10186195688736978, -0.15737880997999548, 0.016707884466682536, -0.12937069321520814, 0.037815361774816106, -0.0581809953525232, -0.23873195779008963, -0.01593520086524742, 0.13744234941638575, 0.08091099465110813, -0.007258962888755843, -0.06672747713951942, 0.032833733457481064, 0.21245316072159737, 0.021317377619732937, 0.0683832024928464, 0.12621231350295456, -0.22145448230474038, -0.15326927777011917, 0.39224087263794005, -0.005529565014008202, -0.20859538934764868, 0.19703268466327542, -0.0752917054782332, -0.17801278769410364, 0.10344379977910083, 0.20571777205562078, 0.15420594484253763, -0.14993658083483202, 0.02754561957304499, -0.08011595940240855, 0.19579639950837596, 0.06490273858487074, -0.006394354421097566, 0.22284214697903446, 0.2364268325652708, 0.05024942566304147, 0.1332922380108449, -0.10529869300618518, -0.03745625952861326, -0.20936466712395058, -0.0608252945995377, -0.19362889733674207, -0.019134071292018152, -0.07358410178479238, -0.15455127217486, 0.39664607576071087, 0.26986483895879465, 0.25234873401599806, 0.09057414343291033, 0.34560491903802426, -0.007209106126385389, 0.1266395034857423, 0.08058633208431366, 0.1616720546334356, 0.01685848630409093, 0.12146130117720791, -0.08147416290452414, 0.09794276242610067, 0.07820283692768391] |
1,802.02599 | Expression of Interest for Evolution of the Mu2e Experiment | We propose an evolution of the Mu2e experiment, called Mu2e-II, that would
leverage advances in detector technology and utilize the increased proton
intensity provided by the Fermilab PIP-II upgrade to improve the sensitivity
for neutrinoless muon-to-electron conversion by one order of magnitude beyond
the Mu2e experiment, providing the deepest probe of charged lepton flavor
violation in the foreseeable future. Mu2e-II will use as much of the Mu2e
infrastructure as possible, providing, where required, improvements to the Mu2e
apparatus to accommodate the increased beam intensity and cope with the
accompanying increase in backgrounds.
| physics.ins-det hep-ex | we propose an evolution of the mu2e experiment called mu2eii that would leverage advances in detector technology and utilize the increased proton intensity provided by the fermilab pipii upgrade to improve the sensitivity for neutrinoless muontoelectron conversion by one order of magnitude beyond the mu2e experiment providing the deepest probe of charged lepton flavor violation in the foreseeable future mu2eii will use as much of the mu2e infrastructure as possible providing where required improvements to the mu2e apparatus to accommodate the increased beam intensity and cope with the accompanying increase in backgrounds | [['we', 'propose', 'an', 'evolution', 'of', 'the', 'mu2e', 'experiment', 'called', 'mu2eii', 'that', 'would', 'leverage', 'advances', 'in', 'detector', 'technology', 'and', 'utilize', 'the', 'increased', 'proton', 'intensity', 'provided', 'by', 'the', 'fermilab', 'pipii', 'upgrade', 'to', 'improve', 'the', 'sensitivity', 'for', 'neutrinoless', 'muontoelectron', 'conversion', 'by', 'one', 'order', 'of', 'magnitude', 'beyond', 'the', 'mu2e', 'experiment', 'providing', 'the', 'deepest', 'probe', 'of', 'charged', 'lepton', 'flavor', 'violation', 'in', 'the', 'foreseeable', 'future', 'mu2eii', 'will', 'use', 'as', 'much', 'of', 'the', 'mu2e', 'infrastructure', 'as', 'possible', 'providing', 'where', 'required', 'improvements', 'to', 'the', 'mu2e', 'apparatus', 'to', 'accommodate', 'the', 'increased', 'beam', 'intensity', 'and', 'cope', 'with', 'the', 'accompanying', 'increase', 'in', 'backgrounds']] | [-0.01195644944285353, 0.19273969211709402, 0.0026616320479661225, 0.08970969851232237, -0.0677127682345195, -0.1315247306102214, 0.020966683100495074, 0.3091509501139323, -0.1839431453599698, -0.3696167646234648, 0.07398092867030452, -0.31994536543885865, -0.001529001773128079, 0.18059794339092655, -0.021662767593645386, 0.10010401068462266, 0.06868609079263277, -0.030577439468147026, -0.0799388010520488, -0.221227975613955, 0.19996370866687763, 0.24598430297854873, 0.3136979880535768, 0.11364904209880883, 0.1137207753620007, -0.0166494264267385, -0.07547925065995918, -0.07397031888572705, -0.09315122134551833, 0.1108081308245245, 0.30533993736219905, 0.21472101071590766, 0.16784680328435367, -0.4802934698760509, -0.13191226782898108, 0.15588392564612957, 0.14181266921675867, 0.05811989579298016, -0.09187932847093584, -0.3152647496718499, 0.058317546144826336, -0.23845216848163142, -0.21510830990866656, -0.0518558475551092, -0.03826033192065855, -0.018168849704994095, -0.29953484831041555, -0.055494385802497465, -0.025538405103402006, 0.019100676368301112, 0.037284946824527446, -0.1586926900057329, 0.07532270970857806, 0.07748849092103127, 0.0763587085058033, 0.10837542866356671, 0.16850068078686795, -0.17046971516683698, -0.17791463658213616, 0.36273943417602117, -0.0757808578472274, -0.10351532888081338, 0.12422291210645603, -0.23801769715371646, -0.09067931232146091, 0.13255286127742794, 0.21296782361136543, -0.015560610284511413, -0.15930265311358704, 0.052674680755525415, 0.06051074956647224, 0.20165668982598517, 0.08526478257651131, 0.07415062444181078, 0.22299853339791298, 0.31678059117661583, 0.1634082987594108, 0.09779657965732945, -0.148205243371841, 0.005017324820962838, -0.36621237293196224, -0.17445906724573837, -0.09461188641273313, 0.025043085496872664, 0.038117542309596, -0.026786450006895595, 0.37983374301758077, 0.21208578969558908, 0.1358932764062451, -0.04136914598703798, 0.34121207824597755, 0.02903361809698658, 0.1238109920380844, -0.05615092144451207, 0.34533288031816484, 0.07576937783612973, 0.2160594104271796, -0.2848448197253876, 0.05743865931613578, 0.003730822013070186] |
1,802.026 | Landau theory for magnetic and structural transitions in
CeCo$_{0.85}$Fe$_{0.15}$Si | We present a phenomenological analysis of the magnetoelastic properties of
CeCo$_{0.85}$Fe$_{0.15}$Si at temperatures close to the N\'eel transition
temperature $T_N$. Using a Landau functional we provide a qualitative
description of the thermal expansion, magnetostriction, magnetization and
specific heat data. We show that the available experimental results [Journal of
Physics: Condensed Matter 28 346003 (2016)] are consistent with the presence of
a structural transition at $T_s\gtrsim T_N$ and a strong magnetoelastic
coupling. The magnetoelastic coupling presents a Janus-faced effect: while the
structural transition is shifted to higher temperatures as the magnetic field
is increased, the resulting striction at low temperatures decreases. The strong
magnetoelastic coupling and the proximity of the structural transition to the
onset temperature for magnetic fluctuations, suggest that the transition could
be an analogue of the tetragonal to orthorhombic observed in Fe-based
pcnictides.
| cond-mat.str-el | we present a phenomenological analysis of the magnetoelastic properties of ceco_085fe_015si at temperatures close to the neel transition temperature t_n using a landau functional we provide a qualitative description of the thermal expansion magnetostriction magnetization and specific heat data we show that the available experimental results journal of physics condensed matter 28 346003 2016 are consistent with the presence of a structural transition at t_sgtrsim t_n and a strong magnetoelastic coupling the magnetoelastic coupling presents a janusfaced effect while the structural transition is shifted to higher temperatures as the magnetic field is increased the resulting striction at low temperatures decreases the strong magnetoelastic coupling and the proximity of the structural transition to the onset temperature for magnetic fluctuations suggest that the transition could be an analogue of the tetragonal to orthorhombic observed in febased pcnictides | [['we', 'present', 'a', 'phenomenological', 'analysis', 'of', 'the', 'magnetoelastic', 'properties', 'of', 'ceco_085fe_015si', 'at', 'temperatures', 'close', 'to', 'the', 'neel', 'transition', 'temperature', 't_n', 'using', 'a', 'landau', 'functional', 'we', 'provide', 'a', 'qualitative', 'description', 'of', 'the', 'thermal', 'expansion', 'magnetostriction', 'magnetization', 'and', 'specific', 'heat', 'data', 'we', 'show', 'that', 'the', 'available', 'experimental', 'results', 'journal', 'of', 'physics', 'condensed', 'matter', '28', '346003', '2016', 'are', 'consistent', 'with', 'the', 'presence', 'of', 'a', 'structural', 'transition', 'at', 't_sgtrsim', 't_n', 'and', 'a', 'strong', 'magnetoelastic', 'coupling', 'the', 'magnetoelastic', 'coupling', 'presents', 'a', 'janusfaced', 'effect', 'while', 'the', 'structural', 'transition', 'is', 'shifted', 'to', 'higher', 'temperatures', 'as', 'the', 'magnetic', 'field', 'is', 'increased', 'the', 'resulting', 'striction', 'at', 'low', 'temperatures', 'decreases', 'the', 'strong', 'magnetoelastic', 'coupling', 'and', 'the', 'proximity', 'of', 'the', 'structural', 'transition', 'to', 'the', 'onset', 'temperature', 'for', 'magnetic', 'fluctuations', 'suggest', 'that', 'the', 'transition', 'could', 'be', 'an', 'analogue', 'of', 'the', 'tetragonal', 'to', 'orthorhombic', 'observed', 'in', 'febased', 'pcnictides']] | [-0.18486959290431632, 0.23636176750246396, -0.048950152755259796, 0.016165359973333272, -0.12778559782195667, -0.0531648342336591, 0.10212641227395183, 0.36344628827296255, -0.2523695963357848, -0.29466156853376924, 0.030308642052639192, -0.3244363013514899, -0.10601297779274839, 0.13775683791705765, 0.07620999825894273, -0.03390955737672914, -0.05524729033389402, 0.03955156562733464, -0.1242806472687779, -0.16881434238144666, 0.2494545219872231, 0.0689429982313256, 0.3091886497550833, 0.13158917862263725, 0.0454113892134265, -0.07611302387571536, 0.15790638599642798, 0.04868268996785234, -0.18737616634429205, 0.039844618760105366, 0.27195710475080387, -0.07158999149932672, 0.1928041158314038, -0.3840802449705009, -0.2148543546760553, 0.005838033062216819, 0.05759008647173755, 0.14786579711380227, -0.08028258815083016, -0.2620716992401539, 0.03839829308112131, -0.1144205095505524, -0.10118721286885272, -0.14583586787636904, -0.03486025567548139, -0.013370963605208308, -0.27872513811265054, 0.16262943546910932, 0.09239445358280204, 0.1474492410477951, -0.1168135496213528, -0.13110523051897385, -0.07253927555411382, 0.058220053889921734, 0.08423437717671793, 0.08538793377959891, 0.1425224832973366, -0.10126245454219836, -0.07260580191080619, 0.3660337174577372, -0.0867499070648188, 0.02147369886156788, 0.19306588916570172, -0.2080948233422368, -0.141854133894597, 0.19487293839412637, 0.1333660342471492, 0.044638773160321374, -0.11760300036897897, 0.06724316172045305, 0.043249091042443774, 0.18983521511869267, 0.020770524155796694, 0.039538682350902854, 0.2532527125405526, 0.20339335461455235, -0.025222271159151217, 0.18889864396979625, -0.10064622386414698, -0.051122122494104714, -0.27452948151674483, -0.12398709379542704, -0.19069749707902284, 0.042257212568949765, -0.14773670475261683, -0.1956492302435121, 0.3478274680954173, 0.1894742688637873, 0.2096906868754921, -0.027323201184924272, 0.22178160430096733, 0.13395960310463534, 0.05202387910882445, 0.04164054195039479, 0.2918868963204016, 0.23281790781766176, 0.1684139582619099, -0.3427758667463983, 0.0787308524446772, 0.013736429669775237] |
1,802.02601 | Digital Watermarking for Deep Neural Networks | Although deep neural networks have made tremendous progress in the area of
multimedia representation, training neural models requires a large amount of
data and time. It is well-known that utilizing trained models as initial
weights often achieves lower training error than neural networks that are not
pre-trained. A fine-tuning step helps to reduce both the computational cost and
improve performance. Therefore, sharing trained models has been very important
for the rapid progress of research and development. In addition, trained models
could be important assets for the owner(s) who trained them, hence we regard
trained models as intellectual property. In this paper, we propose a digital
watermarking technology for ownership authorization of deep neural networks.
First, we formulate a new problem: embedding watermarks into deep neural
networks. We also define requirements, embedding situations, and attack types
on watermarking in deep neural networks. Second, we propose a general framework
for embedding a watermark in model parameters, using a parameter regularizer.
Our approach does not impair the performance of networks into which a watermark
is placed because the watermark is embedded while training the host network.
Finally, we perform comprehensive experiments to reveal the potential of
watermarking deep neural networks as the basis of this new research effort. We
show that our framework can embed a watermark during the training of a deep
neural network from scratch, and during fine-tuning and distilling, without
impairing its performance. The embedded watermark does not disappear even after
fine-tuning or parameter pruning; the watermark remains complete even after 65%
of parameters are pruned.
| cs.CV | although deep neural networks have made tremendous progress in the area of multimedia representation training neural models requires a large amount of data and time it is wellknown that utilizing trained models as initial weights often achieves lower training error than neural networks that are not pretrained a finetuning step helps to reduce both the computational cost and improve performance therefore sharing trained models has been very important for the rapid progress of research and development in addition trained models could be important assets for the owners who trained them hence we regard trained models as intellectual property in this paper we propose a digital watermarking technology for ownership authorization of deep neural networks first we formulate a new problem embedding watermarks into deep neural networks we also define requirements embedding situations and attack types on watermarking in deep neural networks second we propose a general framework for embedding a watermark in model parameters using a parameter regularizer our approach does not impair the performance of networks into which a watermark is placed because the watermark is embedded while training the host network finally we perform comprehensive experiments to reveal the potential of watermarking deep neural networks as the basis of this new research effort we show that our framework can embed a watermark during the training of a deep neural network from scratch and during finetuning and distilling without impairing its performance the embedded watermark does not disappear even after finetuning or parameter pruning the watermark remains complete even after 65 of parameters are pruned | [['although', 'deep', 'neural', 'networks', 'have', 'made', 'tremendous', 'progress', 'in', 'the', 'area', 'of', 'multimedia', 'representation', 'training', 'neural', 'models', 'requires', 'a', 'large', 'amount', 'of', 'data', 'and', 'time', 'it', 'is', 'wellknown', 'that', 'utilizing', 'trained', 'models', 'as', 'initial', 'weights', 'often', 'achieves', 'lower', 'training', 'error', 'than', 'neural', 'networks', 'that', 'are', 'not', 'pretrained', 'a', 'finetuning', 'step', 'helps', 'to', 'reduce', 'both', 'the', 'computational', 'cost', 'and', 'improve', 'performance', 'therefore', 'sharing', 'trained', 'models', 'has', 'been', 'very', 'important', 'for', 'the', 'rapid', 'progress', 'of', 'research', 'and', 'development', 'in', 'addition', 'trained', 'models', 'could', 'be', 'important', 'assets', 'for', 'the', 'owners', 'who', 'trained', 'them', 'hence', 'we', 'regard', 'trained', 'models', 'as', 'intellectual', 'property', 'in', 'this', 'paper', 'we', 'propose', 'a', 'digital', 'watermarking', 'technology', 'for', 'ownership', 'authorization', 'of', 'deep', 'neural', 'networks', 'first', 'we', 'formulate', 'a', 'new', 'problem', 'embedding', 'watermarks', 'into', 'deep', 'neural', 'networks', 'we', 'also', 'define', 'requirements', 'embedding', 'situations', 'and', 'attack', 'types', 'on', 'watermarking', 'in', 'deep', 'neural', 'networks', 'second', 'we', 'propose', 'a', 'general', 'framework', 'for', 'embedding', 'a', 'watermark', 'in', 'model', 'parameters', 'using', 'a', 'parameter', 'regularizer', 'our', 'approach', 'does', 'not', 'impair', 'the', 'performance', 'of', 'networks', 'into', 'which', 'a', 'watermark', 'is', 'placed', 'because', 'the', 'watermark', 'is', 'embedded', 'while', 'training', 'the', 'host', 'network', 'finally', 'we', 'perform', 'comprehensive', 'experiments', 'to', 'reveal', 'the', 'potential', 'of', 'watermarking', 'deep', 'neural', 'networks', 'as', 'the', 'basis', 'of', 'this', 'new', 'research', 'effort', 'we', 'show', 'that', 'our', 'framework', 'can', 'embed', 'a', 'watermark', 'during', 'the', 'training', 'of', 'a', 'deep', 'neural', 'network', 'from', 'scratch', 'and', 'during', 'finetuning', 'and', 'distilling', 'without', 'impairing', 'its', 'performance', 'the', 'embedded', 'watermark', 'does', 'not', 'disappear', 'even', 'after', 'finetuning', 'or', 'parameter', 'pruning', 'the', 'watermark', 'remains', 'complete', 'even', 'after', '65', 'of', 'parameters', 'are', 'pruned']] | [-0.0620046960793843, 0.005707884917683259, -0.06593320944921288, 0.06950704800556196, -0.12050021422783175, -0.2216948093209794, 0.07093446336193665, 0.46225905012033763, -0.2624481208513316, -0.3132848780733184, 0.10566590653570529, -0.23690131686089444, -0.2272822597915365, 0.1664060507901013, -0.17429247218842647, 0.11206563995153829, 0.16378316939471915, 0.028283193075367308, -0.0543375659171943, -0.3494760959307257, 0.3018966835647916, 0.04889950097026485, 0.36557990690289444, 0.03855484420637367, 0.11668160908737946, -0.055207171293659485, -0.00602010255533969, -0.031298195408453466, -0.040228898226331467, 0.16231679380462083, 0.30607657386509857, 0.22651429246343469, 0.3678269246029231, -0.46290442631652695, -0.2818427218162469, 0.15952522362294985, 0.17977314323252358, 0.14195234045882898, -0.050532488516637386, -0.3286686220435513, 0.12287312022817787, -0.1808335075957075, 0.02953691098082345, -0.15634441073507332, -0.034761905581035535, -0.05549576694579628, -0.2657333127453967, -0.013138502943661479, 0.09870590081482078, 0.03705862880269706, -0.028734680773368382, -0.09608733440882133, -0.018763477144602803, 0.17255203347394854, 0.009162218394067168, 0.06823475641067489, 0.13666507174639264, -0.22489046014925407, -0.0966367979167444, 0.33806693901715335, -0.03728452601404797, -0.19324609526483982, 0.1279212298704806, 0.025200502823395254, -0.17134474315844272, 0.09090531784386258, 0.27943490902407575, 0.06777726779182558, -0.17023870819684817, 0.03800286326850255, -0.005995983303364483, 0.2301363233018492, 0.03136779703254433, 0.02968511191397738, 0.17167284714514608, 0.3052069285986363, 0.02067058556713164, 0.1599409746627316, -0.12652417601395882, -0.04741117791763827, -0.21186695584901827, -0.1264597997051169, -0.20340213229428628, 0.012251693443602107, -0.10103625393423954, -0.13609331118550472, 0.40164599522177014, 0.20912284245423507, 0.21944347558292066, 0.1310889673445672, 0.3659109076806999, 0.00819562801370921, 0.19996134724897274, 0.11603491812638822, 0.21291486279551464, 0.005270144256428466, 0.15480207036773663, -0.09698680008807514, 0.13200573450740194, 0.0524819285446938] |
1,802.02602 | A derivative concept with respect to an arbitrary kernel and
applications to fractional calculus | In this paper, we propose a new concept of derivative with respect to an
arbitrary kernel-function. Several properties related to this new operator,
like inversion rules, integration by parts, etc. are studied. In particular, we
introduce the notion of conjugate kernels, which will be useful to guaranty
that the proposed derivative operator admits a right inverse. The proposed
concept includes as special cases Riemann-Liouville fractional derivatives,
Hadamard fractional derivatives, and many other fractional operators. Moreover,
using our concept, new fractional operators involving certain special functions
are introduced, and some of their properties are studied. Finally, an existence
result for a boundary value problem involving the introduced derivative
operator is proved.
| math.CA | in this paper we propose a new concept of derivative with respect to an arbitrary kernelfunction several properties related to this new operator like inversion rules integration by parts etc are studied in particular we introduce the notion of conjugate kernels which will be useful to guaranty that the proposed derivative operator admits a right inverse the proposed concept includes as special cases riemannliouville fractional derivatives hadamard fractional derivatives and many other fractional operators moreover using our concept new fractional operators involving certain special functions are introduced and some of their properties are studied finally an existence result for a boundary value problem involving the introduced derivative operator is proved | [['in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'concept', 'of', 'derivative', 'with', 'respect', 'to', 'an', 'arbitrary', 'kernelfunction', 'several', 'properties', 'related', 'to', 'this', 'new', 'operator', 'like', 'inversion', 'rules', 'integration', 'by', 'parts', 'etc', 'are', 'studied', 'in', 'particular', 'we', 'introduce', 'the', 'notion', 'of', 'conjugate', 'kernels', 'which', 'will', 'be', 'useful', 'to', 'guaranty', 'that', 'the', 'proposed', 'derivative', 'operator', 'admits', 'a', 'right', 'inverse', 'the', 'proposed', 'concept', 'includes', 'as', 'special', 'cases', 'riemannliouville', 'fractional', 'derivatives', 'hadamard', 'fractional', 'derivatives', 'and', 'many', 'other', 'fractional', 'operators', 'moreover', 'using', 'our', 'concept', 'new', 'fractional', 'operators', 'involving', 'certain', 'special', 'functions', 'are', 'introduced', 'and', 'some', 'of', 'their', 'properties', 'are', 'studied', 'finally', 'an', 'existence', 'result', 'for', 'a', 'boundary', 'value', 'problem', 'involving', 'the', 'introduced', 'derivative', 'operator', 'is', 'proved']] | [-0.11792979377467151, 0.081253107532767, -0.041017925581433426, 0.08496197318944465, -0.17433611638929455, -0.10919685412728049, -0.031318528461270034, 0.35348107431664927, -0.3112873207444513, -0.23074303459591838, 0.17707887417722254, -0.25754838963594595, -0.21995067026961698, 0.19816966345875497, -0.12036768503170973, 0.0925101438780751, -0.01737205167258278, 0.03649577199387441, -0.13112061879375453, -0.20091386521961369, 0.38551560177578836, -0.01747391689910528, 0.18811990903399953, 0.07158926007158439, 0.13204003375348286, -0.015544646872429672, -0.07159336620446193, -0.0022925987439087235, -0.14458116318705042, 0.1462898826890907, 0.21459103636059124, 0.057609181842604364, 0.3365664986312526, -0.40077436840110414, -0.18573015044152805, 0.13965755055547444, 0.08349336717499915, 0.0017573244863300832, -0.055234916841423294, -0.30563653863693047, 0.07822629922590808, -0.1775796379180574, -0.18399426721916493, -0.1398090191661816, 0.016666619931646715, 0.02944639466976354, -0.2932396814004954, 0.06544510589980888, 0.07124850690875356, 0.006941575821865042, -0.0658866654816639, -0.15394169305570835, 0.021527142866318107, 0.0479616477248182, 0.02259082083564696, -0.022199091078593917, 0.04051961270887234, -0.07867032045566845, -0.17700881653661849, 0.33543271657694645, -0.0638719331328928, -0.31553551122341134, 0.1323633784505137, -0.11829080410011181, -0.15872773989061012, 0.026298231061179123, 0.11792907421263533, 0.20876613187757448, -0.18746750806073803, 0.10114541572813424, -0.04023031406681301, 0.07560884714587976, 0.108049045457855, 0.09684966381963923, 0.07326829830321287, 0.06847173885715732, 0.14869952984763002, 0.2063658735154137, -0.0038914903378917264, -0.13803115489234755, -0.34995101881854307, -0.21363492474951054, -0.14821041118216896, 0.0024584293956366374, -0.08263804797759203, -0.19548475689365777, 0.4155875826510814, 0.1461136821580521, 0.15562476650325777, 0.04827631134518482, 0.22403302556758217, 0.2498224974319407, 0.0782741988227284, 0.0214067301285718, 0.13773745600558143, 0.156861981216801, 0.13603857000264416, -0.16583824396099245, 0.03815631776056979, 0.16875281267363682] |
1,802.02603 | To Phrase or Not to Phrase - Impact of User versus System Term
Dependence Upon Retrieval | When submitting queries to information retrieval (IR) systems, users often
have the option of specifying which, if any, of the query terms are heavily
dependent on each other and should be treated as a fixed phrase, for instance
by placing them between quotes. In addition to such cases where users specify
term dependence, automatic ways also exist for IR systems to detect dependent
terms in queries. Most IR systems use both user and algorithmic approaches. It
is not however clear whether and to what extent user-defined term dependence
agrees with algorithmic estimates of term dependence, nor which of the two may
fetch higher performance gains. Simply put, is it better to trust users or the
system to detect term dependence in queries? To answer this question, we
experiment with 101 crowdsourced search engine users and 334 queries (52 train
and 282 test TREC queries) and we record 10 assessments per query. We find that
(i) user assessments of term dependence differ significantly from algorithmic
assessments of term dependence (their overlap is approximately 30%); (ii) there
is little agreement among users about term dependence in queries, and this
disagreement increases as queries become longer; (iii) the potential retrieval
gain that can be fetched by treating term dependence (both user- and
system-defined) over a bag of words baseline is reserved to a small subset
(approxi-mately 8%) of the queries, and is much higher for low-depth than deep
preci-sion measures. Points (ii) and (iii) constitute novel insights into term
dependence.
| cs.IR | when submitting queries to information retrieval ir systems users often have the option of specifying which if any of the query terms are heavily dependent on each other and should be treated as a fixed phrase for instance by placing them between quotes in addition to such cases where users specify term dependence automatic ways also exist for ir systems to detect dependent terms in queries most ir systems use both user and algorithmic approaches it is not however clear whether and to what extent userdefined term dependence agrees with algorithmic estimates of term dependence nor which of the two may fetch higher performance gains simply put is it better to trust users or the system to detect term dependence in queries to answer this question we experiment with 101 crowdsourced search engine users and 334 queries 52 train and 282 test trec queries and we record 10 assessments per query we find that i user assessments of term dependence differ significantly from algorithmic assessments of term dependence their overlap is approximately 30 ii there is little agreement among users about term dependence in queries and this disagreement increases as queries become longer iii the potential retrieval gain that can be fetched by treating term dependence both user and systemdefined over a bag of words baseline is reserved to a small subset approximately 8 of the queries and is much higher for lowdepth than deep precision measures points ii and iii constitute novel insights into term dependence | [['when', 'submitting', 'queries', 'to', 'information', 'retrieval', 'ir', 'systems', 'users', 'often', 'have', 'the', 'option', 'of', 'specifying', 'which', 'if', 'any', 'of', 'the', 'query', 'terms', 'are', 'heavily', 'dependent', 'on', 'each', 'other', 'and', 'should', 'be', 'treated', 'as', 'a', 'fixed', 'phrase', 'for', 'instance', 'by', 'placing', 'them', 'between', 'quotes', 'in', 'addition', 'to', 'such', 'cases', 'where', 'users', 'specify', 'term', 'dependence', 'automatic', 'ways', 'also', 'exist', 'for', 'ir', 'systems', 'to', 'detect', 'dependent', 'terms', 'in', 'queries', 'most', 'ir', 'systems', 'use', 'both', 'user', 'and', 'algorithmic', 'approaches', 'it', 'is', 'not', 'however', 'clear', 'whether', 'and', 'to', 'what', 'extent', 'userdefined', 'term', 'dependence', 'agrees', 'with', 'algorithmic', 'estimates', 'of', 'term', 'dependence', 'nor', 'which', 'of', 'the', 'two', 'may', 'fetch', 'higher', 'performance', 'gains', 'simply', 'put', 'is', 'it', 'better', 'to', 'trust', 'users', 'or', 'the', 'system', 'to', 'detect', 'term', 'dependence', 'in', 'queries', 'to', 'answer', 'this', 'question', 'we', 'experiment', 'with', '101', 'crowdsourced', 'search', 'engine', 'users', 'and', '334', 'queries', '52', 'train', 'and', '282', 'test', 'trec', 'queries', 'and', 'we', 'record', '10', 'assessments', 'per', 'query', 'we', 'find', 'that', 'i', 'user', 'assessments', 'of', 'term', 'dependence', 'differ', 'significantly', 'from', 'algorithmic', 'assessments', 'of', 'term', 'dependence', 'their', 'overlap', 'is', 'approximately', '30', 'ii', 'there', 'is', 'little', 'agreement', 'among', 'users', 'about', 'term', 'dependence', 'in', 'queries', 'and', 'this', 'disagreement', 'increases', 'as', 'queries', 'become', 'longer', 'iii', 'the', 'potential', 'retrieval', 'gain', 'that', 'can', 'be', 'fetched', 'by', 'treating', 'term', 'dependence', 'both', 'user', 'and', 'systemdefined', 'over', 'a', 'bag', 'of', 'words', 'baseline', 'is', 'reserved', 'to', 'a', 'small', 'subset', 'approximately', '8', 'of', 'the', 'queries', 'and', 'is', 'much', 'higher', 'for', 'lowdepth', 'than', 'deep', 'precision', 'measures', 'points', 'ii', 'and', 'iii', 'constitute', 'novel', 'insights', 'into', 'term', 'dependence']] | [-0.0774807063390186, 0.041400397969372116, -0.038389819108613346, 0.13006413478577727, -0.16333105396535927, -0.21793403375614812, 0.1408212906624443, 0.398735601228741, -0.2450293487192156, -0.396109106839231, 0.08227046942225232, -0.36664265666632095, -0.09146351076998119, 0.16143636339130107, -0.07262818836739007, -0.012081842712571596, 0.042137727344989294, 0.06154796383334211, -0.07248907633642346, -0.318568418943983, 0.28486008135986474, 0.07054529004333907, 0.25464238580467125, 0.08395464924024607, 0.0670979183208695, 0.0036418465727766757, -0.06350899057892653, 0.01651052548602356, -0.08020091514596348, 0.08613759988677586, 0.3086986448182178, 0.1883658808882269, 0.3012986288487021, -0.37276848412009506, -0.16863988488978568, 0.09056761234561321, 0.16837041269184697, 0.06559596627456728, 0.007816908498830068, -0.27041547723220066, 0.09832205196610663, -0.1863517593743227, 0.006116948532117795, -0.07714797136456769, 0.07324150660893454, 0.013746380661746207, -0.30407879484896566, 0.025141373980740418, 0.04580725421695423, 0.09164727888134146, -0.04361228875416191, -0.09160737541498548, 0.04161878027774107, 0.17005551886108047, 0.07504793403209464, 0.0783922733802175, 0.14243667540969968, -0.13450022799486996, -0.1225438371002825, 0.3928762345917915, -0.06250851722331652, -0.21994055455233827, 0.17876504832475262, -0.11865644508818173, -0.1047921855099733, 0.09985954136630569, 0.15559278012664332, 0.08785532640744763, -0.16316533020372562, 0.023537982060330795, -0.014654335355657617, 0.2742478526338769, 0.10921838023861953, 0.09321956701648232, 0.19223507789485836, 0.1497426912111234, 0.05127041013430623, 0.07530136079822482, -0.02966107556472442, -0.08638462302866977, -0.24160893452363202, -0.10761069102299509, -0.13715913846451594, -0.00115163266551087, -0.13208413115447587, -0.1511439634713265, 0.33810929675032253, 0.19830924104418424, 0.1835132252711516, 0.07837752153369247, 0.27189440179148666, 0.09477149669801145, 0.10118842740196297, 0.10493477752200339, 0.15690338204431947, -0.014349001075182609, 0.1413096790480039, -0.16410975139974598, 0.14062841416257416, 0.0008531681616387145] |
1,802.02604 | An Unsupervised Learning Model for Deformable Medical Image Registration | We present a fast learning-based algorithm for deformable, pairwise 3D
medical image registration. Current registration methods optimize an objective
function independently for each pair of images, which can be time-consuming for
large data. We define registration as a parametric function, and optimize its
parameters given a set of images from a collection of interest. Given a new
pair of scans, we can quickly compute a registration field by directly
evaluating the function using the learned parameters. We model this function
using a convolutional neural network (CNN), and use a spatial transform layer
to reconstruct one image from another while imposing smoothness constraints on
the registration field. The proposed method does not require supervised
information such as ground truth registration fields or anatomical landmarks.
We demonstrate registration accuracy comparable to state-of-the-art 3D image
registration, while operating orders of magnitude faster in practice. Our
method promises to significantly speed up medical image analysis and processing
pipelines, while facilitating novel directions in learning-based registration
and its applications. Our code is available at
https://github.com/balakg/voxelmorph .
| cs.CV | we present a fast learningbased algorithm for deformable pairwise 3d medical image registration current registration methods optimize an objective function independently for each pair of images which can be timeconsuming for large data we define registration as a parametric function and optimize its parameters given a set of images from a collection of interest given a new pair of scans we can quickly compute a registration field by directly evaluating the function using the learned parameters we model this function using a convolutional neural network cnn and use a spatial transform layer to reconstruct one image from another while imposing smoothness constraints on the registration field the proposed method does not require supervised information such as ground truth registration fields or anatomical landmarks we demonstrate registration accuracy comparable to stateoftheart 3d image registration while operating orders of magnitude faster in practice our method promises to significantly speed up medical image analysis and processing pipelines while facilitating novel directions in learningbased registration and its applications our code is available at httpsgithubcombalakgvoxelmorph | [['we', 'present', 'a', 'fast', 'learningbased', 'algorithm', 'for', 'deformable', 'pairwise', '3d', 'medical', 'image', 'registration', 'current', 'registration', 'methods', 'optimize', 'an', 'objective', 'function', 'independently', 'for', 'each', 'pair', 'of', 'images', 'which', 'can', 'be', 'timeconsuming', 'for', 'large', 'data', 'we', 'define', 'registration', 'as', 'a', 'parametric', 'function', 'and', 'optimize', 'its', 'parameters', 'given', 'a', 'set', 'of', 'images', 'from', 'a', 'collection', 'of', 'interest', 'given', 'a', 'new', 'pair', 'of', 'scans', 'we', 'can', 'quickly', 'compute', 'a', 'registration', 'field', 'by', 'directly', 'evaluating', 'the', 'function', 'using', 'the', 'learned', 'parameters', 'we', 'model', 'this', 'function', 'using', 'a', 'convolutional', 'neural', 'network', 'cnn', 'and', 'use', 'a', 'spatial', 'transform', 'layer', 'to', 'reconstruct', 'one', 'image', 'from', 'another', 'while', 'imposing', 'smoothness', 'constraints', 'on', 'the', 'registration', 'field', 'the', 'proposed', 'method', 'does', 'not', 'require', 'supervised', 'information', 'such', 'as', 'ground', 'truth', 'registration', 'fields', 'or', 'anatomical', 'landmarks', 'we', 'demonstrate', 'registration', 'accuracy', 'comparable', 'to', 'stateoftheart', '3d', 'image', 'registration', 'while', 'operating', 'orders', 'of', 'magnitude', 'faster', 'in', 'practice', 'our', 'method', 'promises', 'to', 'significantly', 'speed', 'up', 'medical', 'image', 'analysis', 'and', 'processing', 'pipelines', 'while', 'facilitating', 'novel', 'directions', 'in', 'learningbased', 'registration', 'and', 'its', 'applications', 'our', 'code', 'is', 'available', 'at', 'httpsgithubcombalakgvoxelmorph']] | [-0.015022144360831503, -0.060748586829902584, -0.07516410736058503, 0.05215327915619816, -0.08368588964724859, -0.16178714496926708, 0.005249802032816251, 0.4710391073669555, -0.29114977641791634, -0.36374637377641256, 0.10104073735213007, -0.24513400331712687, -0.14481135392313568, 0.20166434121411844, -0.1308167842189236, 0.14052102946333267, 0.1472198193446463, 0.028632846941962043, -0.13202340746596014, -0.23874828943806375, 0.2583296115147832, 0.013833290574928889, 0.35472012313700024, 0.011016120014095007, 0.16371298951962027, 0.0418721777152755, -0.03322999272495508, -0.015958554269167313, -0.06933827789434226, 0.1761353969816449, 0.3044924927660479, 0.2390553905985445, 0.29005128833514876, -0.4333085100877391, -0.22494805258142173, 0.11092574625226433, 0.15719407901564647, 0.10333472538047839, -0.059937147947838366, -0.3349687867748314, 0.06223231208918495, -0.10828841191898347, -0.011868024669234922, -0.1659335917214582, -0.0561974628238812, -0.011375802727870797, -0.34225153849465695, 0.045975685699638974, 7.580205889077052e-05, 0.06764162696909005, -0.061386114345951634, -0.07566247321527518, 0.0021972279794536223, 0.17451349487280218, 0.010220004154022055, 0.16221379386137114, 0.18382904337465586, -0.22570552126802063, -0.0957176402244254, 0.35755824547546183, -0.04779764957286517, -0.25798674311885644, 0.18722243760244028, -0.038046117388428405, -0.11488498627213684, 0.15712364626354014, 0.22606293101017996, 0.1554029632260549, -0.1666083351471985, -0.002729422461032074, 0.019823497000595377, 0.19942411176375383, 0.047267886898177264, -0.03525979019881959, 0.1936805345911599, 0.2213759236147947, 0.06849006406918785, 0.15176230259225898, -0.20835150354652054, 0.010919735844098251, -0.24115274607936835, -0.14570039641332522, -0.2466667237479416, -0.04602178210210394, -0.12290347493136544, -0.15645258191603748, 0.44098872767441727, 0.22766964116888727, 0.21591773055791413, 0.06370856708877295, 0.4079953550165464, 0.04020022593664912, 0.14889454594730625, 0.06885600260792289, 0.1796397937202727, -0.00924331594619374, 0.09323665332366002, -0.13347507706986597, 0.06295060376036009, 0.08287849198178163] |
1,802.02605 | Unsupervised word sense disambiguation in dynamic semantic spaces | In this paper, we are mainly concerned with the ability to quickly and
automatically distinguish word senses in dynamic semantic spaces in which new
terms and new senses appear frequently. Such spaces are built '"on the fly"
from constantly evolving data sets such as Wikipedia, repositories of patent
grants and applications, or large sets of legal documents for Technology
Assisted Review and e-discovery. This immediacy rules out supervision as well
as the use of a priori training sets. We show that the various senses of a term
can be automatically made apparent with a simple clustering algorithm, each
sense being a vector in the semantic space. While we only consider here
semantic spaces built by using random vectors, this algorithm should work with
any kind of embedding, provided meaningful similarities between terms can be
computed and do fulfill at least the two basic conditions that terms which
close meanings have high similarities and terms with unrelated meanings have
near-zero similarities.
| cs.CL | in this paper we are mainly concerned with the ability to quickly and automatically distinguish word senses in dynamic semantic spaces in which new terms and new senses appear frequently such spaces are built on the fly from constantly evolving data sets such as wikipedia repositories of patent grants and applications or large sets of legal documents for technology assisted review and ediscovery this immediacy rules out supervision as well as the use of a priori training sets we show that the various senses of a term can be automatically made apparent with a simple clustering algorithm each sense being a vector in the semantic space while we only consider here semantic spaces built by using random vectors this algorithm should work with any kind of embedding provided meaningful similarities between terms can be computed and do fulfill at least the two basic conditions that terms which close meanings have high similarities and terms with unrelated meanings have nearzero similarities | [['in', 'this', 'paper', 'we', 'are', 'mainly', 'concerned', 'with', 'the', 'ability', 'to', 'quickly', 'and', 'automatically', 'distinguish', 'word', 'senses', 'in', 'dynamic', 'semantic', 'spaces', 'in', 'which', 'new', 'terms', 'and', 'new', 'senses', 'appear', 'frequently', 'such', 'spaces', 'are', 'built', 'on', 'the', 'fly', 'from', 'constantly', 'evolving', 'data', 'sets', 'such', 'as', 'wikipedia', 'repositories', 'of', 'patent', 'grants', 'and', 'applications', 'or', 'large', 'sets', 'of', 'legal', 'documents', 'for', 'technology', 'assisted', 'review', 'and', 'ediscovery', 'this', 'immediacy', 'rules', 'out', 'supervision', 'as', 'well', 'as', 'the', 'use', 'of', 'a', 'priori', 'training', 'sets', 'we', 'show', 'that', 'the', 'various', 'senses', 'of', 'a', 'term', 'can', 'be', 'automatically', 'made', 'apparent', 'with', 'a', 'simple', 'clustering', 'algorithm', 'each', 'sense', 'being', 'a', 'vector', 'in', 'the', 'semantic', 'space', 'while', 'we', 'only', 'consider', 'here', 'semantic', 'spaces', 'built', 'by', 'using', 'random', 'vectors', 'this', 'algorithm', 'should', 'work', 'with', 'any', 'kind', 'of', 'embedding', 'provided', 'meaningful', 'similarities', 'between', 'terms', 'can', 'be', 'computed', 'and', 'do', 'fulfill', 'at', 'least', 'the', 'two', 'basic', 'conditions', 'that', 'terms', 'which', 'close', 'meanings', 'have', 'high', 'similarities', 'and', 'terms', 'with', 'unrelated', 'meanings', 'have', 'nearzero', 'similarities']] | [-0.048079854330273473, 0.10087343804836976, -0.04661081153196546, 0.10674386723889565, -0.1398400902889417, -0.12512099700460047, 0.05660091887400984, 0.41275260492913285, -0.3088521185014748, -0.3256671310156443, 0.10117013374659813, -0.2884724823429993, -0.18293473332587326, 0.1721840105246483, -0.12071350648846922, 0.02485879250866531, 0.10163118542646463, 0.09091708011509347, -0.07245639647187302, -0.26022879930898407, 0.3756236042658968, 0.0034561504803176197, 0.2971691062246338, 0.010082632107015863, 0.13382625359669914, -0.04074149462101548, -0.06715606015399625, 0.05537407968245277, -0.06742685492658979, 0.1656563303154401, 0.3233803711676349, 0.18692353786314903, 0.315357386198996, -0.40884464768892004, -0.18763131461543348, 0.1153956673916359, 0.15061001388982828, 0.08006640845882625, -0.01817500308732965, -0.33371545068638503, 0.10274414251537982, -0.1593553316823365, -0.023102283290347213, -0.14689986754513387, 0.0069229085256093705, 0.05390570033890775, -0.23441954157604403, 0.0010408011569682531, 0.05181539555463893, 0.07977183512851314, -0.05784227161334371, -0.10625042568353361, 0.011264756595007138, 0.18554853629350146, 0.05660040034552298, 0.04577350825856223, 0.09116367423766346, -0.1059041338835099, -0.15777402540519483, 0.38391442700002176, -0.03648140552928144, -0.24551507653141358, 0.2388769612375225, -0.07311990730019298, -0.1424775799742238, 0.05357483530463944, 0.1809591974524207, 0.07302215197504316, -0.1848458798906807, 0.04493369328798199, -0.03781344008825298, 0.16176551386769628, 0.11990604044154943, 0.08490160343079071, 0.222293402175214, 0.13170112138204043, 0.02314661860132133, 0.1199182081263243, -0.031978392436128086, -0.04836935779327269, -0.2845799832300242, -0.1465640209744093, -0.1803218400191498, -0.026983922019413433, -0.09553861877029475, -0.1802494603343917, 0.3542133334690248, 0.17797045228393665, 0.22907928127298313, 0.057650191328669866, 0.2800477691838201, 0.03930679457218228, 0.09776896201718435, 0.09863432444069746, 0.16647679443066976, 0.012183392697172064, 0.13540658943278938, -0.09380740080901522, 0.11294663229586745, 0.07903187017179088] |
1,802.02606 | Action-based dynamical models of dwarf spheroidal galaxies: application
to Fornax | We present new dynamical models of dwarf spheroidal galaxies (dSphs) in which
both the stellar component and the dark halo are described by analytic
distribution functions that depend on the action integrals. In their most
general form these distribution functions can represent axisymmetric and
possibly rotating stellar systems. Here, as a first application, we model the
Fornax dSph, limiting ourselves, for simplicity, to the non rotating, spherical
case. The models are compared with state-of-the-art spectroscopic and
photometric observations of Fornax, exploiting the knowledge of the
line-of-sight velocity distribution of the models and accounting for the
foreground contamination from the Milky Way. The model that best fits the
structural and kinematic properties of Fornax has a cored dark halo, with core
size $r_{\rm c}\simeq1.03$ kpc. The dark-to-luminous mass ratio is $(M_{\rm
dm}/M_{\star})|_{R_{\rm eff}}\simeq9.6$ within the effective radius $R_{\rm
eff} \simeq 0.62\,$kpc and $(M_{\rm dm}/M_{\star})|_{3 {\rm kpc}} \simeq 144$
within 3 kpc. The stellar velocity distribution is isotropic almost over the
full radial range covered by the spectroscopic data and slightly radially
anisotropic in the outskirts of the stellar distribution. The dark-matter
annihilation $J$-factor and decay $D$-factor are, respectively, $\log_{10}(J$
$[$GeV$^2$ cm$^{-5}])\simeq18.34$ and $\log_{10}(D$ $[$GeV
cm$^{-2}])\simeq18.55$, for integration angle $\theta = 0.5^{\circ}$. This
cored halo model of Fornax is preferred, with high statistical significance, to
both models with a Navarro, Frenk and White dark halo and simple
mass-follows-light models.
| astro-ph.GA | we present new dynamical models of dwarf spheroidal galaxies dsphs in which both the stellar component and the dark halo are described by analytic distribution functions that depend on the action integrals in their most general form these distribution functions can represent axisymmetric and possibly rotating stellar systems here as a first application we model the fornax dsph limiting ourselves for simplicity to the non rotating spherical case the models are compared with stateoftheart spectroscopic and photometric observations of fornax exploiting the knowledge of the lineofsight velocity distribution of the models and accounting for the foreground contamination from the milky way the model that best fits the structural and kinematic properties of fornax has a cored dark halo with core size r_rm csimeq103 kpc the darktoluminous mass ratio is m_rm dmm_star_r_rm effsimeq96 within the effective radius r_rm eff simeq 062kpc and m_rm dmm_star_3 rm kpc simeq 144 within 3 kpc the stellar velocity distribution is isotropic almost over the full radial range covered by the spectroscopic data and slightly radially anisotropic in the outskirts of the stellar distribution the darkmatter annihilation jfactor and decay dfactor are respectively log_10j gev2 cm5simeq1834 and log_10d gev cm2simeq1855 for integration angle theta 05circ this cored halo model of fornax is preferred with high statistical significance to both models with a navarro frenk and white dark halo and simple massfollowslight models | [['we', 'present', 'new', 'dynamical', 'models', 'of', 'dwarf', 'spheroidal', 'galaxies', 'dsphs', 'in', 'which', 'both', 'the', 'stellar', 'component', 'and', 'the', 'dark', 'halo', 'are', 'described', 'by', 'analytic', 'distribution', 'functions', 'that', 'depend', 'on', 'the', 'action', 'integrals', 'in', 'their', 'most', 'general', 'form', 'these', 'distribution', 'functions', 'can', 'represent', 'axisymmetric', 'and', 'possibly', 'rotating', 'stellar', 'systems', 'here', 'as', 'a', 'first', 'application', 'we', 'model', 'the', 'fornax', 'dsph', 'limiting', 'ourselves', 'for', 'simplicity', 'to', 'the', 'non', 'rotating', 'spherical', 'case', 'the', 'models', 'are', 'compared', 'with', 'stateoftheart', 'spectroscopic', 'and', 'photometric', 'observations', 'of', 'fornax', 'exploiting', 'the', 'knowledge', 'of', 'the', 'lineofsight', 'velocity', 'distribution', 'of', 'the', 'models', 'and', 'accounting', 'for', 'the', 'foreground', 'contamination', 'from', 'the', 'milky', 'way', 'the', 'model', 'that', 'best', 'fits', 'the', 'structural', 'and', 'kinematic', 'properties', 'of', 'fornax', 'has', 'a', 'cored', 'dark', 'halo', 'with', 'core', 'size', 'r_rm', 'csimeq103', 'kpc', 'the', 'darktoluminous', 'mass', 'ratio', 'is', 'm_rm', 'dmm_star_r_rm', 'effsimeq96', 'within', 'the', 'effective', 'radius', 'r_rm', 'eff', 'simeq', '062kpc', 'and', 'm_rm', 'dmm_star_3', 'rm', 'kpc', 'simeq', '144', 'within', '3', 'kpc', 'the', 'stellar', 'velocity', 'distribution', 'is', 'isotropic', 'almost', 'over', 'the', 'full', 'radial', 'range', 'covered', 'by', 'the', 'spectroscopic', 'data', 'and', 'slightly', 'radially', 'anisotropic', 'in', 'the', 'outskirts', 'of', 'the', 'stellar', 'distribution', 'the', 'darkmatter', 'annihilation', 'jfactor', 'and', 'decay', 'dfactor', 'are', 'respectively', 'log_10j', 'gev2', 'cm5simeq1834', 'and', 'log_10d', 'gev', 'cm2simeq1855', 'for', 'integration', 'angle', 'theta', '05circ', 'this', 'cored', 'halo', 'model', 'of', 'fornax', 'is', 'preferred', 'with', 'high', 'statistical', 'significance', 'to', 'both', 'models', 'with', 'a', 'navarro', 'frenk', 'and', 'white', 'dark', 'halo', 'and', 'simple', 'massfollowslight', 'models']] | [-0.05560384992797632, 0.09141605904257175, -0.111594625680025, 0.1124182708683737, -0.12134539687465276, -0.060870944509982275, -0.01607691089854434, 0.396656869065171, -0.1435616240919297, -0.3740904855494675, -0.007199561665980531, -0.29399624843287714, 0.010646509995344975, 0.19642177094546606, -0.0036377996608104196, 0.01716808867286719, 0.033680611632309405, -0.07740409923465236, -0.0945337078864536, -0.2513125857610839, 0.2973068622691977, 0.04504986130659284, 0.14687084431292205, -0.06453778192804363, 0.035099730501273296, -0.04439771678599139, -0.04583507921538114, -0.043084734165611836, -0.1991212327628904, 0.039400030725768635, 0.176346158462353, 0.12666568007912435, 0.17309456854878413, -0.31947754770903614, -0.21170767592394957, 0.09656399972994344, 0.22241843749944995, 0.020373763548197386, -0.0653315659817351, -0.2882780586819976, 0.06530480668343569, -0.24914683677226065, -0.20446820232871285, 0.031114674091751126, 0.05449702662806357, 0.054112387423013004, -0.2284314267032604, 0.2441292597115853, 0.03166349341785471, 0.05828916133823483, -0.11552697213576926, -0.16826912111115602, -0.06733849741897249, 0.018440679820846715, 0.03348507785103134, 0.05449660261019996, 0.21557737859330797, -0.1600338343513726, 0.04338963481722065, 0.4337703785003369, -0.09787209387890101, -0.0963620845017062, 0.16834914015417207, -0.1829534859357891, -0.14227715762512338, 0.04750340451456366, 0.1671245177533941, 0.09618791927742312, -0.16235252465761196, 0.10013259179418191, -0.05430617684676539, 0.20863053073231044, 0.05317568076851731, -0.015367430532597915, 0.33417039119111686, 0.1180851758556432, 0.06483652421771141, -0.011543907401096162, -0.2273382997957878, -0.07407311833847727, -0.26137079487443143, -0.06287486905721339, -0.11076288713702356, 0.043361105016767466, -0.20942325831782813, -0.11483092442764321, 0.35462011449566877, 0.09359124103355305, 0.24969990144286322, 0.11985222122434544, 0.3476036404026672, 0.06819571492295447, 0.09934383878711835, 0.14809392968918011, 0.2795582816663546, 0.2279769855225244, 0.02334695835308116, -0.2039483995616762, 0.0422766754051782, -0.03978659580129066] |
1,802.02607 | Learning from Past Mistakes: Improving Automatic Speech Recognition
Output via Noisy-Clean Phrase Context Modeling | Automatic speech recognition (ASR) systems often make unrecoverable errors
due to subsystem pruning (acoustic, language and pronunciation models); for
example pruning words due to acoustics using short-term context, prior to
rescoring with long-term context based on linguistics. In this work we model
ASR as a phrase-based noisy transformation channel and propose an error
correction system that can learn from the aggregate errors of all the
independent modules constituting the ASR and attempt to invert those. The
proposed system can exploit long-term context using a neural network language
model and can better choose between existing ASR output possibilities as well
as re-introduce previously pruned or unseen (out-of-vocabulary) phrases. It
provides corrections under poorly performing ASR conditions without degrading
any accurate transcriptions; such corrections are greater on top of
out-of-domain and mismatched data ASR. Our system consistently provides
improvements over the baseline ASR, even when baseline is further optimized
through recurrent neural network language model rescoring. This demonstrates
that any ASR improvements can be exploited independently and that our proposed
system can potentially still provide benefits on highly optimized ASR. Finally,
we present an extensive analysis of the type of errors corrected by our system.
| cs.CL cs.SD eess.AS | automatic speech recognition asr systems often make unrecoverable errors due to subsystem pruning acoustic language and pronunciation models for example pruning words due to acoustics using shortterm context prior to rescoring with longterm context based on linguistics in this work we model asr as a phrasebased noisy transformation channel and propose an error correction system that can learn from the aggregate errors of all the independent modules constituting the asr and attempt to invert those the proposed system can exploit longterm context using a neural network language model and can better choose between existing asr output possibilities as well as reintroduce previously pruned or unseen outofvocabulary phrases it provides corrections under poorly performing asr conditions without degrading any accurate transcriptions such corrections are greater on top of outofdomain and mismatched data asr our system consistently provides improvements over the baseline asr even when baseline is further optimized through recurrent neural network language model rescoring this demonstrates that any asr improvements can be exploited independently and that our proposed system can potentially still provide benefits on highly optimized asr finally we present an extensive analysis of the type of errors corrected by our system | [['automatic', 'speech', 'recognition', 'asr', 'systems', 'often', 'make', 'unrecoverable', 'errors', 'due', 'to', 'subsystem', 'pruning', 'acoustic', 'language', 'and', 'pronunciation', 'models', 'for', 'example', 'pruning', 'words', 'due', 'to', 'acoustics', 'using', 'shortterm', 'context', 'prior', 'to', 'rescoring', 'with', 'longterm', 'context', 'based', 'on', 'linguistics', 'in', 'this', 'work', 'we', 'model', 'asr', 'as', 'a', 'phrasebased', 'noisy', 'transformation', 'channel', 'and', 'propose', 'an', 'error', 'correction', 'system', 'that', 'can', 'learn', 'from', 'the', 'aggregate', 'errors', 'of', 'all', 'the', 'independent', 'modules', 'constituting', 'the', 'asr', 'and', 'attempt', 'to', 'invert', 'those', 'the', 'proposed', 'system', 'can', 'exploit', 'longterm', 'context', 'using', 'a', 'neural', 'network', 'language', 'model', 'and', 'can', 'better', 'choose', 'between', 'existing', 'asr', 'output', 'possibilities', 'as', 'well', 'as', 'reintroduce', 'previously', 'pruned', 'or', 'unseen', 'outofvocabulary', 'phrases', 'it', 'provides', 'corrections', 'under', 'poorly', 'performing', 'asr', 'conditions', 'without', 'degrading', 'any', 'accurate', 'transcriptions', 'such', 'corrections', 'are', 'greater', 'on', 'top', 'of', 'outofdomain', 'and', 'mismatched', 'data', 'asr', 'our', 'system', 'consistently', 'provides', 'improvements', 'over', 'the', 'baseline', 'asr', 'even', 'when', 'baseline', 'is', 'further', 'optimized', 'through', 'recurrent', 'neural', 'network', 'language', 'model', 'rescoring', 'this', 'demonstrates', 'that', 'any', 'asr', 'improvements', 'can', 'be', 'exploited', 'independently', 'and', 'that', 'our', 'proposed', 'system', 'can', 'potentially', 'still', 'provide', 'benefits', 'on', 'highly', 'optimized', 'asr', 'finally', 'we', 'present', 'an', 'extensive', 'analysis', 'of', 'the', 'type', 'of', 'errors', 'corrected', 'by', 'our', 'system']] | [-0.05527573732485502, 0.02286192769464588, -0.04069281241813086, 0.09284965189383727, -0.11548262802579976, -0.21443104659028622, 0.08563586346047491, 0.4386712923462604, -0.272550858091563, -0.3326670408331538, 0.07427462470932464, -0.27247149282053035, -0.20010221529621727, 0.23338194352175337, -0.1637207733049815, 0.11177879545856943, 0.18345172628712084, 0.051209078005839556, -0.08800238221787264, -0.29270859113460107, 0.2445702076952306, 0.11434182495366145, 0.34104795050638403, -0.02524611168001764, 0.09504128236461122, -0.031091230640361577, -0.021422333105761616, -0.06149504231071881, 0.012611092392204709, 0.14133851048011825, 0.3135982585543746, 0.17671342329582812, 0.2577427018993568, -0.4057909037551114, -0.2546176472437505, 0.08207301679670502, 0.17388016732235878, 0.16175793208799522, 0.0029427049460777426, -0.3741984346041871, 0.09888567105345814, -0.23071874919410196, 0.07263695977753694, -0.16637820949527035, -0.04076640441328519, -0.02459198874970319, -0.2941730310169285, 0.03436022276218864, 0.1588004576832471, 0.09485059531183594, -0.0570519485322691, -0.13479262940076522, 0.023740602593864145, 0.18028227923033213, 0.042909770068191376, 0.07491898921516198, 0.12373807144693914, -0.11599280019990443, -0.12817000337138076, 0.39139904741950604, -0.10225891657541579, -0.27592817103789413, 0.21075713194555656, 0.00769246477932896, -0.12495659991201265, 0.06140614091539321, 0.23573528929647308, 0.027490881597381955, -0.20433703825335256, 0.00636744367621038, 0.0035609879550268305, 0.2747354647711672, 0.054900450976999776, 0.02708715971298709, 0.20170949555335113, 0.24382301019818325, -0.035152054970862025, 0.15007747095645227, -0.10730296697746841, -0.011681391368378822, -0.218604149050779, -0.07845605430885404, -0.11818280019447536, -0.016571881960705886, -0.06631806865530547, -0.13052917819645393, 0.36985471756366406, 0.2730284607727949, 0.14956592198176588, 0.13702466035227973, 0.3385236022627184, 0.04694893490281825, 0.12693860726865308, 0.06373923573247278, 0.1697089928823615, -0.016533179014409684, 0.11138905213414112, -0.2117156237641282, 0.1325132449548402, 0.03904081187621145] |
1,802.02608 | Deep Versus Wide Convolutional Neural Networks for Object Recognition on
Neuromorphic System | In the last decade, special purpose computing systems, such as Neuromorphic
computing, have become very popular in the field of computer vision and machine
learning for classification tasks. In 2015, IBM's released the TrueNorth
Neuromorphic system, kick-starting a new era of Neuromorphic computing.
Alternatively, Deep Learning approaches such as Deep Convolutional Neural
Networks (DCNN) show almost human-level accuracies for detection and
classification tasks. IBM's 2016 release of a deep learning framework for
DCNNs, called Energy Efficient Deep Neuromorphic Networks (Eedn). Eedn shows
promise for delivering high accuracies across a number of different benchmarks,
while consuming very low power, using IBM's TrueNorth chip. However, there are
many things that remained undiscovered using the Eedn framework for
classification tasks on a Neuromorphic system. In this paper, we have
empirically evaluated the performance of different DCNN architectures
implemented within the Eedn framework. The goal of this work was discover the
most efficient way to implement DCNN models for object classification tasks
using the TrueNorth system. We performed our experiments using benchmark data
sets such as MNIST, COIL 20, and COIL 100. The experimental results show very
promising classification accuracies with very low power consumption on IBM's
NS1e Neurosynaptic system. The results show that for datasets with large
numbers of classes, wider networks perform better when compared to deep
networks comprised of nearly the same core complexity on IBM's TrueNorth
system.
| cs.CV | in the last decade special purpose computing systems such as neuromorphic computing have become very popular in the field of computer vision and machine learning for classification tasks in 2015 ibms released the truenorth neuromorphic system kickstarting a new era of neuromorphic computing alternatively deep learning approaches such as deep convolutional neural networks dcnn show almost humanlevel accuracies for detection and classification tasks ibms 2016 release of a deep learning framework for dcnns called energy efficient deep neuromorphic networks eedn eedn shows promise for delivering high accuracies across a number of different benchmarks while consuming very low power using ibms truenorth chip however there are many things that remained undiscovered using the eedn framework for classification tasks on a neuromorphic system in this paper we have empirically evaluated the performance of different dcnn architectures implemented within the eedn framework the goal of this work was discover the most efficient way to implement dcnn models for object classification tasks using the truenorth system we performed our experiments using benchmark data sets such as mnist coil 20 and coil 100 the experimental results show very promising classification accuracies with very low power consumption on ibms ns1e neurosynaptic system the results show that for datasets with large numbers of classes wider networks perform better when compared to deep networks comprised of nearly the same core complexity on ibms truenorth system | [['in', 'the', 'last', 'decade', 'special', 'purpose', 'computing', 'systems', 'such', 'as', 'neuromorphic', 'computing', 'have', 'become', 'very', 'popular', 'in', 'the', 'field', 'of', 'computer', 'vision', 'and', 'machine', 'learning', 'for', 'classification', 'tasks', 'in', '2015', 'ibms', 'released', 'the', 'truenorth', 'neuromorphic', 'system', 'kickstarting', 'a', 'new', 'era', 'of', 'neuromorphic', 'computing', 'alternatively', 'deep', 'learning', 'approaches', 'such', 'as', 'deep', 'convolutional', 'neural', 'networks', 'dcnn', 'show', 'almost', 'humanlevel', 'accuracies', 'for', 'detection', 'and', 'classification', 'tasks', 'ibms', '2016', 'release', 'of', 'a', 'deep', 'learning', 'framework', 'for', 'dcnns', 'called', 'energy', 'efficient', 'deep', 'neuromorphic', 'networks', 'eedn', 'eedn', 'shows', 'promise', 'for', 'delivering', 'high', 'accuracies', 'across', 'a', 'number', 'of', 'different', 'benchmarks', 'while', 'consuming', 'very', 'low', 'power', 'using', 'ibms', 'truenorth', 'chip', 'however', 'there', 'are', 'many', 'things', 'that', 'remained', 'undiscovered', 'using', 'the', 'eedn', 'framework', 'for', 'classification', 'tasks', 'on', 'a', 'neuromorphic', 'system', 'in', 'this', 'paper', 'we', 'have', 'empirically', 'evaluated', 'the', 'performance', 'of', 'different', 'dcnn', 'architectures', 'implemented', 'within', 'the', 'eedn', 'framework', 'the', 'goal', 'of', 'this', 'work', 'was', 'discover', 'the', 'most', 'efficient', 'way', 'to', 'implement', 'dcnn', 'models', 'for', 'object', 'classification', 'tasks', 'using', 'the', 'truenorth', 'system', 'we', 'performed', 'our', 'experiments', 'using', 'benchmark', 'data', 'sets', 'such', 'as', 'mnist', 'coil', '20', 'and', 'coil', '100', 'the', 'experimental', 'results', 'show', 'very', 'promising', 'classification', 'accuracies', 'with', 'very', 'low', 'power', 'consumption', 'on', 'ibms', 'ns1e', 'neurosynaptic', 'system', 'the', 'results', 'show', 'that', 'for', 'datasets', 'with', 'large', 'numbers', 'of', 'classes', 'wider', 'networks', 'perform', 'better', 'when', 'compared', 'to', 'deep', 'networks', 'comprised', 'of', 'nearly', 'the', 'same', 'core', 'complexity', 'on', 'ibms', 'truenorth', 'system']] | [-0.07852666568019251, -0.03296559316717449, -0.027941305810864604, 0.019847466906025957, -0.0371314577906011, -0.2172641103609264, -0.01786520185373674, 0.43636708964269594, -0.21905265434487162, -0.3816162326931133, 0.09317731308968254, -0.23546886054433816, -0.2033012310157854, 0.321527353748433, -0.09703047384942845, 0.141333650238094, 0.19709293637424707, 0.024698244495981986, -0.04435997366218516, -0.3207661801506047, 0.227989448132896, 0.07343789916277847, 0.386080205826179, 0.014625774665698737, 0.15463180645186422, -0.08134103034487576, 0.05018886677010009, -0.031329995845875286, -0.017408825976413567, 0.17377851498908145, 0.3255796307696899, 0.19345018287940108, 0.3238510106944598, -0.4335931034057118, -0.21493839149543859, 0.10318786845051957, 0.16078178190045667, 0.07876770903407913, -0.06567138354222204, -0.31523582649454146, 0.10644679104689804, -0.2395947712252023, 0.026790343998369274, -0.1793485943613664, 0.0370603510438124, -0.0016621926069641199, -0.20707381978253567, 0.0024918726151029577, 0.02880145045354273, 0.0997509181669745, -0.03960802303298914, -0.16012470688135466, 0.07525569467091449, 0.14955334755295113, -0.06378318956132059, 0.06429260151485383, 0.163585830516785, -0.22030846600314102, -0.178176343583067, 0.34506056042560396, -0.04690959694844543, -0.11896228948649068, 0.2286890600295122, 0.00012870819414535022, -0.2326810682491945, 0.045702113303774355, 0.2703668558190573, 0.10190488668240705, -0.15746369186127487, 0.03083658267360279, -0.002954932979112163, 0.18138693809501072, 0.026987410892039078, 0.004773434592074497, 0.19837198593235258, 0.3526631636403517, -0.012633873816704715, 0.1263337590945023, -0.1278249809184083, -0.0775506105130366, -0.14647642844089917, -0.10510642810966737, -0.2179230946754126, -0.003290285129666263, -0.07664925063272275, -0.13056345353629195, 0.37569011441772465, 0.20375048606102622, 0.17614778006600118, 0.14840494188167758, 0.3731191532136585, 0.019594026834597312, 0.18502178542328268, 0.15015900595368006, 0.2238812002739028, 0.025202080969994125, 0.18381261077528976, -0.1349831649065346, 0.013941073169652783, -0.011627855128736854] |
1,802.02609 | On characteristic classes of exotic manifold bundles | Given a closed simply connected manifold $M$ of dimension $2n\ge6$, we
compare the ring of characteristic classes of smooth oriented bundles with
fibre $M$ to the analogous ring resulting from replacing $M$ by the connected
sum $M\sharp\Sigma$ with an exotic sphere $\Sigma$. We show that, after
inverting the order of $\Sigma$ in the group of homotopy spheres, the two rings
in question are isomorphic in a range of degrees. Furthermore, we construct
infinite families of examples witnessing that inverting the order of $\Sigma$
is necessary.
| math.AT math.GT | given a closed simply connected manifold m of dimension 2nge6 we compare the ring of characteristic classes of smooth oriented bundles with fibre m to the analogous ring resulting from replacing m by the connected sum msharpsigma with an exotic sphere sigma we show that after inverting the order of sigma in the group of homotopy spheres the two rings in question are isomorphic in a range of degrees furthermore we construct infinite families of examples witnessing that inverting the order of sigma is necessary | [['given', 'a', 'closed', 'simply', 'connected', 'manifold', 'm', 'of', 'dimension', '2nge6', 'we', 'compare', 'the', 'ring', 'of', 'characteristic', 'classes', 'of', 'smooth', 'oriented', 'bundles', 'with', 'fibre', 'm', 'to', 'the', 'analogous', 'ring', 'resulting', 'from', 'replacing', 'm', 'by', 'the', 'connected', 'sum', 'msharpsigma', 'with', 'an', 'exotic', 'sphere', 'sigma', 'we', 'show', 'that', 'after', 'inverting', 'the', 'order', 'of', 'sigma', 'in', 'the', 'group', 'of', 'homotopy', 'spheres', 'the', 'two', 'rings', 'in', 'question', 'are', 'isomorphic', 'in', 'a', 'range', 'of', 'degrees', 'furthermore', 'we', 'construct', 'infinite', 'families', 'of', 'examples', 'witnessing', 'that', 'inverting', 'the', 'order', 'of', 'sigma', 'is', 'necessary']] | [-0.21033043147300381, 0.11713796984548092, -0.04321560117763927, 0.011528595501461616, -0.04327653158254113, -0.12196749782032636, -0.02909036579048149, 0.3836012254637408, -0.28100079486528073, -0.2391527397838612, 0.09923361569603747, -0.2475194945505046, -0.1473885447807969, 0.19203444479695375, -0.08214367885726044, -0.04951092798868755, 0.013833601779517639, 0.12526337649807873, -0.11972876240398331, -0.28664629345378245, 0.4397040993895337, -0.07545121395623827, 0.17096900947432137, -0.005004048224044852, 0.12353462263582701, -0.0014536832122648336, -0.022023486085684902, 0.08468142450304635, -0.1773036568748543, 0.16432389930025282, 0.2583927523389638, 0.04491271248300481, 0.16053887407424444, -0.38447458297014236, -0.1413347197315061, 0.1881643128413034, 0.12275686629498041, -0.011033445080540267, 0.01077071783772434, -0.2420696646019996, 0.1469918923250523, -0.16138764190296812, -0.1880615059376122, -0.036056956870997525, 0.0905917628657028, 0.03800420119730105, -0.21441318100481013, -0.01741855875420642, 0.1103718284495085, 0.08968687523156404, -0.03324207004597298, -0.07406742122383361, -0.05856045664860362, 0.09377792972022196, -0.017648599539737565, 0.03165733878758837, 0.1000082622147558, -0.09291014125772629, -0.09952704065355909, 0.3625489736189056, -0.11424086500149984, -0.19255010240587844, 0.14442177622926883, -0.1671448324313275, -0.10315668651923897, 0.18587036355656672, 0.09609383847340043, 0.1561527565144092, -0.028030524344508905, 0.15850599160619888, -0.12209193959708763, 0.1323080381086792, 0.10700809073084629, -0.023660306998315346, 0.18642628830240435, 0.13086449106066791, 0.08782576730948906, 0.1599404060966279, -0.03097345690658114, -0.035662189552403356, -0.3739924140566264, -0.19300889930721507, -0.14377624554985977, 0.16039037014391408, -0.10237998762224094, -0.117950404492061, 0.387295043612101, 0.03943061348084495, 0.24561277796592879, 0.08870896212307804, 0.21874666384544716, 0.05446440540254116, 0.06697253356070583, 0.07561263729010272, 0.12276854136319135, 0.2285973833991686, -0.078738238151937, -0.14343501484801388, -0.07239577156584148, 0.12002247079915132] |
1,802.0261 | Telling apart <I>Felidae</I> and <I>Ursidae</I> from the distribution of
nucleotides in mitochondrial DNA | Rank--frequency distributions of nucleotide sequences in mitochondrial DNA
are defined in a way analogous to the linguistic approach, with the
highest-frequent nucleobase serving as a whitespace. For such sequences,
entropy and mean length are calculated. These parameters are shown to
discriminate the species of the <I>Felidae</I> (cats) and <I>Ursidae</I>
(bears) families. From purely numerical values we are able to see in particular
that giant pandas are bears while koalas are not. The observed linear relation
between the parameters is explained using a simple probabilistic model. The
approach based on the nonadditive generalization of the Bose-distribution is
used to analyze the frequency spectra of the nucleotide sequences. In this
case, the separation of families is not very sharp. Nevertheless, the
distributions for <I>Felidae</I> have on average longer tails comparing to
<I>Ursidae</I>.
| q-bio.OT physics.bio-ph physics.data-an | rankfrequency distributions of nucleotide sequences in mitochondrial dna are defined in a way analogous to the linguistic approach with the highestfrequent nucleobase serving as a whitespace for such sequences entropy and mean length are calculated these parameters are shown to discriminate the species of the ifelidaei cats and iursidaei bears families from purely numerical values we are able to see in particular that giant pandas are bears while koalas are not the observed linear relation between the parameters is explained using a simple probabilistic model the approach based on the nonadditive generalization of the bosedistribution is used to analyze the frequency spectra of the nucleotide sequences in this case the separation of families is not very sharp nevertheless the distributions for ifelidaei have on average longer tails comparing to iursidaei | [['rankfrequency', 'distributions', 'of', 'nucleotide', 'sequences', 'in', 'mitochondrial', 'dna', 'are', 'defined', 'in', 'a', 'way', 'analogous', 'to', 'the', 'linguistic', 'approach', 'with', 'the', 'highestfrequent', 'nucleobase', 'serving', 'as', 'a', 'whitespace', 'for', 'such', 'sequences', 'entropy', 'and', 'mean', 'length', 'are', 'calculated', 'these', 'parameters', 'are', 'shown', 'to', 'discriminate', 'the', 'species', 'of', 'the', 'ifelidaei', 'cats', 'and', 'iursidaei', 'bears', 'families', 'from', 'purely', 'numerical', 'values', 'we', 'are', 'able', 'to', 'see', 'in', 'particular', 'that', 'giant', 'pandas', 'are', 'bears', 'while', 'koalas', 'are', 'not', 'the', 'observed', 'linear', 'relation', 'between', 'the', 'parameters', 'is', 'explained', 'using', 'a', 'simple', 'probabilistic', 'model', 'the', 'approach', 'based', 'on', 'the', 'nonadditive', 'generalization', 'of', 'the', 'bosedistribution', 'is', 'used', 'to', 'analyze', 'the', 'frequency', 'spectra', 'of', 'the', 'nucleotide', 'sequences', 'in', 'this', 'case', 'the', 'separation', 'of', 'families', 'is', 'not', 'very', 'sharp', 'nevertheless', 'the', 'distributions', 'for', 'ifelidaei', 'have', 'on', 'average', 'longer', 'tails', 'comparing', 'to', 'iursidaei']] | [-0.07683102807836471, 0.09707065696290475, -0.10860643818277896, 0.13258641461720613, -0.029504978567422405, -0.12920862956472287, 0.028648336325219372, 0.40418901270997476, -0.2606936167789305, -0.2946259546722096, 0.03732208221605638, -0.29410588411175137, -0.14651464292310118, 0.23851208933401943, -0.0861759758168714, 0.02555456032848262, 0.05241703750031841, 0.06423654967949279, -0.03831093710453469, -0.20162280831046828, 0.2833647132071295, 0.037596886527035536, 0.26457687945112707, 0.005233624449370777, 0.05744883501372201, -0.041507824467934246, -0.04324915428926063, 0.00628661456692025, -0.13759944634730936, 0.13152719015725017, 0.23883403441490136, 0.12115774699676085, 0.21136376236724416, -0.37173224105764696, -0.21212639398418548, 0.11606004018699978, 0.14051468224204108, 0.12786623476474449, -0.016249171937096532, -0.23656045167510042, 0.1028215057875325, -0.13612413835689063, -0.07768495021221357, -0.07385985499505347, 0.02413454022621963, 0.10303627339151983, -0.2594564478329527, 0.11779859182008398, 0.05610632042332393, 0.07589131951527538, -0.054524467303985504, -0.14064405385851558, -0.03839221208666762, 0.1690661463341335, 0.07187287601153934, -0.021677717550400252, 0.08805854907032193, -0.08326439852580216, -0.1084913411897009, 0.3739517667327016, -0.06614830186666269, -0.22374002964896475, 0.21644064657034245, -0.1382448144552366, -0.12860765287887335, 0.09924648899388144, 0.1284512850698235, 0.11384577459723848, -0.16941344689074297, 0.032786205757363907, -0.0377339754723073, 0.18621330934470687, 0.11180894840054395, 0.04654954041437647, 0.2216297084601914, 0.134904478318853, -0.005776492513458782, 0.16645045811499704, -0.1059975026447962, -0.13689038802574321, -0.25158170466803437, -0.11252314956836039, -0.18039279461533542, -0.0013204298842967132, -0.060399180452095164, -0.19473070028967723, 0.37874517623123116, 0.1099838571991143, 0.2328420086741084, 0.10066390225504775, 0.23110033644030128, 0.09553526831522008, 0.11294810900869741, 0.020225621112508745, 0.1943368704263613, 0.12176470561956275, 0.04416739768386493, -0.19486814176917408, 0.12898074516674457, 0.04073544980893508] |
1,802.02611 | Encoder-Decoder with Atrous Separable Convolution for Semantic Image
Segmentation | Spatial pyramid pooling module or encode-decoder structure are used in deep
neural networks for semantic segmentation task. The former networks are able to
encode multi-scale contextual information by probing the incoming features with
filters or pooling operations at multiple rates and multiple effective
fields-of-view, while the latter networks can capture sharper object boundaries
by gradually recovering the spatial information. In this work, we propose to
combine the advantages from both methods. Specifically, our proposed model,
DeepLabv3+, extends DeepLabv3 by adding a simple yet effective decoder module
to refine the segmentation results especially along object boundaries. We
further explore the Xception model and apply the depthwise separable
convolution to both Atrous Spatial Pyramid Pooling and decoder modules,
resulting in a faster and stronger encoder-decoder network. We demonstrate the
effectiveness of the proposed model on PASCAL VOC 2012 and Cityscapes datasets,
achieving the test set performance of 89.0\% and 82.1\% without any
post-processing. Our paper is accompanied with a publicly available reference
implementation of the proposed models in Tensorflow at
\url{https://github.com/tensorflow/models/tree/master/research/deeplab}.
| cs.CV | spatial pyramid pooling module or encodedecoder structure are used in deep neural networks for semantic segmentation task the former networks are able to encode multiscale contextual information by probing the incoming features with filters or pooling operations at multiple rates and multiple effective fieldsofview while the latter networks can capture sharper object boundaries by gradually recovering the spatial information in this work we propose to combine the advantages from both methods specifically our proposed model deeplabv3 extends deeplabv3 by adding a simple yet effective decoder module to refine the segmentation results especially along object boundaries we further explore the xception model and apply the depthwise separable convolution to both atrous spatial pyramid pooling and decoder modules resulting in a faster and stronger encoderdecoder network we demonstrate the effectiveness of the proposed model on pascal voc 2012 and cityscapes datasets achieving the test set performance of 890 and 821 without any postprocessing our paper is accompanied with a publicly available reference implementation of the proposed models in tensorflow at urlhttpsgithubcomtensorflowmodelstreemasterresearchdeeplab | [['spatial', 'pyramid', 'pooling', 'module', 'or', 'encodedecoder', 'structure', 'are', 'used', 'in', 'deep', 'neural', 'networks', 'for', 'semantic', 'segmentation', 'task', 'the', 'former', 'networks', 'are', 'able', 'to', 'encode', 'multiscale', 'contextual', 'information', 'by', 'probing', 'the', 'incoming', 'features', 'with', 'filters', 'or', 'pooling', 'operations', 'at', 'multiple', 'rates', 'and', 'multiple', 'effective', 'fieldsofview', 'while', 'the', 'latter', 'networks', 'can', 'capture', 'sharper', 'object', 'boundaries', 'by', 'gradually', 'recovering', 'the', 'spatial', 'information', 'in', 'this', 'work', 'we', 'propose', 'to', 'combine', 'the', 'advantages', 'from', 'both', 'methods', 'specifically', 'our', 'proposed', 'model', 'deeplabv3', 'extends', 'deeplabv3', 'by', 'adding', 'a', 'simple', 'yet', 'effective', 'decoder', 'module', 'to', 'refine', 'the', 'segmentation', 'results', 'especially', 'along', 'object', 'boundaries', 'we', 'further', 'explore', 'the', 'xception', 'model', 'and', 'apply', 'the', 'depthwise', 'separable', 'convolution', 'to', 'both', 'atrous', 'spatial', 'pyramid', 'pooling', 'and', 'decoder', 'modules', 'resulting', 'in', 'a', 'faster', 'and', 'stronger', 'encoderdecoder', 'network', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'model', 'on', 'pascal', 'voc', '2012', 'and', 'cityscapes', 'datasets', 'achieving', 'the', 'test', 'set', 'performance', 'of', '890', 'and', '821', 'without', 'any', 'postprocessing', 'our', 'paper', 'is', 'accompanied', 'with', 'a', 'publicly', 'available', 'reference', 'implementation', 'of', 'the', 'proposed', 'models', 'in', 'tensorflow', 'at', 'urlhttpsgithubcomtensorflowmodelstreemasterresearchdeeplab']] | [-0.023847099598718897, -0.023829736978292375, -0.051520754430731314, 0.05672038595436052, -0.07646766217862933, -0.202206797612321, -0.00021101190594934103, 0.48590291621873066, -0.2727265485224225, -0.32114081396554994, 0.0824156923280541, -0.24183831427944824, -0.18219527614703457, 0.1552437642059799, -0.1264471848262474, 0.0804351922342903, 0.1546231572803143, 0.014231746254067514, -0.08334515989103931, -0.27807525053088156, 0.29705004736093715, 0.09617554549792355, 0.3552321334247522, 0.02839229569161987, 0.1568642582555878, -0.012642281547457623, -0.061848050771957444, -0.022858564692710172, -0.04644988875155659, 0.19031768853892572, 0.250661021515238, 0.14680579901392948, 0.2826641131749576, -0.4342729646571873, -0.24425864708869735, 0.04058692141275276, 0.14177856530018507, 0.08899508819610803, 0.0157684971366377, -0.37256669069618165, 0.1020307751258813, -0.1963638644499172, 0.050895846298988634, -0.1359337516450545, -0.05476143782670122, -0.029974226643389557, -0.30988321430638843, 0.03681475463028099, 0.10075966601393052, 0.029668175590424135, -0.06050803320457427, -0.11411371678834603, -0.03007444396470895, 0.16409350150795599, -0.05545538327714894, 0.06355982694159527, 0.12213135856706815, -0.19052432149986825, -0.13882842692172354, 0.3111305122673955, -0.06259114539854982, -0.2163437696983151, 0.20322711404047109, -0.06010094040539116, -0.12183526331708501, 0.10074106327790235, 0.21184126241686976, 0.11237486370927877, -0.13096628797280746, 0.011166093947914695, -0.037340362140509696, 0.19069906652328514, 0.09070068033456448, 0.009481913084441441, 0.16160447473105574, 0.2649950222347841, 0.030700613278202667, 0.16648950673490098, -0.20443168210026452, -0.049363051253576054, -0.2144359359108854, -0.08990916217000977, -0.16814019647981263, -0.09660973576094312, -0.1325261290678879, -0.09962604202363375, 0.4294041898157004, 0.25241929775109473, 0.21420235003443805, 0.14816248951371694, 0.35458420244339367, -0.013767058077497668, 0.1739878977740383, 0.1304630937406078, 0.1548975871354785, 0.05146441268291147, 0.12437241683143102, -0.14328930735410678, 0.0512468174759609, 0.10188853374538234] |
1,802.02612 | Penetration of cosmic rays into dense molecular clouds: role of diffuse
envelope | A flux of cosmic rays (CRs) propagating through a diffuse ionized gas can
excite MHD waves, thus generating magnetic disturbances. We propose a generic
model of CR penetration into molecular clouds through their diffuse envelopes,
and identify the leading physical processes controlling their transport on the
way from a highly ionized interstellar medium to a dense interior of the cloud.
The model allows us to describe a transition between a free streaming of CRs
and their diffusive propagation, determined by the scattering on the
self-generated disturbances. A self consistent set of equations, governing the
diffusive transport regime in an envelope and the MHD turbulence generated by
the modulated CR flux, is essentially characterized by two dimensionless
numbers. We demonstrate a remarkable mutual complementarity of different
mechanisms leading to the onset of the diffusive regime, which results in a
universal energy spectrum of the modulated CRs. In conclusion, we briefly
discuss implications of our results for several fundamental astrophysical
problems, such as the spatial distribution of CRs in the Galaxy as well as the
ionization, heating, and chemistry in dense molecular clouds.
| astro-ph.HE | a flux of cosmic rays crs propagating through a diffuse ionized gas can excite mhd waves thus generating magnetic disturbances we propose a generic model of cr penetration into molecular clouds through their diffuse envelopes and identify the leading physical processes controlling their transport on the way from a highly ionized interstellar medium to a dense interior of the cloud the model allows us to describe a transition between a free streaming of crs and their diffusive propagation determined by the scattering on the selfgenerated disturbances a self consistent set of equations governing the diffusive transport regime in an envelope and the mhd turbulence generated by the modulated cr flux is essentially characterized by two dimensionless numbers we demonstrate a remarkable mutual complementarity of different mechanisms leading to the onset of the diffusive regime which results in a universal energy spectrum of the modulated crs in conclusion we briefly discuss implications of our results for several fundamental astrophysical problems such as the spatial distribution of crs in the galaxy as well as the ionization heating and chemistry in dense molecular clouds | [['a', 'flux', 'of', 'cosmic', 'rays', 'crs', 'propagating', 'through', 'a', 'diffuse', 'ionized', 'gas', 'can', 'excite', 'mhd', 'waves', 'thus', 'generating', 'magnetic', 'disturbances', 'we', 'propose', 'a', 'generic', 'model', 'of', 'cr', 'penetration', 'into', 'molecular', 'clouds', 'through', 'their', 'diffuse', 'envelopes', 'and', 'identify', 'the', 'leading', 'physical', 'processes', 'controlling', 'their', 'transport', 'on', 'the', 'way', 'from', 'a', 'highly', 'ionized', 'interstellar', 'medium', 'to', 'a', 'dense', 'interior', 'of', 'the', 'cloud', 'the', 'model', 'allows', 'us', 'to', 'describe', 'a', 'transition', 'between', 'a', 'free', 'streaming', 'of', 'crs', 'and', 'their', 'diffusive', 'propagation', 'determined', 'by', 'the', 'scattering', 'on', 'the', 'selfgenerated', 'disturbances', 'a', 'self', 'consistent', 'set', 'of', 'equations', 'governing', 'the', 'diffusive', 'transport', 'regime', 'in', 'an', 'envelope', 'and', 'the', 'mhd', 'turbulence', 'generated', 'by', 'the', 'modulated', 'cr', 'flux', 'is', 'essentially', 'characterized', 'by', 'two', 'dimensionless', 'numbers', 'we', 'demonstrate', 'a', 'remarkable', 'mutual', 'complementarity', 'of', 'different', 'mechanisms', 'leading', 'to', 'the', 'onset', 'of', 'the', 'diffusive', 'regime', 'which', 'results', 'in', 'a', 'universal', 'energy', 'spectrum', 'of', 'the', 'modulated', 'crs', 'in', 'conclusion', 'we', 'briefly', 'discuss', 'implications', 'of', 'our', 'results', 'for', 'several', 'fundamental', 'astrophysical', 'problems', 'such', 'as', 'the', 'spatial', 'distribution', 'of', 'crs', 'in', 'the', 'galaxy', 'as', 'well', 'as', 'the', 'ionization', 'heating', 'and', 'chemistry', 'in', 'dense', 'molecular', 'clouds']] | [-0.15573730717865925, 0.19009353097559414, -0.03452672051955323, 0.08935873959411594, -0.031434805832226964, -0.020265594274011436, 0.027948701205581055, 0.3537508968253574, -0.32391729996184615, -0.2734778382974929, 0.00046491002321798994, -0.2447399295293578, -0.0865891720245474, 0.2122881910763681, 0.05765823002657673, 0.008128706876829123, 0.0007618096739424197, -0.07691032499929078, 0.003936540901413939, -0.1443193042136276, 0.33607406342577045, 0.12780527049258805, 0.23585094315982655, 0.06827549989083113, 0.11095554551504583, -0.09113952947924561, -0.032843703779685235, 0.005627034911216952, -0.1217202399831615, 0.09905880940717887, 0.1844648556264107, 0.08284952660356211, 0.21995460549472362, -0.49665788759204726, -0.33007958183548725, 0.03196489868958311, 0.22004053293269396, 0.0761394321459258, -0.06214607311415908, -0.26861926220686727, 0.025335978671589363, -0.16661703713413184, -0.1613940991363514, 0.003070072654264243, -0.016045177217768453, 0.07408353501354545, -0.24945600493682435, 0.09589661331718674, 0.05397524990884906, 0.017558335933772568, -0.11500735157677512, -0.024456085192132226, -0.03150120176611602, 0.09994591923060091, 0.04726163250939581, -0.0024874266365656206, 0.20306825218979496, -0.18049193440308764, -0.05091576513355773, 0.44192944698869274, -0.07361505770263421, -0.13979839564038013, 0.25548018636027586, -0.1769353256987611, -0.09804503462992567, 0.19398176296259076, 0.19083703142971584, 0.0797758860769553, -0.16313188997205366, 0.040179718649838096, -0.04669408733604054, 0.10653369343011172, 0.050177382607558406, 0.041872437115972834, 0.2673863196431644, 0.14744831552183596, 0.03884447483057722, 0.11296981788183773, -0.13357644768313437, -0.06516359056068265, -0.2770756408691185, -0.135240989306283, -0.13609361313978077, 0.07800774010623811, -0.10398889058983489, -0.17071000818492463, 0.37349408838025794, 0.1646741866442833, 0.21022234730247552, -0.026737787519602197, 0.32466005633497685, 0.098287477091843, -0.021168554267326358, 0.14129370723809861, 0.2577242355186554, 0.1939011217668673, 0.11456317180453784, -0.2576716417891812, 0.08906009598527083, 0.03206798865958966] |
1,802.02613 | Measurement of the inelastic proton-proton cross section at $\sqrt{s}=$
13 TeV | A measurement of the inelastic proton-proton cross section with the CMS
detector at a center-of-mass energy of $\sqrt{s} =$ 13 TeV is presented. The
analysis is based on events with energy deposits in the forward calorimeters,
which cover pseudorapidities of -6.6 $< \eta <$ -3.0 and +3.0 $< \eta <$ +5.2.
An inelastic cross section of 68.6 $\pm$ 0.5 (syst) $\pm$ 1.6 (lumi) mb is
obtained for events with $M_\mathrm{X} >$ 4.1 GeV and/or $M_\mathrm{Y} >$ 13
GeV, where $M_\mathrm{X}$ and $M_\mathrm{Y}$ are the masses of the diffractive
dissociation systems at negative and positive pseudorapidities, respectively.
The results are compared with those from other experiments as well as to
predictions from high-energy hadron-hadron interaction models.
| hep-ex | a measurement of the inelastic protonproton cross section with the cms detector at a centerofmass energy of sqrts 13 tev is presented the analysis is based on events with energy deposits in the forward calorimeters which cover pseudorapidities of 66 eta 30 and 30 eta 52 an inelastic cross section of 686 pm 05 syst pm 16 lumi mb is obtained for events with m_mathrmx 41 gev andor m_mathrmy 13 gev where m_mathrmx and m_mathrmy are the masses of the diffractive dissociation systems at negative and positive pseudorapidities respectively the results are compared with those from other experiments as well as to predictions from highenergy hadronhadron interaction models | [['a', 'measurement', 'of', 'the', 'inelastic', 'protonproton', 'cross', 'section', 'with', 'the', 'cms', 'detector', 'at', 'a', 'centerofmass', 'energy', 'of', 'sqrts', '13', 'tev', 'is', 'presented', 'the', 'analysis', 'is', 'based', 'on', 'events', 'with', 'energy', 'deposits', 'in', 'the', 'forward', 'calorimeters', 'which', 'cover', 'pseudorapidities', 'of', '66', 'eta', '30', 'and', '30', 'eta', '52', 'an', 'inelastic', 'cross', 'section', 'of', '686', 'pm', '05', 'syst', 'pm', '16', 'lumi', 'mb', 'is', 'obtained', 'for', 'events', 'with', 'm_mathrmx', '41', 'gev', 'andor', 'm_mathrmy', '13', 'gev', 'where', 'm_mathrmx', 'and', 'm_mathrmy', 'are', 'the', 'masses', 'of', 'the', 'diffractive', 'dissociation', 'systems', 'at', 'negative', 'and', 'positive', 'pseudorapidities', 'respectively', 'the', 'results', 'are', 'compared', 'with', 'those', 'from', 'other', 'experiments', 'as', 'well', 'as', 'to', 'predictions', 'from', 'highenergy', 'hadronhadron', 'interaction', 'models']] | [-0.045119987855904806, 0.20162985298273545, -0.06320844987793914, 0.10697078486829821, 0.050670892360426906, -0.10205350961219871, -0.01821652051931212, 0.33112423606919794, -0.15015879704810256, -0.4265814935788512, -0.0041908607286904095, -0.47106305667954795, 0.11631740139850047, 0.21132425284057083, 0.07567019661765476, 0.09658209130800557, 0.13278345547546194, 0.020417117917875073, -0.026049852362429758, -0.18392122905912264, 0.2229301686802844, 0.1257552024644782, 0.19658192071431088, 0.15489333774894476, 0.10051328508416191, 0.07568765856887934, -0.038059397214004455, -0.08695982615375575, -0.13958785173023022, 0.06247069763529273, 0.2854357036510507, -0.01853374144466559, 0.09704619318352274, -0.2853206054786361, -0.0388257354849352, 0.08021186865462025, 0.10068172394333161, -0.027231061739961284, -0.015390556583506108, -0.3238350779283792, 0.16233117665814342, -0.23712809533671528, -0.07764336456685274, 0.06502164132401066, 0.02887549047042036, 0.009569251716558664, -0.2950636134373094, 0.17173175989289963, -0.08022230175512685, 0.08735499175634447, -0.08856001335392785, -0.27905204941360456, -0.07480598264154187, -0.07631172574968692, 0.07191257709681215, 0.11950162991349814, 0.17675804459700747, -0.1278965233359486, -0.20973605127732778, 0.3605469596255922, -0.00820521809125565, -0.10876514923315109, 0.18458118808745705, -0.21156752572553056, -0.08283118260497192, 0.26322284797733686, 0.24137856306965058, 0.07547191062827928, -0.2193742092206793, 0.049329292458012035, 0.02147451163498017, 0.22690059963332596, 0.10900141581901754, 0.02423251567206363, 0.15325290660312363, 0.24416592444802793, -0.03499094965946773, 0.004404127613733575, -0.2435461840930588, -0.055132377141524316, -0.4261296239784778, -0.0815174791781794, -0.040169417524253424, 0.10796468600055273, -0.08033202136034819, 0.019080898680566054, 0.2756306186388686, 0.0465374044941646, 0.36868264653526667, 0.029170198927255662, 0.2623447640183962, 0.09597642028062903, 0.07274030155572549, 0.0860717041101658, 0.32725338332073867, 0.18166135013419785, 0.21116355048791277, -0.12067257049757074, -0.02024120601544262, -0.026496804444523493] |
1,802.02614 | Enhance word representation for out-of-vocabulary on Ubuntu dialogue
corpus | Ubuntu dialogue corpus is the largest public available dialogue corpus to
make it feasible to build end-to-end deep neural network models directly from
the conversation data. One challenge of Ubuntu dialogue corpus is the large
number of out-of-vocabulary words. In this paper we proposed a method which
combines the general pre-trained word embedding vectors with those generated on
the task-specific training set to address this issue. We integrated character
embedding into Chen et al's Enhanced LSTM method (ESIM) and used it to evaluate
the effectiveness of our proposed method. For the task of next utterance
selection, the proposed method has demonstrated a significant performance
improvement against original ESIM and the new model has achieved
state-of-the-art results on both Ubuntu dialogue corpus and Douban conversation
corpus. In addition, we investigated the performance impact of end-of-utterance
and end-of-turn token tags.
| cs.CL | ubuntu dialogue corpus is the largest public available dialogue corpus to make it feasible to build endtoend deep neural network models directly from the conversation data one challenge of ubuntu dialogue corpus is the large number of outofvocabulary words in this paper we proposed a method which combines the general pretrained word embedding vectors with those generated on the taskspecific training set to address this issue we integrated character embedding into chen et als enhanced lstm method esim and used it to evaluate the effectiveness of our proposed method for the task of next utterance selection the proposed method has demonstrated a significant performance improvement against original esim and the new model has achieved stateoftheart results on both ubuntu dialogue corpus and douban conversation corpus in addition we investigated the performance impact of endofutterance and endofturn token tags | [['ubuntu', 'dialogue', 'corpus', 'is', 'the', 'largest', 'public', 'available', 'dialogue', 'corpus', 'to', 'make', 'it', 'feasible', 'to', 'build', 'endtoend', 'deep', 'neural', 'network', 'models', 'directly', 'from', 'the', 'conversation', 'data', 'one', 'challenge', 'of', 'ubuntu', 'dialogue', 'corpus', 'is', 'the', 'large', 'number', 'of', 'outofvocabulary', 'words', 'in', 'this', 'paper', 'we', 'proposed', 'a', 'method', 'which', 'combines', 'the', 'general', 'pretrained', 'word', 'embedding', 'vectors', 'with', 'those', 'generated', 'on', 'the', 'taskspecific', 'training', 'set', 'to', 'address', 'this', 'issue', 'we', 'integrated', 'character', 'embedding', 'into', 'chen', 'et', 'als', 'enhanced', 'lstm', 'method', 'esim', 'and', 'used', 'it', 'to', 'evaluate', 'the', 'effectiveness', 'of', 'our', 'proposed', 'method', 'for', 'the', 'task', 'of', 'next', 'utterance', 'selection', 'the', 'proposed', 'method', 'has', 'demonstrated', 'a', 'significant', 'performance', 'improvement', 'against', 'original', 'esim', 'and', 'the', 'new', 'model', 'has', 'achieved', 'stateoftheart', 'results', 'on', 'both', 'ubuntu', 'dialogue', 'corpus', 'and', 'douban', 'conversation', 'corpus', 'in', 'addition', 'we', 'investigated', 'the', 'performance', 'impact', 'of', 'endofutterance', 'and', 'endofturn', 'token', 'tags']] | [-0.05376497129943684, -0.04070952494227647, -0.026103547623000333, 0.06268259437001025, -0.17397770425644668, -0.141559439599531, 0.06874417031462556, 0.43245205840598927, -0.24282209298371193, -0.3543752865138443, 0.009871510406412239, -0.326899446111961, -0.14046432691741817, 0.22106403593240767, -0.13399596544947937, 0.10566344732441174, 0.1916572638042951, 0.06522423126836763, 0.014701274628105172, -0.3674225442648532, 0.2982833927487071, 0.0543116426677868, 0.42655596539486934, 0.018790542768368865, 0.1676390055748872, -0.06062214841567368, -0.055245748806037824, -0.06463320855897627, -0.04520838428288698, 0.1792911935434507, 0.34656934327748967, 0.21227112660918684, 0.35115867698170844, -0.3467422268305817, -0.18599861009848595, 0.044627533851694455, 0.1110991270937379, 0.13190701064385174, -0.02896520921137918, -0.4163378035228183, 0.11769235659013401, -0.2589440188121244, 0.07275556139036143, -0.11957426771630336, -0.007536433939652069, -0.056531410073745916, -0.2665505115211309, 0.007817773744939778, 0.11691517991958743, 0.040286562109814725, -0.03403764840956424, -0.137409430805315, 0.010868787469791018, 0.16371437993893115, 0.05376603383227612, 0.12743680021321116, 0.09513266040369134, -0.13538045829953754, -0.15081885178151955, 0.34118060117764193, -0.12625909273097985, -0.21397595350922893, 0.16211057943461912, 0.014900939960549347, -0.1361319174425826, 0.03367004160137072, 0.2671065485116815, 0.06867765061757833, -0.17559175883304246, 0.005059238648582522, -0.08531209790440154, 0.24683010654972634, 0.06625466434842478, -0.03144116527494383, 0.139317010335597, 0.33398625604854215, -0.06209118561275358, 0.14722385996252463, -0.10722782183268591, -0.054314371724993274, -0.17813358461674655, -0.09364555786486144, -0.2180963949211975, -0.06012958331699789, -0.07121208512324527, -0.12594940866017373, 0.4079363047464812, 0.31302347379892953, 0.14418879707078755, 0.11864961690633102, 0.3257952587012827, -0.024125210080787805, 0.12349420544703281, 0.1303111428397463, 0.13621339656711712, -0.043604148504235885, 0.15420388202964716, -0.19027646717846558, 0.08742028354143683, 0.085730574107355] |
1,802.02615 | Effective Quantization Approaches for Recurrent Neural Networks | Deep learning, and in particular Recurrent Neural Networks (RNN) have shown
superior accuracy in a large variety of tasks including machine translation,
language understanding, and movie frame generation. However, these deep
learning approaches are very expensive in terms of computation. In most cases,
Graphic Processing Units (GPUs) are in used for large scale implementations.
Meanwhile, energy efficient RNN approaches are proposed for deploying solutions
on special purpose hardware including Field Programming Gate Arrays (FPGAs) and
mobile platforms. In this paper, we propose an effective quantization approach
for Recurrent Neural Networks (RNN) techniques including Long Short Term Memory
(LSTM), Gated Recurrent Units (GRU), and Convolutional Long Short Term Memory
(ConvLSTM). We have implemented different quantization methods including Binary
Connect {-1, 1}, Ternary Connect {-1, 0, 1}, and Quaternary Connect {-1, -0.5,
0.5, 1}. These proposed approaches are evaluated on different datasets for
sentiment analysis on IMDB and video frame predictions on the moving MNIST
dataset. The experimental results are compared against the full precision
versions of the LSTM, GRU, and ConvLSTM. They show promising results for both
sentiment analysis and video frame prediction.
| cs.CV | deep learning and in particular recurrent neural networks rnn have shown superior accuracy in a large variety of tasks including machine translation language understanding and movie frame generation however these deep learning approaches are very expensive in terms of computation in most cases graphic processing units gpus are in used for large scale implementations meanwhile energy efficient rnn approaches are proposed for deploying solutions on special purpose hardware including field programming gate arrays fpgas and mobile platforms in this paper we propose an effective quantization approach for recurrent neural networks rnn techniques including long short term memory lstm gated recurrent units gru and convolutional long short term memory convlstm we have implemented different quantization methods including binary connect 1 1 ternary connect 1 0 1 and quaternary connect 1 05 05 1 these proposed approaches are evaluated on different datasets for sentiment analysis on imdb and video frame predictions on the moving mnist dataset the experimental results are compared against the full precision versions of the lstm gru and convlstm they show promising results for both sentiment analysis and video frame prediction | [['deep', 'learning', 'and', 'in', 'particular', 'recurrent', 'neural', 'networks', 'rnn', 'have', 'shown', 'superior', 'accuracy', 'in', 'a', 'large', 'variety', 'of', 'tasks', 'including', 'machine', 'translation', 'language', 'understanding', 'and', 'movie', 'frame', 'generation', 'however', 'these', 'deep', 'learning', 'approaches', 'are', 'very', 'expensive', 'in', 'terms', 'of', 'computation', 'in', 'most', 'cases', 'graphic', 'processing', 'units', 'gpus', 'are', 'in', 'used', 'for', 'large', 'scale', 'implementations', 'meanwhile', 'energy', 'efficient', 'rnn', 'approaches', 'are', 'proposed', 'for', 'deploying', 'solutions', 'on', 'special', 'purpose', 'hardware', 'including', 'field', 'programming', 'gate', 'arrays', 'fpgas', 'and', 'mobile', 'platforms', 'in', 'this', 'paper', 'we', 'propose', 'an', 'effective', 'quantization', 'approach', 'for', 'recurrent', 'neural', 'networks', 'rnn', 'techniques', 'including', 'long', 'short', 'term', 'memory', 'lstm', 'gated', 'recurrent', 'units', 'gru', 'and', 'convolutional', 'long', 'short', 'term', 'memory', 'convlstm', 'we', 'have', 'implemented', 'different', 'quantization', 'methods', 'including', 'binary', 'connect', '1', '1', 'ternary', 'connect', '1', '0', '1', 'and', 'quaternary', 'connect', '1', '05', '05', '1', 'these', 'proposed', 'approaches', 'are', 'evaluated', 'on', 'different', 'datasets', 'for', 'sentiment', 'analysis', 'on', 'imdb', 'and', 'video', 'frame', 'predictions', 'on', 'the', 'moving', 'mnist', 'dataset', 'the', 'experimental', 'results', 'are', 'compared', 'against', 'the', 'full', 'precision', 'versions', 'of', 'the', 'lstm', 'gru', 'and', 'convlstm', 'they', 'show', 'promising', 'results', 'for', 'both', 'sentiment', 'analysis', 'and', 'video', 'frame', 'prediction']] | [-0.09815831099327264, 0.003190499562261611, 0.026963853154134434, 0.10871572924584692, -0.06315823448668388, -0.27854523112726204, -0.018532340700263515, 0.5174509375509653, -0.27205857440396236, -0.31310077146134485, 0.08822365773708693, -0.29144208803440314, -0.19838313637608354, 0.23600459014894543, -0.11460695612985657, 0.11649286095212869, 0.1877055910241964, 0.04953114480128164, -0.07711803113832522, -0.31102895677591175, 0.2169831821433995, 0.03030390392926235, 0.36208193811618694, -0.00885064312727651, 0.13189150419362544, -0.061273737055771466, -0.03796140811083695, -0.06014936781739779, -0.044949027201785084, 0.15183256478381477, 0.3057671558408701, 0.14061563707642502, 0.3162677393340925, -0.4852468342428188, -0.23098526057111776, 0.011910625216602296, 0.15761812608324471, 0.08046466636461536, -0.020997522644452996, -0.2946118908341984, 0.13830403769312039, -0.22209608727544136, 0.10443922334893065, -0.20062550977844704, 0.03536688073878535, 0.04282588766219995, -0.2430575557640283, 0.009273085262655833, 0.07709557123054944, 0.08138855445904883, -0.07153055009721257, -0.17983932606428146, 0.10504232139766707, 0.15450195143521242, 0.04265107524294693, 0.09623955187623154, 0.12414048421727544, -0.17433029858799712, -0.20021548159394906, 0.32832439145544073, -0.10010669048322918, -0.22658248848900978, 0.2008161020495898, 0.016893977301891197, -0.2048130610440909, 0.022541578643530565, 0.2616552231029945, 0.11276357951522856, -0.13259955414488994, 0.033937595234569774, 0.011198874640055922, 0.1934316583735111, 0.08702151917668244, 0.04964582164321545, 0.1999289469670627, 0.3228814876548803, -0.06470197108689348, 0.08501253904682676, -0.16385991256786409, -0.11577622971118806, -0.1827677947643039, -0.08455980339108014, -0.17163667651558562, -0.002692289562169258, -0.14754032924359378, -0.1258782485631425, 0.4018742061107532, 0.2162010849320463, 0.14961793330231948, 0.18597618123045662, 0.34316384382955323, 0.004409709208450474, 0.20006015804432498, 0.12209648867636654, 0.13865188225287597, 0.03445763099979568, 0.20083183429336973, -0.12506299225260392, 0.028131320684953786, 0.050437212276917234] |
1,802.02616 | Heavy Quarkonium Production at Threshold: from JLab to EIC | In this contribution we present opportunities to address questions about the
origin of mass and spin, probe the existence and nature of the LHCb pentaquark
state, and probe the color Van der Waal forces among two color neutral hadrons.
The key reaction is elastic production of heavy quarkonia (J/psi and Upsilon)
on the nucleon from threshold to large nucleon-quarkonium invariant masses.
This is possible when combining the energy range of two high luminosity
facilities, Jefferson Lab 12 GeV and an electron ion collider (EIC).
| hep-ex nucl-ex | in this contribution we present opportunities to address questions about the origin of mass and spin probe the existence and nature of the lhcb pentaquark state and probe the color van der waal forces among two color neutral hadrons the key reaction is elastic production of heavy quarkonia jpsi and upsilon on the nucleon from threshold to large nucleonquarkonium invariant masses this is possible when combining the energy range of two high luminosity facilities jefferson lab 12 gev and an electron ion collider eic | [['in', 'this', 'contribution', 'we', 'present', 'opportunities', 'to', 'address', 'questions', 'about', 'the', 'origin', 'of', 'mass', 'and', 'spin', 'probe', 'the', 'existence', 'and', 'nature', 'of', 'the', 'lhcb', 'pentaquark', 'state', 'and', 'probe', 'the', 'color', 'van', 'der', 'waal', 'forces', 'among', 'two', 'color', 'neutral', 'hadrons', 'the', 'key', 'reaction', 'is', 'elastic', 'production', 'of', 'heavy', 'quarkonia', 'jpsi', 'and', 'upsilon', 'on', 'the', 'nucleon', 'from', 'threshold', 'to', 'large', 'nucleonquarkonium', 'invariant', 'masses', 'this', 'is', 'possible', 'when', 'combining', 'the', 'energy', 'range', 'of', 'two', 'high', 'luminosity', 'facilities', 'jefferson', 'lab', '12', 'gev', 'and', 'an', 'electron', 'ion', 'collider', 'eic']] | [-0.061163777230217695, 0.26796768339935, -0.08879366589756402, 0.12303694996264684, -0.04527524074382452, -0.1273257487105677, 0.01688454214326409, 0.3196134997464447, -0.20874165705438838, -0.29194629652403203, -0.07646829188459116, -0.3676080988181463, 0.06575936673725226, 0.12954069507947888, 0.07935830008193671, 0.12094161709972534, 0.06265829234799168, -0.06314392148303878, -0.015602215867158565, -0.20248946867580245, 0.358658918392766, 0.08066937220787787, 0.20703462553939905, 0.2574222533464297, 0.07231171856667981, 0.04057737607901624, 0.007397584687968918, -0.08194252086455474, -0.1435835373094193, 0.0768065475129399, 0.2787674795162965, 0.07537234276645334, 0.1766054970829422, -0.35661520577787637, -0.07242915121816008, 0.10545052221628377, 0.09943130543505975, 0.11948993140046137, -0.08265047231324421, -0.29073226560715093, 0.0688652313280716, -0.23081695928002696, -0.17091702070670672, -0.04402372506391033, 0.028359517320451968, -0.01366864733891674, -0.26126050213015223, 0.0646820797035134, -0.06289357972241578, 0.039382800349056814, -0.09434008805070028, -0.2219720282647983, -0.01171161663292133, 0.018130134049514083, 0.077164892229274, 0.10435575896667888, 0.20678469218336135, -0.18631422565969447, -0.16808778788131404, 0.3895386220292603, 0.006293444608124983, -0.07836567446679236, 0.20537220566612052, -0.2095506921865001, -0.12852032032671823, 0.1123221417978765, 0.2393943457359291, 0.047007111254630675, -0.2278022262787079, 0.059241024689631064, -0.017914439659532023, 0.18654995640209093, 0.12407495053653347, 0.12824010604386588, 0.25790320629680374, 0.2036586624587022, 0.011961106362427214, 0.03628766361405899, -0.12234675796444427, -0.023925896039013808, -0.34968313856431876, -0.13563545720360007, -0.1124062634477145, 0.11073036006713532, -0.01307921700585628, -0.043595713899886035, 0.3879095316830888, 0.09918526842270091, 0.266155323619584, -0.07666005920450461, 0.3179402461314731, 0.037588491575113576, 0.02394911213336142, 0.06747532447190613, 0.31200684925698374, 0.1849062134545431, 0.1674173728181386, -0.3097144554913358, 0.015046431452627799, 0.03087405419448413] |
1,802.02617 | Recognition of Acoustic Events Using Masked Conditional Neural Networks | Automatic feature extraction using neural networks has accomplished
remarkable success for images, but for sound recognition, these models are
usually modified to fit the nature of the multi-dimensional temporal
representation of the audio signal in spectrograms. This may not efficiently
harness the time-frequency representation of the signal. The ConditionaL Neural
Network (CLNN) takes into consideration the interrelation between the temporal
frames, and the Masked ConditionaL Neural Network (MCLNN) extends upon the CLNN
by forcing a systematic sparseness over the network's weights using a binary
mask. The masking allows the network to learn about frequency bands rather than
bins, mimicking a filterbank used in signal transformations such as MFCC.
Additionally, the Mask is designed to consider various combinations of
features, which automates the feature hand-crafting process. We applied the
MCLNN for the Environmental Sound Recognition problem using the Urbansound8k,
YorNoise, ESC-10 and ESC-50 datasets. The MCLNN have achieved competitive
performance compared to state-of-the-art Convolutional Neural Networks and
hand-crafted attempts.
| cs.LG cs.SD eess.AS stat.ML | automatic feature extraction using neural networks has accomplished remarkable success for images but for sound recognition these models are usually modified to fit the nature of the multidimensional temporal representation of the audio signal in spectrograms this may not efficiently harness the timefrequency representation of the signal the conditional neural network clnn takes into consideration the interrelation between the temporal frames and the masked conditional neural network mclnn extends upon the clnn by forcing a systematic sparseness over the networks weights using a binary mask the masking allows the network to learn about frequency bands rather than bins mimicking a filterbank used in signal transformations such as mfcc additionally the mask is designed to consider various combinations of features which automates the feature handcrafting process we applied the mclnn for the environmental sound recognition problem using the urbansound8k yornoise esc10 and esc50 datasets the mclnn have achieved competitive performance compared to stateoftheart convolutional neural networks and handcrafted attempts | [['automatic', 'feature', 'extraction', 'using', 'neural', 'networks', 'has', 'accomplished', 'remarkable', 'success', 'for', 'images', 'but', 'for', 'sound', 'recognition', 'these', 'models', 'are', 'usually', 'modified', 'to', 'fit', 'the', 'nature', 'of', 'the', 'multidimensional', 'temporal', 'representation', 'of', 'the', 'audio', 'signal', 'in', 'spectrograms', 'this', 'may', 'not', 'efficiently', 'harness', 'the', 'timefrequency', 'representation', 'of', 'the', 'signal', 'the', 'conditional', 'neural', 'network', 'clnn', 'takes', 'into', 'consideration', 'the', 'interrelation', 'between', 'the', 'temporal', 'frames', 'and', 'the', 'masked', 'conditional', 'neural', 'network', 'mclnn', 'extends', 'upon', 'the', 'clnn', 'by', 'forcing', 'a', 'systematic', 'sparseness', 'over', 'the', 'networks', 'weights', 'using', 'a', 'binary', 'mask', 'the', 'masking', 'allows', 'the', 'network', 'to', 'learn', 'about', 'frequency', 'bands', 'rather', 'than', 'bins', 'mimicking', 'a', 'filterbank', 'used', 'in', 'signal', 'transformations', 'such', 'as', 'mfcc', 'additionally', 'the', 'mask', 'is', 'designed', 'to', 'consider', 'various', 'combinations', 'of', 'features', 'which', 'automates', 'the', 'feature', 'handcrafting', 'process', 'we', 'applied', 'the', 'mclnn', 'for', 'the', 'environmental', 'sound', 'recognition', 'problem', 'using', 'the', 'urbansound8k', 'yornoise', 'esc10', 'and', 'esc50', 'datasets', 'the', 'mclnn', 'have', 'achieved', 'competitive', 'performance', 'compared', 'to', 'stateoftheart', 'convolutional', 'neural', 'networks', 'and', 'handcrafted', 'attempts']] | [-0.06025444276194689, -0.00493742868560661, -0.07372321925697778, 0.08077055801933529, -0.10792704003633154, -0.15872272752561384, 0.005770540651806359, 0.4649688708419098, -0.30184503458145584, -0.2848252815052961, 0.0663549533729807, -0.2541480509539782, -0.21112131091907527, 0.1768152508737307, -0.11372042298051706, 0.1339988135194842, 0.10148955048931338, 0.041230811448649894, -0.07086062667113316, -0.23318597246138262, 0.28527674843008993, 0.07787017600796527, 0.37322402222058443, -0.04803101572317154, 0.16472123889823567, -0.001793990415650644, -0.08379620555464085, -0.04791023243510435, -0.0008684812611723437, 0.15206522493596672, 0.29656257102947226, 0.19625107103463593, 0.2856571510717084, -0.40159505967027215, -0.29156580563233814, 0.10981287862191896, 0.14073323910666152, 0.10330717195765944, 0.0347561073619165, -0.39089905210443526, 0.07191174445066695, -0.1541669430046142, 0.09341964812631, -0.13695257126509883, -0.03561995247683983, -0.001062646702733598, -0.29071354597535787, 0.05123653691306215, 0.12744508547814493, 0.07597342880937873, -0.038998372707283124, -0.11322342146179179, 0.0003138565063429407, 0.1670246138384778, -0.020088182948124478, 0.05767768995594705, 0.12175661497277833, -0.19185908831202106, -0.10380687210060467, 0.34740927039728137, -0.08792264892948465, -0.2141066580462635, 0.16944092346496786, -0.01905027352261675, -0.13639590657268993, 0.12214121807372504, 0.250182988959117, 0.056086825693167655, -0.17132232018932111, -0.01929558607966262, -0.0034673256162978425, 0.23240710329853848, 0.12130561393178717, 0.038473014752203716, 0.19922778230968013, 0.24387491007535894, -0.012049778280234484, 0.1616245737311112, -0.18897874332349923, -0.023227746244755727, -0.16682281593727302, -0.025926564686679865, -0.19058824814797107, -0.052354820849152155, -0.1315184118241091, -0.12692843591678324, 0.47021733084104106, 0.2153310048713679, 0.21419380225471069, 0.13117936864875468, 0.337479358957491, 0.06822301239096501, 0.1842315872023, 0.04416259643739632, 0.19177842259707661, 0.06494564944775068, 0.15129318557343668, -0.1533866129267395, 0.11301314173143982, 0.06734908207413988] |
1,802.02618 | A Diversity-based Substation Cyber Defense Strategy utilizing Coloring
Games | Growing cybersecurity risks in the power grid require that utilities
implement a variety of security mechanism (SM) composed mostly of VPNs,
firewalls, or other custom security components. While they provide some
protection, they might contain software vulnerabilities which can lead to a
cyber-attack. In this paper, the severity of a cyber-attack has been decreased
by employing a diverse set of SM that reduce repetition of a single
vulnerability. This paper focuses on the allocation of diverse SM and tries to
increase the security of the cyber assets located within the electronic
security perimeter(ESP) of a substation. We have used a graph-based coloring
game in a distributed manner to allocate diverse SM for protecting the cyber
assets. The vulnerability assessment for power grid network is also analyzed
using this game theoretic method. An improved, diversified SMs for worst-case
scenario has been demonstrated by reaching the Nash equilibrium of graph
coloring game. As a case study, we analyze the IEEE-14 and IEEE-118 bus system,
observe the different distributed coloring algorithm for allocating diverse SM
and calculating the overall network criticality.
| cs.CR cs.GT cs.SY | growing cybersecurity risks in the power grid require that utilities implement a variety of security mechanism sm composed mostly of vpns firewalls or other custom security components while they provide some protection they might contain software vulnerabilities which can lead to a cyberattack in this paper the severity of a cyberattack has been decreased by employing a diverse set of sm that reduce repetition of a single vulnerability this paper focuses on the allocation of diverse sm and tries to increase the security of the cyber assets located within the electronic security perimeteresp of a substation we have used a graphbased coloring game in a distributed manner to allocate diverse sm for protecting the cyber assets the vulnerability assessment for power grid network is also analyzed using this game theoretic method an improved diversified sms for worstcase scenario has been demonstrated by reaching the nash equilibrium of graph coloring game as a case study we analyze the ieee14 and ieee118 bus system observe the different distributed coloring algorithm for allocating diverse sm and calculating the overall network criticality | [['growing', 'cybersecurity', 'risks', 'in', 'the', 'power', 'grid', 'require', 'that', 'utilities', 'implement', 'a', 'variety', 'of', 'security', 'mechanism', 'sm', 'composed', 'mostly', 'of', 'vpns', 'firewalls', 'or', 'other', 'custom', 'security', 'components', 'while', 'they', 'provide', 'some', 'protection', 'they', 'might', 'contain', 'software', 'vulnerabilities', 'which', 'can', 'lead', 'to', 'a', 'cyberattack', 'in', 'this', 'paper', 'the', 'severity', 'of', 'a', 'cyberattack', 'has', 'been', 'decreased', 'by', 'employing', 'a', 'diverse', 'set', 'of', 'sm', 'that', 'reduce', 'repetition', 'of', 'a', 'single', 'vulnerability', 'this', 'paper', 'focuses', 'on', 'the', 'allocation', 'of', 'diverse', 'sm', 'and', 'tries', 'to', 'increase', 'the', 'security', 'of', 'the', 'cyber', 'assets', 'located', 'within', 'the', 'electronic', 'security', 'perimeteresp', 'of', 'a', 'substation', 'we', 'have', 'used', 'a', 'graphbased', 'coloring', 'game', 'in', 'a', 'distributed', 'manner', 'to', 'allocate', 'diverse', 'sm', 'for', 'protecting', 'the', 'cyber', 'assets', 'the', 'vulnerability', 'assessment', 'for', 'power', 'grid', 'network', 'is', 'also', 'analyzed', 'using', 'this', 'game', 'theoretic', 'method', 'an', 'improved', 'diversified', 'sms', 'for', 'worstcase', 'scenario', 'has', 'been', 'demonstrated', 'by', 'reaching', 'the', 'nash', 'equilibrium', 'of', 'graph', 'coloring', 'game', 'as', 'a', 'case', 'study', 'we', 'analyze', 'the', 'ieee14', 'and', 'ieee118', 'bus', 'system', 'observe', 'the', 'different', 'distributed', 'coloring', 'algorithm', 'for', 'allocating', 'diverse', 'sm', 'and', 'calculating', 'the', 'overall', 'network', 'criticality']] | [-0.17405404408178213, 0.02921065261482595, -0.06823936746834572, 0.07061813727353691, -0.07371132750074658, -0.22363999185131306, 0.11679594985230453, 0.35266017222018664, -0.24773340991114157, -0.3404844756972171, 0.10153673746094297, -0.29143878853600996, -0.13725498054665908, 0.13799604598766899, -0.1740568977817472, 0.0773224595692114, 0.008443624059745969, 0.009130523695464451, 0.042629061404899776, -0.292314389345169, 0.27929255787656765, 0.057883449780128604, 0.33081217684209513, 0.06470100846046865, 0.03914835504558737, -0.005594271112833235, -0.009454829311346908, 0.031372550397448365, -0.05683327538047136, 0.12727826854508728, 0.3219680366235243, 0.22791586691345284, 0.36919633522122475, -0.42420695758408916, -0.2069864835758499, 0.14127767494600793, 0.14641941073587386, 0.05660185405371532, -0.07484860903330905, -0.2727969035987695, 0.13454073838992203, -0.2811445437640078, -0.07770086826209378, -0.06522331539163956, -0.035955247166698096, 0.007622477408737933, -0.2738100360489666, -0.05947065963899838, -0.010279663951572893, 0.11362723166933336, 0.010380604226598622, -0.10740338898287549, -0.035556815084501425, 0.16072294532714707, 0.047914439140119204, -0.014125662691375546, 0.19221553668158792, -0.11831622902175022, -0.18997442341372792, 0.38743047193113694, 0.011247103469509441, -0.1478654532255947, 0.1479230562774504, -0.0009517828515588732, -0.16072212571321295, 0.10794256831713989, 0.24431311843211706, 0.05034820551294728, -0.19561809192458957, 0.04982780069369286, -0.04516873047239868, 0.1883762395377718, 0.055122804579372374, 0.06440876579533021, 0.20018724733463747, 0.22467380896109382, 0.13005476204807823, 0.14779204249120248, -0.03934791350426773, -0.13166486577651762, -0.2110911907041498, -0.12279269919272955, -0.14372551188104402, 0.026962902307468284, -0.09186787144282614, -0.17567934995611845, 0.42664744348217876, 0.1931153332398899, 0.08427282385159768, 0.05036857233864208, 0.35059492504697737, 0.056489295072378036, 0.0657594527807192, 0.11954533791506274, 0.19154856444318716, -0.002228193723012583, 0.15922045268218354, -0.17682378666309673, 0.13997698935948438, -0.0046690892078584895] |
1,802.02619 | High Performance Rearrangement and Multiplication Routines for Sparse
Tensor Arithmetic | Researchers are increasingly incorporating numeric high-order data, i.e.,
numeric tensors, within their practice. Just like the matrix/vector (MV)
paradigm, the development of multi-purpose, but high-performance, sparse data
structures and algorithms for arithmetic calculations, e.g., those found in
Einstein-like notation, is crucial for the continued adoption of tensors. We
use the example of high-order differential operators to illustrate this need.
As sparse tensor arithmetic is an emerging research topic, with challenges
distinct from the MV paradigm, many aspects require further articulation. We
focus on three core facets. First, aligning with prominent voices in the field,
we emphasise the importance of data structures able to accommodate the
operational complexity of tensor arithmetic. However, we describe a linearised
coordinate (LCO) data structure that provides faster and more memory-efficient
sorting performance. Second, flexible data structures, like the LCO, rely
heavily on sorts and permutations. We introduce an innovative permutation
algorithm, based on radix sort, that is tailored to rearrange already-sorted
sparse data, producing significant performance gains. Third, we introduce a
novel poly-algorithm for sparse tensor products, where hyper-sparsity is a
possibility. Different manifestations of hyper-sparsity demand their own
approach, which our poly-algorithm is the first to provide. These developments
are incorporated within our LibNT and NTToolbox software libraries. Benchmarks,
frequently drawn from the high-order differential operators example,
demonstrate the practical impact of our routines, with speed-ups of 40% or
higher compared to alternative high-performance implementations. Comparisons
against the MATLAB Tensor Toolbox show over 10 times speed improvements. Thus,
these advancements produce significant practical improvements for sparse tensor
arithmetic.
| cs.MS | researchers are increasingly incorporating numeric highorder data ie numeric tensors within their practice just like the matrixvector mv paradigm the development of multipurpose but highperformance sparse data structures and algorithms for arithmetic calculations eg those found in einsteinlike notation is crucial for the continued adoption of tensors we use the example of highorder differential operators to illustrate this need as sparse tensor arithmetic is an emerging research topic with challenges distinct from the mv paradigm many aspects require further articulation we focus on three core facets first aligning with prominent voices in the field we emphasise the importance of data structures able to accommodate the operational complexity of tensor arithmetic however we describe a linearised coordinate lco data structure that provides faster and more memoryefficient sorting performance second flexible data structures like the lco rely heavily on sorts and permutations we introduce an innovative permutation algorithm based on radix sort that is tailored to rearrange alreadysorted sparse data producing significant performance gains third we introduce a novel polyalgorithm for sparse tensor products where hypersparsity is a possibility different manifestations of hypersparsity demand their own approach which our polyalgorithm is the first to provide these developments are incorporated within our libnt and nttoolbox software libraries benchmarks frequently drawn from the highorder differential operators example demonstrate the practical impact of our routines with speedups of 40 or higher compared to alternative highperformance implementations comparisons against the matlab tensor toolbox show over 10 times speed improvements thus these advancements produce significant practical improvements for sparse tensor arithmetic | [['researchers', 'are', 'increasingly', 'incorporating', 'numeric', 'highorder', 'data', 'ie', 'numeric', 'tensors', 'within', 'their', 'practice', 'just', 'like', 'the', 'matrixvector', 'mv', 'paradigm', 'the', 'development', 'of', 'multipurpose', 'but', 'highperformance', 'sparse', 'data', 'structures', 'and', 'algorithms', 'for', 'arithmetic', 'calculations', 'eg', 'those', 'found', 'in', 'einsteinlike', 'notation', 'is', 'crucial', 'for', 'the', 'continued', 'adoption', 'of', 'tensors', 'we', 'use', 'the', 'example', 'of', 'highorder', 'differential', 'operators', 'to', 'illustrate', 'this', 'need', 'as', 'sparse', 'tensor', 'arithmetic', 'is', 'an', 'emerging', 'research', 'topic', 'with', 'challenges', 'distinct', 'from', 'the', 'mv', 'paradigm', 'many', 'aspects', 'require', 'further', 'articulation', 'we', 'focus', 'on', 'three', 'core', 'facets', 'first', 'aligning', 'with', 'prominent', 'voices', 'in', 'the', 'field', 'we', 'emphasise', 'the', 'importance', 'of', 'data', 'structures', 'able', 'to', 'accommodate', 'the', 'operational', 'complexity', 'of', 'tensor', 'arithmetic', 'however', 'we', 'describe', 'a', 'linearised', 'coordinate', 'lco', 'data', 'structure', 'that', 'provides', 'faster', 'and', 'more', 'memoryefficient', 'sorting', 'performance', 'second', 'flexible', 'data', 'structures', 'like', 'the', 'lco', 'rely', 'heavily', 'on', 'sorts', 'and', 'permutations', 'we', 'introduce', 'an', 'innovative', 'permutation', 'algorithm', 'based', 'on', 'radix', 'sort', 'that', 'is', 'tailored', 'to', 'rearrange', 'alreadysorted', 'sparse', 'data', 'producing', 'significant', 'performance', 'gains', 'third', 'we', 'introduce', 'a', 'novel', 'polyalgorithm', 'for', 'sparse', 'tensor', 'products', 'where', 'hypersparsity', 'is', 'a', 'possibility', 'different', 'manifestations', 'of', 'hypersparsity', 'demand', 'their', 'own', 'approach', 'which', 'our', 'polyalgorithm', 'is', 'the', 'first', 'to', 'provide', 'these', 'developments', 'are', 'incorporated', 'within', 'our', 'libnt', 'and', 'nttoolbox', 'software', 'libraries', 'benchmarks', 'frequently', 'drawn', 'from', 'the', 'highorder', 'differential', 'operators', 'example', 'demonstrate', 'the', 'practical', 'impact', 'of', 'our', 'routines', 'with', 'speedups', 'of', '40', 'or', 'higher', 'compared', 'to', 'alternative', 'highperformance', 'implementations', 'comparisons', 'against', 'the', 'matlab', 'tensor', 'toolbox', 'show', 'over', '10', 'times', 'speed', 'improvements', 'thus', 'these', 'advancements', 'produce', 'significant', 'practical', 'improvements', 'for', 'sparse', 'tensor', 'arithmetic']] | [-0.09167584260986873, 0.044188832688382806, -0.04694652075246644, 0.05315387679033902, -0.14342100063034618, -0.13111660987615542, -0.005029650148564571, 0.42209795550387574, -0.26568826902806164, -0.3113201765558753, 0.12033527599465829, -0.2588030334090836, -0.18013304599330748, 0.23421400831270206, -0.07690708402616614, 0.07164650982935947, 0.10159633790543562, 0.00010645806159085754, -0.10553731346958357, -0.2587705622621964, 0.26946526608964155, 0.06509551138754385, 0.3148129577247567, 0.00720293040060813, 0.07685296179956767, -0.022472542418926246, -0.08110671756284467, -0.010813145627419788, -0.05719344683513982, 0.19307672944238996, 0.3189652688890339, 0.19251613415020752, 0.30031087864802564, -0.4894827441108298, -0.1506764669012115, 0.06033351966615885, 0.13488668687770328, 0.09776376451104063, -0.08943266602469825, -0.2540015317311796, 0.08386490019075424, -0.19315314924843477, -0.0761194218532646, -0.171423000475555, -0.002812715988392052, 0.023000604574627936, -0.2496046444852892, 0.014065777698338803, 0.0513597507242195, 0.0816027581804157, 0.004924673046285947, -0.18931850168642503, 0.04853883377402516, 0.10881875192401448, 0.01777803817619217, 0.0005587116681573638, 0.12315520955680079, -0.10302454257009187, -0.1619022970683353, 0.39874290603684237, -0.029325349672894137, -0.1915184168916834, 0.16800669828555972, -0.056494310727357805, -0.18109399042615437, 0.11192695759646122, 0.21305076960349953, 0.09663088925821016, -0.11104292150023783, 0.06491604590866402, 0.025490072244162342, 0.17884818241844302, 0.04964794177725258, 0.04307792290017395, 0.16923886657770412, 0.17756265252309136, 0.039876302684735195, 0.1192109825495868, -0.048087646849861596, -0.11267684484216055, -0.23864275318908085, -0.14719874176857214, -0.13509270845749138, -0.014673404291687734, -0.13707238236007158, -0.18466954788497364, 0.3747666763527638, 0.19669821450894465, 0.14862461663820628, 0.07070027046560484, 0.3514280351958575, 0.040014860216311114, 0.13005680088432686, 0.09816046625531587, 0.17027639330223768, 0.09903800587885943, 0.12310613199940464, -0.14771646192583507, 0.05289421518670907, 0.020218992926759192] |
1,802.0262 | A simple method to determine the time delays in presence of
microlensing: application to HE 0435-1223 and PG1115+080 | A method for determining the time delays in gravitationally lensed quasars is
proposed, which offers a simple and transparent procedure to mitigate the
effects of microlensing. The method is based on fundamental properties of
representation of quadratically integrable functions by their expansions in
orthogonal polynomials series. The method was tested on the artificial light
curves simulated for the Time Delay Challenge campaign TDC0. The new estimates
of the time delays in the gravitationally lensed quasars HE 0435-1223 and PG
1115+080 are obtained and compared with the results reported by other authors
earlier.
| astro-ph.IM | a method for determining the time delays in gravitationally lensed quasars is proposed which offers a simple and transparent procedure to mitigate the effects of microlensing the method is based on fundamental properties of representation of quadratically integrable functions by their expansions in orthogonal polynomials series the method was tested on the artificial light curves simulated for the time delay challenge campaign tdc0 the new estimates of the time delays in the gravitationally lensed quasars he 04351223 and pg 1115080 are obtained and compared with the results reported by other authors earlier | [['a', 'method', 'for', 'determining', 'the', 'time', 'delays', 'in', 'gravitationally', 'lensed', 'quasars', 'is', 'proposed', 'which', 'offers', 'a', 'simple', 'and', 'transparent', 'procedure', 'to', 'mitigate', 'the', 'effects', 'of', 'microlensing', 'the', 'method', 'is', 'based', 'on', 'fundamental', 'properties', 'of', 'representation', 'of', 'quadratically', 'integrable', 'functions', 'by', 'their', 'expansions', 'in', 'orthogonal', 'polynomials', 'series', 'the', 'method', 'was', 'tested', 'on', 'the', 'artificial', 'light', 'curves', 'simulated', 'for', 'the', 'time', 'delay', 'challenge', 'campaign', 'tdc0', 'the', 'new', 'estimates', 'of', 'the', 'time', 'delays', 'in', 'the', 'gravitationally', 'lensed', 'quasars', 'he', '04351223', 'and', 'pg', '1115080', 'are', 'obtained', 'and', 'compared', 'with', 'the', 'results', 'reported', 'by', 'other', 'authors', 'earlier']] | [-0.10242439485053816, 0.052281100768595934, -0.10297048134405327, 0.05045285503855785, -0.1014693430017518, -0.13790601224679014, 0.03651709612408329, 0.38921607006594294, -0.16326235500974176, -0.3086017810780069, 0.08453391921838098, -0.2850678666778233, -0.12839595185916708, 0.2808284669223687, -0.04914215717302716, 0.08511226698148834, 0.06716888156904094, -0.060661438847487065, -0.018976571109226865, -0.3613065184782381, 0.29852224210955447, 0.08089090194350676, 0.22701830344031687, -0.030015773757401366, 0.11655085621928067, -0.027163914252963405, -0.14321370038416478, -0.0106848253920401, -0.09601663686613471, 0.07124511832776277, 0.22505739808042088, 0.12566350516863167, 0.2614073239104903, -0.34122589005805226, -0.20746531742422478, 0.08276913830322093, 0.1473504238124208, 0.09033361729614073, -0.04227720841046666, -0.3573773511401985, 0.030370385141830648, -0.08207251494952841, -0.145648065134478, 0.004900524878631468, 0.026081275230314095, 0.08112120810888566, -0.20456045573455808, 0.106826227507554, -6.610756922189309e-05, 0.03849710449171455, -0.08696513260593233, -0.08529583521126567, 0.01427664864383152, 0.05272977830052538, 0.004547672857449431, 0.02305839526588502, 0.068625590536217, -0.07107015360025284, -0.12314651971277983, 0.3975900357447403, -0.08144738026084783, -0.11022652375876256, 0.15732671892645, -0.118965492685042, -0.15751473519080522, 0.16524857519012268, 0.1994860578308125, 0.18624944750563768, -0.13209750533164683, 0.02260914843582609, -0.030054306879680116, 0.17882749083472174, 0.03987531522390149, 0.03126965500616833, 0.19267489479692734, 0.1236522400184818, 0.013469495112076402, 0.10494662470465181, -0.11925631267038862, -0.019420424032116145, -0.23299250127519885, -0.10774252406807373, -0.18893430113751927, 0.013979393419424963, -0.11289193046373523, -0.11582574305003104, 0.4158492321755899, 0.1171674347664837, 0.18393546842929462, 0.0887167581835377, 0.3188475166123522, 0.1295909259427825, 0.07046616101971544, 0.047480722565365875, 0.30905210497060226, 0.10992415110155454, 0.09620678686516602, -0.24040131279996232, 0.08472236854014108, 0.11716702390644375] |
1,802.02621 | Propagation and stability of flames in inhomogeneous mixtures | We investigate the effect of thermal expansion and gravity on the propagation
and stability of flames in inhomogeneous mixtures. We focus on laminar flames
in the simple configuration of an infinitely long channel with rigid porous
walls in order to understand the effect of inhomogeneities on these fundamental
structures.
| physics.flu-dyn | we investigate the effect of thermal expansion and gravity on the propagation and stability of flames in inhomogeneous mixtures we focus on laminar flames in the simple configuration of an infinitely long channel with rigid porous walls in order to understand the effect of inhomogeneities on these fundamental structures | [['we', 'investigate', 'the', 'effect', 'of', 'thermal', 'expansion', 'and', 'gravity', 'on', 'the', 'propagation', 'and', 'stability', 'of', 'flames', 'in', 'inhomogeneous', 'mixtures', 'we', 'focus', 'on', 'laminar', 'flames', 'in', 'the', 'simple', 'configuration', 'of', 'an', 'infinitely', 'long', 'channel', 'with', 'rigid', 'porous', 'walls', 'in', 'order', 'to', 'understand', 'the', 'effect', 'of', 'inhomogeneities', 'on', 'these', 'fundamental', 'structures']] | [-0.16991476181476395, 0.17259624541757335, -0.09984096732674813, 0.020928462054960583, -0.038913017414434224, -0.03883514399355163, -0.042000070722697645, 0.4102436749594837, -0.27623712359832564, -0.21570402096804916, 0.12970046625158996, -0.20669211808364002, -0.10374300212276225, 0.13663452244078628, -0.02444268758788857, 0.03271545069672319, 0.024507479400050883, -0.0030885805014748964, 0.009421325079640564, -0.20902431860081472, 0.3468761654874804, 0.04217657009709855, 0.31123032756339836, 0.05214602023135034, 0.07219965170536723, -0.03649745531836335, -0.020456112122961452, 0.049152678524961274, -0.23990048840641975, 0.057391313379820515, 0.1424031163641841, -0.06127258891011683, 0.21887367703400704, -0.5360661550443999, -0.270006089224195, 0.03649222721554795, 0.15512868632771531, 0.1455941202157006, -0.03108380449584172, -0.2593738321899151, 0.030711668866629502, -0.11309183554305714, -0.1612873382258172, -0.011331338853556283, 0.02487856138269512, 0.04094995109706509, -0.2079668740304757, 0.09006474626830266, 0.06164599590155543, 0.07503900051649127, -0.08829297165253333, -0.08336334525398453, 0.009414504405719285, 0.1115170871572835, 0.059722395723077415, -0.10174679343721696, 0.08408579125772325, -0.19871422277801498, -0.015144253244661555, 0.4157375581562519, -0.12542981790540245, -0.2176115263861661, 0.2681836930153492, -0.1857088124777466, -0.0809604952786574, 0.12036846163777673, 0.2632397546299866, 0.13597379876680823, -0.10181102521565495, 0.0587088209077982, -0.02971923419711541, 0.13583932801301837, 0.10992573235868192, 0.009407683294646594, 0.2189638953351853, 0.2353699700930631, 0.009872416775597602, 0.17909863465750703, -0.10493742675064321, -0.11947190420397995, -0.2526629147861077, -0.14821936632981714, -0.10521408786987696, 0.05695601446287973, -0.11428659700025919, -0.2564016813982506, 0.35052018297113935, 0.11803875547092484, 0.15628183624536104, -0.03943976444401303, 0.27352576276610546, 0.012105471606613422, -0.002054038927985393, 0.08205903672176051, 0.2767944617234931, 0.22354234165835138, 0.09612951252362406, -0.2812398657658879, 0.06450394172297448, 0.03879393122101925] |
1,802.02622 | Waferscale Electrostatic Quadrupole Array for Multiple Ion Beam
Manipulation | We report on the first through-wafer silicon-based Electrostatic Quadrupole
Array (ESQA) to focus high energy ion beams. This device is a key enabler for a
wafer based accelerator architecture that lends itself to orders-of-magnitude
reduction in cost, volume and weight of charged particle accelerators. ESQs are
a key building block in developing compact Multiple Electrostatic Quadrupole
Array Linear Accelerator (MEQALAC) [1]. In a MEQALAC electrostatic forces are
used to focus ions, and electrostatic field scaling permits high beam current
densities by decreasing the beam aperture size for a given peak electric field
set by breakdown limitations. Using multiple parallel beams, each totaling to
an area A, can result in higher total beam current compared to a single
aperture beam of the same area. Smaller dimensions also allow for higher
focusing electric field gradients and therefore higher average beam current
density. Here we demonstrate that Deep Reactive Ion Etching (DRIE)
micromachined pillar electrodes, electrically isolated by silicon-nitride thin
films enable higher performance ESQA with waferscale scalability. The
fabricated ESQA are able to hold up to1 kV in air. A 3*3 array of 12 keV argon
ion beams are focused in a wafer accelerator unit cell to pave the way for
multiple wafer accelerator.
| physics.acc-ph | we report on the first throughwafer siliconbased electrostatic quadrupole array esqa to focus high energy ion beams this device is a key enabler for a wafer based accelerator architecture that lends itself to ordersofmagnitude reduction in cost volume and weight of charged particle accelerators esqs are a key building block in developing compact multiple electrostatic quadrupole array linear accelerator meqalac 1 in a meqalac electrostatic forces are used to focus ions and electrostatic field scaling permits high beam current densities by decreasing the beam aperture size for a given peak electric field set by breakdown limitations using multiple parallel beams each totaling to an area a can result in higher total beam current compared to a single aperture beam of the same area smaller dimensions also allow for higher focusing electric field gradients and therefore higher average beam current density here we demonstrate that deep reactive ion etching drie micromachined pillar electrodes electrically isolated by siliconnitride thin films enable higher performance esqa with waferscale scalability the fabricated esqa are able to hold up to1 kv in air a 33 array of 12 kev argon ion beams are focused in a wafer accelerator unit cell to pave the way for multiple wafer accelerator | [['we', 'report', 'on', 'the', 'first', 'throughwafer', 'siliconbased', 'electrostatic', 'quadrupole', 'array', 'esqa', 'to', 'focus', 'high', 'energy', 'ion', 'beams', 'this', 'device', 'is', 'a', 'key', 'enabler', 'for', 'a', 'wafer', 'based', 'accelerator', 'architecture', 'that', 'lends', 'itself', 'to', 'ordersofmagnitude', 'reduction', 'in', 'cost', 'volume', 'and', 'weight', 'of', 'charged', 'particle', 'accelerators', 'esqs', 'are', 'a', 'key', 'building', 'block', 'in', 'developing', 'compact', 'multiple', 'electrostatic', 'quadrupole', 'array', 'linear', 'accelerator', 'meqalac', '1', 'in', 'a', 'meqalac', 'electrostatic', 'forces', 'are', 'used', 'to', 'focus', 'ions', 'and', 'electrostatic', 'field', 'scaling', 'permits', 'high', 'beam', 'current', 'densities', 'by', 'decreasing', 'the', 'beam', 'aperture', 'size', 'for', 'a', 'given', 'peak', 'electric', 'field', 'set', 'by', 'breakdown', 'limitations', 'using', 'multiple', 'parallel', 'beams', 'each', 'totaling', 'to', 'an', 'area', 'a', 'can', 'result', 'in', 'higher', 'total', 'beam', 'current', 'compared', 'to', 'a', 'single', 'aperture', 'beam', 'of', 'the', 'same', 'area', 'smaller', 'dimensions', 'also', 'allow', 'for', 'higher', 'focusing', 'electric', 'field', 'gradients', 'and', 'therefore', 'higher', 'average', 'beam', 'current', 'density', 'here', 'we', 'demonstrate', 'that', 'deep', 'reactive', 'ion', 'etching', 'drie', 'micromachined', 'pillar', 'electrodes', 'electrically', 'isolated', 'by', 'siliconnitride', 'thin', 'films', 'enable', 'higher', 'performance', 'esqa', 'with', 'waferscale', 'scalability', 'the', 'fabricated', 'esqa', 'are', 'able', 'to', 'hold', 'up', 'to1', 'kv', 'in', 'air', 'a', '33', 'array', 'of', '12', 'kev', 'argon', 'ion', 'beams', 'are', 'focused', 'in', 'a', 'wafer', 'accelerator', 'unit', 'cell', 'to', 'pave', 'the', 'way', 'for', 'multiple', 'wafer', 'accelerator']] | [-0.12270481776867748, 0.15795663739498114, 0.005699218670137931, -0.020881079364364123, -0.013935358302936476, -0.20613119203310035, -0.006978048915182476, 0.4588468446956938, -0.18728316657764105, -0.3355881185479351, 0.03324601741215742, -0.25031803130167557, -0.010221268418731529, 0.2517831036687796, -0.015264095967885718, 0.107906616235555, 0.03777376339430295, -0.09478942009814974, -0.03570057733496419, -0.1759163314402474, 0.22052572590162264, 0.17227093412628308, 0.37008302709069196, 0.08900169884341198, 0.13775680572158236, -0.021166048347494602, 0.05966226275852738, 0.010565772644517508, -0.06099194996714863, 0.1346940940839067, 0.2590791028397232, 0.009846607599330983, 0.26232610147594665, -0.5235399156901522, -0.18201929526588884, -0.0005122041491912075, 0.15238836522107546, 0.10560346969324558, -0.13227476094286444, -0.20271311225763416, 0.07463654965644155, -0.17191191670480208, -0.1501928451586867, -0.004078845012775479, -0.015499325392105204, 0.09329380396758183, -0.2554846922927814, -0.010329647803596865, 0.013253525417270278, 0.07215872647435363, -0.03443765646861449, -0.17179208133944232, 0.03420175710781037, 0.030704340626443945, -0.04902025941465124, 0.0866357064412082, 0.2799207284717603, -0.08980489260429025, -0.09243901801151942, 0.322160599289916, -0.05538731693308708, -0.1687348194568608, 0.14849013926296853, -0.20613107459552457, -0.04286094575272456, 0.18413428947056149, 0.20661469054320336, 0.0703667632596039, -0.16924190847434809, 0.029943116535421054, 0.0484570868096699, 0.2080077160912992, 0.16312117192579145, 0.014949442819919233, 0.2611996083582904, 0.25309470287797536, 0.11498979394514094, 0.15139020565630515, -0.1457318535771925, 0.029091786586248607, -0.2447785808648613, -0.17379240421300282, -0.14079265613850225, 0.04340815735261671, -0.04314653481716181, -0.12548087442998046, 0.37342432247409924, 0.11563890968537449, 0.1287755343590432, -0.006979524570752389, 0.3314319678179141, 0.05103049416679122, 0.13951600434036174, 0.018376909636554136, 0.21890624916523843, 0.1415216914014381, 0.15804279866793125, -0.21894121241630682, -0.038186728284999485, 0.0005207076629355031] |
1,802.02623 | OTFS: A New Generation of Modulation Addressing the Challenges of 5G | In this paper, we introduce a new 2D modulation scheme referred to as OTFS
(Orthogonal Time Frequency & Space) that multiplexes information QAM symbols
over new class of carrier waveforms that correspond to localized pulses in a
signal representation called the delay-Doppler representation. OTFS constitutes
a far reaching generalization of conventional time and frequency modulations
such as TDM and FDM and, from a broader perspective, it establishes a
conceptual link between Radar and communication. The OTFS waveforms couple with
the wireless channel in a way that directly captures the underlying physics,
yielding a high-resolution delay-Doppler Radar image of the constituent
reflectors. As a result, the time-frequency selective channel is converted into
an invariant, separable and orthogonal interaction, where all received QAM
symbols experience the same localized impairment and all the delay-Doppler
diversity branches are coherently combined. The high resolution delay-Doppler
separation of the reflectors enables OTFS to approach channel capacity with
optimal performance-complexity tradeoff through linear scaling of spectral
efficiency with the MIMO order and robustness to Doppler and multipath channel
conditions. OTFS is an enabler for realizing the full promise of MUMIMO gains
even in challenging 5G deployment settings where adaptation is unrealistic.
| cs.IT math.IT | in this paper we introduce a new 2d modulation scheme referred to as otfs orthogonal time frequency space that multiplexes information qam symbols over new class of carrier waveforms that correspond to localized pulses in a signal representation called the delaydoppler representation otfs constitutes a far reaching generalization of conventional time and frequency modulations such as tdm and fdm and from a broader perspective it establishes a conceptual link between radar and communication the otfs waveforms couple with the wireless channel in a way that directly captures the underlying physics yielding a highresolution delaydoppler radar image of the constituent reflectors as a result the timefrequency selective channel is converted into an invariant separable and orthogonal interaction where all received qam symbols experience the same localized impairment and all the delaydoppler diversity branches are coherently combined the high resolution delaydoppler separation of the reflectors enables otfs to approach channel capacity with optimal performancecomplexity tradeoff through linear scaling of spectral efficiency with the mimo order and robustness to doppler and multipath channel conditions otfs is an enabler for realizing the full promise of mumimo gains even in challenging 5g deployment settings where adaptation is unrealistic | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'new', '2d', 'modulation', 'scheme', 'referred', 'to', 'as', 'otfs', 'orthogonal', 'time', 'frequency', 'space', 'that', 'multiplexes', 'information', 'qam', 'symbols', 'over', 'new', 'class', 'of', 'carrier', 'waveforms', 'that', 'correspond', 'to', 'localized', 'pulses', 'in', 'a', 'signal', 'representation', 'called', 'the', 'delaydoppler', 'representation', 'otfs', 'constitutes', 'a', 'far', 'reaching', 'generalization', 'of', 'conventional', 'time', 'and', 'frequency', 'modulations', 'such', 'as', 'tdm', 'and', 'fdm', 'and', 'from', 'a', 'broader', 'perspective', 'it', 'establishes', 'a', 'conceptual', 'link', 'between', 'radar', 'and', 'communication', 'the', 'otfs', 'waveforms', 'couple', 'with', 'the', 'wireless', 'channel', 'in', 'a', 'way', 'that', 'directly', 'captures', 'the', 'underlying', 'physics', 'yielding', 'a', 'highresolution', 'delaydoppler', 'radar', 'image', 'of', 'the', 'constituent', 'reflectors', 'as', 'a', 'result', 'the', 'timefrequency', 'selective', 'channel', 'is', 'converted', 'into', 'an', 'invariant', 'separable', 'and', 'orthogonal', 'interaction', 'where', 'all', 'received', 'qam', 'symbols', 'experience', 'the', 'same', 'localized', 'impairment', 'and', 'all', 'the', 'delaydoppler', 'diversity', 'branches', 'are', 'coherently', 'combined', 'the', 'high', 'resolution', 'delaydoppler', 'separation', 'of', 'the', 'reflectors', 'enables', 'otfs', 'to', 'approach', 'channel', 'capacity', 'with', 'optimal', 'performancecomplexity', 'tradeoff', 'through', 'linear', 'scaling', 'of', 'spectral', 'efficiency', 'with', 'the', 'mimo', 'order', 'and', 'robustness', 'to', 'doppler', 'and', 'multipath', 'channel', 'conditions', 'otfs', 'is', 'an', 'enabler', 'for', 'realizing', 'the', 'full', 'promise', 'of', 'mumimo', 'gains', 'even', 'in', 'challenging', '5g', 'deployment', 'settings', 'where', 'adaptation', 'is', 'unrealistic']] | [-0.2197984058803208, 0.08881817224397508, -0.05607500357234879, 0.007036824419930423, -0.10048882190471062, -0.19762811453052714, 0.06407978929762627, 0.40831845217032137, -0.27976966001228504, -0.23256188635883246, 0.07937665860810428, -0.1890661821054015, -0.21233307876518007, 0.19436188972762597, -0.10859247511783567, 0.08344323709703634, 0.04898847013481512, 0.006453365603838251, -0.09231537529098478, -0.16855098840712998, 0.2506018356767536, 0.07705754150245628, 0.3751719853975882, -0.03794190266960991, 0.1371953218205412, 0.04237161164890994, -0.017603670249311882, -0.10187970906984027, -0.05163927044211422, 0.07280931467494392, 0.3800006446864702, 0.17034829658856665, 0.2538887807119811, -0.37025924155686457, -0.2937128013470379, 0.07182703936144401, 0.19565848257257532, 0.09033768311736459, -0.061415795028122826, -0.30945245998337323, 0.08539251394695337, -0.22067025345943173, -0.023881411204027696, 0.004566379095345658, -0.0452757360379892, 0.013497235453108547, -0.3541557788173306, 0.03247157039140095, 0.05987290814743616, 0.03343171173734699, -0.05283780302505559, -0.08629440257043476, 0.0453323004646661, 0.15873828042935523, -0.01490392473555252, 0.028150547867028013, 0.03865858516836819, -0.0786156587572913, -0.10246392231014764, 0.3945031745909409, -0.045602131374976526, -0.2539611611505633, 0.16782104669602038, -0.11672253442995752, -0.022479752470724708, 0.18299558462328977, 0.2451373958945699, 0.02452670940719159, -0.13066872677324254, 0.025790929290046193, -0.003043623144106235, 0.20774878165925917, 0.13817108209924098, 0.20492504526006897, 0.17474088551466946, 0.19544014605389512, 0.13548972030469444, 0.12428657906467741, -0.16139336179705444, -0.09093073855631942, -0.21288579934242863, -0.1277898179579507, -0.230460875024633, -0.011199672694361427, -0.10259304505620885, -0.10874653308561259, 0.4168762841806565, 0.13073523947727803, 0.14121157693835892, 0.09434186241353038, 0.4003262302399145, 0.10135967912540862, 0.08034413969240735, 0.04650200439202044, 0.17601932890030406, 0.15356259071630055, 0.13604816715679388, -0.19753166226431285, -0.004975493528055017, 0.001889148021329175] |
1,802.02624 | Nonlinear Model Predictive Guidance for Fixed-wing UAVs Using Identified
Control Augmented Dynamics | As off-the-shelf (OTS) autopilots become more widely available and
user-friendly and the drone market expands, safer, more efficient, and more
complex motion planning and control will become necessary for fixed-wing aerial
robotic platforms. Considering typical low-level attitude stabilization
available on OTS flight controllers, this paper first develops an approach for
modeling and identification of the control augmented dynamics for a small
fixed-wing Unmanned Aerial Vehicle (UAV). A high-level Nonlinear Model
Predictive Controller (NMPC) is subsequently formulated for simultaneous
airspeed stabilization, path following, and soft constraint handling, using the
identified model for horizon propagation. The approach is explored in several
exemplary flight experiments including path following of helix and connected
Dubins Aircraft segments in high winds as well as a motor failure scenario. The
cost function, insights on its weighting, and additional soft constraints used
throughout the experimentation are discussed.
| cs.RO | as offtheshelf ots autopilots become more widely available and userfriendly and the drone market expands safer more efficient and more complex motion planning and control will become necessary for fixedwing aerial robotic platforms considering typical lowlevel attitude stabilization available on ots flight controllers this paper first develops an approach for modeling and identification of the control augmented dynamics for a small fixedwing unmanned aerial vehicle uav a highlevel nonlinear model predictive controller nmpc is subsequently formulated for simultaneous airspeed stabilization path following and soft constraint handling using the identified model for horizon propagation the approach is explored in several exemplary flight experiments including path following of helix and connected dubins aircraft segments in high winds as well as a motor failure scenario the cost function insights on its weighting and additional soft constraints used throughout the experimentation are discussed | [['as', 'offtheshelf', 'ots', 'autopilots', 'become', 'more', 'widely', 'available', 'and', 'userfriendly', 'and', 'the', 'drone', 'market', 'expands', 'safer', 'more', 'efficient', 'and', 'more', 'complex', 'motion', 'planning', 'and', 'control', 'will', 'become', 'necessary', 'for', 'fixedwing', 'aerial', 'robotic', 'platforms', 'considering', 'typical', 'lowlevel', 'attitude', 'stabilization', 'available', 'on', 'ots', 'flight', 'controllers', 'this', 'paper', 'first', 'develops', 'an', 'approach', 'for', 'modeling', 'and', 'identification', 'of', 'the', 'control', 'augmented', 'dynamics', 'for', 'a', 'small', 'fixedwing', 'unmanned', 'aerial', 'vehicle', 'uav', 'a', 'highlevel', 'nonlinear', 'model', 'predictive', 'controller', 'nmpc', 'is', 'subsequently', 'formulated', 'for', 'simultaneous', 'airspeed', 'stabilization', 'path', 'following', 'and', 'soft', 'constraint', 'handling', 'using', 'the', 'identified', 'model', 'for', 'horizon', 'propagation', 'the', 'approach', 'is', 'explored', 'in', 'several', 'exemplary', 'flight', 'experiments', 'including', 'path', 'following', 'of', 'helix', 'and', 'connected', 'dubins', 'aircraft', 'segments', 'in', 'high', 'winds', 'as', 'well', 'as', 'a', 'motor', 'failure', 'scenario', 'the', 'cost', 'function', 'insights', 'on', 'its', 'weighting', 'and', 'additional', 'soft', 'constraints', 'used', 'throughout', 'the', 'experimentation', 'are', 'discussed']] | [-0.16745565635430218, 0.07075942424052686, -0.050976546219945386, 0.04417056513518068, -0.14122846619420343, -0.220905433120809, 0.011607338650078385, 0.4511114485401044, -0.2619660572758574, -0.3426165055724785, 0.172871160112081, -0.20432603488535547, -0.17347359094808965, 0.2656569404614647, -0.1374837770461768, 0.12890231012318135, 0.09716287367179882, -0.01033061960537871, 0.039781061945844895, -0.14793601468383005, 0.18747301885218312, 0.07559007409668575, 0.25850369058140693, 0.003426000980070705, 0.17273487076967312, 0.07618656852316084, -0.0034566761502031265, 0.018694185339024946, -0.08844800197298257, 0.13943235996923, 0.28175815242918867, 0.162792743042969, 0.31143172655804013, -0.4843094596277467, -0.2417312785514074, 0.03252989781363834, 0.14841285901539455, 0.03804475361759366, -0.05701930183243499, -0.334073628989055, 0.03995690900470606, -0.2560768540640422, -0.11269693207263733, -0.08124860060876972, 0.027201834527345158, 0.033192334502345794, -0.27645067706462934, -0.04306716060688009, -0.023776772511803056, 0.0913425029101346, -0.1388604955977204, -0.08424408894313647, -0.02121921175280117, 0.17819832017973547, 0.02681903064874061, 0.008156844773229291, 0.19694021504067502, -0.14405274623669953, -0.12127893710870752, 0.41047017133741126, 0.04890268423306427, -0.18739217701669542, 0.18595944572802928, 0.007498558777553639, -0.11517453992658917, 0.12657417339547503, 0.24015145900989246, 0.1464286301596586, -0.20028010268005536, -0.010853632651403438, 0.04705204640426371, 0.14017276159025355, 0.040531706555726396, -0.043604705529622464, 0.16850443558380923, 0.30054983037034816, 0.17774268979099478, 0.12259951597012633, -0.09851472781595888, -0.15482476373745813, -0.2646824907739278, -0.12332958898259153, -0.11102826661504, -0.03764755432678239, -0.0573367619871919, -0.10568770276895129, 0.346144281019517, 0.1522223115781416, 0.11615094651716004, 0.0791101343410505, 0.4238299645697899, 0.0574189984656723, 0.0230041988120287, 0.07540516089815512, 0.21114972453118844, 0.004137592023345743, 0.16282138530593768, -0.21796744893365305, 0.09533975374124436, 0.017643009287325276] |
1,802.02625 | On Non-slow Roll Inflationary Regimes | We summarize our work on constant roll inflationary models. It was understood
recently that constant roll inflation, in a regime beyond the slow roll
approximation, can give models that are in agreement with the observational
constraints. We describe a new class of constant roll inflationary models and
investigate the behavior of scalar perturbations in them. We also comment on
other non-slow roll regimes of inflation.
| hep-th astro-ph.CO gr-qc hep-ph | we summarize our work on constant roll inflationary models it was understood recently that constant roll inflation in a regime beyond the slow roll approximation can give models that are in agreement with the observational constraints we describe a new class of constant roll inflationary models and investigate the behavior of scalar perturbations in them we also comment on other nonslow roll regimes of inflation | [['we', 'summarize', 'our', 'work', 'on', 'constant', 'roll', 'inflationary', 'models', 'it', 'was', 'understood', 'recently', 'that', 'constant', 'roll', 'inflation', 'in', 'a', 'regime', 'beyond', 'the', 'slow', 'roll', 'approximation', 'can', 'give', 'models', 'that', 'are', 'in', 'agreement', 'with', 'the', 'observational', 'constraints', 'we', 'describe', 'a', 'new', 'class', 'of', 'constant', 'roll', 'inflationary', 'models', 'and', 'investigate', 'the', 'behavior', 'of', 'scalar', 'perturbations', 'in', 'them', 'we', 'also', 'comment', 'on', 'other', 'nonslow', 'roll', 'regimes', 'of', 'inflation']] | [-0.17251229971074142, 0.19068362338898273, -0.10826474344357848, 0.1127330283061243, -0.10893480708965889, -0.2256008558978255, -0.008515078803667656, 0.31585935592078246, -0.23490507673615446, -0.28224801656145315, 0.11563328169823553, -0.19104124195873737, -0.21119182662895092, 0.2044521607306356, -0.06672001601411746, 0.048719631149791755, 0.06597736568118517, -0.01861683295036738, -0.02226455041852135, -0.2867435282239547, 0.2810801837306756, 0.055057297274470327, 0.19927852507053803, -0.04039358005930598, 0.05796882796029632, -0.16306435177819087, 0.040713132029542555, -0.014431679965211795, -0.2749510557545224, 0.059175402943331464, 0.12109071158981981, 0.12624309227730218, 0.23222271451153434, -0.4588237009942532, -0.2781392976283454, 0.1112014390528202, 0.14345889393813335, 0.19379855423735884, -0.008297277532088069, -0.20872763527127414, 0.0149916113461726, -0.1545200335076795, -0.09848485808246411, -0.16486010489842065, 0.009186952417859664, -0.024413248115720657, -0.29319753331633713, 0.07634085303915736, 0.00681924931704998, -0.019484064624143333, -0.052304090043673146, -0.035243332823022055, 0.04417740598392601, 0.02752766882857451, 0.19190071374804785, 0.0271120012881091, 0.1301263927195508, -0.19152665832438148, -0.06082079373479176, 0.3864973173978237, -0.21565198455220805, -0.14194216556273975, 0.10720499557657884, -0.15266476323684822, -0.19676500405543126, 0.005906405693923052, 0.16843620547308372, 0.11079361938083401, -0.06166856710870679, 0.1805863400052588, 0.03008542305861528, 0.10858908975496888, 0.10891027366384291, -0.027789558571552894, 0.2631737787563067, 0.14255891991779207, 0.006515126686113385, 0.10398012488596858, -0.04268241126779825, -0.17896056581431857, -0.4202803533237714, -0.053178739920258525, -0.08595710972395654, 0.04257878726706482, -0.13992927735649013, -0.18538783834530756, 0.4310420649842574, 0.17978801855530877, 0.2308979653251859, 0.10614250687739024, 0.2687330189662484, 0.053499463868614, -0.011061463336675213, 0.07331194392620372, 0.4242882895641602, 0.06461037514874568, 0.16618425169816384, -0.17911964839754196, 0.051775979014256825, 0.034527074079960585] |
1,802.02626 | Interpolating Population Distributions using Public-use Data: An
Application to Income Segregation using American Community Survey Data | Income segregation measures the extent to which households choose to live
near other households with similar incomes. Sociologists theorize that income
segregation can exacerbate the impacts of income inequality, and have developed
indices to measure it at the metro area level, including the information theory
index introduced in \citet{reardon2011income}, and the divergence index
presented in \citet{roberto2015divergence}. To study their differences, we
construct both indices using recent American Community Survey (ACS) estimates
of features of the income distribution. Since the elimination of the decennial
census long form, methods of computing these estimates must be updated to use
ACS estimates and account for survey error. We propose a model-based method to
interpolate estimates of features of the income distribution that accounts for
this error. This method improves on previous approaches by allowing for the use
of more types of estimates, and by providing uncertainty quantification. We
apply this method to estimate U.S. census tract-level income distributions
using ACS tabulations, and in turn use these to construct both income
segregation indices. We find major differences between the two indices in the
relative ranking of metro areas, as well as differences in how both indices
correlate with the Gini index.
| stat.ME | income segregation measures the extent to which households choose to live near other households with similar incomes sociologists theorize that income segregation can exacerbate the impacts of income inequality and have developed indices to measure it at the metro area level including the information theory index introduced in citetreardon2011income and the divergence index presented in citetroberto2015divergence to study their differences we construct both indices using recent american community survey acs estimates of features of the income distribution since the elimination of the decennial census long form methods of computing these estimates must be updated to use acs estimates and account for survey error we propose a modelbased method to interpolate estimates of features of the income distribution that accounts for this error this method improves on previous approaches by allowing for the use of more types of estimates and by providing uncertainty quantification we apply this method to estimate us census tractlevel income distributions using acs tabulations and in turn use these to construct both income segregation indices we find major differences between the two indices in the relative ranking of metro areas as well as differences in how both indices correlate with the gini index | [['income', 'segregation', 'measures', 'the', 'extent', 'to', 'which', 'households', 'choose', 'to', 'live', 'near', 'other', 'households', 'with', 'similar', 'incomes', 'sociologists', 'theorize', 'that', 'income', 'segregation', 'can', 'exacerbate', 'the', 'impacts', 'of', 'income', 'inequality', 'and', 'have', 'developed', 'indices', 'to', 'measure', 'it', 'at', 'the', 'metro', 'area', 'level', 'including', 'the', 'information', 'theory', 'index', 'introduced', 'in', 'citetreardon2011income', 'and', 'the', 'divergence', 'index', 'presented', 'in', 'citetroberto2015divergence', 'to', 'study', 'their', 'differences', 'we', 'construct', 'both', 'indices', 'using', 'recent', 'american', 'community', 'survey', 'acs', 'estimates', 'of', 'features', 'of', 'the', 'income', 'distribution', 'since', 'the', 'elimination', 'of', 'the', 'decennial', 'census', 'long', 'form', 'methods', 'of', 'computing', 'these', 'estimates', 'must', 'be', 'updated', 'to', 'use', 'acs', 'estimates', 'and', 'account', 'for', 'survey', 'error', 'we', 'propose', 'a', 'modelbased', 'method', 'to', 'interpolate', 'estimates', 'of', 'features', 'of', 'the', 'income', 'distribution', 'that', 'accounts', 'for', 'this', 'error', 'this', 'method', 'improves', 'on', 'previous', 'approaches', 'by', 'allowing', 'for', 'the', 'use', 'of', 'more', 'types', 'of', 'estimates', 'and', 'by', 'providing', 'uncertainty', 'quantification', 'we', 'apply', 'this', 'method', 'to', 'estimate', 'us', 'census', 'tractlevel', 'income', 'distributions', 'using', 'acs', 'tabulations', 'and', 'in', 'turn', 'use', 'these', 'to', 'construct', 'both', 'income', 'segregation', 'indices', 'we', 'find', 'major', 'differences', 'between', 'the', 'two', 'indices', 'in', 'the', 'relative', 'ranking', 'of', 'metro', 'areas', 'as', 'well', 'as', 'differences', 'in', 'how', 'both', 'indices', 'correlate', 'with', 'the', 'gini', 'index']] | [0.002193657481690647, 0.03728087075112552, -0.14337418674988373, 0.15555285034192137, -0.05671962891546092, -0.09702757993770927, 0.09692806226184467, 0.3822789392072148, -0.2233170033143013, -0.39080405378083083, 0.1014377910775311, -0.31087369794252817, -0.11971215210725925, 0.18680815013466942, -0.1444070756174817, -0.011406669810588032, 0.024725921055147607, -0.029862090110431373, -0.028484209815831614, -0.27161129310285587, 0.29437709256881184, 0.044214444780249364, 0.3139013293261973, 0.024379323830181453, 0.055335611542276654, -0.007001638366633283, -0.12414869681541166, 0.0402368021540228, -0.18102507677131002, 0.2282176903144992, 0.26059552168213024, 0.17113080179473203, 0.3284537943799068, -0.3485300869154961, -0.20181353730294332, 0.13790358018270005, 0.12077581735781437, 0.038335362219473666, -0.00536544662950032, -0.2662673224115966, 0.03127779839065775, -0.21693503909920453, -0.14326901940889464, -0.07855838645307511, 0.014064214503575947, 0.07042125193703765, -0.25215284370484287, 0.12600060845116018, -0.02871018393764271, 0.08973890052712644, -0.08726992242163713, -0.14835033517504603, -0.04493293620361295, 0.224140262658288, 0.07931874381194924, -0.053791580919430884, 0.13324446341872137, -0.1107128202550866, -0.12499077716924327, 0.32976797709502087, -0.04529958697870721, -0.1785059218895694, 0.1458862578505988, -0.15042581700193913, -0.15850261157291695, 0.04830363233045342, 0.2276928198712014, 0.04167177215812081, -0.15822416571465953, -0.0025744326711255924, -0.008468451480250902, 0.1809091031396945, 0.08093679409686456, 0.015718662025590326, 0.15756742152448144, 0.101514851874696, 0.11034366912256753, 0.09756175168986563, -0.13345774159274532, -0.10248350327378476, -0.2332171396945888, -0.157019792954616, -0.12761944302217793, -0.013569987241487584, -0.11708798731152159, -0.1673423419923671, 0.3909871171848665, 0.168978577597945, 0.16624170258868043, 0.09779080988265033, 0.2521619315372558, 0.08120481253341033, 0.07978751346736741, 0.07323575580077622, 0.19472313471683758, 0.0854511140396944, 0.13628688915705048, -0.15681691229502656, 0.12114283513251228, 0.03566541421405701] |
1,802.02627 | Going Deeper in Spiking Neural Networks: VGG and Residual Architectures | Over the past few years, Spiking Neural Networks (SNNs) have become popular
as a possible pathway to enable low-power event-driven neuromorphic hardware.
However, their application in machine learning have largely been limited to
very shallow neural network architectures for simple problems. In this paper,
we propose a novel algorithmic technique for generating an SNN with a deep
architecture, and demonstrate its effectiveness on complex visual recognition
problems such as CIFAR-10 and ImageNet. Our technique applies to both VGG and
Residual network architectures, with significantly better accuracy than the
state-of-the-art. Finally, we present analysis of the sparse event-driven
computations to demonstrate reduced hardware overhead when operating in the
spiking domain.
| cs.CV | over the past few years spiking neural networks snns have become popular as a possible pathway to enable lowpower eventdriven neuromorphic hardware however their application in machine learning have largely been limited to very shallow neural network architectures for simple problems in this paper we propose a novel algorithmic technique for generating an snn with a deep architecture and demonstrate its effectiveness on complex visual recognition problems such as cifar10 and imagenet our technique applies to both vgg and residual network architectures with significantly better accuracy than the stateoftheart finally we present analysis of the sparse eventdriven computations to demonstrate reduced hardware overhead when operating in the spiking domain | [['over', 'the', 'past', 'few', 'years', 'spiking', 'neural', 'networks', 'snns', 'have', 'become', 'popular', 'as', 'a', 'possible', 'pathway', 'to', 'enable', 'lowpower', 'eventdriven', 'neuromorphic', 'hardware', 'however', 'their', 'application', 'in', 'machine', 'learning', 'have', 'largely', 'been', 'limited', 'to', 'very', 'shallow', 'neural', 'network', 'architectures', 'for', 'simple', 'problems', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'algorithmic', 'technique', 'for', 'generating', 'an', 'snn', 'with', 'a', 'deep', 'architecture', 'and', 'demonstrate', 'its', 'effectiveness', 'on', 'complex', 'visual', 'recognition', 'problems', 'such', 'as', 'cifar10', 'and', 'imagenet', 'our', 'technique', 'applies', 'to', 'both', 'vgg', 'and', 'residual', 'network', 'architectures', 'with', 'significantly', 'better', 'accuracy', 'than', 'the', 'stateoftheart', 'finally', 'we', 'present', 'analysis', 'of', 'the', 'sparse', 'eventdriven', 'computations', 'to', 'demonstrate', 'reduced', 'hardware', 'overhead', 'when', 'operating', 'in', 'the', 'spiking', 'domain']] | [-0.06643848156197629, -0.051167201856231324, -0.02699134739355073, 0.025503607025720316, -0.11090023264528141, -0.22005734951534403, 0.013338213845224487, 0.5082138667754624, -0.2770657967092521, -0.322288134314735, 0.09029475337325878, -0.19587556185593846, -0.2921916812085846, 0.2890106868778501, -0.131680766750691, 0.15227283202400088, 0.16382156092237785, 0.02338726385368393, -0.07682379374521947, -0.3213306173272089, 0.21390406978359328, 0.07054230077549978, 0.34803161756648177, 0.04261271809569534, 0.15345157239449406, -0.10471221369716825, 0.04350930081953833, -0.0703587561798786, -0.0036410828539674435, 0.20445310394493266, 0.33398533079328885, 0.19347320763829992, 0.3644448132040577, -0.5142814886132512, -0.2686322803070786, 0.10019298565975569, 0.1837607855746232, 0.13129713640061266, -0.05115662984883225, -0.30949979756505935, 0.14773467660095507, -0.24016467378039016, 0.04287635180415637, -0.20107427380504855, -3.708855018293092e-05, 0.022934054470954274, -0.23699171208016095, 0.00788790843697316, 0.06905258811771049, 0.10692257657988903, 0.009060890143609033, -0.13531650997347994, 0.08542954988153907, 0.11146713471934071, -0.034196906244671164, 0.06433718450743398, 0.16861012091843086, -0.20928394396943167, -0.18232375553407526, 0.3148684063840897, -0.027966623499037894, -0.17998377449913036, 0.26228584711431363, 0.04713933200601044, -0.18389472481581048, 0.0731780949228127, 0.3033775444769454, 0.09300391298052299, -0.1518897784414857, 0.016799167666366376, 0.016592115300511003, 0.19212690640856092, 0.03152162080135094, 0.030029236313399918, 0.14776237241693113, 0.3812940045272709, 0.03778531079804268, 0.1550409261974583, -0.1394001993184072, -0.08056185854900065, -0.13844469451524932, -0.053786052254225135, -0.1851259353314313, 0.012225342191405458, -0.11029544799044459, -0.1427501172698829, 0.4069815246525024, 0.23400951201660097, 0.2044800625806418, 0.2012201977996241, 0.3860205288703015, 0.01594258499985407, 0.1809912661470712, 0.1423713159234767, 0.1929132264019887, 0.03821983014942583, 0.19686576874324316, -0.16938294900940098, 0.053151809896658596, -0.010990354783593788] |
1,802.02628 | Manifold Optimization Over the Set of Doubly Stochastic Matrices: A
Second-Order Geometry | Convex optimization is a well-established research area with applications in
almost all fields. Over the decades, multiple approaches have been proposed to
solve convex programs. The development of interior-point methods allowed
solving a more general set of convex programs known as semi-definite programs
and second-order cone programs. However, it has been established that these
methods are excessively slow for high dimensions, i.e., they suffer from the
curse of dimensionality. On the other hand, optimization algorithms on manifold
have shown great ability in finding solutions to nonconvex problems in
reasonable time. This paper is interested in solving a subset of convex
optimization using a different approach. The main idea behind Riemannian
optimization is to view the constrained optimization problem as an
unconstrained one over a restricted search space. The paper introduces three
manifolds to solve convex programs under particular box constraints. The
manifolds, called the doubly stochastic, symmetric and the definite multinomial
manifolds, generalize the simplex also known as the multinomial manifold. The
proposed manifolds and algorithms are well-adapted to solving convex programs
in which the variable of interest is a multidimensional probability
distribution function. Theoretical analysis and simulation results testify the
efficiency of the proposed method over state of the art methods. In particular,
they reveal that the proposed framework outperforms conventional generic and
specialized solvers, especially in high dimensions.
| math.OC | convex optimization is a wellestablished research area with applications in almost all fields over the decades multiple approaches have been proposed to solve convex programs the development of interiorpoint methods allowed solving a more general set of convex programs known as semidefinite programs and secondorder cone programs however it has been established that these methods are excessively slow for high dimensions ie they suffer from the curse of dimensionality on the other hand optimization algorithms on manifold have shown great ability in finding solutions to nonconvex problems in reasonable time this paper is interested in solving a subset of convex optimization using a different approach the main idea behind riemannian optimization is to view the constrained optimization problem as an unconstrained one over a restricted search space the paper introduces three manifolds to solve convex programs under particular box constraints the manifolds called the doubly stochastic symmetric and the definite multinomial manifolds generalize the simplex also known as the multinomial manifold the proposed manifolds and algorithms are welladapted to solving convex programs in which the variable of interest is a multidimensional probability distribution function theoretical analysis and simulation results testify the efficiency of the proposed method over state of the art methods in particular they reveal that the proposed framework outperforms conventional generic and specialized solvers especially in high dimensions | [['convex', 'optimization', 'is', 'a', 'wellestablished', 'research', 'area', 'with', 'applications', 'in', 'almost', 'all', 'fields', 'over', 'the', 'decades', 'multiple', 'approaches', 'have', 'been', 'proposed', 'to', 'solve', 'convex', 'programs', 'the', 'development', 'of', 'interiorpoint', 'methods', 'allowed', 'solving', 'a', 'more', 'general', 'set', 'of', 'convex', 'programs', 'known', 'as', 'semidefinite', 'programs', 'and', 'secondorder', 'cone', 'programs', 'however', 'it', 'has', 'been', 'established', 'that', 'these', 'methods', 'are', 'excessively', 'slow', 'for', 'high', 'dimensions', 'ie', 'they', 'suffer', 'from', 'the', 'curse', 'of', 'dimensionality', 'on', 'the', 'other', 'hand', 'optimization', 'algorithms', 'on', 'manifold', 'have', 'shown', 'great', 'ability', 'in', 'finding', 'solutions', 'to', 'nonconvex', 'problems', 'in', 'reasonable', 'time', 'this', 'paper', 'is', 'interested', 'in', 'solving', 'a', 'subset', 'of', 'convex', 'optimization', 'using', 'a', 'different', 'approach', 'the', 'main', 'idea', 'behind', 'riemannian', 'optimization', 'is', 'to', 'view', 'the', 'constrained', 'optimization', 'problem', 'as', 'an', 'unconstrained', 'one', 'over', 'a', 'restricted', 'search', 'space', 'the', 'paper', 'introduces', 'three', 'manifolds', 'to', 'solve', 'convex', 'programs', 'under', 'particular', 'box', 'constraints', 'the', 'manifolds', 'called', 'the', 'doubly', 'stochastic', 'symmetric', 'and', 'the', 'definite', 'multinomial', 'manifolds', 'generalize', 'the', 'simplex', 'also', 'known', 'as', 'the', 'multinomial', 'manifold', 'the', 'proposed', 'manifolds', 'and', 'algorithms', 'are', 'welladapted', 'to', 'solving', 'convex', 'programs', 'in', 'which', 'the', 'variable', 'of', 'interest', 'is', 'a', 'multidimensional', 'probability', 'distribution', 'function', 'theoretical', 'analysis', 'and', 'simulation', 'results', 'testify', 'the', 'efficiency', 'of', 'the', 'proposed', 'method', 'over', 'state', 'of', 'the', 'art', 'methods', 'in', 'particular', 'they', 'reveal', 'that', 'the', 'proposed', 'framework', 'outperforms', 'conventional', 'generic', 'and', 'specialized', 'solvers', 'especially', 'in', 'high', 'dimensions']] | [-0.07892442462987012, -0.02691251278202716, -0.07814911802680316, 0.09288726458908059, -0.12234935797645118, -0.18425413675775582, -0.006239861964290453, 0.3694888477129015, -0.2994434370066632, -0.2962021047249436, 0.17147597382903437, -0.2468666213871488, -0.1691543353848498, 0.23026177092476494, -0.11887877820514735, 0.14049436450851235, 0.09643403338480064, -0.01672960692191158, -0.12397824457571419, -0.3070272292672929, 0.32551954291252927, -0.00664455623561728, 0.2842355067799376, 0.03400860684553415, 0.14106854763178325, 0.003778775590895252, 0.0002088563056366349, 0.0908653546186873, -0.07038420643161358, 0.1457884898763785, 0.3336536160871302, 0.21853446652477776, 0.35068856962025163, -0.4072363816656765, -0.21976766006502493, 0.13934415876759554, 0.15011337175105424, 0.07465440687480043, -0.045215982256195275, -0.2575915334830907, 0.05538342227757147, -0.09505785772449929, -0.0753610267813201, -0.11735993857199156, -0.03715404155452482, 0.003550132302122868, -0.25829822403294117, -0.0012986990296419455, 0.057832677354930306, 0.008809624589048326, -0.0724701722194864, -0.1839450225715568, 0.04518196083795787, 0.03861890244297683, 0.08574619910637425, 0.06058540308678692, 0.09670223533599213, -0.08298624546203592, -0.18967624436905184, 0.37658323914828623, -0.0034831938947635617, -0.27863196741408586, 0.2102609478910877, -0.08831082881502383, -0.17559310364198277, 0.1708440587435193, 0.23396922626045785, 0.23414007897107778, -0.14089499928099528, 0.1397682389273541, -0.06805811298968778, 0.10623987122089602, 0.02942911447449164, -0.008777427801132118, 0.14457077890957323, 0.18951153955634006, 0.1391975938712924, 0.1274361686857777, -0.033164470971942965, -0.1694387113569643, -0.22912195878426164, -0.12924861700263468, -0.19587060344373722, -0.023948872328037395, -0.08094715102203984, -0.16736657900606092, 0.3700394575124268, 0.1177134232796644, 0.12904428180561148, 0.12169441571512091, 0.32831859657625584, 0.09653403172064413, 0.07368346923718821, 0.1102149198191579, 0.19527571944477545, 0.1280508873402141, 0.0987229473111008, -0.18930709816578944, 0.07105896734336221, 0.05392247094754236] |
1,802.02629 | Spatially adaptive image compression using a tiled deep network | Deep neural networks represent a powerful class of function approximators
that can learn to compress and reconstruct images. Existing image compression
algorithms based on neural networks learn quantized representations with a
constant spatial bit rate across each image. While entropy coding introduces
some spatial variation, traditional codecs have benefited significantly by
explicitly adapting the bit rate based on local image complexity and visual
saliency. This paper introduces an algorithm that combines deep neural networks
with quality-sensitive bit rate adaptation using a tiled network. We
demonstrate the importance of spatial context prediction and show improved
quantitative (PSNR) and qualitative (subjective rater assessment) results
compared to a non-adaptive baseline and a recently published image compression
model based on fully-convolutional neural networks.
| cs.CV | deep neural networks represent a powerful class of function approximators that can learn to compress and reconstruct images existing image compression algorithms based on neural networks learn quantized representations with a constant spatial bit rate across each image while entropy coding introduces some spatial variation traditional codecs have benefited significantly by explicitly adapting the bit rate based on local image complexity and visual saliency this paper introduces an algorithm that combines deep neural networks with qualitysensitive bit rate adaptation using a tiled network we demonstrate the importance of spatial context prediction and show improved quantitative psnr and qualitative subjective rater assessment results compared to a nonadaptive baseline and a recently published image compression model based on fullyconvolutional neural networks | [['deep', 'neural', 'networks', 'represent', 'a', 'powerful', 'class', 'of', 'function', 'approximators', 'that', 'can', 'learn', 'to', 'compress', 'and', 'reconstruct', 'images', 'existing', 'image', 'compression', 'algorithms', 'based', 'on', 'neural', 'networks', 'learn', 'quantized', 'representations', 'with', 'a', 'constant', 'spatial', 'bit', 'rate', 'across', 'each', 'image', 'while', 'entropy', 'coding', 'introduces', 'some', 'spatial', 'variation', 'traditional', 'codecs', 'have', 'benefited', 'significantly', 'by', 'explicitly', 'adapting', 'the', 'bit', 'rate', 'based', 'on', 'local', 'image', 'complexity', 'and', 'visual', 'saliency', 'this', 'paper', 'introduces', 'an', 'algorithm', 'that', 'combines', 'deep', 'neural', 'networks', 'with', 'qualitysensitive', 'bit', 'rate', 'adaptation', 'using', 'a', 'tiled', 'network', 'we', 'demonstrate', 'the', 'importance', 'of', 'spatial', 'context', 'prediction', 'and', 'show', 'improved', 'quantitative', 'psnr', 'and', 'qualitative', 'subjective', 'rater', 'assessment', 'results', 'compared', 'to', 'a', 'nonadaptive', 'baseline', 'and', 'a', 'recently', 'published', 'image', 'compression', 'model', 'based', 'on', 'fullyconvolutional', 'neural', 'networks']] | [-0.03680680572454419, -0.06561599940561959, -0.07891440268864214, 0.07354053140700083, -0.08169299401655919, -0.23900121432815155, 0.03209786894320346, 0.49167498833492024, -0.28375283343827024, -0.2956744347769423, 0.03360698933658354, -0.2178766912968532, -0.2591946604622512, 0.1686950022131674, -0.19447260090940388, 0.12379551739891709, 0.12757164337320112, 0.05371851145540278, -0.09973766667251828, -0.31841465754105763, 0.27177038873318865, 0.09858443502272174, 0.42699481515573856, -0.01705064842900058, 0.1975605115998818, -0.03427058820780993, -0.08976457566179398, -0.003542827333699317, -0.0692863300665988, 0.21523078224923023, 0.2802699979320325, 0.22732685846491804, 0.3175077929196707, -0.4440732994703811, -0.3089157614442168, 0.06761513908683252, 0.15908048982964829, 0.1047549761006092, -0.06262964547216548, -0.337315511083653, 0.12150098621540022, -0.16538621252793975, 0.11917079378608145, -0.144438530269525, -0.05508106696701163, 0.016521361577735448, -0.3139456281391512, 0.06434644771810277, 0.05077939308757166, 0.06830841378003609, -0.04116490772072257, -0.11893610898483575, 0.05757885291475896, 0.14658476142682322, -0.02202786770825345, 0.1662349856317732, 0.1591743167622813, -0.20586046405398764, -0.1714477820812036, 0.29139153617082025, -0.0915042689508375, -0.2284169007276631, 0.16302128642320068, 0.006085261612535775, -0.13822564032288784, 0.12091080614897821, 0.2581117435567817, 0.06420489703500722, -0.12557024741936632, -0.015990523925195878, -0.03334993088007474, 0.27857161026365834, 0.09560754047628461, 0.05555100775785556, 0.14606444118740117, 0.26058346801241783, 0.008061590927316486, 0.1469036708879402, -0.17078175775886772, -0.08035625163622263, -0.126371836340634, -0.06761779493707068, -0.20360180774719275, -0.009071300804082836, -0.17099699022641165, -0.12453774167464443, 0.41890563303996037, 0.21923047122975983, 0.2338425512503864, 0.20447038639774115, 0.37947566334565147, 0.0226540433305527, 0.14166682387483032, 0.10696830183361508, 0.15588878264514722, 0.04915572416052973, 0.14917377807775184, -0.12950244756462445, 0.1084298303178629, 0.13060060714786292] |
1,802.0263 | On the Japanese Multiplication Method. A father-and-daughter dialogue | Recently the media broadcast the news, together with illustrative videos, of
a so-called Japanese method to perform multiplication by hand without using the
multiplication tables. "Goodbye multiplication tables" was the headline of
several websites, including important ones, where news are however too often
`re-posted' uncritically. The easy numerical examples could induce naive
internauts to believe that, in a short future, multiplications could be really
done without the knowledge of multiplication tables. This is what a girl
expresses, with great enthusiasm, to her father. The dialogues described here,
although not real, are likely and have been inspired by this episode, being
Maddalena the daughter of the author. Obviously the revolutionary value of the
new method is easily disassembled, while its educational utility is highlighted
to show (or remember) the reasoning on which the method learned in elementary
school is based, although mostly applied mechanically.
| math.HO | recently the media broadcast the news together with illustrative videos of a socalled japanese method to perform multiplication by hand without using the multiplication tables goodbye multiplication tables was the headline of several websites including important ones where news are however too often reposted uncritically the easy numerical examples could induce naive internauts to believe that in a short future multiplications could be really done without the knowledge of multiplication tables this is what a girl expresses with great enthusiasm to her father the dialogues described here although not real are likely and have been inspired by this episode being maddalena the daughter of the author obviously the revolutionary value of the new method is easily disassembled while its educational utility is highlighted to show or remember the reasoning on which the method learned in elementary school is based although mostly applied mechanically | [['recently', 'the', 'media', 'broadcast', 'the', 'news', 'together', 'with', 'illustrative', 'videos', 'of', 'a', 'socalled', 'japanese', 'method', 'to', 'perform', 'multiplication', 'by', 'hand', 'without', 'using', 'the', 'multiplication', 'tables', 'goodbye', 'multiplication', 'tables', 'was', 'the', 'headline', 'of', 'several', 'websites', 'including', 'important', 'ones', 'where', 'news', 'are', 'however', 'too', 'often', 'reposted', 'uncritically', 'the', 'easy', 'numerical', 'examples', 'could', 'induce', 'naive', 'internauts', 'to', 'believe', 'that', 'in', 'a', 'short', 'future', 'multiplications', 'could', 'be', 'really', 'done', 'without', 'the', 'knowledge', 'of', 'multiplication', 'tables', 'this', 'is', 'what', 'a', 'girl', 'expresses', 'with', 'great', 'enthusiasm', 'to', 'her', 'father', 'the', 'dialogues', 'described', 'here', 'although', 'not', 'real', 'are', 'likely', 'and', 'have', 'been', 'inspired', 'by', 'this', 'episode', 'being', 'maddalena', 'the', 'daughter', 'of', 'the', 'author', 'obviously', 'the', 'revolutionary', 'value', 'of', 'the', 'new', 'method', 'is', 'easily', 'disassembled', 'while', 'its', 'educational', 'utility', 'is', 'highlighted', 'to', 'show', 'or', 'remember', 'the', 'reasoning', 'on', 'which', 'the', 'method', 'learned', 'in', 'elementary', 'school', 'is', 'based', 'although', 'mostly', 'applied', 'mechanically']] | [-0.06115243365948505, 0.11142166194188943, -0.09446729748536245, 0.0947961418919186, -0.17162867960130387, -0.168242889750379, 0.05649279373704542, 0.41251750226984635, -0.2499233564586504, -0.32698559734296606, 0.1410294512273572, -0.2820805809951836, -0.17752806218349249, 0.22722964655733435, -0.12549442259911844, -0.0006357272628674958, 0.07216028339916457, 0.09332604027280571, -0.035262955255238405, -0.3218648192243228, 0.2840090847858195, 0.08857492008741866, 0.26851678520592975, 0.056250856601441586, 0.06704039512704132, -0.034391238829715454, -0.07652737571179193, -0.0350540484836761, -0.011261354737259952, 0.1525488407929025, 0.2963792700502123, 0.167158392220009, 0.31287687045277646, -0.42566368591489523, -0.18340324847925957, 0.07896141049552029, 0.13578189272063632, 0.0892830465248198, -0.08431567994593675, -0.32131927438304886, 0.09638890735734855, -0.207042694720935, -0.06860656950107598, -0.11247217536950153, 0.021452219139599632, 0.02510866702985058, -0.2148580731071056, 0.005967630175807586, 0.05615253285802108, 0.0711877872401201, 0.0018834617601522635, -0.12054157588327079, 0.005519948387848781, 0.12216366259199535, 0.07433572449516637, 0.03619183650849625, 0.12730653105462167, -0.12800361803594104, -0.14783572848780568, 0.40635858209975434, -0.00010028919898607629, -0.1658786465711099, 0.13608231666788512, -0.09481555510127375, -0.13072529310073228, 0.11230430202492585, 0.12635497670911305, 0.1103276546189152, -0.1676386528655041, 0.04089969859244046, -0.059993423904615935, 0.1818607775998097, 0.09969784093505525, -0.041736578796692986, 0.18423303039017933, 0.1427878413765513, -0.022641401006410836, 0.09202028224030047, -0.007113082055332707, -0.10831409225121458, -0.20703377717559338, -0.15387460290196728, -0.19908964883450234, 0.03568244211174257, -0.01093063950330161, -0.12545044291582857, 0.36904001033597406, 0.15943285260772241, 0.16831795083596668, 0.0024087196356346106, 0.31460105593428545, 0.04134092385821203, 0.13732817168644768, 0.06985623075573949, 0.20784041183238605, 0.03868406002924956, 0.15993497743443025, -0.10196912579621512, 0.15237612286846794, 0.03961800052189922] |
1,802.02631 | Social Media Data Analysis and Feedback for Advanced Disaster Risk
Management | Social media are more than just a one-way communication channel. Data can be
collected, analyzed and contextualized to support disaster risk management.
However, disaster management agencies typically use such added-value
information to support only their own decisions. A feedback loop between
contextualized information and data suppliers would result in various
advantages. First, it could facilitate the near real-time communication of
early warnings derived from social media, linked to other sources of
information. Second, it could support the staff of aid organizations during
response operations. Based on the example of Hurricanes Harvey and Irma we show
how filtered, geolocated Tweets can be used for rapid damage assessment. We
claim that the next generation of big data analyses will have to generate
actionable information resulting from the application of advanced analytical
techniques. These applications could include the provision of social
media-based training data for algorithms designed to forecast actual cyclone
impacts or new socio-economic validation metrics for seasonal climate
forecasts.
| cs.SI physics.soc-ph | social media are more than just a oneway communication channel data can be collected analyzed and contextualized to support disaster risk management however disaster management agencies typically use such addedvalue information to support only their own decisions a feedback loop between contextualized information and data suppliers would result in various advantages first it could facilitate the near realtime communication of early warnings derived from social media linked to other sources of information second it could support the staff of aid organizations during response operations based on the example of hurricanes harvey and irma we show how filtered geolocated tweets can be used for rapid damage assessment we claim that the next generation of big data analyses will have to generate actionable information resulting from the application of advanced analytical techniques these applications could include the provision of social mediabased training data for algorithms designed to forecast actual cyclone impacts or new socioeconomic validation metrics for seasonal climate forecasts | [['social', 'media', 'are', 'more', 'than', 'just', 'a', 'oneway', 'communication', 'channel', 'data', 'can', 'be', 'collected', 'analyzed', 'and', 'contextualized', 'to', 'support', 'disaster', 'risk', 'management', 'however', 'disaster', 'management', 'agencies', 'typically', 'use', 'such', 'addedvalue', 'information', 'to', 'support', 'only', 'their', 'own', 'decisions', 'a', 'feedback', 'loop', 'between', 'contextualized', 'information', 'and', 'data', 'suppliers', 'would', 'result', 'in', 'various', 'advantages', 'first', 'it', 'could', 'facilitate', 'the', 'near', 'realtime', 'communication', 'of', 'early', 'warnings', 'derived', 'from', 'social', 'media', 'linked', 'to', 'other', 'sources', 'of', 'information', 'second', 'it', 'could', 'support', 'the', 'staff', 'of', 'aid', 'organizations', 'during', 'response', 'operations', 'based', 'on', 'the', 'example', 'of', 'hurricanes', 'harvey', 'and', 'irma', 'we', 'show', 'how', 'filtered', 'geolocated', 'tweets', 'can', 'be', 'used', 'for', 'rapid', 'damage', 'assessment', 'we', 'claim', 'that', 'the', 'next', 'generation', 'of', 'big', 'data', 'analyses', 'will', 'have', 'to', 'generate', 'actionable', 'information', 'resulting', 'from', 'the', 'application', 'of', 'advanced', 'analytical', 'techniques', 'these', 'applications', 'could', 'include', 'the', 'provision', 'of', 'social', 'mediabased', 'training', 'data', 'for', 'algorithms', 'designed', 'to', 'forecast', 'actual', 'cyclone', 'impacts', 'or', 'new', 'socioeconomic', 'validation', 'metrics', 'for', 'seasonal', 'climate', 'forecasts']] | [-0.0920567938982792, 0.0628957345689753, -0.08301133747931712, 0.1436430772094504, -0.17049315173025656, -0.13909249525823736, 0.10327126258281295, 0.3939772190672015, -0.247089747457376, -0.325105236548506, 0.2024600629162786, -0.3321556008031851, -0.19486403056970042, 0.24066326643864897, -0.1378284753624444, 0.06200612738103712, 0.1109518530444077, 0.04493689217790372, 0.019438581967054384, -0.2864593098638579, 0.267451058047576, 0.10442220290556928, 0.35409135292755745, 0.06732504588516453, 0.026976043779898106, -0.00840406961550441, -0.13467943915342795, -0.024595724512333685, -0.08141722842923674, 0.1707998432187346, 0.39272096489049213, 0.30321346231606566, 0.3498155421200149, -0.49933777412376074, -0.2552691498842043, 0.10846195845640724, 0.09627831571505559, 0.06974013183428758, -0.022333051063009108, -0.34728877183898715, 0.04341494957209105, -0.2436600957490221, -0.08786351691719287, -0.12220614288544542, -0.016482104724155195, 0.029097303547869276, -0.2905341718681864, 0.011854897490466792, -0.026750788399124446, 0.11812314641797514, -0.060319746666163486, -0.06883068631190949, -0.06627785645003867, 0.22109354657999275, 0.0403113548181173, -0.04529708050651169, 0.21877597819363898, -0.1436641600677048, -0.17277670856801014, 0.3766464048206712, -0.012509510032055292, -0.10277824784640836, 0.1733636638795061, -0.04652417896173989, -0.13677962796904053, 0.07952745404106247, 0.294559232070541, -0.012303607500028572, -0.2134153359581398, -0.07365275332608402, 0.04504746718544372, 0.18118694646260405, 0.08635842951332938, 0.01422354980088959, 0.19987415233066988, 0.18088115064892918, 0.06774367190067822, 0.06904508017962857, -0.06885299720960564, -0.08728646901635087, -0.20329455677655678, -0.14135242160114966, -0.14401177596890286, 0.02441389748496534, -0.10169803865426706, -0.1071673876431305, 0.336276831376496, 0.21963126122541843, 0.08272290524519697, 0.010808760521320415, 0.33603943057971286, 0.0011942409969206097, 0.10285625753399645, 0.08750623367768064, 0.16890761892155073, -0.01806015528066532, 0.21754294355942197, -0.12347507259393659, 0.16261772161844787, -0.04337146396960922] |
1,802.02632 | Anisotropic fixed points in Dirac and Weyl semimetals | The effective low energy description of interacting Dirac and Weyl semimetals
is that of massless quantum electrodynamics with several Lorentz breaking
material parameters. We perform a renormalization group analysis of Coulomb
interaction in anisotropic Dirac and Weyl semimetals and show that the
anisotropy persists in the material systems at the infrared fixed point. In
addition, a tilt of the fermion cones breaking inversion symmetry induces a
magnetoelectric term in the electrodynamics of the material whose magnitude
runs to match that of the electronic tilt at the fixed point.
| cond-mat.str-el | the effective low energy description of interacting dirac and weyl semimetals is that of massless quantum electrodynamics with several lorentz breaking material parameters we perform a renormalization group analysis of coulomb interaction in anisotropic dirac and weyl semimetals and show that the anisotropy persists in the material systems at the infrared fixed point in addition a tilt of the fermion cones breaking inversion symmetry induces a magnetoelectric term in the electrodynamics of the material whose magnitude runs to match that of the electronic tilt at the fixed point | [['the', 'effective', 'low', 'energy', 'description', 'of', 'interacting', 'dirac', 'and', 'weyl', 'semimetals', 'is', 'that', 'of', 'massless', 'quantum', 'electrodynamics', 'with', 'several', 'lorentz', 'breaking', 'material', 'parameters', 'we', 'perform', 'a', 'renormalization', 'group', 'analysis', 'of', 'coulomb', 'interaction', 'in', 'anisotropic', 'dirac', 'and', 'weyl', 'semimetals', 'and', 'show', 'that', 'the', 'anisotropy', 'persists', 'in', 'the', 'material', 'systems', 'at', 'the', 'infrared', 'fixed', 'point', 'in', 'addition', 'a', 'tilt', 'of', 'the', 'fermion', 'cones', 'breaking', 'inversion', 'symmetry', 'induces', 'a', 'magnetoelectric', 'term', 'in', 'the', 'electrodynamics', 'of', 'the', 'material', 'whose', 'magnitude', 'runs', 'to', 'match', 'that', 'of', 'the', 'electronic', 'tilt', 'at', 'the', 'fixed', 'point']] | [-0.24714145703579893, 0.2183247011006725, -0.0733060767842372, 0.018488135449429552, -0.08696600878134962, -0.15566415333887562, 0.04635992935535879, 0.3425881830044091, -0.23657612097767097, -0.3026937249391763, -0.013378563829147342, -0.33644564187323506, -0.1712571623237719, 0.10570165083415552, 0.07534732715099711, 0.017152290693378414, -0.04972510531925681, 0.0003070232712409713, -0.17656314206066204, -0.18362864318557762, 0.3375569554469125, 0.036659166480107655, 0.2926589426140047, 0.048528798591260885, 0.0746939954273826, 0.00497917082446458, 0.0896193798398599, 0.01736830703025176, -0.06041157351327539, 0.0311376857730052, 0.20126179983080048, -0.14412709609182042, 0.17938128214154858, -0.40384002667005087, -0.21326931004031477, 0.026780514088882643, 0.11660520959941839, 0.13380785688588565, -0.1318583325588737, -0.2818727712146938, 0.04252259638054635, -0.14819248193155296, -0.20337010246955536, -0.07338773091958667, -0.021044558559713714, -0.08419942684386941, -0.23541343125874514, 0.08987509826329187, 0.02173280076716434, 0.1021546514067185, -0.08053121255414392, -0.06110508369304377, -0.10506899724714458, 0.05962817273526029, 0.10948654636476104, 0.007392773298885335, 0.1344054645914267, -0.18347687328721143, -0.10596388261976906, 0.49803873109207913, -0.061471567055295134, -0.13043645142831586, 0.1418624564433809, -0.16860426155934957, -0.1087828283277552, 0.1566439992827575, 0.14846336798721246, 0.07151537615573034, -0.0933863267048516, 0.18434586624756444, -0.06250037671998143, 0.0925061019509237, 0.02494364430789243, 0.0746118437805721, 0.2684611275749789, 0.1080413009357554, 0.06978944050338627, 0.09281552344856953, -0.07407758575440808, -0.05302955394885926, -0.37114581905982713, -0.1915366201957857, -0.24298561578722333, 0.07103421091001523, -0.1405748009619856, -0.20793322453127158, 0.45085498985248373, 0.16632493455174632, 0.1638870008490895, -0.043529739926188166, 0.2225515058777422, 0.12950149808206002, 0.12667332550468433, 0.0613550992724909, 0.3011455699505115, 0.11646459394515576, 0.0989611371875402, -0.31765493197070266, -0.06118787010200322, 0.0829845323857047] |
1,802.02633 | Operator growth in the SYK model | We discuss the probability distribution for the "size" of a time-evolving
operator in the SYK model. Scrambling is related to the fact that as time
passes, the distribution shifts towards larger operators. Initially, the rate
is exponential and determined by the infinite-temperature chaos exponent. We
evaluate the size distribution numerically for $N = 30$, and show how to
compute it in the large-$N$ theory using the dressed fermion propagator. We
then evaluate the distribution explicitly at leading nontrivial order in the
large-$q$ expansion.
| hep-th | we discuss the probability distribution for the size of a timeevolving operator in the syk model scrambling is related to the fact that as time passes the distribution shifts towards larger operators initially the rate is exponential and determined by the infinitetemperature chaos exponent we evaluate the size distribution numerically for n 30 and show how to compute it in the largen theory using the dressed fermion propagator we then evaluate the distribution explicitly at leading nontrivial order in the largeq expansion | [['we', 'discuss', 'the', 'probability', 'distribution', 'for', 'the', 'size', 'of', 'a', 'timeevolving', 'operator', 'in', 'the', 'syk', 'model', 'scrambling', 'is', 'related', 'to', 'the', 'fact', 'that', 'as', 'time', 'passes', 'the', 'distribution', 'shifts', 'towards', 'larger', 'operators', 'initially', 'the', 'rate', 'is', 'exponential', 'and', 'determined', 'by', 'the', 'infinitetemperature', 'chaos', 'exponent', 'we', 'evaluate', 'the', 'size', 'distribution', 'numerically', 'for', 'n', '30', 'and', 'show', 'how', 'to', 'compute', 'it', 'in', 'the', 'largen', 'theory', 'using', 'the', 'dressed', 'fermion', 'propagator', 'we', 'then', 'evaluate', 'the', 'distribution', 'explicitly', 'at', 'leading', 'nontrivial', 'order', 'in', 'the', 'largeq', 'expansion']] | [-0.10740200924777948, 0.19333807718599352, -0.12048102585348959, 0.11367120753076472, 0.018151240090402296, -0.08384260768638696, 0.055154926397712765, 0.3354903718274904, -0.2578265358489461, -0.23630472767825533, 0.07769391876105901, -0.3069464518325176, -0.1508773795198422, 0.1087036369589907, 0.0313872180023703, 0.08117344546722384, -0.01687290744072326, 0.0921553820087688, -0.07680934098855842, -0.24496044864787198, 0.330478296843045, 0.07803592809316952, 0.27823335075716876, 0.0644231902991944, 0.06779339761904828, 0.004591115070336566, -0.001647915360347436, -0.029693831327632522, -0.14088945135393638, 0.05124736189836546, 0.1660694882852911, 0.08771660688855662, 0.22440949885356354, -0.3780377245985153, -0.17444454167583368, 0.10036644031770708, 0.20585249760756041, 0.10995237570165134, -0.0025357927150297457, -0.2544830586568157, 0.07996942172758281, -0.20144696890308364, -0.22569965291200433, -0.0772654655412203, 0.05828446926685368, -0.019580188866068677, -0.2776563775515547, 0.09673313973130794, -0.0029966997425639776, -0.021873586248924454, -0.02378350727419119, -0.0757238095989678, -0.0027842569255792514, 0.14200044089996414, 0.042923122205737435, 0.013440474713073544, 0.10235738940510357, -0.12930973182363498, -0.09089613343069398, 0.324985546727165, -0.1167216355324632, -0.19784737451366866, 0.11601512322611199, -0.21532376415505097, -0.09709555188920803, 0.09625606888496294, 0.15552829633035312, 0.11623592079523383, -0.09799999802759508, 0.13662053038019734, -0.026561913364453286, 0.16807848847153165, 0.07402796778691614, 0.025882387743899372, 0.1533637168680931, 0.10807370781762207, 0.03543048694434508, 0.2116016153950335, -0.06625671023730098, -0.18697322876669648, -0.3000143120227177, -0.14115586153958448, -0.24797752856208785, 0.0557440813778468, -0.16110308503514872, -0.17395268083073018, 0.4128846639040403, 0.2158481900398506, 0.24537047564915224, 0.11814244251084946, 0.25524753356272945, 0.21370734482195808, 0.05031129073851356, 0.09797039846547172, 0.177980772088986, 0.11589001649820314, 0.06398406736666291, -0.29651426758742094, 0.06197631681354279, 0.12024295601494066] |
1,802.02634 | Analysis of attitude errors in GRACE range-rate residuals - a comparison
between SCA1B and the reprocessed attitude fused product (SCA1B +ACC1B) | The precision of the attitude in the inter-satellite ranging missions like
GRACE is one of the important requirement. It is required not only for the
mission performance but also for the good quality of the gravity field models
which are estimated from the inter-satellite ranging measurements. Here we
present a comparative study of the analysis of two attitude datasets. One of
them is the standardSCA1Brelease 2 datasets provided by JPL NASA and another is
the reprocessed attitude computed atTU Graz by combining the angular
accelerations and the standardSCA1Brelease2 datasets. Further, we also present
the impact of the attitude datasets on the inter-satellite range measurements
by analyzing their residuals. Our analysis reveals the significant improvement
in the attitude due to the reprocessed product and reduced value of residuals
computed from the reprocessed attitude.
| astro-ph.IM physics.data-an | the precision of the attitude in the intersatellite ranging missions like grace is one of the important requirement it is required not only for the mission performance but also for the good quality of the gravity field models which are estimated from the intersatellite ranging measurements here we present a comparative study of the analysis of two attitude datasets one of them is the standardsca1brelease 2 datasets provided by jpl nasa and another is the reprocessed attitude computed attu graz by combining the angular accelerations and the standardsca1brelease2 datasets further we also present the impact of the attitude datasets on the intersatellite range measurements by analyzing their residuals our analysis reveals the significant improvement in the attitude due to the reprocessed product and reduced value of residuals computed from the reprocessed attitude | [['the', 'precision', 'of', 'the', 'attitude', 'in', 'the', 'intersatellite', 'ranging', 'missions', 'like', 'grace', 'is', 'one', 'of', 'the', 'important', 'requirement', 'it', 'is', 'required', 'not', 'only', 'for', 'the', 'mission', 'performance', 'but', 'also', 'for', 'the', 'good', 'quality', 'of', 'the', 'gravity', 'field', 'models', 'which', 'are', 'estimated', 'from', 'the', 'intersatellite', 'ranging', 'measurements', 'here', 'we', 'present', 'a', 'comparative', 'study', 'of', 'the', 'analysis', 'of', 'two', 'attitude', 'datasets', 'one', 'of', 'them', 'is', 'the', 'standardsca1brelease', '2', 'datasets', 'provided', 'by', 'jpl', 'nasa', 'and', 'another', 'is', 'the', 'reprocessed', 'attitude', 'computed', 'attu', 'graz', 'by', 'combining', 'the', 'angular', 'accelerations', 'and', 'the', 'standardsca1brelease2', 'datasets', 'further', 'we', 'also', 'present', 'the', 'impact', 'of', 'the', 'attitude', 'datasets', 'on', 'the', 'intersatellite', 'range', 'measurements', 'by', 'analyzing', 'their', 'residuals', 'our', 'analysis', 'reveals', 'the', 'significant', 'improvement', 'in', 'the', 'attitude', 'due', 'to', 'the', 'reprocessed', 'product', 'and', 'reduced', 'value', 'of', 'residuals', 'computed', 'from', 'the', 'reprocessed', 'attitude']] | [-0.1092624978555814, 0.06376446730117927, -0.09308298159563957, 0.018309417082801777, -0.05643860004163643, -0.07350120045490159, 0.02794134400987117, 0.3469186082785559, -0.22556984095379365, -0.3898584162888601, 0.1706552161562596, -0.3058397845985989, -0.09933157442426381, 0.2790521084468148, -0.08379131038276147, 0.05202837989037467, 0.12840296532381182, 0.003321686644078225, -0.06352311728500523, -0.22321421086838714, 0.3016362501373298, 0.1349149980806103, 0.23548058378907252, -0.013589630928612494, 0.13073139674528395, -0.029132861506858076, -0.10555289346316844, 0.03586056154192418, -0.11286118613238368, 0.1545935682013862, 0.2182458679117824, 0.16778070194819986, 0.25582617831726867, -0.3680634578588859, -0.18480711928099508, 0.077909695280557, 0.09019999589063515, 0.0644504522535654, -0.04483816744994314, -0.34842956502192707, 0.012302585475890384, -0.17228297625899372, -0.07522588043671972, -0.08405481664420561, 0.01619077297450989, 0.004845217760118057, -0.23177030913950514, 0.061041590392629276, 0.00035337621504946275, 0.10398411666324665, -0.11523280816708598, -0.1517373579319624, -0.036009518102952096, 0.21916455890290265, 0.09441431636322839, 0.03369240944143818, 0.12638407164116122, -0.12245563063914924, -0.08635902788143518, 0.42231677575470056, -0.065135863463416, -0.15382829272412052, 0.1524631886692472, -0.16148316010186636, -0.10307216050117746, 0.11355557153362406, 0.1846186090260744, 0.09167619327727575, -0.12436269661195057, 0.04813760386052534, 0.01872304560934273, 0.21185680271249063, 0.03218995273030226, 0.00035842302681286206, 0.20207406704804984, 0.14908839734776538, 0.05902291038759457, 0.07684679870139952, -0.17650541422420268, -0.04593886657213691, -0.2386124373355866, -0.13167999248749526, -0.15758114669818518, -0.006043052668895306, -0.12011717174027581, -0.05658290246429369, 0.38268248861756665, 0.19818747047580373, 0.1472576295653748, 0.04065148715496554, 0.390925120042507, 0.052380257046983625, 0.0756080158437465, 0.0368768249226864, 0.3497871410159409, 0.06182980597878322, 0.12168643816533073, -0.22608174403133088, 0.07990176351596565, -0.013865844774341513] |
1,802.02635 | Error bounds of a quadrature formula with multiple nodes for the
Fourier-Chebyshev coefficients for analytic functions | Three kinds of effective error bounds of the quadrature formulas with
multiple nodes that are generalizations of the well known Micchelli-Rivlin
quadrature formula, when the integrand is a function analytic in the regions
bounded by confocal ellipses, are given. A numerical example which illustrates
the calculation of these error bounds is included.
| math.NA | three kinds of effective error bounds of the quadrature formulas with multiple nodes that are generalizations of the well known micchellirivlin quadrature formula when the integrand is a function analytic in the regions bounded by confocal ellipses are given a numerical example which illustrates the calculation of these error bounds is included | [['three', 'kinds', 'of', 'effective', 'error', 'bounds', 'of', 'the', 'quadrature', 'formulas', 'with', 'multiple', 'nodes', 'that', 'are', 'generalizations', 'of', 'the', 'well', 'known', 'micchellirivlin', 'quadrature', 'formula', 'when', 'the', 'integrand', 'is', 'a', 'function', 'analytic', 'in', 'the', 'regions', 'bounded', 'by', 'confocal', 'ellipses', 'are', 'given', 'a', 'numerical', 'example', 'which', 'illustrates', 'the', 'calculation', 'of', 'these', 'error', 'bounds', 'is', 'included']] | [-0.15222565800535912, 0.08602925791752104, -0.04426112730859542, 0.11733050324369733, -0.04676754893643745, -0.12420946523985442, 0.05669476766614061, 0.33101016878351275, -0.2163369207843846, -0.2956560679583573, 0.14811275791440742, -0.29405538277590976, -0.2135321780966193, 0.2848308153596579, -0.06427694784846001, 0.1200346992369376, 0.04908614302757105, 0.04259708414182944, -0.10909451261692334, -0.27588275830973596, 0.29785839101190076, -0.027735605872437067, 0.20670545365953563, 0.06098924429320237, 0.0942085359756853, -0.04175528868411978, -0.0679985389898659, -0.008739934942009402, -0.16301549694060882, 0.1498037366671305, 0.2542494439026889, 0.08782045539998103, 0.26091348010973603, -0.37454661701385883, -0.15847860255698656, 0.10380567037089564, 0.1723360658860674, 0.11361373062062935, 0.007157315153117273, -0.28305066486491876, 0.052435839201743696, -0.13256655078308255, -0.14038610738683857, -0.1033859310817777, -0.017838393420200136, 0.10905360929923606, -0.31083160132060156, 0.09386475493517413, 0.061673924886146744, 0.05839812176703822, -0.048149128645366315, -0.1611965808232187, 0.011332182108662, 0.1045167879275658, 0.03536560440289916, -0.005753768799716935, 0.09177702085535024, -0.08772901240188409, -0.1289794189106746, 0.3163057027348116, -0.015782034919396334, -0.315944114079078, 0.07140453515903038, -0.15985886965348733, -0.06561942424113844, 0.13649001027293065, 0.09122084830339779, 0.1385635098570264, -0.12649896932342408, 0.08460488754744623, -0.036871386308442146, 0.10079726467237753, 0.11234605233824137, 0.025378350250642088, 0.1271551835953313, 0.05155046968538241, 0.05518812961036376, 0.20247000362724066, -0.09611866471595039, -0.13858441676141, -0.4174795741610247, -0.11849778316294153, -0.22326644565727488, -0.040301490766818035, -0.17943245762338242, -0.2064789962982211, 0.34572408852331776, 0.04191156146207861, 0.18392738804002018, 0.1124981085737875, 0.38200422343524065, 0.19248479776376604, 0.045315664371146876, 0.05705485980519477, 0.2077891494092696, 0.132477265376342, -0.02920741116737618, -0.1563259891928265, 0.07138263933159703, 0.1297462428380694] |
1,802.02636 | Discovery of a magnetic white dwarf with unusual short-period
variability | We report the discovery of a magnetic white dwarf which shows periodic
variability with P=110 min, color-dependent amplitudes and a transient phase
shift in the blue compared to the red lightcurve - a previously unknown type of
variability for this type of object. We attribute the variations either to a
close ultracool (thus far undetected) companion or, more likely, to magnetic
spots with unusual temperature structure.
| astro-ph.SR | we report the discovery of a magnetic white dwarf which shows periodic variability with p110 min colordependent amplitudes and a transient phase shift in the blue compared to the red lightcurve a previously unknown type of variability for this type of object we attribute the variations either to a close ultracool thus far undetected companion or more likely to magnetic spots with unusual temperature structure | [['we', 'report', 'the', 'discovery', 'of', 'a', 'magnetic', 'white', 'dwarf', 'which', 'shows', 'periodic', 'variability', 'with', 'p110', 'min', 'colordependent', 'amplitudes', 'and', 'a', 'transient', 'phase', 'shift', 'in', 'the', 'blue', 'compared', 'to', 'the', 'red', 'lightcurve', 'a', 'previously', 'unknown', 'type', 'of', 'variability', 'for', 'this', 'type', 'of', 'object', 'we', 'attribute', 'the', 'variations', 'either', 'to', 'a', 'close', 'ultracool', 'thus', 'far', 'undetected', 'companion', 'or', 'more', 'likely', 'to', 'magnetic', 'spots', 'with', 'unusual', 'temperature', 'structure']] | [-0.13273248734633222, 0.1426299863280012, -0.06883313436634265, 0.09125612046247204, -0.16658313838908306, -0.12457844795515904, 0.1553536939398887, 0.4252631678604163, -0.18295012872952682, -0.33407528086995275, 0.0914067851146683, -0.27703999541699886, -0.14749863176749875, 0.1696852320769372, -0.12622905826339356, -0.042993589963477394, 0.08321731463074684, 0.01704405994566444, -0.07353817043969264, -0.19810437912193055, 0.2739154709646335, 0.005747605487704277, 0.11956620073089233, -0.0848681178015585, 0.007779972384182306, -0.07776012764527247, -0.0343846268629512, -0.020654796995222567, -0.09294338743560589, 0.02447800082512773, 0.1808373083288853, 0.0033633496540670213, 0.18288123117974744, -0.3067816828019344, -0.2499091254833799, 0.09815017672685476, 0.16872357009695127, 0.06844587346646362, -0.06108604957318256, -0.3001718750366798, 0.07648415919751501, -0.13531200077313071, -0.1838991216598795, 0.0394042057916522, 0.12780964566537967, 0.002525940207907787, -0.24225922401439257, 0.13457449494789425, 0.09642286746261211, 0.1236749262871364, -0.1380679663270712, -0.1125231684400485, -0.019848618556100588, 0.04365247670346155, 0.0442286858926169, 0.08152296740848285, 0.09092716978719602, -0.13563787014080356, -0.06208029184848643, 0.3365362677481384, -0.10764560860832437, 0.0017572446994913312, 0.23506463336256833, -0.1816381427244498, -0.1624105958841168, 0.19634099339063352, 0.13177977660670875, 0.1380909584964124, -0.16873791768090227, -0.06393738735843306, 0.04079323431584411, 0.24588095361653428, 0.058021076711324546, 0.10656690700696064, 0.3236424010246992, 0.14551855305639597, 0.03233634551557211, 0.15180399007737064, -0.2770784255475379, 0.011273860082460138, -0.19775773980296574, -0.040274428547574924, -0.11166043592115435, 0.09870520857377695, -0.046464454652875874, -0.2509131893085746, 0.4187900629181128, 0.12301869833698639, 0.23560866793760887, -0.016042204833446212, 0.29610653467333087, 0.10023562644536678, 0.10537023519953856, 0.08950871567313488, 0.2945516261236312, 0.15299782441714063, 0.11957782312081411, -0.2711976593073744, 0.09358364511281252, -0.014617533000329365] |
1,802.02637 | Doubling constructions: Global functoriality for non-generic cuspidal
representations | We study the generalized doubling method for pairs of representations of
$G\times GL_k$ where $G$ is a symplectic group, split special orthogonal group
or split general spin group. We analyze the poles of the local integrals, and
prove that the global completed $L$-function with a cuspidal representation of
$GL_k$ twisted by a highly ramified Hecke character is entire. We obtain a new
proof of the weak functorial transfer of cuspidal automorphic representations
of $G$ to the natural general linear group, which is independent of the trace
formula and its prerequisites, by combining our results with the Converse
Theorem.
| math.NT math.RT | we study the generalized doubling method for pairs of representations of gtimes gl_k where g is a symplectic group split special orthogonal group or split general spin group we analyze the poles of the local integrals and prove that the global completed lfunction with a cuspidal representation of gl_k twisted by a highly ramified hecke character is entire we obtain a new proof of the weak functorial transfer of cuspidal automorphic representations of g to the natural general linear group which is independent of the trace formula and its prerequisites by combining our results with the converse theorem | [['we', 'study', 'the', 'generalized', 'doubling', 'method', 'for', 'pairs', 'of', 'representations', 'of', 'gtimes', 'gl_k', 'where', 'g', 'is', 'a', 'symplectic', 'group', 'split', 'special', 'orthogonal', 'group', 'or', 'split', 'general', 'spin', 'group', 'we', 'analyze', 'the', 'poles', 'of', 'the', 'local', 'integrals', 'and', 'prove', 'that', 'the', 'global', 'completed', 'lfunction', 'with', 'a', 'cuspidal', 'representation', 'of', 'gl_k', 'twisted', 'by', 'a', 'highly', 'ramified', 'hecke', 'character', 'is', 'entire', 'we', 'obtain', 'a', 'new', 'proof', 'of', 'the', 'weak', 'functorial', 'transfer', 'of', 'cuspidal', 'automorphic', 'representations', 'of', 'g', 'to', 'the', 'natural', 'general', 'linear', 'group', 'which', 'is', 'independent', 'of', 'the', 'trace', 'formula', 'and', 'its', 'prerequisites', 'by', 'combining', 'our', 'results', 'with', 'the', 'converse', 'theorem']] | [-0.22183558237691392, 0.05057697479461073, -0.170506321651652, 0.05748509099987355, -0.16164232198890222, -0.1209682285196471, 0.019807791888561785, 0.30087951008154423, -0.31974506393379093, -0.1974598938166829, 0.07828746335211208, -0.19417879848541425, -0.1663832839659168, 0.19663218790617754, -0.09097845323992018, -0.03483956474965267, 0.08601265053065228, 0.12622493351999747, -0.1367592581248443, -0.25868857243782556, 0.4117318455281915, -0.04043708811157706, 0.24416775437195462, 0.023327717548046186, 0.11690617165746814, 0.07774327640250629, -0.028064689152322863, -0.1128099514361547, -0.09861012541830637, 0.18203396517403272, 0.3035066972239589, 0.0292749523561019, 0.21134003984019617, -0.3635687875010225, -0.12345395785666127, 0.18667858762058373, 0.10691193036963137, 0.010958539126013234, -0.010988547267126185, -0.32538150226203155, 0.12037134258675256, -0.17944809881856247, -0.15921771654631106, -0.08962090719700316, 0.02541064115345706, -0.00624942599216058, -0.2909660752938718, 0.0460475556889777, 0.1194100178664132, 0.14581483307921764, -0.062136690694202044, -0.11496222965485815, -0.05121039119976744, 0.10696683627581793, 0.002628859342788631, 0.05006887583888839, 0.0809433994178033, -0.10928136192984422, -0.09515162804686673, 0.3652457391263499, -0.10417638428875112, -0.18794358217832158, 0.10656355772813668, -0.18309572211713815, -0.18755565259406076, 0.11154881067103611, 0.09296194910385398, 0.17467327329463192, -0.04443793923461011, 0.15242560203448507, -0.1878770988206474, 0.053030643379315734, 0.07473846079249467, -0.0394435658212276, 0.14271886050891208, 0.06083987110379931, 0.10041514558869662, 0.14817478967003753, 0.027357373637864748, 0.003962573462298938, -0.3462442957168939, -0.20357828665220615, -0.13606235831120642, 0.09575626254794473, -0.10099555206531421, -0.16737275699875792, 0.45845791043675677, 0.037875576529233734, 0.17089441721327603, 0.14010953507029775, 0.21646955194978082, 0.13917892131293952, 0.11157008972047466, 0.06966255863235161, 0.10444031377817142, 0.2534465319809637, -0.07883878377247222, -0.17016162272371657, -0.06414406240338041, 0.1879168417618363] |
1,802.02638 | Tight Lower Bounds for Locally Differentially Private Selection | We prove a tight lower bound (up to constant factors) on the sample
complexity of any non-interactive local differentially private protocol for
optimizing a linear function over the simplex. This lower bound also implies a
tight lower bound (again, up to constant factors) on the sample complexity of
any non-interactive local differentially private protocol implementing the
exponential mechanism. These results reveal that any local protocol for these
problems has exponentially worse dependence on the dimension than corresponding
algorithms in the central model. Previously, Kasiviswanathan et al. (FOCS 2008)
proved an exponential separation between local and central model algorithms for
PAC learning the class of parity functions. In contrast, our lower bound are
quantitatively tight, apply to a simple and natural class of linear
optimization problems, and our techniques are arguably simpler.
| cs.CR cs.DS cs.LG | we prove a tight lower bound up to constant factors on the sample complexity of any noninteractive local differentially private protocol for optimizing a linear function over the simplex this lower bound also implies a tight lower bound again up to constant factors on the sample complexity of any noninteractive local differentially private protocol implementing the exponential mechanism these results reveal that any local protocol for these problems has exponentially worse dependence on the dimension than corresponding algorithms in the central model previously kasiviswanathan et al focs 2008 proved an exponential separation between local and central model algorithms for pac learning the class of parity functions in contrast our lower bound are quantitatively tight apply to a simple and natural class of linear optimization problems and our techniques are arguably simpler | [['we', 'prove', 'a', 'tight', 'lower', 'bound', 'up', 'to', 'constant', 'factors', 'on', 'the', 'sample', 'complexity', 'of', 'any', 'noninteractive', 'local', 'differentially', 'private', 'protocol', 'for', 'optimizing', 'a', 'linear', 'function', 'over', 'the', 'simplex', 'this', 'lower', 'bound', 'also', 'implies', 'a', 'tight', 'lower', 'bound', 'again', 'up', 'to', 'constant', 'factors', 'on', 'the', 'sample', 'complexity', 'of', 'any', 'noninteractive', 'local', 'differentially', 'private', 'protocol', 'implementing', 'the', 'exponential', 'mechanism', 'these', 'results', 'reveal', 'that', 'any', 'local', 'protocol', 'for', 'these', 'problems', 'has', 'exponentially', 'worse', 'dependence', 'on', 'the', 'dimension', 'than', 'corresponding', 'algorithms', 'in', 'the', 'central', 'model', 'previously', 'kasiviswanathan', 'et', 'al', 'focs', '2008', 'proved', 'an', 'exponential', 'separation', 'between', 'local', 'and', 'central', 'model', 'algorithms', 'for', 'pac', 'learning', 'the', 'class', 'of', 'parity', 'functions', 'in', 'contrast', 'our', 'lower', 'bound', 'are', 'quantitatively', 'tight', 'apply', 'to', 'a', 'simple', 'and', 'natural', 'class', 'of', 'linear', 'optimization', 'problems', 'and', 'our', 'techniques', 'are', 'arguably', 'simpler']] | [-0.10323325376815469, 0.05232478291845351, -0.08658135390328599, 0.11090587817029388, -0.0553151905138529, -0.20602944292099648, 0.1373351853312427, 0.3247752371066399, -0.26228969839920524, -0.3628037648936662, 0.0433015318974881, -0.20096307298353383, -0.13817664712155595, 0.27948032459955063, -0.08452641080979628, 0.10302179517537241, 0.006609323658475667, 0.013602969433955905, -0.07036692984153353, -0.362479310992113, 0.2749744309823363, 0.07700524227480397, 0.2859274368974885, 0.04711850857333714, 0.06404941798123809, -0.003353245040927907, -0.0049683974792768485, -0.00529316375174254, -0.18227183869498906, 0.1463426201398136, 0.22562500150547227, 0.16918982133511026, 0.31096895172737027, -0.37587754366479953, -0.1487823972115933, 0.14964622525739987, 0.12284598598000772, 0.13401520043213405, -0.04496849835263778, -0.22383063070419182, 0.10335863467647147, -0.13723266212170132, -0.06859818708688334, -0.07109233551082834, 0.034567783026820946, -0.0077635961236389535, -0.3220816871990229, 0.09302577336353449, 0.14841392224668773, 0.03138876215817819, -0.059220425461113224, -0.1489699895614545, 0.06684634122883773, 0.08318520086206041, -0.0436091890935395, 0.06377193614403283, 0.10365442997413396, -0.09641766624937531, -0.17051480575073652, 0.2675870821512667, -0.06347062366799974, -0.1775792842332757, 0.20149801444717264, -0.0888137497462844, -0.1676316392245411, 0.1091738681927437, 0.21710888321959335, 0.14686661611759025, -0.111128362816339, 0.13033334395309681, -0.14038845365653738, 0.20518484678944104, 0.07815031068157831, 0.07391715518604139, 0.0483440151598077, 0.08294615921571509, 0.18099013996090144, 0.14605336566811128, 0.027205344982701177, -0.13834370484172176, -0.2573684798677999, -0.13051234129887387, -0.18409247048739485, 0.009659573018110094, -0.1511015910083181, -0.12940652386946533, 0.32660487570750124, 0.056439905685109606, 0.21312152609257526, 0.160221500798548, 0.31504530787560375, 0.10615658564741887, 0.044948916132241945, 0.21038207252372593, 0.2368628363141022, 0.11711828178328014, 0.019785913170887626, -0.1841273026297381, 0.14405634386450736, 0.09800700105385471] |
1,802.02639 | Sharp operator-norm asymptotics for thin elastic plates with rapidly
oscillating periodic properties | We analyse a system of partial differential equations describing the
behaviour of an elastic plate with periodic moduli in the two planar
directions, in the asymptotic regime when the period and the plate thickness
are of the same order of smallness. Assuming that the displacement gradients of
the points of the plate are small enough for the equations of linearised
elasticity to be a suitable approximation of the material response, such as the
case in e.g. acoustic wave propagation, we derive a class of "hybrid",
homogenisation dimension-reduction, norm-resolvent estimates for the plate,
under different energy scalings with respect to the plate thickness.
| math.AP math-ph math.MP math.SP | we analyse a system of partial differential equations describing the behaviour of an elastic plate with periodic moduli in the two planar directions in the asymptotic regime when the period and the plate thickness are of the same order of smallness assuming that the displacement gradients of the points of the plate are small enough for the equations of linearised elasticity to be a suitable approximation of the material response such as the case in eg acoustic wave propagation we derive a class of hybrid homogenisation dimensionreduction normresolvent estimates for the plate under different energy scalings with respect to the plate thickness | [['we', 'analyse', 'a', 'system', 'of', 'partial', 'differential', 'equations', 'describing', 'the', 'behaviour', 'of', 'an', 'elastic', 'plate', 'with', 'periodic', 'moduli', 'in', 'the', 'two', 'planar', 'directions', 'in', 'the', 'asymptotic', 'regime', 'when', 'the', 'period', 'and', 'the', 'plate', 'thickness', 'are', 'of', 'the', 'same', 'order', 'of', 'smallness', 'assuming', 'that', 'the', 'displacement', 'gradients', 'of', 'the', 'points', 'of', 'the', 'plate', 'are', 'small', 'enough', 'for', 'the', 'equations', 'of', 'linearised', 'elasticity', 'to', 'be', 'a', 'suitable', 'approximation', 'of', 'the', 'material', 'response', 'such', 'as', 'the', 'case', 'in', 'eg', 'acoustic', 'wave', 'propagation', 'we', 'derive', 'a', 'class', 'of', 'hybrid', 'homogenisation', 'dimensionreduction', 'normresolvent', 'estimates', 'for', 'the', 'plate', 'under', 'different', 'energy', 'scalings', 'with', 'respect', 'to', 'the', 'plate', 'thickness']] | [-0.16759268945886516, 0.11048267875451653, -0.0670706627881337, 0.009706573459541188, -0.06582318116709882, -0.06933474463556766, -0.022054881366499354, 0.3250107925348714, -0.30663366204666376, -0.250400273410681, 0.1565118870576935, -0.27980583811215326, -0.10932650420741707, 0.19017848032115794, -0.03032297275357825, 0.11970869867204159, 0.016566790238607163, 0.01584099628734311, -0.08094625216771793, -0.15791382017892366, 0.3482300514143015, -0.0045486823701317985, 0.29184741748716025, -0.018814148160505712, 0.11461174236062695, 0.003593797368618349, 0.03258469484275088, 0.06648512500653263, -0.1512730669749669, 0.08022969117497697, 0.2151197220984043, -0.03268385295043973, 0.2307885657338535, -0.4788625271735238, -0.201334068252632, 0.04908927074889196, 0.08654919503682965, 0.12460144904359956, 0.0036792824337003277, -0.23553166497160918, 0.07557137777079262, -0.11075779209917813, -0.22498836966377556, -0.011653005378320813, 0.03283940535951771, 0.10198382797477511, -0.2799261629070137, 0.07565407018980705, 0.06615699818540438, 0.0478344916833414, -0.12874563882702633, -0.09070747204503848, -0.02275494893775413, 0.10170286121309105, 0.10912921194297572, -0.03374011390249008, 0.08752853657100715, -0.14269096230375855, 0.01171839780712902, 0.39506824492869497, -0.11968358807772507, -0.26772177712443995, 0.15959384660327844, -0.15244052899794827, -0.015881877511228416, 0.1307751016403713, 0.2060817266042874, 0.1208472942006683, -0.15118068732237375, 0.07991901886884543, -0.0249176913387012, 0.15483490788542173, 0.12961030075801352, -0.0013419627896783983, 0.15691360857739461, 0.19720901001253913, 0.08060924980250717, 0.1431713581448147, -0.12815898232728096, -0.06747857293150589, -0.3821406990435778, -0.16846347890575142, -0.12950698426906385, 0.02053898985668282, -0.1509487480006475, -0.25214122444866044, 0.3862944913334122, 0.10485051607019176, 0.15528861102739386, 0.06501011607949347, 0.23511591417527775, 0.15931169416951746, 0.0319956969648118, 0.05302327641002907, 0.3039062088834779, 0.1666339428196022, 0.12231222804014881, -0.24911053832529076, 0.050396265283993935, 0.09403913828781714] |
1,802.0264 | Minimizing Latency for Secure Coded Computing Using Secret Sharing via
Staircase Codes | We consider the setting of a Master server, M, who possesses confidential
data (e.g., personal, genomic or medical data) and wants to run intensive
computations on it, as part of a machine learning algorithm for example. The
Master wants to distribute these computations to untrusted workers who have
volunteered or are incentivized to help with this task. However, the data must
be kept private and not revealed to the individual workers. Some of the workers
may be stragglers, e.g., slow or busy, and will take a random time to finish
the task assigned to them. We are interested in reducing the delays experienced
by the Master. We focus on linear computations as an essential operation in
many iterative algorithms such as principal component analysis, support vector
machines and other gradient-descent based algorithms. A classical solution is
to use a linear secret sharing scheme, such as Shamir's scheme, to divide the
data into secret shares on which the workers can perform linear computations.
However, classical codes can provide straggler mitigation assuming a worst-case
scenario of a fixed number of stragglers. We propose a solution based on new
secure codes, called Staircase codes, introduced previously by two of the
authors. Staircase codes allow flexibility in the number of stragglers up to a
given maximum, and universally achieve the information theoretic limit on the
download cost by the Master, leading to latency reduction. Under the shifted
exponential model, we find upper and lower bounds on the Master's mean waiting
time. We derive the distribution of the Master's waiting time, and its mean,
for systems with up to two stragglers. For systems with any number of
stragglers, we derive an expression that can give the exact distribution, and
the mean, of the waiting time of the Master. We show that Staircase codes
always outperform classical secret sharing codes.
| cs.IT math.IT | we consider the setting of a master server m who possesses confidential data eg personal genomic or medical data and wants to run intensive computations on it as part of a machine learning algorithm for example the master wants to distribute these computations to untrusted workers who have volunteered or are incentivized to help with this task however the data must be kept private and not revealed to the individual workers some of the workers may be stragglers eg slow or busy and will take a random time to finish the task assigned to them we are interested in reducing the delays experienced by the master we focus on linear computations as an essential operation in many iterative algorithms such as principal component analysis support vector machines and other gradientdescent based algorithms a classical solution is to use a linear secret sharing scheme such as shamirs scheme to divide the data into secret shares on which the workers can perform linear computations however classical codes can provide straggler mitigation assuming a worstcase scenario of a fixed number of stragglers we propose a solution based on new secure codes called staircase codes introduced previously by two of the authors staircase codes allow flexibility in the number of stragglers up to a given maximum and universally achieve the information theoretic limit on the download cost by the master leading to latency reduction under the shifted exponential model we find upper and lower bounds on the masters mean waiting time we derive the distribution of the masters waiting time and its mean for systems with up to two stragglers for systems with any number of stragglers we derive an expression that can give the exact distribution and the mean of the waiting time of the master we show that staircase codes always outperform classical secret sharing codes | [['we', 'consider', 'the', 'setting', 'of', 'a', 'master', 'server', 'm', 'who', 'possesses', 'confidential', 'data', 'eg', 'personal', 'genomic', 'or', 'medical', 'data', 'and', 'wants', 'to', 'run', 'intensive', 'computations', 'on', 'it', 'as', 'part', 'of', 'a', 'machine', 'learning', 'algorithm', 'for', 'example', 'the', 'master', 'wants', 'to', 'distribute', 'these', 'computations', 'to', 'untrusted', 'workers', 'who', 'have', 'volunteered', 'or', 'are', 'incentivized', 'to', 'help', 'with', 'this', 'task', 'however', 'the', 'data', 'must', 'be', 'kept', 'private', 'and', 'not', 'revealed', 'to', 'the', 'individual', 'workers', 'some', 'of', 'the', 'workers', 'may', 'be', 'stragglers', 'eg', 'slow', 'or', 'busy', 'and', 'will', 'take', 'a', 'random', 'time', 'to', 'finish', 'the', 'task', 'assigned', 'to', 'them', 'we', 'are', 'interested', 'in', 'reducing', 'the', 'delays', 'experienced', 'by', 'the', 'master', 'we', 'focus', 'on', 'linear', 'computations', 'as', 'an', 'essential', 'operation', 'in', 'many', 'iterative', 'algorithms', 'such', 'as', 'principal', 'component', 'analysis', 'support', 'vector', 'machines', 'and', 'other', 'gradientdescent', 'based', 'algorithms', 'a', 'classical', 'solution', 'is', 'to', 'use', 'a', 'linear', 'secret', 'sharing', 'scheme', 'such', 'as', 'shamirs', 'scheme', 'to', 'divide', 'the', 'data', 'into', 'secret', 'shares', 'on', 'which', 'the', 'workers', 'can', 'perform', 'linear', 'computations', 'however', 'classical', 'codes', 'can', 'provide', 'straggler', 'mitigation', 'assuming', 'a', 'worstcase', 'scenario', 'of', 'a', 'fixed', 'number', 'of', 'stragglers', 'we', 'propose', 'a', 'solution', 'based', 'on', 'new', 'secure', 'codes', 'called', 'staircase', 'codes', 'introduced', 'previously', 'by', 'two', 'of', 'the', 'authors', 'staircase', 'codes', 'allow', 'flexibility', 'in', 'the', 'number', 'of', 'stragglers', 'up', 'to', 'a', 'given', 'maximum', 'and', 'universally', 'achieve', 'the', 'information', 'theoretic', 'limit', 'on', 'the', 'download', 'cost', 'by', 'the', 'master', 'leading', 'to', 'latency', 'reduction', 'under', 'the', 'shifted', 'exponential', 'model', 'we', 'find', 'upper', 'and', 'lower', 'bounds', 'on', 'the', 'masters', 'mean', 'waiting', 'time', 'we', 'derive', 'the', 'distribution', 'of', 'the', 'masters', 'waiting', 'time', 'and', 'its', 'mean', 'for', 'systems', 'with', 'up', 'to', 'two', 'stragglers', 'for', 'systems', 'with', 'any', 'number', 'of', 'stragglers', 'we', 'derive', 'an', 'expression', 'that', 'can', 'give', 'the', 'exact', 'distribution', 'and', 'the', 'mean', 'of', 'the', 'waiting', 'time', 'of', 'the', 'master', 'we', 'show', 'that', 'staircase', 'codes', 'always', 'outperform', 'classical', 'secret', 'sharing', 'codes']] | [-0.16083456450264508, 0.0503654363393779, -0.11323660299929447, 0.07755238164712577, -0.09039325579789492, -0.22678899825060447, 0.14754523281436904, 0.37643620873323497, -0.2804423218124277, -0.340565811018582, 0.12569318547550784, -0.2691142416067458, -0.1067233062893042, 0.19430757185067418, -0.14586411674482455, 0.08853937374212699, 0.08028956745156872, 0.07757481678527256, -0.02243055259340939, -0.3539183172619424, 0.28559160546367485, 0.06576791722450014, 0.2519255898100949, -0.01381390809910954, 0.07560109039408608, 0.014132875588027099, -0.0437386134719035, -0.050037200009443804, -0.11188499160949791, 0.10042777191847563, 0.28282662395289854, 0.18286102871245116, 0.32286439753921803, -0.43668466766891806, -0.1738895722760629, 0.13331709396956476, 0.17660470385137733, 0.13440612800485197, -0.027947674312025283, -0.23448076184937044, 0.1028171989164548, -0.18928507721207816, -0.06369004589061278, -0.07056577289614852, -0.016033983896609004, 0.04900039562275388, -0.2767155800155658, 0.015659075082064527, 0.022443942919428656, 0.04761537897014166, -0.010889038244050952, -0.1183900807365334, 0.03418301181150846, 0.18560876925345693, 0.03368684327592506, 0.014353978695381605, 0.11409331969824914, -0.11078195002693592, -0.13835198095368564, 0.3736685649216126, -0.0288902598855968, -0.18697620759791644, 0.15060899492661856, -0.057038543967600594, -0.12987947947648967, 0.08776055977949382, 0.2291437341451743, 0.0909083611758864, -0.1463036889051038, 0.026525370959701065, -0.01826417435873545, 0.16327008050805153, 0.054079266850940735, 0.05798170235500852, 0.15373085682758278, 0.0999772869384431, 0.06534867561066149, 0.14580867111037246, -0.05803640884752033, -0.12378792151330824, -0.24393616519955685, -0.15678661237133815, -0.1967933841086434, 0.042113548470632325, -0.08376039090600036, -0.14236183439214456, 0.3524828887764335, 0.1407365851924911, 0.17695890710800946, 0.11355506423531456, 0.3375811694154675, 0.10701101401852946, 0.10271788814632025, 0.18371184871732207, 0.1290233477228819, 0.06948010325217374, 0.10580192795360314, -0.20787860300103939, 0.10659763971680629, 0.04081169188123711] |
1,802.02641 | On Zero-Sector Reducing Operators | We prove a Jensen-disc type theorem for polynomials $p\in\mathbb{R}[z]$
having all their zeros in a sector of the complex plane. This result is then
used to prove the existence of a collection of linear operators
$T\colon\mathbb{R}[z]\to\mathbb{R}[z]$ which map polynomials with their zeros
in a closed convex sector $|\arg z| \leq \theta<\pi/2$ to polynomials with
zeros in a smaller sector $|\arg z| \leq \gamma<\theta$. We, therefore, provide
the first example of a zero-sector reducing operator.
| math.CV | we prove a jensendisc type theorem for polynomials pinmathbbrz having all their zeros in a sector of the complex plane this result is then used to prove the existence of a collection of linear operators tcolonmathbbrztomathbbrz which map polynomials with their zeros in a closed convex sector arg z leq thetapi2 to polynomials with zeros in a smaller sector arg z leq gammatheta we therefore provide the first example of a zerosector reducing operator | [['we', 'prove', 'a', 'jensendisc', 'type', 'theorem', 'for', 'polynomials', 'pinmathbbrz', 'having', 'all', 'their', 'zeros', 'in', 'a', 'sector', 'of', 'the', 'complex', 'plane', 'this', 'result', 'is', 'then', 'used', 'to', 'prove', 'the', 'existence', 'of', 'a', 'collection', 'of', 'linear', 'operators', 'tcolonmathbbrztomathbbrz', 'which', 'map', 'polynomials', 'with', 'their', 'zeros', 'in', 'a', 'closed', 'convex', 'sector', 'arg', 'z', 'leq', 'thetapi2', 'to', 'polynomials', 'with', 'zeros', 'in', 'a', 'smaller', 'sector', 'arg', 'z', 'leq', 'gammatheta', 'we', 'therefore', 'provide', 'the', 'first', 'example', 'of', 'a', 'zerosector', 'reducing', 'operator']] | [-0.1976370556679155, 0.10549198739629771, -0.06405838642801558, 0.06462351233432335, -0.0838645945935111, -0.1298715824394354, 0.07251788931233542, 0.2932539923116565, -0.2721216479582446, -0.1894369334381606, 0.10863100221946037, -0.2929130925929972, -0.1379632074053266, 0.17189589317089746, 5.597176828554698e-05, 0.017005480566461173, -0.004480352199503354, 0.03559335439307948, -0.09741685284035546, -0.26352502245988163, 0.30019104881212116, -0.08027078755466001, 0.13203029804197805, 0.0627976762796087, 0.1072079517878592, 0.019395672789375696, 0.016347392705003065, -0.0860153894339289, -0.14668951770290733, 0.11916658724325575, 0.2822406066315515, 0.12947078898682127, 0.2314871486010296, -0.32956431984369244, -0.10567043905113159, 0.26434792916822647, 0.1767500798084906, 0.0003921348451902824, -0.025599729542487435, -0.2503080200936113, 0.12063796518237463, -0.11260100029675024, -0.2551333845193897, -0.02709907740354538, 0.015375264760638987, 0.03339901880494186, -0.33722748461046387, 0.04896137294625597, 0.07664659329290902, 0.10546886966164623, 0.010257192847451994, -0.154936781199649, -0.03278608863641109, 0.03991970562243036, 0.03514635667670518, 0.06523600471472102, 0.04433892600770507, -0.108525082698491, -0.07539179885892995, 0.33671481194240704, -0.04271122304988759, -0.28205392562917303, 0.08770980473075594, -0.22728612021143949, -0.19626637555858387, 0.09647622975919928, 0.15622009608362403, 0.17004761190286705, -0.08833957808092237, 0.18849460631608964, -0.13391409284834352, 0.1497944103021707, 0.09960321933031083, 0.013830792604546461, 0.15354738439034138, 0.052700297860428694, 0.10059076989335673, 0.15615100852612937, 0.014628193647201573, -0.04377387055595006, -0.33646509439817496, -0.21495467582052308, -0.15302631132238145, 0.10181258730590344, -0.15601837521285883, -0.18073115296927947, 0.40928071162530355, 0.07361834439340913, 0.22740009073168038, 0.12353063674277759, 0.20922148084001882, 0.12876382081636362, 0.051934529501678685, 0.06502842246554792, 0.14778846326683248, 0.18092070259153842, 0.05201789803270783, -0.10670530238255327, -0.012317099502044064, 0.14851069101132452] |
1,802.02642 | Homogeneous Riemannian manifolds with non-trivial nullity | We develop a general theory for irreducible homogeneous spaces $M= G/H$, in
relation to the nullity $\nu$ of their curvature tensor. We construct natural
invariant (different and increasing) distributions associated with the nullity,
that give a deep insight of such spaces. In particular, there must exist an
order-two transvection, not in the nullity, with null Jacobi operator. This
fact was very important for finding out the first homogeneous examples with
non-trivial nullity, i.e. where the nullity distribution is not parallel.
Moreover, we construct irreducible examples of conullity $k=3$, the smallest
possible, in any dimension. None of our examples admit a quotient of finite
volume. We also proved that $H$ is trivial and $G$ is solvable if $k=3$.
Another of our main results is that the leaves of the nullity are closed (we
used a rather delicate argument). This implies that $M$ is a Euclidean affine
bundle over the quotient by the leaves of $\nu$. Moreover, we prove that $\nu
^\perp$ defines a metric connection on this bundle with transitive holonomy or,
equivalently, $\nu ^\perp$ is completely non-integrable (this is not in general
true for an arbitrary autoparallel and flat invariant distribution).
We also found some general obstruction for the existence of non-trivial
nullity: e.g., if $G$ is reductive (in particular, if $M$ is compact), or if
$G$ is two-step nilpotent.
| math.DG | we develop a general theory for irreducible homogeneous spaces m gh in relation to the nullity nu of their curvature tensor we construct natural invariant different and increasing distributions associated with the nullity that give a deep insight of such spaces in particular there must exist an ordertwo transvection not in the nullity with null jacobi operator this fact was very important for finding out the first homogeneous examples with nontrivial nullity ie where the nullity distribution is not parallel moreover we construct irreducible examples of conullity k3 the smallest possible in any dimension none of our examples admit a quotient of finite volume we also proved that h is trivial and g is solvable if k3 another of our main results is that the leaves of the nullity are closed we used a rather delicate argument this implies that m is a euclidean affine bundle over the quotient by the leaves of nu moreover we prove that nu perp defines a metric connection on this bundle with transitive holonomy or equivalently nu perp is completely nonintegrable this is not in general true for an arbitrary autoparallel and flat invariant distribution we also found some general obstruction for the existence of nontrivial nullity eg if g is reductive in particular if m is compact or if g is twostep nilpotent | [['we', 'develop', 'a', 'general', 'theory', 'for', 'irreducible', 'homogeneous', 'spaces', 'm', 'gh', 'in', 'relation', 'to', 'the', 'nullity', 'nu', 'of', 'their', 'curvature', 'tensor', 'we', 'construct', 'natural', 'invariant', 'different', 'and', 'increasing', 'distributions', 'associated', 'with', 'the', 'nullity', 'that', 'give', 'a', 'deep', 'insight', 'of', 'such', 'spaces', 'in', 'particular', 'there', 'must', 'exist', 'an', 'ordertwo', 'transvection', 'not', 'in', 'the', 'nullity', 'with', 'null', 'jacobi', 'operator', 'this', 'fact', 'was', 'very', 'important', 'for', 'finding', 'out', 'the', 'first', 'homogeneous', 'examples', 'with', 'nontrivial', 'nullity', 'ie', 'where', 'the', 'nullity', 'distribution', 'is', 'not', 'parallel', 'moreover', 'we', 'construct', 'irreducible', 'examples', 'of', 'conullity', 'k3', 'the', 'smallest', 'possible', 'in', 'any', 'dimension', 'none', 'of', 'our', 'examples', 'admit', 'a', 'quotient', 'of', 'finite', 'volume', 'we', 'also', 'proved', 'that', 'h', 'is', 'trivial', 'and', 'g', 'is', 'solvable', 'if', 'k3', 'another', 'of', 'our', 'main', 'results', 'is', 'that', 'the', 'leaves', 'of', 'the', 'nullity', 'are', 'closed', 'we', 'used', 'a', 'rather', 'delicate', 'argument', 'this', 'implies', 'that', 'm', 'is', 'a', 'euclidean', 'affine', 'bundle', 'over', 'the', 'quotient', 'by', 'the', 'leaves', 'of', 'nu', 'moreover', 'we', 'prove', 'that', 'nu', 'perp', 'defines', 'a', 'metric', 'connection', 'on', 'this', 'bundle', 'with', 'transitive', 'holonomy', 'or', 'equivalently', 'nu', 'perp', 'is', 'completely', 'nonintegrable', 'this', 'is', 'not', 'in', 'general', 'true', 'for', 'an', 'arbitrary', 'autoparallel', 'and', 'flat', 'invariant', 'distribution', 'we', 'also', 'found', 'some', 'general', 'obstruction', 'for', 'the', 'existence', 'of', 'nontrivial', 'nullity', 'eg', 'if', 'g', 'is', 'reductive', 'in', 'particular', 'if', 'm', 'is', 'compact', 'or', 'if', 'g', 'is', 'twostep', 'nilpotent']] | [-0.18885197523836744, 0.1504963895362604, -0.08609766296651129, 0.08677469794298245, -0.1340258568440262, -0.1750257100748349, -0.0474107329458313, 0.37642355258130045, -0.2638416005868346, -0.19718697832282803, 0.07863990835033222, -0.248439988665725, -0.1843476455816021, 0.16301909018813984, -0.11883074303474447, -0.02898546521760285, 0.04919058659866656, 0.14253885365308147, -0.11198857954525725, -0.26776931878949034, 0.42787072428429845, -0.006705626812534934, 0.2380899337022544, 0.07326660739613025, 0.1215054151606342, -0.02316971980492461, -0.003155866770720169, 0.03239040866496305, -0.17713659303239573, 0.07089958549370845, 0.2873889748326005, 0.09415382919894195, 0.2012761147612, -0.32439293202063807, -0.14865077570395452, 0.25627622003114214, 0.1224065844373449, -0.006311093644158209, -0.018703019033296707, -0.23332469942703093, 0.13815434580906955, -0.10592636301875387, -0.1704695490869315, -0.07305750082625442, 0.10505973949834925, -0.05769176076519299, -0.24281759540333528, 0.03919508552139404, 0.14116459229714387, 0.06795820108748488, -0.038196557626706554, -0.1008622700034999, -0.07825093519061668, 0.07016762893287609, 0.0011056225766006805, 0.04400854944740528, 0.04437827679315862, -0.03519674437545818, -0.0888461346969808, 0.36799525875878863, -0.07324547928675039, -0.2907482898713315, 0.13437753544852443, -0.16439420896046475, -0.1851024755832769, 0.12250553729378333, 0.07517602728875396, 0.15303854951231005, -0.03398802456739422, 0.1835752076203042, -0.13310533185323623, 0.08527475234852534, 0.08336078263149431, -0.031628641518115674, 0.13690030738524242, 0.09482436864764417, 0.14915597507624875, 0.12910239086417294, -0.003269582046206496, -0.017338780913508357, -0.39275371775745527, -0.20178859882464964, -0.1662801094353199, 0.1801304900202104, -0.11916975879630544, -0.19603780572851226, 0.3689390906051958, 0.05243495226966336, 0.18512502050725743, 0.10569578031137518, 0.2293963771500544, 0.09686777296956611, 0.03389228667030494, 0.13692325405504333, 0.1657217593336548, 0.20129341298722786, -0.05219900898875129, -0.14312157453198335, 0.002086230160319778, 0.11403050964068809] |
1,802.02643 | Gradient conjugate priors and multi-layer neural networks | The paper deals with learning probability distributions of observed data by
artificial neural networks. We suggest a so-called gradient conjugate prior
(GCP) update appropriate for neural networks, which is a modification of the
classical Bayesian update for conjugate priors. We establish a connection
between the gradient conjugate prior update and the maximization of the
log-likelihood of the predictive distribution. Unlike for the Bayesian neural
networks, we use deterministic weights of neural networks, but rather assume
that the ground truth distribution is normal with unknown mean and variance and
learn by the neural networks the parameters of a prior (normal-gamma
distribution) for these unknown mean and variance. The update of the parameters
is done, using the gradient that, at each step, directs towards minimizing the
Kullback--Leibler divergence from the prior to the posterior distribution (both
being normal-gamma). We obtain a corresponding dynamical system for the prior's
parameters and analyze its properties. In particular, we study the limiting
behavior of all the prior's parameters and show how it differs from the case of
the classical full Bayesian update. The results are validated on synthetic and
real world data sets.
| math.ST cs.LG stat.ML stat.TH | the paper deals with learning probability distributions of observed data by artificial neural networks we suggest a socalled gradient conjugate prior gcp update appropriate for neural networks which is a modification of the classical bayesian update for conjugate priors we establish a connection between the gradient conjugate prior update and the maximization of the loglikelihood of the predictive distribution unlike for the bayesian neural networks we use deterministic weights of neural networks but rather assume that the ground truth distribution is normal with unknown mean and variance and learn by the neural networks the parameters of a prior normalgamma distribution for these unknown mean and variance the update of the parameters is done using the gradient that at each step directs towards minimizing the kullbackleibler divergence from the prior to the posterior distribution both being normalgamma we obtain a corresponding dynamical system for the priors parameters and analyze its properties in particular we study the limiting behavior of all the priors parameters and show how it differs from the case of the classical full bayesian update the results are validated on synthetic and real world data sets | [['the', 'paper', 'deals', 'with', 'learning', 'probability', 'distributions', 'of', 'observed', 'data', 'by', 'artificial', 'neural', 'networks', 'we', 'suggest', 'a', 'socalled', 'gradient', 'conjugate', 'prior', 'gcp', 'update', 'appropriate', 'for', 'neural', 'networks', 'which', 'is', 'a', 'modification', 'of', 'the', 'classical', 'bayesian', 'update', 'for', 'conjugate', 'priors', 'we', 'establish', 'a', 'connection', 'between', 'the', 'gradient', 'conjugate', 'prior', 'update', 'and', 'the', 'maximization', 'of', 'the', 'loglikelihood', 'of', 'the', 'predictive', 'distribution', 'unlike', 'for', 'the', 'bayesian', 'neural', 'networks', 'we', 'use', 'deterministic', 'weights', 'of', 'neural', 'networks', 'but', 'rather', 'assume', 'that', 'the', 'ground', 'truth', 'distribution', 'is', 'normal', 'with', 'unknown', 'mean', 'and', 'variance', 'and', 'learn', 'by', 'the', 'neural', 'networks', 'the', 'parameters', 'of', 'a', 'prior', 'normalgamma', 'distribution', 'for', 'these', 'unknown', 'mean', 'and', 'variance', 'the', 'update', 'of', 'the', 'parameters', 'is', 'done', 'using', 'the', 'gradient', 'that', 'at', 'each', 'step', 'directs', 'towards', 'minimizing', 'the', 'kullbackleibler', 'divergence', 'from', 'the', 'prior', 'to', 'the', 'posterior', 'distribution', 'both', 'being', 'normalgamma', 'we', 'obtain', 'a', 'corresponding', 'dynamical', 'system', 'for', 'the', 'priors', 'parameters', 'and', 'analyze', 'its', 'properties', 'in', 'particular', 'we', 'study', 'the', 'limiting', 'behavior', 'of', 'all', 'the', 'priors', 'parameters', 'and', 'show', 'how', 'it', 'differs', 'from', 'the', 'case', 'of', 'the', 'classical', 'full', 'bayesian', 'update', 'the', 'results', 'are', 'validated', 'on', 'synthetic', 'and', 'real', 'world', 'data', 'sets']] | [-0.04929217109942241, 0.022781758807614485, -0.10492359482363255, 0.09779438534490068, -0.09960672093859131, -0.11822925017272586, 0.08030442861070668, 0.43187907109047, -0.29422666392921604, -0.30059781286337556, 0.08905128433649555, -0.255095433834741, -0.1815179641978606, 0.13535324965210202, -0.08609152498576153, 0.11404008551265417, 0.08174692929777153, 0.07011792570088597, -0.1055962383064795, -0.23873006470282288, 0.3470621782748457, 0.06707108799706805, 0.31974571563408055, -0.07967212299796389, 0.15854722283202233, 0.005804438356877887, -0.04923672626824691, -0.029869225066663188, -0.11695427709219561, 0.1603501755345792, 0.1805433318091128, 0.19475183518663208, 0.313294438159661, -0.3867944750616098, -0.25580418685994005, 0.17214502739461068, 0.1147420252598623, 0.09479251336558463, 7.172212450401509e-05, -0.27464263195814415, 0.0488567627691863, -0.12961776095895686, -0.05749460642866013, -0.09443016054935474, -0.0393821524286812, 0.0821993696284829, -0.33206378432478817, 0.08347536556741451, 0.05370256345003799, 0.05508321871791772, -0.05393156159437575, -0.19222257004111987, -0.01688691552972451, 0.13688757915527902, 0.041748787959997744, 0.03279753066574467, 0.13938992616722365, -0.16156850195176062, -0.11112337363858951, 0.2925419583020204, -0.06936014238632916, -0.2392154623789185, 0.11494016387116383, -0.06551604094432, -0.13956046471730832, 0.06391006152962339, 0.19684991824694656, 0.11196507191295452, -0.17790487402101313, 0.06123621903271489, -0.02261989080735587, 0.13195599256304993, 0.005823075719038274, -0.04518958312094481, 0.15094047778828895, 0.16656875223255055, 0.07827055566062663, 0.13770932508358621, -0.13739568761171383, -0.1505357150142803, -0.2804261047920999, -0.11300526849083842, -0.24568600733552806, 0.0007724270478568294, -0.1464195217817236, -0.17020875076680222, 0.39402279627315184, 0.19375527054781125, 0.25795063711229693, 0.1706434064613217, 0.3158734156874651, 0.09175049430406827, 0.03972341778394293, 0.11990928697900319, 0.22147616529140005, 0.1258017396912935, 0.08402974796817603, -0.19463515486867033, 0.16157066217937413, -0.0004979940519617114] |
1,802.02644 | Probabilistic Non-asymptotic Analysis of Distributed Algorithms | We present a new probabilistic analysis of distributed algorithms. Our
approach relies on the theory of quasi-stationary distributions (QSD) recently
developped by Champagnat and Villemonais. We give properties on the deadlock
time and the distribution of the model before deadlock, both for discrete and
diffusion models. Our results are non-asymptotic since they apply to any finite
values of the involved parameters (time, numbers of resources, number of
processors, etc.) and reflect the real behavior of these algorithms, with
potential applications to deadlock prevention, which are very important for
real world applications in computer science.
| math.PR | we present a new probabilistic analysis of distributed algorithms our approach relies on the theory of quasistationary distributions qsd recently developped by champagnat and villemonais we give properties on the deadlock time and the distribution of the model before deadlock both for discrete and diffusion models our results are nonasymptotic since they apply to any finite values of the involved parameters time numbers of resources number of processors etc and reflect the real behavior of these algorithms with potential applications to deadlock prevention which are very important for real world applications in computer science | [['we', 'present', 'a', 'new', 'probabilistic', 'analysis', 'of', 'distributed', 'algorithms', 'our', 'approach', 'relies', 'on', 'the', 'theory', 'of', 'quasistationary', 'distributions', 'qsd', 'recently', 'developped', 'by', 'champagnat', 'and', 'villemonais', 'we', 'give', 'properties', 'on', 'the', 'deadlock', 'time', 'and', 'the', 'distribution', 'of', 'the', 'model', 'before', 'deadlock', 'both', 'for', 'discrete', 'and', 'diffusion', 'models', 'our', 'results', 'are', 'nonasymptotic', 'since', 'they', 'apply', 'to', 'any', 'finite', 'values', 'of', 'the', 'involved', 'parameters', 'time', 'numbers', 'of', 'resources', 'number', 'of', 'processors', 'etc', 'and', 'reflect', 'the', 'real', 'behavior', 'of', 'these', 'algorithms', 'with', 'potential', 'applications', 'to', 'deadlock', 'prevention', 'which', 'are', 'very', 'important', 'for', 'real', 'world', 'applications', 'in', 'computer', 'science']] | [-0.09353193246148607, 0.08404348779129245, -0.11384385949381257, 0.057369973492978885, -0.0507665606796421, -0.12895506993436845, 0.07000234440815264, 0.3572607982142638, -0.2457317293231045, -0.339885111362423, 0.1372549854737196, -0.20737204321169406, -0.15510034207655218, 0.25546238616719763, -0.07575513206181987, 0.1266632384249142, 0.06679831372238496, 0.033871636826104376, -0.009943546062605757, -0.2916400183532988, 0.28606723664173234, 0.02345000558923329, 0.27042582082331823, 0.0715896040629921, 0.08007586859442013, 0.024229820847751632, -0.03312260321446604, -0.01026570125012308, -0.11589632810203619, 0.12888405390924984, 0.2788022872508752, 0.20780453270161023, 0.29033913919501886, -0.46939680456954946, -0.22012128709484974, 0.1115963021994278, 0.1271225375583976, 0.11128731297644516, -0.04570039082068189, -0.2875346167874272, 0.08578796463427685, -0.14417712976755473, -0.10484220487596367, -0.12801407715205543, 0.036903699066975625, 0.08870125906191446, -0.2454997467337757, 0.06287558331725097, 0.047286002846655024, 0.0729304381786415, -0.04711448733184126, -0.12851778101877018, 0.04117350786003054, 0.1565813333977775, 0.04915486903008705, -0.08123817638073477, 0.10856533712195483, -0.12585714309706644, -0.18535189827783935, 0.37066300193308505, -0.0009417625354422677, -0.19129699034996892, 0.22301618661731482, -0.07834226345162719, -0.18330238097577647, 0.08723625681933857, 0.22535784377325926, 0.15005335724481972, -0.10999874516780819, 0.11114978872900529, -0.0023250624897979922, 0.13386568023763115, 0.01214036218801974, 0.04451511075259537, 0.1370701553520336, 0.16268417648770797, 0.038209129725733114, 0.10653086898157434, -0.05954748843558713, -0.15867773048399436, -0.3020922871586937, -0.16936996009361038, -0.19372621156595726, -0.00335462695182932, -0.10076266448000967, -0.1929314591150771, 0.3943139726436266, 0.20633582818141627, 0.1725603966392897, 0.09739225390943028, 0.30808200731733315, 0.0933742749189297, 0.022736090335554335, 0.10244428862126605, 0.1471978038961258, 0.10904331413418135, 0.14876389658699432, -0.18065195921207627, 0.09324984733135469, 0.021427033704415125] |
1,802.02645 | Uniqueness of a Potential from Boundary Data in Locally Conformally
Transversally Anisotropic Geometries | Let $(\Omega^3,g)$ be a compact smooth Riemannian manifold with smooth
boundary and suppose that $U$ is a an open set in $\Omega$ such that $g|_U$ is
the Euclidean metric. Let $\Gamma= \overline{U} \cap \partial \Omega$ be
connected and suppose that $U$ is the convex hull of $\Gamma$. We will study
the uniqueness of an unknown potential for the Schr\"{o}dinger operator $
-\triangle_g + q $ from the associated Dirichlet to Neumann map, $\Lambda_q$.
We will prove that if the potential $q$ is a priori explicitly known in $U^c$,
then one can uniquely reconstruct $q$ over the convex hull of $\Gamma$ from
$\Lambda_q$. We will also outline a reconstruction algorithm. More generally we
will discuss the cases where $\Gamma$ is not connected or $g|_{U}$ is
conformally transversally anisotropic and derive the analogous result.
| math.AP | let omega3g be a compact smooth riemannian manifold with smooth boundary and suppose that u is a an open set in omega such that g_u is the euclidean metric let gamma overlineu cap partial omega be connected and suppose that u is the convex hull of gamma we will study the uniqueness of an unknown potential for the schrodinger operator triangle_g q from the associated dirichlet to neumann map lambda_q we will prove that if the potential q is a priori explicitly known in uc then one can uniquely reconstruct q over the convex hull of gamma from lambda_q we will also outline a reconstruction algorithm more generally we will discuss the cases where gamma is not connected or g_u is conformally transversally anisotropic and derive the analogous result | [['let', 'omega3g', 'be', 'a', 'compact', 'smooth', 'riemannian', 'manifold', 'with', 'smooth', 'boundary', 'and', 'suppose', 'that', 'u', 'is', 'a', 'an', 'open', 'set', 'in', 'omega', 'such', 'that', 'g_u', 'is', 'the', 'euclidean', 'metric', 'let', 'gamma', 'overlineu', 'cap', 'partial', 'omega', 'be', 'connected', 'and', 'suppose', 'that', 'u', 'is', 'the', 'convex', 'hull', 'of', 'gamma', 'we', 'will', 'study', 'the', 'uniqueness', 'of', 'an', 'unknown', 'potential', 'for', 'the', 'schrodinger', 'operator', 'triangle_g', 'q', 'from', 'the', 'associated', 'dirichlet', 'to', 'neumann', 'map', 'lambda_q', 'we', 'will', 'prove', 'that', 'if', 'the', 'potential', 'q', 'is', 'a', 'priori', 'explicitly', 'known', 'in', 'uc', 'then', 'one', 'can', 'uniquely', 'reconstruct', 'q', 'over', 'the', 'convex', 'hull', 'of', 'gamma', 'from', 'lambda_q', 'we', 'will', 'also', 'outline', 'a', 'reconstruction', 'algorithm', 'more', 'generally', 'we', 'will', 'discuss', 'the', 'cases', 'where', 'gamma', 'is', 'not', 'connected', 'or', 'g_u', 'is', 'conformally', 'transversally', 'anisotropic', 'and', 'derive', 'the', 'analogous', 'result']] | [-0.13482809607285162, 0.12723230937285734, -0.08230796744464897, 0.02926260434287542, -0.12156274278459023, -0.17343563078611623, -0.0230442609754391, 0.3699971943806304, -0.33621942246281833, -0.13479215047118487, 0.11502530121833843, -0.32010559294576524, -0.1429394438982854, 0.19631304952963546, -0.10980234988164739, -0.002631719456985593, 0.06450287932966603, 0.13889427206595428, -0.07287611695937812, -0.19689400730203488, 0.4016402495690272, -0.08940808937768452, 0.1486028255385463, 0.09868522848046268, 0.05581010308742407, -0.008436764815087372, 0.03317418159349472, 0.03180972322580544, -0.18903159252045043, 0.07935871558856888, 0.25282118398172315, 0.12101437723868003, 0.24799391301348805, -0.35803476875298657, -0.16815789264364867, 0.23285156432120857, 0.14812000677193282, -0.03388464032468619, -0.0075279398294014754, -0.277715028001694, 0.1542602667286701, -0.08903148541867267, -0.1855898705944128, -0.04792800962604815, 0.08347421946018585, 0.0025360809258927475, -0.35113536472272244, 0.023138727796094827, 0.06154061296911095, -0.03562537127982068, -0.0959191047004424, -0.1138802433051751, -0.04952934616994753, 0.05591392329552036, -0.03632982718045241, 0.18413282821165922, 0.07083937426796183, -0.042496520472923294, -0.06621536592547272, 0.3688755055554793, -0.055986831546761096, -0.29733635384764057, 0.11300776960342773, -0.2196438095634221, -0.09481684518686961, 0.09093236717308173, 0.15960171597544104, 0.14324607941671275, -0.12917099255719222, 0.24087886900679223, -0.08145686812986241, 0.12006263640341786, 0.0613756536749861, -0.06087828896852443, 0.12161270892102038, 0.08023334587414865, 0.17005685223102773, 0.131479456865236, -0.04687352380869925, 0.021261044912535, -0.4100102278025588, -0.14239783427001385, -0.1937792773314868, 0.1772322643029156, -0.10680866837253689, -0.17878525886771968, 0.3244797677552924, 0.04284917675613542, 0.1804571092070546, 0.053122153232834535, 0.22540809519705363, 0.12448659189715272, -0.009951346466550604, 0.15141627965931548, 0.1305473128450103, 0.1496010938717518, -0.021925974140685867, -0.18465964110873756, 0.002047734033112647, 0.0961499146578717] |
1,802.02646 | Holographic Traction Force Microscopy | Traction Force Microscopy (TFM) computes the forces exerted at the surface of
an elastic material by measuring induced deformations in volume. It is used to
determine the pattern of the adhesion forces exerted by cells or by cellular
assemblies grown onto a soft deformable substrate. Typically, colloidal
particles are dispersed in the substrate and their displacement is monitored by
fluorescent microscopy. As with any other fluorescent techniques, the accuracy
in measuring a particule's position is ultimately limited by the number of
evaluated fluorescent photons. Here, we present a TFM technique based on the
detection of probe particle displacements by holographic tracking microscopy.
We show that nanometer scale resolutions of the particle displacements can be
obtained and determine the maximum volume fraction of markers in the substrate.
We demonstrate the feasibility of the technique experimentally and measure the
three-dimensional force fields exerted by colorectal cancer cells cultivated
onto a polyacrylamide gel substrate.
| physics.bio-ph | traction force microscopy tfm computes the forces exerted at the surface of an elastic material by measuring induced deformations in volume it is used to determine the pattern of the adhesion forces exerted by cells or by cellular assemblies grown onto a soft deformable substrate typically colloidal particles are dispersed in the substrate and their displacement is monitored by fluorescent microscopy as with any other fluorescent techniques the accuracy in measuring a particules position is ultimately limited by the number of evaluated fluorescent photons here we present a tfm technique based on the detection of probe particle displacements by holographic tracking microscopy we show that nanometer scale resolutions of the particle displacements can be obtained and determine the maximum volume fraction of markers in the substrate we demonstrate the feasibility of the technique experimentally and measure the threedimensional force fields exerted by colorectal cancer cells cultivated onto a polyacrylamide gel substrate | [['traction', 'force', 'microscopy', 'tfm', 'computes', 'the', 'forces', 'exerted', 'at', 'the', 'surface', 'of', 'an', 'elastic', 'material', 'by', 'measuring', 'induced', 'deformations', 'in', 'volume', 'it', 'is', 'used', 'to', 'determine', 'the', 'pattern', 'of', 'the', 'adhesion', 'forces', 'exerted', 'by', 'cells', 'or', 'by', 'cellular', 'assemblies', 'grown', 'onto', 'a', 'soft', 'deformable', 'substrate', 'typically', 'colloidal', 'particles', 'are', 'dispersed', 'in', 'the', 'substrate', 'and', 'their', 'displacement', 'is', 'monitored', 'by', 'fluorescent', 'microscopy', 'as', 'with', 'any', 'other', 'fluorescent', 'techniques', 'the', 'accuracy', 'in', 'measuring', 'a', 'particules', 'position', 'is', 'ultimately', 'limited', 'by', 'the', 'number', 'of', 'evaluated', 'fluorescent', 'photons', 'here', 'we', 'present', 'a', 'tfm', 'technique', 'based', 'on', 'the', 'detection', 'of', 'probe', 'particle', 'displacements', 'by', 'holographic', 'tracking', 'microscopy', 'we', 'show', 'that', 'nanometer', 'scale', 'resolutions', 'of', 'the', 'particle', 'displacements', 'can', 'be', 'obtained', 'and', 'determine', 'the', 'maximum', 'volume', 'fraction', 'of', 'markers', 'in', 'the', 'substrate', 'we', 'demonstrate', 'the', 'feasibility', 'of', 'the', 'technique', 'experimentally', 'and', 'measure', 'the', 'threedimensional', 'force', 'fields', 'exerted', 'by', 'colorectal', 'cancer', 'cells', 'cultivated', 'onto', 'a', 'polyacrylamide', 'gel', 'substrate']] | [-0.0898113581367355, 0.21940065095509906, -0.0799471157084879, -0.03682536592966081, 0.004823623222009038, -0.11258758381660565, 0.018095002907855647, 0.4100766154029252, -0.28136005363507477, -0.3113534027180135, 0.03511551589341156, -0.30106685510435643, -0.1635823274040533, 0.20468684731803785, -0.053853806851444065, 0.054934124499312696, 0.014414747085249582, -0.05334190929320869, 0.03734409314000498, -0.17773854989706483, 0.2391909092760318, 0.06850375050358129, 0.3211273329350974, 0.09845496129108877, 0.16068827770095293, 0.03732348055523259, 0.004237821649463958, 0.07436379562409608, -0.16920073199208668, 0.12757323162371156, 0.17772687093311587, 0.01968173782143816, 0.22124178958316612, -0.5285272196502677, -0.23882079405697765, 0.06766776662837985, 0.1292187328387163, 0.1005487531417401, -0.09282535885149205, -0.2718110605457563, 0.04006780418783229, -0.08464624501135669, -0.13461625993264137, -0.05515589454945251, 0.004795243519524865, 0.07046660855227452, -0.1943177492635337, 0.10079089417091466, -0.02894553777357773, 0.1096243652929891, -0.09211567442074714, -0.019546536253826904, -0.042187293894305235, 0.12276766294712163, 0.02746372914330306, 0.03607595337567148, 0.3436667500834739, -0.159095860669229, -0.06822295102062605, 0.37900492127842905, -0.032545906522416124, -0.22306509357907914, 0.18611075114366285, -0.14945312821929227, -0.006298746411004011, 0.20191459891861244, 0.14271663673590584, 0.1517401256950091, -0.1868037883969431, 0.012240019030576041, 0.014434762084540535, 0.23897694118493637, 0.15341673781848605, -0.05886380668939246, 0.22586201305272957, 0.22051907757324912, 0.024812450607782168, 0.1489813575530363, -0.18492586089649687, 0.0185282150690524, -0.19907741569019607, -0.18535612139616484, -0.2543992973518687, 0.01088334269982004, -0.07972095880492834, -0.1615750168524189, 0.2951198412808559, 0.08277743058325414, 0.17073282784017554, 0.011269051378087097, 0.31799191511575353, -0.00803346246086209, 0.12129875369884986, -0.06496741433646407, 0.2871090962730012, 0.13319069473843848, 0.06786113681922365, -0.27132465565709757, 0.07731952419849915, 0.08824421336491968] |
1,802.02647 | SCK: A sparse coding based key-point detector | All current popular hand-crafted key-point detectors such as Harris corner,
MSER, SIFT, SURF... rely on some specific pre-designed structures for the
detection of corners, blobs, or junctions in an image. In this paper, a novel
sparse coding based key-point detector which requires no particular
pre-designed structures is presented. The key-point detector is based on
measuring the complexity level of each block in an image to decide where a
key-point should be. The complexity level of a block is defined as the total
number of non-zero components of a sparse representation of that block.
Generally, a block constructed with more components is more complex and has
greater potential to be a good key-point. Experimental results on Webcam and EF
datasets [1, 2] show that the proposed detector achieves significantly high
repeatability compared to hand-crafted features, and even outperforms the
matching scores of the state-of-the-art learning based detector.
| cs.CV | all current popular handcrafted keypoint detectors such as harris corner mser sift surf rely on some specific predesigned structures for the detection of corners blobs or junctions in an image in this paper a novel sparse coding based keypoint detector which requires no particular predesigned structures is presented the keypoint detector is based on measuring the complexity level of each block in an image to decide where a keypoint should be the complexity level of a block is defined as the total number of nonzero components of a sparse representation of that block generally a block constructed with more components is more complex and has greater potential to be a good keypoint experimental results on webcam and ef datasets 1 2 show that the proposed detector achieves significantly high repeatability compared to handcrafted features and even outperforms the matching scores of the stateoftheart learning based detector | [['all', 'current', 'popular', 'handcrafted', 'keypoint', 'detectors', 'such', 'as', 'harris', 'corner', 'mser', 'sift', 'surf', 'rely', 'on', 'some', 'specific', 'predesigned', 'structures', 'for', 'the', 'detection', 'of', 'corners', 'blobs', 'or', 'junctions', 'in', 'an', 'image', 'in', 'this', 'paper', 'a', 'novel', 'sparse', 'coding', 'based', 'keypoint', 'detector', 'which', 'requires', 'no', 'particular', 'predesigned', 'structures', 'is', 'presented', 'the', 'keypoint', 'detector', 'is', 'based', 'on', 'measuring', 'the', 'complexity', 'level', 'of', 'each', 'block', 'in', 'an', 'image', 'to', 'decide', 'where', 'a', 'keypoint', 'should', 'be', 'the', 'complexity', 'level', 'of', 'a', 'block', 'is', 'defined', 'as', 'the', 'total', 'number', 'of', 'nonzero', 'components', 'of', 'a', 'sparse', 'representation', 'of', 'that', 'block', 'generally', 'a', 'block', 'constructed', 'with', 'more', 'components', 'is', 'more', 'complex', 'and', 'has', 'greater', 'potential', 'to', 'be', 'a', 'good', 'keypoint', 'experimental', 'results', 'on', 'webcam', 'and', 'ef', 'datasets', '1', '2', 'show', 'that', 'the', 'proposed', 'detector', 'achieves', 'significantly', 'high', 'repeatability', 'compared', 'to', 'handcrafted', 'features', 'and', 'even', 'outperforms', 'the', 'matching', 'scores', 'of', 'the', 'stateoftheart', 'learning', 'based', 'detector']] | [-0.07813268751448199, 0.003791090067713649, -0.07565101222709229, 0.02490103827097313, -0.0828415390952452, -0.21485288636854608, -0.028080056525913565, 0.4055558425208477, -0.19467470357003175, -0.28646472943563983, 0.12103423933029711, -0.30092358315835566, -0.16079317037118215, 0.19477427444478165, -0.12030264321867734, 0.09763738101552406, 0.11759440882820381, 0.09480269688615346, -0.10958807159387443, -0.24861466286270179, 0.2658318479318963, 0.09860567037137352, 0.3332447564318674, 0.017320171454666206, 0.15482183933666308, -0.01840068537371922, -0.04246845007124548, 0.03187645832714561, -0.01289798283986572, 0.14765850088578228, 0.3236678402794346, 0.17264883296423886, 0.23566425328257762, -0.41906903492771597, -0.18495921276139785, 0.07215301905860742, 0.12622242496820957, 0.08145519764465997, -0.046915691435434344, -0.3320218737409386, 0.15398923563133057, -0.13718901128725033, 0.02136968099831106, -0.06273061039615167, -0.003787650449252496, 0.0080360963730116, -0.2955395469397357, 0.016949881250931793, 0.06719779682565762, 0.049274583473125445, 0.005975670168456966, -0.16874247924616076, 0.011479025457870879, 0.10879716486829549, -0.0367302414530582, 0.07407958818518251, 0.18546900894709747, -0.21240528861101804, -0.1496755472250436, 0.36233476721617863, -0.05886134784668684, -0.219729499674517, 0.2185950968940806, -0.06828419951568931, -0.10943068428705, 0.16397921984045677, 0.1811597057528896, 0.12793813088902511, -0.10669413470497278, 0.0029851873744157946, -0.07411744839779727, 0.2266552335302001, 0.09961137676943246, 0.03609637032846652, 0.17658365434290815, 0.2587002009099145, 0.104003108718033, 0.09665459947427735, -0.18227780357877124, -0.012974689229812524, -0.2567890759442665, -0.12655043379365377, -0.23371070449970893, -0.07177573675130278, -0.12254332766634148, -0.20037096342923477, 0.42997635798911527, 0.18170450006187847, 0.22908546030680865, 0.07802341464182923, 0.3333827037721464, 0.036407436947465864, 0.13991465939412992, 0.09913003352177266, 0.18587225109553251, 0.013156036211636989, 0.03177714718813523, -0.1511035279872387, 0.07800158645083796, 0.08155901936418695] |
1,802.02648 | Entanglement Verification, with or without tomography | Multipartite entanglement has been widely regarded as key resources in
distributed quantum computing, for instance, multi-party cryptography,
measurement based quantum computing, quantum algorithms. It also plays a
fundamental role in quantum phase transitions, even responsible for transport
efficiency in biological systems.
Certifying multipartite entanglement is generally a fundamental task. Since
an $N$ qubit state is parameterized by $4^N-1$ real numbers, one is interested
to design a measurement setup that reveals multipartite entanglement with as
little effort as possible, at least without fully revealing the whole
information of the state, the so called "tomography", which requires
exponential energy.
In this paper, we study this problem of certifying entanglement without
tomography in the constrain that only single copy measurements can be applied.
This task is formulate as a membership problem related to a dividing quantum
state space, therefore, related to the geometric structure of state space. We
show that universal entanglement detection among all states can never be
accomplished without full state tomography. Moreover, we show that almost all
multipartite correlation, include genuine entanglement detection, entanglement
depth verification, requires full state tomography. However, universal
entanglement detection among pure states can be much more efficient, even we
only allow local measurements. Almost optimal local measurement scheme for
detecting pure states entanglement is provided.
| quant-ph | multipartite entanglement has been widely regarded as key resources in distributed quantum computing for instance multiparty cryptography measurement based quantum computing quantum algorithms it also plays a fundamental role in quantum phase transitions even responsible for transport efficiency in biological systems certifying multipartite entanglement is generally a fundamental task since an n qubit state is parameterized by 4n1 real numbers one is interested to design a measurement setup that reveals multipartite entanglement with as little effort as possible at least without fully revealing the whole information of the state the so called tomography which requires exponential energy in this paper we study this problem of certifying entanglement without tomography in the constrain that only single copy measurements can be applied this task is formulate as a membership problem related to a dividing quantum state space therefore related to the geometric structure of state space we show that universal entanglement detection among all states can never be accomplished without full state tomography moreover we show that almost all multipartite correlation include genuine entanglement detection entanglement depth verification requires full state tomography however universal entanglement detection among pure states can be much more efficient even we only allow local measurements almost optimal local measurement scheme for detecting pure states entanglement is provided | [['multipartite', 'entanglement', 'has', 'been', 'widely', 'regarded', 'as', 'key', 'resources', 'in', 'distributed', 'quantum', 'computing', 'for', 'instance', 'multiparty', 'cryptography', 'measurement', 'based', 'quantum', 'computing', 'quantum', 'algorithms', 'it', 'also', 'plays', 'a', 'fundamental', 'role', 'in', 'quantum', 'phase', 'transitions', 'even', 'responsible', 'for', 'transport', 'efficiency', 'in', 'biological', 'systems', 'certifying', 'multipartite', 'entanglement', 'is', 'generally', 'a', 'fundamental', 'task', 'since', 'an', 'n', 'qubit', 'state', 'is', 'parameterized', 'by', '4n1', 'real', 'numbers', 'one', 'is', 'interested', 'to', 'design', 'a', 'measurement', 'setup', 'that', 'reveals', 'multipartite', 'entanglement', 'with', 'as', 'little', 'effort', 'as', 'possible', 'at', 'least', 'without', 'fully', 'revealing', 'the', 'whole', 'information', 'of', 'the', 'state', 'the', 'so', 'called', 'tomography', 'which', 'requires', 'exponential', 'energy', 'in', 'this', 'paper', 'we', 'study', 'this', 'problem', 'of', 'certifying', 'entanglement', 'without', 'tomography', 'in', 'the', 'constrain', 'that', 'only', 'single', 'copy', 'measurements', 'can', 'be', 'applied', 'this', 'task', 'is', 'formulate', 'as', 'a', 'membership', 'problem', 'related', 'to', 'a', 'dividing', 'quantum', 'state', 'space', 'therefore', 'related', 'to', 'the', 'geometric', 'structure', 'of', 'state', 'space', 'we', 'show', 'that', 'universal', 'entanglement', 'detection', 'among', 'all', 'states', 'can', 'never', 'be', 'accomplished', 'without', 'full', 'state', 'tomography', 'moreover', 'we', 'show', 'that', 'almost', 'all', 'multipartite', 'correlation', 'include', 'genuine', 'entanglement', 'detection', 'entanglement', 'depth', 'verification', 'requires', 'full', 'state', 'tomography', 'however', 'universal', 'entanglement', 'detection', 'among', 'pure', 'states', 'can', 'be', 'much', 'more', 'efficient', 'even', 'we', 'only', 'allow', 'local', 'measurements', 'almost', 'optimal', 'local', 'measurement', 'scheme', 'for', 'detecting', 'pure', 'states', 'entanglement', 'is', 'provided']] | [-0.12862666522407726, 0.16230816756260105, -0.08543505099632534, 0.06346602293973168, -0.015603886460441918, -0.235096401996201, 0.03786769655167258, 0.35279982061613174, -0.2596748500907173, -0.29893202442853223, 0.10751413260309381, -0.22761288498129165, -0.12027567709751782, 0.20868646377431496, -0.055574915471619794, 0.1492887583472544, 0.09053910401250635, 0.06174664568444271, -0.046678411563958175, -0.23303795716991382, 0.3131796530009957, 0.041301564534660426, 0.32078549336819423, 0.06847365122188681, 0.07455317054298662, 0.03849577452388725, 0.009673489612482843, 0.018943359285670643, -0.07671081873968, 0.08437891143756653, 0.35129717138063693, 0.1973448613248322, 0.25371281336882107, -0.3950535581824148, -0.2330407390060524, 0.19796295516425744, 0.16114065964329277, 0.1783260500540824, -0.033461923594933024, -0.28752527639984954, 0.016864712914823377, -0.1544806154710906, -0.07661238182114348, -0.1496447582551766, 0.017938139843976214, -0.13666482980174588, -0.22864092642003447, 0.1129703980680677, 0.05217736030019642, 0.04583594352450399, 0.009144115856006031, -0.018925859417677635, 0.013331195328473336, 0.16905845601909927, -0.10900424009388579, 0.015483328468898045, 0.11850145910201328, -0.15915429129686562, -0.1908922789992565, 0.3660246409564501, 0.00021760855424439622, -0.19024749708561492, 0.14559862233166185, -0.10142658758420675, -0.1742169263240482, 0.07840363576653459, 0.11250049119061302, 0.12843605538475372, -0.1367907076012454, 0.05232357137082588, -0.05214632107831892, 0.24211900991032875, 0.03993457457871132, 0.15575807829431834, 0.17806299993147454, 0.11486597489343868, 0.12671751231731226, 0.20673459896074964, -0.04870031285543172, -0.14066115945073154, -0.2790096326176787, -0.24614031379266332, -0.2687331059626082, 0.11260867331154822, -0.04838699185333791, -0.12243104459762219, 0.37953274240223567, 0.12414840793991018, 0.13660623869259975, 0.002879487098349879, 0.31900254336762285, 0.1024646376581153, 0.06196846156824558, 0.10585606364887402, 0.2512360417278528, 0.1301135325638045, 0.05260775598608667, -0.23412516133865297, 0.1429697120318278, 0.021038183065441748] |
1,802.02649 | Correlation Estimation System Minimization Compared to Least Squares
Minimization in Simple Linear Regression | A general method of minimization using correlation coefficients and order
statistics is evaluated relative to least squares procedures in the estimation
of parameters for normal data in simple linear regression.
| stat.ME | a general method of minimization using correlation coefficients and order statistics is evaluated relative to least squares procedures in the estimation of parameters for normal data in simple linear regression | [['a', 'general', 'method', 'of', 'minimization', 'using', 'correlation', 'coefficients', 'and', 'order', 'statistics', 'is', 'evaluated', 'relative', 'to', 'least', 'squares', 'procedures', 'in', 'the', 'estimation', 'of', 'parameters', 'for', 'normal', 'data', 'in', 'simple', 'linear', 'regression']] | [-0.04486244802052776, -0.009156601255138714, -0.10240682084113359, 0.10558291903386513, -0.06458178199827672, -0.17980685397051274, 0.0017237583796183267, 0.3859416484832764, -0.2812266830354929, -0.2663243190695842, 0.15997884480748326, -0.28956673927605153, -0.137838512348632, 0.2062167592346668, -0.07449288051575423, 0.16796590636173883, 0.03930365269382795, 0.04567825372020404, -0.18442594707012178, -0.3210498425488671, 0.25253460311020415, 0.02282783022771279, 0.29284003252784413, -0.04493684023618698, 0.1724551223257246, 0.08048454895615578, -0.0569052000840505, 0.0671410902752541, -0.09809627149564525, 0.14585235946190853, 0.29915963311214, 0.12177396320427457, 0.314344321951891, -0.34440896194428205, -0.16250327077383797, 0.11369697203238806, 0.09271811991930008, 0.04662420439223448, 0.04008686825012167, -0.16224142499268054, 0.04449400554100672, -0.1395216469032069, -0.0762048505867521, -0.11705663135896126, -0.04475937870641549, 0.02148067004357775, -0.4296253733957807, 0.1911833076737821, 0.004995035187312169, 0.13269427983711163, -0.020915603265166283, -0.18124567884563778, 0.06278535439632833, 0.060085698232675594, 0.06781994013581424, -0.040996596403419974, 0.04860192689714798, -0.13046178764974078, -0.13096493187476882, 0.34690520726144314, -0.12298398001197104, -0.2690502199033896, 0.12327955312406023, -0.11613487765813867, -0.12300974481428663, 0.12962421532720328, 0.26762684161464373, 0.1288503381734093, -0.20330231105908753, 0.020921782541942473, -0.0219550176213185, 0.1682392731308937, 0.024998588052888713, -0.0975111394713167, 0.08328476247067253, 0.14950516066358735, 0.07550239463647207, 0.10345158955703179, -0.13547109784558414, -0.044520655212303, -0.2940024137496948, -0.12038549836724996, -0.2421464620778958, -0.10779391697918375, -0.16292173865513176, -0.19063706491142512, 0.4098218483229478, 0.11297646587093671, 0.19943309736748535, 0.09661704801643888, 0.35053392394135396, 0.17937975140909354, 0.0576993819947044, 0.05571680579644938, 0.18863337111348907, 0.1992040613045295, -0.0682642684939007, -0.2070684573457887, 0.10677285119891167, 0.10185155673728635] |
1,802.0265 | Seedless assembly of colloidal crystals by inverted micro-fluidic
pumping | We propose a simple seedless approach to assemble millimeter sized monolayer
single colloidal crystals with desired orientations at predetermined locations
on an unstructured charged substrate. This approach utilizes the
millimeter-ranged fluid flow on the bottom glass substrate induced by an ion
exchange resin (IEX) fixed on top of the closed sample cell. This fluid flow
increases with decreasing height of the sample cell and increasing radius R of
the IEX. For a single inverted pump, millimeter sized monolayer single crystals
of hexagonal close packing can be obtained. For two closely spaced (D ~ 4R)
pumps, the formed crystals have a predefined orientation along the line
connecting the two IEX. By patterning IEX into different structures, colloidal
crystals of different complex patterns form. The present method paves a
convenient way for fabricating high quality monolayer colloidal crystals for a
variety of applications.
| cond-mat.soft | we propose a simple seedless approach to assemble millimeter sized monolayer single colloidal crystals with desired orientations at predetermined locations on an unstructured charged substrate this approach utilizes the millimeterranged fluid flow on the bottom glass substrate induced by an ion exchange resin iex fixed on top of the closed sample cell this fluid flow increases with decreasing height of the sample cell and increasing radius r of the iex for a single inverted pump millimeter sized monolayer single crystals of hexagonal close packing can be obtained for two closely spaced d 4r pumps the formed crystals have a predefined orientation along the line connecting the two iex by patterning iex into different structures colloidal crystals of different complex patterns form the present method paves a convenient way for fabricating high quality monolayer colloidal crystals for a variety of applications | [['we', 'propose', 'a', 'simple', 'seedless', 'approach', 'to', 'assemble', 'millimeter', 'sized', 'monolayer', 'single', 'colloidal', 'crystals', 'with', 'desired', 'orientations', 'at', 'predetermined', 'locations', 'on', 'an', 'unstructured', 'charged', 'substrate', 'this', 'approach', 'utilizes', 'the', 'millimeterranged', 'fluid', 'flow', 'on', 'the', 'bottom', 'glass', 'substrate', 'induced', 'by', 'an', 'ion', 'exchange', 'resin', 'iex', 'fixed', 'on', 'top', 'of', 'the', 'closed', 'sample', 'cell', 'this', 'fluid', 'flow', 'increases', 'with', 'decreasing', 'height', 'of', 'the', 'sample', 'cell', 'and', 'increasing', 'radius', 'r', 'of', 'the', 'iex', 'for', 'a', 'single', 'inverted', 'pump', 'millimeter', 'sized', 'monolayer', 'single', 'crystals', 'of', 'hexagonal', 'close', 'packing', 'can', 'be', 'obtained', 'for', 'two', 'closely', 'spaced', 'd', '4r', 'pumps', 'the', 'formed', 'crystals', 'have', 'a', 'predefined', 'orientation', 'along', 'the', 'line', 'connecting', 'the', 'two', 'iex', 'by', 'patterning', 'iex', 'into', 'different', 'structures', 'colloidal', 'crystals', 'of', 'different', 'complex', 'patterns', 'form', 'the', 'present', 'method', 'paves', 'a', 'convenient', 'way', 'for', 'fabricating', 'high', 'quality', 'monolayer', 'colloidal', 'crystals', 'for', 'a', 'variety', 'of', 'applications']] | [-0.13841002167658142, 0.20348066912495813, -0.029300601692202756, -0.07372816815041006, -0.02354839821547109, -0.20019832632685308, 0.042146485598704264, 0.4472848907541886, -0.2596479867310297, -0.3011114180838461, -0.013307244915568785, -0.27825174286539445, -0.07593555317977242, 0.17243097606115043, 0.00934018844591199, 0.06836229570799594, 0.013910765957301684, -0.09735338988868024, -0.036733383588679634, -0.1743750366224847, 0.2278361716692959, 0.010443131258483413, 0.36461616217044834, 0.02872768183835119, 0.10994999997130186, 0.020446996227298946, 0.08130739579017428, 0.050940399754980055, -0.19609063311325883, 0.1317863337219887, 0.21969432678582856, -0.049658871135212106, 0.2125317979731309, -0.46756129272953395, -0.20826864556791327, 0.014083035410844165, 0.15780218102359514, 0.12326379551840343, -0.11310773340335263, -0.23797485843408023, 0.1151652551719269, -0.09948138805548493, -0.1311738594709862, 0.0007032796593128348, -0.025762078446074786, 0.04405405565345888, -0.2154572653657884, 0.035123606132035204, 0.006665317790596177, 0.07800686793576042, -0.06504069215772178, -0.11722617664394512, -0.0582445553644634, 0.09161360617124027, -0.04805993629793683, 0.01987011995432034, 0.25856669524872156, -0.07817801730472781, -0.07853496890086278, 0.4035475390742151, -0.02519114166766191, -0.19156601226037676, 0.1800711499862105, -0.14010513176062822, -0.057699489857199124, 0.20739682840866794, 0.2022126002250601, 0.15226578267572596, -0.1239930973467819, 0.002663445382181341, -0.0808370910683754, 0.2110414481048923, 0.17975835637993468, -0.020223410689546695, 0.3102638718115983, 0.24594651316728094, 0.05301485079815511, 0.1854364817951372, -0.09549125445262938, -0.03686936223450646, -0.18906395333289777, -0.19100831152549644, -0.20744110885739542, 0.03715354993456988, -0.16330528382214854, -0.2229230324302217, 0.35858198597511315, 0.028342523602031763, 0.21232289457760697, 0.013917407958949213, 0.2549932136488475, 0.008437598063845, 0.09392772338574203, -0.01973304950478051, 0.1784787393399521, 0.1152123679983155, 0.1238800334683854, -0.19355278354633948, 0.0391043906582506, 0.032584444371809206] |
1,802.02651 | Structure and Stability of Internet Top Lists | Active Internet measurement studies rely on a list of targets to be scanned.
While probing the entire IPv4 address space is feasible for scans of limited
complexity, more complex scans do not scale to measuring the full Internet.
Thus, a sample of the Internet can be used instead, often in form of a "top
list". The most widely used list is the Alexa Global Top1M list. Despite their
prevalence, use of top lists is seldomly questioned. Little is known about
their creation, representativity, potential biases, stability, or overlap
between lists. As a result, potential consequences of applying top lists in
research are not known. In this study, we aim to open the discussion on top
lists by investigating the aptness of frequently used top lists for empirical
Internet scans, including stability, correlation, and potential biases of such
lists.
| cs.NI | active internet measurement studies rely on a list of targets to be scanned while probing the entire ipv4 address space is feasible for scans of limited complexity more complex scans do not scale to measuring the full internet thus a sample of the internet can be used instead often in form of a top list the most widely used list is the alexa global top1m list despite their prevalence use of top lists is seldomly questioned little is known about their creation representativity potential biases stability or overlap between lists as a result potential consequences of applying top lists in research are not known in this study we aim to open the discussion on top lists by investigating the aptness of frequently used top lists for empirical internet scans including stability correlation and potential biases of such lists | [['active', 'internet', 'measurement', 'studies', 'rely', 'on', 'a', 'list', 'of', 'targets', 'to', 'be', 'scanned', 'while', 'probing', 'the', 'entire', 'ipv4', 'address', 'space', 'is', 'feasible', 'for', 'scans', 'of', 'limited', 'complexity', 'more', 'complex', 'scans', 'do', 'not', 'scale', 'to', 'measuring', 'the', 'full', 'internet', 'thus', 'a', 'sample', 'of', 'the', 'internet', 'can', 'be', 'used', 'instead', 'often', 'in', 'form', 'of', 'a', 'top', 'list', 'the', 'most', 'widely', 'used', 'list', 'is', 'the', 'alexa', 'global', 'top1m', 'list', 'despite', 'their', 'prevalence', 'use', 'of', 'top', 'lists', 'is', 'seldomly', 'questioned', 'little', 'is', 'known', 'about', 'their', 'creation', 'representativity', 'potential', 'biases', 'stability', 'or', 'overlap', 'between', 'lists', 'as', 'a', 'result', 'potential', 'consequences', 'of', 'applying', 'top', 'lists', 'in', 'research', 'are', 'not', 'known', 'in', 'this', 'study', 'we', 'aim', 'to', 'open', 'the', 'discussion', 'on', 'top', 'lists', 'by', 'investigating', 'the', 'aptness', 'of', 'frequently', 'used', 'top', 'lists', 'for', 'empirical', 'internet', 'scans', 'including', 'stability', 'correlation', 'and', 'potential', 'biases', 'of', 'such', 'lists']] | [-0.09813998176726466, 0.04589442474203334, 0.000473191399113649, 0.12514566601828475, -0.13446458825080174, -0.12044934435733969, 0.13222715713807728, 0.40588413861437433, -0.2280458958290966, -0.3705181268852775, 0.16428969069435023, -0.3085401498297923, -0.07904170292436424, 0.2228092712674793, -0.04270985419012226, 0.05238178459822071, 0.07203348226383002, 0.02919055780491037, -0.02724097250518049, -0.28044435757902336, 0.30834357404612334, 0.05855115209400219, 0.28364964615703175, 0.09094856141039925, -0.013353586444175754, 0.025916366773337998, -0.13433248587428545, 0.013934092309596153, -0.06943155080929779, 0.11981457642986555, 0.26756626053502525, 0.18381284103885184, 0.3073420655526166, -0.35835420078551017, -0.18239370885774167, 0.13857897977603015, 0.17220782170779186, 0.12539427622602098, -0.060648444055662026, -0.2888360790582034, 0.10616887490312657, -0.13241941439001448, -0.10592483216216855, -0.06475549296605108, 0.0447013432934989, 0.04056531457650224, -0.17917829294124768, -0.00814787168259712, -0.012204367793199137, 0.11532107705631069, -0.00562118837630281, -0.12022974663567015, -0.04531608983520826, 0.19442614252393536, 0.03229698712723398, 0.017431616980283365, 0.16024132914854772, -0.15620083113568053, -0.12329953186762907, 0.40837561764353275, -0.03281327464063754, -0.16254928365458537, 0.19296512063456714, -0.08756046104550796, -0.12985531494606042, 0.11113406124993833, 0.19231274800441384, 0.12417831685543604, -0.1944448355734892, 0.040425274371132115, -0.02731763885567223, 0.19629392981483348, 0.08499852040048389, 0.03292000474175438, 0.22661558872795778, 0.19471577250731797, 0.05750029042777843, 0.08969853499421619, -0.0674777210381623, -0.07520532473262372, -0.2477816053509821, -0.14690063931311337, -0.16571267850248375, 0.02351253218103343, -0.009325813196058194, -0.19942234749191978, 0.4046401946625271, 0.17115594039800286, 0.19794256738760937, -0.005602181292594458, 0.2749709813672043, -0.009992823467834642, 0.13575007350109244, 0.050550460271591685, 0.19996443052307097, 0.08184755336064982, 0.1126999252214076, -0.11289174028419054, 0.15337437381084165, 0.012400159586805605] |
1,802.02652 | Partisan: Enabling Cloud-Scale Erlang Applications | In this work, we present an alternative distribution layer for Erlang, named
Partisan. Partisan is a topology-agnostic distributed programming model and
distribution layer that supports several network topologies for different
application scenarios: full mesh, peer-to-peer, client-server, and
publish-subscribe. Partisan allows application developers to specify the
network topology at runtime, rather than encoding topology-specific concerns
into application code. Partisan additionally adds support for more channels,
enabling users to distribute messages over multiple channels, sometimes in
parallel.
We implement and evaluate Partisan in the Erlang programming language and use
it in the evaluation of three scenarios. The first scenario compares the raw
performance between Distributed Erlang and Partisan, and shows that Partisan
performs on par with or better than Distributed Erlang. The second scenario
demonstrates that distributing traffic over multiple connections enables
Partisan to perform up to 18x better under normal conditions, and up to 30x
better in situations with network congestion and high concurrency. The third
scenario demonstrates, using existing applications, that configuring the
topology at runtime allows applications to perform up to 13.5x better or scale
to clusters of thousands of nodes over the general-purpose runtime distribution
layer.
| cs.DC | in this work we present an alternative distribution layer for erlang named partisan partisan is a topologyagnostic distributed programming model and distribution layer that supports several network topologies for different application scenarios full mesh peertopeer clientserver and publishsubscribe partisan allows application developers to specify the network topology at runtime rather than encoding topologyspecific concerns into application code partisan additionally adds support for more channels enabling users to distribute messages over multiple channels sometimes in parallel we implement and evaluate partisan in the erlang programming language and use it in the evaluation of three scenarios the first scenario compares the raw performance between distributed erlang and partisan and shows that partisan performs on par with or better than distributed erlang the second scenario demonstrates that distributing traffic over multiple connections enables partisan to perform up to 18x better under normal conditions and up to 30x better in situations with network congestion and high concurrency the third scenario demonstrates using existing applications that configuring the topology at runtime allows applications to perform up to 135x better or scale to clusters of thousands of nodes over the generalpurpose runtime distribution layer | [['in', 'this', 'work', 'we', 'present', 'an', 'alternative', 'distribution', 'layer', 'for', 'erlang', 'named', 'partisan', 'partisan', 'is', 'a', 'topologyagnostic', 'distributed', 'programming', 'model', 'and', 'distribution', 'layer', 'that', 'supports', 'several', 'network', 'topologies', 'for', 'different', 'application', 'scenarios', 'full', 'mesh', 'peertopeer', 'clientserver', 'and', 'publishsubscribe', 'partisan', 'allows', 'application', 'developers', 'to', 'specify', 'the', 'network', 'topology', 'at', 'runtime', 'rather', 'than', 'encoding', 'topologyspecific', 'concerns', 'into', 'application', 'code', 'partisan', 'additionally', 'adds', 'support', 'for', 'more', 'channels', 'enabling', 'users', 'to', 'distribute', 'messages', 'over', 'multiple', 'channels', 'sometimes', 'in', 'parallel', 'we', 'implement', 'and', 'evaluate', 'partisan', 'in', 'the', 'erlang', 'programming', 'language', 'and', 'use', 'it', 'in', 'the', 'evaluation', 'of', 'three', 'scenarios', 'the', 'first', 'scenario', 'compares', 'the', 'raw', 'performance', 'between', 'distributed', 'erlang', 'and', 'partisan', 'and', 'shows', 'that', 'partisan', 'performs', 'on', 'par', 'with', 'or', 'better', 'than', 'distributed', 'erlang', 'the', 'second', 'scenario', 'demonstrates', 'that', 'distributing', 'traffic', 'over', 'multiple', 'connections', 'enables', 'partisan', 'to', 'perform', 'up', 'to', '18x', 'better', 'under', 'normal', 'conditions', 'and', 'up', 'to', '30x', 'better', 'in', 'situations', 'with', 'network', 'congestion', 'and', 'high', 'concurrency', 'the', 'third', 'scenario', 'demonstrates', 'using', 'existing', 'applications', 'that', 'configuring', 'the', 'topology', 'at', 'runtime', 'allows', 'applications', 'to', 'perform', 'up', 'to', '135x', 'better', 'or', 'scale', 'to', 'clusters', 'of', 'thousands', 'of', 'nodes', 'over', 'the', 'generalpurpose', 'runtime', 'distribution', 'layer']] | [-0.14385636442688904, 0.0017487569318574813, -0.056823808925166246, 0.06437530612913511, -0.11148047309759404, -0.21051330276093977, 0.11489687141867214, 0.4316552700324645, -0.26278191779099247, -0.36171441267855386, 0.03309807818200219, -0.26279368244567813, -0.11020962323465194, 0.18933212905446248, -0.09764318096561618, 0.06841216746577493, 0.05909807905329451, -0.007597535235246504, -0.032440150272093654, -0.2967434816102507, 0.29426918403678626, 0.08244974789414955, 0.3400533345668146, 0.03255071744421511, 0.05094507438010506, 0.017960302988618053, -0.019956592330208387, -0.05808151437918485, -0.006962544017662895, 0.11666030529792601, 0.2908917820689479, 0.20994308084670094, 0.2944935581106092, -0.4554002535259051, -0.16819392604833489, 0.05748244239673299, 0.16048300382931546, 0.04937339882536601, 0.025852241562363334, -0.2636350174885123, 0.15213254163722678, -0.2644386047882939, -0.05640419112407022, -0.10092883524034292, -0.04070714319635543, -0.015050505051359294, -0.2892976527055976, 0.020873812558029288, 0.02097965920874749, 0.04415134212592997, 0.003313791732208663, -0.0734597716094946, 0.025624759935884065, 0.15712251071567818, 0.014238737912232718, 0.0021329262739508063, 0.1410564832313935, -0.08635704708625956, -0.16818761044577446, 0.3853535154253565, -0.029520492723633496, -0.18828881615259616, 0.24542231252542146, -0.01044204067038272, -0.14906907742041894, 0.06554599321492377, 0.2573976115178397, 0.10342789881972857, -0.1470502296322456, 0.009375277241962332, -0.0012344157508504326, 0.23065186848473404, 0.07087375230646582, 0.012637953649485303, 0.1558220192504626, 0.24614972717338993, 0.1337706944204226, 0.16676088562735947, -0.0577071427044669, -0.1735287480787324, -0.18893079201988774, -0.1862684424818864, -0.11695275715832669, -0.058554025467044565, -0.10872039830459843, -0.14052859936610504, 0.3998874820248094, 0.2159415750754296, 0.14832793708930733, 0.13711290849593058, 0.3713899908226825, -0.026661880332500904, 0.11770767236368791, 0.17566807612261023, 0.08007134055827997, 0.008691164997897, 0.19455692340602337, -0.14123987632078214, 0.14785482998066132, -0.06097607218778707] |
1,802.02653 | Characterization of dust activity on Mars from MY27 to MY32 by PFS-MEX
observations | We present spatial and temporal distributions of dust on Mars from Ls = 331
in MY26 until Ls = 80 in MY33 retrieved from the measurements taken by the
Planetary Fourier Spectrometer (PFS) aboard Mars Express. In agreement with
previous observations, large dust opacity is observed mostly in the southern
hemisphere spring/summer and particularly over regions of higher terrain and
large topographic variation. We present a comparison with dust opacities
obtained from Thermal Emission Spectrometer (TES) - Mars Global Surveyor (MGS)
measurements. We found good consistency between observations of two instruments
during overlapping interval (Ls = 331 in MY26 until Ls = 77 in MY27). We found
a different behavior of the dust opacity with latitude in the various Martian
years (inter-annual variations). A global dust storm occurred in MY28. We
observe a different spatial distribution, a later occurrence and dissipation of
the dust maximum activity in MY28 than in other Martian years. A possible
precursor signal to the global dust storm in MY 28 is observed at Ls = 200 -
235 especially over west Hellas. Heavy dust loads alter atmospheric
temperatures. Due to the absorption of solar radiation and emission of infrared
radiation to space by dust vertically non-uniformly distributed, a strong
heating of high atmospheric levels (40 - 50 km) and cooling below around 30 km
are observed.
| astro-ph.EP | we present spatial and temporal distributions of dust on mars from ls 331 in my26 until ls 80 in my33 retrieved from the measurements taken by the planetary fourier spectrometer pfs aboard mars express in agreement with previous observations large dust opacity is observed mostly in the southern hemisphere springsummer and particularly over regions of higher terrain and large topographic variation we present a comparison with dust opacities obtained from thermal emission spectrometer tes mars global surveyor mgs measurements we found good consistency between observations of two instruments during overlapping interval ls 331 in my26 until ls 77 in my27 we found a different behavior of the dust opacity with latitude in the various martian years interannual variations a global dust storm occurred in my28 we observe a different spatial distribution a later occurrence and dissipation of the dust maximum activity in my28 than in other martian years a possible precursor signal to the global dust storm in my 28 is observed at ls 200 235 especially over west hellas heavy dust loads alter atmospheric temperatures due to the absorption of solar radiation and emission of infrared radiation to space by dust vertically nonuniformly distributed a strong heating of high atmospheric levels 40 50 km and cooling below around 30 km are observed | [['we', 'present', 'spatial', 'and', 'temporal', 'distributions', 'of', 'dust', 'on', 'mars', 'from', 'ls', '331', 'in', 'my26', 'until', 'ls', '80', 'in', 'my33', 'retrieved', 'from', 'the', 'measurements', 'taken', 'by', 'the', 'planetary', 'fourier', 'spectrometer', 'pfs', 'aboard', 'mars', 'express', 'in', 'agreement', 'with', 'previous', 'observations', 'large', 'dust', 'opacity', 'is', 'observed', 'mostly', 'in', 'the', 'southern', 'hemisphere', 'springsummer', 'and', 'particularly', 'over', 'regions', 'of', 'higher', 'terrain', 'and', 'large', 'topographic', 'variation', 'we', 'present', 'a', 'comparison', 'with', 'dust', 'opacities', 'obtained', 'from', 'thermal', 'emission', 'spectrometer', 'tes', 'mars', 'global', 'surveyor', 'mgs', 'measurements', 'we', 'found', 'good', 'consistency', 'between', 'observations', 'of', 'two', 'instruments', 'during', 'overlapping', 'interval', 'ls', '331', 'in', 'my26', 'until', 'ls', '77', 'in', 'my27', 'we', 'found', 'a', 'different', 'behavior', 'of', 'the', 'dust', 'opacity', 'with', 'latitude', 'in', 'the', 'various', 'martian', 'years', 'interannual', 'variations', 'a', 'global', 'dust', 'storm', 'occurred', 'in', 'my28', 'we', 'observe', 'a', 'different', 'spatial', 'distribution', 'a', 'later', 'occurrence', 'and', 'dissipation', 'of', 'the', 'dust', 'maximum', 'activity', 'in', 'my28', 'than', 'in', 'other', 'martian', 'years', 'a', 'possible', 'precursor', 'signal', 'to', 'the', 'global', 'dust', 'storm', 'in', 'my', '28', 'is', 'observed', 'at', 'ls', '200', '235', 'especially', 'over', 'west', 'hellas', 'heavy', 'dust', 'loads', 'alter', 'atmospheric', 'temperatures', 'due', 'to', 'the', 'absorption', 'of', 'solar', 'radiation', 'and', 'emission', 'of', 'infrared', 'radiation', 'to', 'space', 'by', 'dust', 'vertically', 'nonuniformly', 'distributed', 'a', 'strong', 'heating', 'of', 'high', 'atmospheric', 'levels', '40', '50', 'km', 'and', 'cooling', 'below', 'around', '30', 'km', 'are', 'observed']] | [-0.058452655320564186, 0.2003533450598662, -0.04951129169293324, 0.08598452700180528, -0.012001429828432735, -0.05194382037087861, 0.010483469304534188, 0.40506751275652847, -0.19749508658648976, -0.3849669269739947, 0.09960709865022775, -0.304265509514759, -0.027323586236379573, 0.17860031527566053, -0.07240985032476953, -0.003063921192953372, 0.06373212509676095, -0.11177568364318163, -0.020361781462516347, -0.21126222469313025, 0.19234212617342616, 0.14402297473004186, 0.198358076017188, 0.0345504710468765, 0.0934643475226338, -0.09118838592377325, -0.08303368422045296, -0.031385676037876724, -0.13828386892317143, 0.054335738727957876, 0.23668893616295594, 0.08989731174362778, 0.17877345444839268, -0.434646598608368, -0.24812873230644183, 0.055776930393753484, 0.07982732178834559, -0.014371640949874469, -0.01031923480781812, -0.24069331165691074, 0.010915915412571874, -0.17817602098743984, -0.1286218225775154, 0.09024688397795141, 0.060488136705677, -0.005982016119881025, -0.2570211009576845, 0.0919432307850538, -0.006946981288402696, 0.19551436600144861, -0.14187474567713082, -0.1492315643143071, -0.07645505589853684, 0.04628146199424018, 0.05637658845210349, 0.02087187391350379, 0.18265256397696078, -0.0760481919095613, 0.004486143496787346, 0.3799952254653121, -0.1659684833311414, 0.029939287387122565, 0.22228480690127408, -0.2783713584387864, -0.14388820854497056, 0.25232564590214457, 0.16457231990894042, 0.07619144554488397, -0.1608179479540474, -0.0011914068600162864, -0.030249611672535898, 0.19516200201410422, 0.12008657941261783, 0.040706902141433944, 0.3021601473953089, 0.1272656492965413, 0.05415343084194864, 0.11422122810553345, -0.2985305425208759, -0.06584139579624738, -0.2093508479422732, -0.08695784943956648, -0.12186609106228331, 0.033668214237038495, -0.1216316140626033, -0.08515655705907746, 0.35295877088725136, 0.16674104698816683, 0.1880672738711903, 0.0155696338188839, 0.2921481290269769, 0.014685776785402987, 0.07881917350909758, 0.121131030658197, 0.302794028914889, 0.10104755286221812, 0.20205054045339893, -0.2078944551387289, 0.0850003611235677, -0.02089290042826231] |
1,802.02654 | Relax-and-split method for nonsmooth nonconvex problems | We develop and analyze a new `relax-and-split' (RS) approach for compositions
of separable nonconvex nonsmooth functions with linear maps. RS uses a
relaxation technique together with partial minimization, and brings classic
techniques including direct factorization, matrix decompositions, and fast
iterative methods to bear on nonsmooth nonconvex problems. We also extend the
approach to trimmed nonconvex-composite formulations; the resulting Trimmed RS
(TRS) can fit models while detecting outliers in the data.
We then test RS and TRS on a diverse set of applications: (1) phase
retrieval, (2) stochastic shortest path problems, (3) semi-supervised
classification, and (4) new clustering approaches. RS/TRS can be applied to
models with very weak functional assumptions, are easy to implement,
competitive with existing methods, and enable a new level of modeling
formulations to be put forward to address emerging challenges in the
mathematical sciences.
| math.OC | we develop and analyze a new relaxandsplit rs approach for compositions of separable nonconvex nonsmooth functions with linear maps rs uses a relaxation technique together with partial minimization and brings classic techniques including direct factorization matrix decompositions and fast iterative methods to bear on nonsmooth nonconvex problems we also extend the approach to trimmed nonconvexcomposite formulations the resulting trimmed rs trs can fit models while detecting outliers in the data we then test rs and trs on a diverse set of applications 1 phase retrieval 2 stochastic shortest path problems 3 semisupervised classification and 4 new clustering approaches rstrs can be applied to models with very weak functional assumptions are easy to implement competitive with existing methods and enable a new level of modeling formulations to be put forward to address emerging challenges in the mathematical sciences | [['we', 'develop', 'and', 'analyze', 'a', 'new', 'relaxandsplit', 'rs', 'approach', 'for', 'compositions', 'of', 'separable', 'nonconvex', 'nonsmooth', 'functions', 'with', 'linear', 'maps', 'rs', 'uses', 'a', 'relaxation', 'technique', 'together', 'with', 'partial', 'minimization', 'and', 'brings', 'classic', 'techniques', 'including', 'direct', 'factorization', 'matrix', 'decompositions', 'and', 'fast', 'iterative', 'methods', 'to', 'bear', 'on', 'nonsmooth', 'nonconvex', 'problems', 'we', 'also', 'extend', 'the', 'approach', 'to', 'trimmed', 'nonconvexcomposite', 'formulations', 'the', 'resulting', 'trimmed', 'rs', 'trs', 'can', 'fit', 'models', 'while', 'detecting', 'outliers', 'in', 'the', 'data', 'we', 'then', 'test', 'rs', 'and', 'trs', 'on', 'a', 'diverse', 'set', 'of', 'applications', '1', 'phase', 'retrieval', '2', 'stochastic', 'shortest', 'path', 'problems', '3', 'semisupervised', 'classification', 'and', '4', 'new', 'clustering', 'approaches', 'rstrs', 'can', 'be', 'applied', 'to', 'models', 'with', 'very', 'weak', 'functional', 'assumptions', 'are', 'easy', 'to', 'implement', 'competitive', 'with', 'existing', 'methods', 'and', 'enable', 'a', 'new', 'level', 'of', 'modeling', 'formulations', 'to', 'be', 'put', 'forward', 'to', 'address', 'emerging', 'challenges', 'in', 'the', 'mathematical', 'sciences']] | [-0.046685989105156554, -0.008840290257887943, -0.10881736054460504, 0.12765161153763088, -0.1419410811391409, -0.2410524333062679, 0.050104351057462505, 0.40438770720345985, -0.3362573456755881, -0.2991833458724084, 0.14371658062889003, -0.24794376042059887, -0.18546062111576547, 0.18846197721875035, -0.11723336397058595, 0.10841739456405614, 0.09426289350975917, -0.04728272414085136, -0.17283955670948795, -0.265969442598063, 0.270735865269454, -0.026187974737206503, 0.2726216514433262, 0.022813018480465234, 0.10647614885542069, 0.009204052788302747, -0.0489941326129848, 0.05164006443298074, -0.08705026814505569, 0.17823638148612775, 0.3067705313744716, 0.20107973826034412, 0.29502866393017735, -0.4330311517922708, -0.2226553396721468, 0.07803906538217927, 0.125507595173714, 0.09559771989006549, -0.03064004738412019, -0.25124443004449915, 0.10863917922590678, -0.1314447578876766, -0.060577616599430124, -0.15607552149214907, -0.04332744709994477, 0.021285125151287013, -0.3271605121996949, 0.06584978708454386, 0.03845402641645841, 0.02099471679131097, -0.0731615180170525, -0.16998600583773718, 0.08827078314115808, 0.047661214062610445, 0.06348764647229282, 0.0267666680644937, 0.07380312948779606, -0.09367963653961335, -0.17083898857027405, 0.3686730198687248, -0.0439631942722168, -0.22828169379141372, 0.2619909973912386, -0.016138518062322887, -0.20133436188699483, 0.11819608702060225, 0.2567702006590344, 0.14757555360739022, -0.15318513259903263, 0.082540939420413, 0.014897412425880111, 0.14264671461058975, 0.012096102926324107, -0.012116153588963311, 0.13160904287518074, 0.19172819147977643, 0.11642337040350174, 0.13398133303927529, -0.10049560036746535, -0.08577939442275509, -0.22906087582180304, -0.08882035189933742, -0.12147558302576862, -0.03089306030922861, -0.10754764255995466, -0.1602259721787674, 0.372402793804267, 0.14971469385625877, 0.18710727111867337, 0.09252129717375528, 0.3207908180427612, 0.11004050816472276, 0.07115475817083089, 0.08788198155503887, 0.1763878844325681, 0.13405708097783264, 0.11181482931063857, -0.1684576869228118, 0.014545309908145955, 0.09495732561861506] |
1,802.02655 | Negative Binomial Construction of Random Discrete Distributions on the
Infinite Simplex | The Poisson-Kingman distributions, $\mathrm{PK}(\rho)$, on the infinite
simplex, can be constructed from a Poisson point process having intensity
density $\rho$ or by taking the ranked jumps up till a specified time of a
subordinator with L\'evy density $\rho$, as proportions of the subordinator. As
a natural extension, we replace the Poisson point process with a negative
binomial point process having parameter $r>0$ and L\'evy density $\rho$,
thereby defining a new class $\mathrm{PK}^{(r)}(\rho)$ of distributions on the
infinite simplex. The new class contains the two-parameter generalisation
$\mathrm{PD}(\alpha, \theta)$ of Pitman and Yor (1997) when $\theta>0$. It also
contains a class of distributions derived from the trimmed stable subordinator.
We derive properties of the new distributions, with particular reference to the
two most well-known $\mathrm{PK}$ distributions: the Poisson-Dirichlet
distribution $\mathrm{PK}(\rho_\theta)$ generated by a Gamma process with
L\'evy density $\rho_\theta(x) = \theta e^{-x}/x$, $x>0$, $\theta > 0$, and the
random discrete distribution, $\mathrm{PD}(\alpha,0)$, derived from an
$\alpha$-stable subordinator.
| math.PR | the poissonkingman distributions mathrmpkrho on the infinite simplex can be constructed from a poisson point process having intensity density rho or by taking the ranked jumps up till a specified time of a subordinator with levy density rho as proportions of the subordinator as a natural extension we replace the poisson point process with a negative binomial point process having parameter r0 and levy density rho thereby defining a new class mathrmpkrrho of distributions on the infinite simplex the new class contains the twoparameter generalisation mathrmpdalpha theta of pitman and yor 1997 when theta0 it also contains a class of distributions derived from the trimmed stable subordinator we derive properties of the new distributions with particular reference to the two most wellknown mathrmpk distributions the poissondirichlet distribution mathrmpkrho_theta generated by a gamma process with levy density rho_thetax theta exx x0 theta 0 and the random discrete distribution mathrmpdalpha0 derived from an alphastable subordinator | [['the', 'poissonkingman', 'distributions', 'mathrmpkrho', 'on', 'the', 'infinite', 'simplex', 'can', 'be', 'constructed', 'from', 'a', 'poisson', 'point', 'process', 'having', 'intensity', 'density', 'rho', 'or', 'by', 'taking', 'the', 'ranked', 'jumps', 'up', 'till', 'a', 'specified', 'time', 'of', 'a', 'subordinator', 'with', 'levy', 'density', 'rho', 'as', 'proportions', 'of', 'the', 'subordinator', 'as', 'a', 'natural', 'extension', 'we', 'replace', 'the', 'poisson', 'point', 'process', 'with', 'a', 'negative', 'binomial', 'point', 'process', 'having', 'parameter', 'r0', 'and', 'levy', 'density', 'rho', 'thereby', 'defining', 'a', 'new', 'class', 'mathrmpkrrho', 'of', 'distributions', 'on', 'the', 'infinite', 'simplex', 'the', 'new', 'class', 'contains', 'the', 'twoparameter', 'generalisation', 'mathrmpdalpha', 'theta', 'of', 'pitman', 'and', 'yor', '1997', 'when', 'theta0', 'it', 'also', 'contains', 'a', 'class', 'of', 'distributions', 'derived', 'from', 'the', 'trimmed', 'stable', 'subordinator', 'we', 'derive', 'properties', 'of', 'the', 'new', 'distributions', 'with', 'particular', 'reference', 'to', 'the', 'two', 'most', 'wellknown', 'mathrmpk', 'distributions', 'the', 'poissondirichlet', 'distribution', 'mathrmpkrho_theta', 'generated', 'by', 'a', 'gamma', 'process', 'with', 'levy', 'density', 'rho_thetax', 'theta', 'exx', 'x0', 'theta', '0', 'and', 'the', 'random', 'discrete', 'distribution', 'mathrmpdalpha0', 'derived', 'from', 'an', 'alphastable', 'subordinator']] | [-0.03811707974679462, 0.17437124562982792, -0.1541649832785742, 0.05752802802089718, -0.05596692451556558, -0.1416387383743151, 0.08913671401367612, 0.36053727465133145, -0.3238221029902502, -0.20571534063950922, 0.07328447554266872, -0.283237956390933, -0.09000086550296234, 0.12826870017914638, -0.07122594982940601, 0.09499545535949785, -0.027461402566325278, 0.0361733122486366, -0.04611492236399998, -0.1859999600612903, 0.3496547787105792, 0.02856262124539034, 0.22664909162367247, -0.0918689845576372, 0.14832439894902788, 0.01209200406447053, -0.06956782075576484, -0.04347895991618503, -0.18037611136491224, 0.06346218202467242, 0.18037125950739782, 0.0481962141714837, 0.2714832899422219, -0.27506369649279505, -0.20320882431984152, 0.16376251839611627, 0.07997831648330472, -0.023282529033516366, -0.036973393373893035, -0.335016715774083, 0.05916664005920597, -0.18134356264107898, -0.20113502576156225, -0.023284678162420042, 0.08890158671260595, 0.08923230503928171, -0.34614664054641575, 0.10133493729776939, 0.10415247158300489, 0.013196284702519746, -0.012276725510250113, -0.21707982219092242, -0.05003620540621142, 0.06306856461543085, 0.05325524783166993, 0.0025044594594749482, 0.1452018747150847, -0.09894775758355485, -0.10639281276205223, 0.31475285569537587, -0.08686366482408181, -0.261516815166257, 0.1105191493677996, -0.21358757037414264, -0.16011733410733253, 0.17712248101103287, 0.11048806751185186, 0.13687272993401203, -0.148521870877518, 0.1564858224077871, -0.048972596640838945, 0.07922933479090866, 0.1356099464688195, -0.06934834826635579, 0.15564167813385185, 0.10804037168647533, 0.11125132231016273, 0.18219065265522708, -0.11716544983847935, -0.1589530106938495, -0.3617899616540741, -0.14873946693483486, -0.22748256971970301, 0.129496888530262, -0.18370617590878519, -0.23859081478559807, 0.33403523698806353, 0.08040005018239305, 0.2552039990558812, 0.1329421277480098, 0.14150815437968872, 0.2007429946404531, -0.06890343119428582, 0.07088398347825628, 0.018716141012216574, 0.1781243418936605, 0.06208634861164458, -0.09125344422908997, 0.12138854235742394, 0.07222082944625147] |
1,802.02656 | Joint Modeling of Accents and Acoustics for Multi-Accent Speech
Recognition | The performance of automatic speech recognition systems degrades with
increasing mismatch between the training and testing scenarios. Differences in
speaker accents are a significant source of such mismatch. The traditional
approach to deal with multiple accents involves pooling data from several
accents during training and building a single model in multi-task fashion,
where tasks correspond to individual accents. In this paper, we explore an
alternate model where we jointly learn an accent classifier and a multi-task
acoustic model. Experiments on the American English Wall Street Journal and
British English Cambridge corpora demonstrate that our joint model outperforms
the strong multi-task acoustic model baseline. We obtain a 5.94% relative
improvement in word error rate on British English, and 9.47% relative
improvement on American English. This illustrates that jointly modeling with
accent information improves acoustic model performance.
| cs.CL cs.SD eess.AS | the performance of automatic speech recognition systems degrades with increasing mismatch between the training and testing scenarios differences in speaker accents are a significant source of such mismatch the traditional approach to deal with multiple accents involves pooling data from several accents during training and building a single model in multitask fashion where tasks correspond to individual accents in this paper we explore an alternate model where we jointly learn an accent classifier and a multitask acoustic model experiments on the american english wall street journal and british english cambridge corpora demonstrate that our joint model outperforms the strong multitask acoustic model baseline we obtain a 594 relative improvement in word error rate on british english and 947 relative improvement on american english this illustrates that jointly modeling with accent information improves acoustic model performance | [['the', 'performance', 'of', 'automatic', 'speech', 'recognition', 'systems', 'degrades', 'with', 'increasing', 'mismatch', 'between', 'the', 'training', 'and', 'testing', 'scenarios', 'differences', 'in', 'speaker', 'accents', 'are', 'a', 'significant', 'source', 'of', 'such', 'mismatch', 'the', 'traditional', 'approach', 'to', 'deal', 'with', 'multiple', 'accents', 'involves', 'pooling', 'data', 'from', 'several', 'accents', 'during', 'training', 'and', 'building', 'a', 'single', 'model', 'in', 'multitask', 'fashion', 'where', 'tasks', 'correspond', 'to', 'individual', 'accents', 'in', 'this', 'paper', 'we', 'explore', 'an', 'alternate', 'model', 'where', 'we', 'jointly', 'learn', 'an', 'accent', 'classifier', 'and', 'a', 'multitask', 'acoustic', 'model', 'experiments', 'on', 'the', 'american', 'english', 'wall', 'street', 'journal', 'and', 'british', 'english', 'cambridge', 'corpora', 'demonstrate', 'that', 'our', 'joint', 'model', 'outperforms', 'the', 'strong', 'multitask', 'acoustic', 'model', 'baseline', 'we', 'obtain', 'a', '594', 'relative', 'improvement', 'in', 'word', 'error', 'rate', 'on', 'british', 'english', 'and', '947', 'relative', 'improvement', 'on', 'american', 'english', 'this', 'illustrates', 'that', 'jointly', 'modeling', 'with', 'accent', 'information', 'improves', 'acoustic', 'model', 'performance']] | [-0.04109050497688629, -0.013310931353717697, -0.02760396836394513, 0.06184303280552504, -0.141598801150987, -0.17671611229371692, 0.08234109843442976, 0.45709692990338363, -0.24999563121754262, -0.3428725823954058, 0.02367664332743044, -0.3228045826708829, -0.1617223740865787, 0.21748484375625762, -0.186115481045649, 0.022042325970337347, 0.1828879515123036, 0.055542533458382996, -0.057689714873278584, -0.2851142359815572, 0.24376404755231407, 0.0662779774447834, 0.45027275140638706, -0.012526229355070325, 0.15791293412653937, -0.03101587430401533, -0.07182506896055268, -0.09925881214871037, -0.02382687201553145, 0.17722718352451922, 0.33486080241424065, 0.18113004642504232, 0.341548895297779, -0.357625714868859, -0.2059924198176574, 0.07089036415434546, 0.09419810007912693, 0.12415768762843477, -0.003153534712166422, -0.38700552373020736, 0.021854880879874583, -0.2320132207961891, 0.11268368654160035, -0.030906728386051126, -0.01826028197451874, -0.01781436825102126, -0.2801069853896344, 0.12450724199103812, 0.11173080485540494, 0.1452239088093241, -0.0770843522761155, -0.15256233631840183, 0.048270362771668095, 0.18189609736480095, 0.0779315621290287, 0.06893412730811785, 0.09879324704460386, -0.17380000458754324, -0.16822750221730934, 0.37500671015845405, -0.11659877617041477, -0.24545140457512052, 0.20386778085009644, -0.013282444178023272, -0.13088101943894462, 0.0035270015674608727, 0.3314024086144787, 0.037745622028079295, -0.15934410526382703, 0.009193794806574092, -0.0673127606994024, 0.2563382106255395, 0.13692222469555282, -0.0535309571126062, 0.17073169714874692, 0.29723630390233463, -0.06062984289256511, 0.1687050895385996, -0.13550578221092346, -0.05751313870703732, -0.2018164020829351, -0.06997672578975282, -0.1337158039557161, -0.07378577121567947, -0.11592370238515151, -0.12647208999982534, 0.3996107390322895, 0.23987266118120815, 0.16901934729475115, 0.11064264570638814, 0.3097614540270081, -0.01930549115339225, 0.058995079035284344, 0.083163845408018, 0.16908312247186486, -0.06098716469757535, 0.15196354584078545, -0.19645847889542994, 0.07702931276246629, 0.028035320341587067] |
1,802.02657 | Dirac and Majorana Feynman Rules with four-fermions | A compact method for amplitude calculations in theories with Dirac and
Majorana effective operators is discussed. Using the renormalizable formalism
of Denner et al., [1,2] for propagators, vertices and fermion (number) flow and
introducing new "reading-rules", it is shown that fermions can be treated as
scalars in the diagrams. The effect of Fermi-statistics appears only in overall
signs and is determined once for whole classes of diagrams. Each vertex in this
method corresponds to two or more vertices in the standard treatment of
effective theories. As such, the advantages of this approach grow together with
the number of four-fermion vertices in a given diagram. The discussion develops
around effective field theories based on the Standard Model, up to
four-fermions and to any order in perturbation theory. Even so, the framework
is more general and can be applied elsewhere.
| hep-ph hep-th | a compact method for amplitude calculations in theories with dirac and majorana effective operators is discussed using the renormalizable formalism of denner et al 12 for propagators vertices and fermion number flow and introducing new readingrules it is shown that fermions can be treated as scalars in the diagrams the effect of fermistatistics appears only in overall signs and is determined once for whole classes of diagrams each vertex in this method corresponds to two or more vertices in the standard treatment of effective theories as such the advantages of this approach grow together with the number of fourfermion vertices in a given diagram the discussion develops around effective field theories based on the standard model up to fourfermions and to any order in perturbation theory even so the framework is more general and can be applied elsewhere | [['a', 'compact', 'method', 'for', 'amplitude', 'calculations', 'in', 'theories', 'with', 'dirac', 'and', 'majorana', 'effective', 'operators', 'is', 'discussed', 'using', 'the', 'renormalizable', 'formalism', 'of', 'denner', 'et', 'al', '12', 'for', 'propagators', 'vertices', 'and', 'fermion', 'number', 'flow', 'and', 'introducing', 'new', 'readingrules', 'it', 'is', 'shown', 'that', 'fermions', 'can', 'be', 'treated', 'as', 'scalars', 'in', 'the', 'diagrams', 'the', 'effect', 'of', 'fermistatistics', 'appears', 'only', 'in', 'overall', 'signs', 'and', 'is', 'determined', 'once', 'for', 'whole', 'classes', 'of', 'diagrams', 'each', 'vertex', 'in', 'this', 'method', 'corresponds', 'to', 'two', 'or', 'more', 'vertices', 'in', 'the', 'standard', 'treatment', 'of', 'effective', 'theories', 'as', 'such', 'the', 'advantages', 'of', 'this', 'approach', 'grow', 'together', 'with', 'the', 'number', 'of', 'fourfermion', 'vertices', 'in', 'a', 'given', 'diagram', 'the', 'discussion', 'develops', 'around', 'effective', 'field', 'theories', 'based', 'on', 'the', 'standard', 'model', 'up', 'to', 'fourfermions', 'and', 'to', 'any', 'order', 'in', 'perturbation', 'theory', 'even', 'so', 'the', 'framework', 'is', 'more', 'general', 'and', 'can', 'be', 'applied', 'elsewhere']] | [-0.09628569933637562, 0.18288024865366795, -0.08371268354390782, 0.07543913316568014, -0.07245248047186545, -0.14569521544294226, 0.04069274216459167, 0.33797741748944476, -0.18324930400208192, -0.329955037365909, 0.040197201077481384, -0.28776626399614746, -0.17222989617363998, 0.14908754336992625, -0.03394503654498193, 0.00588050483967419, 0.021721372601610642, 0.07264078028017172, -0.06953535230692338, -0.271677000299786, 0.3157191243574575, 0.0011445785838144797, 0.21366859824155215, 0.0644117603233705, 0.054830284402878196, 0.02855998880609318, -0.022232811164145393, 0.08053913071786088, -0.07469014376256382, 0.08480066685006023, 0.2174846145928044, 0.0726843571462841, 0.2148194115332983, -0.40354430206395964, -0.21675248913190984, 0.08760574914308059, 0.16855726628391832, 0.14576642387029198, -0.009615073784435582, -0.266182706319658, 0.09366043237624345, -0.1865242325183418, -0.16057336785727078, -0.0770253866942194, 0.016733924407270496, -0.06552523921623274, -0.293864499370533, 0.04978157956761101, 0.012806019656084203, 0.03362865724069437, -0.005428412025449453, -0.13141431581763618, -0.03978386261258964, 0.09627372623697199, 0.04489654899247129, 0.07135281129567711, 0.07778707856605588, -0.15903874783328287, -0.12330424294082655, 0.4012376836979658, -0.09608978645410389, -0.22477452843514684, 0.17415394409369953, -0.12268785081665826, -0.12517410338062931, 0.09864230391879876, 0.12607156713665635, 0.15487799624981427, -0.16287225310311274, 0.13846852535606122, -0.013806288318570566, 0.1105122592093216, 0.05612044241969232, 0.01832087036023882, 0.20778149993469316, 0.1544163717250167, 0.06004477043946584, 0.10318013404978922, -0.013046024877715993, -0.10262996723780546, -0.33178807222456846, -0.13729370989369474, -0.1514845396771475, 0.0038531575196733077, -0.09292321884250096, -0.16338045481588104, 0.40909755468644476, 0.15934954945135998, 0.1842408875568287, 0.013338137842300866, 0.2517968477560552, 0.14636669294494722, 0.135915812553355, 0.07722037464457875, 0.22523057703963584, 0.1434599904274499, 0.049572334424765024, -0.1834094143541599, -0.01529712673207676, 0.13387635867111386] |
1,802.02658 | Groups with frames of translates | Let $G$ be a locally compact group with left regular representation
$\lambda_{G}.$ We say that $G$ admits a frame of translates if there exist a
countable set $\Gamma\subset G$ and $\varphi\in L^{2}(G)$ such that
$(\lambda_{G}(x) \varphi)_{x \in\Gamma}$ is a frame for $L^{2}(G).$ The present
work aims to characterize locally compact groups having frames of translates,
and to this end, we derive necessary and/or sufficient conditions for the
existence of such frames. Additionally, we exhibit surprisingly large classes
of Lie groups admitting frames of translates.
| math.RT | let g be a locally compact group with left regular representation lambda_g we say that g admits a frame of translates if there exist a countable set gammasubset g and varphiin l2g such that lambda_gx varphi_x ingamma is a frame for l2g the present work aims to characterize locally compact groups having frames of translates and to this end we derive necessary andor sufficient conditions for the existence of such frames additionally we exhibit surprisingly large classes of lie groups admitting frames of translates | [['let', 'g', 'be', 'a', 'locally', 'compact', 'group', 'with', 'left', 'regular', 'representation', 'lambda_g', 'we', 'say', 'that', 'g', 'admits', 'a', 'frame', 'of', 'translates', 'if', 'there', 'exist', 'a', 'countable', 'set', 'gammasubset', 'g', 'and', 'varphiin', 'l2g', 'such', 'that', 'lambda_gx', 'varphi_x', 'ingamma', 'is', 'a', 'frame', 'for', 'l2g', 'the', 'present', 'work', 'aims', 'to', 'characterize', 'locally', 'compact', 'groups', 'having', 'frames', 'of', 'translates', 'and', 'to', 'this', 'end', 'we', 'derive', 'necessary', 'andor', 'sufficient', 'conditions', 'for', 'the', 'existence', 'of', 'such', 'frames', 'additionally', 'we', 'exhibit', 'surprisingly', 'large', 'classes', 'of', 'lie', 'groups', 'admitting', 'frames', 'of', 'translates']] | [-0.21918314807565817, 0.11576041817547282, -0.10688748250642499, 0.017987959894789272, -0.12960785400425365, -0.13997091117303773, 0.018224708085139114, 0.45800882835973455, -0.25015496549263866, -0.20950195021157333, 0.10992416281096008, -0.21812971241502876, -0.08987876873306301, 0.167951027894286, -0.14903592109029373, -0.08065745817688126, 0.09426682996731925, 0.1518726903518819, -0.10387788516054132, -0.2162889479603394, 0.3804429783878556, -0.08385099173265409, 0.17538224115788217, -0.007438762489347214, 0.17233915688155824, -0.020498304089239562, -0.010818212719477084, 0.05594758104521736, -0.17989459033885055, 0.10244670446333756, 0.30787662659064835, 0.1531010088398604, 0.2643467851925686, -0.3537461267874004, -0.140513586553644, 0.26026688927941655, 0.0772136893089726, -0.019254972283021515, -0.06291135604751397, -0.2713329157825694, 0.16922833734326603, -0.13337254649903402, -0.12036312094900802, -0.08553783894034035, 0.14161194434546562, -0.00837337983076472, -0.31495343625870903, 0.030712932853185267, 0.13019080920122475, 0.05632518360907414, -0.06019100555813456, -0.03597364534276078, -0.034080476171886885, 0.14080108835709743, -0.05459239355467978, 0.10273908452882645, 0.05264142341350755, 0.007128172593348357, -0.03039042340277369, 0.47032427132488736, -0.09310245093137744, -0.2171457352015717, 0.19475422966776482, -0.18774192584874894, -0.17418004708162632, 0.1055772994274655, 0.1369734696303326, 0.15356983542891153, -0.07815566680293126, 0.1687204668183351, -0.1566147729754448, 0.13300687011825033, 0.12216362654489565, 0.07339396943753383, 0.17839371377647104, 0.11249624879144311, 0.14203624332222684, 0.12771983804736645, 0.031617018809340085, 0.12602435688331096, -0.3945873417296862, -0.13862139545942107, -0.09483840109511132, 0.1158744442579617, -0.06780047807807428, -0.16531783170122877, 0.36594545540500834, 0.05160216698198613, 0.1869447781895119, 0.16003913138375944, 0.1318534329443811, 0.08406466719535241, 0.06703811206753893, 0.16550289438364196, 0.07226003133074706, 0.16829852716077165, -0.10670291053422962, -0.09995365352580234, -0.07048298917564912, 0.15105540313791618] |
1,802.02659 | There is no Khintchine threshold for metric pair correlations | We consider sequences of the form $\left(a_{n} \alpha\right)_{n}$ mod 1,
where $\alpha\in\left[0,1\right]$ and where $\left(a_{n}\right)_{n}$ is a
strictly increasing sequence of positive integers. If the asymptotic
distribution of the pair correlations of this sequence follows the Poissonian
model for almost all $\alpha$ in the sense of Lebesgue measure, we say that
$(a_n)_n$ has the metric pair correlation property. Recent research has
revealed a connection between the metric theory of pair correlations of such
sequences, and the additive energy of truncations of $(a_n)_{n}$. Bloom, Chow,
Gafni and Walker speculated that there might be a convergence/divergence
criterion which fully characterises the metric pair correlation property in
terms of the additive energy, similar to Khintchine's criterion in the metric
theory of Diophantine approximation. In the present paper we give a negative
answer to such speculations, by showing that such a criterion does not exist.
To this end, we construct a sequence $(a_n)_n$ having large additive energy
which, however, maintains the metric pair correlation property.
| math.NT | we consider sequences of the form lefta_n alpharight_n mod 1 where alphainleft01right and where lefta_nright_n is a strictly increasing sequence of positive integers if the asymptotic distribution of the pair correlations of this sequence follows the poissonian model for almost all alpha in the sense of lebesgue measure we say that a_n_n has the metric pair correlation property recent research has revealed a connection between the metric theory of pair correlations of such sequences and the additive energy of truncations of a_n_n bloom chow gafni and walker speculated that there might be a convergencedivergence criterion which fully characterises the metric pair correlation property in terms of the additive energy similar to khintchines criterion in the metric theory of diophantine approximation in the present paper we give a negative answer to such speculations by showing that such a criterion does not exist to this end we construct a sequence a_n_n having large additive energy which however maintains the metric pair correlation property | [['we', 'consider', 'sequences', 'of', 'the', 'form', 'lefta_n', 'alpharight_n', 'mod', '1', 'where', 'alphainleft01right', 'and', 'where', 'lefta_nright_n', 'is', 'a', 'strictly', 'increasing', 'sequence', 'of', 'positive', 'integers', 'if', 'the', 'asymptotic', 'distribution', 'of', 'the', 'pair', 'correlations', 'of', 'this', 'sequence', 'follows', 'the', 'poissonian', 'model', 'for', 'almost', 'all', 'alpha', 'in', 'the', 'sense', 'of', 'lebesgue', 'measure', 'we', 'say', 'that', 'a_n_n', 'has', 'the', 'metric', 'pair', 'correlation', 'property', 'recent', 'research', 'has', 'revealed', 'a', 'connection', 'between', 'the', 'metric', 'theory', 'of', 'pair', 'correlations', 'of', 'such', 'sequences', 'and', 'the', 'additive', 'energy', 'of', 'truncations', 'of', 'a_n_n', 'bloom', 'chow', 'gafni', 'and', 'walker', 'speculated', 'that', 'there', 'might', 'be', 'a', 'convergencedivergence', 'criterion', 'which', 'fully', 'characterises', 'the', 'metric', 'pair', 'correlation', 'property', 'in', 'terms', 'of', 'the', 'additive', 'energy', 'similar', 'to', 'khintchines', 'criterion', 'in', 'the', 'metric', 'theory', 'of', 'diophantine', 'approximation', 'in', 'the', 'present', 'paper', 'we', 'give', 'a', 'negative', 'answer', 'to', 'such', 'speculations', 'by', 'showing', 'that', 'such', 'a', 'criterion', 'does', 'not', 'exist', 'to', 'this', 'end', 'we', 'construct', 'a', 'sequence', 'a_n_n', 'having', 'large', 'additive', 'energy', 'which', 'however', 'maintains', 'the', 'metric', 'pair', 'correlation', 'property']] | [-0.18061094392536195, 0.11602121552250366, -0.12093966252480944, 0.10421228950254549, -0.0225823826592931, -0.14470875789792095, 0.028061228906794352, 0.35049939530157725, -0.3071647320036431, -0.24653268609772166, 0.037273175665909576, -0.30346559538980417, -0.1930145956927313, 0.11054023241758956, -0.08237454287250931, 0.027949893606223353, 0.04357951753055267, 0.09794358762109992, -0.03950181406477478, -0.25674225408261725, 0.38048223174124396, -0.0029450706411270227, 0.2476160404325094, 0.05878992320137954, 0.1333323076407007, 0.0028038968012884915, -0.039585105985485064, 0.030481111767859954, -0.15097540873555876, 0.07346234721594355, 0.23044988192594465, 0.1380889447605085, 0.3141925316245395, -0.32079565274652166, -0.17027889030733667, 0.21122974525469373, 0.13193730903648823, 0.026868739297156625, -0.050936941521640564, -0.23010117091742233, 0.15729213443455878, -0.16760561412929575, -0.11494514313028575, -0.05539492487251384, 0.06913229882271972, 0.04197452995419479, -0.3011679337184244, 0.05606424428944318, 0.16718933556474885, 0.03550523766697203, -0.0450150436742243, -0.08141905128949983, -0.004393329892934259, 0.09880412211231653, 0.05339636220677613, 0.09578612413397937, 0.03339006926911245, -0.06744300545948856, -0.09619266830813784, 0.3247762204546177, -0.08680777985942345, -0.2105946046169906, 0.13783641297768498, -0.17500766492214453, -0.15043585476283944, 0.08056731912184437, 0.08669582652455231, 0.10410305799523943, -0.10338859299326655, 0.1218716087271518, -0.08477485566780721, 0.16101700377961, 0.1063713142941208, 0.08812415877023255, 0.16537593040357595, 0.06477671495855511, 0.09580646669960716, 0.11756679884512446, -0.026761062946990603, -0.08555868083505698, -0.3011553459302903, -0.17873651955757033, -0.1900396329481096, 0.12514021028715125, -0.09520084997494456, -0.23585466293723517, 0.35866797869913747, 0.08183683902786681, 0.20845922364988043, 0.10884471855758918, 0.20587332525038682, 0.11796119803293321, 0.013078366915121346, 0.05626945998285364, 0.17862452048831765, 0.1464637777015403, 0.016988542159351538, -0.1332142792943039, 0.06660264907126555, 0.11989499728704961] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.