id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.00067 | Constrained Classification and Ranking via Quantiles | In most machine learning applications, classification accuracy is not the
primary metric of interest. Binary classifiers which face class imbalance are
often evaluated by the $F_\beta$ score, area under the precision-recall curve,
Precision at K, and more. The maximization of many of these metrics can be
expressed as... | cs.LG stat.ML | in most machine learning applications classification accuracy is not the primary metric of interest binary classifiers which face class imbalance are often evaluated by the f_beta score area under the precisionrecall curve precision at k and more the maximization of many of these metrics can be expressed as a constrain... | [['in', 'most', 'machine', 'learning', 'applications', 'classification', 'accuracy', 'is', 'not', 'the', 'primary', 'metric', 'of', 'interest', 'binary', 'classifiers', 'which', 'face', 'class', 'imbalance', 'are', 'often', 'evaluated', 'by', 'the', 'f_beta', 'score', 'area', 'under', 'the', 'precisionrecall', 'curve',... | [-0.09211474774575264, 0.0019831464522065143, -0.06256002315785736, 0.07954991117553986, -0.08178883147539219, -0.18873893983058027, 0.06327054107866904, 0.3933206915956091, -0.2798591558923756, -0.34138770552503095, 0.11863364064373781, -0.2659212896550024, -0.14908954818777084, 0.22956936988093485, -0.119135819860054... |
1,803.00068 | Gotta Adapt 'Em All: Joint Pixel and Feature-Level Domain Adaptation for
Recognition in the Wild | Recent developments in deep domain adaptation have allowed knowledge transfer
from a labeled source domain to an unlabeled target domain at the level of
intermediate features or input pixels. We propose that advantages may be
derived by combining them, in the form of different insights that lead to a
novel design and... | cs.CV | recent developments in deep domain adaptation have allowed knowledge transfer from a labeled source domain to an unlabeled target domain at the level of intermediate features or input pixels we propose that advantages may be derived by combining them in the form of different insights that lead to a novel design and com... | [['recent', 'developments', 'in', 'deep', 'domain', 'adaptation', 'have', 'allowed', 'knowledge', 'transfer', 'from', 'a', 'labeled', 'source', 'domain', 'to', 'an', 'unlabeled', 'target', 'domain', 'at', 'the', 'level', 'of', 'intermediate', 'features', 'or', 'input', 'pixels', 'we', 'propose', 'that', 'advantages', '... | [-0.0014967014689376966, 0.010390064247197815, -0.07333393014062586, 0.0502975280421542, -0.14716607940079454, -0.16039164172595038, 0.0542523987291824, 0.45927628707439505, -0.30930586040697317, -0.33812334561810137, 0.07001929269371465, -0.2565909128195362, -0.16814976316667535, 0.19089965494025876, -0.15396053530524... |
1,803.00069 | Critical properties of scalar field theory with Lorentz violation: Exact
treatment of Lorentz-violating mechanism | In this work, we compute analytically the infrared divergences of massless
O($N$) self-interacting scalar field theories with Lorentz violation, which are
exact in the Lorentz-violating $K_{\mu\nu}$ coefficients, for evaluating the
corresponding next-to-leading order critical exponents. For that, we apply
three disti... | hep-th cond-mat.stat-mech math-ph math.MP | in this work we compute analytically the infrared divergences of massless on selfinteracting scalar field theories with lorentz violation which are exact in the lorentzviolating k_munu coefficients for evaluating the corresponding nexttoleading order critical exponents for that we apply three distinct and independent f... | [['in', 'this', 'work', 'we', 'compute', 'analytically', 'the', 'infrared', 'divergences', 'of', 'massless', 'on', 'selfinteracting', 'scalar', 'field', 'theories', 'with', 'lorentz', 'violation', 'which', 'are', 'exact', 'in', 'the', 'lorentzviolating', 'k_munu', 'coefficients', 'for', 'evaluating', 'the', 'correspond... | [-0.12109655057429336, 0.15990910375694511, -0.10316191171295941, 0.1092290572548033, -0.05498405204464992, -0.13225368524338896, 0.015203288368259868, 0.3371451808998245, -0.16209698621241841, -0.25715665391665726, 0.06340851208976044, -0.2887504092977906, -0.17987833851172277, 0.197116179864679, 0.015379339126714816,... |
1,803.0007 | Lecture Notes in Cosmology | These lecture notes are based on the hand-written notes which I prepared for
the cosmology course taught to graduate students of PPGFis and PPGCosmo at the
Federal University of Esp\'irito Santo (UFES), starting from 2014. This course
covers topics ranging from the evidence of the expanding universe to Cosmic
Microwa... | astro-ph.CO gr-qc hep-th | these lecture notes are based on the handwritten notes which i prepared for the cosmology course taught to graduate students of ppgfis and ppgcosmo at the federal university of espirito santo ufes starting from 2014 this course covers topics ranging from the evidence of the expanding universe to cosmic microwave backgr... | [['these', 'lecture', 'notes', 'are', 'based', 'on', 'the', 'handwritten', 'notes', 'which', 'i', 'prepared', 'for', 'the', 'cosmology', 'course', 'taught', 'to', 'graduate', 'students', 'of', 'ppgfis', 'and', 'ppgcosmo', 'at', 'the', 'federal', 'university', 'of', 'espirito', 'santo', 'ufes', 'starting', 'from', '2014... | [0.02260510419996885, 0.14390537108366305, -0.1685248419570808, 0.04731923449748697, -0.14279671107920316, -0.11157969143958046, -0.01629553334071086, 0.29552363989373237, -0.19347216304964743, -0.3863618331459852, 0.1205006139836489, -0.3321949733564487, -0.07526972081798773, 0.2455482795691261, -0.143231381676518, -0... |
1,803.00071 | Casimir force in dense confined electrolytes | Understanding the force between charged surfaces immersed in an electrolyte
solution is a classic problem in soft matter and liquid-state theory. Recent
experiments showed that the force decays exponentially but the characteristic
decay length in a concentrated electrolyte is significantly larger than what
liquid-sta... | cond-mat.soft cond-mat.stat-mech physics.chem-ph | understanding the force between charged surfaces immersed in an electrolyte solution is a classic problem in soft matter and liquidstate theory recent experiments showed that the force decays exponentially but the characteristic decay length in a concentrated electrolyte is significantly larger than what liquidstate th... | [['understanding', 'the', 'force', 'between', 'charged', 'surfaces', 'immersed', 'in', 'an', 'electrolyte', 'solution', 'is', 'a', 'classic', 'problem', 'in', 'soft', 'matter', 'and', 'liquidstate', 'theory', 'recent', 'experiments', 'showed', 'that', 'the', 'force', 'decays', 'exponentially', 'but', 'the', 'characteri... | [-0.12273021622894878, 0.22182410312050688, -0.11109506874698016, 0.09534929029295465, -0.008403487672859972, -0.14922698421140362, 0.0010115556410664336, 0.33073719678390207, -0.25969366922109116, -0.277534246298889, 0.01647982817035018, -0.30211018902517744, -0.13250151094322027, 0.16334776703569323, 0.00862241506246... |
1,803.00072 | Analysis of the Herschel DEBRIS Sun-like star sample | This paper presents a study of circumstellar debris around Sun-like stars
using data from the Herschel DEBRIS Key Programme. DEBRIS is an unbiased survey
comprising the nearest ~90 stars of each spectral type A-M. Analysis of the 275
F-K stars shows that excess emission from a debris disc was detected around 47
stars... | astro-ph.EP astro-ph.SR | this paper presents a study of circumstellar debris around sunlike stars using data from the herschel debris key programme debris is an unbiased survey comprising the nearest 90 stars of each spectral type am analysis of the 275 fk stars shows that excess emission from a debris disc was detected around 47 stars giving ... | [['this', 'paper', 'presents', 'a', 'study', 'of', 'circumstellar', 'debris', 'around', 'sunlike', 'stars', 'using', 'data', 'from', 'the', 'herschel', 'debris', 'key', 'programme', 'debris', 'is', 'an', 'unbiased', 'survey', 'comprising', 'the', 'nearest', '90', 'stars', 'of', 'each', 'spectral', 'type', 'am', 'analys... | [-0.04152357505982314, 0.1424200299272612, -0.06961109266518561, 0.09753497456089895, -0.05621592973898879, -0.07456670400952913, 0.01862481207874919, 0.39105054238586456, -0.16376310749503092, -0.3769894134631953, 0.05786433775550486, -0.3372873638970379, 0.02569118847505186, 0.18392701077833046, -0.07054482761531314,... |
1,803.00073 | Resolution Improvement of the Common Method for Presentating Arbitrary
Space Curves Voxel | The task of voxel resolution for a space curve in video memory of 3D display
is set. Furthermore, an approach solution of voxel resolution of arbitrary
space curve, given in parametric form, is studied. Numerous numbers of
intensive experiments are conducted and interesting results with significant
recommendations ar... | cs.GR | the task of voxel resolution for a space curve in video memory of 3d display is set furthermore an approach solution of voxel resolution of arbitrary space curve given in parametric form is studied numerous numbers of intensive experiments are conducted and interesting results with significant recommendations are prese... | [['the', 'task', 'of', 'voxel', 'resolution', 'for', 'a', 'space', 'curve', 'in', 'video', 'memory', 'of', '3d', 'display', 'is', 'set', 'furthermore', 'an', 'approach', 'solution', 'of', 'voxel', 'resolution', 'of', 'arbitrary', 'space', 'curve', 'given', 'in', 'parametric', 'form', 'is', 'studied', 'numerous', 'numbe... | [-0.13546905219935032, 0.015657649131085513, -0.06801947237619636, 0.027296605553211912, -0.08296744946428404, -0.13868348926723917, -0.0024355473947160096, 0.48813915039811817, -0.19508057901260387, -0.3476154769637755, 0.11273571598457591, -0.2693088293379667, -0.1417407636644737, 0.2637471160946452, -0.1081994816744... |
1,803.00074 | Ultrafast heat flow in heterostructures of Au nanoclusters on
thin-films: atomic-disorder induced by hot electrons | We study the ultrafast structural dynamics, in response to electronic
excitations, in heterostructures composed of Au$_{923}$ nanoclusters on
thin-film substrates with the use of femtosecond electron diffraction. Various
forms of atomic motion, such as thermal vibrations, thermal expansion and
lattice disordering, ma... | cond-mat.mes-hall | we study the ultrafast structural dynamics in response to electronic excitations in heterostructures composed of au_923 nanoclusters on thinfilm substrates with the use of femtosecond electron diffraction various forms of atomic motion such as thermal vibrations thermal expansion and lattice disordering manifest as dis... | [['we', 'study', 'the', 'ultrafast', 'structural', 'dynamics', 'in', 'response', 'to', 'electronic', 'excitations', 'in', 'heterostructures', 'composed', 'of', 'au_923', 'nanoclusters', 'on', 'thinfilm', 'substrates', 'with', 'the', 'use', 'of', 'femtosecond', 'electron', 'diffraction', 'various', 'forms', 'of', 'atomi... | [-0.11363040276716442, 0.21595234169664002, -0.0707759614741473, 0.033676629846588695, -0.010644604083757067, -0.0954668904827951, 0.07488208864274067, 0.4227488854726733, -0.3042060229060955, -0.27545374078584056, 0.03823363020323044, -0.31280878004509693, -0.10565545827280297, 0.18732064206012372, 0.04097198628398135... |
1,803.00075 | The global well-posedness and scattering for the $5$D defocusing
conformal invariant NLW with radial initial data in a critical Besov space | In this paper, we obtain the global well-posedness and scattering for the
radial solution to the defocusing conformal invariant nonlinear wave equation
with initial data in the critical Besov space
$\dot{B}^3_{1,1}\times\dot{B}^2_{1,1}(\mathbb{R}^5)$. This is the five
dimensional analogue of \cite{dodson-2016}, which... | math.AP | in this paper we obtain the global wellposedness and scattering for the radial solution to the defocusing conformal invariant nonlinear wave equation with initial data in the critical besov space dotb3_11timesdotb2_11mathbbr5 this is the five dimensional analogue of citedodson2016 which is the first result on the globa... | [['in', 'this', 'paper', 'we', 'obtain', 'the', 'global', 'wellposedness', 'and', 'scattering', 'for', 'the', 'radial', 'solution', 'to', 'the', 'defocusing', 'conformal', 'invariant', 'nonlinear', 'wave', 'equation', 'with', 'initial', 'data', 'in', 'the', 'critical', 'besov', 'space', 'dotb3_11timesdotb2_11mathbbr5',... | [-0.11921752418659753, 0.05069438397284534, -0.10273964002223337, 0.08581360402789315, -0.08614803921091922, -0.05602563078657298, -0.008287822029561246, 0.2682865861550731, -0.2776267355923557, -0.23707079038199558, 0.16418762678000287, -0.27842899864949916, -0.11404377424110801, 0.15402220650102502, -0.00732303838545... |
1,803.00076 | Left-orderablity for surgeries on $(-2,3,2s+1)$-pretzel knots | In this paper, we prove that the fundamental group of the manifold obtained
by Dehn surgery along a $(-2,3,2s+1)$-pretzel knot ($s\ge 3$) with slope
$\frac{p}{q}$ is not left orderable if $\frac{p}{q}\ge 2s+3$, and that it is
left orderable if $\frac{p}{q}$ is in a neighborhood of zero depending on $s$.
| math.GT | in this paper we prove that the fundamental group of the manifold obtained by dehn surgery along a 232s1pretzel knot sge 3 with slope fracpq is not left orderable if fracpqge 2s3 and that it is left orderable if fracpq is in a neighborhood of zero depending on s | [['in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'fundamental', 'group', 'of', 'the', 'manifold', 'obtained', 'by', 'dehn', 'surgery', 'along', 'a', '232s1pretzel', 'knot', 'sge', '3', 'with', 'slope', 'fracpq', 'is', 'not', 'left', 'orderable', 'if', 'fracpqge', '2s3', 'and', 'that', 'it', 'is', 'left', 'orderab... | [-0.1966081514478998, 0.167152041985475, -0.1085963469553501, 0.006506219451771455, -0.09953724267951986, -0.22177791090166948, 0.013880844864538534, 0.409612386784655, -0.337583434391529, -0.20023816875479322, 0.14713983606804718, -0.29201968608701484, -0.1579372777722459, 0.1931206646692404, -0.1560032559915426, -0.1... |
1,803.00077 | Distributed Synthesis Using Accelerated ADMM | We propose a convex distributed optimization algorithm for synthesizing
robust controllers for large-scale continuous time systems subject to exogenous
disturbances. Given a large scale system, instead of solving the larger
centralized synthesis task, we decompose the problem into a set of smaller
synthesis problems ... | math.OC | we propose a convex distributed optimization algorithm for synthesizing robust controllers for largescale continuous time systems subject to exogenous disturbances given a large scale system instead of solving the larger centralized synthesis task we decompose the problem into a set of smaller synthesis problems for th... | [['we', 'propose', 'a', 'convex', 'distributed', 'optimization', 'algorithm', 'for', 'synthesizing', 'robust', 'controllers', 'for', 'largescale', 'continuous', 'time', 'systems', 'subject', 'to', 'exogenous', 'disturbances', 'given', 'a', 'large', 'scale', 'system', 'instead', 'of', 'solving', 'the', 'larger', 'centra... | [-0.1697981537092389, 0.041348226859754936, -0.033262181609106344, 0.03392567431304868, -0.08920946684995974, -0.17129130068411097, 0.04857959601952278, 0.374450154998523, -0.3843981730568362, -0.324287774105461, 0.14828979177033808, -0.18830628277446093, -0.11959413164771918, 0.17140250645878571, -0.09397146530728054,... |
1,803.00078 | Chaos and the Flow Capture Problem: Polluting is Easy, Cleaning is Hard | Cleaning pollution from a heterogeneous flow environment is far from simple.
We consider the flow capture problem, which has flows and sinks in a
heterogeneous environment, and investigate the problem of positioning pollutant
capture units. We show that arrays of capture units carry a high risk of
failure without acc... | physics.soc-ph | cleaning pollution from a heterogeneous flow environment is far from simple we consider the flow capture problem which has flows and sinks in a heterogeneous environment and investigate the problem of positioning pollutant capture units we show that arrays of capture units carry a high risk of failure without accountin... | [['cleaning', 'pollution', 'from', 'a', 'heterogeneous', 'flow', 'environment', 'is', 'far', 'from', 'simple', 'we', 'consider', 'the', 'flow', 'capture', 'problem', 'which', 'has', 'flows', 'and', 'sinks', 'in', 'a', 'heterogeneous', 'environment', 'and', 'investigate', 'the', 'problem', 'of', 'positioning', 'pollutan... | [-0.13640827018624316, 0.0708190362327374, -0.01803382011130452, 0.08007342756526878, -0.059242251221663676, -0.13164155839655836, 0.049027493578166915, 0.3801987648010254, -0.3191249559705074, -0.3390006463759794, 0.10145743698902572, -0.29140836778096857, -0.14705551566484457, 0.16818663160531566, -0.1003538011143413... |
1,803.00079 | Torsion points on elliptic curves and tame semistable coverings | In this paper, we study tame Galois coverings of semistable models that arise
from torsion points on elliptic curves. These coverings induce Galois morphisms
of intersection graphs and we express the decomposition groups of the edges in
terms of the reduction type of the elliptic curve. To that end, we first define
t... | math.AG | in this paper we study tame galois coverings of semistable models that arise from torsion points on elliptic curves these coverings induce galois morphisms of intersection graphs and we express the decomposition groups of the edges in terms of the reduction type of the elliptic curve to that end we first define the red... | [['in', 'this', 'paper', 'we', 'study', 'tame', 'galois', 'coverings', 'of', 'semistable', 'models', 'that', 'arise', 'from', 'torsion', 'points', 'on', 'elliptic', 'curves', 'these', 'coverings', 'induce', 'galois', 'morphisms', 'of', 'intersection', 'graphs', 'and', 'we', 'express', 'the', 'decomposition', 'groups', ... | [-0.20506217522618686, 0.04244296285859245, -0.1622396564620511, 0.04853405486162011, -0.09360368190672845, -0.1132650357202848, 0.009303568560727846, 0.3106022614944541, -0.3544293787968422, -0.23044256931325183, 0.07367936727071171, -0.3091873734036862, -0.1484755831075966, 0.20235803283336803, -0.2070124375747095, -... |
1,803.0008 | On the relation of Lie algebroids to constrained systems and their
BV/BFV formulation | We observe that a system of irreducible, fiber-linear, first class
constraints on T*M is equivalent to the definition of a foliation Lie algebroid
over M. The BFV formulation of the constrained system is given by the
Hamiltonian lift of the Vaintrob description (E[1],Q) of the Lie algebroid to
its cotangent bundle T*... | math-ph hep-th math.DG math.MP | we observe that a system of irreducible fiberlinear first class constraints on tm is equivalent to the definition of a foliation lie algebroid over m the bfv formulation of the constrained system is given by the hamiltonian lift of the vaintrob description e1q of the lie algebroid to its cotangent bundle te1 affine def... | [['we', 'observe', 'that', 'a', 'system', 'of', 'irreducible', 'fiberlinear', 'first', 'class', 'constraints', 'on', 'tm', 'is', 'equivalent', 'to', 'the', 'definition', 'of', 'a', 'foliation', 'lie', 'algebroid', 'over', 'm', 'the', 'bfv', 'formulation', 'of', 'the', 'constrained', 'system', 'is', 'given', 'by', 'the'... | [-0.21441422261026066, 0.0321838722189164, -0.09430106135292185, 0.044734646773819504, -0.16524053097495603, -0.12768440243218923, -0.0006444939528591931, 0.3315423605963588, -0.31167206960575033, -0.28850040896019585, 0.04894845265274247, -0.22202759374243516, -0.1820977003313601, 0.14703121135114797, -0.1108119562397... |
1,803.00081 | Network Utility Maximization with Heterogeneous Traffic Flows | We consider the Network Utility Maximization (NUM) problem for wireless
networks in the presence of arbitrary types of flows, including unicast,
broadcast, multicast, and anycast traffic. Building upon the recent framework
of a universal control policy (UMW), we design a utility optimal cross-layer
admission control,... | math.OC | we consider the network utility maximization num problem for wireless networks in the presence of arbitrary types of flows including unicast broadcast multicast and anycast traffic building upon the recent framework of a universal control policy umw we design a utility optimal crosslayer admission control routing and s... | [['we', 'consider', 'the', 'network', 'utility', 'maximization', 'num', 'problem', 'for', 'wireless', 'networks', 'in', 'the', 'presence', 'of', 'arbitrary', 'types', 'of', 'flows', 'including', 'unicast', 'broadcast', 'multicast', 'and', 'anycast', 'traffic', 'building', 'upon', 'the', 'recent', 'framework', 'of', 'a'... | [-0.23596509577085575, -0.03670288024849946, -0.08857537509848168, 0.03217092449982733, -0.07914518741700723, -0.19900293960901244, 0.1923557163856062, 0.41938065083659426, -0.3003824697332267, -0.25731437097043813, 0.08606953238023027, -0.2080037155929877, -0.23520638177260048, 0.16021433733657103, -0.1409781362139144... |
1,803.00082 | GraphVar 2.0: A user-friendly toolbox for machine learning on functional
connectivity measures | Background: We previously presented GraphVar as a user-friendly MATLAB
toolbox for comprehensive graph analyses of functional brain connectivity. Here
we introduce a comprehensive extension of the toolbox allowing users to
seamlessly explore easily customizable decoding models across functional
connectivity measures ... | stat.AP | background we previously presented graphvar as a userfriendly matlab toolbox for comprehensive graph analyses of functional brain connectivity here we introduce a comprehensive extension of the toolbox allowing users to seamlessly explore easily customizable decoding models across functional connectivity measures as we... | [['background', 'we', 'previously', 'presented', 'graphvar', 'as', 'a', 'userfriendly', 'matlab', 'toolbox', 'for', 'comprehensive', 'graph', 'analyses', 'of', 'functional', 'brain', 'connectivity', 'here', 'we', 'introduce', 'a', 'comprehensive', 'extension', 'of', 'the', 'toolbox', 'allowing', 'users', 'to', 'seamles... | [-0.0481186362667038, -0.020421043602367125, -0.07543872059056216, 0.09021900833578214, -0.1727803869230369, -0.2577954555475994, 0.07906918775593853, 0.43332019895069007, -0.250478698182769, -0.3706390275743006, 0.07848025939944261, -0.2447947606656291, -0.17538515967419493, 0.21111110960601856, -0.08577518964018098, ... |
1,803.00083 | The [OIII] profiles of infrared-selected active galactic nuclei: More
powerful outflows in the obscured population | We explore the kinematics of ionized gas via the [O III] $\lambda$5007
emission lines in active galactic nuclei (AGN) selected on the basis of their
mid-infrared (IR) emission, and split into obscured and unobscured populations
based on their optical-IR colors. After correcting for differences in redshift
distributio... | astro-ph.GA | we explore the kinematics of ionized gas via the o iii lambda5007 emission lines in active galactic nuclei agn selected on the basis of their midinfrared ir emission and split into obscured and unobscured populations based on their opticalir colors after correcting for differences in redshift distributions we provide c... | [['we', 'explore', 'the', 'kinematics', 'of', 'ionized', 'gas', 'via', 'the', 'o', 'iii', 'lambda5007', 'emission', 'lines', 'in', 'active', 'galactic', 'nuclei', 'agn', 'selected', 'on', 'the', 'basis', 'of', 'their', 'midinfrared', 'ir', 'emission', 'and', 'split', 'into', 'obscured', 'and', 'unobscured', 'population... | [0.05536659545957785, 0.08522975406660377, -0.030157563717895533, 0.17537293452857194, -0.08276192306552596, -0.14269211662180184, 0.079364961905553, 0.5671236044006368, -0.11279489806654501, -0.33802131456654194, 0.02943683741662932, -0.30481520569936865, 0.03663865272462306, 0.1677500463507789, -0.041207304982289236,... |
1,803.00084 | The Geometry of the Secant Caustic of a Planar Curve | The secant caustic of a planar curve $M$ is the image of the singular set of
the secant map of $M$. We analyse the geometrical properties of the secant
caustic of a planar curve, i.e. the number of branches of the secant caustic,
the parity of the number of cusps and the number of inflexion points in each
branch of t... | math.DG | the secant caustic of a planar curve m is the image of the singular set of the secant map of m we analyse the geometrical properties of the secant caustic of a planar curve ie the number of branches of the secant caustic the parity of the number of cusps and the number of inflexion points in each branch of this set in ... | [['the', 'secant', 'caustic', 'of', 'a', 'planar', 'curve', 'm', 'is', 'the', 'image', 'of', 'the', 'singular', 'set', 'of', 'the', 'secant', 'map', 'of', 'm', 'we', 'analyse', 'the', 'geometrical', 'properties', 'of', 'the', 'secant', 'caustic', 'of', 'a', 'planar', 'curve', 'ie', 'the', 'number', 'of', 'branches', 'o... | [-0.25104457422470056, -0.00572260282933712, -0.10379052945774876, 0.0370063043716881, -0.07417253542484509, -0.06496446361351345, 0.0199091422268086, 0.2712530759473642, -0.2910434411030211, -0.23915121394933925, 0.07070212960372575, -0.271575666550133, -0.15023003100003635, 0.1963065696000639, -0.08706280683012059, 0... |
1,803.00085 | Chinese Text in the Wild | We introduce Chinese Text in the Wild, a very large dataset of Chinese text
in street view images. While optical character recognition (OCR) in document
images is well studied and many commercial tools are available, detection and
recognition of text in natural images is still a challenging problem,
especially for mo... | cs.CV | we introduce chinese text in the wild a very large dataset of chinese text in street view images while optical character recognition ocr in document images is well studied and many commercial tools are available detection and recognition of text in natural images is still a challenging problem especially for more compl... | [['we', 'introduce', 'chinese', 'text', 'in', 'the', 'wild', 'a', 'very', 'large', 'dataset', 'of', 'chinese', 'text', 'in', 'street', 'view', 'images', 'while', 'optical', 'character', 'recognition', 'ocr', 'in', 'document', 'images', 'is', 'well', 'studied', 'and', 'many', 'commercial', 'tools', 'are', 'available', '... | [-0.03688209950267679, -0.024145996835870258, -0.005655981553538656, 0.09981899054156451, -0.12075536311280458, -0.16914366282280857, 0.0037106286080798643, 0.456715462207938, -0.2430170387205844, -0.3627356020248276, 0.12394640190638315, -0.34577697391790774, -0.13426612875726376, 0.25574822978001505, -0.1856581571109... |
1,803.00086 | From CCR to Levy Processes: An Excursion in Quantum Probability | This is an expositary article telling a short story made from the leaves of
quantum probability with the following ingredients: (i) A special projective,
unitary, irreducible and factorizable representation of the euclidean group of
a Hilbert space known as the Weyl representation. \item The infinitesimal
version of ... | quant-ph math-ph math.MP | this is an expositary article telling a short story made from the leaves of quantum probability with the following ingredients i a special projective unitary irreducible and factorizable representation of the euclidean group of a hilbert space known as the weyl representation item the infinitesimal version of the weyl ... | [['this', 'is', 'an', 'expositary', 'article', 'telling', 'a', 'short', 'story', 'made', 'from', 'the', 'leaves', 'of', 'quantum', 'probability', 'with', 'the', 'following', 'ingredients', 'i', 'a', 'special', 'projective', 'unitary', 'irreducible', 'and', 'factorizable', 'representation', 'of', 'the', 'euclidean', 'gr... | [-0.12132081950531264, 0.1394781268342622, -0.10743657614900695, 0.08507684117026684, -0.11739405168163526, -0.11210939022250303, 0.01915068913407567, 0.29178077929461277, -0.3283845958307044, -0.2060574814392865, 0.06755903684228098, -0.2557258588912406, -0.14626139805844154, 0.20272574384647016, -0.07142532397175336,... |
1,803.00087 | A Literature Survey on Ontology of Different Computing Platforms in
Smart Environments | Smart environments integrates various types of technologies, including cloud
computing, fog computing, and the IoT paradigm. In such environments, it is
essential to organize and manage efficiently the broad and complex set of
heterogeneous resources. For this reason, resources classification and
categorization becom... | cs.DC | smart environments integrates various types of technologies including cloud computing fog computing and the iot paradigm in such environments it is essential to organize and manage efficiently the broad and complex set of heterogeneous resources for this reason resources classification and categorization becomes a vita... | [['smart', 'environments', 'integrates', 'various', 'types', 'of', 'technologies', 'including', 'cloud', 'computing', 'fog', 'computing', 'and', 'the', 'iot', 'paradigm', 'in', 'such', 'environments', 'it', 'is', 'essential', 'to', 'organize', 'and', 'manage', 'efficiently', 'the', 'broad', 'and', 'complex', 'set', 'of... | [-0.14382906147397542, 0.01893199198628495, -0.04938898606262371, 0.045492258140881196, -0.1029897299754963, -0.1237356138630204, 0.03484420103132816, 0.38457317153612774, -0.25274947771172535, -0.35994428152437596, 0.11449586077166411, -0.2385639297369612, -0.1837983067277545, 0.1990248175856073, -0.1075283457963344, ... |
1,803.00088 | The accuracy of semi-numerical reionization models in comparison with
radiative transfer simulations | We have developed a modular semi-numerical code that computes the time and
spatially dependent ionization of neutral hydrogen (HI), neutral (HeI) and
singly ionized helium (HeII) in the intergalactic medium (IGM). The model
accounts for recombinations and provides different descriptions for the
photoionization rate t... | astro-ph.CO | we have developed a modular seminumerical code that computes the time and spatially dependent ionization of neutral hydrogen hi neutral hei and singly ionized helium heii in the intergalactic medium igm the model accounts for recombinations and provides different descriptions for the photoionization rate that are used ... | [['we', 'have', 'developed', 'a', 'modular', 'seminumerical', 'code', 'that', 'computes', 'the', 'time', 'and', 'spatially', 'dependent', 'ionization', 'of', 'neutral', 'hydrogen', 'hi', 'neutral', 'hei', 'and', 'singly', 'ionized', 'helium', 'heii', 'in', 'the', 'intergalactic', 'medium', 'igm', 'the', 'model', 'accou... | [-0.0017061524942298147, 0.08034255688042179, -0.02335497272182621, 0.10059548275974378, -0.020907140431889133, -0.11011325346634668, 0.009725168844977138, 0.4455622389474336, -0.1679001379794642, -0.3006396949948633, -0.012333914475497223, -0.28776897675923857, -0.0031939333431735433, 0.18813191232609325, 0.0397305501... |
1,803.00089 | Coarse-grained dynamics of operator and state entanglement | We give a detailed theory for the leading coarse-grained dynamics of
entanglement entropy of states and of operators in generic short-range
interacting quantum many-body systems. This includes operators spreading under
Heisenberg time evolution, which we find are much less entangled than "typical"
operators of the sa... | cond-mat.stat-mech cond-mat.str-el hep-th nlin.CD quant-ph | we give a detailed theory for the leading coarsegrained dynamics of entanglement entropy of states and of operators in generic shortrange interacting quantum manybody systems this includes operators spreading under heisenberg time evolution which we find are much less entangled than typical operators of the same spatia... | [['we', 'give', 'a', 'detailed', 'theory', 'for', 'the', 'leading', 'coarsegrained', 'dynamics', 'of', 'entanglement', 'entropy', 'of', 'states', 'and', 'of', 'operators', 'in', 'generic', 'shortrange', 'interacting', 'quantum', 'manybody', 'systems', 'this', 'includes', 'operators', 'spreading', 'under', 'heisenberg',... | [-0.1496458458352006, 0.1747138332105371, -0.09333500759029346, 0.07082489203351239, 0.006943074282155268, -0.16777149606496095, 0.0013921737800248796, 0.3371809151903209, -0.25090956585274804, -0.22717404201833738, 0.07280636230845833, -0.2929282496497035, -0.13229471504688262, 0.18400150638384125, -0.0081012362779842... |
1,803.0009 | Intermediate-line Emission in AGNs: The Effect of Prescription of the
Gas Density | The requirement of intermediate line component in the recently observed
spectra of several AGNs points to possibility of the existence of a physically
separate region between broad line region (BLR) and narrow line region (NLR).
In this paper we explore the emission from intermediate line region (ILR) by
using the ph... | astro-ph.GA | the requirement of intermediate line component in the recently observed spectra of several agns points to possibility of the existence of a physically separate region between broad line region blr and narrow line region nlr in this paper we explore the emission from intermediate line region ilr by using the photoioniza... | [['the', 'requirement', 'of', 'intermediate', 'line', 'component', 'in', 'the', 'recently', 'observed', 'spectra', 'of', 'several', 'agns', 'points', 'to', 'possibility', 'of', 'the', 'existence', 'of', 'a', 'physically', 'separate', 'region', 'between', 'broad', 'line', 'region', 'blr', 'and', 'narrow', 'line', 'regio... | [-0.06842627278385657, 0.01741909477705251, -0.03895653052391522, 0.05629374217562007, -0.017038828762848443, -0.08087057923739202, 0.043713811688153824, 0.4558760577865757, -0.1833185666854277, -0.2913226895872945, 0.029267643678213925, -0.26100896684200753, -0.0005338258414542506, 0.16695350843980486, 0.0105968990415... |
1,803.00091 | Verification of Markov Decision Processes with Risk-Sensitive Measures | We develop a method for computing policies in Markov decision processes with
risk-sensitive measures subject to temporal logic constraints. Specifically, we
use a particular risk-sensitive measure from cumulative prospect theory, which
has been previously adopted in psychology and economics. The nonlinear
transformat... | cs.AI cs.LO | we develop a method for computing policies in markov decision processes with risksensitive measures subject to temporal logic constraints specifically we use a particular risksensitive measure from cumulative prospect theory which has been previously adopted in psychology and economics the nonlinear transformation of t... | [['we', 'develop', 'a', 'method', 'for', 'computing', 'policies', 'in', 'markov', 'decision', 'processes', 'with', 'risksensitive', 'measures', 'subject', 'to', 'temporal', 'logic', 'constraints', 'specifically', 'we', 'use', 'a', 'particular', 'risksensitive', 'measure', 'from', 'cumulative', 'prospect', 'theory', 'wh... | [-0.06231399927031705, -0.01619978122916833, -0.12797435702832075, 0.12264823033569419, -0.1337138550565103, -0.13267701724069003, 0.09966291359754051, 0.4378493784983851, -0.32476168980213754, -0.30246469332855574, 0.1089601872883243, -0.22113493802406045, -0.24812783106059141, 0.21422925869915255, -0.1030936936024643... |
1,803.00092 | NETT: Solving Inverse Problems with Deep Neural Networks | Recovering a function or high-dimensional parameter vector from indirect
measurements is a central task in various scientific areas. Several methods for
solving such inverse problems are well developed and well understood. Recently,
novel algorithms using deep learning and neural networks for inverse problems
appeare... | math.NA cs.LG cs.NA | recovering a function or highdimensional parameter vector from indirect measurements is a central task in various scientific areas several methods for solving such inverse problems are well developed and well understood recently novel algorithms using deep learning and neural networks for inverse problems appeared whil... | [['recovering', 'a', 'function', 'or', 'highdimensional', 'parameter', 'vector', 'from', 'indirect', 'measurements', 'is', 'a', 'central', 'task', 'in', 'various', 'scientific', 'areas', 'several', 'methods', 'for', 'solving', 'such', 'inverse', 'problems', 'are', 'well', 'developed', 'and', 'well', 'understood', 'rece... | [-0.021765139766072774, -0.03972851595580931, -0.049501620892929664, 0.12136779171889163, -0.10147556675801063, -0.16247737240178678, 0.02009442389304904, 0.4245620377944403, -0.31942411622703426, -0.30869338926484025, 0.14339486215157674, -0.26252628252201526, -0.203343559663425, 0.25068410014390496, -0.13027891870014... |
1,803.00093 | Divergent on average directions of Teichmuller geodesic flow | The set of directions from a quadratic differential that diverge on average
under Teichmuller geodesic flow has Hausdorff dimension exactly equal to
one-half.
| math.DS math.GT | the set of directions from a quadratic differential that diverge on average under teichmuller geodesic flow has hausdorff dimension exactly equal to onehalf | [['the', 'set', 'of', 'directions', 'from', 'a', 'quadratic', 'differential', 'that', 'diverge', 'on', 'average', 'under', 'teichmuller', 'geodesic', 'flow', 'has', 'hausdorff', 'dimension', 'exactly', 'equal', 'to', 'onehalf']] | [-0.1746144714238851, 0.13845234611274107, -0.1303425520334555, 0.046969452063026634, -0.0716726200695595, -0.16073023720199, -0.024200127662523933, 0.283321599273578, -0.29060289684845053, -0.1511595527762952, 0.07474394626510532, -0.43272260414517444, -0.08549361538303935, 0.23426410029439823, -0.11563748096966225, 0... |
1,803.00094 | Neural Networks Should Be Wide Enough to Learn Disconnected Decision
Regions | In the recent literature the important role of depth in deep learning has
been emphasized. In this paper we argue that sufficient width of a feedforward
network is equally important by answering the simple question under which
conditions the decision regions of a neural network are connected. It turns out
that for a ... | cs.LG cs.AI cs.CV stat.ML | in the recent literature the important role of depth in deep learning has been emphasized in this paper we argue that sufficient width of a feedforward network is equally important by answering the simple question under which conditions the decision regions of a neural network are connected it turns out that for a clas... | [['in', 'the', 'recent', 'literature', 'the', 'important', 'role', 'of', 'depth', 'in', 'deep', 'learning', 'has', 'been', 'emphasized', 'in', 'this', 'paper', 'we', 'argue', 'that', 'sufficient', 'width', 'of', 'a', 'feedforward', 'network', 'is', 'equally', 'important', 'by', 'answering', 'the', 'simple', 'question',... | [-0.11175200125489937, 0.08379669545320212, -0.03196241067053052, 0.07870434499636758, -0.07995155327989778, -0.17167084387983778, 0.036750545094946574, 0.4459963824483566, -0.2602582202744088, -0.24486092584265862, 0.08055973676709982, -0.21669625522190472, -0.2688913251140548, 0.16974553621639643, -0.0904899735432991... |
1,803.00095 | A computationally universal phase of quantum matter | We provide the first example of a symmetry protected quantum phase that has
universal computational power. Throughout this phase, which lives in spatial
dimension two, the ground state is a universal resource for measurement based
quantum computation.
| quant-ph | we provide the first example of a symmetry protected quantum phase that has universal computational power throughout this phase which lives in spatial dimension two the ground state is a universal resource for measurement based quantum computation | [['we', 'provide', 'the', 'first', 'example', 'of', 'a', 'symmetry', 'protected', 'quantum', 'phase', 'that', 'has', 'universal', 'computational', 'power', 'throughout', 'this', 'phase', 'which', 'lives', 'in', 'spatial', 'dimension', 'two', 'the', 'ground', 'state', 'is', 'a', 'universal', 'resource', 'for', 'measurem... | [-0.19011555591950546, 0.19707742741180434, -0.13930920667543606, 0.009692944888327573, -0.03776705429914433, -0.1780194324265058, 0.08813610558423239, 0.3239259653397509, -0.2330152742766045, -0.24506057990161148, 0.1226122736194599, -0.20217474685931527, -0.15044362827934124, 0.18414461522086248, -0.04305218443246181... |
1,803.00096 | Synthetic Control Methods and Big Data | Many macroeconomic policy questions may be assessed in a case study
framework, where the time series of a treated unit is compared to a
counterfactual constructed from a large pool of control units. I provide a
general framework for this setting, tailored to predict the counterfactual by
minimizing a tradeoff between... | econ.EM | many macroeconomic policy questions may be assessed in a case study framework where the time series of a treated unit is compared to a counterfactual constructed from a large pool of control units i provide a general framework for this setting tailored to predict the counterfactual by minimizing a tradeoff between unde... | [['many', 'macroeconomic', 'policy', 'questions', 'may', 'be', 'assessed', 'in', 'a', 'case', 'study', 'framework', 'where', 'the', 'time', 'series', 'of', 'a', 'treated', 'unit', 'is', 'compared', 'to', 'a', 'counterfactual', 'constructed', 'from', 'a', 'large', 'pool', 'of', 'control', 'units', 'i', 'provide', 'a', '... | [-0.038647596245215056, 0.024076226732931125, -0.05582227044266148, 0.10253257124834511, -0.07387465913195032, -0.16935659178308018, 0.09176831480335612, 0.3651465664046756, -0.26376028122127654, -0.30647973156061453, 0.11978449842871527, -0.2605940063739074, -0.1733253293711079, 0.1990111708142631, -0.1346741906711223... |
1,803.00097 | Intelligent Irrigation System Based on Arduino | This paper explains how to build an intelligent irrigation system using
Arduino (a micro- controller) and many devices (humidity, temperature, pressure
and water flow sensors). Our irrigation system combines a precise method to
determine water balance of soils with an automatic response to water content
oscillations.... | cs.CY | this paper explains how to build an intelligent irrigation system using arduino a micro controller and many devices humidity temperature pressure and water flow sensors our irrigation system combines a precise method to determine water balance of soils with an automatic response to water content oscillations thus it is... | [['this', 'paper', 'explains', 'how', 'to', 'build', 'an', 'intelligent', 'irrigation', 'system', 'using', 'arduino', 'a', 'micro', 'controller', 'and', 'many', 'devices', 'humidity', 'temperature', 'pressure', 'and', 'water', 'flow', 'sensors', 'our', 'irrigation', 'system', 'combines', 'a', 'precise', 'method', 'to',... | [-0.11076658919919283, 0.11836827662669488, -0.08866479101457767, -0.03798722491067435, -0.07400354089747582, -0.16375713626454982, 0.08361014754544678, 0.380853330503617, -0.27025677297663475, -0.3780418585719807, 0.15723990576474794, -0.30415900551847047, -0.19819667361942786, 0.23079343725528037, -0.1581643988245299... |
1,803.00098 | A general measure of the impact of priors in Bayesian statistics via
Stein's Method | We propose a measure of the impact of any two choices of prior distributions
by quantifying the Wasserstein distance between the respective resulting
posterior distributions at any fixed sample size. We illustrate this measure on
the normal, Binomial and Poisson models.
| math.ST stat.TH | we propose a measure of the impact of any two choices of prior distributions by quantifying the wasserstein distance between the respective resulting posterior distributions at any fixed sample size we illustrate this measure on the normal binomial and poisson models | [['we', 'propose', 'a', 'measure', 'of', 'the', 'impact', 'of', 'any', 'two', 'choices', 'of', 'prior', 'distributions', 'by', 'quantifying', 'the', 'wasserstein', 'distance', 'between', 'the', 'respective', 'resulting', 'posterior', 'distributions', 'at', 'any', 'fixed', 'sample', 'size', 'we', 'illustrate', 'this', '... | [-0.04618336691907266, 0.07834847198753822, -0.1486090787504686, 0.10168662774887663, -0.014440897289981566, -0.0625587875000769, 0.10274938602999943, 0.405049213185543, -0.2962244941239677, -0.3170696896296449, 0.00909082893645618, -0.26826132652236195, -0.0833062892552556, 0.12272426329280545, -0.08648719768062597, 0... |
1,803.00099 | The Difficulty of Monte Carlo Approximation of Multivariate Monotone
Functions | We study the $L_1$-approximation of $d$-variate monotone functions based on
information from $n$ function evaluations. It is known that this problem
suffers from the curse of dimensionality in the deterministic setting, that is,
the number $n(\varepsilon,d)$ of function evaluations needed in order to
approximate an u... | math.NA | we study the l_1approximation of dvariate monotone functions based on information from n function evaluations it is known that this problem suffers from the curse of dimensionality in the deterministic setting that is the number nvarepsilond of function evaluations needed in order to approximate an unknown monotone fun... | [['we', 'study', 'the', 'l_1approximation', 'of', 'dvariate', 'monotone', 'functions', 'based', 'on', 'information', 'from', 'n', 'function', 'evaluations', 'it', 'is', 'known', 'that', 'this', 'problem', 'suffers', 'from', 'the', 'curse', 'of', 'dimensionality', 'in', 'the', 'deterministic', 'setting', 'that', 'is', '... | [-0.12154731183203266, 0.08989679474603583, -0.024365597476443165, 0.10324746851641547, -0.05709519733414602, -0.15690779466154603, 0.07730194935613648, 0.3329380956094931, -0.31832380291512785, -0.2955138163695879, 0.10881507487176671, -0.2822157672524233, -0.1854652690304005, 0.18614702211155365, -0.10609685650321327... |
1,803.001 | The TT* deformation at large central charge | We study Zamolodchikov's TT* deformation of two dimensional quantum field
theories in a 't Hooft-like limit, in which we scale the number of degrees of
freedom c to infinity and the deformation parameter t to zero, keeping their
product t*c fixed (more precisely, we keep energies and distances fixed in
units of t*c).... | hep-th | we study zamolodchikovs tt deformation of two dimensional quantum field theories in a t hooftlike limit in which we scale the number of degrees of freedom c to infinity and the deformation parameter t to zero keeping their product tc fixed more precisely we keep energies and distances fixed in units of tc in this limit... | [['we', 'study', 'zamolodchikovs', 'tt', 'deformation', 'of', 'two', 'dimensional', 'quantum', 'field', 'theories', 'in', 'a', 't', 'hooftlike', 'limit', 'in', 'which', 'we', 'scale', 'the', 'number', 'of', 'degrees', 'of', 'freedom', 'c', 'to', 'infinity', 'and', 'the', 'deformation', 'parameter', 't', 'to', 'zero', '... | [-0.1689791917359178, 0.22503098657476567, -0.088908590393785, 0.05547494016735701, -0.019679713234845027, -0.12589586506353986, 0.03467603410576758, 0.3408319299309471, -0.2771527468244258, -0.22735580672927758, 0.046521858174014386, -0.2860019616173389, -0.12104372817709624, 0.10072545510516545, -0.008432250839840864... |
1,803.00101 | Model-Based Value Estimation for Efficient Model-Free Reinforcement
Learning | Recent model-free reinforcement learning algorithms have proposed
incorporating learned dynamics models as a source of additional data with the
intention of reducing sample complexity. Such methods hold the promise of
incorporating imagined data coupled with a notion of model uncertainty to
accelerate the learning of... | cs.LG cs.AI stat.ML | recent modelfree reinforcement learning algorithms have proposed incorporating learned dynamics models as a source of additional data with the intention of reducing sample complexity such methods hold the promise of incorporating imagined data coupled with a notion of model uncertainty to accelerate the learning of con... | [['recent', 'modelfree', 'reinforcement', 'learning', 'algorithms', 'have', 'proposed', 'incorporating', 'learned', 'dynamics', 'models', 'as', 'a', 'source', 'of', 'additional', 'data', 'with', 'the', 'intention', 'of', 'reducing', 'sample', 'complexity', 'such', 'methods', 'hold', 'the', 'promise', 'of', 'incorporati... | [0.0013937317373072904, 0.02924253113286675, -0.10368773628043819, 0.02828523280639377, -0.14438757983273562, -0.17576191019495283, 0.0945521094462887, 0.40987712096528345, -0.2826924187939544, -0.3799265415126563, 0.08195067460446637, -0.20709235991465524, -0.14305193415614512, 0.22734061527760033, -0.1262718628463774... |
1,803.00102 | Fault-tolerant detection of a quantum error | A critical component of any quantum error-correcting scheme is detection of
errors by using an ancilla system. However, errors occurring in the ancilla can
propagate onto the logical qubit, irreversibly corrupting the encoded
information. We demonstrate a fault-tolerant error-detection scheme that
suppresses spreadin... | quant-ph | a critical component of any quantum errorcorrecting scheme is detection of errors by using an ancilla system however errors occurring in the ancilla can propagate onto the logical qubit irreversibly corrupting the encoded information we demonstrate a faulttolerant errordetection scheme that suppresses spreading of anci... | [['a', 'critical', 'component', 'of', 'any', 'quantum', 'errorcorrecting', 'scheme', 'is', 'detection', 'of', 'errors', 'by', 'using', 'an', 'ancilla', 'system', 'however', 'errors', 'occurring', 'in', 'the', 'ancilla', 'can', 'propagate', 'onto', 'the', 'logical', 'qubit', 'irreversibly', 'corrupting', 'the', 'encoded... | [-0.17997415208693354, 0.19213244812541938, -0.008271273527850186, -0.013192087578053976, 0.030768777641858303, -0.25949559374261766, 0.10730240363421129, 0.38718310464173555, -0.2536290297247169, -0.3006576825564186, 0.03313755024892969, -0.24431026429538766, -0.11110677470588276, 0.22518921651006227, -0.1029802499516... |
1,803.00103 | Nested Algebraic Bethe Ansatz in integrable models: recent results | This short note summarizes the works done in collaboration between S.
Belliard (CEA, Saclay), L. Frappat (LAPTh, Annecy), S. Pakuliak (JINR, Dubna),
E. Ragoucy (LAPTh, Annecy), N. Slavnov (Steklov Math. Inst., Moscow) and more
recently A. Hutsalyuk (Wuppertal / Moscow) and A. Liashyk (Kiev / Moscow).
It presents th... | math-ph hep-th math.MP | this short note summarizes the works done in collaboration between s belliard cea saclay l frappat lapth annecy s pakuliak jinr dubna e ragoucy lapth annecy n slavnov steklov math inst moscow and more recently a hutsalyuk wuppertal moscow and a liashyk kiev moscow it presents the construction of bethe vectors their sca... | [['this', 'short', 'note', 'summarizes', 'the', 'works', 'done', 'in', 'collaboration', 'between', 's', 'belliard', 'cea', 'saclay', 'l', 'frappat', 'lapth', 'annecy', 's', 'pakuliak', 'jinr', 'dubna', 'e', 'ragoucy', 'lapth', 'annecy', 'n', 'slavnov', 'steklov', 'math', 'inst', 'moscow', 'and', 'more', 'recently', 'a'... | [-0.11680419950789656, 0.11879777991756175, -0.08712438826235787, 0.03545701134135015, -0.061895484701381065, -0.15543325912161285, 0.0016253270296147093, 0.24531949763453062, -0.16488730144677297, -0.28879943253317225, 0.08516313449581503, -0.33394674588150036, -0.1204612203631162, 0.17988683422784865, -0.104309694317... |
1,803.00104 | Active Matter Class with Second-Order Transition to Quasi-Long-Range
Polar Order | We introduce and study in two dimensions a new class of dry, aligning, active
matter that exhibits a direct transition to orientational order, without the
phase-separation phenomenology usually observed in this context. Characterized
by self-propelled particles with velocity reversals and ferromagnetic alignment
of p... | cond-mat.soft cond-mat.stat-mech | we introduce and study in two dimensions a new class of dry aligning active matter that exhibits a direct transition to orientational order without the phaseseparation phenomenology usually observed in this context characterized by selfpropelled particles with velocity reversals and ferromagnetic alignment of polaritie... | [['we', 'introduce', 'and', 'study', 'in', 'two', 'dimensions', 'a', 'new', 'class', 'of', 'dry', 'aligning', 'active', 'matter', 'that', 'exhibits', 'a', 'direct', 'transition', 'to', 'orientational', 'order', 'without', 'the', 'phaseseparation', 'phenomenology', 'usually', 'observed', 'in', 'this', 'context', 'charac... | [-0.1589435228860057, 0.1990736288727697, -0.06454053271771196, 0.050593235037597155, -0.06015230340182508, -0.1384651280273128, 0.03562623595951313, 0.3577109350525953, -0.24074502422638802, -0.3203696849149302, 0.024538382104973933, -0.2709026485724255, -0.20575067294129265, 0.12062538987657892, 0.008873807777807654,... |
1,803.00105 | Computational International Relations: What Can Programming, Coding and
Internet Research Do for the Discipline? | Computational Social Science emerged as a highly technical and popular
discipline in the last few years, owing to the substantial advances in
communication technology and daily production of vast quantities of personal
data. As per capita data production significantly increased in the last decade,
both in terms of it... | cs.CY | computational social science emerged as a highly technical and popular discipline in the last few years owing to the substantial advances in communication technology and daily production of vast quantities of personal data as per capita data production significantly increased in the last decade both in terms of its siz... | [['computational', 'social', 'science', 'emerged', 'as', 'a', 'highly', 'technical', 'and', 'popular', 'discipline', 'in', 'the', 'last', 'few', 'years', 'owing', 'to', 'the', 'substantial', 'advances', 'in', 'communication', 'technology', 'and', 'daily', 'production', 'of', 'vast', 'quantities', 'of', 'personal', 'dat... | [-0.039601152019607726, 0.018084509811718774, -0.06309805294975292, 0.08299553294417036, -0.1552345245556776, -0.14169978492481763, 0.07151587922884108, 0.3634560771503074, -0.2742739159527213, -0.37366521921182094, 0.11399788370756649, -0.3231887934426236, -0.15548239548928863, 0.24392755122660378, -0.1244240930022368... |
1,803.00106 | RF Energy Harvesting Sensor Networks for Healthcare of Animals:
Opportunities and Challenges | In recent years, the radio frequency (RF) energy harvesting technique is
considered as a favorable alternative to supply power for the next-generation
wireless sensor networks. Due to the features of energy self-sustainability and
long lifetime, the energy harvesting sensor network (RF-EHSN) becomes a
promising solut... | cs.NI | in recent years the radio frequency rf energy harvesting technique is considered as a favorable alternative to supply power for the nextgeneration wireless sensor networks due to the features of energy selfsustainability and long lifetime the energy harvesting sensor network rfehsn becomes a promising solution to provi... | [['in', 'recent', 'years', 'the', 'radio', 'frequency', 'rf', 'energy', 'harvesting', 'technique', 'is', 'considered', 'as', 'a', 'favorable', 'alternative', 'to', 'supply', 'power', 'for', 'the', 'nextgeneration', 'wireless', 'sensor', 'networks', 'due', 'to', 'the', 'features', 'of', 'energy', 'selfsustainability', '... | [-0.14561105257167514, 0.06696010098689671, -0.014076358360600554, 0.027765690943515102, -0.12331591294733463, -0.18376376975707157, 0.04740372978375052, 0.42228197399526834, -0.26199820992985257, -0.311333661088375, 0.12206625200310049, -0.3057375730670713, -0.15841973657478337, 0.22605289244610402, -0.151990792627825... |
1,803.00107 | Pulling Out All the Tops with Computer Vision and Deep Learning | We apply computer vision with deep learning -- in the form of a convolutional
neural network (CNN) -- to build a highly effective boosted top tagger.
Previous work (the "DeepTop" tagger of Kasieczka et al) has shown that a
CNN-based top tagger can achieve comparable performance to state-of-the-art
conventional top ta... | hep-ph hep-ex | we apply computer vision with deep learning in the form of a convolutional neural network cnn to build a highly effective boosted top tagger previous work the deeptop tagger of kasieczka et al has shown that a cnnbased top tagger can achieve comparable performance to stateoftheart conventional top taggers based on high... | [['we', 'apply', 'computer', 'vision', 'with', 'deep', 'learning', 'in', 'the', 'form', 'of', 'a', 'convolutional', 'neural', 'network', 'cnn', 'to', 'build', 'a', 'highly', 'effective', 'boosted', 'top', 'tagger', 'previous', 'work', 'the', 'deeptop', 'tagger', 'of', 'kasieczka', 'et', 'al', 'has', 'shown', 'that', 'a... | [0.033109515147647386, 0.0689492205973472, -0.07315155234705856, 0.0727316695237918, -0.11915054171726372, -0.18036607953791434, 0.028458928066641975, 0.45582905025965365, -0.21512947525669265, -0.3851619052821936, -0.009112033397152183, -0.28232809724341307, -0.06686095265842446, 0.21595766527175947, -0.07467385769419... |
1,803.00108 | Martingale decomposition of a $L^2$ space with nonlinear stochastic
integrals | This paper presents a generalization of the Kunita-Watanabe decomposition of
a $L^2$ space with nonlinear stochastic integrals where the integrator is a
family of continuous martingales bounded in $L^2$. To get the result, a useful
relation between the regularity of the martingale family respect to its
parameter and ... | math.PR | this paper presents a generalization of the kunitawatanabe decomposition of a l2 space with nonlinear stochastic integrals where the integrator is a family of continuous martingales bounded in l2 to get the result a useful relation between the regularity of the martingale family respect to its parameter and the regular... | [['this', 'paper', 'presents', 'a', 'generalization', 'of', 'the', 'kunitawatanabe', 'decomposition', 'of', 'a', 'l2', 'space', 'with', 'nonlinear', 'stochastic', 'integrals', 'where', 'the', 'integrator', 'is', 'a', 'family', 'of', 'continuous', 'martingales', 'bounded', 'in', 'l2', 'to', 'get', 'the', 'result', 'a', ... | [-0.1250628018210274, 0.01335973201385905, -0.12475808969222356, 0.06616109936378983, -0.08766564835122852, -0.06129182633662293, -0.00397708642751325, 0.3183077472413695, -0.38045531688907813, -0.21385222380821117, 0.17916557247490558, -0.2325825752842045, -0.16642791821166528, 0.17915300446627444, -0.1489160041200257... |
1,803.00109 | Asymptotics of quantum channels: conserved quantities, an adiabatic
limit, and matrix product states | This work derives an analytical formula for the asymptotic state---the
quantum state resulting from an infinite number of applications of a general
quantum channel on some initial state. For channels admitting multiple fixed or
rotating points, conserved quantities---the left fixed/rotating points of the
channel---de... | quant-ph | this work derives an analytical formula for the asymptotic statethe quantum state resulting from an infinite number of applications of a general quantum channel on some initial state for channels admitting multiple fixed or rotating points conserved quantitiesthe left fixedrotating points of the channeldetermine the de... | [['this', 'work', 'derives', 'an', 'analytical', 'formula', 'for', 'the', 'asymptotic', 'statethe', 'quantum', 'state', 'resulting', 'from', 'an', 'infinite', 'number', 'of', 'applications', 'of', 'a', 'general', 'quantum', 'channel', 'on', 'some', 'initial', 'state', 'for', 'channels', 'admitting', 'multiple', 'fixed'... | [-0.1663703019635714, 0.15972666301141686, -0.11722343010181675, 0.03649621037845532, -0.012007458089553074, -0.1494320923063372, 0.09692383625664983, 0.29333906241876334, -0.26365002630069395, -0.22371920964800987, 0.10223480655738869, -0.26038184189902885, -0.08753100636915691, 0.18400447342234352, -0.036166079655181... |
1,803.0011 | Maximizing Activity in Ising Networks via the TAP Approximation | A wide array of complex biological, social, and physical systems have
recently been shown to be quantitatively described by Ising models, which lie
at the intersection of statistical physics and machine learning. Here, we study
the fundamental question of how to optimize the state of a networked Ising
system given a ... | physics.soc-ph cond-mat.stat-mech cs.SI | a wide array of complex biological social and physical systems have recently been shown to be quantitatively described by ising models which lie at the intersection of statistical physics and machine learning here we study the fundamental question of how to optimize the state of a networked ising system given a budget ... | [['a', 'wide', 'array', 'of', 'complex', 'biological', 'social', 'and', 'physical', 'systems', 'have', 'recently', 'been', 'shown', 'to', 'be', 'quantitatively', 'described', 'by', 'ising', 'models', 'which', 'lie', 'at', 'the', 'intersection', 'of', 'statistical', 'physics', 'and', 'machine', 'learning', 'here', 'we',... | [-0.10597836982107542, 0.02346436453629857, -0.07318958651535866, 0.08350353513514808, -0.09374254928732956, -0.15833736177838859, 0.06386764804500411, 0.3816133753467373, -0.30373485477597656, -0.30897829237486624, 0.07578199452037068, -0.23112761858055553, -0.20256391198957088, 0.15307215139901603, -0.065796938357188... |
1,803.00111 | Predicting Recall Probability to Adaptively Prioritize Study | Students have a limited time to study and are typically ineffective at
allocating study time. Machine-directed study strategies that identify which
items need reinforcement and dictate the spacing of repetition have been shown
to help students optimize mastery (Mozer & Lindsey 2017). The large volume of
research on t... | cs.CY cs.LG | students have a limited time to study and are typically ineffective at allocating study time machinedirected study strategies that identify which items need reinforcement and dictate the spacing of repetition have been shown to help students optimize mastery mozer lindsey 2017 the large volume of research on this matte... | [['students', 'have', 'a', 'limited', 'time', 'to', 'study', 'and', 'are', 'typically', 'ineffective', 'at', 'allocating', 'study', 'time', 'machinedirected', 'study', 'strategies', 'that', 'identify', 'which', 'items', 'need', 'reinforcement', 'and', 'dictate', 'the', 'spacing', 'of', 'repetition', 'have', 'been', 'sh... | [-0.04880583961494267, 0.02469775625758279, -0.09512087918388155, 0.08142184741908494, -0.0970752778236205, -0.21005540415883447, 0.09497150353227671, 0.42589434882005056, -0.2177936060831715, -0.34108136005651873, 0.07842453156774401, -0.26261955779284624, -0.16137177049516677, 0.19182922080015907, -0.1231256220024079... |
1,803.00112 | Cooperation dynamics of generalized reciprocity in state-based social
dilemmas | We introduce a framework for studying social dilemmas in networked societies
where individuals follow a simple state-based behavioral mechanism based on
generalized reciprocity, which is rooted in the principle "help anyone if
helped by someone". Within this general framework, which applies to a wide
range of social ... | q-bio.PE | we introduce a framework for studying social dilemmas in networked societies where individuals follow a simple statebased behavioral mechanism based on generalized reciprocity which is rooted in the principle help anyone if helped by someone within this general framework which applies to a wide range of social dilemmas... | [['we', 'introduce', 'a', 'framework', 'for', 'studying', 'social', 'dilemmas', 'in', 'networked', 'societies', 'where', 'individuals', 'follow', 'a', 'simple', 'statebased', 'behavioral', 'mechanism', 'based', 'on', 'generalized', 'reciprocity', 'which', 'is', 'rooted', 'in', 'the', 'principle', 'help', 'anyone', 'if'... | [-0.1488293339498341, 0.07211130467092088, -0.10111411425201328, 0.10103854758237114, -0.08384249778726044, -0.1503896418981139, 0.1015340816725001, 0.34855321207701156, -0.29496964342954957, -0.29119639273103737, 0.028666913828857013, -0.22639766060799527, -0.2619387057634055, 0.11058363888158955, -0.04786935584551623... |
1,803.00113 | Approximate Inference for Constructing Astronomical Catalogs from Images | We present a new, fully generative model for constructing astronomical
catalogs from optical telescope image sets. Each pixel intensity is treated as
a random variable with parameters that depend on the latent properties of stars
and galaxies. These latent properties are themselves modeled as random. We
compare two p... | stat.AP astro-ph.IM cs.LG stat.ML | we present a new fully generative model for constructing astronomical catalogs from optical telescope image sets each pixel intensity is treated as a random variable with parameters that depend on the latent properties of stars and galaxies these latent properties are themselves modeled as random we compare two procedu... | [['we', 'present', 'a', 'new', 'fully', 'generative', 'model', 'for', 'constructing', 'astronomical', 'catalogs', 'from', 'optical', 'telescope', 'image', 'sets', 'each', 'pixel', 'intensity', 'is', 'treated', 'as', 'a', 'random', 'variable', 'with', 'parameters', 'that', 'depend', 'on', 'the', 'latent', 'properties', ... | [0.0011995766188733835, 0.09063211759691385, -0.06671316211673715, 0.10340417267693099, -0.13286948809015356, -0.1283561674500854, 0.06930013191462918, 0.4930962948513425, -0.22374909729812265, -0.3696608222705458, 0.11420985241516778, -0.28684455357214883, -0.04377688767680944, 0.25673933328544984, -0.0269223637494050... |
1,803.00114 | SQL-Rank: A Listwise Approach to Collaborative Ranking | In this paper, we propose a listwise approach for constructing user-specific
rankings in recommendation systems in a collaborative fashion. We contrast the
listwise approach to previous pointwise and pairwise approaches, which are
based on treating either each rating or each pairwise comparison as an
independent inst... | stat.ML cs.IR cs.LG | in this paper we propose a listwise approach for constructing userspecific rankings in recommendation systems in a collaborative fashion we contrast the listwise approach to previous pointwise and pairwise approaches which are based on treating either each rating or each pairwise comparison as an independent instance r... | [['in', 'this', 'paper', 'we', 'propose', 'a', 'listwise', 'approach', 'for', 'constructing', 'userspecific', 'rankings', 'in', 'recommendation', 'systems', 'in', 'a', 'collaborative', 'fashion', 'we', 'contrast', 'the', 'listwise', 'approach', 'to', 'previous', 'pointwise', 'and', 'pairwise', 'approaches', 'which', 'a... | [-0.029523203354315717, -0.0021498420552480807, -0.06800365831313582, 0.06840735752961603, -0.12301974441977165, -0.1802520588708589, 0.11007340606907119, 0.4344164983995554, -0.2317763180195717, -0.3388244940262646, 0.059514611051812515, -0.2661620554340593, -0.2003153511388806, 0.14744504931577518, -0.122511239190938... |
1,803.00115 | Holomorphic quadratic differentials on graphs and the chromatic
polynomial | We study "holomorphic quadratic differentials" on graphs. We relate them to
the reactive power in an LC circuit, and also to the chromatic polynomial of a
graph. Specifically, we show that the chromatic polynomial $\chi$ of a graph
$G$, at negative integer values, can be evaluated as the degree of a certain
rational ... | math.CO | we study holomorphic quadratic differentials on graphs we relate them to the reactive power in an lc circuit and also to the chromatic polynomial of a graph specifically we show that the chromatic polynomial chi of a graph g at negative integer values can be evaluated as the degree of a certain rational mapping arising... | [['we', 'study', 'holomorphic', 'quadratic', 'differentials', 'on', 'graphs', 'we', 'relate', 'them', 'to', 'the', 'reactive', 'power', 'in', 'an', 'lc', 'circuit', 'and', 'also', 'to', 'the', 'chromatic', 'polynomial', 'of', 'a', 'graph', 'specifically', 'we', 'show', 'that', 'the', 'chromatic', 'polynomial', 'chi', '... | [-0.20007810227572917, 0.03037892721942626, -0.09838314679140846, 0.058508932759674885, -0.16779800010224183, -0.13891878252228101, 0.003373406504591306, 0.32159564991792045, -0.3371726802488168, -0.28161009076982735, 0.04796168794079373, -0.25425806345747937, -0.21235195137560367, 0.2216164480894804, -0.08380144381274... |
1,803.00116 | Separators and Adjustment Sets in Causal Graphs: Complete Criteria and
an Algorithmic Framework | Principled reasoning about the identifiability of causal effects from
non-experimental data is an important application of graphical causal models.
This paper focuses on effects that are identifiable by covariate adjustment, a
commonly used estimation approach. We present an algorithmic framework for
efficiently test... | cs.AI cs.LG | principled reasoning about the identifiability of causal effects from nonexperimental data is an important application of graphical causal models this paper focuses on effects that are identifiable by covariate adjustment a commonly used estimation approach we present an algorithmic framework for efficiently testing co... | [['principled', 'reasoning', 'about', 'the', 'identifiability', 'of', 'causal', 'effects', 'from', 'nonexperimental', 'data', 'is', 'an', 'important', 'application', 'of', 'graphical', 'causal', 'models', 'this', 'paper', 'focuses', 'on', 'effects', 'that', 'are', 'identifiable', 'by', 'covariate', 'adjustment', 'a', '... | [-0.05950262791548784, 0.028487893422217376, -0.053516574076039124, 0.13890420084698946, -0.16574208249829217, -0.1511456023858205, 0.09934469547754686, 0.4364634256689697, -0.25762398551463833, -0.3431709202359543, 0.10158353538449424, -0.21748777964295676, -0.15413415873586966, 0.16954409265839546, -0.130970706861302... |
1,803.00117 | Redundancy allocation in finite-length nested codes for nonvolatile
memories | In this paper, we investigate the optimum way to allocate redundancy of
finite-length nested codes for modern nonvolatile memories suffering from both
permanent defects and transient errors (erasures or random errors). A nested
coding approach such as partitioned codes can handle both permanent defects and
transient ... | cs.IT math.IT | in this paper we investigate the optimum way to allocate redundancy of finitelength nested codes for modern nonvolatile memories suffering from both permanent defects and transient errors erasures or random errors a nested coding approach such as partitioned codes can handle both permanent defects and transient errors ... | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'optimum', 'way', 'to', 'allocate', 'redundancy', 'of', 'finitelength', 'nested', 'codes', 'for', 'modern', 'nonvolatile', 'memories', 'suffering', 'from', 'both', 'permanent', 'defects', 'and', 'transient', 'errors', 'erasures', 'or', 'random', 'errors', 'a', 'neste... | [-0.20839571688642225, 0.09543211731105679, -0.011166448735563857, 0.11369643513874218, -0.002851287221036306, -0.22550658270171503, 0.1418035769795363, 0.38495373789947934, -0.3257108183520869, -0.24297107864830006, 0.18032479980313104, -0.23794176057208238, -0.14534006954153728, 0.1245447380922553, -0.169693757998246... |
1,803.00118 | Surges of collective human activity emerge from simple pairwise
correlations | Human populations exhibit complex behaviors---characterized by long-range
correlations and surges in activity---across a range of social, political, and
technological contexts. Yet it remains unclear where these collective behaviors
come from, or if there even exists a set of unifying principles. Indeed,
existing exp... | physics.soc-ph cs.SI | human populations exhibit complex behaviorscharacterized by longrange correlations and surges in activityacross a range of social political and technological contexts yet it remains unclear where these collective behaviors come from or if there even exists a set of unifying principles indeed existing explanations typic... | [['human', 'populations', 'exhibit', 'complex', 'behaviorscharacterized', 'by', 'longrange', 'correlations', 'and', 'surges', 'in', 'activityacross', 'a', 'range', 'of', 'social', 'political', 'and', 'technological', 'contexts', 'yet', 'it', 'remains', 'unclear', 'where', 'these', 'collective', 'behaviors', 'come', 'fr... | [-0.1114949394216545, 0.1361580233068958, -0.09276134006151533, 0.14292332144220166, -0.06320996797567116, -0.13510920626790698, 0.06671120182122892, 0.4008745434693992, -0.26973404908817933, -0.33130301726455597, 0.03600340403204757, -0.29648539667065, -0.21623918367999692, 0.1895350011696607, -0.039894799528652485, -... |
1,803.00119 | Integrating Human-Provided Information Into Belief State Representation
Using Dynamic Factorization | In partially observed environments, it can be useful for a human to provide
the robot with declarative information that represents probabilistic relational
constraints on properties of objects in the world, augmenting the robot's
sensory observations. For instance, a robot tasked with a search-and-rescue
mission may ... | cs.AI cs.RO | in partially observed environments it can be useful for a human to provide the robot with declarative information that represents probabilistic relational constraints on properties of objects in the world augmenting the robots sensory observations for instance a robot tasked with a searchandrescue mission may be inform... | [['in', 'partially', 'observed', 'environments', 'it', 'can', 'be', 'useful', 'for', 'a', 'human', 'to', 'provide', 'the', 'robot', 'with', 'declarative', 'information', 'that', 'represents', 'probabilistic', 'relational', 'constraints', 'on', 'properties', 'of', 'objects', 'in', 'the', 'world', 'augmenting', 'the', 'r... | [-0.0869566665905704, 0.10338689631214554, -0.09811886640114559, 0.07393319430018498, -0.15357960730640066, -0.14092353737686533, 0.03565329199946309, 0.4520142975993253, -0.2789329277351499, -0.3431444281963883, 0.10591471852873124, -0.24441321284535367, -0.18200824581136976, 0.21091312198723491, -0.15222923708072789,... |
1,803.0012 | Simplified Weak Galerkin and New Finite Difference Schemes for the
Stokes Equation | This article presents a simplified formulation for the weak Galerkin finite
element method for the Stokes equation without using the degrees of freedom
associated with the unknowns in the interior of each element as formulated in
the original weak Galerkin algorithm. The simplified formulation preserves the
important... | math.NA | this article presents a simplified formulation for the weak galerkin finite element method for the stokes equation without using the degrees of freedom associated with the unknowns in the interior of each element as formulated in the original weak galerkin algorithm the simplified formulation preserves the important ma... | [['this', 'article', 'presents', 'a', 'simplified', 'formulation', 'for', 'the', 'weak', 'galerkin', 'finite', 'element', 'method', 'for', 'the', 'stokes', 'equation', 'without', 'using', 'the', 'degrees', 'of', 'freedom', 'associated', 'with', 'the', 'unknowns', 'in', 'the', 'interior', 'of', 'each', 'element', 'as', ... | [-0.09881670895265415, 0.04391836244369849, -0.05354309697874917, 0.055717010793159716, -0.04234782558738847, -0.08533295441619967, 0.027737313842490865, 0.3366574550111016, -0.2811215052259451, -0.22587677534532055, 0.1289243646930448, -0.25055770359978685, -0.061779062597038734, 0.16549990471685305, -0.07057675398308... |
1,803.00121 | Symmetry in optics and photonics: a group theory approach | Group theory (GT) provides a rigorous framework for studying symmetries in
various disciplines in physics ranging from quantum field theories and the
standard model to fluid mechanics and chaos theory. To date, the application of
such a powerful tool in optical physics remains limited. Over the past few
years however... | physics.optics | group theory gt provides a rigorous framework for studying symmetries in various disciplines in physics ranging from quantum field theories and the standard model to fluid mechanics and chaos theory to date the application of such a powerful tool in optical physics remains limited over the past few years however severa... | [['group', 'theory', 'gt', 'provides', 'a', 'rigorous', 'framework', 'for', 'studying', 'symmetries', 'in', 'various', 'disciplines', 'in', 'physics', 'ranging', 'from', 'quantum', 'field', 'theories', 'and', 'the', 'standard', 'model', 'to', 'fluid', 'mechanics', 'and', 'chaos', 'theory', 'to', 'date', 'the', 'applica... | [-0.08551989628406438, 0.11447229741851946, -0.09529325466811363, 0.03375960448772132, -0.10020613290467545, -0.15615311261009132, 0.015570664178659698, 0.38798989185536475, -0.2698825187490959, -0.3063945721193082, 0.11341592224657927, -0.23360870179328086, -0.21610135897246532, 0.23436807589084646, -0.064475384378487... |
1,803.00122 | Geometric random graphs and Rado sets of continuous functions | We prove the existence of Rado sets in the Banach space of continuous
functions on [0,1]. A countable dense set S is Rado if with probability 1, the
infinite geometric random graph on S, formed by probabilistically making
adjacent elements of S that are within unit distance of each other, is unique
up to isomorphism.... | math.CO | we prove the existence of rado sets in the banach space of continuous functions on 01 a countable dense set s is rado if with probability 1 the infinite geometric random graph on s formed by probabilistically making adjacent elements of s that are within unit distance of each other is unique up to isomorphism we show t... | [['we', 'prove', 'the', 'existence', 'of', 'rado', 'sets', 'in', 'the', 'banach', 'space', 'of', 'continuous', 'functions', 'on', '01', 'a', 'countable', 'dense', 'set', 's', 'is', 'rado', 'if', 'with', 'probability', '1', 'the', 'infinite', 'geometric', 'random', 'graph', 'on', 's', 'formed', 'by', 'probabilistically'... | [-0.15104976318437946, 0.15085081804374403, -0.023615553024027385, 0.04859075821533969, -0.06869191288327177, -0.09438966980881312, 0.04777392434083264, 0.409224384932807, -0.4032587957201582, -0.19556554275931734, 0.11824916556837375, -0.3379439908728907, -0.10628910064838375, 0.1867745551982697, -0.09881785286054241,... |
1,803.00123 | On generalized Walsh bases | This paper continues the study of orthonormal bases (ONB) of $L^2[0,1]$
introduced in \cite{DPS14} by means of Cuntz algebra $\mathcal{O}_N$
representations on $L^2[0,1]$. For $N=2$, one obtains the classic Walsh system.
We show that the ONB property holds precisely because the $\mathcal{O}_N$
representations are irr... | math.FA | this paper continues the study of orthonormal bases onb of l201 introduced in citedps14 by means of cuntz algebra mathcalo_n representations on l201 for n2 one obtains the classic walsh system we show that the onb property holds precisely because the mathcalo_n representations are irreducible we prove an uncertainty pr... | [['this', 'paper', 'continues', 'the', 'study', 'of', 'orthonormal', 'bases', 'onb', 'of', 'l201', 'introduced', 'in', 'citedps14', 'by', 'means', 'of', 'cuntz', 'algebra', 'mathcalo_n', 'representations', 'on', 'l201', 'for', 'n2', 'one', 'obtains', 'the', 'classic', 'walsh', 'system', 'we', 'show', 'that', 'the', 'on... | [-0.09469390707546341, 0.06312496339971009, -0.06603999597480498, 0.05127495098354138, -0.07524318243545222, -0.10315454308594386, -0.02068611727999411, 0.3653333742306175, -0.37361951307000885, -0.18159691964525795, 0.13527359490153795, -0.2556673647409462, -0.18982847797942448, 0.17992275888212475, -0.145764009572610... |
1,803.00124 | Improving Sentiment Analysis in Arabic Using Word Representation | The complexities of Arabic language in morphology, orthography and dialects
makes sentiment analysis for Arabic more challenging. Also, text feature
extraction from short messages like tweets, in order to gauge the sentiment,
makes this task even more difficult. In recent years, deep neural networks were
often employ... | cs.CL | the complexities of arabic language in morphology orthography and dialects makes sentiment analysis for arabic more challenging also text feature extraction from short messages like tweets in order to gauge the sentiment makes this task even more difficult in recent years deep neural networks were often employed and sh... | [['the', 'complexities', 'of', 'arabic', 'language', 'in', 'morphology', 'orthography', 'and', 'dialects', 'makes', 'sentiment', 'analysis', 'for', 'arabic', 'more', 'challenging', 'also', 'text', 'feature', 'extraction', 'from', 'short', 'messages', 'like', 'tweets', 'in', 'order', 'to', 'gauge', 'the', 'sentiment', '... | [0.0014339859553198092, -0.02767543477706448, -0.048094129985211974, 0.1588835147452493, -0.20508852436370387, -0.1929306339261795, 0.05427046401687918, 0.4937488275179028, -0.2678578740638429, -0.31670302199199796, 0.05130663432391619, -0.37648120892648823, -0.17374885904969797, 0.21764593512834438, -0.147673553284121... |
1,803.00125 | A social Network Analysis of the Operations Research/Industrial
Engineering Faculty Hiring Network | We study the U.S. Operations Research/Industrial-Systems Engineering (ORIE)
faculty hiring network, consisting of 1,179 faculty origin and destination data
together with attribute data from 83 ORIE departments. A social network
analysis of faculty hires can reveal important patterns in an academic field,
such as the ... | stat.AP cs.SI | we study the us operations researchindustrialsystems engineering orie faculty hiring network consisting of 1179 faculty origin and destination data together with attribute data from 83 orie departments a social network analysis of faculty hires can reveal important patterns in an academic field such as the existence of... | [['we', 'study', 'the', 'us', 'operations', 'researchindustrialsystems', 'engineering', 'orie', 'faculty', 'hiring', 'network', 'consisting', 'of', '1179', 'faculty', 'origin', 'and', 'destination', 'data', 'together', 'with', 'attribute', 'data', 'from', '83', 'orie', 'departments', 'a', 'social', 'network', 'analysis... | [-0.07166220248795652, 0.04468494887200014, -0.0824877135551621, 0.08191740155320845, -0.14418199920388342, -0.14571713757802932, 0.08703808007598615, 0.37572586701549204, -0.25133107590842235, -0.36433484747084144, 0.06868488733121433, -0.2965602713730666, -0.17930266727110852, 0.13286835246373774, -0.0615295068428074... |
1,803.00126 | Efficient sampling of reversible cross-linking polymers: Self-assembly
of single-chain polymeric nanoparticles | We present a new simulation technique to study systems of polymers
functionalized by reactive sites that bind/unbind forming reversible linkages.
Functionalized polymers feature self-assembly and responsive properties that
are unmatched by systems lacking selective interactions. The scales at which
the functional pro... | cond-mat.soft cond-mat.stat-mech | we present a new simulation technique to study systems of polymers functionalized by reactive sites that bindunbind forming reversible linkages functionalized polymers feature selfassembly and responsive properties that are unmatched by systems lacking selective interactions the scales at which the functional propertie... | [['we', 'present', 'a', 'new', 'simulation', 'technique', 'to', 'study', 'systems', 'of', 'polymers', 'functionalized', 'by', 'reactive', 'sites', 'that', 'bindunbind', 'forming', 'reversible', 'linkages', 'functionalized', 'polymers', 'feature', 'selfassembly', 'and', 'responsive', 'properties', 'that', 'are', 'unmatc... | [-0.12409703003687148, 0.18933999205626634, -0.03333495570033749, 0.029917101215743765, 0.010121097331542997, -0.1652798869100518, 0.06742023317589205, 0.42307318491019796, -0.291953025844207, -0.28635436279562565, 0.015200053570921529, -0.2911824207792497, -0.14494757369092331, 0.14244068462067216, 0.0214052022413196,... |
1,803.00127 | SalientDSO: Bringing Attention to Direct Sparse Odometry | Although cluttered indoor scenes have a lot of useful high-level semantic
information which can be used for mapping and localization, most Visual
Odometry (VO) algorithms rely on the usage of geometric features such as
points, lines and planes. Lately, driven by this idea, the joint optimization
of semantic labels an... | cs.CV cs.RO | although cluttered indoor scenes have a lot of useful highlevel semantic information which can be used for mapping and localization most visual odometry vo algorithms rely on the usage of geometric features such as points lines and planes lately driven by this idea the joint optimization of semantic labels and obtainin... | [['although', 'cluttered', 'indoor', 'scenes', 'have', 'a', 'lot', 'of', 'useful', 'highlevel', 'semantic', 'information', 'which', 'can', 'be', 'used', 'for', 'mapping', 'and', 'localization', 'most', 'visual', 'odometry', 'vo', 'algorithms', 'rely', 'on', 'the', 'usage', 'of', 'geometric', 'features', 'such', 'as', '... | [-0.04053209247855895, -0.041609960920076565, -0.0724685479853372, 0.04064358315773411, -0.1340955665580723, -0.1404893854515527, 0.03031894971486401, 0.4971649547906842, -0.24468912200600745, -0.3430879901229279, 0.079807663931306, -0.2609996751141478, -0.181272202398716, 0.19971679432654943, -0.15015419037447963, 0.0... |
1,803.00128 | Real-Time Detection of Hybrid and Stealthy Cyber-Attacks in Smart Grid | For a safe and reliable operation of the smart grid, timely detection of
cyber-attacks is of critical importance. Moreover, considering smarter and more
capable attackers, robust detection mechanisms are needed against a diverse
range of cyber-attacks. With these purposes, we propose a robust online
detection algorit... | cs.IT cs.CR math.IT | for a safe and reliable operation of the smart grid timely detection of cyberattacks is of critical importance moreover considering smarter and more capable attackers robust detection mechanisms are needed against a diverse range of cyberattacks with these purposes we propose a robust online detection algorithm for pos... | [['for', 'a', 'safe', 'and', 'reliable', 'operation', 'of', 'the', 'smart', 'grid', 'timely', 'detection', 'of', 'cyberattacks', 'is', 'of', 'critical', 'importance', 'moreover', 'considering', 'smarter', 'and', 'more', 'capable', 'attackers', 'robust', 'detection', 'mechanisms', 'are', 'needed', 'against', 'a', 'diver... | [-0.18431575946458967, 0.03614102022237137, -0.03860967124209685, 0.08901855441132177, -0.09015670103733153, -0.2698372931986609, 0.14363526716483993, 0.3534229412252287, -0.18978725096047955, -0.3238891161148663, 0.16717735236557593, -0.29032072483585414, -0.18563117674833648, 0.23056013617682183, -0.14736696306866506... |
1,803.00129 | Modal approach to the controllability problem of distributed parameter
systems with damping | This paper is devoted to the controllability analysis of a class of linear
control systems in a Hilbert space. It is proposed to use the minimum energy
controls of a reduced lumped parameter system for solving the infinite
dimensional steering problem approximately. Sufficient conditions of the
approximate controllab... | math.OC | this paper is devoted to the controllability analysis of a class of linear control systems in a hilbert space it is proposed to use the minimum energy controls of a reduced lumped parameter system for solving the infinite dimensional steering problem approximately sufficient conditions of the approximate controllabilit... | [['this', 'paper', 'is', 'devoted', 'to', 'the', 'controllability', 'analysis', 'of', 'a', 'class', 'of', 'linear', 'control', 'systems', 'in', 'a', 'hilbert', 'space', 'it', 'is', 'proposed', 'to', 'use', 'the', 'minimum', 'energy', 'controls', 'of', 'a', 'reduced', 'lumped', 'parameter', 'system', 'for', 'solving', '... | [-0.17596353991739605, 0.05511703076543378, -0.040779035836152853, 0.03558022154258472, -0.09390495677448077, -0.14521775106884172, -0.0016889506015834994, 0.31095298739592925, -0.3037547728688013, -0.26912895321357444, 0.1464310977903775, -0.18202009016159373, -0.14000011667214166, 0.18846097286240976, -0.063132380837... |
1,803.0013 | Ring loss: Convex Feature Normalization for Face Recognition | We motivate and present Ring loss, a simple and elegant feature normalization
approach for deep networks designed to augment standard loss functions such as
Softmax. We argue that deep feature normalization is an important aspect of
supervised classification problems where we require the model to represent each
class... | cs.CV | we motivate and present ring loss a simple and elegant feature normalization approach for deep networks designed to augment standard loss functions such as softmax we argue that deep feature normalization is an important aspect of supervised classification problems where we require the model to represent each class in ... | [['we', 'motivate', 'and', 'present', 'ring', 'loss', 'a', 'simple', 'and', 'elegant', 'feature', 'normalization', 'approach', 'for', 'deep', 'networks', 'designed', 'to', 'augment', 'standard', 'loss', 'functions', 'such', 'as', 'softmax', 'we', 'argue', 'that', 'deep', 'feature', 'normalization', 'is', 'an', 'importa... | [-0.055238554191489056, -0.0689698486090686, -0.0440486595876716, 0.06527068712073517, -0.0992515502247868, -0.21940316527271808, -0.017053200394885074, 0.4759351737334354, -0.24339059127505713, -0.31519145725746833, 0.07760583964994827, -0.3030689063784391, -0.160187000978446, 0.2129009532171836, -0.16841028485799858,... |
1,803.00131 | Male pelvic synthetic CT generation from T1-weighted MRI using 2D and 3D
convolutional neural networks | To achieve magnetic resonance (MR)-only radiotherapy, a method needs to be
employed to estimate a synthetic CT (sCT) for generating electron density maps
and patient positioning reference images. We investigated 2D and 3D
convolutional neural network (CNN) methods to generate a male pelvic sCT using
a T1-weighted MR ... | physics.med-ph | to achieve magnetic resonance mronly radiotherapy a method needs to be employed to estimate a synthetic ct sct for generating electron density maps and patient positioning reference images we investigated 2d and 3d convolutional neural network cnn methods to generate a male pelvic sct using a t1weighted mr image a retr... | [['to', 'achieve', 'magnetic', 'resonance', 'mronly', 'radiotherapy', 'a', 'method', 'needs', 'to', 'be', 'employed', 'to', 'estimate', 'a', 'synthetic', 'ct', 'sct', 'for', 'generating', 'electron', 'density', 'maps', 'and', 'patient', 'positioning', 'reference', 'images', 'we', 'investigated', '2d', 'and', '3d', 'con... | [0.039466822959519435, 0.01417495458850968, -0.019781096332927087, 0.047241978323558885, 0.016158766004465225, -0.20009537705290745, 0.014948170468223429, 0.43437069816373924, -0.16184148889059494, -0.3892532132310742, 0.06903688848481244, -0.3532256248627642, -0.10874433970897562, 0.22276438062468323, -0.1200625382357... |
1,803.00132 | Development of GEM Detectors at Hampton University | Two GEM telescopes, each consisting of three 10x10 cm$^2$ triple-GEM chambers
were built, tested and operated by the Hampton University group. The GEMs are
read out with APV25 frontend chips and FPGA based digitizing electronics
developed by INFN Rome.
The telescopes were used for the luminosity monitoring system a... | physics.ins-det nucl-ex | two gem telescopes each consisting of three 10x10 cm2 triplegem chambers were built tested and operated by the hampton university group the gems are read out with apv25 frontend chips and fpga based digitizing electronics developed by infn rome the telescopes were used for the luminosity monitoring system at the olympu... | [['two', 'gem', 'telescopes', 'each', 'consisting', 'of', 'three', '10x10', 'cm2', 'triplegem', 'chambers', 'were', 'built', 'tested', 'and', 'operated', 'by', 'the', 'hampton', 'university', 'group', 'the', 'gems', 'are', 'read', 'out', 'with', 'apv25', 'frontend', 'chips', 'and', 'fpga', 'based', 'digitizing', 'elect... | [-0.04506660052575171, 0.15523984539264346, -0.0812169220458184, -0.009307902712774064, -0.005355230202632291, -0.19724423226501261, -0.053473905907677755, 0.3931013482596193, -0.1369307294614347, -0.35456983646644014, 0.11466858541526433, -0.3563853050582111, 0.032991914530949934, 0.2581051851662674, -0.02306530923715... |
1,803.00133 | Materials data validation and imputation with an artificial neural
network | We apply an artificial neural network to model and verify material
properties. The neural network algorithm has a unique capability to handle
incomplete data sets in both training and predicting, so it can regard
properties as inputs allowing it to exploit both composition-property and
property-property correlations ... | physics.comp-ph cond-mat.mtrl-sci | we apply an artificial neural network to model and verify material properties the neural network algorithm has a unique capability to handle incomplete data sets in both training and predicting so it can regard properties as inputs allowing it to exploit both compositionproperty and propertyproperty correlations to enh... | [['we', 'apply', 'an', 'artificial', 'neural', 'network', 'to', 'model', 'and', 'verify', 'material', 'properties', 'the', 'neural', 'network', 'algorithm', 'has', 'a', 'unique', 'capability', 'to', 'handle', 'incomplete', 'data', 'sets', 'in', 'both', 'training', 'and', 'predicting', 'so', 'it', 'can', 'regard', 'prop... | [-0.044361913106260226, -0.00022967970439775358, -0.07983321860461429, 0.09231313524081267, -0.0911476614443374, -0.19725877644263745, 0.05007619435716536, 0.44828244867091327, -0.27457547882936667, -0.35041844298506214, 0.10344844739872136, -0.30519224462320205, -0.16306475634907477, 0.21320620309513486, -0.0773770929... |
1,803.00134 | A Characterization of Boundary Representations of Positive Matrices in
the Hardy Space via the Abel Product | Spectral measures give rise to a natural harmonic analysis on the unit disc
via a boundary representation of a positive matrix arising from a spectrum of
the measure. We consider in this paper the reverse: for a positive matrix in
the Hardy space of the unit disc we consider which measures, if any, yield a
boundary r... | math.FA math.CV | spectral measures give rise to a natural harmonic analysis on the unit disc via a boundary representation of a positive matrix arising from a spectrum of the measure we consider in this paper the reverse for a positive matrix in the hardy space of the unit disc we consider which measures if any yield a boundary represe... | [['spectral', 'measures', 'give', 'rise', 'to', 'a', 'natural', 'harmonic', 'analysis', 'on', 'the', 'unit', 'disc', 'via', 'a', 'boundary', 'representation', 'of', 'a', 'positive', 'matrix', 'arising', 'from', 'a', 'spectrum', 'of', 'the', 'measure', 'we', 'consider', 'in', 'this', 'paper', 'the', 'reverse', 'for', 'a... | [-0.1129241903278842, 0.08027341588209551, -0.09470094091831202, 0.0548693266548553, -0.04591675843280482, -0.0927830967681864, 0.04278735262313745, 0.3197798676429743, -0.3199529630098357, -0.1678604428398322, 0.15301882566783173, -0.2658814384029752, -0.17866177008633155, 0.16075012315603265, -0.06757626596120107, 0.... |
1,803.00135 | Quantum annealing versus classical machine learning applied to a
simplified computational biology problem | Transcription factors regulate gene expression, but how these proteins
recognize and specifically bind to their DNA targets is still debated. Machine
learning models are effective means to reveal interaction mechanisms. Here we
studied the ability of a quantum machine learning approach to predict binding
specificity.... | quant-ph q-bio.GN | transcription factors regulate gene expression but how these proteins recognize and specifically bind to their dna targets is still debated machine learning models are effective means to reveal interaction mechanisms here we studied the ability of a quantum machine learning approach to predict binding specificity using... | [['transcription', 'factors', 'regulate', 'gene', 'expression', 'but', 'how', 'these', 'proteins', 'recognize', 'and', 'specifically', 'bind', 'to', 'their', 'dna', 'targets', 'is', 'still', 'debated', 'machine', 'learning', 'models', 'are', 'effective', 'means', 'to', 'reveal', 'interaction', 'mechanisms', 'here', 'we... | [-0.0369965794330991, 0.07711413696233649, -0.047610421171224354, 0.13492698212163584, -0.08495940856835586, -0.25425374167252507, 0.07759424097267223, 0.4536643246276267, -0.27731443826720936, -0.34669118246763647, 0.00668166574690766, -0.2611550823504093, -0.1906343223675523, 0.23553215944201955, -0.09173754461722186... |
1,803.00136 | Structure of Anomalies of 4d SCFTs from M5-branes, and Anomaly Inflow | We study the 't Hooft anomalies of four-dimensional superconformal field
theories that arise from M5-branes wrapped on a punctured Riemann surface. In
general there are two independent contributions to the anomalies. There is a
bulk term obtained by integrating the anomaly polynomial of the world-volume
theory on the... | hep-th | we study the t hooft anomalies of fourdimensional superconformal field theories that arise from m5branes wrapped on a punctured riemann surface in general there are two independent contributions to the anomalies there is a bulk term obtained by integrating the anomaly polynomial of the worldvolume theory on the m5brane... | [['we', 'study', 'the', 't', 'hooft', 'anomalies', 'of', 'fourdimensional', 'superconformal', 'field', 'theories', 'that', 'arise', 'from', 'm5branes', 'wrapped', 'on', 'a', 'punctured', 'riemann', 'surface', 'in', 'general', 'there', 'are', 'two', 'independent', 'contributions', 'to', 'the', 'anomalies', 'there', 'is'... | [-0.18435730833897557, 0.12289438716696913, -0.061874904401241035, 0.07078201841474988, -0.0706788653280498, -0.11887401097828126, -0.006051666811878581, 0.25106315827363823, -0.22691227742434134, -0.27092791208264044, 0.0983815740832443, -0.32748085922400255, -0.17846890123319029, 0.13128074683894322, -0.0798716399906... |
1,803.00137 | Low-mass eclipsing binaries in the WFCAM Transit Survey: the persistence
of the M-dwarf radius inflation problem | We present the characterization of 5 new short-period low-mass eclipsing
binaries from the WFCAM Transit Survey. The analysis was performed by using the
photometric WFCAM J-mag data and additional low- and intermediate-resolution
spectroscopic data to obtain both orbital and physical properties of the
studied sample.... | astro-ph.SR | we present the characterization of 5 new shortperiod lowmass eclipsing binaries from the wfcam transit survey the analysis was performed by using the photometric wfcam jmag data and additional low and intermediateresolution spectroscopic data to obtain both orbital and physical properties of the studied sample the ligh... | [['we', 'present', 'the', 'characterization', 'of', '5', 'new', 'shortperiod', 'lowmass', 'eclipsing', 'binaries', 'from', 'the', 'wfcam', 'transit', 'survey', 'the', 'analysis', 'was', 'performed', 'by', 'using', 'the', 'photometric', 'wfcam', 'jmag', 'data', 'and', 'additional', 'low', 'and', 'intermediateresolution'... | [-0.09345318699210031, 0.15231091584500972, -0.07304040862996455, 0.08866994591055276, -0.06291829009196194, -0.10954608261261298, 0.06569098838524003, 0.3919360326765024, -0.16796732274005594, -0.43157525879695363, 0.08163511335859885, -0.3309183148916497, -0.012661775846398719, 0.24936102933209875, -0.045986079920650... |
1,803.00138 | A novel approach for fusion of heterogeneous sources of data | With advancements in sensor technology, a heterogeneous set of data,
containing samples of scalar, waveform signal, image, or even structured point
cloud are becoming increasingly popular. Developing a statistical model,
representing the behavior of the underlying system based upon such a
heterogeneous set of data ca... | stat.ME | with advancements in sensor technology a heterogeneous set of data containing samples of scalar waveform signal image or even structured point cloud are becoming increasingly popular developing a statistical model representing the behavior of the underlying system based upon such a heterogeneous set of data can be used... | [['with', 'advancements', 'in', 'sensor', 'technology', 'a', 'heterogeneous', 'set', 'of', 'data', 'containing', 'samples', 'of', 'scalar', 'waveform', 'signal', 'image', 'or', 'even', 'structured', 'point', 'cloud', 'are', 'becoming', 'increasingly', 'popular', 'developing', 'a', 'statistical', 'model', 'representing'... | [-0.0879144120385701, 0.023645053622842003, -0.06241776602258059, 0.0468196172160242, -0.06566513290205463, -0.13126195001669905, 0.04649991508530961, 0.3899289793588898, -0.2950734226236289, -0.33615638968958095, 0.15063142893539572, -0.2800278573737226, -0.17169531976401975, 0.20079282168679954, -0.061205355025489225... |
1,803.00139 | Stochastic multi-symplectic Runge-Kutta methods for stochastic
Hamiltonian PDEs | In this paper, we consider stochastic Runge-Kutta methods for stochastic
Hamiltonian partial differential equations and present some sufficient
conditions for multisymplecticity of stochastic Runge-Kutta methods of
stochastic Hamiltonian partial differential equations. Particularly, we apply
these ideas to stochastic... | math.SG | in this paper we consider stochastic rungekutta methods for stochastic hamiltonian partial differential equations and present some sufficient conditions for multisymplecticity of stochastic rungekutta methods of stochastic hamiltonian partial differential equations particularly we apply these ideas to stochastic maxwel... | [['in', 'this', 'paper', 'we', 'consider', 'stochastic', 'rungekutta', 'methods', 'for', 'stochastic', 'hamiltonian', 'partial', 'differential', 'equations', 'and', 'present', 'some', 'sufficient', 'conditions', 'for', 'multisymplecticity', 'of', 'stochastic', 'rungekutta', 'methods', 'of', 'stochastic', 'hamiltonian',... | [-0.15931139789521695, 0.013220791518688203, -0.09463959952195486, 0.11567195475567132, -0.13079344011532765, -0.16828373265452684, -0.05970373607706279, 0.27434659615159035, -0.3399858028938373, -0.29728551316385465, 0.08387333446958413, -0.27520129903530083, -0.1739579748734832, 0.12446430622289578, -0.12816284899910... |
1,803.0014 | Homological approximations for Profinite and Pro-$p$ limit groups | We study homological approximations of the profinite completion of a limit
group (see Thm.~A) and obtain the analogous of Bridson and Howie's Theorem for
the profinite completion of a non-abelian limit group (see Thm.~B).
| math.GR | we study homological approximations of the profinite completion of a limit group see thma and obtain the analogous of bridson and howies theorem for the profinite completion of a nonabelian limit group see thmb | [['we', 'study', 'homological', 'approximations', 'of', 'the', 'profinite', 'completion', 'of', 'a', 'limit', 'group', 'see', 'thma', 'and', 'obtain', 'the', 'analogous', 'of', 'bridson', 'and', 'howies', 'theorem', 'for', 'the', 'profinite', 'completion', 'of', 'a', 'nonabelian', 'limit', 'group', 'see', 'thmb']] | [-0.12836250007967465, 0.0388282775238622, -0.20992745808325708, 0.14079299056902528, -0.066238482540939, -0.08277065472793765, 0.10949778664507903, 0.298450589296408, -0.27272264566272497, -0.23521687230095267, 0.18289645049662795, -0.21234874450601637, -0.12423381255939603, 0.17844953655730933, -0.18481194143532775, ... |
1,803.00141 | Entanglement concentration and purification of two-mode squeezed
microwave photons in circuit QED | We present a theoretical proposal for a physical implementation of
entanglement concentration and purification protocols for two-mode squeezed
microwave photons in circuit quantum electrodynamics (QED). First, we give the
description of the cross-Kerr effect induced between two resonators in circuit
QED. Then we use ... | quant-ph | we present a theoretical proposal for a physical implementation of entanglement concentration and purification protocols for twomode squeezed microwave photons in circuit quantum electrodynamics qed first we give the description of the crosskerr effect induced between two resonators in circuit qed then we use the cross... | [['we', 'present', 'a', 'theoretical', 'proposal', 'for', 'a', 'physical', 'implementation', 'of', 'entanglement', 'concentration', 'and', 'purification', 'protocols', 'for', 'twomode', 'squeezed', 'microwave', 'photons', 'in', 'circuit', 'quantum', 'electrodynamics', 'qed', 'first', 'we', 'give', 'the', 'description',... | [-0.15130796781005829, 0.20950208755267227, -0.045328654324341765, -0.03263404481970754, -0.0063239768670316325, -0.24601162735601528, 0.06498241337146937, 0.3741674370606217, -0.19364908955206997, -0.27950269473602246, -0.0027105679384253002, -0.26397529877558873, -0.10954268523410224, 0.28575276531148375, -0.06014952... |
1,803.00142 | Invariants of deformations of quotient surface singularities | We find all $P$-resolutions of quotient surface singularities (especially,
tetrahedral, octahedral, and icosahedral singularities) together with their
dual graphs, which reproduces Jan Steven's list [Manuscripta Math. 1993] of the
numbers of $P$-resolutions of each singularities. We then compute the
dimensions and Mi... | math.AG math.GT math.SG | we find all presolutions of quotient surface singularities especially tetrahedral octahedral and icosahedral singularities together with their dual graphs which reproduces jan stevens list manuscripta math 1993 of the numbers of presolutions of each singularities we then compute the dimensions and milnor numbers of the... | [['we', 'find', 'all', 'presolutions', 'of', 'quotient', 'surface', 'singularities', 'especially', 'tetrahedral', 'octahedral', 'and', 'icosahedral', 'singularities', 'together', 'with', 'their', 'dual', 'graphs', 'which', 'reproduces', 'jan', 'stevens', 'list', 'manuscripta', 'math', '1993', 'of', 'the', 'numbers', 'o... | [-0.19011506481849133, 0.050644189462908676, -0.039047629803630475, 0.05213131761535051, -0.07715962457814063, -0.154728677229467, 0.003787608908040198, 0.32208258587642447, -0.23745101557529352, -0.2550890305680586, 0.0765205773554663, -0.2937948699142282, -0.19970342591867274, 0.1484816610426741, -0.16853373311790273... |
1,803.00143 | The PPT square conjecture holds generically for some classes of
independent states | Let $|\psi\rangle\langle \psi|$ be a random pure state on
$\mathbb{C}^{d^2}\otimes \mathbb{C}^s$, where $\psi$ is a random unit vector
uniformly distributed on the sphere in $\mathbb{C}^{d^2}\otimes \mathbb{C}^s$.
Let $\rho_1$ be random induced states
$\rho_1=Tr_{\mathbb{C}^s}(|\psi\rangle\langle \psi |)$ whose distr... | math-ph math.MP math.PR | let psiranglelangle psi be a random pure state on mathbbcd2otimes mathbbcs where psi is a random unit vector uniformly distributed on the sphere in mathbbcd2otimes mathbbcs let rho_1 be random induced states rho_1tr_mathbbcspsiranglelangle psi whose distribution is mu_d2s and let rho_2 be random induced states followin... | [['let', 'psiranglelangle', 'psi', 'be', 'a', 'random', 'pure', 'state', 'on', 'mathbbcd2otimes', 'mathbbcs', 'where', 'psi', 'is', 'a', 'random', 'unit', 'vector', 'uniformly', 'distributed', 'on', 'the', 'sphere', 'in', 'mathbbcd2otimes', 'mathbbcs', 'let', 'rho_1', 'be', 'random', 'induced', 'states', 'rho_1tr_mathb... | [-0.15518117641573245, 0.3094950332362611, -0.12453879674299145, -0.06260323896894301, 0.041027938261768725, -0.2287472277607347, 0.005812053539008254, 0.347507327127288, -0.31036355796287646, -0.11953442422497385, 0.03127023117629952, -0.3369495451344915, -0.058794479199931166, 0.09737695381045341, -0.0195898252258182... |
1,803.00144 | Learning Longer-term Dependencies in RNNs with Auxiliary Losses | Despite recent advances in training recurrent neural networks (RNNs),
capturing long-term dependencies in sequences remains a fundamental challenge.
Most approaches use backpropagation through time (BPTT), which is difficult to
scale to very long sequences. This paper proposes a simple method that improves
the abilit... | cs.LG cs.AI stat.ML | despite recent advances in training recurrent neural networks rnns capturing longterm dependencies in sequences remains a fundamental challenge most approaches use backpropagation through time bptt which is difficult to scale to very long sequences this paper proposes a simple method that improves the ability to captur... | [['despite', 'recent', 'advances', 'in', 'training', 'recurrent', 'neural', 'networks', 'rnns', 'capturing', 'longterm', 'dependencies', 'in', 'sequences', 'remains', 'a', 'fundamental', 'challenge', 'most', 'approaches', 'use', 'backpropagation', 'through', 'time', 'bptt', 'which', 'is', 'difficult', 'to', 'scale', 't... | [-0.04990213436497364, -0.0077459128319815745, -0.04539660026285043, 0.12410387976675015, -0.10333558932186727, -0.16246024263091385, 0.05800466473639994, 0.4965495123796485, -0.3121623668392572, -0.3383113124687796, 0.08834649492455132, -0.2506931796155733, -0.20868679009659352, 0.20920061180510907, -0.126881835212291... |
1,803.00145 | Critical behavior of magnetization in URhAl:Quasi-two-dimensional Ising
system with long-range interactions | The critical behavior of dc magnetization in the uranium ferromagnet URhAl
with the hexagonal ZrNiAl-type crystal structure has been studied around the
ferromagnetic transition temperature T_C. The critical exponent beta for the
temperature dependence of the spontaneous magnetization below T_C, gamma for
the magnetic... | cond-mat.str-el | the critical behavior of dc magnetization in the uranium ferromagnet urhal with the hexagonal zrnialtype crystal structure has been studied around the ferromagnetic transition temperature t_c the critical exponent beta for the temperature dependence of the spontaneous magnetization below t_c gamma for the magnetic susc... | [['the', 'critical', 'behavior', 'of', 'dc', 'magnetization', 'in', 'the', 'uranium', 'ferromagnet', 'urhal', 'with', 'the', 'hexagonal', 'zrnialtype', 'crystal', 'structure', 'has', 'been', 'studied', 'around', 'the', 'ferromagnetic', 'transition', 'temperature', 't_c', 'the', 'critical', 'exponent', 'beta', 'for', 't... | [-0.1406355302801033, 0.19679975050307194, -0.045234607081281894, 0.02524698108680341, -0.028384837830108298, -0.18112785387674243, 0.0831865440626944, 0.34666315816282334, -0.2246113469536365, -0.28372988741346233, 0.0047045436680434255, -0.3791218635765469, -0.09440359849676189, 0.1757730907140901, 0.1215672085325666... |
1,803.00146 | A Generic Top-N Recommendation Framework For Trading-off Accuracy,
Novelty, and Coverage | Standard collaborative filtering approaches for top-N recommendation are
biased toward popular items. As a result, they recommend items that users are
likely aware of and under-represent long-tail items. This is inadequate, both
for consumers who prefer novel items and because concentrating on popular items
poorly co... | cs.IR | standard collaborative filtering approaches for topn recommendation are biased toward popular items as a result they recommend items that users are likely aware of and underrepresent longtail items this is inadequate both for consumers who prefer novel items and because concentrating on popular items poorly covers the ... | [['standard', 'collaborative', 'filtering', 'approaches', 'for', 'topn', 'recommendation', 'are', 'biased', 'toward', 'popular', 'items', 'as', 'a', 'result', 'they', 'recommend', 'items', 'that', 'users', 'are', 'likely', 'aware', 'of', 'and', 'underrepresent', 'longtail', 'items', 'this', 'is', 'inadequate', 'both', ... | [-0.031085303127636306, -0.04365106765413253, -0.007434241444570944, 0.11330516155188282, -0.20594134161041844, -0.21750040121939188, 0.17168035567576428, 0.48156529935982284, -0.2233732738920177, -0.3486673176780136, 0.026573459903425425, -0.38246760565218413, -0.13139912843083343, 0.11185088292889607, -0.169788214863... |
1,803.00147 | Non-Hamiltonian Kelvin wave generation on vortices in Bose-Einstein
condensates | Ultra-cold quantum turbulence is expected to decay through a cascade of
Kelvin waves. These helical excitations couple vorticity to the quantum fluid
causing long wavelength phonon fluctuations in a Bose-Einstein condensate. This
interaction is hypothesized to be the route to relaxation for turbulent tangles
in quant... | cond-mat.quant-gas cond-mat.stat-mech math-ph math.MP | ultracold quantum turbulence is expected to decay through a cascade of kelvin waves these helical excitations couple vorticity to the quantum fluid causing long wavelength phonon fluctuations in a boseeinstein condensate this interaction is hypothesized to be the route to relaxation for turbulent tangles in quantum hyd... | [['ultracold', 'quantum', 'turbulence', 'is', 'expected', 'to', 'decay', 'through', 'a', 'cascade', 'of', 'kelvin', 'waves', 'these', 'helical', 'excitations', 'couple', 'vorticity', 'to', 'the', 'quantum', 'fluid', 'causing', 'long', 'wavelength', 'phonon', 'fluctuations', 'in', 'a', 'boseeinstein', 'condensate', 'thi... | [-0.196132467600491, 0.1677616418597188, -0.11255191159861318, 0.07621458065798098, -0.12525711805569897, -0.08286264691820955, -0.02412708713190697, 0.3185551166942573, -0.3079343841325833, -0.23816010097702187, 0.020980532599735514, -0.2476833907857656, -0.12892891218017535, 0.14474192133685387, 0.01787924779527097, ... |
1,803.00148 | Prospects for Detecting light bosons at the FCC-ee and CEPC | We look at the prospects for detecting light bosons, $X$, at proposed Z
factories assuming a production of $10^{12}$ Z bosons. Such a large yield is
within the design goals of future FCC-ee and CEPC colliders. Specifically we
look at the cases where $X$ is either a singlet scalar which mixes with the
standard model H... | hep-ph hep-ex | we look at the prospects for detecting light bosons x at proposed z factories assuming a production of 1012 z bosons such a large yield is within the design goals of future fccee and cepc colliders specifically we look at the cases where x is either a singlet scalar which mixes with the standard model higgs or a vector... | [['we', 'look', 'at', 'the', 'prospects', 'for', 'detecting', 'light', 'bosons', 'x', 'at', 'proposed', 'z', 'factories', 'assuming', 'a', 'production', 'of', '1012', 'z', 'bosons', 'such', 'a', 'large', 'yield', 'is', 'within', 'the', 'design', 'goals', 'of', 'future', 'fccee', 'and', 'cepc', 'colliders', 'specificall... | [-0.10911542545031887, 0.2206452339969314, -0.020882253906803958, 0.13198595019077816, -0.038478557457493845, -0.24155055021197258, 0.05394857590037741, 0.3790246865695767, -0.22340651482278318, -0.24361961175230118, 0.05448666488110464, -0.30801503622920756, -0.009611426290990622, 0.20465207493480034, 0.08774640928880... |
1,803.00149 | Deep Learning for Causal Inference | In this paper, we propose deep learning techniques for econometrics,
specifically for causal inference and for estimating individual as well as
average treatment effects. The contribution of this paper is twofold: 1. For
generalized neighbor matching to estimate individual and average treatment
effects, we analyze th... | econ.EM cs.LG stat.ML | in this paper we propose deep learning techniques for econometrics specifically for causal inference and for estimating individual as well as average treatment effects the contribution of this paper is twofold 1 for generalized neighbor matching to estimate individual and average treatment effects we analyze the use of... | [['in', 'this', 'paper', 'we', 'propose', 'deep', 'learning', 'techniques', 'for', 'econometrics', 'specifically', 'for', 'causal', 'inference', 'and', 'for', 'estimating', 'individual', 'as', 'well', 'as', 'average', 'treatment', 'effects', 'the', 'contribution', 'of', 'this', 'paper', 'is', 'twofold', '1', 'for', 'ge... | [-0.003368111758609302, -0.026908487984910606, -0.06116030066041276, 0.13363882342528086, -0.1124107412644662, -0.17921372807817534, 0.08236205250374042, 0.4619634759798646, -0.2355424701422453, -0.32850495480699465, 0.09348935928836, -0.29038870136719197, -0.1884973086518585, 0.13515927084721624, -0.07189441596390679,... |
1,803.0015 | Cavity-free quantum optomechanical cooling by atom-modulated radiation | We theoretically study the radiation-induced interaction between the
mechanical motion of an oscillating mirror and a remotely trapped atomic cloud.
When illuminated by continuous-wave radiation, the mirror motion will induce
red and blue sideband radiation, which respectively increases and reduces
motional excitatio... | quant-ph | we theoretically study the radiationinduced interaction between the mechanical motion of an oscillating mirror and a remotely trapped atomic cloud when illuminated by continuouswave radiation the mirror motion will induce red and blue sideband radiation which respectively increases and reduces motional excitation we fi... | [['we', 'theoretically', 'study', 'the', 'radiationinduced', 'interaction', 'between', 'the', 'mechanical', 'motion', 'of', 'an', 'oscillating', 'mirror', 'and', 'a', 'remotely', 'trapped', 'atomic', 'cloud', 'when', 'illuminated', 'by', 'continuouswave', 'radiation', 'the', 'mirror', 'motion', 'will', 'induce', 'red',... | [-0.11543448196449714, 0.2778729570313454, -0.05683436243643248, -0.00409214295008454, -0.07525869671890671, -0.13712848354737425, 0.058034718136822934, 0.4188589145566604, -0.2629148042796887, -0.3278479676462652, -0.005871121942195608, -0.2853951316216082, -0.0332163802434712, 0.19538622883567225, -0.0453878409281560... |
1,803.00151 | A Simple Nearly-Optimal Restart Scheme For Speeding-Up First Order
Methods | We present a simple scheme for restarting first-order methods for convex
optimization problems. Restarts are made based only on achieving specified
decreases in objective values, the specified amounts being the same for all
optimization problems. Unlike existing restart schemes, the scheme makes no
attempt to learn p... | math.OC | we present a simple scheme for restarting firstorder methods for convex optimization problems restarts are made based only on achieving specified decreases in objective values the specified amounts being the same for all optimization problems unlike existing restart schemes the scheme makes no attempt to learn paramete... | [['we', 'present', 'a', 'simple', 'scheme', 'for', 'restarting', 'firstorder', 'methods', 'for', 'convex', 'optimization', 'problems', 'restarts', 'are', 'made', 'based', 'only', 'on', 'achieving', 'specified', 'decreases', 'in', 'objective', 'values', 'the', 'specified', 'amounts', 'being', 'the', 'same', 'for', 'all'... | [-0.08144759275253956, 0.01707772400042829, -0.08013948776266154, 0.1039731874514152, -0.14163105411282859, -0.1988117776521552, 0.06258678054163123, 0.4223096497169062, -0.27812792972794603, -0.29745451162154435, 0.15645559687370889, -0.19604407429710782, -0.13461818640754253, 0.2503405103006032, -0.12524495605661087,... |
1,803.00152 | A Global Information Based Adaptive Threshold for Grouping Large Scale
Global Optimization Problems | By taking the idea of divide-and-conquer, cooperative coevolution (CC)
provides a powerful architecture for large scale global optimization (LSGO)
problems, but its efficiency relies highly on the decomposition strategy. It
has been shown that differential grouping (DG) performs well on decomposing
LSGO problems by e... | cs.NE | by taking the idea of divideandconquer cooperative coevolution cc provides a powerful architecture for large scale global optimization lsgo problems but its efficiency relies highly on the decomposition strategy it has been shown that differential grouping dg performs well on decomposing lsgo problems by effectively de... | [['by', 'taking', 'the', 'idea', 'of', 'divideandconquer', 'cooperative', 'coevolution', 'cc', 'provides', 'a', 'powerful', 'architecture', 'for', 'large', 'scale', 'global', 'optimization', 'lsgo', 'problems', 'but', 'its', 'efficiency', 'relies', 'highly', 'on', 'the', 'decomposition', 'strategy', 'it', 'has', 'been'... | [-0.11261797669549407, 0.02086609522378895, -0.09703294806443642, 0.06510167588753257, -0.08093366196898874, -0.13163756919066358, 0.0752198472991315, 0.3492981955452367, -0.27171117440949, -0.33423458158747876, 0.13015558119717074, -0.23293021821611842, -0.14411184709616612, 0.216577950452162, -0.057612415256931684, 0... |
1,803.00153 | Drift and its mediation in terrestrial orbits | The slow deformation of terrestrial orbits in the medium range, subject to
lunisolar resonances, is well approximated by a family of Hamiltonian flow with
$2.5$ degree-of-freedom. The action variables of the system may experience
chaotic variations and large drift that we may quantify. Using variational
chaos indicat... | nlin.CD astro-ph.EP | the slow deformation of terrestrial orbits in the medium range subject to lunisolar resonances is well approximated by a family of hamiltonian flow with 25 degreeoffreedom the action variables of the system may experience chaotic variations and large drift that we may quantify using variational chaos indicators we comp... | [['the', 'slow', 'deformation', 'of', 'terrestrial', 'orbits', 'in', 'the', 'medium', 'range', 'subject', 'to', 'lunisolar', 'resonances', 'is', 'well', 'approximated', 'by', 'a', 'family', 'of', 'hamiltonian', 'flow', 'with', '25', 'degreeoffreedom', 'the', 'action', 'variables', 'of', 'the', 'system', 'may', 'experie... | [-0.1872104614628884, 0.13067443059838335, -0.10735403117926225, 0.07600645778660217, -0.07156136456026656, -0.08548114448380859, 0.048351728932365126, 0.3297911957068288, -0.27695492066280997, -0.29890903302508853, 0.13389977693416016, -0.23411102016334948, -0.17557521677859453, 0.20107209387680758, -0.088420624427659... |
1,803.00154 | Structural and Thermal Stability of Graphyne and Graphdiyne Nanoscroll
Structures | Graphynes and graphdiynes are generic names for families of two-dimensional
carbon allotropes, where acetylenic groups connect benzenoid-like hexagonal
rings, with the co-existence of sp and sp2 hybridized carbon atoms. The main
differences between graphynes and graphdiynes are the number of acetylenic
groups (one an... | cond-mat.mes-hall cond-mat.mtrl-sci | graphynes and graphdiynes are generic names for families of twodimensional carbon allotropes where acetylenic groups connect benzenoidlike hexagonal rings with the coexistence of sp and sp2 hybridized carbon atoms the main differences between graphynes and graphdiynes are the number of acetylenic groups one and two for... | [['graphynes', 'and', 'graphdiynes', 'are', 'generic', 'names', 'for', 'families', 'of', 'twodimensional', 'carbon', 'allotropes', 'where', 'acetylenic', 'groups', 'connect', 'benzenoidlike', 'hexagonal', 'rings', 'with', 'the', 'coexistence', 'of', 'sp', 'and', 'sp2', 'hybridized', 'carbon', 'atoms', 'the', 'main', 'd... | [-0.1268960425854419, 0.17987375652193333, -0.0166586114460154, 0.013615893757108737, 0.03726836878599392, -0.14255988304330794, 0.041856454950929795, 0.4618573127314448, -0.2836537023074925, -0.2682197170952956, 0.02816027210145775, -0.2977432620608144, -0.15712558820291803, 0.16206894730804144, 0.024552162480109406, ... |
1,803.00155 | Blue straggler stars beyond the Milky Way: a non-segregated population
in the Large Magellanic Cloud cluster NGC 2213 | Using the high-resolution observations obtained by the Hubble Space
Telescope, we analyzed the blue straggler stars (BSSs) in the Large Magellanic
Cloud cluster NGC 2213. We found that the radial distribution of BSSs is
consistent with that of the normal giant stars in NGC 2213, showing no evidence
of mass segregatio... | astro-ph.SR astro-ph.GA | using the highresolution observations obtained by the hubble space telescope we analyzed the blue straggler stars bsss in the large magellanic cloud cluster ngc 2213 we found that the radial distribution of bsss is consistent with that of the normal giant stars in ngc 2213 showing no evidence of mass segregation howeve... | [['using', 'the', 'highresolution', 'observations', 'obtained', 'by', 'the', 'hubble', 'space', 'telescope', 'we', 'analyzed', 'the', 'blue', 'straggler', 'stars', 'bsss', 'in', 'the', 'large', 'magellanic', 'cloud', 'cluster', 'ngc', '2213', 'we', 'found', 'that', 'the', 'radial', 'distribution', 'of', 'bsss', 'is', '... | [-0.11883212305581982, 0.09714914622664256, -0.1552217344437878, 0.11962165355202069, -0.07172563218704935, -0.012076839082727924, 0.09267376759528832, 0.412737211323806, -0.14196253353554122, -0.3242258760761821, 0.005496588006978796, -0.24267962847985677, -0.0608503843698674, 0.2306202640200514, -0.03396124662479983,... |
1,803.00156 | Autoencoding topology | The problem of learning a manifold structure on a dataset is framed in terms
of a generative model, to which we use ideas behind autoencoders (namely
adversarial/Wasserstein autoencoders) to fit deep neural networks. From a
machine learning perspective, the resulting structure, an atlas of a manifold,
may be viewed a... | stat.ML cs.LG | the problem of learning a manifold structure on a dataset is framed in terms of a generative model to which we use ideas behind autoencoders namely adversarialwasserstein autoencoders to fit deep neural networks from a machine learning perspective the resulting structure an atlas of a manifold may be viewed as a combin... | [['the', 'problem', 'of', 'learning', 'a', 'manifold', 'structure', 'on', 'a', 'dataset', 'is', 'framed', 'in', 'terms', 'of', 'a', 'generative', 'model', 'to', 'which', 'we', 'use', 'ideas', 'behind', 'autoencoders', 'namely', 'adversarialwasserstein', 'autoencoders', 'to', 'fit', 'deep', 'neural', 'networks', 'from',... | [-0.02523102438620602, -0.031403665256986735, -0.151201281696558, 0.11798140768721503, -0.1442871982591194, -0.15656903224360003, 0.014839489454109418, 0.39085377360645096, -0.3630584597489552, -0.3109608844510819, 0.07775540617417152, -0.25634524833999184, -0.2502490094160302, 0.14764730164601483, -0.15006963408699162... |
1,803.00157 | GOODS-ALMA: 1.1 mm galaxy survey - I. Source catalogue and optically
dark galaxies | We present a 69 arcmin$^2$ ALMA survey at 1.1mm, GOODS-ALMA, matching the
deepest HST-WFC3 H-band part of the GOODS-South field. We taper the 0"24
original image with a homogeneous and circular synthesized beam of 0"60 to
reduce the number of independent beams - thus reducing the number of purely
statistical spurious... | astro-ph.GA | we present a 69 arcmin2 alma survey at 11mm goodsalma matching the deepest hstwfc3 hband part of the goodssouth field we taper the 024 original image with a homogeneous and circular synthesized beam of 060 to reduce the number of independent beams thus reducing the number of purely statistical spurious detections and o... | [['we', 'present', 'a', '69', 'arcmin2', 'alma', 'survey', 'at', '11mm', 'goodsalma', 'matching', 'the', 'deepest', 'hstwfc3', 'hband', 'part', 'of', 'the', 'goodssouth', 'field', 'we', 'taper', 'the', '024', 'original', 'image', 'with', 'a', 'homogeneous', 'and', 'circular', 'synthesized', 'beam', 'of', '060', 'to', '... | [-0.042749293906622216, 0.07377977716377214, -0.023763827586161166, 0.05685780305447506, -0.0903815897229802, -0.07789597106928906, 0.0993047213840202, 0.4537967366888991, -0.08961438603281718, -0.42292781697489834, 0.08275559245220361, -0.3581342436365707, 0.009560215327856612, 0.2057181716053586, -0.01857465534824235... |
1,803.00158 | Modeling reverse thinking for machine learning | Human inertial thinking schemes can be formed through learning, which are
then applied to quickly solve similar problems later. However, when problems
are significantly different, inertial thinking generally presents the solutions
that are definitely imperfect. In such cases, people will apply creative
thinking, such... | cs.LG cs.AI stat.ML | human inertial thinking schemes can be formed through learning which are then applied to quickly solve similar problems later however when problems are significantly different inertial thinking generally presents the solutions that are definitely imperfect in such cases people will apply creative thinking such as rever... | [['human', 'inertial', 'thinking', 'schemes', 'can', 'be', 'formed', 'through', 'learning', 'which', 'are', 'then', 'applied', 'to', 'quickly', 'solve', 'similar', 'problems', 'later', 'however', 'when', 'problems', 'are', 'significantly', 'different', 'inertial', 'thinking', 'generally', 'presents', 'the', 'solutions'... | [-0.00691177919185881, 0.15008171958977293, -0.1311919404193759, 0.10518167574713327, -0.18977048700868054, -0.21051108925121612, -0.013502076293084898, 0.38677838932208974, -0.3034339308770823, -0.3298766839446436, 0.036153174842033405, -0.20873472368473123, -0.20032392698259832, 0.2635366045075051, -0.191142217236860... |
1,803.00159 | A Class-Incremental Learning Method Based on One Class Support Vector
Machine | A method based on one class support vector machine (OCSVM) is proposed for
class incremental learning. Several OCSVM models divide the input space into
several parts. Then, the 1VS1 classifiers are constructed for the confuse part
by using the support vectors. During the class incremental learning process,
the OCSVM ... | cs.CV | a method based on one class support vector machine ocsvm is proposed for class incremental learning several ocsvm models divide the input space into several parts then the 1vs1 classifiers are constructed for the confuse part by using the support vectors during the class incremental learning process the ocsvm of the ne... | [['a', 'method', 'based', 'on', 'one', 'class', 'support', 'vector', 'machine', 'ocsvm', 'is', 'proposed', 'for', 'class', 'incremental', 'learning', 'several', 'ocsvm', 'models', 'divide', 'the', 'input', 'space', 'into', 'several', 'parts', 'then', 'the', '1vs1', 'classifiers', 'are', 'constructed', 'for', 'the', 'co... | [-0.029902487620555064, 0.037608505448563985, -0.05024105535457598, 0.05667757727610326, -0.12202415192474755, -0.1390301115367868, 0.03903412338871284, 0.3711293946526595, -0.2848834783813897, -0.2753667411138147, 0.1274296908253404, -0.261775418879283, -0.13858129200213057, 0.222446791247946, -0.05424598966343891, 0.... |
1,803.0016 | Buckling of thin composite plates reinforced with randomly oriented,
straight single-walled carbon nanotubes using B3-Spline finite strip method | This paper is devoted to the mechanical buckling analysis of thin composite
plates under straight single-walled carbon nanotubes reinforcement with uniform
distribution and random orientations. In order to develop the fundamental
equations, the B3-Spline finite strip method along with the classical plate
theory is em... | cs.CE | this paper is devoted to the mechanical buckling analysis of thin composite plates under straight singlewalled carbon nanotubes reinforcement with uniform distribution and random orientations in order to develop the fundamental equations the b3spline finite strip method along with the classical plate theory is employed... | [['this', 'paper', 'is', 'devoted', 'to', 'the', 'mechanical', 'buckling', 'analysis', 'of', 'thin', 'composite', 'plates', 'under', 'straight', 'singlewalled', 'carbon', 'nanotubes', 'reinforcement', 'with', 'uniform', 'distribution', 'and', 'random', 'orientations', 'in', 'order', 'to', 'develop', 'the', 'fundamental... | [-0.11550668058584311, 0.13678602427337735, -0.03935245021712035, -0.08692188273499986, -0.01995487430997725, -0.1489758911509333, 0.014451318048772269, 0.4895950451360217, -0.26013142996234817, -0.2494521381084009, 0.06999314230633899, -0.2682291769954775, -0.11444722320884466, 0.1637838228106765, -0.03615929832282875... |
1,803.00161 | Reciprocal Sum of Palindromes | A positive integer $n$ is said to be a palindrome in base $b$ (or $b$-adic
palindrome) if the representation of $n = (a_k a_{k-1} \cdots a_0)_b$ in base
$b$ with $a_k \neq 0$ has the symmetric property $a_{k-i} = a_i$ for every
$i=0,1,2,\ldots ,k$. Let $s_b$ be the reciprocal sum of all $b$-adic
palindromes. It is no... | math.CA | a positive integer n is said to be a palindrome in base b or badic palindrome if the representation of n a_k a_k1 cdots a_0_b in base b with a_k neq 0 has the symmetric property a_ki a_i for every i012ldots k let s_b be the reciprocal sum of all badic palindromes it is not difficult to show that s_b converges in this a... | [['a', 'positive', 'integer', 'n', 'is', 'said', 'to', 'be', 'a', 'palindrome', 'in', 'base', 'b', 'or', 'badic', 'palindrome', 'if', 'the', 'representation', 'of', 'n', 'a_k', 'a_k1', 'cdots', 'a_0_b', 'in', 'base', 'b', 'with', 'a_k', 'neq', '0', 'has', 'the', 'symmetric', 'property', 'a_ki', 'a_i', 'for', 'every', '... | [-0.19333966630885654, 0.18487125660838752, -0.032877256052739834, -0.0005412852035664108, -0.064696870302653, -0.24485749633040751, 0.0532121429669446, 0.3496351034070055, -0.31288469848276557, -0.13656039103523068, 0.09700082775189317, -0.37292617979063386, -0.11026202111997395, 0.11207669172114854, -0.06263715154009... |
1,803.00162 | Towards Cooperation in Sequential Prisoner's Dilemmas: a Deep Multiagent
Reinforcement Learning Approach | The Iterated Prisoner's Dilemma has guided research on social dilemmas for
decades. However, it distinguishes between only two atomic actions: cooperate
and defect. In real-world prisoner's dilemmas, these choices are temporally
extended and different strategies may correspond to sequences of actions,
reflecting grad... | cs.AI cs.GT cs.LG cs.MA | the iterated prisoners dilemma has guided research on social dilemmas for decades however it distinguishes between only two atomic actions cooperate and defect in realworld prisoners dilemmas these choices are temporally extended and different strategies may correspond to sequences of actions reflecting grades of coope... | [['the', 'iterated', 'prisoners', 'dilemma', 'has', 'guided', 'research', 'on', 'social', 'dilemmas', 'for', 'decades', 'however', 'it', 'distinguishes', 'between', 'only', 'two', 'atomic', 'actions', 'cooperate', 'and', 'defect', 'in', 'realworld', 'prisoners', 'dilemmas', 'these', 'choices', 'are', 'temporally', 'ext... | [-0.12845368383142802, 0.06767711625088407, -0.11752579495219923, 0.06884320783173302, -0.07884308242625217, -0.22777258953301055, 0.07992765586823225, 0.5011196814324116, -0.265941700378501, -0.30034451732389267, 0.0234665986712704, -0.2506235147621937, -0.2776598745173343, 0.021292250606276823, -0.1578207024935315, -... |
1,803.00163 | The Historical Development of Algebraic Geometry: a lecture by Jean
Dieudonn\'e | This article is a transcription of a video of a 1972 lecture by Jean
Dieudonn\'e, enhanced with composite still images from the video. The lecture
covers the same material as an earlier paper and lecture notes by Dieudonn\'e,
but the live lecture has a character of its own.
| math.HO | this article is a transcription of a video of a 1972 lecture by jean dieudonne enhanced with composite still images from the video the lecture covers the same material as an earlier paper and lecture notes by dieudonne but the live lecture has a character of its own | [['this', 'article', 'is', 'a', 'transcription', 'of', 'a', 'video', 'of', 'a', '1972', 'lecture', 'by', 'jean', 'dieudonne', 'enhanced', 'with', 'composite', 'still', 'images', 'from', 'the', 'video', 'the', 'lecture', 'covers', 'the', 'same', 'material', 'as', 'an', 'earlier', 'paper', 'and', 'lecture', 'notes', 'by'... | [-0.08315632563608233, 0.13020946758024365, -0.15490786167113887, -0.0019805651681963354, -0.09947662220414107, -0.10818512139182228, -0.010686011885506256, 0.2714603965481122, -0.21911523246672004, -0.3265784477892642, 0.18007874560620016, -0.2836379149230197, -0.227705380685317, 0.14067173479512954, -0.23370636508722... |
1,803.00164 | Turing instability and Turing-Hopf bifurcation in diffusive Schnakenberg
systems with gene expression time delay | For delayed reaction-diffusion Schnakenberg systems with Neumann boundary
conditions, critical conditions for Turing instability are derived, which are
necessary and sufficient. And existence conditions for Turing, Hopf and
Turing-Hopf bifurcations are established. Normal forms truncated to order 3 at
Turing-Hopf sin... | math.DS | for delayed reactiondiffusion schnakenberg systems with neumann boundary conditions critical conditions for turing instability are derived which are necessary and sufficient and existence conditions for turing hopf and turinghopf bifurcations are established normal forms truncated to order 3 at turinghopf singularity o... | [['for', 'delayed', 'reactiondiffusion', 'schnakenberg', 'systems', 'with', 'neumann', 'boundary', 'conditions', 'critical', 'conditions', 'for', 'turing', 'instability', 'are', 'derived', 'which', 'are', 'necessary', 'and', 'sufficient', 'and', 'existence', 'conditions', 'for', 'turing', 'hopf', 'and', 'turinghopf', '... | [-0.21591394513029777, 0.1619515589048806, -0.06511461393286784, 0.087942653545635, -0.05266980220734148, -0.18259544780757886, 0.014573095806149973, 0.3517419324352827, -0.3152763574951773, -0.22927412698638863, 0.158885837228987, -0.18284469338596548, -0.15491221524969814, 0.19882980982462564, -0.014116916415932912, ... |
1,803.00165 | Minimizing the number of 5-cycles in graphs with given edge-density | Motivated by the work of Razborov about the minimal density of triangles in
graphs we study the minimal density of the 5-cycle $C_5$. We show that every
graph of order $n$ and size $\left( 1-\frac{1}{k}\right)\binom{n}{2}$, where
$k\ge 3$ is an integer, contains at least \[ \left( \frac{1}{10} -\frac{1}{2k}
+ \frac{1... | math.CO | motivated by the work of razborov about the minimal density of triangles in graphs we study the minimal density of the 5cycle c_5 we show that every graph of order n and size left 1frac1krightbinomn2 where kge 3 is an integer contains at least left frac110 frac12k frac1k2 frac1k3 frac25 k4 rightn5 on5 copies of c_5 thi... | [['motivated', 'by', 'the', 'work', 'of', 'razborov', 'about', 'the', 'minimal', 'density', 'of', 'triangles', 'in', 'graphs', 'we', 'study', 'the', 'minimal', 'density', 'of', 'the', '5cycle', 'c_5', 'we', 'show', 'that', 'every', 'graph', 'of', 'order', 'n', 'and', 'size', 'left', '1frac1krightbinomn2', 'where', 'kge... | [-0.18132589231674118, 0.08490938143774034, -0.055563329331772895, 0.03018154250457883, -0.06352592469438126, -0.14872481908992324, 0.04165387557280299, 0.31905439976406724, -0.21388222502152388, -0.32007428762551987, 0.14149100949963261, -0.3043542718416766, -0.15361077462224976, 0.12143979676459965, -0.11804478372398... |
1,803.00166 | Round-Robin Differential Phase-Shift Quantum Key Distribution with
Twisted Photons | Quantum key distribution (QKD) offers the possibility for two individuals to
communicate a securely encrypted message. From the time of its inception in
1984 by Bennett and Brassard, QKD has been the result of intense research. One
technical challenge is the monitoring of signal disturbance in a QKD system to
bound t... | quant-ph physics.optics | quantum key distribution qkd offers the possibility for two individuals to communicate a securely encrypted message from the time of its inception in 1984 by bennett and brassard qkd has been the result of intense research one technical challenge is the monitoring of signal disturbance in a qkd system to bound the info... | [['quantum', 'key', 'distribution', 'qkd', 'offers', 'the', 'possibility', 'for', 'two', 'individuals', 'to', 'communicate', 'a', 'securely', 'encrypted', 'message', 'from', 'the', 'time', 'of', 'its', 'inception', 'in', '1984', 'by', 'bennett', 'and', 'brassard', 'qkd', 'has', 'been', 'the', 'result', 'of', 'intense',... | [-0.22359727219824332, 0.09033627587202965, -0.1315015613449266, -0.014551475942513558, -0.03215041422812515, -0.2334624283374792, 0.09111276760989104, 0.376610233109018, -0.27379744949032475, -0.2990845628335219, 0.07836885184136567, -0.22877849575766104, -0.10586011658018701, 0.22535789045449123, -0.1381512126847857,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.