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.0266 | Deletable edges in 3-connected graphs and their applications | Let $G$ and $H$ be simple 3-connected graphs such that $G$ has an $H$-minor.
An edge $e$ in $G$ is called {\it $H$-deletable} if $G\backslash e$ is
3-connected and has an $H$-minor. The main result in this paper establishes
that, if $G$ has no $H$-deletable edges, then there exists a sequence of simple
3-connected graphs $G_0, \dots , G_k$ with no $H$-deletable edges such that
$G_0\cong H$, $G_k= G$, and for $1 \le i \le k$ one of three possibilities
holds: $G_{i-1}= G_i/f$; $G_{i-1}=G_i/f \backslash e$ where $e$ and $f$ are
incident to a degree 3 vertex in $G_i$; or $G_{i-1}=G_i-w$ where $w$ is a
degree $3$ vertex in $G_i$. Several applications are given including a graph
theoretic proof of the matroid theory result known as the Strong Splitter
Theorem, a short new proof of Dirac's characterization of 3-connected graphs
with no minor isomorphic to the prism graph, and an extension of a result by
Halin that bounds the number of edges in a minimally 3-connected graph. Halin
proved that if $G$ is a minimally $3$-connected graph on $n\ge 8$ vertices,
then $|E(G)|\le 3n-9$ and equality holds if and only if $G\cong K_{3, n-3}$. We
give a different proof of Halin's result and extend it by identifying the
minimally 3-connected infinite family of graphs with $|E(G)|=3n-10$.
| math.CO | let g and h be simple 3connected graphs such that g has an hminor an edge e in g is called it hdeletable if gbackslash e is 3connected and has an hminor the main result in this paper establishes that if g has no hdeletable edges then there exists a sequence of simple 3connected graphs g_0 dots g_k with no hdeletable edges such that g_0cong h g_k g and for 1 le i le k one of three possibilities holds g_i1 g_if g_i1g_if backslash e where e and f are incident to a degree 3 vertex in g_i or g_i1g_iw where w is a degree 3 vertex in g_i several applications are given including a graph theoretic proof of the matroid theory result known as the strong splitter theorem a short new proof of diracs characterization of 3connected graphs with no minor isomorphic to the prism graph and an extension of a result by halin that bounds the number of edges in a minimally 3connected graph halin proved that if g is a minimally 3connected graph on nge 8 vertices then egle 3n9 and equality holds if and only if gcong k_3 n3 we give a different proof of halins result and extend it by identifying the minimally 3connected infinite family of graphs with eg3n10 | [['let', 'g', 'and', 'h', 'be', 'simple', '3connected', 'graphs', 'such', 'that', 'g', 'has', 'an', 'hminor', 'an', 'edge', 'e', 'in', 'g', 'is', 'called', 'it', 'hdeletable', 'if', 'gbackslash', 'e', 'is', '3connected', 'and', 'has', 'an', 'hminor', 'the', 'main', 'result', 'in', 'this', 'paper', 'establishes', 'that', 'if', 'g', 'has', 'no', 'hdeletable', 'edges', 'then', 'there', 'exists', 'a', 'sequence', 'of', 'simple', '3connected', 'graphs', 'g_0', 'dots', 'g_k', 'with', 'no', 'hdeletable', 'edges', 'such', 'that', 'g_0cong', 'h', 'g_k', 'g', 'and', 'for', '1', 'le', 'i', 'le', 'k', 'one', 'of', 'three', 'possibilities', 'holds', 'g_i1', 'g_if', 'g_i1g_if', 'backslash', 'e', 'where', 'e', 'and', 'f', 'are', 'incident', 'to', 'a', 'degree', '3', 'vertex', 'in', 'g_i', 'or', 'g_i1g_iw', 'where', 'w', 'is', 'a', 'degree', '3', 'vertex', 'in', 'g_i', 'several', 'applications', 'are', 'given', 'including', 'a', 'graph', 'theoretic', 'proof', 'of', 'the', 'matroid', 'theory', 'result', 'known', 'as', 'the', 'strong', 'splitter', 'theorem', 'a', 'short', 'new', 'proof', 'of', 'diracs', 'characterization', 'of', '3connected', 'graphs', 'with', 'no', 'minor', 'isomorphic', 'to', 'the', 'prism', 'graph', 'and', 'an', 'extension', 'of', 'a', 'result', 'by', 'halin', 'that', 'bounds', 'the', 'number', 'of', 'edges', 'in', 'a', 'minimally', '3connected', 'graph', 'halin', 'proved', 'that', 'if', 'g', 'is', 'a', 'minimally', '3connected', 'graph', 'on', 'nge', '8', 'vertices', 'then', 'egle', '3n9', 'and', 'equality', 'holds', 'if', 'and', 'only', 'if', 'gcong', 'k_3', 'n3', 'we', 'give', 'a', 'different', 'proof', 'of', 'halins', 'result', 'and', 'extend', 'it', 'by', 'identifying', 'the', 'minimally', '3connected', 'infinite', 'family', 'of', 'graphs', 'with', 'eg3n10']] | [-0.19175869936365275, 0.1603139468198396, -0.03687182191284732, -0.02827728580814437, -0.11551180041995114, -0.20945688065526505, -0.009665318175393622, 0.40177613568420595, -0.2500395980806878, -0.30633822496299845, 0.047801773050545865, -0.3348968707813093, -0.16052307051163203, 0.13717203854936927, -0.1217264615966437, -0.06117536925404028, 0.14507365573640876, 0.1260948404087685, 0.07783440224123367, -0.2640882139161337, 0.26664864742913497, -0.10970378602080298, 0.10288739618072913, 0.11124806197207923, 0.08774108184465709, 0.08116053695826289, 0.06980678527347314, 0.05944638620824732, -0.21245132662922445, 0.028108741157316566, 0.27910663346903253, 0.1602570189652397, 0.24256082523508946, -0.36785209658466134, -0.13641938109447857, 0.26721538531945466, 0.09949255605729726, -0.020159879557188384, -0.032878115087022215, -0.1808998262478361, 0.16198302540914694, -0.11563171310612794, -0.09362579603195907, 0.031850036459777936, 0.16860091436179714, -0.04888568072335776, -0.2954095998496856, -0.04781171114882454, 0.21139403252499717, 0.062052246214499555, 0.11390695551437183, -0.17497269187767345, -0.11797498123129256, 0.058131273922649246, -0.08647997583298442, 0.1579889515056633, 0.008065572160725983, -0.09304617357982072, -0.16675027264864184, 0.3704520870017474, -0.06847768773206134, -0.1550592826880837, 0.10543415714682151, -0.14001877086299758, -0.23302731252176903, 0.09775454210970426, 0.045436754782433406, 0.17994633577361058, -0.07067634937769841, 0.22638202340413743, -0.1439970227606514, 0.1232793855753978, 0.14874907664489, -0.02428858662908449, 0.11058707894475307, 0.07676749789411239, 0.1891819295118554, 0.14537320691642192, 0.07158491417626814, 0.13750873010856315, -0.33930334427322334, -0.11890796067802092, -0.2505109593084154, 0.14926067187200084, -0.18852778648243446, -0.1878525471312549, 0.37465797044793503, 0.05352315809376215, 0.15194528038801552, 0.10490374421127714, 0.2094231434395904, 0.041988016360846814, 0.024136935320432082, 0.18012028478103906, 0.11301631825223851, 0.24377705010612352, -0.10464989368091875, -0.08208597912380355, 0.004376691490716229, 0.1585275528643531] |
1,802.02661 | Gravitation in terms of observables | In the 1960's, Mandelstam proposed a new approach to gauge theories and
gravity based on loops. The program for gauge theories was completed for
Yang--Mills theories by Gambini and Trias in the 1980's. Gauge theories could
be understood as representations of certain group: the group of loops. The same
formalism could not be implemented at that time for the gravitational case.
Here we would like to propose an extension to the case of gravity. The
resulting theory is described in terms of loops and open paths and can provide
the underpinning for a new quantum representation for gravity distinct from the
one used in loop quantum gravity or string theory. In it, space-time points are
emergent entities that would only have quasi-classical status. The formulation
may be given entirely in terms of Dirac observables that form a complete set of
gauge invariant functions that completely define the Riemannian geometry of the
spacetime. At the quantum level this formulation will lead to a reduced phase
space quantization free of any constraints.
| gr-qc hep-th | in the 1960s mandelstam proposed a new approach to gauge theories and gravity based on loops the program for gauge theories was completed for yangmills theories by gambini and trias in the 1980s gauge theories could be understood as representations of certain group the group of loops the same formalism could not be implemented at that time for the gravitational case here we would like to propose an extension to the case of gravity the resulting theory is described in terms of loops and open paths and can provide the underpinning for a new quantum representation for gravity distinct from the one used in loop quantum gravity or string theory in it spacetime points are emergent entities that would only have quasiclassical status the formulation may be given entirely in terms of dirac observables that form a complete set of gauge invariant functions that completely define the riemannian geometry of the spacetime at the quantum level this formulation will lead to a reduced phase space quantization free of any constraints | [['in', 'the', '1960s', 'mandelstam', 'proposed', 'a', 'new', 'approach', 'to', 'gauge', 'theories', 'and', 'gravity', 'based', 'on', 'loops', 'the', 'program', 'for', 'gauge', 'theories', 'was', 'completed', 'for', 'yangmills', 'theories', 'by', 'gambini', 'and', 'trias', 'in', 'the', '1980s', 'gauge', 'theories', 'could', 'be', 'understood', 'as', 'representations', 'of', 'certain', 'group', 'the', 'group', 'of', 'loops', 'the', 'same', 'formalism', 'could', 'not', 'be', 'implemented', 'at', 'that', 'time', 'for', 'the', 'gravitational', 'case', 'here', 'we', 'would', 'like', 'to', 'propose', 'an', 'extension', 'to', 'the', 'case', 'of', 'gravity', 'the', 'resulting', 'theory', 'is', 'described', 'in', 'terms', 'of', 'loops', 'and', 'open', 'paths', 'and', 'can', 'provide', 'the', 'underpinning', 'for', 'a', 'new', 'quantum', 'representation', 'for', 'gravity', 'distinct', 'from', 'the', 'one', 'used', 'in', 'loop', 'quantum', 'gravity', 'or', 'string', 'theory', 'in', 'it', 'spacetime', 'points', 'are', 'emergent', 'entities', 'that', 'would', 'only', 'have', 'quasiclassical', 'status', 'the', 'formulation', 'may', 'be', 'given', 'entirely', 'in', 'terms', 'of', 'dirac', 'observables', 'that', 'form', 'a', 'complete', 'set', 'of', 'gauge', 'invariant', 'functions', 'that', 'completely', 'define', 'the', 'riemannian', 'geometry', 'of', 'the', 'spacetime', 'at', 'the', 'quantum', 'level', 'this', 'formulation', 'will', 'lead', 'to', 'a', 'reduced', 'phase', 'space', 'quantization', 'free', 'of', 'any', 'constraints']] | [-0.13701586673289715, 0.1836262640617161, -0.13881722641227073, 0.09386220857908828, -0.09096438816291165, -0.13019899553316233, 0.004406717338615797, 0.30455587027021325, -0.2226902042355763, -0.2836345989675917, 0.07650340281939409, -0.21891780372312258, -0.18384590257681113, 0.1665712772305785, -0.08215845319078739, 0.01537190437228722, 0.008844556135384466, 0.07097841343396762, -0.10401440579006752, -0.2559532989753333, 0.3347880134446227, 0.04422122225531834, 0.22903050528288152, 0.043811419904342244, 0.10772254162043686, -0.000645982385365039, 0.006025584703917511, 0.07365434011702768, -0.0805723685242536, 0.09748040908360689, 0.2517099190426208, 0.12167005545663587, 0.1825223326222894, -0.45689821455451335, -0.25638925526001816, 0.07011480664162065, 0.1506412337332986, 0.13876286959661358, -0.002332207587679859, -0.298559503582962, 0.07857154197605139, -0.15401942747474245, -0.1347603296568981, -0.08781318683948743, -0.015832247162932123, -0.11484187695655156, -0.21382401585193164, 0.023846022630407967, 0.005094948635276782, 0.029300001086171208, -0.037456286217862865, -0.06440419061440071, -0.003746761230906174, 0.11515554443370969, 0.036015230472083895, 0.08532825820564745, 0.10240912393077149, -0.1480488540017812, -0.18040265766876204, 0.4208606198793773, -0.0669750185740544, -0.24130529665647174, 0.17063293178819297, -0.14436620298894287, -0.17467708922591965, 0.07367934625920944, 0.14287985425122832, 0.1331035064591216, -0.15814602599870523, 0.17728056159762, -0.02781231943573031, 0.10174554731757463, 0.06638938504045266, 0.05261552108991781, 0.2664874619721661, 0.07039226367986987, 0.046813089983295315, 0.09793429756771288, 0.0010737076294250214, -0.11834155457898886, -0.411180332231407, -0.17759342595489958, -0.12614026430514835, 0.06457057505986893, -0.0769952070653389, -0.1783779131168687, 0.37438500908578154, 0.13242866722081606, 0.12220820963170405, 0.05080506326933805, 0.2107403341215104, 0.14429936850019495, 0.10458492040744372, 0.04876291509111517, 0.23287746978141147, 0.14624690119392023, 0.06422021767653568, -0.20273346280866472, -0.019363092276482627, 0.15615225669283134] |
1,802.02662 | On the asymptotic behaviour of nonlocal perimeters | We study a class of integral functionals known as nonlocal perimeters, which,
intuitively, express a weighted interaction between a set and its complement.
The weight is provided by a positive kernel K, which might be singular. In the
first part of the paper, we show that these functionals are indeed perimeters
in a generalised sense and we establish existence of minimisers for the
corresponding Plateau problem. Also, when K is radial and strictly decreasing,
we prove that halfspaces are minimisers if we prescribe flat boundary
conditions. A Gamma-convergence result is discussed in the second part of the
work. We study the limiting behaviour of the nonlocal perimeters associated
with certain rescalings of a given kernel that has faster-than-L1 decay at
infinity and we show that the Gamma-limit is the classical perimeter, up to a
multiplicative constant that we compute explicitly.
| math.AP | we study a class of integral functionals known as nonlocal perimeters which intuitively express a weighted interaction between a set and its complement the weight is provided by a positive kernel k which might be singular in the first part of the paper we show that these functionals are indeed perimeters in a generalised sense and we establish existence of minimisers for the corresponding plateau problem also when k is radial and strictly decreasing we prove that halfspaces are minimisers if we prescribe flat boundary conditions a gammaconvergence result is discussed in the second part of the work we study the limiting behaviour of the nonlocal perimeters associated with certain rescalings of a given kernel that has fasterthanl1 decay at infinity and we show that the gammalimit is the classical perimeter up to a multiplicative constant that we compute explicitly | [['we', 'study', 'a', 'class', 'of', 'integral', 'functionals', 'known', 'as', 'nonlocal', 'perimeters', 'which', 'intuitively', 'express', 'a', 'weighted', 'interaction', 'between', 'a', 'set', 'and', 'its', 'complement', 'the', 'weight', 'is', 'provided', 'by', 'a', 'positive', 'kernel', 'k', 'which', 'might', 'be', 'singular', 'in', 'the', 'first', 'part', 'of', 'the', 'paper', 'we', 'show', 'that', 'these', 'functionals', 'are', 'indeed', 'perimeters', 'in', 'a', 'generalised', 'sense', 'and', 'we', 'establish', 'existence', 'of', 'minimisers', 'for', 'the', 'corresponding', 'plateau', 'problem', 'also', 'when', 'k', 'is', 'radial', 'and', 'strictly', 'decreasing', 'we', 'prove', 'that', 'halfspaces', 'are', 'minimisers', 'if', 'we', 'prescribe', 'flat', 'boundary', 'conditions', 'a', 'gammaconvergence', 'result', 'is', 'discussed', 'in', 'the', 'second', 'part', 'of', 'the', 'work', 'we', 'study', 'the', 'limiting', 'behaviour', 'of', 'the', 'nonlocal', 'perimeters', 'associated', 'with', 'certain', 'rescalings', 'of', 'a', 'given', 'kernel', 'that', 'has', 'fasterthanl1', 'decay', 'at', 'infinity', 'and', 'we', 'show', 'that', 'the', 'gammalimit', 'is', 'the', 'classical', 'perimeter', 'up', 'to', 'a', 'multiplicative', 'constant', 'that', 'we', 'compute', 'explicitly']] | [-0.1363386148452866, 0.09035828645197044, -0.09744549388226738, 0.07775524159451183, -0.07151147685509524, -0.09704481855557441, 0.02360312471571613, 0.35783973863522567, -0.30444255638398604, -0.2147361806907068, 0.11534988607628364, -0.2866884310991108, -0.1838034145507238, 0.15835489965171265, -0.05995550228403412, 0.03453913539364974, 0.05452132209542496, 0.07216165596351241, -0.0760122215117348, -0.23627341915886824, 0.3795524031835065, -0.032790339327410614, 0.19119345332603072, 0.09080935043128703, 0.08992834524762408, -0.0325111933547462, 0.006164306982440485, 0.07498787452714692, -0.20297097758581173, 0.11863344942350208, 0.2332033403791494, 0.05577307573868055, 0.3166872016254732, -0.3761953692280238, -0.18040964370861434, 0.16491449813663342, 0.10298701864164725, 0.03839477730358837, 0.013266225846269897, -0.23174531893174855, 0.1337262517605111, -0.10507429274897888, -0.19338115658309551, -0.07121192832919601, 0.03464277839395318, 0.06926918437490039, -0.27574212675605964, 0.0811328227016589, 0.1140811203161536, 0.0184389419264073, -0.11219246976710721, -0.08960326235379568, -0.004578691893826714, 0.09169741561439511, 0.057716592965419776, 0.01908110595298194, 0.07516540443229912, -0.10911963607365494, -0.07535102239955659, 0.32298299490822574, -0.10070582472203339, -0.2256958288468903, 0.1636017046285887, -0.1660796022042632, -0.12783041798422556, 0.08669226519468663, 0.11829449335890387, 0.14113651955393042, -0.13904342092056474, 0.14315378054366748, -0.09025688935322486, 0.0881403898284268, 0.09992714403800183, 0.011585923290322367, 0.11546741748603878, 0.09764985876030577, 0.15872888771227475, 0.18884625271709785, -0.03273767154712377, -0.08492023071019555, -0.4167919955986867, -0.18300315524491637, -0.20903506492458873, 0.07864540334951749, -0.09949895081306279, -0.20558517613186897, 0.3572807921525493, 0.10600033735566632, 0.22584829232889972, 0.1421902995312037, 0.19306611680432403, 0.17641512036380919, 0.03962109158679897, 0.10711234077650438, 0.1989270100678257, 0.11870974566110765, 0.04614498983317376, -0.20282733366885825, 0.0503651894532268, 0.11144551683867203] |
1,802.02663 | A Patterns Based Approach for Design of Educational Technologies | Instructional design is a fundamental base for educational technologies as it
lays the foundation to facilitate learning and teaching based on pedagogical
underpinnings. However, most of the educational technologies today face two
core challenges in this context: (i) lack of instructional design as a basis
(ii) lack of support for a variety of instructional designs. In order to
address these challenges, we propose a patterns based approach for design of
educational technologies. This is in contrast with existing literature that
focuses either on patterns in education or in software, and not both. The core
idea of our approach is to leverage patterns for modeling instructional design
knowledge and to connect it with patterns in software architecture. We discuss
different categories of patterns in instructional design. We then present the
notion of Pattern-Oriented Instructional Design (POID) as a way to model
instructional design as a connection of patterns (GoalPattern, ProcessPattern,
ContentPattern) and integrate it with Pattern-Oriented Software Architecture
(POSA) based on fundamental principles in software engineering. We demonstrate
our approach through adult literacy case study (287 million learners, 22 Indian
Languages and a variety of instructional designs). The results of our approach
(both web and mobile versions) are available at http://rice.iiit.ac.in and were
adopted by National Literacy Mission Authority of Government of India.
| cs.SE cs.CY | instructional design is a fundamental base for educational technologies as it lays the foundation to facilitate learning and teaching based on pedagogical underpinnings however most of the educational technologies today face two core challenges in this context i lack of instructional design as a basis ii lack of support for a variety of instructional designs in order to address these challenges we propose a patterns based approach for design of educational technologies this is in contrast with existing literature that focuses either on patterns in education or in software and not both the core idea of our approach is to leverage patterns for modeling instructional design knowledge and to connect it with patterns in software architecture we discuss different categories of patterns in instructional design we then present the notion of patternoriented instructional design poid as a way to model instructional design as a connection of patterns goalpattern processpattern contentpattern and integrate it with patternoriented software architecture posa based on fundamental principles in software engineering we demonstrate our approach through adult literacy case study 287 million learners 22 indian languages and a variety of instructional designs the results of our approach both web and mobile versions are available at httpriceiiitacin and were adopted by national literacy mission authority of government of india | [['instructional', 'design', 'is', 'a', 'fundamental', 'base', 'for', 'educational', 'technologies', 'as', 'it', 'lays', 'the', 'foundation', 'to', 'facilitate', 'learning', 'and', 'teaching', 'based', 'on', 'pedagogical', 'underpinnings', 'however', 'most', 'of', 'the', 'educational', 'technologies', 'today', 'face', 'two', 'core', 'challenges', 'in', 'this', 'context', 'i', 'lack', 'of', 'instructional', 'design', 'as', 'a', 'basis', 'ii', 'lack', 'of', 'support', 'for', 'a', 'variety', 'of', 'instructional', 'designs', 'in', 'order', 'to', 'address', 'these', 'challenges', 'we', 'propose', 'a', 'patterns', 'based', 'approach', 'for', 'design', 'of', 'educational', 'technologies', 'this', 'is', 'in', 'contrast', 'with', 'existing', 'literature', 'that', 'focuses', 'either', 'on', 'patterns', 'in', 'education', 'or', 'in', 'software', 'and', 'not', 'both', 'the', 'core', 'idea', 'of', 'our', 'approach', 'is', 'to', 'leverage', 'patterns', 'for', 'modeling', 'instructional', 'design', 'knowledge', 'and', 'to', 'connect', 'it', 'with', 'patterns', 'in', 'software', 'architecture', 'we', 'discuss', 'different', 'categories', 'of', 'patterns', 'in', 'instructional', 'design', 'we', 'then', 'present', 'the', 'notion', 'of', 'patternoriented', 'instructional', 'design', 'poid', 'as', 'a', 'way', 'to', 'model', 'instructional', 'design', 'as', 'a', 'connection', 'of', 'patterns', 'goalpattern', 'processpattern', 'contentpattern', 'and', 'integrate', 'it', 'with', 'patternoriented', 'software', 'architecture', 'posa', 'based', 'on', 'fundamental', 'principles', 'in', 'software', 'engineering', 'we', 'demonstrate', 'our', 'approach', 'through', 'adult', 'literacy', 'case', 'study', '287', 'million', 'learners', '22', 'indian', 'languages', 'and', 'a', 'variety', 'of', 'instructional', 'designs', 'the', 'results', 'of', 'our', 'approach', 'both', 'web', 'and', 'mobile', 'versions', 'are', 'available', 'at', 'httpriceiiitacin', 'and', 'were', 'adopted', 'by', 'national', 'literacy', 'mission', 'authority', 'of', 'government', 'of', 'india']] | [-0.03112851198406693, 0.02651322812352401, -0.07278924358140032, 0.03506958178219905, -0.16060443333565042, -0.13874186165944244, 0.04373030447739158, 0.43283282657368827, -0.2178626937300298, -0.3644184176317559, 0.10686352846208208, -0.24323414862066364, -0.22040585786677325, 0.20775336658698507, -0.13692151278687212, 0.029774215350558873, 0.05056195728740512, -0.01889393247928148, -0.03918922554070237, -0.24100158458503967, 0.3301940895214032, 0.04379138470484087, 0.4036425126519484, 0.04437005347930468, 0.06696565455282465, -0.023493653538865216, -0.06333235838190795, -0.039905826274592146, -0.08264142375730024, 0.22043242327457008, 0.4262661285555133, 0.28933487807024416, 0.38948015003608394, -0.42163557776858884, -0.16807704661131048, -0.01698409824614198, 0.10894519842286872, 0.07289284748884921, -0.0703542043892622, -0.289472259438928, 0.07125404566669694, -0.23248515036986925, -0.0949462687153405, -0.0775606077874657, -0.008758133062376426, 0.002578567982709501, -0.22107400609708677, -0.07237292407976034, 0.036160575736385696, 0.16039805469783738, -0.05994819171050599, -0.14673645773795074, 0.04400176753719839, 0.17483473461470567, 0.021186320664687976, -0.002939145103692471, 0.1482537756808317, -0.14460710082270312, -0.19687938829212306, 0.4132000615936704, 0.016711805709257115, -0.17539853712346834, 0.20474657937861943, -0.0647468715100191, -0.15622552674344312, 0.010656896732353534, 0.253681996069365, 0.07258352811690062, -0.1886625887452213, 0.03652829327872426, 0.01992694945119393, 0.18227725389274732, 0.029781844009099025, 0.005417205795730786, 0.2325114007331789, 0.28737251146230847, 0.03007681380572299, 0.09164423741682325, -0.02640923826836045, -0.10135712713655756, -0.2649169790630157, -0.18697488844806615, -0.1123806603360348, -0.011445960623160108, -0.017152710498241783, -0.1481825741043744, 0.3770465400750534, 0.22446773370029405, 0.08122159970046666, 0.011228474721205063, 0.31785476317879957, -0.044693848952682365, 0.08698206979226178, 0.06727705898139483, 0.17209964674713354, 0.010696468700189143, 0.19170257973466784, -0.12144881068469168, 0.08994502717709671, 0.009571816564857727] |
1,802.02664 | Geometry Score: A Method For Comparing Generative Adversarial Networks | One of the biggest challenges in the research of generative adversarial
networks (GANs) is assessing the quality of generated samples and detecting
various levels of mode collapse. In this work, we construct a novel measure of
performance of a GAN by comparing geometrical properties of the underlying data
manifold and the generated one, which provides both qualitative and
quantitative means for evaluation. Our algorithm can be applied to datasets of
an arbitrary nature and is not limited to visual data. We test the obtained
metric on various real-life models and datasets and demonstrate that our method
provides new insights into properties of GANs.
| cs.LG cs.CG stat.ML | one of the biggest challenges in the research of generative adversarial networks gans is assessing the quality of generated samples and detecting various levels of mode collapse in this work we construct a novel measure of performance of a gan by comparing geometrical properties of the underlying data manifold and the generated one which provides both qualitative and quantitative means for evaluation our algorithm can be applied to datasets of an arbitrary nature and is not limited to visual data we test the obtained metric on various reallife models and datasets and demonstrate that our method provides new insights into properties of gans | [['one', 'of', 'the', 'biggest', 'challenges', 'in', 'the', 'research', 'of', 'generative', 'adversarial', 'networks', 'gans', 'is', 'assessing', 'the', 'quality', 'of', 'generated', 'samples', 'and', 'detecting', 'various', 'levels', 'of', 'mode', 'collapse', 'in', 'this', 'work', 'we', 'construct', 'a', 'novel', 'measure', 'of', 'performance', 'of', 'a', 'gan', 'by', 'comparing', 'geometrical', 'properties', 'of', 'the', 'underlying', 'data', 'manifold', 'and', 'the', 'generated', 'one', 'which', 'provides', 'both', 'qualitative', 'and', 'quantitative', 'means', 'for', 'evaluation', 'our', 'algorithm', 'can', 'be', 'applied', 'to', 'datasets', 'of', 'an', 'arbitrary', 'nature', 'and', 'is', 'not', 'limited', 'to', 'visual', 'data', 'we', 'test', 'the', 'obtained', 'metric', 'on', 'various', 'reallife', 'models', 'and', 'datasets', 'and', 'demonstrate', 'that', 'our', 'method', 'provides', 'new', 'insights', 'into', 'properties', 'of', 'gans']] | [-0.05475424904544675, -0.005895481721664218, -0.09990569701400197, 0.08635729282429822, -0.07712618003879647, -0.1093747636475103, 0.012215541686989295, 0.40607378967287183, -0.23604093818898195, -0.354857429699267, 0.06678065230608782, -0.2738927810371501, -0.1857994914516011, 0.2569256125886029, -0.11223994481187423, 0.07429158796095153, 0.11096795073267325, -0.005975464582714496, -0.04281920090417188, -0.27113787791899685, 0.35451306637096247, 0.052408260067255755, 0.3698790513196038, 0.07080721936993373, 0.1237772520590863, -0.07155472136021239, -0.02340673624076745, 0.04110073912165408, -0.09118016193276418, 0.2053603899927394, 0.23956811511867201, 0.23748055087330128, 0.3123829804758713, -0.42106421136306327, -0.23885509547171663, 0.08592063651049456, 0.09286442802579242, 0.10712424938446047, -0.0971836334419916, -0.36250281556355723, 0.1201790830762424, -0.10862476144492336, -0.04576312898414083, -0.16636760395418093, -0.05194008027574102, -0.004667108218429737, -0.2933640327548735, 0.009173957445631617, 0.0832510291919727, 0.0680355382359867, -0.07227028067250854, -0.08942956856262048, -0.0061014954303617325, 0.19253032928495442, 0.06314128036588178, 0.0147569751891407, 0.09117173306300368, -0.17230677465202957, -0.15502081832789716, 0.37445186631916794, -0.06178792406018208, -0.20622877739861525, 0.19692291601479633, -0.08349685493440738, -0.12893849206202238, 0.0749771784701683, 0.22609104733694868, 0.13214533123666944, -0.16818039819091848, 0.01767734865752926, -0.011352353844592728, 0.1485145497135818, 0.007227314590901425, 0.021843200716759683, 0.16111488089878653, 0.2519390327964448, -0.0031899495448157625, 0.17848742138300525, -0.11198153374128912, -0.06975837365850734, -0.2328180484835384, -0.13774479670649015, -0.21489791536915062, 0.019331928571031737, -0.1168294747168474, -0.15749048501325463, 0.45884292600766835, 0.22495475883405763, 0.228225047998492, 0.04005900353252056, 0.3299282261902846, 0.03663486639462701, 0.0500366533530008, 0.03954726358586289, 0.19800310281729236, 0.06881522076448553, 0.04815666504584036, -0.17147304112254416, 0.0803804546673737, -0.003423308587443192] |
1,802.02665 | A Divide and Conquer Strategy for Musical Noise-free Speech Enhancement
in Adverse Environments | A divide and conquer strategy for enhancement of noisy speeches in adverse
environments involving lower levels of SNR is presented in this paper, where
the total system of speech enhancement is divided into two separate steps. The
first step is based on noise compensation on short time magnitude and the
second step is based on phase compensation. The magnitude spectrum is
compensated based on a modified spectral subtraction method where the
cross-terms containing spectra of noise and clean speech are taken into
consideration, which are neglected in the traditional spectral subtraction
methods. By employing the modified magnitude and unchanged phase, a procedure
is formulated to compensate the overestimation or underestimation of noise by
phase compensation method based on the probability of speech presence. A
modified complex spectrum based on these two steps are obtained to synthesize a
musical noise free enhanced speech. Extensive simulations are carried out using
the speech files available in the NOIZEUS database in order to evaluate the
performance of the proposed method. It is shown in terms of the objective
measures, spectrogram analysis and formal subjective listening tests that the
proposed method consistently outperforms some of the state-of-the-art methods
of speech enhancement for noisy speech corrupted by street or babble noise at
very low as well as medium levels of SNR.
| eess.AS cs.SD | a divide and conquer strategy for enhancement of noisy speeches in adverse environments involving lower levels of snr is presented in this paper where the total system of speech enhancement is divided into two separate steps the first step is based on noise compensation on short time magnitude and the second step is based on phase compensation the magnitude spectrum is compensated based on a modified spectral subtraction method where the crossterms containing spectra of noise and clean speech are taken into consideration which are neglected in the traditional spectral subtraction methods by employing the modified magnitude and unchanged phase a procedure is formulated to compensate the overestimation or underestimation of noise by phase compensation method based on the probability of speech presence a modified complex spectrum based on these two steps are obtained to synthesize a musical noise free enhanced speech extensive simulations are carried out using the speech files available in the noizeus database in order to evaluate the performance of the proposed method it is shown in terms of the objective measures spectrogram analysis and formal subjective listening tests that the proposed method consistently outperforms some of the stateoftheart methods of speech enhancement for noisy speech corrupted by street or babble noise at very low as well as medium levels of snr | [['a', 'divide', 'and', 'conquer', 'strategy', 'for', 'enhancement', 'of', 'noisy', 'speeches', 'in', 'adverse', 'environments', 'involving', 'lower', 'levels', 'of', 'snr', 'is', 'presented', 'in', 'this', 'paper', 'where', 'the', 'total', 'system', 'of', 'speech', 'enhancement', 'is', 'divided', 'into', 'two', 'separate', 'steps', 'the', 'first', 'step', 'is', 'based', 'on', 'noise', 'compensation', 'on', 'short', 'time', 'magnitude', 'and', 'the', 'second', 'step', 'is', 'based', 'on', 'phase', 'compensation', 'the', 'magnitude', 'spectrum', 'is', 'compensated', 'based', 'on', 'a', 'modified', 'spectral', 'subtraction', 'method', 'where', 'the', 'crossterms', 'containing', 'spectra', 'of', 'noise', 'and', 'clean', 'speech', 'are', 'taken', 'into', 'consideration', 'which', 'are', 'neglected', 'in', 'the', 'traditional', 'spectral', 'subtraction', 'methods', 'by', 'employing', 'the', 'modified', 'magnitude', 'and', 'unchanged', 'phase', 'a', 'procedure', 'is', 'formulated', 'to', 'compensate', 'the', 'overestimation', 'or', 'underestimation', 'of', 'noise', 'by', 'phase', 'compensation', 'method', 'based', 'on', 'the', 'probability', 'of', 'speech', 'presence', 'a', 'modified', 'complex', 'spectrum', 'based', 'on', 'these', 'two', 'steps', 'are', 'obtained', 'to', 'synthesize', 'a', 'musical', 'noise', 'free', 'enhanced', 'speech', 'extensive', 'simulations', 'are', 'carried', 'out', 'using', 'the', 'speech', 'files', 'available', 'in', 'the', 'noizeus', 'database', 'in', 'order', 'to', 'evaluate', 'the', 'performance', 'of', 'the', 'proposed', 'method', 'it', 'is', 'shown', 'in', 'terms', 'of', 'the', 'objective', 'measures', 'spectrogram', 'analysis', 'and', 'formal', 'subjective', 'listening', 'tests', 'that', 'the', 'proposed', 'method', 'consistently', 'outperforms', 'some', 'of', 'the', 'stateoftheart', 'methods', 'of', 'speech', 'enhancement', 'for', 'noisy', 'speech', 'corrupted', 'by', 'street', 'or', 'babble', 'noise', 'at', 'very', 'low', 'as', 'well', 'as', 'medium', 'levels', 'of', 'snr']] | [-0.08735715308887235, 0.033791066700765905, -0.08613442317149493, 0.04953666988132132, -0.03309808686418935, -0.13573186552411942, 0.0402761751661337, 0.39920329504408114, -0.2036644465354986, -0.32540797935879984, 0.09683328073818323, -0.27705055324802025, -0.15114609055805864, 0.20816356646665912, -0.11124557112885076, 0.03954080787682256, 0.07697973317618287, 0.030249953847703372, -0.053366934712759634, -0.2697326719847529, 0.29834640787665323, 0.059304932637010206, 0.3313646910062363, 0.003445522866190173, 0.12020716225500977, -0.025394374189551833, -0.09829429861355768, -0.0026970028318870857, -0.01877456210018271, 0.07043453642535348, 0.270232525072602, 0.11706796609904876, 0.2795962305436301, -0.3922315271744548, -0.2116739713435256, 0.0739872281656189, 0.14158939686712138, 0.08574429799445234, -0.04232084560424609, -0.35112462000336586, 0.09516174919080249, -0.13953049721651126, 0.023346764421047165, -0.06653878356568342, -0.04789011847920889, -0.0005982664868582127, -0.29701974005546683, 0.10536385183547471, 0.07020829115117098, 0.07689707542818343, -0.04476326930791486, -0.16967402428745965, 0.025948092621361274, 0.15308923070091582, 0.04675406672948495, 0.009827754138644005, 0.14778648255187152, -0.11361456405297653, -0.07780977350166934, 0.39736035186364205, -0.11947216303710458, -0.20380731254469517, 0.1504792507542947, -0.07329479671018414, -0.0981521001605447, 0.19509048227350725, 0.1987374398857355, 0.0977261550193869, -0.16067471199040842, 0.004926567751952165, 0.060973328726669385, 0.21957121174349342, 0.07864174105600606, 0.03476120828715868, 0.13198717290557227, 0.18763242543263492, 0.01997738680260819, 0.16689481713570828, -0.135883080116798, -0.05634160912744592, -0.2546111899926219, -0.08850305544992172, -0.22413090594372778, -0.028995977031868386, -0.07796330663238836, -0.1421507780942362, 0.4059459614415848, 0.18944962269648216, 0.16608640708808983, 0.030641555214885537, 0.4049395932447772, 0.13882768157230646, 0.04819279980607504, 0.003579418133771004, 0.20589811123845297, 0.04902045535367675, 0.0956980026402879, -0.23096492739602772, 0.08204382378174815, 0.05351127335195278] |
1,802.02666 | Colossal magnetoresistance in a Mott insulator via magnetic field-driven
insulator-metal transition | We present a new type of colossal magnetoresistance (CMR) arising from an
anomalous collapse of the Mott insulating state via a modest magnetic field in
a bilayer ruthenate, Ti-doped Ca$_3$Ru$_2$O$_7$. Such an insulator-metal
transition is accompanied by changes in both lattice and magnetic structures.
Our findings have important implications because a magnetic field usually
stabilizes the insulating ground state in a Mott-Hubbard system, thus calling
for a deeper theoretical study to reexamine the magnetic field tuning of Mott
systems with magnetic and electronic instabilities and spin-lattice-charge
coupling. This study further provides a model approach to search for CMR
systems other than manganites, such as Mott insulators in the vicinity of the
boundary between competing phases.
| cond-mat.str-el | we present a new type of colossal magnetoresistance cmr arising from an anomalous collapse of the mott insulating state via a modest magnetic field in a bilayer ruthenate tidoped ca_3ru_2o_7 such an insulatormetal transition is accompanied by changes in both lattice and magnetic structures our findings have important implications because a magnetic field usually stabilizes the insulating ground state in a motthubbard system thus calling for a deeper theoretical study to reexamine the magnetic field tuning of mott systems with magnetic and electronic instabilities and spinlatticecharge coupling this study further provides a model approach to search for cmr systems other than manganites such as mott insulators in the vicinity of the boundary between competing phases | [['we', 'present', 'a', 'new', 'type', 'of', 'colossal', 'magnetoresistance', 'cmr', 'arising', 'from', 'an', 'anomalous', 'collapse', 'of', 'the', 'mott', 'insulating', 'state', 'via', 'a', 'modest', 'magnetic', 'field', 'in', 'a', 'bilayer', 'ruthenate', 'tidoped', 'ca_3ru_2o_7', 'such', 'an', 'insulatormetal', 'transition', 'is', 'accompanied', 'by', 'changes', 'in', 'both', 'lattice', 'and', 'magnetic', 'structures', 'our', 'findings', 'have', 'important', 'implications', 'because', 'a', 'magnetic', 'field', 'usually', 'stabilizes', 'the', 'insulating', 'ground', 'state', 'in', 'a', 'motthubbard', 'system', 'thus', 'calling', 'for', 'a', 'deeper', 'theoretical', 'study', 'to', 'reexamine', 'the', 'magnetic', 'field', 'tuning', 'of', 'mott', 'systems', 'with', 'magnetic', 'and', 'electronic', 'instabilities', 'and', 'spinlatticecharge', 'coupling', 'this', 'study', 'further', 'provides', 'a', 'model', 'approach', 'to', 'search', 'for', 'cmr', 'systems', 'other', 'than', 'manganites', 'such', 'as', 'mott', 'insulators', 'in', 'the', 'vicinity', 'of', 'the', 'boundary', 'between', 'competing', 'phases']] | [-0.2012283182376179, 0.18717389953503458, -0.024092505655349476, 0.05431456161303479, -0.067515185985126, -0.14649583592912868, 0.10609179698012508, 0.368532953228344, -0.2505230843007826, -0.31444698784565717, 0.03913095609791446, -0.28011139996121065, -0.18794229485323294, 0.18076950904357722, 0.04590301476255582, -0.033444363484976064, -0.04865620719583444, -0.05427319515422967, -0.13717191093580863, -0.15088269699430257, 0.31537187298792496, -0.01755290564656127, 0.2870449484489335, 0.0733984594167978, -0.017289664604488695, -0.028862676742535672, 0.18841466695691148, 0.06088208993733452, -0.14860707929096462, 0.027061185392659882, 0.2386823684107839, -0.10075322157915748, 0.25345289452123226, -0.43975444371697675, -0.2316753838717807, 0.016799836450158374, 0.15835416462403118, 0.16852845895316518, -0.1329217344040476, -0.3291801195550841, 0.02721627355193752, -0.16721426175801052, -0.09267493720950656, -0.132075392886212, -0.031015540829557403, -0.038494126215626145, -0.2820015431120338, 0.11249110896320066, 0.07266463683673034, 0.14851363657834826, -0.1630013001686485, -0.11682844597319338, -0.04709668850885289, 0.07538502486504353, 0.07759969342365175, 0.1146505999995657, 0.11852738207712639, -0.18791071064729375, -0.16284089896974988, 0.36839576061455565, -0.009616978438555778, -0.031714089535454515, 0.20097240737002148, -0.19602423101030964, -0.07492955028193823, 0.15343980994402318, 0.1231545032249159, 0.07419203649879548, -0.1233620478428508, 0.06183233717951098, 0.009360383592521478, 0.17602595850710936, -0.07895644642249272, 0.09653123854169328, 0.30902157206774544, 0.2618316486641242, 0.037843064292693476, 0.18444502196047993, -0.08731412333477158, -0.05310272822246413, -0.20196005726527227, -0.2109096017829551, -0.19389365727833488, 0.05901711008903619, -0.06067542647986301, -0.25557639680214617, 0.3967819370394736, 0.20873859192534724, 0.19256046061453067, -0.11255215341225266, 0.2416190679405669, 0.07789968821759287, 0.05345751654781532, 0.014978066024476695, 0.2651825762647939, 0.16103985347466446, 0.15763556055945196, -0.2819045750003537, 0.08398230304827162, 0.028195078525561513] |
1,802.02667 | Generalized Degrees of Freedom of Noncoherent Diamond Networks | We study the generalized degrees of freedom (gDoF) of the block-fading
noncoherent diamond (parallel relay) wireless network with asymmetric
distributions of link strengths, and a coherence time of T symbol duration. We
first derive an outer bound for this channel and then derive the optimal
signaling structure for this outer bound. Using the optimal signaling structure
we solve the outer bound optimization problem in terms of its gDoF. Using
insights from our outer bound signaling solution, we devise an achievability
strategy based on a novel scheme that we call train-scale quantize-map-forward
(TS-QMF). This uses training in the links from the source to the relays,
scaling and quantizing at the relays combined with nontraining-based schemes.
We show the optimality of this scheme with respect to the outer bound in terms
of the gDoF. In noncoherent point-to-point multiple-input-multiple-output
(MIMO) channels, where the fading channel is unknown to transmitter and
receiver, an important tradeoff between communication and channel learning was
revealed by Zheng and Tse, by demonstrating that not all the available antennas
might be used, as it is suboptimal to learn all their channel parameters. Our
results in this paper for the diamond network demonstrates that in certain
regimes the optimal scheme uses a subnetwork, demonstrating a tradeoff between
channel learning and communications. In some regimes, it is gDoF optimal to do
relay selection, i.e, use a part of the network. In the other regimes, even
when it is essential to use the entire network, it is suboptimal to learn the
channel states for all the links in the network, i.e, traditional
training-based schemes are suboptimal in these regimes.
| cs.IT math.IT | we study the generalized degrees of freedom gdof of the blockfading noncoherent diamond parallel relay wireless network with asymmetric distributions of link strengths and a coherence time of t symbol duration we first derive an outer bound for this channel and then derive the optimal signaling structure for this outer bound using the optimal signaling structure we solve the outer bound optimization problem in terms of its gdof using insights from our outer bound signaling solution we devise an achievability strategy based on a novel scheme that we call trainscale quantizemapforward tsqmf this uses training in the links from the source to the relays scaling and quantizing at the relays combined with nontrainingbased schemes we show the optimality of this scheme with respect to the outer bound in terms of the gdof in noncoherent pointtopoint multipleinputmultipleoutput mimo channels where the fading channel is unknown to transmitter and receiver an important tradeoff between communication and channel learning was revealed by zheng and tse by demonstrating that not all the available antennas might be used as it is suboptimal to learn all their channel parameters our results in this paper for the diamond network demonstrates that in certain regimes the optimal scheme uses a subnetwork demonstrating a tradeoff between channel learning and communications in some regimes it is gdof optimal to do relay selection ie use a part of the network in the other regimes even when it is essential to use the entire network it is suboptimal to learn the channel states for all the links in the network ie traditional trainingbased schemes are suboptimal in these regimes | [['we', 'study', 'the', 'generalized', 'degrees', 'of', 'freedom', 'gdof', 'of', 'the', 'blockfading', 'noncoherent', 'diamond', 'parallel', 'relay', 'wireless', 'network', 'with', 'asymmetric', 'distributions', 'of', 'link', 'strengths', 'and', 'a', 'coherence', 'time', 'of', 't', 'symbol', 'duration', 'we', 'first', 'derive', 'an', 'outer', 'bound', 'for', 'this', 'channel', 'and', 'then', 'derive', 'the', 'optimal', 'signaling', 'structure', 'for', 'this', 'outer', 'bound', 'using', 'the', 'optimal', 'signaling', 'structure', 'we', 'solve', 'the', 'outer', 'bound', 'optimization', 'problem', 'in', 'terms', 'of', 'its', 'gdof', 'using', 'insights', 'from', 'our', 'outer', 'bound', 'signaling', 'solution', 'we', 'devise', 'an', 'achievability', 'strategy', 'based', 'on', 'a', 'novel', 'scheme', 'that', 'we', 'call', 'trainscale', 'quantizemapforward', 'tsqmf', 'this', 'uses', 'training', 'in', 'the', 'links', 'from', 'the', 'source', 'to', 'the', 'relays', 'scaling', 'and', 'quantizing', 'at', 'the', 'relays', 'combined', 'with', 'nontrainingbased', 'schemes', 'we', 'show', 'the', 'optimality', 'of', 'this', 'scheme', 'with', 'respect', 'to', 'the', 'outer', 'bound', 'in', 'terms', 'of', 'the', 'gdof', 'in', 'noncoherent', 'pointtopoint', 'multipleinputmultipleoutput', 'mimo', 'channels', 'where', 'the', 'fading', 'channel', 'is', 'unknown', 'to', 'transmitter', 'and', 'receiver', 'an', 'important', 'tradeoff', 'between', 'communication', 'and', 'channel', 'learning', 'was', 'revealed', 'by', 'zheng', 'and', 'tse', 'by', 'demonstrating', 'that', 'not', 'all', 'the', 'available', 'antennas', 'might', 'be', 'used', 'as', 'it', 'is', 'suboptimal', 'to', 'learn', 'all', 'their', 'channel', 'parameters', 'our', 'results', 'in', 'this', 'paper', 'for', 'the', 'diamond', 'network', 'demonstrates', 'that', 'in', 'certain', 'regimes', 'the', 'optimal', 'scheme', 'uses', 'a', 'subnetwork', 'demonstrating', 'a', 'tradeoff', 'between', 'channel', 'learning', 'and', 'communications', 'in', 'some', 'regimes', 'it', 'is', 'gdof', 'optimal', 'to', 'do', 'relay', 'selection', 'ie', 'use', 'a', 'part', 'of', 'the', 'network', 'in', 'the', 'other', 'regimes', 'even', 'when', 'it', 'is', 'essential', 'to', 'use', 'the', 'entire', 'network', 'it', 'is', 'suboptimal', 'to', 'learn', 'the', 'channel', 'states', 'for', 'all', 'the', 'links', 'in', 'the', 'network', 'ie', 'traditional', 'trainingbased', 'schemes', 'are', 'suboptimal', 'in', 'these', 'regimes']] | [-0.2131725145510961, 0.030296540484193113, -0.0721226739936186, 0.019937383058788997, -0.06126306966627052, -0.24446137620936442, 0.13251426408533007, 0.39560549122262784, -0.2929476036286484, -0.2528727848355892, 0.08086935704407555, -0.20875068308835135, -0.21534761388435564, 0.15365831730882867, -0.11627519970225035, 0.04393343072001266, 0.034891884393738616, 0.04038835201809048, -0.03350451071799765, -0.2644807484563964, 0.3226794902688537, 0.11090780177176665, 0.32919672797894384, 0.03610356619843625, 0.11275410074333415, 0.014220945820382339, 0.010789755076708223, -0.08634708077645022, -0.14572441164523556, 0.09497496554342066, 0.33271827560737943, 0.15837715566158295, 0.24070318846719008, -0.386692173102651, -0.2553304535989249, 0.09190535990471736, 0.1938347222426014, 0.11399130677598965, 0.005865345991875254, -0.26816596931108616, 0.10552675171822536, -0.20102128675997616, -0.018298458950700303, 0.012594598324211604, -0.08141597627817933, 0.026516097073687572, -0.3553607229717933, 0.0375806495649988, 0.04356284726573997, 0.0015586896838457411, -0.05241724889868863, -0.11531327403869353, 0.04271187612560255, 0.17064523430571701, 0.00750402756789593, -0.006834224657024551, 0.06517450296906081, -0.1128567559635727, -0.10966180110024465, 0.29971862113645065, -0.007038806035703919, -0.24557999816825862, 0.15695543739167414, -0.09025451792589965, -0.0786890725325439, 0.16431099162242258, 0.21725177198662618, 0.10273728559604588, -0.17438436258822623, 0.03051951866328695, -0.05083820524451964, 0.16853159927398306, 0.07271005427677311, 0.1428842475828573, 0.10116518994690603, 0.17838962859750332, 0.15140098809732033, 0.1915288379572123, -0.12894334120254525, -0.12492169424388629, -0.2719791138353457, -0.12191451506661746, -0.2159472561630371, -0.014867440298916294, -0.12424849285156521, -0.05066681768492434, 0.3463503944466583, 0.12597519241870087, 0.1522363983869319, 0.10710783372898745, 0.35627971254572444, 0.07618787483057227, 0.04142163802286213, 0.20075507015308555, 0.2479498263528374, 0.1415439507279531, 0.08227128800918337, -0.22890635960675182, 0.08428303580049482, 0.0020541688126331273] |
1,802.02668 | Fine-Grained Land Use Classification at the City Scale Using
Ground-Level Images | We perform fine-grained land use mapping at the city scale using ground-level
images. Mapping land use is considerably more difficult than mapping land cover
and is generally not possible using overhead imagery as it requires close-up
views and seeing inside buildings. We postulate that the growing collections of
georeferenced, ground-level images suggest an alternate approach to this
geographic knowledge discovery problem. We develop a general framework that
uses Flickr images to map 45 different land-use classes for the City of San
Francisco. Individual images are classified using a novel convolutional neural
network containing two streams, one for recognizing objects and another for
recognizing scenes. This network is trained in an end-to-end manner directly on
the labeled training images. We propose several strategies to overcome the
noisiness of our user-generated data including search-based training set
augmentation and online adaptive training. We derive a ground truth map of San
Francisco in order to evaluate our method. We demonstrate the effectiveness of
our approach through geo-visualization and quantitative analysis. Our framework
achieves over 29% recall at the individual land parcel level which represents a
strong baseline for the challenging 45-way land use classification problem
especially given the noisiness of the image data.
| cs.CV cs.IR cs.MM | we perform finegrained land use mapping at the city scale using groundlevel images mapping land use is considerably more difficult than mapping land cover and is generally not possible using overhead imagery as it requires closeup views and seeing inside buildings we postulate that the growing collections of georeferenced groundlevel images suggest an alternate approach to this geographic knowledge discovery problem we develop a general framework that uses flickr images to map 45 different landuse classes for the city of san francisco individual images are classified using a novel convolutional neural network containing two streams one for recognizing objects and another for recognizing scenes this network is trained in an endtoend manner directly on the labeled training images we propose several strategies to overcome the noisiness of our usergenerated data including searchbased training set augmentation and online adaptive training we derive a ground truth map of san francisco in order to evaluate our method we demonstrate the effectiveness of our approach through geovisualization and quantitative analysis our framework achieves over 29 recall at the individual land parcel level which represents a strong baseline for the challenging 45way land use classification problem especially given the noisiness of the image data | [['we', 'perform', 'finegrained', 'land', 'use', 'mapping', 'at', 'the', 'city', 'scale', 'using', 'groundlevel', 'images', 'mapping', 'land', 'use', 'is', 'considerably', 'more', 'difficult', 'than', 'mapping', 'land', 'cover', 'and', 'is', 'generally', 'not', 'possible', 'using', 'overhead', 'imagery', 'as', 'it', 'requires', 'closeup', 'views', 'and', 'seeing', 'inside', 'buildings', 'we', 'postulate', 'that', 'the', 'growing', 'collections', 'of', 'georeferenced', 'groundlevel', 'images', 'suggest', 'an', 'alternate', 'approach', 'to', 'this', 'geographic', 'knowledge', 'discovery', 'problem', 'we', 'develop', 'a', 'general', 'framework', 'that', 'uses', 'flickr', 'images', 'to', 'map', '45', 'different', 'landuse', 'classes', 'for', 'the', 'city', 'of', 'san', 'francisco', 'individual', 'images', 'are', 'classified', 'using', 'a', 'novel', 'convolutional', 'neural', 'network', 'containing', 'two', 'streams', 'one', 'for', 'recognizing', 'objects', 'and', 'another', 'for', 'recognizing', 'scenes', 'this', 'network', 'is', 'trained', 'in', 'an', 'endtoend', 'manner', 'directly', 'on', 'the', 'labeled', 'training', 'images', 'we', 'propose', 'several', 'strategies', 'to', 'overcome', 'the', 'noisiness', 'of', 'our', 'usergenerated', 'data', 'including', 'searchbased', 'training', 'set', 'augmentation', 'and', 'online', 'adaptive', 'training', 'we', 'derive', 'a', 'ground', 'truth', 'map', 'of', 'san', 'francisco', 'in', 'order', 'to', 'evaluate', 'our', 'method', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach', 'through', 'geovisualization', 'and', 'quantitative', 'analysis', 'our', 'framework', 'achieves', 'over', '29', 'recall', 'at', 'the', 'individual', 'land', 'parcel', 'level', 'which', 'represents', 'a', 'strong', 'baseline', 'for', 'the', 'challenging', '45way', 'land', 'use', 'classification', 'problem', 'especially', 'given', 'the', 'noisiness', 'of', 'the', 'image', 'data']] | [-0.04260086826686136, -0.01797181565295129, -0.057578573908643314, 0.09089800550642357, -0.11078423174860125, -0.12664223024080687, 0.07159667771316669, 0.43637008469824023, -0.2576187767989162, -0.37117439039954636, 0.10031729754215728, -0.3091700898878502, -0.1901077525313906, 0.1991869345821224, -0.184168745936459, 0.029770813878235228, 0.14050461641851475, 0.016727576084021065, -0.02172749986750958, -0.2917598915807291, 0.31049044864167546, 0.014819919538561894, 0.354531761319988, 0.01643393971049462, 0.17370289133160818, -0.014341032582072357, -0.07036206930375427, -0.006307206649305017, -0.051918871461245054, 0.2005697141761299, 0.33463138572500095, 0.25346761386173616, 0.2830689235677416, -0.4069989716558896, -0.2096523895690387, 0.08339120739026729, 0.09493778952993594, 0.09917679983320543, -0.018505759696923595, -0.36536777888735134, 0.06742142567809699, -0.1609978197016659, -0.0147049052623451, -0.11736743850163137, -0.03012728646122427, -0.0555408672915273, -0.2848130492187773, 0.034812977220016444, 0.010853656118434637, 0.1512554751784362, -0.07196039054777963, -0.07957827371505155, 0.00021379980413864055, 0.23568161846505423, -0.009478083914004717, 0.0405319977507308, 0.14184778880544308, -0.15071945982679313, -0.08375835233377386, 0.38359135778319803, -0.0337787568614015, -0.15686241911507842, 0.215458491384381, -0.057239626100371505, -0.1523485819672733, 0.11733052374870338, 0.23086699753566975, 0.12173529760206514, -0.17357744896934943, -0.03541314810064076, -0.11005681502571649, 0.18705972049778063, 0.06944322816068024, -0.047980370155813155, 0.17134909190042322, 0.2737057248243328, 0.08670915247322145, 0.14605932566102106, -0.2316709877305777, -0.036233344969323206, -0.20429174169295966, -0.11782712105548743, -0.18073249990449786, -0.01874694140500688, -0.09711757018382254, -0.1286568885029416, 0.39080264547138915, 0.25557755976162777, 0.19568538706222868, 0.12722873787990668, 0.3450346166912391, -0.034181161520598725, 0.11485843067857052, 0.08298718389017846, 0.11032413249844779, -0.04938790244473652, 0.16275452058191994, -0.12844242677421808, 0.070949028148504, 0.06222175340393953] |
1,802.02669 | PPFNet: Global Context Aware Local Features for Robust 3D Point Matching | We present PPFNet - Point Pair Feature NETwork for deeply learning a globally
informed 3D local feature descriptor to find correspondences in unorganized
point clouds. PPFNet learns local descriptors on pure geometry and is highly
aware of the global context, an important cue in deep learning. Our 3D
representation is computed as a collection of point-pair-features combined with
the points and normals within a local vicinity. Our permutation invariant
network design is inspired by PointNet and sets PPFNet to be ordering-free. As
opposed to voxelization, our method is able to consume raw point clouds to
exploit the full sparsity. PPFNet uses a novel $\textit{N-tuple}$ loss and
architecture injecting the global information naturally into the local
descriptor. It shows that context awareness also boosts the local feature
representation. Qualitative and quantitative evaluations of our network suggest
increased recall, improved robustness and invariance as well as a vital step in
the 3D descriptor extraction performance.
| cs.CV cs.AI | we present ppfnet point pair feature network for deeply learning a globally informed 3d local feature descriptor to find correspondences in unorganized point clouds ppfnet learns local descriptors on pure geometry and is highly aware of the global context an important cue in deep learning our 3d representation is computed as a collection of pointpairfeatures combined with the points and normals within a local vicinity our permutation invariant network design is inspired by pointnet and sets ppfnet to be orderingfree as opposed to voxelization our method is able to consume raw point clouds to exploit the full sparsity ppfnet uses a novel textitntuple loss and architecture injecting the global information naturally into the local descriptor it shows that context awareness also boosts the local feature representation qualitative and quantitative evaluations of our network suggest increased recall improved robustness and invariance as well as a vital step in the 3d descriptor extraction performance | [['we', 'present', 'ppfnet', 'point', 'pair', 'feature', 'network', 'for', 'deeply', 'learning', 'a', 'globally', 'informed', '3d', 'local', 'feature', 'descriptor', 'to', 'find', 'correspondences', 'in', 'unorganized', 'point', 'clouds', 'ppfnet', 'learns', 'local', 'descriptors', 'on', 'pure', 'geometry', 'and', 'is', 'highly', 'aware', 'of', 'the', 'global', 'context', 'an', 'important', 'cue', 'in', 'deep', 'learning', 'our', '3d', 'representation', 'is', 'computed', 'as', 'a', 'collection', 'of', 'pointpairfeatures', 'combined', 'with', 'the', 'points', 'and', 'normals', 'within', 'a', 'local', 'vicinity', 'our', 'permutation', 'invariant', 'network', 'design', 'is', 'inspired', 'by', 'pointnet', 'and', 'sets', 'ppfnet', 'to', 'be', 'orderingfree', 'as', 'opposed', 'to', 'voxelization', 'our', 'method', 'is', 'able', 'to', 'consume', 'raw', 'point', 'clouds', 'to', 'exploit', 'the', 'full', 'sparsity', 'ppfnet', 'uses', 'a', 'novel', 'textitntuple', 'loss', 'and', 'architecture', 'injecting', 'the', 'global', 'information', 'naturally', 'into', 'the', 'local', 'descriptor', 'it', 'shows', 'that', 'context', 'awareness', 'also', 'boosts', 'the', 'local', 'feature', 'representation', 'qualitative', 'and', 'quantitative', 'evaluations', 'of', 'our', 'network', 'suggest', 'increased', 'recall', 'improved', 'robustness', 'and', 'invariance', 'as', 'well', 'as', 'a', 'vital', 'step', 'in', 'the', '3d', 'descriptor', 'extraction', 'performance']] | [-0.027804386958279866, -0.039230423597302506, -0.10732378816269589, 0.06148849577399208, -0.06932911974215418, -0.12344726681046737, 0.03871179063141896, 0.40581775666214526, -0.3168906076567485, -0.3000631999543199, 0.04621585219514075, -0.25916712964891186, -0.22836371460435725, 0.12332591766822808, -0.13116881547139445, 0.07903237829622406, 0.0820699218190244, 0.04030437303719504, -0.0990944955726123, -0.21987331724270942, 0.3246179473960897, 0.08020361144413653, 0.3573597293759652, 0.009826493180738199, 0.1440998694215645, 0.011688192493763546, -0.06126933785205419, 0.004253010127530121, -0.017504371416955426, 0.18039558181371587, 0.2833782747800418, 0.1729256815289541, 0.2592505818145387, -0.4008778000387969, -0.24821338890082884, 0.06641619650439215, 0.15988934108317085, 0.10388946400380275, -0.05074119153239173, -0.35467698825085725, 0.10859014251974143, -0.12661376726132312, -0.06525769277519528, -0.17361931254674726, -0.01945244198064976, -0.028317681696553458, -0.3125636093724744, 0.03967462682251931, 0.08694929968887602, 0.0735142564638549, -0.05397149304946847, -0.06781594626505504, -0.05403643510704423, 0.17670992337442284, -0.03284678594115496, 0.11368724115227268, 0.1961357343243435, -0.1728878742327676, -0.09179617795661942, 0.3832066313569878, -0.04083202421452675, -0.21556023355954695, 0.2000068152337429, -0.039001504109309824, -0.15173867757700935, 0.1174420275875436, 0.21065965408284293, 0.0934647798958944, -0.1384843017924702, 0.0004935594011510678, -0.07242129174148626, 0.16728385250242708, 0.019362040364102228, 0.037985195358902615, 0.22033742697278175, 0.23263683818880743, 0.11013553950673081, 0.1327294830628202, -0.1411328808773284, -0.1025648984476774, -0.25293789563338026, -0.14556368065985456, -0.19848796665893506, -0.018719766714028863, -0.12758202371972727, -0.1293149029493454, 0.3873472819792344, 0.1815104912466451, 0.2640216784182961, 0.059842351742788846, 0.3225000833079919, 0.025765149513472047, 0.1173531287381013, 0.11600249427551991, 0.1788709380182644, 0.023177895748100225, 0.09747494295576975, -0.15742450237942973, 0.07572638990995068, 0.12159831007167497] |
1,802.0267 | Stochastic control in microscopic nonequilibrium systems | Quantifying energy flows at nanometer scales promises to guide future
research in a variety of disciplines, from microscopic control and
manipulation, to autonomously operating molecular machines. A general
understanding of the thermodynamic costs of nonequilibrium processes would
illuminate the design principles for efficient microscopic machines.
Considerable effort has gone into finding and classifying the deterministic
control protocols that drive a system rapidly between states at minimum
energetic cost. But for autonomous microscopic systems, driving processes are
themselves stochastic. Here we generalize a linear-response framework to
incorporate such protocol variability, deriving a lower bound on the work that
is realized at finite protocol duration, far from the quasistatic limit. Our
findings are confirmed in model systems. This theory provides a thermodynamic
rationale for rapid operation, independent of functional incentives.
| cond-mat.stat-mech | quantifying energy flows at nanometer scales promises to guide future research in a variety of disciplines from microscopic control and manipulation to autonomously operating molecular machines a general understanding of the thermodynamic costs of nonequilibrium processes would illuminate the design principles for efficient microscopic machines considerable effort has gone into finding and classifying the deterministic control protocols that drive a system rapidly between states at minimum energetic cost but for autonomous microscopic systems driving processes are themselves stochastic here we generalize a linearresponse framework to incorporate such protocol variability deriving a lower bound on the work that is realized at finite protocol duration far from the quasistatic limit our findings are confirmed in model systems this theory provides a thermodynamic rationale for rapid operation independent of functional incentives | [['quantifying', 'energy', 'flows', 'at', 'nanometer', 'scales', 'promises', 'to', 'guide', 'future', 'research', 'in', 'a', 'variety', 'of', 'disciplines', 'from', 'microscopic', 'control', 'and', 'manipulation', 'to', 'autonomously', 'operating', 'molecular', 'machines', 'a', 'general', 'understanding', 'of', 'the', 'thermodynamic', 'costs', 'of', 'nonequilibrium', 'processes', 'would', 'illuminate', 'the', 'design', 'principles', 'for', 'efficient', 'microscopic', 'machines', 'considerable', 'effort', 'has', 'gone', 'into', 'finding', 'and', 'classifying', 'the', 'deterministic', 'control', 'protocols', 'that', 'drive', 'a', 'system', 'rapidly', 'between', 'states', 'at', 'minimum', 'energetic', 'cost', 'but', 'for', 'autonomous', 'microscopic', 'systems', 'driving', 'processes', 'are', 'themselves', 'stochastic', 'here', 'we', 'generalize', 'a', 'linearresponse', 'framework', 'to', 'incorporate', 'such', 'protocol', 'variability', 'deriving', 'a', 'lower', 'bound', 'on', 'the', 'work', 'that', 'is', 'realized', 'at', 'finite', 'protocol', 'duration', 'far', 'from', 'the', 'quasistatic', 'limit', 'our', 'findings', 'are', 'confirmed', 'in', 'model', 'systems', 'this', 'theory', 'provides', 'a', 'thermodynamic', 'rationale', 'for', 'rapid', 'operation', 'independent', 'of', 'functional', 'incentives']] | [-0.15649761775966908, 0.1613897971183178, -0.11610877470957348, 0.05995394936326193, -0.06440590005513513, -0.17981924999548937, 0.12938206186026946, 0.3673341883895773, -0.2841811883808987, -0.31103805535894935, 0.04599686852452578, -0.23074817243104917, -0.12772039948322345, 0.25208120710522053, -0.04850158854605979, 0.0831862859067769, 0.044188370138726896, -0.04639756032884179, -0.008463634102099604, -0.16924744791322155, 0.24011622820853518, 0.08522877430914377, 0.3233918533187534, 0.07735310252428462, 0.10550005343611701, -0.019056691744481213, 0.004428773487234139, -0.006011302344631986, -0.13112944014244476, 0.11723072626546127, 0.31002917659134255, 0.1314254145422069, 0.3496793247468304, -0.49572837188316043, -0.2791151708079269, 0.0698765936331256, 0.13591444324424629, 0.15413833565435198, -0.035330654664903705, -0.2281843718883465, 0.03815070789414676, -0.17302640397974756, -0.15715696921233757, -0.12594487518799724, 0.024009185617615003, 0.01432352429446837, -0.2432518717905623, 0.00880268022956443, 0.05327344402758172, 0.08446498409102787, -0.08573843508384016, -0.07418103443160362, 0.024230538290794357, 0.1615817653182603, -0.02209006360044441, 0.013839635821568663, 0.21626299689887674, -0.1342988100132061, -0.15831369494844694, 0.36361462717468385, 0.01571018371532773, -0.13655089406347543, 0.23091272394049156, -0.09049336662928908, -0.17593609454343095, 0.12448607619535323, 0.2290281691675773, 0.089033328993537, -0.21187382450148107, 0.03970599798140029, 0.03175296056724619, 0.14567941255154437, -0.001984448661460192, 0.09693341536194566, 0.2439627197381924, 0.25451292485013255, 0.08292950490431394, 0.09298170530018979, 0.006905041826030356, -0.17100256024423288, -0.26918201837543165, -0.12768665970224902, -0.16961212336173048, 0.08284318423466175, -0.04294476197878794, -0.10704603417070757, 0.3455309462515288, 0.18613894017107668, 0.11353589341388215, 0.08352499977991101, 0.3304909167709411, 0.09962655184881442, 0.04586811247645528, 0.07691258461454709, 0.23655219953070628, 0.09675327932927758, 0.13255986365038552, -0.22192890796941356, 0.10642049472517101, 0.023406531458022073] |
1,802.02671 | Upper bound for the minimal quantifier depth of the first part of a
monadic second-order sentence without asymptotic probability | In this paper we found an upper bound for the minimal quantifier depth of the
first part of a monadic second-order sentence without asymptotic probability
described by Jerzy Tyszkiewicz, which express the extension grid axiom in the
Erd\H{o}s-R\'enyi model of random graphs $G(n,n^{-\alpha})$ for some irrational
$\alpha$.
| math.CO math.LO | in this paper we found an upper bound for the minimal quantifier depth of the first part of a monadic secondorder sentence without asymptotic probability described by jerzy tyszkiewicz which express the extension grid axiom in the erdhosrenyi model of random graphs gnnalpha for some irrational alpha | [['in', 'this', 'paper', 'we', 'found', 'an', 'upper', 'bound', 'for', 'the', 'minimal', 'quantifier', 'depth', 'of', 'the', 'first', 'part', 'of', 'a', 'monadic', 'secondorder', 'sentence', 'without', 'asymptotic', 'probability', 'described', 'by', 'jerzy', 'tyszkiewicz', 'which', 'express', 'the', 'extension', 'grid', 'axiom', 'in', 'the', 'erdhosrenyi', 'model', 'of', 'random', 'graphs', 'gnnalpha', 'for', 'some', 'irrational', 'alpha']] | [-0.13677958052848344, 0.09629256834317779, -0.034171427751931806, 0.10643122667882024, -0.06978047720116118, -0.1460902767924025, 0.09508839810682136, 0.28411704819123057, -0.26785150708873634, -0.2720342378243399, 0.06166422466808201, -0.2574896559969563, -0.14167591291682227, 0.12576751054755575, -0.11707625397906193, 0.07055831753203402, -0.02493127598427236, 0.139646220466365, 0.006291472069595171, -0.2339459877592795, 0.30697927492387267, 0.005110703378348895, 0.17923338999769287, 0.06172842273245687, 0.08752930028688001, 0.016216098877560835, -0.02180533966494967, 0.015893969948039106, -0.1749771525779658, 0.12073631315370617, 0.2793452267879215, 0.13299599801615367, 0.2532544214602398, -0.38886882368292985, -0.15823975083944591, 0.155507684563813, 0.11672400033263408, 0.06403692142339423, 0.044420827018178025, -0.29155018593630067, 0.06813168280717471, -0.19792153967706405, -0.13034577118030385, -0.01949667224012639, 0.045445859047543745, 0.015414809504442888, -0.2799741408645945, 0.005570348008009402, 0.23778225742685405, 0.1413888756290797, -0.014704715055616005, -0.0958202521863353, 0.02088910827676401, 0.061601285053336105, -0.03530419379239902, 0.021913743456420692, 0.01583899567713556, -0.14491218785532628, -0.15020316385704538, 0.32880760615934496, -0.10008428209339795, -0.19632376843820448, -5.606428274641866e-05, -0.13534593186341226, -0.21403140835868922, 0.09065543864246296, 0.1215748263158552, 0.15579748429034068, -0.1309324180221428, 0.16803319574066097, -0.11499323135079897, 0.20366174909893586, 0.14581455498852808, 0.00013002911177666292, 0.10936688194456308, 0.11845958948580791, 0.07394916563973074, 0.2033537016250193, 0.008669578095736064, -0.1083720374002081, -0.3480548824224135, -0.14252545805673278, -0.19229907805666976, 0.014767984495214794, -0.19708470686379334, -0.2417543142143151, 0.3743570804514963, 0.15834034456992926, 0.14131652770321007, 0.19792412521327724, 0.284855368749603, 0.144899800217346, -0.02721354590587156, 0.07150559272090702, 0.1539264029409463, 0.14697991595502294, 0.0463466297470681, -0.14427097323704915, 0.1444800012724717, 0.19658542165289755] |
1,802.02672 | Theory and Ab Initio Computation of the Anisotropic Light Emission in
Monolayer Transition Metal Dichalcogenides | Monolayer transition metal dichalcogenides (TMDCs) are direct gap
semiconductors with unique potential for ultrathin light emitters. Yet, their
photoluminescence (PL) is not completely understood. We compute the radiative
recombination rate in monolayer TMDCs as a function of photon emission
direction and polarization, and obtain polar plots of the PL for different
excitation scenarios using the ab initio Bethe-Salpeter equation. We show that
excitons in a quantum superposition state of the K and K' inequivalent valleys
emit light anisotropically upon recombination. Our results can explain the PL
anisotropy and polarization dependence measured in recent experiments, and
predict new light emission regimes. When averaged over emission angle and
exciton momentum, our new treatment recovers the temperature dependent
radiative lifetimes we previously derived. Our work provides a first-principles
approach to study light emission in two-dimensional materials.
| cond-mat.mtrl-sci | monolayer transition metal dichalcogenides tmdcs are direct gap semiconductors with unique potential for ultrathin light emitters yet their photoluminescence pl is not completely understood we compute the radiative recombination rate in monolayer tmdcs as a function of photon emission direction and polarization and obtain polar plots of the pl for different excitation scenarios using the ab initio bethesalpeter equation we show that excitons in a quantum superposition state of the k and k inequivalent valleys emit light anisotropically upon recombination our results can explain the pl anisotropy and polarization dependence measured in recent experiments and predict new light emission regimes when averaged over emission angle and exciton momentum our new treatment recovers the temperature dependent radiative lifetimes we previously derived our work provides a firstprinciples approach to study light emission in twodimensional materials | [['monolayer', 'transition', 'metal', 'dichalcogenides', 'tmdcs', 'are', 'direct', 'gap', 'semiconductors', 'with', 'unique', 'potential', 'for', 'ultrathin', 'light', 'emitters', 'yet', 'their', 'photoluminescence', 'pl', 'is', 'not', 'completely', 'understood', 'we', 'compute', 'the', 'radiative', 'recombination', 'rate', 'in', 'monolayer', 'tmdcs', 'as', 'a', 'function', 'of', 'photon', 'emission', 'direction', 'and', 'polarization', 'and', 'obtain', 'polar', 'plots', 'of', 'the', 'pl', 'for', 'different', 'excitation', 'scenarios', 'using', 'the', 'ab', 'initio', 'bethesalpeter', 'equation', 'we', 'show', 'that', 'excitons', 'in', 'a', 'quantum', 'superposition', 'state', 'of', 'the', 'k', 'and', 'k', 'inequivalent', 'valleys', 'emit', 'light', 'anisotropically', 'upon', 'recombination', 'our', 'results', 'can', 'explain', 'the', 'pl', 'anisotropy', 'and', 'polarization', 'dependence', 'measured', 'in', 'recent', 'experiments', 'and', 'predict', 'new', 'light', 'emission', 'regimes', 'when', 'averaged', 'over', 'emission', 'angle', 'and', 'exciton', 'momentum', 'our', 'new', 'treatment', 'recovers', 'the', 'temperature', 'dependent', 'radiative', 'lifetimes', 'we', 'previously', 'derived', 'our', 'work', 'provides', 'a', 'firstprinciples', 'approach', 'to', 'study', 'light', 'emission', 'in', 'twodimensional', 'materials']] | [-0.0787266501421599, 0.16497653019632025, -0.06454792529120482, 0.05045229158472774, -0.03135201291888392, -0.17442392476981408, 0.11009648289790559, 0.5147800602691066, -0.2542031290240698, -0.2666113534312051, -0.08664448226362649, -0.3245149883476639, -0.10998854142634716, 0.21246031068809876, 0.08525335384686862, 0.018425711888392784, 0.0012451518831172383, -0.17101346500413983, -0.06853270043681998, -0.15868702882907837, 0.2652688371402709, 0.020574078988809055, 0.30514764946822387, 0.14620753746703827, 0.03019745740339272, -0.009302843018974128, 0.05802537779904958, -0.03630444224699771, -0.18009555908962707, 0.07110200869969856, 0.2493058096729499, -0.03242520000645541, 0.14049998093466448, -0.4052796704848682, -0.27093243048897475, 0.021530507282087847, 0.18880650554818654, 0.18634934333692255, -0.11150926746308971, -0.2608000794215534, -0.015281219553566516, -0.09684840752743185, -0.08720663007037167, -0.08408812083359948, 0.022427171267415013, -0.006369931887681211, -0.225164575446257, 0.10068438353395104, -0.0043609671586165135, 0.03139652778863683, -0.10192982739550316, -0.14443515489797837, -0.0842146426666864, 0.030456976277737954, 0.04569220433494818, 0.04116216505513547, 0.2042865267170495, -0.09394705734264694, -0.14940058232348105, 0.3846140814405915, -0.13719807144278953, -0.05326613166922689, 0.14348831815343993, -0.2147332931854727, -0.04474229209170558, 0.20494698055256577, 0.14718312660890415, 0.20307506004670509, -0.13289861774469877, 0.060628944115986336, -0.014656476364199674, 0.17129452640358778, 0.04719832594352389, 0.14401884423568845, 0.25899941425182316, 0.13107479663821345, -0.029184287049828617, 0.09911735345612988, -0.12340677740258914, -0.051601462684137595, -0.2137478043682369, -0.19258010525543495, -0.21252919815102578, 0.13872075186969268, -0.054261935400405435, -0.15890089080746012, 0.41590743544126363, 0.10076131649259337, 0.1645468794075506, 0.02066746552971969, 0.2816074873509824, 0.13661456960813612, 0.04003796853034064, 0.04103293904642526, 0.3282485718075606, 0.1839874647120084, 0.08207963484328912, -0.2897007770615777, 0.03949092977760794, -0.03848952749092832] |
1,802.02673 | Position-Based Multi-Agent Dynamics for Real-Time Crowd Simulation (MiG
paper) | Exploiting the efficiency and stability of Position-Based Dynamics (PBD), we
introduce a novel crowd simulation method that runs at interactive rates for
hundreds of thousands of agents. Our method enables the detailed modeling of
per-agent behavior in a Lagrangian formulation. We model short-range and
long-range collision avoidance to simulate both sparse and dense crowds. On the
particles representing agents, we formulate a set of positional constraints
that can be readily integrated into a standard PBD solver. We augment the
tentative particle motions with planning velocities to determine the preferred
velocities of agents, and project the positions onto the constraint manifold to
eliminate colliding configurations. The local short-range interaction is
represented with collision and frictional contact between agents, as in the
discrete simulation of granular materials. We incorporate a cohesion model for
modeling collective behaviors and propose a new constraint for dealing with
potential future collisions. Our new method is suitable for use in interactive
games.
| cs.GR | exploiting the efficiency and stability of positionbased dynamics pbd we introduce a novel crowd simulation method that runs at interactive rates for hundreds of thousands of agents our method enables the detailed modeling of peragent behavior in a lagrangian formulation we model shortrange and longrange collision avoidance to simulate both sparse and dense crowds on the particles representing agents we formulate a set of positional constraints that can be readily integrated into a standard pbd solver we augment the tentative particle motions with planning velocities to determine the preferred velocities of agents and project the positions onto the constraint manifold to eliminate colliding configurations the local shortrange interaction is represented with collision and frictional contact between agents as in the discrete simulation of granular materials we incorporate a cohesion model for modeling collective behaviors and propose a new constraint for dealing with potential future collisions our new method is suitable for use in interactive games | [['exploiting', 'the', 'efficiency', 'and', 'stability', 'of', 'positionbased', 'dynamics', 'pbd', 'we', 'introduce', 'a', 'novel', 'crowd', 'simulation', 'method', 'that', 'runs', 'at', 'interactive', 'rates', 'for', 'hundreds', 'of', 'thousands', 'of', 'agents', 'our', 'method', 'enables', 'the', 'detailed', 'modeling', 'of', 'peragent', 'behavior', 'in', 'a', 'lagrangian', 'formulation', 'we', 'model', 'shortrange', 'and', 'longrange', 'collision', 'avoidance', 'to', 'simulate', 'both', 'sparse', 'and', 'dense', 'crowds', 'on', 'the', 'particles', 'representing', 'agents', 'we', 'formulate', 'a', 'set', 'of', 'positional', 'constraints', 'that', 'can', 'be', 'readily', 'integrated', 'into', 'a', 'standard', 'pbd', 'solver', 'we', 'augment', 'the', 'tentative', 'particle', 'motions', 'with', 'planning', 'velocities', 'to', 'determine', 'the', 'preferred', 'velocities', 'of', 'agents', 'and', 'project', 'the', 'positions', 'onto', 'the', 'constraint', 'manifold', 'to', 'eliminate', 'colliding', 'configurations', 'the', 'local', 'shortrange', 'interaction', 'is', 'represented', 'with', 'collision', 'and', 'frictional', 'contact', 'between', 'agents', 'as', 'in', 'the', 'discrete', 'simulation', 'of', 'granular', 'materials', 'we', 'incorporate', 'a', 'cohesion', 'model', 'for', 'modeling', 'collective', 'behaviors', 'and', 'propose', 'a', 'new', 'constraint', 'for', 'dealing', 'with', 'potential', 'future', 'collisions', 'our', 'new', 'method', 'is', 'suitable', 'for', 'use', 'in', 'interactive', 'games']] | [-0.12784967035235417, 0.08632583328702997, -0.13009825445140802, 0.05083704801246283, -0.0934347947939269, -0.13927781494154085, 0.03316058688346417, 0.40219316117225157, -0.2732185898288604, -0.3340222447179258, 0.0035216347231800038, -0.26612904491053235, -0.11484790414819614, 0.14263564034650522, -0.03004524766076957, 0.05987563416241638, 0.10888941014606145, -0.0006819136741180574, -0.01367434931753744, -0.18504271811144726, 0.2811597616652087, 0.06306557480561277, 0.22776295744904107, 0.03779696562447615, 0.15544827653455637, 0.06317739559998435, -0.014610691047123363, 0.07032232086714958, -0.12143847889054732, 0.13490558181787962, 0.22849245279944772, 0.12358857485345534, 0.2900273812994842, -0.46278034864414125, -0.22914289620464606, 0.09577544943219231, 0.13278214878012096, 0.11997541689704502, -0.045361003597387144, -0.32306563257119586, 0.06319224218079339, -0.20509373522513816, -0.13670831031105932, -0.10753022010528272, -0.016514062262590855, 0.074550051015291, -0.3156471383727847, 0.0600806561508967, 0.01540668688474163, 0.0663651668278861, -0.08866629386621137, -0.056315771108793634, 0.024669095148302376, 0.13454569518686302, -0.024187017681317462, -0.018894670461304486, 0.1616076809992533, -0.13567607420301364, -0.13261451225036816, 0.4296516103910342, -0.026577229007718063, -0.21754093536836727, 0.2519784523594764, -0.05053238814035731, -0.14182345798359283, 0.1363377375468131, 0.2733320256402235, 0.11587719863821422, -0.17336729395413591, 0.0036505369236692784, -0.027069481998501767, 0.16603399376655298, 0.01897454704608648, -0.015221534732488854, 0.20809388651001837, 0.22879777467178722, 0.08922559581096134, 0.1206073596555319, -0.0899508699505297, -0.16759857210300622, -0.2896152600976488, -0.13796529487496423, -0.15107812588253328, -0.03753754864146392, -0.11340237584269246, -0.12260439375775957, 0.3378323387835295, 0.1978979466573125, 0.18185005272708593, 0.09224069967505431, 0.3055887870670807, 0.057357545112984465, 0.039872993636996514, 0.07541092842396709, 0.19165974284612364, 0.06540914045706872, 0.10739385536346104, -0.2282501646663032, 0.06299543185159565, 0.051257929489046575] |
1,802.02674 | Efficient collective swimming by harnessing vortices through deep
reinforcement learning | Fish in schooling formations navigate complex flow-fields replete with
mechanical energy in the vortex wakes of their companions. Their schooling
behaviour has been associated with evolutionary advantages including collective
energy savings. How fish harvest energy from their complex fluid environment
and the underlying physical mechanisms governing energy-extraction during
collective swimming, is still unknown. Here we show that fish can improve their
sustained propulsive efficiency by actively following, and judiciously
intercepting, vortices in the wake of other swimmers. This swimming strategy
leads to collective energy-savings and is revealed through the first ever
combination of deep reinforcement learning with high-fidelity flow simulations.
We find that a `smart-swimmer' can adapt its position and body deformation to
synchronise with the momentum of the oncoming vortices, improving its average
swimming-efficiency at no cost to the leader. The results show that fish may
harvest energy deposited in vortices produced by their peers, and support the
conjecture that swimming in formation is energetically advantageous. Moreover,
this study demonstrates that deep reinforcement learning can produce navigation
algorithms for complex flow-fields, with promising implications for energy
savings in autonomous robotic swarms.
| physics.flu-dyn cs.AI physics.comp-ph | fish in schooling formations navigate complex flowfields replete with mechanical energy in the vortex wakes of their companions their schooling behaviour has been associated with evolutionary advantages including collective energy savings how fish harvest energy from their complex fluid environment and the underlying physical mechanisms governing energyextraction during collective swimming is still unknown here we show that fish can improve their sustained propulsive efficiency by actively following and judiciously intercepting vortices in the wake of other swimmers this swimming strategy leads to collective energysavings and is revealed through the first ever combination of deep reinforcement learning with highfidelity flow simulations we find that a smartswimmer can adapt its position and body deformation to synchronise with the momentum of the oncoming vortices improving its average swimmingefficiency at no cost to the leader the results show that fish may harvest energy deposited in vortices produced by their peers and support the conjecture that swimming in formation is energetically advantageous moreover this study demonstrates that deep reinforcement learning can produce navigation algorithms for complex flowfields with promising implications for energy savings in autonomous robotic swarms | [['fish', 'in', 'schooling', 'formations', 'navigate', 'complex', 'flowfields', 'replete', 'with', 'mechanical', 'energy', 'in', 'the', 'vortex', 'wakes', 'of', 'their', 'companions', 'their', 'schooling', 'behaviour', 'has', 'been', 'associated', 'with', 'evolutionary', 'advantages', 'including', 'collective', 'energy', 'savings', 'how', 'fish', 'harvest', 'energy', 'from', 'their', 'complex', 'fluid', 'environment', 'and', 'the', 'underlying', 'physical', 'mechanisms', 'governing', 'energyextraction', 'during', 'collective', 'swimming', 'is', 'still', 'unknown', 'here', 'we', 'show', 'that', 'fish', 'can', 'improve', 'their', 'sustained', 'propulsive', 'efficiency', 'by', 'actively', 'following', 'and', 'judiciously', 'intercepting', 'vortices', 'in', 'the', 'wake', 'of', 'other', 'swimmers', 'this', 'swimming', 'strategy', 'leads', 'to', 'collective', 'energysavings', 'and', 'is', 'revealed', 'through', 'the', 'first', 'ever', 'combination', 'of', 'deep', 'reinforcement', 'learning', 'with', 'highfidelity', 'flow', 'simulations', 'we', 'find', 'that', 'a', 'smartswimmer', 'can', 'adapt', 'its', 'position', 'and', 'body', 'deformation', 'to', 'synchronise', 'with', 'the', 'momentum', 'of', 'the', 'oncoming', 'vortices', 'improving', 'its', 'average', 'swimmingefficiency', 'at', 'no', 'cost', 'to', 'the', 'leader', 'the', 'results', 'show', 'that', 'fish', 'may', 'harvest', 'energy', 'deposited', 'in', 'vortices', 'produced', 'by', 'their', 'peers', 'and', 'support', 'the', 'conjecture', 'that', 'swimming', 'in', 'formation', 'is', 'energetically', 'advantageous', 'moreover', 'this', 'study', 'demonstrates', 'that', 'deep', 'reinforcement', 'learning', 'can', 'produce', 'navigation', 'algorithms', 'for', 'complex', 'flowfields', 'with', 'promising', 'implications', 'for', 'energy', 'savings', 'in', 'autonomous', 'robotic', 'swarms']] | [-0.1385875823522737, 0.17026503983005467, -0.10940117590750258, 0.02385905726340651, -0.11868208011922737, -0.12358942546157373, 0.024335021409852844, 0.4284556065686047, -0.2745185512894144, -0.3499583069804228, 0.025603702124984314, -0.23644388915013728, -0.18304372514701553, 0.18492251591815148, -0.1119647365089299, 0.02122656777436431, 0.0930016141022659, 0.004635249300756388, 0.06679513170868935, -0.22271094763095284, 0.23502859673915535, 0.08348058700373966, 0.2951135003835791, 0.02609939521385564, 0.14396338873387624, -0.0506181293943276, 0.017871934654087655, -0.004075445061446064, -0.12711167682011568, 0.11266301676482221, 0.2703214284420634, 0.09629750661681302, 0.3000224455777142, -0.48396171789823306, -0.22396611896660437, 0.13176326494301774, 0.2081769608439774, 0.09727344948720808, -0.07629215650085826, -0.2677024567189316, 0.07154993296975995, -0.17720554882350067, -0.15677456472896867, -0.10966645681894281, 0.03986048336244292, 0.11503765651464669, -0.20226018686662428, 0.054829010760295206, 0.020984762843969898, 0.06678032228826648, -0.1102722791980745, -0.05468233259032584, -0.07970693996240799, 0.1657492783069352, 0.0815502110002045, -0.0014241217053495348, 0.23283605323069625, -0.21428921345181556, -0.14891569229463736, 0.4046410256065428, 0.01598042044788599, -0.1948370694855435, 0.24500865739666752, -0.10732219227486187, -0.06561783464470257, 0.17003979626784307, 0.2304440151473197, 0.06482292087489946, -0.10983006152997, -0.021791748758470123, -0.01564369733290126, 0.12027370340527138, 0.07312236766641339, -0.01530010543905923, 0.2201137396843276, 0.22727925362479356, 0.06986719549944004, 0.09823796223338124, -0.06585246090706076, -0.12559874085709452, -0.16443934697761303, -0.12352818754993172, -0.16579077288301455, 0.021658619887117918, -0.07343686485312194, -0.059779263369273396, 0.36329010944916973, 0.1536454883177713, 0.15947935620772316, 0.05026705094302694, 0.31562751271865436, 0.027881388220056477, 0.04752931790685074, 0.1145990077018117, 0.2980045306819698, 0.03193503416195098, 0.1736452921009105, -0.2946081032756612, 0.08688110678146282, -0.00016519053218265375] |
1,802.02675 | Does the black hole shadow probe the event horizon geometry? | There is an exciting prospect of obtaining the shadow of astrophysical black
holes (BHs) in the near future with the Event Horizon Telescope. As a matter of
principle, this justifies asking how much one can learn about the BH horizon
itself from such a measurement. Since the shadow is determined by a set of
special photon orbits, rather than horizon properties, it is possible that
different horizon geometries yield similar shadows. One may then ask how
sensitive is the shadow to details of the horizon geometry? As a case study, we
consider the double Schwarzschild BH and analyse the impact on the lensing and
shadows of the conical singularity that holds the two BHs in equilibrium --
herein taken to be a strut along the symmetry axis in between the two BHs.
Whereas the conical singularity induces a discontinuity of the scattering angle
of photons, clearly visible in the lensing patterns along the direction of the
strut's location, it produces no observable effect on the shadows, whose edges
remain everywhere smooth. The latter feature is illustrated by examples
including both equal and unequal mass BHs. This smoothness contrasts with the
intrinsic geometry of the (spatial sections of the) horizon of these BHs, which
is not smooth, and provides a sharp example on how BH shadows are insensitive
to some horizon geometry details. This observation, moreover, suggests that for
the study of their shadows, this static double BH system may be an informative
proxy for a dynamical binary.
| gr-qc astro-ph.HE hep-th | there is an exciting prospect of obtaining the shadow of astrophysical black holes bhs in the near future with the event horizon telescope as a matter of principle this justifies asking how much one can learn about the bh horizon itself from such a measurement since the shadow is determined by a set of special photon orbits rather than horizon properties it is possible that different horizon geometries yield similar shadows one may then ask how sensitive is the shadow to details of the horizon geometry as a case study we consider the double schwarzschild bh and analyse the impact on the lensing and shadows of the conical singularity that holds the two bhs in equilibrium herein taken to be a strut along the symmetry axis in between the two bhs whereas the conical singularity induces a discontinuity of the scattering angle of photons clearly visible in the lensing patterns along the direction of the struts location it produces no observable effect on the shadows whose edges remain everywhere smooth the latter feature is illustrated by examples including both equal and unequal mass bhs this smoothness contrasts with the intrinsic geometry of the spatial sections of the horizon of these bhs which is not smooth and provides a sharp example on how bh shadows are insensitive to some horizon geometry details this observation moreover suggests that for the study of their shadows this static double bh system may be an informative proxy for a dynamical binary | [['there', 'is', 'an', 'exciting', 'prospect', 'of', 'obtaining', 'the', 'shadow', 'of', 'astrophysical', 'black', 'holes', 'bhs', 'in', 'the', 'near', 'future', 'with', 'the', 'event', 'horizon', 'telescope', 'as', 'a', 'matter', 'of', 'principle', 'this', 'justifies', 'asking', 'how', 'much', 'one', 'can', 'learn', 'about', 'the', 'bh', 'horizon', 'itself', 'from', 'such', 'a', 'measurement', 'since', 'the', 'shadow', 'is', 'determined', 'by', 'a', 'set', 'of', 'special', 'photon', 'orbits', 'rather', 'than', 'horizon', 'properties', 'it', 'is', 'possible', 'that', 'different', 'horizon', 'geometries', 'yield', 'similar', 'shadows', 'one', 'may', 'then', 'ask', 'how', 'sensitive', 'is', 'the', 'shadow', 'to', 'details', 'of', 'the', 'horizon', 'geometry', 'as', 'a', 'case', 'study', 'we', 'consider', 'the', 'double', 'schwarzschild', 'bh', 'and', 'analyse', 'the', 'impact', 'on', 'the', 'lensing', 'and', 'shadows', 'of', 'the', 'conical', 'singularity', 'that', 'holds', 'the', 'two', 'bhs', 'in', 'equilibrium', 'herein', 'taken', 'to', 'be', 'a', 'strut', 'along', 'the', 'symmetry', 'axis', 'in', 'between', 'the', 'two', 'bhs', 'whereas', 'the', 'conical', 'singularity', 'induces', 'a', 'discontinuity', 'of', 'the', 'scattering', 'angle', 'of', 'photons', 'clearly', 'visible', 'in', 'the', 'lensing', 'patterns', 'along', 'the', 'direction', 'of', 'the', 'struts', 'location', 'it', 'produces', 'no', 'observable', 'effect', 'on', 'the', 'shadows', 'whose', 'edges', 'remain', 'everywhere', 'smooth', 'the', 'latter', 'feature', 'is', 'illustrated', 'by', 'examples', 'including', 'both', 'equal', 'and', 'unequal', 'mass', 'bhs', 'this', 'smoothness', 'contrasts', 'with', 'the', 'intrinsic', 'geometry', 'of', 'the', 'spatial', 'sections', 'of', 'the', 'horizon', 'of', 'these', 'bhs', 'which', 'is', 'not', 'smooth', 'and', 'provides', 'a', 'sharp', 'example', 'on', 'how', 'bh', 'shadows', 'are', 'insensitive', 'to', 'some', 'horizon', 'geometry', 'details', 'this', 'observation', 'moreover', 'suggests', 'that', 'for', 'the', 'study', 'of', 'their', 'shadows', 'this', 'static', 'double', 'bh', 'system', 'may', 'be', 'an', 'informative', 'proxy', 'for', 'a', 'dynamical', 'binary']] | [-0.14396841286651305, 0.10457844742513697, -0.10404970972018877, 0.14261404303474184, -0.10516516757159819, -0.11521564444954832, -0.0076138398130197165, 0.35879250026754733, -0.22078745368095795, -0.27595272430642775, 0.1402313249891745, -0.29836948306159666, -0.11246818825848613, 0.21311663225202299, -0.06696314298229791, -0.0005059225446396939, 0.03230827526431682, 0.043618832519410435, -0.09667252437178447, -0.20617621983032355, 0.3793227609764686, 0.10212301248703455, 0.20539197602074563, 0.03616221161839378, 0.10689949325372927, 0.036849494770782566, -0.00017065732603574672, 0.06943706546463375, -0.12360313249977539, 0.07018055435912722, 0.22097949862548308, 0.12842223033918507, 0.20625061634549402, -0.40108141637732825, -0.19172784403852391, 0.08809128514305514, 0.1463214597206684, 0.11805415445097771, -0.08068350395727221, -0.2738560520247859, 0.06973400625104001, -0.15039266105996807, -0.17853193268051173, 0.014583573036834718, 0.039845906337155255, -0.028041691447662182, -0.18742279922774072, 0.08051156359383972, 0.09956107622997294, -0.023211356398187638, -0.06725775261458797, -0.02503057058315679, -0.06712908099918452, 0.11092108381321518, 0.1149188499614725, 0.01596008830588326, 0.18802646726012093, -0.11801698691556155, -0.09885995714675362, 0.35562807024736715, -0.003066244777739218, -0.1819694167275381, 0.15998740265017178, -0.2357418226907257, -0.07937177357915032, 0.13544704414084477, 0.14603006694375015, 0.18245368332571796, -0.11394503224277641, 0.08219279842810871, -0.041344704581576026, 0.17494099955188064, 0.11455670455887126, 0.05406831584341268, 0.3537781632891515, 0.10770079799799051, 0.0905596550167879, 0.14784617144974116, -0.11475594286008065, -0.08398104121573023, -0.31871978618295455, -0.13672465373164733, -0.1461047482813095, 0.08959340866674277, -0.15565822245761357, -0.16775051283781894, 0.3562852111910053, 0.11759230386886019, 0.25337654790023295, 0.010368427973925856, 0.28304573655305293, 0.07756677779282219, 0.05623075312544872, 0.07040500375669359, 0.3188457191772466, 0.07973079912731712, 0.08648547031102717, -0.22419405373180573, 0.04805938510708814, 0.024419272223835796] |
1,802.02676 | Normal elements of completed group algebras over ${\rm
SL}_3(\mathbb{Z}_p) $ | Let $p$ be a prime integer and $\mathbb{Z}_p$ be the ring of $p$-adic
integers. By a purely computational approach we prove that each nonzero normal
element of a completed group algebra over the special linear group ${\rm
SL}_3(\mathbb{Z}_p)$ is a unit. This give a positive answer to an open question
in \cite{WeiBian2} and make up for an earlier mistake in \cite{WeiBian1}
simultaneously.
| math.NT math.GR math.RA | let p be a prime integer and mathbbz_p be the ring of padic integers by a purely computational approach we prove that each nonzero normal element of a completed group algebra over the special linear group rm sl_3mathbbz_p is a unit this give a positive answer to an open question in citeweibian2 and make up for an earlier mistake in citeweibian1 simultaneously | [['let', 'p', 'be', 'a', 'prime', 'integer', 'and', 'mathbbz_p', 'be', 'the', 'ring', 'of', 'padic', 'integers', 'by', 'a', 'purely', 'computational', 'approach', 'we', 'prove', 'that', 'each', 'nonzero', 'normal', 'element', 'of', 'a', 'completed', 'group', 'algebra', 'over', 'the', 'special', 'linear', 'group', 'rm', 'sl_3mathbbz_p', 'is', 'a', 'unit', 'this', 'give', 'a', 'positive', 'answer', 'to', 'an', 'open', 'question', 'in', 'citeweibian2', 'and', 'make', 'up', 'for', 'an', 'earlier', 'mistake', 'in', 'citeweibian1', 'simultaneously']] | [-0.19847259498438088, 0.07355111803103759, -0.13840531456773564, 0.0013355116865013616, -0.10205240165656906, -0.1796219497840157, 0.030563213925619247, 0.3173244771373979, -0.3541087413490829, -0.22563432065485897, 0.07576843267859165, -0.22818311020116305, -0.09208083178027202, 0.19902129583376443, -0.10191899099213592, -0.045664090627678115, 0.027746054170242812, 0.14006240364416675, -0.05582744919821241, -0.35220437171726915, 0.3132282148857238, -0.01859290003618699, 0.13571517268921865, 0.02541543063470873, 0.09528009844470327, 0.0028894528494042867, -0.008427601339200796, 0.003009239468186841, -0.13714120365441007, 0.08757505131790698, 0.3525394268365482, 0.06235103828090606, 0.3425059903855041, -0.3927118250689769, -0.140965852055746, 0.19807864720459586, 0.1418999671793969, 0.018195156781476433, -0.06761440485163386, -0.22532014160464375, 0.18220223904729393, -0.20125022839944243, -0.14169939707617385, -0.0464910771618834, 0.13781080627813935, -0.056866425882740795, -0.3176772149311284, -0.02358794397027311, 0.08983395429391225, 0.169193756608766, -0.04006898056289528, -0.13889188149754525, 0.06852608011498795, 0.078684044394137, -0.048710542659352804, 0.11322846594148205, 0.03528054023183235, -0.04117631911836817, -0.14331802389963325, 0.3633083014796346, -0.07511900995179253, -0.23003899713315196, 0.06259586152983672, -0.17552708830463432, -0.15654331367952212, 0.12957404869000855, 0.13003857825267112, 0.1313441812013418, -0.03929274843342728, 0.19264300762462602, -0.19456321951317584, 0.14496178635182963, 0.05745456617136123, -0.08193325080466851, 0.19751399561320826, 0.06247863716493219, 0.0930496099473064, 0.12529004508061176, 0.08173043782807003, 0.05268649857143982, -0.3458886773215007, -0.22970831423398044, -0.15216514796523725, 0.16044540742759483, -0.06727805818081833, -0.14687540833601506, 0.36890823354597313, 0.07946146591329727, 0.21370661284742973, 0.09519567990959701, 0.23134459529892873, 0.11539418657578654, 0.06124849322299331, 0.05711047366356193, 0.053338809791257824, 0.18213165809116247, -0.05207220705865361, -0.17747715711435777, -0.02971295342322881, 0.12880711083032065] |
1,802.02677 | Clustering Gene Expression Time Series with Coregionalization: Speed
propagation of ALS | Clustering of gene expression time series gives insight into which genes may
be coregulated, allowing us to discern the activity of pathways in a given
microarray experiment. Of particular interest is how a given group of genes
varies with different model conditions or genetic background. Amyotrophic
lateral sclerosis (ALS), an irreversible diverse neurodegenerative disorder
showed consistent phenotypic differences and the disease progression is
heterogeneous with significant variability. This paper demonstrated about
finding some significant gene expression profiles and its associated or
co-regulated cluster of gene expressions from four groups of data with
different genetic background or models conditions. Gene enrichment score
analysis and pathway analysis of judicially selected clusters lead toward
identifying features underlying the differential speed of disease progression.
Gene ontology overrepresentation analysis showed clusters from the proposed
method are less likely to be clustered just by chance. In this paper, we
develop a new clustering method that allows each cluster to be parameterised
according to whether the behaviour of the genes across conditions is correlated
or anti-correlated. Our proposed method unveil the potency of latent
information shared between multiple model conditions and their replicates
during modelling gene expression data.
| q-bio.QM | clustering of gene expression time series gives insight into which genes may be coregulated allowing us to discern the activity of pathways in a given microarray experiment of particular interest is how a given group of genes varies with different model conditions or genetic background amyotrophic lateral sclerosis als an irreversible diverse neurodegenerative disorder showed consistent phenotypic differences and the disease progression is heterogeneous with significant variability this paper demonstrated about finding some significant gene expression profiles and its associated or coregulated cluster of gene expressions from four groups of data with different genetic background or models conditions gene enrichment score analysis and pathway analysis of judicially selected clusters lead toward identifying features underlying the differential speed of disease progression gene ontology overrepresentation analysis showed clusters from the proposed method are less likely to be clustered just by chance in this paper we develop a new clustering method that allows each cluster to be parameterised according to whether the behaviour of the genes across conditions is correlated or anticorrelated our proposed method unveil the potency of latent information shared between multiple model conditions and their replicates during modelling gene expression data | [['clustering', 'of', 'gene', 'expression', 'time', 'series', 'gives', 'insight', 'into', 'which', 'genes', 'may', 'be', 'coregulated', 'allowing', 'us', 'to', 'discern', 'the', 'activity', 'of', 'pathways', 'in', 'a', 'given', 'microarray', 'experiment', 'of', 'particular', 'interest', 'is', 'how', 'a', 'given', 'group', 'of', 'genes', 'varies', 'with', 'different', 'model', 'conditions', 'or', 'genetic', 'background', 'amyotrophic', 'lateral', 'sclerosis', 'als', 'an', 'irreversible', 'diverse', 'neurodegenerative', 'disorder', 'showed', 'consistent', 'phenotypic', 'differences', 'and', 'the', 'disease', 'progression', 'is', 'heterogeneous', 'with', 'significant', 'variability', 'this', 'paper', 'demonstrated', 'about', 'finding', 'some', 'significant', 'gene', 'expression', 'profiles', 'and', 'its', 'associated', 'or', 'coregulated', 'cluster', 'of', 'gene', 'expressions', 'from', 'four', 'groups', 'of', 'data', 'with', 'different', 'genetic', 'background', 'or', 'models', 'conditions', 'gene', 'enrichment', 'score', 'analysis', 'and', 'pathway', 'analysis', 'of', 'judicially', 'selected', 'clusters', 'lead', 'toward', 'identifying', 'features', 'underlying', 'the', 'differential', 'speed', 'of', 'disease', 'progression', 'gene', 'ontology', 'overrepresentation', 'analysis', 'showed', 'clusters', 'from', 'the', 'proposed', 'method', 'are', 'less', 'likely', 'to', 'be', 'clustered', 'just', 'by', 'chance', 'in', 'this', 'paper', 'we', 'develop', 'a', 'new', 'clustering', 'method', 'that', 'allows', 'each', 'cluster', 'to', 'be', 'parameterised', 'according', 'to', 'whether', 'the', 'behaviour', 'of', 'the', 'genes', 'across', 'conditions', 'is', 'correlated', 'or', 'anticorrelated', 'our', 'proposed', 'method', 'unveil', 'the', 'potency', 'of', 'latent', 'information', 'shared', 'between', 'multiple', 'model', 'conditions', 'and', 'their', 'replicates', 'during', 'modelling', 'gene', 'expression', 'data']] | [-0.087054007177129, 0.06608401939916822, -0.08164906802621344, 0.09803039409251912, -0.08396043514598804, -0.15979010428433643, 0.09045768605120948, 0.38493944252036627, -0.24529147751785385, -0.32264842221230583, 0.013309114991750626, -0.26292905441727016, -0.23995076851304914, 0.17614801794641616, -0.08334858199162165, -0.025095485984920694, 0.1346094808468098, 0.03500122413117224, 0.06432600101792492, -0.25788981020840673, 0.28340588953268, 0.07799746334084666, 0.3162931566314372, -0.024898833361166623, 0.08998065861002956, -0.07320654105044004, -0.13091550872744065, 0.004694068559019702, -0.1012211084033741, 0.15372462778691084, 0.3423465812801914, 0.24554611224661635, 0.3086895686208578, -0.4328276280274722, -0.2347156955709398, 0.11925558740741217, 0.16527903994974433, 0.1466254194831495, -0.015389041706958678, -0.2951428617072823, 0.059286578645544485, -0.13107367504890324, -0.08151700998734468, -0.05536546857834974, 0.011890245457691828, 0.024062280479150565, -0.28057882265329204, 0.19075045301408278, -0.0006635084953061574, 0.13284890034787006, -0.09466025157583541, -0.12373027097463062, -0.06479610763222018, 0.19412339962677572, 0.08056962030759345, 0.026567087458758687, 0.18617921667807388, -0.09607958953817868, -0.13205717657375787, 0.29974418009889764, 0.01337069868480699, -0.17651504695533435, 0.22037880146066555, -0.12353125387919744, -0.17553205836895872, 0.140909692711387, 0.17719574871897228, 0.06698606893083774, -0.25113977086657163, -0.049386039396981996, 0.029701358619199685, 0.21001117310793924, 0.11094492814547495, -0.03494953678394253, 0.18566531786470825, 0.17847015079066977, 0.015021497824994838, 0.1101950506444445, -0.10509675180939324, -0.0757894995207874, -0.19888953477935378, -0.11274147917228844, -0.07411430643247294, 0.020533005962348225, -0.16439744234005849, -0.20386082848841178, 0.4151742849108904, 0.13021419858328354, 0.18988854446111939, 0.04730951050049577, 0.20679031810674484, 0.032098701017109085, 0.0909255601024421, -0.005271441963896234, 0.065955783950722, 0.1149904675180146, 0.02705905032258832, -0.26989318856223443, 0.20759840145297542, -0.026532365582122696] |
1,802.02678 | Biological Mechanisms for Learning: A Computational Model of Olfactory
Learning in the Manduca sexta Moth, with Applications to Neural Nets | The insect olfactory system, which includes the antennal lobe (AL), mushroom
body (MB), and ancillary structures, is a relatively simple neural system
capable of learning. Its structural features, which are widespread in
biological neural systems, process olfactory stimuli through a cascade of
networks where large dimension shifts occur from stage to stage and where
sparsity and randomness play a critical role in coding. Learning is partly
enabled by a neuromodulatory reward mechanism of octopamine stimulation of the
AL, whose increased activity induces rewiring of the MB through Hebbian
plasticity. Enforced sparsity in the MB focuses Hebbian growth on neurons that
are the most important for the representation of the learned odor. Based upon
current biophysical knowledge, we have constructed an end-to-end computational
model of the Manduca sexta moth olfactory system which includes the interaction
of the AL and MB under octopamine stimulation. Our model is able to robustly
learn new odors, and our simulations of integrate-and-fire neurons match the
statistical features of in-vivo firing rate data. From a biological
perspective, the model provides a valuable tool for examining the role of
neuromodulators, like octopamine, in learning, and gives insight into critical
interactions between sparsity, Hebbian growth, and stimulation during learning.
Our simulations also inform predictions about structural details of the
olfactory system that are not currently well-characterized. From a machine
learning perspective, the model yields bio-inspired mechanisms that are
potentially useful in constructing neural nets for rapid learning from very few
samples. These mechanisms include high-noise layers, sparse layers as noise
filters, and a biologically-plausible optimization method to train the network
based on octopamine stimulation, sparse layers, and Hebbian growth.
| q-bio.NC cs.LG cs.NE | the insect olfactory system which includes the antennal lobe al mushroom body mb and ancillary structures is a relatively simple neural system capable of learning its structural features which are widespread in biological neural systems process olfactory stimuli through a cascade of networks where large dimension shifts occur from stage to stage and where sparsity and randomness play a critical role in coding learning is partly enabled by a neuromodulatory reward mechanism of octopamine stimulation of the al whose increased activity induces rewiring of the mb through hebbian plasticity enforced sparsity in the mb focuses hebbian growth on neurons that are the most important for the representation of the learned odor based upon current biophysical knowledge we have constructed an endtoend computational model of the manduca sexta moth olfactory system which includes the interaction of the al and mb under octopamine stimulation our model is able to robustly learn new odors and our simulations of integrateandfire neurons match the statistical features of invivo firing rate data from a biological perspective the model provides a valuable tool for examining the role of neuromodulators like octopamine in learning and gives insight into critical interactions between sparsity hebbian growth and stimulation during learning our simulations also inform predictions about structural details of the olfactory system that are not currently wellcharacterized from a machine learning perspective the model yields bioinspired mechanisms that are potentially useful in constructing neural nets for rapid learning from very few samples these mechanisms include highnoise layers sparse layers as noise filters and a biologicallyplausible optimization method to train the network based on octopamine stimulation sparse layers and hebbian growth | [['the', 'insect', 'olfactory', 'system', 'which', 'includes', 'the', 'antennal', 'lobe', 'al', 'mushroom', 'body', 'mb', 'and', 'ancillary', 'structures', 'is', 'a', 'relatively', 'simple', 'neural', 'system', 'capable', 'of', 'learning', 'its', 'structural', 'features', 'which', 'are', 'widespread', 'in', 'biological', 'neural', 'systems', 'process', 'olfactory', 'stimuli', 'through', 'a', 'cascade', 'of', 'networks', 'where', 'large', 'dimension', 'shifts', 'occur', 'from', 'stage', 'to', 'stage', 'and', 'where', 'sparsity', 'and', 'randomness', 'play', 'a', 'critical', 'role', 'in', 'coding', 'learning', 'is', 'partly', 'enabled', 'by', 'a', 'neuromodulatory', 'reward', 'mechanism', 'of', 'octopamine', 'stimulation', 'of', 'the', 'al', 'whose', 'increased', 'activity', 'induces', 'rewiring', 'of', 'the', 'mb', 'through', 'hebbian', 'plasticity', 'enforced', 'sparsity', 'in', 'the', 'mb', 'focuses', 'hebbian', 'growth', 'on', 'neurons', 'that', 'are', 'the', 'most', 'important', 'for', 'the', 'representation', 'of', 'the', 'learned', 'odor', 'based', 'upon', 'current', 'biophysical', 'knowledge', 'we', 'have', 'constructed', 'an', 'endtoend', 'computational', 'model', 'of', 'the', 'manduca', 'sexta', 'moth', 'olfactory', 'system', 'which', 'includes', 'the', 'interaction', 'of', 'the', 'al', 'and', 'mb', 'under', 'octopamine', 'stimulation', 'our', 'model', 'is', 'able', 'to', 'robustly', 'learn', 'new', 'odors', 'and', 'our', 'simulations', 'of', 'integrateandfire', 'neurons', 'match', 'the', 'statistical', 'features', 'of', 'invivo', 'firing', 'rate', 'data', 'from', 'a', 'biological', 'perspective', 'the', 'model', 'provides', 'a', 'valuable', 'tool', 'for', 'examining', 'the', 'role', 'of', 'neuromodulators', 'like', 'octopamine', 'in', 'learning', 'and', 'gives', 'insight', 'into', 'critical', 'interactions', 'between', 'sparsity', 'hebbian', 'growth', 'and', 'stimulation', 'during', 'learning', 'our', 'simulations', 'also', 'inform', 'predictions', 'about', 'structural', 'details', 'of', 'the', 'olfactory', 'system', 'that', 'are', 'not', 'currently', 'wellcharacterized', 'from', 'a', 'machine', 'learning', 'perspective', 'the', 'model', 'yields', 'bioinspired', 'mechanisms', 'that', 'are', 'potentially', 'useful', 'in', 'constructing', 'neural', 'nets', 'for', 'rapid', 'learning', 'from', 'very', 'few', 'samples', 'these', 'mechanisms', 'include', 'highnoise', 'layers', 'sparse', 'layers', 'as', 'noise', 'filters', 'and', 'a', 'biologicallyplausible', 'optimization', 'method', 'to', 'train', 'the', 'network', 'based', 'on', 'octopamine', 'stimulation', 'sparse', 'layers', 'and', 'hebbian', 'growth']] | [-0.05064968156059169, 0.08701556554216142, -0.0632621780962735, 0.035682884734631916, -0.09008221936205195, -0.18866278797073324, 0.05820438500786959, 0.39551010279985216, -0.2935758006194158, -0.2828282677947923, 0.06409474442738833, -0.2470705099955753, -0.31052709914985355, 0.17827887970574752, -0.09946205438614858, 0.046555506142882494, 0.08818871011328021, 0.018782574576498182, 0.049603702626363544, -0.22306629984329143, 0.2643015484618782, 0.08874419186333263, 0.3126729649194102, -0.02380446730444587, 0.1467535451766, -0.023102798911363437, 0.0023289980340955984, -0.07440162627759424, -0.07504403352760602, 0.16164539575434497, 0.2814820226628971, 0.18711885541367035, 0.3103444524557778, -0.477251553983876, -0.27483041697285243, 0.06759484804114672, 0.12952419020735692, 0.11444927761546785, -0.05042600179591251, -0.2941670748198198, 0.06355563215825155, -0.14934129915717576, 0.009205722197441868, -0.11593128203724822, -0.008144097745901456, 0.045682963941561426, -0.32948642114556775, 0.07619919618494654, 0.11675004661406597, 0.10824572357728525, -0.07294901269164661, -0.10210571384011052, -0.02344158159793113, 0.15789302090243265, -0.0007627558248781565, 0.04538507332197494, 0.21288231286323733, -0.18873131276513622, -0.10443533690542811, 0.28755917630365324, -0.0075317848508280735, -0.13976611016939083, 0.22533016337116282, -0.043428449218885765, -0.14221368285275443, 0.1294893284082516, 0.2302131230791996, 0.03622017423449843, -0.18315663435668858, -0.0076389206799730245, 0.00910482191549683, 0.20767046605340309, 0.020488078664574357, 0.004273693555000203, 0.18201120744580057, 0.2905730721713216, -0.025440099526679628, 0.12122254189517763, -0.08773510693831163, -0.10600726472071578, -0.21242524780402028, -0.05231903202969719, -0.15797941789065523, 0.00967379792747562, -0.11076923356239503, -0.12996695139450753, 0.39956724308431146, 0.16170342724632333, 0.2196243442970121, 0.08176997228120281, 0.25273854887647623, 0.010790887791490941, 0.13189256876293157, 0.07016858923059233, 0.21036583057828936, 0.11758286705740761, 0.133229249338102, -0.21944930088313952, 0.1555664210933847, 0.0329185096460774] |
1,802.02679 | A Semi-Supervised Two-Stage Approach to Learning from Noisy Labels | The recent success of deep neural networks is powered in part by large-scale
well-labeled training data. However, it is a daunting task to laboriously
annotate an ImageNet-like dateset. On the contrary, it is fairly convenient,
fast, and cheap to collect training images from the Web along with their noisy
labels. This signifies the need of alternative approaches to training deep
neural networks using such noisy labels. Existing methods tackling this problem
either try to identify and correct the wrong labels or reweigh the data terms
in the loss function according to the inferred noisy rates. Both strategies
inevitably incur errors for some of the data points. In this paper, we contend
that it is actually better to ignore the labels of some of the data points than
to keep them if the labels are incorrect, especially when the noisy rate is
high. After all, the wrong labels could mislead a neural network to a bad local
optimum. We suggest a two-stage framework for the learning from noisy labels.
In the first stage, we identify a small portion of images from the noisy
training set of which the labels are correct with a high probability. The noisy
labels of the other images are ignored. In the second stage, we train a deep
neural network in a semi-supervised manner. This framework effectively takes
advantage of the whole training set and yet only a portion of its labels that
are most likely correct. Experiments on three datasets verify the effectiveness
of our approach especially when the noisy rate is high.
| cs.CV | the recent success of deep neural networks is powered in part by largescale welllabeled training data however it is a daunting task to laboriously annotate an imagenetlike dateset on the contrary it is fairly convenient fast and cheap to collect training images from the web along with their noisy labels this signifies the need of alternative approaches to training deep neural networks using such noisy labels existing methods tackling this problem either try to identify and correct the wrong labels or reweigh the data terms in the loss function according to the inferred noisy rates both strategies inevitably incur errors for some of the data points in this paper we contend that it is actually better to ignore the labels of some of the data points than to keep them if the labels are incorrect especially when the noisy rate is high after all the wrong labels could mislead a neural network to a bad local optimum we suggest a twostage framework for the learning from noisy labels in the first stage we identify a small portion of images from the noisy training set of which the labels are correct with a high probability the noisy labels of the other images are ignored in the second stage we train a deep neural network in a semisupervised manner this framework effectively takes advantage of the whole training set and yet only a portion of its labels that are most likely correct experiments on three datasets verify the effectiveness of our approach especially when the noisy rate is high | [['the', 'recent', 'success', 'of', 'deep', 'neural', 'networks', 'is', 'powered', 'in', 'part', 'by', 'largescale', 'welllabeled', 'training', 'data', 'however', 'it', 'is', 'a', 'daunting', 'task', 'to', 'laboriously', 'annotate', 'an', 'imagenetlike', 'dateset', 'on', 'the', 'contrary', 'it', 'is', 'fairly', 'convenient', 'fast', 'and', 'cheap', 'to', 'collect', 'training', 'images', 'from', 'the', 'web', 'along', 'with', 'their', 'noisy', 'labels', 'this', 'signifies', 'the', 'need', 'of', 'alternative', 'approaches', 'to', 'training', 'deep', 'neural', 'networks', 'using', 'such', 'noisy', 'labels', 'existing', 'methods', 'tackling', 'this', 'problem', 'either', 'try', 'to', 'identify', 'and', 'correct', 'the', 'wrong', 'labels', 'or', 'reweigh', 'the', 'data', 'terms', 'in', 'the', 'loss', 'function', 'according', 'to', 'the', 'inferred', 'noisy', 'rates', 'both', 'strategies', 'inevitably', 'incur', 'errors', 'for', 'some', 'of', 'the', 'data', 'points', 'in', 'this', 'paper', 'we', 'contend', 'that', 'it', 'is', 'actually', 'better', 'to', 'ignore', 'the', 'labels', 'of', 'some', 'of', 'the', 'data', 'points', 'than', 'to', 'keep', 'them', 'if', 'the', 'labels', 'are', 'incorrect', 'especially', 'when', 'the', 'noisy', 'rate', 'is', 'high', 'after', 'all', 'the', 'wrong', 'labels', 'could', 'mislead', 'a', 'neural', 'network', 'to', 'a', 'bad', 'local', 'optimum', 'we', 'suggest', 'a', 'twostage', 'framework', 'for', 'the', 'learning', 'from', 'noisy', 'labels', 'in', 'the', 'first', 'stage', 'we', 'identify', 'a', 'small', 'portion', 'of', 'images', 'from', 'the', 'noisy', 'training', 'set', 'of', 'which', 'the', 'labels', 'are', 'correct', 'with', 'a', 'high', 'probability', 'the', 'noisy', 'labels', 'of', 'the', 'other', 'images', 'are', 'ignored', 'in', 'the', 'second', 'stage', 'we', 'train', 'a', 'deep', 'neural', 'network', 'in', 'a', 'semisupervised', 'manner', 'this', 'framework', 'effectively', 'takes', 'advantage', 'of', 'the', 'whole', 'training', 'set', 'and', 'yet', 'only', 'a', 'portion', 'of', 'its', 'labels', 'that', 'are', 'most', 'likely', 'correct', 'experiments', 'on', 'three', 'datasets', 'verify', 'the', 'effectiveness', 'of', 'our', 'approach', 'especially', 'when', 'the', 'noisy', 'rate', 'is', 'high']] | [-0.06697252118505362, 0.019267889339713778, -0.03447056089538905, 0.09690343793463255, -0.1244010618231516, -0.15811023717804804, 0.0977320128370729, 0.419229395093587, -0.28873223352189153, -0.31514602087394106, 0.10441743739326961, -0.28814212413661466, -0.15915856238795575, 0.169461531564135, -0.1620565273975, 0.05358829132513158, 0.1712286935134481, 0.08128154095570285, -0.0405121629020267, -0.32606221567660637, 0.3202463772595222, 0.05557697700892528, 0.3118151818781607, -0.021579645827089943, 0.11201910174261104, -0.06135511101685523, -0.03778104947691538, -0.007352804364784351, -0.006606867620604586, 0.14660387862369229, 0.3104777874481886, 0.19781797540220103, 0.3668564975511019, -0.4429491350315438, -0.20420105858034718, 0.13539089121555362, 0.11377496276817131, 0.17854808792880944, -0.010302052840473145, -0.3267487307229468, 0.12114869666127231, -0.13437166297441627, 0.012833067985741041, -0.10254058205361265, -0.009785205892591525, -0.016175903543998584, -0.30924558220843706, 0.06179717380652483, 0.04217391419196941, 0.027596753070453606, -0.039581491607772995, -0.0861770153965977, 0.012826102172523208, 0.1872752954338688, 0.0629133646299432, 0.06508027909641653, 0.10485905113970993, -0.2138841853873056, -0.06718915060353209, 0.35849613643904016, -0.015750718969720193, -0.20498373180785487, 0.2072557953445747, -0.06653077356557648, -0.14854098729767257, 0.15155650384900138, 0.20076988773295787, 0.1305866826354988, -0.17273059968461235, -0.007550079846437507, -0.04369042438773922, 0.176258253201285, 0.004770746406013747, -0.006135960230530482, 0.1867576614494333, 0.1993328566556635, 0.019747134639082228, 0.1309851047632882, -0.13470583978417516, -0.02192152174021022, -0.26213982779446504, -0.08840056758476642, -0.24170508714416614, 0.00037079322377337126, -0.09479316735373651, -0.15962328190555958, 0.37046436801564575, 0.24708655838099286, 0.2911802213199026, 0.10223062138492975, 0.3571566893667804, 0.0375325359138486, 0.10651325931732257, 0.09653287886171676, 0.2017971602771303, 0.004062967208089439, 0.11333310426997505, -0.15380281896257542, 0.13941223017264553, 0.008728915229659732] |
1,802.0268 | On the inverse problem of source reconstruction from coherence
measurements | We consider an inverse source problem for partially coherent light
propagating in the Fresnel regime. The data is the coherence of the field
measured away from the source. The reconstruction is based on a minimum residue
formulation, which uses the authors' recent closed-form approximation formula
for the coherence of the propagated field. The developed algorithms require a
small data sample for convergence and yield stable inversion by exploiting
information in the coherence as opposed to intensity-only measurements.
Examples with both simulated and experimental data demonstrate the ability of
the proposed approach to simultaneously recover complex sources in different
planes transverse to the direction of propagation.
| physics.optics eess.SP | we consider an inverse source problem for partially coherent light propagating in the fresnel regime the data is the coherence of the field measured away from the source the reconstruction is based on a minimum residue formulation which uses the authors recent closedform approximation formula for the coherence of the propagated field the developed algorithms require a small data sample for convergence and yield stable inversion by exploiting information in the coherence as opposed to intensityonly measurements examples with both simulated and experimental data demonstrate the ability of the proposed approach to simultaneously recover complex sources in different planes transverse to the direction of propagation | [['we', 'consider', 'an', 'inverse', 'source', 'problem', 'for', 'partially', 'coherent', 'light', 'propagating', 'in', 'the', 'fresnel', 'regime', 'the', 'data', 'is', 'the', 'coherence', 'of', 'the', 'field', 'measured', 'away', 'from', 'the', 'source', 'the', 'reconstruction', 'is', 'based', 'on', 'a', 'minimum', 'residue', 'formulation', 'which', 'uses', 'the', 'authors', 'recent', 'closedform', 'approximation', 'formula', 'for', 'the', 'coherence', 'of', 'the', 'propagated', 'field', 'the', 'developed', 'algorithms', 'require', 'a', 'small', 'data', 'sample', 'for', 'convergence', 'and', 'yield', 'stable', 'inversion', 'by', 'exploiting', 'information', 'in', 'the', 'coherence', 'as', 'opposed', 'to', 'intensityonly', 'measurements', 'examples', 'with', 'both', 'simulated', 'and', 'experimental', 'data', 'demonstrate', 'the', 'ability', 'of', 'the', 'proposed', 'approach', 'to', 'simultaneously', 'recover', 'complex', 'sources', 'in', 'different', 'planes', 'transverse', 'to', 'the', 'direction', 'of', 'propagation']] | [-0.09286740542877288, 0.07369376859708046, -0.08278440735968096, 0.06808215399450135, -0.06188660641866071, -0.09569766399051462, 0.037376223633154515, 0.3754032206034199, -0.30003207998261566, -0.3227048477911878, 0.1111558949630264, -0.2856867810445172, -0.09057168029692202, 0.23402199071743304, -0.040358966380535134, 0.08621859864908316, 0.0638486600436625, 0.03510263457539536, -0.07609812365844845, -0.19606357668082983, 0.2904569847819706, 0.06514117064708401, 0.3492527906649879, 0.02725844406744554, 0.1499343170551583, 0.07166081111700762, -0.041289697818103294, 0.004659602591501815, -0.0903072910715959, 0.12036366226661596, 0.23878205461161478, 0.13580921735348447, 0.2167353802671035, -0.42523619331207424, -0.23988049202376888, 0.05338806006177384, 0.13717188766209543, 0.15461277032514945, -0.06802345815979477, -0.30554068322470856, 0.05826450810501618, -0.0782595531571479, -0.11269882868177124, -0.05167995994644506, -0.036683961647074846, 0.01940655481247675, -0.2866274956037246, 0.07561192017137294, 0.04349195042048536, 0.05277790774014734, -0.06255885172812711, -0.07862907825481324, 0.02889876755264898, 0.1183447888897111, 0.049959888139606584, 0.04028351185732477, 0.09301293210924737, -0.1148038942721628, -0.10677493839923824, 0.3404207720288209, -0.07078461367526047, -0.20284941220389946, 0.1271565741837202, -0.1328845642471043, -0.05707527733452263, 0.18491212593480236, 0.20136083896671023, 0.1398394143563651, -0.13660073184541294, 0.04999606424299557, -0.03276207720239957, 0.1488595227666554, 0.047267540943409715, 0.048919595822337125, 0.1495954251449023, 0.12766722164759856, 0.06244844507780813, 0.1655207808617325, -0.17043867272413557, -0.08989944789736044, -0.28626528314891314, -0.11924686927481422, -0.221384447644509, 0.0010073699500589143, -0.08111337149720861, -0.1321304203003473, 0.4005050151830628, 0.167225933420871, 0.1950377122992428, 0.051192230643660186, 0.34854500449839093, 0.10757459921629302, 0.07799349561156262, 0.07898358856106089, 0.25157064067510265, 0.17478496079067035, 0.09951664557503093, -0.2231249587543841, 0.050636795629924604, 0.016355805113423792] |
1,802.02681 | Towards A Systems Approach To Distributed Programming | It is undeniable that most developers today are building distributed
applications. However, most of these applications are developed by composing
existing systems together through unspecified APIs exposed to the application
developer. Systems are not going away: they solve a particular problem and most
applications today need to rely on several of these systems working in concert.
Given this, we propose a research direction where higher-level languages with
well defined semantics target underlying systems infrastructure as a
middle-ground.
| cs.DC | it is undeniable that most developers today are building distributed applications however most of these applications are developed by composing existing systems together through unspecified apis exposed to the application developer systems are not going away they solve a particular problem and most applications today need to rely on several of these systems working in concert given this we propose a research direction where higherlevel languages with well defined semantics target underlying systems infrastructure as a middleground | [['it', 'is', 'undeniable', 'that', 'most', 'developers', 'today', 'are', 'building', 'distributed', 'applications', 'however', 'most', 'of', 'these', 'applications', 'are', 'developed', 'by', 'composing', 'existing', 'systems', 'together', 'through', 'unspecified', 'apis', 'exposed', 'to', 'the', 'application', 'developer', 'systems', 'are', 'not', 'going', 'away', 'they', 'solve', 'a', 'particular', 'problem', 'and', 'most', 'applications', 'today', 'need', 'to', 'rely', 'on', 'several', 'of', 'these', 'systems', 'working', 'in', 'concert', 'given', 'this', 'we', 'propose', 'a', 'research', 'direction', 'where', 'higherlevel', 'languages', 'with', 'well', 'defined', 'semantics', 'target', 'underlying', 'systems', 'infrastructure', 'as', 'a', 'middleground']] | [-0.1273842370621376, 0.05472995421861286, -0.024669038059262485, 0.07183235895807867, -0.16512205862355503, -0.1914396454434987, 0.014340314409368999, 0.42272458588341616, -0.2890864402742137, -0.33168494501816376, 0.1748291623715142, -0.2851910165468739, -0.15208553348655823, 0.267566365516418, -0.10571870091673616, 0.08414803352055757, 0.06186406023183523, 0.029014864368001363, -0.03194907344363678, -0.2567516902776121, 0.3061931891043296, 0.019113180529955146, 0.25492196746605944, 0.025727850778100938, 0.027016459226414755, -0.01729410257819411, -0.02529825979099887, -0.002730053426189856, -0.03883509526481661, 0.18793942146577763, 0.4014402103017677, 0.20942672914764904, 0.34355136403789766, -0.4843176358270568, -0.21381292667530186, 0.06475946521265553, 0.17545824104242705, 0.09458572029244977, -0.07785193819715944, -0.2702985792723182, 0.09399273863376735, -0.1964126366988889, -0.0834529708962065, -0.08113236305271367, 0.007699427119298995, 0.06109211181574682, -0.16837520306542902, -0.07774249995248271, 0.05799422893333385, 0.09365937091688348, -0.015862555920400402, -0.11895626387861255, 0.018939889662040323, 0.18607795857801707, 0.05466331100369525, 0.017400247746377023, 0.19857230933092826, -0.1352792503342468, -0.1419933248891846, 0.4236535467570285, 0.0431746626348392, -0.1967631009975811, 0.29759487232598536, -0.009826677107530367, -0.19114773760719056, 0.035643157246824986, 0.20509240121955608, 0.12319941280482265, -0.20585043341308445, 0.10746750455612752, 0.016566492127278794, 0.19069990782103466, 0.06702363726912768, 0.023994748209990174, 0.24681407973085615, 0.1780981713174177, 0.07706730559395698, 0.06582245264541019, 0.0527214201003942, -0.11450733024893063, -0.251188947528891, -0.12091798670952777, -0.15075214896593, -0.019150328081420188, 0.02045681089931621, -0.1690324940171596, 0.31186583210024743, 0.24102678707522618, 0.14087916739502704, 0.02280600413917443, 0.32109894189838467, 0.06731501926649845, 0.137109709163529, 0.13037144427502215, 0.13729537533620348, 0.0419336612572192, 0.1633896704388226, -0.06528599934604068, 0.11244723772896188, -0.013800228740294258] |
1,802.02682 | A diffusion generated method for computing Dirichlet partitions | A Dirichlet $k$-partition of a closed $d$-dimensional surface is a collection
of $k$ pairwise disjoint open subsets such that the sum of their first
Laplace-Beltrami-Dirichlet eigenvalues is minimal. In this paper, we develop a
simple and efficient diffusion generated method to compute Dirichlet
$k$-partitions for $d$-dimensional flat tori and spheres. For the $2d$ flat
torus, for most values of $k=3$-9,11,12,15,16, and 20, we obtain hexagonal
honeycombs. For the $3d$ flat torus and $k=2,4,8,16$, we obtain the rhombic
dodecahedral honeycomb, the Weaire-Phelan honeycomb, and Kelvin's tessellation
by truncated octahedra. For the $4d$ flat torus, for $k=4$, we obtain a
constant extension of the rhombic dodecahedral honeycomb along the fourth
direction and for $k=8$, we obtain a 24-cell honeycomb. For the $2d$ sphere, we
also compute Dirichlet partitions for $k=3$-7,9,10,12,14,20. Our computational
results agree with previous studies when a comparison is available. As far as
we are aware, these are the first published results for Dirichlet partitions of
the $4d$ flat torus.
| math.OC cs.CG | a dirichlet kpartition of a closed ddimensional surface is a collection of k pairwise disjoint open subsets such that the sum of their first laplacebeltramidirichlet eigenvalues is minimal in this paper we develop a simple and efficient diffusion generated method to compute dirichlet kpartitions for ddimensional flat tori and spheres for the 2d flat torus for most values of k3911121516 and 20 we obtain hexagonal honeycombs for the 3d flat torus and k24816 we obtain the rhombic dodecahedral honeycomb the weairephelan honeycomb and kelvins tessellation by truncated octahedra for the 4d flat torus for k4 we obtain a constant extension of the rhombic dodecahedral honeycomb along the fourth direction and for k8 we obtain a 24cell honeycomb for the 2d sphere we also compute dirichlet partitions for k37910121420 our computational results agree with previous studies when a comparison is available as far as we are aware these are the first published results for dirichlet partitions of the 4d flat torus | [['a', 'dirichlet', 'kpartition', 'of', 'a', 'closed', 'ddimensional', 'surface', 'is', 'a', 'collection', 'of', 'k', 'pairwise', 'disjoint', 'open', 'subsets', 'such', 'that', 'the', 'sum', 'of', 'their', 'first', 'laplacebeltramidirichlet', 'eigenvalues', 'is', 'minimal', 'in', 'this', 'paper', 'we', 'develop', 'a', 'simple', 'and', 'efficient', 'diffusion', 'generated', 'method', 'to', 'compute', 'dirichlet', 'kpartitions', 'for', 'ddimensional', 'flat', 'tori', 'and', 'spheres', 'for', 'the', '2d', 'flat', 'torus', 'for', 'most', 'values', 'of', 'k3911121516', 'and', '20', 'we', 'obtain', 'hexagonal', 'honeycombs', 'for', 'the', '3d', 'flat', 'torus', 'and', 'k24816', 'we', 'obtain', 'the', 'rhombic', 'dodecahedral', 'honeycomb', 'the', 'weairephelan', 'honeycomb', 'and', 'kelvins', 'tessellation', 'by', 'truncated', 'octahedra', 'for', 'the', '4d', 'flat', 'torus', 'for', 'k4', 'we', 'obtain', 'a', 'constant', 'extension', 'of', 'the', 'rhombic', 'dodecahedral', 'honeycomb', 'along', 'the', 'fourth', 'direction', 'and', 'for', 'k8', 'we', 'obtain', 'a', '24cell', 'honeycomb', 'for', 'the', '2d', 'sphere', 'we', 'also', 'compute', 'dirichlet', 'partitions', 'for', 'k37910121420', 'our', 'computational', 'results', 'agree', 'with', 'previous', 'studies', 'when', 'a', 'comparison', 'is', 'available', 'as', 'far', 'as', 'we', 'are', 'aware', 'these', 'are', 'the', 'first', 'published', 'results', 'for', 'dirichlet', 'partitions', 'of', 'the', '4d', 'flat', 'torus']] | [-0.1292048252217712, 0.0884115751712553, 0.0072461662183125174, 0.046840207637738315, -0.10957335242400727, -0.13987226694401714, 0.013312635331174298, 0.4107704287304753, -0.2288375590016292, -0.2132835360927387, 0.1185287497088974, -0.30885860758923717, -0.12653638039445203, 0.15937005099389823, -0.04581409722957159, 0.03465192343207872, 0.034963495831095405, 0.01559283847389217, -0.08223207304704815, -0.26102718867121205, 0.30949535770041325, -0.003134350043030516, 0.2480085699894135, 0.025653483640522726, 0.0640540978623434, 0.019069116858149607, 0.0193316945776103, 0.04207084439394455, -0.2507224299842135, 0.16688589269535675, 0.19784146100583097, -0.010024218165105389, 0.14925940965692844, -0.4201380883734072, -0.1957543922347888, 0.07593060666244597, 0.15241805555058582, 0.09014934637854176, -0.03531593802955843, -0.22756349658931516, 0.09915593632181445, -0.12498307399331562, -0.18263662195794525, -0.07157627849449073, 0.0331531158092642, -0.018365942677783388, -0.26750318847836985, 0.07141751948943091, 0.09704616150458253, 0.08034368587297297, -0.11526718321106126, -0.14955297668704823, -0.047279820806016365, 0.12258796724284278, -0.004802183096387213, 0.04343979014083743, 0.024983002548857082, -0.06174434757370862, -0.12938555208290176, 0.41311925161750085, -0.0512227694549027, -0.24726899314311243, 0.13999686515739848, -0.1496012236991514, -0.15062885176270238, 0.1139595910426109, 0.11284774679450259, 0.14731397410374014, -0.0749729331794022, 0.15334462462849313, -0.1693971670863609, 0.09680239598101546, 0.11003158030010039, -0.036578516746240276, 0.20951629723272017, 0.13283201239612555, 0.11285635890258897, 0.21279875367519355, -0.0967070680171732, -0.09874675425911142, -0.2942709669711128, -0.20340655101463198, -0.22558532575926474, 0.07729543543030178, -0.15724452173341097, -0.2567348129491532, 0.36559093929827213, 0.03345484003995455, 0.2382827524786755, 0.1077405112517637, 0.22850323203170012, 0.05035267911716214, 0.028915744488157574, 0.1031698653744834, 0.14741607116565347, 0.11214604749824972, 0.014143388201632807, -0.13050950356578875, -0.07967273978095862, 0.15110205012343583] |
1,802.02683 | Prediction of Shared Bicycle Demand with Wavelet Thresholding | Consumers are creatures of habit, often periodic, tied to work, shopping and
other schedules. We analyzed one month of data from the world's largest
bike-sharing company to elicit demand behavioral cycles, initially using models
from animal tracking that showed large customers fit an Ornstein-Uhlenbeck
model with demand peaks at periodicities of 7, 12, 24 hour and 7-days. Lorenz
curves of bicycle demand showed that the majority of customer usage was
infrequent, and demand cycles from time-series models would strongly overfit
the data yielding unreliable models. Analysis of thresholded wavelets for the
space-time tensor of bike-sharing contracts was able to compress the data into
a 56-coefficient model with little loss of information, suggesting that
bike-sharing demand behavior is exceptionally strong and regular. Improvements
to predicted demand could be made by adjusting for 'noise' filtered by our
model from air quality and weather information and demand from infrequent
riders.
| econ.EM | consumers are creatures of habit often periodic tied to work shopping and other schedules we analyzed one month of data from the worlds largest bikesharing company to elicit demand behavioral cycles initially using models from animal tracking that showed large customers fit an ornsteinuhlenbeck model with demand peaks at periodicities of 7 12 24 hour and 7days lorenz curves of bicycle demand showed that the majority of customer usage was infrequent and demand cycles from timeseries models would strongly overfit the data yielding unreliable models analysis of thresholded wavelets for the spacetime tensor of bikesharing contracts was able to compress the data into a 56coefficient model with little loss of information suggesting that bikesharing demand behavior is exceptionally strong and regular improvements to predicted demand could be made by adjusting for noise filtered by our model from air quality and weather information and demand from infrequent riders | [['consumers', 'are', 'creatures', 'of', 'habit', 'often', 'periodic', 'tied', 'to', 'work', 'shopping', 'and', 'other', 'schedules', 'we', 'analyzed', 'one', 'month', 'of', 'data', 'from', 'the', 'worlds', 'largest', 'bikesharing', 'company', 'to', 'elicit', 'demand', 'behavioral', 'cycles', 'initially', 'using', 'models', 'from', 'animal', 'tracking', 'that', 'showed', 'large', 'customers', 'fit', 'an', 'ornsteinuhlenbeck', 'model', 'with', 'demand', 'peaks', 'at', 'periodicities', 'of', '7', '12', '24', 'hour', 'and', '7days', 'lorenz', 'curves', 'of', 'bicycle', 'demand', 'showed', 'that', 'the', 'majority', 'of', 'customer', 'usage', 'was', 'infrequent', 'and', 'demand', 'cycles', 'from', 'timeseries', 'models', 'would', 'strongly', 'overfit', 'the', 'data', 'yielding', 'unreliable', 'models', 'analysis', 'of', 'thresholded', 'wavelets', 'for', 'the', 'spacetime', 'tensor', 'of', 'bikesharing', 'contracts', 'was', 'able', 'to', 'compress', 'the', 'data', 'into', 'a', '56coefficient', 'model', 'with', 'little', 'loss', 'of', 'information', 'suggesting', 'that', 'bikesharing', 'demand', 'behavior', 'is', 'exceptionally', 'strong', 'and', 'regular', 'improvements', 'to', 'predicted', 'demand', 'could', 'be', 'made', 'by', 'adjusting', 'for', 'noise', 'filtered', 'by', 'our', 'model', 'from', 'air', 'quality', 'and', 'weather', 'information', 'and', 'demand', 'from', 'infrequent', 'riders']] | [-0.07983758354125774, 0.12124123264589325, -0.07962032589959363, 0.09748963167498603, -0.102083163284888, -0.18892032160321634, 0.10036269772824934, 0.4119081923304355, -0.24793307477774176, -0.3495260941568158, 0.15072426552029505, -0.3632275092300691, -0.13818343437901914, 0.20688362278112798, -0.14901597344129958, 0.05237035989438021, 0.12513704469813391, 0.030458106220004545, 0.051469416569676, -0.2990049339275909, 0.22914184561184264, 0.06974189797390813, 0.32605393090259843, -0.021773157520092106, 0.08866643231945776, -0.016629894908313472, -0.08697483361673171, -0.002254620535707433, -0.05697654057464567, 0.14237939968245894, 0.2952569719016612, 0.17541465026363157, 0.2727902619589171, -0.4701196028889246, -0.2228458664214162, 0.12291522728508875, 0.07105445466961151, 0.0352762402194769, 0.008321293183181384, -0.27110132031550965, 0.06159469510798585, -0.2089662250507725, -0.09336048663491765, -0.07420455406368902, 0.035386867412965595, 0.06657776350358004, -0.2880361845257552, 0.05635160013031827, 0.012072619924653475, 0.11439155994385021, -0.08222918610458504, -0.07307419774667934, -0.10540537546350531, 0.1620524048810021, 0.1337900146840408, -0.030681506888494407, 0.13081840584245957, -0.12140222480010292, -0.12360071537263487, 0.3745619459189347, -0.06494765905408215, -0.09900750932666434, 0.15911844795033947, -0.11896536759920545, -0.10576462803714692, 0.16041352992800817, 0.219179696266297, 0.0128029892316777, -0.1988807270105622, -0.03795285516638589, -0.012818985965903466, 0.21921723056903542, 0.08328578001596289, -0.02368565142626734, 0.22155010490997196, 0.17960713787820853, 0.0724606100846184, 0.09115568644882256, -0.07739507388610598, -0.08785863263749402, -0.17406161617860835, -0.06039469830304295, -0.15529685380090386, 0.06778417642575957, -0.11573967971932303, -0.1438662190092345, 0.38262299504705183, 0.1749477331233147, 0.16694887102085598, 0.075772749570243, 0.2852388254290268, 0.04258107476028907, 0.08728040130298635, 0.11466946111264804, 0.14556716852789514, -0.01311223265836143, 0.19016768739954248, -0.14416613426077027, 0.12928727014015798, -0.0177164871296654] |
1,802.02684 | Gaussian binomial coefficients with negative arguments | Loeb showed that a natural extension of the usual binomial coefficient to
negative (integer) entries continues to satisfy many of the fundamental
properties. In particular, he gave a uniform binomial theorem as well as a
combinatorial interpretation in terms of choosing subsets of sets with a
negative number of elements. We show that all of this can be extended to the
case of Gaussian binomial coefficients. Moreover, we demonstrate that several
of the well-known arithmetic properties of binomial coefficients also hold in
the case of negative entries. In particular, we show that Lucas' Theorem on
binomial coefficients modulo $p$ not only extends naturally to the case of
negative entries, but even to the Gaussian case.
| math.CO math.NT | loeb showed that a natural extension of the usual binomial coefficient to negative integer entries continues to satisfy many of the fundamental properties in particular he gave a uniform binomial theorem as well as a combinatorial interpretation in terms of choosing subsets of sets with a negative number of elements we show that all of this can be extended to the case of gaussian binomial coefficients moreover we demonstrate that several of the wellknown arithmetic properties of binomial coefficients also hold in the case of negative entries in particular we show that lucas theorem on binomial coefficients modulo p not only extends naturally to the case of negative entries but even to the gaussian case | [['loeb', 'showed', 'that', 'a', 'natural', 'extension', 'of', 'the', 'usual', 'binomial', 'coefficient', 'to', 'negative', 'integer', 'entries', 'continues', 'to', 'satisfy', 'many', 'of', 'the', 'fundamental', 'properties', 'in', 'particular', 'he', 'gave', 'a', 'uniform', 'binomial', 'theorem', 'as', 'well', 'as', 'a', 'combinatorial', 'interpretation', 'in', 'terms', 'of', 'choosing', 'subsets', 'of', 'sets', 'with', 'a', 'negative', 'number', 'of', 'elements', 'we', 'show', 'that', 'all', 'of', 'this', 'can', 'be', 'extended', 'to', 'the', 'case', 'of', 'gaussian', 'binomial', 'coefficients', 'moreover', 'we', 'demonstrate', 'that', 'several', 'of', 'the', 'wellknown', 'arithmetic', 'properties', 'of', 'binomial', 'coefficients', 'also', 'hold', 'in', 'the', 'case', 'of', 'negative', 'entries', 'in', 'particular', 'we', 'show', 'that', 'lucas', 'theorem', 'on', 'binomial', 'coefficients', 'modulo', 'p', 'not', 'only', 'extends', 'naturally', 'to', 'the', 'case', 'of', 'negative', 'entries', 'but', 'even', 'to', 'the', 'gaussian', 'case']] | [-0.08994529488111806, 0.08429139012713795, -0.06992359604362561, 0.0656960145884153, -0.09737292660562241, -0.13795174994384465, 0.037195099695869115, 0.31888993767333096, -0.3078825076151153, -0.22671419240169874, 0.0646152995992452, -0.27125520870575437, -0.18632407427927397, 0.22361377638805172, -0.13329236195422708, 0.03334372963290662, 0.03752031579775655, 0.08482190700976745, -0.03438294267417286, -0.32498720278558524, 0.32195241871775815, 0.006141116340523181, 0.199342322414336, 0.04855361724191386, 0.08776481520870458, 0.027212555682205635, -0.03968915902483074, 0.04892874991764193, -0.09768376509360362, 0.10280690549103462, 0.254980041604975, 0.0778841582774792, 0.27027039530322605, -0.3543263926697166, -0.17233085748132157, 0.190570457117713, 0.11341754151913135, 0.05158875523661466, -0.02273871534726704, -0.1770346462726593, 0.14785547947673047, -0.16186782631658667, -0.16157202682174418, -0.0763773003552595, 0.021089691490582797, 0.06941871584555054, -0.33636199851803805, 0.08230867851297775, 0.1806650049711132, 0.04026393583449333, -0.014409274960179692, -0.22917821125491805, 0.033267353578349174, 0.05996076396221052, 0.06299670035444686, -0.07799255093964545, 0.04049843563900694, -0.11073969968432641, -0.14834531793451827, 0.35434437834698224, -0.07755515022284311, -0.23417783526136823, 0.1295747310393895, -0.2129919682305468, -0.18640353070653004, 0.0615649001105972, 0.11833430267060581, 0.0953678349437921, -0.047803326874323517, 0.12053642825263998, -0.16847845573464165, 0.13113286538940408, 0.17781031867084296, 0.02669451377638008, 0.13989675075787564, -0.011389195267111064, 0.048993059664296554, 0.18313973982028825, 0.004513348361639225, -0.07268724911643759, -0.3180795890714406, -0.1965866345173234, -0.21183399591169766, 0.10061462099433613, -0.13281080270914927, -0.2395953231683487, 0.36548295242145007, 0.11997980510654009, 0.2406866798096377, 0.09220286053807838, 0.227522194446267, 0.1323036200063222, 0.01760129725722515, 0.03862714472267291, 0.11172112778396062, 0.20258892513811588, 0.05917343418316349, -0.11735381421268634, 0.08635630154091378, 0.0929687433835605] |
1,802.02685 | Stubborn Transaction Reduction (with Proofs) | The exponential explosion of parallel interleavings remains a fundamental
challenge to model checking of concurrent programs. Both partial-order
reduction (POR) and transaction reduction (TR) decrease the number of
interleavings in a concurrent system. Unlike POR, transactions also reduce the
number of intermediate states. Modern POR techniques, on the other hand, offer
more dynamic ways of identifying commutative behavior, a crucial task for
obtaining good reductions.
We show that transaction reduction can use the same dynamic commutativity as
found in stubborn set POR. We also compare reductions obtained by POR and TR,
demonstrating with several examples that these techniques complement each
other.
With an implementation of the dynamic transactions in the model checker
LTSmin, we compare its effectiveness with the original static TR and two POR
approaches. Several inputs, including realistic case studies, demonstrate that
the new dynamic TR can surpass POR in practice.
| cs.LO | the exponential explosion of parallel interleavings remains a fundamental challenge to model checking of concurrent programs both partialorder reduction por and transaction reduction tr decrease the number of interleavings in a concurrent system unlike por transactions also reduce the number of intermediate states modern por techniques on the other hand offer more dynamic ways of identifying commutative behavior a crucial task for obtaining good reductions we show that transaction reduction can use the same dynamic commutativity as found in stubborn set por we also compare reductions obtained by por and tr demonstrating with several examples that these techniques complement each other with an implementation of the dynamic transactions in the model checker ltsmin we compare its effectiveness with the original static tr and two por approaches several inputs including realistic case studies demonstrate that the new dynamic tr can surpass por in practice | [['the', 'exponential', 'explosion', 'of', 'parallel', 'interleavings', 'remains', 'a', 'fundamental', 'challenge', 'to', 'model', 'checking', 'of', 'concurrent', 'programs', 'both', 'partialorder', 'reduction', 'por', 'and', 'transaction', 'reduction', 'tr', 'decrease', 'the', 'number', 'of', 'interleavings', 'in', 'a', 'concurrent', 'system', 'unlike', 'por', 'transactions', 'also', 'reduce', 'the', 'number', 'of', 'intermediate', 'states', 'modern', 'por', 'techniques', 'on', 'the', 'other', 'hand', 'offer', 'more', 'dynamic', 'ways', 'of', 'identifying', 'commutative', 'behavior', 'a', 'crucial', 'task', 'for', 'obtaining', 'good', 'reductions', 'we', 'show', 'that', 'transaction', 'reduction', 'can', 'use', 'the', 'same', 'dynamic', 'commutativity', 'as', 'found', 'in', 'stubborn', 'set', 'por', 'we', 'also', 'compare', 'reductions', 'obtained', 'by', 'por', 'and', 'tr', 'demonstrating', 'with', 'several', 'examples', 'that', 'these', 'techniques', 'complement', 'each', 'other', 'with', 'an', 'implementation', 'of', 'the', 'dynamic', 'transactions', 'in', 'the', 'model', 'checker', 'ltsmin', 'we', 'compare', 'its', 'effectiveness', 'with', 'the', 'original', 'static', 'tr', 'and', 'two', 'por', 'approaches', 'several', 'inputs', 'including', 'realistic', 'case', 'studies', 'demonstrate', 'that', 'the', 'new', 'dynamic', 'tr', 'can', 'surpass', 'por', 'in', 'practice']] | [-0.15497504381407573, 0.004041315692292129, -0.04635463057124948, 0.0776477207761857, -0.09106295206746855, -0.18686229609265612, 0.05769652139942546, 0.31828984965316276, -0.26599258866765163, -0.3529909327821611, 0.13584846079551413, -0.268045000425846, -0.15586877298065938, 0.20501509549460942, -0.12504211955840563, 0.05934626001407151, 0.04170872223192266, 0.003021005689251152, -0.04827402021012992, -0.29216395414978186, 0.2346738379943621, 0.02233389452412412, 0.3230007777910051, 0.024640398211549265, 0.07947317198781016, 0.053315812169893326, -0.029608121657926405, 0.06510276184254489, -0.06711037973689128, 0.1008176502984968, 0.2912268359051249, 0.2012161314292075, 0.26492065905717077, -0.47824258315604884, -0.17129729679701003, 0.06907040384187774, 0.115422118144188, 0.12152214337244525, -0.014804369157487103, -0.24958707507979777, 0.12245088829040214, -0.20443855579356318, -0.04213788468794493, -0.1245177289653387, -0.033639224246144295, 0.006344247474237443, -0.2563923894874654, -0.005434145470771782, 0.0638585471014095, 0.07490627377430771, -0.04216788374978424, -0.10617295139993482, -0.019953902506341156, 0.10000916809117148, 0.03020270663098647, -0.014554568745482426, 0.08288089431809274, -0.10487226055531235, -0.24001774621860392, 0.3519783224572649, -0.07075807769860994, -0.15957897274357663, 0.2463615741776107, -0.039035788317165386, -0.20282230326267597, 0.09776159406841531, 0.13033651069483973, 0.10708794816742306, -0.1012205171001541, 0.08800465066410874, -0.029609852470457554, 0.19707966419067102, 0.09516876404518848, 0.04748267199277513, 0.09752780643220131, 0.160273964407323, 0.054039853620114965, 0.12478471662070915, -0.04536745768248827, -0.10937190978051899, -0.24719056439540393, -0.18579303290877308, -0.0728046215152355, -0.044107725895889155, -0.11659315400368166, -0.1451127729085567, 0.33979753722026423, 0.22223435439351763, 0.12129091968681742, 0.1189552618425105, 0.350270492342216, 0.06808000777441425, 0.0593870055118504, 0.1285090355771505, 0.15502674059154323, 0.025833695506598878, 0.14867796398205943, -0.25547562855934086, 0.10586487262353457, 0.054359565510160544] |
1,802.02686 | Thermodynamically Favorable Computation via Tile Self-assembly | The recently introduced Thermodynamic Binding Networks (TBN) model was
developed with the purpose of studying self-assembling systems by focusing on
their thermodynamically favorable final states, and ignoring the kinetic
pathways through which they evolve. The model was intentionally developed to
abstract away not only the notion of time, but also the constraints of
geometry. Collections of monomers with binding domains which allow them to form
polymers via complementary bonds are analyzed to determine their final, stable
configurations, which are those which maximize the number of bonds formed (i.e.
enthalpy) and the number of independent components (i.e. entropy). In this
paper, we first develop a definition of what it means for a TBN to perform a
computation, and then present a set of constructions which are capable of
performing computations by simulating the behaviors of space-bounded Turing
machines and boolean circuits. In contrast to previous TBN results, these
constructions are robust to great variability in the counts of monomers
existing in the systems and the numbers of polymers that form in parallel.
Although the Turing machine simulating TBNs are inefficient in terms of the
numbers of unique monomer types required, as compared to algorithmic
self-assembling systems in the abstract Tile Assembly Model (aTAM), we then
show that a general strategy of porting those aTAM system designs to TBNs
produces TBNs which incorrectly simulate computations. Finally, we present a
refinement of the TBN model which we call the Geometric Thermodynamic Binding
Networks (GTBN) model in which monomers are defined with rigid geometries and
form rigid bonds. Utilizing the constraints imposed by geometry, we then
provide a GTBN construction capable of simulating Turing machines as
efficiently as in the aTAM.
| cs.ET | the recently introduced thermodynamic binding networks tbn model was developed with the purpose of studying selfassembling systems by focusing on their thermodynamically favorable final states and ignoring the kinetic pathways through which they evolve the model was intentionally developed to abstract away not only the notion of time but also the constraints of geometry collections of monomers with binding domains which allow them to form polymers via complementary bonds are analyzed to determine their final stable configurations which are those which maximize the number of bonds formed ie enthalpy and the number of independent components ie entropy in this paper we first develop a definition of what it means for a tbn to perform a computation and then present a set of constructions which are capable of performing computations by simulating the behaviors of spacebounded turing machines and boolean circuits in contrast to previous tbn results these constructions are robust to great variability in the counts of monomers existing in the systems and the numbers of polymers that form in parallel although the turing machine simulating tbns are inefficient in terms of the numbers of unique monomer types required as compared to algorithmic selfassembling systems in the abstract tile assembly model atam we then show that a general strategy of porting those atam system designs to tbns produces tbns which incorrectly simulate computations finally we present a refinement of the tbn model which we call the geometric thermodynamic binding networks gtbn model in which monomers are defined with rigid geometries and form rigid bonds utilizing the constraints imposed by geometry we then provide a gtbn construction capable of simulating turing machines as efficiently as in the atam | [['the', 'recently', 'introduced', 'thermodynamic', 'binding', 'networks', 'tbn', 'model', 'was', 'developed', 'with', 'the', 'purpose', 'of', 'studying', 'selfassembling', 'systems', 'by', 'focusing', 'on', 'their', 'thermodynamically', 'favorable', 'final', 'states', 'and', 'ignoring', 'the', 'kinetic', 'pathways', 'through', 'which', 'they', 'evolve', 'the', 'model', 'was', 'intentionally', 'developed', 'to', 'abstract', 'away', 'not', 'only', 'the', 'notion', 'of', 'time', 'but', 'also', 'the', 'constraints', 'of', 'geometry', 'collections', 'of', 'monomers', 'with', 'binding', 'domains', 'which', 'allow', 'them', 'to', 'form', 'polymers', 'via', 'complementary', 'bonds', 'are', 'analyzed', 'to', 'determine', 'their', 'final', 'stable', 'configurations', 'which', 'are', 'those', 'which', 'maximize', 'the', 'number', 'of', 'bonds', 'formed', 'ie', 'enthalpy', 'and', 'the', 'number', 'of', 'independent', 'components', 'ie', 'entropy', 'in', 'this', 'paper', 'we', 'first', 'develop', 'a', 'definition', 'of', 'what', 'it', 'means', 'for', 'a', 'tbn', 'to', 'perform', 'a', 'computation', 'and', 'then', 'present', 'a', 'set', 'of', 'constructions', 'which', 'are', 'capable', 'of', 'performing', 'computations', 'by', 'simulating', 'the', 'behaviors', 'of', 'spacebounded', 'turing', 'machines', 'and', 'boolean', 'circuits', 'in', 'contrast', 'to', 'previous', 'tbn', 'results', 'these', 'constructions', 'are', 'robust', 'to', 'great', 'variability', 'in', 'the', 'counts', 'of', 'monomers', 'existing', 'in', 'the', 'systems', 'and', 'the', 'numbers', 'of', 'polymers', 'that', 'form', 'in', 'parallel', 'although', 'the', 'turing', 'machine', 'simulating', 'tbns', 'are', 'inefficient', 'in', 'terms', 'of', 'the', 'numbers', 'of', 'unique', 'monomer', 'types', 'required', 'as', 'compared', 'to', 'algorithmic', 'selfassembling', 'systems', 'in', 'the', 'abstract', 'tile', 'assembly', 'model', 'atam', 'we', 'then', 'show', 'that', 'a', 'general', 'strategy', 'of', 'porting', 'those', 'atam', 'system', 'designs', 'to', 'tbns', 'produces', 'tbns', 'which', 'incorrectly', 'simulate', 'computations', 'finally', 'we', 'present', 'a', 'refinement', 'of', 'the', 'tbn', 'model', 'which', 'we', 'call', 'the', 'geometric', 'thermodynamic', 'binding', 'networks', 'gtbn', 'model', 'in', 'which', 'monomers', 'are', 'defined', 'with', 'rigid', 'geometries', 'and', 'form', 'rigid', 'bonds', 'utilizing', 'the', 'constraints', 'imposed', 'by', 'geometry', 'we', 'then', 'provide', 'a', 'gtbn', 'construction', 'capable', 'of', 'simulating', 'turing', 'machines', 'as', 'efficiently', 'as', 'in', 'the', 'atam']] | [-0.10968140758118931, 0.12892364601689307, -0.06170165710574524, 0.062431198068555786, -0.034882406104694716, -0.16980911979451777, 0.055917335049757225, 0.35245534406466916, -0.2737727413969961, -0.31528164830058814, 0.07165394351161508, -0.23267469911751423, -0.15949500500859523, 0.16857478734021158, -0.032614912531148135, 0.06799003375524824, 0.0577516315064647, 0.003171729901488024, -0.017172121464444155, -0.26516184519807046, 0.2875895701551979, 0.06556169893931259, 0.2456160563399846, 0.009342468870719049, 0.07387269831347194, -0.020498526895588093, 0.013351575532420116, 0.06536709311841564, -0.1678420578335433, 0.1602687450318428, 0.2352393381085924, 0.12766319732877573, 0.23091619434258479, -0.47377699488943276, -0.1919899398654657, 0.10500645296986807, 0.13415275370194155, 0.13673758549700407, -0.006928442285226827, -0.23431389905343, 0.09524272978602147, -0.1694585535911293, -0.09592054314572702, -0.11525708120813678, 0.011849725626578385, 0.07288607615300201, -0.22824808387339793, 0.01570135594335046, 0.08449802130037411, 0.056836902290921316, -0.0616610450847921, -0.08518391501412473, -0.04433586260642518, 0.10560167916965756, -0.011046543635734865, -0.012356668353419413, 0.1593218225189908, -0.11802716380493207, -0.1452540099366822, 0.3979319720088758, 0.017714217681734062, -0.23075290745293553, 0.229625149208375, -0.06875333207998086, -0.15330132229084317, 0.1209693054990335, 0.1523559459701011, 0.11019707529636269, -0.16809760361909867, 0.04415332358372821, -0.022326931221918627, 0.1652774197227237, 0.07863589707423341, 0.020185691368215804, 0.196503821156538, 0.17919182667085393, 0.009161070103264965, 0.1849834901339967, -0.009761289226166396, -0.1480911551991647, -0.24308246737176722, -0.15151553834629752, -0.16648386347192254, 0.010527151302402754, -0.0484919423441699, -0.2028411277636769, 0.3557457350473851, 0.1285732177882032, 0.1847806131433357, 0.11929765386506914, 0.27602938805198807, 0.04099999799652406, 0.09969302122904496, 0.06161494126882065, 0.184298410192132, 0.11163824332687496, 0.07641089474613016, -0.1717492864026942, 0.08457496666603467, 0.08381837168454447] |
1,802.02687 | Stability of Kramers Majorana doublets: the effects of interactions and
disorders | In this work we study the effects of interactions and disorder on $1D$ DIII
topological superconductors and the Majorana Kramers doublets (MKDs). In
contract to the case without the time-reversal symmetry, the Umklapp
interaction plays important roles in this system. The underlying phases due to
the Umklapp interaction and disorder are found by using a perturbative
renormaliztion analysis based on the Abelian Bosonization. Importantly, the
stable topological regime can be found within a rather wide parameter space.
Furthermore, the degeneracy splitting of the MKDs is shown to be still
exponentially dependent on the length of the wire in the presence of both the
Umklapp interaction and disorder, when the Luttinger parameter
$K_0>\sqrt{2}/2$. The differences caused by the Umklapp interaction are
highlighted in contrast to the time-reversal breaking cases.
| cond-mat.mes-hall | in this work we study the effects of interactions and disorder on 1d diii topological superconductors and the majorana kramers doublets mkds in contract to the case without the timereversal symmetry the umklapp interaction plays important roles in this system the underlying phases due to the umklapp interaction and disorder are found by using a perturbative renormaliztion analysis based on the abelian bosonization importantly the stable topological regime can be found within a rather wide parameter space furthermore the degeneracy splitting of the mkds is shown to be still exponentially dependent on the length of the wire in the presence of both the umklapp interaction and disorder when the luttinger parameter k_0sqrt22 the differences caused by the umklapp interaction are highlighted in contrast to the timereversal breaking cases | [['in', 'this', 'work', 'we', 'study', 'the', 'effects', 'of', 'interactions', 'and', 'disorder', 'on', '1d', 'diii', 'topological', 'superconductors', 'and', 'the', 'majorana', 'kramers', 'doublets', 'mkds', 'in', 'contract', 'to', 'the', 'case', 'without', 'the', 'timereversal', 'symmetry', 'the', 'umklapp', 'interaction', 'plays', 'important', 'roles', 'in', 'this', 'system', 'the', 'underlying', 'phases', 'due', 'to', 'the', 'umklapp', 'interaction', 'and', 'disorder', 'are', 'found', 'by', 'using', 'a', 'perturbative', 'renormaliztion', 'analysis', 'based', 'on', 'the', 'abelian', 'bosonization', 'importantly', 'the', 'stable', 'topological', 'regime', 'can', 'be', 'found', 'within', 'a', 'rather', 'wide', 'parameter', 'space', 'furthermore', 'the', 'degeneracy', 'splitting', 'of', 'the', 'mkds', 'is', 'shown', 'to', 'be', 'still', 'exponentially', 'dependent', 'on', 'the', 'length', 'of', 'the', 'wire', 'in', 'the', 'presence', 'of', 'both', 'the', 'umklapp', 'interaction', 'and', 'disorder', 'when', 'the', 'luttinger', 'parameter', 'k_0sqrt22', 'the', 'differences', 'caused', 'by', 'the', 'umklapp', 'interaction', 'are', 'highlighted', 'in', 'contrast', 'to', 'the', 'timereversal', 'breaking', 'cases']] | [-0.2089104423996046, 0.22709979723027396, -0.036211730693110206, 0.09818472010139827, -0.032958954222492814, -0.16640418752532213, 0.056831028507722, 0.3222028684291628, -0.26257886327878244, -0.2609756027138041, 0.0468176131825819, -0.2937081252344914, -0.14778374149013432, 0.10909071750938892, 0.03744789917630354, 0.008765690509350069, -0.028110023159834165, -0.0175460456258377, -0.0847310445312741, -0.22897540179978787, 0.37050836879549726, 0.0052562064280913725, 0.33047725171631864, 0.13081126951897937, -0.01833481126889256, 0.05733832503263388, 0.05396520679125622, 0.0007501117134603603, -0.0966114188270313, 0.03788539191431952, 0.24635398237320083, -0.12412125299940066, 0.19766538572167197, -0.42947211839078414, -0.22933079980524076, 0.058228081803874024, 0.17773913353260967, 0.1571152516971192, -0.03975142630083757, -0.3487060404694339, 0.01874366138250597, -0.15063539824932964, -0.12037615039415898, -0.08050403818337908, 0.011854045678891482, -0.047657825497745145, -0.25995719229291764, 0.10015536053505193, 0.08732319840665666, 0.05671139206594577, -0.04304285585174277, -0.03149374733179537, -0.09025042392914334, 0.08248655181617529, 0.12648404874245547, -0.002598824354091419, 0.09674323133602288, -0.16377329175180244, -0.08185178386948762, 0.4114103153861511, -0.03493531265543894, -0.20126173342014814, 0.20998727828038916, -0.13446620258236502, -0.11286304562893365, 0.14104125044879415, 0.10264552654998918, 0.06883205818913636, -0.09517195954744707, 0.14794634872739534, 0.007035689681933652, 0.140676443904428, 0.003455440973817942, 0.066566463109226, 0.2090915773108962, 0.1683028528988812, 0.0486782880437996, 0.12563782289526576, -0.09717835819596544, -0.12453052706475701, -0.3037350633211674, -0.13006627835678838, -0.20749119579071, 0.020341820505094685, -0.06519738679719833, -0.1525746814898617, 0.43365548412510824, 0.17294970296244438, 0.1843713083259401, -0.04237686020262059, 0.24117318141619645, 0.13774270470058847, 0.09400194115005434, 0.013101560698311416, 0.27528310317763, 0.14576715763166337, 0.0403765358458904, -0.3452960503805849, 0.09269167364559948, 0.05015388355710574] |
1,802.02688 | Exact Semidefinite Formulations for a Class of (Random and Non-Random)
Nonconvex Quadratic Programs | We study a class of quadratically constrained quadratic programs (QCQPs),
called {\em diagonal QCQPs\/}, which contain no off-diagonal terms $x_j x_k$
for $j \ne k$, and we provide a sufficient condition on the problem data
guaranteeing that the basic Shor semidefinite relaxation is exact. Our
condition complements and refines those already present in the literature and
can be checked in polynomial time. We then extend our analysis from diagonal
QCQPs to general QCQPs, i.e., ones with no particular structure. By
reformulating a general QCQP into diagonal form, we establish new,
polynomial-time-checkable sufficient conditions for the semidefinite
relaxations of general QCQPs to be exact. Finally, these ideas are extended to
show that a class of random general QCQPs has exact semidefinite relaxations
with high probability as long as the number of constraints grows no faster than
a fixed polynomial in the number of variables. To the best of our knowledge,
this is the first result establishing the exactness of the semidefinite
relaxation for random general QCQPs.
| math.OC | we study a class of quadratically constrained quadratic programs qcqps called em diagonal qcqps which contain no offdiagonal terms x_j x_k for j ne k and we provide a sufficient condition on the problem data guaranteeing that the basic shor semidefinite relaxation is exact our condition complements and refines those already present in the literature and can be checked in polynomial time we then extend our analysis from diagonal qcqps to general qcqps ie ones with no particular structure by reformulating a general qcqp into diagonal form we establish new polynomialtimecheckable sufficient conditions for the semidefinite relaxations of general qcqps to be exact finally these ideas are extended to show that a class of random general qcqps has exact semidefinite relaxations with high probability as long as the number of constraints grows no faster than a fixed polynomial in the number of variables to the best of our knowledge this is the first result establishing the exactness of the semidefinite relaxation for random general qcqps | [['we', 'study', 'a', 'class', 'of', 'quadratically', 'constrained', 'quadratic', 'programs', 'qcqps', 'called', 'em', 'diagonal', 'qcqps', 'which', 'contain', 'no', 'offdiagonal', 'terms', 'x_j', 'x_k', 'for', 'j', 'ne', 'k', 'and', 'we', 'provide', 'a', 'sufficient', 'condition', 'on', 'the', 'problem', 'data', 'guaranteeing', 'that', 'the', 'basic', 'shor', 'semidefinite', 'relaxation', 'is', 'exact', 'our', 'condition', 'complements', 'and', 'refines', 'those', 'already', 'present', 'in', 'the', 'literature', 'and', 'can', 'be', 'checked', 'in', 'polynomial', 'time', 'we', 'then', 'extend', 'our', 'analysis', 'from', 'diagonal', 'qcqps', 'to', 'general', 'qcqps', 'ie', 'ones', 'with', 'no', 'particular', 'structure', 'by', 'reformulating', 'a', 'general', 'qcqp', 'into', 'diagonal', 'form', 'we', 'establish', 'new', 'polynomialtimecheckable', 'sufficient', 'conditions', 'for', 'the', 'semidefinite', 'relaxations', 'of', 'general', 'qcqps', 'to', 'be', 'exact', 'finally', 'these', 'ideas', 'are', 'extended', 'to', 'show', 'that', 'a', 'class', 'of', 'random', 'general', 'qcqps', 'has', 'exact', 'semidefinite', 'relaxations', 'with', 'high', 'probability', 'as', 'long', 'as', 'the', 'number', 'of', 'constraints', 'grows', 'no', 'faster', 'than', 'a', 'fixed', 'polynomial', 'in', 'the', 'number', 'of', 'variables', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'result', 'establishing', 'the', 'exactness', 'of', 'the', 'semidefinite', 'relaxation', 'for', 'random', 'general', 'qcqps']] | [-0.1295772121549107, 0.05145289757993163, -0.05195615704671094, 0.0766505578443374, -0.11818857560013761, -0.17324321425985545, 0.03214095355005844, 0.3068819091635438, -0.2956018608245181, -0.26527821579834493, 0.14876284165571943, -0.21775713556150839, -0.16321994310313062, 0.1739704348771583, -0.036471088849172766, 0.06555754026091408, 0.0406613325822258, 0.026842445392259568, -0.1416807828652786, -0.29628249808504226, 0.27595027894627805, 0.013134034258233973, 0.18541405550094192, 0.05215435604587561, 0.08707503298377027, 0.03490375148177874, 0.001453031425182594, 0.06053129016285444, -0.11846575961725449, 0.0928166968962348, 0.2779226922430098, 0.2042885646555433, 0.2957094447451598, -0.4359862329438329, -0.1412701927318533, 0.15133246399246428, 0.10726383220824617, 0.12425059160177182, -0.019172185757225832, -0.2449421823797066, 0.1411597948307001, -0.10233001506932807, -0.10705799488180386, -0.10439780457002087, 0.0025212573343263256, 0.014394710841304736, -0.3450128417451463, 0.05919623588106777, 0.12723564230212261, 0.017184395216712046, -0.04633280496885318, -0.20125920866493976, 0.036886709914031646, 0.037026566552657, 0.04095891576328474, 0.03475901476681096, 0.04555688485525912, -0.04508956711563259, -0.10771842857200947, 0.3385834310760313, -0.06395081558499752, -0.23512859224404276, 0.16048049967645145, -0.10453058954501501, -0.18876981389958683, 0.12805031389622698, 0.15369739169936356, 0.19259574532327128, -0.13986413234244272, 0.1460209790373749, -0.135404424719149, 0.13299620870455373, 0.059619182553255885, 0.042568051194837433, 0.11928178844178414, 0.08267400217975103, 0.15913208065520426, 0.17792491970453184, 0.03886503892490731, -0.11363069113931709, -0.31224062425516, -0.1432313269469887, -0.22293445244772223, 0.06609338828612392, -0.11270791084036053, -0.13705768388988473, 0.38855375114845386, 0.0976818807667303, 0.1821002658320273, 0.19796981505280156, 0.27172532687588347, 0.1430179969685879, 0.04150376914114487, 0.11613856238971759, 0.19232346510043277, 0.1495964485348384, 0.042882942209494436, -0.2061817627357569, 0.08879237349440412, 0.10317024080190672] |
1,802.02689 | Digital Data Archives as Knowledge Infrastructures: Mediating Data
Sharing and Reuse | Digital archives are the preferred means for open access to research data.
They play essential roles in knowledge infrastructures - robust networks of
people, artifacts, and institutions - but little is known about how they
mediate information exchange between stakeholders. We open the "black box" of
data archives by studying DANS, the Data Archiving and Networked Services
institute of The Netherlands, which manages 50+ years of data from the social
sciences, humanities, and other domains. Our interviews, weblogs, ethnography,
and document analyses reveal that a few large contributors provide a steady
flow of content, but most are academic researchers who submit datasets
infrequently and often restrict access to their files. Consumers are a diverse
group that overlaps minimally with contributors. Archivists devote about half
their time to aiding contributors with curation processes and half to assisting
consumers. Given the diversity and infrequency of usage, human assistance in
curation and search remains essential. DANS' knowledge infrastructure
encompasses public and private stakeholders who contribute, consume, harvest,
and serve their data - many of whom did not exist at the time the DANS
collections originated - reinforcing the need for continuous investment in
digital data archives as their communities, technologies, and services evolve.
| cs.DL | digital archives are the preferred means for open access to research data they play essential roles in knowledge infrastructures robust networks of people artifacts and institutions but little is known about how they mediate information exchange between stakeholders we open the black box of data archives by studying dans the data archiving and networked services institute of the netherlands which manages 50 years of data from the social sciences humanities and other domains our interviews weblogs ethnography and document analyses reveal that a few large contributors provide a steady flow of content but most are academic researchers who submit datasets infrequently and often restrict access to their files consumers are a diverse group that overlaps minimally with contributors archivists devote about half their time to aiding contributors with curation processes and half to assisting consumers given the diversity and infrequency of usage human assistance in curation and search remains essential dans knowledge infrastructure encompasses public and private stakeholders who contribute consume harvest and serve their data many of whom did not exist at the time the dans collections originated reinforcing the need for continuous investment in digital data archives as their communities technologies and services evolve | [['digital', 'archives', 'are', 'the', 'preferred', 'means', 'for', 'open', 'access', 'to', 'research', 'data', 'they', 'play', 'essential', 'roles', 'in', 'knowledge', 'infrastructures', 'robust', 'networks', 'of', 'people', 'artifacts', 'and', 'institutions', 'but', 'little', 'is', 'known', 'about', 'how', 'they', 'mediate', 'information', 'exchange', 'between', 'stakeholders', 'we', 'open', 'the', 'black', 'box', 'of', 'data', 'archives', 'by', 'studying', 'dans', 'the', 'data', 'archiving', 'and', 'networked', 'services', 'institute', 'of', 'the', 'netherlands', 'which', 'manages', '50', 'years', 'of', 'data', 'from', 'the', 'social', 'sciences', 'humanities', 'and', 'other', 'domains', 'our', 'interviews', 'weblogs', 'ethnography', 'and', 'document', 'analyses', 'reveal', 'that', 'a', 'few', 'large', 'contributors', 'provide', 'a', 'steady', 'flow', 'of', 'content', 'but', 'most', 'are', 'academic', 'researchers', 'who', 'submit', 'datasets', 'infrequently', 'and', 'often', 'restrict', 'access', 'to', 'their', 'files', 'consumers', 'are', 'a', 'diverse', 'group', 'that', 'overlaps', 'minimally', 'with', 'contributors', 'archivists', 'devote', 'about', 'half', 'their', 'time', 'to', 'aiding', 'contributors', 'with', 'curation', 'processes', 'and', 'half', 'to', 'assisting', 'consumers', 'given', 'the', 'diversity', 'and', 'infrequency', 'of', 'usage', 'human', 'assistance', 'in', 'curation', 'and', 'search', 'remains', 'essential', 'dans', 'knowledge', 'infrastructure', 'encompasses', 'public', 'and', 'private', 'stakeholders', 'who', 'contribute', 'consume', 'harvest', 'and', 'serve', 'their', 'data', 'many', 'of', 'whom', 'did', 'not', 'exist', 'at', 'the', 'time', 'the', 'dans', 'collections', 'originated', 'reinforcing', 'the', 'need', 'for', 'continuous', 'investment', 'in', 'digital', 'data', 'archives', 'as', 'their', 'communities', 'technologies', 'and', 'services', 'evolve']] | [-0.1167622825200016, 0.07039343734504655, -0.03864373268716379, 0.1265545485532909, -0.184492469375017, -0.15595811516441802, 0.10333042748139373, 0.3747253958801074, -0.23286012548665821, -0.38927679415792227, 0.1375934366862603, -0.3989744342540448, -0.09646411757079923, 0.1977885420783423, -0.1151502250874301, -0.03657476830816524, 0.0903231625003284, 0.009505400412902473, 0.0740229086392103, -0.3392535806771256, 0.29358206683655785, 0.07812833718062208, 0.3531756781146158, 0.04625268360868343, 0.01626897732399366, 0.003409357664260861, -0.1597598909165197, -0.10441238192867544, -0.08899342578787378, 0.16592169368321227, 0.4502159999635983, 0.2756480555126101, 0.37563977870800325, -0.4700394875788111, -0.1488483290945902, 0.10698987477594435, 0.14694696753903538, 0.05333911929505566, -0.06660702158693979, -0.3281828543023986, 0.037179768060236616, -0.20456114714509066, -0.09405210584744203, -0.09324699071799025, 0.005299657181722625, 0.04342129589913755, -0.1978286892182802, 0.015964865573885025, 0.0010341239513411205, 0.15318324947634673, -0.059060182674236746, -0.10376075909910154, -0.06671855968390297, 0.32244754593809877, 0.07390573361653321, 0.0055834154808675224, 0.17306600370247163, -0.1717089135912532, -0.12105869899185527, 0.39369009021783663, 0.05171903846571602, -0.11495922492573225, 0.21560169313024558, -0.083408419883867, -0.16106165568486844, 0.08440697391051799, 0.24607657672058106, 0.027274304330919166, -0.1974155247563078, 0.0525063404623937, 0.021607204670637693, 0.1997560510514019, 0.0816653328638866, 0.07032369497251145, 0.24337414228499923, 0.13937822643344347, 0.04024891341099164, 0.021638485964456555, 0.0391503088651415, -0.11846129734506261, -0.17695436894012215, -0.14993377336495728, -0.12015751267638419, 0.024905806907665872, -0.04636313036366007, -0.14563277852246348, 0.32498111783251243, 0.18384510727019562, 0.08057301323409477, -0.010015853124133748, 0.28651135764084756, -0.09965474144983276, 0.13467529064462502, 0.14537345101713556, 0.13760917401416417, -0.01400549844862437, 0.27817643831997196, -0.09267190833069973, 0.11803457445978206, -0.07339902591240612] |
1,802.0269 | Driver Gaze Zone Estimation using Convolutional Neural Networks: A
General Framework and Ablative Analysis | Driver gaze has been shown to be an excellent surrogate for driver attention
in intelligent vehicles. With the recent surge of highly autonomous vehicles,
driver gaze can be useful for determining the handoff time to a human driver.
While there has been significant improvement in personalized driver gaze zone
estimation systems, a generalized system which is invariant to different
subjects, perspectives and scales is still lacking. We take a step towards this
generalized system using Convolutional Neural Networks (CNNs). We finetune 4
popular CNN architectures for this task, and provide extensive comparisons of
their outputs. We additionally experiment with different input image patches,
and also examine how image size affects performance. For training and testing
the networks, we collect a large naturalistic driving dataset comprising of 11
long drives, driven by 10 subjects in two different cars. Our best performing
model achieves an accuracy of 95.18% during cross-subject testing,
outperforming current state of the art techniques for this task. Finally, we
evaluate our best performing model on the publicly available Columbia Gaze
Dataset comprising of images from 56 subjects with varying head pose and gaze
directions. Without any training, our model successfully encodes the different
gaze directions on this diverse dataset, demonstrating good generalization
capabilities.
| cs.CV | driver gaze has been shown to be an excellent surrogate for driver attention in intelligent vehicles with the recent surge of highly autonomous vehicles driver gaze can be useful for determining the handoff time to a human driver while there has been significant improvement in personalized driver gaze zone estimation systems a generalized system which is invariant to different subjects perspectives and scales is still lacking we take a step towards this generalized system using convolutional neural networks cnns we finetune 4 popular cnn architectures for this task and provide extensive comparisons of their outputs we additionally experiment with different input image patches and also examine how image size affects performance for training and testing the networks we collect a large naturalistic driving dataset comprising of 11 long drives driven by 10 subjects in two different cars our best performing model achieves an accuracy of 9518 during crosssubject testing outperforming current state of the art techniques for this task finally we evaluate our best performing model on the publicly available columbia gaze dataset comprising of images from 56 subjects with varying head pose and gaze directions without any training our model successfully encodes the different gaze directions on this diverse dataset demonstrating good generalization capabilities | [['driver', 'gaze', 'has', 'been', 'shown', 'to', 'be', 'an', 'excellent', 'surrogate', 'for', 'driver', 'attention', 'in', 'intelligent', 'vehicles', 'with', 'the', 'recent', 'surge', 'of', 'highly', 'autonomous', 'vehicles', 'driver', 'gaze', 'can', 'be', 'useful', 'for', 'determining', 'the', 'handoff', 'time', 'to', 'a', 'human', 'driver', 'while', 'there', 'has', 'been', 'significant', 'improvement', 'in', 'personalized', 'driver', 'gaze', 'zone', 'estimation', 'systems', 'a', 'generalized', 'system', 'which', 'is', 'invariant', 'to', 'different', 'subjects', 'perspectives', 'and', 'scales', 'is', 'still', 'lacking', 'we', 'take', 'a', 'step', 'towards', 'this', 'generalized', 'system', 'using', 'convolutional', 'neural', 'networks', 'cnns', 'we', 'finetune', '4', 'popular', 'cnn', 'architectures', 'for', 'this', 'task', 'and', 'provide', 'extensive', 'comparisons', 'of', 'their', 'outputs', 'we', 'additionally', 'experiment', 'with', 'different', 'input', 'image', 'patches', 'and', 'also', 'examine', 'how', 'image', 'size', 'affects', 'performance', 'for', 'training', 'and', 'testing', 'the', 'networks', 'we', 'collect', 'a', 'large', 'naturalistic', 'driving', 'dataset', 'comprising', 'of', '11', 'long', 'drives', 'driven', 'by', '10', 'subjects', 'in', 'two', 'different', 'cars', 'our', 'best', 'performing', 'model', 'achieves', 'an', 'accuracy', 'of', '9518', 'during', 'crosssubject', 'testing', 'outperforming', 'current', 'state', 'of', 'the', 'art', 'techniques', 'for', 'this', 'task', 'finally', 'we', 'evaluate', 'our', 'best', 'performing', 'model', 'on', 'the', 'publicly', 'available', 'columbia', 'gaze', 'dataset', 'comprising', 'of', 'images', 'from', '56', 'subjects', 'with', 'varying', 'head', 'pose', 'and', 'gaze', 'directions', 'without', 'any', 'training', 'our', 'model', 'successfully', 'encodes', 'the', 'different', 'gaze', 'directions', 'on', 'this', 'diverse', 'dataset', 'demonstrating', 'good', 'generalization', 'capabilities']] | [-0.07040527189725682, 0.025348652443105548, -0.04487395625762349, 0.02912913829912249, -0.09234664152266786, -0.21596459683039973, 0.02015287991540105, 0.4858952432085632, -0.21015064029808284, -0.3687819330382398, 0.06780139011971187, -0.2717611728608152, -0.16460681829816096, 0.24076424484305523, -0.1508498118294697, 0.1088868417336569, 0.17724497190802674, 0.027351500584735927, -0.02676492202034056, -0.28191108654330793, 0.2523859328962406, 0.05350629730245975, 0.3488378627904846, 0.010922749962785519, 0.16385730104886143, -0.024222945043184868, -0.029196160010007376, -0.03278345512408836, -0.05114692069051385, 0.14013663460711684, 0.3046499781445235, 0.17652140938740807, 0.328296156426636, -0.43053686537999003, -0.2303097613079373, 0.08561180951986827, 0.15740071863903865, 0.12484329035999277, -0.050755075611603244, -0.37876296323819963, 0.09365601167048547, -0.17920113595056475, -0.03278131591950489, -0.10274244113779608, 0.037545997973282674, -0.006902704253055465, -0.29483103454135834, 0.027923265884501412, 0.020896352328503887, 0.13983878249557308, -0.06807170751705474, -0.11404248362854488, 0.025312617260223144, 0.27917133774790986, 0.06121652139243487, 0.09677374355127469, 0.16084571765717484, -0.20483177850862785, -0.13542480628330297, 0.3440185474852721, -0.021281496369720473, -0.20050875596237294, 0.1999941275662779, -0.04931016309716392, -0.15090049761940963, 0.0765937293099163, 0.2375641261996683, 0.09429475047377933, -0.15948452958471926, -0.04860003935726697, -0.048218327300513494, 0.20681573599622602, 0.037868061473857906, -0.04367661464493722, 0.18474585819343453, 0.2989768865518272, 0.024366051612613612, 0.13649097724484427, -0.15891737475598633, -0.060480180652994736, -0.188112577418888, -0.1036774142298336, -0.15132600028643056, -0.027540283181759363, -0.10092410150372969, -0.08230610181250514, 0.4483508575826372, 0.2645165260068561, 0.18252424933198913, 0.0914939791112499, 0.34332063477731756, 0.013250696221161085, 0.09575554378691367, 0.08290410519739631, 0.1992162877982528, -0.04722730167935986, 0.141101821959441, -0.1741383800319597, 0.10194459902270989, 0.0006919465509674731] |
1,802.02691 | A Bayesian Approach to Multi-State Hidden Markov Models: Application to
Dementia Progression | People are living longer than ever before, and with this arises new
complications and challenges for humanity. Among the most pressing of these
challenges is of understanding the role of aging in the development of
dementia. This paper is motivated by the Mayo Clinic Study of Aging data for
4742 subjects since 2004, and how it can be used to draw inference on the role
of aging in the development of dementia. We construct a hidden Markov model
(HMM) to represent progression of dementia from states associated with the
buildup of amyloid plaque in the brain, and the loss of cortical thickness. A
hierarchical Bayesian approach is taken to estimate the parameters of the HMM
with a truly time-inhomogeneous infinitesimal generator matrix, and response
functions of the continuous-valued biomarker measurements are cut-point
agnostic. A Bayesian approach with these features could be useful in many
disease progression models. Additionally, an approach is illustrated for
correcting a common bias in delayed enrollment studies, in which some or all
subjects are not observed at baseline. Standard software is incapable of
accounting for this critical feature, so code to perform the estimation of the
model described below is made available online.
| stat.ME | people are living longer than ever before and with this arises new complications and challenges for humanity among the most pressing of these challenges is of understanding the role of aging in the development of dementia this paper is motivated by the mayo clinic study of aging data for 4742 subjects since 2004 and how it can be used to draw inference on the role of aging in the development of dementia we construct a hidden markov model hmm to represent progression of dementia from states associated with the buildup of amyloid plaque in the brain and the loss of cortical thickness a hierarchical bayesian approach is taken to estimate the parameters of the hmm with a truly timeinhomogeneous infinitesimal generator matrix and response functions of the continuousvalued biomarker measurements are cutpoint agnostic a bayesian approach with these features could be useful in many disease progression models additionally an approach is illustrated for correcting a common bias in delayed enrollment studies in which some or all subjects are not observed at baseline standard software is incapable of accounting for this critical feature so code to perform the estimation of the model described below is made available online | [['people', 'are', 'living', 'longer', 'than', 'ever', 'before', 'and', 'with', 'this', 'arises', 'new', 'complications', 'and', 'challenges', 'for', 'humanity', 'among', 'the', 'most', 'pressing', 'of', 'these', 'challenges', 'is', 'of', 'understanding', 'the', 'role', 'of', 'aging', 'in', 'the', 'development', 'of', 'dementia', 'this', 'paper', 'is', 'motivated', 'by', 'the', 'mayo', 'clinic', 'study', 'of', 'aging', 'data', 'for', '4742', 'subjects', 'since', '2004', 'and', 'how', 'it', 'can', 'be', 'used', 'to', 'draw', 'inference', 'on', 'the', 'role', 'of', 'aging', 'in', 'the', 'development', 'of', 'dementia', 'we', 'construct', 'a', 'hidden', 'markov', 'model', 'hmm', 'to', 'represent', 'progression', 'of', 'dementia', 'from', 'states', 'associated', 'with', 'the', 'buildup', 'of', 'amyloid', 'plaque', 'in', 'the', 'brain', 'and', 'the', 'loss', 'of', 'cortical', 'thickness', 'a', 'hierarchical', 'bayesian', 'approach', 'is', 'taken', 'to', 'estimate', 'the', 'parameters', 'of', 'the', 'hmm', 'with', 'a', 'truly', 'timeinhomogeneous', 'infinitesimal', 'generator', 'matrix', 'and', 'response', 'functions', 'of', 'the', 'continuousvalued', 'biomarker', 'measurements', 'are', 'cutpoint', 'agnostic', 'a', 'bayesian', 'approach', 'with', 'these', 'features', 'could', 'be', 'useful', 'in', 'many', 'disease', 'progression', 'models', 'additionally', 'an', 'approach', 'is', 'illustrated', 'for', 'correcting', 'a', 'common', 'bias', 'in', 'delayed', 'enrollment', 'studies', 'in', 'which', 'some', 'or', 'all', 'subjects', 'are', 'not', 'observed', 'at', 'baseline', 'standard', 'software', 'is', 'incapable', 'of', 'accounting', 'for', 'this', 'critical', 'feature', 'so', 'code', 'to', 'perform', 'the', 'estimation', 'of', 'the', 'model', 'described', 'below', 'is', 'made', 'available', 'online']] | [-0.03318678414824934, 0.10285974030217764, -0.0754950950879528, 0.08839829360976399, -0.07832358219911377, -0.1536931614958809, 0.008745952647032812, 0.39279287613379926, -0.24986386328739432, -0.30733361316911006, 0.14401749423515942, -0.2686677787282745, -0.19893686789197867, 0.19208003914215352, -0.12384088703568287, 0.055184318575899345, 0.0771029265355177, 0.03741670589005282, -0.005155784251974414, -0.2444700993583325, 0.28589722820023444, 0.06234730811089958, 0.2767511068365825, 0.009877567954815281, 0.0799260473784135, -0.010084381972340309, -0.0606940375076049, -0.025528107507409633, -0.08456704871336632, 0.14281554938723015, 0.3320682724085697, 0.17818220263715775, 0.33939870469139766, -0.4297474775236421, -0.2546507325968918, 0.11041966670424427, 0.12215769809060896, 0.11099137718668728, -0.017556075545956812, -0.2865489225097114, 0.07289317730568387, -0.15229511130033865, -0.1028785692908456, -0.04029665969851129, -0.003274480144488554, -0.021971533702554058, -0.2782911505611604, 0.11754183996135492, 0.03655721616859165, 0.1159098081876935, -0.052598465932533145, -0.1070568836430031, 0.011288730022828403, 0.18045561476657876, 0.09641113715437785, 0.024813415629193564, 0.13890905441659582, -0.16500698282090276, -0.12583045731091796, 0.33773046440895776, 0.0056228283753584326, -0.1641016120426735, 0.1781572108286986, -0.1001935276666155, -0.16368472188484245, 0.11266419936803543, 0.1793701587715257, 0.07023957371342393, -0.20482263131643916, 0.0026757668791032104, 0.022795112278823016, 0.17091229104621308, 0.0091537980830798, -0.02206066697729553, 0.19800312643123763, 0.2529795153425808, -0.02938169336004353, 0.11260210010601293, -0.07587421396044013, -0.07974850163951062, -0.2784675957143382, -0.15813725820132696, -0.13578959052400133, 0.023452912906771598, -0.07665248277328547, -0.18481249563622898, 0.39643130919938613, 0.19370641898562385, 0.17208056778855016, 0.043898936998699484, 0.24750774641205714, 0.059227085834827636, 0.1013692425289735, 0.03843480398462433, 0.18794431146497242, 0.08612562092756829, 0.07414192037637993, -0.19106763091794013, 0.1818244415098981, -0.015824245229874013] |
1,802.02692 | Longitudinal structure of the photospheric magnetic field in the
Carrington system | The observations of the Sun have been performed over the years, even
centuries- Whether are there active longitudes? If yes how stable are they? One
of the first The Wilcox Solar Observatory data taken over three cycles N 21, N
22, N 23 have been used to reveal the longitudinal structure of the
photospheric magnetic field. Mean over three cycles magnetic field distribution
has been calculated in the North and in the South hemispheres as well as at 30
levels of latitude from -75 to 75 degrees. This study was performed using
observations of the magnetic field taking into account its polarity or only
intensity. The longitudinal structure of the magnetic field was calculated in
the coordinate system rotating with Carrington rate. These structures were
compared with a model of random longitudinal distribution of the magnetic
field. Random character of the longitudinal structure was refused. The results
agree with the presence of two active meridians seen in different phenomena of
solar activity at longitudes separated by 150-170 degrees in the Carrington
coordinate system.
| astro-ph.SR physics.geo-ph physics.plasm-ph | the observations of the sun have been performed over the years even centuries whether are there active longitudes if yes how stable are they one of the first the wilcox solar observatory data taken over three cycles n 21 n 22 n 23 have been used to reveal the longitudinal structure of the photospheric magnetic field mean over three cycles magnetic field distribution has been calculated in the north and in the south hemispheres as well as at 30 levels of latitude from 75 to 75 degrees this study was performed using observations of the magnetic field taking into account its polarity or only intensity the longitudinal structure of the magnetic field was calculated in the coordinate system rotating with carrington rate these structures were compared with a model of random longitudinal distribution of the magnetic field random character of the longitudinal structure was refused the results agree with the presence of two active meridians seen in different phenomena of solar activity at longitudes separated by 150170 degrees in the carrington coordinate system | [['the', 'observations', 'of', 'the', 'sun', 'have', 'been', 'performed', 'over', 'the', 'years', 'even', 'centuries', 'whether', 'are', 'there', 'active', 'longitudes', 'if', 'yes', 'how', 'stable', 'are', 'they', 'one', 'of', 'the', 'first', 'the', 'wilcox', 'solar', 'observatory', 'data', 'taken', 'over', 'three', 'cycles', 'n', '21', 'n', '22', 'n', '23', 'have', 'been', 'used', 'to', 'reveal', 'the', 'longitudinal', 'structure', 'of', 'the', 'photospheric', 'magnetic', 'field', 'mean', 'over', 'three', 'cycles', 'magnetic', 'field', 'distribution', 'has', 'been', 'calculated', 'in', 'the', 'north', 'and', 'in', 'the', 'south', 'hemispheres', 'as', 'well', 'as', 'at', '30', 'levels', 'of', 'latitude', 'from', '75', 'to', '75', 'degrees', 'this', 'study', 'was', 'performed', 'using', 'observations', 'of', 'the', 'magnetic', 'field', 'taking', 'into', 'account', 'its', 'polarity', 'or', 'only', 'intensity', 'the', 'longitudinal', 'structure', 'of', 'the', 'magnetic', 'field', 'was', 'calculated', 'in', 'the', 'coordinate', 'system', 'rotating', 'with', 'carrington', 'rate', 'these', 'structures', 'were', 'compared', 'with', 'a', 'model', 'of', 'random', 'longitudinal', 'distribution', 'of', 'the', 'magnetic', 'field', 'random', 'character', 'of', 'the', 'longitudinal', 'structure', 'was', 'refused', 'the', 'results', 'agree', 'with', 'the', 'presence', 'of', 'two', 'active', 'meridians', 'seen', 'in', 'different', 'phenomena', 'of', 'solar', 'activity', 'at', 'longitudes', 'separated', 'by', '150170', 'degrees', 'in', 'the', 'carrington', 'coordinate', 'system']] | [-0.16019637149292976, 0.1900132850521829, -0.03826561879861063, 0.04363886234391112, -0.007603166320328709, -0.05526381467068351, -0.007645952881470886, 0.40157087500272104, -0.21557946390672694, -0.3800068040984834, 0.09786129315575953, -0.2699273174282077, -0.09129605100078639, 0.19019565239635317, 0.021518197573916337, -0.03406197346407151, 0.020175799085801943, 0.07614128907119076, -0.018857865761505267, -0.2679532269107873, 0.22450270826473487, 0.06648771749636115, 0.2556764054028209, -0.038802076164270255, 0.09967748331092839, -0.02611389002210439, -0.03493782737140739, 0.07664790803155061, -0.04765111040919586, 0.02523180081639006, 0.19954705526267158, 0.09309513714072447, 0.22850676096277311, -0.4498841101195403, -0.20825719424025263, 0.03829489242242173, 0.13744929818934654, 0.04566903474069266, 0.005203441010116664, -0.26390219323315417, 0.059094074079333696, -0.11328419722714136, -0.14578257257939142, 0.015168105966146213, 0.049258569884249336, 0.0328277665566718, -0.22714475394723407, 0.06437299768765305, 0.020289286240112295, 0.21653474179139837, -0.1203804591671986, -0.16108189219592658, -0.06858262021045829, 0.18336655609011868, 0.11311713696882497, 0.08823498711125319, 0.12856654111203888, -0.06811960433680174, -0.12358215274722424, 0.347918326944129, -0.07618568304568789, -0.08719524726011725, 0.14193911358800737, -0.2633133589122228, -0.1217605832119494, 0.19692407480744256, 0.17538151586276673, 0.12371780864114679, -0.1232387339164974, 0.0642464861519456, -0.05920378981580481, 0.13447190486273708, 0.09607913683515129, -0.013391837539952682, 0.25966824877595657, 0.10075324511718611, 0.004125350276766302, 0.10017062876465578, -0.23663216216630453, -0.11133473805763737, -0.213478578248489, -0.09015591256252793, -0.10193741537879633, 0.06251420128852302, -0.07876255975074749, -0.12025213675833372, 0.44020552459974277, 0.12108909995833189, 0.20023895647420092, -0.04117244696461184, 0.2564784958742039, 0.04889969386804719, 0.10631323483675112, 0.11129764451775266, 0.3137277679647817, 0.19848415836134145, 0.16126843934220825, -0.19086759499420392, 0.055716941005896865, 0.023341744076893774] |
1,802.02693 | Gamification: a Game Changer for Managing Technical Debt? A Design Study | Context: Technical debt management is challenging for software engineers due
to poor tool support and a lack of knowledge on how to prioritize technical
debt repayment and prevention activities. Furthermore, when there is a large
backlog of debt, developers often lack the motivation to address it. Objective:
In this paper, we describe a design study to investigate how gamification can
support Technical Debt Management in a large legacy software system of an
industrial company. Our study leads to a novel tool (named Themis) that
combines technical debt support, version control, and gamification features. In
addition to gamification features, Themis provides suggestions for developers
on where to focus their effort, and visualizations for managers to track
technical debt activities. Method: We describe how Themis was refined and
validated in an iterative deployment with the company, finally conducting a
qualitative study to investigate how the features of Themis affect technical
debt management behavior. We consider the impact on both developers and
managers. Results: Our results show that it achieves increased developer
motivation, and supports managers in monitoring and influencing developer
behaviors. We show how our findings may be transferable to other contexts by
proposing guidelines on how to apply gamification. Conclusions: With this case,
gamification appears as a promising solution to help technical debt management,
although it needs to be carefully designed and implemented to avoid its
possible negative effects.
| cs.SE | context technical debt management is challenging for software engineers due to poor tool support and a lack of knowledge on how to prioritize technical debt repayment and prevention activities furthermore when there is a large backlog of debt developers often lack the motivation to address it objective in this paper we describe a design study to investigate how gamification can support technical debt management in a large legacy software system of an industrial company our study leads to a novel tool named themis that combines technical debt support version control and gamification features in addition to gamification features themis provides suggestions for developers on where to focus their effort and visualizations for managers to track technical debt activities method we describe how themis was refined and validated in an iterative deployment with the company finally conducting a qualitative study to investigate how the features of themis affect technical debt management behavior we consider the impact on both developers and managers results our results show that it achieves increased developer motivation and supports managers in monitoring and influencing developer behaviors we show how our findings may be transferable to other contexts by proposing guidelines on how to apply gamification conclusions with this case gamification appears as a promising solution to help technical debt management although it needs to be carefully designed and implemented to avoid its possible negative effects | [['context', 'technical', 'debt', 'management', 'is', 'challenging', 'for', 'software', 'engineers', 'due', 'to', 'poor', 'tool', 'support', 'and', 'a', 'lack', 'of', 'knowledge', 'on', 'how', 'to', 'prioritize', 'technical', 'debt', 'repayment', 'and', 'prevention', 'activities', 'furthermore', 'when', 'there', 'is', 'a', 'large', 'backlog', 'of', 'debt', 'developers', 'often', 'lack', 'the', 'motivation', 'to', 'address', 'it', 'objective', 'in', 'this', 'paper', 'we', 'describe', 'a', 'design', 'study', 'to', 'investigate', 'how', 'gamification', 'can', 'support', 'technical', 'debt', 'management', 'in', 'a', 'large', 'legacy', 'software', 'system', 'of', 'an', 'industrial', 'company', 'our', 'study', 'leads', 'to', 'a', 'novel', 'tool', 'named', 'themis', 'that', 'combines', 'technical', 'debt', 'support', 'version', 'control', 'and', 'gamification', 'features', 'in', 'addition', 'to', 'gamification', 'features', 'themis', 'provides', 'suggestions', 'for', 'developers', 'on', 'where', 'to', 'focus', 'their', 'effort', 'and', 'visualizations', 'for', 'managers', 'to', 'track', 'technical', 'debt', 'activities', 'method', 'we', 'describe', 'how', 'themis', 'was', 'refined', 'and', 'validated', 'in', 'an', 'iterative', 'deployment', 'with', 'the', 'company', 'finally', 'conducting', 'a', 'qualitative', 'study', 'to', 'investigate', 'how', 'the', 'features', 'of', 'themis', 'affect', 'technical', 'debt', 'management', 'behavior', 'we', 'consider', 'the', 'impact', 'on', 'both', 'developers', 'and', 'managers', 'results', 'our', 'results', 'show', 'that', 'it', 'achieves', 'increased', 'developer', 'motivation', 'and', 'supports', 'managers', 'in', 'monitoring', 'and', 'influencing', 'developer', 'behaviors', 'we', 'show', 'how', 'our', 'findings', 'may', 'be', 'transferable', 'to', 'other', 'contexts', 'by', 'proposing', 'guidelines', 'on', 'how', 'to', 'apply', 'gamification', 'conclusions', 'with', 'this', 'case', 'gamification', 'appears', 'as', 'a', 'promising', 'solution', 'to', 'help', 'technical', 'debt', 'management', 'although', 'it', 'needs', 'to', 'be', 'carefully', 'designed', 'and', 'implemented', 'to', 'avoid', 'its', 'possible', 'negative', 'effects']] | [-0.06519629162664244, -0.0041233335442691955, -0.10354631001067455, 0.10284341327726572, -0.1803901403378532, -0.16647988624396948, 0.10881881453321528, 0.40700969760093775, -0.22989752298841873, -0.31981197826507124, 0.1554595028482206, -0.26877207913141893, -0.1947423487384967, 0.18460068588038875, -0.2161389634313405, 0.027174388850669442, 0.09684866625946342, -0.06524306918155369, 0.047304074902010475, -0.2865398827717607, 0.3170838601981175, 0.11266590903202693, 0.3326728096642335, 0.1451419133347308, 0.012478169751774291, -0.04721404165499272, -0.06718111574229081, -0.02951037898872113, -0.13304303241589846, 0.1596777177285076, 0.37959107898355443, 0.235322266588347, 0.41510237353902896, -0.4393847469207749, -0.13564790360396728, 0.0346147827456885, 0.09962221708025154, 0.0372733518587458, -0.03783860953786133, -0.28524151297639483, 0.0878307454026582, -0.24793972213764823, -0.19769337479629667, -0.14318662444151287, -0.022231929395306986, 0.008815213333020853, -0.25385257253717436, -0.08451486572933693, 0.02563958110802464, 0.08221244634325175, -0.05684718666363328, -0.11365235831819295, 0.009418970882778236, 0.22014444220666632, 0.13804760226405943, -0.005626114041405616, 0.16905626954036979, -0.11866647217283842, -0.1351953041658067, 0.38945981235909194, -0.00929157452462772, -0.1738216649177239, 0.19837579581418827, -0.037840473828142866, -0.19829616506518633, 0.04966504518080527, 0.25025396937097977, 0.014070356453630027, -0.1910586100097326, -0.009458201633319013, 0.03848414714785146, 0.21473520091303885, 0.02591486873713796, -0.03182029497826047, 0.19448065204268092, 0.21672471754841113, 0.07110827778115779, 0.16032355902394843, 0.004129389345874651, -0.09643252032605744, -0.23598102496307866, -0.17711332031084517, -0.08815715785583547, 0.024552066786941794, -0.030773335344220915, -0.1657671493257543, 0.3856922101572548, 0.2640255126931598, 0.09018637825073184, 0.029407007489026638, 0.321113353296951, 0.009041591946713692, 0.078315999629507, 0.083413915855712, 0.15599762301753162, -0.029986096309138496, 0.19819802110795168, -0.21598592019852317, 0.15957310569795305, -0.046805759565087784] |
1,802.02694 | Monotone Operator Theory in Convex Optimization | Several aspects of the interplay between monotone operator theory and convex
optimization are presented. The crucial role played by monotone operators in
the analysis and the numerical solution of convex minimization problems is
emphasized. We review the properties of subdifferentials as maximally monotone
operators and, in tandem, investigate those of proximity operators as
resolvents. In particular, we study new transformations which map proximity
operators to proximity operators, and establish connections with self-dual
classes of firmly nonexpansive operators. In addition, new insights and
developments are proposed on the algorithmic front.
| math.OC | several aspects of the interplay between monotone operator theory and convex optimization are presented the crucial role played by monotone operators in the analysis and the numerical solution of convex minimization problems is emphasized we review the properties of subdifferentials as maximally monotone operators and in tandem investigate those of proximity operators as resolvents in particular we study new transformations which map proximity operators to proximity operators and establish connections with selfdual classes of firmly nonexpansive operators in addition new insights and developments are proposed on the algorithmic front | [['several', 'aspects', 'of', 'the', 'interplay', 'between', 'monotone', 'operator', 'theory', 'and', 'convex', 'optimization', 'are', 'presented', 'the', 'crucial', 'role', 'played', 'by', 'monotone', 'operators', 'in', 'the', 'analysis', 'and', 'the', 'numerical', 'solution', 'of', 'convex', 'minimization', 'problems', 'is', 'emphasized', 'we', 'review', 'the', 'properties', 'of', 'subdifferentials', 'as', 'maximally', 'monotone', 'operators', 'and', 'in', 'tandem', 'investigate', 'those', 'of', 'proximity', 'operators', 'as', 'resolvents', 'in', 'particular', 'we', 'study', 'new', 'transformations', 'which', 'map', 'proximity', 'operators', 'to', 'proximity', 'operators', 'and', 'establish', 'connections', 'with', 'selfdual', 'classes', 'of', 'firmly', 'nonexpansive', 'operators', 'in', 'addition', 'new', 'insights', 'and', 'developments', 'are', 'proposed', 'on', 'the', 'algorithmic', 'front']] | [-0.12442718772217631, 0.0647212185405111, -0.02712411212661628, 0.12314060447198663, -0.056956130822890264, -0.11103318253887838, 0.03901176730542329, 0.35639950254241404, -0.2986292154580522, -0.22085658893031015, 0.16051314782162898, -0.34414496264430916, -0.24407282157727841, 0.17456741397153963, -0.09006407296054819, 0.09457236149588998, 0.047125814775570055, -0.0318286967662613, -0.18055190753945138, -0.1982518772469059, 0.416969085426143, 0.010681618423609252, 0.23749502255382499, 0.11538061996118434, 0.06470980267092753, 0.014212738157490665, -0.08788408263026622, 0.009008107026725004, -0.11622655454478907, 0.17102955730652877, 0.29607741350538275, 0.1320058965553226, 0.3157067595447382, -0.4584166578571783, -0.16956194837609034, 0.1422678486266163, 0.11504691587028544, -0.026896721334196627, -0.08000028310892998, -0.29495736422917146, 0.015278795524761917, -0.09745801281016529, -0.12650032408386364, -0.13205103072850558, 0.0002689153594331125, 0.08149103475786913, -0.2675799648597931, 0.006980238210284308, 0.09555651905574951, 0.06282843575614054, -0.08203127142041922, -0.11087821932572327, -0.010967306227663929, 0.10534469384616346, 0.05597991624773804, 0.026269235708384533, 0.10357245252980443, -0.07971011705989584, -0.16416365558051327, 0.29831896185498225, -0.01577739448945844, -0.2315525094863404, 0.1775886720004544, -0.1186188138717932, -0.14391625477942857, 0.006821801341818959, 0.20299186840067418, 0.1915467968315221, -0.2045047399012393, 0.14816482858719263, -0.058282736301673264, 0.05325849085857862, 0.05180132308493504, 0.13126555017687463, 0.1450043836362618, 0.11981685917688471, 0.1534796114801691, 0.17905815560998542, 0.05866836847768824, -0.18835417262351747, -0.3490805702932765, -0.11840972855812713, -0.08272911123198907, -0.030110939953926157, -0.09128916872455346, -0.15360808273609938, 0.40389621093492495, 0.11566893671628799, 0.16318651603723175, 0.03712254446235307, 0.19964411402686258, 0.13726098527556307, 0.06155477660273861, 0.04721285448817725, 0.23303642736883898, 0.24914319315150882, 0.06302394519633289, -0.23183141628363996, 0.01962620256798279, 0.22585219214147145] |
1,802.02695 | The physics of climate change: simple models in climate science | There is a perception that climate science can only be approached with
complex computer simulations. But working climate scientists often use simple
models to understand their simulations and make order-of-magnitude estimates.
This article presents some of these simple models with the goal of making
climate science more accessible and comprehensible.
| physics.ao-ph | there is a perception that climate science can only be approached with complex computer simulations but working climate scientists often use simple models to understand their simulations and make orderofmagnitude estimates this article presents some of these simple models with the goal of making climate science more accessible and comprehensible | [['there', 'is', 'a', 'perception', 'that', 'climate', 'science', 'can', 'only', 'be', 'approached', 'with', 'complex', 'computer', 'simulations', 'but', 'working', 'climate', 'scientists', 'often', 'use', 'simple', 'models', 'to', 'understand', 'their', 'simulations', 'and', 'make', 'orderofmagnitude', 'estimates', 'this', 'article', 'presents', 'some', 'of', 'these', 'simple', 'models', 'with', 'the', 'goal', 'of', 'making', 'climate', 'science', 'more', 'accessible', 'and', 'comprehensible']] | [-0.054446229266468436, 0.12148266151547432, -0.1072106693079695, 0.10746663473546506, -0.170380835570395, -0.16519011300988495, 0.022372003318741916, 0.43812435269355776, -0.23604549121111632, -0.38014906369149687, 0.14739696012809872, -0.21080219456460328, -0.25191349010914565, 0.26186162542551755, -0.12140004325658083, 0.024503160184249282, 0.1368810380809009, 0.003540856558829546, -0.033258657450787724, -0.26846665861085056, 0.21238788206130266, 0.12757118130102754, 0.19427858214825391, 0.01818944413214922, 0.018110653031617404, -0.08255777151323855, -0.10917185867205262, 0.012034686133265495, -0.1816870009394188, 0.21230576580390334, 0.3997685637018003, 0.21039963353425264, 0.3524217485636473, -0.4880508089438081, -0.2608555655181408, 0.11779733374714851, 0.08740264815976843, 0.10455978941172361, -0.025587076793017333, -0.24292720874771476, -0.009967151889577508, -0.20492211863398552, -0.1296392479352653, -0.16054757549805798, -0.004790701055899262, -0.0484194615110755, -0.21282796936109663, -0.0012390996795147657, 0.028903617414907785, 0.18818891389295458, -0.013427343158982695, -0.09078727934509516, -0.015482175005599856, 0.17141619164031, 0.04767411734443158, 0.019472984364256263, 0.1391923299897462, -0.18445365741383285, -0.09455809511244297, 0.45072378680109976, 0.040054520927369594, -0.175965045474004, 0.33197401151061057, -0.14610744902864098, -0.1149172416701913, 0.04874847941100598, 0.15977654967457056, 0.05073766335844994, -0.17074378104880453, 0.016372966000344606, -0.01694282565265894, 0.21883751854300498, 0.006050888961181044, -0.08391294240020215, 0.2864106504840311, 0.22481115393340587, 0.042857233975082634, 0.02783277597045526, 0.017786433678120373, -0.14841976890340447, -0.22108681252226234, -0.09908831875771285, -0.13866374333854764, 0.08776557525619864, -0.04457950511889067, -0.1618451665341854, 0.3742614552937448, 0.3000553209986538, 0.12455608930438757, 0.046604659057338724, 0.3293026727437973, 0.0655956348311156, 0.030690974560566246, 0.07626804946921766, 0.2170488582114922, 0.055280281361192465, 0.14976381354033946, -0.09965441655367613, 0.13391552845016122, -0.044386473186314106] |
1,802.02696 | Improving the Universality and Learnability of Neural
Programmer-Interpreters with Combinator Abstraction | To overcome the limitations of Neural Programmer-Interpreters (NPI) in its
universality and learnability, we propose the incorporation of combinator
abstraction into neural programing and a new NPI architecture to support this
abstraction, which we call Combinatory Neural Programmer-Interpreter (CNPI).
Combinator abstraction dramatically reduces the number and complexity of
programs that need to be interpreted by the core controller of CNPI, while
still allowing the CNPI to represent and interpret arbitrary complex programs
by the collaboration of the core with the other components. We propose a small
set of four combinators to capture the most pervasive programming patterns. Due
to the finiteness and simplicity of this combinator set and the offloading of
some burden of interpretation from the core, we are able construct a CNPI that
is universal with respect to the set of all combinatorizable programs, which is
adequate for solving most algorithmic tasks. Moreover, besides supervised
training on execution traces, CNPI can be trained by policy gradient
reinforcement learning with appropriately designed curricula.
| cs.LG | to overcome the limitations of neural programmerinterpreters npi in its universality and learnability we propose the incorporation of combinator abstraction into neural programing and a new npi architecture to support this abstraction which we call combinatory neural programmerinterpreter cnpi combinator abstraction dramatically reduces the number and complexity of programs that need to be interpreted by the core controller of cnpi while still allowing the cnpi to represent and interpret arbitrary complex programs by the collaboration of the core with the other components we propose a small set of four combinators to capture the most pervasive programming patterns due to the finiteness and simplicity of this combinator set and the offloading of some burden of interpretation from the core we are able construct a cnpi that is universal with respect to the set of all combinatorizable programs which is adequate for solving most algorithmic tasks moreover besides supervised training on execution traces cnpi can be trained by policy gradient reinforcement learning with appropriately designed curricula | [['to', 'overcome', 'the', 'limitations', 'of', 'neural', 'programmerinterpreters', 'npi', 'in', 'its', 'universality', 'and', 'learnability', 'we', 'propose', 'the', 'incorporation', 'of', 'combinator', 'abstraction', 'into', 'neural', 'programing', 'and', 'a', 'new', 'npi', 'architecture', 'to', 'support', 'this', 'abstraction', 'which', 'we', 'call', 'combinatory', 'neural', 'programmerinterpreter', 'cnpi', 'combinator', 'abstraction', 'dramatically', 'reduces', 'the', 'number', 'and', 'complexity', 'of', 'programs', 'that', 'need', 'to', 'be', 'interpreted', 'by', 'the', 'core', 'controller', 'of', 'cnpi', 'while', 'still', 'allowing', 'the', 'cnpi', 'to', 'represent', 'and', 'interpret', 'arbitrary', 'complex', 'programs', 'by', 'the', 'collaboration', 'of', 'the', 'core', 'with', 'the', 'other', 'components', 'we', 'propose', 'a', 'small', 'set', 'of', 'four', 'combinators', 'to', 'capture', 'the', 'most', 'pervasive', 'programming', 'patterns', 'due', 'to', 'the', 'finiteness', 'and', 'simplicity', 'of', 'this', 'combinator', 'set', 'and', 'the', 'offloading', 'of', 'some', 'burden', 'of', 'interpretation', 'from', 'the', 'core', 'we', 'are', 'able', 'construct', 'a', 'cnpi', 'that', 'is', 'universal', 'with', 'respect', 'to', 'the', 'set', 'of', 'all', 'combinatorizable', 'programs', 'which', 'is', 'adequate', 'for', 'solving', 'most', 'algorithmic', 'tasks', 'moreover', 'besides', 'supervised', 'training', 'on', 'execution', 'traces', 'cnpi', 'can', 'be', 'trained', 'by', 'policy', 'gradient', 'reinforcement', 'learning', 'with', 'appropriately', 'designed', 'curricula']] | [-0.07412665916382577, 0.039613067735860374, -0.06996641694467491, 0.06808738577191109, -0.16284259648729163, -0.16357276273638377, 0.08231598844199821, 0.3661793045481138, -0.3203520552200599, -0.3322709902224884, 0.08721481011763652, -0.21446716340968708, -0.14795878664360462, 0.1563039130738212, -0.1151396440928457, 0.07900008753072874, 0.08423357674159271, 0.021849203274159887, -0.03666829526637117, -0.24685432897294285, 0.3404804863722673, 0.026928415181356722, 0.24359284751236698, 0.03769288709916083, 0.1091452309758299, -0.03352800925279519, 0.008342370218424886, 0.030199240701255837, -0.02413888435775233, 0.20627923365100287, 0.3283331277147855, 0.265831186749432, 0.3151942674346544, -0.4436929398388774, -0.14653666757254136, 0.09204885516355941, 0.11751629688552823, 0.0924697808208473, 0.013989942506915763, -0.2927472109009546, 0.13278740210987536, -0.1891732247500324, -0.024381470806137832, -0.13779840125259657, -0.007464756483476563, -0.0034684283765935467, -0.25278097495183716, -0.05737902441659919, 0.10078611632415244, 0.041285257065024825, -0.04593944960966545, -0.12250889089521895, -0.02065027578889082, 0.11827745651653795, 0.002028811769703702, 0.04624488071343045, 0.12589996708212076, -0.14683702437316332, -0.14636453068642705, 0.36593979560298684, -0.011266624502532966, -0.19735552309609858, 0.22042872722333953, -0.03702118220727569, -0.16321723606081012, 0.11687235312355268, 0.1981589463287907, 0.06956648118334052, -0.1630276914148442, 0.08179977301861746, -0.005521730298498347, 0.19532442897167288, 0.057379850988379784, 0.0028536756656615545, 0.16457785973339745, 0.2146326602187962, 0.05562162273817654, 0.17201646923031486, -0.026039503366732396, -0.09342007803799654, -0.2727409506354619, -0.15389072526545253, -0.10974612771490312, -0.017453628375171972, -0.07968228296207891, -0.16463630823964645, 0.37552360507349175, 0.20867942622287866, 0.194082928913427, 0.17170195568519656, 0.30976495144451843, 0.10342433288351009, 0.1670920404887264, 0.11809356960634712, 0.13995653468871885, 0.07573806262218657, 0.11825719876875986, -0.22567640682883608, 0.13262466325735053, 0.06589161403646784] |
1,802.02697 | 3D Meteoroid Trajectories | Meteoroid modelling of fireball data typically uses a one dimensional model
along a straight line triangulated trajectory. The assumption of a straight
line trajectory has been considered an acceptable simplification for fireballs,
but it has not been rigorously tested. The unique capability of the Desert
Fireball Network (DFN) to triangulate discrete observation times gives the
opportunity to investigate the deviation of a meteoroid's position to different
model fits.
Here we assess the viability of a straight line assumption for fireball data
in two meteorite-dropping test cases observed by the Desert Fireball Network
(DFN) in Australia -- one over 21 seconds (\textit{DN151212\_03}), one under 5
seconds (\textit{DN160410\_03}). We show that a straight line is not valid for
these two meteorite dropping events and propose a three dimensional particle
filter to model meteoroid positions without any straight line constraints. The
single body equations in three dimensions, along with the luminosity equation,
are applied to the particle filter methodology described by \citet{Sansom2017}.
Modelling fireball camera network data in three dimensions has not previously
been attempted.
This allows the raw astrometric, line-of-sight observations to be
incorporated directly.
In analysing these two DFN events, the triangulated positions based on a
straight line assumption result in the modelled meteoroid positions diverging
up to $3.09\, km$ from the calculated observed point (for
\textit{DN151212\_03}). Even for the more typical fireball event,
\textit{DN160410\_03}, we see a divergence of up to $360$\,m.
As DFN observations are typically precise to $<100$\,m, it is apparent that
the assumption of a straight line is an oversimplification that will affect
orbit calculations and meteorite search regions for a significant fraction of
events.
| astro-ph.EP | meteoroid modelling of fireball data typically uses a one dimensional model along a straight line triangulated trajectory the assumption of a straight line trajectory has been considered an acceptable simplification for fireballs but it has not been rigorously tested the unique capability of the desert fireball network dfn to triangulate discrete observation times gives the opportunity to investigate the deviation of a meteoroids position to different model fits here we assess the viability of a straight line assumption for fireball data in two meteoritedropping test cases observed by the desert fireball network dfn in australia one over 21 seconds textitdn151212_03 one under 5 seconds textitdn160410_03 we show that a straight line is not valid for these two meteorite dropping events and propose a three dimensional particle filter to model meteoroid positions without any straight line constraints the single body equations in three dimensions along with the luminosity equation are applied to the particle filter methodology described by citetsansom2017 modelling fireball camera network data in three dimensions has not previously been attempted this allows the raw astrometric lineofsight observations to be incorporated directly in analysing these two dfn events the triangulated positions based on a straight line assumption result in the modelled meteoroid positions diverging up to 309 km from the calculated observed point for textitdn151212_03 even for the more typical fireball event textitdn160410_03 we see a divergence of up to 360m as dfn observations are typically precise to 100m it is apparent that the assumption of a straight line is an oversimplification that will affect orbit calculations and meteorite search regions for a significant fraction of events | [['meteoroid', 'modelling', 'of', 'fireball', 'data', 'typically', 'uses', 'a', 'one', 'dimensional', 'model', 'along', 'a', 'straight', 'line', 'triangulated', 'trajectory', 'the', 'assumption', 'of', 'a', 'straight', 'line', 'trajectory', 'has', 'been', 'considered', 'an', 'acceptable', 'simplification', 'for', 'fireballs', 'but', 'it', 'has', 'not', 'been', 'rigorously', 'tested', 'the', 'unique', 'capability', 'of', 'the', 'desert', 'fireball', 'network', 'dfn', 'to', 'triangulate', 'discrete', 'observation', 'times', 'gives', 'the', 'opportunity', 'to', 'investigate', 'the', 'deviation', 'of', 'a', 'meteoroids', 'position', 'to', 'different', 'model', 'fits', 'here', 'we', 'assess', 'the', 'viability', 'of', 'a', 'straight', 'line', 'assumption', 'for', 'fireball', 'data', 'in', 'two', 'meteoritedropping', 'test', 'cases', 'observed', 'by', 'the', 'desert', 'fireball', 'network', 'dfn', 'in', 'australia', 'one', 'over', '21', 'seconds', 'textitdn151212_03', 'one', 'under', '5', 'seconds', 'textitdn160410_03', 'we', 'show', 'that', 'a', 'straight', 'line', 'is', 'not', 'valid', 'for', 'these', 'two', 'meteorite', 'dropping', 'events', 'and', 'propose', 'a', 'three', 'dimensional', 'particle', 'filter', 'to', 'model', 'meteoroid', 'positions', 'without', 'any', 'straight', 'line', 'constraints', 'the', 'single', 'body', 'equations', 'in', 'three', 'dimensions', 'along', 'with', 'the', 'luminosity', 'equation', 'are', 'applied', 'to', 'the', 'particle', 'filter', 'methodology', 'described', 'by', 'citetsansom2017', 'modelling', 'fireball', 'camera', 'network', 'data', 'in', 'three', 'dimensions', 'has', 'not', 'previously', 'been', 'attempted', 'this', 'allows', 'the', 'raw', 'astrometric', 'lineofsight', 'observations', 'to', 'be', 'incorporated', 'directly', 'in', 'analysing', 'these', 'two', 'dfn', 'events', 'the', 'triangulated', 'positions', 'based', 'on', 'a', 'straight', 'line', 'assumption', 'result', 'in', 'the', 'modelled', 'meteoroid', 'positions', 'diverging', 'up', 'to', '309', 'km', 'from', 'the', 'calculated', 'observed', 'point', 'for', 'textitdn151212_03', 'even', 'for', 'the', 'more', 'typical', 'fireball', 'event', 'textitdn160410_03', 'we', 'see', 'a', 'divergence', 'of', 'up', 'to', '360m', 'as', 'dfn', 'observations', 'are', 'typically', 'precise', 'to', '100m', 'it', 'is', 'apparent', 'that', 'the', 'assumption', 'of', 'a', 'straight', 'line', 'is', 'an', 'oversimplification', 'that', 'will', 'affect', 'orbit', 'calculations', 'and', 'meteorite', 'search', 'regions', 'for', 'a', 'significant', 'fraction', 'of', 'events']] | [-0.09179908836735054, 0.07611138344699821, -0.10766931510208032, 0.06970745727437763, -0.08144241291313217, -0.1253415178668757, 0.009065531984043236, 0.43779041751359515, -0.19382890330341, -0.3237636009016289, 0.09135478858795698, -0.28284449015230234, -0.03284104049537116, 0.18030488609622877, -0.06081303745293273, 0.05992635768623306, 0.12496172984202321, 0.01751589392213366, -0.03535291767106033, -0.20642405908393602, 0.25504397087542413, 0.06094515598379076, 0.25346710389802374, 0.011215843577072239, 0.12155501300137705, -0.04543785816058517, -0.038294881818672785, 0.03866492316418282, -0.11761745426111492, 0.06609101492280248, 0.21379359542524282, 0.1284490569499142, 0.20621141145507305, -0.4232728514856157, -0.25065336174996516, 0.10668031888333364, 0.1319587439683696, 0.08474401346661929, 0.026715918988282704, -0.2935154260369018, 0.07155387420386362, -0.18103959372159667, -0.18410396887204394, 0.037427941308571744, 0.05373379927175567, -0.01011883574224507, -0.22236779696630457, 0.045153034707674615, 0.03723023114367746, 0.0803010525582347, -0.06387736576748117, -0.07494809408851255, -0.025463486425220394, 0.10651902054221585, 0.05863667646861778, 0.033263732522027564, 0.14664150403382686, -0.06682155391435327, -0.08860302336979657, 0.42478401113229874, -0.07112565861585049, -0.1486745131228907, 0.16375149334691322, -0.15625078980363188, -0.1572256467000653, 0.2114031183784111, 0.18976799926357882, 0.07797898517366356, -0.19667360301648912, -0.003114676933546434, -0.06689392921084968, 0.15536056457125458, 0.09057170684771755, -0.060369946945530294, 0.24633841706583134, 0.16034011721718483, 0.021326737268380105, 0.09150553590644939, -0.19506500530943202, -0.09967138352759111, -0.29204402216665376, -0.1187921869391665, -0.15537988406879147, 0.031558805132730273, -0.10092857548051352, -0.15101860873311615, 0.3734670031314286, 0.17116589507652233, 0.2460226038999211, 0.03453421789499071, 0.28374810022695995, 0.04800220067487457, 0.0781455399616299, 0.07870358230205826, 0.2629112332987671, 0.06795391575791515, 0.11340137195791333, -0.11704836580902338, 0.08066615632806833, 0.0510406107068635] |
1,802.02698 | More Efficient Estimation for Logistic Regression with Optimal Subsample | In this paper, we propose improved estimation method for logistic regression
based on subsamples taken according the optimal subsampling probabilities
developed in Wang et al. 2018 Both asymptotic results and numerical results
show that the new estimator has a higher estimation efficiency. We also develop
a new algorithm based on Poisson subsampling, which does not require to
approximate the optimal subsampling probabilities all at once. This is
computationally advantageous when available random-access memory is not enough
to hold the full data. Interestingly, asymptotic distributions also show that
Poisson subsampling produces a more efficient estimator if the sampling rate,
the ratio of the subsample size to the full data sample size, does not converge
to zero. We also obtain the unconditional asymptotic distribution for the
estimator based on Poisson subsampling. The proposed approach requires to use a
pilot estimator to correct biases of un-weighted estimators. We further show
that even if the pilot estimator is inconsistent, the resulting estimators are
still consistent and asymptotically normal if the model is correctly specified.
| stat.ME | in this paper we propose improved estimation method for logistic regression based on subsamples taken according the optimal subsampling probabilities developed in wang et al 2018 both asymptotic results and numerical results show that the new estimator has a higher estimation efficiency we also develop a new algorithm based on poisson subsampling which does not require to approximate the optimal subsampling probabilities all at once this is computationally advantageous when available randomaccess memory is not enough to hold the full data interestingly asymptotic distributions also show that poisson subsampling produces a more efficient estimator if the sampling rate the ratio of the subsample size to the full data sample size does not converge to zero we also obtain the unconditional asymptotic distribution for the estimator based on poisson subsampling the proposed approach requires to use a pilot estimator to correct biases of unweighted estimators we further show that even if the pilot estimator is inconsistent the resulting estimators are still consistent and asymptotically normal if the model is correctly specified | [['in', 'this', 'paper', 'we', 'propose', 'improved', 'estimation', 'method', 'for', 'logistic', 'regression', 'based', 'on', 'subsamples', 'taken', 'according', 'the', 'optimal', 'subsampling', 'probabilities', 'developed', 'in', 'wang', 'et', 'al', '2018', 'both', 'asymptotic', 'results', 'and', 'numerical', 'results', 'show', 'that', 'the', 'new', 'estimator', 'has', 'a', 'higher', 'estimation', 'efficiency', 'we', 'also', 'develop', 'a', 'new', 'algorithm', 'based', 'on', 'poisson', 'subsampling', 'which', 'does', 'not', 'require', 'to', 'approximate', 'the', 'optimal', 'subsampling', 'probabilities', 'all', 'at', 'once', 'this', 'is', 'computationally', 'advantageous', 'when', 'available', 'randomaccess', 'memory', 'is', 'not', 'enough', 'to', 'hold', 'the', 'full', 'data', 'interestingly', 'asymptotic', 'distributions', 'also', 'show', 'that', 'poisson', 'subsampling', 'produces', 'a', 'more', 'efficient', 'estimator', 'if', 'the', 'sampling', 'rate', 'the', 'ratio', 'of', 'the', 'subsample', 'size', 'to', 'the', 'full', 'data', 'sample', 'size', 'does', 'not', 'converge', 'to', 'zero', 'we', 'also', 'obtain', 'the', 'unconditional', 'asymptotic', 'distribution', 'for', 'the', 'estimator', 'based', 'on', 'poisson', 'subsampling', 'the', 'proposed', 'approach', 'requires', 'to', 'use', 'a', 'pilot', 'estimator', 'to', 'correct', 'biases', 'of', 'unweighted', 'estimators', 'we', 'further', 'show', 'that', 'even', 'if', 'the', 'pilot', 'estimator', 'is', 'inconsistent', 'the', 'resulting', 'estimators', 'are', 'still', 'consistent', 'and', 'asymptotically', 'normal', 'if', 'the', 'model', 'is', 'correctly', 'specified']] | [-0.028308449221966677, 0.011037944676354527, -0.13641088513712235, 0.11377062700305353, -0.10792748213416951, -0.17055138353915775, 0.11912162667208845, 0.4177251523031908, -0.20585512488203891, -0.2834403594572316, 0.12304831834592145, -0.22184285370852141, -0.16747073344201507, 0.1857718425022219, -0.15114975240738954, 0.09698004485176438, 0.10490103264558404, -0.0027366994551437742, -0.07595208444742158, -0.34687663085265635, 0.25118997061885345, 0.1225078917656313, 0.3817013835260535, -0.05252014540464563, 0.1247855476981974, 0.02047409890767406, -0.05769311949501143, 0.028906001882954595, -0.1529944729162226, 0.07301245043225423, 0.2276868551010814, 0.15080203902359832, 0.3208709520082373, -0.36056170750607097, -0.15981268897543058, 0.1436127372442142, 0.1851473760462421, 0.13322787044008316, -0.031103165733699877, -0.22876645696678144, 0.14096293494324474, -0.16273297202389905, -0.07425289451528122, -0.09911047615220442, -0.03204001652843812, 0.026143990161226077, -0.3937848794082289, 0.12298412588236662, 0.07898750527186647, -0.026476674833718468, -0.015673738676945076, -0.15558482791735406, -0.010091618831981631, 0.06309088967031772, 0.029602400294970722, -0.03260164180058329, 0.07981607582581038, -0.04284225657500108, -0.06697478495976504, 0.2877410480478669, -0.048809180203277396, -0.24639358073472978, 0.1486506308788461, -0.1584989808718948, -0.1645576722070794, 0.13649734877707326, 0.177115164604038, 0.11323192136855248, -0.16057371500073178, 0.07188897938399083, -0.05711159673245514, 0.1699613058282172, 0.01300918475505622, -0.005300497132189133, 0.09790749241707518, 0.1464471359134597, 0.13828503669458717, 0.10684955851448809, -0.1431972099796814, -0.054868946543908406, -0.3038907561560764, -0.10101080571356065, -0.24922457832350012, 0.00961192289036904, -0.13897621091164183, -0.19785738677841008, 0.3202944773084977, 0.2470411472789505, 0.18162611300016152, 0.16252297794733964, 0.3254546016564264, 0.1300579526584924, 0.028751837889499525, 0.16818499984767507, 0.20255935188821134, 0.09812269634293283, 0.04004058698466157, -0.18972273909432047, 0.13680845219915844, 0.0376519184340449] |
1,802.02699 | Immediate Causality Network of Stock Markets | A financial system contains many elements networked by their relationships.
Extensive works show that topological structure of the network stores rich
information on evolutionary behaviors of the system such as early warning
signals of collapses and/or crises. Existing works focus mainly on the network
structure within a single stock market, while a collapse/crisis occurs in a
macro-scale covering several or even all markets in the world. This mismatch of
scale leads to unacceptable noise to the topological structure, and lack of
information stored in relationships between different markets. In this work by
using the transfer entropy we reconstruct the influential network between ten
typical stock markets distributed in the world. Interesting findings include,
before a financial crisis the connection strength reaches a maxima, which can
act as an early warning signal of financial crises; The markets in America are
mono-directionally and strongly influenced by that in Europe and act as the
center; Some strongly linked pairs have also close correlations. The findings
are helpful in understanding the evolution and modelling the dynamical process
of the global financial system.
| q-fin.ST physics.soc-ph | a financial system contains many elements networked by their relationships extensive works show that topological structure of the network stores rich information on evolutionary behaviors of the system such as early warning signals of collapses andor crises existing works focus mainly on the network structure within a single stock market while a collapsecrisis occurs in a macroscale covering several or even all markets in the world this mismatch of scale leads to unacceptable noise to the topological structure and lack of information stored in relationships between different markets in this work by using the transfer entropy we reconstruct the influential network between ten typical stock markets distributed in the world interesting findings include before a financial crisis the connection strength reaches a maxima which can act as an early warning signal of financial crises the markets in america are monodirectionally and strongly influenced by that in europe and act as the center some strongly linked pairs have also close correlations the findings are helpful in understanding the evolution and modelling the dynamical process of the global financial system | [['a', 'financial', 'system', 'contains', 'many', 'elements', 'networked', 'by', 'their', 'relationships', 'extensive', 'works', 'show', 'that', 'topological', 'structure', 'of', 'the', 'network', 'stores', 'rich', 'information', 'on', 'evolutionary', 'behaviors', 'of', 'the', 'system', 'such', 'as', 'early', 'warning', 'signals', 'of', 'collapses', 'andor', 'crises', 'existing', 'works', 'focus', 'mainly', 'on', 'the', 'network', 'structure', 'within', 'a', 'single', 'stock', 'market', 'while', 'a', 'collapsecrisis', 'occurs', 'in', 'a', 'macroscale', 'covering', 'several', 'or', 'even', 'all', 'markets', 'in', 'the', 'world', 'this', 'mismatch', 'of', 'scale', 'leads', 'to', 'unacceptable', 'noise', 'to', 'the', 'topological', 'structure', 'and', 'lack', 'of', 'information', 'stored', 'in', 'relationships', 'between', 'different', 'markets', 'in', 'this', 'work', 'by', 'using', 'the', 'transfer', 'entropy', 'we', 'reconstruct', 'the', 'influential', 'network', 'between', 'ten', 'typical', 'stock', 'markets', 'distributed', 'in', 'the', 'world', 'interesting', 'findings', 'include', 'before', 'a', 'financial', 'crisis', 'the', 'connection', 'strength', 'reaches', 'a', 'maxima', 'which', 'can', 'act', 'as', 'an', 'early', 'warning', 'signal', 'of', 'financial', 'crises', 'the', 'markets', 'in', 'america', 'are', 'monodirectionally', 'and', 'strongly', 'influenced', 'by', 'that', 'in', 'europe', 'and', 'act', 'as', 'the', 'center', 'some', 'strongly', 'linked', 'pairs', 'have', 'also', 'close', 'correlations', 'the', 'findings', 'are', 'helpful', 'in', 'understanding', 'the', 'evolution', 'and', 'modelling', 'the', 'dynamical', 'process', 'of', 'the', 'global', 'financial', 'system']] | [-0.15354816600897306, 0.10273020107483304, -0.09132800694682043, 0.12227325425627358, -0.05404864788182418, -0.09536916930532739, 0.059790451884592505, 0.35996722694571043, -0.2687592599831987, -0.3095414167169524, 0.16398683738026937, -0.32153449577692134, -0.2189735926023621, 0.17863435189065058, -0.07021736910444981, -0.005449915818065743, 0.0557858894251033, 0.03807303528711517, 0.008428497296832078, -0.2517471110426083, 0.3027570645400291, 0.05170498054146513, 0.3108622492978942, 0.031199060451895508, 0.051575916276223405, -0.02312430796948981, -0.057198411675265314, 0.012565569108780685, -0.06465021471550161, 0.14305330221594142, 0.3077478450233519, 0.15502674561999316, 0.3402619787150549, -0.48171694566157053, -0.22427169903477823, 0.11523541496717371, 0.09996982464640909, 0.0649447570328696, -0.007261680242002264, -0.29634453979087994, 0.01270982153205709, -0.21370616656812755, -0.0866446762255774, -0.06101540163482158, 0.030256483660195954, 0.02836213260922126, -0.22016627197808702, 0.07797303674355631, 0.05285312412276901, 0.07509950144396332, -0.04490820597063496, -0.051667636525632006, -0.07847942436770113, 0.19533561159385665, 0.07870756374623769, -0.044513158540543045, 0.17206171142110674, -0.14896488947041772, -0.1498369971152649, 0.3709733596717177, -0.0491427435779108, -0.10647105101749978, 0.20297748543353836, -0.13454509400021794, -0.14511955877639016, 0.10508672119943764, 0.21475874224085023, 0.019337234456377864, -0.16946252451948982, 0.026467767349624246, -0.028012847093949942, 0.16036201718485577, 0.060112899210335774, 0.03946307159706273, 0.2552582808288703, 0.20710738220209765, 0.07209033775242543, 0.1119775909878213, -0.03613017887090047, -0.18024498273734935, -0.22730987161677066, -0.09050815270562783, -0.15891614566168177, 0.030291894216630186, -0.13326792401329096, -0.1628949741160878, 0.4010211956708438, 0.16662149102723395, 0.2178184396497355, -0.03205589983487946, 0.2490066887641495, 0.03544112679413625, 0.04454828321864956, 0.08128174486310771, 0.2069038060787782, 0.029310747868624854, 0.20065798729708398, -0.184957221569758, 0.1788179784462872, -0.017897285002453082] |
1,802.027 | ODINI : Escaping Sensitive Data from Faraday-Caged, Air-Gapped Computers
via Magnetic Fields | Air-gapped computers are computers which are kept isolated from the Internet,
because they store and process sensitive information. When highly sensitive
data is involved, an air-gapped computer might also be kept secluded in a
Faraday cage. The Faraday cage prevents the leakage of electromagnetic signals
emanating from various computer parts, which may be picked up by an
eavesdropping adversary remotely. The air-gap separation, coupled with the
Faraday shield, provides a high level of isolation, preventing the potential
leakage of sensitive data from the system. In this paper, we show how attackers
can bypass Faraday cages and air-gaps in order to leak data from highly secure
computers. Our method is based on an exploitation of the magnetic field
generated by the computer CPU. Unlike electromagnetic radiation (EMR), low
frequency magnetic radiation propagates though the air, penetrating metal
shielding such as Faraday cages (e.g., compass still works inside Faraday
cages). We introduce a malware code-named ODINI that can control the low
frequency magnetic fields emitted from the infected computer by regulating the
load of the CPU cores. Arbitrary data can be modulated and transmitted on top
of the magnetic emission and received by a magnetic receiver (bug) placed
nearby. We provide technical background and examine the characteristics of the
magnetic fields. We implement a malware prototype and discuss the design
considerations along with the implementation details. We also show that the
malicious code does not require special privileges (e.g., root) and can
successfully operate from within isolated virtual machines (VMs) as well.
| cs.CR | airgapped computers are computers which are kept isolated from the internet because they store and process sensitive information when highly sensitive data is involved an airgapped computer might also be kept secluded in a faraday cage the faraday cage prevents the leakage of electromagnetic signals emanating from various computer parts which may be picked up by an eavesdropping adversary remotely the airgap separation coupled with the faraday shield provides a high level of isolation preventing the potential leakage of sensitive data from the system in this paper we show how attackers can bypass faraday cages and airgaps in order to leak data from highly secure computers our method is based on an exploitation of the magnetic field generated by the computer cpu unlike electromagnetic radiation emr low frequency magnetic radiation propagates though the air penetrating metal shielding such as faraday cages eg compass still works inside faraday cages we introduce a malware codenamed odini that can control the low frequency magnetic fields emitted from the infected computer by regulating the load of the cpu cores arbitrary data can be modulated and transmitted on top of the magnetic emission and received by a magnetic receiver bug placed nearby we provide technical background and examine the characteristics of the magnetic fields we implement a malware prototype and discuss the design considerations along with the implementation details we also show that the malicious code does not require special privileges eg root and can successfully operate from within isolated virtual machines vms as well | [['airgapped', 'computers', 'are', 'computers', 'which', 'are', 'kept', 'isolated', 'from', 'the', 'internet', 'because', 'they', 'store', 'and', 'process', 'sensitive', 'information', 'when', 'highly', 'sensitive', 'data', 'is', 'involved', 'an', 'airgapped', 'computer', 'might', 'also', 'be', 'kept', 'secluded', 'in', 'a', 'faraday', 'cage', 'the', 'faraday', 'cage', 'prevents', 'the', 'leakage', 'of', 'electromagnetic', 'signals', 'emanating', 'from', 'various', 'computer', 'parts', 'which', 'may', 'be', 'picked', 'up', 'by', 'an', 'eavesdropping', 'adversary', 'remotely', 'the', 'airgap', 'separation', 'coupled', 'with', 'the', 'faraday', 'shield', 'provides', 'a', 'high', 'level', 'of', 'isolation', 'preventing', 'the', 'potential', 'leakage', 'of', 'sensitive', 'data', 'from', 'the', 'system', 'in', 'this', 'paper', 'we', 'show', 'how', 'attackers', 'can', 'bypass', 'faraday', 'cages', 'and', 'airgaps', 'in', 'order', 'to', 'leak', 'data', 'from', 'highly', 'secure', 'computers', 'our', 'method', 'is', 'based', 'on', 'an', 'exploitation', 'of', 'the', 'magnetic', 'field', 'generated', 'by', 'the', 'computer', 'cpu', 'unlike', 'electromagnetic', 'radiation', 'emr', 'low', 'frequency', 'magnetic', 'radiation', 'propagates', 'though', 'the', 'air', 'penetrating', 'metal', 'shielding', 'such', 'as', 'faraday', 'cages', 'eg', 'compass', 'still', 'works', 'inside', 'faraday', 'cages', 'we', 'introduce', 'a', 'malware', 'codenamed', 'odini', 'that', 'can', 'control', 'the', 'low', 'frequency', 'magnetic', 'fields', 'emitted', 'from', 'the', 'infected', 'computer', 'by', 'regulating', 'the', 'load', 'of', 'the', 'cpu', 'cores', 'arbitrary', 'data', 'can', 'be', 'modulated', 'and', 'transmitted', 'on', 'top', 'of', 'the', 'magnetic', 'emission', 'and', 'received', 'by', 'a', 'magnetic', 'receiver', 'bug', 'placed', 'nearby', 'we', 'provide', 'technical', 'background', 'and', 'examine', 'the', 'characteristics', 'of', 'the', 'magnetic', 'fields', 'we', 'implement', 'a', 'malware', 'prototype', 'and', 'discuss', 'the', 'design', 'considerations', 'along', 'with', 'the', 'implementation', 'details', 'we', 'also', 'show', 'that', 'the', 'malicious', 'code', 'does', 'not', 'require', 'special', 'privileges', 'eg', 'root', 'and', 'can', 'successfully', 'operate', 'from', 'within', 'isolated', 'virtual', 'machines', 'vms', 'as', 'well']] | [-0.1604003083707448, 0.15554227702380166, -0.02654034096231482, 0.046817149844615366, -0.1078486033719048, -0.17665953420165245, 0.0578134367593104, 0.3889116400359086, -0.28176644383873567, -0.3454680702233889, 0.11987021889576846, -0.28227678730421846, -0.1019873079454833, 0.22467706608305493, -0.06267063293594823, 0.011023756153563628, 0.03050783216480136, 0.027999419317020657, 0.01363077581800281, -0.20483408221716892, 0.2806341563254206, 0.10049058269451272, 0.290917570008915, 0.04891909178286551, 0.06897933601988966, -0.007447246168964508, -0.004229519750930399, -0.003551900764575684, -0.024396178099697543, 0.05116379341175106, 0.2642268894322546, 0.1453535623622153, 0.2353547441915246, -0.5146851412779895, -0.17351363740588377, 0.07530534484967903, 0.1551732713721055, 0.15367105292216182, -0.09518062915039589, -0.3262967774270469, 0.08055922343586404, -0.16907224119509978, -0.11153141608636828, -0.0581894132101078, -0.039194441675610585, 0.0361635887743414, -0.22525344548717022, 0.0039242741193184745, 0.002199697232502232, 0.08604498588139692, -0.019420677330344915, -0.05407520550551888, -0.028683360884373777, 0.15685082818103308, 0.01786398731145669, 0.03452628930615931, 0.27073333854693543, -0.1311592382302201, -0.10609902214094338, 0.3715682942420244, -0.007157726761750339, -0.1456055933923786, 0.1743252883968224, -0.11050164116449265, -0.08481124706330698, 0.15836035539199744, 0.21710296588843261, 0.07519819142192183, -0.15401274787598004, 0.036280986615905474, 0.014391009190894035, 0.21631410173103063, 0.0805234857647863, 0.05025012223386621, 0.2516984460406925, 0.13888242095989367, 0.0318462679155141, 0.1745141656872027, -0.1465518936032362, -0.02142777059313254, -0.23268795986711252, -0.12918733019871734, -0.20045353898621468, 0.07392808880819893, -0.04871603850144136, -0.15397319378145227, 0.3376294699395599, 0.1829005315040526, 0.1231583545655835, -0.011531792553029505, 0.39821494798396667, 0.026660926899513656, 0.13703538838916096, 0.13947752949615275, 0.23750878537604847, 0.08923884900286794, 0.12849704190587483, -0.2074524551110125, 0.10012136249761863, -0.06642283372972328] |
1,802.02701 | Restate the reference for EEG microstate analysis | Despite the decades of efforts, the choice of EEG reference is still a
debated fundamental issue. Non-neutral reference can inevitably inject the
uncontrolled temporal biases into all EEG recordings, which may influence the
spatiotemporal analysis of brain activity. A method, termed microstates,
identifying spatiotemporal EEG features as the quasi-stable topography states
in milliseconds, suggests its potential as biomarkers of neurophysiological
disease. As reference electrode standardization technique (REST) could
reconstruct an infinity reference approximately, it is a question whether REST
or the other references will be more reliable than average reference (AR) for
the microstates analysis. In this study, we design the microstate-based EEG
forward model, and apply different references for microstates analysis. The
spatial similarity between the generated and assumed cluster maps is mainly
investigated. Furthermore, the real EEG data by the parametric bootstrap method
is used to validate the performance of the references. Finally, we find that
REST is robust to recover more similar cluster maps to the assumption than AR
in the simulation, and the cluster maps between REST and AR on the real EEG
data are quite different. This study may indicate that REST contributes to
identifying more objective microstates features than AR.
| q-bio.QM q-bio.NC | despite the decades of efforts the choice of eeg reference is still a debated fundamental issue nonneutral reference can inevitably inject the uncontrolled temporal biases into all eeg recordings which may influence the spatiotemporal analysis of brain activity a method termed microstates identifying spatiotemporal eeg features as the quasistable topography states in milliseconds suggests its potential as biomarkers of neurophysiological disease as reference electrode standardization technique rest could reconstruct an infinity reference approximately it is a question whether rest or the other references will be more reliable than average reference ar for the microstates analysis in this study we design the microstatebased eeg forward model and apply different references for microstates analysis the spatial similarity between the generated and assumed cluster maps is mainly investigated furthermore the real eeg data by the parametric bootstrap method is used to validate the performance of the references finally we find that rest is robust to recover more similar cluster maps to the assumption than ar in the simulation and the cluster maps between rest and ar on the real eeg data are quite different this study may indicate that rest contributes to identifying more objective microstates features than ar | [['despite', 'the', 'decades', 'of', 'efforts', 'the', 'choice', 'of', 'eeg', 'reference', 'is', 'still', 'a', 'debated', 'fundamental', 'issue', 'nonneutral', 'reference', 'can', 'inevitably', 'inject', 'the', 'uncontrolled', 'temporal', 'biases', 'into', 'all', 'eeg', 'recordings', 'which', 'may', 'influence', 'the', 'spatiotemporal', 'analysis', 'of', 'brain', 'activity', 'a', 'method', 'termed', 'microstates', 'identifying', 'spatiotemporal', 'eeg', 'features', 'as', 'the', 'quasistable', 'topography', 'states', 'in', 'milliseconds', 'suggests', 'its', 'potential', 'as', 'biomarkers', 'of', 'neurophysiological', 'disease', 'as', 'reference', 'electrode', 'standardization', 'technique', 'rest', 'could', 'reconstruct', 'an', 'infinity', 'reference', 'approximately', 'it', 'is', 'a', 'question', 'whether', 'rest', 'or', 'the', 'other', 'references', 'will', 'be', 'more', 'reliable', 'than', 'average', 'reference', 'ar', 'for', 'the', 'microstates', 'analysis', 'in', 'this', 'study', 'we', 'design', 'the', 'microstatebased', 'eeg', 'forward', 'model', 'and', 'apply', 'different', 'references', 'for', 'microstates', 'analysis', 'the', 'spatial', 'similarity', 'between', 'the', 'generated', 'and', 'assumed', 'cluster', 'maps', 'is', 'mainly', 'investigated', 'furthermore', 'the', 'real', 'eeg', 'data', 'by', 'the', 'parametric', 'bootstrap', 'method', 'is', 'used', 'to', 'validate', 'the', 'performance', 'of', 'the', 'references', 'finally', 'we', 'find', 'that', 'rest', 'is', 'robust', 'to', 'recover', 'more', 'similar', 'cluster', 'maps', 'to', 'the', 'assumption', 'than', 'ar', 'in', 'the', 'simulation', 'and', 'the', 'cluster', 'maps', 'between', 'rest', 'and', 'ar', 'on', 'the', 'real', 'eeg', 'data', 'are', 'quite', 'different', 'this', 'study', 'may', 'indicate', 'that', 'rest', 'contributes', 'to', 'identifying', 'more', 'objective', 'microstates', 'features', 'than', 'ar']] | [-0.0471268895891113, 0.08304519161338715, -0.0974223953504593, 0.11261107752469775, -0.07129131820864784, -0.15664121738802164, 0.021097593157528304, 0.4008066823801551, -0.22409430421315707, -0.29551332258165647, 0.07954345733369103, -0.30398885464916625, -0.15087988606463068, 0.19026025713493044, -0.08484853710143421, 0.026838967635129125, 0.10202891225269876, 0.06707150992483665, -0.0581693670927332, -0.20018563318746882, 0.2647134816632248, 0.08953276767323796, 0.34246508636846185, -0.01663540578327882, 0.05565431149040635, -0.04323730406064827, -0.09826558655462204, -0.002047002945954983, -0.04955080187415334, 0.12205077279717304, 0.3020585100047099, 0.19170840591944469, 0.31561758866867956, -0.440482302970038, -0.24521817427176312, 0.1046745679866618, 0.14187532355889487, 0.10394752010268768, -0.015760812522076333, -0.32508445165287225, 0.10742065520622791, -0.12191672604053448, -0.07640112098664618, -0.05683615697691074, 0.045864602042218816, -0.01935022819835024, -0.24702819293866363, 0.09354762766534128, 0.010056203527328295, 0.09902553655541478, -0.10569768652904969, -0.06666778944170054, -0.029637465425408804, 0.18534950762390134, 0.0778692944912622, 0.027891787588118742, 0.19747669684151425, -0.09862012106161087, -0.07542604850306629, 0.3436565434891516, -0.007897370892729108, -0.20568704281050043, 0.2116064584885652, -0.12953017515918383, -0.12034657125552305, 0.10154839620853846, 0.16095414142100475, 0.08752181055263067, -0.20167497915860552, -0.026470294102686098, -0.006684285662292192, 0.2172999674979693, 0.07112867972479225, 0.004071633842511055, 0.19356757797993338, 0.17078923337543622, 0.0318096737544506, 0.14552694803360516, -0.1408048883629724, -0.05842540640957081, -0.2663861373391671, -0.11560228306006115, -0.1613114112074702, 0.017716476715539987, -0.08375823029334872, -0.14441499366687657, 0.43750369554528823, 0.1937935279025577, 0.18739222961848076, 0.008893809422778969, 0.2889319632847149, 0.048346954822325365, 0.055027803642532, 0.04864422440169176, 0.2004101274200739, 0.08677704055414487, 0.11977191851892247, -0.19520788996313246, 0.10740764440538791, 0.004113919804923427] |
1,802.02702 | On Quantizer Design to Exploit Common Information in Layered Coding of
Vector Sources | This paper studies a layered coding framework with a relaxed hierarchical
structure. Advances in wired/wireless communication and consumer electronic
devices have created a requirement for serving the same content at different
quality levels. The key challenge is to optimally encode all the required
quality levels with efficient usage of storage and networking resources. The
approach to store and transmit independent copies for every required quality
level is highly wasteful in resources. Alternatively, conventional scalable
coding has inherent loss due to its structure. This paper studies a layered
coding framework with a relaxed hierarchical structure to transmit information
common to different quality levels along with individual bit streams for each
quality level. The flexibility of sharing only a properly selected subset of
information from a lower quality level with the higher quality level, enables
achieving operating points between conventional scalable coding and independent
coding, to control the layered coding penalty. Jointly designing common and
individual layers' coders overcomes the limitations of conventional scalable
coding and non-scalable coding, by providing the flexibility of transmitting
common and individual bit-streams for different quality levels. It extracts the
common information between different quality levels with negligible performance
penalty. Simulation results for practically important sources, confirm the
superiority of the work.
| eess.SP | this paper studies a layered coding framework with a relaxed hierarchical structure advances in wiredwireless communication and consumer electronic devices have created a requirement for serving the same content at different quality levels the key challenge is to optimally encode all the required quality levels with efficient usage of storage and networking resources the approach to store and transmit independent copies for every required quality level is highly wasteful in resources alternatively conventional scalable coding has inherent loss due to its structure this paper studies a layered coding framework with a relaxed hierarchical structure to transmit information common to different quality levels along with individual bit streams for each quality level the flexibility of sharing only a properly selected subset of information from a lower quality level with the higher quality level enables achieving operating points between conventional scalable coding and independent coding to control the layered coding penalty jointly designing common and individual layers coders overcomes the limitations of conventional scalable coding and nonscalable coding by providing the flexibility of transmitting common and individual bitstreams for different quality levels it extracts the common information between different quality levels with negligible performance penalty simulation results for practically important sources confirm the superiority of the work | [['this', 'paper', 'studies', 'a', 'layered', 'coding', 'framework', 'with', 'a', 'relaxed', 'hierarchical', 'structure', 'advances', 'in', 'wiredwireless', 'communication', 'and', 'consumer', 'electronic', 'devices', 'have', 'created', 'a', 'requirement', 'for', 'serving', 'the', 'same', 'content', 'at', 'different', 'quality', 'levels', 'the', 'key', 'challenge', 'is', 'to', 'optimally', 'encode', 'all', 'the', 'required', 'quality', 'levels', 'with', 'efficient', 'usage', 'of', 'storage', 'and', 'networking', 'resources', 'the', 'approach', 'to', 'store', 'and', 'transmit', 'independent', 'copies', 'for', 'every', 'required', 'quality', 'level', 'is', 'highly', 'wasteful', 'in', 'resources', 'alternatively', 'conventional', 'scalable', 'coding', 'has', 'inherent', 'loss', 'due', 'to', 'its', 'structure', 'this', 'paper', 'studies', 'a', 'layered', 'coding', 'framework', 'with', 'a', 'relaxed', 'hierarchical', 'structure', 'to', 'transmit', 'information', 'common', 'to', 'different', 'quality', 'levels', 'along', 'with', 'individual', 'bit', 'streams', 'for', 'each', 'quality', 'level', 'the', 'flexibility', 'of', 'sharing', 'only', 'a', 'properly', 'selected', 'subset', 'of', 'information', 'from', 'a', 'lower', 'quality', 'level', 'with', 'the', 'higher', 'quality', 'level', 'enables', 'achieving', 'operating', 'points', 'between', 'conventional', 'scalable', 'coding', 'and', 'independent', 'coding', 'to', 'control', 'the', 'layered', 'coding', 'penalty', 'jointly', 'designing', 'common', 'and', 'individual', 'layers', 'coders', 'overcomes', 'the', 'limitations', 'of', 'conventional', 'scalable', 'coding', 'and', 'nonscalable', 'coding', 'by', 'providing', 'the', 'flexibility', 'of', 'transmitting', 'common', 'and', 'individual', 'bitstreams', 'for', 'different', 'quality', 'levels', 'it', 'extracts', 'the', 'common', 'information', 'between', 'different', 'quality', 'levels', 'with', 'negligible', 'performance', 'penalty', 'simulation', 'results', 'for', 'practically', 'important', 'sources', 'confirm', 'the', 'superiority', 'of', 'the', 'work']] | [-0.1507694386274546, 0.03290447183407661, -0.023812686820037482, 0.008788066187010305, -0.07797229405628835, -0.212599019556329, 0.12803655123315388, 0.4231896678848964, -0.3068299939242623, -0.34590336814886186, 0.07237760207229635, -0.24279319190124912, -0.11739566391248756, 0.13186030404687654, -0.1383953752405033, 0.07950878395420703, 0.05421296120280536, 0.014150447964032248, -0.0634636903908558, -0.28054234513490484, 0.2683464601726794, 0.1434998784941144, 0.4621133177075535, 0.011577502288287732, 0.10914652625371407, 0.014917396570033416, -0.0078355870079022, -0.026036037283199955, -0.05036560361438272, 0.23549300008339852, 0.34988638586932563, 0.16810449609673503, 0.34627675897350946, -0.4221862834919437, -0.2646801351955751, 0.015853087113397876, 0.1381790318458182, 0.08591891538647072, -0.08842064698067743, -0.22130267447224114, 0.1250135227401809, -0.16961229235479017, -0.01569525074978961, -0.07420305395044569, -0.07010444650517368, 0.014183420478934195, -0.30548740707525257, 0.025777037495111184, -0.023040733785118634, 0.029016832749518315, -0.036998581651544266, -0.1272802135725392, -0.002149504091499782, 0.22220981787186025, -0.01509405119094725, 0.015723886366411133, 0.1187748380178563, -0.12559209010086772, -0.12387090791909453, 0.3881996416009781, 0.01454904490184584, -0.21543645145507848, 0.18668957936304917, -0.050620416952183514, -0.1563609797825537, 0.16243377309917223, 0.1999103882702113, 0.02632582406854121, -0.15608676617777703, 0.004874633566374186, 0.04179107867544744, 0.2509412315674126, 0.11180408475750193, 0.16817934115576308, 0.18533823456865076, 0.21923431126491688, 0.056834085759275205, 0.14620157419590324, -0.05714116287504666, -0.07173080714987363, -0.18794309443953197, -0.12071859445877192, -0.1717817751673709, -0.010577339535897097, -0.12343328676034594, -0.12253008743878681, 0.3800113454506528, 0.1568537340965122, 0.14762941073489988, 0.04998470828754873, 0.42498202159342063, 0.05298511017931671, 0.10364676331703711, 0.1325269551829523, 0.13971424087336878, 0.0472424999594961, 0.07919352928449104, -0.16717062382163797, 0.10677557021674768, -0.028584982977226014] |
1,802.02703 | A strongly interacting Sarma superfluid near orbital Feshbach resonances | We investigate the nature of superfluid pairing in a strongly interacting
Fermi gas near orbital Feshbach resonances with spin-population imbalance in
three dimensions, which can be well described by a two-band or two-channel
model. We show that a Sarma superfluid with gapless single-particle excitations
is favored in the closed channel at large imbalance. It is thermodynamically
stable against the formation of an inhomogeneous Fulde\textendash
Ferrell\textendash Larkin\textendash Ovchinnikov superfluid and features a
well-defined Goldstone-Anderson-Bogoliubov phonon mode and a massive Leggett
mode as collective excitations at low momentum. At large momentum, the Leggett
mode disappears and the phonon mode becomes damped at zero temperature, due to
the coupling to the particle-hole excitations. We discuss possible experimental
observation of a strongly interacting Sarma superfluid with ultracold
alkaline-earth-metal Fermi gases.
| cond-mat.quant-gas | we investigate the nature of superfluid pairing in a strongly interacting fermi gas near orbital feshbach resonances with spinpopulation imbalance in three dimensions which can be well described by a twoband or twochannel model we show that a sarma superfluid with gapless singleparticle excitations is favored in the closed channel at large imbalance it is thermodynamically stable against the formation of an inhomogeneous fuldetextendash ferrelltextendash larkintextendash ovchinnikov superfluid and features a welldefined goldstoneandersonbogoliubov phonon mode and a massive leggett mode as collective excitations at low momentum at large momentum the leggett mode disappears and the phonon mode becomes damped at zero temperature due to the coupling to the particlehole excitations we discuss possible experimental observation of a strongly interacting sarma superfluid with ultracold alkalineearthmetal fermi gases | [['we', 'investigate', 'the', 'nature', 'of', 'superfluid', 'pairing', 'in', 'a', 'strongly', 'interacting', 'fermi', 'gas', 'near', 'orbital', 'feshbach', 'resonances', 'with', 'spinpopulation', 'imbalance', 'in', 'three', 'dimensions', 'which', 'can', 'be', 'well', 'described', 'by', 'a', 'twoband', 'or', 'twochannel', 'model', 'we', 'show', 'that', 'a', 'sarma', 'superfluid', 'with', 'gapless', 'singleparticle', 'excitations', 'is', 'favored', 'in', 'the', 'closed', 'channel', 'at', 'large', 'imbalance', 'it', 'is', 'thermodynamically', 'stable', 'against', 'the', 'formation', 'of', 'an', 'inhomogeneous', 'fuldetextendash', 'ferrelltextendash', 'larkintextendash', 'ovchinnikov', 'superfluid', 'and', 'features', 'a', 'welldefined', 'goldstoneandersonbogoliubov', 'phonon', 'mode', 'and', 'a', 'massive', 'leggett', 'mode', 'as', 'collective', 'excitations', 'at', 'low', 'momentum', 'at', 'large', 'momentum', 'the', 'leggett', 'mode', 'disappears', 'and', 'the', 'phonon', 'mode', 'becomes', 'damped', 'at', 'zero', 'temperature', 'due', 'to', 'the', 'coupling', 'to', 'the', 'particlehole', 'excitations', 'we', 'discuss', 'possible', 'experimental', 'observation', 'of', 'a', 'strongly', 'interacting', 'sarma', 'superfluid', 'with', 'ultracold', 'alkalineearthmetal', 'fermi', 'gases']] | [-0.231791123519289, 0.35257061964893793, -0.07538186590813223, 0.07052864491000588, -0.03087787288737285, -0.22145211189740993, 0.10011956440742875, 0.29026872466211434, -0.20645476282253616, -0.20311881537686605, -0.04395941218846004, -0.33508176617629704, -0.051876881180834944, 0.11449463608613634, 0.058676930816202864, 0.009164389722873686, -0.005920722305805224, -0.024382594446117272, -0.0558627179168264, -0.17885418805354808, 0.3357388857879951, 0.030912570708782457, 0.33796276751386584, 0.08466840761553374, 0.03290292805396631, 0.01133997174987539, 0.12102362120401908, -0.010594628270349054, -0.14436892192787157, -0.003504198571270118, 0.3057345107625254, -0.1347261942764668, 0.1959924603865833, -0.36891063205042823, -0.20586418844740378, 0.03733558520735776, 0.22523392003018133, 0.2133342598242395, -0.003496996398068598, -0.3114896459337019, -0.063045297512693, -0.23641407478325924, -0.22043686121564787, -0.14758077761555305, 0.01937429921426734, -0.053156383224900385, -0.2350011925426785, 0.15965657347630038, 0.05223515099315278, 0.07663668317101957, -0.10950522302634648, -0.08540910458360172, -0.07585919478366182, -0.045892014013618594, 0.03670357383375407, 0.031754146585790594, 0.13695554961221384, -0.15420171600331353, -0.06546694846045165, 0.3608302492648363, -0.11947767054051404, -0.126984343596841, 0.2537059962113014, -0.17730812976694071, -0.04611666563165481, 0.20477922703521173, 0.10458651000250238, 0.032630158324924406, -0.0779599096305424, 0.043770051970479146, -0.06763413782445256, 0.15497579235778206, 0.022747113392306645, 0.10566224678053109, 0.33546180604979947, 0.21677516951878387, 0.01495982970294283, 0.13315966208064622, -0.15148222399255276, -0.09986419604039659, -0.24156487505638696, -0.11661141903424009, -0.2394390425703977, -0.016445923579444528, 0.04381492094851965, -0.1579595985803295, 0.3864903673605963, 0.07579196777698569, 0.22974445360147808, -0.05568246904056382, 0.25432676176510016, 0.16493446809587023, 0.0400937953734862, 0.11460978796201773, 0.2828830127741714, 0.15353293836758028, 0.07384234500407684, -0.3877234374264591, -0.0543536752172303, 0.010507256681954518] |
1,802.02704 | Folding mechanisms at finite temperature | Folding mechanisms are zero elastic energy motions essential to the
deployment of origami, linkages, reconfigurable metamaterials and robotic
structures. In this paper, we determine the fate of folding mechanisms when
such structures are miniaturized so that thermal fluctuations cannot be
neglected. First, we identify geometric and topological design strategies aimed
at minimizing undesired thermal energy barriers that generically obstruct
kinematic mechanisms at the microscale. Our findings are illustrated in the
context of a quasi one-dimensional linkage structure that harbors a
topologically protected mechanism. However, thermal fluctuations can also be
exploited to deliberately lock a reconfigurable metamaterial into a fully
expanded configuration, a process reminiscent of order by disorder transitions
in magnetic systems. We demonstrate that this effect leads certain topological
mechanical structures to exhibit an abrupt change in the pressure -- a bulk
signature of the underlying topological invariant at finite temperature. We
conclude with a discussion of anharmonic corrections and potential applications
of our work to the the engineering of DNA origami devices and molecular robots.
| cond-mat.soft | folding mechanisms are zero elastic energy motions essential to the deployment of origami linkages reconfigurable metamaterials and robotic structures in this paper we determine the fate of folding mechanisms when such structures are miniaturized so that thermal fluctuations cannot be neglected first we identify geometric and topological design strategies aimed at minimizing undesired thermal energy barriers that generically obstruct kinematic mechanisms at the microscale our findings are illustrated in the context of a quasi onedimensional linkage structure that harbors a topologically protected mechanism however thermal fluctuations can also be exploited to deliberately lock a reconfigurable metamaterial into a fully expanded configuration a process reminiscent of order by disorder transitions in magnetic systems we demonstrate that this effect leads certain topological mechanical structures to exhibit an abrupt change in the pressure a bulk signature of the underlying topological invariant at finite temperature we conclude with a discussion of anharmonic corrections and potential applications of our work to the the engineering of dna origami devices and molecular robots | [['folding', 'mechanisms', 'are', 'zero', 'elastic', 'energy', 'motions', 'essential', 'to', 'the', 'deployment', 'of', 'origami', 'linkages', 'reconfigurable', 'metamaterials', 'and', 'robotic', 'structures', 'in', 'this', 'paper', 'we', 'determine', 'the', 'fate', 'of', 'folding', 'mechanisms', 'when', 'such', 'structures', 'are', 'miniaturized', 'so', 'that', 'thermal', 'fluctuations', 'can', 'not', 'be', 'neglected', 'first', 'we', 'identify', 'geometric', 'and', 'topological', 'design', 'strategies', 'aimed', 'at', 'minimizing', 'undesired', 'thermal', 'energy', 'barriers', 'that', 'generically', 'obstruct', 'kinematic', 'mechanisms', 'at', 'the', 'microscale', 'our', 'findings', 'are', 'illustrated', 'in', 'the', 'context', 'of', 'a', 'quasi', 'onedimensional', 'linkage', 'structure', 'that', 'harbors', 'a', 'topologically', 'protected', 'mechanism', 'however', 'thermal', 'fluctuations', 'can', 'also', 'be', 'exploited', 'to', 'deliberately', 'lock', 'a', 'reconfigurable', 'metamaterial', 'into', 'a', 'fully', 'expanded', 'configuration', 'a', 'process', 'reminiscent', 'of', 'order', 'by', 'disorder', 'transitions', 'in', 'magnetic', 'systems', 'we', 'demonstrate', 'that', 'this', 'effect', 'leads', 'certain', 'topological', 'mechanical', 'structures', 'to', 'exhibit', 'an', 'abrupt', 'change', 'in', 'the', 'pressure', 'a', 'bulk', 'signature', 'of', 'the', 'underlying', 'topological', 'invariant', 'at', 'finite', 'temperature', 'we', 'conclude', 'with', 'a', 'discussion', 'of', 'anharmonic', 'corrections', 'and', 'potential', 'applications', 'of', 'our', 'work', 'to', 'the', 'the', 'engineering', 'of', 'dna', 'origami', 'devices', 'and', 'molecular', 'robots']] | [-0.21034799249630845, 0.2005489349880564, -0.10116711135362526, 0.03964703423039255, -0.09450670771724629, -0.1289378105583294, 0.04358820687884654, 0.40747287491347617, -0.3071817510655362, -0.2744697622151789, 0.05678580362003988, -0.23692180993715803, -0.23759216980166556, 0.15872468888581157, -0.043683821363318824, 0.039628735933073624, 0.018008107444951814, -0.06165524833406249, -0.01668739794128892, -0.16440018150651503, 0.29140242015173334, 0.068106157521154, 0.2958338057209632, 0.09588986377247113, 0.0648033651244453, -0.058517431257526856, 0.049099933535897894, 0.050276622371357715, -0.16176262658879212, 0.10622253085481013, 0.2725290762494781, -0.018497642308116673, 0.2234126601582895, -0.46149152549664063, -0.2515979944317027, 0.0828173126869216, 0.15379273118228168, 0.15543317264866105, -0.05498365854599072, -0.25758711944758045, 0.1006756801294821, -0.15005382538973883, -0.17018441173997723, -0.11289187188296507, -0.019859021073217714, -0.0006354093432432029, -0.18181074832595362, 0.027630114218068148, 0.08261283068822886, 0.0825597070308101, -0.08293008878466347, -0.06184307791287091, -0.06973272987953694, 0.10850953429182406, -0.008783576402340563, -0.03666641843410398, 0.21329514778492425, -0.12553664120917996, -0.15972865136719483, 0.4071883437151234, 0.012432479216650262, -0.1860441690377757, 0.19073720589770884, -0.09491511087510511, -0.13558279112550223, 0.1795861234743438, 0.18323964356238434, 0.0710973198592529, -0.14630986235885599, 0.04426006992169081, 0.0634229313268488, 0.14177210168047907, 0.056214397147152866, 0.06545387652931278, 0.2841132672414362, 0.18857126234623486, 0.05767110579028101, 0.17055946791092838, -0.043064446871665246, -0.08129444514250683, -0.28862311148424885, -0.16062640070268316, -0.1638895173189035, 0.052880285073627305, -0.04679501916018376, -0.2049299777028134, 0.38605559936830564, 0.15861927374193938, 0.18051533464657443, -0.023287236249955472, 0.2935238868182157, 0.042777346582695684, 0.10097075147766196, 0.03944955095592998, 0.23271571501147023, 0.10169683575412694, 0.08923489871312178, -0.2479947718693547, 0.056091196443272116, -0.008051516426849864] |
1,802.02705 | Frobenius powers | This article extends the notion of a Frobenius power of an ideal in prime
characteristic to allow arbitrary nonnegative real exponents. These generalized
Frobenius powers are closely related to test ideals in prime characteristic,
and multiplier ideals over fields of characteristic zero. For instance, like
these well-known families of ideals, Frobenius powers also give rise to jumping
exponents that we call critical Frobenius exponents. In fact, the Frobenius
powers of a principal ideal coincides with its test ideals, but appear to be a
more refined measure of singularities in general. Herein, we develop the theory
of Frobenius powers in regular domains, and apply it to study singularities,
especially those of generic hypersurfaces. These applications illustrate one
way in which multiplier ideals behave more like Frobenius powers than like test
ideals.
| math.AC math.AG | this article extends the notion of a frobenius power of an ideal in prime characteristic to allow arbitrary nonnegative real exponents these generalized frobenius powers are closely related to test ideals in prime characteristic and multiplier ideals over fields of characteristic zero for instance like these wellknown families of ideals frobenius powers also give rise to jumping exponents that we call critical frobenius exponents in fact the frobenius powers of a principal ideal coincides with its test ideals but appear to be a more refined measure of singularities in general herein we develop the theory of frobenius powers in regular domains and apply it to study singularities especially those of generic hypersurfaces these applications illustrate one way in which multiplier ideals behave more like frobenius powers than like test ideals | [['this', 'article', 'extends', 'the', 'notion', 'of', 'a', 'frobenius', 'power', 'of', 'an', 'ideal', 'in', 'prime', 'characteristic', 'to', 'allow', 'arbitrary', 'nonnegative', 'real', 'exponents', 'these', 'generalized', 'frobenius', 'powers', 'are', 'closely', 'related', 'to', 'test', 'ideals', 'in', 'prime', 'characteristic', 'and', 'multiplier', 'ideals', 'over', 'fields', 'of', 'characteristic', 'zero', 'for', 'instance', 'like', 'these', 'wellknown', 'families', 'of', 'ideals', 'frobenius', 'powers', 'also', 'give', 'rise', 'to', 'jumping', 'exponents', 'that', 'we', 'call', 'critical', 'frobenius', 'exponents', 'in', 'fact', 'the', 'frobenius', 'powers', 'of', 'a', 'principal', 'ideal', 'coincides', 'with', 'its', 'test', 'ideals', 'but', 'appear', 'to', 'be', 'a', 'more', 'refined', 'measure', 'of', 'singularities', 'in', 'general', 'herein', 'we', 'develop', 'the', 'theory', 'of', 'frobenius', 'powers', 'in', 'regular', 'domains', 'and', 'apply', 'it', 'to', 'study', 'singularities', 'especially', 'those', 'of', 'generic', 'hypersurfaces', 'these', 'applications', 'illustrate', 'one', 'way', 'in', 'which', 'multiplier', 'ideals', 'behave', 'more', 'like', 'frobenius', 'powers', 'than', 'like', 'test', 'ideals']] | [-0.16148366274204679, 0.04427884146313702, -0.08806870281953777, 0.12145021011461862, -0.10221966708687923, -0.20166269415416396, -0.10390443152192837, 0.27589464008432024, -0.3523260693137462, -0.1755467558816935, 0.09499430257576302, -0.25402585787053866, -0.1431334046754413, 0.2527140293843471, -0.13486724325384086, 0.0220648003630161, -0.0014078022446483373, 0.11799186727999209, -0.10728072029574273, -0.29565545342002925, 0.45536919276659876, 0.049037757425461535, 0.22882813572919425, 0.008687768013288195, 0.034137748969862096, -0.05128046894589296, -0.021955403721389863, 0.0336364429220199, -0.18527424687081992, 0.12830264075623396, 0.3382696422819908, 0.06561520900577307, 0.25911251444799394, -0.39041455878088105, -0.07022989141539886, 0.2314950049424974, 0.14223551410362303, -0.025208860561430742, 0.023364053031456514, -0.1762473729224159, 0.15450618187538706, -0.19857767692659622, -0.21316179047862532, -0.14995162586609906, 0.0323373150295363, 0.07896527362665018, -0.30506545862612816, -0.0039530367682276005, 0.13433307068010505, 0.16231408123141872, -0.0258101903878224, -0.12246850340609224, 0.049265305291359814, 0.026581246914485327, 0.013007038455599775, -0.05189157320150676, 0.09671665836806194, -0.11167739434525943, -0.15663331198649338, 0.34602521729583924, -0.0177582597437252, -0.2030397544041849, 0.16415188922188603, -0.21042911207030277, -0.10742241653542106, 0.11300147864967584, 0.08249920268829625, 0.15890047231939836, -0.003519075782969594, 0.12299829534380338, -0.0927635026952395, 0.028177956720957388, 0.14648002166515933, 0.05828066671204467, 0.17458889479211603, 0.017762685602960678, 0.08770953146382593, 0.16132731188643867, -0.005359474913432048, -0.04886890286579728, -0.33288837740323146, -0.19497146383286096, -0.1491432214442354, 0.15653405944243648, -0.13345710871933708, -0.20064384297897608, 0.4453464895343551, 0.14555767082895796, 0.1964098985163638, 0.11620334808875878, 0.23109604167895248, 0.07655720285211619, 0.08207346702872131, 0.060379918278732264, 0.1157796569311848, 0.22543914290503242, -0.0023710337942107937, -0.11414530993654178, -0.027069760292159538, 0.15147593391056244] |
1,802.02706 | Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The
Two-User Case | Centralized coded caching problem is studied for the two-user scenario,
considering heterogeneous cache capacities at the users and private channels
from the server to the users, in addition to a shared channel. Optimal caching
and delivery strategies that minimize the worst-case delivery latency are
presented for an arbitrary number of files. The converse proof follows from the
sufficiency of file-index-symmetric caching and delivery codes, while the
achievability is obtained through memory-sharing among a number of special
memory capacity pairs. The optimal scheme is shown to exploit the private link
capacities by transmitting part of the corresponding user`s request in an
uncoded fashion. When there are no private links, the results presented here
improve upon the two known results in the literature, namely, i) equal cache
capacities and arbitrary number of files; and ii) unequal cache capacities and
$N=2$ files. The results are then extended to the caching problem with
heterogeneous distortion requirements.
| cs.IT math.IT | centralized coded caching problem is studied for the twouser scenario considering heterogeneous cache capacities at the users and private channels from the server to the users in addition to a shared channel optimal caching and delivery strategies that minimize the worstcase delivery latency are presented for an arbitrary number of files the converse proof follows from the sufficiency of fileindexsymmetric caching and delivery codes while the achievability is obtained through memorysharing among a number of special memory capacity pairs the optimal scheme is shown to exploit the private link capacities by transmitting part of the corresponding users request in an uncoded fashion when there are no private links the results presented here improve upon the two known results in the literature namely i equal cache capacities and arbitrary number of files and ii unequal cache capacities and n2 files the results are then extended to the caching problem with heterogeneous distortion requirements | [['centralized', 'coded', 'caching', 'problem', 'is', 'studied', 'for', 'the', 'twouser', 'scenario', 'considering', 'heterogeneous', 'cache', 'capacities', 'at', 'the', 'users', 'and', 'private', 'channels', 'from', 'the', 'server', 'to', 'the', 'users', 'in', 'addition', 'to', 'a', 'shared', 'channel', 'optimal', 'caching', 'and', 'delivery', 'strategies', 'that', 'minimize', 'the', 'worstcase', 'delivery', 'latency', 'are', 'presented', 'for', 'an', 'arbitrary', 'number', 'of', 'files', 'the', 'converse', 'proof', 'follows', 'from', 'the', 'sufficiency', 'of', 'fileindexsymmetric', 'caching', 'and', 'delivery', 'codes', 'while', 'the', 'achievability', 'is', 'obtained', 'through', 'memorysharing', 'among', 'a', 'number', 'of', 'special', 'memory', 'capacity', 'pairs', 'the', 'optimal', 'scheme', 'is', 'shown', 'to', 'exploit', 'the', 'private', 'link', 'capacities', 'by', 'transmitting', 'part', 'of', 'the', 'corresponding', 'users', 'request', 'in', 'an', 'uncoded', 'fashion', 'when', 'there', 'are', 'no', 'private', 'links', 'the', 'results', 'presented', 'here', 'improve', 'upon', 'the', 'two', 'known', 'results', 'in', 'the', 'literature', 'namely', 'i', 'equal', 'cache', 'capacities', 'and', 'arbitrary', 'number', 'of', 'files', 'and', 'ii', 'unequal', 'cache', 'capacities', 'and', 'n2', 'files', 'the', 'results', 'are', 'then', 'extended', 'to', 'the', 'caching', 'problem', 'with', 'heterogeneous', 'distortion', 'requirements']] | [-0.25000030040318477, 0.02265203795769708, 0.008006884133603596, 0.045309239831160975, -0.045411637324272405, -0.29708406660360415, 0.19775985281556746, 0.363845587646379, -0.2820335257033639, -0.27860526596843604, 0.1149844389157493, -0.2981258890428118, -0.10174436876642833, 0.11837171718196031, -0.16717042173536506, 0.06977967649238764, 0.013158284503821437, 0.05843814636352441, 0.006536652369498713, -0.379140528714568, 0.3182657481578259, 0.08843637819229225, 0.35180289151504734, 0.07032971136543333, 0.02347697677177112, 0.03502272756844266, -0.08479483001896285, -0.04023514072786992, -0.11960642538612612, 0.08683262729943292, 0.3489772661878968, 0.21356977871156588, 0.2331781160111064, -0.42192989727790586, -0.17983625884112342, 0.0556213794937604, 0.15179968024881568, 0.0759126774963633, -0.05565213581349775, -0.24910074966460072, 0.1408174814693383, -0.22125578590434367, 0.014371839444467564, 0.03960359341693142, -0.03681990915804559, 0.07793040781101483, -0.3583620460457261, -0.04609124196557612, -0.0072237383790116835, 0.0028468703558909036, -0.0717875492922493, -0.13531728469402782, 0.013101582050206685, 0.20382159043566805, 0.04507242969240352, -0.016549362986046354, 0.08900974023260719, -0.10411500272384247, -0.14221178881503296, 0.37692553572208676, 0.04311752622825285, -0.22975275675081555, 0.1137761028629222, -0.03531048621439579, -0.09473083406649777, 0.17507017110027248, 0.21338992359869133, 0.05117863845326845, -0.17971113284586063, 0.029886037004118574, -0.07705086524851176, 0.1745968715531369, 0.12725290882135956, 0.164575810006832, 0.10869445294659856, 0.14182596733109, 0.13564893403954015, 0.18346905329770452, -0.043283524574551556, -0.15497146130520975, -0.2378553724886282, -0.15163908575874266, -0.24469039238841328, -0.024912467587196473, -0.14134905898318292, -0.030370369313603932, 0.29747185940531506, 0.09490568082878328, 0.10831266200626331, 0.1760398567968745, 0.4049895670517835, 0.037539426598926104, 0.06427725533714258, 0.23777060278857878, 0.10590543658996852, 0.0633477087006195, 0.17038407077587253, -0.20430495917784752, 0.12373023982844408, 0.007790664303431053] |
1,802.02707 | An interview based study of pioneering experiences in teaching and
learning Complex Systems in Higher Education | Due to the interdisciplinary nature of complex systems as a field, students
studying complex systems at University level have diverse disciplinary
backgrounds. This brings challenges (e.g. wide range of computer programming
skills) but also opportunities (e.g. facilitating interdisciplinary
interactions and projects) for the classroom. However, there is little
published regarding how these challenges and opportunities are handled in
teaching and learning Complex Systems as an explicit subject in higher
education, and how this differs in comparison to other subject areas. We seek
to explore these particular challenges and opportunities via an interview-based
study of pioneering teachers and learners (conducted amongst the authors)
regarding their experiences. We compare and contrast those experiences, and
analyse them with respect to the educational literature. Our discussions
explored: approaches to curriculum design, how theories/models/frameworks of
teaching and learning informed decisions and experience, how diversity in
student backgrounds was addressed, and assessment task design. We found a
striking level of commonality in the issues expressed as well as the strategies
to handle them, for example a significant focus on problem-based learning, and
the use of major student-led creative projects for both achieving and assessing
learning outcomes.
| physics.ed-ph nlin.AO | due to the interdisciplinary nature of complex systems as a field students studying complex systems at university level have diverse disciplinary backgrounds this brings challenges eg wide range of computer programming skills but also opportunities eg facilitating interdisciplinary interactions and projects for the classroom however there is little published regarding how these challenges and opportunities are handled in teaching and learning complex systems as an explicit subject in higher education and how this differs in comparison to other subject areas we seek to explore these particular challenges and opportunities via an interviewbased study of pioneering teachers and learners conducted amongst the authors regarding their experiences we compare and contrast those experiences and analyse them with respect to the educational literature our discussions explored approaches to curriculum design how theoriesmodelsframeworks of teaching and learning informed decisions and experience how diversity in student backgrounds was addressed and assessment task design we found a striking level of commonality in the issues expressed as well as the strategies to handle them for example a significant focus on problembased learning and the use of major studentled creative projects for both achieving and assessing learning outcomes | [['due', 'to', 'the', 'interdisciplinary', 'nature', 'of', 'complex', 'systems', 'as', 'a', 'field', 'students', 'studying', 'complex', 'systems', 'at', 'university', 'level', 'have', 'diverse', 'disciplinary', 'backgrounds', 'this', 'brings', 'challenges', 'eg', 'wide', 'range', 'of', 'computer', 'programming', 'skills', 'but', 'also', 'opportunities', 'eg', 'facilitating', 'interdisciplinary', 'interactions', 'and', 'projects', 'for', 'the', 'classroom', 'however', 'there', 'is', 'little', 'published', 'regarding', 'how', 'these', 'challenges', 'and', 'opportunities', 'are', 'handled', 'in', 'teaching', 'and', 'learning', 'complex', 'systems', 'as', 'an', 'explicit', 'subject', 'in', 'higher', 'education', 'and', 'how', 'this', 'differs', 'in', 'comparison', 'to', 'other', 'subject', 'areas', 'we', 'seek', 'to', 'explore', 'these', 'particular', 'challenges', 'and', 'opportunities', 'via', 'an', 'interviewbased', 'study', 'of', 'pioneering', 'teachers', 'and', 'learners', 'conducted', 'amongst', 'the', 'authors', 'regarding', 'their', 'experiences', 'we', 'compare', 'and', 'contrast', 'those', 'experiences', 'and', 'analyse', 'them', 'with', 'respect', 'to', 'the', 'educational', 'literature', 'our', 'discussions', 'explored', 'approaches', 'to', 'curriculum', 'design', 'how', 'theoriesmodelsframeworks', 'of', 'teaching', 'and', 'learning', 'informed', 'decisions', 'and', 'experience', 'how', 'diversity', 'in', 'student', 'backgrounds', 'was', 'addressed', 'and', 'assessment', 'task', 'design', 'we', 'found', 'a', 'striking', 'level', 'of', 'commonality', 'in', 'the', 'issues', 'expressed', 'as', 'well', 'as', 'the', 'strategies', 'to', 'handle', 'them', 'for', 'example', 'a', 'significant', 'focus', 'on', 'problembased', 'learning', 'and', 'the', 'use', 'of', 'major', 'studentled', 'creative', 'projects', 'for', 'both', 'achieving', 'and', 'assessing', 'learning', 'outcomes']] | [-0.03599423356847, 0.060838751518444735, -0.05184030100344754, 0.10430204085993369, -0.1502458937244401, -0.1684275697744279, 0.06925937195035023, 0.4148474915554284, -0.22655279892521402, -0.3915290479741069, 0.09200329414172168, -0.2823441171964443, -0.21695795642315513, 0.21433397511109, -0.14145381611934493, 0.025695812590321693, 0.06928050910275449, 0.0024579819627525037, -0.07116103878185626, -0.2919540877611667, 0.32389689254126064, 0.09440672759917718, 0.31758032907687483, 0.07473342587663817, 0.08183920788751156, -0.001705251450258647, -0.09464467672394618, -0.011217169424213429, -0.11412253206079609, 0.1818817233686488, 0.41984931053593755, 0.21843088725729595, 0.4151449907255709, -0.4198842902459012, -0.18585895545467754, 0.046244047851013464, 0.12749830618480382, 0.08074626839773917, -0.08495555624424939, -0.3125479629943295, 0.006869231737231116, -0.1928063501904487, -0.10474049808117487, -0.12461638275691599, -0.004595391937068333, 0.01221253641661769, -0.18810118422301475, -0.033681933694025105, 0.0487035472375937, 0.15674303269762763, -0.04065751154148192, -0.17384345913995747, 0.06575011989353077, 0.22826180608065985, 0.11010197141126449, 0.032394510372628076, 0.14424450417319018, -0.22395338089742436, -0.18718503595997515, 0.4036050712561639, 0.040840047162775166, -0.1646903659947427, 0.2889547038745756, -0.09271250200635266, -0.14659294731257158, 0.010498124532027062, 0.2746132912912539, 0.05833793378302029, -0.1523732375082555, 0.04643661490482618, 0.062045083261740505, 0.13498907559181725, 0.04468222209788297, 0.014062932699166667, 0.22863618689022525, 0.1960768897527405, 0.015548327512713888, 0.09551581457810397, 0.02636819471889693, -0.1292660148498952, -0.21411118857937042, -0.14866464247523004, -0.08600818888018173, -0.004357925844107749, -0.004367590587073074, -0.08999288883848638, 0.37146342104724633, 0.1940779738453409, 0.11056174530041596, 0.00578537920278019, 0.27161485285784004, 0.023922183398753603, 0.055436046063535346, 0.05303957517025992, 0.19661679752211075, 0.05118609913600185, 0.20723508089958204, -0.15730374774657851, 0.08037466947703804, -0.08313284843607877] |
1,802.02708 | Some remarks on the non-real roots of polynomials | Let $f \in { \mathbb R} ( t) [x]$ be given by $ f(t, x) = x^n + t \cdot g(x)
$ and $\beta_1 < \dots < \beta_m$ the distinct real roots of the discriminant
$\Delta_{(f, x)} (t)$ of $f(t, x)$ with respect to $x$. Let $\gamma$ be the
number of real roots of $g(x)=\sum_{k=0}^s t_{s-k} x^{s-k}$. For any $\xi > |
\beta_m |$, if $n-s$ is odd then the number of real roots of $f(\xi, x)$ is
$\gamma+1$, and if $n-s$ is even then the number of real roots of $f(\xi, x)$
is $\gamma$, $\gamma+2$ if $t_s>0$ or $t_s < 0$ respectively. A special case of
the above result is constructing a family of totally complex polynomials which
are reducible over $\mathbb Q$.
| math.NT math.RA | let f in mathbb r t x be given by ft x xn t cdot gx and beta_1 dots beta_m the distinct real roots of the discriminant delta_f x t of ft x with respect to x let gamma be the number of real roots of gxsum_k0s t_sk xsk for any xi beta_m if ns is odd then the number of real roots of fxi x is gamma1 and if ns is even then the number of real roots of fxi x is gamma gamma2 if t_s0 or t_s 0 respectively a special case of the above result is constructing a family of totally complex polynomials which are reducible over mathbb q | [['let', 'f', 'in', 'mathbb', 'r', 't', 'x', 'be', 'given', 'by', 'ft', 'x', 'xn', 't', 'cdot', 'gx', 'and', 'beta_1', 'dots', 'beta_m', 'the', 'distinct', 'real', 'roots', 'of', 'the', 'discriminant', 'delta_f', 'x', 't', 'of', 'ft', 'x', 'with', 'respect', 'to', 'x', 'let', 'gamma', 'be', 'the', 'number', 'of', 'real', 'roots', 'of', 'gxsum_k0s', 't_sk', 'xsk', 'for', 'any', 'xi', 'beta_m', 'if', 'ns', 'is', 'odd', 'then', 'the', 'number', 'of', 'real', 'roots', 'of', 'fxi', 'x', 'is', 'gamma1', 'and', 'if', 'ns', 'is', 'even', 'then', 'the', 'number', 'of', 'real', 'roots', 'of', 'fxi', 'x', 'is', 'gamma', 'gamma2', 'if', 't_s0', 'or', 't_s', '0', 'respectively', 'a', 'special', 'case', 'of', 'the', 'above', 'result', 'is', 'constructing', 'a', 'family', 'of', 'totally', 'complex', 'polynomials', 'which', 'are', 'reducible', 'over', 'mathbb', 'q']] | [-0.23501100882210516, 0.1725163889117539, -0.03465437984771349, -0.04921914888863367, -0.039371828952888877, -0.20260533508421344, -0.012327167467976158, 0.3084284023170105, -0.31173688635568725, -0.17463787604303269, 0.041514723785009915, -0.3391716454199261, -0.06596468644089658, 0.1986909531162713, -0.009494134563614021, -0.03805630743842233, -0.03191520961382511, 0.19581779077310454, -0.09742026535413144, -0.315912878614935, 0.3024530860341408, -0.1046040699055249, 0.0824440373615785, -0.005004179807887836, 0.1031917552548376, -0.014397759100591595, 0.09717307470061562, -0.03387536764229563, -0.15345717737959189, 0.009777562498030338, 0.2828873942013491, 0.10223521468314258, 0.2220213663510301, -0.2737156296318228, -0.12264482594222169, 0.30954320327886803, 0.1433662810489874, -0.19264167442557995, 0.06829069715247235, -0.23210532781879673, 0.19898095483976333, -0.09628708453171632, -0.14320653409866446, -0.032555843419818715, 0.18741917336909947, 0.06450815221125429, -0.359442983483049, 0.05279514541510831, 0.08506073319268498, 0.08215662007304755, 0.04205600307323039, -0.2049723326186226, -0.08270639576631683, 0.017385324732061815, 0.024455919398248874, 0.18065569010055202, 0.04085350303953005, -0.04782584885304624, -0.028216555655341258, 0.3678132509235928, -0.03950153170576827, -0.2178961325267499, 0.05657064885917035, -0.2719699241178618, -0.12552615576847034, 0.15981484164843673, 0.07648724450052462, 0.19562084537676788, 0.019822521988217802, 0.31600288640263235, -0.09808180739637465, 0.16598399043591186, 0.1192103288856081, -0.06790490144525062, 0.1334570588798008, 0.050982292982834305, 0.012920245206491513, 0.07456140755040741, -0.03852247649549761, 0.06390769597545097, -0.39047821253030135, -0.18367891398851166, -0.22523090005005625, 0.24990693141960285, -0.18188678718103224, -0.1307995941151272, 0.3109225264157761, 0.019595683814788406, 0.22481366775675932, 0.0900885628758591, 0.17555030097507618, 0.12752649699422447, -0.056829012697562575, 0.08029999875751938, -0.009609022620134055, 0.19401804105675016, -0.03426760084482587, -0.14330213598652997, 0.027580198455093935, 0.08936009697446769] |
1,802.02709 | Layered Coding of Hidden Markov Sources | The paper studies optimal coding of hidden Markov sources (HMS), which
represent a broad class of practical sources obtained through noisy acquisition
processes, beside their explicit modeling use in speech processing and
recognition, image understanding and sensor networks. A new fundamental source
coding approach for HMS is proposed, based on tracking an estimate of the state
probability distribution, and is shown to be optimal. Practical encoder and
decoder schemes that leverage the main concepts are introduced. An iterative
approach is developed for optimizing the system. It also focuses on a
significant extension of the optimal HMS quantization paradigm. It proposes a
new approach for scalable coding of HMS which accounts for all the available
information while coding a given layer. Simulation results confirm that these
approaches significantly reduce the reconstructed distortion and substantially
outperform existing techniques.
| eess.SP | the paper studies optimal coding of hidden markov sources hms which represent a broad class of practical sources obtained through noisy acquisition processes beside their explicit modeling use in speech processing and recognition image understanding and sensor networks a new fundamental source coding approach for hms is proposed based on tracking an estimate of the state probability distribution and is shown to be optimal practical encoder and decoder schemes that leverage the main concepts are introduced an iterative approach is developed for optimizing the system it also focuses on a significant extension of the optimal hms quantization paradigm it proposes a new approach for scalable coding of hms which accounts for all the available information while coding a given layer simulation results confirm that these approaches significantly reduce the reconstructed distortion and substantially outperform existing techniques | [['the', 'paper', 'studies', 'optimal', 'coding', 'of', 'hidden', 'markov', 'sources', 'hms', 'which', 'represent', 'a', 'broad', 'class', 'of', 'practical', 'sources', 'obtained', 'through', 'noisy', 'acquisition', 'processes', 'beside', 'their', 'explicit', 'modeling', 'use', 'in', 'speech', 'processing', 'and', 'recognition', 'image', 'understanding', 'and', 'sensor', 'networks', 'a', 'new', 'fundamental', 'source', 'coding', 'approach', 'for', 'hms', 'is', 'proposed', 'based', 'on', 'tracking', 'an', 'estimate', 'of', 'the', 'state', 'probability', 'distribution', 'and', 'is', 'shown', 'to', 'be', 'optimal', 'practical', 'encoder', 'and', 'decoder', 'schemes', 'that', 'leverage', 'the', 'main', 'concepts', 'are', 'introduced', 'an', 'iterative', 'approach', 'is', 'developed', 'for', 'optimizing', 'the', 'system', 'it', 'also', 'focuses', 'on', 'a', 'significant', 'extension', 'of', 'the', 'optimal', 'hms', 'quantization', 'paradigm', 'it', 'proposes', 'a', 'new', 'approach', 'for', 'scalable', 'coding', 'of', 'hms', 'which', 'accounts', 'for', 'all', 'the', 'available', 'information', 'while', 'coding', 'a', 'given', 'layer', 'simulation', 'results', 'confirm', 'that', 'these', 'approaches', 'significantly', 'reduce', 'the', 'reconstructed', 'distortion', 'and', 'substantially', 'outperform', 'existing', 'techniques']] | [-0.0843751096048543, -0.0031289313797862955, -0.08605104169178315, 0.06345198832380394, -0.07737896312370568, -0.22701808086747086, 0.06345229208733037, 0.4016992578502087, -0.2754875431932947, -0.2884944228045403, 0.12065349686771001, -0.2192004429662655, -0.217525724111029, 0.23288746582179823, -0.13442218892861788, 0.10588003372472218, 0.09060367218369399, 0.01711091894813923, -0.06835989621878766, -0.23434683696627068, 0.27723203167689087, 0.10409892865401857, 0.4007084762252977, 0.01942496166071471, 0.1682501009062809, 0.014306906276889256, -0.09010426859672674, -0.04623006419997717, -0.07766239382448582, 0.19587806909454658, 0.29410728650605855, 0.20327742534059592, 0.27295153867795735, -0.3599443256046952, -0.2885773741051226, 0.04543810461729984, 0.15661156179917538, 0.1351551209706539, -0.0952104249753414, -0.29738937680582134, 0.1162806754342883, -0.17234600184019655, 0.002437567132908632, -0.07753999892841368, -0.056149908012765294, 0.005430626398318803, -0.31306603759088936, 0.01678292392149588, 0.08869006892885356, 0.008617395480327746, -0.07834237638641806, -0.13449758013388524, 0.06131249713807312, 0.16385071956114294, -0.001742855049943661, 0.04641994500364971, 0.11651386159663911, -0.11632700009067776, -0.16368659767014085, 0.3480899770305875, -0.008798095318899654, -0.21606077575672636, 0.16177031103528433, -0.004589163357570001, -0.1738792786388384, 0.14995747358154723, 0.22389172377092215, 0.11508498195967952, -0.19146817839903044, 0.024037921432703595, -0.009495662124690545, 0.21209139131892965, 0.04178023066111457, 0.08376961166162372, 0.16502986370709122, 0.21151860565399094, 0.07731604377177599, 0.15142161766262313, -0.1011976381055052, -0.10985130335628877, -0.25281773431240306, -0.1252528960998033, -0.20504955603203545, -0.04167315207408084, -0.10163687623860503, -0.1323573304927028, 0.3683155170224114, 0.2152318056426285, 0.13302045952706762, 0.08188893729033332, 0.3600305837171618, 0.07835320718860363, 0.07406757160959601, 0.12288805969771655, 0.18109197057920562, 0.11611443924245096, 0.09518796536105904, -0.17468659190532942, 0.10184006675434135, 0.043799270302235314] |
1,802.0271 | A low phase noise microwave frequency synthesizer based on parameters
optimized NLTL for Cs fountain clock | We report on the development and phase noise performance of a 9.1926 GHz
microwave frequency synthesizer to be used as the local oscillator for a Cs
fountain clock. It is based on frequency multiplication and synthesis from an
ultralow phase noise 5 MHz Oven Controlled Crystal Oscillator (OCXO) and 100
MHz Voltage Controlled Crystal Oscillator (VCXO).The key component of the
frequency multiplication is a non-linear transmission-line (NLTL) used as a
frequency comb generator. The phase noise of the synthesizer is improved by
carefully optimizing the input power, the input and output impedances of the
NLTL. The absolute phase noises of the 9.1926 GHz output signal are measured to
be -64 dBc/Hz, -83 dBc/Hz, -92 dBc/Hz, -117 dBc/Hz and -119 dBc/Hz at 1 Hz,
10Hz, 100Hz, 1 kHz and 10 kHz offset frequencies, respectively. The residual
phase noise of the synthesizer is measured to be -82 dBc/Hz at 1 Hz offset
frequency. The measurement result shows that the absolute phase noise at the
frequency range of 1 - 100 Hz is mainly limited by the phase noise of the OCXO.
The contribution of the absolute phase noise to the fountain clock short-term
frequency stability is calculated to be 7.0x10^(-14). The residual frequency
stability of the synthesizer is measured to be1.5x10^(-14), which is consistent
with the calculated frequency stability due to the residual phase noise of the
synthesizer. Meanwhile we designed and realized an interferometric microwave
switch in the synthesizer to eliminate the frequency shifts induced by the
microwave leakage. The extinction ratio of the switch is measured to be more
than 50 dB. In the scheme, we use only commercially available components to
build the microwave frequency synthesizer with excellent phase noise
performance for high-performance Cs fountain clocks.
| physics.atom-ph | we report on the development and phase noise performance of a 91926 ghz microwave frequency synthesizer to be used as the local oscillator for a cs fountain clock it is based on frequency multiplication and synthesis from an ultralow phase noise 5 mhz oven controlled crystal oscillator ocxo and 100 mhz voltage controlled crystal oscillator vcxothe key component of the frequency multiplication is a nonlinear transmissionline nltl used as a frequency comb generator the phase noise of the synthesizer is improved by carefully optimizing the input power the input and output impedances of the nltl the absolute phase noises of the 91926 ghz output signal are measured to be 64 dbchz 83 dbchz 92 dbchz 117 dbchz and 119 dbchz at 1 hz 10hz 100hz 1 khz and 10 khz offset frequencies respectively the residual phase noise of the synthesizer is measured to be 82 dbchz at 1 hz offset frequency the measurement result shows that the absolute phase noise at the frequency range of 1 100 hz is mainly limited by the phase noise of the ocxo the contribution of the absolute phase noise to the fountain clock shortterm frequency stability is calculated to be 70x1014 the residual frequency stability of the synthesizer is measured to be15x1014 which is consistent with the calculated frequency stability due to the residual phase noise of the synthesizer meanwhile we designed and realized an interferometric microwave switch in the synthesizer to eliminate the frequency shifts induced by the microwave leakage the extinction ratio of the switch is measured to be more than 50 db in the scheme we use only commercially available components to build the microwave frequency synthesizer with excellent phase noise performance for highperformance cs fountain clocks | [['we', 'report', 'on', 'the', 'development', 'and', 'phase', 'noise', 'performance', 'of', 'a', '91926', 'ghz', 'microwave', 'frequency', 'synthesizer', 'to', 'be', 'used', 'as', 'the', 'local', 'oscillator', 'for', 'a', 'cs', 'fountain', 'clock', 'it', 'is', 'based', 'on', 'frequency', 'multiplication', 'and', 'synthesis', 'from', 'an', 'ultralow', 'phase', 'noise', '5', 'mhz', 'oven', 'controlled', 'crystal', 'oscillator', 'ocxo', 'and', '100', 'mhz', 'voltage', 'controlled', 'crystal', 'oscillator', 'vcxothe', 'key', 'component', 'of', 'the', 'frequency', 'multiplication', 'is', 'a', 'nonlinear', 'transmissionline', 'nltl', 'used', 'as', 'a', 'frequency', 'comb', 'generator', 'the', 'phase', 'noise', 'of', 'the', 'synthesizer', 'is', 'improved', 'by', 'carefully', 'optimizing', 'the', 'input', 'power', 'the', 'input', 'and', 'output', 'impedances', 'of', 'the', 'nltl', 'the', 'absolute', 'phase', 'noises', 'of', 'the', '91926', 'ghz', 'output', 'signal', 'are', 'measured', 'to', 'be', '64', 'dbchz', '83', 'dbchz', '92', 'dbchz', '117', 'dbchz', 'and', '119', 'dbchz', 'at', '1', 'hz', '10hz', '100hz', '1', 'khz', 'and', '10', 'khz', 'offset', 'frequencies', 'respectively', 'the', 'residual', 'phase', 'noise', 'of', 'the', 'synthesizer', 'is', 'measured', 'to', 'be', '82', 'dbchz', 'at', '1', 'hz', 'offset', 'frequency', 'the', 'measurement', 'result', 'shows', 'that', 'the', 'absolute', 'phase', 'noise', 'at', 'the', 'frequency', 'range', 'of', '1', '100', 'hz', 'is', 'mainly', 'limited', 'by', 'the', 'phase', 'noise', 'of', 'the', 'ocxo', 'the', 'contribution', 'of', 'the', 'absolute', 'phase', 'noise', 'to', 'the', 'fountain', 'clock', 'shortterm', 'frequency', 'stability', 'is', 'calculated', 'to', 'be', '70x1014', 'the', 'residual', 'frequency', 'stability', 'of', 'the', 'synthesizer', 'is', 'measured', 'to', 'be15x1014', 'which', 'is', 'consistent', 'with', 'the', 'calculated', 'frequency', 'stability', 'due', 'to', 'the', 'residual', 'phase', 'noise', 'of', 'the', 'synthesizer', 'meanwhile', 'we', 'designed', 'and', 'realized', 'an', 'interferometric', 'microwave', 'switch', 'in', 'the', 'synthesizer', 'to', 'eliminate', 'the', 'frequency', 'shifts', 'induced', 'by', 'the', 'microwave', 'leakage', 'the', 'extinction', 'ratio', 'of', 'the', 'switch', 'is', 'measured', 'to', 'be', 'more', 'than', '50', 'db', 'in', 'the', 'scheme', 'we', 'use', 'only', 'commercially', 'available', 'components', 'to', 'build', 'the', 'microwave', 'frequency', 'synthesizer', 'with', 'excellent', 'phase', 'noise', 'performance', 'for', 'highperformance', 'cs', 'fountain', 'clocks']] | [-0.1549083423564645, 0.18064098352208066, 0.017684622383067655, -0.04814008014916702, -0.035605257531700414, -0.1504010797376241, 0.12618427642443392, 0.42999494561510876, -0.24809705145005465, -0.3037558704772602, 0.12556260938891095, -0.23180638261083036, -0.06558598944252561, 0.2515464206538805, -0.06854774693007393, 0.035309989602624214, -0.017044447898015697, -0.0005527118306488536, -0.03302991851198751, -0.13633281121346374, 0.17422970281848058, 0.14269422889479794, 0.3497250795417034, -0.06280419009148601, 0.14009368767659097, -0.12442805753138851, 0.0032482158504558117, -0.1090302335216858, -0.0681378579808388, 0.027331001195207556, 0.26665282306383126, 0.05217561784057217, 0.20737059063742155, -0.31282618543126556, -0.17896749846663576, 0.11028271360658504, 0.04493355907601808, 0.10652547371911063, -0.0014765338387357585, -0.3219322654099431, 0.08716423276074678, -0.19041168172399484, -0.06404233397669143, -0.012292707373483548, 0.007716635322731397, 0.03252939010440461, -0.2697679355901801, 0.0956114017184126, 0.06208407179561078, 0.10643267673325096, -0.05899776312828643, -0.13803028742463555, 0.015957537192732834, 0.09497622224305223, -0.09251814410452444, 0.09232203046340404, 0.19634327524779333, -0.035802363424624443, -0.08384964276802835, 0.3489800410792758, -0.1545192058037826, -0.09559435360857645, 0.11860193389010461, -0.16732288445856144, -0.00424169164559024, 0.1931885428539092, 0.14705590146462935, -0.002832085456203031, -0.12833649255113197, 0.00646459855087424, 0.15983191058994023, 0.3532663820090937, 0.17718213871483404, 0.0820334483128923, 0.16572305686482272, 0.16267245937494212, 0.047735273193002574, 0.16756273495722826, -0.20720503155727024, 0.014883910407841431, -0.24863905932296845, -0.050298776773755625, -0.20149679371450332, 0.03739137819872728, -0.07797366975813441, -0.09759832685648763, 0.4408103297839274, 0.16987731474757772, 0.16791147104622434, 0.01360877569519681, 0.38976269056724366, 0.18065451516530415, 0.062263104532328646, 0.011267774433963818, 0.31534223680387746, 0.18114971588431553, 0.117871915947896, -0.26522071119447244, -0.01900399763913753, -0.04974342084180419] |
1,802.02711 | Visualizing Heavy Fermion Confinement and Pauli-Limited
Superconductivity in Layered CeCoIn5 | Layered material structures play a key role in enhancing electron-electron
interactions to create correlated metallic phases that can transform into
unconventional superconducting states. The quasi-two-dimensional electronic
properties of such compounds are often inferred indirectly through examination
of their bulk properties. Here we use scanning tunneling microscopy and
spectroscopy to directly probe in cross section the quasi-two-dimensional
correlated electronic states of the heavy fermion superconductor CeCoIn5. Our
measurements reveal the strong confined nature of heavy quasi-particles,
anisotropy of tunneling characteristics, and layer-by-layer modulated behavior
of the precursor pseudogap gap phase in this compound. Examining the interlayer
coupled superconducting state at low temperatures, we find that the orientation
of line defects relative to the d-wave order parameter determines whether
in-gap states form due to scattering. Spectroscopic imaging of the anisotropic
magnetic vortex cores directly characterizes the short interlayer
superconducting coherence length and shows an electronic phase separation near
the upper critical in-plane magnetic field, consistent with a Pauli-limited
first-order phase transition into a pseudogap phase.
| cond-mat.str-el | layered material structures play a key role in enhancing electronelectron interactions to create correlated metallic phases that can transform into unconventional superconducting states the quasitwodimensional electronic properties of such compounds are often inferred indirectly through examination of their bulk properties here we use scanning tunneling microscopy and spectroscopy to directly probe in cross section the quasitwodimensional correlated electronic states of the heavy fermion superconductor cecoin5 our measurements reveal the strong confined nature of heavy quasiparticles anisotropy of tunneling characteristics and layerbylayer modulated behavior of the precursor pseudogap gap phase in this compound examining the interlayer coupled superconducting state at low temperatures we find that the orientation of line defects relative to the dwave order parameter determines whether ingap states form due to scattering spectroscopic imaging of the anisotropic magnetic vortex cores directly characterizes the short interlayer superconducting coherence length and shows an electronic phase separation near the upper critical inplane magnetic field consistent with a paulilimited firstorder phase transition into a pseudogap phase | [['layered', 'material', 'structures', 'play', 'a', 'key', 'role', 'in', 'enhancing', 'electronelectron', 'interactions', 'to', 'create', 'correlated', 'metallic', 'phases', 'that', 'can', 'transform', 'into', 'unconventional', 'superconducting', 'states', 'the', 'quasitwodimensional', 'electronic', 'properties', 'of', 'such', 'compounds', 'are', 'often', 'inferred', 'indirectly', 'through', 'examination', 'of', 'their', 'bulk', 'properties', 'here', 'we', 'use', 'scanning', 'tunneling', 'microscopy', 'and', 'spectroscopy', 'to', 'directly', 'probe', 'in', 'cross', 'section', 'the', 'quasitwodimensional', 'correlated', 'electronic', 'states', 'of', 'the', 'heavy', 'fermion', 'superconductor', 'cecoin5', 'our', 'measurements', 'reveal', 'the', 'strong', 'confined', 'nature', 'of', 'heavy', 'quasiparticles', 'anisotropy', 'of', 'tunneling', 'characteristics', 'and', 'layerbylayer', 'modulated', 'behavior', 'of', 'the', 'precursor', 'pseudogap', 'gap', 'phase', 'in', 'this', 'compound', 'examining', 'the', 'interlayer', 'coupled', 'superconducting', 'state', 'at', 'low', 'temperatures', 'we', 'find', 'that', 'the', 'orientation', 'of', 'line', 'defects', 'relative', 'to', 'the', 'dwave', 'order', 'parameter', 'determines', 'whether', 'ingap', 'states', 'form', 'due', 'to', 'scattering', 'spectroscopic', 'imaging', 'of', 'the', 'anisotropic', 'magnetic', 'vortex', 'cores', 'directly', 'characterizes', 'the', 'short', 'interlayer', 'superconducting', 'coherence', 'length', 'and', 'shows', 'an', 'electronic', 'phase', 'separation', 'near', 'the', 'upper', 'critical', 'inplane', 'magnetic', 'field', 'consistent', 'with', 'a', 'paulilimited', 'firstorder', 'phase', 'transition', 'into', 'a', 'pseudogap', 'phase']] | [-0.22058048670071584, 0.26623195264228844, -0.06619884330883588, 0.06545193513578226, -0.06181589778558425, -0.15277779851383044, 0.10961987209282073, 0.3733394885138591, -0.28968790574627784, -0.27357297865216806, -0.06629477468664913, -0.35646021514673903, -0.11390617157138336, 0.1438004841022422, 0.1048311657026593, 0.0276455923619318, -0.04125237840147792, -0.07235755814857883, -0.13480183987541158, -0.1798478071086385, 0.3291283027251805, 0.028149978014886196, 0.3714491647005401, 0.11976775941096154, -0.00845434147710312, 0.012138262436799477, 0.14047014560447607, 0.004933088786465807, -0.16357083532695324, 0.025037667977243685, 0.2916115018627692, -0.13094878589385903, 0.1523567490976738, -0.47555353117683913, -0.21110805407440736, 0.0060971615818347724, 0.18618890813171887, 0.11963825602301516, -0.06129834736680235, -0.316956196551674, 0.011194412065155666, -0.08739063275572301, -0.12521481208011873, -0.12636405657805458, -0.05337287503526049, -0.0278053183817059, -0.2001607521648513, 0.12435133413531663, 0.02269819991091199, 0.0923389097755315, -0.12132436133338356, -0.0661193846090714, -0.06990822171078183, 0.03386521065590526, 0.01706467878196297, 0.05213639279398953, 0.18671763256946408, -0.1442058320829296, -0.07654590615602724, 0.3140592427432903, -0.03909730243688003, -0.0287285372043497, 0.15665016423316638, -0.17712731544005875, -0.07435727297568386, 0.20583422204616703, 0.12052622491328126, 0.06068742747327164, -0.1184751204075006, 0.02006496596803597, -0.0007475642544543085, 0.2227480281215801, 0.02328711699271586, 0.18268602893922042, 0.30847223049909606, 0.20341945991050053, -0.00108223253621097, 0.1559844399299587, -0.15361047606626696, -0.05852774275821045, -0.20810636598616838, -0.2034162593308402, -0.21563111102362764, 0.04377920576103426, -0.049684037936960655, -0.23896935754427057, 0.39123669263272565, 0.15910435726143352, 0.20670801563244856, -0.15077345028656758, 0.2342834359797666, 0.07570543829808754, 0.0689695153693937, 0.009552613957756502, 0.26143638475975195, 0.20783122801693282, 0.1214374834728753, -0.3489542746390759, 0.12126751896297484, 0.016052629478687158] |
1,802.02712 | New Equation For Describing Time Dependence of Moon Orbit Radius | I derived an equation to describe the dependence of Moon orbit radius around
the Earth. I obtained the radius changes with time according to a scaling
equation, Moon orbit radius is proportional to power 2/5 of the Moon age. Using
the equation I have been able to predict accurately some quantities that have
been well accepted
| physics.pop-ph | i derived an equation to describe the dependence of moon orbit radius around the earth i obtained the radius changes with time according to a scaling equation moon orbit radius is proportional to power 25 of the moon age using the equation i have been able to predict accurately some quantities that have been well accepted | [['i', 'derived', 'an', 'equation', 'to', 'describe', 'the', 'dependence', 'of', 'moon', 'orbit', 'radius', 'around', 'the', 'earth', 'i', 'obtained', 'the', 'radius', 'changes', 'with', 'time', 'according', 'to', 'a', 'scaling', 'equation', 'moon', 'orbit', 'radius', 'is', 'proportional', 'to', 'power', '25', 'of', 'the', 'moon', 'age', 'using', 'the', 'equation', 'i', 'have', 'been', 'able', 'to', 'predict', 'accurately', 'some', 'quantities', 'that', 'have', 'been', 'well', 'accepted']] | [-0.06639382950379513, 0.10813475671940458, -0.15126204681915364, 0.07494406436411996, -0.11303560169679779, -0.0958404968675625, -0.010843754492400746, 0.3351337659571852, -0.250951778376475, -0.35370892635546625, 0.09265832928940654, -0.31459178116970826, -0.08832673125185206, 0.16365852216923876, -0.08618811281797077, 0.06408930444324921, 0.033916777026856186, 0.07623826489517731, -0.08124297655636578, -0.22885285364879696, 0.23666234989650548, 0.1281615150344026, 0.15141213472400392, 0.022629431270096183, 0.0962327241265614, -0.07543497937565137, 0.008135879295878112, 0.03933382050399814, -0.2294527627575787, 0.017948087885997666, 0.17394334735789535, 0.13641075797412278, 0.1996593754405954, -0.41172642034611534, -0.20832651826952184, 0.05815077001378605, 0.1263663427837725, 0.03983066380689187, -0.012594256333873741, -0.26300208039382206, 0.09758851916662284, -0.24407129059545696, -0.24051257546982793, 0.02191495165295367, 0.18609976186417043, 0.05789148199671347, -0.18949936308698462, 0.0633118649836563, 0.014092108502934155, 0.06545248201915196, -0.13155576568429492, -0.1604138959186717, -0.01645172939918536, 0.16450107985708332, 0.12154593667530987, 0.024667023780888746, 0.1560682157786297, 0.0005542634836664158, -0.015370100237695234, 0.425229051050597, -0.08337411312719009, -0.14566869503219745, 0.1374265491654764, -0.21161906879361986, -0.042279671906726435, 0.1461226379033178, 0.14379074298111455, 0.09450236527066279, -0.17529452294443867, 0.05880088744119608, -0.015574596720398404, 0.21268874766038998, 0.0838138242709517, -0.02538833872781002, 0.27145044039934874, 0.10399012087977358, 0.050790491189608086, 0.019125556423594908, -0.1697749863212396, -0.11032911546395294, -0.208229127323388, -0.1014071883068287, -0.1878025916729322, 0.06139419134706259, -0.07052115954658282, -0.11236271406856499, 0.35072180555601207, 0.1836422766957964, 0.2149440013371142, 0.031396996030317884, 0.23748912757063018, 0.17641516089705483, 0.10812357535386193, 0.10800055902551062, 0.3083108979818852, 0.1530214405419039, 0.0956143427340846, -0.2579540309546116, 0.09368239416341696, 0.07976202463864215] |
1,802.02713 | Direct observation of spin excitation anisotropy in the paramagnetic
orthorhombic state of BaFe$_{2-x}$Ni$_x$As$_2$ | We use transport and inelastic neutron scattering measurements to investigate
single crystals of iron pnictide BaFe$_{2-x}$Ni$_{x}$As$_{2}$ ($x=0,0.03$),
which exhibit a tetragonal-to-orthorhombic structural transition at $T_s$ and
stripe antiferromagnetic order at $T_N$ ($T_s\geq T_N$).
Using a tunable uniaxial pressure device, we detwin the crystals and study
their transport and spin excitation properties at antiferromagnetic wave vector
$S_1(1,0)$ and its 90$^\circ$ rotated wave vector $S_2(0,1)$ under different
pressure conditions. We find that uniaxial pressure necessary to detwin and
maintain single domain orthorhombic antiferromagnetic phase of
BaFe$_{2-x}$Ni$_{x}$As$_{2}$ induces resistivity and spin excitation anisotropy
at temperatures above zero pressure $T_s$. In uniaxial pressure-free detwinned
sample, spin excitation anisotropy between $S_1(1,0)$ and $S_2(0,1)$ first
appear in the paramagnetic orthorhombic phase below $T_s$. These results are
consistent with predictions of spin nematic theory, suggesting the absence of
structural or nematic phase transition above $T_s$ in iron pnictides.
| cond-mat.supr-con | we use transport and inelastic neutron scattering measurements to investigate single crystals of iron pnictide bafe_2xni_xas_2 x0003 which exhibit a tetragonaltoorthorhombic structural transition at t_s and stripe antiferromagnetic order at t_n t_sgeq t_n using a tunable uniaxial pressure device we detwin the crystals and study their transport and spin excitation properties at antiferromagnetic wave vector s_110 and its 90circ rotated wave vector s_201 under different pressure conditions we find that uniaxial pressure necessary to detwin and maintain single domain orthorhombic antiferromagnetic phase of bafe_2xni_xas_2 induces resistivity and spin excitation anisotropy at temperatures above zero pressure t_s in uniaxial pressurefree detwinned sample spin excitation anisotropy between s_110 and s_201 first appear in the paramagnetic orthorhombic phase below t_s these results are consistent with predictions of spin nematic theory suggesting the absence of structural or nematic phase transition above t_s in iron pnictides | [['we', 'use', 'transport', 'and', 'inelastic', 'neutron', 'scattering', 'measurements', 'to', 'investigate', 'single', 'crystals', 'of', 'iron', 'pnictide', 'bafe_2xni_xas_2', 'x0003', 'which', 'exhibit', 'a', 'tetragonaltoorthorhombic', 'structural', 'transition', 'at', 't_s', 'and', 'stripe', 'antiferromagnetic', 'order', 'at', 't_n', 't_sgeq', 't_n', 'using', 'a', 'tunable', 'uniaxial', 'pressure', 'device', 'we', 'detwin', 'the', 'crystals', 'and', 'study', 'their', 'transport', 'and', 'spin', 'excitation', 'properties', 'at', 'antiferromagnetic', 'wave', 'vector', 's_110', 'and', 'its', '90circ', 'rotated', 'wave', 'vector', 's_201', 'under', 'different', 'pressure', 'conditions', 'we', 'find', 'that', 'uniaxial', 'pressure', 'necessary', 'to', 'detwin', 'and', 'maintain', 'single', 'domain', 'orthorhombic', 'antiferromagnetic', 'phase', 'of', 'bafe_2xni_xas_2', 'induces', 'resistivity', 'and', 'spin', 'excitation', 'anisotropy', 'at', 'temperatures', 'above', 'zero', 'pressure', 't_s', 'in', 'uniaxial', 'pressurefree', 'detwinned', 'sample', 'spin', 'excitation', 'anisotropy', 'between', 's_110', 'and', 's_201', 'first', 'appear', 'in', 'the', 'paramagnetic', 'orthorhombic', 'phase', 'below', 't_s', 'these', 'results', 'are', 'consistent', 'with', 'predictions', 'of', 'spin', 'nematic', 'theory', 'suggesting', 'the', 'absence', 'of', 'structural', 'or', 'nematic', 'phase', 'transition', 'above', 't_s', 'in', 'iron', 'pnictides']] | [-0.22140523324654038, 0.34196559155825523, 0.0018875652990703073, -0.050821603748149105, -0.0814885540782208, -0.1164167671364599, 0.09974053784223673, 0.4820490128626781, -0.27221808349713683, -0.24249812541529536, -0.01037488605278278, -0.378173556458205, -0.05818799498125112, 0.08763324329795848, 0.17296051969751716, 0.004922887117053116, -0.13587319663492964, -0.01360915280487721, -0.21637201555838276, -0.1617165586586842, 0.24388436416297088, -0.032787749068146306, 0.3487436515827929, 0.05068301163472435, 0.05760243785501059, 0.00802793538397444, 0.23083620961822038, 0.014800155244302005, -0.25890142515693565, -0.0780137596286035, 0.33056499768946584, -0.15553658531446543, 0.08757192795830114, -0.3913479237881152, -0.20078123487266047, 0.0011247359748397555, 0.08148287347451384, 0.12455059148820251, -0.0409405450028966, -0.2704650804466967, 0.046931319984806964, -0.09938887343076723, -0.1376772407754158, -0.16940559174482978, -0.10159520019910165, -0.029999249027709344, -0.23534359950572253, 0.22808206360121921, 0.13545676140513804, 0.17626727446248489, -0.15816518068230445, -0.1519469807922308, -0.13266280642378012, -0.04855425284476951, 0.09000191251481218, 0.11555629455251619, 0.18387689976287738, -0.07790952514457916, -0.08152960697521588, 0.344065673363262, -0.03638978877986249, 0.04271445592333164, 0.12207467452223812, -0.2503871977595346, -0.10565472176614484, 0.26950198234657624, 0.11048014558764407, 0.05373819717039753, -0.1008653941763831, 0.019239844305307736, 0.04754148562060436, 0.23529637237744672, 0.10463585826634829, 0.05673588406976445, 0.2621849690031792, 0.17639810180823717, 0.028619799437001346, 0.14223255832579784, -0.13146168825166699, 0.002105462913667517, -0.2139825515864816, -0.13976757301549828, -0.18586401866881974, 0.054297440762456975, -0.12422387676363411, -0.17814139434402543, 0.2999175837063896, 0.17454335180643413, 0.1653304506625448, -0.07740773513963047, 0.17359279095960248, 0.04753631554361034, 0.016956084946702633, 0.03222224017871278, 0.22776132120551276, 0.24861616606691053, 0.1645826626968171, -0.35416656111234, 0.08945238972041157, -0.023896412015892564] |
1,802.02714 | Earth-like and Tardigrade survey of exoplanets | Finding life on other worlds is a fascinating area of astrobiology and
planetary sciences. Presently, over 3500 exoplanets, representing a very wide
range of physical and chemical environments, are known. Tardigrades (water
bears) are microscopic invertebrates that inhabit almost all terrestrial,
freshwater and marine habitats, from the highest mountains to the deepest
oceans. Thanks to their ability to live in a state of cryptobiosis, which is
known to be an adaptation to unpredictably fluctuating environmental
conditions, these organisms are able to survive when conditions are not
suitable for active life; consequently, tardigrades are known as the toughest
animals on Earth. In their cryptobiotic state, they can survive extreme
conditions, such as temperatures below -250{\deg}C and up to 150{\deg}C, high
doses of ultraviolet and ionising radiation, up to 30 years without liquid
water, low and high atmospheric pressure, and exposure to many toxic chemicals.
Active tardigrades are also resistant to a wide range of unfavourable
environmental conditions, which makes them an excellent model organism for
astrobiological studies. In our study, we have established a metric tool for
distinguishing the potential survivability of active and cryptobiotic
tardigrades on rocky-water and water-gas planets in our solar system and
exoplanets, taking into consideration the geometrical means of surface
temperature and surface pressure of the considered planets. The Active
Tardigrade Index (ATI) and Cryobiotic Tardigrade Index (CTI) are two metric
indices with minimum value 0 (= tardigrades cannot survive) and maximum 1 (=
tardigrades will survive in their respective state). Values between 0 and 1
indicate a percentage chance of the active or cryptobiotic tardigrades
surviving on a given exoplanet.
| physics.pop-ph | finding life on other worlds is a fascinating area of astrobiology and planetary sciences presently over 3500 exoplanets representing a very wide range of physical and chemical environments are known tardigrades water bears are microscopic invertebrates that inhabit almost all terrestrial freshwater and marine habitats from the highest mountains to the deepest oceans thanks to their ability to live in a state of cryptobiosis which is known to be an adaptation to unpredictably fluctuating environmental conditions these organisms are able to survive when conditions are not suitable for active life consequently tardigrades are known as the toughest animals on earth in their cryptobiotic state they can survive extreme conditions such as temperatures below 250degc and up to 150degc high doses of ultraviolet and ionising radiation up to 30 years without liquid water low and high atmospheric pressure and exposure to many toxic chemicals active tardigrades are also resistant to a wide range of unfavourable environmental conditions which makes them an excellent model organism for astrobiological studies in our study we have established a metric tool for distinguishing the potential survivability of active and cryptobiotic tardigrades on rockywater and watergas planets in our solar system and exoplanets taking into consideration the geometrical means of surface temperature and surface pressure of the considered planets the active tardigrade index ati and cryobiotic tardigrade index cti are two metric indices with minimum value 0 tardigrades cannot survive and maximum 1 tardigrades will survive in their respective state values between 0 and 1 indicate a percentage chance of the active or cryptobiotic tardigrades surviving on a given exoplanet | [['finding', 'life', 'on', 'other', 'worlds', 'is', 'a', 'fascinating', 'area', 'of', 'astrobiology', 'and', 'planetary', 'sciences', 'presently', 'over', '3500', 'exoplanets', 'representing', 'a', 'very', 'wide', 'range', 'of', 'physical', 'and', 'chemical', 'environments', 'are', 'known', 'tardigrades', 'water', 'bears', 'are', 'microscopic', 'invertebrates', 'that', 'inhabit', 'almost', 'all', 'terrestrial', 'freshwater', 'and', 'marine', 'habitats', 'from', 'the', 'highest', 'mountains', 'to', 'the', 'deepest', 'oceans', 'thanks', 'to', 'their', 'ability', 'to', 'live', 'in', 'a', 'state', 'of', 'cryptobiosis', 'which', 'is', 'known', 'to', 'be', 'an', 'adaptation', 'to', 'unpredictably', 'fluctuating', 'environmental', 'conditions', 'these', 'organisms', 'are', 'able', 'to', 'survive', 'when', 'conditions', 'are', 'not', 'suitable', 'for', 'active', 'life', 'consequently', 'tardigrades', 'are', 'known', 'as', 'the', 'toughest', 'animals', 'on', 'earth', 'in', 'their', 'cryptobiotic', 'state', 'they', 'can', 'survive', 'extreme', 'conditions', 'such', 'as', 'temperatures', 'below', '250degc', 'and', 'up', 'to', '150degc', 'high', 'doses', 'of', 'ultraviolet', 'and', 'ionising', 'radiation', 'up', 'to', '30', 'years', 'without', 'liquid', 'water', 'low', 'and', 'high', 'atmospheric', 'pressure', 'and', 'exposure', 'to', 'many', 'toxic', 'chemicals', 'active', 'tardigrades', 'are', 'also', 'resistant', 'to', 'a', 'wide', 'range', 'of', 'unfavourable', 'environmental', 'conditions', 'which', 'makes', 'them', 'an', 'excellent', 'model', 'organism', 'for', 'astrobiological', 'studies', 'in', 'our', 'study', 'we', 'have', 'established', 'a', 'metric', 'tool', 'for', 'distinguishing', 'the', 'potential', 'survivability', 'of', 'active', 'and', 'cryptobiotic', 'tardigrades', 'on', 'rockywater', 'and', 'watergas', 'planets', 'in', 'our', 'solar', 'system', 'and', 'exoplanets', 'taking', 'into', 'consideration', 'the', 'geometrical', 'means', 'of', 'surface', 'temperature', 'and', 'surface', 'pressure', 'of', 'the', 'considered', 'planets', 'the', 'active', 'tardigrade', 'index', 'ati', 'and', 'cryobiotic', 'tardigrade', 'index', 'cti', 'are', 'two', 'metric', 'indices', 'with', 'minimum', 'value', '0', 'tardigrades', 'can', 'not', 'survive', 'and', 'maximum', '1', 'tardigrades', 'will', 'survive', 'in', 'their', 'respective', 'state', 'values', 'between', '0', 'and', '1', 'indicate', 'a', 'percentage', 'chance', 'of', 'the', 'active', 'or', 'cryptobiotic', 'tardigrades', 'surviving', 'on', 'a', 'given', 'exoplanet']] | [-0.08221093718271606, 0.22466838852178136, -0.040735819362731955, 0.07330387012972371, -0.05616896304344737, -0.0967044395490967, 0.07568472069358075, 0.3780293733379322, -0.1992015613785363, -0.389705049116664, 0.11991133716919056, -0.27868612589021535, -0.11987596581568692, 0.21151895869422482, -0.10352959607146195, 0.018478474202014993, 0.034913000798341726, 0.011141501459644543, 0.022395986109798937, -0.24154905545778602, 0.24141282215000798, 0.07567933669324493, 0.18718187190178368, 0.057641540067466655, 0.08088346240256772, -0.08362726705176471, 0.011244250691613588, -0.02479517974148565, -0.12596847051126242, 0.0449103845544989, 0.2942881240630772, 0.13671121091699634, 0.2561754910311023, -0.4173705480632397, -0.24774316377167044, 0.12859937228918988, 0.10118317629176753, 0.045125410967895414, -0.03648349615054783, -0.24622063347944897, 0.08213532619692128, -0.16056285196133815, -0.15514724659537218, -0.04106649515616897, 0.04877659385681324, 0.023196271493236116, -0.2336115664731126, 0.04765432071883206, -0.0026189949964726222, 0.1047395563798589, -0.14162208809039173, -0.16728335069233757, -0.08616448461409958, 0.18069510907391925, 0.04526770842605952, -0.02325404553417245, 0.20440590653525686, -0.15139669546736154, 0.004295912956626251, 0.4001610751845428, -0.04664888147396746, -0.09685028597228122, 0.31170715374864955, -0.17659807901015911, -0.08930025070819572, 0.16604866575756577, 0.1817101104170712, 0.12368708825224146, -0.15979078068011895, -0.0011082076697505054, 0.0037152246871813275, 0.13233577447561584, 0.10292796909245323, 0.05299298421451215, 0.2788426701864406, 0.15778894552878922, 0.08919999974586205, 0.056882848925451424, -0.1081550145572831, -0.07191232581519419, -0.18432445841675474, -0.1665458925839128, -0.12237799292032418, 0.05854400056978541, -0.07817510149936313, -0.1636321237507023, 0.3299234067455605, 0.15601380758783226, 0.13555726210115712, 0.01661365343859041, 0.2510280806528426, 0.003511299172209369, 0.07802615058786767, 0.04834999352643602, 0.257580970615591, 0.09254441456735434, 0.101636041156498, -0.18561526774063036, 0.11844592440328774, -0.050448592070675674] |
1,802.02715 | Gromov-Hyperbolicity of the ray graph and quasimorphisms on a big
mapping class group | These notes are the English version of the paper "Hyperbolicit\'e du graphe
des rayons et quasi-morphismes sur un gros groupe modulaire".
The mapping class group Gamma of the complement of a Cantor set in the plane
arises naturally in dynamics. We show that the ray graph, which is the analog
of the complex of curves for this surface of infinite type, has infinite
diameter and is hyperbolic. We use the action of Gamma on this graph to find an
explicit non trivial quasimorphism on Gamma and to show that this group has
infinite dimensional second bounded cohomology. Finally we give an example of a
hyperbolic element of Gamma with vanishing stable commutator length. This
carries out a program proposed by Danny Calegari.
| math.GT math.DS math.GR | these notes are the english version of the paper hyperbolicite du graphe des rayons et quasimorphismes sur un gros groupe modulaire the mapping class group gamma of the complement of a cantor set in the plane arises naturally in dynamics we show that the ray graph which is the analog of the complex of curves for this surface of infinite type has infinite diameter and is hyperbolic we use the action of gamma on this graph to find an explicit non trivial quasimorphism on gamma and to show that this group has infinite dimensional second bounded cohomology finally we give an example of a hyperbolic element of gamma with vanishing stable commutator length this carries out a program proposed by danny calegari | [['these', 'notes', 'are', 'the', 'english', 'version', 'of', 'the', 'paper', 'hyperbolicite', 'du', 'graphe', 'des', 'rayons', 'et', 'quasimorphismes', 'sur', 'un', 'gros', 'groupe', 'modulaire', 'the', 'mapping', 'class', 'group', 'gamma', 'of', 'the', 'complement', 'of', 'a', 'cantor', 'set', 'in', 'the', 'plane', 'arises', 'naturally', 'in', 'dynamics', 'we', 'show', 'that', 'the', 'ray', 'graph', 'which', 'is', 'the', 'analog', 'of', 'the', 'complex', 'of', 'curves', 'for', 'this', 'surface', 'of', 'infinite', 'type', 'has', 'infinite', 'diameter', 'and', 'is', 'hyperbolic', 'we', 'use', 'the', 'action', 'of', 'gamma', 'on', 'this', 'graph', 'to', 'find', 'an', 'explicit', 'non', 'trivial', 'quasimorphism', 'on', 'gamma', 'and', 'to', 'show', 'that', 'this', 'group', 'has', 'infinite', 'dimensional', 'second', 'bounded', 'cohomology', 'finally', 'we', 'give', 'an', 'example', 'of', 'a', 'hyperbolic', 'element', 'of', 'gamma', 'with', 'vanishing', 'stable', 'commutator', 'length', 'this', 'carries', 'out', 'a', 'program', 'proposed', 'by', 'danny', 'calegari']] | [-0.17968624412344816, 0.097654197623995, -0.1324615840935427, 0.032307185939091265, -0.11689719911187123, -0.067219268447027, 0.0006151429475006512, 0.310022543112819, -0.2889103932449451, -0.2261021176759058, 0.10643240413827519, -0.29549659193596906, -0.1773424254427863, 0.21321162789996362, -0.14113554284653157, -0.03102725510446665, 0.04742725696474409, 0.09111930858184639, -0.05617819932631703, -0.25734816301608077, 0.37187331505756605, 0.014385760254843527, 0.21893809446030194, 0.011469541276749382, 0.1423549613612903, 0.03515076562841861, -0.03078073790917794, -0.0013636167869608626, -0.18730880002131484, 0.12200771764310825, 0.27008502413797325, 0.06328855835808775, 0.20626500119558638, -0.3388677323077861, -0.1794562945022988, 0.1687492690463033, 0.09505211918925245, 0.032273818684033416, -0.04461222065763914, -0.28365652102372074, 0.11910042489488792, -0.17042616745218253, -0.14882934723113084, -0.012872135716402886, 0.03069890443331156, 0.006762713685424792, -0.19849298395908987, 0.015860426629710402, 0.11294332541063683, 0.10462663208858834, -0.0008800099772982235, -0.09517253615941183, -0.04866999512514434, 0.08369381308682963, -0.00257661992795447, 0.05877625190953398, 0.044630139083084136, -0.030356304685032476, -0.09900020270033254, 0.37293855151814276, -0.09715336346133159, -0.18708548511768508, 0.1555709456766231, -0.1458301374839985, -0.20265109391293973, 0.1408708674323737, 0.14670557967331418, 0.12286545427786744, -0.023871450601384427, 0.2348299718921622, -0.12133818573846271, 0.13967668975536257, 0.08960682936569947, -0.055542089371408664, 0.11947148940406549, 0.12134142357330674, 0.0992149558210841, 0.12426901020559394, -0.036200404337818265, -0.008869403798101295, -0.3489199818358717, -0.2368721733442866, -0.14500798533260664, 0.12322042730406053, -0.08251408934488726, -0.24019825350270313, 0.3622162256580897, 0.05636504043886661, 0.15662717943987212, 0.08888972307949398, 0.20182835263484675, 0.07363544280740779, 0.011885371727821155, 0.0764741795296725, 0.14740290308896548, 0.12206922789028662, 0.0022597963698845133, -0.20106060707640167, -0.028812099136730544, 0.19209061774788883] |
1,802.02716 | On the small-$x$ behavior of the orbital angular momentum distributions
in QCD | We present the numerical solution of the leading order QCD evolution equation
for the orbital angular momentum distributions of quarks and gluons and discuss
its implications for the nucleon spin sum rule. We observe that at small-$x$,
the gluon helicity and orbital angular momentum distributions are roughly of
the same magnitude but with opposite signs, indicating a significant
cancellation between them. A similar cancellation occurs also in the quark
sector. We explain analytically the reason for this cancellation.
| hep-ph | we present the numerical solution of the leading order qcd evolution equation for the orbital angular momentum distributions of quarks and gluons and discuss its implications for the nucleon spin sum rule we observe that at smallx the gluon helicity and orbital angular momentum distributions are roughly of the same magnitude but with opposite signs indicating a significant cancellation between them a similar cancellation occurs also in the quark sector we explain analytically the reason for this cancellation | [['we', 'present', 'the', 'numerical', 'solution', 'of', 'the', 'leading', 'order', 'qcd', 'evolution', 'equation', 'for', 'the', 'orbital', 'angular', 'momentum', 'distributions', 'of', 'quarks', 'and', 'gluons', 'and', 'discuss', 'its', 'implications', 'for', 'the', 'nucleon', 'spin', 'sum', 'rule', 'we', 'observe', 'that', 'at', 'smallx', 'the', 'gluon', 'helicity', 'and', 'orbital', 'angular', 'momentum', 'distributions', 'are', 'roughly', 'of', 'the', 'same', 'magnitude', 'but', 'with', 'opposite', 'signs', 'indicating', 'a', 'significant', 'cancellation', 'between', 'them', 'a', 'similar', 'cancellation', 'occurs', 'also', 'in', 'the', 'quark', 'sector', 'we', 'explain', 'analytically', 'the', 'reason', 'for', 'this', 'cancellation']] | [-0.1541363064599677, 0.21664676213493714, -0.1295202713017949, 0.16417696530399367, -0.0694503679823799, -0.028673048650559325, 0.04877423822211149, 0.38885401206043285, -0.2048764147150975, -0.2594672558375467, -0.007787186355413631, -0.2661570339174105, -0.05814836360514164, 0.07411751713460454, 0.06018651503687485, 0.010841047259208817, 0.06760708538170618, -0.009648849190666508, -0.12259779169331662, -0.211998764377756, 0.3496604825441654, 0.002771864251161997, 0.21918386615251598, 0.16434822161084947, 0.1507366329538994, 0.01330084372490931, -0.06980101025114074, -0.07397439025151424, -0.09826503880667121, 0.00622862400725866, 0.182276705968737, -0.0018219480243248816, 0.13134343769305792, -0.3927676859072959, -0.11453229364139052, 0.09053051726032908, 0.17967965999522653, 0.13246432106153896, -0.039499330561225995, -0.18222420462048972, 0.0541656009423045, -0.25070504298529184, -0.1879755861054246, -0.12026698536684331, 0.014963910243330667, -0.009425097876467193, -0.2961311615549792, 0.12731538270264325, 0.05247562064622075, 0.005835338722532377, -0.05361052811032352, -0.21566009185969448, -0.07813385782691722, 0.0667365385303035, 0.18003614073281007, 0.06630379048725352, 0.05083718884569139, -0.20640448620393634, -0.15058745076067936, 0.38221660471306396, -0.013301103311674431, -0.1878093846190052, 0.11963273526933522, -0.26584032913431144, -0.09054343841181925, 0.13098992673286164, 0.15614220952519622, 0.09839698745651194, -0.13684473833881128, 0.03517669692817622, -0.02924507865921045, 0.13751701474524078, 0.12248594008792096, 0.12238813125385115, 0.277116386172099, 0.11777379182286751, 0.030739790013728615, 0.08633217196433972, -0.1196867538088461, -0.1644378109321667, -0.3632700899377083, -0.1367831819344503, -0.12426987172176059, 0.06170881736593751, -0.14656928511137196, -0.07577617170336919, 0.40662259539254964, 0.15148657178864455, 0.22337833607199195, 0.02963198892151316, 0.3199034824024122, 0.17898380307432932, 0.09480680331277351, 0.11837898071807547, 0.2938649260277788, 0.18595828857117644, 0.1763220886286245, -0.33402860776270527, 0.02610778430990206, 0.059816303865936324] |
1,802.02717 | Paraffin coated rubidium cell with an internal atomic vapor source | We present the results of a study on relaxation and diffusion processes of
rubidium atoms in a rubidium cell with an internal vapor source. The cell is an
evacuated glass bulb, which is characterized in that the source of atomic
vapors in the form of a metal film Rb is evenly distributed throughout the
inner surface of the bulb, and the paraffin film is uniformly distributed over
the entire area and over the metal surface. By using laser optical pumping, we
performed measurements of the relaxation time and the average number of bounces
of optical pumped rubidium atoms in the bulb. We have measured the adsorption
time of rubidium atoms by paraffin coating and rubidium atoms diffusion
coefficient in paraffin used. A simple model of the pumping and atomic
diffusion processes in the cell is discussed as well.
| physics.atom-ph | we present the results of a study on relaxation and diffusion processes of rubidium atoms in a rubidium cell with an internal vapor source the cell is an evacuated glass bulb which is characterized in that the source of atomic vapors in the form of a metal film rb is evenly distributed throughout the inner surface of the bulb and the paraffin film is uniformly distributed over the entire area and over the metal surface by using laser optical pumping we performed measurements of the relaxation time and the average number of bounces of optical pumped rubidium atoms in the bulb we have measured the adsorption time of rubidium atoms by paraffin coating and rubidium atoms diffusion coefficient in paraffin used a simple model of the pumping and atomic diffusion processes in the cell is discussed as well | [['we', 'present', 'the', 'results', 'of', 'a', 'study', 'on', 'relaxation', 'and', 'diffusion', 'processes', 'of', 'rubidium', 'atoms', 'in', 'a', 'rubidium', 'cell', 'with', 'an', 'internal', 'vapor', 'source', 'the', 'cell', 'is', 'an', 'evacuated', 'glass', 'bulb', 'which', 'is', 'characterized', 'in', 'that', 'the', 'source', 'of', 'atomic', 'vapors', 'in', 'the', 'form', 'of', 'a', 'metal', 'film', 'rb', 'is', 'evenly', 'distributed', 'throughout', 'the', 'inner', 'surface', 'of', 'the', 'bulb', 'and', 'the', 'paraffin', 'film', 'is', 'uniformly', 'distributed', 'over', 'the', 'entire', 'area', 'and', 'over', 'the', 'metal', 'surface', 'by', 'using', 'laser', 'optical', 'pumping', 'we', 'performed', 'measurements', 'of', 'the', 'relaxation', 'time', 'and', 'the', 'average', 'number', 'of', 'bounces', 'of', 'optical', 'pumped', 'rubidium', 'atoms', 'in', 'the', 'bulb', 'we', 'have', 'measured', 'the', 'adsorption', 'time', 'of', 'rubidium', 'atoms', 'by', 'paraffin', 'coating', 'and', 'rubidium', 'atoms', 'diffusion', 'coefficient', 'in', 'paraffin', 'used', 'a', 'simple', 'model', 'of', 'the', 'pumping', 'and', 'atomic', 'diffusion', 'processes', 'in', 'the', 'cell', 'is', 'discussed', 'as', 'well']] | [-0.07545740884539766, 0.22399118808760354, -0.01182417212344328, -0.10421252564908397, 0.11188649990177457, -0.1095923230294948, 0.11571205070451496, 0.4585793994475102, -0.238945535964508, -0.21080200684567293, 0.05100228477343647, -0.29131815504903597, -0.054393926993066416, 0.1779177101308723, -0.0181749964510833, 0.029248998563675938, -0.01896790847809904, -0.036092550615253655, 0.016894659008898274, -0.20658165885918384, 0.22476929867559153, 0.057430066701456686, 0.2876566214169767, 0.0571156221077494, 0.12812413855968718, -0.040069932496829795, 0.04525193423572658, -0.033582244156117456, -0.11846353294711899, 0.1349216683673254, 0.2168572371997668, -0.002612680395849157, 0.20792768966150132, -0.5162285845591754, -0.25476093137420824, 0.05905374216482691, 0.14160016087302263, 0.14932119028652896, -0.07436845389589586, -0.2388151619664353, -0.04152334277666565, -0.1155158229428681, -0.11936341296962422, -0.0006750638468487971, 0.028350753183274166, 0.07237298078531318, -0.25617616842973273, 0.0501551150371307, 0.05003921166686611, 0.11684631557622249, -0.10821835775657193, -0.09320941056374568, -0.00024850289438567734, 0.05237187314238669, -0.0366269281442763, -0.0024296819195286303, 0.2646456141078818, -0.08119366701989286, -0.04175835120343212, 0.4157346555983405, -0.17864299494692165, -0.11715737592590891, 0.14776343498648942, -0.17798531753604935, 0.026012150192822235, 0.1989358712149703, 0.1516831142463438, 0.14387666701298693, -0.1570916999252918, 0.03252392189418627, -0.08853932962739382, 0.22459948411130387, 0.15651742079416694, 0.021319233046412683, 0.1868854535919061, 0.2592015003345137, 0.021032171254721132, 0.179568997075599, -0.16722184766347156, -0.08006388946196766, -0.22805104709729768, -0.23489132091956402, -0.20793030587146463, 0.03855689067690485, -0.07221603164372567, -0.15552378210249235, 0.3758785033014778, 0.04584339815124437, 0.17951680774517034, -0.08221653842053417, 0.2953992150285268, 0.07242485474410426, 0.058452898071255484, 0.019302390903855365, 0.22248573033847724, 0.1897926042733741, 0.11544088822404813, -0.2985802499975577, 0.07370553728516983, 0.006069045134253152] |
1,802.02718 | General Strong Polarization | Arikan's exciting discovery of polar codes has provided an altogether new way
to efficiently achieve Shannon capacity. Given a (constant-sized) invertible
matrix $M$, a family of polar codes can be associated with this matrix and its
ability to approach capacity follows from the {\em polarization} of an
associated $[0,1]$-bounded martingale, namely its convergence in the limit to
either $0$ or $1$. Arikan showed polarization of the martingale associated with
the matrix $G_2 = \left(\begin{matrix} 1& 0 1& 1\end{matrix}\right)$ to get
capacity achieving codes. His analysis was later extended to all matrices $M$
that satisfy an obvious necessary condition for polarization.
While Arikan's theorem does not guarantee that the codes achieve capacity at
small blocklengths, it turns out that a "strong" analysis of the polarization
of the underlying martingale would lead to such constructions. Indeed for the
martingale associated with $G_2$ such a strong polarization was shown in two
independent works ([Guruswami and Xia, IEEE IT '15] and [Hassani et al., IEEE
IT '14]), resolving a major theoretical challenge of the efficient attainment
of Shannon capacity.
In this work we extend the result above to cover martingales associated with
all matrices that satisfy the necessary condition for (weak) polarization. In
addition to being vastly more general, our proofs of strong polarization are
also simpler and modular. Specifically, our result shows strong polarization
over all prime fields and leads to efficient capacity-achieving codes for
arbitrary symmetric memoryless channels. We show how to use our analyses to
achieve exponentially small error probabilities at lengths inverse polynomial
in the gap to capacity. Indeed we show that we can essentially match any error
probability with lengths that are only inverse polynomial in the gap to
capacity.
| cs.IT math.IT | arikans exciting discovery of polar codes has provided an altogether new way to efficiently achieve shannon capacity given a constantsized invertible matrix m a family of polar codes can be associated with this matrix and its ability to approach capacity follows from the em polarization of an associated 01bounded martingale namely its convergence in the limit to either 0 or 1 arikan showed polarization of the martingale associated with the matrix g_2 leftbeginmatrix 1 0 1 1endmatrixright to get capacity achieving codes his analysis was later extended to all matrices m that satisfy an obvious necessary condition for polarization while arikans theorem does not guarantee that the codes achieve capacity at small blocklengths it turns out that a strong analysis of the polarization of the underlying martingale would lead to such constructions indeed for the martingale associated with g_2 such a strong polarization was shown in two independent works guruswami and xia ieee it 15 and hassani et al ieee it 14 resolving a major theoretical challenge of the efficient attainment of shannon capacity in this work we extend the result above to cover martingales associated with all matrices that satisfy the necessary condition for weak polarization in addition to being vastly more general our proofs of strong polarization are also simpler and modular specifically our result shows strong polarization over all prime fields and leads to efficient capacityachieving codes for arbitrary symmetric memoryless channels we show how to use our analyses to achieve exponentially small error probabilities at lengths inverse polynomial in the gap to capacity indeed we show that we can essentially match any error probability with lengths that are only inverse polynomial in the gap to capacity | [['arikans', 'exciting', 'discovery', 'of', 'polar', 'codes', 'has', 'provided', 'an', 'altogether', 'new', 'way', 'to', 'efficiently', 'achieve', 'shannon', 'capacity', 'given', 'a', 'constantsized', 'invertible', 'matrix', 'm', 'a', 'family', 'of', 'polar', 'codes', 'can', 'be', 'associated', 'with', 'this', 'matrix', 'and', 'its', 'ability', 'to', 'approach', 'capacity', 'follows', 'from', 'the', 'em', 'polarization', 'of', 'an', 'associated', '01bounded', 'martingale', 'namely', 'its', 'convergence', 'in', 'the', 'limit', 'to', 'either', '0', 'or', '1', 'arikan', 'showed', 'polarization', 'of', 'the', 'martingale', 'associated', 'with', 'the', 'matrix', 'g_2', 'leftbeginmatrix', '1', '0', '1', '1endmatrixright', 'to', 'get', 'capacity', 'achieving', 'codes', 'his', 'analysis', 'was', 'later', 'extended', 'to', 'all', 'matrices', 'm', 'that', 'satisfy', 'an', 'obvious', 'necessary', 'condition', 'for', 'polarization', 'while', 'arikans', 'theorem', 'does', 'not', 'guarantee', 'that', 'the', 'codes', 'achieve', 'capacity', 'at', 'small', 'blocklengths', 'it', 'turns', 'out', 'that', 'a', 'strong', 'analysis', 'of', 'the', 'polarization', 'of', 'the', 'underlying', 'martingale', 'would', 'lead', 'to', 'such', 'constructions', 'indeed', 'for', 'the', 'martingale', 'associated', 'with', 'g_2', 'such', 'a', 'strong', 'polarization', 'was', 'shown', 'in', 'two', 'independent', 'works', 'guruswami', 'and', 'xia', 'ieee', 'it', '15', 'and', 'hassani', 'et', 'al', 'ieee', 'it', '14', 'resolving', 'a', 'major', 'theoretical', 'challenge', 'of', 'the', 'efficient', 'attainment', 'of', 'shannon', 'capacity', 'in', 'this', 'work', 'we', 'extend', 'the', 'result', 'above', 'to', 'cover', 'martingales', 'associated', 'with', 'all', 'matrices', 'that', 'satisfy', 'the', 'necessary', 'condition', 'for', 'weak', 'polarization', 'in', 'addition', 'to', 'being', 'vastly', 'more', 'general', 'our', 'proofs', 'of', 'strong', 'polarization', 'are', 'also', 'simpler', 'and', 'modular', 'specifically', 'our', 'result', 'shows', 'strong', 'polarization', 'over', 'all', 'prime', 'fields', 'and', 'leads', 'to', 'efficient', 'capacityachieving', 'codes', 'for', 'arbitrary', 'symmetric', 'memoryless', 'channels', 'we', 'show', 'how', 'to', 'use', 'our', 'analyses', 'to', 'achieve', 'exponentially', 'small', 'error', 'probabilities', 'at', 'lengths', 'inverse', 'polynomial', 'in', 'the', 'gap', 'to', 'capacity', 'indeed', 'we', 'show', 'that', 'we', 'can', 'essentially', 'match', 'any', 'error', 'probability', 'with', 'lengths', 'that', 'are', 'only', 'inverse', 'polynomial', 'in', 'the', 'gap', 'to', 'capacity']] | [-0.1453854825878231, 0.07409168028316868, -0.0558260476967092, 0.07345178129156489, -0.05840359400897521, -0.1965614283849358, 0.0696829195769182, 0.38435860379538733, -0.2992123530276468, -0.25961191766634045, 0.11317861152615184, -0.23842338406273145, -0.13323378942323943, 0.2019071425302892, -0.1148355022029241, 0.07094707706375315, 0.04042744950019493, 0.027740589004653177, -0.07444002644306304, -0.29517884999463373, 0.2671257760275236, 0.11314734532799331, 0.2666863656934458, 0.06489642016361837, 0.0679966882306734, -0.004117225821083077, -0.01912105417322106, -0.009289637435999826, -0.1294509009710951, 0.09357891298525652, 0.2757467449837023, 0.13158903702217378, 0.21771706436365415, -0.3682293907955721, -0.1796331260279625, 0.14020004949411846, 0.1196454583165544, 0.10030844301092538, -0.030101805276552755, -0.22377041172698514, 0.14425217214362065, -0.15505548878807388, -0.11214301234660604, -0.07007412739322527, 0.01548854258789165, 0.01783851197759098, -0.340589426131249, 0.045793791553537404, 0.13304475936310017, 0.015761803857405946, -0.008901901024296584, -0.156871902162277, 0.017009421795264906, 0.10274264557210046, 0.025655175220864496, 0.06108069155204425, 0.036726573134375495, -0.06458929019373767, -0.12118177702223293, 0.3014834490644481, -0.0562966399769158, -0.19155578094822684, 0.1615150453717106, -0.15975171406150346, -0.1283487770425846, 0.1620074201663353, 0.1380618620402575, 0.08196234779864577, -0.10912106492474555, 0.09461218059266475, -0.07387917580940634, 0.17566104166430804, 0.10594504408323936, 0.0839984347437016, 0.14213722599033776, 0.06570299786830441, 0.1143944391967367, 0.14139178762733334, -0.0331283407438657, -0.09324857674429374, -0.28808562384864733, -0.15030472706324963, -0.19145198030063962, 0.10406296404432246, -0.10885980366636026, -0.13064342591689193, 0.3444871577574945, 0.1476504853172831, 0.14543615351431072, 0.11912440125187256, 0.24630928578243838, 0.07682431152169157, 0.08318652446455449, 0.1457178724340076, 0.22531775742930046, 0.18721430042001466, 0.06528893459995325, -0.18274283348900944, 0.07128470525792097, 0.042916684641784206] |
1,802.02719 | Fourier Analysis and Evaluation of DG, FD and Compact Difference Methods
for Conservation Laws | Large eddy simulation (LES) has been increasingly used to tackle
vortex-dominated turbulent flows. In LES, the quality of the simulation results
hinges upon the quality of the numerical discretizations in both space and
time. It is in this context we perform a Fourier analysis of several popular
methods in LES including the discontinuous Galerkin (DG), finite difference
(FD), and compact difference (CD) methods. We begin by reviewing the
semi-discrete versions of all methods under-consideration, followed by a
fully-discrete analysis with explicit Runge-Kutta (RK) time integration
schemes. In this regard, we are able to unravel the true dispersion/dissipation
behavior of DG and Runge-Kutta DG (RKDG) schemes for the entire wavenumber
range. The physical-mode is verified to be a good approximation for the
asymptotic behavior of these DG schemes in the low wavenumber range. After
that, we proceed to compare the DG, FD, and CD methods in dispersion and
dissipation properties. Numerical tests are conducted using the linear
advection equation to verify the analysis. In comparing different methods, it
is found that the overall numerical dissipation strongly depends on the time
step. Compact difference (CD) and central finite difference (FD) schemes, in
some particular settings, can have more numerical dissipation than the DG
scheme with an upwind flux. This claim is then verified through a numerical
test using the Burgers' equation.
| physics.comp-ph math.NA physics.flu-dyn | large eddy simulation les has been increasingly used to tackle vortexdominated turbulent flows in les the quality of the simulation results hinges upon the quality of the numerical discretizations in both space and time it is in this context we perform a fourier analysis of several popular methods in les including the discontinuous galerkin dg finite difference fd and compact difference cd methods we begin by reviewing the semidiscrete versions of all methods underconsideration followed by a fullydiscrete analysis with explicit rungekutta rk time integration schemes in this regard we are able to unravel the true dispersiondissipation behavior of dg and rungekutta dg rkdg schemes for the entire wavenumber range the physicalmode is verified to be a good approximation for the asymptotic behavior of these dg schemes in the low wavenumber range after that we proceed to compare the dg fd and cd methods in dispersion and dissipation properties numerical tests are conducted using the linear advection equation to verify the analysis in comparing different methods it is found that the overall numerical dissipation strongly depends on the time step compact difference cd and central finite difference fd schemes in some particular settings can have more numerical dissipation than the dg scheme with an upwind flux this claim is then verified through a numerical test using the burgers equation | [['large', 'eddy', 'simulation', 'les', 'has', 'been', 'increasingly', 'used', 'to', 'tackle', 'vortexdominated', 'turbulent', 'flows', 'in', 'les', 'the', 'quality', 'of', 'the', 'simulation', 'results', 'hinges', 'upon', 'the', 'quality', 'of', 'the', 'numerical', 'discretizations', 'in', 'both', 'space', 'and', 'time', 'it', 'is', 'in', 'this', 'context', 'we', 'perform', 'a', 'fourier', 'analysis', 'of', 'several', 'popular', 'methods', 'in', 'les', 'including', 'the', 'discontinuous', 'galerkin', 'dg', 'finite', 'difference', 'fd', 'and', 'compact', 'difference', 'cd', 'methods', 'we', 'begin', 'by', 'reviewing', 'the', 'semidiscrete', 'versions', 'of', 'all', 'methods', 'underconsideration', 'followed', 'by', 'a', 'fullydiscrete', 'analysis', 'with', 'explicit', 'rungekutta', 'rk', 'time', 'integration', 'schemes', 'in', 'this', 'regard', 'we', 'are', 'able', 'to', 'unravel', 'the', 'true', 'dispersiondissipation', 'behavior', 'of', 'dg', 'and', 'rungekutta', 'dg', 'rkdg', 'schemes', 'for', 'the', 'entire', 'wavenumber', 'range', 'the', 'physicalmode', 'is', 'verified', 'to', 'be', 'a', 'good', 'approximation', 'for', 'the', 'asymptotic', 'behavior', 'of', 'these', 'dg', 'schemes', 'in', 'the', 'low', 'wavenumber', 'range', 'after', 'that', 'we', 'proceed', 'to', 'compare', 'the', 'dg', 'fd', 'and', 'cd', 'methods', 'in', 'dispersion', 'and', 'dissipation', 'properties', 'numerical', 'tests', 'are', 'conducted', 'using', 'the', 'linear', 'advection', 'equation', 'to', 'verify', 'the', 'analysis', 'in', 'comparing', 'different', 'methods', 'it', 'is', 'found', 'that', 'the', 'overall', 'numerical', 'dissipation', 'strongly', 'depends', 'on', 'the', 'time', 'step', 'compact', 'difference', 'cd', 'and', 'central', 'finite', 'difference', 'fd', 'schemes', 'in', 'some', 'particular', 'settings', 'can', 'have', 'more', 'numerical', 'dissipation', 'than', 'the', 'dg', 'scheme', 'with', 'an', 'upwind', 'flux', 'this', 'claim', 'is', 'then', 'verified', 'through', 'a', 'numerical', 'test', 'using', 'the', 'burgers', 'equation']] | [-0.12688981878092676, 0.010395948947388529, -0.12154346499656443, 0.05978165323843896, -0.046120405153152515, -0.09826018969412498, -0.013465440925425304, 0.3882743714179861, -0.26495469610683176, -0.2603103840929641, 0.13137605327260918, -0.223965555375811, -0.0969062105565834, 0.2454408392275808, -0.06265036994054879, 0.0808024751811078, 0.07831106673763026, -0.0575053797185009, -0.10279565375547187, -0.24589910226056463, 0.2994512639323374, 0.05419331507259456, 0.2936572116361888, 0.01391902750503907, 0.09439219430964525, -0.11283370882942242, -0.10749412625427207, 0.05315801516818505, -0.14303665301766008, 0.06554499563379085, 0.29249643396011077, 0.030140807533482184, 0.31345243933438943, -0.4246650635337775, -0.2361808766742089, 0.06804901705024773, 0.16964993401283554, 0.08747062243710053, -0.055410940277141794, -0.24294530246235121, 0.15295927398215792, -0.19326565073897486, -0.07576373764978987, -0.10226361331216613, -0.0177806401324849, 0.08326412080937336, -0.2847528275845933, 0.10364276300128634, 0.013089000386902677, 0.08370696206057814, -0.028594638929114364, -0.09583450433656504, -0.02613231005181434, 0.08577316592357331, 0.05178710815286444, -0.04147294990601413, 0.03838074945067892, -0.06600129308741248, -0.0969966213392686, 0.40468685571018453, -0.08527984580596155, -0.2677792795563078, 0.22801810824462482, -0.11442840366929014, -0.09730634001922721, 0.1565750156409077, 0.15736683946926885, 0.16702463928275324, -0.05879812926635541, 0.08622742157758316, 0.008647722568714879, 0.1584287180065302, 0.03051945670509994, -0.03513594165075278, 0.07180290618130276, 0.1967447196285794, 0.05666869845400105, 0.054851033948555006, -0.09559757659997156, -0.1289502789549667, -0.310070979584884, -0.18779055666487476, -0.17033151904075977, -0.028136807706846515, -0.12220474073305525, -0.13436883760933777, 0.3701118445684263, 0.16614451803146832, 0.1179204993121635, 0.06348548801873342, 0.3378378774387084, 0.15890709443360113, 0.014803280087707196, 0.11110014244935514, 0.2187088777184806, 0.15722589864511438, 0.12918392703589482, -0.2744325323626914, 0.022925039272635214, 0.1588298956464444] |
1,802.0272 | A fast C++ implementation of thermal functions | We provide a small C++ library with Mathematica and Python interfaces for
computing thermal functions, defined $$ J_\text{B/F}(y^2) \equiv \Re
\int_0^\infty x^2 \log\left[1 \mp e^{-\sqrt{x^2 + y^2}} \right] \,\text{d}x, $$
which appear in finite-temperature quantum field theory and play a role in
phase-transitions in the early Universe, including baryogenesis, electroweak
symmetry breaking and the Higgs mechanism.
| hep-ph physics.comp-ph | we provide a small c library with mathematica and python interfaces for computing thermal functions defined j_textbfy2 equiv re int_0infty x2 logleft1 mp esqrtx2 y2 right textdx which appear in finitetemperature quantum field theory and play a role in phasetransitions in the early universe including baryogenesis electroweak symmetry breaking and the higgs mechanism | [['we', 'provide', 'a', 'small', 'c', 'library', 'with', 'mathematica', 'and', 'python', 'interfaces', 'for', 'computing', 'thermal', 'functions', 'defined', 'j_textbfy2', 'equiv', 're', 'int_0infty', 'x2', 'logleft1', 'mp', 'esqrtx2', 'y2', 'right', 'textdx', 'which', 'appear', 'in', 'finitetemperature', 'quantum', 'field', 'theory', 'and', 'play', 'a', 'role', 'in', 'phasetransitions', 'in', 'the', 'early', 'universe', 'including', 'baryogenesis', 'electroweak', 'symmetry', 'breaking', 'and', 'the', 'higgs', 'mechanism']] | [-0.16771357780322432, 0.16509433468803764, -0.05887205772800371, 0.11190659003099426, -0.07226851888000965, -0.24552782027050854, -0.028247733062598854, 0.3416031185537577, -0.25479926210828124, -0.258527092076838, 0.02371683816658333, -0.26369251318275927, -0.09557022713124752, 0.12868569762445986, 0.08103534363210202, 0.02370178196579218, -0.05745558688417077, -0.04649688301084098, -0.04208026088774204, -0.21901733603561296, 0.22034022743813694, 0.006599140360485763, 0.1693917571566999, 0.08941498992033303, 0.03368121571373194, 0.009398116441443562, 0.05163846402429044, -0.11976680956780911, -0.20707398908212782, 0.01593287881463766, 0.24599159688223154, 0.1146013018116355, 0.20079087775200605, -0.41329572880640625, -0.11273278312757612, 0.09125979078933597, 0.18148443500045686, 0.044809499999973926, -0.13676593640819193, -0.26029388784663754, 0.09339095642790199, -0.2120779324322939, -0.12388458447530866, -0.09371173638850451, 0.03004901346983388, -0.07205207623541356, -0.31385895688086746, 0.09905256070196629, 0.006565632158890366, 0.14042124011553825, 0.00014788758009672164, -0.14752759132534266, -0.06946055390872061, 0.010741151850670577, 0.06726345602422952, 0.1298203175980598, 0.1391000837017782, -0.1851430817320943, -0.0812040082924068, 0.4298034597747028, -0.04948177361860871, -0.1055725848255679, 0.08992879325523973, -0.11392900908365845, -0.20958481321111322, 0.038980523166246714, 0.14713009871542454, 0.10654183036647737, -0.06617983547970653, 0.28599267346435225, 0.06890550436452031, 0.1263580689067021, 0.05703347008675337, 0.04696211228147149, 0.251376486569643, 0.09259128462523222, -0.0705178810749203, 0.05705658361315727, 0.04017836475744843, -0.13191139742732047, -0.3945236586406827, -0.20379222387447954, -0.08069930214434862, 0.06020612667867681, -0.10281532874243567, -0.2117521533370018, 0.3332571526244283, 0.08769859405234456, 0.14731821386143565, -0.037309129788773134, 0.19647356745786965, 0.10916825233027339, 0.05668723334791139, 0.11379052102100104, 0.15666732408106326, 0.12267801828682423, 0.17545967631973325, -0.2542209706827998, -0.012926973850699141, 0.146804581861943] |
1,802.02721 | Deep Image Super Resolution via Natural Image Priors | Single image super-resolution (SR) via deep learning has recently gained
significant attention in the literature. Convolutional neural networks (CNNs)
are typically learned to represent the mapping between low-resolution (LR) and
high-resolution (HR) images/patches with the help of training examples. Most
existing deep networks for SR produce high quality results when training data
is abundant. However, their performance degrades sharply when training is
limited. We propose to regularize deep structures with prior knowledge about
the images so that they can capture more structural information from the same
limited data. In particular, we incorporate in a tractable fashion within the
CNN framework, natural image priors which have shown to have much recent
success in imaging and vision inverse problems. Experimental results show that
the proposed deep network with natural image priors is particularly effective
in training starved regimes.
| cs.CV | single image superresolution sr via deep learning has recently gained significant attention in the literature convolutional neural networks cnns are typically learned to represent the mapping between lowresolution lr and highresolution hr imagespatches with the help of training examples most existing deep networks for sr produce high quality results when training data is abundant however their performance degrades sharply when training is limited we propose to regularize deep structures with prior knowledge about the images so that they can capture more structural information from the same limited data in particular we incorporate in a tractable fashion within the cnn framework natural image priors which have shown to have much recent success in imaging and vision inverse problems experimental results show that the proposed deep network with natural image priors is particularly effective in training starved regimes | [['single', 'image', 'superresolution', 'sr', 'via', 'deep', 'learning', 'has', 'recently', 'gained', 'significant', 'attention', 'in', 'the', 'literature', 'convolutional', 'neural', 'networks', 'cnns', 'are', 'typically', 'learned', 'to', 'represent', 'the', 'mapping', 'between', 'lowresolution', 'lr', 'and', 'highresolution', 'hr', 'imagespatches', 'with', 'the', 'help', 'of', 'training', 'examples', 'most', 'existing', 'deep', 'networks', 'for', 'sr', 'produce', 'high', 'quality', 'results', 'when', 'training', 'data', 'is', 'abundant', 'however', 'their', 'performance', 'degrades', 'sharply', 'when', 'training', 'is', 'limited', 'we', 'propose', 'to', 'regularize', 'deep', 'structures', 'with', 'prior', 'knowledge', 'about', 'the', 'images', 'so', 'that', 'they', 'can', 'capture', 'more', 'structural', 'information', 'from', 'the', 'same', 'limited', 'data', 'in', 'particular', 'we', 'incorporate', 'in', 'a', 'tractable', 'fashion', 'within', 'the', 'cnn', 'framework', 'natural', 'image', 'priors', 'which', 'have', 'shown', 'to', 'have', 'much', 'recent', 'success', 'in', 'imaging', 'and', 'vision', 'inverse', 'problems', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'deep', 'network', 'with', 'natural', 'image', 'priors', 'is', 'particularly', 'effective', 'in', 'training', 'starved', 'regimes']] | [0.025894386281638787, -0.00247703046641416, -0.042258207051566354, 0.08320868033139656, -0.14221067501025067, -0.19047187223547588, -0.016924889130448855, 0.5266956535478433, -0.29029011323237447, -0.34784090536888, 0.06537058397834361, -0.2734214795718866, -0.22364260822500068, 0.16958137416729221, -0.17966781559538234, 0.10442118461640483, 0.17425000578578975, 0.0403665566575472, -0.09710919227951241, -0.30287107700413024, 0.2872255690016404, 0.07432488550656234, 0.38022710587139485, -0.013918133604305763, 0.1096917843773823, -0.069547420653894, -0.017798680301617693, -0.022076175714567027, -0.06284653669173605, 0.1912673736129094, 0.36178703240153415, 0.22143867236596568, 0.3239775684110268, -0.4605010593241012, -0.3180443436597232, 0.10476567874041696, 0.18239363407440207, 0.12355665353695966, -0.06678402731076521, -0.33663092596387423, 0.09460649293743902, -0.12038873202615866, 0.09554699609676996, -0.1619211695726133, -0.01701747036487278, -0.018114667479811167, -0.29346613014737766, 0.026422922036188, 0.08331498732893831, 0.08019488383498456, -0.03999013517017442, -0.11497666757829764, 0.01244608165903224, 0.14942381847865396, 0.03764126150161718, 0.07720753012345759, 0.10443555486422998, -0.2526167561783007, -0.06282960542443174, 0.33169771379066837, -0.03448529272228135, -0.17801928925500424, 0.21151567388981304, -0.08489062557410863, -0.16784095664129214, 0.14426648748383203, 0.22959758782849854, 0.10715166978124115, -0.16094822145209442, 0.038895604789636475, -0.038763870071205825, 0.17313766918593534, 0.054891761680375094, 0.037864516151172145, 0.18048288497763376, 0.26921069213120197, 0.003398687154468563, 0.12169797445681912, -0.1842606643559756, -0.06401161097886937, -0.1346229995014491, -0.036523041832778186, -0.2112877141856761, -0.027379966920448674, -0.10493376299855299, -0.102054977317608, 0.3403783741786524, 0.228980342136627, 0.2600402107634754, 0.08684131834673246, 0.3489128570029236, 0.04480193581570078, 0.19934498486109078, 0.058078291719020514, 0.2540984785253251, 0.03550988327435873, 0.14905434597835496, -0.1073989393517237, 0.07433504002186021, -0.018043156199295213] |
1,802.02722 | B-metric spaces, fixed points and Lipschitz functions | The paper is concerned with b-metric and generalized b-metric spaces. One
proves the existence of the completion of a generalized b-metric space and some
fixed point results. The behavior of Lipschitz functions on b-metric spaces of
homogeneous type, as well as of Lipschitz functions defined on, or with values
in quasi-Banach spaces, is studied.
| math.FA | the paper is concerned with bmetric and generalized bmetric spaces one proves the existence of the completion of a generalized bmetric space and some fixed point results the behavior of lipschitz functions on bmetric spaces of homogeneous type as well as of lipschitz functions defined on or with values in quasibanach spaces is studied | [['the', 'paper', 'is', 'concerned', 'with', 'bmetric', 'and', 'generalized', 'bmetric', 'spaces', 'one', 'proves', 'the', 'existence', 'of', 'the', 'completion', 'of', 'a', 'generalized', 'bmetric', 'space', 'and', 'some', 'fixed', 'point', 'results', 'the', 'behavior', 'of', 'lipschitz', 'functions', 'on', 'bmetric', 'spaces', 'of', 'homogeneous', 'type', 'as', 'well', 'as', 'of', 'lipschitz', 'functions', 'defined', 'on', 'or', 'with', 'values', 'in', 'quasibanach', 'spaces', 'is', 'studied']] | [-0.15123283911358426, 0.08696700163461545, -0.006776035556362735, 0.11240682504743475, -0.07213083813743044, -0.0781662979732371, -0.03499889999619444, 0.38137306579975067, -0.29496996380664686, -0.14240639732667693, 0.18062504181526257, -0.25596899178344756, -0.1871812990564784, 0.21937326917476538, -0.11602358576945132, 0.08439237785474958, 0.013174482638499251, 0.05905704313233771, -0.17153638566809673, -0.26973309823208386, 0.5511452812287543, -0.029753684053300984, 0.21949545889058047, 0.05188099071555943, 0.13445888542466694, 0.04678304943566521, -0.05227393643171699, 0.049341419788780275, -0.16515876133753746, 0.09405165467911435, 0.27835462580400483, 0.0283000268800943, 0.289692056675752, -0.31201329033959796, -0.21852461597019876, 0.15670396594537628, 0.0620165653526783, -0.09329167048067406, 0.0057558986849875916, -0.33423619544892397, 0.05537299325482713, -0.06745205041779964, -0.19680217398261582, -0.07268617459124437, -0.01825786770010988, 0.11985611342566295, -0.26089310163149126, 0.019280088858471975, 0.09218385631296162, 0.07228838059085387, -0.19274849855099563, -0.11985088305340873, -0.04987283975869003, 0.07738904060399229, 0.013108957869311174, 0.1045422279448421, 0.05727738927601388, -0.04228697849989489, -0.13459102190272124, 0.3997919875783501, -0.0880160874221474, -0.3210269391398739, 0.16551561777790388, -0.13288927550807042, -0.14980897369484106, 0.038094559511928645, 0.13330849847342405, 0.1833982347096834, -0.08851170971023815, 0.19940856024752268, -0.08255139151933016, 0.04512359971381051, 0.10967022268515494, 0.0641303424447499, 0.051366629066049226, 0.17748476778743444, 0.15010625931123892, 0.15829068788379017, 0.06705952226184309, -0.10770250030004212, -0.3621973301611703, -0.15859010401699278, -0.17876675680141757, 0.09857309863178267, -0.13381795326400875, -0.27241053872017396, 0.334699491099282, -0.042914838344721054, 0.2206113848283335, 0.13974217913561948, 0.19521579998372882, 0.049538274670744106, 0.005213688550241015, 0.047590936344392876, 0.18599584218625548, 0.1937725987561323, 0.09082133525603071, -0.038033001780234, 0.060269464937004226, 0.1998800983204058] |
1,802.02723 | Nevanlinna theory and value distribution in the unicritical polynomials
family | In the space $\mathbb{C}$ of the parameters $\lambda$ of the unicritical
polynomials family $f(\lambda,z)=f_\lambda(z)=z^d+\lambda$ of degree $d>1$, we
establish a quantitative equidistribution result towards the bifurcation
current (indeed measure) $T_f$ of $f$ as $n\to\infty$ on the averaged
distributions of all parameters $\lambda$ such that $f_\lambda$ has a
superattracting periodic point of period $n$ in $\mathbb{C}$, with a concrete
error estimate for $C^2$-test functions on $\mathbb{P}^1$. In the proof, not
only complex dynamics but also a standard argument from the Nevanlinna theory
play key roles.
| math.DS math.CV | in the space mathbbc of the parameters lambda of the unicritical polynomials family flambdazf_lambdazzdlambda of degree d1 we establish a quantitative equidistribution result towards the bifurcation current indeed measure t_f of f as ntoinfty on the averaged distributions of all parameters lambda such that f_lambda has a superattracting periodic point of period n in mathbbc with a concrete error estimate for c2test functions on mathbbp1 in the proof not only complex dynamics but also a standard argument from the nevanlinna theory play key roles | [['in', 'the', 'space', 'mathbbc', 'of', 'the', 'parameters', 'lambda', 'of', 'the', 'unicritical', 'polynomials', 'family', 'flambdazf_lambdazzdlambda', 'of', 'degree', 'd1', 'we', 'establish', 'a', 'quantitative', 'equidistribution', 'result', 'towards', 'the', 'bifurcation', 'current', 'indeed', 'measure', 't_f', 'of', 'f', 'as', 'ntoinfty', 'on', 'the', 'averaged', 'distributions', 'of', 'all', 'parameters', 'lambda', 'such', 'that', 'f_lambda', 'has', 'a', 'superattracting', 'periodic', 'point', 'of', 'period', 'n', 'in', 'mathbbc', 'with', 'a', 'concrete', 'error', 'estimate', 'for', 'c2test', 'functions', 'on', 'mathbbp1', 'in', 'the', 'proof', 'not', 'only', 'complex', 'dynamics', 'but', 'also', 'a', 'standard', 'argument', 'from', 'the', 'nevanlinna', 'theory', 'play', 'key', 'roles']] | [-0.19151126913919408, 0.0738283224381143, -0.10426677687366198, 0.07272668563897108, -0.018298566220725728, -0.1208186097352243, 0.05969122575351787, 0.3052366222709236, -0.2852131908804905, -0.19461489214402874, 0.08478290297619136, -0.25538129662731435, -0.15343291786138719, 0.2230187879943448, -0.06073223653444385, 0.047751586543532405, 0.02459760332230206, 0.09279774390615342, -0.06200735491598252, -0.23129289136154624, 0.3529626414600033, -0.035206475312162824, 0.1866625969797918, 0.014970098349561051, 0.07175396090918561, 0.012441847212158325, 0.0045943970649315775, -0.08247060239600393, -0.23546231280568286, 0.07525725757118269, 0.25758684221541556, 0.09222466399660334, 0.2756884359447967, -0.3191030156208066, -0.18332682913396417, 0.1911875287059513, 0.1643954942410346, 0.00530865698734798, 0.01300069653122436, -0.24313253480032448, 0.03718509151395864, -0.09983607394519267, -0.23473679645713874, -0.07197276289324935, 0.09887099484969838, 0.08368541673961573, -0.2892758548202947, 0.0455414074034396, 0.12402854374291875, 0.14950450838021026, -0.028378121060796263, -0.14349925549269268, -0.06884698353980373, 0.1165877268138546, 0.030597337055951357, 0.11033591703602635, 0.10376169512661673, -0.08531629674068493, -0.07214137087235363, 0.3206713092190401, -0.11538528026331489, -0.23592353414846357, 0.10549283877764715, -0.20922417391273307, -0.18990273183643272, 0.12343159587145215, 0.11526340720380043, 0.14035226655669691, -0.03285624988649676, 0.17901409176609864, -0.10795412698999138, 0.1609296693098192, 0.12180036692539366, 0.035178908976022064, 0.1662139880851411, 0.10080403627305315, 0.09733138540362167, 0.08691196401728453, -0.005295273864914368, -0.1096082265750028, -0.38618223480425956, -0.14553050255607358, -0.1756172911391775, 0.12558153769474834, -0.17293722904713188, -0.20432409619140188, 0.40012638540597767, 0.11324320620255227, 0.24757410783502387, 0.1030311434552437, 0.19432813064876672, 0.10283347369006994, 0.036479471002388804, -0.0027733159580881277, 0.16665560459411452, 0.15341421047782117, 0.033951562721418534, -0.13944067255446188, 0.03872638242887106, 0.15414522123727492] |
1,802.02724 | Primal-dual stochastic gradient method for convex programs with many
functional constraints | Stochastic gradient method (SGM) has been popularly applied to solve
optimization problems with objective that is stochastic or an average of many
functions. Most existing works on SGMs assume that the underlying problem is
unconstrained or has an easy-to-project constraint set. In this paper, we
consider problems that have a stochastic objective and also many functional
constraints. For such problems, it could be extremely expensive to project a
point to the feasible set, or even compute subgradient and/or function value of
all constraint functions. To find solutions of these problems, we propose a
novel (adaptive) SGM based on the classical augmented Lagrangian function.
Within every iteration, it inquires a stochastic subgradient of the objective,
and a subgradient and the function value of one randomly sampled constraint
function. Hence, the per-iteration complexity is low. We establish its
convergence rate for convex problems and also problems with strongly convex
objective. It can achieve the optimal $O(1/\sqrt{k})$ convergence rate for
convex case and nearly optimal $O\big((\log k)/k\big)$ rate for strongly convex
case. Numerical experiments on a sample approximation problem of the robust
portfolio selection and quadratically constrained quadratic programming are
conducted to demonstrate its efficiency.
| math.OC cs.NA math.NA | stochastic gradient method sgm has been popularly applied to solve optimization problems with objective that is stochastic or an average of many functions most existing works on sgms assume that the underlying problem is unconstrained or has an easytoproject constraint set in this paper we consider problems that have a stochastic objective and also many functional constraints for such problems it could be extremely expensive to project a point to the feasible set or even compute subgradient andor function value of all constraint functions to find solutions of these problems we propose a novel adaptive sgm based on the classical augmented lagrangian function within every iteration it inquires a stochastic subgradient of the objective and a subgradient and the function value of one randomly sampled constraint function hence the periteration complexity is low we establish its convergence rate for convex problems and also problems with strongly convex objective it can achieve the optimal o1sqrtk convergence rate for convex case and nearly optimal obiglog kkbig rate for strongly convex case numerical experiments on a sample approximation problem of the robust portfolio selection and quadratically constrained quadratic programming are conducted to demonstrate its efficiency | [['stochastic', 'gradient', 'method', 'sgm', 'has', 'been', 'popularly', 'applied', 'to', 'solve', 'optimization', 'problems', 'with', 'objective', 'that', 'is', 'stochastic', 'or', 'an', 'average', 'of', 'many', 'functions', 'most', 'existing', 'works', 'on', 'sgms', 'assume', 'that', 'the', 'underlying', 'problem', 'is', 'unconstrained', 'or', 'has', 'an', 'easytoproject', 'constraint', 'set', 'in', 'this', 'paper', 'we', 'consider', 'problems', 'that', 'have', 'a', 'stochastic', 'objective', 'and', 'also', 'many', 'functional', 'constraints', 'for', 'such', 'problems', 'it', 'could', 'be', 'extremely', 'expensive', 'to', 'project', 'a', 'point', 'to', 'the', 'feasible', 'set', 'or', 'even', 'compute', 'subgradient', 'andor', 'function', 'value', 'of', 'all', 'constraint', 'functions', 'to', 'find', 'solutions', 'of', 'these', 'problems', 'we', 'propose', 'a', 'novel', 'adaptive', 'sgm', 'based', 'on', 'the', 'classical', 'augmented', 'lagrangian', 'function', 'within', 'every', 'iteration', 'it', 'inquires', 'a', 'stochastic', 'subgradient', 'of', 'the', 'objective', 'and', 'a', 'subgradient', 'and', 'the', 'function', 'value', 'of', 'one', 'randomly', 'sampled', 'constraint', 'function', 'hence', 'the', 'periteration', 'complexity', 'is', 'low', 'we', 'establish', 'its', 'convergence', 'rate', 'for', 'convex', 'problems', 'and', 'also', 'problems', 'with', 'strongly', 'convex', 'objective', 'it', 'can', 'achieve', 'the', 'optimal', 'o1sqrtk', 'convergence', 'rate', 'for', 'convex', 'case', 'and', 'nearly', 'optimal', 'obiglog', 'kkbig', 'rate', 'for', 'strongly', 'convex', 'case', 'numerical', 'experiments', 'on', 'a', 'sample', 'approximation', 'problem', 'of', 'the', 'robust', 'portfolio', 'selection', 'and', 'quadratically', 'constrained', 'quadratic', 'programming', 'are', 'conducted', 'to', 'demonstrate', 'its', 'efficiency']] | [-0.096786852842687, -0.027342453220166804, -0.08119801058875102, 0.09004363760866813, -0.10505999047186618, -0.1657352724308638, 0.05998609199642057, 0.40152979239845943, -0.3470145378880644, -0.2908427728045928, 0.18290964280451208, -0.25770787052614125, -0.1782407411021842, 0.2146822963510395, -0.1002327224840165, 0.13941500503324755, 0.07320774050588769, 0.0041581591542222, -0.09811731567361245, -0.31095094102263254, 0.26752969037962, 0.01747048865807684, 0.2490980038983061, 0.03635795160784925, 0.16703604226564303, 0.008670888993104822, 0.03746594267646096, 0.0731040930032338, -0.08991715633245277, 0.10957087959089365, 0.280624202663373, 0.2097500671889927, 0.3960354200515308, -0.4096817308806701, -0.1813023884480476, 0.16438428808714411, 0.1250738712781305, 0.06795303813230834, -0.0640130880454212, -0.17355555900568634, 0.09736447886649617, -0.09116100640247551, -0.07828167416522966, -0.06588470889255404, -0.048659672318516596, 0.0444811233564427, -0.3577928799841749, 0.0605364793773716, -0.0033897512782316065, -0.006831926112308314, -0.07251482448957272, -0.15405726743813017, 0.04395102264212542, 0.02039095280128286, 0.07254717333891772, 0.10657825770919628, 0.1487889240590831, -0.09361804233937475, -0.12572593853968245, 0.36364284591063073, -0.04218874811439922, -0.2875845823289925, 0.20098343439718808, -0.06375014886603152, -0.15010904618048745, 0.12813474302131095, 0.23232227070272385, 0.22819134025638432, -0.17622565299419587, 0.11279725061536545, -0.06480489232038197, 0.14747625289463415, 0.0028962500859051944, 0.007275234028010776, 0.1142367243631988, 0.1620443762132996, 0.23265654694742377, 0.16002926944546694, -0.02502735811408217, -0.12539447303616294, -0.24926060381786605, -0.0893385589487336, -0.19982202459237, -0.012276729924824873, -0.1083381225546442, -0.17753139464429726, 0.35161111493545927, 0.12793889740622896, 0.15876544569864084, 0.15296618826197167, 0.3174929963032666, 0.1829629638613704, 0.027350112223862917, 0.10869556766640591, 0.2248884520199346, 0.08143126827321555, 0.053728537518825184, -0.24007441404667731, 0.09338904948611008, 0.08212459450648901] |
1,802.02725 | Composable security analysis of continuous-variable
measurement-device-independent quantum key distribution with squeezed states
for coherent attacks | Measurement-device-independent quantum key distribution protocol, whose
security analysis does not rely on any assumption on the detection system, can
immune the attacking against detectors. We give a first composable security
analysis for continuous-variable measurement-device-independent quantum key
distribution using squeezed states against general coherent attacks. The
security analysis is derived based on the entanglement-based scheme considering
finite size effect. A version of entropic uncertainty relation is exploited to
give a lower bound on the conditional smooth min-entropy by trusting Alice's
and Bob's devices. The simulation results indicate that, in the universal
composable security framework, the protocol can tolerate 2.5 dB and 6.5 dB
channel loss against coherent attacks with direct and reverse reconciliation,
respectively.
| quant-ph | measurementdeviceindependent quantum key distribution protocol whose security analysis does not rely on any assumption on the detection system can immune the attacking against detectors we give a first composable security analysis for continuousvariable measurementdeviceindependent quantum key distribution using squeezed states against general coherent attacks the security analysis is derived based on the entanglementbased scheme considering finite size effect a version of entropic uncertainty relation is exploited to give a lower bound on the conditional smooth minentropy by trusting alices and bobs devices the simulation results indicate that in the universal composable security framework the protocol can tolerate 25 db and 65 db channel loss against coherent attacks with direct and reverse reconciliation respectively | [['measurementdeviceindependent', 'quantum', 'key', 'distribution', 'protocol', 'whose', 'security', 'analysis', 'does', 'not', 'rely', 'on', 'any', 'assumption', 'on', 'the', 'detection', 'system', 'can', 'immune', 'the', 'attacking', 'against', 'detectors', 'we', 'give', 'a', 'first', 'composable', 'security', 'analysis', 'for', 'continuousvariable', 'measurementdeviceindependent', 'quantum', 'key', 'distribution', 'using', 'squeezed', 'states', 'against', 'general', 'coherent', 'attacks', 'the', 'security', 'analysis', 'is', 'derived', 'based', 'on', 'the', 'entanglementbased', 'scheme', 'considering', 'finite', 'size', 'effect', 'a', 'version', 'of', 'entropic', 'uncertainty', 'relation', 'is', 'exploited', 'to', 'give', 'a', 'lower', 'bound', 'on', 'the', 'conditional', 'smooth', 'minentropy', 'by', 'trusting', 'alices', 'and', 'bobs', 'devices', 'the', 'simulation', 'results', 'indicate', 'that', 'in', 'the', 'universal', 'composable', 'security', 'framework', 'the', 'protocol', 'can', 'tolerate', '25', 'db', 'and', '65', 'db', 'channel', 'loss', 'against', 'coherent', 'attacks', 'with', 'direct', 'and', 'reverse', 'reconciliation', 'respectively']] | [-0.1922892033002974, 0.0631982237347855, -0.13963483575632615, 0.08739114350812362, 0.02377998183967661, -0.3128220262294388, 0.1271378035230595, 0.3180520487671092, -0.21509332280292842, -0.2751373529632007, 0.07855482616119779, -0.22946816044076618, -0.0967697557721254, 0.266707406616234, -0.17548051187603741, 0.14444227086429576, 0.05293407252643554, -0.02690680073862648, -0.008436252014810401, -0.26726722809593234, 0.339246334464792, 0.07051106847089146, 0.4184946252230917, 0.08219022026895421, 0.09317147522851561, 0.0659795833547575, 0.0007237635111947239, -0.06778432636736043, -0.10952886448488251, 0.09352872296250879, 0.26681140255372543, 0.20954902367913616, 0.29137073030316196, -0.3755006497577492, -0.1997054681610481, 0.08617922636902833, 0.09853047258643005, 0.18817148255843635, -0.04398335607833666, -0.37651036490389533, 0.1277307404567842, -0.2639065377364776, -0.05785410606652082, -0.08695863347615948, -0.06569529517627923, -0.01403888504523619, -0.24141814817254126, 0.053718009351678524, 0.08859037334280731, 0.05541125660560267, 0.03691599352645329, -0.06600001671730615, 0.012392786475706153, 0.10567941352420082, -0.10369748415928169, -0.026283218179194802, 0.22946077825468594, -0.07295194476331889, -0.19395383294935511, 0.28898249403367526, -0.05479802916329189, -0.2045462150868457, 0.09538593927276758, -0.029543058027768822, -0.10029360901902273, 0.062031243002635586, 0.17214088897484528, 0.06941573672919674, -0.09632890478633674, 0.004303759819543632, -0.029648841754327304, 0.2858194891462284, 0.05419795867622278, 0.16940445904836338, 0.1235422344993701, 0.10721669378031078, 0.10017671880716111, 0.15598540688119006, -0.10641500968856951, -0.156786721554148, -0.3348874601420114, -0.14865503661114046, -0.22705197241775427, 0.11098239714791278, -0.09324589099534643, -0.0986426886968496, 0.3287973414718076, 0.2052777430734935, 0.08687065410081594, 0.06993477126847195, 0.4527825383485946, 0.06522301460031123, 0.039896841445294894, 0.14076001951223718, 0.24135471842523698, 0.14099886593309982, 0.026763816083888566, -0.15790056357514606, 0.23693717666489558, 0.01749227845431429] |
1,802.02726 | A Simple proof for the algorithms of relaxed $(u, v)$-cocoercive
mappings and $\alpha$-inverse strongly monotone mappings | In this paper, a simple proof is presented for the convergence of the
algorithms for the class of relaxed $(u, v)$-cocoercive mappings and
$\alpha$-inverse strongly monotone mappings. Based on $\alpha$-expansive maps,
for example, a simple proof of the convergence of the recent iterative
algorithms by relaxed $(u, v)$-cocoercive mappings due to Kumam-Jaiboon is
provided. Also a simple proof for the convergence of the iterative algorithms
by inverse-strongly monotone mappings due to Iiduka-Takahashi in a special case
is provided. These results are an improvement as well as a refinement of
previously known results.
| math.FA | in this paper a simple proof is presented for the convergence of the algorithms for the class of relaxed u vcocoercive mappings and alphainverse strongly monotone mappings based on alphaexpansive maps for example a simple proof of the convergence of the recent iterative algorithms by relaxed u vcocoercive mappings due to kumamjaiboon is provided also a simple proof for the convergence of the iterative algorithms by inversestrongly monotone mappings due to iidukatakahashi in a special case is provided these results are an improvement as well as a refinement of previously known results | [['in', 'this', 'paper', 'a', 'simple', 'proof', 'is', 'presented', 'for', 'the', 'convergence', 'of', 'the', 'algorithms', 'for', 'the', 'class', 'of', 'relaxed', 'u', 'vcocoercive', 'mappings', 'and', 'alphainverse', 'strongly', 'monotone', 'mappings', 'based', 'on', 'alphaexpansive', 'maps', 'for', 'example', 'a', 'simple', 'proof', 'of', 'the', 'convergence', 'of', 'the', 'recent', 'iterative', 'algorithms', 'by', 'relaxed', 'u', 'vcocoercive', 'mappings', 'due', 'to', 'kumamjaiboon', 'is', 'provided', 'also', 'a', 'simple', 'proof', 'for', 'the', 'convergence', 'of', 'the', 'iterative', 'algorithms', 'by', 'inversestrongly', 'monotone', 'mappings', 'due', 'to', 'iidukatakahashi', 'in', 'a', 'special', 'case', 'is', 'provided', 'these', 'results', 'are', 'an', 'improvement', 'as', 'well', 'as', 'a', 'refinement', 'of', 'previously', 'known', 'results']] | [-0.07657252669591329, -0.014992877662860275, -0.05341893484837365, 0.07148252962017967, -0.05067149139726641, -0.12968517234548926, 0.05953066711629816, 0.3598872161117093, -0.295780673023613, -0.23517340687157093, 0.16968317789657192, -0.23479004485008104, -0.1894304061244274, 0.2708277699762377, -0.11166236655593946, 0.0859033161902736, 0.06703602969004162, -0.0038810540418857814, -0.12495034319701893, -0.28307848217784715, 0.33084619529117115, 0.03058324183669241, 0.20900822221033874, 0.08991122136599031, 0.10816878754774044, 0.0009304195182162455, -0.03700047716412736, 0.04125791030197308, -0.1462185063303031, 0.13528170675339027, 0.22851718817676964, 0.1396283500228377, 0.3221983031808645, -0.32802529746516684, -0.1521609484528502, 0.09584214996637498, 0.14681520458075337, 0.08853979142725296, -0.10203634319832312, -0.2822686101272488, 0.09360735779280249, -0.09910881333053112, -0.10657321283829281, -0.10619096797837436, -0.0035836580209434032, 0.11770982240679963, -0.35175139103727093, 0.025463675798770662, 0.186281828074609, 0.05178611894705515, -0.0439723147796574, -0.09904357392726273, 0.029599336074964924, 0.05308347343113916, 0.033626819064241205, 0.10801616502155004, 0.05242611497811887, -0.07837025421114917, -0.13359620056018748, 0.37429174335523585, -0.03587854063759247, -0.23939799577340312, 0.21842600829396183, -0.04201954016569017, -0.1893212708708798, 0.11250185901861123, 0.1389944933183577, 0.18131402726873927, -0.1542637186852851, 0.13099058614388087, -0.09273573122490411, 0.10120886992449048, 0.0514075364221701, 0.006321131091179519, 0.062220776657006524, 0.15639462287741146, 0.16608795780560065, 0.17940725684273004, 0.04254651334318707, -0.07359004703660806, -0.3295474707994653, -0.12713218805776244, -0.17435073189908404, 0.004388693420366309, -0.1046838263722455, -0.1842427875755633, 0.38802101615088425, 0.06671614621648159, 0.1854596465408545, 0.14256387775571183, 0.29740850498964044, 0.12109133923672483, 0.02921630421268015, 0.0786675320370872, 0.22534928770318371, 0.17845574032579517, 0.07815188386252728, -0.1372791089856162, 0.07427362180395244, 0.1750871829538681] |
1,802.02727 | On the Packet Decoding Delay of Linear Network Coded Wireless Broadcast | We apply linear network coding (LNC) to broadcast a block of data packets
from one sender to a set of receivers via lossy wireless channels, assuming
each receiver already possesses a subset of these packets and wants the rest.
We aim to characterize the average packet decoding delay (APDD), which reflects
how soon each individual data packet can be decoded by each receiver on
average, and to minimize it while achieving optimal throughput. To this end, we
first derive closed-form lower bounds on the expected APDD of all LNC
techniques under random packet erasures. We then prove that these bounds are
NP-hard to achieve and, thus, that APDD minimization is an NP-hard problem. We
then study the performance of some existing LNC techniques, including random
linear network coding (RLNC) and instantly decodable network coding (IDNC). We
proved that all throughput-optimal LNC techniques can approximate the minimum
expected APDD with a ratio between 4/3 and 2. In particular, the ratio of RLNC
is exactly 2. We then prove that all IDNC techniques are only heuristics in
terms of throughput optimization and {cannot guarantee an APDD approximation
ratio for at least a subset of the receivers}. Finally, we propose
hyper-graphic linear network coding (HLNC), a novel throughput-optimal and
APDD-approximating LNC technique based on a hypergraph model of receivers'
packet reception state. We implement it under different availability of
receiver feedback, and numerically compare its performance with RLNC and a
heuristic general IDNC technique. The results show that the APDD performance of
HLNC is better under all tested system settings, even if receiver feedback is
only collected intermittently.
| cs.IT math.IT | we apply linear network coding lnc to broadcast a block of data packets from one sender to a set of receivers via lossy wireless channels assuming each receiver already possesses a subset of these packets and wants the rest we aim to characterize the average packet decoding delay apdd which reflects how soon each individual data packet can be decoded by each receiver on average and to minimize it while achieving optimal throughput to this end we first derive closedform lower bounds on the expected apdd of all lnc techniques under random packet erasures we then prove that these bounds are nphard to achieve and thus that apdd minimization is an nphard problem we then study the performance of some existing lnc techniques including random linear network coding rlnc and instantly decodable network coding idnc we proved that all throughputoptimal lnc techniques can approximate the minimum expected apdd with a ratio between 43 and 2 in particular the ratio of rlnc is exactly 2 we then prove that all idnc techniques are only heuristics in terms of throughput optimization and cannot guarantee an apdd approximation ratio for at least a subset of the receivers finally we propose hypergraphic linear network coding hlnc a novel throughputoptimal and apddapproximating lnc technique based on a hypergraph model of receivers packet reception state we implement it under different availability of receiver feedback and numerically compare its performance with rlnc and a heuristic general idnc technique the results show that the apdd performance of hlnc is better under all tested system settings even if receiver feedback is only collected intermittently | [['we', 'apply', 'linear', 'network', 'coding', 'lnc', 'to', 'broadcast', 'a', 'block', 'of', 'data', 'packets', 'from', 'one', 'sender', 'to', 'a', 'set', 'of', 'receivers', 'via', 'lossy', 'wireless', 'channels', 'assuming', 'each', 'receiver', 'already', 'possesses', 'a', 'subset', 'of', 'these', 'packets', 'and', 'wants', 'the', 'rest', 'we', 'aim', 'to', 'characterize', 'the', 'average', 'packet', 'decoding', 'delay', 'apdd', 'which', 'reflects', 'how', 'soon', 'each', 'individual', 'data', 'packet', 'can', 'be', 'decoded', 'by', 'each', 'receiver', 'on', 'average', 'and', 'to', 'minimize', 'it', 'while', 'achieving', 'optimal', 'throughput', 'to', 'this', 'end', 'we', 'first', 'derive', 'closedform', 'lower', 'bounds', 'on', 'the', 'expected', 'apdd', 'of', 'all', 'lnc', 'techniques', 'under', 'random', 'packet', 'erasures', 'we', 'then', 'prove', 'that', 'these', 'bounds', 'are', 'nphard', 'to', 'achieve', 'and', 'thus', 'that', 'apdd', 'minimization', 'is', 'an', 'nphard', 'problem', 'we', 'then', 'study', 'the', 'performance', 'of', 'some', 'existing', 'lnc', 'techniques', 'including', 'random', 'linear', 'network', 'coding', 'rlnc', 'and', 'instantly', 'decodable', 'network', 'coding', 'idnc', 'we', 'proved', 'that', 'all', 'throughputoptimal', 'lnc', 'techniques', 'can', 'approximate', 'the', 'minimum', 'expected', 'apdd', 'with', 'a', 'ratio', 'between', '43', 'and', '2', 'in', 'particular', 'the', 'ratio', 'of', 'rlnc', 'is', 'exactly', '2', 'we', 'then', 'prove', 'that', 'all', 'idnc', 'techniques', 'are', 'only', 'heuristics', 'in', 'terms', 'of', 'throughput', 'optimization', 'and', 'can', 'not', 'guarantee', 'an', 'apdd', 'approximation', 'ratio', 'for', 'at', 'least', 'a', 'subset', 'of', 'the', 'receivers', 'finally', 'we', 'propose', 'hypergraphic', 'linear', 'network', 'coding', 'hlnc', 'a', 'novel', 'throughputoptimal', 'and', 'apddapproximating', 'lnc', 'technique', 'based', 'on', 'a', 'hypergraph', 'model', 'of', 'receivers', 'packet', 'reception', 'state', 'we', 'implement', 'it', 'under', 'different', 'availability', 'of', 'receiver', 'feedback', 'and', 'numerically', 'compare', 'its', 'performance', 'with', 'rlnc', 'and', 'a', 'heuristic', 'general', 'idnc', 'technique', 'the', 'results', 'show', 'that', 'the', 'apdd', 'performance', 'of', 'hlnc', 'is', 'better', 'under', 'all', 'tested', 'system', 'settings', 'even', 'if', 'receiver', 'feedback', 'is', 'only', 'collected', 'intermittently']] | [-0.2162710820947076, 0.009640016461241841, -0.05861474221798914, 0.04466737383054109, -0.06093124393462256, -0.2964498135367472, 0.14806205376685233, 0.42323730397569337, -0.2976571273991746, -0.2476830481703857, 0.13221271043314028, -0.25533825083115197, -0.1986208005729503, 0.13749278080384086, -0.1336077802890678, 0.10035286213474051, 0.0707088345617495, 0.08399368308266773, -0.060726794145094805, -0.3450547685716549, 0.2547549275883222, 0.10177077541212788, 0.33315363495978934, 0.04544165313505911, 0.1191412731648791, 0.026422864126268167, 0.016580476588481052, -0.00862051269323689, -0.11321179866359747, 0.05549541575003755, 0.3140476051746326, 0.25478005537018156, 0.2657728546118442, -0.42705942850808715, -0.2281972597983485, 0.11638191393523445, 0.14251770228572444, 0.11564080063793666, -0.0017106196875843315, -0.2291265341733005, 0.17161242518230507, -0.19709735640905401, 0.01933417042377387, -0.0034806024240676896, -0.07592780228364264, 0.05640456871259986, -0.33033200159240445, -0.016521803719547538, 0.005839098260840649, -0.03455275922532091, -0.05600759186985559, -0.10758756270271172, 0.03360174397208476, 0.1363616029638089, 0.002732196368388619, 0.01598909466541567, 0.07043370169639665, -0.05895317908723488, -0.14004145412503993, 0.35768007213681824, -0.04897841112887374, -0.2193705497624728, 0.1256265286267682, -0.049017024396461904, -0.12163203241022041, 0.1619349793608906, 0.25476475279670235, 0.08992053618736055, -0.16229831632324088, 0.015208785795516374, -0.07136630637043584, 0.2120772666818402, 0.12114601013048804, 0.11959749916962352, 0.06896734369755811, 0.14852811661796794, 0.17588570393168654, 0.16974764502609058, -0.0872822689475003, -0.07323369133552207, -0.24348148213789758, -0.07928099789206973, -0.21246475387168093, 0.012222007801457479, -0.14418427249501475, -0.06315493318712614, 0.36295120609647985, 0.13864591996231518, 0.1276573782623834, 0.1964447264787086, 0.377792157976403, 0.09940152157753389, 0.03240695354057752, 0.22793857908556273, 0.19646220738583903, 0.11671472822551478, 0.04162639534338147, -0.18003079675035302, 0.09297587476607001, 0.051110498306492856] |
1,802.02728 | Dark energy scenario consistent with GW170817 in theories beyond
Horndeski gravity | The Gleyzes-Langlois-Piazza-Vernizzi (GLPV) theories up to quartic order are
the general scheme of scalar-tensor theories allowing the possibility for
realizing the tensor propagation speed $c_t$ equivalent to 1 on the isotropic
cosmological background. We propose a dark energy model in which the late-time
cosmic acceleration occurs by a simple k-essence Lagrangian analogous to the
ghost condensate with cubic and quartic Galileons in the framework of GLPV
theories. We show that a wide variety of the variation of the dark energy
equation of state $w_{\rm DE}$ including the entry to the region $w_{\rm
DE}<-1$ can be realized without violating conditions for the absence of ghosts
and Laplacian instabilities. The approach to the tracker equation of state
$w_{\rm DE}=-2$ during the matter era, which is disfavored by observational
data, can be avoided by the existence of a quadratic k-essence Lagrangian
$X^2$. We study the evolution of nonrelativistic matter perturbations for the
model $c_t^2=1$ and show that the two quantities $\mu$ and $\Sigma$, which are
related to the Newtonian and weak lensing gravitational potentials
respectively, are practically equivalent to each other, such that $\mu \simeq
\Sigma>1$. For the case in which the deviation of $w_{\rm DE}$ from $-1$ is
significant at a later cosmological epoch, the values of $\mu$ and $\Sigma$
tend to be larger at low redshifts. We also find that our dark energy model can
be consistent with the bounds on the deviation parameter $\alpha_{\rm H}$ from
Horndeski theories arising from the modification of gravitational law inside
massive objects.
| gr-qc astro-ph.CO hep-ph hep-th | the gleyzeslangloispiazzavernizzi glpv theories up to quartic order are the general scheme of scalartensor theories allowing the possibility for realizing the tensor propagation speed c_t equivalent to 1 on the isotropic cosmological background we propose a dark energy model in which the latetime cosmic acceleration occurs by a simple kessence lagrangian analogous to the ghost condensate with cubic and quartic galileons in the framework of glpv theories we show that a wide variety of the variation of the dark energy equation of state w_rm de including the entry to the region w_rm de1 can be realized without violating conditions for the absence of ghosts and laplacian instabilities the approach to the tracker equation of state w_rm de2 during the matter era which is disfavored by observational data can be avoided by the existence of a quadratic kessence lagrangian x2 we study the evolution of nonrelativistic matter perturbations for the model c_t21 and show that the two quantities mu and sigma which are related to the newtonian and weak lensing gravitational potentials respectively are practically equivalent to each other such that mu simeq sigma1 for the case in which the deviation of w_rm de from 1 is significant at a later cosmological epoch the values of mu and sigma tend to be larger at low redshifts we also find that our dark energy model can be consistent with the bounds on the deviation parameter alpha_rm h from horndeski theories arising from the modification of gravitational law inside massive objects | [['the', 'gleyzeslangloispiazzavernizzi', 'glpv', 'theories', 'up', 'to', 'quartic', 'order', 'are', 'the', 'general', 'scheme', 'of', 'scalartensor', 'theories', 'allowing', 'the', 'possibility', 'for', 'realizing', 'the', 'tensor', 'propagation', 'speed', 'c_t', 'equivalent', 'to', '1', 'on', 'the', 'isotropic', 'cosmological', 'background', 'we', 'propose', 'a', 'dark', 'energy', 'model', 'in', 'which', 'the', 'latetime', 'cosmic', 'acceleration', 'occurs', 'by', 'a', 'simple', 'kessence', 'lagrangian', 'analogous', 'to', 'the', 'ghost', 'condensate', 'with', 'cubic', 'and', 'quartic', 'galileons', 'in', 'the', 'framework', 'of', 'glpv', 'theories', 'we', 'show', 'that', 'a', 'wide', 'variety', 'of', 'the', 'variation', 'of', 'the', 'dark', 'energy', 'equation', 'of', 'state', 'w_rm', 'de', 'including', 'the', 'entry', 'to', 'the', 'region', 'w_rm', 'de1', 'can', 'be', 'realized', 'without', 'violating', 'conditions', 'for', 'the', 'absence', 'of', 'ghosts', 'and', 'laplacian', 'instabilities', 'the', 'approach', 'to', 'the', 'tracker', 'equation', 'of', 'state', 'w_rm', 'de2', 'during', 'the', 'matter', 'era', 'which', 'is', 'disfavored', 'by', 'observational', 'data', 'can', 'be', 'avoided', 'by', 'the', 'existence', 'of', 'a', 'quadratic', 'kessence', 'lagrangian', 'x2', 'we', 'study', 'the', 'evolution', 'of', 'nonrelativistic', 'matter', 'perturbations', 'for', 'the', 'model', 'c_t21', 'and', 'show', 'that', 'the', 'two', 'quantities', 'mu', 'and', 'sigma', 'which', 'are', 'related', 'to', 'the', 'newtonian', 'and', 'weak', 'lensing', 'gravitational', 'potentials', 'respectively', 'are', 'practically', 'equivalent', 'to', 'each', 'other', 'such', 'that', 'mu', 'simeq', 'sigma1', 'for', 'the', 'case', 'in', 'which', 'the', 'deviation', 'of', 'w_rm', 'de', 'from', '1', 'is', 'significant', 'at', 'a', 'later', 'cosmological', 'epoch', 'the', 'values', 'of', 'mu', 'and', 'sigma', 'tend', 'to', 'be', 'larger', 'at', 'low', 'redshifts', 'we', 'also', 'find', 'that', 'our', 'dark', 'energy', 'model', 'can', 'be', 'consistent', 'with', 'the', 'bounds', 'on', 'the', 'deviation', 'parameter', 'alpha_rm', 'h', 'from', 'horndeski', 'theories', 'arising', 'from', 'the', 'modification', 'of', 'gravitational', 'law', 'inside', 'massive', 'objects']] | [-0.13241484110443458, 0.15514991028792402, -0.08243630670702937, 0.1073606309437604, -0.0963405741167515, -0.14350418107553956, -0.054542311711372575, 0.28378244004540354, -0.22670409925813292, -0.3188713620933384, 0.03418242157321906, -0.26678624257882716, -0.08518539124492722, 0.16440054200502935, 0.015604253851611597, 0.009460053823359012, -0.009042832382053499, 0.045402527023728954, -0.06113792620486154, -0.23524056551817743, 0.3421201449460708, 0.06035008062778214, 0.20745004699419362, 0.029511419502897603, 0.0988873965752609, -0.06581864245462152, 0.023714053623664837, 0.02502412952460077, -0.18941812656373483, 0.043832799674271936, 0.1918377908908075, 0.11003162846466912, 0.2041710655447739, -0.37098415669144286, -0.2493026302901176, 0.16964459768590717, 0.11659700539941534, 0.1248466621401912, -0.01275476425610905, -0.3072423908380751, 0.08357094470571787, -0.17923937008719937, -0.14060706819637644, -0.03791589287452792, -0.0030976801258530695, -0.02230807402932843, -0.27221738969763887, 0.1678461634273771, 0.004778952224685354, -0.04731846547983436, -0.08692659396533986, -0.08890308328830686, -0.054872734761544265, -0.003385965970650255, 0.09398812674379979, 0.060083865755999284, 0.12293085957375857, -0.19616849482180135, -0.05377096021811851, 0.42910168446630603, -0.16175161105032015, -0.1706279868161992, 0.14789795517348325, -0.15019577336137047, -0.14571321514521834, 0.12147694846109944, 0.12569675992359877, 0.10694881269205969, -0.11013276267774132, 0.1755842398132173, 0.03625062816052392, 0.15181000818788765, 0.08787106430565238, 0.016445860899428684, 0.27007963366595356, 0.07926795104337547, 0.05247873247710438, 0.06044537741299681, -0.06814115579963025, -0.09117505658108756, -0.38413353314102905, -0.13132932563293498, -0.12106504172712625, 0.06414281515553519, -0.16188359942425304, -0.12653927880514654, 0.3560545476081352, 0.12899909215613536, 0.1568340406857284, 0.08268194803440197, 0.2504755637499123, 0.12006132407556948, 0.051102068013632256, 0.06709567422371523, 0.30701996866040504, 0.10804228053186918, 0.09794120128438073, -0.23039012443112125, -0.03543928318547635, 0.047944459577773504] |
1,802.02729 | Transverse momentum distributions of electron in simulated QED model | In the present work, we have studied the transverse momentum distributions
(TMDs) for the electron in simulated QED model. We have used the overlap
representation of light-front wave functions (LFWFs) where the spin-1/2
relativistic composite system consists of spin-1/2 fermion and spin-1 vector
boson. The results have been obtained for T-even TMDs in transverse momentum
plane for fixed value of longitudinal momentum fraction $x$.
| hep-ph | in the present work we have studied the transverse momentum distributions tmds for the electron in simulated qed model we have used the overlap representation of lightfront wave functions lfwfs where the spin12 relativistic composite system consists of spin12 fermion and spin1 vector boson the results have been obtained for teven tmds in transverse momentum plane for fixed value of longitudinal momentum fraction x | [['in', 'the', 'present', 'work', 'we', 'have', 'studied', 'the', 'transverse', 'momentum', 'distributions', 'tmds', 'for', 'the', 'electron', 'in', 'simulated', 'qed', 'model', 'we', 'have', 'used', 'the', 'overlap', 'representation', 'of', 'lightfront', 'wave', 'functions', 'lfwfs', 'where', 'the', 'spin12', 'relativistic', 'composite', 'system', 'consists', 'of', 'spin12', 'fermion', 'and', 'spin1', 'vector', 'boson', 'the', 'results', 'have', 'been', 'obtained', 'for', 'teven', 'tmds', 'in', 'transverse', 'momentum', 'plane', 'for', 'fixed', 'value', 'of', 'longitudinal', 'momentum', 'fraction', 'x']] | [-0.13491597029496916, 0.26512183434533654, -0.06957751982554328, 0.0826205653429497, -0.04077389853409841, -0.0813500321819447, -0.04966133395282668, 0.44062544306507334, -0.12281547247766866, -0.2035427373739367, -0.11200036357149656, -0.30123864275810774, -0.0015621732636645902, 0.14793326763538062, 0.14503098651766777, 0.16741773669491522, 0.02997469060937874, -0.014720921117259422, -0.12754963567567756, -0.18650640619216574, 0.37033016186614987, -0.028802907225326635, 0.2963490831316449, 0.06487741664750502, 0.13142089321627282, 0.1651485420188692, 0.02189592735521728, -0.042881192377535626, -0.1317436280369293, 0.019369781235582195, 0.22103319250891218, -0.02012510576241766, 0.16504069536313182, -0.3505654889449943, -0.17217581803561188, 0.05749226133048069, 0.20202031303779222, 0.10735729504085612, -0.08060823900450487, -0.26098900746001163, -0.02042905161943054, -0.25216954737334163, -0.19607679767068475, -0.12536027739042765, -0.0022412488688132726, 0.0049901885795407, -0.2629949491820298, 0.12937873185728677, -0.01987885602284223, 0.04153449778095819, -0.03616812461405061, -0.2513862477408111, -0.10412413039739477, 0.038461040225229226, 0.08588331495229795, 0.1383892005724192, 0.09787781073828228, -0.18476899091911037, -0.1593884395697387, 0.37048944387061056, -0.04730053942694212, -0.31219173708814196, 0.07808205973560689, -0.2517170023493236, -0.13512634407379664, 0.11783726955763996, 0.2654596230131574, 0.10674998509057332, -0.19153822588850744, 0.1429151641414137, -0.1239602404600646, 0.08024518517049728, 0.0319573962733557, 0.11728217995550949, 0.2453730351262493, 0.12364607064591837, -0.09534409449042869, 0.1508746378858632, -0.11838878793059848, -0.13878597279835958, -0.2841437932802364, -0.18026593073864206, -0.21925074378850695, 0.06038647388118079, -0.03869687822384549, -0.1285092915277346, 0.43555234681116417, 0.11719944267463234, 0.2317518376657972, -0.027154470782988938, 0.2567642340763996, 0.15874023139440396, 0.08465217742923414, 0.07120737490186002, 0.275831645281869, 0.1721537386183627, 0.1619677574472007, -0.22941709522274323, -0.04476620934656239, 0.1068016770441318] |
1,802.0273 | Representation and Characterization of Non-Stationary Processes by
Dilation Operators and Induced Shape Space Manifolds | We have introduce a new vision of stochastic processes through the geometry
induced by the dilation. The dilation matrices of a given processes are
obtained by a composition of rotations matrices, contain the measure
information in a condensed way. Particularly interesting is the fact that the
obtention of dilation matrices is regardless of the stationarity of the
underlying process. When the process is stationary, it coincides with the
Naimark Dilation and only one rotation matrix is computed, when the process is
non-stationary, a set of rotation matrices are computed. In particular, the
periodicity of the correlation function that may appear in some classes of
signal is transmitted to the set of dilation matrices. These rotation matrices,
which can be arbitrarily close to each other depending on the sampling or the
rescaling of the signal are seen as a distinctive feature of the signal. In
order to study this sequence of matrices, and guided by the possibility to
rescale the signal, the correct geometrical framework to use with the
dilation's theoretic results is the space of curves on manifolds, that is the
set of all curve that lies on a base manifold. To give a complete sight about
the space of curve, a metric and the derived geodesic equation are provided.
The general results are adapted to the more specific case where the base
manifold is the Lie group of rotation matrices. The notion of the shape of a
curve can be formalized as the set of equivalence classes of curves given by
the quotient space of the space of curves and the increasing diffeomorphisms.
The metric in the space of curve naturally extent to the space of shapes and
enable comparison between shapes.
| math.MG math.DG stat.AP | we have introduce a new vision of stochastic processes through the geometry induced by the dilation the dilation matrices of a given processes are obtained by a composition of rotations matrices contain the measure information in a condensed way particularly interesting is the fact that the obtention of dilation matrices is regardless of the stationarity of the underlying process when the process is stationary it coincides with the naimark dilation and only one rotation matrix is computed when the process is nonstationary a set of rotation matrices are computed in particular the periodicity of the correlation function that may appear in some classes of signal is transmitted to the set of dilation matrices these rotation matrices which can be arbitrarily close to each other depending on the sampling or the rescaling of the signal are seen as a distinctive feature of the signal in order to study this sequence of matrices and guided by the possibility to rescale the signal the correct geometrical framework to use with the dilations theoretic results is the space of curves on manifolds that is the set of all curve that lies on a base manifold to give a complete sight about the space of curve a metric and the derived geodesic equation are provided the general results are adapted to the more specific case where the base manifold is the lie group of rotation matrices the notion of the shape of a curve can be formalized as the set of equivalence classes of curves given by the quotient space of the space of curves and the increasing diffeomorphisms the metric in the space of curve naturally extent to the space of shapes and enable comparison between shapes | [['we', 'have', 'introduce', 'a', 'new', 'vision', 'of', 'stochastic', 'processes', 'through', 'the', 'geometry', 'induced', 'by', 'the', 'dilation', 'the', 'dilation', 'matrices', 'of', 'a', 'given', 'processes', 'are', 'obtained', 'by', 'a', 'composition', 'of', 'rotations', 'matrices', 'contain', 'the', 'measure', 'information', 'in', 'a', 'condensed', 'way', 'particularly', 'interesting', 'is', 'the', 'fact', 'that', 'the', 'obtention', 'of', 'dilation', 'matrices', 'is', 'regardless', 'of', 'the', 'stationarity', 'of', 'the', 'underlying', 'process', 'when', 'the', 'process', 'is', 'stationary', 'it', 'coincides', 'with', 'the', 'naimark', 'dilation', 'and', 'only', 'one', 'rotation', 'matrix', 'is', 'computed', 'when', 'the', 'process', 'is', 'nonstationary', 'a', 'set', 'of', 'rotation', 'matrices', 'are', 'computed', 'in', 'particular', 'the', 'periodicity', 'of', 'the', 'correlation', 'function', 'that', 'may', 'appear', 'in', 'some', 'classes', 'of', 'signal', 'is', 'transmitted', 'to', 'the', 'set', 'of', 'dilation', 'matrices', 'these', 'rotation', 'matrices', 'which', 'can', 'be', 'arbitrarily', 'close', 'to', 'each', 'other', 'depending', 'on', 'the', 'sampling', 'or', 'the', 'rescaling', 'of', 'the', 'signal', 'are', 'seen', 'as', 'a', 'distinctive', 'feature', 'of', 'the', 'signal', 'in', 'order', 'to', 'study', 'this', 'sequence', 'of', 'matrices', 'and', 'guided', 'by', 'the', 'possibility', 'to', 'rescale', 'the', 'signal', 'the', 'correct', 'geometrical', 'framework', 'to', 'use', 'with', 'the', 'dilations', 'theoretic', 'results', 'is', 'the', 'space', 'of', 'curves', 'on', 'manifolds', 'that', 'is', 'the', 'set', 'of', 'all', 'curve', 'that', 'lies', 'on', 'a', 'base', 'manifold', 'to', 'give', 'a', 'complete', 'sight', 'about', 'the', 'space', 'of', 'curve', 'a', 'metric', 'and', 'the', 'derived', 'geodesic', 'equation', 'are', 'provided', 'the', 'general', 'results', 'are', 'adapted', 'to', 'the', 'more', 'specific', 'case', 'where', 'the', 'base', 'manifold', 'is', 'the', 'lie', 'group', 'of', 'rotation', 'matrices', 'the', 'notion', 'of', 'the', 'shape', 'of', 'a', 'curve', 'can', 'be', 'formalized', 'as', 'the', 'set', 'of', 'equivalence', 'classes', 'of', 'curves', 'given', 'by', 'the', 'quotient', 'space', 'of', 'the', 'space', 'of', 'curves', 'and', 'the', 'increasing', 'diffeomorphisms', 'the', 'metric', 'in', 'the', 'space', 'of', 'curve', 'naturally', 'extent', 'to', 'the', 'space', 'of', 'shapes', 'and', 'enable', 'comparison', 'between', 'shapes']] | [-0.13532501987762446, 0.11588557738014382, -0.10626019004159755, 0.06355954782759816, -0.08170336860070801, -0.07825657286493654, 0.014700017524340154, 0.3646186976454981, -0.3077011572743368, -0.2663267077285757, 0.13574108931231033, -0.2576555059975928, -0.15627852069993928, 0.20717089569818084, -0.09196026774486132, 0.0354483443211152, 0.047644638195600976, 0.07868852794035452, -0.12312625854707228, -0.23104891594245952, 0.3925424617297237, 0.0334322228632841, 0.24117278100021, -0.014105679258348769, 0.11891191703713311, -0.0007111449820950443, -0.03625864153291846, 0.010138295277214342, -0.07307648501663745, 0.13336895795805584, 0.2152043165204645, 0.16641226849048119, 0.19896687672707145, -0.3619312503714075, -0.21568341433319885, 0.15116495925393417, 0.10470880019754523, 0.0746814024115521, -0.015276606015989791, -0.29181318594901345, 0.08381693741486017, -0.09098697583192743, -0.1275375919941444, -0.05098076024777239, 0.04283779509391886, 0.026589049007447418, -0.25751528704815374, 0.027817750315292156, 0.09384523524471654, 0.05592112459932197, -0.04079681308775508, -0.061073685921777976, -0.03228040748808941, 0.14157570811344786, 0.04446916180375269, 0.040904896247016376, 0.12436473715800278, -0.07484468549297457, -0.09293436729937443, 0.4119084046021525, -0.057017199772034934, -0.24413094084130685, 0.14359611128053756, -0.1870226346700067, -0.09446525403920417, 0.1474670562671017, 0.1670729211883705, 0.1083048190493729, -0.11649124402202775, 0.10123292949974583, -0.06635851757567994, 0.12464679884493957, 0.052704476603296954, 0.01704120101565956, 0.17619951241962323, 0.11201288948385144, 0.08864765589013564, 0.12825052690500552, -0.061134800054100026, -0.08992413872056526, -0.33865163082589295, -0.1638109040448225, -0.1867905517636104, 0.04341207537594393, -0.14739050024225872, -0.16861708619213883, 0.4091478982683627, 0.08213772679488429, 0.26135708458636076, 0.05660468271181527, 0.24221171841170153, 0.12072877945438482, 0.0678650009624377, 0.03969211237136498, 0.2037127037610169, 0.1711617429146721, 0.03650651888283424, -0.18109629718856657, 0.07358939373884646, 0.08119250255037928] |
1,802.02731 | Topologically Controlled Lossy Compression | This paper presents a new algorithm for the lossy compression of scalar data
defined on 2D or 3D regular grids, with topological control. Certain techniques
allow users to control the pointwise error induced by the compression. However,
in many scenarios it is desirable to control in a similar way the preservation
of higher-level notions, such as topological features , in order to provide
guarantees on the outcome of post-hoc data analyses. This paper presents the
first compression technique for scalar data which supports a strictly
controlled loss of topological features. It provides users with specific
guarantees both on the preservation of the important features and on the size
of the smaller features destroyed during compression. In particular, we present
a simple compression strategy based on a topologically adaptive quantization of
the range. Our algorithm provides strong guarantees on the bottleneck distance
between persistence diagrams of the input and decompressed data, specifically
those associated with extrema. A simple extension of our strategy additionally
enables a control on the pointwise error. We also show how to combine our
approach with state-of-the-art compressors, to further improve the geometrical
reconstruction. Extensive experiments, for comparable compression rates,
demonstrate the superiority of our algorithm in terms of the preservation of
topological features. We show the utility of our approach by illustrating the
compatibility between the output of post-hoc topological data analysis
pipelines, executed on the input and decompressed data, for simulated or
acquired data sets. We also provide a lightweight VTK-based C++ implementation
of our approach for reproduction purposes.
| eess.IV cs.CG cs.CV cs.GR | this paper presents a new algorithm for the lossy compression of scalar data defined on 2d or 3d regular grids with topological control certain techniques allow users to control the pointwise error induced by the compression however in many scenarios it is desirable to control in a similar way the preservation of higherlevel notions such as topological features in order to provide guarantees on the outcome of posthoc data analyses this paper presents the first compression technique for scalar data which supports a strictly controlled loss of topological features it provides users with specific guarantees both on the preservation of the important features and on the size of the smaller features destroyed during compression in particular we present a simple compression strategy based on a topologically adaptive quantization of the range our algorithm provides strong guarantees on the bottleneck distance between persistence diagrams of the input and decompressed data specifically those associated with extrema a simple extension of our strategy additionally enables a control on the pointwise error we also show how to combine our approach with stateoftheart compressors to further improve the geometrical reconstruction extensive experiments for comparable compression rates demonstrate the superiority of our algorithm in terms of the preservation of topological features we show the utility of our approach by illustrating the compatibility between the output of posthoc topological data analysis pipelines executed on the input and decompressed data for simulated or acquired data sets we also provide a lightweight vtkbased c implementation of our approach for reproduction purposes | [['this', 'paper', 'presents', 'a', 'new', 'algorithm', 'for', 'the', 'lossy', 'compression', 'of', 'scalar', 'data', 'defined', 'on', '2d', 'or', '3d', 'regular', 'grids', 'with', 'topological', 'control', 'certain', 'techniques', 'allow', 'users', 'to', 'control', 'the', 'pointwise', 'error', 'induced', 'by', 'the', 'compression', 'however', 'in', 'many', 'scenarios', 'it', 'is', 'desirable', 'to', 'control', 'in', 'a', 'similar', 'way', 'the', 'preservation', 'of', 'higherlevel', 'notions', 'such', 'as', 'topological', 'features', 'in', 'order', 'to', 'provide', 'guarantees', 'on', 'the', 'outcome', 'of', 'posthoc', 'data', 'analyses', 'this', 'paper', 'presents', 'the', 'first', 'compression', 'technique', 'for', 'scalar', 'data', 'which', 'supports', 'a', 'strictly', 'controlled', 'loss', 'of', 'topological', 'features', 'it', 'provides', 'users', 'with', 'specific', 'guarantees', 'both', 'on', 'the', 'preservation', 'of', 'the', 'important', 'features', 'and', 'on', 'the', 'size', 'of', 'the', 'smaller', 'features', 'destroyed', 'during', 'compression', 'in', 'particular', 'we', 'present', 'a', 'simple', 'compression', 'strategy', 'based', 'on', 'a', 'topologically', 'adaptive', 'quantization', 'of', 'the', 'range', 'our', 'algorithm', 'provides', 'strong', 'guarantees', 'on', 'the', 'bottleneck', 'distance', 'between', 'persistence', 'diagrams', 'of', 'the', 'input', 'and', 'decompressed', 'data', 'specifically', 'those', 'associated', 'with', 'extrema', 'a', 'simple', 'extension', 'of', 'our', 'strategy', 'additionally', 'enables', 'a', 'control', 'on', 'the', 'pointwise', 'error', 'we', 'also', 'show', 'how', 'to', 'combine', 'our', 'approach', 'with', 'stateoftheart', 'compressors', 'to', 'further', 'improve', 'the', 'geometrical', 'reconstruction', 'extensive', 'experiments', 'for', 'comparable', 'compression', 'rates', 'demonstrate', 'the', 'superiority', 'of', 'our', 'algorithm', 'in', 'terms', 'of', 'the', 'preservation', 'of', 'topological', 'features', 'we', 'show', 'the', 'utility', 'of', 'our', 'approach', 'by', 'illustrating', 'the', 'compatibility', 'between', 'the', 'output', 'of', 'posthoc', 'topological', 'data', 'analysis', 'pipelines', 'executed', 'on', 'the', 'input', 'and', 'decompressed', 'data', 'for', 'simulated', 'or', 'acquired', 'data', 'sets', 'we', 'also', 'provide', 'a', 'lightweight', 'vtkbased', 'c', 'implementation', 'of', 'our', 'approach', 'for', 'reproduction', 'purposes']] | [-0.11059311183681526, 0.019317003710944934, -0.10731604402565742, 0.0509469597799837, -0.06968867232692817, -0.12574859398354096, 0.08126559603840587, 0.39191347492702927, -0.2770836710618193, -0.3113595491991308, 0.10296374159369737, -0.2453342601063242, -0.17020999501130926, 0.24132795927051706, -0.09302833310951779, 0.10286633135283373, 0.09757437362925583, 0.035707360506196884, -0.08528244391023887, -0.2654163457232479, 0.3125736612814527, 0.053884333040401994, 0.34748744286329625, 0.04009688338747181, 0.09649593233310828, 0.012889968314805473, -0.052549804216232225, 0.018698076706424177, -0.1252935295423634, 0.1720988470727051, 0.22578797376607043, 0.18104069140290774, 0.2636538406767218, -0.4157561866373595, -0.20641625733012742, 0.046232425435205025, 0.11921884712254799, 0.10241277270395666, -0.09279455015420973, -0.29791503862117924, 0.13154516094438434, -0.14142385010321837, -0.04285935859244124, -0.13513846508231, -0.04624007059543197, 0.023848835907160373, -0.3074338433343873, 0.045420772276134176, 0.07951743110543139, 0.07265226434975625, -0.06401234721826145, -0.061837964849843385, 0.005361491780861678, 0.1332144726743083, 0.0237735820334939, 0.012102257849952851, 0.108995578780518, -0.12600673893392383, -0.14128747960298407, 0.3894508900714526, -0.059802561743737784, -0.20818994235362398, 0.2086189824510811, -0.05904221697432171, -0.12956681270597584, 0.10796772830737421, 0.2025243675139588, 0.09352844490658536, -0.09546851295146691, 0.03963025926962027, -0.01535875864319533, 0.18202547853129852, 0.030441447442204533, 0.06664652818910392, 0.14352740354991825, 0.20956246491310102, 0.09917567603162998, 0.18382729306228948, -0.08699098148253798, -0.058750671527971816, -0.3009863938353362, -0.14024640291009055, -0.17337944634459113, -0.029834531530073708, -0.12319748295431417, -0.17394552718981565, 0.422412886575562, 0.21094925695594513, 0.21634982140264955, 0.08847105571771953, 0.37629997246041597, 0.054829210125974776, 0.07344195323827421, 0.06886116248663085, 0.1863745604219672, 0.057425088796438095, 0.09613414870438712, -0.2046728727126687, 0.08444673063296572, 0.05210815239475068] |
1,802.02732 | The Higher-Order Prover Leo-III (Extended Version) | The automated theorem prover Leo-III for classical higher-order logic with
Henkin semantics and choice is presented. Leo-III is based on extensional
higher-order paramodulation and accepts every common TPTP dialect (FOF, TFF,
THF), including their recent extensions to rank-1 polymorphism (TF1, TH1). In
addition, the prover natively supports almost every normal higher-order modal
logic. Leo-III cooperates with first-order reasoning tools using translations
to many-sorted first-order logic and produces verifiable proof certificates.
The prover is evaluated on heterogeneous benchmark sets.
| cs.AI cs.LO math.LO | the automated theorem prover leoiii for classical higherorder logic with henkin semantics and choice is presented leoiii is based on extensional higherorder paramodulation and accepts every common tptp dialect fof tff thf including their recent extensions to rank1 polymorphism tf1 th1 in addition the prover natively supports almost every normal higherorder modal logic leoiii cooperates with firstorder reasoning tools using translations to manysorted firstorder logic and produces verifiable proof certificates the prover is evaluated on heterogeneous benchmark sets | [['the', 'automated', 'theorem', 'prover', 'leoiii', 'for', 'classical', 'higherorder', 'logic', 'with', 'henkin', 'semantics', 'and', 'choice', 'is', 'presented', 'leoiii', 'is', 'based', 'on', 'extensional', 'higherorder', 'paramodulation', 'and', 'accepts', 'every', 'common', 'tptp', 'dialect', 'fof', 'tff', 'thf', 'including', 'their', 'recent', 'extensions', 'to', 'rank1', 'polymorphism', 'tf1', 'th1', 'in', 'addition', 'the', 'prover', 'natively', 'supports', 'almost', 'every', 'normal', 'higherorder', 'modal', 'logic', 'leoiii', 'cooperates', 'with', 'firstorder', 'reasoning', 'tools', 'using', 'translations', 'to', 'manysorted', 'firstorder', 'logic', 'and', 'produces', 'verifiable', 'proof', 'certificates', 'the', 'prover', 'is', 'evaluated', 'on', 'heterogeneous', 'benchmark', 'sets']] | [-0.11739191658456218, -0.011951373608075324, -0.0972920346962796, 0.12810915546316362, -0.20215953417219124, -0.22727430810208443, 0.06473153884304905, 0.3440137416027583, -0.2569271725687114, -0.21997253387386292, 0.07284906423082213, -0.27704084301730253, -0.05122934169681779, 0.1986958490527392, -0.13835104868154635, 0.07633055972733668, 0.045846237819158024, 0.05545950997257968, 0.0008775656619532542, -0.23613029651724818, 0.24806566087244827, -0.08856989780150644, 0.26555142154941314, 0.06723356318762888, 0.10624227234972762, 0.11229208308913104, -0.033572250018622, 0.018826612543508217, -0.049851928840621146, 0.13834101824972828, 0.35467652480311496, 0.2475938839995145, 0.28279150186058183, -0.40164875188561205, -0.03270083398451611, 0.0007657968959251007, 0.03162481680560809, 0.10177477852172255, 0.01896201931212291, -0.3702083049317846, 0.14219837582537107, -0.2058879293610233, -0.01674510757499314, -0.187222271165871, 0.011709809189892144, 0.02237772257857224, -0.22193813190153686, -0.013225155422923627, 0.22949221460511546, 0.15488582850712074, 0.02283949242880592, -0.10171819853221441, -0.0431296386674361, 0.014568697262023176, -0.08579723524721944, 0.03583246354594246, 0.16649542029836675, 0.0010341339980481895, -0.25159738256970976, 0.3423908640715209, -0.06298166409425147, -0.17094098620854511, 0.19812635891441885, 0.0017705783368898676, -0.20228480138852226, 0.06328977753299397, 0.04586687223538272, 0.130918952176807, -0.11229686495884285, 0.14033121750886587, -0.018694402523756076, 0.34012621635111506, 0.19431292444661066, 0.01073012217976056, 0.15831031214881253, 0.18116253220730208, -0.019983794624832543, 0.13435673938048157, 0.08680155235282205, -0.15268431575636246, -0.3232326032457776, -0.14361544546078553, -0.05814086677893609, -0.11347669245548207, -0.10875109269819676, -0.24613377568009612, 0.2793947338525738, 0.12902182182402944, -0.017299878332376867, 0.21574820616802612, 0.35213179585173143, 0.07828288382016026, 0.11905501518918613, 0.04474739177309751, 0.10284260388270214, 0.15532129611094275, 0.12144145907156846, -0.10029878172200996, 0.15995266319512597, 0.16591770027449668] |
1,802.02733 | From Hashing to CNNs: Training BinaryWeight Networks via Hashing | Deep convolutional neural networks (CNNs) have shown appealing performance on
various computer vision tasks in recent years. This motivates people to deploy
CNNs to realworld applications. However, most of state-of-art CNNs require
large memory and computational resources, which hinders the deployment on
mobile devices. Recent studies show that low-bit weight representation can
reduce much storage and memory demand, and also can achieve efficient network
inference. To achieve this goal, we propose a novel approach named BWNH to
train Binary Weight Networks via Hashing. In this paper, we first reveal the
strong connection between inner-product preserving hashing and binary weight
networks, and show that training binary weight networks can be intrinsically
regarded as a hashing problem. Based on this perspective, we propose an
alternating optimization method to learn the hash codes instead of directly
learning binary weights. Extensive experiments on CIFAR10, CIFAR100 and
ImageNet demonstrate that our proposed BWNH outperforms current state-of-art by
a large margin.
| cs.CV | deep convolutional neural networks cnns have shown appealing performance on various computer vision tasks in recent years this motivates people to deploy cnns to realworld applications however most of stateofart cnns require large memory and computational resources which hinders the deployment on mobile devices recent studies show that lowbit weight representation can reduce much storage and memory demand and also can achieve efficient network inference to achieve this goal we propose a novel approach named bwnh to train binary weight networks via hashing in this paper we first reveal the strong connection between innerproduct preserving hashing and binary weight networks and show that training binary weight networks can be intrinsically regarded as a hashing problem based on this perspective we propose an alternating optimization method to learn the hash codes instead of directly learning binary weights extensive experiments on cifar10 cifar100 and imagenet demonstrate that our proposed bwnh outperforms current stateofart by a large margin | [['deep', 'convolutional', 'neural', 'networks', 'cnns', 'have', 'shown', 'appealing', 'performance', 'on', 'various', 'computer', 'vision', 'tasks', 'in', 'recent', 'years', 'this', 'motivates', 'people', 'to', 'deploy', 'cnns', 'to', 'realworld', 'applications', 'however', 'most', 'of', 'stateofart', 'cnns', 'require', 'large', 'memory', 'and', 'computational', 'resources', 'which', 'hinders', 'the', 'deployment', 'on', 'mobile', 'devices', 'recent', 'studies', 'show', 'that', 'lowbit', 'weight', 'representation', 'can', 'reduce', 'much', 'storage', 'and', 'memory', 'demand', 'and', 'also', 'can', 'achieve', 'efficient', 'network', 'inference', 'to', 'achieve', 'this', 'goal', 'we', 'propose', 'a', 'novel', 'approach', 'named', 'bwnh', 'to', 'train', 'binary', 'weight', 'networks', 'via', 'hashing', 'in', 'this', 'paper', 'we', 'first', 'reveal', 'the', 'strong', 'connection', 'between', 'innerproduct', 'preserving', 'hashing', 'and', 'binary', 'weight', 'networks', 'and', 'show', 'that', 'training', 'binary', 'weight', 'networks', 'can', 'be', 'intrinsically', 'regarded', 'as', 'a', 'hashing', 'problem', 'based', 'on', 'this', 'perspective', 'we', 'propose', 'an', 'alternating', 'optimization', 'method', 'to', 'learn', 'the', 'hash', 'codes', 'instead', 'of', 'directly', 'learning', 'binary', 'weights', 'extensive', 'experiments', 'on', 'cifar10', 'cifar100', 'and', 'imagenet', 'demonstrate', 'that', 'our', 'proposed', 'bwnh', 'outperforms', 'current', 'stateofart', 'by', 'a', 'large', 'margin']] | [-0.10370452594684644, -0.02052076564090908, -0.03591787032904773, 0.03936721213478473, -0.14222962174905476, -0.21513487338666726, 0.04222889303068442, 0.5084690277531646, -0.2953618843134286, -0.3225719821000216, 0.062335500089616025, -0.229836360642723, -0.26694853070459873, 0.2146249770862507, -0.186199690410076, 0.13243966587755246, 0.21976053132295145, 0.02292299282423592, -0.11328295826625834, -0.3677103152778513, 0.2827773697893409, 0.09236686063905283, 0.396558404687086, 0.05210415768289476, 0.11994463483650036, -0.03623759597113806, 0.0018244804517712956, -0.037446102482765864, -0.02369616027335367, 0.23406643567080274, 0.34269906367704855, 0.20209510901979372, 0.347928463590934, -0.45782673892145065, -0.2610565355972819, 0.12399194853264668, 0.14556950723122367, 0.09200122297415814, -0.05613623793446915, -0.30887062447389063, 0.11809877823167815, -0.2277085688726039, 0.08676502757922219, -0.22328980644218308, -0.03015351672869882, 0.008730054390160185, -0.29490691015391846, -0.012116018482795886, 0.052678200242785266, 0.007751745013580992, -0.0037622397208740034, -0.14895306071388273, 0.07994386443664363, 0.10545580286922213, -0.0026968316132434055, 0.07093018800129786, 0.11765846710810376, -0.1977037255335721, -0.19777510051609448, 0.3161088407733569, -0.025789962721580725, -0.17237550830407664, 0.20985610666836985, 0.0460266069633874, -0.1894341897024633, 0.04943222908936198, 0.3051187000511324, 0.12935507598217405, -0.12928413140155326, 0.005351067186649767, -0.06306477262352417, 0.21781928081588905, 0.0587414602134255, 0.04435139315300225, 0.1724954196678024, 0.2929963634769414, 0.05909633182226589, 0.17343754604918382, -0.14326653079574111, -0.07981308282419942, -0.09806886300432428, -0.08419463863243269, -0.26215262392389715, 0.028995290867302542, -0.10846492234146485, -0.13502960895928873, 0.3663978519502516, 0.2573601958536683, 0.22032269319592446, 0.17387320747784663, 0.34715801325864065, -0.006817046263760406, 0.19571871793253676, 0.15329714583269521, 0.17769935322937622, 0.02467219253508922, 0.15086836505793888, -0.16556503021103494, 0.0761899647517495, 0.06026548203506988] |
1,802.02734 | Is the Spiral Galaxy a Cosmic Hurricane? | It is discussed that the formation of the spiral galaxies is driven by the
cosmic background rotation, not a result of an isolated evolution proposed by
the density wave theory. To analyze the motions of the galaxies, a simple
double particle galaxy model is considered and the Coriolis force formed by the
rotational background is introduced. The numerical analysis shows that not only
the trajectory of the particle is the spiral shape, but also the relationship
between the velocity and the radius reveals both the existence of spiral arm
and the change of the arm number. In addition, the results of the
three-dimensional simulation also give the warped structure of the spiral
galaxies, and shows that the disc surface of the warped galaxy, like a spinning
coins on the table, exists a whole overturning movement. Through the analysis,
it can be concluded that the background environment of the spiral galaxies have
a large-scale rotation, and both the formation and evolution of hurricane-like
spiral galaxies are driven by this background rotation.
| astro-ph.GA | it is discussed that the formation of the spiral galaxies is driven by the cosmic background rotation not a result of an isolated evolution proposed by the density wave theory to analyze the motions of the galaxies a simple double particle galaxy model is considered and the coriolis force formed by the rotational background is introduced the numerical analysis shows that not only the trajectory of the particle is the spiral shape but also the relationship between the velocity and the radius reveals both the existence of spiral arm and the change of the arm number in addition the results of the threedimensional simulation also give the warped structure of the spiral galaxies and shows that the disc surface of the warped galaxy like a spinning coins on the table exists a whole overturning movement through the analysis it can be concluded that the background environment of the spiral galaxies have a largescale rotation and both the formation and evolution of hurricanelike spiral galaxies are driven by this background rotation | [['it', 'is', 'discussed', 'that', 'the', 'formation', 'of', 'the', 'spiral', 'galaxies', 'is', 'driven', 'by', 'the', 'cosmic', 'background', 'rotation', 'not', 'a', 'result', 'of', 'an', 'isolated', 'evolution', 'proposed', 'by', 'the', 'density', 'wave', 'theory', 'to', 'analyze', 'the', 'motions', 'of', 'the', 'galaxies', 'a', 'simple', 'double', 'particle', 'galaxy', 'model', 'is', 'considered', 'and', 'the', 'coriolis', 'force', 'formed', 'by', 'the', 'rotational', 'background', 'is', 'introduced', 'the', 'numerical', 'analysis', 'shows', 'that', 'not', 'only', 'the', 'trajectory', 'of', 'the', 'particle', 'is', 'the', 'spiral', 'shape', 'but', 'also', 'the', 'relationship', 'between', 'the', 'velocity', 'and', 'the', 'radius', 'reveals', 'both', 'the', 'existence', 'of', 'spiral', 'arm', 'and', 'the', 'change', 'of', 'the', 'arm', 'number', 'in', 'addition', 'the', 'results', 'of', 'the', 'threedimensional', 'simulation', 'also', 'give', 'the', 'warped', 'structure', 'of', 'the', 'spiral', 'galaxies', 'and', 'shows', 'that', 'the', 'disc', 'surface', 'of', 'the', 'warped', 'galaxy', 'like', 'a', 'spinning', 'coins', 'on', 'the', 'table', 'exists', 'a', 'whole', 'overturning', 'movement', 'through', 'the', 'analysis', 'it', 'can', 'be', 'concluded', 'that', 'the', 'background', 'environment', 'of', 'the', 'spiral', 'galaxies', 'have', 'a', 'largescale', 'rotation', 'and', 'both', 'the', 'formation', 'and', 'evolution', 'of', 'hurricanelike', 'spiral', 'galaxies', 'are', 'driven', 'by', 'this', 'background', 'rotation']] | [-0.14458305457711618, 0.08986451535441943, -0.11335343706763222, 0.07129984911319044, -0.07113152287746145, -0.00454504064080366, -0.03560966645717378, 0.3608906440569099, -0.20961712467754204, -0.29786204622738816, 0.0792287744646451, -0.24042042870089667, -0.1385618474268349, 0.1897602000428066, 0.00873742017828854, -0.030822087217056187, 0.02142552047218444, -0.018558656270533096, -0.033395502920201894, -0.24844504420138544, 0.3323223622455179, 0.07453570936492385, 0.2260169758042596, -0.04677785714790666, 0.0919954671783472, -0.056093817210298845, -0.056030945144263065, 0.020905023578488263, -0.15909423178372514, 0.05240140197737991, 0.1440184173951223, 0.11272512082583629, 0.2196273391297605, -0.4134525846601767, -0.2140112570790056, 0.03769906330027083, 0.17645034448866395, 0.1136921780272084, -0.11396441330992721, -0.30818011957777325, 0.05267337989888689, -0.14321051845354574, -0.1831886015833113, 0.011428876766196546, 0.03773741985081568, 0.041980020985690626, -0.20208892599747036, 0.1294038882613397, 0.10050885944720908, 0.05620310197104893, -0.07989956144403292, -0.005804054695319318, -0.09972412188223304, 0.11144944311108594, 0.07450515524685361, 0.08871374189159309, 0.21243983540221079, -0.14577490173021232, -0.062332425178331735, 0.41827649930106287, -0.06223482071951076, -0.1538658580830949, 0.19692434710533133, -0.21456791871067513, -0.09298027219724726, 0.12476120264263901, 0.13412815457507526, 0.07848823190798994, -0.11126128909868303, 0.04805969264834965, -0.0772238087332525, 0.17755770623358794, 0.04631934148264972, -0.02643684666729863, 0.2827876717976388, 0.1358754894001817, 0.08087621194023925, 0.10897001737698406, -0.17712477847283498, -0.09333102086547916, -0.28699955769908236, -0.122266878346367, -0.14807253744530344, 0.022629235655268427, -0.11669001082105138, -0.15931579896067022, 0.3925775936832266, 0.06070058435592911, 0.22284562412935954, 0.014549144262657363, 0.3157405868074829, 0.07445635571634981, 0.08556090838678138, 0.10958173791960588, 0.30421800790740366, 0.1644551131651136, 0.06551524026308363, -0.30609474657241187, 0.07960789553551058, 0.0069180372227589495] |
1,802.02735 | A new presentation of the plane Cremona group | We give a presentation of the plane Cremona group over an algebraically
closed field with respect to the generators given by the Theorem of Noether and
Castelnuovo. This presentation is particularly simple and can be used for
explicit calculations.
| math.AG | we give a presentation of the plane cremona group over an algebraically closed field with respect to the generators given by the theorem of noether and castelnuovo this presentation is particularly simple and can be used for explicit calculations | [['we', 'give', 'a', 'presentation', 'of', 'the', 'plane', 'cremona', 'group', 'over', 'an', 'algebraically', 'closed', 'field', 'with', 'respect', 'to', 'the', 'generators', 'given', 'by', 'the', 'theorem', 'of', 'noether', 'and', 'castelnuovo', 'this', 'presentation', 'is', 'particularly', 'simple', 'and', 'can', 'be', 'used', 'for', 'explicit', 'calculations']] | [-0.15817477186329854, 0.06975686778530825, -0.12472709199079336, 0.05118336566747763, -0.15028286276337427, -0.0989318144125625, -0.019144606991456106, 0.36246977956631243, -0.26983214914798737, -0.2434461279130445, 0.08158516295206471, -0.23655829443715704, -0.11097672733311088, 0.2890306385174298, -0.12975427248061466, -0.06141288881787123, 0.005032939800562767, 0.11883974194717713, -0.1273383768991782, -0.2996154883637642, 0.33211173329693383, 0.04106754914690287, 0.21164458252203006, 0.025569988605685722, 0.11595348423967759, 0.07228608834199034, -0.02907730280779875, 0.03837989165614813, -0.17524524880811954, 0.12805774896286237, 0.32660058410599446, 0.09886781914302936, 0.12781261268238991, -0.4045959069656256, -0.1018910646223678, 0.13314874997983375, 0.15346639977099422, 0.1188317091228106, -0.06819359437586406, -0.28451035315027606, 0.12092469525165282, -0.21263131604362756, -0.17828516262129712, -0.11336237134841773, 0.04431030984359005, 0.024621384081024773, -0.2314232816824164, -0.026598545603263073, 0.09755721516334094, 0.20880855732572784, -0.024212543088465165, -0.0473071316209359, -0.006653535537994825, 0.08041063260334806, 0.04753284459002316, 0.1049960442006779, 0.07640047905106957, -0.0654743979505908, -0.12513040887335172, 0.4084232061719283, -0.04158511244429228, -0.25171210655035114, 0.10890818846364243, -0.10059888430465108, -0.10009356093807863, 0.1360227637566053, 0.10596679525975233, 0.12547134025356707, -0.1075838139662758, 0.17334163716385284, -0.09681679640347376, 0.06953449306102136, 0.03748365825949571, -0.0596224630299287, 0.14354570501316816, 0.04726106231697859, 0.061818354727270514, 0.1477904508385855, 0.05105866835667537, -0.021499155710140865, -0.4222635359336168, -0.22800805661469126, -0.11015848133963747, 0.13658280892727467, -0.11146817507911831, -0.14788078932234874, 0.44511736127046436, 0.09312031009735969, 0.12729733747740588, 0.09067541353691083, 0.22761937187841305, 0.16129857521408644, 0.04738560989976694, 0.08220984601678374, 0.11316444060932367, 0.22869784347354793, -0.02895461692988204, -0.12447629277952589, -0.006389866511409099, 0.16897142267762086] |
1,802.02736 | Autonomous Power Allocation based on Distributed Deep Learning for
Device-to-Device Communication Underlaying Cellular Network | For Device-to-device (D2D) communication of Internet-of-Things (IoT) enabled
5G system, there is a limit to allocating resources considering a complicated
interference between different links in a centralized manner. If D2D link is
controlled by an enhanced node base station (eNB), and thus, remains a burden
on the eNB and it causes delayed latency. This paper proposes a fully
autonomous power allocation method for IoT-D2D communication underlaying
cellular networks using deep learning. In the proposed scheme, an IoT-D2D
transmitter decides the transmit power independently from an eNB and other
IoT-D2D devices. In addition, the power set can be nearly optimized by deep
learning with distributed manner to achieve higher cell throughput. We present
a distributed deep learning architecture in which the devices are trained as a
group but operate independently. The deep learning can attain near optimal cell
throughput while suppressing interference to eNB.
| eess.SP cs.LG | for devicetodevice d2d communication of internetofthings iot enabled 5g system there is a limit to allocating resources considering a complicated interference between different links in a centralized manner if d2d link is controlled by an enhanced node base station enb and thus remains a burden on the enb and it causes delayed latency this paper proposes a fully autonomous power allocation method for iotd2d communication underlaying cellular networks using deep learning in the proposed scheme an iotd2d transmitter decides the transmit power independently from an enb and other iotd2d devices in addition the power set can be nearly optimized by deep learning with distributed manner to achieve higher cell throughput we present a distributed deep learning architecture in which the devices are trained as a group but operate independently the deep learning can attain near optimal cell throughput while suppressing interference to enb | [['for', 'devicetodevice', 'd2d', 'communication', 'of', 'internetofthings', 'iot', 'enabled', '5g', 'system', 'there', 'is', 'a', 'limit', 'to', 'allocating', 'resources', 'considering', 'a', 'complicated', 'interference', 'between', 'different', 'links', 'in', 'a', 'centralized', 'manner', 'if', 'd2d', 'link', 'is', 'controlled', 'by', 'an', 'enhanced', 'node', 'base', 'station', 'enb', 'and', 'thus', 'remains', 'a', 'burden', 'on', 'the', 'enb', 'and', 'it', 'causes', 'delayed', 'latency', 'this', 'paper', 'proposes', 'a', 'fully', 'autonomous', 'power', 'allocation', 'method', 'for', 'iotd2d', 'communication', 'underlaying', 'cellular', 'networks', 'using', 'deep', 'learning', 'in', 'the', 'proposed', 'scheme', 'an', 'iotd2d', 'transmitter', 'decides', 'the', 'transmit', 'power', 'independently', 'from', 'an', 'enb', 'and', 'other', 'iotd2d', 'devices', 'in', 'addition', 'the', 'power', 'set', 'can', 'be', 'nearly', 'optimized', 'by', 'deep', 'learning', 'with', 'distributed', 'manner', 'to', 'achieve', 'higher', 'cell', 'throughput', 'we', 'present', 'a', 'distributed', 'deep', 'learning', 'architecture', 'in', 'which', 'the', 'devices', 'are', 'trained', 'as', 'a', 'group', 'but', 'operate', 'independently', 'the', 'deep', 'learning', 'can', 'attain', 'near', 'optimal', 'cell', 'throughput', 'while', 'suppressing', 'interference', 'to', 'enb']] | [-0.2693225055708309, 0.028378986419236345, -0.0026839353613086515, -0.03280507118060169, -0.09128171542880835, -0.2980914196826622, 0.1637832033146707, 0.4279982002933959, -0.31677851719143507, -0.28514208627695387, 0.036373271825039515, -0.22770756301698047, -0.20407536355583192, 0.1468941527451356, -0.16916385313522045, 0.02787730901443458, 0.05706815258111362, 0.03300530665840667, 0.036876229487906594, -0.25616965001983033, 0.2568939430704275, 0.13779106173400565, 0.4123067117159392, 0.004053326414806859, 0.0918309278004653, -0.019416000216977893, 0.011358844710211107, -0.036244480815305784, -0.020258994476700373, 0.134589707392587, 0.3936770585499105, 0.1859367175998127, 0.3423821384777556, -0.46483491071975314, -0.2606580161873798, 0.12498544305367591, 0.2176265049427813, 0.024767051739911256, -0.03808039594018324, -0.2717629884779974, 0.1500877373024717, -0.2777713760652195, -0.009374202398210438, -0.021254951235678672, -0.0933792287698732, 0.03984185228070531, -0.340831408531151, -0.03509313051126428, -0.03930689626979036, 0.0323286423642006, -0.030997901490011897, -0.04297547427517316, 0.02549718044554958, 0.19360457627767033, -0.03647434780165761, 0.020414291183347, 0.13926587972816054, -0.13874397233903565, -0.1278341283004602, 0.34980827644044027, 0.02922799930113231, -0.1920302666486013, 0.14415044146361988, 0.004794973450211378, -0.1060693929105398, 0.13440873174296392, 0.2562126968629085, 0.0387005431584076, -0.22581425322532342, 0.013198971947397829, 0.016028602848519813, 0.17149003623118558, 0.09265005232284328, 0.09620674314316023, 0.17906677827867518, 0.28721118715780597, 0.17682173240675844, 0.08653385767190541, -0.09694110233681863, -0.08999197559685192, -0.15465689377234013, -0.10098758841363284, -0.2171028565967104, 0.030562847452173074, -0.07341788841993141, -0.036764679699680294, 0.3216780928783296, 0.10606864834256419, 0.12776838984158073, 0.14521257251816952, 0.4251253831385915, 0.09579136480434416, 0.13056317285367555, 0.19818178270585263, 0.1863905074778241, 0.040782090566296884, 0.20121455560047571, -0.20428909327333364, 0.04886580173290901, -0.02832147586517609] |
1,802.02737 | The dynamics of disappearing pulses in a singularly perturbed
reaction-diffusion system with parameters that vary in time and space | We consider the evolution of multi-pulse patterns in an extended Klausmeier
equation with parameters that change in time and/or space. We formally show
that the full PDE dynamics of a $N$-pulse configuration can be reduced to a
$N$-dimensional dynamical system describing the dynamics on a $N$-dimensional
manifold $\mathcal{M}_N$. Next, we determine the local stability of
$\mathcal{M}_N$ via the quasi-steady spectrum associated to evolving $N$-pulse
patterns, which provides provides explicit information on the boundary
$\partial\mathcal{M}_N$. Following the dynamics on $\mathcal{M}_N$, a $N$-pulse
pattern may move through $\partial\mathcal{M}_N$ and `fall off'
$\mathcal{M}_N$. A direct nonlinear extrapolation of our linear analysis
predicts the subsequent fast PDE dynamics as the pattern `jumps' to another
invariant manifold $\mathcal{M}_M$, and specifically predicts the number $N-M$
of pulses that disappear. Combining the asymptotic analysis with numerical
simulations of the dynamics on the various invariant manifolds yields a hybrid
asymptotic-numerical method describing the full process that starts with a
$N$-pulse pattern and typically ends in the trivial homogeneous state without
pulses. We extensively test this method against PDE simulations and deduce
general conjectures on the nature of pulse interactions with disappearing
pulses. We especially consider the differences between the evolution of
irregular and regular patterns. In the former case, the disappearing process is
gradual: irregular patterns loose their pulses one by one. In contrast,
regular, spatially periodic, patterns undergo catastrophic transitions in which
either half or all pulses disappear. However, making a precise distinction
between these two drastically different processes is quite subtle, since
irregular $N$-pulse patterns that do not cross $\partial\mathcal{M}_N$
typically evolve towards regularity.
| math.AP math.DS | we consider the evolution of multipulse patterns in an extended klausmeier equation with parameters that change in time andor space we formally show that the full pde dynamics of a npulse configuration can be reduced to a ndimensional dynamical system describing the dynamics on a ndimensional manifold mathcalm_n next we determine the local stability of mathcalm_n via the quasisteady spectrum associated to evolving npulse patterns which provides provides explicit information on the boundary partialmathcalm_n following the dynamics on mathcalm_n a npulse pattern may move through partialmathcalm_n and fall off mathcalm_n a direct nonlinear extrapolation of our linear analysis predicts the subsequent fast pde dynamics as the pattern jumps to another invariant manifold mathcalm_m and specifically predicts the number nm of pulses that disappear combining the asymptotic analysis with numerical simulations of the dynamics on the various invariant manifolds yields a hybrid asymptoticnumerical method describing the full process that starts with a npulse pattern and typically ends in the trivial homogeneous state without pulses we extensively test this method against pde simulations and deduce general conjectures on the nature of pulse interactions with disappearing pulses we especially consider the differences between the evolution of irregular and regular patterns in the former case the disappearing process is gradual irregular patterns loose their pulses one by one in contrast regular spatially periodic patterns undergo catastrophic transitions in which either half or all pulses disappear however making a precise distinction between these two drastically different processes is quite subtle since irregular npulse patterns that do not cross partialmathcalm_n typically evolve towards regularity | [['we', 'consider', 'the', 'evolution', 'of', 'multipulse', 'patterns', 'in', 'an', 'extended', 'klausmeier', 'equation', 'with', 'parameters', 'that', 'change', 'in', 'time', 'andor', 'space', 'we', 'formally', 'show', 'that', 'the', 'full', 'pde', 'dynamics', 'of', 'a', 'npulse', 'configuration', 'can', 'be', 'reduced', 'to', 'a', 'ndimensional', 'dynamical', 'system', 'describing', 'the', 'dynamics', 'on', 'a', 'ndimensional', 'manifold', 'mathcalm_n', 'next', 'we', 'determine', 'the', 'local', 'stability', 'of', 'mathcalm_n', 'via', 'the', 'quasisteady', 'spectrum', 'associated', 'to', 'evolving', 'npulse', 'patterns', 'which', 'provides', 'provides', 'explicit', 'information', 'on', 'the', 'boundary', 'partialmathcalm_n', 'following', 'the', 'dynamics', 'on', 'mathcalm_n', 'a', 'npulse', 'pattern', 'may', 'move', 'through', 'partialmathcalm_n', 'and', 'fall', 'off', 'mathcalm_n', 'a', 'direct', 'nonlinear', 'extrapolation', 'of', 'our', 'linear', 'analysis', 'predicts', 'the', 'subsequent', 'fast', 'pde', 'dynamics', 'as', 'the', 'pattern', 'jumps', 'to', 'another', 'invariant', 'manifold', 'mathcalm_m', 'and', 'specifically', 'predicts', 'the', 'number', 'nm', 'of', 'pulses', 'that', 'disappear', 'combining', 'the', 'asymptotic', 'analysis', 'with', 'numerical', 'simulations', 'of', 'the', 'dynamics', 'on', 'the', 'various', 'invariant', 'manifolds', 'yields', 'a', 'hybrid', 'asymptoticnumerical', 'method', 'describing', 'the', 'full', 'process', 'that', 'starts', 'with', 'a', 'npulse', 'pattern', 'and', 'typically', 'ends', 'in', 'the', 'trivial', 'homogeneous', 'state', 'without', 'pulses', 'we', 'extensively', 'test', 'this', 'method', 'against', 'pde', 'simulations', 'and', 'deduce', 'general', 'conjectures', 'on', 'the', 'nature', 'of', 'pulse', 'interactions', 'with', 'disappearing', 'pulses', 'we', 'especially', 'consider', 'the', 'differences', 'between', 'the', 'evolution', 'of', 'irregular', 'and', 'regular', 'patterns', 'in', 'the', 'former', 'case', 'the', 'disappearing', 'process', 'is', 'gradual', 'irregular', 'patterns', 'loose', 'their', 'pulses', 'one', 'by', 'one', 'in', 'contrast', 'regular', 'spatially', 'periodic', 'patterns', 'undergo', 'catastrophic', 'transitions', 'in', 'which', 'either', 'half', 'or', 'all', 'pulses', 'disappear', 'however', 'making', 'a', 'precise', 'distinction', 'between', 'these', 'two', 'drastically', 'different', 'processes', 'is', 'quite', 'subtle', 'since', 'irregular', 'npulse', 'patterns', 'that', 'do', 'not', 'cross', 'partialmathcalm_n', 'typically', 'evolve', 'towards', 'regularity']] | [-0.16534877096299183, 0.14772535295454206, -0.12524062191912586, 0.09017795918243296, -0.047066547264660266, -0.12941966676887068, 0.029140582133323708, 0.3686591193065453, -0.2742788882813768, -0.27049729109883075, 0.11442519867419472, -0.2543012432116247, -0.14862512428030836, 0.16987963599118436, -0.024504974051149063, 0.013780652566229496, 0.09282101304107256, 0.023022513047534728, -0.09409597771086436, -0.17630271839679143, 0.31999606768517297, 0.01248679280730421, 0.26261408606830416, -0.03453790548924313, 0.0892550309332711, 0.02615958319321014, -0.017575468340750914, -0.005100562233692542, -0.1268492043904196, 0.05058877898293188, 0.204485849240783, 0.06844961968094748, 0.22768171723381206, -0.474596387521882, -0.22619205543133594, 0.11838625561293524, 0.16761905411562966, 0.12497497435137339, -0.03709990207247657, -0.28297013258932935, 0.06675468317748515, -0.09965530322984238, -0.1850379850002638, -0.04817423824078661, 0.026765671020540397, 0.042649107633234665, -0.2483355351162038, 0.08221925311750852, 0.09256984438447749, 0.032280165565644975, -0.057572429365993036, -0.02094736955208334, -0.060577853899204503, 0.12052187855819291, 0.020368006307104464, 0.006808815461018119, 0.12401109055800777, -0.09767882274336939, -0.09407258134721216, 0.3368710157867333, -0.07644684494931454, -0.1946460954484381, 0.20636862626567426, -0.16050141071900725, -0.11188980273844434, 0.18555996917615777, 0.16183291023582627, 0.13247519263323643, -0.10832298952535317, 0.04891452427608312, -0.011220615851359464, 0.1834238847936884, 0.08387168311488594, 0.004366436236898564, 0.18414070063129298, 0.16980429998067198, 0.07471767128970662, 0.11413205354130222, -0.05169569622342029, -0.16862499859303612, -0.2667439494731361, -0.08804630613133876, -0.10350409509289778, 0.06717865561831114, -0.0903815169708739, -0.18774645962183462, 0.4027765766583412, 0.10397600963873, 0.2180288506613805, 0.043129646247397777, 0.2582385011310852, 0.10958475509209102, 0.012538839696910132, 0.05361946255370888, 0.20359176721384004, 0.11747945248102226, 0.1005769642867177, -0.22976034771694515, 0.05398360366121312, 0.05177806063413852] |
1,802.02738 | The topology of the set of non-escaping endpoints | There are several classes of transcendental entire functions for which the
Julia set consists of an uncountable union of disjoint curves each of which
joins a finite endpoint to infinity. Many authors have studied the topological
properties of this set of finite endpoints. It was recently shown that, for
certain functions in the exponential family, there is a strong dichotomy
between the topological properties of the set of endpoints which escape and
those of the set of endpoints which do not escape. In this paper, we show that
this result holds for large families of functions in the Eremenko-Lyubich
class. We also show that this dichotomy holds for a family of functions,
outside that class, which includes the much-studied Fatou function defined by
$f(z) := z + 1+ e^{-z}.$ Finally, we show how our results can be used to
demonstrate that various sets are spiders' webs, generalising results such as
those in a recent paper of the first author.
| math.DS math.CV | there are several classes of transcendental entire functions for which the julia set consists of an uncountable union of disjoint curves each of which joins a finite endpoint to infinity many authors have studied the topological properties of this set of finite endpoints it was recently shown that for certain functions in the exponential family there is a strong dichotomy between the topological properties of the set of endpoints which escape and those of the set of endpoints which do not escape in this paper we show that this result holds for large families of functions in the eremenkolyubich class we also show that this dichotomy holds for a family of functions outside that class which includes the muchstudied fatou function defined by fz z 1 ez finally we show how our results can be used to demonstrate that various sets are spiders webs generalising results such as those in a recent paper of the first author | [['there', 'are', 'several', 'classes', 'of', 'transcendental', 'entire', 'functions', 'for', 'which', 'the', 'julia', 'set', 'consists', 'of', 'an', 'uncountable', 'union', 'of', 'disjoint', 'curves', 'each', 'of', 'which', 'joins', 'a', 'finite', 'endpoint', 'to', 'infinity', 'many', 'authors', 'have', 'studied', 'the', 'topological', 'properties', 'of', 'this', 'set', 'of', 'finite', 'endpoints', 'it', 'was', 'recently', 'shown', 'that', 'for', 'certain', 'functions', 'in', 'the', 'exponential', 'family', 'there', 'is', 'a', 'strong', 'dichotomy', 'between', 'the', 'topological', 'properties', 'of', 'the', 'set', 'of', 'endpoints', 'which', 'escape', 'and', 'those', 'of', 'the', 'set', 'of', 'endpoints', 'which', 'do', 'not', 'escape', 'in', 'this', 'paper', 'we', 'show', 'that', 'this', 'result', 'holds', 'for', 'large', 'families', 'of', 'functions', 'in', 'the', 'eremenkolyubich', 'class', 'we', 'also', 'show', 'that', 'this', 'dichotomy', 'holds', 'for', 'a', 'family', 'of', 'functions', 'outside', 'that', 'class', 'which', 'includes', 'the', 'muchstudied', 'fatou', 'function', 'defined', 'by', 'fz', 'z', '1', 'ez', 'finally', 'we', 'show', 'how', 'our', 'results', 'can', 'be', 'used', 'to', 'demonstrate', 'that', 'various', 'sets', 'are', 'spiders', 'webs', 'generalising', 'results', 'such', 'as', 'those', 'in', 'a', 'recent', 'paper', 'of', 'the', 'first', 'author']] | [-0.14031305809202752, 0.09381925960445471, -0.0754669850712915, 0.0667704251857332, -0.04861371322374815, -0.06494897433295609, 0.033007346078824655, 0.3407272051213084, -0.28258625028809164, -0.22531635552395585, 0.08514303527475828, -0.290831233001059, -0.15777678943126444, 0.2613784493885899, -0.06401049648114973, 0.060379666477963806, 0.03395727836782006, 0.018595660333729284, -0.04066066120033431, -0.2922544871763902, 0.3903020657836252, -0.09764323841519416, 0.22488423414190245, 0.0691555934175137, 0.06769066873031733, -0.00942583542293424, 0.017240810297373208, 0.060654464759122416, -0.16494299935227577, 0.11179037470812464, 0.2557894834050327, 0.1783911227990108, 0.2754640894004731, -0.3365110647004501, -0.21073567181540903, 0.19603935662645158, 0.15175488219999822, 0.039868145011762855, -0.04875712930135856, -0.2283869392600409, 0.14198927300133904, -0.16027061701722586, -0.16733703875000688, -0.05712934912057819, 0.0674955051282575, 0.09857743703255988, -0.22987012024731582, -0.010460425988558952, 0.13054819478042376, 0.06345590404798365, -0.0549834879726219, -0.09953105520712105, -0.04540565520284733, 0.13038062237820047, 0.04059312396955671, 0.05633819478142793, 0.03739737549642469, -0.08163449864620996, -0.11564011980370162, 0.3256137014750783, -0.04059503243674056, -0.2021789892523247, 0.23193657803378856, -0.19070172149201953, -0.20871368220823397, 0.10286231022506098, 0.12686840471497196, 0.13842723503780024, -0.14426831082458708, 0.13401305946264902, -0.14417501225189608, 0.1105738256859243, 0.09076004105198915, 0.03658837996791028, 0.16417752065737345, 0.08169159400247179, 0.08532823919678985, 0.1838466820283348, 0.003845868268862936, -0.0530177294098695, -0.36472746636125314, -0.15955597255378962, -0.1721526744840726, 0.04321895454349189, -0.06761032858984709, -0.24995135737247143, 0.42370693875286897, 0.12300757037558753, 0.23027839280285273, 0.11020711105640171, 0.19796863184043556, 0.09403868581080857, 0.08035413555172123, 0.08610702281799071, 0.18759428312895216, 0.0704798099961559, -0.004592963681218161, -0.11681777843552053, 0.04849351535790013, 0.11559384201125354] |
1,802.02739 | Transverse Extension of Partons in the Proton probed by Deeply Virtual
Compton Scattering | We report on the first measurement of exclusive single-photon muoproduction
on the proton by COMPASS using 160 GeV/$c$ polarized $\mu^+$ and $\mu^-$ beams
of the CERN SPS impinging on a liquid hydrogen target. We determine the
dependence of the average of the measured $\mu^+$ and $\mu^-$ cross sections
for deeply virtual Compton scattering on the squared four-momentum transfer $t$
from the initial to the final final proton. The slope $B$ of the $t$-dependence
is fitted with a single exponential function, which yields $B=(4.3 \ \pm \
0.6_{\text{stat}}\_{- \ 0.3}^{+ \ 0.1}\big\rvert_{\text{sys}})
(\text{GeV}/c)^{-2}$. This result can be converted into an average transverse
extension of partons in the proton, $\sqrt{\langle r_{\perp}^2 \rangle} = (0.58
\ \pm \ 0.04_{\text{stat}}\_{- \ 0.02}^{+ \
0.01}\big\rvert_{\text{sys}})\text{fm}$. For this measurement, the average
virtuality of the photon mediating the interaction is $\langle Q^2 \rangle =
1.8\,(\text{GeV/}c)^2$ and the average value of the Bjorken variable is
$\langle x_{\text{Bj}} \rangle = 0.056$.
| hep-ex nucl-ex | we report on the first measurement of exclusive singlephoton muoproduction on the proton by compass using 160 gevc polarized mu and mu beams of the cern sps impinging on a liquid hydrogen target we determine the dependence of the average of the measured mu and mu cross sections for deeply virtual compton scattering on the squared fourmomentum transfer t from the initial to the final final proton the slope b of the tdependence is fitted with a single exponential function which yields b43 pm 06_textstat_ 03 01bigrvert_textsys textgevc2 this result can be converted into an average transverse extension of partons in the proton sqrtlangle r_perp2 rangle 058 pm 004_textstat_ 002 001bigrvert_textsystextfm for this measurement the average virtuality of the photon mediating the interaction is langle q2 rangle 18textgevc2 and the average value of the bjorken variable is langle x_textbj rangle 0056 | [['we', 'report', 'on', 'the', 'first', 'measurement', 'of', 'exclusive', 'singlephoton', 'muoproduction', 'on', 'the', 'proton', 'by', 'compass', 'using', '160', 'gevc', 'polarized', 'mu', 'and', 'mu', 'beams', 'of', 'the', 'cern', 'sps', 'impinging', 'on', 'a', 'liquid', 'hydrogen', 'target', 'we', 'determine', 'the', 'dependence', 'of', 'the', 'average', 'of', 'the', 'measured', 'mu', 'and', 'mu', 'cross', 'sections', 'for', 'deeply', 'virtual', 'compton', 'scattering', 'on', 'the', 'squared', 'fourmomentum', 'transfer', 't', 'from', 'the', 'initial', 'to', 'the', 'final', 'final', 'proton', 'the', 'slope', 'b', 'of', 'the', 'tdependence', 'is', 'fitted', 'with', 'a', 'single', 'exponential', 'function', 'which', 'yields', 'b43', 'pm', '06_textstat_', '03', '01bigrvert_textsys', 'textgevc2', 'this', 'result', 'can', 'be', 'converted', 'into', 'an', 'average', 'transverse', 'extension', 'of', 'partons', 'in', 'the', 'proton', 'sqrtlangle', 'r_perp2', 'rangle', '058', 'pm', '004_textstat_', '002', '001bigrvert_textsystextfm', 'for', 'this', 'measurement', 'the', 'average', 'virtuality', 'of', 'the', 'photon', 'mediating', 'the', 'interaction', 'is', 'langle', 'q2', 'rangle', '18textgevc2', 'and', 'the', 'average', 'value', 'of', 'the', 'bjorken', 'variable', 'is', 'langle', 'x_textbj', 'rangle', '0056']] | [-0.06879464708400695, 0.2762238510595261, -0.11328547170955632, 0.06643018429254446, 0.04827880550092503, -0.07517396240649786, 0.036690307266787806, 0.37318123023567806, -0.20876694872363735, -0.2730984086076965, -0.062286918326941276, -0.3592029845710399, 0.10612822507521999, 0.156400028699592, 0.06707737489026595, 0.055708810771335916, 0.027354721091131667, 0.012163584172697877, -0.07228480076283536, -0.14766654257537493, 0.28964208479998493, 0.0776193473842551, 0.2774979845245383, 0.14115729465135443, 0.15620344122889132, 0.11244604284805593, -0.019662605028655102, -0.08537427521547053, -0.16120835891559915, 0.04273395920728347, 0.1832127928470588, 0.04851031052591557, 0.1327345891813956, -0.2757845325204335, -0.042594753992882796, 0.11009674604440024, 0.13912952645445492, -0.013337556572471147, 0.01841499116063229, -0.2549224396083337, 0.06874409385039401, -0.20724164865695552, -0.10857284998559434, 0.017614153682935372, 0.06931956233665236, 0.009155858373886267, -0.341494290547362, 0.13111992506657852, -0.03950668128082223, 0.044557333347012305, -0.06224911124445498, -0.25802324282756045, -0.04356255348504229, 0.042798779840553317, 0.05689362294923292, 0.19731185921648545, 0.17878429630576675, -0.14490124783061667, -0.07731765152281846, 0.36178707535753946, -0.071797497542714, -0.15275416642066036, 0.02775244922168664, -0.25300857361837, -0.051934785577955084, 0.1851926312934774, 0.2161750678136361, 0.12500708856152495, -0.1488504016758012, 0.0689127780623046, -0.0441595358094687, 0.2391232380560085, 0.08966240140178533, 0.024973035508544364, 0.1732884948524132, 0.17738690488162076, -0.016369206938586796, 0.07368285718909118, -0.18288510820633774, -0.0348132051729055, -0.37670319898526616, -0.13648648884098755, -0.12644760828611176, 0.17342284739142588, -0.10437643206072363, -0.05622753152039958, 0.30940052169138815, 0.048456151952355433, 0.2719302293410136, 0.045414075989505524, 0.3038835181340353, 0.14830873106365655, 0.05497849476045873, 0.05681141682676997, 0.2498772764967671, 0.1782311135381738, 0.13214468893442136, -0.2665022610453889, 0.0636756269386344, -2.746448032001951e-05] |
1,802.0274 | Relativistic coupled-cluster theory analysis of energies, hyperfine
structure constants, and dipole polarizabilities of Cd$^{+}$ | Roles of electron correlation effects in the determination of attachment
energies, magnetic dipole hyperfine structure constants and electric dipole
(E1) matrix elements of the low-lying states in the singly charged cadmium ion
(Cd$^+$) have been analyzed. We employ the singles and doubles approximated
relativistic coupled-cluster (RCC) method to calculate these properties.
Intermediate results from the Dirac-Hartree-Fock approximation, second-order
many-body perturbation theory and considering only the linear terms of the RCC
method are given to demonstrate propagation of electron correlation effects in
this ion. Contributions from important RCC terms are also given to highlight
importance of various correlation effects in the evaluation of these
properties. At the end, we also determine E1 polarizabilities ($\alpha^{E1}$)
of the ground and $5p \ ^2P_{1/2;3/2}$ states of Cd$^+$ in the {\it ab initio}
approach. We estimate them again by replacing some of the E1 matrix elements
and energies from the measurements to reduce their uncertainties so that they
can be used in the high precision experiments of this ion.
| physics.atom-ph physics.chem-ph physics.comp-ph | roles of electron correlation effects in the determination of attachment energies magnetic dipole hyperfine structure constants and electric dipole e1 matrix elements of the lowlying states in the singly charged cadmium ion cd have been analyzed we employ the singles and doubles approximated relativistic coupledcluster rcc method to calculate these properties intermediate results from the dirachartreefock approximation secondorder manybody perturbation theory and considering only the linear terms of the rcc method are given to demonstrate propagation of electron correlation effects in this ion contributions from important rcc terms are also given to highlight importance of various correlation effects in the evaluation of these properties at the end we also determine e1 polarizabilities alphae1 of the ground and 5p 2p_1232 states of cd in the it ab initio approach we estimate them again by replacing some of the e1 matrix elements and energies from the measurements to reduce their uncertainties so that they can be used in the high precision experiments of this ion | [['roles', 'of', 'electron', 'correlation', 'effects', 'in', 'the', 'determination', 'of', 'attachment', 'energies', 'magnetic', 'dipole', 'hyperfine', 'structure', 'constants', 'and', 'electric', 'dipole', 'e1', 'matrix', 'elements', 'of', 'the', 'lowlying', 'states', 'in', 'the', 'singly', 'charged', 'cadmium', 'ion', 'cd', 'have', 'been', 'analyzed', 'we', 'employ', 'the', 'singles', 'and', 'doubles', 'approximated', 'relativistic', 'coupledcluster', 'rcc', 'method', 'to', 'calculate', 'these', 'properties', 'intermediate', 'results', 'from', 'the', 'dirachartreefock', 'approximation', 'secondorder', 'manybody', 'perturbation', 'theory', 'and', 'considering', 'only', 'the', 'linear', 'terms', 'of', 'the', 'rcc', 'method', 'are', 'given', 'to', 'demonstrate', 'propagation', 'of', 'electron', 'correlation', 'effects', 'in', 'this', 'ion', 'contributions', 'from', 'important', 'rcc', 'terms', 'are', 'also', 'given', 'to', 'highlight', 'importance', 'of', 'various', 'correlation', 'effects', 'in', 'the', 'evaluation', 'of', 'these', 'properties', 'at', 'the', 'end', 'we', 'also', 'determine', 'e1', 'polarizabilities', 'alphae1', 'of', 'the', 'ground', 'and', '5p', '2p_1232', 'states', 'of', 'cd', 'in', 'the', 'it', 'ab', 'initio', 'approach', 'we', 'estimate', 'them', 'again', 'by', 'replacing', 'some', 'of', 'the', 'e1', 'matrix', 'elements', 'and', 'energies', 'from', 'the', 'measurements', 'to', 'reduce', 'their', 'uncertainties', 'so', 'that', 'they', 'can', 'be', 'used', 'in', 'the', 'high', 'precision', 'experiments', 'of', 'this', 'ion']] | [-0.058448838008234257, 0.1430735261866501, -0.03104526701061354, 0.09744529913748717, 0.04997117391192458, -0.08941844325328682, 0.027561669441279208, 0.38944971063576733, -0.22362655955136834, -0.29962651140091046, -0.0252284674063026, -0.3363400098039872, -0.10775499212459293, 0.1260591797001752, 0.08385864898769392, 0.048384839180213066, 0.07180052407281358, 0.036287074974726566, -0.12129120834755286, -0.1724389876184387, 0.2986572482881861, 0.10428994038590679, 0.2423096738502751, 0.11827678079026993, 0.02350588041978578, 0.017408018773651602, -0.0027265716976497645, 0.02932869500974998, -0.08804078394552314, 0.15776576859988617, 0.2727330003945548, 0.05323226697438247, 0.22636445679696116, -0.45988628139466414, -0.15014804634668025, 0.03193273921899589, 0.13015732875260536, 0.18446757405979075, -0.03016876328713548, -0.2876749618617059, 0.05458871229482746, -0.18507919271108636, -0.13025818203782868, -0.1360168461429162, 0.0027519886965437987, 0.07436759433605605, -0.2770776254930505, 0.05688180018127982, -0.013901252190318004, 0.03790662964564507, -0.10744232643412908, -0.20392742475069323, -0.0013913329637517439, 0.12732733505272112, 0.04539837777028205, 0.0011120409716242625, 0.16099108145629734, -0.08433933973162906, -0.10412793261477621, 0.4021586054292174, -0.06648096882013811, -0.1758929185891225, 0.11105435838158254, -0.20035800754066044, -0.153359654705891, 0.15206279993390687, 0.15916537161755526, 0.13716126164657863, -0.1290742032331225, 0.09323815971916186, 0.039436580400546026, 0.14603252649624068, 0.07948766243327869, 0.0783341311113794, 0.14820250825680517, 0.07468832223417445, -0.023272507517874515, 0.06977471321730308, -0.12975562226050966, -0.07605168528360441, -0.27628163657622573, -0.10956817629379163, -0.17176147353157034, 0.012750697342310975, -0.05712354236904368, -0.1568714613037437, 0.4176403296979167, 0.13356995804344568, 0.14425186414478552, -0.0582381447541447, 0.27255373084802687, 0.1389408532241187, 0.04818464704806468, 0.03513393139705223, 0.318266548260358, 0.22819783820707443, 0.031972749127121065, -0.32798605575585554, 0.05034572548911343, 0.07968307325018593] |
1,802.02741 | Average number of zeros and mixed symplectic volume of Finsler sets | Let $X$ be an $n$-dimensional manifold and $V_1, \ldots, V_n \subset
C^\infty(X, \mathbb R)$ finite-dimensional vector spaces with Euclidean metric.
We assign to each $V_i$ a Finsler ellipsoid, i.e., a family of ellipsoids in
the fibers of the cotangent bundle of $X$. We prove that the average number of
isolated common zeros of $f_1 \in V_1, \ldots, f_n \in V_n$ is equal to the
mixed symplectic volume of these Finsler ellipsoids. If $X$ is a homogeneous
space of a compact Lie group and all vector spaces $V_i$ and their Euclidean
metrics are invariant, then the average numbers of zeros satisfy the
inequalities, similar to Hodge inequalities for intersection numbers of
divisors on a projective variety. This is applied to the eigenspaces of Laplace
operator of an invariant Riemannian metric. The proofs are based on a
construction of the ring of normal densities on $X$, an analogue of the ring of
differential forms. In particular, this construction is used for a
generalization of Crofton formula to the product of spheres.
| math.DG | let x be an ndimensional manifold and v_1 ldots v_n subset cinftyx mathbb r finitedimensional vector spaces with euclidean metric we assign to each v_i a finsler ellipsoid ie a family of ellipsoids in the fibers of the cotangent bundle of x we prove that the average number of isolated common zeros of f_1 in v_1 ldots f_n in v_n is equal to the mixed symplectic volume of these finsler ellipsoids if x is a homogeneous space of a compact lie group and all vector spaces v_i and their euclidean metrics are invariant then the average numbers of zeros satisfy the inequalities similar to hodge inequalities for intersection numbers of divisors on a projective variety this is applied to the eigenspaces of laplace operator of an invariant riemannian metric the proofs are based on a construction of the ring of normal densities on x an analogue of the ring of differential forms in particular this construction is used for a generalization of crofton formula to the product of spheres | [['let', 'x', 'be', 'an', 'ndimensional', 'manifold', 'and', 'v_1', 'ldots', 'v_n', 'subset', 'cinftyx', 'mathbb', 'r', 'finitedimensional', 'vector', 'spaces', 'with', 'euclidean', 'metric', 'we', 'assign', 'to', 'each', 'v_i', 'a', 'finsler', 'ellipsoid', 'ie', 'a', 'family', 'of', 'ellipsoids', 'in', 'the', 'fibers', 'of', 'the', 'cotangent', 'bundle', 'of', 'x', 'we', 'prove', 'that', 'the', 'average', 'number', 'of', 'isolated', 'common', 'zeros', 'of', 'f_1', 'in', 'v_1', 'ldots', 'f_n', 'in', 'v_n', 'is', 'equal', 'to', 'the', 'mixed', 'symplectic', 'volume', 'of', 'these', 'finsler', 'ellipsoids', 'if', 'x', 'is', 'a', 'homogeneous', 'space', 'of', 'a', 'compact', 'lie', 'group', 'and', 'all', 'vector', 'spaces', 'v_i', 'and', 'their', 'euclidean', 'metrics', 'are', 'invariant', 'then', 'the', 'average', 'numbers', 'of', 'zeros', 'satisfy', 'the', 'inequalities', 'similar', 'to', 'hodge', 'inequalities', 'for', 'intersection', 'numbers', 'of', 'divisors', 'on', 'a', 'projective', 'variety', 'this', 'is', 'applied', 'to', 'the', 'eigenspaces', 'of', 'laplace', 'operator', 'of', 'an', 'invariant', 'riemannian', 'metric', 'the', 'proofs', 'are', 'based', 'on', 'a', 'construction', 'of', 'the', 'ring', 'of', 'normal', 'densities', 'on', 'x', 'an', 'analogue', 'of', 'the', 'ring', 'of', 'differential', 'forms', 'in', 'particular', 'this', 'construction', 'is', 'used', 'for', 'a', 'generalization', 'of', 'crofton', 'formula', 'to', 'the', 'product', 'of', 'spheres']] | [-0.22698232538539354, 0.08938811956062712, -0.1001730469226308, 0.041959961646197905, -0.08428888053484482, -0.10803164885869834, -0.05694041210061391, 0.3621444153164089, -0.2941408767778228, -0.16155920400884907, 0.07055088588361733, -0.30503555725620696, -0.11285221320163658, 0.17070554302650237, -0.13251901938119826, 0.017441378187211837, 0.022642247359538396, 0.1433875944600413, -0.1387068620185814, -0.27677627847379777, 0.42681905981594115, -0.09625725272061998, 0.22465507338407653, 0.011862078483199931, 0.15647133075791966, 0.0030135567818035387, 0.03218520377878342, 0.015529069206202072, -0.18373595611434243, 0.15907170298955672, 0.2733830191172968, 0.09789007757349524, 0.21748365493788874, -0.3421032843097339, -0.10886280542789248, 0.2600765904058983, 0.1463524164169057, -0.08704502882639817, 0.02545260151327428, -0.2673072017200247, 0.1046839970571799, -0.10643786526720464, -0.18301346323028558, -0.07124387037791532, 0.10409025425785745, 0.05060345273376746, -0.2844764356137689, 0.004022935791128486, 0.10159754133976158, 0.09786468217352243, -0.05588901758513595, -0.1538566341568556, -0.09753977298218558, 0.047764358292581764, -0.012102875087035479, 0.10879424266440012, 0.1023924333291188, -0.02018423374713338, -0.1108440413255487, 0.393926112671154, -0.06604138095229423, -0.32724250993035603, 0.045325358210892015, -0.19343152049565193, -0.13611531838466076, 0.10658470265148483, 0.16525771644120738, 0.18710105138770222, -0.02550666270634303, 0.1621553830505547, -0.1445902622244238, 0.05081789845810134, 0.0943516457684823, 0.012451707608667175, 0.13714854632498774, 0.06393372373842805, 0.11367323656584351, 0.11110670675734366, -0.011222474314217296, -0.05361491485192997, -0.37055641157034586, -0.24631227523718063, -0.20333794460524446, 0.17728075392808787, -0.18801001428611666, -0.1878106856784789, 0.35075757091798815, -0.006534534831636051, 0.23438360105880354, 0.10225749020216733, 0.20856770896215057, 0.03888690726488509, 0.025694914552046966, 0.06898400024373151, 0.0855082578339873, 0.2293256326694284, -0.022905473407225672, -0.1101508728847095, -0.03364024167748157, 0.20270152208147316] |
1,802.02742 | Ground-based lightcurve observation campaign of (25143) Itokawa between
2001 and 2004 | The asteroid (25143) Itokawa is a target object of the Japanese sample return
mission, HAYABUSA. We have observed Itokawa in optical wave- length (R-band)
with the 1.05-m Schmidt telescope at the Kiso Observatory, the 2.24-m telescope
of University of Hawaii, and the 1.05-m telescope at the Misato Observatory
since 2001. From the analysis of the data, we present the relationship between
brightness and the solar phase angle, 6.9 to 87.8 deg. We obtained the absolute
magnitude H_R(0) = 19.09+-0.37, and the slope parameter G_R = 0.25 +- 0.29. The
rotational period of Itokawa is 12.1324 +- 0.0001 hours.
| astro-ph.EP | the asteroid 25143 itokawa is a target object of the japanese sample return mission hayabusa we have observed itokawa in optical wave length rband with the 105m schmidt telescope at the kiso observatory the 224m telescope of university of hawaii and the 105m telescope at the misato observatory since 2001 from the analysis of the data we present the relationship between brightness and the solar phase angle 69 to 878 deg we obtained the absolute magnitude h_r0 1909037 and the slope parameter g_r 025 029 the rotational period of itokawa is 121324 00001 hours | [['the', 'asteroid', '25143', 'itokawa', 'is', 'a', 'target', 'object', 'of', 'the', 'japanese', 'sample', 'return', 'mission', 'hayabusa', 'we', 'have', 'observed', 'itokawa', 'in', 'optical', 'wave', 'length', 'rband', 'with', 'the', '105m', 'schmidt', 'telescope', 'at', 'the', 'kiso', 'observatory', 'the', '224m', 'telescope', 'of', 'university', 'of', 'hawaii', 'and', 'the', '105m', 'telescope', 'at', 'the', 'misato', 'observatory', 'since', '2001', 'from', 'the', 'analysis', 'of', 'the', 'data', 'we', 'present', 'the', 'relationship', 'between', 'brightness', 'and', 'the', 'solar', 'phase', 'angle', '69', 'to', '878', 'deg', 'we', 'obtained', 'the', 'absolute', 'magnitude', 'h_r0', '1909037', 'and', 'the', 'slope', 'parameter', 'g_r', '025', '029', 'the', 'rotational', 'period', 'of', 'itokawa', 'is', '121324', '00001', 'hours']] | [-0.0925038543736769, 0.16542225858558798, -0.12652250391741593, 0.03261947333165962, -0.08246642441178362, -0.021040133567940857, 0.06503728106359227, 0.3719807933395108, -0.13094013809329932, -0.4433784711278147, 0.13477723584122334, -0.3552840981528991, -0.08884857933347425, 0.22263073091291719, -0.08892404570554693, 0.0016334011788583464, 0.12301201577970965, -0.09134192661278778, -0.046903824775169294, -0.2258705186010856, 0.20465831379923555, 0.1554774663825002, 0.2274917534035113, -0.08987013709007038, 0.1681853352800115, -0.031174593827583724, -0.04933910881744749, -0.07560207916216719, -0.18369269316705564, 0.01397605539014977, 0.2460285631732808, 0.11476338079923556, 0.17766049380103746, -0.26575980456505527, -0.06885010349667735, 0.07924230570594469, 0.0014280567100892463, -0.05941430712118745, 0.07116736057990541, -0.3642407543129391, -0.004657313734706905, -0.15344301549355602, -0.22767446572995848, 0.14987026740434684, 0.12254040032211277, -0.005283429866863622, -0.18969281191627185, 0.06054669287987054, -0.040345230905546085, 0.197267562438113, -0.1645055013294849, -0.1826437432681107, -0.10535825834894139, 0.13907610340975224, 0.008968898669506113, 0.11874761374719027, 0.08565040352857775, -0.06538445687231918, 0.03481655351610647, 0.37172866883791156, -0.0875550530023045, 0.09246632049067152, 0.10087375208192194, -0.28046485607822735, -0.1320979409928744, 0.16703307387781227, 0.18263163349280756, 0.08621011678543355, -0.110647631664243, 0.06763042069053174, -0.03894373601182855, 0.26064163959688613, 0.10478981897855798, 0.02002673719285263, 0.2325827745720744, 0.14264385760244397, 0.04271772125114997, 0.08112871224681537, -0.3989374880265031, 0.0026833421291990412, -0.20087546520452532, -0.13249619017458625, -0.15958195532568628, 0.07058896638320422, -0.12128390247574619, -0.0520679561731716, 0.38905631858958967, 0.10526256659456218, 0.1416024555452168, 0.06424741342198104, 0.26408610563311313, 0.018245471889774004, 0.09659170248083279, 0.05390234616998997, 0.3962236842761437, 0.07440256681940001, 0.16250018503309951, -0.230934825568046, 0.05642038071010676, 0.03657923146125136] |
1,802.02743 | Crossroads of the mesoscale circulation | Quantifying the mechanisms of tracer dispersion in the ocean remains a
central question in oceanography, for problems ranging from nutrient delivery
to phytoplankton, to the early detection of contaminants. Most analyses have
been based on Lagrangian concepts of transport, focusing on the identification
of features minimizing fluid exchange among regions, or more recently on
network tools which focus on connectivity and transport pathways. Neither of
these approaches allows ranking the geographical sites of major water passage
and selecting them so that they monitor waters coming from separate parts of
the ocean. These are instead key criteria when deploying an observing network.
Here we address this issue by estimating at any point the extent of the ocean
surface which transits through it in a given time window. With such information
we are able to rank the sites with major fluxes that intercept waters
originating from different regions. We show that this allows us to optimize an
observing network, where a set of sampling sites can be chosen for monitoring
the largest flux of water dispersing out of a given region. When the analysis
is performed backward in time, this method allows us to identify the major
sources which feed a target region. The method is first applied to a
minimalistic model of a mesoscale eddy field, and then to realistic
satellite-derived ocean currents in the Kerguelen area. In this region we
identify the optimal location of fixed stations capable of intercepting the
trajectories of 43 surface drifters, along with statistics on the temporal
persistence of the stations determined in this way. We then identify possible
hotspots of micro-nutrient enrichment for the recurrent spring phytoplanktonic
bloom occuring here. Promising applications to other fields, such as larval
connectivity, marine spatial planning or contaminant detection, are then
discussed.
| physics.ao-ph physics.flu-dyn | quantifying the mechanisms of tracer dispersion in the ocean remains a central question in oceanography for problems ranging from nutrient delivery to phytoplankton to the early detection of contaminants most analyses have been based on lagrangian concepts of transport focusing on the identification of features minimizing fluid exchange among regions or more recently on network tools which focus on connectivity and transport pathways neither of these approaches allows ranking the geographical sites of major water passage and selecting them so that they monitor waters coming from separate parts of the ocean these are instead key criteria when deploying an observing network here we address this issue by estimating at any point the extent of the ocean surface which transits through it in a given time window with such information we are able to rank the sites with major fluxes that intercept waters originating from different regions we show that this allows us to optimize an observing network where a set of sampling sites can be chosen for monitoring the largest flux of water dispersing out of a given region when the analysis is performed backward in time this method allows us to identify the major sources which feed a target region the method is first applied to a minimalistic model of a mesoscale eddy field and then to realistic satellitederived ocean currents in the kerguelen area in this region we identify the optimal location of fixed stations capable of intercepting the trajectories of 43 surface drifters along with statistics on the temporal persistence of the stations determined in this way we then identify possible hotspots of micronutrient enrichment for the recurrent spring phytoplanktonic bloom occuring here promising applications to other fields such as larval connectivity marine spatial planning or contaminant detection are then discussed | [['quantifying', 'the', 'mechanisms', 'of', 'tracer', 'dispersion', 'in', 'the', 'ocean', 'remains', 'a', 'central', 'question', 'in', 'oceanography', 'for', 'problems', 'ranging', 'from', 'nutrient', 'delivery', 'to', 'phytoplankton', 'to', 'the', 'early', 'detection', 'of', 'contaminants', 'most', 'analyses', 'have', 'been', 'based', 'on', 'lagrangian', 'concepts', 'of', 'transport', 'focusing', 'on', 'the', 'identification', 'of', 'features', 'minimizing', 'fluid', 'exchange', 'among', 'regions', 'or', 'more', 'recently', 'on', 'network', 'tools', 'which', 'focus', 'on', 'connectivity', 'and', 'transport', 'pathways', 'neither', 'of', 'these', 'approaches', 'allows', 'ranking', 'the', 'geographical', 'sites', 'of', 'major', 'water', 'passage', 'and', 'selecting', 'them', 'so', 'that', 'they', 'monitor', 'waters', 'coming', 'from', 'separate', 'parts', 'of', 'the', 'ocean', 'these', 'are', 'instead', 'key', 'criteria', 'when', 'deploying', 'an', 'observing', 'network', 'here', 'we', 'address', 'this', 'issue', 'by', 'estimating', 'at', 'any', 'point', 'the', 'extent', 'of', 'the', 'ocean', 'surface', 'which', 'transits', 'through', 'it', 'in', 'a', 'given', 'time', 'window', 'with', 'such', 'information', 'we', 'are', 'able', 'to', 'rank', 'the', 'sites', 'with', 'major', 'fluxes', 'that', 'intercept', 'waters', 'originating', 'from', 'different', 'regions', 'we', 'show', 'that', 'this', 'allows', 'us', 'to', 'optimize', 'an', 'observing', 'network', 'where', 'a', 'set', 'of', 'sampling', 'sites', 'can', 'be', 'chosen', 'for', 'monitoring', 'the', 'largest', 'flux', 'of', 'water', 'dispersing', 'out', 'of', 'a', 'given', 'region', 'when', 'the', 'analysis', 'is', 'performed', 'backward', 'in', 'time', 'this', 'method', 'allows', 'us', 'to', 'identify', 'the', 'major', 'sources', 'which', 'feed', 'a', 'target', 'region', 'the', 'method', 'is', 'first', 'applied', 'to', 'a', 'minimalistic', 'model', 'of', 'a', 'mesoscale', 'eddy', 'field', 'and', 'then', 'to', 'realistic', 'satellitederived', 'ocean', 'currents', 'in', 'the', 'kerguelen', 'area', 'in', 'this', 'region', 'we', 'identify', 'the', 'optimal', 'location', 'of', 'fixed', 'stations', 'capable', 'of', 'intercepting', 'the', 'trajectories', 'of', '43', 'surface', 'drifters', 'along', 'with', 'statistics', 'on', 'the', 'temporal', 'persistence', 'of', 'the', 'stations', 'determined', 'in', 'this', 'way', 'we', 'then', 'identify', 'possible', 'hotspots', 'of', 'micronutrient', 'enrichment', 'for', 'the', 'recurrent', 'spring', 'phytoplanktonic', 'bloom', 'occuring', 'here', 'promising', 'applications', 'to', 'other', 'fields', 'such', 'as', 'larval', 'connectivity', 'marine', 'spatial', 'planning', 'or', 'contaminant', 'detection', 'are', 'then', 'discussed']] | [-0.09889516663374347, 0.10380253145446013, -0.052735517231133025, 0.05071641106012076, -0.0433210527781986, -0.11187438064661274, 0.08336065875772784, 0.3636857953828302, -0.2760828042060218, -0.3158713120429479, 0.11800141985123318, -0.27644359698146864, -0.1448217093195651, 0.18585712553155562, -0.06324338927395767, 0.014445676133518676, 0.042799082150621996, 0.004449838889231489, 0.011920555373709776, -0.2046197325109642, 0.30648117016319226, 0.07466023384443007, 0.2778209067762692, 0.05316756262893619, 0.11025685733792298, -0.02444021558929939, -0.07791281641737792, 0.009625985972820125, -0.1188776148238875, 0.12639741062794138, 0.29074344970605936, 0.1375329725278695, 0.2753047454186885, -0.4598483604329392, -0.25334618242515117, 0.11118524964527576, 0.13717023629508754, 0.09636488095081101, -0.02135193494335177, -0.27926883971337807, 0.05539273902697047, -0.1253413271488577, -0.11371889223882295, -0.02801869911400928, 0.014426883265273678, 0.04221223990506528, -0.24155783138151482, 0.038195205761977435, -0.009033073320315952, 0.06410888538542252, -0.06417936402516235, -0.09488440180178155, -0.05017744914686173, 0.1952832620200874, 0.05516426771666368, 0.00863103445857776, 0.17843977345995402, -0.14258130433844382, -0.06719483285214227, 0.3633901491718002, -0.03525630847664544, -0.16922187552212486, 0.23477242787727043, -0.12262888989792145, -0.14619363129340573, 0.13999141398833304, 0.22496490702001037, 0.1076450369816275, -0.19855641502148114, -0.01822515982951284, -0.031112817112881292, 0.14959623610660436, 0.08219527635448116, -0.007403769071895591, 0.2522791055138335, 0.21496452421071552, 0.11524337517374429, 0.11208689700433251, -0.195525047549425, -0.09489374179925122, -0.2508123766973333, -0.1350583349565793, -0.13935310318521976, 0.003989112691598132, -0.06530214260122058, -0.15182105996353948, 0.4125362767316273, 0.17742854852831036, 0.16487784035779102, 0.010986800378754965, 0.29007288311124874, 0.050621921959130296, 0.08711774517807586, 0.10133087761776964, 0.20816967813970194, 0.07430681486492433, 0.10884324190906118, -0.19066797316280798, 0.09273844731641978, 0.03219059922674805] |
1,802.02744 | Minimizing Latency in Online Ride and Delivery Services | Motivated by the popularity of online ride and delivery services, we study
natural variants of classical multi-vehicle minimum latency problems where the
objective is to route a set of vehicles located at depots to serve request
located on a metric space so as to minimize the total latency. In this paper,
we consider point-to-point requests that come with source-destination pairs and
release-time constraints that restrict when each request can be served. The
point-to-point requests and release-time constraints model taxi rides and
deliveries. For all the variants considered, we show constant-factor
approximation algorithms based on a linear programming framework. To the best
of our knowledge, these are the first set of results for the aforementioned
variants of the minimum latency problems. Furthermore, we provide an empirical
study of heuristics based on our theoretical algorithms on a real data set of
taxi rides.
| cs.DS | motivated by the popularity of online ride and delivery services we study natural variants of classical multivehicle minimum latency problems where the objective is to route a set of vehicles located at depots to serve request located on a metric space so as to minimize the total latency in this paper we consider pointtopoint requests that come with sourcedestination pairs and releasetime constraints that restrict when each request can be served the pointtopoint requests and releasetime constraints model taxi rides and deliveries for all the variants considered we show constantfactor approximation algorithms based on a linear programming framework to the best of our knowledge these are the first set of results for the aforementioned variants of the minimum latency problems furthermore we provide an empirical study of heuristics based on our theoretical algorithms on a real data set of taxi rides | [['motivated', 'by', 'the', 'popularity', 'of', 'online', 'ride', 'and', 'delivery', 'services', 'we', 'study', 'natural', 'variants', 'of', 'classical', 'multivehicle', 'minimum', 'latency', 'problems', 'where', 'the', 'objective', 'is', 'to', 'route', 'a', 'set', 'of', 'vehicles', 'located', 'at', 'depots', 'to', 'serve', 'request', 'located', 'on', 'a', 'metric', 'space', 'so', 'as', 'to', 'minimize', 'the', 'total', 'latency', 'in', 'this', 'paper', 'we', 'consider', 'pointtopoint', 'requests', 'that', 'come', 'with', 'sourcedestination', 'pairs', 'and', 'releasetime', 'constraints', 'that', 'restrict', 'when', 'each', 'request', 'can', 'be', 'served', 'the', 'pointtopoint', 'requests', 'and', 'releasetime', 'constraints', 'model', 'taxi', 'rides', 'and', 'deliveries', 'for', 'all', 'the', 'variants', 'considered', 'we', 'show', 'constantfactor', 'approximation', 'algorithms', 'based', 'on', 'a', 'linear', 'programming', 'framework', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'these', 'are', 'the', 'first', 'set', 'of', 'results', 'for', 'the', 'aforementioned', 'variants', 'of', 'the', 'minimum', 'latency', 'problems', 'furthermore', 'we', 'provide', 'an', 'empirical', 'study', 'of', 'heuristics', 'based', 'on', 'our', 'theoretical', 'algorithms', 'on', 'a', 'real', 'data', 'set', 'of', 'taxi', 'rides']] | [-0.16324691537764346, -0.0009288869422310567, -0.028285396916144494, 0.04751070726874238, -0.1127014458080397, -0.1562279756280019, 0.1832707192730621, 0.38217248913917873, -0.2674432986594261, -0.331796587187242, 0.09646488062654299, -0.3036615791010624, -0.13903920310186157, 0.1975296519165, -0.12450405000213613, 0.08299748071779807, 0.08979970366769992, 0.06669067289430074, -0.017894369890213223, -0.32866511235826035, 0.28085744677190766, 0.027051873736294873, 0.2844156575593965, 0.08729599587658936, 0.08573499464855945, 0.023497634339443546, -0.0001444042501772972, 0.00364006610553388, -0.12879890363206442, 0.13820507858569422, 0.2878905785210589, 0.24578157798486186, 0.3133731639237269, -0.4625045223993824, -0.18200073215502796, 0.12521880582397713, 0.10037497978274387, 0.03652992372315192, -0.011618208858442116, -0.2708028477174065, 0.12984707584631042, -0.1613476266589095, -0.026614896566706136, -0.0026672033804422575, -0.03642375889095537, 0.09453126486285147, -0.3179895284962147, -0.04576983781042674, -0.027994416482376713, -0.0022641410324590427, -0.06997108323572217, -0.11194327414854832, 0.03247339307026713, 0.16035273068040404, 0.07778515584159193, 0.02128138111124859, 0.09628703330762367, -0.0723597786293517, -0.19967992561836298, 0.4447869930601289, -0.015206826193562003, -0.17131298848969453, 0.14981988055056872, -0.018246441881390327, -0.1637397062657599, 0.05888670897573656, 0.28992682159713185, 0.11575206857610573, -0.19917336485320983, 0.022372394935591212, -0.0784972953075107, 0.13949087126748572, 0.07695685233590556, 0.04327821896034986, 0.1582656700282972, 0.22543494985934268, 0.17624077860081028, 0.12217779553838815, -0.032710908608286515, -0.09441499786178172, -0.2768449791977909, -0.12594080014246786, -0.19718663883808313, -0.013842387106731956, -0.09693248464902599, -0.1196969968418703, 0.3733077951746577, 0.1541594888611221, 0.16594021085398733, 0.1676419995665709, 0.35350031313215585, 0.06837567953747475, 0.037049298541263695, 0.18047705376256548, 0.1478486318134617, -0.0120829291133324, 0.1071242388364271, -0.18180598478751087, 0.08007203078835357, 0.049824652717785634] |
1,802.02745 | Learning Inductive Biases with Simple Neural Networks | People use rich prior knowledge about the world in order to efficiently learn
new concepts. These priors - also known as "inductive biases" - pertain to the
space of internal models considered by a learner, and they help the learner
make inferences that go beyond the observed data. A recent study found that
deep neural networks optimized for object recognition develop the shape bias
(Ritter et al., 2017), an inductive bias possessed by children that plays an
important role in early word learning. However, these networks use
unrealistically large quantities of training data, and the conditions required
for these biases to develop are not well understood. Moreover, it is unclear
how the learning dynamics of these networks relate to developmental processes
in childhood. We investigate the development and influence of the shape bias in
neural networks using controlled datasets of abstract patterns and synthetic
images, allowing us to systematically vary the quantity and form of the
experience provided to the learning algorithms. We find that simple neural
networks develop a shape bias after seeing as few as 3 examples of 4 object
categories. The development of these biases predicts the onset of vocabulary
acceleration in our networks, consistent with the developmental process in
children.
| cs.CL cs.CV cs.LG | people use rich prior knowledge about the world in order to efficiently learn new concepts these priors also known as inductive biases pertain to the space of internal models considered by a learner and they help the learner make inferences that go beyond the observed data a recent study found that deep neural networks optimized for object recognition develop the shape bias ritter et al 2017 an inductive bias possessed by children that plays an important role in early word learning however these networks use unrealistically large quantities of training data and the conditions required for these biases to develop are not well understood moreover it is unclear how the learning dynamics of these networks relate to developmental processes in childhood we investigate the development and influence of the shape bias in neural networks using controlled datasets of abstract patterns and synthetic images allowing us to systematically vary the quantity and form of the experience provided to the learning algorithms we find that simple neural networks develop a shape bias after seeing as few as 3 examples of 4 object categories the development of these biases predicts the onset of vocabulary acceleration in our networks consistent with the developmental process in children | [['people', 'use', 'rich', 'prior', 'knowledge', 'about', 'the', 'world', 'in', 'order', 'to', 'efficiently', 'learn', 'new', 'concepts', 'these', 'priors', 'also', 'known', 'as', 'inductive', 'biases', 'pertain', 'to', 'the', 'space', 'of', 'internal', 'models', 'considered', 'by', 'a', 'learner', 'and', 'they', 'help', 'the', 'learner', 'make', 'inferences', 'that', 'go', 'beyond', 'the', 'observed', 'data', 'a', 'recent', 'study', 'found', 'that', 'deep', 'neural', 'networks', 'optimized', 'for', 'object', 'recognition', 'develop', 'the', 'shape', 'bias', 'ritter', 'et', 'al', '2017', 'an', 'inductive', 'bias', 'possessed', 'by', 'children', 'that', 'plays', 'an', 'important', 'role', 'in', 'early', 'word', 'learning', 'however', 'these', 'networks', 'use', 'unrealistically', 'large', 'quantities', 'of', 'training', 'data', 'and', 'the', 'conditions', 'required', 'for', 'these', 'biases', 'to', 'develop', 'are', 'not', 'well', 'understood', 'moreover', 'it', 'is', 'unclear', 'how', 'the', 'learning', 'dynamics', 'of', 'these', 'networks', 'relate', 'to', 'developmental', 'processes', 'in', 'childhood', 'we', 'investigate', 'the', 'development', 'and', 'influence', 'of', 'the', 'shape', 'bias', 'in', 'neural', 'networks', 'using', 'controlled', 'datasets', 'of', 'abstract', 'patterns', 'and', 'synthetic', 'images', 'allowing', 'us', 'to', 'systematically', 'vary', 'the', 'quantity', 'and', 'form', 'of', 'the', 'experience', 'provided', 'to', 'the', 'learning', 'algorithms', 'we', 'find', 'that', 'simple', 'neural', 'networks', 'develop', 'a', 'shape', 'bias', 'after', 'seeing', 'as', 'few', 'as', '3', 'examples', 'of', '4', 'object', 'categories', 'the', 'development', 'of', 'these', 'biases', 'predicts', 'the', 'onset', 'of', 'vocabulary', 'acceleration', 'in', 'our', 'networks', 'consistent', 'with', 'the', 'developmental', 'process', 'in', 'children']] | [-0.028134767975805716, 0.06480328881283784, -0.07167264772809599, 0.14053228110313482, -0.12660032675006785, -0.12828187253510598, 0.04654452429697065, 0.4352947024739172, -0.27559960030461894, -0.37145713834198063, 0.07267790494802509, -0.21679357664502863, -0.2253227342199073, 0.18042546630886586, -0.1400437424591014, 0.0309630093754887, 0.09566202940244117, 0.03422804870688827, -0.016762302397164783, -0.28575522862466995, 0.3340298527261556, 0.07705424387929477, 0.2955903152071889, -0.008971654773127325, 0.10037993821981109, -0.038355955727845614, -0.04836790586215453, 0.004282696446776159, -0.11173198571371601, 0.1437799784903516, 0.31006999057913925, 0.19452885230818745, 0.3301509276913055, -0.4526142652773547, -0.23091069125745556, 0.0933611486320347, 0.14222642418578046, 0.12443547513824946, -0.02936480153829786, -0.3128086268431553, 0.051119713525352356, -0.1738434312911243, -0.06482236613381175, -0.13136210882434585, 0.02255426334173391, 0.007352346790110748, -0.25699884442458076, 0.040988304561072046, 0.1005236374422917, 0.0822803094420619, -0.03583467288961689, -0.10916127234416101, 0.005119474360657081, 0.21452947006339557, 0.0439665683478608, 0.022448134510593472, 0.1767010191215737, -0.1973312851410396, -0.13704003047516183, 0.31509511495276477, -0.022892747375777563, -0.16074408306325277, 0.20083200559942144, -0.08565543197316698, -0.17138049085071255, 0.07755486286674064, 0.22586569491091488, 0.08147064208670861, -0.1659082630049843, 0.011688746107075971, 0.015561526249356495, 0.16788588580675423, 0.04630460866149469, -0.01814590979455094, 0.1999032126790337, 0.20615945049183498, -7.508489496932172e-05, 0.09291716975777752, -0.08985782944076316, -0.053862695735798556, -0.23597843627823462, -0.07911741811007557, -0.14271963678881305, 0.015252849371889999, -0.1015998026914981, -0.16719200332410747, 0.3711836054715983, 0.25204343719656885, 0.22871129203698423, 0.08820805267665978, 0.2555116923193973, 0.021582259209872695, 0.11913252534289466, 0.07568437168328553, 0.2206543412729222, 0.08873512013354293, 0.1553210769088404, -0.17483678806485553, 0.13587442432624738, -0.016852112682905086] |
1,802.02746 | Rank Revealing Gaussian Elimination by the Maximum Volume Concept | A Gaussian elimination algorithm is presented that reveals the numerical rank
of a matrix by yielding small entries in the Schur complement. The algorithm
uses the maximum volume concept to find a square nonsingular submatrix of
maximum dimension. The bounds on the revealed singular values are similar to
the best known bounds for rank revealing LU factorization, but in contrast to
existing methods the algorithm does not make use of the normal matrix. An
implementation for dense matrices is described whose computational cost is
roughly twice the cost of an LU factorization with complete pivoting. Because
of its flexibility in choosing pivot elements, the algorithm is amenable to
implementation with blocked memory access and for sparse matrices.
| math.NA | a gaussian elimination algorithm is presented that reveals the numerical rank of a matrix by yielding small entries in the schur complement the algorithm uses the maximum volume concept to find a square nonsingular submatrix of maximum dimension the bounds on the revealed singular values are similar to the best known bounds for rank revealing lu factorization but in contrast to existing methods the algorithm does not make use of the normal matrix an implementation for dense matrices is described whose computational cost is roughly twice the cost of an lu factorization with complete pivoting because of its flexibility in choosing pivot elements the algorithm is amenable to implementation with blocked memory access and for sparse matrices | [['a', 'gaussian', 'elimination', 'algorithm', 'is', 'presented', 'that', 'reveals', 'the', 'numerical', 'rank', 'of', 'a', 'matrix', 'by', 'yielding', 'small', 'entries', 'in', 'the', 'schur', 'complement', 'the', 'algorithm', 'uses', 'the', 'maximum', 'volume', 'concept', 'to', 'find', 'a', 'square', 'nonsingular', 'submatrix', 'of', 'maximum', 'dimension', 'the', 'bounds', 'on', 'the', 'revealed', 'singular', 'values', 'are', 'similar', 'to', 'the', 'best', 'known', 'bounds', 'for', 'rank', 'revealing', 'lu', 'factorization', 'but', 'in', 'contrast', 'to', 'existing', 'methods', 'the', 'algorithm', 'does', 'not', 'make', 'use', 'of', 'the', 'normal', 'matrix', 'an', 'implementation', 'for', 'dense', 'matrices', 'is', 'described', 'whose', 'computational', 'cost', 'is', 'roughly', 'twice', 'the', 'cost', 'of', 'an', 'lu', 'factorization', 'with', 'complete', 'pivoting', 'because', 'of', 'its', 'flexibility', 'in', 'choosing', 'pivot', 'elements', 'the', 'algorithm', 'is', 'amenable', 'to', 'implementation', 'with', 'blocked', 'memory', 'access', 'and', 'for', 'sparse', 'matrices']] | [-0.09603710411888602, 0.041983617392306924, -0.05676246504498343, 0.013798734189098718, -0.09147707945627408, -0.16003551796619964, 0.05724680058471063, 0.3850178201802266, -0.28159536901288307, -0.25733219971880317, 0.15171995791745904, -0.24394006574223948, -0.16804274349099296, 0.1571473911898131, -0.08753343759916532, 0.07534235517723728, 0.05910054636665453, 0.07918504970227806, -0.14620058837895974, -0.29766645598519814, 0.2514110066804589, 0.08640457877618635, 0.24971333575339463, 0.023474392767709035, 0.106324625814445, 0.022463548594178297, -0.08021773773635554, 0.011510962198496375, -0.04222321830139919, 0.12093084237068637, 0.25985803763963217, 0.1821913975549655, 0.26962691240219605, -0.3754424620578941, -0.11164849131312381, 0.11971549940012936, 0.13430055151653722, 0.07763518651740418, -0.01010311163790747, -0.20910423591287217, 0.11659447028914578, -0.1443148356440485, -0.14107657031705365, -0.10716216696095932, -0.007017126862102976, -0.021627495632483028, -0.35260771205011976, 0.04288197753743993, 0.06373213653444734, 0.011145408261312634, 0.024889798740394667, -0.22661279123594874, 0.06358219814112681, 0.036455502772393324, -0.007502413510034482, -0.012824349789920017, 0.1088817217553922, -0.07697860104963183, -0.1107125186906634, 0.3701595851781372, -0.01854810173400383, -0.2054150742498569, 0.14784552960887423, -0.09623079255828236, -0.10977900636772442, 0.19570905103897437, 0.12269233263189244, 0.08862419011574796, -0.07792527793755388, 0.1345568110079442, -0.07308207404537079, 0.1980704600429242, 0.05991962866093486, 0.01701067249951327, 0.09609072543999068, 0.14624589416556633, 0.14963083426491955, 0.10527772794260731, -0.015294253830121368, -0.09594114370739613, -0.24616267883943188, -0.15217232627497634, -0.2839511965847232, 0.011646879341529928, -0.16813977062689742, -0.2317481604265447, 0.386527307689763, 0.0927770688620388, 0.22399175259419996, 0.11658466615292251, 0.32577081793584883, 0.09766689180117896, 0.0942493885731659, 0.16141510289162397, 0.1691505267457941, 0.19420536102241495, 0.04375273429064287, -0.18641209662852123, 0.09697163811462939, 0.1346421624159711] |
1,802.02747 | Orbital Motion of Young Binaries in Ophiuchus and Upper Centaurus-Lupus | We present measurements of the orbital positions and flux ratios of 17 binary
and triple systems in the Ophiuchus star forming region and the Upper
Centaurus-Lupus cluster based on adaptive optics imaging at the Keck
Observatory. We report the detection of visual companions in MML 50 and MML 53
for the first time, as well as the possible detection of a third component in
WSB 21. For six systems in our sample, our measurements provide a second
orbital position following their initial discoveries over a decade ago. For
eight systems with sufficient orbital coverage, we analyze the range of orbital
solutions that fit the data. Ultimately, these observations will help provide
the groundwork toward measuring precise masses for these pre-main sequence
stars and understanding the distribution of orbital parameters in young
multiple systems.
| astro-ph.SR | we present measurements of the orbital positions and flux ratios of 17 binary and triple systems in the ophiuchus star forming region and the upper centauruslupus cluster based on adaptive optics imaging at the keck observatory we report the detection of visual companions in mml 50 and mml 53 for the first time as well as the possible detection of a third component in wsb 21 for six systems in our sample our measurements provide a second orbital position following their initial discoveries over a decade ago for eight systems with sufficient orbital coverage we analyze the range of orbital solutions that fit the data ultimately these observations will help provide the groundwork toward measuring precise masses for these premain sequence stars and understanding the distribution of orbital parameters in young multiple systems | [['we', 'present', 'measurements', 'of', 'the', 'orbital', 'positions', 'and', 'flux', 'ratios', 'of', '17', 'binary', 'and', 'triple', 'systems', 'in', 'the', 'ophiuchus', 'star', 'forming', 'region', 'and', 'the', 'upper', 'centauruslupus', 'cluster', 'based', 'on', 'adaptive', 'optics', 'imaging', 'at', 'the', 'keck', 'observatory', 'we', 'report', 'the', 'detection', 'of', 'visual', 'companions', 'in', 'mml', '50', 'and', 'mml', '53', 'for', 'the', 'first', 'time', 'as', 'well', 'as', 'the', 'possible', 'detection', 'of', 'a', 'third', 'component', 'in', 'wsb', '21', 'for', 'six', 'systems', 'in', 'our', 'sample', 'our', 'measurements', 'provide', 'a', 'second', 'orbital', 'position', 'following', 'their', 'initial', 'discoveries', 'over', 'a', 'decade', 'ago', 'for', 'eight', 'systems', 'with', 'sufficient', 'orbital', 'coverage', 'we', 'analyze', 'the', 'range', 'of', 'orbital', 'solutions', 'that', 'fit', 'the', 'data', 'ultimately', 'these', 'observations', 'will', 'help', 'provide', 'the', 'groundwork', 'toward', 'measuring', 'precise', 'masses', 'for', 'these', 'premain', 'sequence', 'stars', 'and', 'understanding', 'the', 'distribution', 'of', 'orbital', 'parameters', 'in', 'young', 'multiple', 'systems']] | [-0.13854217207010247, 0.08303088393531516, -0.0779462684352035, 0.04306683739598252, -0.06097157600272755, -0.06384838684011229, 0.10820457632250775, 0.37413623507477733, -0.17184147246784173, -0.40137529976778014, 0.12831590838443235, -0.26116442672306095, -0.05777038992347574, 0.21507687099221953, -0.01348304272567174, 0.04959455306582237, 0.1349600104972216, -0.025225565666805505, -0.08675579701005866, -0.24636373675211257, 0.29613228989905094, 0.07113195994966909, 0.15089431380208834, -0.030793133814980212, 0.0702511207804546, 0.007242911244931638, -0.07872708084208793, -0.07207773522915024, -0.15743508758015723, 0.10957173957258351, 0.23363520983668723, 0.15402925575390122, 0.21443966713810997, -0.3437783859345315, -0.16561108245689393, 0.02902721611544826, 0.1865478573521053, 0.0543841060769177, -0.05918286201330532, -0.28099116815089537, 0.04891196305730513, -0.16555708493683768, -0.16978608620093955, -0.024157443616007055, 0.08579084013861821, 0.06073395343133269, -0.2402260571620182, 0.08109110377858483, 0.04029314271506986, 0.12655242896902277, -0.15035517937398718, -0.1703235888275969, -0.0036602248945378497, 0.14199426532127804, -0.043396104309231714, 0.03852981966184942, 0.08241543774247954, -0.11677075355817892, -0.11674070831640322, 0.36422358897927787, -0.0757784563570191, -0.06765675236632053, 0.2255398156909146, -0.21898492162388966, -0.1996256058363426, 0.12766966379870823, 0.20370000482648892, 0.16049904386421904, -0.19071967945315113, -0.03788992037683291, 0.004965749093072307, 0.20064764776568217, 0.04179506918373413, 0.09814091468986152, 0.3399947622083688, 0.17834132428007915, 0.0409460009435232, 0.07756028842545093, -0.25485378025708844, -0.07854726026228566, -0.23305226974163024, -0.15555348263045116, -0.13726040786937496, 0.021971278388011165, -0.09491155161712707, -0.0934964870487837, 0.37045631405050145, 0.17054082790767788, 0.20684643071915085, 0.06153192056195909, 0.2639060829787102, 0.06478300563163034, 0.08061860369245305, 0.04693358662517223, 0.309554980595113, 0.14952433423692346, 0.13811555572284764, -0.21507936156082624, 0.05795362846981874, 0.008284107342544467] |
1,802.02748 | Serve the shortest queue and Walsh Brownian motion | We study a single-server Markovian queueing model with $N$ customer classes
in which priority is given to the shortest queue. Under a critical load
condition, we establish the diffusion limit of the workload and queue length
processes in the form of a Walsh Brownian motion (WBM) living in the union of
the $N$ nonnegative coordinate axes in $\mathbb{R}^N$ and a linear
transformation thereof. This reveals the following asymptotic behavior. Each
time that queues begin to build starting from an empty system, one of them
becomes dominant in the sense that it contains nearly all the workload in the
system, and it remains so until the system becomes (nearly) empty again. The
radial part of the WBM, given as a reflected Brownian motion (RBM) on the
half-line, captures the total workload asymptotics, whereas its angular
distribution expresses how likely it is for each class to become dominant on
excursions.
As a heavy traffic result it is nonstandard in three ways: (i) In the
terminology of Harrison (1995) it is unconventional, in that the limit is not
an RBM. (ii) It does not constitute an invariance principle, in that the limit
law (specifically, the angular distribution) is not determined solely by the
first two moments of the data, and is sensitive even to tie breaking rules.
(iii) The proof method does not fully characterize the limit law (specifically,
it gives no information on the angular distribution).
| math.PR | we study a singleserver markovian queueing model with n customer classes in which priority is given to the shortest queue under a critical load condition we establish the diffusion limit of the workload and queue length processes in the form of a walsh brownian motion wbm living in the union of the n nonnegative coordinate axes in mathbbrn and a linear transformation thereof this reveals the following asymptotic behavior each time that queues begin to build starting from an empty system one of them becomes dominant in the sense that it contains nearly all the workload in the system and it remains so until the system becomes nearly empty again the radial part of the wbm given as a reflected brownian motion rbm on the halfline captures the total workload asymptotics whereas its angular distribution expresses how likely it is for each class to become dominant on excursions as a heavy traffic result it is nonstandard in three ways i in the terminology of harrison 1995 it is unconventional in that the limit is not an rbm ii it does not constitute an invariance principle in that the limit law specifically the angular distribution is not determined solely by the first two moments of the data and is sensitive even to tie breaking rules iii the proof method does not fully characterize the limit law specifically it gives no information on the angular distribution | [['we', 'study', 'a', 'singleserver', 'markovian', 'queueing', 'model', 'with', 'n', 'customer', 'classes', 'in', 'which', 'priority', 'is', 'given', 'to', 'the', 'shortest', 'queue', 'under', 'a', 'critical', 'load', 'condition', 'we', 'establish', 'the', 'diffusion', 'limit', 'of', 'the', 'workload', 'and', 'queue', 'length', 'processes', 'in', 'the', 'form', 'of', 'a', 'walsh', 'brownian', 'motion', 'wbm', 'living', 'in', 'the', 'union', 'of', 'the', 'n', 'nonnegative', 'coordinate', 'axes', 'in', 'mathbbrn', 'and', 'a', 'linear', 'transformation', 'thereof', 'this', 'reveals', 'the', 'following', 'asymptotic', 'behavior', 'each', 'time', 'that', 'queues', 'begin', 'to', 'build', 'starting', 'from', 'an', 'empty', 'system', 'one', 'of', 'them', 'becomes', 'dominant', 'in', 'the', 'sense', 'that', 'it', 'contains', 'nearly', 'all', 'the', 'workload', 'in', 'the', 'system', 'and', 'it', 'remains', 'so', 'until', 'the', 'system', 'becomes', 'nearly', 'empty', 'again', 'the', 'radial', 'part', 'of', 'the', 'wbm', 'given', 'as', 'a', 'reflected', 'brownian', 'motion', 'rbm', 'on', 'the', 'halfline', 'captures', 'the', 'total', 'workload', 'asymptotics', 'whereas', 'its', 'angular', 'distribution', 'expresses', 'how', 'likely', 'it', 'is', 'for', 'each', 'class', 'to', 'become', 'dominant', 'on', 'excursions', 'as', 'a', 'heavy', 'traffic', 'result', 'it', 'is', 'nonstandard', 'in', 'three', 'ways', 'i', 'in', 'the', 'terminology', 'of', 'harrison', '1995', 'it', 'is', 'unconventional', 'in', 'that', 'the', 'limit', 'is', 'not', 'an', 'rbm', 'ii', 'it', 'does', 'not', 'constitute', 'an', 'invariance', 'principle', 'in', 'that', 'the', 'limit', 'law', 'specifically', 'the', 'angular', 'distribution', 'is', 'not', 'determined', 'solely', 'by', 'the', 'first', 'two', 'moments', 'of', 'the', 'data', 'and', 'is', 'sensitive', 'even', 'to', 'tie', 'breaking', 'rules', 'iii', 'the', 'proof', 'method', 'does', 'not', 'fully', 'characterize', 'the', 'limit', 'law', 'specifically', 'it', 'gives', 'no', 'information', 'on', 'the', 'angular', 'distribution']] | [-0.15272656717072997, 0.128523181130327, -0.10837416433426751, 0.06019059028158076, -0.07089050246490182, -0.14115049199670807, 0.07425079101788151, 0.341838552767777, -0.2896735168173591, -0.2409667620777638, 0.10451201126815225, -0.292157252987799, -0.10322495513898121, 0.14554721924862388, -0.08154138653642601, 0.023507830002056595, 0.05294764149858433, 0.0831861070697554, 0.017090435437340703, -0.23304677544893998, 0.30142266569364595, 0.03205274216309349, 0.2924194855707037, 0.006733392133938674, 0.10855676393416655, 0.02829739494094004, -0.016746016734669734, -0.009835185742793748, -0.10296371874350231, 0.06121202280971771, 0.20193519551927844, 0.118001501639095, 0.2605335547003704, -0.3858298794923621, -0.14980570177257094, 0.11807083635606891, 0.14667183340081355, 0.08228838293062937, 0.03310257931932425, -0.2312131560423499, 0.051215985590894506, -0.14495165400509524, -0.1603495616835948, -0.02584747554591069, 0.0700883052399398, 0.011451008908737164, -0.26129210779928946, 0.04685019066762943, 0.14200313692428887, 0.006449202919362957, -0.05911723249164036, -0.0743795388769239, -0.027050551722566478, 0.1360203846731884, 0.07590656319651036, 0.0020083120385280405, 0.11175311713391899, -0.10605738482163904, -0.0744655698365691, 0.4011203081140088, -0.06601200440727398, -0.22218523039639246, 0.15238082399651504, -0.15692322993945554, -0.15270077358955184, 0.12722707305772182, 0.13392521316109973, 0.10882567822614547, -0.1913814324622926, 0.09998811423702914, -0.06656638892868963, 0.1602376924139153, 0.06866620467482214, 0.01718981291563449, 0.1843537118078934, 0.16298194708796138, 0.12049759188010238, 0.12352119838524386, -0.07102111709300671, -0.14836420423478588, -0.31598118327669483, -0.16289888807914704, -0.2262998256393565, 0.07623961647503819, -0.08410225170002812, -0.18917483696714044, 0.34771882091613054, 0.12122185535740872, 0.20599681882669804, 0.1050516646857867, 0.26141023132989866, 0.14820218013109973, 0.057460657460217036, 0.1283336576575843, 0.17823786354369014, 0.0931934801574088, 0.14902758028887564, -0.20949653719684197, 0.11116722531409727, 0.0674201959841606] |
1,802.02749 | Ultraviolet laser spectroscopy of aluminum atoms in hollow-cathode lamp | We report precision measurement of aluminum atoms
${^{2}P_{1/2}}-{^{2}S_{1/2}}$ transition at 394 nm and
${^{2}P_{3/2}}-{^{2}S_{1/2}}$ transition at 396 nm in a hollow-cathode lamp
(HCL). Both absorption spectroscopy and saturated absorption spectroscopy (SAS)
are performed. From the absorption spectroscopy the Doppler linewidth is
estimated to be 2.6 GHz. The SAS spectroscopy is analyzed based on the
velocity-changing-effect model. With a frequency comb calibrated wavemeter, the
frequencies of ${^{2}P_{1/2}},{F=3}-{^{2}S_{1/2}},{F=2}$ transition and
${^{2}P_{3/2}},{F=4}-{^{2}S_{1/2}},{F=3}$ transition are measured to be
759.905401(10) THz and 756.547403(10) THz, respectively. The hyperfine
structure constants of aluminum atoms are determined and compared with
previously reported measurement results and theoretical calculation. Reasonable
agreement is found for the magnetic dipole constant (A constant), while the
electric quadrupole constant (B constant) has a large deviation.
| physics.atom-ph | we report precision measurement of aluminum atoms 2p_122s_12 transition at 394 nm and 2p_322s_12 transition at 396 nm in a hollowcathode lamp hcl both absorption spectroscopy and saturated absorption spectroscopy sas are performed from the absorption spectroscopy the doppler linewidth is estimated to be 26 ghz the sas spectroscopy is analyzed based on the velocitychangingeffect model with a frequency comb calibrated wavemeter the frequencies of 2p_12f32s_12f2 transition and 2p_32f42s_12f3 transition are measured to be 75990540110 thz and 75654740310 thz respectively the hyperfine structure constants of aluminum atoms are determined and compared with previously reported measurement results and theoretical calculation reasonable agreement is found for the magnetic dipole constant a constant while the electric quadrupole constant b constant has a large deviation | [['we', 'report', 'precision', 'measurement', 'of', 'aluminum', 'atoms', '2p_122s_12', 'transition', 'at', '394', 'nm', 'and', '2p_322s_12', 'transition', 'at', '396', 'nm', 'in', 'a', 'hollowcathode', 'lamp', 'hcl', 'both', 'absorption', 'spectroscopy', 'and', 'saturated', 'absorption', 'spectroscopy', 'sas', 'are', 'performed', 'from', 'the', 'absorption', 'spectroscopy', 'the', 'doppler', 'linewidth', 'is', 'estimated', 'to', 'be', '26', 'ghz', 'the', 'sas', 'spectroscopy', 'is', 'analyzed', 'based', 'on', 'the', 'velocitychangingeffect', 'model', 'with', 'a', 'frequency', 'comb', 'calibrated', 'wavemeter', 'the', 'frequencies', 'of', '2p_12f32s_12f2', 'transition', 'and', '2p_32f42s_12f3', 'transition', 'are', 'measured', 'to', 'be', '75990540110', 'thz', 'and', '75654740310', 'thz', 'respectively', 'the', 'hyperfine', 'structure', 'constants', 'of', 'aluminum', 'atoms', 'are', 'determined', 'and', 'compared', 'with', 'previously', 'reported', 'measurement', 'results', 'and', 'theoretical', 'calculation', 'reasonable', 'agreement', 'is', 'found', 'for', 'the', 'magnetic', 'dipole', 'constant', 'a', 'constant', 'while', 'the', 'electric', 'quadrupole', 'constant', 'b', 'constant', 'has', 'a', 'large', 'deviation']] | [-0.06699905188997154, 0.1706557495560011, 0.02432762581207182, -0.06667349786882329, 0.0021669114069284303, -0.18970966016792734, 0.09948082134208601, 0.49680391240703026, -0.17714058100650815, -0.33353820684487406, 0.053522856921241015, -0.3372796900651377, 0.006894931820747645, 0.20315798721681147, 0.08507808296252851, 0.05394609147966232, 0.027134742725478566, -0.028327661202005718, -0.037298973534337206, -0.08915958582909535, 0.193430710632516, 0.09541186754308317, 0.2984528838130443, 0.07941955872608916, 0.07070282266029845, -0.09268101564729991, -0.004281567247665446, -0.014522586460225284, -0.16673586295674678, 0.06988325133595778, 0.25069559222978094, -0.026805800057785666, 0.16835601130378958, -0.32155278557506595, -0.1835737159030269, 0.0038639218364234854, 0.0901836058145146, 0.12105837310259433, -0.03923868028062355, -0.30168716255170497, 0.030634489291064118, -0.08970022142419348, -0.09643040424739213, -0.054593090267608994, 0.033371785198054886, 0.014262030455400868, -0.3071584989504038, 0.08067618130665759, -0.049802596235404846, 0.15790077916791906, -0.13439963285041892, -0.16357293832723213, -0.01872651458302837, 0.04906089662614724, -0.05616028806012448, 0.0642511530617333, 0.19807579862358776, -0.014651600862650768, -0.07909297996565051, 0.38999388291217063, -0.18034863144807192, -0.010457813671698955, 0.10486569888668347, -0.23661085120199815, -0.052954109867467826, 0.2340829211651631, 0.0971966979559511, 0.11437921952456236, -0.12464544730129368, 0.03872139878753249, 0.023196746076902617, 0.2707536942123071, 0.16283349328795854, 0.056320442005665466, 0.1751150063643961, 0.13182601136580596, -0.05898745614711357, 0.07113055475359864, -0.18889351276802305, 0.01624802189838627, -0.23760236842841234, -0.0947363668890751, -0.20418716844819162, 0.07977204255192824, -0.07560779403657247, -0.11866894989557888, 0.32603736754668794, 0.08880647622939686, 0.17291025033463603, -0.013881551030971937, 0.32004662387720917, 0.16317615808271196, 0.05831603967918731, 0.000516480737892182, 0.38848210219293833, 0.242065058130285, 0.11985203057082126, -0.264540981406184, 0.03674671021492585, -0.054935522563755515] |
1,802.0275 | Analytic plasma wakefield limits for active plasma lenses | Active plasma lensing is a promising technology for compact focusing of
particle beams that has seen a recent surge of interest. While these lenses can
provide strong focusing gradients of order kT/m and focusing in both transverse
planes, there are limitations from nonlinear aberrations, causing emittance
growth in the beams being focused. One cause of such aberrations is beam-driven
plasma wakefields, present if the beam density is sufficiently high. We develop
simple, but powerful analytic formulas for the effective focusing gradient from
these wakefields, and use this to set limits on which parts of the beam and
plasma parameter space permits distortion-free use of active plasma lenses. It
is concluded that the application of active plasma lenses to conventional and
plasma-based linear colliders may prove very challenging, except perhaps in the
final focus system, unless the typical discharge currents used are dramatically
increased, and that in general these lenses are better suited for accelerator
applications with lower beam intensities.
| physics.acc-ph | active plasma lensing is a promising technology for compact focusing of particle beams that has seen a recent surge of interest while these lenses can provide strong focusing gradients of order ktm and focusing in both transverse planes there are limitations from nonlinear aberrations causing emittance growth in the beams being focused one cause of such aberrations is beamdriven plasma wakefields present if the beam density is sufficiently high we develop simple but powerful analytic formulas for the effective focusing gradient from these wakefields and use this to set limits on which parts of the beam and plasma parameter space permits distortionfree use of active plasma lenses it is concluded that the application of active plasma lenses to conventional and plasmabased linear colliders may prove very challenging except perhaps in the final focus system unless the typical discharge currents used are dramatically increased and that in general these lenses are better suited for accelerator applications with lower beam intensities | [['active', 'plasma', 'lensing', 'is', 'a', 'promising', 'technology', 'for', 'compact', 'focusing', 'of', 'particle', 'beams', 'that', 'has', 'seen', 'a', 'recent', 'surge', 'of', 'interest', 'while', 'these', 'lenses', 'can', 'provide', 'strong', 'focusing', 'gradients', 'of', 'order', 'ktm', 'and', 'focusing', 'in', 'both', 'transverse', 'planes', 'there', 'are', 'limitations', 'from', 'nonlinear', 'aberrations', 'causing', 'emittance', 'growth', 'in', 'the', 'beams', 'being', 'focused', 'one', 'cause', 'of', 'such', 'aberrations', 'is', 'beamdriven', 'plasma', 'wakefields', 'present', 'if', 'the', 'beam', 'density', 'is', 'sufficiently', 'high', 'we', 'develop', 'simple', 'but', 'powerful', 'analytic', 'formulas', 'for', 'the', 'effective', 'focusing', 'gradient', 'from', 'these', 'wakefields', 'and', 'use', 'this', 'to', 'set', 'limits', 'on', 'which', 'parts', 'of', 'the', 'beam', 'and', 'plasma', 'parameter', 'space', 'permits', 'distortionfree', 'use', 'of', 'active', 'plasma', 'lenses', 'it', 'is', 'concluded', 'that', 'the', 'application', 'of', 'active', 'plasma', 'lenses', 'to', 'conventional', 'and', 'plasmabased', 'linear', 'colliders', 'may', 'prove', 'very', 'challenging', 'except', 'perhaps', 'in', 'the', 'final', 'focus', 'system', 'unless', 'the', 'typical', 'discharge', 'currents', 'used', 'are', 'dramatically', 'increased', 'and', 'that', 'in', 'general', 'these', 'lenses', 'are', 'better', 'suited', 'for', 'accelerator', 'applications', 'with', 'lower', 'beam', 'intensities']] | [-0.09912487790691403, 0.17392128180571884, -0.0526228877181281, 0.08823851658267104, -0.08261334954075655, -0.15961696588838437, -0.06265422208058946, 0.42668966166147926, -0.19404585107153505, -0.29680334409382547, 0.1055204988949282, -0.2534815806495729, -0.07540281119305382, 0.27601933123546785, -0.03874154769295297, 0.09601379740901245, 0.05261775737616626, -0.05571755077437287, -0.019689218836701796, -0.20216882106285752, 0.2869565816795301, 0.10394972250591847, 0.29134486276515814, 0.06933394927566625, 0.12244635935486206, 0.012530626689593465, -0.012497529015896854, 0.039370164269128954, -0.08726965079221138, 0.10075282499358151, 0.24938312379655037, 0.09940739354388144, 0.26483706421505826, -0.46785163182366946, -0.23918541529766466, 0.0633503068853521, 0.18307392589993915, 0.1162459508586549, -0.14647662630465771, -0.20867908403713772, 0.04142374134807022, -0.14076688101972049, -0.14589958431333913, -0.04665027559242861, 0.017405091749750218, 0.09863246712063398, -0.2756386033593203, 0.039666399799555295, 0.040819775474216766, 0.03703779657224908, 0.019357102002023056, -0.11845462010300618, 0.022401305687256484, 0.06300515757065336, 0.05163537098223683, 0.05328576376005632, 0.1809353175713628, -0.15539268518610616, -0.049774119317086425, 0.4113702711901106, -0.009687972257247652, -0.16150430900062313, 0.21310532465137821, -0.22091022574887523, -0.08346091605775621, 0.1731123599149111, 0.2181353892592139, 0.10085397277542818, -0.1044889602710569, 0.03052502415844374, 0.03186474808963285, 0.15232324237135714, 0.11323717605240596, 0.049663201188624675, 0.2499978396903911, 0.1885965779458858, 0.10662710543944494, 0.1330107802615952, -0.11544817068274338, 0.009497630597332364, -0.27713819236330595, -0.08393251028427351, -0.1100967405136944, -0.000944061770027726, -0.029541883429745945, -0.1491340964757281, 0.3636444809424849, 0.14908717450343142, 0.1312579637885375, -0.03611446942756269, 0.3487829204012476, 0.09801104423853953, 0.07979758060976581, 0.05567410451348332, 0.3189395120010108, 0.14894233328735443, 0.11678887391975443, -0.17654722984060175, 0.042481743138277635, 0.006539165026232975] |
1,802.02751 | Monopoly pricing with buyer search | In many shopping scenarios, e.g., in online shopping, customers have a large
menu of options to choose from. However, most of the buyers do not browse all
the options and make decision after considering only a small part of the menu.
To study such buyer's behavior we consider the standard Bayesian monopoly
problem for a unit-demand buyer, where the monopolist displays the menu
dynamically page after a page to the buyer. The seller aims to maximize the
expected revenue over the distribution of buyer's values which we assume are
i.i.d. The buyer incurs a fixed cost for browsing through one menu page and
would stop if that cost exceeds the increase in her utility. We observe that
the optimal posted price mechanism in our dynamic setting may have quite
different structure than in the classic static scenario. We find a (relatively)
simple and approximately optimal mechanism, that uses part of the items as a
"bait" to keep the buyer interested for multiple rounds with low prices, while
at the same time showing many other expensive items.
| cs.GT | in many shopping scenarios eg in online shopping customers have a large menu of options to choose from however most of the buyers do not browse all the options and make decision after considering only a small part of the menu to study such buyers behavior we consider the standard bayesian monopoly problem for a unitdemand buyer where the monopolist displays the menu dynamically page after a page to the buyer the seller aims to maximize the expected revenue over the distribution of buyers values which we assume are iid the buyer incurs a fixed cost for browsing through one menu page and would stop if that cost exceeds the increase in her utility we observe that the optimal posted price mechanism in our dynamic setting may have quite different structure than in the classic static scenario we find a relatively simple and approximately optimal mechanism that uses part of the items as a bait to keep the buyer interested for multiple rounds with low prices while at the same time showing many other expensive items | [['in', 'many', 'shopping', 'scenarios', 'eg', 'in', 'online', 'shopping', 'customers', 'have', 'a', 'large', 'menu', 'of', 'options', 'to', 'choose', 'from', 'however', 'most', 'of', 'the', 'buyers', 'do', 'not', 'browse', 'all', 'the', 'options', 'and', 'make', 'decision', 'after', 'considering', 'only', 'a', 'small', 'part', 'of', 'the', 'menu', 'to', 'study', 'such', 'buyers', 'behavior', 'we', 'consider', 'the', 'standard', 'bayesian', 'monopoly', 'problem', 'for', 'a', 'unitdemand', 'buyer', 'where', 'the', 'monopolist', 'displays', 'the', 'menu', 'dynamically', 'page', 'after', 'a', 'page', 'to', 'the', 'buyer', 'the', 'seller', 'aims', 'to', 'maximize', 'the', 'expected', 'revenue', 'over', 'the', 'distribution', 'of', 'buyers', 'values', 'which', 'we', 'assume', 'are', 'iid', 'the', 'buyer', 'incurs', 'a', 'fixed', 'cost', 'for', 'browsing', 'through', 'one', 'menu', 'page', 'and', 'would', 'stop', 'if', 'that', 'cost', 'exceeds', 'the', 'increase', 'in', 'her', 'utility', 'we', 'observe', 'that', 'the', 'optimal', 'posted', 'price', 'mechanism', 'in', 'our', 'dynamic', 'setting', 'may', 'have', 'quite', 'different', 'structure', 'than', 'in', 'the', 'classic', 'static', 'scenario', 'we', 'find', 'a', 'relatively', 'simple', 'and', 'approximately', 'optimal', 'mechanism', 'that', 'uses', 'part', 'of', 'the', 'items', 'as', 'a', 'bait', 'to', 'keep', 'the', 'buyer', 'interested', 'for', 'multiple', 'rounds', 'with', 'low', 'prices', 'while', 'at', 'the', 'same', 'time', 'showing', 'many', 'other', 'expensive', 'items']] | [-0.10742674061144829, 0.03975986303571104, -0.03831633203927512, 0.09801763866033236, -0.15184580025908706, -0.2526639846857341, 0.20131079555060502, 0.4309323690831661, -0.3038915300467951, -0.29437726641084405, 0.10077043015718862, -0.3385744210946458, -0.0932457194384452, 0.1290934867898944, -0.1430051578076514, -0.01885978959886746, 0.04514386320674517, 0.0805254924423273, 0.049363758095503064, -0.35594934952149, 0.2878111891014586, 0.048861467655197804, 0.24608033488038927, 0.020540318692589855, 0.09556973434254443, 0.05456812763904137, -0.008797603064026176, -0.02312278280309825, -0.0969588861288354, 0.05496222276798852, 0.3391726705171591, 0.15836315939767784, 0.3981685673656598, -0.41678379390346393, -0.10461460587314585, 0.1530403718377122, 0.08277041368497025, 0.04373559584928444, -0.03819165785005845, -0.1894125638116913, 0.09181192989953244, -0.23863933064488016, -0.040905176026915964, -0.007791671923107721, 0.005793268379585987, 0.022225395359948216, -0.3384584565226925, -0.048088812288783214, -0.02215540909938599, -0.016111159660133788, -0.05261266784112773, -0.12152297950788951, -0.017541051827720366, 0.18403619556656023, 0.139912253538734, -0.049166696528449065, 0.1659486605653497, -0.18262194964402376, -0.16227926600549836, 0.43205803326352243, -0.0368842729516969, -0.1466454794016582, 0.12455952319909226, -0.1294098131792535, -0.12243898946326226, 0.12204897262960333, 0.2082764080312865, 0.11666059758466542, -0.1583510012824263, 0.04549759949093806, -0.10095458920642902, 0.1791941453080984, 0.0939342162243768, 0.031015515250725333, 0.17690687126014382, 0.15730515045685356, 0.14672612784025577, 0.12072505999855242, 0.03348592759522779, -0.13566434003190475, -0.2410729738757337, -0.1477397128143242, -0.16516045182057001, 0.060491941050465604, -0.12575015464550565, -0.1605292534699071, 0.37879184779541736, 0.15466743327256569, 0.21171791005921972, 0.118258854735855, 0.3065375763690099, 0.06281670974832113, 0.0450635309653907, 0.16106709534307645, 0.15389783488882874, -0.1377126355261928, 0.1922688935175591, -0.12216523654602827, 0.2172804467992881, -0.013139337990485894] |
1,802.02752 | Degree bound of P\'olya Positivstellenstaz | P\'olya's Positivstellensatz on the $1$-simplex says that if $P(x)$ is a real
polynomial such that $P(x)>0$ whenever $x \ge 0$, then all the coefficients of
$(1+x)^mP(x)$ are positive whenever $m$ is large. Powers-Reznick gave a
complexity estimate for P\'olya's Positivstellensatz. Namely, they proved that,
for such $P(x)$ of degree $d$, all the coefficients of $(1+x)^mP(x)$ are
positive whenever $m > \frac{1}{2} (d^2 -d) \frac{L(P)}{\lambda(P)} - d$. where
$\frac{L(P)}{\lambda(P)}$ is an invariant of $P(x)$. For $d=3$ and $d=4$
specifically, we improve Powers-Reznick's bound by showing $m > \frac{3}{2}
\frac{L(P)}{\lambda(P)} - 1$ for $d=3$ and $ m > \frac{4232}{2505}
\frac{L(P)}{\lambda(P)} - 1$ for $d=4$.
| math.AG | polyas positivstellensatz on the 1simplex says that if px is a real polynomial such that px0 whenever x ge 0 then all the coefficients of 1xmpx are positive whenever m is large powersreznick gave a complexity estimate for polyas positivstellensatz namely they proved that for such px of degree d all the coefficients of 1xmpx are positive whenever m frac12 d2 d fraclplambdap d where fraclplambdap is an invariant of px for d3 and d4 specifically we improve powersreznicks bound by showing m frac32 fraclplambdap 1 for d3 and m frac42322505 fraclplambdap 1 for d4 | [['polyas', 'positivstellensatz', 'on', 'the', '1simplex', 'says', 'that', 'if', 'px', 'is', 'a', 'real', 'polynomial', 'such', 'that', 'px0', 'whenever', 'x', 'ge', '0', 'then', 'all', 'the', 'coefficients', 'of', '1xmpx', 'are', 'positive', 'whenever', 'm', 'is', 'large', 'powersreznick', 'gave', 'a', 'complexity', 'estimate', 'for', 'polyas', 'positivstellensatz', 'namely', 'they', 'proved', 'that', 'for', 'such', 'px', 'of', 'degree', 'd', 'all', 'the', 'coefficients', 'of', '1xmpx', 'are', 'positive', 'whenever', 'm', 'frac12', 'd2', 'd', 'fraclplambdap', 'd', 'where', 'fraclplambdap', 'is', 'an', 'invariant', 'of', 'px', 'for', 'd3', 'and', 'd4', 'specifically', 'we', 'improve', 'powersreznicks', 'bound', 'by', 'showing', 'm', 'frac32', 'fraclplambdap', '1', 'for', 'd3', 'and', 'm', 'frac42322505', 'fraclplambdap', '1', 'for', 'd4']] | [-0.16253514000111155, 0.14992959759757568, -0.011042112629446718, 0.046694488743216626, 0.009113116950417558, -0.2926739140827623, -0.029857049302922354, 0.27016375184886987, -0.20913251839164232, -0.21780821075145568, 0.09894907167181373, -0.3186306423611111, -0.16879301302251407, 0.1754375655721459, -0.043420654804342325, 0.02390980414735774, -0.03122644886477954, 0.11600310256083807, -0.04680090245350988, -0.3592533479341202, 0.3136706600198522, -0.09738198928534984, 0.13541882194371688, 0.08188984712792767, 0.11106486621105836, 0.016960714384913443, 0.053399779598435594, -0.03238313709282213, -0.20040978405280233, 0.06279049975176652, 0.22178855451444784, 0.16255090323069857, 0.20926307299070887, -0.29837497456206213, -0.10971494913101196, 0.16898686676803562, 0.1536387243308127, -0.028978006831473776, 0.022125897757036404, -0.20647555771801207, 0.22840302675548527, -0.0894880200517946, -0.15153361343157787, -0.0808549691302081, 0.21796044509650933, -0.013233243508471383, -0.40757046043872835, 0.031749770811034576, 0.16392848231933183, 0.0654932789142347, 0.003427555606079598, -0.24296790619070333, -0.044666746684298334, 0.05302027221769094, -0.019829524202375777, 0.13179463889812015, -0.011540932507098962, -0.07251969897705647, -0.0893322439204591, 0.31250698075940214, -0.08280110321938991, -0.24760020116551054, 0.12518115067958005, -0.2116621301198999, -0.1740967778178553, 0.10320660190449821, 0.03974519739341405, 0.16070560863655475, 0.005267911104278432, 0.2685062866541557, -0.1296044271128873, 0.1659511911889745, 0.1367620176428722, 0.005465400806214247, 0.05583550840512746, 0.01927589796897438, 0.11143258311009656, 0.05647010579187837, -0.0130330201316004, 0.00746263813537856, -0.3256612520044049, -0.22083831850969646, -0.2659119302743218, 0.19692842731666232, -0.18498910162565557, -0.08522228848370206, 0.23196126871431869, 0.01588269284305473, 0.2171227882254041, 0.1378476589400735, 0.16601976941132712, 0.09427894300056829, -0.04946736369488968, 0.14262867741183274, 0.11338413851335645, 0.12055683026555926, 0.005130014594437348, -0.1354718544572178, 0.027601141306675143, 0.14927817498230272] |
1,802.02753 | Ground states and concentration of mass in stationary Mean Field Games
with superlinear Hamiltonians | In this paper we provide the existence of classical solutions to stationary
mean field game systems in the whole space $\mathbb{R}^N$, with coercive
potential, aggregating local coupling, and under general conditions on the
Hamiltonian, completing the analysis started in the companion paper [6]. The
only structural assumption we make is on the growth at infinity of the coupling
term in terms of the growth of the Hamiltonian. This result is obtained using a
variational approach based on the analysis of the non-convex energy associated
to the system. Finally, we show that in the vanishing viscosity limit mass
concentrates around the flattest minima of the potential, and that the
asymptotic shape of the solutions in a suitable rescaled setting converges to a
ground state, i.e. a classical solution to a mean field game system without
potential.
| math.AP | in this paper we provide the existence of classical solutions to stationary mean field game systems in the whole space mathbbrn with coercive potential aggregating local coupling and under general conditions on the hamiltonian completing the analysis started in the companion paper 6 the only structural assumption we make is on the growth at infinity of the coupling term in terms of the growth of the hamiltonian this result is obtained using a variational approach based on the analysis of the nonconvex energy associated to the system finally we show that in the vanishing viscosity limit mass concentrates around the flattest minima of the potential and that the asymptotic shape of the solutions in a suitable rescaled setting converges to a ground state ie a classical solution to a mean field game system without potential | [['in', 'this', 'paper', 'we', 'provide', 'the', 'existence', 'of', 'classical', 'solutions', 'to', 'stationary', 'mean', 'field', 'game', 'systems', 'in', 'the', 'whole', 'space', 'mathbbrn', 'with', 'coercive', 'potential', 'aggregating', 'local', 'coupling', 'and', 'under', 'general', 'conditions', 'on', 'the', 'hamiltonian', 'completing', 'the', 'analysis', 'started', 'in', 'the', 'companion', 'paper', '6', 'the', 'only', 'structural', 'assumption', 'we', 'make', 'is', 'on', 'the', 'growth', 'at', 'infinity', 'of', 'the', 'coupling', 'term', 'in', 'terms', 'of', 'the', 'growth', 'of', 'the', 'hamiltonian', 'this', 'result', 'is', 'obtained', 'using', 'a', 'variational', 'approach', 'based', 'on', 'the', 'analysis', 'of', 'the', 'nonconvex', 'energy', 'associated', 'to', 'the', 'system', 'finally', 'we', 'show', 'that', 'in', 'the', 'vanishing', 'viscosity', 'limit', 'mass', 'concentrates', 'around', 'the', 'flattest', 'minima', 'of', 'the', 'potential', 'and', 'that', 'the', 'asymptotic', 'shape', 'of', 'the', 'solutions', 'in', 'a', 'suitable', 'rescaled', 'setting', 'converges', 'to', 'a', 'ground', 'state', 'ie', 'a', 'classical', 'solution', 'to', 'a', 'mean', 'field', 'game', 'system', 'without', 'potential']] | [-0.15288209212185055, 0.03796108141886415, -0.10940146448125165, 0.03935013821227821, -0.027588790336071894, -0.07419607104319666, 0.056279303014485374, 0.30618169996887445, -0.25607021080536974, -0.2618745542252091, 0.1268334419414815, -0.2696839519603937, -0.14993101581931115, 0.14070501274394767, -0.058630565344356, 0.05678193931364351, 0.07683253045090371, 0.0908063062279123, -0.07388379970841386, -0.2375898519479152, 0.3654037515115407, 0.014979711920022964, 0.2501906592226415, 0.05114235911406232, 0.09725960496752695, 0.013445959955936782, 0.05938065520539466, 0.04320083305701027, -0.15955317266408303, 0.11435846930576696, 0.15734835400039124, 0.08586595916292733, 0.32315262104902004, -0.40153919118973946, -0.18800336568167916, 0.12670230144220923, 0.13402911871671677, 0.10842394358650953, -0.04179524339959715, -0.2671154170193606, 0.08882023833554101, -0.12157430052067394, -0.18914972709284888, -0.05205886494713249, -0.018458189554857434, 0.04261073333952852, -0.28929875669655974, 0.0898398548019705, 0.07596282722531922, 0.04463158770705815, -0.15359139798071098, -0.07710498625119389, -0.012590348517901643, 0.10331069763611864, 0.08396884720013649, 0.04498086501499293, 0.09961841852162723, -0.14784876902898153, -0.04553544751747891, 0.3498630881999378, -0.12714348952329063, -0.21405062505595937, 0.18138821777128786, -0.14852436339758612, -0.11914096812338189, 0.11517092417235728, 0.1748619176240431, 0.14640697312230866, -0.15788596359392007, 0.14452166347505732, -0.020767379484863745, 0.1463566872601708, 0.049082819379314226, 0.003957558008066068, 0.161731355185448, 0.16525669382471178, 0.14876117795981741, 0.1415464517005064, -0.06379518607088054, -0.15221399211290257, -0.33470238356816545, -0.15306154502624714, -0.20548134335592666, 0.08723298357627182, -0.10602174992479073, -0.17728804092578315, 0.41721101664351645, 0.15253324956995332, 0.18835400360877866, 0.09215271394113424, 0.2512896767774321, 0.1560205764999544, 0.02085004019447499, 0.07731205064855103, 0.2607203992842524, 0.131337715714687, 0.13924735673806735, -0.23451149606283891, 0.022570000854493292, 0.07933978047911767] |
1,802.02754 | Some application of difference equations in Cryptography and Coding
Theory | In this paper, we present some applications of a difference equation of
degree k in Cryptography and Coding Theory.
| cs.IT cs.CR math.IT math.RA | in this paper we present some applications of a difference equation of degree k in cryptography and coding theory | [['in', 'this', 'paper', 'we', 'present', 'some', 'applications', 'of', 'a', 'difference', 'equation', 'of', 'degree', 'k', 'in', 'cryptography', 'and', 'coding', 'theory']] | [-0.22868688519749986, 0.03497700878467999, -0.15475646278967983, -0.010700385459992839, 0.0017681790417746494, -0.14938312158674785, 0.07048043845172383, 0.34522124232822343, -0.3269060689367746, -0.26101406879330935, 0.07613901344225987, -0.2652636788246271, -0.2942611069271439, 0.15014193932476796, -0.1621532742130129, 0.039368326530644766, -0.020335450964538676, 0.05065246681241613, -0.09142780877453716, -0.2875228208538733, 0.32685425095750315, -0.054254452599898764, 0.21226414101884553, 0.11086739217372317, 0.07307964019281299, 0.004572537335518159, -0.020067430591504825, -0.005446256873639007, -0.19714722150054417, 0.25461559732885736, 0.35474139687262085, 0.15105113161629752, 0.30548348709156636, -0.3419537531506074, -0.2613661445579247, 0.09929221049931489, 0.1387730486887066, 0.1630966969226536, -0.15449760785620464, -0.15071277947802292, 0.10286055588604588, -0.19089034525141438, -0.1188005110935161, -0.011160799351177718, 0.04402188177367574, 0.03300290054788715, -0.20649758049924122, 0.07044450855372768, 0.0677302150349868, 0.1714268087066318, 0.0004893585451339421, -0.10514117738133982, 0.14010616431110784, 0.04699569273936121, 0.005855569713994076, 0.04279504549738608, -0.023792442694110304, -0.18972930022343798, -0.1411838388364566, 0.381333357507461, -0.05572615916791715, -0.16186919131953464, 0.09011136461049318, -0.10569674364830318, -0.2215143122073067, 0.0371481957600305, 0.26028380386139216, 0.1871921208344008, -0.11255509087717847, 0.14820606449900783, -0.04279251690757902, 0.21733349189162254, 0.12381915767726145, 0.10155365444523723, 0.08252098430928431, 0.11518811297259833, 0.03952899060555195, 0.16352686153626755, -0.01269767031465706, -0.10532023042048279, -0.3770292840505901, -0.2066000994098814, -0.16466164951653858, 0.06430346126619138, -0.08584513012733384, -0.1318324835676896, 0.39707663459213155, 0.2144071765636143, 0.12357320479656521, 0.02259540562763026, 0.301442383935577, 0.10241713247408993, -0.0557510834677439, 0.11521217398541539, 0.13437199463461233, 0.25216910850844887, 0.1414442926057075, -0.14742752605755077, 0.012469983071480928, 0.043087027795416746] |
1,802.02755 | Nonlinear diffusion equations with Robin boundary conditions as
asymptotic limits of Cahn-Hilliard systems | Condition imposed on the nonlinear terms of a nonlinear diffusion equation
with {R}obin boundary condition is the main focus of this paper. The degenerate
parabolic equations, such as the {S}tefan problem, the {H}ele--{S}haw problem,
the porous medium equation and the fast diffusion equation, are included in
this class. By characterizing this class of equations as an asymptotic limit of
the {C}ahn--{H}illiard systems, the growth condition of the nonlinear term can
be improved. In this paper, the existence and uniqueness of the solution are
proved. From the physical view point, it is natural that, the
{C}ahn--{H}illiard system is treated under the homogeneous {N}eumann boundary
condition. Therefore, the {C}ahn--{H}illiard system subject to the {R}obin
boundary condition looks like pointless. However, at some level of
approximation, it makes sense to characterize the nonlinear diffusion
equations.
| math.AP | condition imposed on the nonlinear terms of a nonlinear diffusion equation with robin boundary condition is the main focus of this paper the degenerate parabolic equations such as the stefan problem the heleshaw problem the porous medium equation and the fast diffusion equation are included in this class by characterizing this class of equations as an asymptotic limit of the cahnhilliard systems the growth condition of the nonlinear term can be improved in this paper the existence and uniqueness of the solution are proved from the physical view point it is natural that the cahnhilliard system is treated under the homogeneous neumann boundary condition therefore the cahnhilliard system subject to the robin boundary condition looks like pointless however at some level of approximation it makes sense to characterize the nonlinear diffusion equations | [['condition', 'imposed', 'on', 'the', 'nonlinear', 'terms', 'of', 'a', 'nonlinear', 'diffusion', 'equation', 'with', 'robin', 'boundary', 'condition', 'is', 'the', 'main', 'focus', 'of', 'this', 'paper', 'the', 'degenerate', 'parabolic', 'equations', 'such', 'as', 'the', 'stefan', 'problem', 'the', 'heleshaw', 'problem', 'the', 'porous', 'medium', 'equation', 'and', 'the', 'fast', 'diffusion', 'equation', 'are', 'included', 'in', 'this', 'class', 'by', 'characterizing', 'this', 'class', 'of', 'equations', 'as', 'an', 'asymptotic', 'limit', 'of', 'the', 'cahnhilliard', 'systems', 'the', 'growth', 'condition', 'of', 'the', 'nonlinear', 'term', 'can', 'be', 'improved', 'in', 'this', 'paper', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'solution', 'are', 'proved', 'from', 'the', 'physical', 'view', 'point', 'it', 'is', 'natural', 'that', 'the', 'cahnhilliard', 'system', 'is', 'treated', 'under', 'the', 'homogeneous', 'neumann', 'boundary', 'condition', 'therefore', 'the', 'cahnhilliard', 'system', 'subject', 'to', 'the', 'robin', 'boundary', 'condition', 'looks', 'like', 'pointless', 'however', 'at', 'some', 'level', 'of', 'approximation', 'it', 'makes', 'sense', 'to', 'characterize', 'the', 'nonlinear', 'diffusion', 'equations']] | [-0.1569835876615605, 0.0719415767121201, -0.07162038582927463, 0.023531377376374705, -0.11152302317151969, -0.1643428940248365, -0.0499765478042801, 0.22881617074811153, -0.341986556904334, -0.2327371685532853, 0.17772310868674662, -0.2643870067585147, -0.16390493012626062, 0.15429515818444392, -0.09385218602520498, 0.12039845069926797, 0.08818691909299091, 0.02502809309358285, -0.03284147804934588, -0.22720173426734452, 0.4052351897187305, -0.01408013349017975, 0.2668579281660531, 0.059599651233204924, 0.11764988325762027, -0.052232706270208866, 0.025916495265185156, 0.02517760167900247, -0.17979009776707133, 0.04292573144299571, 0.20414521849968217, 0.01397063643459908, 0.3182553770585042, -0.44302214088736835, -0.25709727266626997, 0.07709234427293819, 0.116937711841963, 0.09594319047843755, 0.0004063478704527811, -0.2712022565573341, 0.06790543429440621, -0.08528813865797763, -0.2218468671728095, 0.015572909964248538, -0.03589037615650644, 0.032393012616949185, -0.29967755408054497, 0.14391476189661206, 0.11857354202815755, 0.00560099990671557, -0.16927198870954188, -0.05091395395610369, -0.024913298498810917, 0.06483942768395398, 0.05086163211980778, -0.023726913925202098, 0.05096773021487576, -0.16166140475472662, 0.009139296513184849, 0.41460835262004175, -0.06870394602601389, -0.3080531260242093, 0.1832970897561278, -0.10933869828427718, -0.09037545311024808, 0.10301863090276267, 0.15019664712158512, 0.15921437631495242, -0.23100173129051021, 0.13309149168851558, -0.0681447712184198, 0.09969443873838331, 0.09971613768544613, -0.009818301504393194, 0.07984026734519636, 0.20094168172782342, 0.1454770063388754, 0.1649346568499988, 0.004050804736008021, -0.12467930912548168, -0.3660223310333536, -0.15681177879874172, -0.15033430061091416, 0.08734473327322947, -0.08876531531617123, -0.23271395384588026, 0.32664889349005977, 0.12635843559859716, 0.12557062928593068, 0.025789368804191436, 0.2361921566348015, 0.23546619428794435, -0.025071513451014955, 0.06835054576544225, 0.2089963360898158, 0.18618472360046298, 0.18614132558595334, -0.27292454800970684, 0.08608377309318518, 0.15272097934432555] |
1,802.02756 | Slow-roll Analysis of Double Field Axion Inflation | We adopt the double field natural inflation model motivated by the
non-perturbative effects of supergravity and superstring theory to do the slow
roll analysis. We show that when the parameters are suitably chosen, there
exist ranges of initial values of fields that can satisfy the constraints of
Planck observations. This implies less fine tuning of field values can be
allowed with tolerance of $4 {M}_{\text{pl}}$ for ${\phi}_{1}$ and $5
{M}_{\text{pl}}$ for ${\phi}_{2}$ respectively, which become more physical for
field fluctuation in quantum era. We also show that the spectral index
${n}_{\mathcal{RR}}$, the fraction of entropic power spectrum and the fraction
of power spectra (so-called ${\beta}_{\text{iso}}$) and $\cos{\Delta}$ can
satisfy the constraints of Planck observation. This implies that double field
natural inflation is a valid model to describe cosmological inflation.
| gr-qc | we adopt the double field natural inflation model motivated by the nonperturbative effects of supergravity and superstring theory to do the slow roll analysis we show that when the parameters are suitably chosen there exist ranges of initial values of fields that can satisfy the constraints of planck observations this implies less fine tuning of field values can be allowed with tolerance of 4 m_textpl for phi_1 and 5 m_textpl for phi_2 respectively which become more physical for field fluctuation in quantum era we also show that the spectral index n_mathcalrr the fraction of entropic power spectrum and the fraction of power spectra socalled beta_textiso and cosdelta can satisfy the constraints of planck observation this implies that double field natural inflation is a valid model to describe cosmological inflation | [['we', 'adopt', 'the', 'double', 'field', 'natural', 'inflation', 'model', 'motivated', 'by', 'the', 'nonperturbative', 'effects', 'of', 'supergravity', 'and', 'superstring', 'theory', 'to', 'do', 'the', 'slow', 'roll', 'analysis', 'we', 'show', 'that', 'when', 'the', 'parameters', 'are', 'suitably', 'chosen', 'there', 'exist', 'ranges', 'of', 'initial', 'values', 'of', 'fields', 'that', 'can', 'satisfy', 'the', 'constraints', 'of', 'planck', 'observations', 'this', 'implies', 'less', 'fine', 'tuning', 'of', 'field', 'values', 'can', 'be', 'allowed', 'with', 'tolerance', 'of', '4', 'm_textpl', 'for', 'phi_1', 'and', '5', 'm_textpl', 'for', 'phi_2', 'respectively', 'which', 'become', 'more', 'physical', 'for', 'field', 'fluctuation', 'in', 'quantum', 'era', 'we', 'also', 'show', 'that', 'the', 'spectral', 'index', 'n_mathcalrr', 'the', 'fraction', 'of', 'entropic', 'power', 'spectrum', 'and', 'the', 'fraction', 'of', 'power', 'spectra', 'socalled', 'beta_textiso', 'and', 'cosdelta', 'can', 'satisfy', 'the', 'constraints', 'of', 'planck', 'observation', 'this', 'implies', 'that', 'double', 'field', 'natural', 'inflation', 'is', 'a', 'valid', 'model', 'to', 'describe', 'cosmological', 'inflation']] | [-0.14529648219972233, 0.2187555455382708, -0.09275348595981522, 0.09443192392510663, -0.07962773380962414, -0.14806239523624223, 0.00756437528794118, 0.3243091857449452, -0.23487122059895063, -0.32438261758565434, 0.09010475111930946, -0.2076720627626096, -0.10062752683522312, 0.2149427930602628, -0.04856366675171092, 0.023093801708827823, 0.026691861223341443, 0.011750407480290086, -0.03638384510638324, -0.2391986423978714, 0.3177181804785505, 0.06539776457352638, 0.2164661541762652, 0.022703165432491422, 0.07030252065494891, -0.033788917170962184, 0.01811233316878165, 0.043590570499343194, -0.18258335349066587, 0.08988962082676297, 0.16963258712721152, 0.14752016132459134, 0.1993799533357653, -0.39731580752688717, -0.2199353594699596, 0.1628320296844981, 0.1246682048195929, 0.09016668433818496, -0.01584885280815826, -0.2089067030052735, 0.1066586554681105, -0.1552105386462796, -0.1067975827888769, -0.10174936657463472, 0.011238389435832895, -0.02234394615149404, -0.33427995657841636, 0.09828204664701456, 0.003688007432740094, 0.007798199541866779, -0.05365999320551284, -0.10119713227609246, -0.03579442942969677, 0.06660418570207571, 0.0934874151584025, 0.02379166195719085, 0.1392991321865381, -0.16618529803992257, -0.06037955614371504, 0.38011298134306987, -0.10257287345291298, -0.13519858077579128, 0.07136199381349125, -0.18123989510276597, -0.19423852134569305, 0.0906146152538988, 0.085113023922918, 0.055020218135745036, -0.09698489005001368, 0.16904673747916332, 0.018077984161667643, 0.2265232412775201, 0.08984607813960513, 0.052121787676661036, 0.24851253493799, 0.07195980846698535, 0.06317269848797133, 0.08132695917344439, -0.07667674882498783, -0.0942176520223106, -0.3765162677306125, -0.0891071200681535, -0.13228591625930697, 0.09051742408824277, -0.1515045975088362, -0.15132174225832065, 0.37038011348065664, 0.16768485513391104, 0.22291944641986583, 0.08029987578056606, 0.22416667551843553, 0.13426172647324544, 0.06748216968821728, 0.04158331419333933, 0.3150820495546099, 0.12150789510759372, 0.08439702780983287, -0.1888155708979544, -0.03503687051674864, 0.011559765549435273] |
1,802.02757 | Memory-induced complex contagion in epidemic spreading | Albeit epidemic models have evolved into powerful predictive tools for the
spread of diseases and opinions, most assume memoryless agents and independent
transmission channels. We develop an infection mechanism that is endowed with
memory of past exposures and simultaneously incorporates the joint effect of
multiple infectious sources. Analytic equations and simulations of the
susceptible-infected-susceptible model in unstructured substrates reveal the
emergence of an additional phase that separates the usual healthy and endemic
ones. This intermediate phase shows fundamentally distinct characteristics, and
the system exhibits either excitability or an exotic variant of bistability.
Moreover, the transition to endemicity presents hybrid aspects. These features
are the product of an intricate balance between two memory modes and indicate
that non-Markovian effects significantly alter the properties of spreading
processes.
| physics.soc-ph q-bio.PE | albeit epidemic models have evolved into powerful predictive tools for the spread of diseases and opinions most assume memoryless agents and independent transmission channels we develop an infection mechanism that is endowed with memory of past exposures and simultaneously incorporates the joint effect of multiple infectious sources analytic equations and simulations of the susceptibleinfectedsusceptible model in unstructured substrates reveal the emergence of an additional phase that separates the usual healthy and endemic ones this intermediate phase shows fundamentally distinct characteristics and the system exhibits either excitability or an exotic variant of bistability moreover the transition to endemicity presents hybrid aspects these features are the product of an intricate balance between two memory modes and indicate that nonmarkovian effects significantly alter the properties of spreading processes | [['albeit', 'epidemic', 'models', 'have', 'evolved', 'into', 'powerful', 'predictive', 'tools', 'for', 'the', 'spread', 'of', 'diseases', 'and', 'opinions', 'most', 'assume', 'memoryless', 'agents', 'and', 'independent', 'transmission', 'channels', 'we', 'develop', 'an', 'infection', 'mechanism', 'that', 'is', 'endowed', 'with', 'memory', 'of', 'past', 'exposures', 'and', 'simultaneously', 'incorporates', 'the', 'joint', 'effect', 'of', 'multiple', 'infectious', 'sources', 'analytic', 'equations', 'and', 'simulations', 'of', 'the', 'susceptibleinfectedsusceptible', 'model', 'in', 'unstructured', 'substrates', 'reveal', 'the', 'emergence', 'of', 'an', 'additional', 'phase', 'that', 'separates', 'the', 'usual', 'healthy', 'and', 'endemic', 'ones', 'this', 'intermediate', 'phase', 'shows', 'fundamentally', 'distinct', 'characteristics', 'and', 'the', 'system', 'exhibits', 'either', 'excitability', 'or', 'an', 'exotic', 'variant', 'of', 'bistability', 'moreover', 'the', 'transition', 'to', 'endemicity', 'presents', 'hybrid', 'aspects', 'these', 'features', 'are', 'the', 'product', 'of', 'an', 'intricate', 'balance', 'between', 'two', 'memory', 'modes', 'and', 'indicate', 'that', 'nonmarkovian', 'effects', 'significantly', 'alter', 'the', 'properties', 'of', 'spreading', 'processes']] | [-0.16040416135638952, 0.1472736901664175, -0.11694429557956755, 0.07615929789398797, -0.057131328344345096, -0.20937195537239314, 0.06701679137349129, 0.3704913999736309, -0.27041059408057483, -0.24710585229843854, 0.059663440988981166, -0.30320914690196515, -0.21286288260109723, 0.1379519068636, -0.04715893006324768, -0.03410343239363283, 0.0575910311229527, -0.01402140404144302, 0.019766916805878283, -0.19606320205813974, 0.339109730400145, 0.028899270223453642, 0.3077485688822344, 0.005160701040178538, 0.11892306738346815, -0.013118815729394556, -0.025564127787947654, -0.023989575155079365, -0.11389087785215815, 0.040078305780887606, 0.24625048533212976, 0.1264395696245483, 0.26888446540385486, -0.4872294314876199, -0.29963731235451996, 0.10104576950706541, 0.17271098494902254, 0.11126005862466991, -0.015131748910993338, -0.29116759934276343, 0.01653343477845192, -0.17233587320148944, -0.10518282044446096, -0.0544776301458478, -0.0038302787952125073, 0.029489214166998862, -0.28474078586325047, 0.0982679578177631, 0.061482371916994454, 0.07164574135839939, -0.06414335488714278, -0.11492191872280091, -0.049424182159826156, 0.17925853106658907, 0.049757472180761396, -0.07059443511813879, 0.14755328312143684, -0.15781507584266363, -0.14766854614019395, 0.3056017373725772, -0.007941452006809414, -0.1568516203938052, 0.2269323917403817, -0.10013684564083815, -0.09469921381771565, 0.1681881918646395, 0.19799391497299076, 0.06625488128513098, -0.16689575438946486, -0.007744458203669638, 0.039145953387022016, 0.19505469352705404, -0.004808452498167753, 0.0908006246946752, 0.18455173053219914, 0.21470556749403477, 0.02510215495713055, 0.12221837738249451, -0.0664693208038807, -0.1923394102305174, -0.22225413911463693, -0.11174373675324023, -0.07215711930207908, 0.04020571297779679, -0.13767499596544075, -0.19739044242957607, 0.40913133971020577, 0.15266281278431415, 0.15534797647595405, 0.05123496588878334, 0.268967067476362, 0.06365579268336297, 0.038225650634616616, 0.08519790131226182, 0.19860084665566682, 0.09375552892126143, 0.07919964158535003, -0.2466785013973713, 0.17634135615825652, -0.029166722418973223] |
1,802.02758 | Low current Hall Effect Sensor | Many modern electronic devices utilize linear Hall sensors to measure current
and the magnetic field, as well as to perform switching and latching
operations. Smartphones, laptops, and e-readers all work with very low (sub-mA)
currents. To perform a switching function in such low-power devices, however, a
Hall sensor must be able to work in the {\mu}A regime. This paper demonstrates,
for the first time, the ability of a standard Hall detector to work in the
{\mu}A regime between 0 and 0.7 Tesla. A second important application of this
technology is the measurement of electron transport parameters in thin films,
which is essential to elucidating their electronic behavior. The development of
new devices using thin films demands very precise measurements of tiny
electrical currents, low-intensity magnetic fields, and other small signals.
The proposed system delivers a very small but stable electric current without
external noise, and can be used to measure small transport parameters with very
high precision. We demonstrate the capabilities of this system by measuring the
slope of the Hall effect with a four-point probe at current intensities of 100,
10, and 1 {\mu}A.
| physics.ins-det | many modern electronic devices utilize linear hall sensors to measure current and the magnetic field as well as to perform switching and latching operations smartphones laptops and ereaders all work with very low subma currents to perform a switching function in such lowpower devices however a hall sensor must be able to work in the mua regime this paper demonstrates for the first time the ability of a standard hall detector to work in the mua regime between 0 and 07 tesla a second important application of this technology is the measurement of electron transport parameters in thin films which is essential to elucidating their electronic behavior the development of new devices using thin films demands very precise measurements of tiny electrical currents lowintensity magnetic fields and other small signals the proposed system delivers a very small but stable electric current without external noise and can be used to measure small transport parameters with very high precision we demonstrate the capabilities of this system by measuring the slope of the hall effect with a fourpoint probe at current intensities of 100 10 and 1 mua | [['many', 'modern', 'electronic', 'devices', 'utilize', 'linear', 'hall', 'sensors', 'to', 'measure', 'current', 'and', 'the', 'magnetic', 'field', 'as', 'well', 'as', 'to', 'perform', 'switching', 'and', 'latching', 'operations', 'smartphones', 'laptops', 'and', 'ereaders', 'all', 'work', 'with', 'very', 'low', 'subma', 'currents', 'to', 'perform', 'a', 'switching', 'function', 'in', 'such', 'lowpower', 'devices', 'however', 'a', 'hall', 'sensor', 'must', 'be', 'able', 'to', 'work', 'in', 'the', 'mua', 'regime', 'this', 'paper', 'demonstrates', 'for', 'the', 'first', 'time', 'the', 'ability', 'of', 'a', 'standard', 'hall', 'detector', 'to', 'work', 'in', 'the', 'mua', 'regime', 'between', '0', 'and', '07', 'tesla', 'a', 'second', 'important', 'application', 'of', 'this', 'technology', 'is', 'the', 'measurement', 'of', 'electron', 'transport', 'parameters', 'in', 'thin', 'films', 'which', 'is', 'essential', 'to', 'elucidating', 'their', 'electronic', 'behavior', 'the', 'development', 'of', 'new', 'devices', 'using', 'thin', 'films', 'demands', 'very', 'precise', 'measurements', 'of', 'tiny', 'electrical', 'currents', 'lowintensity', 'magnetic', 'fields', 'and', 'other', 'small', 'signals', 'the', 'proposed', 'system', 'delivers', 'a', 'very', 'small', 'but', 'stable', 'electric', 'current', 'without', 'external', 'noise', 'and', 'can', 'be', 'used', 'to', 'measure', 'small', 'transport', 'parameters', 'with', 'very', 'high', 'precision', 'we', 'demonstrate', 'the', 'capabilities', 'of', 'this', 'system', 'by', 'measuring', 'the', 'slope', 'of', 'the', 'hall', 'effect', 'with', 'a', 'fourpoint', 'probe', 'at', 'current', 'intensities', 'of', '100', '10', 'and', '1', 'mua']] | [-0.1579434775112136, 0.16086181341138991, -0.02855457132302589, -0.006983775524650296, -0.05593540434568675, -0.16923282396696185, 0.056396235803612915, 0.3732711705733496, -0.27305853185142676, -0.3713043954466348, 0.08557816835135505, -0.2663601034665075, -0.10513953093386194, 0.25734023912556714, -0.044660088694755636, 0.08478352297401137, 0.0034874073026003316, -0.029445631900275854, -0.04485751805148776, -0.18262300028784564, 0.2303289338723635, 0.07772423043270069, 0.3257697055966634, 0.07519512158393374, 0.11523667100039386, -0.033296119672266526, 0.05057282865037332, 0.03986895346442116, -0.0775544328498654, 0.08275366515305865, 0.2792917062177604, -0.018880863022312278, 0.2362053239940787, -0.4807741410787339, -0.17133712158070208, 0.05521991751764132, 0.09520583364317882, 0.10291012808991819, -0.07090644322781135, -0.25148124008125666, 0.12056001172522487, -0.17604244338935646, -0.10781580221729477, -0.11382239553874926, 0.025290138179907048, 0.023243873978018477, -0.26473939984988765, 0.03132883267497401, 0.023151419898646924, 0.06617759540930147, -0.030392280431086598, -0.10146993881916506, 0.01415712200990959, 0.1466775928224113, 0.0327325590719145, 0.05601353720134205, 0.22489030523296527, -0.18471548710975028, -0.12674398878690504, 0.3297056378290543, -0.07988405863136944, -0.1384110694811882, 0.19020032276444987, -0.2196787759116294, -0.07572936695499305, 0.09170099080327655, 0.17195287250670727, 0.11155979944210824, -0.16452079547731124, 0.052414120994755016, 0.05436624607587557, 0.1832896071946775, 0.02539356122455818, 0.09917060872185571, 0.21993536427844843, 0.22322257969062775, 0.07324121833754242, 0.09902628559686254, -0.15118126901317105, 0.02496578640673998, -0.24152902094995268, -0.1721917706574617, -0.18721821830853436, 0.11159882034078929, -0.041591639759012054, -0.15352569835301003, 0.3996753366284437, 0.20677752217085546, 0.19006589991761796, -0.0032782222709932325, 0.3658590186184839, 0.10858109368216348, 0.10838176079256379, 0.05025517528006078, 0.2527141874154989, 0.15986343142930823, 0.18738443226032794, -0.20929100526051986, 0.0643103512449433, -0.07063429340791039] |
1,802.02759 | Decipher the Three-Dimensional Magnetic Topology of a Great Solar Flare | Three-dimensional magnetic topology of solar flare plays a crucial role in
understanding its explosive release of magnetic energy in the corona. However,
such three-dimensional coronal magnetic field is still elusive in direct
observation. Here we realistically simulate the magnetic evolution during the
eruptive process of a great flare, using a numerical magnetohydrodynamic model
constrained by observed solar vector magnetogram. The numerical results reveal
that the pre-flare corona contains multi-set twisted magnetic flux, which forms
a coherent rope during the eruption. The rising flux rope is wrapped by a
quasi-separatrix layer, which intersects itself below the rope, forming a
hyperbolic flux tube and magnetic reconnection is triggered there. By tracing
the footprint of the newly-reconnected field lines, we reproduce both the
spatial location and its temporal evolution of flare ribbons with an expected
accuracy in comparison of observed images. This scenario strongly confirms the
three-dimensional version of standard flare model.
| astro-ph.SR | threedimensional magnetic topology of solar flare plays a crucial role in understanding its explosive release of magnetic energy in the corona however such threedimensional coronal magnetic field is still elusive in direct observation here we realistically simulate the magnetic evolution during the eruptive process of a great flare using a numerical magnetohydrodynamic model constrained by observed solar vector magnetogram the numerical results reveal that the preflare corona contains multiset twisted magnetic flux which forms a coherent rope during the eruption the rising flux rope is wrapped by a quasiseparatrix layer which intersects itself below the rope forming a hyperbolic flux tube and magnetic reconnection is triggered there by tracing the footprint of the newlyreconnected field lines we reproduce both the spatial location and its temporal evolution of flare ribbons with an expected accuracy in comparison of observed images this scenario strongly confirms the threedimensional version of standard flare model | [['threedimensional', 'magnetic', 'topology', 'of', 'solar', 'flare', 'plays', 'a', 'crucial', 'role', 'in', 'understanding', 'its', 'explosive', 'release', 'of', 'magnetic', 'energy', 'in', 'the', 'corona', 'however', 'such', 'threedimensional', 'coronal', 'magnetic', 'field', 'is', 'still', 'elusive', 'in', 'direct', 'observation', 'here', 'we', 'realistically', 'simulate', 'the', 'magnetic', 'evolution', 'during', 'the', 'eruptive', 'process', 'of', 'a', 'great', 'flare', 'using', 'a', 'numerical', 'magnetohydrodynamic', 'model', 'constrained', 'by', 'observed', 'solar', 'vector', 'magnetogram', 'the', 'numerical', 'results', 'reveal', 'that', 'the', 'preflare', 'corona', 'contains', 'multiset', 'twisted', 'magnetic', 'flux', 'which', 'forms', 'a', 'coherent', 'rope', 'during', 'the', 'eruption', 'the', 'rising', 'flux', 'rope', 'is', 'wrapped', 'by', 'a', 'quasiseparatrix', 'layer', 'which', 'intersects', 'itself', 'below', 'the', 'rope', 'forming', 'a', 'hyperbolic', 'flux', 'tube', 'and', 'magnetic', 'reconnection', 'is', 'triggered', 'there', 'by', 'tracing', 'the', 'footprint', 'of', 'the', 'newlyreconnected', 'field', 'lines', 'we', 'reproduce', 'both', 'the', 'spatial', 'location', 'and', 'its', 'temporal', 'evolution', 'of', 'flare', 'ribbons', 'with', 'an', 'expected', 'accuracy', 'in', 'comparison', 'of', 'observed', 'images', 'this', 'scenario', 'strongly', 'confirms', 'the', 'threedimensional', 'version', 'of', 'standard', 'flare', 'model']] | [-0.15387331830000117, 0.19229386012031205, 0.04737724580383241, 0.12798457941860628, -0.06834667459155289, -0.032107152526060605, 0.0003960782868300108, 0.44076017225348707, -0.2001184723121208, -0.3750423832652753, 0.06361418114521934, -0.19931147911042074, -0.1253073385668291, 0.2062739999871076, -0.0204471431687418, -0.007374477709077874, 0.1362821021736068, -0.0023270063742920257, -0.028803738496647587, -0.16669541649025632, 0.2706331740806954, 0.11986778249914114, 0.24470905993358802, 0.013895348874670798, 0.07643112265848673, -0.10231061781336234, -0.0049734071159622814, 0.026216709742560084, -0.11431431132643179, 0.03630969694373354, 0.10830441072439437, 0.06320431117505936, 0.2166269822718088, -0.5124960566227068, -0.2911906236120118, -0.009153404904391942, 0.1819981413101543, -0.020259504770585055, -0.03822036116265211, -0.24946654896133097, 0.048852794595068985, -0.10491759725377564, -0.13993395349923396, 0.03845458064890848, 0.0003000804037168222, -0.027253365001153676, -0.27908616829640076, 0.0922812185701039, 0.06419434420289409, 0.12195376189263075, -0.13264822260314135, 0.03957288243476576, -0.1319515327657354, 0.10662303395544323, 0.11065650443158162, 0.13247284592026157, 0.20831244055106735, -0.15609881349025925, -0.11159787472140593, 0.3345045370312295, -0.01855476788751431, -0.03440158523231645, 0.12176562837581306, -0.23047400353126377, -0.15706890668163714, 0.25092423816005255, 0.10851250253242735, 0.0652267031563796, -0.09418393155222371, 0.024475050337718886, -0.08128872842546678, 0.12562423297235328, 0.008797188964516124, -0.038376999414219654, 0.33336086508086665, 0.2056704607945824, 0.00976191535154545, 0.1803326542030601, -0.22236423641943293, -0.0910493886885827, -0.30308021530008955, -0.15896156188077137, -0.12947899672584046, 0.08624118517759262, -0.07956727568275801, -0.26816641925146567, 0.44394764684815735, 0.14664717405509428, 0.20052273558677744, -0.0900409617883172, 0.2954966987126926, 0.09092606163010214, 0.052915063721046554, 0.15387325742963276, 0.2688957924904589, 0.23189275734120318, 0.23627763409667568, -0.22936537529141862, 0.05702835906471982, 0.11725259487729695] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.