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,801.09769 | Geodesic motion around traversable wormholes supported by a massless
conformally-coupled scalar field | We consider a traversable wormhole solution of Einstein's gravity conformally
coupled to a massless scalar field, a solution derived by Barcelo and Visser
based on the JNWW spacetime. We study the geodesic motion of time-, light- and
space-like particles in this spacetime. We solve the equations of motion
analyticall... | gr-qc | we consider a traversable wormhole solution of einsteins gravity conformally coupled to a massless scalar field a solution derived by barcelo and visser based on the jnww spacetime we study the geodesic motion of time light and spacelike particles in this spacetime we solve the equations of motion analytically in terms... | [['we', 'consider', 'a', 'traversable', 'wormhole', 'solution', 'of', 'einsteins', 'gravity', 'conformally', 'coupled', 'to', 'a', 'massless', 'scalar', 'field', 'a', 'solution', 'derived', 'by', 'barcelo', 'and', 'visser', 'based', 'on', 'the', 'jnww', 'spacetime', 'we', 'study', 'the', 'geodesic', 'motion', 'of', 'ti... | [-0.24854692193585332, 0.12395123894629853, -0.1115519723781709, 0.11569040745177589, -0.10027782030121078, -0.16526077121098556, -0.007072453198724248, 0.31257827018042295, -0.16310049254405365, -0.25458846302975097, 0.06586833254387078, -0.27102142864749296, -0.13972183549253459, 0.1794102322584897, -0.03820865973830... |
1,801.0977 | Quantum Coarse-Graining, Symmetries and Reducibility of Dynamics | The common idea behind complexity reduction in physical systems is separation
of information into "physically meaningful" and "safely ignorable". Here we
consider a generic notion of such separation -- implemented by coarse-graining
the state-space -- and address the question of what information is indeed
safely igno... | quant-ph cond-mat.dis-nn | the common idea behind complexity reduction in physical systems is separation of information into physically meaningful and safely ignorable here we consider a generic notion of such separation implemented by coarsegraining the statespace and address the question of what information is indeed safely ignorable if we wan... | [['the', 'common', 'idea', 'behind', 'complexity', 'reduction', 'in', 'physical', 'systems', 'is', 'separation', 'of', 'information', 'into', 'physically', 'meaningful', 'and', 'safely', 'ignorable', 'here', 'we', 'consider', 'a', 'generic', 'notion', 'of', 'such', 'separation', 'implemented', 'by', 'coarsegraining', '... | [-0.12547903286074014, 0.1530702929423355, -0.11031812929329188, 0.10114543064485267, -0.08133388434961329, -0.12739498628070578, 0.033784888041897346, 0.31094598124378964, -0.31160247912767397, -0.27374989142203154, 0.10768687751003787, -0.20891053690791203, -0.16355018931907955, 0.16095516584840985, -0.10510467234759... |
1,801.09771 | Mitigating Spreadsheet Model Risk with Python Open Source Infrastructure | Across an aggregation of EuSpRIG presentation papers, two maxims hold true:
spreadsheets models are akin to software, yet spreadsheet developers are not
software engineers. As such, the lack of traditional software engineering tools
and protocols invites a higher rate of error in the end result. This paper lays
groun... | cs.SE | across an aggregation of eusprig presentation papers two maxims hold true spreadsheets models are akin to software yet spreadsheet developers are not software engineers as such the lack of traditional software engineering tools and protocols invites a higher rate of error in the end result this paper lays ground work f... | [['across', 'an', 'aggregation', 'of', 'eusprig', 'presentation', 'papers', 'two', 'maxims', 'hold', 'true', 'spreadsheets', 'models', 'are', 'akin', 'to', 'software', 'yet', 'spreadsheet', 'developers', 'are', 'not', 'software', 'engineers', 'as', 'such', 'the', 'lack', 'of', 'traditional', 'software', 'engineering', ... | [-0.03493794091363353, -0.013186074238877733, -0.07415856114080684, 0.0974777031158076, -0.15618533816781233, -0.24299503208286213, 0.07258686263098339, 0.43149508108300244, -0.23827528389996255, -0.3664813830559565, 0.09816452746930406, -0.24936954578151926, -0.09328063076827675, 0.2641801923587495, -0.125211829409553... |
1,801.09772 | Obstacle evasion in free-space optical communications utilizing Airy
beams | A high speed free-space optical communication system capable of self-bending
signal transmission around line-of-sight obstacles is proposed and
demonstrated. Airy beams are generated and controlled to achieve different
propagating trajectories, and the signal transmission characteristics of these
beams around the obs... | physics.app-ph physics.optics | a high speed freespace optical communication system capable of selfbending signal transmission around lineofsight obstacles is proposed and demonstrated airy beams are generated and controlled to achieve different propagating trajectories and the signal transmission characteristics of these beams around the obstacle ar... | [['a', 'high', 'speed', 'freespace', 'optical', 'communication', 'system', 'capable', 'of', 'selfbending', 'signal', 'transmission', 'around', 'lineofsight', 'obstacles', 'is', 'proposed', 'and', 'demonstrated', 'airy', 'beams', 'are', 'generated', 'and', 'controlled', 'to', 'achieve', 'different', 'propagating', 'traj... | [-0.1711102661824584, 0.13510685397085506, -0.06213316846972432, 0.023148051137419266, -0.03854516303368114, -0.20099950011039303, -0.004146300262545009, 0.492487907611035, -0.2564423825541461, -0.29179216193891055, 0.056150538041382224, -0.29431334175672885, -0.12600406404030887, 0.2689352266339434, -0.059839897851988... |
1,801.09773 | High-throughput intensity diffraction tomography with a computational
microscope | We demonstrate a motion-free intensity diffraction tomography technique that
enables direct inversion of 3D phase and absorption from intensity-only
measurements for weakly scattering samples. We derive a novel linear forward
model, featuring slice-wise phase and absorption transfer functions using
angled illuminatio... | eess.IV physics.bio-ph physics.optics | we demonstrate a motionfree intensity diffraction tomography technique that enables direct inversion of 3d phase and absorption from intensityonly measurements for weakly scattering samples we derive a novel linear forward model featuring slicewise phase and absorption transfer functions using angled illumination this ... | [['we', 'demonstrate', 'a', 'motionfree', 'intensity', 'diffraction', 'tomography', 'technique', 'that', 'enables', 'direct', 'inversion', 'of', '3d', 'phase', 'and', 'absorption', 'from', 'intensityonly', 'measurements', 'for', 'weakly', 'scattering', 'samples', 'we', 'derive', 'a', 'novel', 'linear', 'forward', 'mode... | [-0.05726465320983251, 0.05170265846347145, -0.07070883780055826, 0.00470417185899723, -0.06279011632747813, -0.1665753164631595, 0.04826343794990084, 0.48256773426736066, -0.28861795263561274, -0.34181030168680543, 0.0948854641952406, -0.2604700180544821, -0.1594705053588308, 0.23018068176727877, -0.03735723699346965,... |
1,801.09774 | On Psychoacoustically Weighted Cost Functions Towards Resource-Efficient
Deep Neural Networks for Speech Denoising | We present a psychoacoustically enhanced cost function to balance network
complexity and perceptual performance of deep neural networks for speech
denoising. While training the network, we utilize perceptual weights added to
the ordinary mean-squared error to emphasize contribution from frequency bins
which are most ... | cs.SD eess.AS | we present a psychoacoustically enhanced cost function to balance network complexity and perceptual performance of deep neural networks for speech denoising while training the network we utilize perceptual weights added to the ordinary meansquared error to emphasize contribution from frequency bins which are most audib... | [['we', 'present', 'a', 'psychoacoustically', 'enhanced', 'cost', 'function', 'to', 'balance', 'network', 'complexity', 'and', 'perceptual', 'performance', 'of', 'deep', 'neural', 'networks', 'for', 'speech', 'denoising', 'while', 'training', 'the', 'network', 'we', 'utilize', 'perceptual', 'weights', 'added', 'to', 't... | [-0.03849514099080801, -0.02945019486035289, -0.058423883081670916, 0.09213235354953749, -0.08427120843456566, -0.1805868708811403, 0.047717614909291176, 0.4935219147802542, -0.2739276216898193, -0.32427940464098626, 0.013624752942398418, -0.26225668269829494, -0.24713846213795657, 0.2062861388263527, -0.16490544968976... |
1,801.09775 | Characterisation of carbon fibre-reinforced polymer composites through
complex Radon-transform analysis of eddy-current data | Maintaining the correct fibre orientations and stacking sequence in
carbon-fibre reinforced polymers (CFRP) during manufacture is essential for
achieving the required mechanical properties of a component. This paper
presents and evaluates a method for the rapid characterisation of the fibre
orientations present in CF... | physics.app-ph eess.SP physics.data-an | maintaining the correct fibre orientations and stacking sequence in carbonfibre reinforced polymers cfrp during manufacture is essential for achieving the required mechanical properties of a component this paper presents and evaluates a method for the rapid characterisation of the fibre orientations present in cfrp str... | [['maintaining', 'the', 'correct', 'fibre', 'orientations', 'and', 'stacking', 'sequence', 'in', 'carbonfibre', 'reinforced', 'polymers', 'cfrp', 'during', 'manufacture', 'is', 'essential', 'for', 'achieving', 'the', 'required', 'mechanical', 'properties', 'of', 'a', 'component', 'this', 'paper', 'presents', 'and', 'ev... | [-0.10773335280284181, 0.03633801892908969, -0.10039006724788277, 0.01863234991313254, -0.057264348374523016, -0.10733882832628126, 0.0370778275983382, 0.40944131874592504, -0.24570249937579175, -0.32538693589424916, 0.12400430521149043, -0.24751769537628393, -0.1374883320477408, 0.22085809997319913, -0.039121665543045... |
1,801.09776 | Extreme value theory applied to the millennial sunspot number series | In this work, we use two decadal sunspot number series reconstructed from
cosmogenic radionuclide data (14C in tree trunks, SN-14C and 10Be in polar ice,
SN-10Be) and the Extreme Value Theory to study variability of solar activity
during the last 9 millennia. The peaks-over-threshold technique was used to
compute, in... | astro-ph.SR | in this work we use two decadal sunspot number series reconstructed from cosmogenic radionuclide data 14c in tree trunks sn14c and 10be in polar ice sn10be and the extreme value theory to study variability of solar activity during the last 9 millennia the peaksoverthreshold technique was used to compute in particular t... | [['in', 'this', 'work', 'we', 'use', 'two', 'decadal', 'sunspot', 'number', 'series', 'reconstructed', 'from', 'cosmogenic', 'radionuclide', 'data', '14c', 'in', 'tree', 'trunks', 'sn14c', 'and', '10be', 'in', 'polar', 'ice', 'sn10be', 'and', 'the', 'extreme', 'value', 'theory', 'to', 'study', 'variability', 'of', 'sol... | [-0.03475796955189828, 0.17301481796017537, -0.058583893810336025, 0.12066067299488475, -0.011541771898160408, -0.01663195377250025, 0.062314874203332864, 0.3351732616875595, -0.21654499887540204, -0.39168405997926836, 0.13743130701802603, -0.2739457118444922, -0.10939737373357353, 0.2468920881614272, -0.06127950140600... |
1,801.09777 | Structured Spreadsheet Modelling and Implementation with Multiple
Dimensions - Part 1: Modelling | Dimensions are an integral part of many models we use every day. Without
thinking about it, we frequently use the time dimension: many financial and
accounting spreadsheets have columns representing months or years. Representing
a second dimension is often done by repeating blocs of formulas in a worksheet
or creatin... | cs.SE | dimensions are an integral part of many models we use every day without thinking about it we frequently use the time dimension many financial and accounting spreadsheets have columns representing months or years representing a second dimension is often done by repeating blocs of formulas in a worksheet or creating mult... | [['dimensions', 'are', 'an', 'integral', 'part', 'of', 'many', 'models', 'we', 'use', 'every', 'day', 'without', 'thinking', 'about', 'it', 'we', 'frequently', 'use', 'the', 'time', 'dimension', 'many', 'financial', 'and', 'accounting', 'spreadsheets', 'have', 'columns', 'representing', 'months', 'or', 'years', 'repres... | [-0.10842172126285732, 0.09937496956704958, -0.03778690312589918, 0.06781893823270886, -0.09589839389082044, -0.11254353307387126, 0.0044880565089572754, 0.4127609938482887, -0.2486452418712101, -0.3283934640764658, 0.17977094921142062, -0.29258447368296664, -0.15110471222682723, 0.19934555227934783, -0.058063472345436... |
1,801.09778 | Diffeomorphic registration of discrete geometric distributions | This paper proposes a new framework and algorithms to address the problem of
diffeomorphic registration on a general class of geometric objects that can be
described as discrete distributions of local direction vectors. It builds on
both the large deformation diffeomorphic metric mapping (LDDMM) model and the
concept... | math.OC math.CA | this paper proposes a new framework and algorithms to address the problem of diffeomorphic registration on a general class of geometric objects that can be described as discrete distributions of local direction vectors it builds on both the large deformation diffeomorphic metric mapping lddmm model and the concept of o... | [['this', 'paper', 'proposes', 'a', 'new', 'framework', 'and', 'algorithms', 'to', 'address', 'the', 'problem', 'of', 'diffeomorphic', 'registration', 'on', 'a', 'general', 'class', 'of', 'geometric', 'objects', 'that', 'can', 'be', 'described', 'as', 'discrete', 'distributions', 'of', 'local', 'direction', 'vectors', ... | [-0.05831457721155689, 0.011824316129679102, -0.10120061774634653, 0.08792572533280624, -0.09845633083540532, -0.13152063786379856, -0.01771189560596314, 0.41967100501060484, -0.2885926581572103, -0.29993720784507416, 0.10558216729875346, -0.22927467958242806, -0.20992808702263843, 0.20816892710928286, -0.1689285695104... |
1,801.09779 | Multicritical point on the de Almeida-Thouless line in spin glasses in
$d>6$ dimensions | The de Almeida-Thouless (AT) line in Ising spin glasses is the phase boundary
in the temperature $T$ and magnetic field $h$ plane below which replica
symmetry is broken. Using perturbative renormalization group (RG) methods, we
show that when the dimension $d$ of space is just above $6$ there is a
multicritical point... | cond-mat.stat-mech cond-mat.dis-nn | the de almeidathouless at line in ising spin glasses is the phase boundary in the temperature t and magnetic field h plane below which replica symmetry is broken using perturbative renormalization group rg methods we show that when the dimension d of space is just above 6 there is a multicritical point mcp on the at li... | [['the', 'de', 'almeidathouless', 'at', 'line', 'in', 'ising', 'spin', 'glasses', 'is', 'the', 'phase', 'boundary', 'in', 'the', 'temperature', 't', 'and', 'magnetic', 'field', 'h', 'plane', 'below', 'which', 'replica', 'symmetry', 'is', 'broken', 'using', 'perturbative', 'renormalization', 'group', 'rg', 'methods', 'w... | [-0.13677456451602235, 0.20533255935217182, -0.046438122377312645, 0.029712024293310137, -0.013805192412841998, -0.18259686925085986, 0.08452832033721072, 0.32772897044057303, -0.2385546581423702, -0.2814655990791535, 0.13766501478022689, -0.31812564730309617, -0.0873698101540704, 0.17098258128445484, 0.057073644222970... |
1,801.0978 | Bounded Policy Synthesis for POMDPs with Safe-Reachability Objectives | Planning robust executions under uncertainty is a fundamental challenge for
building autonomous robots. Partially Observable Markov Decision Processes
(POMDPs) provide a standard framework for modeling uncertainty in many
applications. In this work, we study POMDPs with safe-reachability objectives,
which require tha... | cs.RO cs.AI | planning robust executions under uncertainty is a fundamental challenge for building autonomous robots partially observable markov decision processes pomdps provide a standard framework for modeling uncertainty in many applications in this work we study pomdps with safereachability objectives which require that with a ... | [['planning', 'robust', 'executions', 'under', 'uncertainty', 'is', 'a', 'fundamental', 'challenge', 'for', 'building', 'autonomous', 'robots', 'partially', 'observable', 'markov', 'decision', 'processes', 'pomdps', 'provide', 'a', 'standard', 'framework', 'for', 'modeling', 'uncertainty', 'in', 'many', 'applications',... | [-0.089436577667145, 0.07359814804620893, -0.092557561870841, 0.09004747768430489, -0.11189270963498937, -0.12873706508002342, 0.1103000265319334, 0.41742992377639265, -0.2758261708398189, -0.31889793854899273, 0.12195183056585314, -0.19759694257638707, -0.1280717922220055, 0.1961034699654255, -0.1226800965378061, 0.13... |
1,801.09781 | Early Warnings of Cyber Threats in Online Discussions | We introduce a system for automatically generating warnings of imminent or
current cyber-threats. Our system leverages the communication of malicious
actors on the darkweb, as well as activity of cyber security experts on social
media platforms like Twitter. In a time period between September, 2016 and
January, 2017,... | cs.CR cs.CY cs.SI | we introduce a system for automatically generating warnings of imminent or current cyberthreats our system leverages the communication of malicious actors on the darkweb as well as activity of cyber security experts on social media platforms like twitter in a time period between september 2016 and january 2017 our meth... | [['we', 'introduce', 'a', 'system', 'for', 'automatically', 'generating', 'warnings', 'of', 'imminent', 'or', 'current', 'cyberthreats', 'our', 'system', 'leverages', 'the', 'communication', 'of', 'malicious', 'actors', 'on', 'the', 'darkweb', 'as', 'well', 'as', 'activity', 'of', 'cyber', 'security', 'experts', 'on', ... | [-0.1277316133299128, 0.03268848488954617, -0.059705567581200956, 0.05639885479139682, -0.09849028219293832, -0.11783140955520864, 0.10626242437340404, 0.35032845850109606, -0.20382284407181792, -0.3772073582486999, 0.15851228633857004, -0.3333448175186838, -0.21381006142014244, 0.22664414042312847, -0.1392029928309577... |
1,801.09782 | Prediction of Pedestrian Speed with Artificial Neural Networks | Pedestrian behaviours tend to depend on the type of facility. Therefore
accurate predictions of pedestrians movements in complex geometries (including
corridor, bottleneck or intersection) are difficult to achieve for classical
models with few parameters. Artificial neural networks have multiple parameters
and are ab... | physics.soc-ph | pedestrian behaviours tend to depend on the type of facility therefore accurate predictions of pedestrians movements in complex geometries including corridor bottleneck or intersection are difficult to achieve for classical models with few parameters artificial neural networks have multiple parameters and are able to i... | [['pedestrian', 'behaviours', 'tend', 'to', 'depend', 'on', 'the', 'type', 'of', 'facility', 'therefore', 'accurate', 'predictions', 'of', 'pedestrians', 'movements', 'in', 'complex', 'geometries', 'including', 'corridor', 'bottleneck', 'or', 'intersection', 'are', 'difficult', 'to', 'achieve', 'for', 'classical', 'mod... | [-0.07699049353742829, 0.06747928303547013, -0.07491351033632572, 0.08856767839286973, -0.08517828334916909, -0.18538596715507472, 0.02329071520322249, 0.4417979293144666, -0.2336832727663792, -0.3183412049920895, 0.10320168699169707, -0.24235892706574538, -0.18671511765270948, 0.23080501085720384, -0.11069069909027372... |
1,801.09783 | Performance Dynamics and Success in Online Games | Online data provide a way to monitor how users behave in social systems like
social networks and online games, and understand which features turn an
ordinary individual into a successful one. Here, we propose to study individual
performance and success in Multiplayer Online Battle Arena (MOBA) games. Our
purpose is t... | cs.SI cs.CY cs.HC physics.soc-ph | online data provide a way to monitor how users behave in social systems like social networks and online games and understand which features turn an ordinary individual into a successful one here we propose to study individual performance and success in multiplayer online battle arena moba games our purpose is to identi... | [['online', 'data', 'provide', 'a', 'way', 'to', 'monitor', 'how', 'users', 'behave', 'in', 'social', 'systems', 'like', 'social', 'networks', 'and', 'online', 'games', 'and', 'understand', 'which', 'features', 'turn', 'an', 'ordinary', 'individual', 'into', 'a', 'successful', 'one', 'here', 'we', 'propose', 'to', 'stu... | [-0.045365785783812534, 0.06543957745431118, -0.13949165804058136, 0.12316695507615805, -0.1297394055018984, -0.2530537782506962, 0.07881909750295892, 0.43595300989567176, -0.21428957345382965, -0.38800165796729585, 0.06516078977154005, -0.28754338386920475, -0.18585030626252116, 0.10955042199964618, -0.163148738385988... |
1,801.09784 | Depth of Ultra High Energy Cosmic Ray Induced Air Shower Maxima Measured
by the Telescope Array Black Rock and Long Ridge FADC Fluorescence Detectors
and Surface Array in Hybrid Mode | The Telescope Array observatory utilizes fluorescence detectors and surface
detectors to observe air showers produced by ultra high energy cosmic rays in
the Earth's atmosphere. Cosmic ray events observed in this way are termed
hybrid data. The depth of air shower maximum is related to the mass of the
primary particl... | astro-ph.HE | the telescope array observatory utilizes fluorescence detectors and surface detectors to observe air showers produced by ultra high energy cosmic rays in the earths atmosphere cosmic ray events observed in this way are termed hybrid data the depth of air shower maximum is related to the mass of the primary particle tha... | [['the', 'telescope', 'array', 'observatory', 'utilizes', 'fluorescence', 'detectors', 'and', 'surface', 'detectors', 'to', 'observe', 'air', 'showers', 'produced', 'by', 'ultra', 'high', 'energy', 'cosmic', 'rays', 'in', 'the', 'earths', 'atmosphere', 'cosmic', 'ray', 'events', 'observed', 'in', 'this', 'way', 'are', ... | [-0.024800840976699424, 0.19478700083991415, -0.0781974621633118, 0.11818761645088934, -0.03150385451872271, -0.05589617194339364, -0.0018280150441175981, 0.42899095243564594, -0.2120744889425869, -0.4074138030409813, 0.04608272439338737, -0.36516823659458003, 0.019938569583065877, 0.2026753615821829, 0.007079962564439... |
1,801.09785 | Optical Kerr Effect in Graphene: Theoretical Analysis of the Optical
Heterodyne Detection Technique | Graphene is an atomically thin two-dimensional material demonstrating strong
optical nonlinearities including harmonics generation, four wave mixing, Kerr
and other nonlinear effects. In this paper we theoretically analyze the optical
heterodyne detection (OHD) technique of measuring the optical Kerr effect (OKE)
in ... | cond-mat.mes-hall | graphene is an atomically thin twodimensional material demonstrating strong optical nonlinearities including harmonics generation four wave mixing kerr and other nonlinear effects in this paper we theoretically analyze the optical heterodyne detection ohd technique of measuring the optical kerr effect oke in twodimensi... | [['graphene', 'is', 'an', 'atomically', 'thin', 'twodimensional', 'material', 'demonstrating', 'strong', 'optical', 'nonlinearities', 'including', 'harmonics', 'generation', 'four', 'wave', 'mixing', 'kerr', 'and', 'other', 'nonlinear', 'effects', 'in', 'this', 'paper', 'we', 'theoretically', 'analyze', 'the', 'optical... | [-0.12144187785452232, 0.11512245162266481, -0.04862879651288191, -0.03866478937464611, -0.03569340372147659, -0.10687956563197076, -0.0011558893301601833, 0.40102319594395036, -0.23558664348674938, -0.2531542191747576, 0.024426237676137438, -0.3436068951152265, -0.21270744867506436, 0.2384322507151713, 0.0356175167573... |
1,801.09786 | An Algorithm to Decompose Permutation Representations of Finite Groups:
Polynomial Algebra Approach | We describe an algorithm for splitting permutation representations of finite
group over fields of characteristic zero into irreducible components. The
algorithm is based on the fact that the components of the invariant inner
product in invariant subspaces are operators of projection into these
subspaces. An important... | math.RT cs.SC math.GR | we describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components the algorithm is based on the fact that the components of the invariant inner product in invariant subspaces are operators of projection into these subspaces an important ele... | [['we', 'describe', 'an', 'algorithm', 'for', 'splitting', 'permutation', 'representations', 'of', 'finite', 'group', 'over', 'fields', 'of', 'characteristic', 'zero', 'into', 'irreducible', 'components', 'the', 'algorithm', 'is', 'based', 'on', 'the', 'fact', 'that', 'the', 'components', 'of', 'the', 'invariant', 'inn... | [-0.1699251816267284, 0.10086523152911957, -0.09963469250445686, 0.006078023210781195, -0.0426413473110964, -0.06800255041410465, -0.04117901065591269, 0.37048649129162475, -0.3280958951132872, -0.23573395986359838, 0.11324553827970947, -0.25036728236733413, -0.12113925685152048, 0.22101874969808794, -0.031752763168386... |
1,801.09787 | Kaleidoscopic groups: permutation groups constructed from dendrite
homeomorphisms | Given a transitive permutation group, a fundamental object for studying its
higher transitivity properties is the permutation action of its isotropy
subgroup. We reverse this relationship and introduce a universal construction
of infinite permutation groups that takes as input a given system of
imprimitivity for its ... | math.GR | given a transitive permutation group a fundamental object for studying its higher transitivity properties is the permutation action of its isotropy subgroup we reverse this relationship and introduce a universal construction of infinite permutation groups that takes as input a given system of imprimitivity for its isot... | [['given', 'a', 'transitive', 'permutation', 'group', 'a', 'fundamental', 'object', 'for', 'studying', 'its', 'higher', 'transitivity', 'properties', 'is', 'the', 'permutation', 'action', 'of', 'its', 'isotropy', 'subgroup', 'we', 'reverse', 'this', 'relationship', 'and', 'introduce', 'a', 'universal', 'construction', ... | [-0.18634494644356892, 0.09721333825291367, -0.12189072669813565, 0.08115335968250292, -0.13809177374544865, -0.104621244725422, 0.059191773628299416, 0.3816841470494789, -0.3695663094792205, -0.2369549356517382, 0.1276973136985665, -0.21596690967756635, -0.15045541919001457, 0.16417332676792284, -0.12046638391863478, ... |
1,801.09788 | Evaluating approaches for supervised semantic labeling | Relational data sources are still one of the most popular ways to store
enterprise or Web data, however, the issue with relational schema is the lack
of a well-defined semantic description. A common ontology provides a way to
represent the meaning of a relational schema and can facilitate the integration
of heterogen... | cs.LG cs.AI cs.CL | relational data sources are still one of the most popular ways to store enterprise or web data however the issue with relational schema is the lack of a welldefined semantic description a common ontology provides a way to represent the meaning of a relational schema and can facilitate the integration of heterogeneous d... | [['relational', 'data', 'sources', 'are', 'still', 'one', 'of', 'the', 'most', 'popular', 'ways', 'to', 'store', 'enterprise', 'or', 'web', 'data', 'however', 'the', 'issue', 'with', 'relational', 'schema', 'is', 'the', 'lack', 'of', 'a', 'welldefined', 'semantic', 'description', 'a', 'common', 'ontology', 'provides', ... | [-0.03820087683201009, -0.014974966124331548, -0.03474611187772036, 0.09885750511545414, -0.1789707622259308, -0.1320442539313545, 0.08244256087115803, 0.43829473049122064, -0.2989752965191337, -0.3914079753271604, 0.07894494396994992, -0.30719157439356637, -0.09756734646925187, 0.16623501849063477, -0.1335029587620543... |
1,801.09789 | Preserving of the unconditional basis property under non-self-adjoint
perturbations of self-adjoint operators | Let $T$ be a self-adjoint operator in a Hilbert space $H$ with domain
$\mathcal D(T)$. Assume that the spectrum of $T$ is confined in the union of
disjoint intervals $\Delta_k =[\alpha_{2k-1},\alpha_{2k}]$, $k\in \mathbb{Z}$,
and $$ \alpha_{2k+1}-\alpha_{2k} \geq b|\alpha_{2k+1}+\alpha_{2k}|^p\quad
\text{ for some }\... | math.SP | let t be a selfadjoint operator in a hilbert space h with domain mathcal dt assume that the spectrum of t is confined in the union of disjoint intervals delta_k alpha_2k1alpha_2k kin mathbbz and alpha_2k1alpha_2k geq balpha_2k1alpha_2kpquad text for some b0pin01 suppose that a linear operator b in h is psubordinated to... | [['let', 't', 'be', 'a', 'selfadjoint', 'operator', 'in', 'a', 'hilbert', 'space', 'h', 'with', 'domain', 'mathcal', 'dt', 'assume', 'that', 'the', 'spectrum', 'of', 't', 'is', 'confined', 'in', 'the', 'union', 'of', 'disjoint', 'intervals', 'delta_k', 'alpha_2k1alpha_2k', 'kin', 'mathbbz', 'and', 'alpha_2k1alpha_2k', ... | [-0.18200836693631992, 0.14990702320394816, 0.021058028274159965, -0.02740480584545224, -0.01675132332554233, -0.17606431000956124, 0.006885722734480409, 0.3263091890458962, -0.31107377661134583, -0.16006972587105178, 0.07619206795537595, -0.32602277174077, -0.03945120252681733, 0.1313568110575616, -0.04734471013226593... |
1,801.0979 | $\Delta(1232)$-Resonance in the Hydrogen Spectrum | The electromagnetic excitation of the $\Delta(1232)$-resonance plays an
appreciable role in the Lamb shift and hyperfine structure of muonic and
electronic hydrogen. Its effect appears at the subleading order
$\mathcal{O}(\alpha^5)$, together with other proton-polarizability
contributions from forward two-photon exch... | nucl-th hep-ph | the electromagnetic excitation of the delta1232resonance plays an appreciable role in the lamb shift and hyperfine structure of muonic and electronic hydrogen its effect appears at the subleading order mathcaloalpha5 together with other protonpolarizability contributions from forward twophoton exchange we use the large... | [['the', 'electromagnetic', 'excitation', 'of', 'the', 'delta1232resonance', 'plays', 'an', 'appreciable', 'role', 'in', 'the', 'lamb', 'shift', 'and', 'hyperfine', 'structure', 'of', 'muonic', 'and', 'electronic', 'hydrogen', 'its', 'effect', 'appears', 'at', 'the', 'subleading', 'order', 'mathcaloalpha5', 'together',... | [-0.09969944516908275, 0.16719925391212367, -0.057861664897279334, 0.13520252997383336, -0.05751607719274169, -0.04193039433664159, 0.08367618815369766, 0.37992576850336734, -0.21354559902101755, -0.24096368857297218, -0.05665565438081372, -0.3619963956858825, -0.08406163782907512, 0.15401272196107096, 0.11900994219575... |
1,801.09791 | Noise-induced Stop-and-Go Dynamics | Stop-and-go waves are commonly observed in traffic and pedestrian flows. In
traffic theory they are described by phase transitions of metastable models.
The self-organization phenomenon occurs due to inertia mechanisms but requires
fine tuning of the parameters. Here, a novel explanation for stop-and-go waves
based o... | physics.soc-ph | stopandgo waves are commonly observed in traffic and pedestrian flows in traffic theory they are described by phase transitions of metastable models the selforganization phenomenon occurs due to inertia mechanisms but requires fine tuning of the parameters here a novel explanation for stopandgo waves based on stochasti... | [['stopandgo', 'waves', 'are', 'commonly', 'observed', 'in', 'traffic', 'and', 'pedestrian', 'flows', 'in', 'traffic', 'theory', 'they', 'are', 'described', 'by', 'phase', 'transitions', 'of', 'metastable', 'models', 'the', 'selforganization', 'phenomenon', 'occurs', 'due', 'to', 'inertia', 'mechanisms', 'but', 'requir... | [-0.14896789764164772, 0.19333506980910897, -0.09532975864661213, 0.11928478672023918, -0.06767566148929371, -0.14857341390619477, 0.042801282427384346, 0.36451756616703945, -0.2284810791105622, -0.3018336805450444, 0.052379247701339574, -0.22064091827467402, -0.2100767163320048, 0.18170957458620468, -0.089852943274164... |
1,801.09792 | Time domain boundary elements for dynamic contact problems | This article considers a unilateral contact problem for the wave equation.
The problem is reduced to a variational inequality for the Dirichlet-to-Neumann
operator for the wave equation on the boundary, which is solved in a saddle
point formulation using boundary elements in the time domain. As a model
problem, also ... | math.NA math.AP | this article considers a unilateral contact problem for the wave equation the problem is reduced to a variational inequality for the dirichlettoneumann operator for the wave equation on the boundary which is solved in a saddle point formulation using boundary elements in the time domain as a model problem also a variat... | [['this', 'article', 'considers', 'a', 'unilateral', 'contact', 'problem', 'for', 'the', 'wave', 'equation', 'the', 'problem', 'is', 'reduced', 'to', 'a', 'variational', 'inequality', 'for', 'the', 'dirichlettoneumann', 'operator', 'for', 'the', 'wave', 'equation', 'on', 'the', 'boundary', 'which', 'is', 'solved', 'in'... | [-0.11698516774112763, -0.0018515355925521125, -0.08451351327214228, 0.07087286517489702, -0.07557694581134812, -0.14242732207007383, 0.04226033460834752, 0.31810855539110694, -0.32916009720900785, -0.2435467564035207, 0.1577574570875858, -0.28040122342822343, -0.1544788986403981, 0.1915681905862268, -0.055428129928591... |
1,801.09793 | K\"ahler fibrations in quantum information theory | We discuss the fibre bundle of co-adjoint orbits of compact Lie groups, and
show how it admits a compatible K\"ahler structure. The case of the unitary
group allows us to reformulate the geometric framework of quantum information
theory. In particular, we show that the Fisher information tensor gives rise to
a struct... | math-ph math.MP math.SG quant-ph | we discuss the fibre bundle of coadjoint orbits of compact lie groups and show how it admits a compatible kahler structure the case of the unitary group allows us to reformulate the geometric framework of quantum information theory in particular we show that the fisher information tensor gives rise to a structure that ... | [['we', 'discuss', 'the', 'fibre', 'bundle', 'of', 'coadjoint', 'orbits', 'of', 'compact', 'lie', 'groups', 'and', 'show', 'how', 'it', 'admits', 'a', 'compatible', 'kahler', 'structure', 'the', 'case', 'of', 'the', 'unitary', 'group', 'allows', 'us', 'to', 'reformulate', 'the', 'geometric', 'framework', 'of', 'quantum... | [-0.196630640373127, 0.04165343148633838, -0.17218873589573538, 0.08273250854279682, -0.18135377359302604, -0.1087808153277044, 0.0026050666432745535, 0.3563950608847389, -0.2804037912967889, -0.1974021585603409, 0.06458346024566494, -0.2173309362228525, -0.2346604573677349, 0.1928707022795125, -0.16546485511421719, -0... |
1,801.09794 | FEAST Eigensolver for Nonlinear Eigenvalue Problems | The linear FEAST algorithm is a method for solving linear eigenvalue
problems. It uses complex contour integration to calculate the eigenvectors
whose eigenvalues that are located inside some user-defined region in the
complex plane. This makes it possible to parallelize the process of solving
eigenvalue problems by ... | physics.comp-ph cs.NA math.NA | the linear feast algorithm is a method for solving linear eigenvalue problems it uses complex contour integration to calculate the eigenvectors whose eigenvalues that are located inside some userdefined region in the complex plane this makes it possible to parallelize the process of solving eigenvalue problems by simpl... | [['the', 'linear', 'feast', 'algorithm', 'is', 'a', 'method', 'for', 'solving', 'linear', 'eigenvalue', 'problems', 'it', 'uses', 'complex', 'contour', 'integration', 'to', 'calculate', 'the', 'eigenvectors', 'whose', 'eigenvalues', 'that', 'are', 'located', 'inside', 'some', 'userdefined', 'region', 'in', 'the', 'comp... | [-0.09526789908155503, 0.004592752392520967, -0.05543690989571099, 0.056763508413833604, -0.1323848380923074, -0.11555422555704582, -0.0018493117100022586, 0.3689627233547288, -0.33042567423143926, -0.2922740618618119, 0.12309524000680926, -0.2507612874965794, -0.18272343800952104, 0.2186591663700066, -0.01022236777946... |
1,801.09795 | Reparametrization of COM-Poisson Regression Models with Applications in
the Analysis of Experimental Data | In the analysis of count data often the equidispersion assumption is not
suitable, hence the Poisson regression model is inappropriate. As a
generalization of the Poisson distribution, the COM-Poisson distribution can
deal with under-, equi- and overdispersed count data. It is a member of the
exponential family of di... | stat.AP stat.ME | in the analysis of count data often the equidispersion assumption is not suitable hence the poisson regression model is inappropriate as a generalization of the poisson distribution the compoisson distribution can deal with under equi and overdispersed count data it is a member of the exponential family of distribution... | [['in', 'the', 'analysis', 'of', 'count', 'data', 'often', 'the', 'equidispersion', 'assumption', 'is', 'not', 'suitable', 'hence', 'the', 'poisson', 'regression', 'model', 'is', 'inappropriate', 'as', 'a', 'generalization', 'of', 'the', 'poisson', 'distribution', 'the', 'compoisson', 'distribution', 'can', 'deal', 'wi... | [-0.05563127286838431, 0.0013541725952511993, -0.14043233011222442, 0.08486293231583282, -0.07491915998626288, -0.10383023928581762, 0.05273543341667834, 0.3776190638712151, -0.2554656333602547, -0.30028496817561723, 0.10828046238593432, -0.2579461167522878, -0.144328903396235, 0.20063358333454018, -0.07928628808050328... |
1,801.09796 | Communication-Efficient Search for an Approximate Closest Lattice Point | We consider the problem of finding the closest lattice point to a vector in
n-dimensional Euclidean space when each component of the vector is available at
a distinct node in a network. Our objectives are (i) minimize the communication
cost and (ii) obtain the error probability. The approximate closest lattice
point ... | cs.IT math.IT | we consider the problem of finding the closest lattice point to a vector in ndimensional euclidean space when each component of the vector is available at a distinct node in a network our objectives are i minimize the communication cost and ii obtain the error probability the approximate closest lattice point considere... | [['we', 'consider', 'the', 'problem', 'of', 'finding', 'the', 'closest', 'lattice', 'point', 'to', 'a', 'vector', 'in', 'ndimensional', 'euclidean', 'space', 'when', 'each', 'component', 'of', 'the', 'vector', 'is', 'available', 'at', 'a', 'distinct', 'node', 'in', 'a', 'network', 'our', 'objectives', 'are', 'i', 'mini... | [-0.14120788228186504, 0.05313670031339402, -0.024560493558094327, 0.051036648495732743, 0.0006456879184017299, -0.15971775338197994, 0.11244466904924631, 0.3935536566308477, -0.2584242081387677, -0.23216412971976777, 0.12688146267679823, -0.26468823812196923, -0.15252815550652293, 0.13833340894903096, -0.0236674604943... |
1,801.09797 | Discrete Autoencoders for Sequence Models | Recurrent models for sequences have been recently successful at many tasks,
especially for language modeling and machine translation. Nevertheless, it
remains challenging to extract good representations from these models. For
instance, even though language has a clear hierarchical structure going from
characters thro... | cs.LG stat.ML | recurrent models for sequences have been recently successful at many tasks especially for language modeling and machine translation nevertheless it remains challenging to extract good representations from these models for instance even though language has a clear hierarchical structure going from characters through wor... | [['recurrent', 'models', 'for', 'sequences', 'have', 'been', 'recently', 'successful', 'at', 'many', 'tasks', 'especially', 'for', 'language', 'modeling', 'and', 'machine', 'translation', 'nevertheless', 'it', 'remains', 'challenging', 'to', 'extract', 'good', 'representations', 'from', 'these', 'models', 'for', 'insta... | [-0.020272519329602137, 0.06611520961461126, -0.10177833481665544, 0.13765264554998616, -0.1151388084243747, -0.13616196550822385, 0.046107081174981634, 0.48728243706249436, -0.34449008723182284, -0.31990175114446123, 0.06383837950432306, -0.2618456428680359, -0.1820254462515332, 0.1988221339292785, -0.1139625558764083... |
1,801.09798 | Earthmover Resilience and Testing in Ordered Structures | One of the main challenges in property testing is to characterize those
properties that are testable with a constant number of queries. For unordered
structures such as graphs and hypergraphs this task has been mostly settled.
However, for ordered structures such as strings, images, and ordered graphs,
the characteri... | cs.DS cs.CC math.CO | one of the main challenges in property testing is to characterize those properties that are testable with a constant number of queries for unordered structures such as graphs and hypergraphs this task has been mostly settled however for ordered structures such as strings images and ordered graphs the characterization p... | [['one', 'of', 'the', 'main', 'challenges', 'in', 'property', 'testing', 'is', 'to', 'characterize', 'those', 'properties', 'that', 'are', 'testable', 'with', 'a', 'constant', 'number', 'of', 'queries', 'for', 'unordered', 'structures', 'such', 'as', 'graphs', 'and', 'hypergraphs', 'this', 'task', 'has', 'been', 'mostl... | [-0.11556953276550093, 0.09893901497546792, -0.05468595897456488, 0.08302198626971893, -0.10492430135267429, -0.10282119781298277, 0.023396512903743245, 0.3941461110057739, -0.3004236442502588, -0.3320610034615339, 0.07592210902489918, -0.28611366618476425, -0.14694391507901644, 0.19438353026746952, -0.1161987004497160... |
1,801.09799 | Matrix Completion for Low-Observability Voltage Estimation | With the rising penetration of distributed energy resources, distribution
system control and enabling techniques such as state estimation have become
essential to distribution system operation. However, traditional state
estimation techniques have difficulty coping with the low-observability
conditions often present ... | math.OC | with the rising penetration of distributed energy resources distribution system control and enabling techniques such as state estimation have become essential to distribution system operation however traditional state estimation techniques have difficulty coping with the lowobservability conditions often present on the... | [['with', 'the', 'rising', 'penetration', 'of', 'distributed', 'energy', 'resources', 'distribution', 'system', 'control', 'and', 'enabling', 'techniques', 'such', 'as', 'state', 'estimation', 'have', 'become', 'essential', 'to', 'distribution', 'system', 'operation', 'however', 'traditional', 'state', 'estimation', 't... | [-0.11158659745417271, 0.03313497506603863, -0.08370038500742603, 0.03523095744969125, -0.01769646625397793, -0.1761172914477924, 0.047039586740235485, 0.3886256327601612, -0.2509281765669584, -0.37565964485802655, 0.14064330328090763, -0.24235059768093606, -0.11630337394555991, 0.20008516479415675, -0.1177585947158885... |
1,801.098 | Reducing triangular systems of ODEs with rational coefficients, with
applications to coupled Regge-Wheeler equations | We concisely summarize a method of finding all rational solutions to an
inhomogeneous rational ODE system of arbitrary order (but solvable for its
highest order terms) by converting it into a finite dimensional linear algebra
problem. This method is then used to solve the problem of conclusively deciding
when certain... | math-ph gr-qc math.CA math.MP | we concisely summarize a method of finding all rational solutions to an inhomogeneous rational ode system of arbitrary order but solvable for its highest order terms by converting it into a finite dimensional linear algebra problem this method is then used to solve the problem of conclusively deciding when certain rati... | [['we', 'concisely', 'summarize', 'a', 'method', 'of', 'finding', 'all', 'rational', 'solutions', 'to', 'an', 'inhomogeneous', 'rational', 'ode', 'system', 'of', 'arbitrary', 'order', 'but', 'solvable', 'for', 'its', 'highest', 'order', 'terms', 'by', 'converting', 'it', 'into', 'a', 'finite', 'dimensional', 'linear', ... | [-0.10979618734489076, 0.042063204099102795, -0.051217038148584276, 0.053332870639064625, -0.12184277461626782, -0.16713059830686283, -0.022498386394646432, 0.323620933563743, -0.26744635144455564, -0.28328322556315577, 0.12874358007883352, -0.2746389678810747, -0.19273059318662009, 0.2090990864054865, -0.0484118617625... |
1,801.09801 | A NIKA view of two star-forming infrared dark clouds: Dust emissivity
variations and mass concentration | The thermal emission of dust grains is a powerful tool for probing cold,
dense regions of molecular gas in the ISM, and so constraining dust properties
is key to obtaining accurate measurements of dust mass and temperature. By
placing constraints on the dust emissivity spectral index, beta, towards two
star-forming i... | astro-ph.GA | the thermal emission of dust grains is a powerful tool for probing cold dense regions of molecular gas in the ism and so constraining dust properties is key to obtaining accurate measurements of dust mass and temperature by placing constraints on the dust emissivity spectral index beta towards two starforming infrared ... | [['the', 'thermal', 'emission', 'of', 'dust', 'grains', 'is', 'a', 'powerful', 'tool', 'for', 'probing', 'cold', 'dense', 'regions', 'of', 'molecular', 'gas', 'in', 'the', 'ism', 'and', 'so', 'constraining', 'dust', 'properties', 'is', 'key', 'to', 'obtaining', 'accurate', 'measurements', 'of', 'dust', 'mass', 'and', '... | [-0.06639532824302066, 0.12123228826923678, -0.06928767763358885, 0.07610289913551142, -0.03484785788188599, -0.07246733108082505, 0.04392524194514558, 0.44017361905680946, -0.1612899288657115, -0.33485800553789385, 0.07493167344284601, -0.2807701923039244, -0.016184121944418508, 0.18310118999574587, -0.018116034331996... |
1,801.09802 | Automatically Leveraging MapReduce Frameworks for Data-Intensive
Applications | MapReduce is a popular programming paradigm for developing large-scale,
data-intensive computation. Many frameworks that implement this paradigm have
recently been developed. To leverage these frameworks, however, developers must
become familiar with their APIs and rewrite existing code. Casper is a new tool
that aut... | cs.DB cs.DC cs.PL | mapreduce is a popular programming paradigm for developing largescale dataintensive computation many frameworks that implement this paradigm have recently been developed to leverage these frameworks however developers must become familiar with their apis and rewrite existing code casper is a new tool that automatically... | [['mapreduce', 'is', 'a', 'popular', 'programming', 'paradigm', 'for', 'developing', 'largescale', 'dataintensive', 'computation', 'many', 'frameworks', 'that', 'implement', 'this', 'paradigm', 'have', 'recently', 'been', 'developed', 'to', 'leverage', 'these', 'frameworks', 'however', 'developers', 'must', 'become', '... | [-0.07331138743625192, -0.03484410370603179, -0.12482597682962582, 0.11903402625720623, -0.1582571350259944, -0.23709173625547614, 0.02652193669654779, 0.37787839035259796, -0.30929302256054325, -0.3686866684529255, 0.10049756305001602, -0.2364503333275519, -0.045169863350620655, 0.24143433406161482, -0.043854828666694... |
1,801.09803 | ExoCross: a general program for generating spectra from molecular line
lists | ExoCross is a Fortran code for generating spectra (emission, absorption) and
thermodynamic properties (partition function, specific heat etc.) from
molecular line lists. Input is taken in several formats, including ExoMol and
HITRAN formats. ExoCross is efficiently parallelized showing also a high degree
of vectoriza... | astro-ph.EP astro-ph.SR physics.ao-ph | exocross is a fortran code for generating spectra emission absorption and thermodynamic properties partition function specific heat etc from molecular line lists input is taken in several formats including exomol and hitran formats exocross is efficiently parallelized showing also a high degree of vectorization it can ... | [['exocross', 'is', 'a', 'fortran', 'code', 'for', 'generating', 'spectra', 'emission', 'absorption', 'and', 'thermodynamic', 'properties', 'partition', 'function', 'specific', 'heat', 'etc', 'from', 'molecular', 'line', 'lists', 'input', 'is', 'taken', 'in', 'several', 'formats', 'including', 'exomol', 'and', 'hitran'... | [-0.03446434934525505, 0.061825809102772744, -0.05390432638600223, 0.08551186211422503, -0.08757768923992683, -0.1794599325512536, 0.008271003281391276, 0.4924254498297447, -0.2302399264054226, -0.3330691788026965, 0.06887239415893993, -0.2604807893436181, -0.085925258244204, 0.2931272009644951, 0.03142567682631412, 0.... |
1,801.09804 | Predicting Rapid Fire Growth (Flashover) Using Conditional Generative
Adversarial Networks | A flashover occurs when a fire spreads very rapidly through crevices due to
intense heat. Flashovers present one of the most frightening and challenging
fire phenomena to those who regularly encounter them: firefighters.
Firefighters' safety and lives often depend on their ability to predict
flashovers before they oc... | cs.AI cs.CV cs.HC | a flashover occurs when a fire spreads very rapidly through crevices due to intense heat flashovers present one of the most frightening and challenging fire phenomena to those who regularly encounter them firefighters firefighters safety and lives often depend on their ability to predict flashovers before they occur ty... | [['a', 'flashover', 'occurs', 'when', 'a', 'fire', 'spreads', 'very', 'rapidly', 'through', 'crevices', 'due', 'to', 'intense', 'heat', 'flashovers', 'present', 'one', 'of', 'the', 'most', 'frightening', 'and', 'challenging', 'fire', 'phenomena', 'to', 'those', 'who', 'regularly', 'encounter', 'them', 'firefighters', '... | [-0.02827078149184809, 0.1347610430890008, -0.07026198407270967, 0.1083154201337869, -0.10730742902628013, -0.18986906248137803, 0.05451575285734091, 0.4441303512207547, -0.2105410230648879, -0.37031489451016697, 0.13053839044344323, -0.3145043573839436, -0.16542874538178617, 0.1879518019802224, -0.177819678027715, 0.0... |
1,801.09805 | Parameter Box: High Performance Parameter Servers for Efficient
Distributed Deep Neural Network Training | Most work in the deep learning systems community has focused on faster
inference, but arriving at a trained model requires lengthy experiments.
Accelerating training lets developers iterate faster and come up with better
models. DNN training is often seen as a compute-bound problem, best done in a
single large comput... | cs.DC | most work in the deep learning systems community has focused on faster inference but arriving at a trained model requires lengthy experiments accelerating training lets developers iterate faster and come up with better models dnn training is often seen as a computebound problem best done in a single large compute node ... | [['most', 'work', 'in', 'the', 'deep', 'learning', 'systems', 'community', 'has', 'focused', 'on', 'faster', 'inference', 'but', 'arriving', 'at', 'a', 'trained', 'model', 'requires', 'lengthy', 'experiments', 'accelerating', 'training', 'lets', 'developers', 'iterate', 'faster', 'and', 'come', 'up', 'with', 'better', ... | [-0.12549344327327652, 0.009073580387009245, -0.024357515773422513, 0.043482199041486286, -0.12754810598338595, -0.2462505790362439, 0.09031617448804005, 0.4720699700813454, -0.2802736948545386, -0.3627115326526109, 0.06826352781522124, -0.21882264629507867, -0.1009442671288875, 0.2239654974630237, -0.13624501864125285... |
1,801.09806 | A proof of Jones' conjecture | In this paper, we prove that Wright's equation $y'(t) = - \alpha y(t-1) \{1 +
y(t)\}$ has a unique slowly oscillating periodic solution for parameter values
$\alpha \in (\tfrac{\pi}{2}, 1.9]$, up to time translation. This result proves
Jones' Conjecture formulated in 1962, that there is a unique slowly oscillating
pe... | math.DS | in this paper we prove that wrights equation yt alpha yt1 1 yt has a unique slowly oscillating periodic solution for parameter values alpha in tfracpi2 19 up to time translation this result proves jones conjecture formulated in 1962 that there is a unique slowly oscillating periodic orbit for all alpha tfracpi2 further... | [['in', 'this', 'paper', 'we', 'prove', 'that', 'wrights', 'equation', 'yt', 'alpha', 'yt1', '1', 'yt', 'has', 'a', 'unique', 'slowly', 'oscillating', 'periodic', 'solution', 'for', 'parameter', 'values', 'alpha', 'in', 'tfracpi2', '19', 'up', 'to', 'time', 'translation', 'this', 'result', 'proves', 'jones', 'conjectur... | [-0.24553210690085378, 0.13761318042608245, -0.08355588700090136, 0.04371133980707132, -0.05351887154392898, -0.20371634469234517, 0.010203092985986068, 0.3201215370425156, -0.30755276065319775, -0.20187848940092537, 0.08106828574423812, -0.27474674656654574, -0.1756798374599644, 0.23948194900793687, -0.086191002838313... |
1,801.09807 | A QCA Layout Design Methodology. Part I | Quantum-dot Cellular Automata (QCA) as a nanoscale transistor-less device
technology offers distinguishing advantages over the limitations of CMOS
circuits. While more than 2 decades of design progress have been achieved with
QCA, a comprehensive composition approach for the layout design in this
technology is needed... | cs.ET | quantumdot cellular automata qca as a nanoscale transistorless device technology offers distinguishing advantages over the limitations of cmos circuits while more than 2 decades of design progress have been achieved with qca a comprehensive composition approach for the layout design in this technology is needed in this... | [['quantumdot', 'cellular', 'automata', 'qca', 'as', 'a', 'nanoscale', 'transistorless', 'device', 'technology', 'offers', 'distinguishing', 'advantages', 'over', 'the', 'limitations', 'of', 'cmos', 'circuits', 'while', 'more', 'than', '2', 'decades', 'of', 'design', 'progress', 'have', 'been', 'achieved', 'with', 'qca... | [-0.12652744730402987, 0.04917625515166708, 0.004234986746627273, -0.027519184306988284, -0.01840153184126724, -0.2779487413307182, 0.09484284776357012, 0.44485215457024596, -0.19827112545155817, -0.28901161420902216, 0.07200484207450328, -0.19732700510307996, -0.17257288896544565, 0.2521412287076766, -0.08952334192064... |
1,801.09808 | The Intriguing Properties of Model Explanations | Linear approximations to the decision boundary of a complex model have become
one of the most popular tools for interpreting predictions. In this paper, we
study such linear explanations produced either post-hoc by a few recent methods
or generated along with predictions with contextual explanation networks
(CENs). W... | cs.LG cs.AI | linear approximations to the decision boundary of a complex model have become one of the most popular tools for interpreting predictions in this paper we study such linear explanations produced either posthoc by a few recent methods or generated along with predictions with contextual explanation networks cens we focus ... | [['linear', 'approximations', 'to', 'the', 'decision', 'boundary', 'of', 'a', 'complex', 'model', 'have', 'become', 'one', 'of', 'the', 'most', 'popular', 'tools', 'for', 'interpreting', 'predictions', 'in', 'this', 'paper', 'we', 'study', 'such', 'linear', 'explanations', 'produced', 'either', 'posthoc', 'by', 'a', 'f... | [-0.009410834934829769, 0.07057326821894902, -0.09682899325680747, 0.12949470948291897, -0.11192924356846898, -0.21724228371210672, 0.033655597389615315, 0.42114369598803697, -0.25181905462738574, -0.29904692213878864, 0.1168282454072377, -0.28435631529255595, -0.20056265908675008, 0.22774005510965017, -0.0601054838237... |
1,801.09809 | A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect
Matching on Bipartite Graphs | We design and implement an efficient parallel algorithm for finding a perfect
matching in a weighted bipartite graph such that weights on the edges of the
matching are large. This problem differs from the maximum weight matching
problem, for which scalable approximation algorithms are known. It is primarily
motivated... | cs.DC | we design and implement an efficient parallel algorithm for finding a perfect matching in a weighted bipartite graph such that weights on the edges of the matching are large this problem differs from the maximum weight matching problem for which scalable approximation algorithms are known it is primarily motivated by f... | [['we', 'design', 'and', 'implement', 'an', 'efficient', 'parallel', 'algorithm', 'for', 'finding', 'a', 'perfect', 'matching', 'in', 'a', 'weighted', 'bipartite', 'graph', 'such', 'that', 'weights', 'on', 'the', 'edges', 'of', 'the', 'matching', 'are', 'large', 'this', 'problem', 'differs', 'from', 'the', 'maximum', '... | [-0.12922831541668114, 0.05152682720207932, -0.04079432766990398, 0.03234152384935773, -0.10771419989892324, -0.16739817380386574, 0.07854288119117635, 0.44118977852419694, -0.31026178806694754, -0.36147095167226245, 0.11445141118284399, -0.22981363711666994, -0.12391255817419733, 0.1859136490807445, -0.062116901470951... |
1,801.0981 | Personalized Survival Prediction with Contextual Explanation Networks | Accurate and transparent prediction of cancer survival times on the level of
individual patients can inform and improve patient care and treatment
practices. In this paper, we design a model that concurrently learns to
accurately predict patient-specific survival distributions and to explain its
predictions in terms ... | cs.LG cs.AI | accurate and transparent prediction of cancer survival times on the level of individual patients can inform and improve patient care and treatment practices in this paper we design a model that concurrently learns to accurately predict patientspecific survival distributions and to explain its predictions in terms of pa... | [['accurate', 'and', 'transparent', 'prediction', 'of', 'cancer', 'survival', 'times', 'on', 'the', 'level', 'of', 'individual', 'patients', 'can', 'inform', 'and', 'improve', 'patient', 'care', 'and', 'treatment', 'practices', 'in', 'this', 'paper', 'we', 'design', 'a', 'model', 'that', 'concurrently', 'learns', 'to',... | [0.006205567185697723, -0.0030774368638988615, -0.08397382846263753, 0.10139255691704548, -0.11370713271062113, -0.18945725638927383, 0.08370498578691439, 0.44143326865693877, -0.18514721339553103, -0.3213929795883288, 0.11691202550033523, -0.29727246886319364, -0.17497175743164542, 0.20910553363861886, -0.125191633300... |
1,801.09811 | Operational Markov condition for quantum processes | We derive a necessary and sufficient condition for a quantum process to be
Markovian which coincides with the classical one in the relevant limit. Our
condition unifies all previously known definitions for quantum Markov processes
by accounting for all potentially detectable memory effects. We then derive a
family of... | quant-ph | we derive a necessary and sufficient condition for a quantum process to be markovian which coincides with the classical one in the relevant limit our condition unifies all previously known definitions for quantum markov processes by accounting for all potentially detectable memory effects we then derive a family of mea... | [['we', 'derive', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'a', 'quantum', 'process', 'to', 'be', 'markovian', 'which', 'coincides', 'with', 'the', 'classical', 'one', 'in', 'the', 'relevant', 'limit', 'our', 'condition', 'unifies', 'all', 'previously', 'known', 'definitions', 'for', 'quantum', 'marko... | [-0.09767231359269078, 0.14461980953714565, -0.08696477622479985, 0.12781626091050144, -0.05602361385612503, -0.1693984326649163, 0.09180427577015698, 0.3023725407271597, -0.25715513660619954, -0.27837413744265704, 0.1184756055177116, -0.18832474540134794, -0.12329600025336013, 0.22239090000757164, -0.05981048087491408... |
1,801.09812 | Enabling Low-power Duplex Visible Light Communication | The new generation of LED-based illuminating infrastructures has enabled a
"dual-paradigm" where LEDs are used for both illumination and communication
purposes. The ubiquity of lighting makes visible light communication (VLC) well
suited for communication with mobile devices and sensor nodes in indoor
environment. Ex... | cs.NI | the new generation of ledbased illuminating infrastructures has enabled a dualparadigm where leds are used for both illumination and communication purposes the ubiquity of lighting makes visible light communication vlc well suited for communication with mobile devices and sensor nodes in indoor environment existing res... | [['the', 'new', 'generation', 'of', 'ledbased', 'illuminating', 'infrastructures', 'has', 'enabled', 'a', 'dualparadigm', 'where', 'leds', 'are', 'used', 'for', 'both', 'illumination', 'and', 'communication', 'purposes', 'the', 'ubiquity', 'of', 'lighting', 'makes', 'visible', 'light', 'communication', 'vlc', 'well', '... | [-0.23808804545370113, 0.06037472032531022, -0.04909341368679102, -0.04150876627785952, -0.07461538965293726, -0.2657754434689928, 0.08565888835711392, 0.4834456543147854, -0.23436824497222514, -0.3016949783551035, 0.08347718137794162, -0.27090084349794025, -0.19500989766259277, 0.29163628223944793, -0.1812552989932236... |
1,801.09813 | Subgraph counts for dense random graphs with specified degrees | We prove two estimates for the expectation of the exponential of a complex
function of a random permutation or subset. Using this theory, we find
asymptotic expressions for the expected number of copies and induced copies of
a given graph in a uniformly random graph with degree sequence
$(d_1,\ldots,d_n)$ as $n \righ... | math.CO | we prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset using this theory we find asymptotic expressions for the expected number of copies and induced copies of a given graph in a uniformly random graph with degree sequence d_1ldotsd_n as n rightarrow infty ... | [['we', 'prove', 'two', 'estimates', 'for', 'the', 'expectation', 'of', 'the', 'exponential', 'of', 'a', 'complex', 'function', 'of', 'a', 'random', 'permutation', 'or', 'subset', 'using', 'this', 'theory', 'we', 'find', 'asymptotic', 'expressions', 'for', 'the', 'expected', 'number', 'of', 'copies', 'and', 'induced', ... | [-0.15589093075257288, 0.17141162790358067, -0.016167879418795366, 0.00949766932066575, -0.005686696282172778, -0.09332566511963146, 0.08348897909072328, 0.3326768988451685, -0.2966213034794116, -0.28432616914611264, 0.0676393700477454, -0.30919303330985537, -0.11030174524478435, 0.1366789947735168, -0.0269824887614652... |
1,801.09814 | Hardy's paradox according to non-classical semantics | In the paper, using the language of spin-half particles, Hardy's paradox is
examined within different semantics: a partial one, a many-valued one, and one
defined as a set of weak values of projection operators. As it is shown in this
paper, any of such non-classical semantics can resolve Hardy's paradox.
| quant-ph | in the paper using the language of spinhalf particles hardys paradox is examined within different semantics a partial one a manyvalued one and one defined as a set of weak values of projection operators as it is shown in this paper any of such nonclassical semantics can resolve hardys paradox | [['in', 'the', 'paper', 'using', 'the', 'language', 'of', 'spinhalf', 'particles', 'hardys', 'paradox', 'is', 'examined', 'within', 'different', 'semantics', 'a', 'partial', 'one', 'a', 'manyvalued', 'one', 'and', 'one', 'defined', 'as', 'a', 'set', 'of', 'weak', 'values', 'of', 'projection', 'operators', 'as', 'it', '... | [-0.10631753975292668, 0.0906168401055038, -0.0866055966541171, 0.15936211810680107, -0.09799419921357184, -0.17687060874886812, 0.018741769031621516, 0.27937078185379505, -0.2971360411681235, -0.2678963649086654, 0.04881559130270034, -0.2915231165662408, -0.09920509411022067, 0.1527192716859281, -0.12995871152263136, ... |
1,801.09815 | A brief survey on singularities of geodesic flows in smooth signature
changing metrics on 2-surfaces | We present a survey on generic singularities of geodesic flows in smooth
signature changing metrics (often called pseudo-Riemannian) in dimension 2.
Generically, a pseudo-Riemannian metric on a 2-manifold $S$ changes its
signature (degenerates) along a curve $S_0$, which locally separates $S$ into a
Riemannian ($R$) ... | math.DG | we present a survey on generic singularities of geodesic flows in smooth signature changing metrics often called pseudoriemannian in dimension 2 generically a pseudoriemannian metric on a 2manifold s changes its signature degenerates along a curve s_0 which locally separates s into a riemannian r and a lorentzian l dom... | [['we', 'present', 'a', 'survey', 'on', 'generic', 'singularities', 'of', 'geodesic', 'flows', 'in', 'smooth', 'signature', 'changing', 'metrics', 'often', 'called', 'pseudoriemannian', 'in', 'dimension', '2', 'generically', 'a', 'pseudoriemannian', 'metric', 'on', 'a', '2manifold', 's', 'changes', 'its', 'signature', ... | [-0.2575487032597273, 0.10370021270431687, -0.11978349965881474, 0.012217287657388153, -0.10409067496045554, -0.18125937755022498, 0.021492796059507522, 0.3849493998313581, -0.29075128610932477, -0.15944591535758362, 0.07616671994982804, -0.30570493562378154, -0.10225940340735616, 0.17347589761943277, -0.06172712668640... |
1,801.09816 | Spatiotemporal intermittency and localized dynamic fluctuations upon
approaching the glass transition | We introduce a new and robust approach for characterizing spatially and
temporally heterogeneous behavior within a system based on the evolution of
dynamic fuctuations once averaged over different space lengths and time scales.
We apply it to investigate the dynamics in two canonical systems as the glass
transition i... | cond-mat.dis-nn cond-mat.soft | we introduce a new and robust approach for characterizing spatially and temporally heterogeneous behavior within a system based on the evolution of dynamic fuctuations once averaged over different space lengths and time scales we apply it to investigate the dynamics in two canonical systems as the glass transition is a... | [['we', 'introduce', 'a', 'new', 'and', 'robust', 'approach', 'for', 'characterizing', 'spatially', 'and', 'temporally', 'heterogeneous', 'behavior', 'within', 'a', 'system', 'based', 'on', 'the', 'evolution', 'of', 'dynamic', 'fuctuations', 'once', 'averaged', 'over', 'different', 'space', 'lengths', 'and', 'time', 's... | [-0.1419551082171483, 0.22640153519318415, -0.07441247963170344, 0.052646251519101565, 0.04469577238584558, -0.10956513129913055, -0.005690566540972606, 0.37198158273020304, -0.2863364876667457, -0.2825767877008262, 0.07499219509269539, -0.2807091620859799, -0.15553119922946165, 0.160146396162475, 0.010288558810160638,... |
1,801.09817 | Model-assisted inference for treatment effects using regularized
calibrated estimation with high-dimensional data | Consider the problem of estimating average treatment effects when a large
number of covariates are used to adjust for possible confounding through
outcome regression and propensity score models. The conventional approach of
model building and fitting iteratively can be difficult to implement, depending
on ad hoc choi... | math.ST stat.TH | consider the problem of estimating average treatment effects when a large number of covariates are used to adjust for possible confounding through outcome regression and propensity score models the conventional approach of model building and fitting iteratively can be difficult to implement depending on ad hoc choices ... | [['consider', 'the', 'problem', 'of', 'estimating', 'average', 'treatment', 'effects', 'when', 'a', 'large', 'number', 'of', 'covariates', 'are', 'used', 'to', 'adjust', 'for', 'possible', 'confounding', 'through', 'outcome', 'regression', 'and', 'propensity', 'score', 'models', 'the', 'conventional', 'approach', 'of',... | [0.012613212833620184, 0.022677471850418043, -0.1068966752410359, 0.14681837900580438, -0.11341290219452202, -0.2390227809461303, 0.09884581047089437, 0.44175263744877363, -0.21559808414611148, -0.31303725816589606, 0.12159201410708843, -0.23908468343438657, -0.15464489060412426, 0.14753348190276847, -0.106090011466975... |
1,801.09818 | On the crossroads of enumerative geometry and geometric representation
theory | The subjects in the title are interwoven in many different and very deep
ways. I recently wrote several expository accounts [64-66] that reflect a
certain range of developments, but even in their totality they cannot be taken
as a comprehensive survey. In the format of a 30-page contribution aimed at a
general mathem... | math.RT math-ph math.AG math.MP | the subjects in the title are interwoven in many different and very deep ways i recently wrote several expository accounts 6466 that reflect a certain range of developments but even in their totality they cannot be taken as a comprehensive survey in the format of a 30page contribution aimed at a general mathematical au... | [['the', 'subjects', 'in', 'the', 'title', 'are', 'interwoven', 'in', 'many', 'different', 'and', 'very', 'deep', 'ways', 'i', 'recently', 'wrote', 'several', 'expository', 'accounts', '6466', 'that', 'reflect', 'a', 'certain', 'range', 'of', 'developments', 'but', 'even', 'in', 'their', 'totality', 'they', 'can', 'not... | [-0.09352215939054914, 0.10328884029321456, -0.12358790563074139, 0.12237560656968127, -0.14205876950781499, -0.1584811055760705, 0.008222033342953478, 0.36935449864589764, -0.24529290731912584, -0.32646699032087007, 0.11551231081241721, -0.2648118848682203, -0.17286576598547818, 0.22451661135268847, -0.100545307422538... |
1,801.09819 | Transformation Autoregressive Networks | The fundamental task of general density estimation $p(x)$ has been of keen
interest to machine learning. In this work, we attempt to systematically
characterize methods for density estimation. Broadly speaking, most of the
existing methods can be categorized into either using: \textit{a})
autoregressive models to est... | stat.ML | the fundamental task of general density estimation px has been of keen interest to machine learning in this work we attempt to systematically characterize methods for density estimation broadly speaking most of the existing methods can be categorized into either using textita autoregressive models to estimate the condi... | [['the', 'fundamental', 'task', 'of', 'general', 'density', 'estimation', 'px', 'has', 'been', 'of', 'keen', 'interest', 'to', 'machine', 'learning', 'in', 'this', 'work', 'we', 'attempt', 'to', 'systematically', 'characterize', 'methods', 'for', 'density', 'estimation', 'broadly', 'speaking', 'most', 'of', 'the', 'exi... | [-0.05659600862211758, 0.014290637435812143, -0.09914160238639001, 0.057405302044935526, -0.07872360972086749, -0.14084107236816518, 0.046257513111096715, 0.4350154161453247, -0.2723701145357242, -0.28127983281569136, 0.08729936999358957, -0.24451853813182922, -0.19438225914190913, 0.19492176517003004, -0.1165271483346... |
1,801.0982 | A consequence of the growth of rotation sets for families of
diffeomorphisms of the torus | In this paper we consider $C^\infty $-generic families of area-preserving
diffeomorphisms of the torus homotopic to the identity and their rotation sets.
Let $f_t:\rm{T^2\rightarrow T^2}$ be such a family, $\widetilde{f}_t:\rm
I\negthinspace R^2 \rightarrow \rm I\negthinspace R^2$ be a fixed family of
lifts and $\rho... | math.DS | in this paper we consider cinfty generic families of areapreserving diffeomorphisms of the torus homotopic to the identity and their rotation sets let f_trmt2rightarrow t2 be such a family widetildef_trm inegthinspace r2 rightarrow rm inegthinspace r2 be a fixed family of lifts and rho widetildef_t be their rotation se... | [['in', 'this', 'paper', 'we', 'consider', 'cinfty', 'generic', 'families', 'of', 'areapreserving', 'diffeomorphisms', 'of', 'the', 'torus', 'homotopic', 'to', 'the', 'identity', 'and', 'their', 'rotation', 'sets', 'let', 'f_trmt2rightarrow', 't2', 'be', 'such', 'a', 'family', 'widetildef_trm', 'inegthinspace', 'r2', '... | [-0.1920265171896009, 0.1349901533498862, -0.0690302067824744, 0.05848842553413389, -0.07285492890389925, -0.1897275141831911, 0.02455378150353258, 0.3672119752568676, -0.3088513381161632, -0.15341099316035123, 0.10961330239847801, -0.32626824489082484, -0.12153485329089597, 0.14557365150555698, -0.0797159237348858, 0.... |
1,801.09821 | Learning to Emulate an Expert Projective Cone Scheduler | Projective cone scheduling defines a large class of rate-stabilizing policies
for queueing models relevant to several applications. While there exists
considerable theory on the properties of projective cone schedulers, there is
little practical guidance on choosing the parameters that define them. In this
paper, we ... | cs.LG | projective cone scheduling defines a large class of ratestabilizing policies for queueing models relevant to several applications while there exists considerable theory on the properties of projective cone schedulers there is little practical guidance on choosing the parameters that define them in this paper we propose... | [['projective', 'cone', 'scheduling', 'defines', 'a', 'large', 'class', 'of', 'ratestabilizing', 'policies', 'for', 'queueing', 'models', 'relevant', 'to', 'several', 'applications', 'while', 'there', 'exists', 'considerable', 'theory', 'on', 'the', 'properties', 'of', 'projective', 'cone', 'schedulers', 'there', 'is',... | [-0.13658511930660003, 0.023081637277133076, -0.1079808789109321, 0.04968554365301603, -0.12158336365889562, -0.17765762222881773, 0.10918253400779672, 0.44609872453208815, -0.26199480672612, -0.2890337709533541, 0.11154068129039124, -0.21234282708579771, -0.1691411302979472, 0.23116736176276678, -0.13465156366950587, ... |
1,801.09822 | $N^*$ Production from $e^+e^-$ Annihilations | Up to now, the $N^*$ production from $e^+e^-$ annihilations has been studied
only around charmonium region. Charmonium decays to $N^*$s are analogous to
(time-like) EM form factors in that the charm quark annihilation provides a
nearly pointlike (ggg) current. Complementary to other sources, such as $\pi
N$, $eN$ and... | hep-ph hep-ex nucl-ex nucl-th | up to now the n production from ee annihilations has been studied only around charmonium region charmonium decays to ns are analogous to timelike em form factors in that the charm quark annihilation provides a nearly pointlike ggg current complementary to other sources such as pi n en and gamma n reactions this new sou... | [['up', 'to', 'now', 'the', 'n', 'production', 'from', 'ee', 'annihilations', 'has', 'been', 'studied', 'only', 'around', 'charmonium', 'region', 'charmonium', 'decays', 'to', 'ns', 'are', 'analogous', 'to', 'timelike', 'em', 'form', 'factors', 'in', 'that', 'the', 'charm', 'quark', 'annihilation', 'provides', 'a', 'ne... | [-0.06570458776298334, 0.20524910080007197, -0.09311603900698043, 0.10338246338813536, -0.06238396719971806, -0.15314638519121967, 0.055818453590750466, 0.3506855098620662, -0.21585502387168481, -0.23254838543608017, -0.03699092878648032, -0.41231860361570855, 0.029827425501203722, 0.2007048034364809, 0.103298583228474... |
1,801.09823 | Object Detection in Videos by High Quality Object Linking | Compared with object detection in static images, object detection in videos
is more challenging due to degraded image qualities. An effective way to
address this problem is to exploit temporal contexts by linking the same object
across video to form tubelets and aggregating classification scores in the
tubelets. In t... | cs.CV | compared with object detection in static images object detection in videos is more challenging due to degraded image qualities an effective way to address this problem is to exploit temporal contexts by linking the same object across video to form tubelets and aggregating classification scores in the tubelets in this p... | [['compared', 'with', 'object', 'detection', 'in', 'static', 'images', 'object', 'detection', 'in', 'videos', 'is', 'more', 'challenging', 'due', 'to', 'degraded', 'image', 'qualities', 'an', 'effective', 'way', 'to', 'address', 'this', 'problem', 'is', 'to', 'exploit', 'temporal', 'contexts', 'by', 'linking', 'the', '... | [-0.09562353946443836, -0.014404191396750504, -0.05393091781068792, 0.05269237782144291, -0.08117965855269452, -0.16459586494079048, 0.015072074128685027, 0.46419762244468993, -0.21207750819654864, -0.36091247948640015, 0.05679378458174479, -0.27250502811054167, -0.14765242881565407, 0.1811968212832142, -0.184049919323... |
1,801.09824 | Evidence for rotational to vibrational evolution along the yrast line in
the odd-A rare-earth nuclei | The phase transition of nuclei to increasing angular momentum (or spin) and
excitation energy is one of the most fundamental topics of nuclear structure
research. The odd-N nuclei with A equal 160 are widely considered belonging to
the well-deformed region, and their excitation spectra are energetically
favored to ex... | nucl-th | the phase transition of nuclei to increasing angular momentum or spin and excitation energy is one of the most fundamental topics of nuclear structure research the oddn nuclei with a equal 160 are widely considered belonging to the welldeformed region and their excitation spectra are energetically favored to exhibit th... | [['the', 'phase', 'transition', 'of', 'nuclei', 'to', 'increasing', 'angular', 'momentum', 'or', 'spin', 'and', 'excitation', 'energy', 'is', 'one', 'of', 'the', 'most', 'fundamental', 'topics', 'of', 'nuclear', 'structure', 'research', 'the', 'oddn', 'nuclei', 'with', 'a', 'equal', '160', 'are', 'widely', 'considered'... | [-0.0637050202753853, 0.20773918630946228, -0.06682827988300812, 0.09825311985083503, -0.003671360702190379, -0.11343972560486452, 0.03968316492285918, 0.41692825711586257, -0.21179520518377046, -0.2992861676004959, -0.007865863417668697, -0.3078595399258927, -0.034584134654017454, 0.15800276620781675, 0.05618877339230... |
1,801.09825 | On the global stability of departure time user equilibrium: A Lyapunov
approach | In (Jin, 2018), a new day-to-day dynamical system was proposed for drivers'
departure time choice at a single bottleneck. Based on three behavioral
principles, the nonlocal departure and arrival times choice problems were
converted to the local scheduling payoff choice problem, whose day-to-day
dynamics are described... | math.OC | in jin 2018 a new daytoday dynamical system was proposed for drivers departure time choice at a single bottleneck based on three behavioral principles the nonlocal departure and arrival times choice problems were converted to the local scheduling payoff choice problem whose daytoday dynamics are described by the lighth... | [['in', 'jin', '2018', 'a', 'new', 'daytoday', 'dynamical', 'system', 'was', 'proposed', 'for', 'drivers', 'departure', 'time', 'choice', 'at', 'a', 'single', 'bottleneck', 'based', 'on', 'three', 'behavioral', 'principles', 'the', 'nonlocal', 'departure', 'and', 'arrival', 'times', 'choice', 'problems', 'were', 'conve... | [-0.11048063503072501, 0.05176577946569586, -0.1057634374753026, 0.059850770017886856, -0.05039979221042374, -0.17790991083502064, 0.07260872528382481, 0.3820376495059965, -0.27722384912957404, -0.2916456906205236, 0.12614032251374988, -0.23805209968423727, -0.1714657040023855, 0.16487170648881525, -0.06678547578751398... |
1,801.09826 | Manhattan Curves for Hyperbolic Surfaces with Cusps | In this paper, we study an interesting curve, so-called the Manhattan curve,
associated with a pair of boundary-preserving Fuchsian representations of a
(non-compact) surface, especially representations corresponding to Riemann
surfaces with cusps. Using Thermodynamic Formalism (for countable Markov
shifts), we prove... | math.DS | in this paper we study an interesting curve socalled the manhattan curve associated with a pair of boundarypreserving fuchsian representations of a noncompact surface especially representations corresponding to riemann surfaces with cusps using thermodynamic formalism for countable markov shifts we prove the analyticit... | [['in', 'this', 'paper', 'we', 'study', 'an', 'interesting', 'curve', 'socalled', 'the', 'manhattan', 'curve', 'associated', 'with', 'a', 'pair', 'of', 'boundarypreserving', 'fuchsian', 'representations', 'of', 'a', 'noncompact', 'surface', 'especially', 'representations', 'corresponding', 'to', 'riemann', 'surfaces', ... | [-0.1546399802091005, 0.09340070208312734, -0.1619415575152506, 0.10185694777359511, -0.13468226208688988, -0.12499269507859118, 0.02001893915998601, 0.34313017707588017, -0.27907014062857605, -0.19978913988756097, 0.11661612264393573, -0.2993862392461818, -0.21923191577493065, 0.23407579825910996, -0.17123741809062767... |
1,801.09827 | Robustness of classification ability of spiking neural networks | It is well-known that the robustness of artificial neural networks (ANNs) is
important for their wide ranges of applications. In this paper, we focus on the
robustness of the classification ability of a spiking neural network which
receives perturbed inputs. Actually, the perturbation is allowed to be
arbitrary style... | stat.ML cs.LG | it is wellknown that the robustness of artificial neural networks anns is important for their wide ranges of applications in this paper we focus on the robustness of the classification ability of a spiking neural network which receives perturbed inputs actually the perturbation is allowed to be arbitrary styles however... | [['it', 'is', 'wellknown', 'that', 'the', 'robustness', 'of', 'artificial', 'neural', 'networks', 'anns', 'is', 'important', 'for', 'their', 'wide', 'ranges', 'of', 'applications', 'in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'robustness', 'of', 'the', 'classification', 'ability', 'of', 'a', 'spiking', 'neural', ... | [-0.10566970624575034, 0.04555624533023634, -0.06083556633500051, 0.0616442133012317, -0.06793228722789822, -0.15779342498847168, 0.010819154345009425, 0.42209072731282204, -0.2640516113438835, -0.28204733507758745, 0.13521791211080622, -0.2788317010431767, -0.24947216635735783, 0.22223231368315444, -0.0989278164215398... |
1,801.09828 | Regularity and continuity of the multilinear strong maximal operators | Let $m\ge 1$, in this paper, our object of investigation is the regularity
and and continuity properties of the following multilinear strong maximal
operator $${\mathscr{M}}_{\mathcal{R}}(\vec{f})(x)=\sup_{\substack{R \ni x
R\in\mathcal{R}}}\prod\limits_{i=1}^m\frac{1}{|R|}\int_{R}|f_i(y)|dy,$$ where
$x\in\mathbb{R}^... | math.CA math.AP | let mge 1 in this paper our object of investigation is the regularity and and continuity properties of the following multilinear strong maximal operator mathscrm_mathcalrvecfxsup_substackr ni x rinmathcalrprodlimits_i1mfrac1rint_rf_iydy where xinmathbbrd and mathcalr denotes the family of all rectangles in mathbbrd wit... | [['let', 'mge', '1', 'in', 'this', 'paper', 'our', 'object', 'of', 'investigation', 'is', 'the', 'regularity', 'and', 'and', 'continuity', 'properties', 'of', 'the', 'following', 'multilinear', 'strong', 'maximal', 'operator', 'mathscrm_mathcalrvecfxsup_substackr', 'ni', 'x', 'rinmathcalrprodlimits_i1mfrac1rint_rf_iydy... | [-0.09379687827796017, 0.0977157990615169, -0.025726344879353193, 0.06845115413520167, -0.07669784936758621, -0.10281860990245349, -0.007452517571126497, 0.3456451507830402, -0.3390671250796536, -0.16447168167839507, 0.1430315180680226, -0.29429682750800035, -0.09167135800604095, 0.20398644461273785, -0.135243481309039... |
1,801.09829 | Weighted Community Detection and Data Clustering Using Message Passing | Grouping objects into clusters based on similarities or weights between them
is one of the most important problems in science and engineering. In this work,
by extending message passing algorithms and spectral algorithms proposed for
unweighted community detection problem, we develop a non-parametric method
based on ... | physics.soc-ph cs.SI stat.ML | grouping objects into clusters based on similarities or weights between them is one of the most important problems in science and engineering in this work by extending message passing algorithms and spectral algorithms proposed for unweighted community detection problem we develop a nonparametric method based on statis... | [['grouping', 'objects', 'into', 'clusters', 'based', 'on', 'similarities', 'or', 'weights', 'between', 'them', 'is', 'one', 'of', 'the', 'most', 'important', 'problems', 'in', 'science', 'and', 'engineering', 'in', 'this', 'work', 'by', 'extending', 'message', 'passing', 'algorithms', 'and', 'spectral', 'algorithms', ... | [-0.030870367056715104, -0.00023009720410170433, -0.103718927198705, 0.06815041826692843, -0.10239905140666192, -0.13311271414776066, 0.08327433826551507, 0.4360496462821694, -0.27986016640716116, -0.34600735877964844, 0.07638785630635019, -0.26623712619454765, -0.1839427673517743, 0.200597694960639, -0.072764256722621... |
1,801.0983 | Linking Phase Transitions and Quantum Entanglement at Arbitrary
Temperature | In this work, we establish a general theory of phase transitions and quantum
entanglement in the equilibrium state at arbitrary temperatures. First, we
derived a set of universal functional relations between the matrix elements of
two-body reduced density matrix of the canonical density matrix and the
Helmholtz free ... | quant-ph cond-mat.stat-mech | in this work we establish a general theory of phase transitions and quantum entanglement in the equilibrium state at arbitrary temperatures first we derived a set of universal functional relations between the matrix elements of twobody reduced density matrix of the canonical density matrix and the helmholtz free energy... | [['in', 'this', 'work', 'we', 'establish', 'a', 'general', 'theory', 'of', 'phase', 'transitions', 'and', 'quantum', 'entanglement', 'in', 'the', 'equilibrium', 'state', 'at', 'arbitrary', 'temperatures', 'first', 'we', 'derived', 'a', 'set', 'of', 'universal', 'functional', 'relations', 'between', 'the', 'matrix', 'el... | [-0.12379913350853783, 0.20909492952066142, -0.07684128051940572, 0.0380172785557531, 0.0384586793342991, -0.07443624669575744, 0.06131382522341305, 0.31602412130485275, -0.2798953734795679, -0.24571507571874043, 0.08049776686766025, -0.2909750308422647, -0.17558966010268887, 0.09232770297648771, 0.02935059057939908, 0... |
1,801.09831 | Evaluation of Parallel Tempering to Accelerate Bayesian Parameter
Estimation in Systems Biology | Models of biological systems often have many unknown parameters that must be
determined in order for model behavior to match experimental observations.
Commonly-used methods for parameter estimation that return point estimates of
the best-fit parameters are insufficient when models are high dimensional and
under-cons... | q-bio.QM | models of biological systems often have many unknown parameters that must be determined in order for model behavior to match experimental observations commonlyused methods for parameter estimation that return point estimates of the bestfit parameters are insufficient when models are high dimensional and underconstraine... | [['models', 'of', 'biological', 'systems', 'often', 'have', 'many', 'unknown', 'parameters', 'that', 'must', 'be', 'determined', 'in', 'order', 'for', 'model', 'behavior', 'to', 'match', 'experimental', 'observations', 'commonlyused', 'methods', 'for', 'parameter', 'estimation', 'that', 'return', 'point', 'estimates', ... | [-0.029803940046172178, 0.10868567314796333, -0.08208294853934835, 0.10162711263460628, -0.05792501795606814, -0.21498605768172607, 0.04614099675110715, 0.4520963058585964, -0.26226851203423623, -0.3411448624111333, 0.09800946822693823, -0.23305484669290924, -0.07828736972084498, 0.21685858862573218, -0.052290190138037... |
1,801.09832 | Characterizations for inner functions in certain function spaces | For $\frac12<p<\infty$, $0<q<\infty$ and a certain two-sided doubling weight
$\omega$, we characterize those inner functions $\Theta$ for which
$$\|\Theta'\|_{A^{p,q}_\omega}^q=\int_0^1 \left(\int_0^{2\pi}
|\Theta'(re^{i\theta})|^p d\theta\right)^{q/p}
\omega(r)\,dr<\infty.$$ Then we show a modified version of this... | math.CV | for frac12pinfty 0qinfty and a certain twosided doubling weight omega we characterize those inner functions theta for which theta_apq_omegaqint_01 leftint_02pi thetareithetap dthetarightqp omegardrinfty then we show a modified version of this result for pge q moreover two additional characterizations for inner function... | [['for', 'frac12pinfty', '0qinfty', 'and', 'a', 'certain', 'twosided', 'doubling', 'weight', 'omega', 'we', 'characterize', 'those', 'inner', 'functions', 'theta', 'for', 'which', 'theta_apq_omegaqint_01', 'leftint_02pi', 'thetareithetap', 'dthetarightqp', 'omegardrinfty', 'then', 'we', 'show', 'a', 'modified', 'versio... | [-0.1427644517997073, 0.09479042455140087, -0.0496417659205488, 0.10858962423840744, -0.10819058641791343, -0.1288491079997685, 0.01003507418402781, 0.39539037541382843, -0.31277543753385545, -0.19098966910193363, 0.12840488017019297, -0.22716742967151934, -0.14729909416702058, 0.2272732168617141, -0.07046159172637595,... |
1,801.09833 | Strain engineering of the silicon-vacancy center in diamond | We control the electronic structure of the silicon-vacancy (SiV) color-center
in diamond by changing its static strain environment with a
nano-electro-mechanical system. This allows deterministic and local tuning of
SiV optical and spin transition frequencies over a wide range, an essential
step towards multi-qubit n... | quant-ph cond-mat.mes-hall | we control the electronic structure of the siliconvacancy siv colorcenter in diamond by changing its static strain environment with a nanoelectromechanical system this allows deterministic and local tuning of siv optical and spin transition frequencies over a wide range an essential step towards multiqubit networks in ... | [['we', 'control', 'the', 'electronic', 'structure', 'of', 'the', 'siliconvacancy', 'siv', 'colorcenter', 'in', 'diamond', 'by', 'changing', 'its', 'static', 'strain', 'environment', 'with', 'a', 'nanoelectromechanical', 'system', 'this', 'allows', 'deterministic', 'and', 'local', 'tuning', 'of', 'siv', 'optical', 'and... | [-0.15979958113541107, 0.1810922902241686, 0.023625640383008684, -0.05771514259576368, 0.012332716606336065, -0.15963473903605402, 0.06169829087903594, 0.46300524968358847, -0.2580492664958433, -0.28398505944094743, 0.01163713789503505, -0.2742710428862512, -0.10196435300513439, 0.1483513032925306, 0.045764279625049906... |
1,801.09834 | A Flexible Procedure for Mixture Proportion Estimation in
Positive-Unlabeled Learning | Positive--unlabeled (PU) learning considers two samples, a positive set P
with observations from only one class and an unlabeled set U with observations
from two classes. The goal is to classify observations in U. Class mixture
proportion estimation (MPE) in U is a key step in PU learning. Blanchard et al.
[2010] sho... | stat.ME math.ST stat.ML stat.TH | positiveunlabeled pu learning considers two samples a positive set p with observations from only one class and an unlabeled set u with observations from two classes the goal is to classify observations in u class mixture proportion estimation mpe in u is a key step in pu learning blanchard et al 2010 showed that mpe in... | [['positiveunlabeled', 'pu', 'learning', 'considers', 'two', 'samples', 'a', 'positive', 'set', 'p', 'with', 'observations', 'from', 'only', 'one', 'class', 'and', 'an', 'unlabeled', 'set', 'u', 'with', 'observations', 'from', 'two', 'classes', 'the', 'goal', 'is', 'to', 'classify', 'observations', 'in', 'u', 'class', ... | [-0.07141512325943458, 0.03176699303990115, -0.03204370896738751, 0.03371175064545952, -0.0684658788524611, -0.18404494867735038, 0.12263260303057152, 0.36770267708591003, -0.2930787278167989, -0.32197038725221894, 0.048714763091491725, -0.29001098321001423, -0.1608630240046494, 0.17267939240331145, -0.1046535028465863... |
1,801.09835 | A study of deformation localization in nonlinear elastic lattices | The paper investigates localized deformation patterns resulting from the
onset of instabilities in lattice structures. The study is motivated by
previous observations on discrete hexagonal lattices, where the onset of
non-uniform, quasi-static deformation patterns was associated with the loss of
convexity of the inte... | cond-mat.soft | the paper investigates localized deformation patterns resulting from the onset of instabilities in lattice structures the study is motivated by previous observations on discrete hexagonal lattices where the onset of nonuniform quasistatic deformation patterns was associated with the loss of convexity of the interaction... | [['the', 'paper', 'investigates', 'localized', 'deformation', 'patterns', 'resulting', 'from', 'the', 'onset', 'of', 'instabilities', 'in', 'lattice', 'structures', 'the', 'study', 'is', 'motivated', 'by', 'previous', 'observations', 'on', 'discrete', 'hexagonal', 'lattices', 'where', 'the', 'onset', 'of', 'nonuniform'... | [-0.17198734222779508, 0.16244679800073292, -0.06052209997092778, 0.010371289562660748, -0.054321819969083904, -0.10533638943935622, 0.05510196055127484, 0.37215118041472894, -0.27949636314626575, -0.2407840476230771, 0.11571639353180972, -0.24927176300190249, -0.1986701107452149, 0.16785981226888186, -0.01533564676108... |
1,801.09836 | On conormal and oblique derivative problem for elliptic equations with
Dini mean oscillation coefficients | We show that weak solutions to conormal derivative problem for elliptic
equations in divergence form are continuously differentiable up to the boundary
provided that the mean oscillations of the leading coefficients satisfy the
Dini condition, the lower order coefficients satisfy certain suitable
conditions, and the ... | math.AP | we show that weak solutions to conormal derivative problem for elliptic equations in divergence form are continuously differentiable up to the boundary provided that the mean oscillations of the leading coefficients satisfy the dini condition the lower order coefficients satisfy certain suitable conditions and the boun... | [['we', 'show', 'that', 'weak', 'solutions', 'to', 'conormal', 'derivative', 'problem', 'for', 'elliptic', 'equations', 'in', 'divergence', 'form', 'are', 'continuously', 'differentiable', 'up', 'to', 'the', 'boundary', 'provided', 'that', 'the', 'mean', 'oscillations', 'of', 'the', 'leading', 'coefficients', 'satisfy'... | [-0.20194265613620116, 0.10600094813702067, -0.045983646926280805, 0.04898135930136967, -0.15231395432369677, -0.13538825478995356, -0.0532239318003772, 0.31444507414793094, -0.3385776845526283, -0.1961496965656799, 0.16144813171008648, -0.2816547814669557, -0.12433206895744897, 0.1824891237689682, -0.08547862974654247... |
1,801.09837 | Splitting Localization and Prediction Numbers | In this paper the work done by Newelski and Roslanowski is revisited to solve
a question done by Blass about one of the possible evasion and prediction
numbers. This led to define a variation of the $k$-localization property (the
$(k+1)^{\omega}$-localization property) and the use of a forcing notion with
acceleratin... | math.LO | in this paper the work done by newelski and roslanowski is revisited to solve a question done by blass about one of the possible evasion and prediction numbers this led to define a variation of the klocalization property the k1omegalocalization property and the use of a forcing notion with accelerating trees | [['in', 'this', 'paper', 'the', 'work', 'done', 'by', 'newelski', 'and', 'roslanowski', 'is', 'revisited', 'to', 'solve', 'a', 'question', 'done', 'by', 'blass', 'about', 'one', 'of', 'the', 'possible', 'evasion', 'and', 'prediction', 'numbers', 'this', 'led', 'to', 'define', 'a', 'variation', 'of', 'the', 'klocalizati... | [-0.11118518751190633, 0.10313560749043008, -0.0981250308235461, 0.08638113663693396, -0.09771058157238426, -0.09718746134098999, 0.10718816496213251, 0.2810463651406522, -0.3118258164150222, -0.31132070906460285, 0.10265281846585246, -0.21013508520412202, -0.15598969910369845, 0.1487621838340954, -0.14171609991439144,... |
1,801.09838 | Multiple Accounts Detection on Facebook Using Semi-Supervised Learning
on Graphs | In social networks, a single user may create multiple accounts to spread his
/ her opinions and to influence others, by actively comment on different news
pages. It would be beneficial to both social networks and their communities, to
demote such abnormal activities, and the first step is to detect those
accounts. Ho... | cs.SI | in social networks a single user may create multiple accounts to spread his her opinions and to influence others by actively comment on different news pages it would be beneficial to both social networks and their communities to demote such abnormal activities and the first step is to detect those accounts however the ... | [['in', 'social', 'networks', 'a', 'single', 'user', 'may', 'create', 'multiple', 'accounts', 'to', 'spread', 'his', 'her', 'opinions', 'and', 'to', 'influence', 'others', 'by', 'actively', 'comment', 'on', 'different', 'news', 'pages', 'it', 'would', 'be', 'beneficial', 'to', 'both', 'social', 'networks', 'and', 'thei... | [-0.06459301667241261, 0.01678489386706807, -0.07969325214510944, 0.10225863320880621, -0.12186380452092331, -0.1728489062317315, 0.1059042572065701, 0.42278264847768443, -0.2177737815480509, -0.38394990531245465, 0.07545123709339724, -0.3361436995644557, -0.157848192155503, 0.15961890776646395, -0.09868825484435949, 0... |
1,801.09839 | Yet another UFO in the X-ray spectrum of a high-z lensed QSO | Ultra-fast outflows (UFO) appear to be common in local active galactic nuclei
(AGN) and may be powerful enough ($\dot{E}_{kin}$$\geq$1\% of L$_{bol}$) to
effectively quench the star formation in their host galaxies. To test feedback
models based on AGN outflows, it is mandatory to investigate UFOs near the peak
of AG... | astro-ph.HE | ultrafast outflows ufo appear to be common in local active galactic nuclei agn and may be powerful enough dote_kingeq1 of l_bol to effectively quench the star formation in their host galaxies to test feedback models based on agn outflows it is mandatory to investigate ufos near the peak of agn activity that is at highz... | [['ultrafast', 'outflows', 'ufo', 'appear', 'to', 'be', 'common', 'in', 'local', 'active', 'galactic', 'nuclei', 'agn', 'and', 'may', 'be', 'powerful', 'enough', 'dote_kingeq1', 'of', 'l_bol', 'to', 'effectively', 'quench', 'the', 'star', 'formation', 'in', 'their', 'host', 'galaxies', 'to', 'test', 'feedback', 'models... | [-0.04519995688096378, 0.06806016590760224, -0.008740067335055777, 0.11193457895197065, -0.1013429837956328, -0.138373349384382, 0.0221446502529751, 0.47876356505008977, -0.14850737369757494, -0.3373251384449744, 0.03747193419755005, -0.33291537706667795, 0.004912619344602392, 0.21629571534714062, -0.006020476574994381... |
1,801.0984 | A time-optimal algorithm for solving (block-)tridiagonal linear systems
of dimension N on a distributed computer of N nodes | We are concerned with the fastest possible direct numerical solution
algorithm for a thin-banded or tridiagonal linear system of dimension $N$ on a
distributed computing network of $N$ nodes that is connected in a binary
communication tree. Our research is driven by the need for faster ways of
numerically solving dis... | math.NA | we are concerned with the fastest possible direct numerical solution algorithm for a thinbanded or tridiagonal linear system of dimension n on a distributed computing network of n nodes that is connected in a binary communication tree our research is driven by the need for faster ways of numerically solving discretized... | [['we', 'are', 'concerned', 'with', 'the', 'fastest', 'possible', 'direct', 'numerical', 'solution', 'algorithm', 'for', 'a', 'thinbanded', 'or', 'tridiagonal', 'linear', 'system', 'of', 'dimension', 'n', 'on', 'a', 'distributed', 'computing', 'network', 'of', 'n', 'nodes', 'that', 'is', 'connected', 'in', 'a', 'binary... | [-0.20988153692248257, 0.04737489402771101, -0.005355193633441778, -0.016572822446667756, -0.060725589815252855, -0.2052669100744953, 0.040987110582122566, 0.35693395809205464, -0.28651521663910656, -0.2923528530504988, 0.09466629642307355, -0.25648324841330217, -0.1791952251160676, 0.22249191884283526, -0.037218184867... |
1,801.09841 | Olivine-Carbonate Mineralogy of Jezero Crater | A well-preserved, ancient delta deposit, in combination with ample exposures
of Mg-carbonate rich materials, make Jezero Crater in Nili Fossae a compelling
astrobiological site and a top candidate for future landed missions to Mars. We
use CRISM observations to characterize the surface mineralogy of the crater and
su... | astro-ph.EP | a wellpreserved ancient delta deposit in combination with ample exposures of mgcarbonate rich materials make jezero crater in nili fossae a compelling astrobiological site and a top candidate for future landed missions to mars we use crism observations to characterize the surface mineralogy of the crater and surroundin... | [['a', 'wellpreserved', 'ancient', 'delta', 'deposit', 'in', 'combination', 'with', 'ample', 'exposures', 'of', 'mgcarbonate', 'rich', 'materials', 'make', 'jezero', 'crater', 'in', 'nili', 'fossae', 'a', 'compelling', 'astrobiological', 'site', 'and', 'a', 'top', 'candidate', 'for', 'future', 'landed', 'missions', 'to... | [-0.05429699253777284, 0.1473528700168061, -0.1090511612734464, 0.06735692498886524, -0.06557584785511844, -0.049090752110191406, 0.04067197307479434, 0.3977933025995448, -0.21901840079346135, -0.34170327330811895, 0.12413433735093025, -0.3024018661929167, -0.14043699895121056, 0.162882757794163, -0.09432904870402425, ... |
1,801.09842 | Fu-Yau Hessian Equations | We solve the Fu-Yau equation for arbitrary dimension and arbitrary slope
$\alpha'$. Actually we obtain at the same time a solution of the open case
$\alpha'>0$, an improved solution of the known case $\alpha'<0$, and solutions
for a family of Hessian equations which includes the Fu-Yau equation as a
special case. The... | math.DG math.AP math.CV | we solve the fuyau equation for arbitrary dimension and arbitrary slope alpha actually we obtain at the same time a solution of the open case alpha0 an improved solution of the known case alpha0 and solutions for a family of hessian equations which includes the fuyau equation as a special case the method is based on th... | [['we', 'solve', 'the', 'fuyau', 'equation', 'for', 'arbitrary', 'dimension', 'and', 'arbitrary', 'slope', 'alpha', 'actually', 'we', 'obtain', 'at', 'the', 'same', 'time', 'a', 'solution', 'of', 'the', 'open', 'case', 'alpha0', 'an', 'improved', 'solution', 'of', 'the', 'known', 'case', 'alpha0', 'and', 'solutions', '... | [-0.12440116554110621, 0.06543882668639915, -0.08730113052297384, 0.0868097393332781, -0.09535980204098105, -0.18140687556504936, 0.006129416803430233, 0.2879726636622633, -0.24324693029103356, -0.2794926406017372, 0.15173777537642136, -0.2487013164624971, -0.11037551479724546, 0.21603598081994624, -0.02399776833841488... |
1,801.09843 | Well-posedness of a non-local abstract Cauchy problem with a singular
integral | A non-local abstract Cauchy problem with a singular integral is studied,
which is a closed system of two evolution equations for a real-valued function
and a function-valued function. By proposing an appropriate Banach space, the
well-posedness of the evolution system is proved under some boundedness and
smoothness c... | math-ph math.MP | a nonlocal abstract cauchy problem with a singular integral is studied which is a closed system of two evolution equations for a realvalued function and a functionvalued function by proposing an appropriate banach space the wellposedness of the evolution system is proved under some boundedness and smoothness conditions... | [['a', 'nonlocal', 'abstract', 'cauchy', 'problem', 'with', 'a', 'singular', 'integral', 'is', 'studied', 'which', 'is', 'a', 'closed', 'system', 'of', 'two', 'evolution', 'equations', 'for', 'a', 'realvalued', 'function', 'and', 'a', 'functionvalued', 'function', 'by', 'proposing', 'an', 'appropriate', 'banach', 'spac... | [-0.15185156775930642, 0.05487318371003722, -0.13127091190978593, 0.09282195370064537, -0.10934408940603117, -0.09476985032304976, -0.03811084316796897, 0.2737916349342056, -0.3264594199318512, -0.17995600824189537, 0.1517095999089161, -0.24864724934484592, -0.15643103652195456, 0.171353377360741, -0.048419910243383664... |
1,801.09844 | Bi-scalar integrable CFT at any dimension | We propose a $D$-dimensional generalization of $4D$ bi-scalar conformal
quantum field theory recently introduced by G\"{u}rdogan and one of the authors
as a strong-twist double scaling limit of $\gamma$-deformed $\mathcal{N}=4$ SYM
theory. Similarly to the $4D$ case, this D-dimensional CFT is also dominated by
"fishn... | hep-th math-ph math.MP | we propose a ddimensional generalization of 4d biscalar conformal quantum field theory recently introduced by gurdogan and one of the authors as a strongtwist double scaling limit of gammadeformed mathcaln4 sym theory similarly to the 4d case this ddimensional cft is also dominated by fishnet feynman graphs and is inte... | [['we', 'propose', 'a', 'ddimensional', 'generalization', 'of', '4d', 'biscalar', 'conformal', 'quantum', 'field', 'theory', 'recently', 'introduced', 'by', 'gurdogan', 'and', 'one', 'of', 'the', 'authors', 'as', 'a', 'strongtwist', 'double', 'scaling', 'limit', 'of', 'gammadeformed', 'mathcaln4', 'sym', 'theory', 'sim... | [-0.12231997884904362, 0.17729581035893863, -0.05027266040859694, 0.0745450066633812, -0.05485744874553151, -0.15348447265097168, -0.02789792975700284, 0.30864295700086736, -0.19556392702695638, -0.22201834971437584, 0.07490674643840238, -0.3194953521612931, -0.18311112634271282, 0.11523570000143671, 0.0029587823035497... |
1,801.09845 | Bayesian Model Testing of Ellipsoidal Variations on Stars due to Hot
Jupiters | A massive planet closely orbiting its host star creates tidal forces that
distort the typically spherical stellar surface. These distortions, known as
ellipsoidal variations, result in changes in the photometric flux emitted by
the star, which can be detected within the data from the Kepler Space
Telescope. Currently... | astro-ph.EP | a massive planet closely orbiting its host star creates tidal forces that distort the typically spherical stellar surface these distortions known as ellipsoidal variations result in changes in the photometric flux emitted by the star which can be detected within the data from the kepler space telescope currently there ... | [['a', 'massive', 'planet', 'closely', 'orbiting', 'its', 'host', 'star', 'creates', 'tidal', 'forces', 'that', 'distort', 'the', 'typically', 'spherical', 'stellar', 'surface', 'these', 'distortions', 'known', 'as', 'ellipsoidal', 'variations', 'result', 'in', 'changes', 'in', 'the', 'photometric', 'flux', 'emitted', ... | [-0.0784306900200641, 0.09345747763549703, -0.09869429882051514, 0.13002527639226982, -0.12846915711254245, -0.10590720266465925, 0.01384307272447687, 0.37484167920839456, -0.20375118386129745, -0.3974384985372631, 0.10756147925599685, -0.24552244588267058, -0.14129976708855893, 0.2545462096627388, -0.10393997453987443... |
1,801.09846 | Antenna Selection for Large-Scale MIMO Systems with Low-Resolution ADCs | One way to reduce the power consumption in large-scale multiple-input
multiple-output (MIMO) systems is to employ low-resolution analog-to-digital
converters (ADCs). In this paper, we investigate antenna selection for
large-scale MIMO receivers with low-resolution ADCs, thereby providing more
flexibility in resolutio... | cs.IT math.IT | one way to reduce the power consumption in largescale multipleinput multipleoutput mimo systems is to employ lowresolution analogtodigital converters adcs in this paper we investigate antenna selection for largescale mimo receivers with lowresolution adcs thereby providing more flexibility in resolution and number of a... | [['one', 'way', 'to', 'reduce', 'the', 'power', 'consumption', 'in', 'largescale', 'multipleinput', 'multipleoutput', 'mimo', 'systems', 'is', 'to', 'employ', 'lowresolution', 'analogtodigital', 'converters', 'adcs', 'in', 'this', 'paper', 'we', 'investigate', 'antenna', 'selection', 'for', 'largescale', 'mimo', 'recei... | [-0.21074831552642326, -0.04391257433218505, -0.017050363352665535, -0.0018579850224061654, -0.1312109658243851, -0.21945753515912936, 0.09282662025384175, 0.4264599340251432, -0.21794933494753563, -0.32479766791399856, 0.022784845797846523, -0.224593254568306, -0.2172344672296626, 0.1690804465315663, -0.16131394302042... |
1,801.09847 | Open3D: A Modern Library for 3D Data Processing | Open3D is an open-source library that supports rapid development of software
that deals with 3D data. The Open3D frontend exposes a set of carefully
selected data structures and algorithms in both C++ and Python. The backend is
highly optimized and is set up for parallelization. Open3D was developed from a
clean slat... | cs.CV cs.GR cs.RO | open3d is an opensource library that supports rapid development of software that deals with 3d data the open3d frontend exposes a set of carefully selected data structures and algorithms in both c and python the backend is highly optimized and is set up for parallelization open3d was developed from a clean slate with a... | [['open3d', 'is', 'an', 'opensource', 'library', 'that', 'supports', 'rapid', 'development', 'of', 'software', 'that', 'deals', 'with', '3d', 'data', 'the', 'open3d', 'frontend', 'exposes', 'a', 'set', 'of', 'carefully', 'selected', 'data', 'structures', 'and', 'algorithms', 'in', 'both', 'c', 'and', 'python', 'the', '... | [-0.0909811551682651, 0.03157715497895286, -0.05674576862188785, 0.024487284596240066, -0.0919057557966722, -0.16502141577151158, 0.03188907158884989, 0.4153361963715566, -0.2541073210717118, -0.3559334279564412, 0.12281061510211262, -0.2905642630653861, -0.07163976916800374, 0.2535813395500831, -0.027395332078246966, ... |
1,801.09848 | Over-representation of Extreme Events in Decision-Making: A Rational
Metacognitive Account | The Availability bias, manifested in the over-representation of extreme
eventualities in decision-making, is a well-known cognitive bias, and is
generally taken as evidence of human irrationality. In this work, we present
the first rational, metacognitive account of the Availability bias, formally
articulated at Marr... | q-bio.NC cs.AI stat.ML | the availability bias manifested in the overrepresentation of extreme eventualities in decisionmaking is a wellknown cognitive bias and is generally taken as evidence of human irrationality in this work we present the first rational metacognitive account of the availability bias formally articulated at marrs algorithmi... | [['the', 'availability', 'bias', 'manifested', 'in', 'the', 'overrepresentation', 'of', 'extreme', 'eventualities', 'in', 'decisionmaking', 'is', 'a', 'wellknown', 'cognitive', 'bias', 'and', 'is', 'generally', 'taken', 'as', 'evidence', 'of', 'human', 'irrationality', 'in', 'this', 'work', 'we', 'present', 'the', 'fir... | [-0.08156126122000618, 0.031558692949817, -0.10703537373030865, 0.09765910634943574, -0.09538695643205646, -0.12962523429234932, 0.10474765086597712, 0.3924926016070358, -0.20483642448108275, -0.32262886121547985, 0.07133248052751687, -0.243040110613987, -0.22908918575158568, 0.1876751236594538, -0.14787150954234077, 0... |
1,801.09849 | A characterization of nonnegativity relative to proper cones | Let $A$ be an $m \times n$ matrix with real entries. Given two proper cones
$K_1$ and $K_2$ in $\mathbb{R}^n$ and $\mathbb{R}^m$, respectively, we say that
$A$ is nonnegative if $A(K_1) \subseteq K_2$. $A$ is said to be semipositive if
there exists a $x \in K_1^\circ$ such that $Ax \in K_2^\circ$. We prove that
$A$ i... | math.FA | let a be an m times n matrix with real entries given two proper cones k_1 and k_2 in mathbbrn and mathbbrm respectively we say that a is nonnegative if ak_1 subseteq k_2 a is said to be semipositive if there exists a x in k_1circ such that ax in k_2circ we prove that a is nonnegative if and only if ab is semipositive f... | [['let', 'a', 'be', 'an', 'm', 'times', 'n', 'matrix', 'with', 'real', 'entries', 'given', 'two', 'proper', 'cones', 'k_1', 'and', 'k_2', 'in', 'mathbbrn', 'and', 'mathbbrm', 'respectively', 'we', 'say', 'that', 'a', 'is', 'nonnegative', 'if', 'ak_1', 'subseteq', 'k_2', 'a', 'is', 'said', 'to', 'be', 'semipositive', 'i... | [-0.19885321545104187, 0.13670701026470244, -0.02994922672708829, -0.033561487464855114, -0.061467315396294, -0.22148543307557703, -0.01148776186009248, 0.4384312019435068, -0.32920849377910294, -0.10747676299380449, 0.11751333785708994, -0.354627013305823, -0.17467724139802157, 0.14909446332293252, -0.0775877041680117... |
1,801.0985 | Sparsity in Max-Plus Algebra and Systems | We study sparsity in the max-plus algebraic setting. We seek both exact and
approximate solutions of the max-plus linear equation with minimum cardinality
of support. In the former case, the sparsest solution problem is shown to be
equivalent to the minimum set cover problem and, thus, NP-complete. In the
latter one,... | math.OC | we study sparsity in the maxplus algebraic setting we seek both exact and approximate solutions of the maxplus linear equation with minimum cardinality of support in the former case the sparsest solution problem is shown to be equivalent to the minimum set cover problem and thus npcomplete in the latter one the approxi... | [['we', 'study', 'sparsity', 'in', 'the', 'maxplus', 'algebraic', 'setting', 'we', 'seek', 'both', 'exact', 'and', 'approximate', 'solutions', 'of', 'the', 'maxplus', 'linear', 'equation', 'with', 'minimum', 'cardinality', 'of', 'support', 'in', 'the', 'former', 'case', 'the', 'sparsest', 'solution', 'problem', 'is', '... | [-0.11421366544489406, -0.021193091479832667, -0.08445681761885579, 0.10183866342464298, -0.10557714495426643, -0.1476654454668145, 0.05820620864526265, 0.38233523006000886, -0.3567936045624185, -0.27996040517409815, 0.16953897467005605, -0.22335563500123154, -0.21468293526324264, 0.16597077291328133, -0.08471954703380... |
1,801.09851 | Cross-type Biomedical Named Entity Recognition with Deep Multi-Task
Learning | Motivation: State-of-the-art biomedical named entity recognition (BioNER)
systems often require handcrafted features specific to each entity type, such
as genes, chemicals and diseases. Although recent studies explored using neural
network models for BioNER to free experts from manual feature engineering, the
perform... | cs.IR cs.CL stat.ML | motivation stateoftheart biomedical named entity recognition bioner systems often require handcrafted features specific to each entity type such as genes chemicals and diseases although recent studies explored using neural network models for bioner to free experts from manual feature engineering the performance remains... | [['motivation', 'stateoftheart', 'biomedical', 'named', 'entity', 'recognition', 'bioner', 'systems', 'often', 'require', 'handcrafted', 'features', 'specific', 'to', 'each', 'entity', 'type', 'such', 'as', 'genes', 'chemicals', 'and', 'diseases', 'although', 'recent', 'studies', 'explored', 'using', 'neural', 'network... | [-0.013492554180728372, -0.03731899300965574, 0.016256193516689332, 0.06313117926528808, -0.1460336681289324, -0.2237662777427382, 0.060254994470286795, 0.45534363949252654, -0.24627886784746666, -0.36213958196977314, 0.032715767144600956, -0.31957065252327294, -0.15559855047902166, 0.229218302682663, -0.14390509064821... |
1,801.09852 | Big polynomial rings and Stillman's conjecture | The purpose of this paper is to prove that certain limits of polynomial rings
are themselves polynomial rings, and show how this observation can be used to
deduce some interesting results in commutative algebra. In particular, we give
two new proofs of Stillman's conjecture. The first is similar to that of
Ananyan-Ho... | math.AC | the purpose of this paper is to prove that certain limits of polynomial rings are themselves polynomial rings and show how this observation can be used to deduce some interesting results in commutative algebra in particular we give two new proofs of stillmans conjecture the first is similar to that of ananyanhochster t... | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'prove', 'that', 'certain', 'limits', 'of', 'polynomial', 'rings', 'are', 'themselves', 'polynomial', 'rings', 'and', 'show', 'how', 'this', 'observation', 'can', 'be', 'used', 'to', 'deduce', 'some', 'interesting', 'results', 'in', 'commutative', 'algebra', 'in', ... | [-0.168103608951898, 0.058487373309893696, -0.13443456380333327, 0.06732763445647315, -0.11734172961780731, -0.13357660138413688, -0.04068579787205716, 0.3028765013087777, -0.30072927849862396, -0.23952657615035017, 0.1373801869472866, -0.19369499488804442, -0.178639525948446, 0.2546116049413251, -0.1581616416762147, -... |
1,801.09853 | Spin portal to dark matter | In this work we study the possibility that dark matter fields transform in
the $(1,0)\oplus(0,1)$ representation of the Homogeneous Lorentz Group. In an
effective theory approach, we study the lowest dimension interacting terms of
dark matter with standard model fields, assuming that dark matter fields
transform as s... | hep-ph hep-th | in this work we study the possibility that dark matter fields transform in the 10oplus01 representation of the homogeneous lorentz group in an effective theory approach we study the lowest dimension interacting terms of dark matter with standard model fields assuming that dark matter fields transform as singlets under ... | [['in', 'this', 'work', 'we', 'study', 'the', 'possibility', 'that', 'dark', 'matter', 'fields', 'transform', 'in', 'the', '10oplus01', 'representation', 'of', 'the', 'homogeneous', 'lorentz', 'group', 'in', 'an', 'effective', 'theory', 'approach', 'we', 'study', 'the', 'lowest', 'dimension', 'interacting', 'terms', 'o... | [-0.10619339726507923, 0.21838767439794327, -0.1074068684520763, 0.15338830392493671, -0.09734990617671851, -0.11266827069352879, -0.0026615601482389627, 0.32960909559109874, -0.19811282262292712, -0.355827488836854, -0.004482277654392948, -0.27718310500820015, -0.013952484863355409, 0.13395806716235226, 0.097743088765... |
1,801.09854 | Algorithms for the Greater Good! On Mental Modeling and Acceptable
Symbiosis in Human-AI Collaboration | Effective collaboration between humans and AI-based systems requires
effective modeling of the human in the loop, both in terms of the mental state
as well as the physical capabilities of the latter. However, these models can
also open up pathways for manipulating and exploiting the human in the hopes of
achieving so... | cs.AI | effective collaboration between humans and aibased systems requires effective modeling of the human in the loop both in terms of the mental state as well as the physical capabilities of the latter however these models can also open up pathways for manipulating and exploiting the human in the hopes of achieving some gre... | [['effective', 'collaboration', 'between', 'humans', 'and', 'aibased', 'systems', 'requires', 'effective', 'modeling', 'of', 'the', 'human', 'in', 'the', 'loop', 'both', 'in', 'terms', 'of', 'the', 'mental', 'state', 'as', 'well', 'as', 'the', 'physical', 'capabilities', 'of', 'the', 'latter', 'however', 'these', 'mode... | [-0.09001167131280145, 0.11235030292479214, -0.052108120495910966, 0.08811315059272452, -0.09847201538314411, -0.17538252151543982, 0.0456507935070253, 0.40021133777952334, -0.25893307479414324, -0.3770561133506599, 0.12093644922092688, -0.26435685141709203, -0.20616086010211174, 0.2017081353489353, -0.1347573785332905... |
1,801.09855 | Stop Coannihilation in the CMSSM and SubGUT Models | Stop coannihilation may bring the relic density of heavy supersymmetric dark
matter particles into the range allowed by cosmology. The efficiency of this
process is enhanced by stop-antistop annihilations into the longitudinal
(Goldstone) modes of the $W$ and $Z$ bosons, as well as by Sommerfeld
enhancement of stop a... | hep-ph | stop coannihilation may bring the relic density of heavy supersymmetric dark matter particles into the range allowed by cosmology the efficiency of this process is enhanced by stopantistop annihilations into the longitudinal goldstone modes of the w and z bosons as well as by sommerfeld enhancement of stop annihilation... | [['stop', 'coannihilation', 'may', 'bring', 'the', 'relic', 'density', 'of', 'heavy', 'supersymmetric', 'dark', 'matter', 'particles', 'into', 'the', 'range', 'allowed', 'by', 'cosmology', 'the', 'efficiency', 'of', 'this', 'process', 'is', 'enhanced', 'by', 'stopantistop', 'annihilations', 'into', 'the', 'longitudinal... | [-0.10538322420424631, 0.2976238863546656, -0.010015987199591871, 0.16188967553977204, -0.11565074427491133, -0.15795510483141512, 0.0542133633310023, 0.29426685853490137, -0.22651272447745946, -0.33687195119758445, 0.09600168608057384, -0.26656783538528234, 0.021180846266703218, 0.1649605093198494, 0.01373390683060527... |
1,801.09856 | ReNN: Rule-embedded Neural Networks | The artificial neural network shows powerful ability of inference, but it is
still criticized for lack of interpretability and prerequisite needs of big
dataset. This paper proposes the Rule-embedded Neural Network (ReNN) to
overcome the shortages. ReNN first makes local-based inferences to detect local
patterns, and... | cs.LG cs.NE stat.ML | the artificial neural network shows powerful ability of inference but it is still criticized for lack of interpretability and prerequisite needs of big dataset this paper proposes the ruleembedded neural network renn to overcome the shortages renn first makes localbased inferences to detect local patterns and then uses... | [['the', 'artificial', 'neural', 'network', 'shows', 'powerful', 'ability', 'of', 'inference', 'but', 'it', 'is', 'still', 'criticized', 'for', 'lack', 'of', 'interpretability', 'and', 'prerequisite', 'needs', 'of', 'big', 'dataset', 'this', 'paper', 'proposes', 'the', 'ruleembedded', 'neural', 'network', 'renn', 'to',... | [-0.036386581338608885, 0.005186172480082644, -0.08444784848548173, 0.0917133132442163, -0.1770458651413287, -0.1683873304767915, 0.08504978206538652, 0.42421746220522, -0.3205654357343871, -0.3621606341825582, 0.10263106372343757, -0.2300852077797014, -0.22446826999770345, 0.1522168031448591, -0.1390351433878075, 0.09... |
1,801.09857 | On a $C$-integrable equation for second sound propagation in heated
dielectrics | An exactly solvable model in heat conduction is considered. The
$C$-integrable (i.e., change-of-variables-integrable) equation for second sound
(i.e., heat wave) propagation in a thin, rigid dielectric heat conductor
uniformly heated on its lateral side by a surrounding medium under the
Stefan--Boltzmann law is deriv... | physics.class-ph | an exactly solvable model in heat conduction is considered the cintegrable ie changeofvariablesintegrable equation for second sound ie heat wave propagation in a thin rigid dielectric heat conductor uniformly heated on its lateral side by a surrounding medium under the stefanboltzmann law is derived a simple changeofva... | [['an', 'exactly', 'solvable', 'model', 'in', 'heat', 'conduction', 'is', 'considered', 'the', 'cintegrable', 'ie', 'changeofvariablesintegrable', 'equation', 'for', 'second', 'sound', 'ie', 'heat', 'wave', 'propagation', 'in', 'a', 'thin', 'rigid', 'dielectric', 'heat', 'conductor', 'uniformly', 'heated', 'on', 'its',... | [-0.12239990522417041, 0.05846086853077887, -0.015285377031894492, 0.04950017756572543, -0.14868741523718737, -0.16925817205891258, 0.002992400846092916, 0.3334314206798301, -0.3360414684704337, -0.19355579743115994, 0.1295043077743536, -0.3229362651797347, -0.10191002206831071, 0.22377377685701444, -0.0253769531368934... |
1,801.09858 | Decoding and mapping task states of the human brain via deep learning | Support vector machine (SVM) based multivariate pattern analysis (MVPA) has
delivered promising performance in decoding specific task states based on
functional magnetic resonance imaging (fMRI) of the human brain.
Conventionally, the SVM-MVPA requires careful feature selection/extraction
according to expert knowledg... | q-bio.NC | support vector machine svm based multivariate pattern analysis mvpa has delivered promising performance in decoding specific task states based on functional magnetic resonance imaging fmri of the human brain conventionally the svmmvpa requires careful feature selectionextraction according to expert knowledge in this st... | [['support', 'vector', 'machine', 'svm', 'based', 'multivariate', 'pattern', 'analysis', 'mvpa', 'has', 'delivered', 'promising', 'performance', 'in', 'decoding', 'specific', 'task', 'states', 'based', 'on', 'functional', 'magnetic', 'resonance', 'imaging', 'fmri', 'of', 'the', 'human', 'brain', 'conventionally', 'the'... | [-0.039420053701406874, -0.03025189775212641, -0.05371591529318532, 0.06122760783407414, -0.11903825052901383, -0.18315240968432692, 0.06248656371248445, 0.4184177299215715, -0.20687357062059972, -0.36924014042541026, 0.06242587781569736, -0.2565137457433224, -0.22252600035373715, 0.22629589912815387, -0.10628116385480... |
1,801.09859 | Structured Memory based Deep Model to Detect as well as Characterize
Novel Inputs | While deep learning has pushed the boundaries in various machine learning
tasks, the current models are still far away from replicating many functions
that a normal human brain can do. Explicit memorization based deep architecture
have been recently proposed with the objective to understand and predict
better. In thi... | cs.CV | while deep learning has pushed the boundaries in various machine learning tasks the current models are still far away from replicating many functions that a normal human brain can do explicit memorization based deep architecture have been recently proposed with the objective to understand and predict better in this wor... | [['while', 'deep', 'learning', 'has', 'pushed', 'the', 'boundaries', 'in', 'various', 'machine', 'learning', 'tasks', 'the', 'current', 'models', 'are', 'still', 'far', 'away', 'from', 'replicating', 'many', 'functions', 'that', 'a', 'normal', 'human', 'brain', 'can', 'do', 'explicit', 'memorization', 'based', 'deep', ... | [-0.03578244783663346, 0.027406995927978843, -0.07946479921358535, 0.07288412162072039, -0.11436006539346029, -0.17249022062040037, 0.018685251473976275, 0.43218987512712675, -0.2786827546305075, -0.35589157623730394, 0.08838082907216933, -0.24070573591355546, -0.20770585679242182, 0.17897779322892246, -0.1270633328563... |
1,801.0986 | Quasiperiodic granular chains and Hofstadter butterflies | We study quasiperiodicity-induced localization of waves in strongly
precompressed granular chains. We propose three different setups, inspired by
the Aubry--Andr\'e (AA) model, of quasiperiodic chains; and we use these models
to compare the effects of on-site and off-site quasiperiodicity in nonlinear
lattices. When ... | nlin.PS cond-mat.mtrl-sci math-ph math.DS math.MP nlin.CD | we study quasiperiodicityinduced localization of waves in strongly precompressed granular chains we propose three different setups inspired by the aubryandre aa model of quasiperiodic chains and we use these models to compare the effects of onsite and offsite quasiperiodicity in nonlinear lattices when there is purely ... | [['we', 'study', 'quasiperiodicityinduced', 'localization', 'of', 'waves', 'in', 'strongly', 'precompressed', 'granular', 'chains', 'we', 'propose', 'three', 'different', 'setups', 'inspired', 'by', 'the', 'aubryandre', 'aa', 'model', 'of', 'quasiperiodic', 'chains', 'and', 'we', 'use', 'these', 'models', 'to', 'compar... | [-0.16188367863063408, 0.1943259120994069, -0.050943279097966775, 0.07488788520526894, 0.012966403735900354, -0.1890517730063599, 0.01608417940095556, 0.4283320917230513, -0.2718370358760685, -0.2228333100563649, 0.05957809121364427, -0.2903359735742061, -0.19360814479678268, 0.18429973281007447, 0.03473462130623926, 0... |
1,801.09861 | Self-consistent Analytic Solutions in Twisted $\mathbb{C}P^{N-1}$ Model
in the Large-$N$ Limit | We construct self-consistent analytic solutions in the ${\mathbb C}P^{N-1}$
model in the large-$N$ limit, in which more than one Higgs scalar component
take values inside a single or multiple soliton on an infinite space or on a
ring, or around boundaries of a finite interval.
| hep-th cond-mat.supr-con | we construct selfconsistent analytic solutions in the mathbb cpn1 model in the largen limit in which more than one higgs scalar component take values inside a single or multiple soliton on an infinite space or on a ring or around boundaries of a finite interval | [['we', 'construct', 'selfconsistent', 'analytic', 'solutions', 'in', 'the', 'mathbb', 'cpn1', 'model', 'in', 'the', 'largen', 'limit', 'in', 'which', 'more', 'than', 'one', 'higgs', 'scalar', 'component', 'take', 'values', 'inside', 'a', 'single', 'or', 'multiple', 'soliton', 'on', 'an', 'infinite', 'space', 'or', 'on... | [-0.15930636217558963, 0.117705203000676, -0.0898720433935523, 0.07473173725108305, -0.06519985468023354, -0.1336874633303119, 0.024299677916698986, 0.3494005255815056, -0.1779770964032246, -0.15772006627586152, 0.11764392075904956, -0.2909773975558993, -0.044273704409392343, 0.1623744882436262, 0.020520973960972494, -... |
1,801.09862 | Electrostatic steepening of whistler waves | We present surprising observations by the NASA Van Allen Probes spacecraft of
whistler waves with substantial electric field power at harmonics of the
whistler wave fundamental frequency. The wave power at harmonics is due to
nonlinearly steepened whistler electrostatic field that becomes possible in the
two-temperat... | physics.space-ph | we present surprising observations by the nasa van allen probes spacecraft of whistler waves with substantial electric field power at harmonics of the whistler wave fundamental frequency the wave power at harmonics is due to nonlinearly steepened whistler electrostatic field that becomes possible in the twotemperature ... | [['we', 'present', 'surprising', 'observations', 'by', 'the', 'nasa', 'van', 'allen', 'probes', 'spacecraft', 'of', 'whistler', 'waves', 'with', 'substantial', 'electric', 'field', 'power', 'at', 'harmonics', 'of', 'the', 'whistler', 'wave', 'fundamental', 'frequency', 'the', 'wave', 'power', 'at', 'harmonics', 'is', '... | [-0.19897600546430208, 0.26843437904884154, -0.026229629072507744, 0.09941824022312894, -0.10708200773714405, -0.07960731458212984, -0.022754929962224866, 0.32347545062044736, -0.24145818628174695, -0.2968773080722282, -0.043939525439207885, -0.2822287358735737, -0.05477205931552147, 0.2746486505003352, 0.0965875219014... |
1,801.09863 | Burnside groups and $n$-moves for links | Let $n$ be a positive integer. M. K. Dabkowski and J. H. Przytycki introduced
the $n$th Burnside group of links which is preserved by $n$-moves, and proved
that for any odd prime $p$ there exist links which are not equivalent to
trivial links up to $p$-moves by using their $p$th Burnside groups. This gives
counterexa... | math.GT | let n be a positive integer m k dabkowski and j h przytycki introduced the nth burnside group of links which is preserved by nmoves and proved that for any odd prime p there exist links which are not equivalent to trivial links up to pmoves by using their pth burnside groups this gives counterexamples for the montesino... | [['let', 'n', 'be', 'a', 'positive', 'integer', 'm', 'k', 'dabkowski', 'and', 'j', 'h', 'przytycki', 'introduced', 'the', 'nth', 'burnside', 'group', 'of', 'links', 'which', 'is', 'preserved', 'by', 'nmoves', 'and', 'proved', 'that', 'for', 'any', 'odd', 'prime', 'p', 'there', 'exist', 'links', 'which', 'are', 'not', '... | [-0.2521991157580329, 0.09758078633066085, -0.09173270541857388, 0.09610988085024882, -0.12286555212989882, -0.24984870160308978, 0.05045143599567962, 0.32691818375842296, -0.32431026993562345, -0.2542486519390798, 0.05507280535074761, -0.22810674566552852, -0.13587098792903934, 0.19693653156771662, -0.1043346083142619... |
1,801.09864 | NGS Based Haplotype Assembly Using Matrix Completion | We apply matrix completion methods for haplotype assembly from NGS reads to
develop the new HapSVT, HapNuc, and HapOPT algorithms. This is performed by
applying a mathematical model to convert the reads to an incomplete matrix and
estimating unknown components. This process is followed by quantizing and
decoding the ... | q-bio.GN | we apply matrix completion methods for haplotype assembly from ngs reads to develop the new hapsvt hapnuc and hapopt algorithms this is performed by applying a mathematical model to convert the reads to an incomplete matrix and estimating unknown components this process is followed by quantizing and decoding the comple... | [['we', 'apply', 'matrix', 'completion', 'methods', 'for', 'haplotype', 'assembly', 'from', 'ngs', 'reads', 'to', 'develop', 'the', 'new', 'hapsvt', 'hapnuc', 'and', 'hapopt', 'algorithms', 'this', 'is', 'performed', 'by', 'applying', 'a', 'mathematical', 'model', 'to', 'convert', 'the', 'reads', 'to', 'an', 'incomplet... | [-0.035313144212805445, 0.01683602867969653, -0.0365750178381608, 0.09462954621450739, -0.0465100822219593, -0.14252044044129936, 0.047425852831581544, 0.39968496410914794, -0.28361441288143396, -0.3234354956436838, 0.1659131003112195, -0.2536551567348491, -0.14464318789070038, 0.2192023052043153, -0.07718182942862141,... |
1,801.09865 | Magnetoelectric and Raman spectroscopic studies of single-crystalline
MnCr2O4 | MnCr2O4 that exhibits spin frustration and complex spiral spin order is of
great interest from both fundamental as well as application-oriented
perspectives. Unlike CoCr2O4 whose ground state presents the coexistence of
commensurate spiral spin order (CSSO) and ferroelectric order, MnCr2O4 shows no
multiferroicity. O... | cond-mat.mtrl-sci | mncr2o4 that exhibits spin frustration and complex spiral spin order is of great interest from both fundamental as well as applicationoriented perspectives unlike cocr2o4 whose ground state presents the coexistence of commensurate spiral spin order csso and ferroelectric order mncr2o4 shows no multiferroicity one reaso... | [['mncr2o4', 'that', 'exhibits', 'spin', 'frustration', 'and', 'complex', 'spiral', 'spin', 'order', 'is', 'of', 'great', 'interest', 'from', 'both', 'fundamental', 'as', 'well', 'as', 'applicationoriented', 'perspectives', 'unlike', 'cocr2o4', 'whose', 'ground', 'state', 'presents', 'the', 'coexistence', 'of', 'commen... | [-0.15271019118160686, 0.21161854622575144, -0.024128293553649476, -0.020329542307775807, -0.06968681489427885, -0.09802694059061733, 0.08178391136920475, 0.3924166496504437, -0.25185386375947433, -0.3364453304446105, 0.043312845758698655, -0.3217331376716946, -0.11143436453333407, 0.16894308549394324, 0.09906428283870... |
1,801.09866 | Accelerating recurrent neural network language model based online speech
recognition system | This paper presents methods to accelerate recurrent neural network based
language models (RNNLMs) for online speech recognition systems. Firstly, a
lossy compression of the past hidden layer outputs (history vector) with
caching is introduced in order to reduce the number of LM queries. Next, RNNLM
computations are d... | cs.CL cs.LG | this paper presents methods to accelerate recurrent neural network based language models rnnlms for online speech recognition systems firstly a lossy compression of the past hidden layer outputs history vector with caching is introduced in order to reduce the number of lm queries next rnnlm computations are deployed in... | [['this', 'paper', 'presents', 'methods', 'to', 'accelerate', 'recurrent', 'neural', 'network', 'based', 'language', 'models', 'rnnlms', 'for', 'online', 'speech', 'recognition', 'systems', 'firstly', 'a', 'lossy', 'compression', 'of', 'the', 'past', 'hidden', 'layer', 'outputs', 'history', 'vector', 'with', 'caching',... | [-0.14771214611532946, 0.014181720864361346, -0.033959961051482766, -0.013382096513810414, -0.07502600579842258, -0.18593624992462904, 0.09156112164804545, 0.4259686771443169, -0.24733689188985014, -0.33224709324561297, 0.078038756389852, -0.24756421914685572, -0.1444992028148984, 0.21758851147458347, -0.10415502069795... |
1,801.09867 | An iterative support shrinking algorithm for $\ell_{p}$-$\ell_{q}$
minimization | We present an iterative support shrinking algorithm for $\ell_{p}$-$\ell_{q}$
minimization~($0 <p < 1 \leq q < \infty $). This algorithm guarantees the
nonexpensiveness of the signal support set and can be easily implemented after
being proximally linearized. The subproblem can be very efficiently solved due
to its c... | math.NA | we present an iterative support shrinking algorithm for ell_pell_q minimization0 p 1 leq q infty this algorithm guarantees the nonexpensiveness of the signal support set and can be easily implemented after being proximally linearized the subproblem can be very efficiently solved due to its convexity and reducing size a... | [['we', 'present', 'an', 'iterative', 'support', 'shrinking', 'algorithm', 'for', 'ell_pell_q', 'minimization0', 'p', '1', 'leq', 'q', 'infty', 'this', 'algorithm', 'guarantees', 'the', 'nonexpensiveness', 'of', 'the', 'signal', 'support', 'set', 'and', 'can', 'be', 'easily', 'implemented', 'after', 'being', 'proximall... | [-0.11087346906114885, 0.04406915338690754, -0.13283123471278777, 0.07756606650915235, -0.05116788284020855, -0.16551679566482755, 0.08190066505352313, 0.37646553968574775, -0.3139169553809978, -0.26291941068174834, 0.12845284151696065, -0.24134517705781347, -0.13603108318180757, 0.18924548420956003, -0.065995992072164... |
1,801.09868 | New characterizations of freeness for hyperplane arrangements | In this article we describe two new characterizations of freeness for
hyperplane arrangements via the study of the generic initial ideal and of the
sectional matrix of the Jacobian ideal of arrangements.
| math.AG math.AC math.CO | in this article we describe two new characterizations of freeness for hyperplane arrangements via the study of the generic initial ideal and of the sectional matrix of the jacobian ideal of arrangements | [['in', 'this', 'article', 'we', 'describe', 'two', 'new', 'characterizations', 'of', 'freeness', 'for', 'hyperplane', 'arrangements', 'via', 'the', 'study', 'of', 'the', 'generic', 'initial', 'ideal', 'and', 'of', 'the', 'sectional', 'matrix', 'of', 'the', 'jacobian', 'ideal', 'of', 'arrangements']] | [-0.18370012362720445, 0.03470515160006471, -0.03221185899019474, 0.0046141720267769415, -0.022930943174287677, -0.11525267764227465, -0.03714543778914958, 0.33143120844033547, -0.32189350760199886, -0.16507039469433948, 0.10901644511250197, -0.21068762750655878, -0.16014061763416976, 0.15141786844469607, -0.0794077059... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.