id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0896 | Bonnet: An Open-Source Training and Deployment Framework for Semantic
Segmentation in Robotics using CNNs | The ability to interpret a scene is an important capability for a robot that
is supposed to interact with its environment. The knowledge of what is in front
of the robot is, for example, relevant for navigation, manipulation, or
planning. Semantic segmentation labels each pixel of an image with a class
label and thus provides a detailed semantic annotation of the surroundings to
the robot. Convolutional neural networks (CNNs) are popular methods for
addressing this type of problem. The available software for training and the
integration of CNNs for real robots, however, is quite fragmented and often
difficult to use for non-experts, despite the availability of several
high-quality open-source frameworks for neural network implementation and
training. In this paper, we propose a tool called Bonnet, which addresses this
fragmentation problem by building a higher abstraction that is specific for the
semantic segmentation task. It provides a modular approach to simplify the
training of a semantic segmentation CNN independently of the used dataset and
the intended task. Furthermore, we also address the deployment on a real
robotic platform. Thus, we do not propose a new CNN approach in this paper.
Instead, we provide a stable and easy-to-use tool to make this technology more
approachable in the context of autonomous systems. In this sense, we aim at
closing a gap between computer vision research and its use in robotics
research. We provide an open-source codebase for training and deployment. The
training interface is implemented in Python using TensorFlow and the deployment
interface provides a C++ library that can be easily integrated in an existing
robotics codebase, a ROS node, and two standalone applications for label
prediction in images and videos.
| cs.RO cs.CV | the ability to interpret a scene is an important capability for a robot that is supposed to interact with its environment the knowledge of what is in front of the robot is for example relevant for navigation manipulation or planning semantic segmentation labels each pixel of an image with a class label and thus provides a detailed semantic annotation of the surroundings to the robot convolutional neural networks cnns are popular methods for addressing this type of problem the available software for training and the integration of cnns for real robots however is quite fragmented and often difficult to use for nonexperts despite the availability of several highquality opensource frameworks for neural network implementation and training in this paper we propose a tool called bonnet which addresses this fragmentation problem by building a higher abstraction that is specific for the semantic segmentation task it provides a modular approach to simplify the training of a semantic segmentation cnn independently of the used dataset and the intended task furthermore we also address the deployment on a real robotic platform thus we do not propose a new cnn approach in this paper instead we provide a stable and easytouse tool to make this technology more approachable in the context of autonomous systems in this sense we aim at closing a gap between computer vision research and its use in robotics research we provide an opensource codebase for training and deployment the training interface is implemented in python using tensorflow and the deployment interface provides a c library that can be easily integrated in an existing robotics codebase a ros node and two standalone applications for label prediction in images and videos | [['the', 'ability', 'to', 'interpret', 'a', 'scene', 'is', 'an', 'important', 'capability', 'for', 'a', 'robot', 'that', 'is', 'supposed', 'to', 'interact', 'with', 'its', 'environment', 'the', 'knowledge', 'of', 'what', 'is', 'in', 'front', 'of', 'the', 'robot', 'is', 'for', 'example', 'relevant', 'for', 'navigation', 'manipulation', 'or', 'planning', 'semantic', 'segmentation', 'labels', 'each', 'pixel', 'of', 'an', 'image', 'with', 'a', 'class', 'label', 'and', 'thus', 'provides', 'a', 'detailed', 'semantic', 'annotation', 'of', 'the', 'surroundings', 'to', 'the', 'robot', 'convolutional', 'neural', 'networks', 'cnns', 'are', 'popular', 'methods', 'for', 'addressing', 'this', 'type', 'of', 'problem', 'the', 'available', 'software', 'for', 'training', 'and', 'the', 'integration', 'of', 'cnns', 'for', 'real', 'robots', 'however', 'is', 'quite', 'fragmented', 'and', 'often', 'difficult', 'to', 'use', 'for', 'nonexperts', 'despite', 'the', 'availability', 'of', 'several', 'highquality', 'opensource', 'frameworks', 'for', 'neural', 'network', 'implementation', 'and', 'training', 'in', 'this', 'paper', 'we', 'propose', 'a', 'tool', 'called', 'bonnet', 'which', 'addresses', 'this', 'fragmentation', 'problem', 'by', 'building', 'a', 'higher', 'abstraction', 'that', 'is', 'specific', 'for', 'the', 'semantic', 'segmentation', 'task', 'it', 'provides', 'a', 'modular', 'approach', 'to', 'simplify', 'the', 'training', 'of', 'a', 'semantic', 'segmentation', 'cnn', 'independently', 'of', 'the', 'used', 'dataset', 'and', 'the', 'intended', 'task', 'furthermore', 'we', 'also', 'address', 'the', 'deployment', 'on', 'a', 'real', 'robotic', 'platform', 'thus', 'we', 'do', 'not', 'propose', 'a', 'new', 'cnn', 'approach', 'in', 'this', 'paper', 'instead', 'we', 'provide', 'a', 'stable', 'and', 'easytouse', 'tool', 'to', 'make', 'this', 'technology', 'more', 'approachable', 'in', 'the', 'context', 'of', 'autonomous', 'systems', 'in', 'this', 'sense', 'we', 'aim', 'at', 'closing', 'a', 'gap', 'between', 'computer', 'vision', 'research', 'and', 'its', 'use', 'in', 'robotics', 'research', 'we', 'provide', 'an', 'opensource', 'codebase', 'for', 'training', 'and', 'deployment', 'the', 'training', 'interface', 'is', 'implemented', 'in', 'python', 'using', 'tensorflow', 'and', 'the', 'deployment', 'interface', 'provides', 'a', 'c', 'library', 'that', 'can', 'be', 'easily', 'integrated', 'in', 'an', 'existing', 'robotics', 'codebase', 'a', 'ros', 'node', 'and', 'two', 'standalone', 'applications', 'for', 'label', 'prediction', 'in', 'images', 'and', 'videos']] | [-0.07400981494243987, -0.006985850404594563, -0.05576041537393957, 0.04937327306603732, -0.15299828977344168, -0.18205710178200932, 0.007248662526069357, 0.4725798832473727, -0.24806066410760094, -0.3449679928691053, 0.08013806507877483, -0.21442860309302592, -0.18380374527492782, 0.21612545060246793, -0.14880494405884, 0.07616987332271198, 0.15528044800052968, 0.03863884305783293, -0.026712770412676876, -0.24243356955653098, 0.28441521860726127, 0.04714224942567886, 0.2968720431597032, 0.06844761520171899, 0.11796533957579368, -0.027091780839916722, -0.005593243137122594, -0.03656154392469715, -0.06623619768628579, 0.22210622143725656, 0.3750518717143095, 0.22800338530758893, 0.3503985811014854, -0.4267602419085372, -0.1779519950244668, 0.04910117785593749, 0.1579299941445406, 0.11305424648382292, -0.054927328244538845, -0.3385722287428036, 0.0936508838136734, -0.19791604560990853, -0.04563393978495821, -0.11130729641617952, 0.015440103461004445, -0.056640888008175135, -0.2724429711744712, -0.042442695293077204, 0.058404439148407684, 0.09743945606608989, -0.05085873774926198, -0.04404221693968414, 0.024359072102970784, 0.1987023956633153, -0.014602133520986054, 0.07108931988603336, 0.14250160939656467, -0.20593300642170978, -0.11878716588738918, 0.39184945909534213, 0.00379010558709596, -0.22777408955739342, 0.2230138757463759, 0.009046711630244252, -0.17980762723734495, 0.07673976846414504, 0.23961422954587158, 0.11035161389694582, -0.20868076003330807, 0.04695685354347019, -0.007672222748251377, 0.1701511986714473, 0.01881975380548028, -0.04448893790890416, 0.1984192971960916, 0.29487929270869095, 0.06961745620984082, 0.16390705562536706, -0.09243425125090352, -0.03767065161323215, -0.2490768787022278, -0.1955211324373967, -0.1875061531871115, -0.030018457547766105, -0.05901033994340775, -0.16869831912507632, 0.39360833033775283, 0.2530704220320226, 0.16431595953661912, 0.09099106828928355, 0.37478470498119754, -0.01008593079057378, 0.12432689556270744, 0.1127856422970306, 0.14806895608102513, -0.006425593385854803, 0.20060166010881017, -0.12504240373951858, 0.08905870260891886, 0.04616860149967612] |
1,802.08961 | Optimal Containment of Epidemics over Temporal Activity-Driven Networks | In this paper, we study the dynamics of epidemic processes taking place in
temporal and adaptive networks. Building on the activity-driven network model,
we propose an adaptive model of epidemic processes, where the network topology
dynamically changes due to both exogenous factors independent of the epidemic
dynamics as well as endogenous preventive measures adopted by individuals in
response to the state of the infection. A direct analysis of the model using
Markov processes involves the spectral analysis of a transition probability
matrix whose size grows exponentially with the number of nodes. To overcome
this limitation, we derive an upper-bound on the decay rate of the number of
infected nodes in terms of the eigenvalues of a $2 \times 2$ matrix. Using this
upper bound, we propose an efficient algorithm to tune the parameters
describing the endogenous preventive measures in order to contain epidemics
over time. We confirm our theoretical results via numerical simulations.
| cs.SI math.OC physics.soc-ph | in this paper we study the dynamics of epidemic processes taking place in temporal and adaptive networks building on the activitydriven network model we propose an adaptive model of epidemic processes where the network topology dynamically changes due to both exogenous factors independent of the epidemic dynamics as well as endogenous preventive measures adopted by individuals in response to the state of the infection a direct analysis of the model using markov processes involves the spectral analysis of a transition probability matrix whose size grows exponentially with the number of nodes to overcome this limitation we derive an upperbound on the decay rate of the number of infected nodes in terms of the eigenvalues of a 2 times 2 matrix using this upper bound we propose an efficient algorithm to tune the parameters describing the endogenous preventive measures in order to contain epidemics over time we confirm our theoretical results via numerical simulations | [['in', 'this', 'paper', 'we', 'study', 'the', 'dynamics', 'of', 'epidemic', 'processes', 'taking', 'place', 'in', 'temporal', 'and', 'adaptive', 'networks', 'building', 'on', 'the', 'activitydriven', 'network', 'model', 'we', 'propose', 'an', 'adaptive', 'model', 'of', 'epidemic', 'processes', 'where', 'the', 'network', 'topology', 'dynamically', 'changes', 'due', 'to', 'both', 'exogenous', 'factors', 'independent', 'of', 'the', 'epidemic', 'dynamics', 'as', 'well', 'as', 'endogenous', 'preventive', 'measures', 'adopted', 'by', 'individuals', 'in', 'response', 'to', 'the', 'state', 'of', 'the', 'infection', 'a', 'direct', 'analysis', 'of', 'the', 'model', 'using', 'markov', 'processes', 'involves', 'the', 'spectral', 'analysis', 'of', 'a', 'transition', 'probability', 'matrix', 'whose', 'size', 'grows', 'exponentially', 'with', 'the', 'number', 'of', 'nodes', 'to', 'overcome', 'this', 'limitation', 'we', 'derive', 'an', 'upperbound', 'on', 'the', 'decay', 'rate', 'of', 'the', 'number', 'of', 'infected', 'nodes', 'in', 'terms', 'of', 'the', 'eigenvalues', 'of', 'a', '2', 'times', '2', 'matrix', 'using', 'this', 'upper', 'bound', 'we', 'propose', 'an', 'efficient', 'algorithm', 'to', 'tune', 'the', 'parameters', 'describing', 'the', 'endogenous', 'preventive', 'measures', 'in', 'order', 'to', 'contain', 'epidemics', 'over', 'time', 'we', 'confirm', 'our', 'theoretical', 'results', 'via', 'numerical', 'simulations']] | [-0.1240504972075167, 0.10828362231162221, -0.05184366023533192, 0.055973495814030126, -0.010491597192252384, -0.09843636797497572, 0.12699986828089344, 0.3534862131696024, -0.2510631451964549, -0.2788028258988573, 0.11899640399344825, -0.2608505655323563, -0.2065864429243055, 0.12444238378392423, -0.048877365278457506, 0.0594544003693253, 0.04476888153361144, 0.05734611052131049, 0.02987437768614078, -0.23698132527456467, 0.31639197773567945, 0.10139309841335989, 0.2636408736172978, 0.028991726409716933, 0.10604192236867532, 0.026187220722242117, -0.05513250211777251, -0.01935682072778981, -0.15883791201909261, 0.1007714821965897, 0.2540759545373517, 0.15748457896732992, 0.3189453533272338, -0.4692038789001945, -0.24279838118677824, 0.14809626570501017, 0.1632068396128982, 0.12008662417141441, 0.026434236709819803, -0.28917014393864166, 0.04670644707953423, -0.19182617901489626, -0.11635911588563151, -0.039563495997534275, -0.002220998399470951, 0.036366762232729326, -0.32278375820031546, 0.067251898311809, 0.025171887497052403, 0.04271808285395511, -0.04032893122472112, -0.08984238991599067, 0.0012837481910204576, 0.16727994549091224, 0.07153330846564857, -0.0326209098688065, 0.14626488129127455, -0.11593322648691147, -0.1471874708906303, 0.30415965756097063, -0.0638985998230055, -0.19385937408976306, 0.16295933983063485, -0.0967909468465722, -0.12388754799258987, 0.13001174609986396, 0.27351493266064164, 0.08584716541424783, -0.1483021032771254, 0.0279329069125393, -0.005834770114982829, 0.18040186221242632, -0.014108128949171968, 0.02228418366033949, 0.10168199359250614, 0.2542786662363344, 0.07769901572507532, 0.13130727282640056, -0.07854816561041314, -0.13194523069374506, -0.26103160576590523, -0.12177589437292792, -0.17212848685791388, 0.06304436958443642, -0.16753333468141196, -0.18885953496727678, 0.4309711882181076, 0.18212021669993797, 0.23635502267945435, 0.10779003602777093, 0.2780326567742414, 0.12263754060951494, 0.021715461708653985, 0.08688811251126669, 0.1635271405642913, 0.11323594470703183, 0.06581834648186843, -0.242686525196464, 0.16411737543762833, 0.059192314170288786] |
1,802.08962 | Mode Multigrid - A novel convergence acceleration method | This paper proposes a mode multigrid (MMG) method, and applies it to
accelerate the convergence of the steady state flow on unstructured grids. The
dynamic mode decomposition (DMD) technique is used to analyze the convergence
process of steady flow field according to the solution vectors from the
previous time steps. Unlike the traditional multigrid method, we project the
flowfield solutions from the physical space into the modal space, and truncate
all the high-frequency modes but only the first-order mode are retained based
on the DMD analysis. The real solutions in the physical space can be obtained
simply by the inverse transformation from the modal space. The developed MMG
method ingeniously avoids the complicated process of coarsening computational
mesh, and does not need to make any change for the grid in physical space.
Therefore, it is very convenient to be applied to any numerical schemes with
just little change for the flow solver, which is also suitable for unstructured
grids and easy for parallel computing. Several typical test cases have been
used to verify the effectiveness of the proposed method, which demonstrates
that the MMG can dramatically reduce the number of iterative steps for the
different mesh types, different accuracy of spatial discretization and
different time-marching schemes. The method is 3 to 6 times faster than the
original method while ensuring the computational accuracy.
| physics.comp-ph | this paper proposes a mode multigrid mmg method and applies it to accelerate the convergence of the steady state flow on unstructured grids the dynamic mode decomposition dmd technique is used to analyze the convergence process of steady flow field according to the solution vectors from the previous time steps unlike the traditional multigrid method we project the flowfield solutions from the physical space into the modal space and truncate all the highfrequency modes but only the firstorder mode are retained based on the dmd analysis the real solutions in the physical space can be obtained simply by the inverse transformation from the modal space the developed mmg method ingeniously avoids the complicated process of coarsening computational mesh and does not need to make any change for the grid in physical space therefore it is very convenient to be applied to any numerical schemes with just little change for the flow solver which is also suitable for unstructured grids and easy for parallel computing several typical test cases have been used to verify the effectiveness of the proposed method which demonstrates that the mmg can dramatically reduce the number of iterative steps for the different mesh types different accuracy of spatial discretization and different timemarching schemes the method is 3 to 6 times faster than the original method while ensuring the computational accuracy | [['this', 'paper', 'proposes', 'a', 'mode', 'multigrid', 'mmg', 'method', 'and', 'applies', 'it', 'to', 'accelerate', 'the', 'convergence', 'of', 'the', 'steady', 'state', 'flow', 'on', 'unstructured', 'grids', 'the', 'dynamic', 'mode', 'decomposition', 'dmd', 'technique', 'is', 'used', 'to', 'analyze', 'the', 'convergence', 'process', 'of', 'steady', 'flow', 'field', 'according', 'to', 'the', 'solution', 'vectors', 'from', 'the', 'previous', 'time', 'steps', 'unlike', 'the', 'traditional', 'multigrid', 'method', 'we', 'project', 'the', 'flowfield', 'solutions', 'from', 'the', 'physical', 'space', 'into', 'the', 'modal', 'space', 'and', 'truncate', 'all', 'the', 'highfrequency', 'modes', 'but', 'only', 'the', 'firstorder', 'mode', 'are', 'retained', 'based', 'on', 'the', 'dmd', 'analysis', 'the', 'real', 'solutions', 'in', 'the', 'physical', 'space', 'can', 'be', 'obtained', 'simply', 'by', 'the', 'inverse', 'transformation', 'from', 'the', 'modal', 'space', 'the', 'developed', 'mmg', 'method', 'ingeniously', 'avoids', 'the', 'complicated', 'process', 'of', 'coarsening', 'computational', 'mesh', 'and', 'does', 'not', 'need', 'to', 'make', 'any', 'change', 'for', 'the', 'grid', 'in', 'physical', 'space', 'therefore', 'it', 'is', 'very', 'convenient', 'to', 'be', 'applied', 'to', 'any', 'numerical', 'schemes', 'with', 'just', 'little', 'change', 'for', 'the', 'flow', 'solver', 'which', 'is', 'also', 'suitable', 'for', 'unstructured', 'grids', 'and', 'easy', 'for', 'parallel', 'computing', 'several', 'typical', 'test', 'cases', 'have', 'been', 'used', 'to', 'verify', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'which', 'demonstrates', 'that', 'the', 'mmg', 'can', 'dramatically', 'reduce', 'the', 'number', 'of', 'iterative', 'steps', 'for', 'the', 'different', 'mesh', 'types', 'different', 'accuracy', 'of', 'spatial', 'discretization', 'and', 'different', 'timemarching', 'schemes', 'the', 'method', 'is', '3', 'to', '6', 'times', 'faster', 'than', 'the', 'original', 'method', 'while', 'ensuring', 'the', 'computational', 'accuracy']] | [-0.05784660258075648, 0.0323430762329711, -0.12020245581790137, 0.033948303802822315, -0.09307178356914443, -0.1276078572783373, 0.028377403598591987, 0.3719047027819627, -0.2877812328113602, -0.3105002776761393, 0.15081831422684538, -0.19942582860921046, -0.1125218031500913, 0.21013624857377153, -0.060640188331314834, 0.09855436726766659, 0.07972609847074065, -0.001126330736356332, -0.0747880798779144, -0.2540847246906816, 0.298964312337673, 0.0414013782967166, 0.34725342230503803, -0.021885155879729532, 0.11407963804495541, -0.03446891003668375, -0.05088284241678736, 0.043361400211940355, -0.07282617601640799, 0.09415951656227756, 0.22366079393431812, 0.13857603125272094, 0.2756021390648166, -0.44094224297545953, -0.21599631715616036, 0.08678867851880968, 0.18841129124181286, 0.1463022324394418, -0.004688074262060993, -0.2471974798950112, 0.11375597668519336, -0.13665932496370656, -0.11069080188051869, -0.1339992461559016, -0.03329881783021455, 0.010111538143859834, -0.2750439274149859, 0.0495114362016841, 0.05521042293747845, 0.02518592695100024, -0.038288253773997784, -0.11328758540325234, -0.005195339078254864, 0.12781735304053957, 0.03449998380832433, 0.01940447118889223, 0.10443214198622451, -0.056378801694691116, -0.07800211033453923, 0.4132500357023804, -0.022752245037512116, -0.269154169625966, 0.21316935649327517, -0.09391088106548372, -0.08688415652725662, 0.1755888182220922, 0.17927853997813478, 0.15426457408531632, -0.10294277095256765, 0.07566192458073646, 0.03387297401121179, 0.18023408383064207, 0.06184857239270157, -0.024107199268741324, 0.10009206793032954, 0.17746588024869353, 0.10842340876245997, 0.1041411075296273, -0.07540412796786548, -0.11850748001493414, -0.25989760236497217, -0.16148256226923033, -0.18488186425719966, -0.038023242276334704, -0.14582046195247364, -0.17109825271244408, 0.4029686744324863, 0.18039230541681095, 0.1425445154601616, 0.0435128641145663, 0.36037790675902315, 0.12919399604376722, 0.09530719585644683, 0.11202020671181047, 0.20928674647292214, 0.08850789372496007, 0.15747492697879237, -0.2511060650555956, 0.042970654318702194, 0.12046267081578282] |
1,802.08963 | The Mutual Information in Random Linear Estimation Beyond i.i.d.
Matrices | There has been definite progress recently in proving the variational
single-letter formula given by the heuristic replica method for various
estimation problems. In particular, the replica formula for the mutual
information in the case of noisy linear estimation with random i.i.d. matrices,
a problem with applications ranging from compressed sensing to statistics, has
been proven rigorously. In this contribution we go beyond the restrictive
i.i.d. matrix assumption and discuss the formula proposed by Takeda, Uda,
Kabashima and later by Tulino, Verdu, Caire and Shamai who used the replica
method. Using the recently introduced adaptive interpolation method and random
matrix theory, we prove this formula for a relevant large sub-class of
rotationally invariant matrices.
| cs.IT math-ph math.IT math.MP | there has been definite progress recently in proving the variational singleletter formula given by the heuristic replica method for various estimation problems in particular the replica formula for the mutual information in the case of noisy linear estimation with random iid matrices a problem with applications ranging from compressed sensing to statistics has been proven rigorously in this contribution we go beyond the restrictive iid matrix assumption and discuss the formula proposed by takeda uda kabashima and later by tulino verdu caire and shamai who used the replica method using the recently introduced adaptive interpolation method and random matrix theory we prove this formula for a relevant large subclass of rotationally invariant matrices | [['there', 'has', 'been', 'definite', 'progress', 'recently', 'in', 'proving', 'the', 'variational', 'singleletter', 'formula', 'given', 'by', 'the', 'heuristic', 'replica', 'method', 'for', 'various', 'estimation', 'problems', 'in', 'particular', 'the', 'replica', 'formula', 'for', 'the', 'mutual', 'information', 'in', 'the', 'case', 'of', 'noisy', 'linear', 'estimation', 'with', 'random', 'iid', 'matrices', 'a', 'problem', 'with', 'applications', 'ranging', 'from', 'compressed', 'sensing', 'to', 'statistics', 'has', 'been', 'proven', 'rigorously', 'in', 'this', 'contribution', 'we', 'go', 'beyond', 'the', 'restrictive', 'iid', 'matrix', 'assumption', 'and', 'discuss', 'the', 'formula', 'proposed', 'by', 'takeda', 'uda', 'kabashima', 'and', 'later', 'by', 'tulino', 'verdu', 'caire', 'and', 'shamai', 'who', 'used', 'the', 'replica', 'method', 'using', 'the', 'recently', 'introduced', 'adaptive', 'interpolation', 'method', 'and', 'random', 'matrix', 'theory', 'we', 'prove', 'this', 'formula', 'for', 'a', 'relevant', 'large', 'subclass', 'of', 'rotationally', 'invariant', 'matrices']] | [-0.04154635838711181, 0.05771273551173173, -0.1038956028400912, 0.08147927195353953, -0.041696441898894335, -0.20011473295220114, 0.07346269574230285, 0.35389038945992923, -0.24777318745734053, -0.27854325806067604, 0.15224620706175226, -0.22073011293268954, -0.22141782549075648, 0.16097596518879942, -0.11677967987719688, 0.17503600025146798, 0.03221893603787632, 0.02480500952449736, -0.10466494727124637, -0.25700355866537977, 0.2811455634791773, 0.04288270973877327, 0.30665796195567996, 0.05256827467599431, 0.1155767546282863, 0.10556025591443989, -0.06914809934358608, -0.021968347857379028, -0.14595433939793692, 0.1373767631646531, 0.2795884685469204, 0.1410075366048159, 0.3050949999743754, -0.39246688085935405, -0.22639450516451048, 0.14319916134951888, 0.13685035841698917, 0.14530680529555087, -0.09077437900149406, -0.33047130141566666, 0.10724911106087535, -0.215407040154746, -0.09679612981759615, -0.06744334621455621, 0.018817830923105683, -0.017785059858684067, -0.3309778413055716, 0.07459253674742204, 0.06886227652776634, 0.06448631459293333, -0.011740727910167864, -0.16855730737039298, 0.09420179214269796, 0.09078619645925255, 0.05741935672588764, 0.003403883203989952, 0.052842084498790735, -0.040394780381272234, -0.10698913769410537, 0.3013966915508111, -0.046481428854586976, -0.23993599044184225, 0.10978674162850455, -0.09091435855690826, -0.19084112728979472, 0.1114683701606417, 0.12454142169355675, 0.1403145818117123, -0.18425877263081503, 0.1622646445647587, -0.09310759612787012, 0.0690643390858764, 0.08540816913853895, 0.010979671731826153, 0.10035537677892559, 0.07069186744414405, 0.05956125869373749, 0.1771366065535862, -0.04567712681317652, -0.12224246351769916, -0.22090632100967136, -0.11034943561199717, -0.29419470634227535, 0.02289654089894087, -0.1361883149711994, -0.1257947035939307, 0.3131839376580608, 0.1352436385969086, 0.14065994238816537, 0.10493301773896895, 0.2893535561863803, 0.14640729022915014, 0.0314494696013663, 0.08928721949357439, 0.19055585104233777, 0.24804275253628222, 0.11061728484760802, -0.12576697237353335, 0.09993052332838243, 0.14812542899587267] |
1,802.08964 | The large sieve with power moduli for $\mathbb{Z}[i]$ | We establish a large sieve inequality for power moduli in $\mathbb{Z}[i]$,
extending earlier work by L. Zhao and the first-named author on the large sieve
for power moduli for the classical case of moduli in $\mathbb{Z}$. Our method
starts with a version of the large sieve for $\mathbb{R}^2$. We convert the
resulting counting problem back into one for $\mathbb{Z}[i]$ which we then
attack using Weyl differencing and Poisson summation.
| math.NT | we establish a large sieve inequality for power moduli in mathbbzi extending earlier work by l zhao and the firstnamed author on the large sieve for power moduli for the classical case of moduli in mathbbz our method starts with a version of the large sieve for mathbbr2 we convert the resulting counting problem back into one for mathbbzi which we then attack using weyl differencing and poisson summation | [['we', 'establish', 'a', 'large', 'sieve', 'inequality', 'for', 'power', 'moduli', 'in', 'mathbbzi', 'extending', 'earlier', 'work', 'by', 'l', 'zhao', 'and', 'the', 'firstnamed', 'author', 'on', 'the', 'large', 'sieve', 'for', 'power', 'moduli', 'for', 'the', 'classical', 'case', 'of', 'moduli', 'in', 'mathbbz', 'our', 'method', 'starts', 'with', 'a', 'version', 'of', 'the', 'large', 'sieve', 'for', 'mathbbr2', 'we', 'convert', 'the', 'resulting', 'counting', 'problem', 'back', 'into', 'one', 'for', 'mathbbzi', 'which', 'we', 'then', 'attack', 'using', 'weyl', 'differencing', 'and', 'poisson', 'summation']] | [-0.10122382830477496, 0.06463896195687678, -0.1089751779007307, 0.024425358754461227, -0.09359116201707418, -0.13198041193781124, 0.05828300887799781, 0.24721694889518878, -0.3007279968064656, -0.26638179949646734, 0.10469156313194906, -0.2609237150653549, -0.11791384390190891, 0.2521383882216785, -0.11243463958195155, 0.04286047953275451, 0.009886083894989628, -0.020760097527417583, -0.020459750785316894, -0.3537476697153803, 0.3431246837844019, 0.005567811281028865, 0.24933520080926624, 0.006501724727559781, 0.06771762942409386, 0.08089642312742122, -0.0446548197094513, 0.008544197818939236, -0.1450692342924953, 0.16638247872385586, 0.24697632201191416, 0.03244018187557442, 0.2742027014331973, -0.39836130593565927, -0.16685492651658537, 0.14147522952407598, 0.15159652614966035, 0.08464259498219505, -0.026900776656870934, -0.26782239989404555, 0.09839944023153056, -0.17507624116631737, -0.12585363253627135, -0.07047035601799903, 0.04301820278329694, 0.04473252398758263, -0.2743933192062853, 0.03363171079789923, 0.10020330460553152, 0.05102582852207664, -0.04512331086089429, -0.14237239713902058, 0.06397393585074747, 0.044923643068666905, 0.02015883059821267, 0.033256241424090185, 0.03539647318530774, -0.07632793607595174, -0.07740547464134684, 0.313718248401647, -0.07856464597389803, -0.18380874434513025, 0.05437035320083732, -0.08067781789282309, -0.20842403108658997, 0.08871873698966659, 0.15254647702491586, 0.1511759673771651, -0.016833004190761974, 0.16740620614576113, -0.09586112521102895, 0.08056625486958933, 0.14942097188769907, -0.08248612052842003, 0.11150017166105301, 0.09288936137538943, 0.09902855735002221, 0.20308990502541047, -0.09100874351081101, -0.089123828076771, -0.34161989312564983, -0.2188636478630529, -0.20764718281334618, 0.13623350603586953, -0.12223729803657118, -0.15215257297445467, 0.36203327850587125, 0.09844694360061482, 0.2260403364788795, 0.16916331815013688, 0.25463902477876865, 0.10818270473248338, 0.06351608067642951, 0.05913272285429032, 0.13864674579109187, 0.1573983258534007, 0.0729731219564227, -0.1250189570170166, -0.03168092697750831, 0.2121823028512839] |
1,802.08965 | Diffusion Based Molecular Communication with Limited Molecule Production
Rate | This paper studies the impact of a transmitter's molecule generation process
on the capacity of a concentration based Molecular Communication (MC) system.
Constraints caused by the molecule generation process affect the availability
of the molecules at the transmitter. The transmitter has a storage of
molecules, and should decide whether to release or save the currently produced
molecules. As a result, the MC system has conceptual connections with energy
harvesting systems. In this paper, we consider two scenarios on the propagation
channel. The first scenario assumes a channel with no Inter-symbol Interference
(ISI), \emph{i.e.,} a memoryless channel. We derive bounds on the capacity of
the MC system in this scenario. The second scenario assumes the MC network with
ISI, in which the output of the channel depends on the history of released
molecules in the previous time-slots. Based on the assumptions that either the
transmitter or the receiver knows the channel statistics, we compute a lower
bound on the channel capacity.
| cs.IT math.IT | this paper studies the impact of a transmitters molecule generation process on the capacity of a concentration based molecular communication mc system constraints caused by the molecule generation process affect the availability of the molecules at the transmitter the transmitter has a storage of molecules and should decide whether to release or save the currently produced molecules as a result the mc system has conceptual connections with energy harvesting systems in this paper we consider two scenarios on the propagation channel the first scenario assumes a channel with no intersymbol interference isi emphie a memoryless channel we derive bounds on the capacity of the mc system in this scenario the second scenario assumes the mc network with isi in which the output of the channel depends on the history of released molecules in the previous timeslots based on the assumptions that either the transmitter or the receiver knows the channel statistics we compute a lower bound on the channel capacity | [['this', 'paper', 'studies', 'the', 'impact', 'of', 'a', 'transmitters', 'molecule', 'generation', 'process', 'on', 'the', 'capacity', 'of', 'a', 'concentration', 'based', 'molecular', 'communication', 'mc', 'system', 'constraints', 'caused', 'by', 'the', 'molecule', 'generation', 'process', 'affect', 'the', 'availability', 'of', 'the', 'molecules', 'at', 'the', 'transmitter', 'the', 'transmitter', 'has', 'a', 'storage', 'of', 'molecules', 'and', 'should', 'decide', 'whether', 'to', 'release', 'or', 'save', 'the', 'currently', 'produced', 'molecules', 'as', 'a', 'result', 'the', 'mc', 'system', 'has', 'conceptual', 'connections', 'with', 'energy', 'harvesting', 'systems', 'in', 'this', 'paper', 'we', 'consider', 'two', 'scenarios', 'on', 'the', 'propagation', 'channel', 'the', 'first', 'scenario', 'assumes', 'a', 'channel', 'with', 'no', 'intersymbol', 'interference', 'isi', 'emphie', 'a', 'memoryless', 'channel', 'we', 'derive', 'bounds', 'on', 'the', 'capacity', 'of', 'the', 'mc', 'system', 'in', 'this', 'scenario', 'the', 'second', 'scenario', 'assumes', 'the', 'mc', 'network', 'with', 'isi', 'in', 'which', 'the', 'output', 'of', 'the', 'channel', 'depends', 'on', 'the', 'history', 'of', 'released', 'molecules', 'in', 'the', 'previous', 'timeslots', 'based', 'on', 'the', 'assumptions', 'that', 'either', 'the', 'transmitter', 'or', 'the', 'receiver', 'knows', 'the', 'channel', 'statistics', 'we', 'compute', 'a', 'lower', 'bound', 'on', 'the', 'channel', 'capacity']] | [-0.2324160017655231, 0.06632315303431824, -0.056145664403447884, 0.021215874875019837, -0.032688701403094454, -0.18730418240302243, 0.13530254260549554, 0.3328424794774037, -0.26678384594706583, -0.28073748861206693, 0.10437415005872026, -0.2566941395401955, -0.1074169721119688, 0.1334162878090865, -0.05601570524158887, 0.01320053602103144, 0.0789491045230534, 0.09745723294472555, 0.0024264528867206534, -0.2307905347101041, 0.30998681083729024, 0.1420730904690572, 0.31236738893203436, 0.07038954890153945, 0.10710692321299575, 0.0030966257967520506, -0.005027218321629334, -0.13386728493496775, -0.13795195127627266, 0.08467945887241513, 0.20814521390129812, 0.15579157381725964, 0.2205032114579808, -0.464734877232695, -0.2929705953982193, 0.11461015263048466, 0.13074333055628812, 0.10975177913132939, -0.056624493617800906, -0.2528066152590327, 0.05284997167909751, -0.20073877720278688, 0.0036211158909281948, 0.11839949999266537, -0.0725723634386668, 0.053522060788236556, -0.3168659519898938, 0.04977636809344403, 0.037160026673882386, 0.028676771809114144, -0.04761175389867276, -0.13907971962544252, 0.01985339282255154, 0.14879331372794696, 0.013177226986226743, -5.5594905279576776e-05, 0.14405516112383338, -0.13482751208211993, -0.10251932374376338, 0.3737327998809633, -0.057182466151425616, -0.23088893266685773, 0.17562804518338454, -0.1337946853489484, -0.11153025311068632, 0.1433753803547006, 0.23476413802418392, 0.06929453233024105, -0.1846764381916728, 0.053814077446804734, -0.006594059889903292, 0.21192589420534205, 0.0540865971473977, 0.09515081821518834, 0.15422298812191002, 0.17959630364493934, 0.0669880720146466, 0.1825650740065612, -0.13778474131959229, -0.13269696049028426, -0.2630464233690873, -0.15498884902226565, -0.2549318975652568, 0.011539307713246672, -0.008492687766465678, -0.08674744461823139, 0.34738961398470564, 0.12621536318620202, 0.14556086964439602, 0.04461895790373092, 0.38421945755835624, 0.08079747864612727, 0.04296393444383284, 0.10886530501302331, 0.2173013133229688, 0.12133815774795949, 0.11824179709365126, -0.22830941954325681, 0.15225453616585582, -0.036690296400047374] |
1,802.08966 | Deciphering the fluctuations of high frequency birth rates | Here the term "high frequency" refers to daily, weekly or monthly birth data.
The fluctuations of daily birth numbers show a succession of spikes and dips
which, at least at first sight, looks almost as random as white noise. However
in recent times several studies were published, including by the present
authors, which have given better insight into how birth is affected by
exogenous factors. One of them concerns the way adverse conditions (e.g.
famines, diseases, earthquakes, heat waves) temporarily affect the conception
capacity of populations, thus producing birth rate troughs 9 months after
mortality waves. In addition, religious interdicts (e.g. during the Lent
period) lead to reduced conceptions. These as well as other effects raise the
hope that we will soon be able to "read" and interpret birth rate patterns just
as the Egyptologist Jean-Francois Champollion managed to decipher many (though
not all) hieroglyphs.
| physics.bio-ph physics.soc-ph | here the term high frequency refers to daily weekly or monthly birth data the fluctuations of daily birth numbers show a succession of spikes and dips which at least at first sight looks almost as random as white noise however in recent times several studies were published including by the present authors which have given better insight into how birth is affected by exogenous factors one of them concerns the way adverse conditions eg famines diseases earthquakes heat waves temporarily affect the conception capacity of populations thus producing birth rate troughs 9 months after mortality waves in addition religious interdicts eg during the lent period lead to reduced conceptions these as well as other effects raise the hope that we will soon be able to read and interpret birth rate patterns just as the egyptologist jeanfrancois champollion managed to decipher many though not all hieroglyphs | [['here', 'the', 'term', 'high', 'frequency', 'refers', 'to', 'daily', 'weekly', 'or', 'monthly', 'birth', 'data', 'the', 'fluctuations', 'of', 'daily', 'birth', 'numbers', 'show', 'a', 'succession', 'of', 'spikes', 'and', 'dips', 'which', 'at', 'least', 'at', 'first', 'sight', 'looks', 'almost', 'as', 'random', 'as', 'white', 'noise', 'however', 'in', 'recent', 'times', 'several', 'studies', 'were', 'published', 'including', 'by', 'the', 'present', 'authors', 'which', 'have', 'given', 'better', 'insight', 'into', 'how', 'birth', 'is', 'affected', 'by', 'exogenous', 'factors', 'one', 'of', 'them', 'concerns', 'the', 'way', 'adverse', 'conditions', 'eg', 'famines', 'diseases', 'earthquakes', 'heat', 'waves', 'temporarily', 'affect', 'the', 'conception', 'capacity', 'of', 'populations', 'thus', 'producing', 'birth', 'rate', 'troughs', '9', 'months', 'after', 'mortality', 'waves', 'in', 'addition', 'religious', 'interdicts', 'eg', 'during', 'the', 'lent', 'period', 'lead', 'to', 'reduced', 'conceptions', 'these', 'as', 'well', 'as', 'other', 'effects', 'raise', 'the', 'hope', 'that', 'we', 'will', 'soon', 'be', 'able', 'to', 'read', 'and', 'interpret', 'birth', 'rate', 'patterns', 'just', 'as', 'the', 'egyptologist', 'jeanfrancois', 'champollion', 'managed', 'to', 'decipher', 'many', 'though', 'not', 'all', 'hieroglyphs']] | [-0.08460571130385974, 0.18995562145629755, -0.05994180243599092, 0.13439187644638928, -0.09197760569876047, -0.12635072377686213, 0.09590259616481388, 0.3304430324506093, -0.25242996490006886, -0.33125172098577543, 0.1809097365101708, -0.29918748522958866, -0.14986792579049024, 0.21324897861805048, -0.1150407418901739, -0.031046130196223935, 0.07565009161761564, 0.04400149815824938, 0.016694397065573588, -0.3151966085652593, 0.23870301167838848, 0.11366612319118129, 0.24150767142500182, 0.023035995183067665, 0.06722344606023907, -0.03753457769600534, -0.07930910407660784, -0.03910890667718816, -0.08061637370742351, 0.025767608798089457, 0.27485568088095086, 0.1580738407165672, 0.3171841994878816, -0.4901332125569192, -0.2507263854523743, 0.10071836329241107, 0.14753235722594843, 0.09180481662042439, 0.027641744501042096, -0.2715128910519391, 0.004472772787419519, -0.17468558174518908, -0.14658464683493325, -0.035049411282594596, 0.07098478378102809, 0.0647627374082413, -0.19188337818103993, 0.14311684120993515, 0.05140718752827652, 0.08635411224608029, -0.05521430005807872, -0.11800142500227581, -0.029108060580854127, 0.17604863257928902, 0.13020551648524986, 0.005415387292086453, 0.1551553900760657, -0.1095011681562511, -0.12775726343172936, 0.34374314011278123, -0.06917985502290182, -0.08029462623172212, 0.18748283391033618, -0.1838830718044045, -0.126902233885961, 0.13766292556941223, 0.20043739329101973, 0.03333637731514506, -0.1605387753831431, -0.07830444297291683, 0.03892771534986429, 0.1401702611979058, 0.17156841373071074, 0.033905657548848146, 0.2719556375934215, 0.11933624805228042, 0.025182599872204156, 0.073132820036246, -0.09241354160220036, -0.0745373381191044, -0.21433845230856896, -0.09639810750560536, -0.09832317603611992, 0.09779828189804228, -0.03789033725555706, -0.13212243210967187, 0.3865754051733163, 0.15758549087270574, 0.2160284886546954, 0.008621946348437479, 0.24047709296789618, 0.06658805692421885, 0.09076992090838477, 0.07119840741730653, 0.18239265535241708, 0.06933024756682034, 0.16005867521337175, -0.14588623689455013, 0.16303242772404053, -0.00772285948579128] |
1,802.08967 | Shape Control for Experimental Continuation | An experimental method has been developed to locate unstable equilibria of
nonlinear structures quasi-statically. The technique involves loading a
structure by application of either a force or a displacement at a main
actuation point, while simultaneously controlling the overall shape using
additional probe points. The method is applied to a shallow arch, and unstable
segments of its equilibrium path are identified experimentally for the first
time. Shape control is a fundamental building block for the experimental---as
opposed to numerical---continuation of nonlinear structures, which will
significantly expand our ability to measure their mechanical response.
| physics.app-ph cond-mat.soft | an experimental method has been developed to locate unstable equilibria of nonlinear structures quasistatically the technique involves loading a structure by application of either a force or a displacement at a main actuation point while simultaneously controlling the overall shape using additional probe points the method is applied to a shallow arch and unstable segments of its equilibrium path are identified experimentally for the first time shape control is a fundamental building block for the experimentalas opposed to numericalcontinuation of nonlinear structures which will significantly expand our ability to measure their mechanical response | [['an', 'experimental', 'method', 'has', 'been', 'developed', 'to', 'locate', 'unstable', 'equilibria', 'of', 'nonlinear', 'structures', 'quasistatically', 'the', 'technique', 'involves', 'loading', 'a', 'structure', 'by', 'application', 'of', 'either', 'a', 'force', 'or', 'a', 'displacement', 'at', 'a', 'main', 'actuation', 'point', 'while', 'simultaneously', 'controlling', 'the', 'overall', 'shape', 'using', 'additional', 'probe', 'points', 'the', 'method', 'is', 'applied', 'to', 'a', 'shallow', 'arch', 'and', 'unstable', 'segments', 'of', 'its', 'equilibrium', 'path', 'are', 'identified', 'experimentally', 'for', 'the', 'first', 'time', 'shape', 'control', 'is', 'a', 'fundamental', 'building', 'block', 'for', 'the', 'experimentalas', 'opposed', 'to', 'numericalcontinuation', 'of', 'nonlinear', 'structures', 'which', 'will', 'significantly', 'expand', 'our', 'ability', 'to', 'measure', 'their', 'mechanical', 'response']] | [-0.10473231085484008, 0.09633568523513732, -0.14267612751163952, 0.008771574915294627, -0.07364035388812996, -0.14141551688170204, 0.05215626424894883, 0.3873593663940063, -0.3052735957061196, -0.284715761184938, 0.13218568309701487, -0.2185913963233131, -0.16371099568857392, 0.1970382517710287, -0.01624558205910764, 0.11305391763344633, 0.02410471252073626, 0.026245292245441084, -0.013437456093155421, -0.18063984718941317, 0.2602027966845576, 0.08658473570268232, 0.3047020925787165, -0.006010902395656148, 0.1068082992550354, -0.014514963692668212, 0.0012785911887556642, 0.05105425325314422, -0.09470529893571818, 0.13933276531419583, 0.2158267299547423, 0.05823892686045268, 0.3087976555426984, -0.4192330277637466, -0.24101310138396181, 0.06795485286748262, 0.14737704541063407, 0.13919377090680607, -0.033183778736581716, -0.2559677479522569, 0.09480814008390183, -0.09670935317382708, -0.19646852021873162, -0.09417634354494922, 0.026696776423685172, 0.04713470723088524, -0.25904768878136053, 0.028817128881320847, 0.06339240374278973, 0.029709491080471447, -0.09710667888853945, -0.05767147760879207, -0.03751919127151288, 0.1626098038741275, -0.006027473175161324, 0.02006074443336699, 0.2093483216415804, -0.12087254896555301, -0.10153136338915798, 0.3949088968623143, -0.020392055275266642, -0.2047303449874232, 0.2067685899641979, -0.062456942854224, -0.0695334337600558, 0.18580920832067893, 0.19766082631035164, 0.11282939566708691, -0.14081114832539582, 0.028247321126240583, 0.028147827214714916, 0.18120136218571492, 0.08316656828929599, -0.06249929788512188, 0.2237575065628734, 0.1986052171112253, 0.12038283376534889, 0.16707910692247635, -0.09620257568607045, -0.0910929037196623, -0.25051896657364875, -0.13504318997857498, -0.1580123840370676, 0.016777802529939257, -0.03151307349681092, -0.18574890899753382, 0.42262141656253366, 0.11054888104631024, 0.21299202085196317, 0.015801233642448027, 0.32678421403557717, 0.091771007961962, 0.08740997757982709, 0.03629629214928782, 0.27225587604014756, 0.12536144198512064, 0.08069171438730516, -0.24778366969657836, 0.08236833273914161, 0.05366677241809257] |
1,802.08968 | Group Divisible Designs with $\lambda_1=3$ and Large Second Index | A group divisible design $\mbox{GDD}(m,n;\lambda_1,\lambda_2)$, is an ordered
pair $(V, \cal{B})$ where $V$ is an $(m+n)$-set of symbols while $\cal{B}$ is a
collection of $3$-subsets (called blocks) of $V$ satisfying the following
properties: the $(m+n)$-set is divided into 2 groups of size $m$ and of size
$n$: each pair of symbols from the same group occurs in exactly $\lambda_1$
blocks in $\cal{B}$, and each pair of symbols from different groups occurs in
exactly $\lambda_2$ blocks in $\cal{B}$. $\lambda_1$ and $\lambda_2$ are
referred to as first index and second index, respectively.
Here, we focus on an existence problem of $\mbox{GDD}$s when $\lambda_1=3$
and $\lambda_2>3$. We obtain the necessary conditions and prove that these
conditions are sufficient for most of the cases.
| math.CO | a group divisible design mboxgddmnlambda_1lambda_2 is an ordered pair v calb where v is an mnset of symbols while calb is a collection of 3subsets called blocks of v satisfying the following properties the mnset is divided into 2 groups of size m and of size n each pair of symbols from the same group occurs in exactly lambda_1 blocks in calb and each pair of symbols from different groups occurs in exactly lambda_2 blocks in calb lambda_1 and lambda_2 are referred to as first index and second index respectively here we focus on an existence problem of mboxgdds when lambda_13 and lambda_23 we obtain the necessary conditions and prove that these conditions are sufficient for most of the cases | [['a', 'group', 'divisible', 'design', 'mboxgddmnlambda_1lambda_2', 'is', 'an', 'ordered', 'pair', 'v', 'calb', 'where', 'v', 'is', 'an', 'mnset', 'of', 'symbols', 'while', 'calb', 'is', 'a', 'collection', 'of', '3subsets', 'called', 'blocks', 'of', 'v', 'satisfying', 'the', 'following', 'properties', 'the', 'mnset', 'is', 'divided', 'into', '2', 'groups', 'of', 'size', 'm', 'and', 'of', 'size', 'n', 'each', 'pair', 'of', 'symbols', 'from', 'the', 'same', 'group', 'occurs', 'in', 'exactly', 'lambda_1', 'blocks', 'in', 'calb', 'and', 'each', 'pair', 'of', 'symbols', 'from', 'different', 'groups', 'occurs', 'in', 'exactly', 'lambda_2', 'blocks', 'in', 'calb', 'lambda_1', 'and', 'lambda_2', 'are', 'referred', 'to', 'as', 'first', 'index', 'and', 'second', 'index', 'respectively', 'here', 'we', 'focus', 'on', 'an', 'existence', 'problem', 'of', 'mboxgdds', 'when', 'lambda_13', 'and', 'lambda_23', 'we', 'obtain', 'the', 'necessary', 'conditions', 'and', 'prove', 'that', 'these', 'conditions', 'are', 'sufficient', 'for', 'most', 'of', 'the', 'cases']] | [-0.19334484725831108, 0.15576782755146779, -0.005730700532072469, -0.003963843882574062, -0.019133398078561743, -0.15495576015101714, 0.012258323221957605, 0.36619818764493656, -0.2807678019540107, -0.23833895459150276, 0.10063200051438782, -0.2971512613523948, -0.1148369120977198, 0.15461364849838183, -0.04342156859408868, -0.03595459600399951, -0.010412034411146714, 0.15123402766307423, -0.04077784834927961, -0.2599185009960804, 0.343374817562698, -0.05255011545102063, 0.2130446368665026, 0.015994083822557802, 0.0933375468216183, 0.009998196395029305, -0.007016454780425288, -0.018952099778863685, -0.14929443674618756, 0.06568827023709259, 0.2425758953680072, 0.12956862360149166, 0.26098410494364144, -0.36718426971581947, -0.09245793112112503, 0.1670073084410672, 0.14044002019146687, -0.0021819366763035455, 0.007878782334860022, -0.2353671003631398, 0.19035147210550413, -0.09609822174044032, -0.08092092415481283, 0.045492526764671005, 0.09870943261245102, 0.022820631764612666, -0.35476924781279084, 0.04208052237599827, 0.0720203450080334, 0.031044657907873523, -0.04346182512062226, -0.18067291076703554, -0.07110014576219807, 0.1880599020833758, 0.008679586462676525, -0.012572123632325153, 0.040253213439300134, -0.07232306694219771, -0.08046719953090999, 0.3889510967164186, -0.010194045176990983, -0.18531887539613404, 0.11433921919792499, -0.128216873298873, -0.17130991047362618, 0.09361711206127024, 0.1493711411573091, 0.14892256589557387, -0.09467145594578796, 0.1253541171716183, -0.061837907782510707, 0.17276653564093927, 0.1027487841365336, 0.029088630753552967, 0.1366735359760034, 0.11736332004064727, 0.11909020790450373, 0.14885419344921647, -0.0252497374639732, 0.018388315370733228, -0.3788606295231403, -0.20117085905778304, -0.20520867528230474, 0.05245363119205362, -0.08938164183417573, -0.11605418718158546, 0.3742921412513967, 0.06894465804655563, 0.2547640978080923, 0.056078871467003695, 0.18881894849657424, 0.10258132187096124, 0.05402832365545787, 0.09619800192140565, 0.09801944993893828, 0.14874329997365476, -0.03136504855897408, -0.1580442231837272, 0.007793348302999348, 0.12443400651069456] |
1,802.08969 | Meta Multi-Task Learning for Sequence Modeling | Semantic composition functions have been playing a pivotal role in neural
representation learning of text sequences. In spite of their success, most
existing models suffer from the underfitting problem: they use the same shared
compositional function on all the positions in the sequence, thereby lacking
expressive power due to incapacity to capture the richness of compositionality.
Besides, the composition functions of different tasks are independent and
learned from scratch. In this paper, we propose a new sharing scheme of
composition function across multiple tasks. Specifically, we use a shared
meta-network to capture the meta-knowledge of semantic composition and generate
the parameters of the task-specific semantic composition models. We conduct
extensive experiments on two types of tasks, text classification and sequence
tagging, which demonstrate the benefits of our approach. Besides, we show that
the shared meta-knowledge learned by our proposed model can be regarded as
off-the-shelf knowledge and easily transferred to new tasks.
| cs.AI cs.CL | semantic composition functions have been playing a pivotal role in neural representation learning of text sequences in spite of their success most existing models suffer from the underfitting problem they use the same shared compositional function on all the positions in the sequence thereby lacking expressive power due to incapacity to capture the richness of compositionality besides the composition functions of different tasks are independent and learned from scratch in this paper we propose a new sharing scheme of composition function across multiple tasks specifically we use a shared metanetwork to capture the metaknowledge of semantic composition and generate the parameters of the taskspecific semantic composition models we conduct extensive experiments on two types of tasks text classification and sequence tagging which demonstrate the benefits of our approach besides we show that the shared metaknowledge learned by our proposed model can be regarded as offtheshelf knowledge and easily transferred to new tasks | [['semantic', 'composition', 'functions', 'have', 'been', 'playing', 'a', 'pivotal', 'role', 'in', 'neural', 'representation', 'learning', 'of', 'text', 'sequences', 'in', 'spite', 'of', 'their', 'success', 'most', 'existing', 'models', 'suffer', 'from', 'the', 'underfitting', 'problem', 'they', 'use', 'the', 'same', 'shared', 'compositional', 'function', 'on', 'all', 'the', 'positions', 'in', 'the', 'sequence', 'thereby', 'lacking', 'expressive', 'power', 'due', 'to', 'incapacity', 'to', 'capture', 'the', 'richness', 'of', 'compositionality', 'besides', 'the', 'composition', 'functions', 'of', 'different', 'tasks', 'are', 'independent', 'and', 'learned', 'from', 'scratch', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'sharing', 'scheme', 'of', 'composition', 'function', 'across', 'multiple', 'tasks', 'specifically', 'we', 'use', 'a', 'shared', 'metanetwork', 'to', 'capture', 'the', 'metaknowledge', 'of', 'semantic', 'composition', 'and', 'generate', 'the', 'parameters', 'of', 'the', 'taskspecific', 'semantic', 'composition', 'models', 'we', 'conduct', 'extensive', 'experiments', 'on', 'two', 'types', 'of', 'tasks', 'text', 'classification', 'and', 'sequence', 'tagging', 'which', 'demonstrate', 'the', 'benefits', 'of', 'our', 'approach', 'besides', 'we', 'show', 'that', 'the', 'shared', 'metaknowledge', 'learned', 'by', 'our', 'proposed', 'model', 'can', 'be', 'regarded', 'as', 'offtheshelf', 'knowledge', 'and', 'easily', 'transferred', 'to', 'new', 'tasks']] | [-0.0281610915400578, 0.026344651723966786, -0.0762574041758566, 0.06833807601211256, -0.11238020322420389, -0.1004711196904904, 0.04674902274794141, 0.45716272714841916, -0.33698053203759054, -0.3598783611516027, 0.024644627137795874, -0.2437009955204925, -0.1718133268785957, 0.1827425072189822, -0.10684473953197564, 0.06797913834988752, 0.1160571630921607, 0.044478928698625075, -0.08779180800698477, -0.26782093521538436, 0.3589656339700971, 0.014205164750915412, 0.3229024234730643, 0.02633920570913592, 0.1193967626221772, -0.023475632843512454, -0.05481218082193089, -0.04689116021128077, -0.04068363092765618, 0.2055172156044711, 0.32184205449548725, 0.23590686078382292, 0.30467025649513263, -0.40482392425550834, -0.24270044752675426, 0.09933077700215538, 0.13673611533350163, 0.05674359928678697, -0.038363702866359074, -0.31183022857447595, 0.1026062368534775, -0.19249780076758102, 0.02906625541110866, -0.15424375780735558, -0.05525088799798763, 0.03157848797050783, -0.24952170895841463, 0.024278670033182653, 0.12373064437231637, 0.07241957777028131, -0.060595656189865336, -0.13595705703942498, -0.005022635272900133, 0.25400928739691153, 0.037771691100236864, 0.017116004934283217, 0.12261529336377096, -0.17272443765135617, -0.14380615259793367, 0.3674617452779785, -0.05349998461621765, -0.22663125088499664, 0.24100626162161412, -0.03602787902376516, -0.17868469424827613, 0.04884169195429422, 0.22086132499756977, 0.11813392846287522, -0.16263414878937366, 0.028573862849857266, -0.05306746868422794, 0.20913564575235605, 0.06682152440924638, 0.045823634733862584, 0.21629542944720015, 0.21385679217545608, -0.007975819316925481, 0.1450734536043264, -0.05458254148681207, -0.07059200458216335, -0.20926765455767868, -0.11287426398944501, -0.18361352558177282, -0.0394823158306903, -0.1002026486182187, -0.13352135483690195, 0.41545545545606827, 0.2287794789835492, 0.22947321317195402, 0.09209793447543664, 0.31386721788562444, 0.030812680029684042, 0.14123508218204064, 0.05533141764125934, 0.1469934107184312, 0.014801052856982048, 0.13996719312700934, -0.1809943916772394, 0.1319404338979726, 0.05090064189004663] |
1,802.0897 | Incorporating Discriminator in Sentence Generation: a Gibbs Sampling
Method | Generating plausible and fluent sentence with desired properties has long
been a challenge. Most of the recent works use recurrent neural networks (RNNs)
and their variants to predict following words given previous sequence and
target label. In this paper, we propose a novel framework to generate
constrained sentences via Gibbs Sampling. The candidate sentences are revised
and updated iteratively, with sampled new words replacing old ones. Our
experiments show the effectiveness of the proposed method to generate plausible
and diverse sentences.
| cs.CL | generating plausible and fluent sentence with desired properties has long been a challenge most of the recent works use recurrent neural networks rnns and their variants to predict following words given previous sequence and target label in this paper we propose a novel framework to generate constrained sentences via gibbs sampling the candidate sentences are revised and updated iteratively with sampled new words replacing old ones our experiments show the effectiveness of the proposed method to generate plausible and diverse sentences | [['generating', 'plausible', 'and', 'fluent', 'sentence', 'with', 'desired', 'properties', 'has', 'long', 'been', 'a', 'challenge', 'most', 'of', 'the', 'recent', 'works', 'use', 'recurrent', 'neural', 'networks', 'rnns', 'and', 'their', 'variants', 'to', 'predict', 'following', 'words', 'given', 'previous', 'sequence', 'and', 'target', 'label', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'framework', 'to', 'generate', 'constrained', 'sentences', 'via', 'gibbs', 'sampling', 'the', 'candidate', 'sentences', 'are', 'revised', 'and', 'updated', 'iteratively', 'with', 'sampled', 'new', 'words', 'replacing', 'old', 'ones', 'our', 'experiments', 'show', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'to', 'generate', 'plausible', 'and', 'diverse', 'sentences']] | [-0.0038894647214975622, 0.05999143777219693, -0.054116103091035726, 0.11380193991166895, -0.17327417680464777, -0.14430704870387728, 0.0840330296167299, 0.4812628793311708, -0.30289313675013635, -0.3383976725033588, 0.0037070825382676206, -0.2691581881171046, -0.16492874476552746, 0.16032563119028684, -0.13545586042290117, 0.12201333723467901, 0.13792634882998686, 0.055674849480482534, -0.032228609955191244, -0.3131396360580384, 0.27460262625489706, 0.05009224607298771, 0.2858891314999373, -0.05322993047719384, 0.18067710682243845, -0.06696961959626348, -0.0698960231801058, -0.03307408907876155, -0.0660630107431868, 0.20476135706965937, 0.29019044691489804, 0.22467017313968504, 0.32624791256715485, -0.4220106737849153, -0.2507535702905353, 0.09775746075643434, 0.11510725747104045, 0.1495576237132888, -0.07930698620304925, -0.3443616598292633, 0.1508054398589503, -0.16492774965741705, 0.022453109204861117, -0.15476558989856715, 0.007528207920215748, 0.047566437173956706, -0.27269199318080034, 0.022640094104981807, 0.1071397073302464, 0.007475774815696993, -0.04493256083137735, -0.13055715008127147, 0.03082511512229196, 0.1348646823403046, 0.06472438724458586, 0.11272545564735745, 0.0692066585495608, -0.12472509011700979, -0.17477468709478639, 0.35349954073719775, -0.05037184817038109, -0.20170594660912347, 0.2098953551095393, -0.016634646492699783, -0.18540247217867017, 0.06102036532405534, 0.1685746049962616, 0.15622970328470806, -0.21070275508603195, -0.03136541569004709, -0.10373615601134521, 0.18702476522252884, 0.08718198093148753, -0.003597229880131321, 0.2213614510981665, 0.24811399794747063, -0.0596387212647608, 0.16137299039918515, -0.0934387565486961, -0.06248838507374863, -0.1986978737361453, -0.07436103264536754, -0.18030795326203475, -0.04695382798133694, -0.03290779025629479, -0.1577117128490275, 0.4450898469874152, 0.27402846510004664, 0.23532926076218302, 0.17037421516660187, 0.29751126778622466, 0.026415282304191753, 0.09007091018267804, 0.08839431402192992, 0.1014722488809055, 0.05412080269996767, 0.08112190503994991, -0.11223253384836156, 0.1336396598489955, 0.08478909285946025] |
1,802.08971 | Advanced Fabrication of Single-crystal Diamond Membranes for Quantum
Technologies | Many promising applications of single crystal diamond and its color centers
as sensor platform and in photonics require free-standing membranes with a
thickness ranging from several micrometers to the few 100 nm range. In this
work, we present an approach to conveniently fabricate such thin membranes with
up to about one millimeter in size. We use commercially available diamond
plates (thickness 50 $\mu$m) in an inductively coupled reactive ion etching
process which is based on argon, oxygen and SF$_6$. We thus avoid using toxic,
corrosive feed gases and add an alternative to previously presented recipes
involving chlorine-based etching steps. Our membranes are smooth (RMS roughness
<1 nm) and show moderate thickness variation (central part: <1 $\mu$m over
$\approx \,$200x200 $\mu$m$^2$). Due to an improved etch mask geometry, our
membranes stay reliably attached to the diamond plate in our chlorine-based as
well as SF$_6$-based processes. Our results thus open the route towards higher
reliability in diamond device fabrication and up-scaling.
| physics.app-ph cond-mat.mes-hall cond-mat.mtrl-sci quant-ph | many promising applications of single crystal diamond and its color centers as sensor platform and in photonics require freestanding membranes with a thickness ranging from several micrometers to the few 100 nm range in this work we present an approach to conveniently fabricate such thin membranes with up to about one millimeter in size we use commercially available diamond plates thickness 50 mum in an inductively coupled reactive ion etching process which is based on argon oxygen and sf_6 we thus avoid using toxic corrosive feed gases and add an alternative to previously presented recipes involving chlorinebased etching steps our membranes are smooth rms roughness 1 nm and show moderate thickness variation central part 1 mum over approx 200x200 mum2 due to an improved etch mask geometry our membranes stay reliably attached to the diamond plate in our chlorinebased as well as sf_6based processes our results thus open the route towards higher reliability in diamond device fabrication and upscaling | [['many', 'promising', 'applications', 'of', 'single', 'crystal', 'diamond', 'and', 'its', 'color', 'centers', 'as', 'sensor', 'platform', 'and', 'in', 'photonics', 'require', 'freestanding', 'membranes', 'with', 'a', 'thickness', 'ranging', 'from', 'several', 'micrometers', 'to', 'the', 'few', '100', 'nm', 'range', 'in', 'this', 'work', 'we', 'present', 'an', 'approach', 'to', 'conveniently', 'fabricate', 'such', 'thin', 'membranes', 'with', 'up', 'to', 'about', 'one', 'millimeter', 'in', 'size', 'we', 'use', 'commercially', 'available', 'diamond', 'plates', 'thickness', '50', 'mum', 'in', 'an', 'inductively', 'coupled', 'reactive', 'ion', 'etching', 'process', 'which', 'is', 'based', 'on', 'argon', 'oxygen', 'and', 'sf_6', 'we', 'thus', 'avoid', 'using', 'toxic', 'corrosive', 'feed', 'gases', 'and', 'add', 'an', 'alternative', 'to', 'previously', 'presented', 'recipes', 'involving', 'chlorinebased', 'etching', 'steps', 'our', 'membranes', 'are', 'smooth', 'rms', 'roughness', '1', 'nm', 'and', 'show', 'moderate', 'thickness', 'variation', 'central', 'part', '1', 'mum', 'over', 'approx', '200x200', 'mum2', 'due', 'to', 'an', 'improved', 'etch', 'mask', 'geometry', 'our', 'membranes', 'stay', 'reliably', 'attached', 'to', 'the', 'diamond', 'plate', 'in', 'our', 'chlorinebased', 'as', 'well', 'as', 'sf_6based', 'processes', 'our', 'results', 'thus', 'open', 'the', 'route', 'towards', 'higher', 'reliability', 'in', 'diamond', 'device', 'fabrication', 'and', 'upscaling']] | [0.02518421065975811, 0.13295299410085923, 0.014556087618753029, -0.09308420735180137, 0.01074602315498955, -0.2003179250498581, 0.03984491446071785, 0.5066528405822149, -0.24793020240476082, -0.3380997700818405, 0.10505004210403533, -0.30458885828139864, -0.049871828121572113, 0.2236631838486168, -0.09399537801417267, 0.08456123131141956, 0.005674440263930685, -0.12844332379057624, 0.01286630880734201, -0.21020190060067517, 0.18831793933062796, 0.08282893510523495, 0.3194742895185259, 0.10901119817451686, 0.08626347899164079, -0.04351573341057464, 0.06835299509927441, -0.0343758454768782, -0.17539722167228342, 0.13479000029367674, 0.2821457877645423, -0.06794020353525781, 0.22598280570807922, -0.5017835705357182, -0.2355563395840537, -0.025595624186691774, 0.1542063136555397, 0.13488002997974324, -0.08325451345903692, -0.2205328494384529, 0.09198359309867689, -0.14529684928963613, -0.14479069602764716, -0.016303385673150136, 0.0040396362436330244, -0.009384601166365063, -0.2215654826474637, 0.010442520376475776, 0.013386881215480055, 0.09126181711270741, -0.04885856158346246, -0.14973669404617754, -0.004828630370431977, 0.08933871272791201, -0.055851500821158966, 0.041921367216262086, 0.28753670587821323, -0.07316488824980512, -0.08088038404691655, 0.3420820048606842, -0.0452491180870421, -0.13370893225755992, 0.2266766333457225, -0.09941690222799161, -0.0329063815913003, 0.16891223931341035, 0.15791798787522218, 0.14691910026357716, -0.1795037772156488, -0.004586309530463805, 0.04775824792650499, 0.2598636077505295, 0.18916874593954272, 0.045434167635312696, 0.20693376989961768, 0.2757961726895753, 0.06136726193496317, 0.17010703028239396, -0.14463693938206193, 0.011768484571177488, -0.2542682280704664, -0.19483123191893337, -0.14555868524524151, 0.09578662733903309, -0.12125362393355062, -0.18679748523304132, 0.2992654869668067, 0.1704996251412163, 0.17979347529364334, -0.02354929545541312, 0.28569948977559423, -0.018487533337175607, 0.150972046690643, -0.015180081823117034, 0.21339786189881146, 0.15483407930183302, 0.14527641122674667, -0.16205132770971958, 0.0033043648537461924, -0.052215216266121835] |
1,802.08972 | I'll Be Back: On the Multiple Lives of Users of a Mobile Activity
Tracking Application | Mobile health applications that track activities, such as exercise, sleep,
and diet, are becoming widely used. While these activity tracking applications
have the potential to improve our health, user engagement and retention are
critical factors for their success. However, long-term user engagement patterns
in real-world activity tracking applications are not yet well understood. Here
we study user engagement patterns within a mobile physical activity tracking
application consisting of 115 million logged activities taken by over a million
users over 31 months. Specifically, we show that over 75% of users return and
re-engage with the application after prolonged periods of inactivity, no matter
the duration of the inactivity. We find a surprising result that the
re-engagement usage patterns resemble those of the start of the initial
engagement period, rather than being a simple continuation of the end of the
initial engagement period. This evidence points to a conceptual model of
multiple lives of user engagement, extending the prevalent single life view of
user activity. We demonstrate that these multiple lives occur because the users
have a variety of different primary intents or goals for using the app. We find
evidence for users being more likely to stop using the app once they achieved
their primary intent or goal (e.g., weight loss). However, these users might
return once their original intent resurfaces (e.g., wanting to lose newly
gained weight). Based on insights developed in this work, including a marker of
improved primary intent performance, our prediction models achieve 71% ROC AUC.
Overall, our research has implications for modeling user re-engagement in
health activity tracking applications and has consequences for how
notifications, recommendations as well as gamification can be used to increase
engagement.
| cs.CY cs.SI | mobile health applications that track activities such as exercise sleep and diet are becoming widely used while these activity tracking applications have the potential to improve our health user engagement and retention are critical factors for their success however longterm user engagement patterns in realworld activity tracking applications are not yet well understood here we study user engagement patterns within a mobile physical activity tracking application consisting of 115 million logged activities taken by over a million users over 31 months specifically we show that over 75 of users return and reengage with the application after prolonged periods of inactivity no matter the duration of the inactivity we find a surprising result that the reengagement usage patterns resemble those of the start of the initial engagement period rather than being a simple continuation of the end of the initial engagement period this evidence points to a conceptual model of multiple lives of user engagement extending the prevalent single life view of user activity we demonstrate that these multiple lives occur because the users have a variety of different primary intents or goals for using the app we find evidence for users being more likely to stop using the app once they achieved their primary intent or goal eg weight loss however these users might return once their original intent resurfaces eg wanting to lose newly gained weight based on insights developed in this work including a marker of improved primary intent performance our prediction models achieve 71 roc auc overall our research has implications for modeling user reengagement in health activity tracking applications and has consequences for how notifications recommendations as well as gamification can be used to increase engagement | [['mobile', 'health', 'applications', 'that', 'track', 'activities', 'such', 'as', 'exercise', 'sleep', 'and', 'diet', 'are', 'becoming', 'widely', 'used', 'while', 'these', 'activity', 'tracking', 'applications', 'have', 'the', 'potential', 'to', 'improve', 'our', 'health', 'user', 'engagement', 'and', 'retention', 'are', 'critical', 'factors', 'for', 'their', 'success', 'however', 'longterm', 'user', 'engagement', 'patterns', 'in', 'realworld', 'activity', 'tracking', 'applications', 'are', 'not', 'yet', 'well', 'understood', 'here', 'we', 'study', 'user', 'engagement', 'patterns', 'within', 'a', 'mobile', 'physical', 'activity', 'tracking', 'application', 'consisting', 'of', '115', 'million', 'logged', 'activities', 'taken', 'by', 'over', 'a', 'million', 'users', 'over', '31', 'months', 'specifically', 'we', 'show', 'that', 'over', '75', 'of', 'users', 'return', 'and', 'reengage', 'with', 'the', 'application', 'after', 'prolonged', 'periods', 'of', 'inactivity', 'no', 'matter', 'the', 'duration', 'of', 'the', 'inactivity', 'we', 'find', 'a', 'surprising', 'result', 'that', 'the', 'reengagement', 'usage', 'patterns', 'resemble', 'those', 'of', 'the', 'start', 'of', 'the', 'initial', 'engagement', 'period', 'rather', 'than', 'being', 'a', 'simple', 'continuation', 'of', 'the', 'end', 'of', 'the', 'initial', 'engagement', 'period', 'this', 'evidence', 'points', 'to', 'a', 'conceptual', 'model', 'of', 'multiple', 'lives', 'of', 'user', 'engagement', 'extending', 'the', 'prevalent', 'single', 'life', 'view', 'of', 'user', 'activity', 'we', 'demonstrate', 'that', 'these', 'multiple', 'lives', 'occur', 'because', 'the', 'users', 'have', 'a', 'variety', 'of', 'different', 'primary', 'intents', 'or', 'goals', 'for', 'using', 'the', 'app', 'we', 'find', 'evidence', 'for', 'users', 'being', 'more', 'likely', 'to', 'stop', 'using', 'the', 'app', 'once', 'they', 'achieved', 'their', 'primary', 'intent', 'or', 'goal', 'eg', 'weight', 'loss', 'however', 'these', 'users', 'might', 'return', 'once', 'their', 'original', 'intent', 'resurfaces', 'eg', 'wanting', 'to', 'lose', 'newly', 'gained', 'weight', 'based', 'on', 'insights', 'developed', 'in', 'this', 'work', 'including', 'a', 'marker', 'of', 'improved', 'primary', 'intent', 'performance', 'our', 'prediction', 'models', 'achieve', '71', 'roc', 'auc', 'overall', 'our', 'research', 'has', 'implications', 'for', 'modeling', 'user', 'reengagement', 'in', 'health', 'activity', 'tracking', 'applications', 'and', 'has', 'consequences', 'for', 'how', 'notifications', 'recommendations', 'as', 'well', 'as', 'gamification', 'can', 'be', 'used', 'to', 'increase', 'engagement']] | [-0.09267761552598261, 0.07271060021760474, -0.060111883599477424, 0.0966784660662857, -0.11915786519447076, -0.16796242815076506, 0.11680627548401909, 0.42796154425512734, -0.19807845645284813, -0.3750151282642037, 0.11641605514409353, -0.30247575641478763, -0.18841731388155106, 0.21374370038871088, -0.13508653655714756, 0.014267182935561453, 0.0904396937715189, 0.10613687497430614, -0.024840695429124284, -0.3263362530839264, 0.2507478799637673, 0.08227934428474068, 0.2923379576349232, 0.05481302812695503, 0.021043520858178715, 0.029314717962240267, -0.05639756246725613, -0.03424666762917435, -0.05925152392477945, 0.1262362519994245, 0.3378739691411803, 0.2201371462583276, 0.36676308555262427, -0.410633057449013, -0.23293831008320143, 0.07361287753280651, 0.14846230663066048, 0.03509890368357966, -0.08603856524345506, -0.3226430640988318, 0.10463658244781462, -0.24660889894668278, -0.09907410682894156, -0.04267478547657707, 0.02584283323958516, 0.030635679965364815, -0.23528730750757468, 0.021777787756374373, 0.006205620837031997, 0.15062402459693008, -0.08605409938817112, -0.09444308793671163, -0.01173050304226178, 0.26316961923481097, 0.1104231692821486, 0.002283097262261435, 0.20353877866374595, -0.15284689708246982, -0.15217729132231658, 0.3702200540674052, 0.0058708454550339545, -0.11377244701184931, 0.2270110243673636, -0.09323467680868426, -0.11224902296339029, 0.12210362628601225, 0.2588915668041279, 0.07611070019525609, -0.16491315102903173, -0.06244319568005657, 0.007157990649076445, 0.19327989380191346, 0.07132815926784783, 0.033048237705952485, 0.24958832686118382, 0.21079925091450735, 0.031132180709391832, 0.047954215046567175, -0.04783297593655464, -0.07637244532150882, -0.19929929166932459, -0.13949363475382728, -0.10754645281163643, 0.05549233640449529, -0.05556072596872192, -0.0926202759379521, 0.43987006409276674, 0.17884513571625577, 0.16008800834616913, 0.06253887157987005, 0.27654014373297936, 0.031850818406590924, 0.08831730659699782, 0.06868486829584332, 0.18325951120849432, -0.032323776018373405, 0.1915919184031996, -0.15940871711354704, 0.15159626619819652, -0.035450550150043066] |
1,802.08973 | Low-field magnetotransport in graphene cavity devices | Confinement and edge structures are known to play significant roles in
electronic and transport properties of two-dimensional materials. Here, we
report on low-temperature magnetotransport measurements of lithographically
patterned graphene cavity nanodevices. It is found that the evolution of the
low-field magnetoconductance characteristics with varying carrier density
exhibits different behaviors in graphene cavity and bulk graphene devices. In
the graphene cavity devices, we have observed that intravalley scattering
becomes dominant as the Fermi level gets close to the Dirac point. We associate
this enhanced intravalley scattering to the effect of charge inhomogeneities
and edge disorder in the confined graphene nanostructures. We have also
observed that the dephasing rate of carriers in the cavity devices follows a
parabolic temperature dependence, indicating that the direct Coulomb
interaction scattering mechanism governs the dephasing at low temperatures. Our
results demonstrate the importance of confinement in carrier transport in
graphene nanostructure devices.
| cond-mat.mes-hall cond-mat.mtrl-sci | confinement and edge structures are known to play significant roles in electronic and transport properties of twodimensional materials here we report on lowtemperature magnetotransport measurements of lithographically patterned graphene cavity nanodevices it is found that the evolution of the lowfield magnetoconductance characteristics with varying carrier density exhibits different behaviors in graphene cavity and bulk graphene devices in the graphene cavity devices we have observed that intravalley scattering becomes dominant as the fermi level gets close to the dirac point we associate this enhanced intravalley scattering to the effect of charge inhomogeneities and edge disorder in the confined graphene nanostructures we have also observed that the dephasing rate of carriers in the cavity devices follows a parabolic temperature dependence indicating that the direct coulomb interaction scattering mechanism governs the dephasing at low temperatures our results demonstrate the importance of confinement in carrier transport in graphene nanostructure devices | [['confinement', 'and', 'edge', 'structures', 'are', 'known', 'to', 'play', 'significant', 'roles', 'in', 'electronic', 'and', 'transport', 'properties', 'of', 'twodimensional', 'materials', 'here', 'we', 'report', 'on', 'lowtemperature', 'magnetotransport', 'measurements', 'of', 'lithographically', 'patterned', 'graphene', 'cavity', 'nanodevices', 'it', 'is', 'found', 'that', 'the', 'evolution', 'of', 'the', 'lowfield', 'magnetoconductance', 'characteristics', 'with', 'varying', 'carrier', 'density', 'exhibits', 'different', 'behaviors', 'in', 'graphene', 'cavity', 'and', 'bulk', 'graphene', 'devices', 'in', 'the', 'graphene', 'cavity', 'devices', 'we', 'have', 'observed', 'that', 'intravalley', 'scattering', 'becomes', 'dominant', 'as', 'the', 'fermi', 'level', 'gets', 'close', 'to', 'the', 'dirac', 'point', 'we', 'associate', 'this', 'enhanced', 'intravalley', 'scattering', 'to', 'the', 'effect', 'of', 'charge', 'inhomogeneities', 'and', 'edge', 'disorder', 'in', 'the', 'confined', 'graphene', 'nanostructures', 'we', 'have', 'also', 'observed', 'that', 'the', 'dephasing', 'rate', 'of', 'carriers', 'in', 'the', 'cavity', 'devices', 'follows', 'a', 'parabolic', 'temperature', 'dependence', 'indicating', 'that', 'the', 'direct', 'coulomb', 'interaction', 'scattering', 'mechanism', 'governs', 'the', 'dephasing', 'at', 'low', 'temperatures', 'our', 'results', 'demonstrate', 'the', 'importance', 'of', 'confinement', 'in', 'carrier', 'transport', 'in', 'graphene', 'nanostructure', 'devices']] | [-0.22556874952087663, 0.2243419726513173, -0.059399216681438154, -0.014123816846882643, 0.015563381270486351, -0.16946482027829815, 0.0669508073893567, 0.4419380695342201, -0.2705131096267843, -0.26690578721989944, -0.052205112561015794, -0.3464703779948288, -0.1866584538166373, 0.1933760274750219, 0.02667207106125018, 0.02244173881776427, 0.006742084915558361, -0.10900411913562119, -0.03558043363720995, -0.17629269715908863, 0.2828616932487396, 0.0494838731254974, 0.3723079252139703, 0.17218039104434318, 0.019496680189510934, -0.004121683646401722, 0.11232893603649756, -0.0067592591098318364, -0.14046994602560442, 0.03574656372354047, 0.2554164211371792, -0.20563876850543264, 0.19320260912294768, -0.5036138731743885, -0.24827196614095967, -0.046580163279567426, 0.18279517169289086, 0.16565793614247687, -0.12202321891816435, -0.24736110291328944, 0.039210361192912484, -0.11427965160931321, -0.12037851139847253, -0.03334747398733034, 0.0157322856096857, -0.015481074560714299, -0.19619362411322072, 0.1097768848783445, 0.037167369211028804, 0.036001017945499654, -0.10188169054860849, -0.0947807690460388, -0.08396005650108349, 0.087737902734199, 0.03485611232144324, -0.034013242046755404, 0.29320081578542107, -0.1604588708799645, -0.11473954676121013, 0.36347515286546045, -0.06818236707875582, -0.10457279445756584, 0.18676713478993878, -0.24420006358230564, -0.021517929267010665, 0.16790836660688974, 0.14367573715631582, 0.06633490424807349, -0.14139300430423185, 0.07749209184321569, -0.009271949252962097, 0.13030693472832702, 0.06909365070906423, 0.1878216796975634, 0.2582326941766253, 0.22813485179428164, 0.029015486469900566, 0.12702042998407956, -0.15429121778148852, -0.00708448510355482, -0.20494249703885656, -0.16270931759109236, -0.2292324449382212, 0.10169504324874477, -0.07169056540432431, -0.21171578054303583, 0.40784261275775735, 0.1884378013615688, 0.1758506401674822, -0.07369346696921714, 0.2436320565334738, 0.15040370231503875, 0.1068776954820201, 0.017639666443893188, 0.2703976855064704, 0.1822407208000348, 0.12790684481884979, -0.3398856558065147, 0.06281069244341032, -0.05541269154102886] |
1,802.08974 | A Framework in CRM Customer Lifecycle: Identify Downward Trend and
Potential Issues Detection | Customer retention is one of the primary goals in the area of customer
relationship management. A mass of work exists in which machine learning models
or business rules are established to predict churn. However, targeting users at
an early stage when they start to show a downward trend is a better strategy.
In downward trend prediction, the reasons why customers show a downward trend
is of great interest in the industry as it helps the business to understand the
pain points that customers suffer and to take early action to prevent them from
churning. A commonly used method is to collect feedback from customers by
either aggressively reaching out to them or by passively hearing from them.
However, it is believed that there are a large number of customers who have
unpleasant experiences and never speak out. In the literature, there is limited
research work that provides a comprehensive and scientific approach to identify
these "silent suffers". In this study, we propose a novel two-part framework:
developing the downward prediction process and establishing the methodology to
identify the reasons why customers are in the downward trend. In the first
prediction part, we focus on predicting the downward trend, which is an earlier
stage of the customer lifecycle compared to churn. In the second part, we
propose an approach to figuring out the cause (of the downward trend) based on
a causal inference method and semi-supervised learning. The proposed approach
is capable of identifying potential silent sufferers. We take bad shopping
experiences as inputs to develop the framework and validate it via a marketing
A/B test in the real world. The test readout demonstrates the effectiveness of
the framework by driving 88.5% incremental lift in purchase volume.
| cs.CY cs.AI | customer retention is one of the primary goals in the area of customer relationship management a mass of work exists in which machine learning models or business rules are established to predict churn however targeting users at an early stage when they start to show a downward trend is a better strategy in downward trend prediction the reasons why customers show a downward trend is of great interest in the industry as it helps the business to understand the pain points that customers suffer and to take early action to prevent them from churning a commonly used method is to collect feedback from customers by either aggressively reaching out to them or by passively hearing from them however it is believed that there are a large number of customers who have unpleasant experiences and never speak out in the literature there is limited research work that provides a comprehensive and scientific approach to identify these silent suffers in this study we propose a novel twopart framework developing the downward prediction process and establishing the methodology to identify the reasons why customers are in the downward trend in the first prediction part we focus on predicting the downward trend which is an earlier stage of the customer lifecycle compared to churn in the second part we propose an approach to figuring out the cause of the downward trend based on a causal inference method and semisupervised learning the proposed approach is capable of identifying potential silent sufferers we take bad shopping experiences as inputs to develop the framework and validate it via a marketing ab test in the real world the test readout demonstrates the effectiveness of the framework by driving 885 incremental lift in purchase volume | [['customer', 'retention', 'is', 'one', 'of', 'the', 'primary', 'goals', 'in', 'the', 'area', 'of', 'customer', 'relationship', 'management', 'a', 'mass', 'of', 'work', 'exists', 'in', 'which', 'machine', 'learning', 'models', 'or', 'business', 'rules', 'are', 'established', 'to', 'predict', 'churn', 'however', 'targeting', 'users', 'at', 'an', 'early', 'stage', 'when', 'they', 'start', 'to', 'show', 'a', 'downward', 'trend', 'is', 'a', 'better', 'strategy', 'in', 'downward', 'trend', 'prediction', 'the', 'reasons', 'why', 'customers', 'show', 'a', 'downward', 'trend', 'is', 'of', 'great', 'interest', 'in', 'the', 'industry', 'as', 'it', 'helps', 'the', 'business', 'to', 'understand', 'the', 'pain', 'points', 'that', 'customers', 'suffer', 'and', 'to', 'take', 'early', 'action', 'to', 'prevent', 'them', 'from', 'churning', 'a', 'commonly', 'used', 'method', 'is', 'to', 'collect', 'feedback', 'from', 'customers', 'by', 'either', 'aggressively', 'reaching', 'out', 'to', 'them', 'or', 'by', 'passively', 'hearing', 'from', 'them', 'however', 'it', 'is', 'believed', 'that', 'there', 'are', 'a', 'large', 'number', 'of', 'customers', 'who', 'have', 'unpleasant', 'experiences', 'and', 'never', 'speak', 'out', 'in', 'the', 'literature', 'there', 'is', 'limited', 'research', 'work', 'that', 'provides', 'a', 'comprehensive', 'and', 'scientific', 'approach', 'to', 'identify', 'these', 'silent', 'suffers', 'in', 'this', 'study', 'we', 'propose', 'a', 'novel', 'twopart', 'framework', 'developing', 'the', 'downward', 'prediction', 'process', 'and', 'establishing', 'the', 'methodology', 'to', 'identify', 'the', 'reasons', 'why', 'customers', 'are', 'in', 'the', 'downward', 'trend', 'in', 'the', 'first', 'prediction', 'part', 'we', 'focus', 'on', 'predicting', 'the', 'downward', 'trend', 'which', 'is', 'an', 'earlier', 'stage', 'of', 'the', 'customer', 'lifecycle', 'compared', 'to', 'churn', 'in', 'the', 'second', 'part', 'we', 'propose', 'an', 'approach', 'to', 'figuring', 'out', 'the', 'cause', 'of', 'the', 'downward', 'trend', 'based', 'on', 'a', 'causal', 'inference', 'method', 'and', 'semisupervised', 'learning', 'the', 'proposed', 'approach', 'is', 'capable', 'of', 'identifying', 'potential', 'silent', 'sufferers', 'we', 'take', 'bad', 'shopping', 'experiences', 'as', 'inputs', 'to', 'develop', 'the', 'framework', 'and', 'validate', 'it', 'via', 'a', 'marketing', 'ab', 'test', 'in', 'the', 'real', 'world', 'the', 'test', 'readout', 'demonstrates', 'the', 'effectiveness', 'of', 'the', 'framework', 'by', 'driving', '885', 'incremental', 'lift', 'in', 'purchase', 'volume']] | [-0.06379784897647121, 0.06281579961613352, -0.08293598374902186, 0.07831690623896231, -0.12185606215201267, -0.151313409590247, 0.13095865515223543, 0.41056527991915914, -0.24618190189927713, -0.3180375171033991, 0.09743813188889852, -0.3012190553362944, -0.16934840741137472, 0.16765714996295714, -0.1409922220021278, 0.011927172535105602, 0.06953289900284416, 0.0560865301292445, 0.01104628125171444, -0.2668124107030136, 0.285976641615234, 0.05452167847311007, 0.336524547509083, 0.04361089901433658, 0.05703391054469337, -0.03612570176096438, -0.07358985926015253, -0.01943401174849368, -0.06633898008195419, 0.11316243881798085, 0.32941336589564424, 0.19561320822685957, 0.40912731693914306, -0.41752679455924413, -0.1878899124620313, 0.10309729084227612, 0.11667299971726912, 0.08484207107595956, -0.055671125325582715, -0.2601501063555251, 0.10231454225690137, -0.21259670369929498, -0.10655674398095197, -0.07910745729565281, 0.01577655989937224, -0.02085279554533124, -0.24545636502179233, 0.012465870395380925, 0.07808801970425082, 0.05569484892099366, -0.05180348161295776, -0.07536422400417822, 0.010059686437887433, 0.19021304539484998, 0.1372255391747181, 0.03713558256297236, 0.13902952470914362, -0.1377353147575892, -0.11546190069350121, 0.4120623500158007, -0.033256059313857264, -0.12469183730524867, 0.1701294027246092, -0.09295204264451497, -0.1353063331819237, 0.09781999898328726, 0.21365194825982264, 0.07509882746366507, -0.1865930140999547, -0.010760647539453176, 0.015214783217679788, 0.14362630954784036, 0.028420527286541004, -0.07847317256573978, 0.24159870114034185, 0.2251939614347371, 0.0792936488206114, 0.1060559973798422, -0.044713888059584324, -0.11709335293471032, -0.23185290829962366, -0.1546370443070659, -0.12443530498971264, 0.022219496797867954, -0.03471721307233292, -0.14990840679265793, 0.3610631095829999, 0.2176873443780102, 0.1869711924241115, 0.06890405683657741, 0.3346043396354458, 0.08337032323185406, 0.09646139567973536, 0.090865450064567, 0.22588973117249828, 0.008715727404769431, 0.17142384575510566, -0.17065470535285734, 0.1428594624402223, 0.01897710669375435] |
1,802.08975 | Self-similar solutions of decaying Keller-Segel systems for several
populations | It is known that solutions of the parabolic elliptic Keller-Segel equations
in the two dimensional plane decay, as time goes to infinity, provided the
initial data admits sub-critical mass and finite second moments, while such
solution concentrate, as $t\rightarrow\infty$, in the critical mass. In the
sub-critical case this decay can be resolved by a steady, self-similar
solution, while no such self similar solution is known to exist for the
concentration in the critical case. This paper is motivated by the Keller-Segel
system of several interacting populations, under the existence of an additional
drift for each component which decays in time at the rate $O(1/\sqrt{t})$. We
show that self-similar solutions always exists in the sub-critical case, while
the existence of such self-similar solution in the critical case depends on the
gap between the decaying drifts for each of the components. For this, we study
the conditions for existence/non existence of solutions for the corresponding
Liouville's systems, which, in turn, is related to the existence/non existence
of minimizers to a corresponding Free Energy functional.
| math.AP | it is known that solutions of the parabolic elliptic kellersegel equations in the two dimensional plane decay as time goes to infinity provided the initial data admits subcritical mass and finite second moments while such solution concentrate as trightarrowinfty in the critical mass in the subcritical case this decay can be resolved by a steady selfsimilar solution while no such self similar solution is known to exist for the concentration in the critical case this paper is motivated by the kellersegel system of several interacting populations under the existence of an additional drift for each component which decays in time at the rate o1sqrtt we show that selfsimilar solutions always exists in the subcritical case while the existence of such selfsimilar solution in the critical case depends on the gap between the decaying drifts for each of the components for this we study the conditions for existencenon existence of solutions for the corresponding liouvilles systems which in turn is related to the existencenon existence of minimizers to a corresponding free energy functional | [['it', 'is', 'known', 'that', 'solutions', 'of', 'the', 'parabolic', 'elliptic', 'kellersegel', 'equations', 'in', 'the', 'two', 'dimensional', 'plane', 'decay', 'as', 'time', 'goes', 'to', 'infinity', 'provided', 'the', 'initial', 'data', 'admits', 'subcritical', 'mass', 'and', 'finite', 'second', 'moments', 'while', 'such', 'solution', 'concentrate', 'as', 'trightarrowinfty', 'in', 'the', 'critical', 'mass', 'in', 'the', 'subcritical', 'case', 'this', 'decay', 'can', 'be', 'resolved', 'by', 'a', 'steady', 'selfsimilar', 'solution', 'while', 'no', 'such', 'self', 'similar', 'solution', 'is', 'known', 'to', 'exist', 'for', 'the', 'concentration', 'in', 'the', 'critical', 'case', 'this', 'paper', 'is', 'motivated', 'by', 'the', 'kellersegel', 'system', 'of', 'several', 'interacting', 'populations', 'under', 'the', 'existence', 'of', 'an', 'additional', 'drift', 'for', 'each', 'component', 'which', 'decays', 'in', 'time', 'at', 'the', 'rate', 'o1sqrtt', 'we', 'show', 'that', 'selfsimilar', 'solutions', 'always', 'exists', 'in', 'the', 'subcritical', 'case', 'while', 'the', 'existence', 'of', 'such', 'selfsimilar', 'solution', 'in', 'the', 'critical', 'case', 'depends', 'on', 'the', 'gap', 'between', 'the', 'decaying', 'drifts', 'for', 'each', 'of', 'the', 'components', 'for', 'this', 'we', 'study', 'the', 'conditions', 'for', 'existencenon', 'existence', 'of', 'solutions', 'for', 'the', 'corresponding', 'liouvilles', 'systems', 'which', 'in', 'turn', 'is', 'related', 'to', 'the', 'existencenon', 'existence', 'of', 'minimizers', 'to', 'a', 'corresponding', 'free', 'energy', 'functional']] | [-0.15157415442233688, 0.10648529725509688, -0.060514620914080636, 0.07620551530068718, -0.022359603283612795, -0.11885520069708311, 0.002116532060913308, 0.2722393509628641, -0.2743620814777218, -0.2178651814912121, 0.15110415213492287, -0.30278698709755486, -0.08699387948158695, 0.18728225475053986, 0.0009049164093381097, 0.08288159265404914, 0.03676787315499644, 0.07533553262040842, -0.037379522612968154, -0.20803391463854243, 0.37453663410878807, -0.022124022490420746, 0.24562518088266166, 0.04341333946801971, 0.07915712492019317, -0.03399987477635921, 0.05744435646582048, 0.014669091259345932, -0.1842604175804428, 0.02861462501662805, 0.21008420196838332, 0.07882212868207716, 0.28398691511951213, -0.3735896328594102, -0.19721557228652717, 0.1635215840028967, 0.1952831145473431, 0.09129966879371813, -0.07986951015922132, -0.24108459654827277, 0.10093356298585963, -0.1053798105919647, -0.2216437802281837, -0.024581661338235663, 0.05144523439162714, 0.08647777861678638, -0.29136851731806906, 0.14303356972198153, 0.09434484089941306, -0.010611106825689243, -0.1522700272427417, -0.059178364004934376, -0.03824676809762063, 0.11754549139579974, 0.12375493404634166, 0.01361094396371871, 0.05654693356184506, -0.1468040175706931, -0.06339911881531048, 0.34980394461647024, -0.0966151979207711, -0.24474343436575213, 0.21567260313692482, -0.1620057335077395, -0.1415556638100899, 0.15787167113739997, 0.14999432846914632, 0.1313823196268099, -0.13580480247172852, 0.12466483192246267, -0.06688890976528096, 0.15636407438838898, 0.09388696254220207, -0.008469790373224938, 0.14786733651999384, 0.17737110434533204, 0.16569219903067278, 0.13613548036597042, -0.02903293154465013, -0.12889364664442837, -0.34716119886874114, -0.1658123781049061, -0.1472313316372429, 0.09281618822214388, -0.08875745588222851, -0.18701897858273844, 0.3893800931590133, 0.1132250794850501, 0.20259124246225585, 0.06729300984934103, 0.23417113321971386, 0.18311142571795688, 0.019789726083535096, 0.09837898352846021, 0.25341454896057936, 0.09915543661106291, 0.11953582967561129, -0.22931648138758245, 0.051687440683328825, 0.08987049403638298] |
1,802.08976 | Reinforcement Learning for Dynamic Bidding in Truckload Markets: an
Application to Large-Scale Fleet Management with Advance Commitments | Truckload brokerages, a $100 billion/year industry in the U.S., plays the
critical role of matching shippers with carriers, often to move loads several
days into the future. Brokerages not only have to find companies that will
agree to move a load, the brokerage often has to find a price that both the
shipper and carrier will agree to. The price not only varies by shipper and
carrier, but also by the traffic lanes and other variables such as commodity
type. Brokerages have to learn about shipper and carrier response functions by
offering a price and observing whether each accepts the quote. We propose a
knowledge gradient policy with bootstrap aggregation for high-dimensional
contextual settings to guide price experimentation by maximizing the value of
information. The learning policy is tested using a carefully calibrated fleet
simulator that includes a stochastic lookahead policy that simulates fleet
movements, as well as the stochastic modeling of driver assignments and the
carrier's load commitment policies with advance booking.
| stat.ML cs.LG | truckload brokerages a 100 billionyear industry in the us plays the critical role of matching shippers with carriers often to move loads several days into the future brokerages not only have to find companies that will agree to move a load the brokerage often has to find a price that both the shipper and carrier will agree to the price not only varies by shipper and carrier but also by the traffic lanes and other variables such as commodity type brokerages have to learn about shipper and carrier response functions by offering a price and observing whether each accepts the quote we propose a knowledge gradient policy with bootstrap aggregation for highdimensional contextual settings to guide price experimentation by maximizing the value of information the learning policy is tested using a carefully calibrated fleet simulator that includes a stochastic lookahead policy that simulates fleet movements as well as the stochastic modeling of driver assignments and the carriers load commitment policies with advance booking | [['truckload', 'brokerages', 'a', '100', 'billionyear', 'industry', 'in', 'the', 'us', 'plays', 'the', 'critical', 'role', 'of', 'matching', 'shippers', 'with', 'carriers', 'often', 'to', 'move', 'loads', 'several', 'days', 'into', 'the', 'future', 'brokerages', 'not', 'only', 'have', 'to', 'find', 'companies', 'that', 'will', 'agree', 'to', 'move', 'a', 'load', 'the', 'brokerage', 'often', 'has', 'to', 'find', 'a', 'price', 'that', 'both', 'the', 'shipper', 'and', 'carrier', 'will', 'agree', 'to', 'the', 'price', 'not', 'only', 'varies', 'by', 'shipper', 'and', 'carrier', 'but', 'also', 'by', 'the', 'traffic', 'lanes', 'and', 'other', 'variables', 'such', 'as', 'commodity', 'type', 'brokerages', 'have', 'to', 'learn', 'about', 'shipper', 'and', 'carrier', 'response', 'functions', 'by', 'offering', 'a', 'price', 'and', 'observing', 'whether', 'each', 'accepts', 'the', 'quote', 'we', 'propose', 'a', 'knowledge', 'gradient', 'policy', 'with', 'bootstrap', 'aggregation', 'for', 'highdimensional', 'contextual', 'settings', 'to', 'guide', 'price', 'experimentation', 'by', 'maximizing', 'the', 'value', 'of', 'information', 'the', 'learning', 'policy', 'is', 'tested', 'using', 'a', 'carefully', 'calibrated', 'fleet', 'simulator', 'that', 'includes', 'a', 'stochastic', 'lookahead', 'policy', 'that', 'simulates', 'fleet', 'movements', 'as', 'well', 'as', 'the', 'stochastic', 'modeling', 'of', 'driver', 'assignments', 'and', 'the', 'carriers', 'load', 'commitment', 'policies', 'with', 'advance', 'booking']] | [-0.08025613071842362, 0.08895338064360415, -0.08319283666389977, 0.07836922636813837, -0.12423799358169485, -0.19577365655955276, 0.1463612600877557, 0.4346833238436013, -0.2617153266201849, -0.3251717968378216, 0.1350176731198274, -0.2792347242205363, -0.10577343832932828, 0.19212544202712012, -0.1313003810810978, 0.02281756304430064, 0.036816943020368954, 0.020443483529126515, 0.02895220486385844, -0.24966257622014293, 0.24104504370541305, 0.08409128505635359, 0.29013921479804455, 0.0227991992865128, 0.11511151419998789, 0.0147381068513908, -0.013682228275892898, 0.016379055488993478, -0.08716490356069383, 0.09832188269623804, 0.31238659202144337, 0.14854793889181955, 0.3677080160596911, -0.43400809867018314, -0.22613327350519505, 0.08614615241054052, 0.08197003249505604, 0.04891828188429708, -0.027432705430452776, -0.2500361411583535, 0.05982147409835171, -0.2080615676595303, -0.06435572447671746, -0.09835282305070425, 0.007945922165762008, 0.07325215262840994, -0.30087874509880075, -0.0056941116401153435, -0.002626534284566824, 0.02896130779144927, -0.04858353208195164, -0.10194281998281338, -0.0642252430755982, 0.19621808489102013, 0.08504097262666394, 0.02425719409391446, 0.21625155710863955, -0.13591998197161448, -0.17025276248325935, 0.3797610776082422, -0.03906671213917434, -0.1730488843648978, 0.12794295012493914, -0.10587920789875854, -0.08848608560680835, 0.09511543881518315, 0.21024487346052106, 0.053366585304202824, -0.17873520954217045, 0.0041814599502889545, -0.04630461341545263, 0.19252440470172474, 0.06356712033312699, -0.0010891171021861319, 0.19848996575962266, 0.19011893055997559, 0.13085044304672513, 0.06612179901556442, -0.07533966374340588, -0.14441991309123403, -0.22431427279056299, -0.13115452907933212, -0.14438192353161597, 0.03213993357859627, -0.08895353858611511, -0.12884962671374547, 0.3640912137202548, 0.19293595295434135, 0.1752531212285994, 0.09153271407779792, 0.2984040834541832, 0.099221756602623, 0.08051199723983773, 0.13993293603430995, 0.170686434190836, -0.013680932077330461, 0.18633779308394247, -0.1904461404586338, 0.17035215028116238, 0.0009052296030271497] |
1,802.08977 | Cylindric Reverse Plane Partitions and 2D TQFT | The ring of symmetric functions carries the structure of a Hopf algebra. When
computing the coproduct of complete symmetric functions $h_\lambda$ one arrives
at weighted sums over reverse plane partitions (RPP) involving binomial
coefficients. Employing the action of the extended affine symmetric group at
fixed level $n$ we generalise these weighted sums to cylindric RPP and define
cylindric complete symmetric functions. The latter are shown to be
$h$-positive, that is, their expansions coefficients in the basis of complete
symmetric functions are non-negative integers. We state an explicit formula in
terms of tensor multiplicities for irreducible representations of the
generalised symmetric group. Moreover, we relate the cylindric complete
symmetric functions to a 2D topological quantum field theory (TQFT) that is a
generalisation of the celebrated $\mathfrak{\widehat{sl}}_n$-Verlinde algebra
or Wess-Zumino-Witten fusion ring, which plays a prominent role in the context
of vertex operator algebras and algebraic geometry.
| math.CO math-ph math.MP math.RT | the ring of symmetric functions carries the structure of a hopf algebra when computing the coproduct of complete symmetric functions h_lambda one arrives at weighted sums over reverse plane partitions rpp involving binomial coefficients employing the action of the extended affine symmetric group at fixed level n we generalise these weighted sums to cylindric rpp and define cylindric complete symmetric functions the latter are shown to be hpositive that is their expansions coefficients in the basis of complete symmetric functions are nonnegative integers we state an explicit formula in terms of tensor multiplicities for irreducible representations of the generalised symmetric group moreover we relate the cylindric complete symmetric functions to a 2d topological quantum field theory tqft that is a generalisation of the celebrated mathfrakwidehatsl_nverlinde algebra or wesszuminowitten fusion ring which plays a prominent role in the context of vertex operator algebras and algebraic geometry | [['the', 'ring', 'of', 'symmetric', 'functions', 'carries', 'the', 'structure', 'of', 'a', 'hopf', 'algebra', 'when', 'computing', 'the', 'coproduct', 'of', 'complete', 'symmetric', 'functions', 'h_lambda', 'one', 'arrives', 'at', 'weighted', 'sums', 'over', 'reverse', 'plane', 'partitions', 'rpp', 'involving', 'binomial', 'coefficients', 'employing', 'the', 'action', 'of', 'the', 'extended', 'affine', 'symmetric', 'group', 'at', 'fixed', 'level', 'n', 'we', 'generalise', 'these', 'weighted', 'sums', 'to', 'cylindric', 'rpp', 'and', 'define', 'cylindric', 'complete', 'symmetric', 'functions', 'the', 'latter', 'are', 'shown', 'to', 'be', 'hpositive', 'that', 'is', 'their', 'expansions', 'coefficients', 'in', 'the', 'basis', 'of', 'complete', 'symmetric', 'functions', 'are', 'nonnegative', 'integers', 'we', 'state', 'an', 'explicit', 'formula', 'in', 'terms', 'of', 'tensor', 'multiplicities', 'for', 'irreducible', 'representations', 'of', 'the', 'generalised', 'symmetric', 'group', 'moreover', 'we', 'relate', 'the', 'cylindric', 'complete', 'symmetric', 'functions', 'to', 'a', '2d', 'topological', 'quantum', 'field', 'theory', 'tqft', 'that', 'is', 'a', 'generalisation', 'of', 'the', 'celebrated', 'mathfrakwidehatsl_nverlinde', 'algebra', 'or', 'wesszuminowitten', 'fusion', 'ring', 'which', 'plays', 'a', 'prominent', 'role', 'in', 'the', 'context', 'of', 'vertex', 'operator', 'algebras', 'and', 'algebraic', 'geometry']] | [-0.16828001641189694, 0.10177685696579974, -0.0958802459820115, 0.07872883227354215, -0.13798100059246318, -0.12591049952393438, -0.05614618788606819, 0.33242421956745893, -0.32326417404611213, -0.1310673282071427, 0.07457651486180697, -0.25342830914964937, -0.17766796970427348, 0.13995636276936588, -0.0505753525995187, -0.029853733022000405, 0.011805364534818938, 0.11261612824262023, -0.15648410167102214, -0.258733163735914, 0.39166883460955915, 0.005240119698170859, 0.25451400741882674, 0.03862843315696696, 0.10918084566540026, 0.08787717360521217, -0.04499793715996446, -0.0022680736391095225, -0.12054680989555758, 0.11699261645203574, 0.30189013194579345, 0.06572755130489806, 0.18592706512842144, -0.4089241928153938, -0.1008905179886525, 0.17222922196338228, 0.13272821823773268, 0.033280507474974894, -0.00432454671880061, -0.2523380596210229, 0.09338760516000585, -0.23616867921464926, -0.17723391042253772, -0.060321421789044476, 0.06887942277158812, 0.01599998534429115, -0.30132104734396825, 0.05086409598392798, 0.10150783454634614, 0.09070578210993663, -0.04557326942734368, -0.1420234088888522, -0.04131707380415051, 0.09190761791220606, -0.0952097526946841, 0.027356355706062103, 0.08880463494248428, -0.11484699732773787, -0.18055515937585306, 0.3316604474077483, -0.018570165799513875, -0.28366432816988524, 0.06990065453720598, -0.19576917952773246, -0.15562644963628136, 0.1170886297501832, 0.09575357533652674, 0.16193017237689478, -0.03018893644148956, 0.18201536902021356, -0.1443836846701488, 0.03602283304700485, 0.12995384335908647, 0.03293926238857366, 0.18665956351515298, 0.004925315800754653, 0.059670534128586965, 0.22317815163592852, 0.07301585728927822, -0.1451475547261901, -0.36377419836141844, -0.1509587361169588, -0.14058653080357253, 0.10762934897166605, -0.15208005377598646, -0.2293872346243108, 0.41682460562527907, 0.02208104106199511, 0.14357887657556254, 0.08540713594383006, 0.2180555650681075, 0.1618613556313973, 0.09912918935105745, 0.033101404646258485, 0.07684753762258516, 0.2704695039852099, -0.008977013460191136, -0.12729296423299433, -0.022600991381136897, 0.24223676242807007] |
1,802.08978 | Spatial-resolved X-ray photoelectron spectroscopy of Weyl semimetal NbAs | We utilized X-ray photoemission electron microscopy (XPEEM) and X-ray
photoelectron spectroscopy (XPS) to investigate the crystal surface of Weyl
semimetal NbAs. XPEEM images present white and black contrast in both the Nb 3d
and As 3d core level spectra. Surface-sensitive XPS spectra indicate that the
entire surface of the sample contains both surface states of Nb 3d and As 3d,
in form of oxides, and bulk states of NbAs. Estimated atomic percentage values
nNb/nAs suggest that the surface is Nb-rich and asymmetric for white and black
areas.
| cond-mat.mtrl-sci | we utilized xray photoemission electron microscopy xpeem and xray photoelectron spectroscopy xps to investigate the crystal surface of weyl semimetal nbas xpeem images present white and black contrast in both the nb 3d and as 3d core level spectra surfacesensitive xps spectra indicate that the entire surface of the sample contains both surface states of nb 3d and as 3d in form of oxides and bulk states of nbas estimated atomic percentage values nnbnas suggest that the surface is nbrich and asymmetric for white and black areas | [['we', 'utilized', 'xray', 'photoemission', 'electron', 'microscopy', 'xpeem', 'and', 'xray', 'photoelectron', 'spectroscopy', 'xps', 'to', 'investigate', 'the', 'crystal', 'surface', 'of', 'weyl', 'semimetal', 'nbas', 'xpeem', 'images', 'present', 'white', 'and', 'black', 'contrast', 'in', 'both', 'the', 'nb', '3d', 'and', 'as', '3d', 'core', 'level', 'spectra', 'surfacesensitive', 'xps', 'spectra', 'indicate', 'that', 'the', 'entire', 'surface', 'of', 'the', 'sample', 'contains', 'both', 'surface', 'states', 'of', 'nb', '3d', 'and', 'as', '3d', 'in', 'form', 'of', 'oxides', 'and', 'bulk', 'states', 'of', 'nbas', 'estimated', 'atomic', 'percentage', 'values', 'nnbnas', 'suggest', 'that', 'the', 'surface', 'is', 'nbrich', 'and', 'asymmetric', 'for', 'white', 'and', 'black', 'areas']] | [-0.03341077564305864, 0.12573215908162447, -0.0438062998785659, 0.055780244044970374, -0.0014197268025126569, -0.14294049331138647, 0.12282095770121465, 0.44106647801087345, -0.2038869867209605, -0.3516186039981454, -0.00669801946415371, -0.43471020241376274, -0.1457940222787519, 0.2071910930775799, -0.011773564939408801, 0.07337770596851168, 0.026429391506691137, -0.12276099481062185, -0.1397678314242512, -0.16133264376413683, 0.33586456346173965, 0.06466404233820909, 0.3237510682300253, 0.0456536118655877, 0.03763122112371114, 0.04545704204437518, 0.05490677050033281, 0.04724482298648624, -0.10537730916054665, 0.0982665964903115, 0.2757000551060882, -0.03923243844101942, 0.11060633183305346, -0.47030882913100486, -0.27616044557057756, -0.08121041548005196, 0.11260058178544738, 0.06890893173079159, -0.14468378812984325, -0.26419605518323047, 0.08489262479083981, -0.10784722186711639, -0.10677929938402633, -0.10177196468616467, -0.03080651452521209, -0.025361300402775754, -0.16974302638473726, 0.11861460939656164, -0.011247398759519984, 0.100564572884333, -0.21339211781877418, -0.1169235969021873, -0.17139774415273826, 0.08566250733294806, -0.010423138567116545, 0.030059246013690935, 0.1750891816607395, -0.12573818068343573, -0.08650093157180087, 0.34992712037773194, -0.045629774047018484, -0.017489287593445285, 0.17191579182047484, -0.2676233199403383, -0.04840388864992091, 0.1813585631830921, 0.09624922950142929, 0.15054208708407227, -0.0924518017729793, 0.06812745423481237, -0.042502675359787113, 0.23151422751157782, 0.09098059907122406, 0.08484812686219811, 0.2693504400248098, 0.12380200888972383, -0.03687463581648677, 0.11492117709848423, -0.3123104950348132, 0.09633342470692167, -0.1818695626286573, -0.25962695290962623, -0.2158659074433841, 0.060311823725960285, -0.02630307143814672, -0.25292743026105646, 0.36470410702912526, 0.05439873531374127, 0.19897475368668174, -0.09869617816645565, 0.2549314122582071, 0.03786689610231321, 0.025021876847414776, 0.013093894737404447, 0.21920704388406215, 0.18757296140240723, 0.11241249902563732, -0.2798737876691184, 0.04010911125332377, 0.011527248853167821] |
1,802.08979 | NL2Bash: A Corpus and Semantic Parser for Natural Language Interface to
the Linux Operating System | We present new data and semantic parsing methods for the problem of mapping
English sentences to Bash commands (NL2Bash). Our long-term goal is to enable
any user to perform operations such as file manipulation, search, and
application-specific scripting by simply stating their goals in English. We
take a first step in this domain, by providing a new dataset of challenging but
commonly used Bash commands and expert-written English descriptions, along with
baseline methods to establish performance levels on this task.
| cs.CL cs.SE | we present new data and semantic parsing methods for the problem of mapping english sentences to bash commands nl2bash our longterm goal is to enable any user to perform operations such as file manipulation search and applicationspecific scripting by simply stating their goals in english we take a first step in this domain by providing a new dataset of challenging but commonly used bash commands and expertwritten english descriptions along with baseline methods to establish performance levels on this task | [['we', 'present', 'new', 'data', 'and', 'semantic', 'parsing', 'methods', 'for', 'the', 'problem', 'of', 'mapping', 'english', 'sentences', 'to', 'bash', 'commands', 'nl2bash', 'our', 'longterm', 'goal', 'is', 'to', 'enable', 'any', 'user', 'to', 'perform', 'operations', 'such', 'as', 'file', 'manipulation', 'search', 'and', 'applicationspecific', 'scripting', 'by', 'simply', 'stating', 'their', 'goals', 'in', 'english', 'we', 'take', 'a', 'first', 'step', 'in', 'this', 'domain', 'by', 'providing', 'a', 'new', 'dataset', 'of', 'challenging', 'but', 'commonly', 'used', 'bash', 'commands', 'and', 'expertwritten', 'english', 'descriptions', 'along', 'with', 'baseline', 'methods', 'to', 'establish', 'performance', 'levels', 'on', 'this', 'task']] | [-0.07163609691764204, -0.05350214355171491, -0.06919707169230932, 0.07122840036978371, -0.1903912310178081, -0.1697629950940609, 0.12346384917588857, 0.4579822842318278, -0.27920213422905177, -0.3913718782699643, 0.06220115946593861, -0.254497979931796, -0.0838553220935118, 0.23447055393794122, -0.14694708219777125, 0.07785819042235231, 0.1571589015507832, 0.017793104040603608, -0.01803389272819727, -0.26548753607158476, 0.2650975289468009, 0.026163951613200016, 0.30018596592335367, 0.031172722291487914, 0.11863693342550108, -0.012167782158566972, -0.05788520161802761, -0.06946224218998583, -0.06511196359478606, 0.1683867418950495, 0.4159844998174753, 0.2566426559769286, 0.3032221417778578, -0.43493021401361776, -0.11917361573208697, 0.007850479227132522, 0.09844000255300973, 0.12917440723723325, -0.010234511143957766, -0.3901946359576705, 0.08018063410268858, -0.18509075956610152, 0.036951673443978414, -0.15160688748941398, 0.00834681151004938, -0.0023838359361084607, -0.23371102625074294, -0.017986142721313696, 0.1258003291907535, 0.1188966234644445, -0.017726334014859717, -0.0857396505964108, 0.06482827193581332, 0.2281702717181104, 0.038532664325127065, 0.08961712782127926, 0.10926748347134353, -0.13598487853932267, -0.19740174636722374, 0.44150734454011303, -0.06373254193040805, -0.24858588870698348, 0.1956890327975345, -0.01585719465182569, -0.1848479552218356, 0.03593547178957707, 0.23637896802467415, 0.12483741807488677, -0.1868941496209934, -0.00900652546969911, -0.01090499902000794, 0.24426455647708514, 0.07316463329912856, -0.028273624111301243, 0.18497047718100917, 0.2625361033118306, 0.04402219467999366, 0.17169515531844434, -0.04704585380983563, 0.002022865786551474, -0.23253809861265695, -0.14930265959208974, -0.13961850475066173, -0.026924606687269915, -0.014603192284621166, -0.10758610548547064, 0.4009070338155979, 0.23259322642265126, 0.14279278413129923, 0.1129179046346018, 0.37762808981232154, -0.002572839285652989, 0.12325074104890706, 0.08703372439366575, 0.08981934741425973, -0.05258912801479873, 0.19800444434767064, -0.13373228091483888, 0.09033588303599316, 0.0754109250041298] |
1,802.0898 | Pulsed reset protocol for fixed-frequency superconducting qubits | Improving coherence times of quantum bits is a fundamental challenge in the
field of quantum computing. With long-lived qubits it becomes, however,
inefficient to wait until the qubits have relaxed to their ground state after
completion of an experiment. Moreover, for error-correction schemes it is
import to rapidly re-initialize ancilla parity-check qubits. We present a
simple pulsed qubit reset protocol based on a two-pulse sequence. A first pulse
transfers the excited state population to a higher excited qubit state and a
second pulse into a lossy environment provided by a low-Q transmission line
resonator, which is also used for qubit readout. We show that the remaining
excited state population can be suppressed to $2.2\pm0.8\%$ and utilize the
pulsed reset protocol to carry out experiments at enhanced rates.
| quant-ph | improving coherence times of quantum bits is a fundamental challenge in the field of quantum computing with longlived qubits it becomes however inefficient to wait until the qubits have relaxed to their ground state after completion of an experiment moreover for errorcorrection schemes it is import to rapidly reinitialize ancilla paritycheck qubits we present a simple pulsed qubit reset protocol based on a twopulse sequence a first pulse transfers the excited state population to a higher excited qubit state and a second pulse into a lossy environment provided by a lowq transmission line resonator which is also used for qubit readout we show that the remaining excited state population can be suppressed to 22pm08 and utilize the pulsed reset protocol to carry out experiments at enhanced rates | [['improving', 'coherence', 'times', 'of', 'quantum', 'bits', 'is', 'a', 'fundamental', 'challenge', 'in', 'the', 'field', 'of', 'quantum', 'computing', 'with', 'longlived', 'qubits', 'it', 'becomes', 'however', 'inefficient', 'to', 'wait', 'until', 'the', 'qubits', 'have', 'relaxed', 'to', 'their', 'ground', 'state', 'after', 'completion', 'of', 'an', 'experiment', 'moreover', 'for', 'errorcorrection', 'schemes', 'it', 'is', 'import', 'to', 'rapidly', 'reinitialize', 'ancilla', 'paritycheck', 'qubits', 'we', 'present', 'a', 'simple', 'pulsed', 'qubit', 'reset', 'protocol', 'based', 'on', 'a', 'twopulse', 'sequence', 'a', 'first', 'pulse', 'transfers', 'the', 'excited', 'state', 'population', 'to', 'a', 'higher', 'excited', 'qubit', 'state', 'and', 'a', 'second', 'pulse', 'into', 'a', 'lossy', 'environment', 'provided', 'by', 'a', 'lowq', 'transmission', 'line', 'resonator', 'which', 'is', 'also', 'used', 'for', 'qubit', 'readout', 'we', 'show', 'that', 'the', 'remaining', 'excited', 'state', 'population', 'can', 'be', 'suppressed', 'to', '22pm08', 'and', 'utilize', 'the', 'pulsed', 'reset', 'protocol', 'to', 'carry', 'out', 'experiments', 'at', 'enhanced', 'rates']] | [-0.1574465835186106, 0.2251414954460213, -0.03772345778443629, 0.021759489976656846, 0.009345069993287325, -0.2692363570695595, 0.1446451499442836, 0.43750532973735107, -0.2300234811439637, -0.2591306194700005, 0.08183520137321293, -0.24347453985348463, -0.004875687539525744, 0.23243580733440697, -0.03687218303093687, 0.09196868479447735, 0.11491971007651752, 0.032355198244904244, -0.04474979676195376, -0.2716794776626759, 0.25000294258019756, 0.08636771541436218, 0.28840302688527913, -0.013772932797788627, 0.13542219121674343, -0.028654233770563253, 0.07542920172480601, -0.09949133539247135, -0.061610475203148475, 0.07047403672532666, 0.2930995102284387, 0.13196915620198799, 0.2634306668732611, -0.48077701462344047, -0.19836610863133083, 0.08307785428284357, 0.1481305162370619, 0.2445014705498045, -0.05684000987371075, -0.31779144621742444, 0.07626901438740628, -0.2004014039661602, -0.055754046151710174, -0.07351510451426582, 0.03273599413463787, -0.044558793096618345, -0.25590359048256356, 0.021828920587607187, 0.05002258866212316, -0.020186969759090553, 0.014811158915685992, -0.011632118510851075, 0.03388314991672006, 0.11647442592278359, -0.05895038788569056, 0.059624614543281496, 0.19973873957947252, -0.09955029653769637, -0.13358216573454676, 0.2827483666321588, -0.061597106405459935, -0.12615524516219184, 0.12182142741845123, -0.08334892273267051, -0.07568121103510733, 0.1345439016419862, 0.14224493419585219, 0.11138510694431644, -0.108509762441769, -0.014553311679120516, 0.03766745761302965, 0.2999429681914903, 0.06753778461891685, 0.1312550376206341, 0.1796243351122867, 0.16871179688707114, 0.11524227354860318, 0.20073470119701048, -0.07655661045167123, -0.10289185051806271, -0.24785059262510567, -0.16890704026445746, -0.21559533583635968, 0.1242004925096851, 0.02094529084293061, -0.10985683960126831, 0.4093044927964608, 0.12333950409961361, 0.14568277732247398, -0.00014726830820094736, 0.3393710809390223, 0.14257905934198153, 0.06795811861391282, 0.09695759882119351, 0.23175507213269908, 0.18728969098135298, 0.07244790339147643, -0.28456385626428987, 0.046908420041233065, -0.006843939734001954] |
1,802.08981 | Cohomological field theories with non-tautological classes | A method of constructing Cohomological Field Theories (CohFTs) with unit
using minimal classes on the moduli spaces of curves is developed. As a simple
consequence, CohFTs with unit are found which take values outside of the
tautological cohomology of the moduli spaces of curves. A study of minimal
classes in low genus is presented in the Appendix by D. Petersen.
| math.AG | a method of constructing cohomological field theories cohfts with unit using minimal classes on the moduli spaces of curves is developed as a simple consequence cohfts with unit are found which take values outside of the tautological cohomology of the moduli spaces of curves a study of minimal classes in low genus is presented in the appendix by d petersen | [['a', 'method', 'of', 'constructing', 'cohomological', 'field', 'theories', 'cohfts', 'with', 'unit', 'using', 'minimal', 'classes', 'on', 'the', 'moduli', 'spaces', 'of', 'curves', 'is', 'developed', 'as', 'a', 'simple', 'consequence', 'cohfts', 'with', 'unit', 'are', 'found', 'which', 'take', 'values', 'outside', 'of', 'the', 'tautological', 'cohomology', 'of', 'the', 'moduli', 'spaces', 'of', 'curves', 'a', 'study', 'of', 'minimal', 'classes', 'in', 'low', 'genus', 'is', 'presented', 'in', 'the', 'appendix', 'by', 'd', 'petersen']] | [-0.18404299914836883, 0.10073499698191882, -0.08807932094981273, 0.07548701310297475, -0.08003920265861476, -0.11448927075446894, 0.006543387534717718, 0.3025942265832176, -0.2583178697930028, -0.27087327518189946, 0.10421409375267103, -0.19944572813110426, -0.1654819515068084, 0.2682917984978606, -0.16874330554467937, -0.005274854734064623, 0.027912722279628117, 0.05991084539952377, -0.10348213499722382, -0.33765528481453655, 0.4345393400018414, -0.0644572295093288, 0.2061907281788687, 0.03508511518593878, 0.10344744212925434, 0.0044375294487205485, -0.012489494619270165, 0.019216789522518714, -0.16081440908067937, 0.19527685013599694, 0.2849444699745315, 0.04471390336596717, 0.16609384610007208, -0.35118638512988887, -0.20992889075229565, 0.18349599288776516, 0.09337114976563801, 0.0055946605027808495, 0.007971479082092022, -0.2260603747020165, 0.09591274210251868, -0.11712592464561264, -0.1806364089328175, -0.09184635290876031, 0.08978650190595848, 0.035049105749931184, -0.17236466833079855, -0.03511836413526907, 0.014470838441047818, 0.18825568935523432, -0.10481921688187867, -0.1069877871312201, -0.09249500334262847, 0.06172243594968071, 0.01900658803836753, 0.07176791349193082, 0.0580020278148974, -0.1069222128794839, -0.14073552034484843, 0.3887120246887207, -0.0699788087202857, -0.22162736734996238, 0.09357946353654066, -0.15495704415176684, -0.1368022282840684, 0.11430032638212045, 0.09290189907575647, 0.20433294822772344, -0.032735635867963235, 0.19591167115577263, -0.10379201160976663, 0.07649187797311849, 0.08445311559286589, -0.009301836625672877, 0.16045878989001114, 0.13223172094052035, 0.010316882239809881, 0.17369440167288605, -0.03481924820613737, -0.049775790196144955, -0.3996992000689109, -0.21085222807402412, -0.1171414108791699, 0.09154873198907201, -0.14604302293931445, -0.19337972030043601, 0.4284688118069122, -0.005872475976745287, 0.22805807913343112, 0.1408878588913164, 0.2194726262241602, 0.04180081865245787, 0.10324112647213042, 0.0508306713309139, 0.17724501243792473, 0.2189474978328993, -0.02224259483627975, -0.10325604158764085, -0.03043547337098668, 0.24513716356207926] |
1,802.08982 | Sparse Network Estimation for Dynamical Spatio-temporal Array Models | Neural field models represent neuronal communication on a population level
via synaptic weight functions. Using voltage sensitive dye (VSD) imaging it is
possible to obtain measurements of neural fields with a relatively high spatial
and temporal resolution. The synaptic weight functions represent functional
connectivity in the brain and give rise to a spatio-temporal dependence
structure. We present a stochastic functional differential equation for
modeling neural fields, which leads to a vector autoregressive model of the
data via basis expansions of the synaptic weight functions and time and space
discretization. Fitting the model to data is a pratical challenge as this
represents a large scale regression problem. By using a 1-norm penalty in
combination with localized basis functions it is possible to learn a sparse
network representation of the functional connectivity of the brain, but still,
the explicit construction of a design matrix can be computationally
prohibitive. We demonstrate that by using tensor product basis expansions, the
computation of the penalized estimator via a proximal gradient algorithm
becomes feasible. It is crucial for the computations that the data is organized
in an array as is the case for the three dimensional VSD imaging data. This
allows for the use of array arithmetic that is both memory and time
efficient.The proposed method is implemented and showcased in the R package
dynamo available from CRAN.
| stat.ME | neural field models represent neuronal communication on a population level via synaptic weight functions using voltage sensitive dye vsd imaging it is possible to obtain measurements of neural fields with a relatively high spatial and temporal resolution the synaptic weight functions represent functional connectivity in the brain and give rise to a spatiotemporal dependence structure we present a stochastic functional differential equation for modeling neural fields which leads to a vector autoregressive model of the data via basis expansions of the synaptic weight functions and time and space discretization fitting the model to data is a pratical challenge as this represents a large scale regression problem by using a 1norm penalty in combination with localized basis functions it is possible to learn a sparse network representation of the functional connectivity of the brain but still the explicit construction of a design matrix can be computationally prohibitive we demonstrate that by using tensor product basis expansions the computation of the penalized estimator via a proximal gradient algorithm becomes feasible it is crucial for the computations that the data is organized in an array as is the case for the three dimensional vsd imaging data this allows for the use of array arithmetic that is both memory and time efficientthe proposed method is implemented and showcased in the r package dynamo available from cran | [['neural', 'field', 'models', 'represent', 'neuronal', 'communication', 'on', 'a', 'population', 'level', 'via', 'synaptic', 'weight', 'functions', 'using', 'voltage', 'sensitive', 'dye', 'vsd', 'imaging', 'it', 'is', 'possible', 'to', 'obtain', 'measurements', 'of', 'neural', 'fields', 'with', 'a', 'relatively', 'high', 'spatial', 'and', 'temporal', 'resolution', 'the', 'synaptic', 'weight', 'functions', 'represent', 'functional', 'connectivity', 'in', 'the', 'brain', 'and', 'give', 'rise', 'to', 'a', 'spatiotemporal', 'dependence', 'structure', 'we', 'present', 'a', 'stochastic', 'functional', 'differential', 'equation', 'for', 'modeling', 'neural', 'fields', 'which', 'leads', 'to', 'a', 'vector', 'autoregressive', 'model', 'of', 'the', 'data', 'via', 'basis', 'expansions', 'of', 'the', 'synaptic', 'weight', 'functions', 'and', 'time', 'and', 'space', 'discretization', 'fitting', 'the', 'model', 'to', 'data', 'is', 'a', 'pratical', 'challenge', 'as', 'this', 'represents', 'a', 'large', 'scale', 'regression', 'problem', 'by', 'using', 'a', '1norm', 'penalty', 'in', 'combination', 'with', 'localized', 'basis', 'functions', 'it', 'is', 'possible', 'to', 'learn', 'a', 'sparse', 'network', 'representation', 'of', 'the', 'functional', 'connectivity', 'of', 'the', 'brain', 'but', 'still', 'the', 'explicit', 'construction', 'of', 'a', 'design', 'matrix', 'can', 'be', 'computationally', 'prohibitive', 'we', 'demonstrate', 'that', 'by', 'using', 'tensor', 'product', 'basis', 'expansions', 'the', 'computation', 'of', 'the', 'penalized', 'estimator', 'via', 'a', 'proximal', 'gradient', 'algorithm', 'becomes', 'feasible', 'it', 'is', 'crucial', 'for', 'the', 'computations', 'that', 'the', 'data', 'is', 'organized', 'in', 'an', 'array', 'as', 'is', 'the', 'case', 'for', 'the', 'three', 'dimensional', 'vsd', 'imaging', 'data', 'this', 'allows', 'for', 'the', 'use', 'of', 'array', 'arithmetic', 'that', 'is', 'both', 'memory', 'and', 'time', 'efficientthe', 'proposed', 'method', 'is', 'implemented', 'and', 'showcased', 'in', 'the', 'r', 'package', 'dynamo', 'available', 'from', 'cran']] | [-0.1019865655989757, 0.05042864520760407, -0.08301440903672536, 0.06865440769968091, -0.08752664289020036, -0.15232759155649103, 0.023305304259445297, 0.41398264661566164, -0.2993500042344313, -0.2747439598807922, 0.12834239164283034, -0.211477419183491, -0.22258825936856177, 0.17831263704250705, -0.03314371459484754, 0.07045112839268891, 0.09564346746790194, 0.023071332086653056, -0.03556888696868752, -0.2147464736341604, 0.2826212341960402, 0.08759331540520644, 0.28022935003783905, -0.0022144983069575077, 0.15356285628184205, -0.0029844097557111026, -0.029190469710198463, -0.002375236146254212, -0.06709689446732195, 0.17316661576389616, 0.2986413278124998, 0.1535827218279942, 0.3212032464651045, -0.4518309371057072, -0.21300612834618823, 0.08410428345574243, 0.11347528344546487, 0.09848459850684887, -0.018181950867921955, -0.24151475779918694, 0.05658831434299099, -0.1548181379559488, -0.0681308264779854, -0.15161148210190978, -0.004569612072076968, 0.01848949788125628, -0.35022700146605507, 0.0919033093483301, -0.006677346827664594, 0.06889076076650241, -0.057096065824052813, -0.09123505678921263, -0.0029247597742792036, 0.09395970170487801, -0.0037253874299610014, 0.07634945170876435, 0.11515494767466888, -0.14382614728687695, -0.09317976402801491, 0.31007028629421785, -0.057696505740487194, -0.2436228438714578, 0.15078733699202404, -0.097243088479807, -0.12307368058972566, 0.11971593117109622, 0.19741648171156037, 0.09121828776577749, -0.17004799986852343, 0.10707052439562892, -0.024713981100168432, 0.18793576141204096, 0.02390403010486309, 0.01141679053915437, 0.13541451970545146, 0.2384892203360459, 0.06919763221856358, 0.14224293345440078, -0.11901874167579163, -0.059762971067476627, -0.2718233612800076, -0.12313061946177564, -0.23299413963486504, 0.013927824191045336, -0.1355165901455061, -0.20452549006049553, 0.42562666020200196, 0.13534095994069356, 0.1938950422125641, 0.11026116994755317, 0.3004007164001195, 0.13228059332550196, 0.14500474269034097, 0.0760747216709329, 0.13634538702978605, 0.1627488076682645, 0.10638235073127864, -0.19098126926729075, 0.07432898524208352, 0.06708261567774772] |
1,802.08983 | High phase space density loading of a falling magnetic trap | Loading an ultra-cold ensemble into a static magnetic trap involves
unavoidable loss of phase space density when the gravitational energy dominates
the kinetic energy of the ensemble. In such a case the gravitational energy is
transformed into heat, making a subsequent evaporation process slower and less
efficient. We apply a high phase space loading scheme on a sub-doppler cooled
ensemble of Rubidium atoms, with a gravitational energy much higher than its
temperature of $1~\rm{\mu K}$. Using the regular configuration of a quadrupole
magnetic trap, but driving unequal currents through the coils to allow the trap
center to fall, we dissipate most of the gravitational energy and obtain a
20-fold improvement in the phase space density as compared to optimal loading
into a static magnetic trap. Applying this scheme, we start an efficient and
fast evaporation process as a result of the sub-second thermalization rate of
the magnetically trapped ensemble.
| physics.atom-ph | loading an ultracold ensemble into a static magnetic trap involves unavoidable loss of phase space density when the gravitational energy dominates the kinetic energy of the ensemble in such a case the gravitational energy is transformed into heat making a subsequent evaporation process slower and less efficient we apply a high phase space loading scheme on a subdoppler cooled ensemble of rubidium atoms with a gravitational energy much higher than its temperature of 1rmmu k using the regular configuration of a quadrupole magnetic trap but driving unequal currents through the coils to allow the trap center to fall we dissipate most of the gravitational energy and obtain a 20fold improvement in the phase space density as compared to optimal loading into a static magnetic trap applying this scheme we start an efficient and fast evaporation process as a result of the subsecond thermalization rate of the magnetically trapped ensemble | [['loading', 'an', 'ultracold', 'ensemble', 'into', 'a', 'static', 'magnetic', 'trap', 'involves', 'unavoidable', 'loss', 'of', 'phase', 'space', 'density', 'when', 'the', 'gravitational', 'energy', 'dominates', 'the', 'kinetic', 'energy', 'of', 'the', 'ensemble', 'in', 'such', 'a', 'case', 'the', 'gravitational', 'energy', 'is', 'transformed', 'into', 'heat', 'making', 'a', 'subsequent', 'evaporation', 'process', 'slower', 'and', 'less', 'efficient', 'we', 'apply', 'a', 'high', 'phase', 'space', 'loading', 'scheme', 'on', 'a', 'subdoppler', 'cooled', 'ensemble', 'of', 'rubidium', 'atoms', 'with', 'a', 'gravitational', 'energy', 'much', 'higher', 'than', 'its', 'temperature', 'of', '1rmmu', 'k', 'using', 'the', 'regular', 'configuration', 'of', 'a', 'quadrupole', 'magnetic', 'trap', 'but', 'driving', 'unequal', 'currents', 'through', 'the', 'coils', 'to', 'allow', 'the', 'trap', 'center', 'to', 'fall', 'we', 'dissipate', 'most', 'of', 'the', 'gravitational', 'energy', 'and', 'obtain', 'a', '20fold', 'improvement', 'in', 'the', 'phase', 'space', 'density', 'as', 'compared', 'to', 'optimal', 'loading', 'into', 'a', 'static', 'magnetic', 'trap', 'applying', 'this', 'scheme', 'we', 'start', 'an', 'efficient', 'and', 'fast', 'evaporation', 'process', 'as', 'a', 'result', 'of', 'the', 'subsecond', 'thermalization', 'rate', 'of', 'the', 'magnetically', 'trapped', 'ensemble']] | [-0.1336912829601961, 0.23090691168692648, -0.046572366405303614, 0.05262474227800192, 0.004519370719601677, -0.10866090303249154, 0.07939500443800981, 0.39036177979731884, -0.21869263896872793, -0.2784401003327976, 0.05084963269512849, -0.220100251938896, -0.016607385561361, 0.21741350566515247, 0.03329615583690513, 0.02610383186264379, 0.04843409227307986, 0.04905298871862878, -0.08537302472049722, -0.20474101291305535, 0.26842198361693, 0.14748225685183866, 0.2963114443338929, 0.02018057580131131, 0.12199608847574406, 0.0016737260157242417, 0.06944016310562556, 0.004367690092319233, -0.10247367403683932, 0.0811472112042326, 0.15811928985420162, 0.05484838894178235, 0.2799991933893211, -0.47371307230630033, -0.24244773563790462, 0.13814803630403066, 0.15056326239357223, 0.1856102955628287, -0.0693099094276329, -0.23801848263246939, -0.021202317927492078, -0.19935435543113664, -0.12579029846647, -0.092549891233117, 0.021994268458739325, 0.021754791075993027, -0.3099941865279893, 0.08494576460656685, 0.08533642724206722, 0.034708912087906454, -0.1440904871096545, -0.05765567789470928, 0.003818229608539794, 0.04118361782122913, -0.001474575582039039, 0.08137825609033776, 0.24862406668693735, -0.10229025642557472, -0.018185359394379163, 0.3866931956160713, -0.09842822319134595, -0.11583317660198018, 0.1661291023389109, -0.14028937511800513, -0.030519105034653802, 0.23443017126300145, 0.1799172724603449, 0.11428167148669427, -0.1169765800812063, 0.014280302688004324, 0.05403405072866008, 0.1659608257067629, 0.10278919173052183, 0.028811306101144164, 0.2601616629808386, 0.19419846867016088, 0.09206567657826314, 0.21650031634379882, -0.12376016414428533, -0.0896162631562785, -0.24338742278554049, -0.16970175449937783, -0.19099518304967597, 0.06675514822111565, -0.08790156127842902, -0.15155063023730936, 0.36308055648097814, 0.125670041074045, 0.21644049791644351, -0.023379774801936502, 0.34876204266942834, 0.13313354607954672, 0.05276809215885461, 0.08521203634744459, 0.25607879648010273, 0.14412550504218685, 0.13476456038345508, -0.27986406489681276, -0.04078080055517824, 0.05701635180456514] |
1,802.08984 | Secure Serverless Computing Using Dynamic Information Flow Control | The rise of serverless computing provides an opportunity to rethink cloud
security. We present an approach for securing serverless systems using a novel
form of dynamic information flow control (IFC).
We show that in serverless applications, the termination channel found in
most existing IFC systems can be arbitrarily amplified via multiple concurrent
requests, necessitating a stronger termination-sensitive non-interference
guarantee, which we achieve using a combination of static labeling of
serverless processes and dynamic faceted labeling of persistent data.
We describe our implementation of this approach on top of JavaScript for AWS
Lambda and OpenWhisk serverless platforms, and present three realistic case
studies showing that it can enforce important IFC security properties with low
overhead.
| cs.PL cs.CR | the rise of serverless computing provides an opportunity to rethink cloud security we present an approach for securing serverless systems using a novel form of dynamic information flow control ifc we show that in serverless applications the termination channel found in most existing ifc systems can be arbitrarily amplified via multiple concurrent requests necessitating a stronger terminationsensitive noninterference guarantee which we achieve using a combination of static labeling of serverless processes and dynamic faceted labeling of persistent data we describe our implementation of this approach on top of javascript for aws lambda and openwhisk serverless platforms and present three realistic case studies showing that it can enforce important ifc security properties with low overhead | [['the', 'rise', 'of', 'serverless', 'computing', 'provides', 'an', 'opportunity', 'to', 'rethink', 'cloud', 'security', 'we', 'present', 'an', 'approach', 'for', 'securing', 'serverless', 'systems', 'using', 'a', 'novel', 'form', 'of', 'dynamic', 'information', 'flow', 'control', 'ifc', 'we', 'show', 'that', 'in', 'serverless', 'applications', 'the', 'termination', 'channel', 'found', 'in', 'most', 'existing', 'ifc', 'systems', 'can', 'be', 'arbitrarily', 'amplified', 'via', 'multiple', 'concurrent', 'requests', 'necessitating', 'a', 'stronger', 'terminationsensitive', 'noninterference', 'guarantee', 'which', 'we', 'achieve', 'using', 'a', 'combination', 'of', 'static', 'labeling', 'of', 'serverless', 'processes', 'and', 'dynamic', 'faceted', 'labeling', 'of', 'persistent', 'data', 'we', 'describe', 'our', 'implementation', 'of', 'this', 'approach', 'on', 'top', 'of', 'javascript', 'for', 'aws', 'lambda', 'and', 'openwhisk', 'serverless', 'platforms', 'and', 'present', 'three', 'realistic', 'case', 'studies', 'showing', 'that', 'it', 'can', 'enforce', 'important', 'ifc', 'security', 'properties', 'with', 'low', 'overhead']] | [-0.20942386003691224, -0.016822399466197558, -0.08120116721261787, 0.049833613108901255, -0.09830095823153656, -0.1958649853714206, 0.06527616410821149, 0.4035523547337646, -0.2787779878332502, -0.3187469539059474, 0.09236045022478608, -0.23222086437672904, -0.15526147184077552, 0.22824136811448673, -0.07079125109666431, 0.0771732562709913, 0.06674744795999629, -0.010030838355949494, -0.0007155418202313966, -0.2030077811239897, 0.29552452247672245, 0.04041219874804394, 0.31931709761904403, 0.09611239163122609, 0.06774132189122482, 0.046160561963915825, -0.01167151189164003, 0.020854099442980424, -0.0931274950947557, 0.1630632942217913, 0.29413404188786463, 0.20646285616681473, 0.29312106984692204, -0.4678721218575946, -0.18542445090442763, 0.02639072638136887, 0.14982767922101148, 0.09177309497626832, -0.09720698578913688, -0.2837858672389777, 0.14781023578850172, -0.24930941324219502, -0.05782311886911635, -0.1358427995140046, -0.016443628784829536, 0.01791680852297397, -0.2878534875694761, -0.029402481927742474, 0.0502278885713457, 0.07847687506438357, -0.04930203332757862, -0.04710559621535703, 0.025174956202127896, 0.1573608829887106, -0.021649689298222023, -0.010095241690771571, 0.1451409897185961, -0.14701435758744621, -0.1650327872855803, 0.3804793640048103, -0.03739191324911616, -0.15651240964642668, 0.22820105404228352, 0.002144504289052128, -0.1664085837670363, 0.09965092153288424, 0.2507558546865573, 0.10137731113380431, -0.18193957716251302, 0.05037268734226968, -0.005598943949413313, 0.2061798429297926, 0.05222383050651875, 0.10675637185804349, 0.1824432203043417, 0.22757221554793353, 0.09454676148196295, 0.1786466882125252, -0.04190849452444344, -0.0932404670814893, -0.2524699866982894, -0.16827884162322873, -0.09886021369581927, 0.006322521489706978, -0.08561688998213915, -0.15267691307132486, 0.33387325037542764, 0.22042805996962486, 0.13184138242566373, 0.05121606591351297, 0.38738072540742896, 0.04744853592473618, 0.08783573510570336, 0.16288111340749054, 0.15638292078917795, -0.002816783614555555, 0.1750600483583748, -0.17180694588171566, 0.11041722358904976, -0.013091120782382457] |
1,802.08985 | Origin of the anomalous semiconducting behaviour in dense lithium | Experimentally, it is known that lithium undergoes a metal to semiconductor
transition at about 80 GPA and a reentrant semiconductor to metal transition
near 120 GPA. This unusual behaviour has been attributed to the formation of
high-pressure electrides in the Li-\textit{Aba}2 phase. Using the accurate wave
function based quantum Monte Carlo (DMC) method, we show that the valence
charge distribution of the Li-\textit{Aba}2 phase is incompatible with an
insulating or semiconducting ground state. At DMC level, the most stable phase
at 100 GPA is an orthorhombic oP24 structure with Pbca symmetry whose valence
charge density shows an electride paired distribution, in correspondence with
the theoretical predictions of Neaton and Ashcroft [Nature 00, 141 (1999)].
Here, we propose the electride pairing in the oP24-(Pbca) phase as the origin
of the semiconducting behaviour observed in diamond anvil cell experiments.
| cond-mat.mtrl-sci | experimentally it is known that lithium undergoes a metal to semiconductor transition at about 80 gpa and a reentrant semiconductor to metal transition near 120 gpa this unusual behaviour has been attributed to the formation of highpressure electrides in the litextitaba2 phase using the accurate wave function based quantum monte carlo dmc method we show that the valence charge distribution of the litextitaba2 phase is incompatible with an insulating or semiconducting ground state at dmc level the most stable phase at 100 gpa is an orthorhombic op24 structure with pbca symmetry whose valence charge density shows an electride paired distribution in correspondence with the theoretical predictions of neaton and ashcroft nature 00 141 1999 here we propose the electride pairing in the op24pbca phase as the origin of the semiconducting behaviour observed in diamond anvil cell experiments | [['experimentally', 'it', 'is', 'known', 'that', 'lithium', 'undergoes', 'a', 'metal', 'to', 'semiconductor', 'transition', 'at', 'about', '80', 'gpa', 'and', 'a', 'reentrant', 'semiconductor', 'to', 'metal', 'transition', 'near', '120', 'gpa', 'this', 'unusual', 'behaviour', 'has', 'been', 'attributed', 'to', 'the', 'formation', 'of', 'highpressure', 'electrides', 'in', 'the', 'litextitaba2', 'phase', 'using', 'the', 'accurate', 'wave', 'function', 'based', 'quantum', 'monte', 'carlo', 'dmc', 'method', 'we', 'show', 'that', 'the', 'valence', 'charge', 'distribution', 'of', 'the', 'litextitaba2', 'phase', 'is', 'incompatible', 'with', 'an', 'insulating', 'or', 'semiconducting', 'ground', 'state', 'at', 'dmc', 'level', 'the', 'most', 'stable', 'phase', 'at', '100', 'gpa', 'is', 'an', 'orthorhombic', 'op24', 'structure', 'with', 'pbca', 'symmetry', 'whose', 'valence', 'charge', 'density', 'shows', 'an', 'electride', 'paired', 'distribution', 'in', 'correspondence', 'with', 'the', 'theoretical', 'predictions', 'of', 'neaton', 'and', 'ashcroft', 'nature', '00', '141', '1999', 'here', 'we', 'propose', 'the', 'electride', 'pairing', 'in', 'the', 'op24pbca', 'phase', 'as', 'the', 'origin', 'of', 'the', 'semiconducting', 'behaviour', 'observed', 'in', 'diamond', 'anvil', 'cell', 'experiments']] | [-0.10395493053383272, 0.21475419380028024, -0.08439422070709918, -0.01333168185785242, 0.008996466914092312, -0.13637058197286064, 0.14837998015191123, 0.4547077636127822, -0.24502309288861557, -0.30403042879694975, -0.0005563311954206638, -0.3511324789631003, -0.13575410883951905, 0.0806947338540562, 0.05431562203217213, 0.03481407642083683, -0.021209310086173865, -0.016804057902137515, -0.167809437601365, -0.1608188605444321, 0.22968241525458472, 0.05437471570699469, 0.3385441418886469, 0.06621093545926607, 0.03937943886880201, -0.0633082521774647, 0.18813876049479342, -0.0427010961033347, -0.1732026932141006, 0.00859981220044935, 0.28482786334432547, -0.07139122124427204, 0.18894218180847588, -0.40456286824987275, -0.20744031504016966, 0.030308572828719918, 0.09517794827315672, 0.12104069605071581, -0.1230892731082974, -0.29384130666757585, 0.08719054783715774, -0.15105683557006694, -0.15445961250091783, -0.06956874626112804, -0.03377497071073256, -0.06544371791368792, -0.20624064526010574, 0.12783534257345697, 0.007116182022976853, 0.09212315673068991, -0.11409273934337304, -0.1565049507136222, -0.07414333702185909, 0.02821990487677621, -0.004634495202508819, 0.09847640820342571, 0.13159442931246582, -0.07622686631174204, -0.11785883401015787, 0.40649106194272294, -0.025305843656129055, -0.0020374832248300995, 0.18550986720369916, -0.2006382399579894, -0.0901153776581392, 0.25774879941276013, 0.06433490851453243, 0.08359831680351769, -0.10222587396101031, 0.051643504102657486, 0.002467632737256878, 0.2262940514043599, 0.027531845564420784, 0.03135468602848758, 0.2376451703598936, 0.22646644175095298, -0.013116388091149222, 0.14188846882400707, -0.15114714846704583, -0.11422227514829515, -0.20415268054601687, -0.21217405575739473, -0.2192351637454348, 0.05308653428856877, -0.06680855062903075, -0.21673661387234017, 0.3553755071355414, 0.12859880140065463, 0.16767373161065172, -0.06494418427149076, 0.2101019663409195, 0.07580112056177507, 0.027680069193926477, 0.04277375655138566, 0.26107078105858206, 0.1851269159650871, 0.10338496290971987, -0.26461603333249345, 0.11777631307148752, 0.000959329653659281] |
1,802.08986 | Wide field fluorescence epi-microscopy behind a scattering medium
enabled by speckle correlations | Fluorescence microscopy is widely used in biological imaging, however
scattering from tissues strongly limits its applicability to a shallow depth.
In this work we adapt a methodology inspired from stellar speckle
interferometry, and exploit the optical memory effect to enable fluorescence
microscopy through a turbid layer. We demonstrate efficient reconstruction of
micrometer-size fluorescent objects behind a scattering medium in
epi-microscopy, and study the specificities of this imaging modality
(magnification, field of view, resolution) as compared to traditional
microscopy. Using a modified phase retrieval algorithm to reconstruct
fluorescent objects from speckle images, we demonstrate robust reconstructions
even in relatively low signal to noise conditions. This modality is
particularly appropriate for imaging in biological media, which are known to
exhibit relatively large optical memory ranges compatible with tens of
micrometers size field of views, and large spectral bandwidths compatible with
emission fluorescence spectra of tens of nanometers widths.
| physics.optics physics.bio-ph | fluorescence microscopy is widely used in biological imaging however scattering from tissues strongly limits its applicability to a shallow depth in this work we adapt a methodology inspired from stellar speckle interferometry and exploit the optical memory effect to enable fluorescence microscopy through a turbid layer we demonstrate efficient reconstruction of micrometersize fluorescent objects behind a scattering medium in epimicroscopy and study the specificities of this imaging modality magnification field of view resolution as compared to traditional microscopy using a modified phase retrieval algorithm to reconstruct fluorescent objects from speckle images we demonstrate robust reconstructions even in relatively low signal to noise conditions this modality is particularly appropriate for imaging in biological media which are known to exhibit relatively large optical memory ranges compatible with tens of micrometers size field of views and large spectral bandwidths compatible with emission fluorescence spectra of tens of nanometers widths | [['fluorescence', 'microscopy', 'is', 'widely', 'used', 'in', 'biological', 'imaging', 'however', 'scattering', 'from', 'tissues', 'strongly', 'limits', 'its', 'applicability', 'to', 'a', 'shallow', 'depth', 'in', 'this', 'work', 'we', 'adapt', 'a', 'methodology', 'inspired', 'from', 'stellar', 'speckle', 'interferometry', 'and', 'exploit', 'the', 'optical', 'memory', 'effect', 'to', 'enable', 'fluorescence', 'microscopy', 'through', 'a', 'turbid', 'layer', 'we', 'demonstrate', 'efficient', 'reconstruction', 'of', 'micrometersize', 'fluorescent', 'objects', 'behind', 'a', 'scattering', 'medium', 'in', 'epimicroscopy', 'and', 'study', 'the', 'specificities', 'of', 'this', 'imaging', 'modality', 'magnification', 'field', 'of', 'view', 'resolution', 'as', 'compared', 'to', 'traditional', 'microscopy', 'using', 'a', 'modified', 'phase', 'retrieval', 'algorithm', 'to', 'reconstruct', 'fluorescent', 'objects', 'from', 'speckle', 'images', 'we', 'demonstrate', 'robust', 'reconstructions', 'even', 'in', 'relatively', 'low', 'signal', 'to', 'noise', 'conditions', 'this', 'modality', 'is', 'particularly', 'appropriate', 'for', 'imaging', 'in', 'biological', 'media', 'which', 'are', 'known', 'to', 'exhibit', 'relatively', 'large', 'optical', 'memory', 'ranges', 'compatible', 'with', 'tens', 'of', 'micrometers', 'size', 'field', 'of', 'views', 'and', 'large', 'spectral', 'bandwidths', 'compatible', 'with', 'emission', 'fluorescence', 'spectra', 'of', 'tens', 'of', 'nanometers', 'widths']] | [-0.011683082471376864, 0.09037167908431128, -0.05307912836814749, 0.0675730571752928, -0.06287074963610362, -0.1509735701734136, -0.006912867796751831, 0.4975819089674744, -0.30516767636391107, -0.33156238454554615, 0.0749775174386992, -0.275192552011717, -0.1556211012319244, 0.22992086483743684, -0.11084408583440657, 0.06253481039030734, 0.07158770240072547, -0.07392123390374512, -0.003986005326090702, -0.15164136514750085, 0.23638162920733208, 0.06453988823782782, 0.3012559514059203, 0.04191950395370127, 0.12028601755355967, 0.034102117384237976, -0.0438197639835035, 0.030082651882849892, -0.07998942522460531, 0.14445992144916592, 0.2915246917127535, 0.09470630792965148, 0.20868311740201095, -0.44963851084226164, -0.2757146508272352, 0.049870826259801354, 0.1839770863314384, 0.13064873810488217, -0.08451333811570858, -0.2949757747625097, 0.0373938991527619, -0.07530504754134293, -0.10394444814722599, -0.07283419186955896, -0.016623836824798892, 0.028952525132978014, -0.25970906406833694, 0.09043710914376224, -0.033775088516192445, 0.13019750086141044, -0.07908797502148382, -0.03039696771121616, 0.06519376440294858, 0.08486164908791924, -0.024851603337146085, 0.007320270284303817, 0.2070717598536405, -0.1998827043166063, -0.06319571556523443, 0.3639263280763708, -0.07226695245420882, -0.09593635408593149, 0.23820644273454772, -0.1811664233931565, -0.06887309447830094, 0.2504379865231699, 0.1693922632518385, 0.1555578937304431, -0.17387372349742158, 0.007110610455555584, 0.012263686183422547, 0.2815176759412962, 0.13062802237811788, 0.14164202582926072, 0.18492623032391842, 0.22889550777537557, 0.001709007484645679, 0.15306347909399534, -0.23985557489996326, 0.01594625534168605, -0.16394055786317793, -0.11252356164221619, -0.2001578476231802, 0.05074695540784762, -0.08005326923819917, -0.16355639675728462, 0.35251444847290886, 0.24087410747105706, 0.2141907634277796, 0.02850946391980838, 0.3805961099934989, 0.026079665553948746, 0.15461674968166084, -0.06324466071252165, 0.24161085214722774, 0.18420743151599991, 0.16668154221301063, -0.1983377735556007, 0.015485148045138038, -0.03188227672001411] |
1,802.08987 | The Dividend Discount Model with Multiple Growth Rates of Any Order for
Stock Evaluation | In this paper we provide a general solution for the dividend discount model
in order to compute the intrinsic value of a common stock that allows for
multiple stage growth rates of any predetermined number of periods. A
mathematical proof is provided for the suggested general solution. A numerical
application is also presented. The solution introduced in this paper is
expected to improve on the precision of stock valuation, which might be of
fundamental importance for investors as well as financial institutions.
| q-fin.PR | in this paper we provide a general solution for the dividend discount model in order to compute the intrinsic value of a common stock that allows for multiple stage growth rates of any predetermined number of periods a mathematical proof is provided for the suggested general solution a numerical application is also presented the solution introduced in this paper is expected to improve on the precision of stock valuation which might be of fundamental importance for investors as well as financial institutions | [['in', 'this', 'paper', 'we', 'provide', 'a', 'general', 'solution', 'for', 'the', 'dividend', 'discount', 'model', 'in', 'order', 'to', 'compute', 'the', 'intrinsic', 'value', 'of', 'a', 'common', 'stock', 'that', 'allows', 'for', 'multiple', 'stage', 'growth', 'rates', 'of', 'any', 'predetermined', 'number', 'of', 'periods', 'a', 'mathematical', 'proof', 'is', 'provided', 'for', 'the', 'suggested', 'general', 'solution', 'a', 'numerical', 'application', 'is', 'also', 'presented', 'the', 'solution', 'introduced', 'in', 'this', 'paper', 'is', 'expected', 'to', 'improve', 'on', 'the', 'precision', 'of', 'stock', 'valuation', 'which', 'might', 'be', 'of', 'fundamental', 'importance', 'for', 'investors', 'as', 'well', 'as', 'financial', 'institutions']] | [-0.08403114717817162, 0.022085292026309704, -0.09614352605067103, 0.09882954890391131, -0.1084193041684424, -0.10115139115965222, 0.09881231913672442, 0.3393192924615904, -0.26953642831252117, -0.26114334016129737, 0.17260268444859808, -0.2344894589870109, -0.1536395546366892, 0.22097133381417158, -0.12476965119755577, 0.04853648369813838, 0.025007114125268032, 0.05270341664826691, 0.03962433273710946, -0.2849715525829574, 0.29864438677990307, 0.07850476429320691, 0.26819242231502405, 0.07322928248109614, 0.10345086613215687, -0.005242611011830953, -0.02580000118284327, 0.020700869928454844, -0.15369304062036596, 0.15812088579802616, 0.31480304716245794, 0.12709440922977902, 0.36922121876509995, -0.3857787402982755, -0.16775291362527486, 0.13342642747774358, 0.11016314234811722, 0.10594715642964286, -0.06371713461064757, -0.20126228166528318, 0.08647363377939456, -0.23256150309689252, -0.1641329215589638, -0.08788214841993844, 0.0467914801670193, 0.024595672330711173, -0.3450450265280357, 0.04589257533796893, 0.02720084318624264, 0.030980195938155236, -0.08573319745695832, -0.10126066864070642, 0.01640685799633857, 0.1419245717626792, 0.13161493064523333, -0.0007529362820361446, 0.06891862626142073, -0.11160023120322787, -0.16528214524477358, 0.40047586067556973, -0.05805325874542, -0.18965208141996368, 0.13546487988858688, -0.11458791994557875, -0.12861513919992054, 0.0801022200924685, 0.21836266934689952, 0.09019626460106271, -0.15723933260206405, 0.04191187764063659, -0.056578882901770315, 0.17450702536805737, 0.07941724645064735, 0.007167632942848907, 0.1681651233726681, 0.18686933845009018, 0.11005583290783007, 0.11772511090100857, -0.02371783331661235, -0.13991477659040288, -0.3155110154660112, -0.20311036903592872, -0.1698422821738371, 0.0796292895229715, -0.11636807373156999, -0.16852542580809535, 0.42937383809831087, 0.1606537246872194, 0.14548513859442277, 0.10658839107746622, 0.2674958054118267, 0.1670063052570629, 0.0016614383302356412, 0.051240764802503516, 0.21245500757699695, 0.040049840256049324, 0.12079762393131671, -0.1469454435438554, 0.1653772571135494, 0.06678736223498495] |
1,802.08988 | Deep Neural Network for Learning to Rank Query-Text Pairs | This paper considers the problem of document ranking in information retrieval
systems by Learning to Rank. We propose ConvRankNet combining a Siamese
Convolutional Neural Network encoder and the RankNet ranking model which could
be trained in an end-to-end fashion. We prove a general result justifying the
linear test-time complexity of pairwise Learning to Rank approach. Experiments
on the OHSUMED dataset show that ConvRankNet outperforms systematically
existing feature-based models.
| cs.IR | this paper considers the problem of document ranking in information retrieval systems by learning to rank we propose convranknet combining a siamese convolutional neural network encoder and the ranknet ranking model which could be trained in an endtoend fashion we prove a general result justifying the linear testtime complexity of pairwise learning to rank approach experiments on the ohsumed dataset show that convranknet outperforms systematically existing featurebased models | [['this', 'paper', 'considers', 'the', 'problem', 'of', 'document', 'ranking', 'in', 'information', 'retrieval', 'systems', 'by', 'learning', 'to', 'rank', 'we', 'propose', 'convranknet', 'combining', 'a', 'siamese', 'convolutional', 'neural', 'network', 'encoder', 'and', 'the', 'ranknet', 'ranking', 'model', 'which', 'could', 'be', 'trained', 'in', 'an', 'endtoend', 'fashion', 'we', 'prove', 'a', 'general', 'result', 'justifying', 'the', 'linear', 'testtime', 'complexity', 'of', 'pairwise', 'learning', 'to', 'rank', 'approach', 'experiments', 'on', 'the', 'ohsumed', 'dataset', 'show', 'that', 'convranknet', 'outperforms', 'systematically', 'existing', 'featurebased', 'models']] | [-0.0569767614290344, -0.05940102180973168, -0.05027796705888415, 0.06616336940329126, -0.10626597999715048, -0.23602462888723522, 0.02685333686443328, 0.48357759613656637, -0.3020691284204297, -0.29075291608883574, -0.005418617592306074, -0.26837457194359915, -0.25705538120007876, 0.12344082965247447, -0.17849198779599232, 0.09631026917221872, 0.16986636104676026, 0.07075748745013367, -0.12070387402535275, -0.36540375938145164, 0.3418369972161158, 0.04952189677648924, 0.35912837076819304, 0.018933914432471447, 0.15994304752993313, -0.009197343253728115, -0.042238338178404694, 0.0033646291809749196, -0.057914905998503935, 0.22074044618057087, 0.3852734274509699, 0.26542508571451023, 0.34282103553414345, -0.36347632736644964, -0.24487860682843762, 0.1137848217675293, 0.13342376458317493, 0.14369488828356913, 0.010541776761370287, -0.3464788921657159, 0.06810997822321951, -0.234721227407907, 0.10796148385711465, -0.15127670107352914, -0.0916984717495683, -0.06424297556055314, -0.33404665022636904, 0.03788299539309898, 0.11802476999406336, 0.06033324979414994, -0.050905467265031555, -0.11048395832414937, 0.05546448969592651, 0.07242870962981021, 0.020020816739733247, 0.08219646905711146, 0.10799770266043418, -0.16500883649992334, -0.18222774645652284, 0.32230295176674245, -0.08462649639113806, -0.20112524271914453, 0.15333551905033263, 0.04672088791134725, -0.17641388641486905, 0.031814477942658195, 0.30182154502042313, 0.12236683894121653, -0.18578367337415164, 0.006091595795816939, -0.10733269109870448, 0.22843001557118964, 0.016755486171777276, -0.043992960373130205, 0.1337956371664239, 0.314386162547056, 0.0333511956798082, 0.17414576047855063, -0.1008090124656023, -0.04271738914151987, -0.1649536557467372, -0.07478007167634187, -0.2026538078419187, -0.04516753222736897, -0.12516804748531396, -0.12901149770230846, 0.4223816657269543, 0.26073614180539595, 0.2106647699521008, 0.22617051819388784, 0.362551571208645, 0.01398657260914192, 0.0909886462014225, 0.14852158896180548, 0.18096699867623323, -0.014403410195937437, 0.10411295011837149, -0.13218048437865396, 0.10636296222042857, 0.16716265305876732] |
1,802.08989 | Enhancing Gaussian Estimation of Distribution Algorithm by Exploiting
Evolution Direction with Archive | As a typical model-based evolutionary algorithm (EA), estimation of
distribution algorithm (EDA) possesses unique characteristics and has been
widely applied to global optimization. However, the common-used Gaussian EDA
(GEDA) usually suffers from premature convergence which severely limits its
search efficiency. This study first systematically analyses the reasons for the
deficiency of the traditional GEDA, then tries to enhance its performance by
exploiting its evolution direction, and finally develops a new GEDA variant
named EDA2. Instead of only utilizing some good solutions produced in the
current generation when estimating the Gaussian model, EDA2 preserves a certain
number of high-quality solutions generated in previous generations into an
archive and takes advantage of these historical solutions to assist estimating
the covariance matrix of Gaussian model. By this means, the evolution direction
information hidden in the archive is naturally integrated into the estimated
model which in turn can guide EDA2 towards more promising solution regions.
Moreover, the new estimation method significantly reduces the population size
of EDA2 since it needs fewer individuals in the current population for model
estimation. As a result, a fast convergence can be achieved. To verify the
efficiency of EDA2, we tested it on a variety of benchmark functions and
compared it with several state-of-the-art EAs, including IPOP-CMAES, AMaLGaM,
three high-powered DE algorithms, and a new PSO algorithm. The experimental
results demonstrate that EDA2 is efficient and competitive.
| cs.NE | as a typical modelbased evolutionary algorithm ea estimation of distribution algorithm eda possesses unique characteristics and has been widely applied to global optimization however the commonused gaussian eda geda usually suffers from premature convergence which severely limits its search efficiency this study first systematically analyses the reasons for the deficiency of the traditional geda then tries to enhance its performance by exploiting its evolution direction and finally develops a new geda variant named eda2 instead of only utilizing some good solutions produced in the current generation when estimating the gaussian model eda2 preserves a certain number of highquality solutions generated in previous generations into an archive and takes advantage of these historical solutions to assist estimating the covariance matrix of gaussian model by this means the evolution direction information hidden in the archive is naturally integrated into the estimated model which in turn can guide eda2 towards more promising solution regions moreover the new estimation method significantly reduces the population size of eda2 since it needs fewer individuals in the current population for model estimation as a result a fast convergence can be achieved to verify the efficiency of eda2 we tested it on a variety of benchmark functions and compared it with several stateoftheart eas including ipopcmaes amalgam three highpowered de algorithms and a new pso algorithm the experimental results demonstrate that eda2 is efficient and competitive | [['as', 'a', 'typical', 'modelbased', 'evolutionary', 'algorithm', 'ea', 'estimation', 'of', 'distribution', 'algorithm', 'eda', 'possesses', 'unique', 'characteristics', 'and', 'has', 'been', 'widely', 'applied', 'to', 'global', 'optimization', 'however', 'the', 'commonused', 'gaussian', 'eda', 'geda', 'usually', 'suffers', 'from', 'premature', 'convergence', 'which', 'severely', 'limits', 'its', 'search', 'efficiency', 'this', 'study', 'first', 'systematically', 'analyses', 'the', 'reasons', 'for', 'the', 'deficiency', 'of', 'the', 'traditional', 'geda', 'then', 'tries', 'to', 'enhance', 'its', 'performance', 'by', 'exploiting', 'its', 'evolution', 'direction', 'and', 'finally', 'develops', 'a', 'new', 'geda', 'variant', 'named', 'eda2', 'instead', 'of', 'only', 'utilizing', 'some', 'good', 'solutions', 'produced', 'in', 'the', 'current', 'generation', 'when', 'estimating', 'the', 'gaussian', 'model', 'eda2', 'preserves', 'a', 'certain', 'number', 'of', 'highquality', 'solutions', 'generated', 'in', 'previous', 'generations', 'into', 'an', 'archive', 'and', 'takes', 'advantage', 'of', 'these', 'historical', 'solutions', 'to', 'assist', 'estimating', 'the', 'covariance', 'matrix', 'of', 'gaussian', 'model', 'by', 'this', 'means', 'the', 'evolution', 'direction', 'information', 'hidden', 'in', 'the', 'archive', 'is', 'naturally', 'integrated', 'into', 'the', 'estimated', 'model', 'which', 'in', 'turn', 'can', 'guide', 'eda2', 'towards', 'more', 'promising', 'solution', 'regions', 'moreover', 'the', 'new', 'estimation', 'method', 'significantly', 'reduces', 'the', 'population', 'size', 'of', 'eda2', 'since', 'it', 'needs', 'fewer', 'individuals', 'in', 'the', 'current', 'population', 'for', 'model', 'estimation', 'as', 'a', 'result', 'a', 'fast', 'convergence', 'can', 'be', 'achieved', 'to', 'verify', 'the', 'efficiency', 'of', 'eda2', 'we', 'tested', 'it', 'on', 'a', 'variety', 'of', 'benchmark', 'functions', 'and', 'compared', 'it', 'with', 'several', 'stateoftheart', 'eas', 'including', 'ipopcmaes', 'amalgam', 'three', 'highpowered', 'de', 'algorithms', 'and', 'a', 'new', 'pso', 'algorithm', 'the', 'experimental', 'results', 'demonstrate', 'that', 'eda2', 'is', 'efficient', 'and', 'competitive']] | [-0.045441108029588145, 0.018182337944011053, -0.10636929806169386, 0.07570747918355591, -0.08331631495724473, -0.13962130979181522, 0.05293571251749465, 0.37609929629020494, -0.2804099276159123, -0.3359324764501534, 0.13602327231567074, -0.2351720835776604, -0.1460340209202264, 0.2111980803921279, -0.07207311311012102, 0.0689197994577513, 0.09322186441323514, 0.003249618805846018, -0.055181870930333644, -0.2505971187879167, 0.23949926685484177, 0.08668144947058001, 0.3414845518691597, -0.01952602338500164, 0.10342083986131556, -0.011079545944632419, -0.045597321420817315, 0.018944910609480652, -0.07442053273517615, 0.12244248245348248, 0.21572663419389587, 0.20513052415551897, 0.31163171274109486, -0.37727687963432904, -0.21302652074769962, 0.12251489497443034, 0.20755623962186212, 0.10327983536629781, -0.08897242789854454, -0.289745509582242, 0.10917266580663555, -0.17134195163565796, -0.09733319154062794, -0.08328949873422198, -0.038361103797282005, 0.02827739295399278, -0.28824491774873495, 0.039997400839574045, 0.03924220922301045, 0.003756590544007125, -0.05378235169671954, -0.15973417798265305, 0.0043954234477544644, 0.1084728067287757, 0.05542933209788928, 0.04068163519857072, 0.11013922839197825, -0.14752846281456275, -0.11801556778033223, 0.3487940774818437, -0.063454750580435, -0.19584839290164544, 0.18882116655107234, -0.07241856355932995, -0.13623121479913528, 0.13979758522694774, 0.17913399344573902, 0.11874855235052878, -0.16961010053386322, 0.059017104814261756, -0.009563845197260133, 0.16108271926311793, 0.011874834825573242, 0.00858418182243255, 0.16144047143242726, 0.21883131884217707, 0.08569251919016901, 0.13635469612148302, -0.09680375783313766, -0.11686619075295408, -0.20454651110679883, -0.14326466142356528, -0.17165441378442142, -0.0019605361971905275, -0.10862376825872137, -0.14349491119104546, 0.42835847350183576, 0.20297231296060886, 0.1711655032331772, 0.05225394891917013, 0.3293114806220463, 0.10001790594717537, 0.06642614441730114, 0.07742218500048549, 0.2175767932884834, 0.08730432039757251, 0.09380082916097501, -0.19822654216158805, 0.11362223441102666, 0.044086626811474315] |
1,802.0899 | Role of flow of information in the speedup of quantum evolution | The quantum evolution can be accelerated in non-Markovian environment.
Previous results showed that the formation of system-environment bound state
governs the quantum speedup. Although a stronger bound state in the
system-environment spectrum may seem like it should cause greater speed of
evolution, this seemingly intuitive thinking may not always be correct. We
illustrate this by investigating a qubit driven by a classical field and
coupled to a photonic crystal waveguide in the presence of a mirror. The
perfect mirror can force part of the emitted light to return back to the qubit,
and thus induce non-Markovian dynamics. Within the considered model, we show
how the evolution speed is influenced by the memory time and the classical
driving strength. In particular, we find that the formation of bound state is
not the essential reason for the acceleration of evolution. The quantum speedup
is attributed to the flow of information, regardless of the direction in which
the information flows. Our conclusion can also be used to other non-Markovian
environments.
| quant-ph | the quantum evolution can be accelerated in nonmarkovian environment previous results showed that the formation of systemenvironment bound state governs the quantum speedup although a stronger bound state in the systemenvironment spectrum may seem like it should cause greater speed of evolution this seemingly intuitive thinking may not always be correct we illustrate this by investigating a qubit driven by a classical field and coupled to a photonic crystal waveguide in the presence of a mirror the perfect mirror can force part of the emitted light to return back to the qubit and thus induce nonmarkovian dynamics within the considered model we show how the evolution speed is influenced by the memory time and the classical driving strength in particular we find that the formation of bound state is not the essential reason for the acceleration of evolution the quantum speedup is attributed to the flow of information regardless of the direction in which the information flows our conclusion can also be used to other nonmarkovian environments | [['the', 'quantum', 'evolution', 'can', 'be', 'accelerated', 'in', 'nonmarkovian', 'environment', 'previous', 'results', 'showed', 'that', 'the', 'formation', 'of', 'systemenvironment', 'bound', 'state', 'governs', 'the', 'quantum', 'speedup', 'although', 'a', 'stronger', 'bound', 'state', 'in', 'the', 'systemenvironment', 'spectrum', 'may', 'seem', 'like', 'it', 'should', 'cause', 'greater', 'speed', 'of', 'evolution', 'this', 'seemingly', 'intuitive', 'thinking', 'may', 'not', 'always', 'be', 'correct', 'we', 'illustrate', 'this', 'by', 'investigating', 'a', 'qubit', 'driven', 'by', 'a', 'classical', 'field', 'and', 'coupled', 'to', 'a', 'photonic', 'crystal', 'waveguide', 'in', 'the', 'presence', 'of', 'a', 'mirror', 'the', 'perfect', 'mirror', 'can', 'force', 'part', 'of', 'the', 'emitted', 'light', 'to', 'return', 'back', 'to', 'the', 'qubit', 'and', 'thus', 'induce', 'nonmarkovian', 'dynamics', 'within', 'the', 'considered', 'model', 'we', 'show', 'how', 'the', 'evolution', 'speed', 'is', 'influenced', 'by', 'the', 'memory', 'time', 'and', 'the', 'classical', 'driving', 'strength', 'in', 'particular', 'we', 'find', 'that', 'the', 'formation', 'of', 'bound', 'state', 'is', 'not', 'the', 'essential', 'reason', 'for', 'the', 'acceleration', 'of', 'evolution', 'the', 'quantum', 'speedup', 'is', 'attributed', 'to', 'the', 'flow', 'of', 'information', 'regardless', 'of', 'the', 'direction', 'in', 'which', 'the', 'information', 'flows', 'our', 'conclusion', 'can', 'also', 'be', 'used', 'to', 'other', 'nonmarkovian', 'environments']] | [-0.13809827778001824, 0.1811833601182851, -0.12854371428445072, 0.059404178622037916, -0.05049391204636254, -0.13763008253024278, 0.015064380501123692, 0.3614942104483168, -0.2851945523417995, -0.3051012127163881, 0.054562187143657244, -0.20484552398312858, -0.1315030600153423, 0.21435678922320286, -0.05482798553919587, 0.006297230015057111, 0.07020234300972458, 0.04902171631884611, -0.025674842512736957, -0.24772093627144565, 0.28684204251890233, 0.08121171680873003, 0.28681388582398526, 0.07722485180202493, 0.055280279538254005, -0.029441698892097808, 0.041391056301462614, 0.005724997058912309, -0.08165576594819324, 0.07079917767982997, 0.22572771597843239, 0.09467984841088067, 0.2801778619428595, -0.46682361559105845, -0.23185041380006105, 0.10192512525914761, 0.166495183282002, 0.17677522964237402, -0.03691441873241841, -0.3052300989417315, 0.029712195260015256, -0.1404951104077282, -0.153708926142712, -0.04807524709030986, -0.007232202449116387, -0.010811820499387063, -0.21709115067106521, 0.08180404462956846, 0.12633327350527895, -0.028450222607858167, -0.033707284594434284, -0.010485573734496972, -0.01481065088687855, 0.1343110089223765, 0.007598950954929307, 0.03726684439419852, 0.17733798878724705, -0.156555991117915, -0.12499237651406915, 0.37652735429408846, -0.10414221804536054, -0.1887802495537493, 0.18457655303325213, -0.15651114702762892, -0.06640607554432072, 0.11106661374228978, 0.15429411940576374, 0.06496468179825761, -0.13659341581037523, 0.03454624170132126, 0.0043831315737853415, 0.2077511597705676, 0.027340896055206912, 0.08039124515242205, 0.21613523623945113, 0.12959354348525315, 0.05440858277857504, 0.15879965676022637, -0.04756565071352406, -0.18515874867043094, -0.28203832084301883, -0.1763963984394541, -0.17782768919439373, 0.10587780626393467, -0.0733462394837152, -0.11499093669957432, 0.3914405213108476, 0.18511535361211212, 0.1551892467972078, -0.010067852904802624, 0.26572628839577206, 0.1397912532884438, 0.06052338475261084, 0.11868711016391834, 0.2971745176285416, 0.12662276393499694, 0.08726181655363766, -0.305000659074177, 0.12795174608152068, -0.001660820333744416] |
1,802.08991 | A Compactness Result for $\mathcal{H}-$holomorphic Curves in
Symplectizations | $\mathcal{H}-$holomorphic curves are solutions of a specific modification of
the pseudoholomorphic curve equation in symplectizations involving a harmonic
$1-$form as perturbation term. In this paper we compactify the moduli space of
$\mathcal{H}-$holomorphic curves with a priori bounds on the harmonic
$1-$forms.
| math.SG math.DG | mathcalhholomorphic curves are solutions of a specific modification of the pseudoholomorphic curve equation in symplectizations involving a harmonic 1form as perturbation term in this paper we compactify the moduli space of mathcalhholomorphic curves with a priori bounds on the harmonic 1forms | [['mathcalhholomorphic', 'curves', 'are', 'solutions', 'of', 'a', 'specific', 'modification', 'of', 'the', 'pseudoholomorphic', 'curve', 'equation', 'in', 'symplectizations', 'involving', 'a', 'harmonic', '1form', 'as', 'perturbation', 'term', 'in', 'this', 'paper', 'we', 'compactify', 'the', 'moduli', 'space', 'of', 'mathcalhholomorphic', 'curves', 'with', 'a', 'priori', 'bounds', 'on', 'the', 'harmonic', '1forms']] | [-0.23346719495588686, 0.06433943216121052, -0.15931402728324984, 0.08873327583835529, -0.16624306492144014, -0.10969717052151881, 0.005086582997336802, 0.2879729496723995, -0.2543780843659145, -0.22175203577229163, 0.10207165723734694, -0.28959283153185755, -0.2023313998630861, 0.238885735593191, -0.1424831922234195, 0.06337624751940006, 0.0383097380399704, 0.04943792658244691, -0.10451209279367836, -0.2668704541013917, 0.45201962241312355, -0.07441708182052868, 0.1490804321564189, 0.03027553097685663, 0.10582685831752492, -0.011683066369874812, 0.017385134836885988, -0.07419684478266324, -0.20420414166206993, 0.16140496743297794, 0.2168871352403629, 0.018904913205471708, 0.14818621624442863, -0.39226270076341746, -0.25906711998509196, 0.1857704740449241, 0.11685073374566145, 0.035545088532494336, -0.002552777179516852, -0.22218856906018605, -0.008077618973003133, -0.05741067216504456, -0.2127241903870571, -0.11845484923389626, 0.0340139690895562, 0.10202542840071567, -0.1854091576504998, 0.052726766253571686, 0.055882148558228484, 0.14083377546744374, -0.13998218281648872, -0.022390562177794737, -0.0635372846410042, -0.003780938991595332, 0.05440795385256046, 0.1208794337197593, 0.056555670674708555, -0.1398817411816974, -0.07431318479158529, 0.377904826502611, -0.19701748150514392, -0.3288430860493241, 0.02367374582625017, -0.12622117510110867, -0.14616901571748825, 0.09300216962583363, 0.1731691185680286, 0.21718793094339894, -0.10272556500191368, 0.17092402454283906, -0.027090548537671566, 0.12485666359524901, 0.13825510384333206, -0.043461515136608266, 0.1181230132990494, 0.09270623738014298, 0.07985636201210139, 0.14724954418133854, -0.029321727700667773, -0.10115475516493727, -0.4457583743624571, -0.20692657854226304, -0.11302543422434388, 0.11406460717865606, -0.1568924112063719, -0.2105784722371027, 0.41192045052558546, -0.045035448089659376, 0.2161464964425782, 0.09930348982353036, 0.25245905867437035, 0.11125852567109666, 0.00916625877342573, 0.039037884812143334, 0.22290547439692224, 0.17483299282356735, 0.05643224708236209, -0.14219592878504134, -0.08998680072723002, 0.2187099811598295] |
1,802.08992 | Bayesian linear inverse problems in regularity scales | We obtain rates of contraction of posterior distributions in inverse problems
defined by scales of smoothness classes. We derive abstract results for general
priors, with contraction rates determined by Galerkin approximation. The rate
depends on the amount of prior concentration near the true function and the
prior mass of functions with inferior Galerkin approximation. We apply the
general result to non-conjugate series priors, showing that these priors give
near optimal and adaptive recovery in some generality, Gaussian priors, and
mixtures of Gaussian priors, where the latter are also shown to be near optimal
and adaptive. The proofs are based on general testing and approximation
arguments, without explicit calculations on the posterior distribution. We are
thus not restricted to priors based on the singular value decomposition of the
operator. We illustrate the results with examples of inverse problems resulting
from differential equations.
| math.ST stat.TH | we obtain rates of contraction of posterior distributions in inverse problems defined by scales of smoothness classes we derive abstract results for general priors with contraction rates determined by galerkin approximation the rate depends on the amount of prior concentration near the true function and the prior mass of functions with inferior galerkin approximation we apply the general result to nonconjugate series priors showing that these priors give near optimal and adaptive recovery in some generality gaussian priors and mixtures of gaussian priors where the latter are also shown to be near optimal and adaptive the proofs are based on general testing and approximation arguments without explicit calculations on the posterior distribution we are thus not restricted to priors based on the singular value decomposition of the operator we illustrate the results with examples of inverse problems resulting from differential equations | [['we', 'obtain', 'rates', 'of', 'contraction', 'of', 'posterior', 'distributions', 'in', 'inverse', 'problems', 'defined', 'by', 'scales', 'of', 'smoothness', 'classes', 'we', 'derive', 'abstract', 'results', 'for', 'general', 'priors', 'with', 'contraction', 'rates', 'determined', 'by', 'galerkin', 'approximation', 'the', 'rate', 'depends', 'on', 'the', 'amount', 'of', 'prior', 'concentration', 'near', 'the', 'true', 'function', 'and', 'the', 'prior', 'mass', 'of', 'functions', 'with', 'inferior', 'galerkin', 'approximation', 'we', 'apply', 'the', 'general', 'result', 'to', 'nonconjugate', 'series', 'priors', 'showing', 'that', 'these', 'priors', 'give', 'near', 'optimal', 'and', 'adaptive', 'recovery', 'in', 'some', 'generality', 'gaussian', 'priors', 'and', 'mixtures', 'of', 'gaussian', 'priors', 'where', 'the', 'latter', 'are', 'also', 'shown', 'to', 'be', 'near', 'optimal', 'and', 'adaptive', 'the', 'proofs', 'are', 'based', 'on', 'general', 'testing', 'and', 'approximation', 'arguments', 'without', 'explicit', 'calculations', 'on', 'the', 'posterior', 'distribution', 'we', 'are', 'thus', 'not', 'restricted', 'to', 'priors', 'based', 'on', 'the', 'singular', 'value', 'decomposition', 'of', 'the', 'operator', 'we', 'illustrate', 'the', 'results', 'with', 'examples', 'of', 'inverse', 'problems', 'resulting', 'from', 'differential', 'equations']] | [-0.0034666700088022712, 0.03297959274698234, -0.11137357568170161, 0.09837869899215322, -0.10019979991533971, -0.10222335809392603, 0.06415165695923229, 0.4138713812468745, -0.29362186469659474, -0.27794508105276006, 0.15283346010854218, -0.21215028198541586, -0.1302206574126761, 0.19627541624643702, -0.09381490342107647, 0.10280250558457898, 0.061384103360011225, -0.005178489576998755, -0.16411489015610242, -0.25153088162930565, 0.3669885022711035, 0.0645777202931279, 0.275913987698443, 0.009401746249447266, 0.12111602316722803, 4.73195455757016e-05, -0.0615518416793264, -0.03094161595779319, -0.20987878610894575, 0.13117682505134784, 0.23532600841874665, 0.13420528775834023, 0.2813778289210659, -0.3843389556921543, -0.21229717001015097, 0.12080282927655898, 0.11778061004051714, 0.09133773213186373, -0.031298539393204955, -0.2809802261643534, 0.06658225590759452, -0.10117024857656541, -0.10039697194485166, -0.11821907564109284, -0.05264132860585624, 0.09198309845746831, -0.38204994064868025, 0.13830956644093756, 0.08510058000023273, 0.03667041180602313, -0.10885076207424191, -0.1737458326908304, 0.027436690300980462, 0.04700758621915647, 0.058092210744012225, -0.04882208558116505, 0.12413304727788724, -0.1121002895863238, -0.08005806680517734, 0.3105104599058866, -0.07123123419121014, -0.286870733581125, 0.16570682842152337, -0.14659595848490478, -0.11481168867395992, 0.10311775613354902, 0.19604477605366327, 0.1690534975029634, -0.10642054953434049, 0.12446942854571942, -0.01696875223936183, 0.1189987168495431, 0.09229716886881845, -0.006125405127370849, 0.1053187934031994, 0.0938252145870331, 0.10109657650905932, 0.11439354622865373, -0.061541646127820225, -0.13559389757553894, -0.3310056854277215, -0.07974280847949868, -0.20340494061853234, 0.006405007026545498, -0.18542490508157597, -0.20866680933316964, 0.33998676017587276, 0.15939299998712456, 0.2037609630059583, 0.12933273734326692, 0.2591475122096347, 0.16859544133305127, 0.019752645330067646, 0.09586788536254184, 0.22319220307432544, 0.15699007865272674, -0.0024020901570717492, -0.16721208830667883, 0.1152659742663621, 0.09965159311883998] |
1,802.08993 | Bayesian inverse problems with partial observations | We study a nonparametric Bayesian approach to linear inverse problems under
discrete observations. We use the discrete Fourier transform to convert our
model into a truncated Gaussian sequence model, that is closely related to the
classical Gaussian sequence model. Upon placing the truncated series prior on
the unknown parameter, we show that as the number of observations
$n\rightarrow\infty,$ the corresponding posterior distribution contracts around
the true parameter at a rate depending on the smoothness of the true parameter
and the prior, and the ill-posedness degree of the problem. Correct
combinations of these values lead to optimal posterior contraction rates (up to
logarithmic factors). Similarly, the frequentist coverage of Bayesian credible
sets is shown to be dependent on a combination of smoothness of the true
parameter and the prior, and the ill-posedness of the problem. Oversmoothing
priors lead to zero coverage, while undersmoothing priors produce highly
conservative results. Finally, we illustrate our theoretical results by
numerical examples.
| math.ST stat.TH | we study a nonparametric bayesian approach to linear inverse problems under discrete observations we use the discrete fourier transform to convert our model into a truncated gaussian sequence model that is closely related to the classical gaussian sequence model upon placing the truncated series prior on the unknown parameter we show that as the number of observations nrightarrowinfty the corresponding posterior distribution contracts around the true parameter at a rate depending on the smoothness of the true parameter and the prior and the illposedness degree of the problem correct combinations of these values lead to optimal posterior contraction rates up to logarithmic factors similarly the frequentist coverage of bayesian credible sets is shown to be dependent on a combination of smoothness of the true parameter and the prior and the illposedness of the problem oversmoothing priors lead to zero coverage while undersmoothing priors produce highly conservative results finally we illustrate our theoretical results by numerical examples | [['we', 'study', 'a', 'nonparametric', 'bayesian', 'approach', 'to', 'linear', 'inverse', 'problems', 'under', 'discrete', 'observations', 'we', 'use', 'the', 'discrete', 'fourier', 'transform', 'to', 'convert', 'our', 'model', 'into', 'a', 'truncated', 'gaussian', 'sequence', 'model', 'that', 'is', 'closely', 'related', 'to', 'the', 'classical', 'gaussian', 'sequence', 'model', 'upon', 'placing', 'the', 'truncated', 'series', 'prior', 'on', 'the', 'unknown', 'parameter', 'we', 'show', 'that', 'as', 'the', 'number', 'of', 'observations', 'nrightarrowinfty', 'the', 'corresponding', 'posterior', 'distribution', 'contracts', 'around', 'the', 'true', 'parameter', 'at', 'a', 'rate', 'depending', 'on', 'the', 'smoothness', 'of', 'the', 'true', 'parameter', 'and', 'the', 'prior', 'and', 'the', 'illposedness', 'degree', 'of', 'the', 'problem', 'correct', 'combinations', 'of', 'these', 'values', 'lead', 'to', 'optimal', 'posterior', 'contraction', 'rates', 'up', 'to', 'logarithmic', 'factors', 'similarly', 'the', 'frequentist', 'coverage', 'of', 'bayesian', 'credible', 'sets', 'is', 'shown', 'to', 'be', 'dependent', 'on', 'a', 'combination', 'of', 'smoothness', 'of', 'the', 'true', 'parameter', 'and', 'the', 'prior', 'and', 'the', 'illposedness', 'of', 'the', 'problem', 'oversmoothing', 'priors', 'lead', 'to', 'zero', 'coverage', 'while', 'undersmoothing', 'priors', 'produce', 'highly', 'conservative', 'results', 'finally', 'we', 'illustrate', 'our', 'theoretical', 'results', 'by', 'numerical', 'examples']] | [-0.026471583575281937, 0.030962196100377835, -0.10484209103061659, 0.09674419385518353, -0.11147122536427699, -0.0894348491460849, 0.10465483119929932, 0.38676142544509506, -0.32218902726442766, -0.29056031795708126, 0.13780256168012364, -0.23207338833106825, -0.1236244934425952, 0.18252009669436703, -0.09848730196991266, 0.11567397955038289, 0.043094190959938064, 0.009729903271923272, -0.09534038595843296, -0.27566770958499265, 0.3174495064975837, 0.08334520458279607, 0.28980744275479364, -0.025366173330649663, 0.10643164492928638, -0.005672503563497837, -0.043362701243052304, -0.03481148920195082, -0.18406418817036097, 0.11661708684942614, 0.2095951831045871, 0.1425129052442618, 0.31193355367614484, -0.35746507152007556, -0.23263427240845674, 0.12413545384800109, 0.1120873681636742, 0.06587470357174961, 0.0211331771801596, -0.28045200679051235, 0.06642942323546427, -0.1311321081572178, -0.11060918883110087, -0.09335131256226212, -0.05234126484869287, 0.04176039558063703, -0.36178058119586265, 0.1380935536670642, 0.07887158347054934, -0.017396180227828715, -0.07725296792789148, -0.14619736358051738, -9.337506698778807e-05, 0.07277759460647268, 0.09906831719891694, 0.008216897737628851, 0.08727801915031308, -0.12861504423199221, -0.0688917971132562, 0.30638841832152164, -0.04935695495171389, -0.26062549353362274, 0.1543429119285578, -0.1454290156103432, -0.1265934906379045, 0.128849263895506, 0.18187698005409075, 0.12965747436884648, -0.0969702699341071, 0.08912089542718604, -0.03999078474067247, 0.18179862520012718, 0.0634167152598727, -0.023386734490020152, 0.16705506385187618, 0.11222947655150141, 0.10739558688902225, 0.13921334195317916, -0.12028393315043874, -0.12620941039550906, -0.32151551916001314, -0.08159350886797676, -0.20463941451788953, 0.00584796752082184, -0.17735666811775166, -0.1984944984811964, 0.3912329010737057, 0.19747676784344292, 0.23559230112303525, 0.1267715090141745, 0.25737757309793663, 0.15153747612613444, 0.005491880091050496, 0.024998082271896493, 0.20271085350750348, 0.1289870747594903, 0.003060112168522886, -0.17851664394868585, 0.10752506995907961, 0.01281290924630295] |
1,802.08994 | Adaptive Streaming in Interactive Multiview Video Systems | Multiview applications endow final users with the possibility to freely
navigate within 3D scenes with minimum-delay. A real feeling of scene
navigation is enabled by transmitting multiple high-quality camera views, which
can be used to synthesize additional virtual views to offer a smooth
navigation. However, when network resources are limited, not all camera views
can be sent at high quality. It is therefore important, yet challenging, to
find the right tradeoff between coding artifacts (reducing the quality of
camera views) and virtual synthesis artifacts (reducing the number of camera
views sent to users). To this aim, we propose an optimal transmission strategy
for interactive multiview HTTP adaptive streaming (HAS). We propose a problem
formulation to select the optimal set of camera views that the client requests
for downloading, such that the navigation quality experienced by the user is
optimized while the bandwidth constraints are satisfied. We show that our
optimization problem is NP-hard, and we therefore develop an optimal solution
based on the dynamic programming algorithm with polynomial time complexity. To
further simplify the deployment, we present a suboptimal greedy algorithm with
effective performance and lower complexity. The proposed controller is
evaluated in theoretical and realistic settings characterized by realistic
network statistics estimation, buffer management and server-side representation
optimization. Simulation results show significant improvement in terms of
navigation quality compared with alternative baseline multiview adaptation
logic solutions.
| cs.MM | multiview applications endow final users with the possibility to freely navigate within 3d scenes with minimumdelay a real feeling of scene navigation is enabled by transmitting multiple highquality camera views which can be used to synthesize additional virtual views to offer a smooth navigation however when network resources are limited not all camera views can be sent at high quality it is therefore important yet challenging to find the right tradeoff between coding artifacts reducing the quality of camera views and virtual synthesis artifacts reducing the number of camera views sent to users to this aim we propose an optimal transmission strategy for interactive multiview http adaptive streaming has we propose a problem formulation to select the optimal set of camera views that the client requests for downloading such that the navigation quality experienced by the user is optimized while the bandwidth constraints are satisfied we show that our optimization problem is nphard and we therefore develop an optimal solution based on the dynamic programming algorithm with polynomial time complexity to further simplify the deployment we present a suboptimal greedy algorithm with effective performance and lower complexity the proposed controller is evaluated in theoretical and realistic settings characterized by realistic network statistics estimation buffer management and serverside representation optimization simulation results show significant improvement in terms of navigation quality compared with alternative baseline multiview adaptation logic solutions | [['multiview', 'applications', 'endow', 'final', 'users', 'with', 'the', 'possibility', 'to', 'freely', 'navigate', 'within', '3d', 'scenes', 'with', 'minimumdelay', 'a', 'real', 'feeling', 'of', 'scene', 'navigation', 'is', 'enabled', 'by', 'transmitting', 'multiple', 'highquality', 'camera', 'views', 'which', 'can', 'be', 'used', 'to', 'synthesize', 'additional', 'virtual', 'views', 'to', 'offer', 'a', 'smooth', 'navigation', 'however', 'when', 'network', 'resources', 'are', 'limited', 'not', 'all', 'camera', 'views', 'can', 'be', 'sent', 'at', 'high', 'quality', 'it', 'is', 'therefore', 'important', 'yet', 'challenging', 'to', 'find', 'the', 'right', 'tradeoff', 'between', 'coding', 'artifacts', 'reducing', 'the', 'quality', 'of', 'camera', 'views', 'and', 'virtual', 'synthesis', 'artifacts', 'reducing', 'the', 'number', 'of', 'camera', 'views', 'sent', 'to', 'users', 'to', 'this', 'aim', 'we', 'propose', 'an', 'optimal', 'transmission', 'strategy', 'for', 'interactive', 'multiview', 'http', 'adaptive', 'streaming', 'has', 'we', 'propose', 'a', 'problem', 'formulation', 'to', 'select', 'the', 'optimal', 'set', 'of', 'camera', 'views', 'that', 'the', 'client', 'requests', 'for', 'downloading', 'such', 'that', 'the', 'navigation', 'quality', 'experienced', 'by', 'the', 'user', 'is', 'optimized', 'while', 'the', 'bandwidth', 'constraints', 'are', 'satisfied', 'we', 'show', 'that', 'our', 'optimization', 'problem', 'is', 'nphard', 'and', 'we', 'therefore', 'develop', 'an', 'optimal', 'solution', 'based', 'on', 'the', 'dynamic', 'programming', 'algorithm', 'with', 'polynomial', 'time', 'complexity', 'to', 'further', 'simplify', 'the', 'deployment', 'we', 'present', 'a', 'suboptimal', 'greedy', 'algorithm', 'with', 'effective', 'performance', 'and', 'lower', 'complexity', 'the', 'proposed', 'controller', 'is', 'evaluated', 'in', 'theoretical', 'and', 'realistic', 'settings', 'characterized', 'by', 'realistic', 'network', 'statistics', 'estimation', 'buffer', 'management', 'and', 'serverside', 'representation', 'optimization', 'simulation', 'results', 'show', 'significant', 'improvement', 'in', 'terms', 'of', 'navigation', 'quality', 'compared', 'with', 'alternative', 'baseline', 'multiview', 'adaptation', 'logic', 'solutions']] | [-0.13302904212363229, -0.003964511368763203, -0.07864897334455853, 0.029208302091179406, -0.15354038350333332, -0.22596153094215804, 0.07207796742548829, 0.46104550430559377, -0.2891532215351313, -0.38600788402293157, 0.08401266783619472, -0.22980013629421592, -0.16767310414725858, 0.18040259722989496, -0.20647909332555, 0.1031190972079806, 0.11155716240168077, 8.449214818325336e-05, -0.04775823503712168, -0.3083560558811388, 0.24039883821964722, 0.0696288351449574, 0.3492248751538998, 0.01097219734194192, 0.13895957299127626, 0.04590257680215893, -0.028387288302429314, 0.022960283891461986, -0.06574518952488828, 0.13470827223269458, 0.3638592288882722, 0.2453363031489438, 0.3039777872443921, -0.43634933931958175, -0.18712455947218784, 0.05527370755810963, 0.16282291443288194, 0.06934251905663046, -0.07047265784205696, -0.3281416421887436, 0.10295731718764775, -0.16259958702939592, -0.02623849486448035, -0.07844196574758361, -0.03885678643163802, -0.01916312753907015, -0.3332869433469676, -0.04338172789612305, -0.051712762208507776, 0.043189102697641577, -0.07564203853160964, -0.056423206845429695, 0.040734314427419774, 0.19888011978835068, 0.014122277757359077, 0.04834003555937157, 0.14591293600039137, -0.15072898338559096, -0.13519903525939858, 0.3984157837648355, 0.0228185666158861, -0.24762667361328927, 0.1746322780463943, -0.027618973349766717, -0.10399540244819112, 0.17332701668931, 0.2318275491889086, 0.09717222377206589, -0.16332954789814694, 0.030238095938386025, -0.03501313262401633, 0.2074304863406419, 0.07297344065460044, 0.048573140773946824, 0.1642258787222026, 0.22841874541948645, 0.12866352969680048, 0.1501301768859479, -0.0751739196183923, -0.058859229046802165, -0.20564042545454003, -0.10893543551179544, -0.18852535260088396, -0.01896614395274313, -0.12338891430799737, -0.102432031262387, 0.33963137396943593, 0.2496720181700121, 0.13774466100620672, 0.11373681279713706, 0.4224579285436396, 0.05096621177727736, 0.058650866866784605, 0.1262587694131199, 0.14988608321068309, -0.051677261686387435, 0.15820430556316306, -0.18737390298357373, 0.0983495526764509, 0.035866155274753925] |
1,802.08995 | Using Information Invariants to Compare Swarm Algorithms and General
Multi-Robot Algorithms: A Technical Report | Robotic swarms are decentralized multi-robot systems whose members use local
information from proximal neighbors to execute simple reactive control laws
that result in emergent collective behaviors. In contrast, members of a general
multi-robot system may have access to global information, all- to-all
communication or sophisticated deliberative collabora- tion. Some algorithms in
the literature are applicable to robotic swarms. Others require the extra
complexity of general multi- robot systems. Given an application domain, a
system designer or supervisory operator must choose an appropriate system or
algorithm respectively that will enable them to achieve their goals while
satisfying mission constraints (e.g. bandwidth, energy, time limits). In this
paper, we compare representative swarm and general multi-robot algorithms in
two application domains - navigation and dynamic area coverage - with respect
to several metrics (e.g. completion time, distance trav- elled). Our objective
is to characterize each class of algorithms to inform offline system design
decisions by engineers or online algorithm selection decisions by supervisory
operators. Our contributions are (a) an empirical performance comparison of
representative swarm and general multi-robot algorithms in two application
domains, (b) a comparative analysis of the algorithms based on the theory of
information invariants, which provides a theoretical characterization supported
by our empirical results.
| cs.RO cs.IT cs.MA math.IT | robotic swarms are decentralized multirobot systems whose members use local information from proximal neighbors to execute simple reactive control laws that result in emergent collective behaviors in contrast members of a general multirobot system may have access to global information all toall communication or sophisticated deliberative collabora tion some algorithms in the literature are applicable to robotic swarms others require the extra complexity of general multi robot systems given an application domain a system designer or supervisory operator must choose an appropriate system or algorithm respectively that will enable them to achieve their goals while satisfying mission constraints eg bandwidth energy time limits in this paper we compare representative swarm and general multirobot algorithms in two application domains navigation and dynamic area coverage with respect to several metrics eg completion time distance trav elled our objective is to characterize each class of algorithms to inform offline system design decisions by engineers or online algorithm selection decisions by supervisory operators our contributions are a an empirical performance comparison of representative swarm and general multirobot algorithms in two application domains b a comparative analysis of the algorithms based on the theory of information invariants which provides a theoretical characterization supported by our empirical results | [['robotic', 'swarms', 'are', 'decentralized', 'multirobot', 'systems', 'whose', 'members', 'use', 'local', 'information', 'from', 'proximal', 'neighbors', 'to', 'execute', 'simple', 'reactive', 'control', 'laws', 'that', 'result', 'in', 'emergent', 'collective', 'behaviors', 'in', 'contrast', 'members', 'of', 'a', 'general', 'multirobot', 'system', 'may', 'have', 'access', 'to', 'global', 'information', 'all', 'toall', 'communication', 'or', 'sophisticated', 'deliberative', 'collabora', 'tion', 'some', 'algorithms', 'in', 'the', 'literature', 'are', 'applicable', 'to', 'robotic', 'swarms', 'others', 'require', 'the', 'extra', 'complexity', 'of', 'general', 'multi', 'robot', 'systems', 'given', 'an', 'application', 'domain', 'a', 'system', 'designer', 'or', 'supervisory', 'operator', 'must', 'choose', 'an', 'appropriate', 'system', 'or', 'algorithm', 'respectively', 'that', 'will', 'enable', 'them', 'to', 'achieve', 'their', 'goals', 'while', 'satisfying', 'mission', 'constraints', 'eg', 'bandwidth', 'energy', 'time', 'limits', 'in', 'this', 'paper', 'we', 'compare', 'representative', 'swarm', 'and', 'general', 'multirobot', 'algorithms', 'in', 'two', 'application', 'domains', 'navigation', 'and', 'dynamic', 'area', 'coverage', 'with', 'respect', 'to', 'several', 'metrics', 'eg', 'completion', 'time', 'distance', 'trav', 'elled', 'our', 'objective', 'is', 'to', 'characterize', 'each', 'class', 'of', 'algorithms', 'to', 'inform', 'offline', 'system', 'design', 'decisions', 'by', 'engineers', 'or', 'online', 'algorithm', 'selection', 'decisions', 'by', 'supervisory', 'operators', 'our', 'contributions', 'are', 'a', 'an', 'empirical', 'performance', 'comparison', 'of', 'representative', 'swarm', 'and', 'general', 'multirobot', 'algorithms', 'in', 'two', 'application', 'domains', 'b', 'a', 'comparative', 'analysis', 'of', 'the', 'algorithms', 'based', 'on', 'the', 'theory', 'of', 'information', 'invariants', 'which', 'provides', 'a', 'theoretical', 'characterization', 'supported', 'by', 'our', 'empirical', 'results']] | [-0.14496919116231077, 0.004386419514673315, -0.0718866673514548, 0.03131067589121739, -0.14273312217391312, -0.1851017936485622, 0.06990965101174126, 0.42808104753306114, -0.2622569961631506, -0.3584984550590264, 0.1251805015872562, -0.2584584960384727, -0.18108161802243705, 0.20110762032040516, -0.14128534200441356, 0.10863131485971142, 0.08494128829051713, 0.033203783757852934, -0.024134507747319987, -0.2516393892448207, 0.2755314226008274, 0.03996265633737273, 0.2694826499427283, -0.024514250016319707, 0.06652241158875345, 0.030024649465110888, -0.023347865220987134, 0.020179079544514117, -0.12118045070640462, 0.1511082060592757, 0.3290450208105448, 0.2156863777376147, 0.34688111850897774, -0.4198017494160343, -0.18586102109684638, 0.10078942608217606, 0.13826790125437924, 0.056883905001215145, -0.03438845042590842, -0.31177831409414386, 0.06202531150939658, -0.16919302711080444, -0.10439998382053366, -0.11220895032153813, -0.02990167502624293, 0.06871817277649163, -0.3087206832838781, -0.04721386763214303, 0.0333896752686776, 0.09803724949803165, -0.10684369306428114, -0.08427825031303471, 0.04699867696506018, 0.17758940804733264, 0.0037859655443974066, 0.0008508890962482176, 0.19574661326190138, -0.10502693275632949, -0.2279159745408429, 0.38987797541976577, 0.0316221091876893, -0.21161293234638492, 0.24635856568394698, -0.022559318573900845, -0.1708607013299685, 0.10445451807945666, 0.2632212553530781, 0.14271348854776758, -0.21245634595327306, 0.05536640309017255, 0.005801032681836549, 0.1634887647956158, 0.006956654108091813, 0.050980687986899434, 0.1645297185245036, 0.20503810125713548, 0.1703164131872149, 0.08873953226121199, 0.02173050604904696, -0.14106327944406957, -0.2348280703364354, -0.12560972740233997, -0.1537235312950515, -0.024697153052348042, -0.08821741598542142, -0.10959412830157413, 0.35182003621388264, 0.17487335018637223, 0.13053918814547513, 0.09863850068462063, 0.34829482610450324, 0.026749751332446444, 0.053564218534074365, 0.10721757490836988, 0.19690605338073142, 0.012413289123967365, 0.1434096564254206, -0.1974883454386145, 0.07528124516829848, 0.03358979533647535] |
1,802.08996 | Spectral gap property and strong ergodicity for groups of affine
transformations of solenoids | Let X be a solenoid, that is, a compact finite dimensional connected abelian
group with normalized Haar measure m, and let G be a countable discrete group
acting on X by continuous affine transformations. We show that the probability
measure preserving action of G on (X,m) does not have the spectral gap property
if and only if there exists a p(G)-invariant proper subsolenoid Y of X such
that the image of G in the affine group Aff(X/Y) of X/Y is a virtually solvable
group, where p(G) is the automorphism part of G. When G is finitely generated
or when X is a p-adic solenoid, the subsolenoid Y can be chosen so that the
image of G in Aff(X/Y) is virtually abelian. In particular, an action of a
group by affine transformations on a solenoid has the spectral gap property if
and only if this action is strongly ergodic.
| math.DS | let x be a solenoid that is a compact finite dimensional connected abelian group with normalized haar measure m and let g be a countable discrete group acting on x by continuous affine transformations we show that the probability measure preserving action of g on xm does not have the spectral gap property if and only if there exists a pginvariant proper subsolenoid y of x such that the image of g in the affine group affxy of xy is a virtually solvable group where pg is the automorphism part of g when g is finitely generated or when x is a padic solenoid the subsolenoid y can be chosen so that the image of g in affxy is virtually abelian in particular an action of a group by affine transformations on a solenoid has the spectral gap property if and only if this action is strongly ergodic | [['let', 'x', 'be', 'a', 'solenoid', 'that', 'is', 'a', 'compact', 'finite', 'dimensional', 'connected', 'abelian', 'group', 'with', 'normalized', 'haar', 'measure', 'm', 'and', 'let', 'g', 'be', 'a', 'countable', 'discrete', 'group', 'acting', 'on', 'x', 'by', 'continuous', 'affine', 'transformations', 'we', 'show', 'that', 'the', 'probability', 'measure', 'preserving', 'action', 'of', 'g', 'on', 'xm', 'does', 'not', 'have', 'the', 'spectral', 'gap', 'property', 'if', 'and', 'only', 'if', 'there', 'exists', 'a', 'pginvariant', 'proper', 'subsolenoid', 'y', 'of', 'x', 'such', 'that', 'the', 'image', 'of', 'g', 'in', 'the', 'affine', 'group', 'affxy', 'of', 'xy', 'is', 'a', 'virtually', 'solvable', 'group', 'where', 'pg', 'is', 'the', 'automorphism', 'part', 'of', 'g', 'when', 'g', 'is', 'finitely', 'generated', 'or', 'when', 'x', 'is', 'a', 'padic', 'solenoid', 'the', 'subsolenoid', 'y', 'can', 'be', 'chosen', 'so', 'that', 'the', 'image', 'of', 'g', 'in', 'affxy', 'is', 'virtually', 'abelian', 'in', 'particular', 'an', 'action', 'of', 'a', 'group', 'by', 'affine', 'transformations', 'on', 'a', 'solenoid', 'has', 'the', 'spectral', 'gap', 'property', 'if', 'and', 'only', 'if', 'this', 'action', 'is', 'strongly', 'ergodic']] | [-0.1874557058551702, 0.18235224484684798, -0.14581696400740024, -0.02390722235150892, -0.10198656651030841, -0.14474235478917072, 0.0136824201535562, 0.4561126245249962, -0.3130350043290648, -0.18517030780043067, 0.11141765818144356, -0.27558120616294185, -0.08847530596118806, 0.18804245858397015, -0.14595638731623004, -0.071873891461191, 0.052985172603150894, 0.2008659747653994, -0.0998293762063158, -0.25503131842947213, 0.35810809158559503, -0.08295421185100386, 0.23453781129792334, 0.008459366867639895, 0.17012079787151566, 0.01149389132985781, 0.013338264209571583, 0.05324397730512609, -0.07070063743840678, 0.03752167538964543, 0.2968949193841425, 0.0484581609898857, 0.25282396309976946, -0.30258775273787564, -0.20069170671290365, 0.24993680541499935, 0.0957153739375544, -0.08946857663064167, -0.05391582987544223, -0.2810594519921418, 0.1654177427861402, -0.1547301208664631, -0.08481874546871103, -0.02704108403995633, 0.14737375995208477, -0.005674334320817785, -0.27042183450519525, -0.03395796481134563, 0.12872000341143075, 0.09104888242845532, 0.019072609124223476, -0.03533121870252593, -0.11312565336581962, 0.09446310757474717, -0.012265793521535295, 0.15057697582604557, 0.11096272913674857, -0.04504008605852442, -0.06801154666805062, 0.4259603224020323, -0.11852595014818783, -0.24720384732916437, 0.11953228861896385, -0.2273594410511954, -0.15377949965668136, 0.1298431313725124, 0.0889197070858088, 0.1449591610195308, -0.05256759641021651, 0.2787767931855091, -0.15654316684552308, 0.15815863488563175, 0.0039644176268885875, -0.032279881822138, 0.1329393106994444, 0.09629374780563701, 0.15733192021765843, 0.0902719826638249, 0.017581272034520475, 0.08806712518542491, -0.36581571555600084, -0.1580707026131708, -0.20586224821364058, 0.1767370710937218, -0.06497985173050909, -0.17012255858501485, 0.3531721314608023, 0.03132074234710107, 0.1533807801179074, 0.04402636424798904, 0.20001017359679502, 0.09490104795369352, 0.06466549213108574, 0.11491748691568601, 0.07072146803076411, 0.189186408277601, -0.15207702550587468, -0.18281031208241294, 8.410507941554332e-05, 0.17932914612686326] |
1,802.08997 | RLS-Based Adaptive Dereverberation Tracing Abrupt Position Change of
Target Speaker | Adaptive algorithm based on multi-channel linear prediction is an effective
dereverberation method balancing well between the attenuation of the long-term
reverberation and the dereverberated speech quality. However, the abrupt change
of the speech source position, usually caused by the shift of the speakers,
forms an obstacle to the adaptive algorithm and makes it difficult to guarantee
both the fast convergence speed and the optimal steady-state behavior. In this
paper, the RLS-based adaptive multi-channel linear prediction method is
investigated and a time-varying forgetting factor based on the relative
weighted change of the adaptive filter coefficients is proposed to effectively
tracing the abrupt change of the target speaker position. The advantages of the
proposed scheme are demonstrated in the simulations and experiments.
| eess.AS cs.SD | adaptive algorithm based on multichannel linear prediction is an effective dereverberation method balancing well between the attenuation of the longterm reverberation and the dereverberated speech quality however the abrupt change of the speech source position usually caused by the shift of the speakers forms an obstacle to the adaptive algorithm and makes it difficult to guarantee both the fast convergence speed and the optimal steadystate behavior in this paper the rlsbased adaptive multichannel linear prediction method is investigated and a timevarying forgetting factor based on the relative weighted change of the adaptive filter coefficients is proposed to effectively tracing the abrupt change of the target speaker position the advantages of the proposed scheme are demonstrated in the simulations and experiments | [['adaptive', 'algorithm', 'based', 'on', 'multichannel', 'linear', 'prediction', 'is', 'an', 'effective', 'dereverberation', 'method', 'balancing', 'well', 'between', 'the', 'attenuation', 'of', 'the', 'longterm', 'reverberation', 'and', 'the', 'dereverberated', 'speech', 'quality', 'however', 'the', 'abrupt', 'change', 'of', 'the', 'speech', 'source', 'position', 'usually', 'caused', 'by', 'the', 'shift', 'of', 'the', 'speakers', 'forms', 'an', 'obstacle', 'to', 'the', 'adaptive', 'algorithm', 'and', 'makes', 'it', 'difficult', 'to', 'guarantee', 'both', 'the', 'fast', 'convergence', 'speed', 'and', 'the', 'optimal', 'steadystate', 'behavior', 'in', 'this', 'paper', 'the', 'rlsbased', 'adaptive', 'multichannel', 'linear', 'prediction', 'method', 'is', 'investigated', 'and', 'a', 'timevarying', 'forgetting', 'factor', 'based', 'on', 'the', 'relative', 'weighted', 'change', 'of', 'the', 'adaptive', 'filter', 'coefficients', 'is', 'proposed', 'to', 'effectively', 'tracing', 'the', 'abrupt', 'change', 'of', 'the', 'target', 'speaker', 'position', 'the', 'advantages', 'of', 'the', 'proposed', 'scheme', 'are', 'demonstrated', 'in', 'the', 'simulations', 'and', 'experiments']] | [-0.09372394615706026, 0.018841738220032288, -0.09324839350790913, 0.023786647825407944, -0.08403768958602131, -0.14189498719735807, 0.051032904415203556, 0.4367628752433953, -0.30093505091088657, -0.3041080712084463, 0.10816976523707707, -0.23087174645742448, -0.20799771506934106, 0.18904631639666417, -0.11859484136245456, 0.14023707278010225, 0.05830895580926582, 0.04466875021917229, -0.07259884548663091, -0.23715743537700712, 0.2645457100686656, 0.14229559449541593, 0.3649185317795442, 0.023326805699812325, 0.16024300309305056, 0.024841222188145926, -0.08260184893494144, -0.020720907530508655, -0.03897472584870558, 0.11081352951044232, 0.24884022714397988, 0.1208725615850642, 0.2979704326472613, -0.3691001441955817, -0.18948088663810192, 0.0881293220288989, 0.11429195782607969, 0.09504632462410867, -0.04240324315145424, -0.32338273374582915, 0.06103268043458963, -0.1374029448302854, -0.06313562600388184, -0.029954210340491488, -0.023900378147187103, 0.04175988784558316, -0.32540446299151715, 0.08220842618865994, 0.08603116302065475, 0.07024154564788361, -0.0801295267159761, -0.061216093044133245, 0.05647877866535315, 0.1538533113178789, 0.0525668535103724, 0.030706311724766965, 0.15416256875042342, -0.10811014043190713, -0.08839582647940442, 0.35889427382655503, -0.09848458797303068, -0.2147900966140872, 0.17426112438004246, -0.053197675169359485, -0.04748632464784847, 0.1673231753794586, 0.2111904866985601, 0.11707554574069731, -0.13238122547436662, 0.00938517926407571, 0.026499747110828132, 0.20381159759557047, 0.04816901496368922, -0.00161461387330494, 0.11957866545109187, 0.20112804314825966, 0.0723001020217017, 0.11484267059400552, -0.14928527874089464, -0.08711282666596513, -0.23092751920285845, -0.10800295967233031, -0.17972173007252087, -0.06725441115055264, -0.1182153154307137, -0.1635920340351823, 0.4147244227685153, 0.1787385334957297, 0.19032807476395944, 0.055861366670109144, 0.375524239912003, 0.14456516875642814, 0.039364776127979534, 0.0903518053374308, 0.24075313110468016, 0.0652305597689848, 0.12479763871309262, -0.3345713867539806, 0.14846752974901253, 0.06295321432740561] |
1,802.08998 | On some adjunctions in equivariant stable homotopy theory | We investigate certain adjunctions in derived categories of equivariant
spectra, including a right adjoint to fixed points, a right adjoint to pullback
by an isometry of universes, and a chain of two right adjoints to geometric
fixed points. This leads to a variety of interesting other adjunctions,
including a chain of 6 (sometimes 7) adjoints involving the restriction functor
to a subgroup of a finite group on equivariant spectra indexed over the trivial
universe.
| math.AT | we investigate certain adjunctions in derived categories of equivariant spectra including a right adjoint to fixed points a right adjoint to pullback by an isometry of universes and a chain of two right adjoints to geometric fixed points this leads to a variety of interesting other adjunctions including a chain of 6 sometimes 7 adjoints involving the restriction functor to a subgroup of a finite group on equivariant spectra indexed over the trivial universe | [['we', 'investigate', 'certain', 'adjunctions', 'in', 'derived', 'categories', 'of', 'equivariant', 'spectra', 'including', 'a', 'right', 'adjoint', 'to', 'fixed', 'points', 'a', 'right', 'adjoint', 'to', 'pullback', 'by', 'an', 'isometry', 'of', 'universes', 'and', 'a', 'chain', 'of', 'two', 'right', 'adjoints', 'to', 'geometric', 'fixed', 'points', 'this', 'leads', 'to', 'a', 'variety', 'of', 'interesting', 'other', 'adjunctions', 'including', 'a', 'chain', 'of', '6', 'sometimes', '7', 'adjoints', 'involving', 'the', 'restriction', 'functor', 'to', 'a', 'subgroup', 'of', 'a', 'finite', 'group', 'on', 'equivariant', 'spectra', 'indexed', 'over', 'the', 'trivial', 'universe']] | [-0.17849221284425743, 0.07451974042566223, -0.08977163229389368, 0.08931897612559181, -0.13733990392899392, -0.1661376629112842, 0.04939582841502301, 0.3773814167424634, -0.3982572017891987, -0.18886706754061822, 0.12313371722907382, -0.25421772173030077, -0.028318857531868726, 0.15469466999953463, -0.15548188443220146, -0.042655666711161264, 0.017028042395297135, 0.1255328484332642, -0.1232411413126298, -0.21996091002821797, 0.38601270357046175, -0.051960935117676854, 0.19706306644916735, -0.008609525291437938, 0.1571090369409806, -0.02598578725136011, -0.021967847277787892, -0.05769609927980078, -0.11084048419788077, 0.14000715846447526, 0.2706077956166622, 0.030345268956561748, 0.20972346963134367, -0.3741230916835972, -0.09830552688170527, 0.23342100858084253, 0.1632020269470239, 0.013063118723850395, -0.010550666507648153, -0.3387346085463021, 0.12545768402491672, -0.2090034569940857, -0.10332548934840471, -0.08113429855832176, 0.04849645426194813, -0.017437346436939127, -0.26167926058877966, -0.060740999729573926, 0.0737904474466435, 0.16925184032250498, -0.04775770328863448, -0.07306961451556433, -0.07600535115076078, 0.0880119472465201, 0.050468750864368035, -0.026157630796267373, 0.11992130234736849, -0.13959957917560697, -0.12038467137294041, 0.4059368089042805, -0.08803596087681079, -0.1775294051102891, 0.17649144522933843, -0.14223797165637686, -0.1507683028026509, 0.1129775262544737, 0.018108243122696877, 0.14777614938951023, -0.045391089736005745, 0.18127854557226514, -0.10771362740244414, 0.07490024541353656, 0.13320563159681656, 0.00026348985832285235, 0.16503377747092698, 0.04934044096719574, 0.08985744163746366, 0.135795921528542, 0.05103550211060792, -0.0756444908061845, -0.35019265517995163, -0.17731416350029208, -0.02770813097673896, 0.136911419809228, -0.11765587613017242, -0.2154626671124149, 0.455046290632438, 0.0785750888211181, 0.2430918749824569, 0.08420429985051521, 0.2212058326883896, 0.037192896675519845, 0.013981806731002556, -0.03978191987561012, 0.09550820744118176, 0.23810719999774183, -0.029176840384025127, -0.1165140823317956, -0.08787050368767735, 0.2233998932674326] |
1,802.08999 | Contragredient representations over local fields of positive
characteristic | It is conjectured by Adams-Vogan and Prasad that under the local Langlands
correspondence, the L-parameter of the contragredient representation equals
that of the original representation composed with the Chevalley involution of
the L-group. We verify a variant of their prediction for all connected
reductive groups over local fields of positive characteristic, in terms of the
local Langlands parameterization of Genestier-Lafforgue. We deduce this from a
global result for cuspidal automorphic representations over function fields,
which is in turn based on a description of the transposes of V. Lafforgue's
excursion operators.
| math.RT math.NT | it is conjectured by adamsvogan and prasad that under the local langlands correspondence the lparameter of the contragredient representation equals that of the original representation composed with the chevalley involution of the lgroup we verify a variant of their prediction for all connected reductive groups over local fields of positive characteristic in terms of the local langlands parameterization of genestierlafforgue we deduce this from a global result for cuspidal automorphic representations over function fields which is in turn based on a description of the transposes of v lafforgues excursion operators | [['it', 'is', 'conjectured', 'by', 'adamsvogan', 'and', 'prasad', 'that', 'under', 'the', 'local', 'langlands', 'correspondence', 'the', 'lparameter', 'of', 'the', 'contragredient', 'representation', 'equals', 'that', 'of', 'the', 'original', 'representation', 'composed', 'with', 'the', 'chevalley', 'involution', 'of', 'the', 'lgroup', 'we', 'verify', 'a', 'variant', 'of', 'their', 'prediction', 'for', 'all', 'connected', 'reductive', 'groups', 'over', 'local', 'fields', 'of', 'positive', 'characteristic', 'in', 'terms', 'of', 'the', 'local', 'langlands', 'parameterization', 'of', 'genestierlafforgue', 'we', 'deduce', 'this', 'from', 'a', 'global', 'result', 'for', 'cuspidal', 'automorphic', 'representations', 'over', 'function', 'fields', 'which', 'is', 'in', 'turn', 'based', 'on', 'a', 'description', 'of', 'the', 'transposes', 'of', 'v', 'lafforgues', 'excursion', 'operators']] | [-0.19434957358118315, 0.043668715727769515, -0.17974634892677635, 0.03433097549317277, -0.09270818273018283, -0.08004443934293125, -0.0038247809279710054, 0.2779322647246855, -0.31657213951058855, -0.2364567392294041, 0.058223988466620955, -0.1944538241977253, -0.17598773987794464, 0.21065729603552344, -0.10685603205241602, -0.03654175065457821, 0.010106910517523911, 0.15147602940189905, -0.10694963866527277, -0.3007242369719527, 0.37941023375077004, -0.045721096071329986, 0.25276846536276437, 0.019929285784945187, 0.12857969148734066, 0.0799832088258964, -0.01838292163500393, -0.06955942003564401, -0.08387383750976535, 0.17602567296390506, 0.2877957902753472, 0.100066460785456, 0.21353017127892765, -0.37386220699938183, -0.1409481041251142, 0.2035297125800174, 0.11981187263419005, 0.007400139117221856, 0.010690354752362262, -0.32056100528941234, 0.13280500534429765, -0.1643381994958459, -0.12111739105735482, -0.08218169346748089, 0.06341486154335806, 0.012751301496543667, -0.27440848896301095, 0.04711239854276011, 0.10022748913086782, 0.14815172576080923, -0.12701656481261703, -0.09820363628783856, -0.041560840835286814, 0.08816022773019293, 0.011868454510642385, 0.06776197179913818, 0.1005566443094391, -0.15938854701975783, -0.09990914711802774, 0.34756678919604217, -0.08787058052340316, -0.1721983287478162, 0.13827926027641463, -0.1596119390133853, -0.13379530883288349, 0.07699534032144584, 0.07844566944351589, 0.12992465060034936, -0.044485825309741565, 0.18429393017471407, -0.18749082803895528, 0.04078984245610296, 0.10172872319394215, -0.01523022892334583, 0.16454254649579525, 0.05821677796550582, 0.09062336750106294, 0.10233110795855861, 0.03852056486688194, -0.021621530931456204, -0.3839769004844129, -0.18280378540194678, -0.1412973985755922, 0.09286882692355324, -0.10876657986806425, -0.15326064828497526, 0.49676576239818876, 0.10438346325165847, 0.20034419148313728, 0.15178733428712637, 0.18764324831268328, 0.09441802590762646, 0.11522411772999806, 0.0625075390403667, 0.12777835652443834, 0.2673699463643557, -0.04800017291034402, -0.1813873291645326, 0.016294516559520907, 0.20893447477878493] |
1,802.09 | Measurement of transverse wakefields induced by a misaligned positron
bunch in a hollow channel plasma accelerator | Hollow channel plasma wakefield acceleration is a proposed method to provide
high acceleration gradients for electrons and positrons alike: a key to future
lepton colliders. However, beams which are misaligned from the channel axis
induce strong transverse wakefields, deflecting beams and reducing the collider
luminosity. This undesirable consequence sets a tight constraint on the
alignment accuracy of the beam propagating through the channel. Direct
measurements of beam misalignment-induced transverse wakefields are therefore
essential for designing mitigation strategies. We present the first
quantitative measurements of transverse wakefields in a hollow plasma channel,
induced by an off-axis 20 GeV positron bunch, and measured with another 20 GeV
lower charge trailing positron probe bunch. The measurements are largely
consistent with theory.
| physics.acc-ph | hollow channel plasma wakefield acceleration is a proposed method to provide high acceleration gradients for electrons and positrons alike a key to future lepton colliders however beams which are misaligned from the channel axis induce strong transverse wakefields deflecting beams and reducing the collider luminosity this undesirable consequence sets a tight constraint on the alignment accuracy of the beam propagating through the channel direct measurements of beam misalignmentinduced transverse wakefields are therefore essential for designing mitigation strategies we present the first quantitative measurements of transverse wakefields in a hollow plasma channel induced by an offaxis 20 gev positron bunch and measured with another 20 gev lower charge trailing positron probe bunch the measurements are largely consistent with theory | [['hollow', 'channel', 'plasma', 'wakefield', 'acceleration', 'is', 'a', 'proposed', 'method', 'to', 'provide', 'high', 'acceleration', 'gradients', 'for', 'electrons', 'and', 'positrons', 'alike', 'a', 'key', 'to', 'future', 'lepton', 'colliders', 'however', 'beams', 'which', 'are', 'misaligned', 'from', 'the', 'channel', 'axis', 'induce', 'strong', 'transverse', 'wakefields', 'deflecting', 'beams', 'and', 'reducing', 'the', 'collider', 'luminosity', 'this', 'undesirable', 'consequence', 'sets', 'a', 'tight', 'constraint', 'on', 'the', 'alignment', 'accuracy', 'of', 'the', 'beam', 'propagating', 'through', 'the', 'channel', 'direct', 'measurements', 'of', 'beam', 'misalignmentinduced', 'transverse', 'wakefields', 'are', 'therefore', 'essential', 'for', 'designing', 'mitigation', 'strategies', 'we', 'present', 'the', 'first', 'quantitative', 'measurements', 'of', 'transverse', 'wakefields', 'in', 'a', 'hollow', 'plasma', 'channel', 'induced', 'by', 'an', 'offaxis', '20', 'gev', 'positron', 'bunch', 'and', 'measured', 'with', 'another', '20', 'gev', 'lower', 'charge', 'trailing', 'positron', 'probe', 'bunch', 'the', 'measurements', 'are', 'largely', 'consistent', 'with', 'theory']] | [-0.1400004439533521, 0.24455433865547932, -0.056618731683836535, 0.10446285943572338, -0.060938574254321747, -0.18904441096979138, -0.0399265963351354, 0.4646447783129083, -0.22041742272205397, -0.30881389822715366, -0.02147310443767784, -0.2678557175020568, 0.09717646280192158, 0.22610044622650513, 0.024530857594476804, 0.10003407731747781, 0.10830152823597702, -0.12244993540369827, -0.04290175017638084, -0.14306931854942098, 0.2151279418140204, 0.21829566653841773, 0.307586045211388, 0.13117629324651173, 0.1255091860359057, 0.034553075153539836, 0.002468188325118305, -0.04273102961034856, -0.118498806854109, 0.05913880585422182, 0.20472321272469485, 0.05733612004934181, 0.21078174891205043, -0.46512747788403785, -0.18815365975073928, 0.042394028164637394, 0.18093251140587208, 0.11180605915968075, -0.15371586477610832, -0.26786436443018097, 0.04487339621877425, -0.1898929030737943, -0.15322420535147444, 0.010987437911267973, -0.04920522773710008, 0.045022301046520025, -0.31187302340618056, 0.06945507323428338, 0.030331509002747063, 0.03521877060779649, -0.01909694556767742, -0.1079280822354759, -0.004792854173952698, -0.015581198345121538, 0.11155891066027057, 0.12550511009370288, 0.22373760643247992, -0.09851308322798175, -0.14695236021374217, 0.36274378853412265, 0.0016843991346147836, -0.15924345011799, 0.13961678676697242, -0.23885315313684538, -0.008632433083322313, 0.2227963357925033, 0.2642978635799681, 0.04378363458264587, -0.14569401031789872, -0.03521513637368225, -0.006189097797609547, 0.13824057642919704, 0.1528204029195138, 0.0797712605438617, 0.26879559341881776, 0.17832673842019728, 0.09652158648320912, 0.08899987523113656, -0.16596785029913816, 0.06044581023832926, -0.35166153682268453, -0.07976074090315045, -0.10752433632365149, 0.007550252245168966, -0.02751422210426854, -0.07182471381707324, 0.40857481499974674, 0.10607873151699702, 0.17617404679907087, -0.06247845916853597, 0.40970750490569663, 0.06751909432111858, 0.039769721793808825, 0.07564239891912115, 0.3117530729291308, 0.1960098335507493, 0.13313368945103934, -0.23300236733192498, 0.018735823818506338, -0.017801029197712485] |
1,802.09001 | The Complexity of the Possible Winner Problem over Partitioned
Preferences | The Possible-Winner problem asks, given an election where the voters'
preferences over the set of candidates is partially specified, whether a
distinguished candidate can become a winner. In this work, we consider the
computational complexity of Possible-Winner under the assumption that the voter
preferences are $partitioned$. That is, we assume that every voter provides a
complete order over sets of incomparable candidates (e.g., candidates are
ranked by their level of education). We consider elections with partitioned
profiles over positional scoring rules, with an unbounded number of candidates,
and unweighted voters. Our first result is a polynomial time algorithm for
voting rules with $2$ distinct values, which include the well-known
$k$-approval voting rule. We then go on to prove NP-hardness for a class of
rules that contain all voting rules that produce scoring vectors with at least
$4$ distinct values.
| cs.GT cs.CC cs.DS | the possiblewinner problem asks given an election where the voters preferences over the set of candidates is partially specified whether a distinguished candidate can become a winner in this work we consider the computational complexity of possiblewinner under the assumption that the voter preferences are partitioned that is we assume that every voter provides a complete order over sets of incomparable candidates eg candidates are ranked by their level of education we consider elections with partitioned profiles over positional scoring rules with an unbounded number of candidates and unweighted voters our first result is a polynomial time algorithm for voting rules with 2 distinct values which include the wellknown kapproval voting rule we then go on to prove nphardness for a class of rules that contain all voting rules that produce scoring vectors with at least 4 distinct values | [['the', 'possiblewinner', 'problem', 'asks', 'given', 'an', 'election', 'where', 'the', 'voters', 'preferences', 'over', 'the', 'set', 'of', 'candidates', 'is', 'partially', 'specified', 'whether', 'a', 'distinguished', 'candidate', 'can', 'become', 'a', 'winner', 'in', 'this', 'work', 'we', 'consider', 'the', 'computational', 'complexity', 'of', 'possiblewinner', 'under', 'the', 'assumption', 'that', 'the', 'voter', 'preferences', 'are', 'partitioned', 'that', 'is', 'we', 'assume', 'that', 'every', 'voter', 'provides', 'a', 'complete', 'order', 'over', 'sets', 'of', 'incomparable', 'candidates', 'eg', 'candidates', 'are', 'ranked', 'by', 'their', 'level', 'of', 'education', 'we', 'consider', 'elections', 'with', 'partitioned', 'profiles', 'over', 'positional', 'scoring', 'rules', 'with', 'an', 'unbounded', 'number', 'of', 'candidates', 'and', 'unweighted', 'voters', 'our', 'first', 'result', 'is', 'a', 'polynomial', 'time', 'algorithm', 'for', 'voting', 'rules', 'with', '2', 'distinct', 'values', 'which', 'include', 'the', 'wellknown', 'kapproval', 'voting', 'rule', 'we', 'then', 'go', 'on', 'to', 'prove', 'nphardness', 'for', 'a', 'class', 'of', 'rules', 'that', 'contain', 'all', 'voting', 'rules', 'that', 'produce', 'scoring', 'vectors', 'with', 'at', 'least', '4', 'distinct', 'values']] | [-0.12136442318939379, 0.06345103826245503, -0.06852398470492803, 0.0462172952800119, -0.12182172318499018, -0.19286233921965285, 0.17527964805001325, 0.39599531774755814, -0.261025580390608, -0.30039450150989266, 0.08948888528979906, -0.2985437018456903, -0.1133311597229301, 0.12085530845670159, -0.08409457348531833, -0.0021633539061201397, 0.06356945544494873, 0.096299741845442, 0.03697505033146726, -0.40666342738091293, 0.30622088288833954, -0.05888262824801198, 0.21169072371163153, -0.009608767786059855, 0.11153995053057497, 0.054476011133188534, -0.009823959905409465, 0.09420230924865625, -0.11211062658092315, 0.07148169703785004, 0.3313094625235909, 0.20416979591810844, 0.3639092958484688, -0.3373627784603741, -0.11498827874884825, 0.18935214123267163, 0.05814030873077245, 0.07346159802923101, 0.01300684929686007, -0.25193500779841066, 0.1321042520971289, -0.19465486763595827, -0.07568794878770727, -0.07690923765002594, 0.042957565222057875, 0.05178154644685505, -0.3212999922774025, 0.02581027229690421, 0.07383891116202312, 0.045592267110427145, -0.07767685967749052, -0.14712454974319936, 4.522077548895439e-06, 0.10905627307080984, 0.0036480451464979318, -0.03308366342633793, 0.057918284189917936, -0.1368331787750859, -0.25270246008893704, 0.4368515960382719, 0.02726787326255827, -0.1899781018957822, 0.12683089922800878, -0.07359458082593488, -0.19314547341969543, 0.0916645098205683, 0.13681945128597484, 0.13492022240432455, -0.1127052539549547, 0.0020189652976539177, -0.15612511329325665, 0.20012154520224154, 0.09218123727172178, 0.010563201430749937, 0.20840485894671865, 0.13701459317447712, 0.11056782567302567, 0.13601043145002348, -0.03896580116966073, -0.10538713804643302, -0.28147475682046047, -0.11356928574607918, -0.15493756569803005, 0.03865434799596572, -0.10711732734813453, -0.18795641065051738, 0.3837307917674745, 0.13971252848027124, 0.18498468335911658, 0.14604557640459662, 0.2251087251020745, 0.08192167665316964, 0.06925974853411589, 0.1073748329348427, 0.16161141894676173, 0.012020928521783356, -0.019562293444828124, -0.12428025110373206, 0.15198477789297374, 0.05774504278172963] |
1,802.09002 | Scaling Behavior of Anisotropy Relaxation in Deformed Polymers | Drawing an analogy to the paradigm of quasi-elastic neutron scattering, we
present a general approach for quantitatively investigating the spatiotemporal
dependence of structural anisotropy relaxation in deformed polymers by using
small-angle neutron scattering. Experiments and non-equilibrium molecular
dynamics simulations on polymer melts over a wide range of molecular weights
reveal that their conformational relaxation at relatively high momentum
transfer $Q$ and short time can be described by a simple scaling law, with the
relaxation rate proportional to $Q$. This peculiar scaling behavior, which
cannot be derived from the classical Rouse and tube models, is indicative of a
surprisingly weak direct influence of entanglement on the microscopic mechanism
of single-chain anisotropy relaxation.
| cond-mat.soft | drawing an analogy to the paradigm of quasielastic neutron scattering we present a general approach for quantitatively investigating the spatiotemporal dependence of structural anisotropy relaxation in deformed polymers by using smallangle neutron scattering experiments and nonequilibrium molecular dynamics simulations on polymer melts over a wide range of molecular weights reveal that their conformational relaxation at relatively high momentum transfer q and short time can be described by a simple scaling law with the relaxation rate proportional to q this peculiar scaling behavior which cannot be derived from the classical rouse and tube models is indicative of a surprisingly weak direct influence of entanglement on the microscopic mechanism of singlechain anisotropy relaxation | [['drawing', 'an', 'analogy', 'to', 'the', 'paradigm', 'of', 'quasielastic', 'neutron', 'scattering', 'we', 'present', 'a', 'general', 'approach', 'for', 'quantitatively', 'investigating', 'the', 'spatiotemporal', 'dependence', 'of', 'structural', 'anisotropy', 'relaxation', 'in', 'deformed', 'polymers', 'by', 'using', 'smallangle', 'neutron', 'scattering', 'experiments', 'and', 'nonequilibrium', 'molecular', 'dynamics', 'simulations', 'on', 'polymer', 'melts', 'over', 'a', 'wide', 'range', 'of', 'molecular', 'weights', 'reveal', 'that', 'their', 'conformational', 'relaxation', 'at', 'relatively', 'high', 'momentum', 'transfer', 'q', 'and', 'short', 'time', 'can', 'be', 'described', 'by', 'a', 'simple', 'scaling', 'law', 'with', 'the', 'relaxation', 'rate', 'proportional', 'to', 'q', 'this', 'peculiar', 'scaling', 'behavior', 'which', 'can', 'not', 'be', 'derived', 'from', 'the', 'classical', 'rouse', 'and', 'tube', 'models', 'is', 'indicative', 'of', 'a', 'surprisingly', 'weak', 'direct', 'influence', 'of', 'entanglement', 'on', 'the', 'microscopic', 'mechanism', 'of', 'singlechain', 'anisotropy', 'relaxation']] | [-0.1059498844240027, 0.1979700945553954, -0.13926545100236712, 0.05357813339131618, -0.0668614886152292, -0.13082858145103923, 0.028918205932963507, 0.3721007168559091, -0.3339019758360727, -0.25979508814011104, 0.0007643276060532246, -0.23662721363611386, -0.12445157429569267, 0.19954373164884082, 0.06992252730248895, 0.04077070196841045, 0.0305137454852229, -0.037776494895557074, -0.07057830731667179, -0.1418460095105729, 0.2437753117909389, 0.09996175965976103, 0.30043398707805735, 0.09867563878651708, 0.09004541370891925, 0.043481991946464404, 0.055361572931620424, 0.06371287127590872, -0.19681926845422432, 0.0794586655704604, 0.2260573280648909, 0.014428845993409465, 0.18314174973472422, -0.44957726550221977, -0.25160155289839686, 0.04370344074309936, 0.17049073381557328, 0.13120442258306347, -0.0348724679809363, -0.21826485689962283, 0.04305034121664773, -0.1915195753390435, -0.11243060953711392, -0.12433571236657112, 0.047757322821001126, 0.07353641496073189, -0.23209409999877348, 0.1556445489778915, 0.07185751709039323, 0.07734011573484167, -0.06853632617691931, -0.07255771951726533, 0.030430077396366478, 0.06057540064648492, 0.06814183523238171, 0.029339416398475544, 0.2081014500332198, -0.13463084770358233, -0.08884137898816594, 0.361391680098937, -0.04890211578042779, -0.15765077037420788, 0.2073228032989261, -0.19739560920944704, -0.0910433352525745, 0.18908723360592766, 0.1417477541752825, 0.14334576986149322, -0.17439143420363376, 0.037203340080785505, -0.023799559267769967, 0.19748104213639245, 0.045672812322404104, 0.009457064375185707, 0.25031661353360896, 0.2235994110025266, -0.039642365000742884, 0.14218723422007834, -0.11119752815907955, -0.14561844558089174, -0.2485519463662058, -0.07768635132483073, -0.2241036755814483, 0.13055310596467148, -0.13997594331820956, -0.1360632264654019, 0.34833818526073757, 0.06764713869935284, 0.2141398780898141, 0.08212897580753113, 0.22876730593582448, 0.10830994446795168, 0.05417230888061957, 0.02210320990915144, 0.22875547497200646, 0.1683339037574894, 0.11791451592580415, -0.34579051683665185, 0.11008512123537782, 0.02482858911389485] |
1,802.09003 | A generating function for the Euler numbers of the second kind and its
application | In the paper, 2 explicit formulas for the Euler numbers of the second kind
are obtained. Based on those formulas a exponential generating function is
deduced. Using the generating function some well-known and new identities for
the Euler number of the second kind are obtained.
| math.CO | in the paper 2 explicit formulas for the euler numbers of the second kind are obtained based on those formulas a exponential generating function is deduced using the generating function some wellknown and new identities for the euler number of the second kind are obtained | [['in', 'the', 'paper', '2', 'explicit', 'formulas', 'for', 'the', 'euler', 'numbers', 'of', 'the', 'second', 'kind', 'are', 'obtained', 'based', 'on', 'those', 'formulas', 'a', 'exponential', 'generating', 'function', 'is', 'deduced', 'using', 'the', 'generating', 'function', 'some', 'wellknown', 'and', 'new', 'identities', 'for', 'the', 'euler', 'number', 'of', 'the', 'second', 'kind', 'are', 'obtained']] | [-0.153638202821215, 0.07326938041175406, -0.06815238013449643, 0.14084466614294797, -0.12077946124805344, -0.07509151141469678, -0.011849147140876287, 0.23933119891832272, -0.2552895900275972, -0.31597843890388805, 0.11135474754652629, -0.24382638653947247, -0.18016610460148919, 0.3329449978760547, -0.0008100031532295462, 0.07908821408119467, -0.006815407808042235, 0.07873775954875681, -0.11087183333519432, -0.2401614830725723, 0.3986473041276137, -0.05004934416049057, 0.20602342469824686, 0.007360529775420825, 0.1325085269080268, -0.018096727112101182, -0.07295888995544778, 0.0011720660660001967, -0.15167767859788406, 0.15902559043218692, 0.1715509342805793, 0.11540419169598155, 0.2320707636160983, -0.4250671994768911, -0.12247484316014581, 0.09547020521842771, 0.10897502032005124, 0.1028760529226727, -0.0827001315774396, -0.23603994221323066, 0.12195075505620076, -0.14596153737252784, -0.1882149590800206, -0.0828322332766321, 0.0005744859576225281, 0.17146575902071265, -0.30021246034238075, 0.04353047751614617, 0.05082016939090358, 0.07747526694503096, -0.05351462351779143, -0.21272260691556666, 0.03698059883382585, 0.12868758934653468, 0.036104872631323004, -0.0246060359912614, 0.001327652484178543, -0.17648533009406592, -0.10226726356065935, 0.3539272823267513, -0.037747711232966843, -0.24997352783878643, 0.08339417200639015, -0.12870525688760812, -0.17915634883360732, 0.13417283226218488, 0.07919217886196242, 0.16631702619294325, -0.1229249100925194, 0.032452311779424134, -0.09672302096668217, 0.07949739682177702, 0.15099687139607137, 0.011163824589716063, 0.08020334343115489, 0.030158680139316454, -0.01858304813504219, 0.2230220497585833, -0.05573105652195712, -0.10200990782015854, -0.3760740982653159, -0.21429903556903204, -0.25226676621370847, 0.05121305680109395, -0.09949077037648142, -0.1671721045134796, 0.40776507846183246, 0.06569791543814871, 0.17847385182976722, 0.20014559750755628, 0.2778990939259529, 0.2487160289660096, 0.03966400990676549, -0.005723314455018327, 0.14301546923104777, 0.12139924095115728, 0.08891926625122627, -0.11296964273399984, 0.11183871964199675, 0.2479535879670746] |
1,802.09004 | Liouville theorems for stable at infinity solutions of Lane-Emden system | We consider the Lane-Emden system $-\Delta u = v^p$, $-\Delta v= u^\theta$ in
$\mathbb{R}^N$, and we prove the nonexistence of smooth positive solutions
which are stable outside a compact set, for any $p, \theta > 0$ under the
Sobolev hyperbola.
| math.AP | we consider the laneemden system delta u vp delta v utheta in mathbbrn and we prove the nonexistence of smooth positive solutions which are stable outside a compact set for any p theta 0 under the sobolev hyperbola | [['we', 'consider', 'the', 'laneemden', 'system', 'delta', 'u', 'vp', 'delta', 'v', 'utheta', 'in', 'mathbbrn', 'and', 'we', 'prove', 'the', 'nonexistence', 'of', 'smooth', 'positive', 'solutions', 'which', 'are', 'stable', 'outside', 'a', 'compact', 'set', 'for', 'any', 'p', 'theta', '0', 'under', 'the', 'sobolev', 'hyperbola']] | [-0.26555323360585853, 0.03738446935619179, -0.013356755046468032, 0.029455239565944986, -0.05224292161629388, -0.22824690107403225, 0.020719380289512247, 0.2881963062590282, -0.32649944418747173, -0.10873239864840319, 0.08108851472589824, -0.3307351811151755, -0.05597681843822724, 0.17294319644325265, -0.05232844104696261, 0.07716497800950158, 0.0305884196116638, 0.10672584388674677, -0.11005762964487076, -0.18529531056379997, 0.4140602218869485, -0.2781673433798316, 0.08838711020928856, 0.03888379092983853, 0.05546732440492824, -0.04883942572326448, 0.1333596119412074, -0.010798403723655562, -0.2787114327013689, 0.026763415405232655, 0.22251946655543228, 0.09856195997226198, 0.31097674095316935, -0.3209049365434207, -0.15880615300940057, 0.2504822499804983, 0.1029783051436473, -0.05561614165535981, -0.007142561788082515, -0.3342227886774038, 0.18161118342418617, -0.03291423545268021, -0.2850215476079795, -0.05235911962135058, 0.1721533049069541, 0.10689827266124714, -0.3935678814978976, 0.09931390092855222, 0.12971551793835764, 0.021183141354030294, -0.1516289028253308, -0.19890895102013784, -0.02838825886015241, 0.004421496457469307, -0.02842258332652579, 0.16757256477323704, 0.005512296111862126, -0.080325439106673, 0.025938747144353232, 0.3643004251153846, -0.10400035775781266, -0.29399151560899456, 0.0642358459238159, -0.2399174095695152, -0.08489031516211598, 0.09430122387129813, 0.14658901405422703, 0.2203522304465112, -0.023844315792973105, 0.27528338648813877, -0.08075501701157344, 0.13336944147656477, 0.18507433446173213, -0.049847001356906014, 0.07654498566530253, 0.06585001967553246, 0.19839232346337093, 0.07014641024809527, -0.06497384675190244, 0.0057678404110974, -0.4368783939433725, -0.12787652476445624, -0.10121122122693219, 0.1623366296438402, -0.1445402961318522, -0.1823241217552047, 0.309897962173349, 0.0164568450571479, 0.16133217979222536, 0.09851543779644233, 0.14073625637684017, 0.1377157159873413, -0.08925619221439487, 0.16306071086345533, 0.12974436324408375, 0.09127200896680158, 0.08571178686658018, -0.21263566469209955, -0.016880189448497014, 0.12131119354039822] |
1,802.09005 | Frequency domain TRINICON-based blind source separation method with
multi-source activity detection for sparsely mixed signals | The TRINICON ('Triple-N ICA for convolutive mixtures') framework is an
effective blind signal separation (BSS) method for separating sound sources
from convolutive mixtures. It makes full use of the non-whiteness,
non-stationarity and non-Gaussianity properties of the source signals and can
be implemented either in time domain or in frequency domain, avoiding the
notorious internal permutation problem. It usually has best performance when
the sources are continuously mixed. In this paper, the offline dual-channel
frequency domain TRINICON implementation for sparsely mixed signals is
investigated, and a multi-source activity detection is proposed to locate the
active period of each source, based on which the filter updating strategy is
regularized to improve the separation performance. The objective metric
provided by the BSSEVAL toolkit is utilized to evaluate the performance of the
proposed scheme.
| eess.AS cs.SD | the trinicon triplen ica for convolutive mixtures framework is an effective blind signal separation bss method for separating sound sources from convolutive mixtures it makes full use of the nonwhiteness nonstationarity and nongaussianity properties of the source signals and can be implemented either in time domain or in frequency domain avoiding the notorious internal permutation problem it usually has best performance when the sources are continuously mixed in this paper the offline dualchannel frequency domain trinicon implementation for sparsely mixed signals is investigated and a multisource activity detection is proposed to locate the active period of each source based on which the filter updating strategy is regularized to improve the separation performance the objective metric provided by the bsseval toolkit is utilized to evaluate the performance of the proposed scheme | [['the', 'trinicon', 'triplen', 'ica', 'for', 'convolutive', 'mixtures', 'framework', 'is', 'an', 'effective', 'blind', 'signal', 'separation', 'bss', 'method', 'for', 'separating', 'sound', 'sources', 'from', 'convolutive', 'mixtures', 'it', 'makes', 'full', 'use', 'of', 'the', 'nonwhiteness', 'nonstationarity', 'and', 'nongaussianity', 'properties', 'of', 'the', 'source', 'signals', 'and', 'can', 'be', 'implemented', 'either', 'in', 'time', 'domain', 'or', 'in', 'frequency', 'domain', 'avoiding', 'the', 'notorious', 'internal', 'permutation', 'problem', 'it', 'usually', 'has', 'best', 'performance', 'when', 'the', 'sources', 'are', 'continuously', 'mixed', 'in', 'this', 'paper', 'the', 'offline', 'dualchannel', 'frequency', 'domain', 'trinicon', 'implementation', 'for', 'sparsely', 'mixed', 'signals', 'is', 'investigated', 'and', 'a', 'multisource', 'activity', 'detection', 'is', 'proposed', 'to', 'locate', 'the', 'active', 'period', 'of', 'each', 'source', 'based', 'on', 'which', 'the', 'filter', 'updating', 'strategy', 'is', 'regularized', 'to', 'improve', 'the', 'separation', 'performance', 'the', 'objective', 'metric', 'provided', 'by', 'the', 'bsseval', 'toolkit', 'is', 'utilized', 'to', 'evaluate', 'the', 'performance', 'of', 'the', 'proposed', 'scheme']] | [-0.08015264240869631, 0.02822995832892567, -0.09245452727560723, 0.037542872570662036, -0.11999901296156976, -0.1496978043985095, 0.039758177959204964, 0.42305359300521633, -0.2852101729377099, -0.2900595640955818, 0.15035529375272166, -0.23177139094424626, -0.12769163050965981, 0.18468136186083217, -0.07572708831405238, 0.07330918016414793, 0.055016187451122, 0.034682952444113437, -0.03110604118560404, -0.22093602100531348, 0.27542231002608164, 0.0889906204778642, 0.35079614275563803, 0.0053386618568015, 0.11222304964330905, 0.005446124575211711, -0.056608366117293446, -0.02506468455410666, -0.007109488464064068, 0.07329197391767853, 0.2969816996168996, 0.19383503208010797, 0.2651962877827741, -0.3481199826069531, -0.25543208163793363, 0.13318226732210153, 0.13055148272080316, 0.08843175123264599, -0.03408851110217501, -0.3317742976286108, 0.08966963417414162, -0.1383425724796123, -0.04093265193625398, -0.045596136866758265, -0.01582220692690166, 0.0006758616091535678, -0.3146384444590362, 0.07591782029720932, 0.05095547394797442, 0.019471650004446034, -0.052455617321862116, -0.12725430561990905, 0.0675898137814661, 0.14374522605863777, 0.017708157061687893, 0.04096134137620942, 0.11019664800666745, -0.09901695698078136, -0.1002615488463244, 0.3502992200147774, -0.06472090157561951, -0.25908823361590744, 0.1945685454559261, -0.043740938532180966, -0.08892274503817871, 0.1477098903833105, 0.21707371240555648, 0.1265057185221286, -0.19613200662316227, 0.04572281556523641, 0.034163148415881014, 0.24933965904046856, 0.07222587054979707, 0.01990656063537158, 0.18232090137566306, 0.21126853348502506, 0.07863315033896398, 0.1964921631974109, -0.16677880738603157, -0.055509465671743134, -0.22625041423672218, -0.09181327774514636, -0.2381099961690664, -0.08858576548537092, -0.06852985999054027, -0.14853383770253184, 0.4094143578966482, 0.15290360716134604, 0.1197012433660261, 0.03377956232251895, 0.37848060480171136, 0.09432109919125362, 0.05095439509542692, 0.0914080704909764, 0.20828767396539213, 0.0995472933568563, 0.09303055144107295, -0.22954032384783088, 0.08200845439430504, 0.030289784192092835] |
1,802.09006 | Valuing life detection missions | Recent discoveries imply that Early Mars was habitable for
life-as-we-know-it; that Enceladus might be habitable; and that many stars have
Earth-sized exoplanets whose insolation favors surface liquid water. These
exciting discoveries make it more likely that spacecraft now under construction
- Mars 2020, ExoMars rover, JWST, Europa Clipper - will find habitable, or
formerly habitable, environments. Did these environments see life? Given finite
resources (\$10bn/decade for the US ), how could we best test the hypothesis of
a second origin of life? Here, we first state the case for and against flying
life detection missions soon. Next, we assume that life detection missions will
happen soon, and propose a framework for comparing the value of different life
detection missions:
Scientific value = (Reach x grasp x certainty x payoff) / \$
After discussing each term in this framework, we conclude that scientific
value is maximized if life detection missions are flown as hypothesis tests.
With hypothesis testing, even a nondetection is scientifically valuable.
| astro-ph.EP | recent discoveries imply that early mars was habitable for lifeasweknowit that enceladus might be habitable and that many stars have earthsized exoplanets whose insolation favors surface liquid water these exciting discoveries make it more likely that spacecraft now under construction mars 2020 exomars rover jwst europa clipper will find habitable or formerly habitable environments did these environments see life given finite resources 10bndecade for the us how could we best test the hypothesis of a second origin of life here we first state the case for and against flying life detection missions soon next we assume that life detection missions will happen soon and propose a framework for comparing the value of different life detection missions scientific value reach x grasp x certainty x payoff after discussing each term in this framework we conclude that scientific value is maximized if life detection missions are flown as hypothesis tests with hypothesis testing even a nondetection is scientifically valuable | [['recent', 'discoveries', 'imply', 'that', 'early', 'mars', 'was', 'habitable', 'for', 'lifeasweknowit', 'that', 'enceladus', 'might', 'be', 'habitable', 'and', 'that', 'many', 'stars', 'have', 'earthsized', 'exoplanets', 'whose', 'insolation', 'favors', 'surface', 'liquid', 'water', 'these', 'exciting', 'discoveries', 'make', 'it', 'more', 'likely', 'that', 'spacecraft', 'now', 'under', 'construction', 'mars', '2020', 'exomars', 'rover', 'jwst', 'europa', 'clipper', 'will', 'find', 'habitable', 'or', 'formerly', 'habitable', 'environments', 'did', 'these', 'environments', 'see', 'life', 'given', 'finite', 'resources', '10bndecade', 'for', 'the', 'us', 'how', 'could', 'we', 'best', 'test', 'the', 'hypothesis', 'of', 'a', 'second', 'origin', 'of', 'life', 'here', 'we', 'first', 'state', 'the', 'case', 'for', 'and', 'against', 'flying', 'life', 'detection', 'missions', 'soon', 'next', 'we', 'assume', 'that', 'life', 'detection', 'missions', 'will', 'happen', 'soon', 'and', 'propose', 'a', 'framework', 'for', 'comparing', 'the', 'value', 'of', 'different', 'life', 'detection', 'missions', 'scientific', 'value', 'reach', 'x', 'grasp', 'x', 'certainty', 'x', 'payoff', 'after', 'discussing', 'each', 'term', 'in', 'this', 'framework', 'we', 'conclude', 'that', 'scientific', 'value', 'is', 'maximized', 'if', 'life', 'detection', 'missions', 'are', 'flown', 'as', 'hypothesis', 'tests', 'with', 'hypothesis', 'testing', 'even', 'a', 'nondetection', 'is', 'scientifically', 'valuable']] | [-0.11501970678012097, 0.20449594723871878, -0.09219588615721272, 0.09888677643386708, -0.14032948636600087, -0.11874484959689359, 0.1027859499490249, 0.3591036570198353, -0.1730714967774768, -0.3524069990482061, 0.16959092406060305, -0.2829005088897482, -0.166385510705802, 0.23259763403855746, -0.13462469125046364, 0.0127562889829278, 0.1850718559441908, -0.012316034205498235, 0.0018927726609211776, -0.3308530785488866, 0.2095490343297922, 0.1373224061583319, 0.13358849204415757, 0.02797707561516173, 0.01879940182271023, -0.07905942073332206, 0.0006312922334238406, -0.05630147676359141, -0.1503516344307554, 0.032430684667140726, 0.3547735488042235, 0.27554624889406465, 0.3156394508697333, -0.4339637164537224, -0.25883408142385195, 0.145133961939052, 0.07900149666515532, -0.009728386619639012, -0.03567572655954263, -0.31597163205395545, 0.01885589482563157, -0.2164978355154275, -0.20654186745204273, -0.05137922528890833, 0.09894741375540053, -0.06812037393439471, -0.215803999160116, -0.029989984564693463, 0.021291262922327844, 0.0657761360571209, -0.17087733310557182, -0.14351231146232044, -0.01304364293814175, 0.1201747291021034, 0.046049855718569406, 0.021694263752790228, 0.20808445647839577, -0.09804233711122745, -0.07755451893373844, 0.4148595098165735, -0.07974858925595218, -0.031885545448805654, 0.2331225748233978, -0.2291698065316004, -0.18123725955224326, 0.08462049871713163, 0.15192349871860877, 0.15041717131051324, -0.13559890367210872, 0.008768421468970876, -0.016190869024684352, 0.15399990069770045, 0.10189130454804868, 0.009760787241881893, 0.3867950294226889, 0.20741280150719948, 0.1482619091819581, 0.006107082404947329, -0.17555315470503222, -0.03759194373663875, -0.24151353436191716, -0.2219515296902823, -0.16644740565529753, 0.059424129601628066, -0.01416119105875447, -0.08541496627693695, 0.2939270093496288, 0.2564019601972353, 0.05637894447652563, 0.04125660536510329, 0.3027193952043871, 0.002996267443673024, 0.055043974873279375, 0.06496415779655498, 0.31545345771517, -0.01117726060892305, 0.07999733031892609, -0.12449356512365592, 0.17983821101501704, -0.021643195475541777] |
1,802.09007 | Evaluating and Tuning n-fold Integer Programming | In recent years, algorithmic breakthroughs in stringology, computational
social choice, scheduling, etc., were achieved by applying the theory of
so-called $n$-fold integer programming. An $n$-fold integer program (IP) has a
highly uniform block structured constraint matrix. Hemmecke, Onn, and Romanchuk
[Math. Programming, 2013] showed an algorithm with runtime $a^{O(rst + r^2s)}
n^3$, where $a$ is the largest coefficient, $r,s$, and $t$ are dimensions of
blocks of the constraint matrix and $n$ is the total dimension of the IP; thus,
an algorithm efficient if the blocks are of small size and with small
coefficients. The algorithm works by iteratively improving a feasible solution
with augmenting steps, and $n$-fold IPs have the special property that
augmenting steps are guaranteed to exist in a not-too-large neighborhood.
We have implemented the algorithm and learned the following along the way.
The original algorithm is practically unusable, but we discover a series of
improvements which make its evaluation possible. Crucially, we observe that a
certain constant in the algorithm can be treated as a tuning parameter, which
yields an efficient heuristic (essentially searching in a
smaller-than-guaranteed neighborhood). Furthermore, the algorithm uses an
overly expensive strategy to find a "best" step, while finding only an
"approximatelly best" step is much cheaper, yet sufficient for quick
convergence. Using this insight, we improve the asymptotic dependence on $n$
from $n^3$ to $n^2 \log n$.
We show that decreasing the tuning parameter initially leads to an increased
number of iterations needed for convergence and eventually to getting stuck in
local optima, as expected. However, surprisingly small values of the parameter
already exhibit good behavior. Second, our new strategy for finding
"approximatelly best" steps wildly outperforms the original construction.
| cs.DS cs.SE | in recent years algorithmic breakthroughs in stringology computational social choice scheduling etc were achieved by applying the theory of socalled nfold integer programming an nfold integer program ip has a highly uniform block structured constraint matrix hemmecke onn and romanchuk math programming 2013 showed an algorithm with runtime aorst r2s n3 where a is the largest coefficient rs and t are dimensions of blocks of the constraint matrix and n is the total dimension of the ip thus an algorithm efficient if the blocks are of small size and with small coefficients the algorithm works by iteratively improving a feasible solution with augmenting steps and nfold ips have the special property that augmenting steps are guaranteed to exist in a nottoolarge neighborhood we have implemented the algorithm and learned the following along the way the original algorithm is practically unusable but we discover a series of improvements which make its evaluation possible crucially we observe that a certain constant in the algorithm can be treated as a tuning parameter which yields an efficient heuristic essentially searching in a smallerthanguaranteed neighborhood furthermore the algorithm uses an overly expensive strategy to find a best step while finding only an approximatelly best step is much cheaper yet sufficient for quick convergence using this insight we improve the asymptotic dependence on n from n3 to n2 log n we show that decreasing the tuning parameter initially leads to an increased number of iterations needed for convergence and eventually to getting stuck in local optima as expected however surprisingly small values of the parameter already exhibit good behavior second our new strategy for finding approximatelly best steps wildly outperforms the original construction | [['in', 'recent', 'years', 'algorithmic', 'breakthroughs', 'in', 'stringology', 'computational', 'social', 'choice', 'scheduling', 'etc', 'were', 'achieved', 'by', 'applying', 'the', 'theory', 'of', 'socalled', 'nfold', 'integer', 'programming', 'an', 'nfold', 'integer', 'program', 'ip', 'has', 'a', 'highly', 'uniform', 'block', 'structured', 'constraint', 'matrix', 'hemmecke', 'onn', 'and', 'romanchuk', 'math', 'programming', '2013', 'showed', 'an', 'algorithm', 'with', 'runtime', 'aorst', 'r2s', 'n3', 'where', 'a', 'is', 'the', 'largest', 'coefficient', 'rs', 'and', 't', 'are', 'dimensions', 'of', 'blocks', 'of', 'the', 'constraint', 'matrix', 'and', 'n', 'is', 'the', 'total', 'dimension', 'of', 'the', 'ip', 'thus', 'an', 'algorithm', 'efficient', 'if', 'the', 'blocks', 'are', 'of', 'small', 'size', 'and', 'with', 'small', 'coefficients', 'the', 'algorithm', 'works', 'by', 'iteratively', 'improving', 'a', 'feasible', 'solution', 'with', 'augmenting', 'steps', 'and', 'nfold', 'ips', 'have', 'the', 'special', 'property', 'that', 'augmenting', 'steps', 'are', 'guaranteed', 'to', 'exist', 'in', 'a', 'nottoolarge', 'neighborhood', 'we', 'have', 'implemented', 'the', 'algorithm', 'and', 'learned', 'the', 'following', 'along', 'the', 'way', 'the', 'original', 'algorithm', 'is', 'practically', 'unusable', 'but', 'we', 'discover', 'a', 'series', 'of', 'improvements', 'which', 'make', 'its', 'evaluation', 'possible', 'crucially', 'we', 'observe', 'that', 'a', 'certain', 'constant', 'in', 'the', 'algorithm', 'can', 'be', 'treated', 'as', 'a', 'tuning', 'parameter', 'which', 'yields', 'an', 'efficient', 'heuristic', 'essentially', 'searching', 'in', 'a', 'smallerthanguaranteed', 'neighborhood', 'furthermore', 'the', 'algorithm', 'uses', 'an', 'overly', 'expensive', 'strategy', 'to', 'find', 'a', 'best', 'step', 'while', 'finding', 'only', 'an', 'approximatelly', 'best', 'step', 'is', 'much', 'cheaper', 'yet', 'sufficient', 'for', 'quick', 'convergence', 'using', 'this', 'insight', 'we', 'improve', 'the', 'asymptotic', 'dependence', 'on', 'n', 'from', 'n3', 'to', 'n2', 'log', 'n', 'we', 'show', 'that', 'decreasing', 'the', 'tuning', 'parameter', 'initially', 'leads', 'to', 'an', 'increased', 'number', 'of', 'iterations', 'needed', 'for', 'convergence', 'and', 'eventually', 'to', 'getting', 'stuck', 'in', 'local', 'optima', 'as', 'expected', 'however', 'surprisingly', 'small', 'values', 'of', 'the', 'parameter', 'already', 'exhibit', 'good', 'behavior', 'second', 'our', 'new', 'strategy', 'for', 'finding', 'approximatelly', 'best', 'steps', 'wildly', 'outperforms', 'the', 'original', 'construction']] | [-0.11566434772103093, 0.059534350136580705, -0.07536365894262086, 0.0333014628066766, -0.09716814518482848, -0.18457800736481494, 0.08409566074694422, 0.37951023936271666, -0.26535635702650656, -0.35073149896269157, 0.1228112379241396, -0.2298137537110597, -0.17251032385001466, 0.1817191035088829, -0.07258593461560932, 0.06874591141018424, 0.07079528637399728, 0.02436788918619806, -0.06755395810955882, -0.32305016337470577, 0.22112422542223198, 0.07846789946581173, 0.2360782662931491, 0.008357468273236671, 0.09156696755777706, 0.011274382880933858, -0.011489524812945589, 0.03322332517328588, -0.09304741383400555, 0.10265669682571156, 0.2633331789711321, 0.15946315053710186, 0.30844662129878997, -0.42317677575078877, -0.13677756344592623, 0.12043314879082821, 0.17557370839323003, 0.11481745846061545, -0.035041302502663296, -0.20684536982581697, 0.11258059427247975, -0.12481115326031365, -0.11536218028219247, -0.09761372735808518, 0.040649590497328476, -0.006291716398290274, -0.3294558744094419, 0.006184782732532106, 0.07810597925531593, 0.02114187013019215, -0.012882809419481254, -0.16144778552549807, 0.022594354703853077, 0.10571463750209659, 0.04753317193043503, 0.06657988468185067, 0.08812628903172233, -0.10381539336109365, -0.10955263803670691, 0.33095319142480467, -0.04533431747928262, -0.1729329271546819, 0.15361711475320838, -0.04738075882281092, -0.16374551294540818, 0.15276754986875776, 0.13111194505504417, 0.15808646371757443, -0.1006197727247226, 0.12072658748979764, -0.05942446714584631, 0.19820726216516713, 0.07628023366867141, 0.014203140047294172, 0.10758984699337319, 0.17790402476715494, 0.149423903610388, 0.12866599877407267, -0.021186145684597167, -0.08418161308075386, -0.2579665763134306, -0.15327901424935342, -0.2051146010207859, 0.01015770948915319, -0.13498505896999796, -0.15143427078993144, 0.35547738805074586, 0.1435121441378512, 0.22597139860926704, 0.10151442292739045, 0.2887426084381613, 0.11217072651150044, 0.06953453272327104, 0.13308950050310656, 0.19973646346648985, 0.05262584792280739, 0.0786234703253616, -0.19615336161942898, 0.1003221221907403, 0.10037788521498442] |
1,802.09008 | Semiclassical resolvent bound for compactly supported $L^\infty$
potentials | We give an elementary proof of a weighted resolvent estimate for
semiclassical Schr\"odinger operators in dimension $n \ge 1$. We require the
potential belong to $L^\infty(\mathbb{R}^n)$ and have compact support, but do
not require that it have derivatives in $L^\infty(\mathbb{R}^n)$. The weighted
resolvent norm is bounded by $e^{Ch^{-4/3}\log(h^{-1})}$, where $h$ is the
semiclassical parameter.
| math.AP | we give an elementary proof of a weighted resolvent estimate for semiclassical schrodinger operators in dimension n ge 1 we require the potential belong to linftymathbbrn and have compact support but do not require that it have derivatives in linftymathbbrn the weighted resolvent norm is bounded by ech43logh1 where h is the semiclassical parameter | [['we', 'give', 'an', 'elementary', 'proof', 'of', 'a', 'weighted', 'resolvent', 'estimate', 'for', 'semiclassical', 'schrodinger', 'operators', 'in', 'dimension', 'n', 'ge', '1', 'we', 'require', 'the', 'potential', 'belong', 'to', 'linftymathbbrn', 'and', 'have', 'compact', 'support', 'but', 'do', 'not', 'require', 'that', 'it', 'have', 'derivatives', 'in', 'linftymathbbrn', 'the', 'weighted', 'resolvent', 'norm', 'is', 'bounded', 'by', 'ech43logh1', 'where', 'h', 'is', 'the', 'semiclassical', 'parameter']] | [-0.07777169850690044, 0.12362850347851219, -0.05719681334174414, 0.0836450008824819, -0.1284498254865197, -0.16034703760601157, -0.024842907129874768, 0.3969611131920005, -0.20870857316789762, -0.19053213133142805, 0.11122585943337741, -0.3167118615699264, -0.09444214202648134, 0.15998646121621482, -0.07988682187619214, 0.049431545835620955, 0.04570667705727073, 0.1275671011996719, -0.044298748129908486, -0.24272021138161984, 0.3757552413515887, -0.06346673186306122, 0.12783487640180677, 0.0922407822876747, 0.031019328478372323, -0.009103843735812127, 0.02083109364897575, -0.06505147912451681, -0.16106842597575863, 0.10284509899903019, 0.2540772596971606, 0.12883939564597072, 0.32034515886444526, -0.4567764691727341, -0.205799741907713, 0.2170781334159228, 0.20289044919476476, 0.011569616578097613, -0.02814195707510665, -0.24759058890653388, 0.10898115839106294, -0.11527792398404893, -0.17850925447419286, -0.1376405473324066, 0.06988841319843284, 0.048950451092337664, -0.33885088410087916, 0.09419395912104761, 0.14092017959733055, 0.020040755002003797, -0.10240957458538688, -0.1401011952076037, 0.02047503382881295, 0.05454718468069398, -0.05861891416903093, 0.0442295794963907, 0.02757455461069871, -0.018677490253774624, -0.07313452501131117, 0.2951010902025649, -0.07427929257446865, -0.3051965472833166, 0.09490422446737592, -0.19356840000189138, -0.12639985830997522, 0.09593166326576809, 0.11615579944314822, 0.184716749479467, -0.0799473651315806, 0.2709561096897507, -0.04554503053461887, 0.1498748310402317, 0.06772388714664387, 0.10279947312829911, 0.031055327118286548, 0.053888202767889457, 0.19904693370280824, 0.04581104525593373, -0.013604243936122588, -0.04972774823600391, -0.3705245776558822, -0.1665498601966801, -0.2652770976694125, 0.12578292286384823, -0.11746428181161392, -0.2369564651458893, 0.33012081454244424, 0.11082503452615917, 0.2079182176692587, 0.0904761540510182, 0.17218305346257282, 0.209709499413499, 0.0926778187781994, 0.11020623537588795, 0.2213472321471375, 0.1460214215814013, 0.06383094184522359, -0.13612766370599, -0.006947949976783316, 0.19637559994891557] |
1,802.09009 | Galaxy Tagging: photometric redshift refinement and group richness
enhancement | We present a new scheme, $\it{galtag}$, for refining the photometric redshift
measurements of faint galaxies by probabilistically tagging them to observed
galaxy groups constructed from a brighter, magnitude-limited spectroscopy
survey. First, this method is tested on the DESI light-cone data constructed on
the GALFORM galaxy formation model to tests its validity. We then apply it to
the photometric observations of galaxies in the Kilo-Degree Imaging Survey
(KiDS) over a 1 deg$^2$ region centred at 15$^\mathrm{h}$. This region contains
Galaxy and Mass Assembly (GAMA) deep spectroscopic observations (i-band<22) and
an accompanying group catalogue to r-band<19.8. We demonstrate that even with
some trade-off in sample size, an order of magnitude improvement on the
accuracy of photometric redshifts is achievable when using $\it{galtag}$. This
approach provides both refined photometric redshift measurements and group
richness enhancement. In combination these products will hugely improve the
scientific potential of both photometric and spectroscopic datasets. The
$\it{galtag}$ software will be made publicly available at
https://github.com/pkaf/galtag.git.
| astro-ph.GA | we present a new scheme itgaltag for refining the photometric redshift measurements of faint galaxies by probabilistically tagging them to observed galaxy groups constructed from a brighter magnitudelimited spectroscopy survey first this method is tested on the desi lightcone data constructed on the galform galaxy formation model to tests its validity we then apply it to the photometric observations of galaxies in the kilodegree imaging survey kids over a 1 deg2 region centred at 15mathrmh this region contains galaxy and mass assembly gama deep spectroscopic observations iband22 and an accompanying group catalogue to rband198 we demonstrate that even with some tradeoff in sample size an order of magnitude improvement on the accuracy of photometric redshifts is achievable when using itgaltag this approach provides both refined photometric redshift measurements and group richness enhancement in combination these products will hugely improve the scientific potential of both photometric and spectroscopic datasets the itgaltag software will be made publicly available at httpsgithubcompkafgaltaggit | [['we', 'present', 'a', 'new', 'scheme', 'itgaltag', 'for', 'refining', 'the', 'photometric', 'redshift', 'measurements', 'of', 'faint', 'galaxies', 'by', 'probabilistically', 'tagging', 'them', 'to', 'observed', 'galaxy', 'groups', 'constructed', 'from', 'a', 'brighter', 'magnitudelimited', 'spectroscopy', 'survey', 'first', 'this', 'method', 'is', 'tested', 'on', 'the', 'desi', 'lightcone', 'data', 'constructed', 'on', 'the', 'galform', 'galaxy', 'formation', 'model', 'to', 'tests', 'its', 'validity', 'we', 'then', 'apply', 'it', 'to', 'the', 'photometric', 'observations', 'of', 'galaxies', 'in', 'the', 'kilodegree', 'imaging', 'survey', 'kids', 'over', 'a', '1', 'deg2', 'region', 'centred', 'at', '15mathrmh', 'this', 'region', 'contains', 'galaxy', 'and', 'mass', 'assembly', 'gama', 'deep', 'spectroscopic', 'observations', 'iband22', 'and', 'an', 'accompanying', 'group', 'catalogue', 'to', 'rband198', 'we', 'demonstrate', 'that', 'even', 'with', 'some', 'tradeoff', 'in', 'sample', 'size', 'an', 'order', 'of', 'magnitude', 'improvement', 'on', 'the', 'accuracy', 'of', 'photometric', 'redshifts', 'is', 'achievable', 'when', 'using', 'itgaltag', 'this', 'approach', 'provides', 'both', 'refined', 'photometric', 'redshift', 'measurements', 'and', 'group', 'richness', 'enhancement', 'in', 'combination', 'these', 'products', 'will', 'hugely', 'improve', 'the', 'scientific', 'potential', 'of', 'both', 'photometric', 'and', 'spectroscopic', 'datasets', 'the', 'itgaltag', 'software', 'will', 'be', 'made', 'publicly', 'available', 'at', 'httpsgithubcompkafgaltaggit']] | [-0.049342053967706447, 0.006645154153327942, -0.1102339026197646, 0.0556108833270982, -0.14291852967535423, -0.03588270432581859, 0.06671598284390404, 0.4656380546617914, -0.1493696669697181, -0.3542346134388747, 0.08730797267401011, -0.32599658464299297, -0.02470419126526489, 0.24757479114647707, -0.043921147131847894, 0.0002551188041583042, 0.1289906858393995, -0.10730553891618627, -0.03725799563769463, -0.39461327945910296, 0.26901934342307654, 0.09942068792890921, 0.23995826432221362, -0.0511769481451559, 0.10895285005273007, -0.035001169784333215, -0.15009909337870292, -0.016255415513410004, -0.22036182045107502, 0.047894343460135935, 0.28369516612472034, 0.17567628257387838, 0.25330097354077674, -0.26563139635344396, -0.17008057453173708, 0.06063545389741949, 0.20436557922693718, 0.0697361345006215, -0.07663485866460296, -0.3380242140537321, 0.07342168459798779, -0.18342362653899502, -0.12938459687745318, -0.03293533384642721, -0.04804019767537036, 0.01771209466077581, -0.22305832482729251, 0.1128787081265314, -0.05497519814790311, 0.15722886495014, -0.10121483640675735, -0.09731494100740204, -0.031077954576459604, 0.1123319268341905, -0.0464796431388331, 0.09927441688729208, 0.11553272444984646, -0.1604264550961406, -0.01986123655330051, 0.3613272507300044, -0.07035664422248562, -0.021175518688630893, 0.15966212133235938, -0.1877087560458133, -0.21320383950112412, 0.07803297971296669, 0.1992967349549683, 0.08420704974030907, -0.19024153165233867, 0.027024242971787932, 0.013019828999705323, 0.2495248472293863, 0.0013636997764833367, 0.04911131716766863, 0.2382100361955727, 0.15025311434949906, 0.059011910813739646, 0.09774886464319107, -0.2387433975888492, 0.03914126474334701, -0.2634567679926547, -0.06841231008096561, -0.1757006012598754, 0.06090665106395526, -0.1352653869986383, -0.09310567275735901, 0.38051745885092136, 0.18396511132974033, 0.16481247219686432, 0.11241828888736351, 0.3548348210328682, -0.01795326807239855, 0.14379946966035678, 0.02317892267767872, 0.28793715214294036, 0.10312110663530744, 0.04672389833054198, -0.17602781220505545, 0.007666388735199323, 0.01353284650083099] |
1,802.0901 | Branching ratios and $CP$ asymmetries of $B\rightarrow \chi_{c1}K(\pi)$
decays | We investigate the exclusive nonleptonic decays $B\rightarrow
\chi_{c1}K(\pi)$ in the conventional perturbative QCD (PQCD) formalism. The
predictions of branching ratios and $CP$ asymmetries are given in detail. We
compare our results with available experimental data as well as predictions of
other theoretical studies existing in the literature. It seems that the
branching ratios of $B\rightarrow \chi_{c1} K$ are more consistent with data
than the earlier analyses. For the Cabibbo-suppressed $B_s$ decay, the
branching ratio can reach the order of $10^{-5}$, which would be straight
forward for experimental observations. The numerical results show that the
direct $CP$ asymmetries of the concerned decays are rather small. The
mixing-induced $CP$ asymmetry in the $B^0\rightarrow \chi_{c1}K_S$ is very
close to $\sin{2\beta}$, which suggests that this channel offer an alternative
method for measuring the Cabbibo-Kobayashi-Maskawa (CKM) angle $\beta$. The
obtained results in the present work could be tested by further experiments in
the LHCb and forthcoming Belle II.
| hep-ph | we investigate the exclusive nonleptonic decays brightarrow chi_c1kpi in the conventional perturbative qcd pqcd formalism the predictions of branching ratios and cp asymmetries are given in detail we compare our results with available experimental data as well as predictions of other theoretical studies existing in the literature it seems that the branching ratios of brightarrow chi_c1 k are more consistent with data than the earlier analyses for the cabibbosuppressed b_s decay the branching ratio can reach the order of 105 which would be straight forward for experimental observations the numerical results show that the direct cp asymmetries of the concerned decays are rather small the mixinginduced cp asymmetry in the b0rightarrow chi_c1k_s is very close to sin2beta which suggests that this channel offer an alternative method for measuring the cabbibokobayashimaskawa ckm angle beta the obtained results in the present work could be tested by further experiments in the lhcb and forthcoming belle ii | [['we', 'investigate', 'the', 'exclusive', 'nonleptonic', 'decays', 'brightarrow', 'chi_c1kpi', 'in', 'the', 'conventional', 'perturbative', 'qcd', 'pqcd', 'formalism', 'the', 'predictions', 'of', 'branching', 'ratios', 'and', 'cp', 'asymmetries', 'are', 'given', 'in', 'detail', 'we', 'compare', 'our', 'results', 'with', 'available', 'experimental', 'data', 'as', 'well', 'as', 'predictions', 'of', 'other', 'theoretical', 'studies', 'existing', 'in', 'the', 'literature', 'it', 'seems', 'that', 'the', 'branching', 'ratios', 'of', 'brightarrow', 'chi_c1', 'k', 'are', 'more', 'consistent', 'with', 'data', 'than', 'the', 'earlier', 'analyses', 'for', 'the', 'cabibbosuppressed', 'b_s', 'decay', 'the', 'branching', 'ratio', 'can', 'reach', 'the', 'order', 'of', '105', 'which', 'would', 'be', 'straight', 'forward', 'for', 'experimental', 'observations', 'the', 'numerical', 'results', 'show', 'that', 'the', 'direct', 'cp', 'asymmetries', 'of', 'the', 'concerned', 'decays', 'are', 'rather', 'small', 'the', 'mixinginduced', 'cp', 'asymmetry', 'in', 'the', 'b0rightarrow', 'chi_c1k_s', 'is', 'very', 'close', 'to', 'sin2beta', 'which', 'suggests', 'that', 'this', 'channel', 'offer', 'an', 'alternative', 'method', 'for', 'measuring', 'the', 'cabbibokobayashimaskawa', 'ckm', 'angle', 'beta', 'the', 'obtained', 'results', 'in', 'the', 'present', 'work', 'could', 'be', 'tested', 'by', 'further', 'experiments', 'in', 'the', 'lhcb', 'and', 'forthcoming', 'belle', 'ii']] | [-0.08726240365360463, 0.17792496568030317, -0.06607428272347281, 0.0892298264391967, -0.07231832925069905, -0.13706071490409555, 0.07778158224810729, 0.326858172205505, -0.19225317776042794, -0.21662914670313035, 0.0448132648613822, -0.3310755359853883, -0.024971071501194642, 0.18787689511941758, 0.053641753372989154, 0.11979090572266982, 0.13787505140648354, -0.032702102360549996, -0.08304718343559529, -0.19000738749430138, 0.20824489295513474, 0.04856246101225893, 0.2385206190832206, 0.10050499936972825, -0.10293582656161723, -0.06865970565110988, -0.11675191178473811, -0.0006472363879916486, -0.1710726004517433, 0.0604069546356162, 0.2621006341527728, 0.15113391264400364, 0.08875457896844835, -0.3706933439197327, -0.07344197294372597, 0.1331228166402299, 0.1842906747047253, 0.08681304499180062, -0.03294197566214015, -0.36900361955461913, 0.13063175585552655, -0.16791095224283142, -0.08104020934891178, -0.11152191877069063, 0.016797309275716543, -0.0581845570084275, -0.3663767751488243, 0.10265710800485253, -0.06493224049625387, 0.021461270499777124, 0.030549864287778044, -0.2636717428077037, 0.034021235138967335, 0.041289416252826616, 0.14102834687932142, 0.05885657389950476, 0.14156964680315642, -0.11175326156948033, -0.20006346194048888, 0.40227707430399606, -0.07944774003177095, -0.16934515714771822, 0.13992320237695147, -0.23598191092123852, -0.18214063039851308, 0.12356871174222833, 0.15248581250229024, 0.07931660869103295, -0.16141955289891027, 0.07382241205932165, -0.06857435392764773, 0.13586786031932724, 0.023484056578819572, 0.05311614895140789, 0.16936674844997854, 0.20659760845862082, -0.04432727327101574, 0.05458465869891587, -0.09684948908744861, -0.08366156446312659, -0.3747793386516081, -0.13475634132044806, -0.07627859659375784, 0.0493759898367085, -0.08871299408519616, -0.044295097226627785, 0.32671926699776127, 0.14154304971992476, 0.3063430668761497, 0.06996275675143825, 0.35161947080208644, 0.10407026290480319, 0.0414078240745411, 0.0002470441927380909, 0.3779816049465675, 0.16702972550025297, 0.15334769611598442, -0.28378938245494534, 0.13050512049914012, -0.02319788345635332] |
1,802.09011 | $\eta'$ Production in Nucleus-Nucleus collisions as a probe of chiral
dynamics | We argue that, because of the peculiar properties of the $\eta'$ meson, it is
a promising probe of "chiral" dynamics. In particular, we show that a rotating
gluon-dominated plasma might lead to an enhanced production of $\eta'$ w.r.t.
statistical model expectations. The presence of a strong topological
susceptibility might give a similar effect. In both cases, unlike the
statistical model,we expect a non-trivial dependence on event geometry, such as
initial volume and impact parameter.
Hence, an observation of $\eta'/\pi^0$ ratio depending strongly on impact
parameter might be a good indication of chiral effects, either from vorticity
or topological phases of QCD
| nucl-th hep-ph nucl-ex | we argue that because of the peculiar properties of the eta meson it is a promising probe of chiral dynamics in particular we show that a rotating gluondominated plasma might lead to an enhanced production of eta wrt statistical model expectations the presence of a strong topological susceptibility might give a similar effect in both cases unlike the statistical modelwe expect a nontrivial dependence on event geometry such as initial volume and impact parameter hence an observation of etapi0 ratio depending strongly on impact parameter might be a good indication of chiral effects either from vorticity or topological phases of qcd | [['we', 'argue', 'that', 'because', 'of', 'the', 'peculiar', 'properties', 'of', 'the', 'eta', 'meson', 'it', 'is', 'a', 'promising', 'probe', 'of', 'chiral', 'dynamics', 'in', 'particular', 'we', 'show', 'that', 'a', 'rotating', 'gluondominated', 'plasma', 'might', 'lead', 'to', 'an', 'enhanced', 'production', 'of', 'eta', 'wrt', 'statistical', 'model', 'expectations', 'the', 'presence', 'of', 'a', 'strong', 'topological', 'susceptibility', 'might', 'give', 'a', 'similar', 'effect', 'in', 'both', 'cases', 'unlike', 'the', 'statistical', 'modelwe', 'expect', 'a', 'nontrivial', 'dependence', 'on', 'event', 'geometry', 'such', 'as', 'initial', 'volume', 'and', 'impact', 'parameter', 'hence', 'an', 'observation', 'of', 'etapi0', 'ratio', 'depending', 'strongly', 'on', 'impact', 'parameter', 'might', 'be', 'a', 'good', 'indication', 'of', 'chiral', 'effects', 'either', 'from', 'vorticity', 'or', 'topological', 'phases', 'of', 'qcd']] | [-0.1554692208508749, 0.17886851112257993, -0.14500476978719234, 0.07929831748139021, -0.08386130057422832, -0.09915011952917027, 0.05077017100970491, 0.31384843172007565, -0.21999411901809496, -0.26747688848414636, 0.05408761195036223, -0.27975319649581565, -0.12764296604384953, 0.17236153547661287, -0.007832062481395384, 0.011189125741066614, 0.03855616076143993, 0.05929680316395467, -0.08971756429867911, -0.16157105466175714, 0.3100082225956963, 0.05725881687854186, 0.27526458517860364, 0.1252156546486929, 0.031943300328595506, -0.03188223958402724, 0.005301930739355301, 0.08860050095603637, -0.13125117018814245, 0.003334188372781961, 0.16255077318574238, 0.038902844425687325, 0.17946425599442556, -0.3901530366095871, -0.23047425560561, 0.12358906080872559, 0.15700766968420973, 0.10859563705911353, -0.07874534911439192, -0.2628137549698943, 0.07157537664314455, -0.19220187500266744, -0.14432066729601178, -0.09437391817532849, 0.026290876246841236, -0.011751896821626343, -0.29962782412629096, 0.10982164420708461, 0.050903133183514866, 0.04532448448111663, -0.03405523718343956, -0.12077020644440804, -0.04902612069842986, 0.05056412997978306, 0.10903180109009626, 0.054729459355446965, 0.16037450527016184, -0.19952422386210522, -0.11357833682974376, 0.4057614777310945, -0.08040314610346709, -0.18962744604980591, 0.20026135157867528, -0.1846166208069737, -0.16734910387047888, 0.1158760030094608, 0.1940933384109602, 0.09255611831967783, -0.07567466810198113, 0.04835079333429124, -0.029639295929360508, 0.21365494597795429, 0.017592736118758966, 0.10496339091044472, 0.28328258955463914, 0.16507629675117533, 0.023333933447616747, 0.12856601728506772, -0.08443826598825284, -0.09040006724103253, -0.3243543609635591, -0.13675675191974157, -0.12219739328069372, 0.09388553161210943, -0.1238716879286423, -0.19606637051052386, 0.3542915358908917, 0.14968531951654038, 0.2470935764630316, -0.05780921455030099, 0.2539823180673146, 0.10186806522046982, 0.021829577743785807, 0.03294646083423407, 0.29724419754146053, 0.13341193427654482, 0.0808938181599473, -0.2627797595220664, 0.10605893031887637, 0.019299731709726965] |
1,802.09012 | Cost-benefit Analysis of Visualization in Virtual Environments | Visualization and virtual environments (VEs) have been two interconnected
parallel strands in visual computing for decades. Some VEs have been purposely
developed for visualization applications, while many visualization applications
are exemplary showcases in general-purpose VEs. Because of the development and
operation costs of VEs, the majority of visualization applications in practice
are yet to benefit from the capacity of VEs. In this paper, we examine this
perplexity from an information-theoretic perspective. Our objectives are to
conduct cost-benefit analysis on typical VE systems (including augmented and
mixed reality, theatre-based systems, and large powerwalls), to explain why
some visualization applications benefit more from VEs than others, and to
sketch out pathways for the future development of visualization applications in
VEs. We support our theoretical propositions and analysis using theories and
discoveries in the literature of cognitive sciences and the practical evidence
reported in the literatures of visualization and VEs.
| cs.HC cs.GR | visualization and virtual environments ves have been two interconnected parallel strands in visual computing for decades some ves have been purposely developed for visualization applications while many visualization applications are exemplary showcases in generalpurpose ves because of the development and operation costs of ves the majority of visualization applications in practice are yet to benefit from the capacity of ves in this paper we examine this perplexity from an informationtheoretic perspective our objectives are to conduct costbenefit analysis on typical ve systems including augmented and mixed reality theatrebased systems and large powerwalls to explain why some visualization applications benefit more from ves than others and to sketch out pathways for the future development of visualization applications in ves we support our theoretical propositions and analysis using theories and discoveries in the literature of cognitive sciences and the practical evidence reported in the literatures of visualization and ves | [['visualization', 'and', 'virtual', 'environments', 'ves', 'have', 'been', 'two', 'interconnected', 'parallel', 'strands', 'in', 'visual', 'computing', 'for', 'decades', 'some', 'ves', 'have', 'been', 'purposely', 'developed', 'for', 'visualization', 'applications', 'while', 'many', 'visualization', 'applications', 'are', 'exemplary', 'showcases', 'in', 'generalpurpose', 'ves', 'because', 'of', 'the', 'development', 'and', 'operation', 'costs', 'of', 'ves', 'the', 'majority', 'of', 'visualization', 'applications', 'in', 'practice', 'are', 'yet', 'to', 'benefit', 'from', 'the', 'capacity', 'of', 'ves', 'in', 'this', 'paper', 'we', 'examine', 'this', 'perplexity', 'from', 'an', 'informationtheoretic', 'perspective', 'our', 'objectives', 'are', 'to', 'conduct', 'costbenefit', 'analysis', 'on', 'typical', 've', 'systems', 'including', 'augmented', 'and', 'mixed', 'reality', 'theatrebased', 'systems', 'and', 'large', 'powerwalls', 'to', 'explain', 'why', 'some', 'visualization', 'applications', 'benefit', 'more', 'from', 'ves', 'than', 'others', 'and', 'to', 'sketch', 'out', 'pathways', 'for', 'the', 'future', 'development', 'of', 'visualization', 'applications', 'in', 'ves', 'we', 'support', 'our', 'theoretical', 'propositions', 'and', 'analysis', 'using', 'theories', 'and', 'discoveries', 'in', 'the', 'literature', 'of', 'cognitive', 'sciences', 'and', 'the', 'practical', 'evidence', 'reported', 'in', 'the', 'literatures', 'of', 'visualization', 'and', 'ves']] | [-0.05709089880632558, 0.019951369224923084, -0.060619510409968165, 0.04616470984183252, -0.10812166310718348, -0.12594620097942394, 0.03151943547217625, 0.4005976934499782, -0.22266555893845086, -0.3441143242224794, 0.11989446439025603, -0.2943180488807888, -0.20201375641346234, 0.27595543411624585, -0.08984336496876745, 0.09094435558092363, 0.11471669317447934, -0.03348862081766128, -0.0269950005073293, -0.23048282868212797, 0.2555210379112897, 0.05242483468148215, 0.32623338647957506, 0.09202580262890792, 0.016367806166667363, 0.014597100831953615, -0.07782403808408256, 0.020966429658362578, -0.11309531330078808, 0.196857284178861, 0.36921950297847644, 0.24476376457846372, 0.3276749066494662, -0.47305248676445977, -0.2353595319123746, 0.04278237970048112, 0.16361212064351502, 0.07908655169805319, -0.09748999238554147, -0.2968326217719707, 0.07084779365044408, -0.18694525603847256, -0.05753714648749808, -0.1458047106797839, 0.028673311365278568, 0.0030250930658878824, -0.19920107252125083, -0.025569598773365905, 0.00918754928741315, 0.16757267772115703, -0.04007212903414821, -0.18993134779919837, 0.05606441101187776, 0.16544984465721865, 0.04686346978976809, -0.02343383328025711, 0.11617673476194514, -0.1625233561507073, -0.2067001921734933, 0.3760374832753863, 0.04751537605459754, -0.14762984772437604, 0.2789321178714905, -0.07201921652103292, -0.22158720523504347, 0.06284278260608171, 0.24166676083274571, 0.04666701968887756, -0.152206899035433, 0.05536434797786883, 0.009983277921404304, 0.10930509270522101, 0.030341978438583942, 0.05185055033432256, 0.18685991110215927, 0.2358495306063058, 0.0013421452118501324, 0.12461063473581754, -0.018953937569890042, -0.12846445425188746, -0.22795074619031672, -0.21002267013576909, -0.1352400371901177, -0.02462173413228372, -0.011657813530925116, -0.10277094641250784, 0.35443709077120855, 0.22695579444347272, 0.13350138693349436, 0.008603236581407617, 0.35741857239205777, 0.016232383061714213, 0.09155759892008941, 0.0692273326426873, 0.22595995721479492, 0.06628034227640078, 0.20140895298682154, -0.11874460257140212, 0.07888032323841392, -0.046102111221387465] |
1,802.09013 | On decompositions and approximations of conjugate partial-symmetric
complex tensors | Conjugate partial-symmetric (CPS) tensors are the high-order generalization
of Hermitian matrices. As the role played by Hermitian matrices in matrix
theory and quadratic optimization, CPS tensors have shown growing interest
recently in tensor theory and optimization, particularly in many
application-driven complex polynomial optimization problems. In this paper, we
study CPS tensors with a focus on ranks, rank-one decompositions and
approximations, as well as their applications. The analysis is conducted along
side with a more general class of complex tensors called partial-symmetric
tensors. We prove constructively that any CPS tensor can be decomposed into a
sum of rank-one CPS tensors, which provides an alternative definition of CPS
tensors via linear combinations of rank-one CPS tensors. Three types of ranks
for CPS tensors are defined and shown to be different in general. This leads to
the invalidity of the conjugate version of Comon's conjecture. We then study
rank-one approximations and matricizations of CPS tensors. By carefully
unfolding CPS tensors to Hermitian matrices, rank-one equivalence can be
preserved. This enables us to develop new convex optimization models and
algorithms to compute best rank-one approximation of CPS tensors. Numerical
experiments from various data are performed to justify the capability of our
methods.
| math.OC | conjugate partialsymmetric cps tensors are the highorder generalization of hermitian matrices as the role played by hermitian matrices in matrix theory and quadratic optimization cps tensors have shown growing interest recently in tensor theory and optimization particularly in many applicationdriven complex polynomial optimization problems in this paper we study cps tensors with a focus on ranks rankone decompositions and approximations as well as their applications the analysis is conducted along side with a more general class of complex tensors called partialsymmetric tensors we prove constructively that any cps tensor can be decomposed into a sum of rankone cps tensors which provides an alternative definition of cps tensors via linear combinations of rankone cps tensors three types of ranks for cps tensors are defined and shown to be different in general this leads to the invalidity of the conjugate version of comons conjecture we then study rankone approximations and matricizations of cps tensors by carefully unfolding cps tensors to hermitian matrices rankone equivalence can be preserved this enables us to develop new convex optimization models and algorithms to compute best rankone approximation of cps tensors numerical experiments from various data are performed to justify the capability of our methods | [['conjugate', 'partialsymmetric', 'cps', 'tensors', 'are', 'the', 'highorder', 'generalization', 'of', 'hermitian', 'matrices', 'as', 'the', 'role', 'played', 'by', 'hermitian', 'matrices', 'in', 'matrix', 'theory', 'and', 'quadratic', 'optimization', 'cps', 'tensors', 'have', 'shown', 'growing', 'interest', 'recently', 'in', 'tensor', 'theory', 'and', 'optimization', 'particularly', 'in', 'many', 'applicationdriven', 'complex', 'polynomial', 'optimization', 'problems', 'in', 'this', 'paper', 'we', 'study', 'cps', 'tensors', 'with', 'a', 'focus', 'on', 'ranks', 'rankone', 'decompositions', 'and', 'approximations', 'as', 'well', 'as', 'their', 'applications', 'the', 'analysis', 'is', 'conducted', 'along', 'side', 'with', 'a', 'more', 'general', 'class', 'of', 'complex', 'tensors', 'called', 'partialsymmetric', 'tensors', 'we', 'prove', 'constructively', 'that', 'any', 'cps', 'tensor', 'can', 'be', 'decomposed', 'into', 'a', 'sum', 'of', 'rankone', 'cps', 'tensors', 'which', 'provides', 'an', 'alternative', 'definition', 'of', 'cps', 'tensors', 'via', 'linear', 'combinations', 'of', 'rankone', 'cps', 'tensors', 'three', 'types', 'of', 'ranks', 'for', 'cps', 'tensors', 'are', 'defined', 'and', 'shown', 'to', 'be', 'different', 'in', 'general', 'this', 'leads', 'to', 'the', 'invalidity', 'of', 'the', 'conjugate', 'version', 'of', 'comons', 'conjecture', 'we', 'then', 'study', 'rankone', 'approximations', 'and', 'matricizations', 'of', 'cps', 'tensors', 'by', 'carefully', 'unfolding', 'cps', 'tensors', 'to', 'hermitian', 'matrices', 'rankone', 'equivalence', 'can', 'be', 'preserved', 'this', 'enables', 'us', 'to', 'develop', 'new', 'convex', 'optimization', 'models', 'and', 'algorithms', 'to', 'compute', 'best', 'rankone', 'approximation', 'of', 'cps', 'tensors', 'numerical', 'experiments', 'from', 'various', 'data', 'are', 'performed', 'to', 'justify', 'the', 'capability', 'of', 'our', 'methods']] | [-0.13429637649868692, 0.06068397567398687, -0.043868088757391184, 0.027859110916175937, -0.10003085813142967, -0.1375982785925307, -0.03566412529337923, 0.3471504446195987, -0.2973809719800816, -0.24107959041162869, 0.1316429631747733, -0.24734097761125778, -0.25054806485719866, 0.12594270024790752, -0.051934350474395465, 0.08825543603315779, 0.029500239369535476, -0.026698724737352863, -0.17276409939784906, -0.25762554477634175, 0.33717276973469296, 0.027590401004999876, 0.2541223727309202, 0.07030779684356851, 0.09949585177510388, 0.021569171915667092, -0.05794238152780703, 0.04159425095921116, -0.04137402646647017, 0.16398453505647995, 0.3612160113059278, 0.19882951693119938, 0.25455011584919557, -0.42791035766143126, -0.13757039050509848, 0.17202848110262456, 0.10571928960817618, 0.06532739832871404, -0.006970132652171816, -0.2587230989082279, 0.13890703851464015, -0.1882072879543186, -0.08720302583450186, -0.2066801050523467, -0.0015750989051801817, 0.008981033857930832, -0.30838360547976645, 0.03884198658562703, 0.08257017263546301, 0.03698087570636726, -0.07143599392575382, -0.19474154796655652, 0.02248040970345978, 0.05985839418800814, 0.06922385248008697, -0.06560902304861847, 0.11462476170545786, -0.03071079565311915, -0.13032346233079323, 0.3943202957244856, -0.05468705487532579, -0.30423714237035804, 0.14540794460644604, -0.022646924461789276, -0.16035823653124234, 0.08787702270831001, 0.24013541254680604, 0.18307214719243348, -0.14764859376959882, 0.12270258693321494, -0.05104226315375037, 0.11621782314079833, 0.06498468442397116, 0.005501975712238108, 0.16920849967662396, 0.06253688950988473, 0.1401957222269444, 0.163245086171498, 0.07099522672455796, -0.11293125304402973, -0.2601543047693463, -0.16033747764328038, -0.2055693953048571, 0.04412084553457264, -0.1306273231957861, -0.16704698340885332, 0.4223676227052145, 0.07116344954512006, 0.1515892428632265, 0.09082532384283175, 0.2839717057162934, 0.10314085053479564, 0.08526642536637563, 0.04428331577456651, 0.21119435090685681, 0.23043151265152786, 0.04744646517198761, -0.1398094681701005, 0.02019052098894834, 0.11734990301133343] |
1,802.09014 | Reconstruction of Convergence power spectrum from SNLS weak lensing data | We estimate the lensing convergence power spectrum from supernovae
magnification data using real space correlation function technique. For our
analysis we have utilized 296 supernovae from 5-year Supernovae Legacy Survey
in the weak lensing limit. The data we used consists of measurements from four
different patches, each of them covers almost 1 square degree of the sky,
merged together. We demonstrate that it is quite possible to have a good
estimate of the convergence power spectrum from this data. Our primary
intention is to extract meaningful informations from SNLS weak lensing data and
to demonstrate how the power spectrum for convergence can be reconstructed
therefrom, without going into the nitty-gritty of errors, although we have done
some error analysis in the process.
| astro-ph.CO astro-ph.GA gr-qc | we estimate the lensing convergence power spectrum from supernovae magnification data using real space correlation function technique for our analysis we have utilized 296 supernovae from 5year supernovae legacy survey in the weak lensing limit the data we used consists of measurements from four different patches each of them covers almost 1 square degree of the sky merged together we demonstrate that it is quite possible to have a good estimate of the convergence power spectrum from this data our primary intention is to extract meaningful informations from snls weak lensing data and to demonstrate how the power spectrum for convergence can be reconstructed therefrom without going into the nittygritty of errors although we have done some error analysis in the process | [['we', 'estimate', 'the', 'lensing', 'convergence', 'power', 'spectrum', 'from', 'supernovae', 'magnification', 'data', 'using', 'real', 'space', 'correlation', 'function', 'technique', 'for', 'our', 'analysis', 'we', 'have', 'utilized', '296', 'supernovae', 'from', '5year', 'supernovae', 'legacy', 'survey', 'in', 'the', 'weak', 'lensing', 'limit', 'the', 'data', 'we', 'used', 'consists', 'of', 'measurements', 'from', 'four', 'different', 'patches', 'each', 'of', 'them', 'covers', 'almost', '1', 'square', 'degree', 'of', 'the', 'sky', 'merged', 'together', 'we', 'demonstrate', 'that', 'it', 'is', 'quite', 'possible', 'to', 'have', 'a', 'good', 'estimate', 'of', 'the', 'convergence', 'power', 'spectrum', 'from', 'this', 'data', 'our', 'primary', 'intention', 'is', 'to', 'extract', 'meaningful', 'informations', 'from', 'snls', 'weak', 'lensing', 'data', 'and', 'to', 'demonstrate', 'how', 'the', 'power', 'spectrum', 'for', 'convergence', 'can', 'be', 'reconstructed', 'therefrom', 'without', 'going', 'into', 'the', 'nittygritty', 'of', 'errors', 'although', 'we', 'have', 'done', 'some', 'error', 'analysis', 'in', 'the', 'process']] | [-0.04046564893491688, -0.01988503475078061, -0.12869532174262843, 0.12584942521975717, -0.09335086862632974, -0.07030559030025586, 0.04645641260307099, 0.3722936595335878, -0.2716735610356707, -0.31295471297210603, 0.10492361423780867, -0.36681730149038994, -0.07129585681784684, 0.2628393796135168, -0.02656222584667629, 0.03984169319241506, 0.10999561540141213, -0.027045597474961006, -0.057932719915101426, -0.29088117955462456, 0.33010818729879426, 0.07953811536130846, 0.28520095021631875, -0.03324978701869545, 0.0874911764518312, -0.026998560314570538, -0.11328719725133851, 0.032374978740842726, -0.14964442787011828, 0.0929980352291929, 0.2368588569100763, 0.21100144808898208, 0.22268845234066248, -0.3530482881755919, -0.19178566181665804, 0.12577338290751958, 0.17008084612974866, 0.12137148267452101, -0.03627386703499456, -0.30482111449093846, 0.11748560641693775, -0.1613131252864851, -0.07907928942443161, -0.08795472790227561, -0.0566712190534492, 0.07315704689101606, -0.26093033453083186, 0.11706455776727469, 0.020512304055031207, 0.07907526333220914, -0.05609699008131369, -0.09598581661989332, -0.021312922369078047, 0.18543751447721094, 0.053485674557197826, 0.028560833184842448, 0.0809085396629926, -0.09453867136722156, -0.025041350059986082, 0.371355872624172, -0.09238394719670665, -0.10728043151759832, 0.12016643047882397, -0.1779489537365124, -0.17070730871017106, 0.14571953366499119, 0.20695197710492572, 0.04498967360495208, -0.17803325817813395, 0.052871221080555995, 0.022865910609787116, 0.20370324186553232, 0.03958594744078449, 0.022820812844686577, 0.19407965340575234, 0.12634930253738813, 0.08438192412341167, 0.12194859024736511, -0.19455259017570928, 0.00871969822777023, -0.29709873653062785, -0.04341713314662214, -0.2030767910945855, 0.09378021925336635, -0.1247918048612802, -0.08788892234385502, 0.40111189294743854, 0.18374220423446205, 0.20752185639795526, 0.06860669341213146, 0.3307991563113498, 0.06254307683423681, 0.08866940136449258, 0.04449281079473249, 0.3052557654896862, 0.12843945019565461, 0.11164166636623778, -0.1532902923378269, 0.008607766516105899, -0.0026176458846808213] |
1,802.09015 | Exchangeable interval hypergraphs and limits of ordered discrete
structures | A hypergraph $(V,E)$ is called an interval hypergraph if there exists a
linear order $l$ on $V$ such that every edge $e\in E$ is an interval w.r.t.
$l$; we also assume that $\{j\}\in E$ for every $j\in V$. Our main result is a
de Finetti-type representation of random exchangeable interval hypergraphs on
$\mathbb{N}$ (EIHs): the law of every EIH can be obtained by sampling from some
random compact subset $K$ of the triangle $\{(x,y):0\leq x\leq y\leq 1\}$ at
iid uniform positions $U_1,U_2,\dots$, in the sense that, restricted to the
node set $[n]:=\{1,\dots,n\}$ every non-singleton edge is of the form
$e=\{i\in[n]:x<U_i<y\}$ for some $(x,y)\in K$. We obtain this result via the
study of a related class of stochastic objects: erased-interval processes
(EIPs). These are certain transient Markov chains
$(I_n,\eta_n)_{n\in\mathbb{N}}$ such that $I_n$ is an interval hypergraph on
$V=[n]$ w.r.t. the usual linear order (called interval system). We present an
almost sure representation result for EIPs. Attached to each transient Markov
chain is the notion of Martin boundary. The points in the boundary attached to
EIPs can be seen as limits of growing interval systems. We obtain a one-to-one
correspondence between these limits and compact subsets $K$ of the triangle
with $(x,x)\in K$ for all $x\in[0,1]$. Interval hypergraphs are a
generalizations of hierarchies and as a consequence we obtain a representation
result for exchangeable hierarchies, which is close to a result of Forman,
Haulk and Pitman. Several ordered discrete structures can be seen as interval
systems with additional properties, i.e. Schr\"oder trees and binary trees. We
describe limits of Schr\"oder trees as certain tree-like compact sets.
Considering binary trees we thus obtain a homeomorphic description of the
Martin boundary of R\'emy's tree growth chain, which has been analyzed by
Evans, Gr\"ubel and Wakolbinger.
| math.PR | a hypergraph ve is called an interval hypergraph if there exists a linear order l on v such that every edge ein e is an interval wrt l we also assume that jin e for every jin v our main result is a de finettitype representation of random exchangeable interval hypergraphs on mathbbn eihs the law of every eih can be obtained by sampling from some random compact subset k of the triangle xy0leq xleq yleq 1 at iid uniform positions u_1u_2dots in the sense that restricted to the node set n1dotsn every nonsingleton edge is of the form eiinnxu_iy for some xyin k we obtain this result via the study of a related class of stochastic objects erasedinterval processes eips these are certain transient markov chains i_neta_n_ninmathbbn such that i_n is an interval hypergraph on vn wrt the usual linear order called interval system we present an almost sure representation result for eips attached to each transient markov chain is the notion of martin boundary the points in the boundary attached to eips can be seen as limits of growing interval systems we obtain a onetoone correspondence between these limits and compact subsets k of the triangle with xxin k for all xin01 interval hypergraphs are a generalizations of hierarchies and as a consequence we obtain a representation result for exchangeable hierarchies which is close to a result of forman haulk and pitman several ordered discrete structures can be seen as interval systems with additional properties ie schroder trees and binary trees we describe limits of schroder trees as certain treelike compact sets considering binary trees we thus obtain a homeomorphic description of the martin boundary of remys tree growth chain which has been analyzed by evans grubel and wakolbinger | [['a', 'hypergraph', 've', 'is', 'called', 'an', 'interval', 'hypergraph', 'if', 'there', 'exists', 'a', 'linear', 'order', 'l', 'on', 'v', 'such', 'that', 'every', 'edge', 'ein', 'e', 'is', 'an', 'interval', 'wrt', 'l', 'we', 'also', 'assume', 'that', 'jin', 'e', 'for', 'every', 'jin', 'v', 'our', 'main', 'result', 'is', 'a', 'de', 'finettitype', 'representation', 'of', 'random', 'exchangeable', 'interval', 'hypergraphs', 'on', 'mathbbn', 'eihs', 'the', 'law', 'of', 'every', 'eih', 'can', 'be', 'obtained', 'by', 'sampling', 'from', 'some', 'random', 'compact', 'subset', 'k', 'of', 'the', 'triangle', 'xy0leq', 'xleq', 'yleq', '1', 'at', 'iid', 'uniform', 'positions', 'u_1u_2dots', 'in', 'the', 'sense', 'that', 'restricted', 'to', 'the', 'node', 'set', 'n1dotsn', 'every', 'nonsingleton', 'edge', 'is', 'of', 'the', 'form', 'eiinnxu_iy', 'for', 'some', 'xyin', 'k', 'we', 'obtain', 'this', 'result', 'via', 'the', 'study', 'of', 'a', 'related', 'class', 'of', 'stochastic', 'objects', 'erasedinterval', 'processes', 'eips', 'these', 'are', 'certain', 'transient', 'markov', 'chains', 'i_neta_n_ninmathbbn', 'such', 'that', 'i_n', 'is', 'an', 'interval', 'hypergraph', 'on', 'vn', 'wrt', 'the', 'usual', 'linear', 'order', 'called', 'interval', 'system', 'we', 'present', 'an', 'almost', 'sure', 'representation', 'result', 'for', 'eips', 'attached', 'to', 'each', 'transient', 'markov', 'chain', 'is', 'the', 'notion', 'of', 'martin', 'boundary', 'the', 'points', 'in', 'the', 'boundary', 'attached', 'to', 'eips', 'can', 'be', 'seen', 'as', 'limits', 'of', 'growing', 'interval', 'systems', 'we', 'obtain', 'a', 'onetoone', 'correspondence', 'between', 'these', 'limits', 'and', 'compact', 'subsets', 'k', 'of', 'the', 'triangle', 'with', 'xxin', 'k', 'for', 'all', 'xin01', 'interval', 'hypergraphs', 'are', 'a', 'generalizations', 'of', 'hierarchies', 'and', 'as', 'a', 'consequence', 'we', 'obtain', 'a', 'representation', 'result', 'for', 'exchangeable', 'hierarchies', 'which', 'is', 'close', 'to', 'a', 'result', 'of', 'forman', 'haulk', 'and', 'pitman', 'several', 'ordered', 'discrete', 'structures', 'can', 'be', 'seen', 'as', 'interval', 'systems', 'with', 'additional', 'properties', 'ie', 'schroder', 'trees', 'and', 'binary', 'trees', 'we', 'describe', 'limits', 'of', 'schroder', 'trees', 'as', 'certain', 'treelike', 'compact', 'sets', 'considering', 'binary', 'trees', 'we', 'thus', 'obtain', 'a', 'homeomorphic', 'description', 'of', 'the', 'martin', 'boundary', 'of', 'remys', 'tree', 'growth', 'chain', 'which', 'has', 'been', 'analyzed', 'by', 'evans', 'grubel', 'and', 'wakolbinger']] | [-0.17058209259338467, 0.12995573450851378, -0.07416971864893665, 0.057477818386347204, -0.0763337653733685, -0.13912884269850853, 0.07337535129332075, 0.3855633591194137, -0.29702317908334114, -0.2250775607953727, 0.11189088647903114, -0.30352986116014735, -0.1085146883150641, 0.1599988610398444, -0.08870806140803837, 0.0351620618406434, 0.092424514866598, 0.09116982534596645, -0.0004470073126099059, -0.23172342371889126, 0.30520656363383547, -0.034448178240727684, 0.18178558269594336, 0.003410078083414217, 0.10878298678074662, 0.041145391836860806, 0.005491474710575397, 0.04632872650170253, -0.18506973424754647, 0.07605695312934548, 0.2663848909785525, 0.12523219940124708, 0.23972958907268574, -0.3274015177456944, -0.16498448377029157, 0.1913214298063548, 0.12256641691199317, 0.027215668012988165, 0.02683790045844483, -0.27442444753783923, 0.14283171107231732, -0.14443011747420648, -0.10969207374031432, -0.028448083601944462, 0.10624051771641538, 0.05393555611523662, -0.3139879025755004, -0.002433017832591874, 0.15889229291302323, 0.04256771022436893, 0.003845758777124886, -0.15131980180371435, -0.05898833116860798, 0.08385926804711885, -0.04762602140339957, 0.07341992265534994, 0.04484371518598161, -0.023858486677185486, -0.15000989226153788, 0.33082399552140357, -0.05827819178877792, -0.1905338201543946, 0.17938354588441655, -0.13836105164586449, -0.20013159504947317, 0.09895390771250699, 0.09558011947894915, 0.12713232759807383, -0.12213724895714927, 0.16710814882072286, -0.13532210314670137, 0.1005081295094807, 0.14919890322915974, 0.011187238031735932, 0.16529744913130112, 0.12447479241658789, 0.14126146896447148, 0.15852042200235636, -0.018852065104587843, -0.024856731170152222, -0.316411003068706, -0.1402442722231261, -0.20109180796483178, 0.07845104719974547, -0.14204710733421552, -0.22221304136197226, 0.30899228220953096, 0.08872814176249808, 0.23583873663455066, 0.12158607764900858, 0.14724938685367947, 0.12682563629011423, -0.001526751142310005, 0.11313428150811299, 0.06625205355726714, 0.17760274388243666, 0.021285658087384637, -0.11604756970224167, 0.0591473019752376, 0.1457471537098787] |
1,802.09016 | Limits on Light Weakly Interacting Massive Particles from the First
102.8 kg ${\times}$ day Data of the CDEX-10 Experiment | We report the first results of a light weakly interacting massive particles
(WIMPs) search from the CDEX-10 experiment with a 10 kg germanium detector
array immersed in liquid nitrogen at the China Jinping Underground Laboratory
with a physics data size of 102.8 kg day. At an analysis threshold of 160 eVee,
improved limits of 8 $\times 10^{-42}$ and 3 $\times 10^{-36}$ cm$^{2}$ at a
90\% confidence level on spin-independent and spin-dependent WIMP-nucleon cross
sections, respectively, at a WIMP mass ($m_{\chi}$) of 5 GeV/${c}^2$ are
achieved. The lower reach of $m_{\chi}$ is extended to 2 GeV/${c}^2$.
| hep-ex physics.ins-det | we report the first results of a light weakly interacting massive particles wimps search from the cdex10 experiment with a 10 kg germanium detector array immersed in liquid nitrogen at the china jinping underground laboratory with a physics data size of 1028 kg day at an analysis threshold of 160 evee improved limits of 8 times 1042 and 3 times 1036 cm2 at a 90 confidence level on spinindependent and spindependent wimpnucleon cross sections respectively at a wimp mass m_chi of 5 gevc2 are achieved the lower reach of m_chi is extended to 2 gevc2 | [['we', 'report', 'the', 'first', 'results', 'of', 'a', 'light', 'weakly', 'interacting', 'massive', 'particles', 'wimps', 'search', 'from', 'the', 'cdex10', 'experiment', 'with', 'a', '10', 'kg', 'germanium', 'detector', 'array', 'immersed', 'in', 'liquid', 'nitrogen', 'at', 'the', 'china', 'jinping', 'underground', 'laboratory', 'with', 'a', 'physics', 'data', 'size', 'of', '1028', 'kg', 'day', 'at', 'an', 'analysis', 'threshold', 'of', '160', 'evee', 'improved', 'limits', 'of', '8', 'times', '1042', 'and', '3', 'times', '1036', 'cm2', 'at', 'a', '90', 'confidence', 'level', 'on', 'spinindependent', 'and', 'spindependent', 'wimpnucleon', 'cross', 'sections', 'respectively', 'at', 'a', 'wimp', 'mass', 'm_chi', 'of', '5', 'gevc2', 'are', 'achieved', 'the', 'lower', 'reach', 'of', 'm_chi', 'is', 'extended', 'to', '2', 'gevc2']] | [-0.06753991901335356, 0.264875402699966, 0.010452681039705088, 0.07625400755480913, 0.05259280522402964, -0.10539400875813475, 0.08104667142033577, 0.32226995106198286, -0.047878132157615924, -0.4534372150505844, 0.04958501023755066, -0.404023064947442, 0.10006993528651564, 0.2127978133723924, 0.10365027501002738, -0.00514622581142344, 0.06791397008407665, 0.0629514416483672, -0.08344034539829744, -0.30488559109599966, 0.13357615061349382, 0.11792452122133813, 0.21782645117491484, 0.14678973260482675, 0.17072618190615782, -0.010837534971927342, 0.02809400321229508, -0.15871544803835844, -0.16354619833199602, 0.0803180292052658, 0.323561043762847, 0.04066529187226766, 0.08523889632013283, -0.3865588947738472, -0.07434372927160247, 0.1035844122647847, 0.08830102952197194, -0.042761090299800825, -0.0452284337045919, -0.37614759551606286, 0.0990070855343028, -0.2442930999457052, -0.14012303941540027, 0.1225258193714054, 0.02813719801702782, -0.08060027818765345, -0.2502699585386405, 0.11279596176831738, -0.04990728874935916, 0.04552637018067272, -0.060725282730632706, -0.23196193307246032, 0.05255458977465567, -0.10095511405287605, -0.018272919259279184, 0.05683844561694729, 0.28362556378798265, -0.15121272453352025, -0.06124790123921182, 0.3417743985001978, -0.1504819831075637, -0.0625430698702602, 0.19884162923615228, -0.20241313552189816, -0.13541104665369189, 0.2927257505294524, 0.25460042258185384, 0.09858894051591817, -0.19462109379176246, 0.11758400082073518, -0.0468986674947174, 0.29816594686555237, 0.10986687628748386, -0.024216014306875876, 0.27457339186221363, 0.3439673357300068, 0.11299647655534117, -0.03514256072230637, -0.24284519580143846, 0.042678454954569275, -0.3340868398155037, -0.1321302561175176, -0.050903216293571814, 0.10548411886403827, -0.09634598017100392, 0.016966960990899487, 0.2789782536755267, 0.10889013552744138, 0.20804998426649132, 0.05970064744500345, 0.253772141817516, 0.04870933332529507, 0.03605726346079456, 0.029293457492205657, 0.3322086721413622, 0.1640065423850166, 0.07672127517136304, -0.09981443900860061, -0.07660393200594147, -0.029847352611097066] |
1,802.09017 | Disorder-free weak dynamic localization in deformable lattices | We study the electron transport in a deformable lattice modeled in the
semiclassical approximation as a discrete nonlinear elastic chain where
acoustic phonons are in thermal equilibrium at temperature T. We reveal that an
effective dynamic disorder induced in the system due to thermalized phonons is
not strong enough to produce Anderson localization. However, for weak
nonlinearity we observe a transition between ballistic (low T) and diffusive
(high T) regimes, while for strong nonlinearity the transition occurs between
the localized soliton (low T) and diffusive (high T) regimes. Thus, the
electron-phonon interaction results in weak temperature-dependent dynamic
localization.
| cond-mat.dis-nn | we study the electron transport in a deformable lattice modeled in the semiclassical approximation as a discrete nonlinear elastic chain where acoustic phonons are in thermal equilibrium at temperature t we reveal that an effective dynamic disorder induced in the system due to thermalized phonons is not strong enough to produce anderson localization however for weak nonlinearity we observe a transition between ballistic low t and diffusive high t regimes while for strong nonlinearity the transition occurs between the localized soliton low t and diffusive high t regimes thus the electronphonon interaction results in weak temperaturedependent dynamic localization | [['we', 'study', 'the', 'electron', 'transport', 'in', 'a', 'deformable', 'lattice', 'modeled', 'in', 'the', 'semiclassical', 'approximation', 'as', 'a', 'discrete', 'nonlinear', 'elastic', 'chain', 'where', 'acoustic', 'phonons', 'are', 'in', 'thermal', 'equilibrium', 'at', 'temperature', 't', 'we', 'reveal', 'that', 'an', 'effective', 'dynamic', 'disorder', 'induced', 'in', 'the', 'system', 'due', 'to', 'thermalized', 'phonons', 'is', 'not', 'strong', 'enough', 'to', 'produce', 'anderson', 'localization', 'however', 'for', 'weak', 'nonlinearity', 'we', 'observe', 'a', 'transition', 'between', 'ballistic', 'low', 't', 'and', 'diffusive', 'high', 't', 'regimes', 'while', 'for', 'strong', 'nonlinearity', 'the', 'transition', 'occurs', 'between', 'the', 'localized', 'soliton', 'low', 't', 'and', 'diffusive', 'high', 't', 'regimes', 'thus', 'the', 'electronphonon', 'interaction', 'results', 'in', 'weak', 'temperaturedependent', 'dynamic', 'localization']] | [-0.17334874186721838, 0.26447733969808374, -0.0412483109037715, 0.0764650879463428, -0.021895902858552883, -0.2145770998453075, 0.060821705405144214, 0.3937765705418222, -0.31587320018787773, -0.21185840352685475, -0.009448268100362728, -0.3105957269174408, -0.11568037658093536, 0.14564562135623121, 0.05159806012537102, 0.02803555626080048, 0.001279895260397877, -0.01785532332367587, -0.04965216273261348, -0.12005694119913957, 0.23915067349788638, 0.03702570487060869, 0.3176400896770005, 0.1455678454771334, 0.08822852569841305, 0.028573648146429688, 0.09841076861496786, 0.05341728709338765, -0.1514108117378931, -0.021255852816132258, 0.25915172987924034, -0.13743164072915606, 0.24986664875771622, -0.44125296527101676, -0.27467802108018374, 0.038920716534615776, 0.15093875801361792, 0.15741763119253196, -0.026023946037249907, -0.25100192557830286, 0.06733770278871667, -0.12627970239822278, -0.10810386560553191, -0.08818581457040747, 0.04069577009721222, 0.02757518937186414, -0.2984706020524383, 0.1721229547980997, 0.11914991353619464, 0.047087008166792135, -0.06380795081127055, 0.018588295716041585, -0.03354600877548587, 0.099162650199569, 0.034782500887688785, 0.006451551475780731, 0.11149417187505382, -0.1730779968499092, -0.03837471871579788, 0.3557709749521954, -0.15819310028894748, -0.10220494885852903, 0.27477345823272303, -0.1966482501771605, -0.06376832399080146, 0.20111896939176535, 0.16263538688345222, 0.11104898391367525, -0.13127684935022202, 0.10571053023010549, 0.03751752607979365, 0.13382993364820675, 0.03973691145015158, 0.08359934046997555, 0.18800186809646535, 0.19719797109576817, 0.0643555001754846, 0.13329899537481596, -0.08814223460040568, -0.06645666899359119, -0.27977055854791283, -0.0648061940446496, -0.22028095643416198, 0.08993678901844054, -0.10222516771927428, -0.20451529996412598, 0.3171241974401079, 0.15651260626625618, 0.22521310235487715, 0.0008362480249179869, 0.244618921816273, 0.1736381779774092, -0.009769352599598316, 0.07695807858218191, 0.2765352760598406, 0.14770887104072133, 0.14682777379211798, -0.3523536380594216, 0.028489245180211658, 0.05842509574009752] |
1,802.09018 | Distributions associated with simultaneous multiple hypothesis testing | We develop the distribution of the number of hypotheses found to be
statistically significant using the rule from Benjamini and Hochberg (1995) for
controlling the false discovery rate (FDR). This distribution has both a small
sample form and an asymptotic expression for testing many independent
hypotheses simultaneously. We propose a parametric distribution
$\,\Psi_I(\cdot)\,$ to approximate the marginal distribution of p-values under
a non-uniform alternative hypothesis. This distribution is useful when there
are many different alternative hypotheses and these are not individually well
understood. We fit $\,\Psi_I\,$ to data from three cancer studies and use it to
illustrate the distribution of the number of notable hypotheses observed in
these examples. We model dependence of sampled p-values using a copula model
and a latent variable approach. These methods can be combined to illustrate a
power analysis in planning a large study on the basis of a smaller pilot study.
We show the number of statistically significant p-values behaves approximately
as a mixture of a normal and the Borel-Tanner distribution.
| stat.ME | we develop the distribution of the number of hypotheses found to be statistically significant using the rule from benjamini and hochberg 1995 for controlling the false discovery rate fdr this distribution has both a small sample form and an asymptotic expression for testing many independent hypotheses simultaneously we propose a parametric distribution psi_icdot to approximate the marginal distribution of pvalues under a nonuniform alternative hypothesis this distribution is useful when there are many different alternative hypotheses and these are not individually well understood we fit psi_i to data from three cancer studies and use it to illustrate the distribution of the number of notable hypotheses observed in these examples we model dependence of sampled pvalues using a copula model and a latent variable approach these methods can be combined to illustrate a power analysis in planning a large study on the basis of a smaller pilot study we show the number of statistically significant pvalues behaves approximately as a mixture of a normal and the boreltanner distribution | [['we', 'develop', 'the', 'distribution', 'of', 'the', 'number', 'of', 'hypotheses', 'found', 'to', 'be', 'statistically', 'significant', 'using', 'the', 'rule', 'from', 'benjamini', 'and', 'hochberg', '1995', 'for', 'controlling', 'the', 'false', 'discovery', 'rate', 'fdr', 'this', 'distribution', 'has', 'both', 'a', 'small', 'sample', 'form', 'and', 'an', 'asymptotic', 'expression', 'for', 'testing', 'many', 'independent', 'hypotheses', 'simultaneously', 'we', 'propose', 'a', 'parametric', 'distribution', 'psi_icdot', 'to', 'approximate', 'the', 'marginal', 'distribution', 'of', 'pvalues', 'under', 'a', 'nonuniform', 'alternative', 'hypothesis', 'this', 'distribution', 'is', 'useful', 'when', 'there', 'are', 'many', 'different', 'alternative', 'hypotheses', 'and', 'these', 'are', 'not', 'individually', 'well', 'understood', 'we', 'fit', 'psi_i', 'to', 'data', 'from', 'three', 'cancer', 'studies', 'and', 'use', 'it', 'to', 'illustrate', 'the', 'distribution', 'of', 'the', 'number', 'of', 'notable', 'hypotheses', 'observed', 'in', 'these', 'examples', 'we', 'model', 'dependence', 'of', 'sampled', 'pvalues', 'using', 'a', 'copula', 'model', 'and', 'a', 'latent', 'variable', 'approach', 'these', 'methods', 'can', 'be', 'combined', 'to', 'illustrate', 'a', 'power', 'analysis', 'in', 'planning', 'a', 'large', 'study', 'on', 'the', 'basis', 'of', 'a', 'smaller', 'pilot', 'study', 'we', 'show', 'the', 'number', 'of', 'statistically', 'significant', 'pvalues', 'behaves', 'approximately', 'as', 'a', 'mixture', 'of', 'a', 'normal', 'and', 'the', 'boreltanner', 'distribution']] | [-0.07236891965925073, 0.05705092502272843, -0.13434122940384302, 0.12660922070499508, -0.04943035393812214, -0.1318952571770007, 0.11455405309627002, 0.3833564860943818, -0.2441447300272006, -0.3283341637727889, 0.10084548229351639, -0.239029870825735, -0.12587992095698913, 0.20299006638392297, -0.07054534476589072, 0.07739148750393228, 0.042914563116871494, -0.002542019353219957, -0.013296804667422266, -0.2527978007625224, 0.2794213091361929, 0.053598554319504534, 0.33038331092984385, -0.0357161040618931, 0.08513566073044344, -0.008113342904570428, -0.06704825296377143, 0.030322218471855827, -0.10888593059146043, 0.1131965852878762, 0.23297389741620106, 0.19641418854567524, 0.32133096470356437, -0.35191053899660335, -0.19320942565841093, 0.15136814165691084, 0.1387941854187485, 0.11161919423576558, -0.058975900182585146, -0.24319114279509946, 0.08723811768277577, -0.17982138233809647, -0.11484562617119853, -0.10770717777424689, -0.003373352814973755, 0.037591650887307794, -0.34643862577381007, 0.10922482939098369, 0.049656430784627004, 0.07365758686016004, -0.04556424829713775, -0.1601819447072392, 0.02566629852394037, 0.09418295882060193, 0.12816226558872695, -0.015904742352325807, 0.09666137545295483, -0.11294819912732099, -0.09785716111461322, 0.30776812865391767, -0.05754904179466945, -0.23730625000528313, 0.19240196167745374, -0.1533874925282417, -0.1613476651410262, 0.10394061913318706, 0.1941316996390621, 0.12592811838187504, -0.20007013447598596, 0.03056647395785672, -0.07225309316576882, 0.14556825925229175, 0.055517290884657115, -0.033159660858412585, 0.20908403035930612, 0.15106303769615337, 0.014146979429025316, 0.13835369482862228, -0.1387139284475283, -0.07307406432757324, -0.3145406310474782, -0.15277419711999368, -0.18981237207172494, 0.03837064524034786, -0.11715498367892437, -0.17998851110707179, 0.38898625387245733, 0.1664376968687231, 0.23130634772506628, 0.08963790076333239, 0.2560398754466212, 0.11696220749608156, 0.04517071171183929, 0.05701038936632827, 0.17776581524222185, 0.10292331077948665, -0.025588764540964003, -0.15827769433910197, 0.1294324283805591, -0.03977360458423694] |
1,802.09019 | Compatibility of Riemannian structures and Jacobi structures | We give a notion of compatibility between a Riemannian structure and a Jacobi
structure. We prove that in case of fundamental examples of Jacobi structures :
Poisson structures, contact structures and locally conformally symplectic
structures, we get respectively Riemann-Poisson structures in the sense of M.
Boucetta, 1/2-Kenmotsu structures and locally conformally Kahler structures.
| math.DG | we give a notion of compatibility between a riemannian structure and a jacobi structure we prove that in case of fundamental examples of jacobi structures poisson structures contact structures and locally conformally symplectic structures we get respectively riemannpoisson structures in the sense of m boucetta 12kenmotsu structures and locally conformally kahler structures | [['we', 'give', 'a', 'notion', 'of', 'compatibility', 'between', 'a', 'riemannian', 'structure', 'and', 'a', 'jacobi', 'structure', 'we', 'prove', 'that', 'in', 'case', 'of', 'fundamental', 'examples', 'of', 'jacobi', 'structures', 'poisson', 'structures', 'contact', 'structures', 'and', 'locally', 'conformally', 'symplectic', 'structures', 'we', 'get', 'respectively', 'riemannpoisson', 'structures', 'in', 'the', 'sense', 'of', 'm', 'boucetta', '12kenmotsu', 'structures', 'and', 'locally', 'conformally', 'kahler', 'structures']] | [-0.2629997827671468, 0.06765701761469245, -0.09182286128401757, 0.12039768122136593, -0.12802353797480465, -0.09425957080908119, -0.055770804081112145, 0.4557508327066898, -0.3308533579856157, -0.22121993955224753, 0.029060305901803075, -0.21302622877061367, -0.2847689459845424, 0.14304769635666162, -0.05905873274430633, -0.010476703979074955, 0.08649139106273651, 0.0622494631446898, -0.15896046749781817, -0.25675276822410525, 0.48387365356087686, 0.04032395100221038, 0.2435697229579091, 0.0013525548670440912, 0.12160417250357568, -0.07365907515399157, 0.03525313627906144, 0.03922373574227095, -0.16184415298121166, 0.17082008846104146, 0.24283145569264888, 0.005081610903143883, 0.14586577155627312, -0.3831011748500168, -0.18006561002694071, 0.08077265702188015, 0.06451008402742446, 0.014094156082719564, -0.039737533261068166, -0.3088232923252508, 0.1663541644997895, -0.055385418962687255, -0.1684784005396068, -0.11628138089552521, -0.015836409125477076, 0.005980133768171072, -0.1659055774589069, 0.04281288073398173, 0.13367505736649035, 0.04668085755780339, -0.11492715742439032, -0.04208140645176172, -0.07468359662685543, 0.06083573610521853, -0.08246791612356902, -0.06014429909177124, 0.09763284060056321, -0.07254819430410862, -0.1385431107901968, 0.40509543105959894, -0.06265012819319964, -0.3365229673311114, 0.12410272270441056, -0.1384541581198573, -0.19583849411457777, 0.05834169678390026, 0.13355870448052884, 0.16772151365876198, -0.06568472294369712, 0.20996786266216078, -0.044509618282318114, 0.08812328210100531, 0.1906353896856308, 0.004024568060413003, 0.14373145412653685, 0.08948427932802588, 0.18096521208062769, 0.12786975905299186, 0.021336608659476043, -0.10154326230287553, -0.3321000710129738, -0.22149598641321064, -0.02498990244232118, 0.20099852200597523, -0.11862284553149947, -0.29085326824337243, 0.36114263117313383, -0.05899352081120014, 0.2518660060688853, 0.0839961933158338, 0.15663369253277779, -0.03920057952404022, 0.036282120682299135, 0.13777047397568823, 0.13514280408620835, 0.319966450445354, 0.04323348888196051, -0.04572459949180484, -0.08436359802260995, 0.11789035368710757] |
1,802.0902 | Entropy stable modeling of non-isothermal multi-component
diffuse-interface two-phase flows with realistic equations of state | In this paper, we consider mathematical modeling and numerical simulation of
non-isothermal compressible multi-component diffuse-interface two-phase flows
with realistic equations of state. A general model with general reference
velocity is derived rigorously through thermodynamical laws and Onsager's
reciprocal principle, and it is capable of characterizing compressibility and
partial miscibility between multiple fluids. We prove a novel relation among
the pressure, temperature and chemical potentials, which results in a new
formulation of the momentum conservation equation indicating that the gradients
of chemical potentials and temperature become the primary driving force of the
fluid motion except for the external forces. A key challenge in numerical
simulation is to develop entropy stable numerical schemes preserving the laws
of thermodynamics. Based on the convex-concave splitting of Helmholtz free
energy density with respect to molar densities and temperature, we propose an
entropy stable numerical method, which solves the total energy balance equation
directly, and thus, naturally satisfies the first law of thermodynamics.
Unconditional entropy stability (the second law of thermodynamics) of the
proposed method is proved by estimating the variations of Helmholtz free energy
and kinetic energy with time steps. Numerical results validate the proposed
method.
| math.NA physics.comp-ph | in this paper we consider mathematical modeling and numerical simulation of nonisothermal compressible multicomponent diffuseinterface twophase flows with realistic equations of state a general model with general reference velocity is derived rigorously through thermodynamical laws and onsagers reciprocal principle and it is capable of characterizing compressibility and partial miscibility between multiple fluids we prove a novel relation among the pressure temperature and chemical potentials which results in a new formulation of the momentum conservation equation indicating that the gradients of chemical potentials and temperature become the primary driving force of the fluid motion except for the external forces a key challenge in numerical simulation is to develop entropy stable numerical schemes preserving the laws of thermodynamics based on the convexconcave splitting of helmholtz free energy density with respect to molar densities and temperature we propose an entropy stable numerical method which solves the total energy balance equation directly and thus naturally satisfies the first law of thermodynamics unconditional entropy stability the second law of thermodynamics of the proposed method is proved by estimating the variations of helmholtz free energy and kinetic energy with time steps numerical results validate the proposed method | [['in', 'this', 'paper', 'we', 'consider', 'mathematical', 'modeling', 'and', 'numerical', 'simulation', 'of', 'nonisothermal', 'compressible', 'multicomponent', 'diffuseinterface', 'twophase', 'flows', 'with', 'realistic', 'equations', 'of', 'state', 'a', 'general', 'model', 'with', 'general', 'reference', 'velocity', 'is', 'derived', 'rigorously', 'through', 'thermodynamical', 'laws', 'and', 'onsagers', 'reciprocal', 'principle', 'and', 'it', 'is', 'capable', 'of', 'characterizing', 'compressibility', 'and', 'partial', 'miscibility', 'between', 'multiple', 'fluids', 'we', 'prove', 'a', 'novel', 'relation', 'among', 'the', 'pressure', 'temperature', 'and', 'chemical', 'potentials', 'which', 'results', 'in', 'a', 'new', 'formulation', 'of', 'the', 'momentum', 'conservation', 'equation', 'indicating', 'that', 'the', 'gradients', 'of', 'chemical', 'potentials', 'and', 'temperature', 'become', 'the', 'primary', 'driving', 'force', 'of', 'the', 'fluid', 'motion', 'except', 'for', 'the', 'external', 'forces', 'a', 'key', 'challenge', 'in', 'numerical', 'simulation', 'is', 'to', 'develop', 'entropy', 'stable', 'numerical', 'schemes', 'preserving', 'the', 'laws', 'of', 'thermodynamics', 'based', 'on', 'the', 'convexconcave', 'splitting', 'of', 'helmholtz', 'free', 'energy', 'density', 'with', 'respect', 'to', 'molar', 'densities', 'and', 'temperature', 'we', 'propose', 'an', 'entropy', 'stable', 'numerical', 'method', 'which', 'solves', 'the', 'total', 'energy', 'balance', 'equation', 'directly', 'and', 'thus', 'naturally', 'satisfies', 'the', 'first', 'law', 'of', 'thermodynamics', 'unconditional', 'entropy', 'stability', 'the', 'second', 'law', 'of', 'thermodynamics', 'of', 'the', 'proposed', 'method', 'is', 'proved', 'by', 'estimating', 'the', 'variations', 'of', 'helmholtz', 'free', 'energy', 'and', 'kinetic', 'energy', 'with', 'time', 'steps', 'numerical', 'results', 'validate', 'the', 'proposed', 'method']] | [-0.13073255322600535, 0.11034548934373861, -0.11616182570584625, 0.02051226773204194, -0.027607785625607555, -0.13471757137845636, 0.033274735934198565, 0.282095976495696, -0.28220790779676425, -0.31119671042585567, 0.03269995676648574, -0.24949180406484148, -0.11053853579467718, 0.17206741278596144, -0.0239658880593616, 0.12173029737966379, 0.019889164678216057, -0.008891073440772076, -0.06912350024984106, -0.16784278576137956, 0.3392737802003476, 0.06684009897576265, 0.314957165295814, 0.09624815889614688, 0.16268645185021519, -0.045924057167374494, -0.024674086980229118, 0.06078957866496987, -0.19760100671392042, 0.09076394799594519, 0.20549541395352616, 0.03820948614933923, 0.27309838065350944, -0.42636906733390195, -0.28620760046745314, 0.06897491327345527, 0.06475400476696955, 0.1064304762644235, -0.0920804497476238, -0.2214112502586155, 0.03931088373491648, -0.16696235890675784, -0.17801874621859046, -0.12599016205165095, 0.007745480389183104, 0.07738906051902618, -0.27430917743925026, 0.20293128146809472, 0.05429512141053004, 0.036319277235867545, -0.17062668297476383, -0.07137058468667196, -0.0644077738644604, 0.06677010414527036, 0.05040162929007052, -0.04273622124138927, 0.12492734203310148, -0.09226661510838693, -0.04883921285847407, 0.40729752311687817, -0.045398117238119325, -0.24080639785028876, 0.18882202621822425, -0.09638079540823533, -0.10941395973079687, 0.12874516447108844, 0.13860333537200165, 0.13341005186403124, -0.182806031669963, 0.06134523813343358, -0.007687478904071123, 0.16826660219818862, 0.04898563010315776, -0.05883596003657763, 0.17688136359101347, 0.15458628350468986, 0.06721028194065494, 0.14235658366574433, -0.05413877593075457, -0.19541087517568462, -0.3292396422545669, -0.20018025216066243, -0.18506367817881922, 0.022473510035377054, -0.11740626145956651, -0.14926465535938682, 0.3419530261478616, 0.1504871499156628, 0.11318289535363932, 0.07827795863136922, 0.3419183154702577, 0.17467101578020455, -0.014598073375373848, 0.11143240176570353, 0.22168647841165204, 0.20109407745755195, 0.1588552039243398, -0.28499071728038916, 0.01964130372550163, 0.1365624059915679] |
1,802.09021 | Instrumental effects in BRITE photometry | The raw photometry from BRITE satellites suffers from several instrumental
effects. We present the list of the known effects and discuss their origin and
the ways to correct for them.
| astro-ph.IM | the raw photometry from brite satellites suffers from several instrumental effects we present the list of the known effects and discuss their origin and the ways to correct for them | [['the', 'raw', 'photometry', 'from', 'brite', 'satellites', 'suffers', 'from', 'several', 'instrumental', 'effects', 'we', 'present', 'the', 'list', 'of', 'the', 'known', 'effects', 'and', 'discuss', 'their', 'origin', 'and', 'the', 'ways', 'to', 'correct', 'for', 'them']] | [-0.04917131988331676, 0.06099559923944374, -0.10405048513785005, 0.14653091526900727, -0.1306965846568346, -0.045334600595136484, 0.13072984310953567, 0.35996667817234995, -0.29180804261316856, -0.3833110935986042, 0.13716798339349529, -0.3534011240117252, -0.14931030701845885, 0.21827048311630884, -0.11770346524814765, 0.0394672930551072, 0.0706292737275362, -0.06374977038552364, -0.08294252511113882, -0.2592378417029977, 0.32147176389892895, 0.05727712316438556, 0.15370423787583906, -0.036947276070714, 0.09064217768609524, -0.006146569860478243, -0.17757034910221894, -0.044345494049290814, -0.1320467182745536, 0.04926947131752968, 0.22558839842677117, 0.1865969258050124, 0.196702750492841, -0.4225271731615067, -0.19565389664688457, 0.06406160925592606, 0.08745925622060895, 0.17110121871034303, -0.07130913720466196, -0.3163443624973297, 0.02816731557250023, -0.11694364498058955, -0.17363632743557295, -0.06104070929189523, 0.03669645477396746, 0.010730526565263668, -0.1693040476491054, 0.04710577828809619, 0.03051084061153233, 0.052767878863960505, -0.07264145314693451, -0.20725393605728945, 0.0032104586561520895, 0.2288362811629971, 0.10302905303736527, -0.031224605748138855, 0.09946981905959547, -0.12556187777469555, -0.08599238321185113, 0.47504534510274726, -0.026535431606074175, -0.06127829865242044, 0.21509308647364378, -0.13967158670226734, -0.14031982108329732, 0.08717182688415051, 0.13882333269963662, 0.06548167193929354, -0.1891462448053062, 0.019574537848044807, 0.07516185318430264, 0.1131654854863882, 0.01533026398004343, 0.14812975469976664, 0.26273389098544914, 0.030003608266512553, -0.007492535576845209, 0.1446955864628156, -0.26746344702260105, 0.005156122862050931, -0.29613380941251916, -0.043823275218407315, -0.07945954866396884, 0.01332191595574841, -0.06916583275015001, -0.11622092941155036, 0.41881377138197423, 0.25557651921796304, 0.19570884630084037, 0.05634448891505599, 0.38129800111055373, 0.018351861756915847, 0.08561114288556079, 0.02636583810672164, 0.2789317267636458, 0.09432362245085339, 0.08354578819125891, -0.23059948414253692, 0.07557210936211049, -0.03436150408039491] |
1,802.09022 | An Accelerated Method for Derivative-Free Smooth Stochastic Convex
Optimization | We consider an unconstrained problem of minimizing a smooth convex function
which is only available through noisy observations of its values, the noise
consisting of two parts. Similar to stochastic optimization problems, the first
part is of stochastic nature. The second part is additive noise of unknown
nature, but bounded in absolute value. In the two-point feedback setting, i.e.
when pairs of function values are available, we propose an accelerated
derivative-free algorithm together with its complexity analysis. The complexity
bound of our derivative-free algorithm is only by a factor of $\sqrt{n}$ larger
than the bound for accelerated gradient-based algorithms, where $n$ is the
dimension of the decision variable. We also propose a non-accelerated
derivative-free algorithm with a complexity bound similar to the
stochastic-gradient-based algorithm, that is, our bound does not have any
dimension-dependent factor except logarithmic. Notably, if the difference
between the starting point and the solution is a sparse vector, for both our
algorithms, we obtain a better complexity bound if the algorithm uses an
$1$-norm proximal setup, rather than the Euclidean proximal setup, which is a
standard choice for unconstrained problems
| math.OC cs.CC | we consider an unconstrained problem of minimizing a smooth convex function which is only available through noisy observations of its values the noise consisting of two parts similar to stochastic optimization problems the first part is of stochastic nature the second part is additive noise of unknown nature but bounded in absolute value in the twopoint feedback setting ie when pairs of function values are available we propose an accelerated derivativefree algorithm together with its complexity analysis the complexity bound of our derivativefree algorithm is only by a factor of sqrtn larger than the bound for accelerated gradientbased algorithms where n is the dimension of the decision variable we also propose a nonaccelerated derivativefree algorithm with a complexity bound similar to the stochasticgradientbased algorithm that is our bound does not have any dimensiondependent factor except logarithmic notably if the difference between the starting point and the solution is a sparse vector for both our algorithms we obtain a better complexity bound if the algorithm uses an 1norm proximal setup rather than the euclidean proximal setup which is a standard choice for unconstrained problems | [['we', 'consider', 'an', 'unconstrained', 'problem', 'of', 'minimizing', 'a', 'smooth', 'convex', 'function', 'which', 'is', 'only', 'available', 'through', 'noisy', 'observations', 'of', 'its', 'values', 'the', 'noise', 'consisting', 'of', 'two', 'parts', 'similar', 'to', 'stochastic', 'optimization', 'problems', 'the', 'first', 'part', 'is', 'of', 'stochastic', 'nature', 'the', 'second', 'part', 'is', 'additive', 'noise', 'of', 'unknown', 'nature', 'but', 'bounded', 'in', 'absolute', 'value', 'in', 'the', 'twopoint', 'feedback', 'setting', 'ie', 'when', 'pairs', 'of', 'function', 'values', 'are', 'available', 'we', 'propose', 'an', 'accelerated', 'derivativefree', 'algorithm', 'together', 'with', 'its', 'complexity', 'analysis', 'the', 'complexity', 'bound', 'of', 'our', 'derivativefree', 'algorithm', 'is', 'only', 'by', 'a', 'factor', 'of', 'sqrtn', 'larger', 'than', 'the', 'bound', 'for', 'accelerated', 'gradientbased', 'algorithms', 'where', 'n', 'is', 'the', 'dimension', 'of', 'the', 'decision', 'variable', 'we', 'also', 'propose', 'a', 'nonaccelerated', 'derivativefree', 'algorithm', 'with', 'a', 'complexity', 'bound', 'similar', 'to', 'the', 'stochasticgradientbased', 'algorithm', 'that', 'is', 'our', 'bound', 'does', 'not', 'have', 'any', 'dimensiondependent', 'factor', 'except', 'logarithmic', 'notably', 'if', 'the', 'difference', 'between', 'the', 'starting', 'point', 'and', 'the', 'solution', 'is', 'a', 'sparse', 'vector', 'for', 'both', 'our', 'algorithms', 'we', 'obtain', 'a', 'better', 'complexity', 'bound', 'if', 'the', 'algorithm', 'uses', 'an', '1norm', 'proximal', 'setup', 'rather', 'than', 'the', 'euclidean', 'proximal', 'setup', 'which', 'is', 'a', 'standard', 'choice', 'for', 'unconstrained', 'problems']] | [-0.10771642118575346, 0.04602310942609023, -0.08776622521436564, 0.0651286031969421, -0.08795074272717608, -0.1777065185539913, 0.04671177756161521, 0.37555452466234973, -0.2915222798601363, -0.3090175277772334, 0.11641526221083935, -0.2477057548494287, -0.17188098371318986, 0.20482343543178397, -0.0902899632000115, 0.05549525857163222, 0.0526289523991405, 0.06650273175003603, -0.09977905169419456, -0.3011070316201941, 0.28989772181041906, 0.038844927792663846, 0.22479348204001948, -0.01071515722999278, 0.1319739961350347, -0.012364290359485997, 0.013713251086857801, 0.02565040517804503, -0.09001800414421143, 0.14245892180030648, 0.22632235968409137, 0.17466107870533534, 0.34616134684950195, -0.348044941533876, -0.1557310464031119, 0.1782025290421551, 0.13986501186835462, 0.1044854421710565, -0.03166741707179024, -0.2262226232515821, 0.07326651248467649, -0.0801140088956966, -0.07185627924420876, -0.04190991916871869, -0.017928904594212283, -0.009571891179614203, -0.33909520859285536, 0.09229333287653961, 0.06373950870595668, -0.0071177093383393, -0.060893827353593326, -0.15184119892881706, 0.07546235574027677, 0.06574130780079473, 0.02865516191635973, 0.08356002416866297, 0.10886944062458198, -0.12454464727798935, -0.13918629487660902, 0.34608221360383035, -0.0666998018686535, -0.24185264448487692, 0.15295352347025296, -0.09202294839454479, -0.11957225319802191, 0.1623845883426282, 0.18145057518045352, 0.18645319721758202, -0.13547323839498818, 0.1294690022302939, -0.07203222240437117, 0.19985550757236092, 0.01076229209273728, 0.021212366793833957, 0.05458813476824085, 0.17364004202813033, 0.1714548285747751, 0.16718182137714382, -0.04796082017271489, -0.11605223263690218, -0.30335847946911887, -0.1267234159985308, -0.23017882196934986, 0.00023465525924133983, -0.14595357571908876, -0.1822298979641147, 0.34484400777298896, 0.10667973662131146, 0.2109829979933432, 0.12738001745708205, 0.3727895012888752, 0.1459241153900079, 0.02213860488919124, 0.1644246545416695, 0.21906776632223013, 0.0866116550054447, 0.041220366445884025, -0.20707460544647807, 0.10652028622940346, 0.11280429135787598] |
1,802.09023 | OGLE-2017-BLG-1130: The First Binary Gravitational Microlens Detected
From Spitzer Only | We analyze the binary gravitational microlensing event OGLE-2017-BLG-1130
(mass ratio q~0.45), the first published case in which the binary anomaly was
only detected by the Spitzer Space Telescope. This event provides strong
evidence that some binary signals can be missed by observations from the ground
alone but detected by Spitzer. We therefore invert the normal procedure, first
finding the lens parameters by fitting the space-based data and then measuring
the microlensing parallax using ground-based observations. We also show that
the normal four-fold space-based degeneracy in the single-lens case can become
a weak eight-fold degeneracy in binary-lens events. Although this degeneracy is
resolved in event OGLE-2017-BLG-1130, it might persist in other events.
| astro-ph.EP astro-ph.SR | we analyze the binary gravitational microlensing event ogle2017blg1130 mass ratio q045 the first published case in which the binary anomaly was only detected by the spitzer space telescope this event provides strong evidence that some binary signals can be missed by observations from the ground alone but detected by spitzer we therefore invert the normal procedure first finding the lens parameters by fitting the spacebased data and then measuring the microlensing parallax using groundbased observations we also show that the normal fourfold spacebased degeneracy in the singlelens case can become a weak eightfold degeneracy in binarylens events although this degeneracy is resolved in event ogle2017blg1130 it might persist in other events | [['we', 'analyze', 'the', 'binary', 'gravitational', 'microlensing', 'event', 'ogle2017blg1130', 'mass', 'ratio', 'q045', 'the', 'first', 'published', 'case', 'in', 'which', 'the', 'binary', 'anomaly', 'was', 'only', 'detected', 'by', 'the', 'spitzer', 'space', 'telescope', 'this', 'event', 'provides', 'strong', 'evidence', 'that', 'some', 'binary', 'signals', 'can', 'be', 'missed', 'by', 'observations', 'from', 'the', 'ground', 'alone', 'but', 'detected', 'by', 'spitzer', 'we', 'therefore', 'invert', 'the', 'normal', 'procedure', 'first', 'finding', 'the', 'lens', 'parameters', 'by', 'fitting', 'the', 'spacebased', 'data', 'and', 'then', 'measuring', 'the', 'microlensing', 'parallax', 'using', 'groundbased', 'observations', 'we', 'also', 'show', 'that', 'the', 'normal', 'fourfold', 'spacebased', 'degeneracy', 'in', 'the', 'singlelens', 'case', 'can', 'become', 'a', 'weak', 'eightfold', 'degeneracy', 'in', 'binarylens', 'events', 'although', 'this', 'degeneracy', 'is', 'resolved', 'in', 'event', 'ogle2017blg1130', 'it', 'might', 'persist', 'in', 'other', 'events']] | [-0.14259700205271925, 0.11812572608081003, -0.08733814141952381, 0.1466923856846902, -0.1470629912542386, -0.0864967565123354, 0.05373002616343675, 0.36468483725804146, -0.2154280413200872, -0.3632764751609001, 0.11049575808660679, -0.31414515613923194, -0.15583210190568395, 0.2053199256926611, -0.04413469950668514, 0.014124373353465839, 0.17021560523102786, -0.07650547266368651, -0.0858191879211787, -0.26244033521463817, 0.28937307578086835, 0.08671058383252886, 0.16943247975022704, -0.049903759176635906, 0.06835094198295674, 0.006909350769732286, -0.09558361425944087, 0.02935915054829955, -0.1190661456856577, -0.0004653683604879512, 0.2711516756077159, 0.1835625262465328, 0.1394491505947102, -0.3232688786703403, -0.22618102705692528, 0.13709373744118405, 0.13564007056670058, 0.11230277686182591, -0.04336413681610591, -0.35768486588602644, 0.0341590723298766, -0.17114440921728533, -0.14787820205782298, -0.016039916710859095, 0.018675198830250237, -0.009430154778615193, -0.21212803501704777, 0.0986267121018803, 0.03444883785710705, 0.05755546071601135, -0.1136387206379031, -0.04008444411576622, -0.0664973846147337, 0.07628993682684032, 0.05579340016184789, 0.06342672082354073, 0.04120004257452416, -0.10192922348829193, -0.09122826018008506, 0.35284907184541225, -0.11917754436877591, -0.07270953843921975, 0.15750575917816065, -0.22054004908056446, -0.20882310702344747, 0.1779562073513969, 0.12754854266704233, 0.11960180638858152, -0.1892421390361118, 0.024665431877818063, 0.002685221282903243, 0.212937839915631, 0.07887120329326501, 0.012059147232557061, 0.3342941682268348, 0.1166412573570765, 0.05204989454984941, 0.09915736389585719, -0.29704765427029795, 0.007388872836061098, -0.26427813420337365, -0.1072356888110301, -0.21058879535606442, 0.07850106801251294, -0.05416658809998706, -0.07312945269600109, 0.31979058961452983, 0.1570389315623928, 0.20564467619449175, 0.003187608414683146, 0.33882074815186636, 0.09687674984754133, 0.10099958857366194, -0.0012357650956363177, 0.39394443449095384, 0.039547087413396825, 0.05810975464474824, -0.20665366850422556, 0.10714345126136861, 0.0069389271730971] |
1,802.09024 | Viable Inflationary Evolution from Loop Quantum Cosmology Scalar-Tensor
Theory | In this work we construct a bottom-up reconstruction technique for Loop
Quantum Cosmology scalar-tensor theories, from the observational indices.
Particularly, the reconstruction technique is based on fixing the functional
form of the scalar-to-tensor ratio as a function of the $e$-foldings number.
The aim of the technique is to realize viable inflationary scenarios, and the
only assumption that must hold true in order for the reconstruction technique
to work is that the dynamical evolution of the scalar field obeys the slow-roll
conditions. We shall use two functional forms for the scalar-to-tensor ratio,
one of which corresponds to a popular inflationary class of models, the
$\alpha$-attractors. For the latter, we shall calculate the leading order
behavior of the spectral index and we shall demonstrate that the resulting
inflationary theory is viable and compatible with the latest Planck and
BICEP2/Keck-Array data. In addition, we shall find the classical limit of the
theory, and as we demonstrate, the Loop Quantum Cosmology corrected theory and
the classical theory are identical at leading order in the perturbative
expansion quantified by the parameter $\rho_c$, which is the critical density
of the quantum theory. Finally, by using the formalism of slow-roll
scalar-tensor Loop Quantum Cosmology, we shall investigate how several
inflationary potentials can be realized by the quantum theory, and we shall
calculate directly the slow-roll indices and the corresponding observational
indices. In addition, the $f(R)$ gravity frame picture is presented.
| gr-qc astro-ph.CO hep-th | in this work we construct a bottomup reconstruction technique for loop quantum cosmology scalartensor theories from the observational indices particularly the reconstruction technique is based on fixing the functional form of the scalartotensor ratio as a function of the efoldings number the aim of the technique is to realize viable inflationary scenarios and the only assumption that must hold true in order for the reconstruction technique to work is that the dynamical evolution of the scalar field obeys the slowroll conditions we shall use two functional forms for the scalartotensor ratio one of which corresponds to a popular inflationary class of models the alphaattractors for the latter we shall calculate the leading order behavior of the spectral index and we shall demonstrate that the resulting inflationary theory is viable and compatible with the latest planck and bicep2keckarray data in addition we shall find the classical limit of the theory and as we demonstrate the loop quantum cosmology corrected theory and the classical theory are identical at leading order in the perturbative expansion quantified by the parameter rho_c which is the critical density of the quantum theory finally by using the formalism of slowroll scalartensor loop quantum cosmology we shall investigate how several inflationary potentials can be realized by the quantum theory and we shall calculate directly the slowroll indices and the corresponding observational indices in addition the fr gravity frame picture is presented | [['in', 'this', 'work', 'we', 'construct', 'a', 'bottomup', 'reconstruction', 'technique', 'for', 'loop', 'quantum', 'cosmology', 'scalartensor', 'theories', 'from', 'the', 'observational', 'indices', 'particularly', 'the', 'reconstruction', 'technique', 'is', 'based', 'on', 'fixing', 'the', 'functional', 'form', 'of', 'the', 'scalartotensor', 'ratio', 'as', 'a', 'function', 'of', 'the', 'efoldings', 'number', 'the', 'aim', 'of', 'the', 'technique', 'is', 'to', 'realize', 'viable', 'inflationary', 'scenarios', 'and', 'the', 'only', 'assumption', 'that', 'must', 'hold', 'true', 'in', 'order', 'for', 'the', 'reconstruction', 'technique', 'to', 'work', 'is', 'that', 'the', 'dynamical', 'evolution', 'of', 'the', 'scalar', 'field', 'obeys', 'the', 'slowroll', 'conditions', 'we', 'shall', 'use', 'two', 'functional', 'forms', 'for', 'the', 'scalartotensor', 'ratio', 'one', 'of', 'which', 'corresponds', 'to', 'a', 'popular', 'inflationary', 'class', 'of', 'models', 'the', 'alphaattractors', 'for', 'the', 'latter', 'we', 'shall', 'calculate', 'the', 'leading', 'order', 'behavior', 'of', 'the', 'spectral', 'index', 'and', 'we', 'shall', 'demonstrate', 'that', 'the', 'resulting', 'inflationary', 'theory', 'is', 'viable', 'and', 'compatible', 'with', 'the', 'latest', 'planck', 'and', 'bicep2keckarray', 'data', 'in', 'addition', 'we', 'shall', 'find', 'the', 'classical', 'limit', 'of', 'the', 'theory', 'and', 'as', 'we', 'demonstrate', 'the', 'loop', 'quantum', 'cosmology', 'corrected', 'theory', 'and', 'the', 'classical', 'theory', 'are', 'identical', 'at', 'leading', 'order', 'in', 'the', 'perturbative', 'expansion', 'quantified', 'by', 'the', 'parameter', 'rho_c', 'which', 'is', 'the', 'critical', 'density', 'of', 'the', 'quantum', 'theory', 'finally', 'by', 'using', 'the', 'formalism', 'of', 'slowroll', 'scalartensor', 'loop', 'quantum', 'cosmology', 'we', 'shall', 'investigate', 'how', 'several', 'inflationary', 'potentials', 'can', 'be', 'realized', 'by', 'the', 'quantum', 'theory', 'and', 'we', 'shall', 'calculate', 'directly', 'the', 'slowroll', 'indices', 'and', 'the', 'corresponding', 'observational', 'indices', 'in', 'addition', 'the', 'fr', 'gravity', 'frame', 'picture', 'is', 'presented']] | [-0.12260125745727397, 0.14260833380022386, -0.1361094789363168, 0.12040906258840753, -0.05372774739781706, -0.1286901922605716, -0.014143774304898703, 0.3102732301797606, -0.21787014033629404, -0.29935309421091216, 0.07580547912651873, -0.2291294179972693, -0.17262060595716275, 0.1669611515461811, -0.044232619349503004, 0.06696472565049921, -0.008045497430836214, 0.0633825985235142, -0.07742371788556196, -0.24139124073104157, 0.34580582360709045, 0.07873641735076696, 0.2469704606507349, 0.012618278831247512, 0.05702315503581479, -0.03965898208388091, -0.010088799411406972, 0.03191657487678745, -0.2119692583191356, 0.11833409579168973, 0.1925079542520995, 0.13604910341351265, 0.21176607919209378, -0.40892465381139625, -0.22847035922891512, 0.10219115067609134, 0.11080354579440578, 0.14229810619107228, -0.012346368489383277, -0.23179209899844785, 0.08437541707882522, -0.18475687848963643, -0.1327111387941107, -0.09362562218593042, -0.0325282998817729, -0.0654943500972221, -0.27209276731561693, 0.09451585571564407, -0.02061034864388794, -0.030891270068965755, -0.041754479393115176, -0.04725944040574997, 0.015497700880829229, 0.06959842193607929, 0.07180498125303393, 0.026042267772101283, 0.11396762103745674, -0.15133004775370748, -0.10595968596751167, 0.4015525742214125, -0.1297281543894615, -0.15090595096021955, 0.10834514282173137, -0.1437331098451603, -0.17896852851695433, 0.011593597009778023, 0.09484636082110103, 0.11734070432874026, -0.11918272900638918, 0.182998649990326, 0.04603037387762187, 0.14866262921152132, 0.06963529338102883, 0.03454540920735621, 0.24251368866290082, 0.09465344360022299, 0.025034193641030482, 0.1325785581745975, -0.08794478865943912, -0.13255535104100158, -0.4004259622883643, -0.14275401147059527, -0.16022148496439367, 0.04380480997971871, -0.15637010244338856, -0.16609081228727338, 0.4067064535398388, 0.1875483403047307, 0.15543093046377304, 0.07406205483592343, 0.2833483432591473, 0.16145329546211326, 0.035334301912605504, 0.02313597299994965, 0.29734455368005924, 0.14988445088091454, 0.10728212056008003, -0.221223611321676, -0.009722714028581018, 0.0881112532044637] |
1,802.09025 | Online Learning of Quantum States | Suppose we have many copies of an unknown $n$-qubit state $\rho$. We measure
some copies of $\rho$ using a known two-outcome measurement $E_{1}$, then other
copies using a measurement $E_{2}$, and so on. At each stage $t$, we generate a
current hypothesis $\sigma_{t}$ about the state $\rho$, using the outcomes of
the previous measurements. We show that it is possible to do this in a way that
guarantees that $|\operatorname{Tr}(E_{i} \sigma_{t}) -
\operatorname{Tr}(E_{i}\rho) |$, the error in our prediction for the next
measurement, is at least $\varepsilon$ at most $\operatorname{O}\!\left(n /
\varepsilon^2 \right) $ times. Even in the "non-realizable" setting---where
there could be arbitrary noise in the measurement outcomes---we show how to
output hypothesis states that do significantly worse than the best possible
states at most $\operatorname{O}\!\left(\sqrt {Tn}\right) $ times on the first
$T$ measurements. These results generalize a 2007 theorem by Aaronson on the
PAC-learnability of quantum states, to the online and regret-minimization
settings. We give three different ways to prove our results---using convex
optimization, quantum postselection, and sequential fat-shattering
dimension---which have different advantages in terms of parameters and
portability.
| quant-ph cs.LG | suppose we have many copies of an unknown nqubit state rho we measure some copies of rho using a known twooutcome measurement e_1 then other copies using a measurement e_2 and so on at each stage t we generate a current hypothesis sigma_t about the state rho using the outcomes of the previous measurements we show that it is possible to do this in a way that guarantees that operatornametre_i sigma_t operatornametre_irho the error in our prediction for the next measurement is at least varepsilon at most operatornameoleftn varepsilon2 right times even in the nonrealizable settingwhere there could be arbitrary noise in the measurement outcomeswe show how to output hypothesis states that do significantly worse than the best possible states at most operatornameoleftsqrt tnright times on the first t measurements these results generalize a 2007 theorem by aaronson on the paclearnability of quantum states to the online and regretminimization settings we give three different ways to prove our resultsusing convex optimization quantum postselection and sequential fatshattering dimensionwhich have different advantages in terms of parameters and portability | [['suppose', 'we', 'have', 'many', 'copies', 'of', 'an', 'unknown', 'nqubit', 'state', 'rho', 'we', 'measure', 'some', 'copies', 'of', 'rho', 'using', 'a', 'known', 'twooutcome', 'measurement', 'e_1', 'then', 'other', 'copies', 'using', 'a', 'measurement', 'e_2', 'and', 'so', 'on', 'at', 'each', 'stage', 't', 'we', 'generate', 'a', 'current', 'hypothesis', 'sigma_t', 'about', 'the', 'state', 'rho', 'using', 'the', 'outcomes', 'of', 'the', 'previous', 'measurements', 'we', 'show', 'that', 'it', 'is', 'possible', 'to', 'do', 'this', 'in', 'a', 'way', 'that', 'guarantees', 'that', 'operatornametre_i', 'sigma_t', 'operatornametre_irho', 'the', 'error', 'in', 'our', 'prediction', 'for', 'the', 'next', 'measurement', 'is', 'at', 'least', 'varepsilon', 'at', 'most', 'operatornameoleftn', 'varepsilon2', 'right', 'times', 'even', 'in', 'the', 'nonrealizable', 'settingwhere', 'there', 'could', 'be', 'arbitrary', 'noise', 'in', 'the', 'measurement', 'outcomeswe', 'show', 'how', 'to', 'output', 'hypothesis', 'states', 'that', 'do', 'significantly', 'worse', 'than', 'the', 'best', 'possible', 'states', 'at', 'most', 'operatornameoleftsqrt', 'tnright', 'times', 'on', 'the', 'first', 't', 'measurements', 'these', 'results', 'generalize', 'a', '2007', 'theorem', 'by', 'aaronson', 'on', 'the', 'paclearnability', 'of', 'quantum', 'states', 'to', 'the', 'online', 'and', 'regretminimization', 'settings', 'we', 'give', 'three', 'different', 'ways', 'to', 'prove', 'our', 'resultsusing', 'convex', 'optimization', 'quantum', 'postselection', 'and', 'sequential', 'fatshattering', 'dimensionwhich', 'have', 'different', 'advantages', 'in', 'terms', 'of', 'parameters', 'and', 'portability']] | [-0.09887040944609214, 0.1312379119980982, -0.09520788245884303, 0.027130577533777494, 0.00044442904514393637, -0.16638663828295344, 0.06734923926636666, 0.3710928185554665, -0.24921623784411212, -0.29099402868831975, 0.10000516307038543, -0.2980080465786159, -0.08697606879494353, 0.1926632576796692, -0.08348063028062738, 0.05982610322618192, 0.10036286558533902, 0.08285836864212927, -0.07217199299304325, -0.293927657914104, 0.29070593056080507, -0.006126095251169144, 0.22850019336190253, 0.03617593267561114, 0.10989218183870737, 0.013945103492698677, 0.01955719607593935, -0.012226119005520428, -0.14359024964731015, 0.058314705503497474, 0.27326404875549043, 0.15759976096922487, 0.2604045630044614, -0.3949388330892405, -0.15899088031922778, 0.14579449805855152, 0.10670091871205452, 0.09068932233952053, 0.006285836877872325, -0.27150563909500697, 0.10551233821371127, -0.13919769950944966, -0.06569004154464762, -0.08990077524157684, 0.023523466686518595, -0.052301434201667905, -0.2926556903514124, 0.06418467036703424, 0.06087035175767683, -0.0066553736109026, -0.026275346953687922, -0.16821535648999825, 0.024905193064893996, 0.10586181737086181, 0.018669977186835326, 0.05608204758304748, 0.10677389584625849, -0.10518157643292354, -0.17042226774806513, 0.30990773268387695, -0.0680152190329647, -0.21610884343889275, 0.18476087330435847, -0.16996703004475594, -0.18297315701091152, 0.05725453470811425, 0.1265542702583064, 0.1265200355666734, -0.09544197905398462, 0.06728509540525487, -0.06790935261995487, 0.1994400922281091, 0.08820545915625103, 0.05308508462344651, 0.11109662104891391, 0.09101585090892124, 0.09972653446484833, 0.09356628266721687, -0.051911064720029355, -0.05512799434585586, -0.33597824020156014, -0.1608456545564834, -0.18144233654380687, 0.10021058220696605, -0.08801850870804628, -0.08584919726542596, 0.3837604018044658, 0.17245061297269007, 0.22958017871826, 0.07598936441077274, 0.3063880666380837, 0.09404361869452432, 0.03245865915682987, 0.11081262452561143, 0.21650769140857543, 0.0922669647829718, 0.026701178856455954, -0.1759020192770376, 0.1018994724214454, -8.865781377867929e-05] |
1,802.09026 | Building Instance Classification Using Street View Images | Land-use classification based on spaceborne or aerial remote sensing images
has been extensively studied over the past decades. Such classification is
usually a patch-wise or pixel-wise labeling over the whole image. But for many
applications, such as urban population density mapping or urban utility
planning, a classification map based on individual buildings is much more
informative. However, such semantic classification still poses some fundamental
challenges, for example, how to retrieve fine boundaries of individual
buildings. In this paper, we proposed a general framework for classifying the
functionality of individual buildings. The proposed method is based on
Convolutional Neural Networks (CNNs) which classify facade structures from
street view images, such as Google StreetView, in addition to remote sensing
images which usually only show roof structures. Geographic information was
utilized to mask out individual buildings, and to associate the corresponding
street view images. We created a benchmark dataset which was used for training
and evaluating CNNs. In addition, the method was applied to generate building
classification maps on both region and city scales of several cities in Canada
and the US. Keywords: CNN, Building instance classification, Street view
images, OpenStreetMap
| cs.CV eess.IV | landuse classification based on spaceborne or aerial remote sensing images has been extensively studied over the past decades such classification is usually a patchwise or pixelwise labeling over the whole image but for many applications such as urban population density mapping or urban utility planning a classification map based on individual buildings is much more informative however such semantic classification still poses some fundamental challenges for example how to retrieve fine boundaries of individual buildings in this paper we proposed a general framework for classifying the functionality of individual buildings the proposed method is based on convolutional neural networks cnns which classify facade structures from street view images such as google streetview in addition to remote sensing images which usually only show roof structures geographic information was utilized to mask out individual buildings and to associate the corresponding street view images we created a benchmark dataset which was used for training and evaluating cnns in addition the method was applied to generate building classification maps on both region and city scales of several cities in canada and the us keywords cnn building instance classification street view images openstreetmap | [['landuse', 'classification', 'based', 'on', 'spaceborne', 'or', 'aerial', 'remote', 'sensing', 'images', 'has', 'been', 'extensively', 'studied', 'over', 'the', 'past', 'decades', 'such', 'classification', 'is', 'usually', 'a', 'patchwise', 'or', 'pixelwise', 'labeling', 'over', 'the', 'whole', 'image', 'but', 'for', 'many', 'applications', 'such', 'as', 'urban', 'population', 'density', 'mapping', 'or', 'urban', 'utility', 'planning', 'a', 'classification', 'map', 'based', 'on', 'individual', 'buildings', 'is', 'much', 'more', 'informative', 'however', 'such', 'semantic', 'classification', 'still', 'poses', 'some', 'fundamental', 'challenges', 'for', 'example', 'how', 'to', 'retrieve', 'fine', 'boundaries', 'of', 'individual', 'buildings', 'in', 'this', 'paper', 'we', 'proposed', 'a', 'general', 'framework', 'for', 'classifying', 'the', 'functionality', 'of', 'individual', 'buildings', 'the', 'proposed', 'method', 'is', 'based', 'on', 'convolutional', 'neural', 'networks', 'cnns', 'which', 'classify', 'facade', 'structures', 'from', 'street', 'view', 'images', 'such', 'as', 'google', 'streetview', 'in', 'addition', 'to', 'remote', 'sensing', 'images', 'which', 'usually', 'only', 'show', 'roof', 'structures', 'geographic', 'information', 'was', 'utilized', 'to', 'mask', 'out', 'individual', 'buildings', 'and', 'to', 'associate', 'the', 'corresponding', 'street', 'view', 'images', 'we', 'created', 'a', 'benchmark', 'dataset', 'which', 'was', 'used', 'for', 'training', 'and', 'evaluating', 'cnns', 'in', 'addition', 'the', 'method', 'was', 'applied', 'to', 'generate', 'building', 'classification', 'maps', 'on', 'both', 'region', 'and', 'city', 'scales', 'of', 'several', 'cities', 'in', 'canada', 'and', 'the', 'us', 'keywords', 'cnn', 'building', 'instance', 'classification', 'street', 'view', 'images', 'openstreetmap']] | [-0.016201928579322795, -0.02273166462335676, -0.06295747983398194, 0.09308458205084613, -0.09229585253930789, -0.13563135036197987, 0.020360968399472767, 0.4588376501812897, -0.2578793897174616, -0.356493191484565, 0.15588240214484803, -0.2713038408063709, -0.21566735949872576, 0.24164723371715344, -0.18913155866361425, 0.08068572207195486, 0.10866040994903628, 0.06220515948680646, -0.025521454532591113, -0.27187037048675616, 0.27523217158375973, 0.03629654537182935, 0.40293651230217137, 0.01843306798849532, 0.1237681086987574, -0.022196012546935, -0.0794969185124191, 0.02558438187871287, -0.0346433131861441, 0.19571086778237357, 0.35318043759399825, 0.18304241831201387, 0.27352506634432505, -0.41619095812611123, -0.29216201531334207, 0.1136726799242674, 0.14653878554979222, 0.08296112278340127, -0.021110540951067767, -0.3920835246668851, 0.07909999295519268, -0.1619312197187955, -0.004897090757483656, -0.09922553157245621, 0.016498883295076046, -0.021416318836619465, -0.23516939641372797, 0.0007126666853164739, 0.016741214065250268, 0.14385763286276065, -0.07791291102098222, -0.0855130937508991, -0.021275622505159613, 0.2629226124845445, -0.03259044321826065, 0.028456197078760834, 0.1903920502604996, -0.1987306362713385, -0.11215722192811997, 0.4069560329588328, 0.029349330591008145, -0.17769100766212859, 0.2178898673886037, -0.0553486139805829, -0.14471696474975806, 0.07206389442348773, 0.2558632857782984, 0.09977008685212027, -0.17283970380122674, -0.0113743174675, -0.096403825421882, 0.15253991268555375, 0.13341842533802575, -0.024766591413162075, 0.21474222418049627, 0.26474251251846076, 0.0965050594937527, 0.11298535942060357, -0.21030269059487028, -0.049539654240745336, -0.1649573780063718, -0.11351361147256846, -0.1932814185497688, 0.008443143667078557, -0.07420267521352954, -0.16203872588502757, 0.4252001371313917, 0.20599890579568578, 0.18563518796284545, 0.044437520470385974, 0.3438850092166599, -0.04529389980164891, 0.1558573816412505, 0.061652599064202264, 0.11087524527860335, 0.0013555876540386693, 0.14401768746741234, -0.0714607212823776, 0.04042666919400638, 0.09277103430507308] |
1,802.09027 | Holographic fermionic spectrum with Weyl correction | We study the ferminoic spectrum with Weyl correction, which exhibits the
non-Fermi liquid behavior. Also, we find that both the height of the peak of
the fermionic spectrum and the dispersion relation exhibit a nonlinearity with
the variety of the Weyl coupling parameter $\gamma$, which mean that such
nonlinearity maybe ascribe to the one of the Maxwell field. Another important
property of this system is that for the holographic fermionic system with
$\gamma<0$, the degree of the deviation from Fermi liquid is heavier than that
for the one with $\gamma>0$. It indicates that there is a transition of
coupling strength in the dual boundary field theory.
| hep-th | we study the ferminoic spectrum with weyl correction which exhibits the nonfermi liquid behavior also we find that both the height of the peak of the fermionic spectrum and the dispersion relation exhibit a nonlinearity with the variety of the weyl coupling parameter gamma which mean that such nonlinearity maybe ascribe to the one of the maxwell field another important property of this system is that for the holographic fermionic system with gamma0 the degree of the deviation from fermi liquid is heavier than that for the one with gamma0 it indicates that there is a transition of coupling strength in the dual boundary field theory | [['we', 'study', 'the', 'ferminoic', 'spectrum', 'with', 'weyl', 'correction', 'which', 'exhibits', 'the', 'nonfermi', 'liquid', 'behavior', 'also', 'we', 'find', 'that', 'both', 'the', 'height', 'of', 'the', 'peak', 'of', 'the', 'fermionic', 'spectrum', 'and', 'the', 'dispersion', 'relation', 'exhibit', 'a', 'nonlinearity', 'with', 'the', 'variety', 'of', 'the', 'weyl', 'coupling', 'parameter', 'gamma', 'which', 'mean', 'that', 'such', 'nonlinearity', 'maybe', 'ascribe', 'to', 'the', 'one', 'of', 'the', 'maxwell', 'field', 'another', 'important', 'property', 'of', 'this', 'system', 'is', 'that', 'for', 'the', 'holographic', 'fermionic', 'system', 'with', 'gamma0', 'the', 'degree', 'of', 'the', 'deviation', 'from', 'fermi', 'liquid', 'is', 'heavier', 'than', 'that', 'for', 'the', 'one', 'with', 'gamma0', 'it', 'indicates', 'that', 'there', 'is', 'a', 'transition', 'of', 'coupling', 'strength', 'in', 'the', 'dual', 'boundary', 'field', 'theory']] | [-0.1664227472041689, 0.17306385128038182, -0.12317476406516063, 0.019189576496414486, -0.05020196038697447, -0.18888546787645846, 0.004854752725389387, 0.3022186550533488, -0.25949016066179387, -0.27003280334174634, 0.028426022130242062, -0.32196279176998704, -0.15273597494787758, 0.18068455197804031, 0.03781571432149836, -0.016422919840330168, -0.024054855942016555, 0.09403070770647554, -0.08963471972827046, -0.18631922160940512, 0.38194835394000015, 0.023360858449623698, 0.2811827144452504, 0.06523304041807673, 0.06403940341745813, -0.027159466612197106, 0.11058576360699676, 0.03698218446224928, -0.11316481862789564, 0.06307727451924057, 0.18268393318035772, -0.014485426593039717, 0.2110353110801606, -0.32392468368191096, -0.22025014719194067, 0.10889385290488246, 0.08925583748412984, 0.07948508972878612, -0.06006429270796833, -0.24576185911539056, 0.03560004889787663, -0.16355284644371187, -0.1960178506782367, -0.03180386013395729, 0.02075701092724644, -0.01766756797442213, -0.23906084317713977, 0.1125240917159577, 0.08223834279314837, 0.04126040277825225, -0.052421372067848485, -0.0813619255553931, -0.051872479631787254, 0.07875092761324985, 0.11003754945427534, 0.044745788760926754, 0.08898584721166464, -0.19129689583954002, -0.0451720196986571, 0.394672490957947, -0.11652541505907374, -0.13999363348952362, 0.17403903556987643, -0.20384301361406132, -0.10671822093150002, 0.16652652730367012, 0.10241606990318923, 0.05278680711275055, -0.08252871158044962, 0.11096205297979482, -0.0632110651039208, 0.185297631614265, 0.010582212130317376, 0.062026904474589084, 0.2059383033641747, 0.14547682828159028, 0.08034631081280254, 0.1406465359032154, -0.11870613025190929, -0.08449624767526984, -0.35464183940951316, -0.2017372582285177, -0.20416838309417168, 0.05774861250427507, -0.11536626511993485, -0.20612176256254316, 0.408243258785279, 0.15047430938908032, 0.19203451931299198, 0.04574763314088895, 0.2149778615550271, 0.1724861172038973, 0.09739663796942859, 0.06963482385589963, 0.3134465159493543, 0.11613349011611371, 0.07786770622645106, -0.30145322082874676, 0.009887383017866385, 0.044718708736555916] |
1,802.09028 | Field-effect-driven half-metallic multilayer graphene | Rhombohedral stacked multilayer graphene displays the occurrence of a
magnetic surface state at low temperatures. Recent angular resolved
photoemission experiments demonstrate the robustness of the magnetic state in
long sequences of ABC graphene. Here, by using first-principles calculations,
we show that field-effect doping of these graphene multilayers induces a
perfect half-metallic behaviour with 100% of spin current polarization already
at dopings attainable in conventional field effect transistors with solid state
dielectrics. Our work demonstrates the realisability of a new kind of
spintronic devices where the transition between the low resistance and the high
resistance state is driven only by electric fields.
| cond-mat.mtrl-sci cond-mat.mes-hall | rhombohedral stacked multilayer graphene displays the occurrence of a magnetic surface state at low temperatures recent angular resolved photoemission experiments demonstrate the robustness of the magnetic state in long sequences of abc graphene here by using firstprinciples calculations we show that fieldeffect doping of these graphene multilayers induces a perfect halfmetallic behaviour with 100 of spin current polarization already at dopings attainable in conventional field effect transistors with solid state dielectrics our work demonstrates the realisability of a new kind of spintronic devices where the transition between the low resistance and the high resistance state is driven only by electric fields | [['rhombohedral', 'stacked', 'multilayer', 'graphene', 'displays', 'the', 'occurrence', 'of', 'a', 'magnetic', 'surface', 'state', 'at', 'low', 'temperatures', 'recent', 'angular', 'resolved', 'photoemission', 'experiments', 'demonstrate', 'the', 'robustness', 'of', 'the', 'magnetic', 'state', 'in', 'long', 'sequences', 'of', 'abc', 'graphene', 'here', 'by', 'using', 'firstprinciples', 'calculations', 'we', 'show', 'that', 'fieldeffect', 'doping', 'of', 'these', 'graphene', 'multilayers', 'induces', 'a', 'perfect', 'halfmetallic', 'behaviour', 'with', '100', 'of', 'spin', 'current', 'polarization', 'already', 'at', 'dopings', 'attainable', 'in', 'conventional', 'field', 'effect', 'transistors', 'with', 'solid', 'state', 'dielectrics', 'our', 'work', 'demonstrates', 'the', 'realisability', 'of', 'a', 'new', 'kind', 'of', 'spintronic', 'devices', 'where', 'the', 'transition', 'between', 'the', 'low', 'resistance', 'and', 'the', 'high', 'resistance', 'state', 'is', 'driven', 'only', 'by', 'electric', 'fields']] | [-0.19791553776231732, 0.1917948346345289, -0.007396165051008805, -0.060846881907534706, -0.007356301341943517, -0.1603524399976624, 0.10150360825960295, 0.43560530042441764, -0.26807659403994416, -0.30952000892767223, -0.046699875751325844, -0.30184911003354753, -0.15015179866067327, 0.1981177312180188, 0.020225936533090207, 0.0385074902574836, 0.00606935233855159, -0.08434641677344513, -0.10560514268207152, -0.2037945024318772, 0.27052321586536593, 0.039820389743746805, 0.3719444211600072, 0.09332800190434745, 0.08935139837702459, -0.042663267029836624, 0.1772481328577246, 0.05570451131477804, -0.13162773145666165, 0.03741445324134709, 0.26312254901080956, -0.14705800472236857, 0.2134985272743218, -0.5081555049054989, -0.21985788895554914, -0.0509170578391577, 0.0712342638208872, 0.1807459854373321, -0.1158544958320142, -0.2569365331737122, 0.10367291303014954, -0.1420049074228097, -0.08518170474986385, -0.11423442196239265, -0.026694829883468843, -0.0006132377311587334, -0.2169258348865084, 0.09508552007252664, 0.04206980958622465, 0.11682466177048224, -0.11240188276471852, -0.1619599548509658, -0.10758870850446274, 0.01568189320053057, 0.026317347871545372, 0.056707422359671335, 0.18840705316126494, -0.1610880194088942, -0.15877892490992745, 0.2919785238636455, -0.06808386908816451, -0.0772047296147978, 0.15028789720387373, -0.2348021295216709, -0.0601630449885189, 0.12853459547283036, 0.08201460593776537, 0.13901942824520688, -0.11047587805141759, 0.08722835218091265, 0.016794020297077234, 0.18193009345432615, 0.07544251366997931, 0.10364462432018158, 0.3001241534210668, 0.25159391687980087, 0.02133152815559418, 0.1288605656631586, -0.16831355324328537, 0.014248171634511045, -0.18730444646449668, -0.18798102122630075, -0.2472770974999017, 0.13463169363520966, -0.07684275814972352, -0.22237367636644015, 0.4165272633591206, 0.1752432610120366, 0.15418097334406752, -0.03176745955398915, 0.3035428830938838, 0.09494159776961782, 0.05055235973259637, -0.002448565036169078, 0.26810040150649184, 0.18902525339404694, 0.14063770925201993, -0.266844110913796, 0.10582569881116437, -0.07701880325295843] |
1,802.09029 | On tetraquarks with hidden charm and strangeness as phi-psi(2S)
hadrocharmonium | In the hadrocharmonium picture a $\bar cc$ state and a light hadron form a
bound state. The effective interaction is described in terms of the
chromoelectric polarizability of the $\bar cc$ state and energy-momentum-tensor
densities of the light hadron. This picture is justified in the heavy quark
limit, and may successfully account for a hidden-charm pentaquark state
recently observed by LHCb. In this work we extend the formalism to the
description of hidden-charm tetraquarks, and address the question of whether
the resonant states observed by LHCb in the $J/\psi$-$\phi$ spectrum can be
described as hadrocharmonia. This is a non-trivial question because nothing is
known about the $\phi$ meson energy-momentum-tensor densities. With rather
general assumptions about energy-momentum-tensor densities in the $\phi$-meson
we show that a $\psi(2S)$-$\phi$ bound state can exist, and obtain a
characteristic relation between its mass and width. We show that the tetraquark
$X(4274)$ observed by LHCb in $J/\psi$-$\phi$ spectrum is a good candidate for
a hadrocharmonium. We make predictions which will allow testing this picture.
Our method can be generalized to identify other potential hadrocharmonia.
| hep-ph | in the hadrocharmonium picture a bar cc state and a light hadron form a bound state the effective interaction is described in terms of the chromoelectric polarizability of the bar cc state and energymomentumtensor densities of the light hadron this picture is justified in the heavy quark limit and may successfully account for a hiddencharm pentaquark state recently observed by lhcb in this work we extend the formalism to the description of hiddencharm tetraquarks and address the question of whether the resonant states observed by lhcb in the jpsiphi spectrum can be described as hadrocharmonia this is a nontrivial question because nothing is known about the phi meson energymomentumtensor densities with rather general assumptions about energymomentumtensor densities in the phimeson we show that a psi2sphi bound state can exist and obtain a characteristic relation between its mass and width we show that the tetraquark x4274 observed by lhcb in jpsiphi spectrum is a good candidate for a hadrocharmonium we make predictions which will allow testing this picture our method can be generalized to identify other potential hadrocharmonia | [['in', 'the', 'hadrocharmonium', 'picture', 'a', 'bar', 'cc', 'state', 'and', 'a', 'light', 'hadron', 'form', 'a', 'bound', 'state', 'the', 'effective', 'interaction', 'is', 'described', 'in', 'terms', 'of', 'the', 'chromoelectric', 'polarizability', 'of', 'the', 'bar', 'cc', 'state', 'and', 'energymomentumtensor', 'densities', 'of', 'the', 'light', 'hadron', 'this', 'picture', 'is', 'justified', 'in', 'the', 'heavy', 'quark', 'limit', 'and', 'may', 'successfully', 'account', 'for', 'a', 'hiddencharm', 'pentaquark', 'state', 'recently', 'observed', 'by', 'lhcb', 'in', 'this', 'work', 'we', 'extend', 'the', 'formalism', 'to', 'the', 'description', 'of', 'hiddencharm', 'tetraquarks', 'and', 'address', 'the', 'question', 'of', 'whether', 'the', 'resonant', 'states', 'observed', 'by', 'lhcb', 'in', 'the', 'jpsiphi', 'spectrum', 'can', 'be', 'described', 'as', 'hadrocharmonia', 'this', 'is', 'a', 'nontrivial', 'question', 'because', 'nothing', 'is', 'known', 'about', 'the', 'phi', 'meson', 'energymomentumtensor', 'densities', 'with', 'rather', 'general', 'assumptions', 'about', 'energymomentumtensor', 'densities', 'in', 'the', 'phimeson', 'we', 'show', 'that', 'a', 'psi2sphi', 'bound', 'state', 'can', 'exist', 'and', 'obtain', 'a', 'characteristic', 'relation', 'between', 'its', 'mass', 'and', 'width', 'we', 'show', 'that', 'the', 'tetraquark', 'x4274', 'observed', 'by', 'lhcb', 'in', 'jpsiphi', 'spectrum', 'is', 'a', 'good', 'candidate', 'for', 'a', 'hadrocharmonium', 'we', 'make', 'predictions', 'which', 'will', 'allow', 'testing', 'this', 'picture', 'our', 'method', 'can', 'be', 'generalized', 'to', 'identify', 'other', 'potential', 'hadrocharmonia']] | [-0.09495492207970323, 0.19517214767803243, -0.1470199530854779, 0.15139316362631375, -0.05237466356099457, -0.12792356926316428, 0.07377420010250378, 0.3078285154102549, -0.1855859309829519, -0.2674532519879693, -0.012925523769315647, -0.2763231566996645, -0.07302100611008745, 0.10549219391087733, 0.02275289586971456, 0.060943226108661624, 0.0762682800815246, 0.04484160979920314, -0.047140708754212717, -0.1900491179414304, 0.30822513167257026, -0.014521596579198163, 0.20718627809389037, 0.1587183998883202, -0.011274784653431784, -0.030825994353699315, 0.033663765423389225, -0.020712557554608053, -0.12237230317687187, 0.08351554599094684, 0.24675189287896337, 0.13192139606986006, 0.14977040832551816, -0.3525512859193703, -0.15553981944060974, 0.12100350263983664, 0.1735990605301271, 0.12385770366961231, -0.02023536763759067, -0.3332726069868116, 0.12394217598793955, -0.21166172631000732, -0.18808357588325939, -0.09876530413847354, 0.024076912541594882, -0.06107875965746109, -0.28216304838273276, 0.08933383578057717, 0.002173514301378259, -0.017979189190529498, -0.059908908287373684, -0.18195897645361742, -0.020641627372900224, 0.027590192912283252, 0.03811789749027098, 0.09341349081257305, 0.1181566831879423, -0.1631432534461857, -0.133957704152954, 0.368131032711458, -0.07793453597926697, -0.17559449035887434, 0.1360927866561349, -0.16462198012024376, -0.12929504879324114, 0.08046968898829336, 0.14323828142977552, 0.06590359904250856, -0.17657607801174377, 0.09269479328135388, -0.09766435485838329, 0.17998550504203992, 0.06921689613790667, 0.09570733914947621, 0.23301355674301175, 0.1643480376135242, -0.021663744604717518, 0.10092183301063506, -0.04041572197440401, -0.08536188060280966, -0.3394055587034357, -0.14276179950735693, -0.12865291119916206, 0.09029117903420912, 0.009690588803686949, -0.09181816677041983, 0.38859848747961223, 0.0760531593804737, 0.28523012039535756, -0.0118063459360951, 0.27378817948665324, 0.1139494776436375, 0.035392551022544926, 0.09133943901949768, 0.29814370341157004, 0.18155602673410653, 0.10650915475193895, -0.2573734714914676, 0.07238661753566868, 0.02538581438478356] |
1,802.0903 | Cakewalk Sampling | We study the task of finding good local optima in combinatorial optimization
problems. Although combinatorial optimization is NP-hard in general, locally
optimal solutions are frequently used in practice. Local search methods however
typically converge to a limited set of optima that depend on their
initialization. Sampling methods on the other hand can access any valid
solution, and thus can be used either directly or alongside methods of the
former type as a way for finding good local optima. Since the effectiveness of
this strategy depends on the sampling distribution, we derive a robust learning
algorithm that adapts sampling distributions towards good local optima of
arbitrary objective functions. As a first use case, we empirically study the
efficiency in which sampling methods can recover locally maximal cliques in
undirected graphs. Not only do we show how our adaptive sampler outperforms
related methods, we also show how it can even approach the performance of
established clique algorithms. As a second use case, we consider how greedy
algorithms can be combined with our adaptive sampler, and we demonstrate how
this leads to superior performance in k-medoid clustering. Together, these
findings suggest that our adaptive sampler can provide an effective strategy to
combinatorial optimization problems that arise in practice.
| stat.ML cs.AI cs.LG | we study the task of finding good local optima in combinatorial optimization problems although combinatorial optimization is nphard in general locally optimal solutions are frequently used in practice local search methods however typically converge to a limited set of optima that depend on their initialization sampling methods on the other hand can access any valid solution and thus can be used either directly or alongside methods of the former type as a way for finding good local optima since the effectiveness of this strategy depends on the sampling distribution we derive a robust learning algorithm that adapts sampling distributions towards good local optima of arbitrary objective functions as a first use case we empirically study the efficiency in which sampling methods can recover locally maximal cliques in undirected graphs not only do we show how our adaptive sampler outperforms related methods we also show how it can even approach the performance of established clique algorithms as a second use case we consider how greedy algorithms can be combined with our adaptive sampler and we demonstrate how this leads to superior performance in kmedoid clustering together these findings suggest that our adaptive sampler can provide an effective strategy to combinatorial optimization problems that arise in practice | [['we', 'study', 'the', 'task', 'of', 'finding', 'good', 'local', 'optima', 'in', 'combinatorial', 'optimization', 'problems', 'although', 'combinatorial', 'optimization', 'is', 'nphard', 'in', 'general', 'locally', 'optimal', 'solutions', 'are', 'frequently', 'used', 'in', 'practice', 'local', 'search', 'methods', 'however', 'typically', 'converge', 'to', 'a', 'limited', 'set', 'of', 'optima', 'that', 'depend', 'on', 'their', 'initialization', 'sampling', 'methods', 'on', 'the', 'other', 'hand', 'can', 'access', 'any', 'valid', 'solution', 'and', 'thus', 'can', 'be', 'used', 'either', 'directly', 'or', 'alongside', 'methods', 'of', 'the', 'former', 'type', 'as', 'a', 'way', 'for', 'finding', 'good', 'local', 'optima', 'since', 'the', 'effectiveness', 'of', 'this', 'strategy', 'depends', 'on', 'the', 'sampling', 'distribution', 'we', 'derive', 'a', 'robust', 'learning', 'algorithm', 'that', 'adapts', 'sampling', 'distributions', 'towards', 'good', 'local', 'optima', 'of', 'arbitrary', 'objective', 'functions', 'as', 'a', 'first', 'use', 'case', 'we', 'empirically', 'study', 'the', 'efficiency', 'in', 'which', 'sampling', 'methods', 'can', 'recover', 'locally', 'maximal', 'cliques', 'in', 'undirected', 'graphs', 'not', 'only', 'do', 'we', 'show', 'how', 'our', 'adaptive', 'sampler', 'outperforms', 'related', 'methods', 'we', 'also', 'show', 'how', 'it', 'can', 'even', 'approach', 'the', 'performance', 'of', 'established', 'clique', 'algorithms', 'as', 'a', 'second', 'use', 'case', 'we', 'consider', 'how', 'greedy', 'algorithms', 'can', 'be', 'combined', 'with', 'our', 'adaptive', 'sampler', 'and', 'we', 'demonstrate', 'how', 'this', 'leads', 'to', 'superior', 'performance', 'in', 'kmedoid', 'clustering', 'together', 'these', 'findings', 'suggest', 'that', 'our', 'adaptive', 'sampler', 'can', 'provide', 'an', 'effective', 'strategy', 'to', 'combinatorial', 'optimization', 'problems', 'that', 'arise', 'in', 'practice']] | [-0.04704084209643486, -0.017287114527709667, -0.14591498663876115, 0.12290859516516964, -0.11553983047786283, -0.1788577173734311, 0.08541370112798177, 0.46625266318186753, -0.28834254627070594, -0.3267033598490809, 0.12221829535768981, -0.1924908634638641, -0.2161143927221618, 0.20495908569669488, -0.14950983575627771, 0.054758806290423, 0.12433053378197478, -0.0034558558573935, -0.06945495433560941, -0.32241263649108387, 0.262388335671503, 0.057291737703106756, 0.31199807824975834, 0.0036531349928004713, 0.07735981409403882, 0.009875594662138965, -0.008033527285655642, 0.08412665993929273, -0.12407111774110689, 0.1302014661101034, 0.30744628372216004, 0.19626926374735265, 0.3270559338375744, -0.4079880574400105, -0.1692697631354194, 0.1860854889152617, 0.2115775934057083, 0.13794697970776568, -0.05248171244463997, -0.2125267415670905, 0.09112690497025075, -0.11283829568135666, -0.06553498380476745, -0.16258869752537733, -0.09504462525066806, 0.08037053661835493, -0.3151499698847169, 0.057720027260039365, 0.049966823370990954, -0.017017477069322655, -0.03510117763539822, -0.13276397272796803, 0.03933395722017782, 0.1015327910290713, 0.0124531084150587, 0.0282608587544684, 0.1427995376538758, -0.1052895243586291, -0.20041330035367028, 0.35329615630936334, -0.033910530950964954, -0.2487165993556562, 0.21301296084392363, -0.05146554329591553, -0.18177220248730808, 0.11730661396584587, 0.19104941023667002, 0.19444251549884495, -0.117998382930712, 0.08018231942238876, -0.06586140291197452, 0.1383248918672751, 0.027214099796170867, 0.014141503959133222, 0.11932547550375869, 0.16498767715969645, 0.18900207037549102, 0.14589600139155576, -0.03603314698628354, -0.10635146077199861, -0.2370066255649052, -0.08916015991878627, -0.2376850386104751, -0.008816901779458177, -0.12469138650481998, -0.1677686642571466, 0.37769755054628706, 0.23789733983008418, 0.18042822565383665, 0.09450166115435067, 0.3139227787123584, 0.06660367822134015, 0.03942848570849292, 0.13334716147737485, 0.20609460991193973, 0.04695563310215664, 0.06127995380268591, -0.20264818936078127, 0.11790593321003565, 0.0730348802830388] |
1,802.09031 | Functional Gradient Boosting based on Residual Network Perception | Residual Networks (ResNets) have become state-of-the-art models in deep
learning and several theoretical studies have been devoted to understanding why
ResNet works so well. One attractive viewpoint on ResNet is that it is
optimizing the risk in a functional space by combining an ensemble of effective
features. In this paper, we adopt this viewpoint to construct a new gradient
boosting method, which is known to be very powerful in data analysis. To do so,
we formalize the gradient boosting perspective of ResNet mathematically using
the notion of functional gradients and propose a new method called ResFGB for
classification tasks by leveraging ResNet perception. Two types of
generalization guarantees are provided from the optimization perspective: one
is the margin bound and the other is the expected risk bound by the
sample-splitting technique. Experimental results show superior performance of
the proposed method over state-of-the-art methods such as LightGBM.
| stat.ML cs.LG | residual networks resnets have become stateoftheart models in deep learning and several theoretical studies have been devoted to understanding why resnet works so well one attractive viewpoint on resnet is that it is optimizing the risk in a functional space by combining an ensemble of effective features in this paper we adopt this viewpoint to construct a new gradient boosting method which is known to be very powerful in data analysis to do so we formalize the gradient boosting perspective of resnet mathematically using the notion of functional gradients and propose a new method called resfgb for classification tasks by leveraging resnet perception two types of generalization guarantees are provided from the optimization perspective one is the margin bound and the other is the expected risk bound by the samplesplitting technique experimental results show superior performance of the proposed method over stateoftheart methods such as lightgbm | [['residual', 'networks', 'resnets', 'have', 'become', 'stateoftheart', 'models', 'in', 'deep', 'learning', 'and', 'several', 'theoretical', 'studies', 'have', 'been', 'devoted', 'to', 'understanding', 'why', 'resnet', 'works', 'so', 'well', 'one', 'attractive', 'viewpoint', 'on', 'resnet', 'is', 'that', 'it', 'is', 'optimizing', 'the', 'risk', 'in', 'a', 'functional', 'space', 'by', 'combining', 'an', 'ensemble', 'of', 'effective', 'features', 'in', 'this', 'paper', 'we', 'adopt', 'this', 'viewpoint', 'to', 'construct', 'a', 'new', 'gradient', 'boosting', 'method', 'which', 'is', 'known', 'to', 'be', 'very', 'powerful', 'in', 'data', 'analysis', 'to', 'do', 'so', 'we', 'formalize', 'the', 'gradient', 'boosting', 'perspective', 'of', 'resnet', 'mathematically', 'using', 'the', 'notion', 'of', 'functional', 'gradients', 'and', 'propose', 'a', 'new', 'method', 'called', 'resfgb', 'for', 'classification', 'tasks', 'by', 'leveraging', 'resnet', 'perception', 'two', 'types', 'of', 'generalization', 'guarantees', 'are', 'provided', 'from', 'the', 'optimization', 'perspective', 'one', 'is', 'the', 'margin', 'bound', 'and', 'the', 'other', 'is', 'the', 'expected', 'risk', 'bound', 'by', 'the', 'samplesplitting', 'technique', 'experimental', 'results', 'show', 'superior', 'performance', 'of', 'the', 'proposed', 'method', 'over', 'stateoftheart', 'methods', 'such', 'as', 'lightgbm']] | [-0.023429901204232512, -0.015315322679816746, -0.12905252740300935, 0.09651424315003357, -0.09930027674498229, -0.18304342785207875, 0.022035166837178686, 0.4299974428939408, -0.27566069610545346, -0.31579773410520484, 0.07775305182319776, -0.2556273982860148, -0.25324286682418834, 0.2283832190566343, -0.1509827968022176, 0.07545988628448083, 0.09699837504564945, 0.02227968044964404, -0.08477283127702259, -0.2845051625390248, 0.2889358551915863, 0.0682849124569751, 0.3515995670752279, 0.05508499314109313, 0.11519337740068421, -0.05949850986101504, -0.0026311623992334152, 0.05966490737046115, -0.07507119211313065, 0.20765888965447787, 0.26626828763714755, 0.20158363341931895, 0.3589216926873758, -0.3799090717758598, -0.27172802826068526, 0.07989455576552527, 0.12551933128450965, 0.11607479506959047, -0.03743416196415763, -0.28955591824548, 0.08862106376167002, -0.18348150491586018, -0.029603963611840173, -0.18154312685003568, -0.056102271146815395, -0.0023293530022532776, -0.24999479040310815, 0.04076843345116278, 0.08615963829376189, 0.0634444095841649, -0.0476219911545772, -0.17205106447739849, 0.06455507331752572, 0.10960801331454824, 0.07046956155160121, 0.06374680129971741, 0.11905916259977324, -0.15626922934155527, -0.15732076276607554, 0.33476940171536185, -0.10894071579236408, -0.1967827459058628, 0.2047249921019478, 0.017955682327135885, -0.17558408706481088, 0.08030847219172223, 0.20278555554947977, 0.13910021139629955, -0.17868238343568196, 0.03728201595046718, -0.05741145278744657, 0.11057946937447735, 0.007191599549019131, 0.032189036497509045, 0.13490615217015148, 0.2722573963861013, 0.08743565525891708, 0.13792932564834262, -0.11399361566511979, -0.08763995205598145, -0.19629307572954688, -0.10771878370372899, -0.1796840341111388, -0.011673848420092515, -0.06667729484786455, -0.1294650540687144, 0.39040668800408984, 0.20123200611821537, 0.2067856688951624, 0.11431594599632482, 0.3590702498267437, 0.0780908447039988, 0.1280532827279691, 0.0944488528762655, 0.26298104227873786, 0.08187592326149601, 0.08091529519056323, -0.15402556727399472, 0.08458652230108092, 0.11043520397506654] |
1,802.09032 | A note on Engel elements in the first Grigorchuk group | Let $\Gamma$ be the first Grigorchuk group. According to a result of
Bartholdi, the only left Engel elements of $\Gamma$ are the involutions. This
implies that the set of left Engel elements of $\Gamma$ is not a subgroup. Of
particular interest is to wonder whether this happens also for the sets of
bounded left Engel elements, right Engel elements, and bounded right Engel
elements of $\Gamma$. Motivated by this, we prove that these three subsets of
$\Gamma$ coincide with the identity subgroup.
| math.GR | let gamma be the first grigorchuk group according to a result of bartholdi the only left engel elements of gamma are the involutions this implies that the set of left engel elements of gamma is not a subgroup of particular interest is to wonder whether this happens also for the sets of bounded left engel elements right engel elements and bounded right engel elements of gamma motivated by this we prove that these three subsets of gamma coincide with the identity subgroup | [['let', 'gamma', 'be', 'the', 'first', 'grigorchuk', 'group', 'according', 'to', 'a', 'result', 'of', 'bartholdi', 'the', 'only', 'left', 'engel', 'elements', 'of', 'gamma', 'are', 'the', 'involutions', 'this', 'implies', 'that', 'the', 'set', 'of', 'left', 'engel', 'elements', 'of', 'gamma', 'is', 'not', 'a', 'subgroup', 'of', 'particular', 'interest', 'is', 'to', 'wonder', 'whether', 'this', 'happens', 'also', 'for', 'the', 'sets', 'of', 'bounded', 'left', 'engel', 'elements', 'right', 'engel', 'elements', 'and', 'bounded', 'right', 'engel', 'elements', 'of', 'gamma', 'motivated', 'by', 'this', 'we', 'prove', 'that', 'these', 'three', 'subsets', 'of', 'gamma', 'coincide', 'with', 'the', 'identity', 'subgroup']] | [-0.15243791612773772, 0.16292068697284998, -0.045665927163166246, 0.009882169586844833, -0.11294634372177648, -0.1250511419436917, 0.0585253911161023, 0.38370562608285647, -0.3840292257642964, -0.1820422490979204, 0.0788927728100112, -0.31600715467570034, -0.07346445301593077, 0.1851073641730359, -0.15026001222204508, -0.03991197750381217, 0.03766690123053949, 0.17294117551660393, -0.04371382719723553, -0.23330088140494076, 0.3989305986863811, -0.0683222348097621, 0.15329749770916817, 0.019238278860362563, 0.056608959992711504, -0.07051102022027098, -0.04578627841887859, -0.03431909855694024, -0.13028211653798324, 0.12335225380957127, 0.24901695644891844, 0.10841394419974942, 0.23390929905197969, -0.34332179037354343, -0.10735887907752086, 0.2525604117900224, 0.16072881644841555, -0.11682278832148124, -0.0644914243943853, -0.3014909001748736, 0.18060164725998554, -0.1408946748550345, -0.1780976169549565, 0.01676806154456444, 0.1356336069406896, 0.0011760827903522224, -0.25485131959430873, 0.012224491614289014, 0.15559754050450353, 0.057756976553852236, 0.007242601489784514, -0.10582644012529493, -0.04172261469009355, 0.1373494290065293, 0.04568319579745393, 0.028930171693834227, 0.07330922670264887, -0.02701170985848166, -0.08180023256757456, 0.45873092664632853, -0.005823696600046099, -0.21447956447330555, 0.07183749449053188, -0.24067696016395418, -0.1950062277170307, 0.07711372019087033, 0.03549767053890519, 0.12283253899162136, -0.0952404618700512, 0.2523078694818939, -0.20226667181974867, 0.10179700390095027, 0.13644654398625036, -0.07086981813673203, 0.07897746505034042, 0.08211680799552308, 0.0722136188684622, 0.012466569849937336, 0.07345111445501083, 0.1330888955229212, -0.37572352610324034, -0.18978758800275078, -0.10789622941690429, 0.1276296981155699, -0.07184510136278, -0.21330996893528031, 0.4002540184911795, 0.08461023061876981, 0.16187122775378024, 0.0623206876746447, 0.16407059850852665, 0.052465588886684046, -0.004605106549428367, 0.10475880698096461, 0.0848801369528945, 0.2016218896151702, -0.1236584850745957, -0.1625436503814942, 0.07421904164025696, 0.17192056474223358] |
1,802.09033 | Discovery of Intrinsic Ferromagnetic Ferroelectricity in Transition
Metal Halides Monolayer | The realization of multiferroics in nanostructures, combined with a large
electric dipole and ferromagnetic ordering, could lead to new applications,
such as high-density multi-state data storage. Although multiferroics have been
broadly studied for decades, ferromagnetic ferroelectricity is rarely explored,
especially in two-dimensional (2D) systems. Here we report the discovery of 2D
ferromagnetic ferroelectricity in layered transition metal halide systems. On
the basis of first-principles calculations, we reveal that charged CrBr3
monolayer exhibits in-plane multiferroicity, which is ensured by the
combination of orbital and charge ordering as realized by the asymmetric
Jahn-Teller distortions of octahedral Cr-Br6 units. As an example, we further
show that (CrBr3)2Li is a ferromagnetic ferroelectric multiferroic. The
explored phenomena and mechanism of multiferroics in this 2D system are not
only useful for fundamental research in multiferroics but also enable a wide
range of applications in nano-devices.
| cond-mat.mtrl-sci | the realization of multiferroics in nanostructures combined with a large electric dipole and ferromagnetic ordering could lead to new applications such as highdensity multistate data storage although multiferroics have been broadly studied for decades ferromagnetic ferroelectricity is rarely explored especially in twodimensional 2d systems here we report the discovery of 2d ferromagnetic ferroelectricity in layered transition metal halide systems on the basis of firstprinciples calculations we reveal that charged crbr3 monolayer exhibits inplane multiferroicity which is ensured by the combination of orbital and charge ordering as realized by the asymmetric jahnteller distortions of octahedral crbr6 units as an example we further show that crbr32li is a ferromagnetic ferroelectric multiferroic the explored phenomena and mechanism of multiferroics in this 2d system are not only useful for fundamental research in multiferroics but also enable a wide range of applications in nanodevices | [['the', 'realization', 'of', 'multiferroics', 'in', 'nanostructures', 'combined', 'with', 'a', 'large', 'electric', 'dipole', 'and', 'ferromagnetic', 'ordering', 'could', 'lead', 'to', 'new', 'applications', 'such', 'as', 'highdensity', 'multistate', 'data', 'storage', 'although', 'multiferroics', 'have', 'been', 'broadly', 'studied', 'for', 'decades', 'ferromagnetic', 'ferroelectricity', 'is', 'rarely', 'explored', 'especially', 'in', 'twodimensional', '2d', 'systems', 'here', 'we', 'report', 'the', 'discovery', 'of', '2d', 'ferromagnetic', 'ferroelectricity', 'in', 'layered', 'transition', 'metal', 'halide', 'systems', 'on', 'the', 'basis', 'of', 'firstprinciples', 'calculations', 'we', 'reveal', 'that', 'charged', 'crbr3', 'monolayer', 'exhibits', 'inplane', 'multiferroicity', 'which', 'is', 'ensured', 'by', 'the', 'combination', 'of', 'orbital', 'and', 'charge', 'ordering', 'as', 'realized', 'by', 'the', 'asymmetric', 'jahnteller', 'distortions', 'of', 'octahedral', 'crbr6', 'units', 'as', 'an', 'example', 'we', 'further', 'show', 'that', 'crbr32li', 'is', 'a', 'ferromagnetic', 'ferroelectric', 'multiferroic', 'the', 'explored', 'phenomena', 'and', 'mechanism', 'of', 'multiferroics', 'in', 'this', '2d', 'system', 'are', 'not', 'only', 'useful', 'for', 'fundamental', 'research', 'in', 'multiferroics', 'but', 'also', 'enable', 'a', 'wide', 'range', 'of', 'applications', 'in', 'nanodevices']] | [-0.1924007514251199, 0.17514780071068192, 0.03675786174160775, -0.011741128136628191, -0.09667268551947264, -0.16211187334078617, 0.06457491176726338, 0.4585225881641581, -0.2591833572590003, -0.25019543173376224, 0.033022199952838956, -0.26655650473995146, -0.2091469473994072, 0.20955469539171478, 0.030825080778313814, 0.028139523559132674, -0.037178668319281655, -0.09851400682321974, -0.10261704814518346, -0.16924076103264368, 0.21429760339092055, -0.012334164602505247, 0.3241624461357774, 0.08249750606933215, 0.05342113322163694, -0.020443626915709705, 0.16975153104001045, 0.05008900513614181, -0.16131923857272898, 0.09644692014549336, 0.29739272956104174, -0.0708010452272656, 0.21303690357106556, -0.45385607525733485, -0.26396824853889045, 0.002316984074380602, 0.15023971798219615, 0.171355115320282, -0.1769236242441107, -0.27099036452883896, 0.09478733696070683, -0.1837671535689958, -0.08178595355546177, -0.18845003422512843, 0.0032297039615248675, 0.0480347923580965, -0.24714400324236302, 0.05057221926883863, 0.10280701197491768, 0.15350052481299448, -0.11290058524375034, -0.15736647540564058, -0.04471183619563923, 0.01827404955334037, 0.06200705416480175, 0.037263596188243014, 0.1325866438348159, -0.11035030114423675, -0.19110380818074854, 0.44354915300071457, 0.012397618904832179, -0.07540575706529139, 0.17092962665687295, -0.18796871404714174, -0.13769924315372414, 0.11712665142776975, 0.16230799165982618, 0.12339479358268589, -0.17747063354255943, 0.10607816196891418, -0.0010547896731988166, 0.164900211229866, 0.0035920624577025647, 0.12596079127278423, 0.31361552604548903, 0.26751915057594244, 0.03682583577533246, 0.14461054838514023, -0.07382303905795688, -0.05389748705571422, -0.164813764835198, -0.19117535009171244, -0.2384991521936889, 0.030974757983489472, -0.04948373766665697, -0.2100859577257703, 0.3677798421631982, 0.15358333262091461, 0.12382928391469873, -0.15681888577001454, 0.20955000402079554, 0.04335429454579215, 0.11540076164800646, -0.046373152289621154, 0.2964563569220558, 0.15534713405803063, 0.16661127138352633, -0.22416499084759042, 0.11772585265511769, -0.02876447611675346] |
1,802.09034 | Resonant and off-resonant microwave signal manipulation in coupled
superconducting resonators | We present an experimental demonstration as well as a theoretical model of an
integrated circuit designed for the manipulation of a microwave field down to
the single-photon level. The device is made of a superconducting resonator
coupled to a transmission line via a second frequency-tunable resonator. The
tunable resonator can be used as a tunable coupler between the fixed resonator
and the transmission line. Moreover, the manipulation of the microwave field
between the two resonators is possible. In particular, we demonstrate the
swapping of the field from one resonator to the other by pulsing the frequency
detuning between the two resonators. The behavior of the system, which
determines how the device can be operated, is analyzed as a function of one key
parameter of the system, the damping ratio of the coupled resonators. We show a
good agreement between experiments and simulations, realized by solving a set
of coupled differential equations.
| cond-mat.mes-hall cond-mat.supr-con quant-ph | we present an experimental demonstration as well as a theoretical model of an integrated circuit designed for the manipulation of a microwave field down to the singlephoton level the device is made of a superconducting resonator coupled to a transmission line via a second frequencytunable resonator the tunable resonator can be used as a tunable coupler between the fixed resonator and the transmission line moreover the manipulation of the microwave field between the two resonators is possible in particular we demonstrate the swapping of the field from one resonator to the other by pulsing the frequency detuning between the two resonators the behavior of the system which determines how the device can be operated is analyzed as a function of one key parameter of the system the damping ratio of the coupled resonators we show a good agreement between experiments and simulations realized by solving a set of coupled differential equations | [['we', 'present', 'an', 'experimental', 'demonstration', 'as', 'well', 'as', 'a', 'theoretical', 'model', 'of', 'an', 'integrated', 'circuit', 'designed', 'for', 'the', 'manipulation', 'of', 'a', 'microwave', 'field', 'down', 'to', 'the', 'singlephoton', 'level', 'the', 'device', 'is', 'made', 'of', 'a', 'superconducting', 'resonator', 'coupled', 'to', 'a', 'transmission', 'line', 'via', 'a', 'second', 'frequencytunable', 'resonator', 'the', 'tunable', 'resonator', 'can', 'be', 'used', 'as', 'a', 'tunable', 'coupler', 'between', 'the', 'fixed', 'resonator', 'and', 'the', 'transmission', 'line', 'moreover', 'the', 'manipulation', 'of', 'the', 'microwave', 'field', 'between', 'the', 'two', 'resonators', 'is', 'possible', 'in', 'particular', 'we', 'demonstrate', 'the', 'swapping', 'of', 'the', 'field', 'from', 'one', 'resonator', 'to', 'the', 'other', 'by', 'pulsing', 'the', 'frequency', 'detuning', 'between', 'the', 'two', 'resonators', 'the', 'behavior', 'of', 'the', 'system', 'which', 'determines', 'how', 'the', 'device', 'can', 'be', 'operated', 'is', 'analyzed', 'as', 'a', 'function', 'of', 'one', 'key', 'parameter', 'of', 'the', 'system', 'the', 'damping', 'ratio', 'of', 'the', 'coupled', 'resonators', 'we', 'show', 'a', 'good', 'agreement', 'between', 'experiments', 'and', 'simulations', 'realized', 'by', 'solving', 'a', 'set', 'of', 'coupled', 'differential', 'equations']] | [-0.20451866762422716, 0.11251349026350373, -0.03336442543798133, -0.06147924437579261, -0.032579764441605534, -0.19928985740064292, 0.041901697410850335, 0.3965508220717311, -0.23346020182014893, -0.3091241311133895, 0.050695498758812886, -0.2739414596646432, -0.12302007623917319, 0.29078741381345746, 0.02052626555202689, 0.07628259828178496, 0.011471594998378628, 0.010737239626785185, -0.010900522724475514, -0.15497168969819383, 0.29370999417039534, 0.06885494886965349, 0.3232788889428342, 0.026408366636922028, 0.1531310108681487, -0.05278084712682773, 0.0726074287637032, 0.009634978992136702, -0.09128600933792576, 0.10319547605583605, 0.23889247274538195, 0.037918161859871534, 0.2621885117094051, -0.4338070957841265, -0.17419019912289369, 0.06125203724827198, 0.15625894609807886, 0.13712847994452354, -0.0228582505716492, -0.2741187554321542, 0.01719750084032286, -0.16208130662138295, -0.10790030484007584, -0.03570879252306772, -0.05535889244314579, 0.03161158540828881, -0.2715745464041336, -0.03076471165840249, 0.019770450419006217, 0.04124391234991764, -0.006450650945231812, 0.004976578434583861, -0.010871325909400618, 0.11329073028790068, -0.06912580572935254, -0.00895427032940503, 0.17066600398216025, -0.12527135146214374, -0.13068749907963126, 0.35411252502031276, -0.1255819399121051, -0.1617994529398664, 0.13365056473046344, -0.11094499047497126, 0.014442356411268972, 0.08027563935503462, 0.15324492184506938, 0.08849747964359869, -0.14980156662556288, 0.025467005224485223, -0.013786885449477773, 0.2523074373602867, 0.08466966387766432, 0.049669237143931746, 0.239420708614272, 0.2143885770192777, 0.04754814913608935, 0.20673663067609838, -0.07739666328127096, -0.030279227878223017, -0.32568526649169177, -0.15295057327468073, -0.21136836572442302, 0.04088559598100699, -0.08455106556328439, -0.15544249439945088, 0.429643735795325, 0.14192187044744856, 0.21569240816085544, -0.05104831739911649, 0.33288248860283404, 0.17770919375461203, 0.0827855903359241, -0.018456089590978345, 0.3108702614650574, 0.20339584567534755, 0.08514235784848596, -0.3275565820260803, -0.017302115518747774, -0.04354675462013049] |
1,802.09035 | Retrodirective Large Antenna Energy Beamforming in Backscatter
Multi-User Networks | In this letter, we study a new technique for energy beamforming (EB) in
multi-user networks, which combines large antenna retrodirectivity at the
transmitter side with signal backscattering at the energy receivers. The
proposed technique has low complexity and achieves EB without any active
operation at the receivers or complicated signal processing techniques at the
transmitter. Since the average harvested energy depends on the backscattering
coefficients, we investigate different reflection policies for various design
objectives. The proposed policies are analyzed from a system level standpoint
by taking into account spatial randomness.
| cs.IT math.IT | in this letter we study a new technique for energy beamforming eb in multiuser networks which combines large antenna retrodirectivity at the transmitter side with signal backscattering at the energy receivers the proposed technique has low complexity and achieves eb without any active operation at the receivers or complicated signal processing techniques at the transmitter since the average harvested energy depends on the backscattering coefficients we investigate different reflection policies for various design objectives the proposed policies are analyzed from a system level standpoint by taking into account spatial randomness | [['in', 'this', 'letter', 'we', 'study', 'a', 'new', 'technique', 'for', 'energy', 'beamforming', 'eb', 'in', 'multiuser', 'networks', 'which', 'combines', 'large', 'antenna', 'retrodirectivity', 'at', 'the', 'transmitter', 'side', 'with', 'signal', 'backscattering', 'at', 'the', 'energy', 'receivers', 'the', 'proposed', 'technique', 'has', 'low', 'complexity', 'and', 'achieves', 'eb', 'without', 'any', 'active', 'operation', 'at', 'the', 'receivers', 'or', 'complicated', 'signal', 'processing', 'techniques', 'at', 'the', 'transmitter', 'since', 'the', 'average', 'harvested', 'energy', 'depends', 'on', 'the', 'backscattering', 'coefficients', 'we', 'investigate', 'different', 'reflection', 'policies', 'for', 'various', 'design', 'objectives', 'the', 'proposed', 'policies', 'are', 'analyzed', 'from', 'a', 'system', 'level', 'standpoint', 'by', 'taking', 'into', 'account', 'spatial', 'randomness']] | [-0.2005587580477756, 0.05779953364785133, -0.05922112509273411, 0.04502356528916679, -0.05495239513026278, -0.23643407877534628, 0.08505396402618859, 0.39420489811997733, -0.261338175284896, -0.3014391316414884, 0.07470406610466372, -0.2659123357741183, -0.13063212865806614, 0.1573562917242015, -0.06978747001692151, 0.04402101821896589, 0.029549597385810332, 0.01861675343936665, -0.026871729448563263, -0.20192292669861253, 0.31069220470662195, 0.15998723632080503, 0.4002510240573562, 0.03146281688254368, 0.17864334205521293, 0.06646237889137328, -0.00866992702561148, -0.043882309794007396, -0.09623118117451668, 0.03947330851714765, 0.3126815692678596, 0.17141738715398472, 0.2593686357140541, -0.4182418048214377, -0.2411036145810582, 0.07761727283012876, 0.09746821602385261, 0.11901841714868343, -0.06527080768954763, -0.25473648638286617, 0.11198972048907635, -0.15553737902658038, -0.007817165947027421, 0.010589350046317898, -0.11032360996213857, 0.019127737288624887, -0.33225986317553546, 0.001318478538246637, 0.00994066565475437, 0.06067370653696609, -0.06627654381033578, -0.16815569562957822, 0.01672663783073802, 0.13952818853267876, 0.025626248512626362, -0.05303116034804006, 0.10677530129147128, -0.0761038563580493, -0.11938994992629029, 0.3391701124681767, 0.0018221875469545635, -0.18406230870508747, 0.15557467661212, -0.138553282609628, -0.1198720270349236, 0.2188470698303227, 0.27976174364023415, 0.031004786941358883, -0.1763161194060793, 0.06820841470773834, 0.05839006439521072, 0.1955309271854296, 0.10357739938831145, 0.1299703060492371, 0.17252385637231088, 0.18042902264278382, 0.12267861713058828, 0.15554717476113458, -0.1468225160503781, -0.039811753296408424, -0.2144725142318881, -0.07917256396933553, -0.2478178815047644, 0.001784602983258246, -0.09147411345728552, -0.007535477121768708, 0.3744033220946119, 0.13200040291890167, 0.10997316530078985, 0.07919808823662403, 0.4492102413113867, 0.150949075859919, 0.07617561813192757, 0.1320504507081311, 0.230913181916099, 0.07697120245305424, 0.16668878882414442, -0.2379681717753515, 0.0495778750105018, -0.02258216452345336] |
1,802.09036 | Towards Automatic SAR-Optical Stereogrammetry over Urban Areas using
Very High Resolution Imagery | In this paper we discuss the potential and challenges regarding SAR-optical
stereogrammetry for urban areas, using very-high-resolution (VHR) remote
sensing imagery. Since we do this mainly from a geometrical point of view, we
first analyze the height reconstruction accuracy to be expected for different
stereogrammetric configurations. Then, we propose a strategy for simultaneous
tie point matching and 3D reconstruction, which exploits an epipolar-like
search window constraint. To drive the matching and ensure some robustness, we
combine different established handcrafted similarity measures. For the
experiments, we use real test data acquired by the Worldview-2, TerraSAR-X and
MEMPHIS sensors. Our results show that SAR-optical stereogrammetry using VHR
imagery is generally feasible with 3D positioning accuracies in the
meter-domain, although the matching of these strongly hetereogeneous
multi-sensor data remains very challenging. Keywords: Synthetic Aperture Radar
(SAR), optical images, remote sensing, data fusion, stereogrammetry
| eess.IV | in this paper we discuss the potential and challenges regarding saroptical stereogrammetry for urban areas using veryhighresolution vhr remote sensing imagery since we do this mainly from a geometrical point of view we first analyze the height reconstruction accuracy to be expected for different stereogrammetric configurations then we propose a strategy for simultaneous tie point matching and 3d reconstruction which exploits an epipolarlike search window constraint to drive the matching and ensure some robustness we combine different established handcrafted similarity measures for the experiments we use real test data acquired by the worldview2 terrasarx and memphis sensors our results show that saroptical stereogrammetry using vhr imagery is generally feasible with 3d positioning accuracies in the meterdomain although the matching of these strongly hetereogeneous multisensor data remains very challenging keywords synthetic aperture radar sar optical images remote sensing data fusion stereogrammetry | [['in', 'this', 'paper', 'we', 'discuss', 'the', 'potential', 'and', 'challenges', 'regarding', 'saroptical', 'stereogrammetry', 'for', 'urban', 'areas', 'using', 'veryhighresolution', 'vhr', 'remote', 'sensing', 'imagery', 'since', 'we', 'do', 'this', 'mainly', 'from', 'a', 'geometrical', 'point', 'of', 'view', 'we', 'first', 'analyze', 'the', 'height', 'reconstruction', 'accuracy', 'to', 'be', 'expected', 'for', 'different', 'stereogrammetric', 'configurations', 'then', 'we', 'propose', 'a', 'strategy', 'for', 'simultaneous', 'tie', 'point', 'matching', 'and', '3d', 'reconstruction', 'which', 'exploits', 'an', 'epipolarlike', 'search', 'window', 'constraint', 'to', 'drive', 'the', 'matching', 'and', 'ensure', 'some', 'robustness', 'we', 'combine', 'different', 'established', 'handcrafted', 'similarity', 'measures', 'for', 'the', 'experiments', 'we', 'use', 'real', 'test', 'data', 'acquired', 'by', 'the', 'worldview2', 'terrasarx', 'and', 'memphis', 'sensors', 'our', 'results', 'show', 'that', 'saroptical', 'stereogrammetry', 'using', 'vhr', 'imagery', 'is', 'generally', 'feasible', 'with', '3d', 'positioning', 'accuracies', 'in', 'the', 'meterdomain', 'although', 'the', 'matching', 'of', 'these', 'strongly', 'hetereogeneous', 'multisensor', 'data', 'remains', 'very', 'challenging', 'keywords', 'synthetic', 'aperture', 'radar', 'sar', 'optical', 'images', 'remote', 'sensing', 'data', 'fusion', 'stereogrammetry']] | [-0.06308820698220241, 0.009048150216425284, -0.0680594389161396, 0.04244897618413875, -0.05836609487339635, -0.13888472891994752, 0.04090823579035179, 0.44697488025378657, -0.25320944035261433, -0.33973540295161964, 0.16578453467124799, -0.26456979107495177, -0.18651135053026818, 0.19909326966958094, -0.16165229947278825, 0.10304599078646039, 0.12445707224062919, -0.013167615206090404, -0.06324357133160126, -0.18875503055203488, 0.2846476431130962, 0.06328906170914278, 0.3684633232324439, 0.028475226560497984, 0.11726237953938407, 0.03563064421177842, -0.08608425045617075, 0.015753428804386845, -0.09266649150514936, 0.15309295922120594, 0.293229277475107, 0.21135860652087585, 0.20812854270094677, -0.4187885708969963, -0.20943620284635792, 0.08617745960295639, 0.12828714691910564, 0.08958203683740816, -0.13257871723608866, -0.34839901100734577, 0.07945462123162168, -0.1001335533852826, -0.0559098490724436, -0.09891911898054839, -0.02514432259640136, 0.003211756752588211, -0.32083093723186346, 0.017534454882158625, -0.0376738446239495, 0.11801926228765618, -0.10167345172992688, -0.08373858553001329, 0.035244097397320304, 0.1884428553594797, -0.026058444381787386, 0.0190479779146913, 0.12878924797576688, -0.15320141933625564, -0.11122720739941168, 0.3935840605580084, -0.010891195843749516, -0.15579990583458259, 0.22561798170071973, -0.10067822618464775, -0.15519864716471227, 0.09542191720238942, 0.20596087443717645, 0.10326426040538696, -0.15123918176665457, 0.01760306686286212, -0.050502835499013174, 0.1579270352329545, 0.08417251591762419, 0.018328996683361336, 0.18665138868998518, 0.19056880046606667, 0.07682797185706851, 0.10887818161298878, -0.2455395794583156, -0.01776130426921608, -0.19286125229144305, -0.0995773521854597, -0.2082410935939098, -0.041762712100000286, -0.0846508843203671, -0.10019693565417957, 0.36090357448933097, 0.24916738493244767, 0.2031993268756196, 0.05122375294569578, 0.3872712173444383, 0.03306143730622031, 0.05562001441071248, 0.0358493185348754, 0.2250213706123331, 0.013741953640847522, 0.13506287086398944, -0.16414293397375493, -0.016756758376312277, 0.007910125611541682] |
1,802.09037 | Reflection Positivity---A Representation Theoretic Perspective | Refection Positivity is a central theme at the crossroads of Lie group
representations, euclidean and abstract harmonic analysis, constructive quantum
field theory, and stochastic processes. This book provides the first
presentation of the representation theoretic aspects of Refection Positivity
and discusses its connections to those different fields on a level suitable for
doctoral students and researchers in related fields.
| math.RT math-ph math.MP math.OA | refection positivity is a central theme at the crossroads of lie group representations euclidean and abstract harmonic analysis constructive quantum field theory and stochastic processes this book provides the first presentation of the representation theoretic aspects of refection positivity and discusses its connections to those different fields on a level suitable for doctoral students and researchers in related fields | [['refection', 'positivity', 'is', 'a', 'central', 'theme', 'at', 'the', 'crossroads', 'of', 'lie', 'group', 'representations', 'euclidean', 'and', 'abstract', 'harmonic', 'analysis', 'constructive', 'quantum', 'field', 'theory', 'and', 'stochastic', 'processes', 'this', 'book', 'provides', 'the', 'first', 'presentation', 'of', 'the', 'representation', 'theoretic', 'aspects', 'of', 'refection', 'positivity', 'and', 'discusses', 'its', 'connections', 'to', 'those', 'different', 'fields', 'on', 'a', 'level', 'suitable', 'for', 'doctoral', 'students', 'and', 'researchers', 'in', 'related', 'fields']] | [-0.12297174532629424, 0.08913508748982922, -0.13954466107790753, 0.11384488760604192, -0.1463957282130496, -0.10371972507623545, 0.03337234220175483, 0.308313826209534, -0.2710295501086166, -0.2568692310508025, 0.09228880601437857, -0.26033939193871064, -0.19103218678195596, 0.16578016509065183, -0.1205072481564041, -0.006888444173362864, 0.012081294273168354, 0.10199257838776556, -0.061628571991666645, -0.2598722916317441, 0.37117700772044265, 0.04722222845835643, 0.29838777537520783, 0.07587695534533911, 0.13426329156949177, 0.05640465602026147, -0.09425757173448801, -0.0367946009885646, -0.11090476226882409, 0.2154609802439493, 0.34793002086186436, 0.1397844591430562, 0.3105876822206113, -0.4180748445313361, -0.15873903935475242, 0.043821083239705884, 0.06339256834757703, 0.06621266427939221, -0.04671353099559891, -0.30872725916363425, 0.0574502696567294, -0.11730413066254834, -0.13017196693532643, -0.05548995665976999, 0.010032950768294602, -0.015901289517217775, -0.1606106622049869, 0.03172921077585069, 0.08869795806279754, 0.1987877143941567, -0.04337669153090061, -0.12163069624536654, 0.05222712516374255, 0.14240534537298194, 0.00809366121430392, 0.04060468195900084, 0.1495383649875047, -0.17227555160663263, -0.1740255378249843, 0.38305004592984915, 0.0074944720856087695, -0.1724103120613401, 0.2164787323175514, -0.143206388863214, -0.19472303961293172, 0.05417098932094493, 0.18075870160581703, 0.08366927633188286, -0.1284104109568111, 0.17566867559059066, -0.006787293511679617, 0.07327936022045185, 0.07703835761837535, 0.0253730874224487, 0.19513460623605525, 0.09956384836932865, 0.04987246582631843, 0.10136303948080641, 0.08578813939860438, -0.15946147224660648, -0.36237667854559624, -0.194034537979228, -0.10022867047543621, 0.049771248822700294, -0.07920376443347531, -0.1409913372974527, 0.4419869636185467, 0.11631013302258768, 0.10103430037023657, 0.033956788922265425, 0.2378617788080947, 0.12157991912089668, 0.017256505842620538, 0.03317962985454222, 0.13794725786073733, 0.2839495154192387, 0.1313019004034794, -0.10333129824375954, -0.0425762811762486, 0.1373940278633924] |
1,802.09038 | Random walks in doubly random scenery | We provide a random walk in random scenery representation of a new class of
stable self-similar processes with stationary increments introduced recently by
Jung, Owada and Samorodnitsky. In the functional limit theorem they provided,
only a single instance of this class arose as a limit. We construct a model in
which a significant portion of processes in this new class is obtained as a
limit.
| math.PR | we provide a random walk in random scenery representation of a new class of stable selfsimilar processes with stationary increments introduced recently by jung owada and samorodnitsky in the functional limit theorem they provided only a single instance of this class arose as a limit we construct a model in which a significant portion of processes in this new class is obtained as a limit | [['we', 'provide', 'a', 'random', 'walk', 'in', 'random', 'scenery', 'representation', 'of', 'a', 'new', 'class', 'of', 'stable', 'selfsimilar', 'processes', 'with', 'stationary', 'increments', 'introduced', 'recently', 'by', 'jung', 'owada', 'and', 'samorodnitsky', 'in', 'the', 'functional', 'limit', 'theorem', 'they', 'provided', 'only', 'a', 'single', 'instance', 'of', 'this', 'class', 'arose', 'as', 'a', 'limit', 'we', 'construct', 'a', 'model', 'in', 'which', 'a', 'significant', 'portion', 'of', 'processes', 'in', 'this', 'new', 'class', 'is', 'obtained', 'as', 'a', 'limit']] | [-0.08947492381776101, 0.13127584194444353, -0.13015973940491676, 0.060612411025431356, -0.03193812566314591, -0.10360904483968625, 0.12212004662433174, 0.3188591764192097, -0.26183820638107136, -0.22334523934841854, 0.10443905767533579, -0.2224693925018073, -0.17340077624976402, 0.19540761303142062, -0.10438215900649084, 0.06566683543496765, 0.05592905743105803, 0.022060210085783183, 0.0031329905814345693, -0.1930208618141478, 0.28202337700349744, -0.005361033166991547, 0.2386237846367294, -0.006926846086571459, 0.14988384395837784, 0.02885765457904199, -0.032118989371156204, 0.06818247980845626, -0.11642774382198695, 0.1263543259119615, 0.20698269282729598, 0.056475825258530676, 0.32877463882323354, -0.34142751488252543, -0.2696209818968782, 0.15132276281656232, 0.10021601033804473, 0.11969549276363978, -0.0929541739897104, -0.3169968845322728, 0.09460722392395837, -0.1939851236602408, -0.15694886052369839, -0.04430487188801635, 0.06268074832041748, 0.04081766842864454, -0.31223702980787493, 0.0557085300606559, 0.15773175316280685, 0.022360806207871065, 0.0015739338559797034, -0.0646495006076293, 0.023022900859359652, 0.09584743658342632, 0.00422834438541031, 0.038441995820903685, 0.07198130513279466, -0.11105491437774617, -0.1603522262739716, 0.35736760002328083, -0.1271998977608746, -0.22944713570177555, 0.18235131684923545, -0.14954266085260315, -0.2417877874977421, 0.11793351880623959, 0.1816782425303245, 0.1631138357988675, -0.1946108905103756, 0.13959481807160046, -0.1293550340560614, 0.08728472236543894, 0.05040327023016289, 0.019040833270992152, 0.1609455775396782, 0.17963866578793386, 0.0617814948054729, 0.1855359734618105, -0.05306254949391587, -0.12623489413090283, -0.3248636937059928, -0.16068003471809789, -0.19956106779864058, 0.1271028271294199, -0.09177524505480505, -0.24313469929620624, 0.37480129998584744, 0.11774871439411072, 0.22760288673453033, 0.10707370370982972, 0.16550801207267796, 0.15985218315836391, 0.013769470853731036, 0.09045352413704677, 0.14946723204047885, 0.15249199406025582, 0.10414543682418298, -0.029526459533371963, 0.05113339730814914, 0.12044153857277706] |
1,802.09039 | Flag bundles, Segre polynomials and push-forwards | In this note, we give Gysin formulas for partial flag bundles for the
classical groups. We then give Gysin formulas for Schubert varieties in
Grassmann bundles, including isotropic ones. All these formulas are proved in a
rather uniform way by using the step-by-step construction of flag bundles and
the Gysin formula for a projective bundle. In this way we obtain a
comprehensive list of new universal formulas.
| math.AG | in this note we give gysin formulas for partial flag bundles for the classical groups we then give gysin formulas for schubert varieties in grassmann bundles including isotropic ones all these formulas are proved in a rather uniform way by using the stepbystep construction of flag bundles and the gysin formula for a projective bundle in this way we obtain a comprehensive list of new universal formulas | [['in', 'this', 'note', 'we', 'give', 'gysin', 'formulas', 'for', 'partial', 'flag', 'bundles', 'for', 'the', 'classical', 'groups', 'we', 'then', 'give', 'gysin', 'formulas', 'for', 'schubert', 'varieties', 'in', 'grassmann', 'bundles', 'including', 'isotropic', 'ones', 'all', 'these', 'formulas', 'are', 'proved', 'in', 'a', 'rather', 'uniform', 'way', 'by', 'using', 'the', 'stepbystep', 'construction', 'of', 'flag', 'bundles', 'and', 'the', 'gysin', 'formula', 'for', 'a', 'projective', 'bundle', 'in', 'this', 'way', 'we', 'obtain', 'a', 'comprehensive', 'list', 'of', 'new', 'universal', 'formulas']] | [-0.17677610592722004, 0.004743963689369552, -0.08884750092541104, 0.10623655081448603, -0.14766113676214174, -0.1481903707122069, 0.043768397323898416, 0.39014177224529323, -0.2724449409922557, -0.20128540321142038, 0.07518654893267093, -0.16034491461659992, -0.19909452117367912, 0.26851488199474205, -0.16438238067924282, -0.025065720004877494, 0.041391364653219485, 0.04964810929525254, -0.14883237644863218, -0.27488162727512194, 0.4264271252079686, -0.06088749649447959, 0.23868500273118712, 0.0698303287265016, 0.10879826639542606, 0.01789800703886952, -0.04725142282002898, -0.05393095581389185, -0.2090605226373161, 0.1891278169159569, 0.3713002318148015, 0.10755444393117926, 0.12759673714971365, -0.4296028514517777, -0.09217631440816461, 0.18531340171944405, 0.14733786579680197, 0.13439766717935675, -0.01547950674404404, -0.2434052106465644, 0.051472042909642655, -0.16670566681188656, -0.17645532702123606, -0.16413540348633013, 0.07706611328271788, 0.05739285331219435, -0.2115307545859311, -0.03594121031824555, 0.1283383607906081, 0.16793422056570537, -0.08444482215277072, -0.14323890359321637, 0.014978916731788151, 0.06905430182119582, -0.05622981319120571, -0.027539086681026132, 0.06040225377473146, -0.0610506866516462, -0.18164532543368525, 0.34750733495370223, -0.05334092180397528, -0.2731997025713547, 0.0026499213261613206, -0.11091942481223994, -0.20800900266769884, 0.15431917622796634, 0.07055178177959995, 0.2291049838358008, -0.04052070340614265, 0.08601276548631462, -0.15077253293468437, -0.03793682611144301, 0.10118245325787965, -0.009195384861373189, 0.15079914834072342, 0.029468503363652906, 0.03804612733812919, 0.2023153561375924, 0.008052765676723932, -0.08229261045274672, -0.4114500127955159, -0.29284732141436437, -0.00730250443074741, 0.18458740044830005, -0.13600859877765492, -0.1800223781584776, 0.3986231556801654, 0.051484362892076765, 0.234424099089828, 0.23239599938379296, 0.25871154949513836, 0.03996281810938867, 0.030324254070283538, -0.0033436484579274905, 0.13996936144557462, 0.2794450406687084, 0.0072130030299078175, -0.01980016299926523, -0.025900238610581675, 0.26945885835882666] |
1,802.0904 | Quantum teleportation with infinite reference frame uncertainty and
without prior alignment | We present two new schemes for quantum teleportation between parties whose
local reference frames are misaligned by the action of a compact Lie group G.
These schemes require no prior alignment of reference frames and are unaffected
by arbitrary changes in reference frame alignment during execution, suiting
them to situations of rapid reference frame drift. Our tight scheme yields
improved purity compared to standard teleportation, in some cases substantially
--- this includes the case of qubit teleportation under arbitrary SU(2)
reference frame uncertainty--- while communicating no information about either
party's reference frame alignment at any time. Our perfect scheme performs
perfect teleportation, but does communicate some reference frame information.
The mathematical foundation of these schemes is a unitary error basis permuted
up to a phase by the conjugation action of a finite subgroup of G.
| quant-ph | we present two new schemes for quantum teleportation between parties whose local reference frames are misaligned by the action of a compact lie group g these schemes require no prior alignment of reference frames and are unaffected by arbitrary changes in reference frame alignment during execution suiting them to situations of rapid reference frame drift our tight scheme yields improved purity compared to standard teleportation in some cases substantially this includes the case of qubit teleportation under arbitrary su2 reference frame uncertainty while communicating no information about either partys reference frame alignment at any time our perfect scheme performs perfect teleportation but does communicate some reference frame information the mathematical foundation of these schemes is a unitary error basis permuted up to a phase by the conjugation action of a finite subgroup of g | [['we', 'present', 'two', 'new', 'schemes', 'for', 'quantum', 'teleportation', 'between', 'parties', 'whose', 'local', 'reference', 'frames', 'are', 'misaligned', 'by', 'the', 'action', 'of', 'a', 'compact', 'lie', 'group', 'g', 'these', 'schemes', 'require', 'no', 'prior', 'alignment', 'of', 'reference', 'frames', 'and', 'are', 'unaffected', 'by', 'arbitrary', 'changes', 'in', 'reference', 'frame', 'alignment', 'during', 'execution', 'suiting', 'them', 'to', 'situations', 'of', 'rapid', 'reference', 'frame', 'drift', 'our', 'tight', 'scheme', 'yields', 'improved', 'purity', 'compared', 'to', 'standard', 'teleportation', 'in', 'some', 'cases', 'substantially', 'this', 'includes', 'the', 'case', 'of', 'qubit', 'teleportation', 'under', 'arbitrary', 'su2', 'reference', 'frame', 'uncertainty', 'while', 'communicating', 'no', 'information', 'about', 'either', 'partys', 'reference', 'frame', 'alignment', 'at', 'any', 'time', 'our', 'perfect', 'scheme', 'performs', 'perfect', 'teleportation', 'but', 'does', 'communicate', 'some', 'reference', 'frame', 'information', 'the', 'mathematical', 'foundation', 'of', 'these', 'schemes', 'is', 'a', 'unitary', 'error', 'basis', 'permuted', 'up', 'to', 'a', 'phase', 'by', 'the', 'conjugation', 'action', 'of', 'a', 'finite', 'subgroup', 'of', 'g']] | [-0.18970575644252405, 0.09459078948903106, -0.08478017437311737, 0.026425953502697285, -0.057194146709933655, -0.22339112841204475, 0.09697743453026346, 0.4777745590406234, -0.23752612876705825, -0.29340342881241394, 0.03450628466132695, -0.19656134701556346, -0.028105826572334364, 0.1656404032768098, -0.15702554133178584, 0.07405324403974992, 0.12367017310001512, 0.11319990963466577, -0.1413737684892275, -0.2675871108797615, 0.2631645107471537, 0.07613930874069763, 0.31076665700816397, -0.10576708533726424, 0.13317511475092467, 0.0377638024562942, -0.07676190021795345, -0.04316510964234574, -0.06871167497375785, 0.08497024709042796, 0.29141051881710317, 0.1219866129555809, 0.26094580732230377, -0.395942983571996, -0.2055512256433826, 0.11033941209733264, 0.08040934815697039, 0.17343207092003535, -0.03931329557984901, -0.3232093733724957, 0.0511128027339591, -0.18979634494701428, -0.060322873172725534, -0.058410882421616295, 0.014189780244965162, -0.020836124888624744, -0.2895921986974053, 0.08015553985805765, 0.09038911017836002, 0.08050633729226998, -0.02405696470853386, -0.04320260457548577, 0.021345775025382416, 0.16019276275521896, -0.03653938350191256, 0.08331989709447736, 0.17322344601904946, -0.06099596948870249, -0.14763656217924584, 0.4320080584895088, -0.059085569493889586, -0.2639803698776401, 0.14896793323638502, -0.09717456186485629, -0.10164235658950603, 0.10879728717750299, 0.10149288407193302, 0.10574882850745942, -0.12387588571534673, 0.04962389136676732, -0.03538602195791344, 0.18829400627178822, 0.12335823441216194, 0.11258862026334643, 0.16053229231220573, 0.055527360741493864, 0.0989359929191588, 0.0829729315053338, -0.0007841699817930279, -0.11985120093171943, -0.3802063628725374, -0.1580628961752127, -0.1678074529992222, 0.026140224800181033, -0.11733123488407565, -0.07598432750482835, 0.3608185880204012, 0.11140631235190737, 0.1306763226930886, 0.041235581575545355, 0.3290843621396752, 0.002002836466565339, 0.06087404671959134, 0.11349089014336967, 0.20792892694329052, 0.11922345733541105, 0.023388568584723816, -0.1940760469630338, 0.05028139229571975, 0.06879603769282686] |
1,802.09041 | On well-posedness and uniqueness for general hierarchy equations of
Gross-Pitaevskii and Hartree type | Gross-Pitaevskii and Hartree hierarchies are infinite systems of coupled PDEs
emerging naturally from the mean field theory of Bose gases. Their solutions
are known to be related to an initial value problem, respectively the
Gross-Pitaevskii and Hartree equations. Due to their physical and mathematical
relevance, the issues of well-posedness and uniqueness for these hierarchies
have recently been studied thoroughly using specific nonlinear and
combinatorial techniques. In this article, we introduce a new approach for the
study of such hierarchy equations by firstly establishing a duality between
them and certain Liouville equations and secondly solving the uniqueness and
existence questions for the latter. As an outcome, we formulate a hierarchy
equation starting from any initial value problem which is $U(1)$-invariant and
prove a general principle which can be stated formally as follows:
(i) Uniqueness for weak solutions of an initial value problem implies the
uniqueness of solutions for the related hierarchy equation.
(ii) Existence of solutions for the initial value problem implies existence
of solutions for the related hierarchy equation.
In particular, several new well-posedness results as well as a counterexample
to uniqueness for the Gross-Pitaevskii hierarchy equation are proved. The
novelty in our work lies in the aforementioned duality and the use of Liouville
equations with powerful transport techniques extended to infinite dimensional
functional spaces.
| math.AP | grosspitaevskii and hartree hierarchies are infinite systems of coupled pdes emerging naturally from the mean field theory of bose gases their solutions are known to be related to an initial value problem respectively the grosspitaevskii and hartree equations due to their physical and mathematical relevance the issues of wellposedness and uniqueness for these hierarchies have recently been studied thoroughly using specific nonlinear and combinatorial techniques in this article we introduce a new approach for the study of such hierarchy equations by firstly establishing a duality between them and certain liouville equations and secondly solving the uniqueness and existence questions for the latter as an outcome we formulate a hierarchy equation starting from any initial value problem which is u1invariant and prove a general principle which can be stated formally as follows i uniqueness for weak solutions of an initial value problem implies the uniqueness of solutions for the related hierarchy equation ii existence of solutions for the initial value problem implies existence of solutions for the related hierarchy equation in particular several new wellposedness results as well as a counterexample to uniqueness for the grosspitaevskii hierarchy equation are proved the novelty in our work lies in the aforementioned duality and the use of liouville equations with powerful transport techniques extended to infinite dimensional functional spaces | [['grosspitaevskii', 'and', 'hartree', 'hierarchies', 'are', 'infinite', 'systems', 'of', 'coupled', 'pdes', 'emerging', 'naturally', 'from', 'the', 'mean', 'field', 'theory', 'of', 'bose', 'gases', 'their', 'solutions', 'are', 'known', 'to', 'be', 'related', 'to', 'an', 'initial', 'value', 'problem', 'respectively', 'the', 'grosspitaevskii', 'and', 'hartree', 'equations', 'due', 'to', 'their', 'physical', 'and', 'mathematical', 'relevance', 'the', 'issues', 'of', 'wellposedness', 'and', 'uniqueness', 'for', 'these', 'hierarchies', 'have', 'recently', 'been', 'studied', 'thoroughly', 'using', 'specific', 'nonlinear', 'and', 'combinatorial', 'techniques', 'in', 'this', 'article', 'we', 'introduce', 'a', 'new', 'approach', 'for', 'the', 'study', 'of', 'such', 'hierarchy', 'equations', 'by', 'firstly', 'establishing', 'a', 'duality', 'between', 'them', 'and', 'certain', 'liouville', 'equations', 'and', 'secondly', 'solving', 'the', 'uniqueness', 'and', 'existence', 'questions', 'for', 'the', 'latter', 'as', 'an', 'outcome', 'we', 'formulate', 'a', 'hierarchy', 'equation', 'starting', 'from', 'any', 'initial', 'value', 'problem', 'which', 'is', 'u1invariant', 'and', 'prove', 'a', 'general', 'principle', 'which', 'can', 'be', 'stated', 'formally', 'as', 'follows', 'i', 'uniqueness', 'for', 'weak', 'solutions', 'of', 'an', 'initial', 'value', 'problem', 'implies', 'the', 'uniqueness', 'of', 'solutions', 'for', 'the', 'related', 'hierarchy', 'equation', 'ii', 'existence', 'of', 'solutions', 'for', 'the', 'initial', 'value', 'problem', 'implies', 'existence', 'of', 'solutions', 'for', 'the', 'related', 'hierarchy', 'equation', 'in', 'particular', 'several', 'new', 'wellposedness', 'results', 'as', 'well', 'as', 'a', 'counterexample', 'to', 'uniqueness', 'for', 'the', 'grosspitaevskii', 'hierarchy', 'equation', 'are', 'proved', 'the', 'novelty', 'in', 'our', 'work', 'lies', 'in', 'the', 'aforementioned', 'duality', 'and', 'the', 'use', 'of', 'liouville', 'equations', 'with', 'powerful', 'transport', 'techniques', 'extended', 'to', 'infinite', 'dimensional', 'functional', 'spaces']] | [-0.10290427345046124, 0.04413107822853585, -0.07807077503936409, 0.13763481953267961, -0.08208894541183877, -0.1419386858098902, -0.007289518513933344, 0.25011712959101207, -0.3301447918660246, -0.283930824172878, 0.16244124531486007, -0.2550674232784225, -0.15647738364113625, 0.1679187152166526, -0.03242553586660083, 0.11418059378602477, 0.06302326920680529, -0.015312933848174505, -0.10000302025579257, -0.23804593222367382, 0.4133928437251598, -0.05132985877436261, 0.25385490922733794, 0.0845457800398689, 0.15274823306691507, -0.016228438718894192, 0.03471554859303111, 0.03197651242100915, -0.17052584998038878, 0.11134602486827345, 0.25553809280810486, 0.12029521735818234, 0.30531280450089726, -0.4159351672977209, -0.20618961536823663, 0.09832225218036234, 0.16408584177992197, 0.15524911783462347, -0.05170309690347071, -0.31787120968612387, 0.07579120146327241, -0.1181372627399342, -0.2285169338623365, -0.09052556627538315, 0.020455252919021213, 0.06982017097518195, -0.26002020982938795, 0.13749590746321996, 0.06724294533703996, 0.01628015773265276, -0.18060536072589456, -0.08311459656837288, 0.009502324604884137, 0.0694341700729849, 0.06707453466843553, -0.008690600763183348, -0.011236572044706622, -0.15993489011581363, -0.12701484817838252, 0.37466806594369023, -0.06015353248736193, -0.26699232994037314, 0.19854583171369553, -0.0553845317211262, -0.14057525769309248, 0.06830731451884996, 0.1361027336874327, 0.15148821452762498, -0.17320561911910773, 0.13883378769671761, -0.09931919090233224, 0.12038310019212753, 0.08406974068777852, 0.01618450951443032, 0.15215303370252597, 0.16475754946275334, 0.12223231111826419, 0.11730182669017204, 0.034349293546442505, -0.1577083163967811, -0.330410661063222, -0.16009314946321293, -0.12632617338365593, 0.09981238056234149, -0.07418711277870137, -0.160837796070548, 0.3566086548196455, 0.1674509679203512, 0.14338380704785503, 0.08751152567457147, 0.19869108915025757, 0.21352381509198093, -0.016721853717815045, 0.04121365242875939, 0.2084203919709855, 0.21246862427418142, 0.14902288329376037, -0.2075692657673688, 0.006310663339790217, 0.17260969182433084] |
1,802.09042 | Theoretical investigations of quantum correlations in NMR multiple-pulse
spin-locking experiments | Quantum correlations are investigated theoretically in a two-spin system with
the dipole-dipole interactions in the NMR multiple-pulse spin-locking
experiments. We consider two schemes of the multiple-pulse spin-locking. The
first scheme consists of $\pi/2$-pulses only and the delays between the pulses
can differ. The second scheme contains $\varphi$-pulses ($0<\varphi<\pi$) and
has equal delays between them. We calculate entanglement for both schemes for
an initial separable state. We show that entanglement is absent for the first
scheme at equal delays between $\pi/2$-pulses at arbitraty temperatures.
Entanglement emerges after several periods of the pulse sequence in the second
scheme at $\varphi=\pi/4$ at milliKelvin temperatures. The necessary number of
the periods increases with increasing temperature. We demonstrate the
dependence of entanglement on the number of the periods of the multiple-pulse
sequence. Quantum discord is obtained for the first scheme of the
multiple-pulse spin-locking experiment at different temperatures.
| quant-ph | quantum correlations are investigated theoretically in a twospin system with the dipoledipole interactions in the nmr multiplepulse spinlocking experiments we consider two schemes of the multiplepulse spinlocking the first scheme consists of pi2pulses only and the delays between the pulses can differ the second scheme contains varphipulses 0varphipi and has equal delays between them we calculate entanglement for both schemes for an initial separable state we show that entanglement is absent for the first scheme at equal delays between pi2pulses at arbitraty temperatures entanglement emerges after several periods of the pulse sequence in the second scheme at varphipi4 at millikelvin temperatures the necessary number of the periods increases with increasing temperature we demonstrate the dependence of entanglement on the number of the periods of the multiplepulse sequence quantum discord is obtained for the first scheme of the multiplepulse spinlocking experiment at different temperatures | [['quantum', 'correlations', 'are', 'investigated', 'theoretically', 'in', 'a', 'twospin', 'system', 'with', 'the', 'dipoledipole', 'interactions', 'in', 'the', 'nmr', 'multiplepulse', 'spinlocking', 'experiments', 'we', 'consider', 'two', 'schemes', 'of', 'the', 'multiplepulse', 'spinlocking', 'the', 'first', 'scheme', 'consists', 'of', 'pi2pulses', 'only', 'and', 'the', 'delays', 'between', 'the', 'pulses', 'can', 'differ', 'the', 'second', 'scheme', 'contains', 'varphipulses', '0varphipi', 'and', 'has', 'equal', 'delays', 'between', 'them', 'we', 'calculate', 'entanglement', 'for', 'both', 'schemes', 'for', 'an', 'initial', 'separable', 'state', 'we', 'show', 'that', 'entanglement', 'is', 'absent', 'for', 'the', 'first', 'scheme', 'at', 'equal', 'delays', 'between', 'pi2pulses', 'at', 'arbitraty', 'temperatures', 'entanglement', 'emerges', 'after', 'several', 'periods', 'of', 'the', 'pulse', 'sequence', 'in', 'the', 'second', 'scheme', 'at', 'varphipi4', 'at', 'millikelvin', 'temperatures', 'the', 'necessary', 'number', 'of', 'the', 'periods', 'increases', 'with', 'increasing', 'temperature', 'we', 'demonstrate', 'the', 'dependence', 'of', 'entanglement', 'on', 'the', 'number', 'of', 'the', 'periods', 'of', 'the', 'multiplepulse', 'sequence', 'quantum', 'discord', 'is', 'obtained', 'for', 'the', 'first', 'scheme', 'of', 'the', 'multiplepulse', 'spinlocking', 'experiment', 'at', 'different', 'temperatures']] | [-0.1981719516816416, 0.21460057100432875, -0.07534589826204215, 0.03224558852380142, 0.09313596838286944, -0.16638021382303642, 0.03523696393572858, 0.40897322865203023, -0.2325609522738627, -0.26566202801519206, 0.019819739282164458, -0.27675504522610156, -0.0620190732613472, 0.2505655603317012, 0.01123395712846624, 0.03727602458290805, 0.02568151013360226, 0.05635060104749365, -0.09620688505903152, -0.2686441467667464, 0.3197075540931629, 0.010797326956942145, 0.2840722689937268, 0.06598432759554791, 0.14416988990602217, 0.0052106000416513, 0.03197533381836755, -0.0432296492824597, -0.1103679287898558, 0.026193260968596276, 0.22346080130498325, 0.05875696845905622, 0.252505348646082, -0.4142286944336125, -0.17535269239451737, 0.10763239576481283, 0.08243248437065631, 0.19441020761483482, -0.003578444501285308, -0.2585182190639898, 0.054641360804505115, -0.1638904462984231, -0.07583136836183257, -0.05593944732099772, 0.013230428438899773, 0.025699893558131796, -0.25895615782272735, 0.11897400995616668, 0.018425521811669957, 0.08287144278043083, -0.04261205239953207, -0.05102914625229979, 0.00702900024230725, 0.1354938182081761, -0.011760414728528953, -0.02218761062499003, 0.07141067042414631, -0.07154258006131775, -0.13352413966453502, 0.31764526975208096, -0.08761383602229346, -0.09037903402433066, 0.1673885255852448, -0.1417725132429041, -0.09281301813503627, 0.13964510637867664, 0.12573797053025504, 0.14132669166761583, -0.08373578143572169, 0.01698915215924249, 0.026691965515991407, 0.2065398369450122, 0.08653256846758138, 0.11571412344762523, 0.1661790605700974, 0.1326998733882127, 0.06128142425940106, 0.18383432208959546, -0.11971694993408163, -0.11710309509320983, -0.3000921423480447, -0.1315646904753521, -0.2261763555995588, -0.002840579946392349, -0.0729230819600551, -0.05680828138720244, 0.40255082405718506, 0.12989756804558317, 0.1707539232747097, 0.06994163034084652, 0.30874898554092006, 0.1255934712776382, 0.02527555150279243, 0.061081789881323595, 0.2518410490094019, 0.15175702632404864, 0.10153749094544244, -0.33554174080532645, 0.04743856517119899, 0.03890910192525813] |
1,802.09043 | Free LSD: Prior-Free Visual Landing Site Detection for Autonomous Planes | Full autonomy for fixed-wing unmanned aerial vehicles (UAVs) requires the
capability to autonomously detect potential landing sites in unknown and
unstructured terrain, allowing for self-governed mission completion or handling
of emergency situations. In this work, we propose a perception system
addressing this challenge by detecting landing sites based on their texture and
geometric shape without using any prior knowledge about the environment. The
proposed method considers hazards within the landing region such as terrain
roughness and slope, surrounding obstacles that obscure the landing approach
path, and the local wind field that is estimated by the on-board EKF. The
latter enables applicability of the proposed method on small-scale autonomous
planes without landing gear. A safe approach path is computed based on the UAV
dynamics, expected state estimation and actuator uncertainty, and the on-board
computed elevation map. The proposed framework has been successfully tested on
photo-realistic synthetic datasets and in challenging real-world environments.
| cs.RO | full autonomy for fixedwing unmanned aerial vehicles uavs requires the capability to autonomously detect potential landing sites in unknown and unstructured terrain allowing for selfgoverned mission completion or handling of emergency situations in this work we propose a perception system addressing this challenge by detecting landing sites based on their texture and geometric shape without using any prior knowledge about the environment the proposed method considers hazards within the landing region such as terrain roughness and slope surrounding obstacles that obscure the landing approach path and the local wind field that is estimated by the onboard ekf the latter enables applicability of the proposed method on smallscale autonomous planes without landing gear a safe approach path is computed based on the uav dynamics expected state estimation and actuator uncertainty and the onboard computed elevation map the proposed framework has been successfully tested on photorealistic synthetic datasets and in challenging realworld environments | [['full', 'autonomy', 'for', 'fixedwing', 'unmanned', 'aerial', 'vehicles', 'uavs', 'requires', 'the', 'capability', 'to', 'autonomously', 'detect', 'potential', 'landing', 'sites', 'in', 'unknown', 'and', 'unstructured', 'terrain', 'allowing', 'for', 'selfgoverned', 'mission', 'completion', 'or', 'handling', 'of', 'emergency', 'situations', 'in', 'this', 'work', 'we', 'propose', 'a', 'perception', 'system', 'addressing', 'this', 'challenge', 'by', 'detecting', 'landing', 'sites', 'based', 'on', 'their', 'texture', 'and', 'geometric', 'shape', 'without', 'using', 'any', 'prior', 'knowledge', 'about', 'the', 'environment', 'the', 'proposed', 'method', 'considers', 'hazards', 'within', 'the', 'landing', 'region', 'such', 'as', 'terrain', 'roughness', 'and', 'slope', 'surrounding', 'obstacles', 'that', 'obscure', 'the', 'landing', 'approach', 'path', 'and', 'the', 'local', 'wind', 'field', 'that', 'is', 'estimated', 'by', 'the', 'onboard', 'ekf', 'the', 'latter', 'enables', 'applicability', 'of', 'the', 'proposed', 'method', 'on', 'smallscale', 'autonomous', 'planes', 'without', 'landing', 'gear', 'a', 'safe', 'approach', 'path', 'is', 'computed', 'based', 'on', 'the', 'uav', 'dynamics', 'expected', 'state', 'estimation', 'and', 'actuator', 'uncertainty', 'and', 'the', 'onboard', 'computed', 'elevation', 'map', 'the', 'proposed', 'framework', 'has', 'been', 'successfully', 'tested', 'on', 'photorealistic', 'synthetic', 'datasets', 'and', 'in', 'challenging', 'realworld', 'environments']] | [-0.13404458070914754, 0.04340687598755571, -0.04917188979290574, 0.027299091600757462, -0.08610428804655047, -0.14566878458201293, 0.04988477564422993, 0.43359585321008765, -0.20657810266283866, -0.411482471602642, 0.12054534328389074, -0.21717030834406614, -0.18764543187471464, 0.21296012143000023, -0.18051215948938665, 0.11800420317114238, 0.09962128498745675, -0.0017220070415996755, 0.020024130327105892, -0.1952567911746955, 0.25292322768934616, 0.08085462530852844, 0.29616309968841, 0.0287781871280121, 0.19005653209096154, 0.03480233905978797, 0.002384500101591084, -0.012259990409200098, -0.06983515260394567, 0.11961462681273473, 0.2511558691024262, 0.16194686283271092, 0.2645243355473935, -0.4800206549613681, -0.25903337078927613, 0.10142019097477395, 0.11425778612075065, 0.019341590785863193, -0.047937400856468554, -0.41526209609891407, 0.05342202568858467, -0.1667314474686783, -0.12701939827213618, -0.07691570163537927, 0.00928811323505191, 0.0022977556060345856, -0.24601233517442714, -0.02705231323122781, -0.015968141249313162, 0.10693745180002309, -0.11389048862257904, -0.053795312447257534, 0.003748654474239081, 0.21300984091365968, 0.011686240498667323, 0.041143899239192636, 0.23560228543541092, -0.13508095088050953, -0.09023861444419534, 0.42747309736118017, 0.022611577241120256, -0.19558972725644708, 0.1721161588045787, -0.06501840704601776, -0.079043640261701, 0.13727353688866048, 0.22698581134530388, 0.12372515091382658, -0.17083331908019173, 0.05953202520794735, 0.016044069285078948, 0.1522524870488028, 0.04443578114918131, -0.08988734383432083, 0.20437561616192446, 0.22932800360714758, 0.17576070506717786, 0.08772806806600844, -0.2130417407656841, -0.11940718287469461, -0.2068083299661598, -0.11137754957049789, -0.20038696586398025, -0.04942043725746554, -0.06686607637492376, -0.119454061506865, 0.35111749516368307, 0.24717192026163567, 0.13189945978094017, 0.06645440577146973, 0.43881849959394, -0.007875567485404121, 0.06375835162575129, 0.09394582094538291, 0.17988242323368492, -0.021528005171320495, 0.13603754220715422, -0.2180623830194332, 0.15495475637109715, 0.06221328576138576] |
1,802.09044 | The solution space to the Einstein's vacuum field equations for the case
of five-dimensional Bianchi Type I (Type 4A1) | We consider the 4+1 Einstein's field equations (EFE's) in vacuum, simplified
by the assumption that there is a four-dimensional sub-manifold on which an
isometry group of dimension four acts simply transitive. In particular we
consider the Abelian group Type 4A1; and thus the emerging homogeneous
sub-space is flat. Through the use of coordinate transformations that preserve
the sub-manifold's manifest homogeneity, a coordinate system is chosen in which
the shift vector is zero. The resulting equations remain form invariant under
the action of the constant Automorphisms group. This group is used in order to
simplify the equations and obtain their complete solution space which consists
of seven families of solutions. Apart form the Kasner type all the other
solutions found are, to the best of our knowledge, new. Some of them correspond
to cosmological solutions, others seem to depend on some spatial coordinate and
there are also pp-wave solutions.
| gr-qc | we consider the 41 einsteins field equations efes in vacuum simplified by the assumption that there is a fourdimensional submanifold on which an isometry group of dimension four acts simply transitive in particular we consider the abelian group type 4a1 and thus the emerging homogeneous subspace is flat through the use of coordinate transformations that preserve the submanifolds manifest homogeneity a coordinate system is chosen in which the shift vector is zero the resulting equations remain form invariant under the action of the constant automorphisms group this group is used in order to simplify the equations and obtain their complete solution space which consists of seven families of solutions apart form the kasner type all the other solutions found are to the best of our knowledge new some of them correspond to cosmological solutions others seem to depend on some spatial coordinate and there are also ppwave solutions | [['we', 'consider', 'the', '41', 'einsteins', 'field', 'equations', 'efes', 'in', 'vacuum', 'simplified', 'by', 'the', 'assumption', 'that', 'there', 'is', 'a', 'fourdimensional', 'submanifold', 'on', 'which', 'an', 'isometry', 'group', 'of', 'dimension', 'four', 'acts', 'simply', 'transitive', 'in', 'particular', 'we', 'consider', 'the', 'abelian', 'group', 'type', '4a1', 'and', 'thus', 'the', 'emerging', 'homogeneous', 'subspace', 'is', 'flat', 'through', 'the', 'use', 'of', 'coordinate', 'transformations', 'that', 'preserve', 'the', 'submanifolds', 'manifest', 'homogeneity', 'a', 'coordinate', 'system', 'is', 'chosen', 'in', 'which', 'the', 'shift', 'vector', 'is', 'zero', 'the', 'resulting', 'equations', 'remain', 'form', 'invariant', 'under', 'the', 'action', 'of', 'the', 'constant', 'automorphisms', 'group', 'this', 'group', 'is', 'used', 'in', 'order', 'to', 'simplify', 'the', 'equations', 'and', 'obtain', 'their', 'complete', 'solution', 'space', 'which', 'consists', 'of', 'seven', 'families', 'of', 'solutions', 'apart', 'form', 'the', 'kasner', 'type', 'all', 'the', 'other', 'solutions', 'found', 'are', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'new', 'some', 'of', 'them', 'correspond', 'to', 'cosmological', 'solutions', 'others', 'seem', 'to', 'depend', 'on', 'some', 'spatial', 'coordinate', 'and', 'there', 'are', 'also', 'ppwave', 'solutions']] | [-0.18435130901888114, 0.08624128732748321, -0.06325007914913958, 0.03341865124811298, -0.13661580439656973, -0.1318078134018852, -0.02623767510601351, 0.3345975717846431, -0.2541452383204382, -0.23602606703568452, 0.13438885388135605, -0.2743669241273991, -0.13635189238489054, 0.14905709041944598, -0.0714734558120598, -0.007440853247428503, 0.007818332680051221, 0.11040742310131488, -0.10843112225704478, -0.2776780814909674, 0.4110824475793459, -0.026653335366372755, 0.288013573431847, -0.059037284078599164, 0.13534526998924762, -0.02892541453847345, -0.023103411204884856, 0.021868219981041298, -0.12918096126208073, 0.07467682696372067, 0.22761254881185536, 0.11477049339489796, 0.19830607230059144, -0.40268436894074183, -0.1840672645857241, 0.14422725411575466, 0.14549015513399527, 0.11704200958962976, -0.03453178266791918, -0.28108885877632667, 0.06446035076439584, -0.12065694789516226, -0.19522652277393507, -0.09623017373374429, 0.005329587652829482, -0.00136753027390714, -0.20559351668902198, 0.03756244361323786, 0.06672739522962444, 0.02598384393499467, -0.11141782094958891, -0.06647649033194673, -0.028132588192377062, 0.1186860157945035, 0.08528295233940744, 0.04058946048695163, 0.10346105865830062, -0.08083422466650048, -0.06745267868973315, 0.41994746565679403, -0.08057234946204363, -0.312003280135936, 0.16155768960689, -0.13138074945772485, -0.14889276502527246, 0.12552824976923718, 0.12086879164233905, 0.15150441337839327, -0.14230166974344424, 0.1760253193111121, -0.07313008158512059, 0.13109839909874713, 0.08707043108194559, 0.022061064959738124, 0.1446058630252726, 0.0716229808535807, 0.10885163206610271, 0.08965507822648185, 0.021034266775732124, -0.10945700419762609, -0.3711458298751489, -0.15534676392847785, -0.0850810238966389, 0.1065801239578801, -0.13257241544131979, -0.18715547409770236, 0.38678973786482196, 0.09548008062902102, 0.16275952547332462, 0.038750653823942174, 0.18805208305201057, 0.0814387365188893, 0.08687818407708285, 0.11347295942583255, 0.2506944308279963, 0.13528034995075594, 0.028961478621654567, -0.18235183247051448, -0.012663308659736321, 0.13725104967435525] |
1,802.09045 | Exact spectral asymptotics of fractional processes | Eigenproblems frequently arise in theory and applications of stochastic
processes, but only a few have explicit solutions. Those which do, are usually
solved by reduction to the generalized Sturm--Liouville theory for differential
operators. This includes the Brownian motion and a whole class of processes,
which derive from it by means of linear transformations. The more general
eigenproblem for the {\em fractional} Brownian motion (f.B.m.) is not solvable
in closed form, but the exact asymptotics of its eigenvalues and eigenfunctions
can be obtained, using a method based on analytic properties of the Laplace
transform. In this paper we consider two processes closely related to the
f.B.m.: the fractional Ornstein--Uhlenbeck process and the integrated
fractional Brownian motion. While both derive from the f.B.m. by simple linear
transformations, the corresponding eigenproblems turn out to be much more
complex and their asymptotic structure exhibits new effects.
| math.PR math.FA | eigenproblems frequently arise in theory and applications of stochastic processes but only a few have explicit solutions those which do are usually solved by reduction to the generalized sturmliouville theory for differential operators this includes the brownian motion and a whole class of processes which derive from it by means of linear transformations the more general eigenproblem for the em fractional brownian motion fbm is not solvable in closed form but the exact asymptotics of its eigenvalues and eigenfunctions can be obtained using a method based on analytic properties of the laplace transform in this paper we consider two processes closely related to the fbm the fractional ornsteinuhlenbeck process and the integrated fractional brownian motion while both derive from the fbm by simple linear transformations the corresponding eigenproblems turn out to be much more complex and their asymptotic structure exhibits new effects | [['eigenproblems', 'frequently', 'arise', 'in', 'theory', 'and', 'applications', 'of', 'stochastic', 'processes', 'but', 'only', 'a', 'few', 'have', 'explicit', 'solutions', 'those', 'which', 'do', 'are', 'usually', 'solved', 'by', 'reduction', 'to', 'the', 'generalized', 'sturmliouville', 'theory', 'for', 'differential', 'operators', 'this', 'includes', 'the', 'brownian', 'motion', 'and', 'a', 'whole', 'class', 'of', 'processes', 'which', 'derive', 'from', 'it', 'by', 'means', 'of', 'linear', 'transformations', 'the', 'more', 'general', 'eigenproblem', 'for', 'the', 'em', 'fractional', 'brownian', 'motion', 'fbm', 'is', 'not', 'solvable', 'in', 'closed', 'form', 'but', 'the', 'exact', 'asymptotics', 'of', 'its', 'eigenvalues', 'and', 'eigenfunctions', 'can', 'be', 'obtained', 'using', 'a', 'method', 'based', 'on', 'analytic', 'properties', 'of', 'the', 'laplace', 'transform', 'in', 'this', 'paper', 'we', 'consider', 'two', 'processes', 'closely', 'related', 'to', 'the', 'fbm', 'the', 'fractional', 'ornsteinuhlenbeck', 'process', 'and', 'the', 'integrated', 'fractional', 'brownian', 'motion', 'while', 'both', 'derive', 'from', 'the', 'fbm', 'by', 'simple', 'linear', 'transformations', 'the', 'corresponding', 'eigenproblems', 'turn', 'out', 'to', 'be', 'much', 'more', 'complex', 'and', 'their', 'asymptotic', 'structure', 'exhibits', 'new', 'effects']] | [-0.05472958619271005, 0.08242906227586529, -0.10081851200606841, 0.09454011114141882, -0.12331772583018674, -0.118187615228161, -0.0016740644030915704, 0.3495506915381887, -0.3293847358346143, -0.25229283906257066, 0.15001233431599167, -0.26486838731462214, -0.20434087245646393, 0.21572952836663398, -0.06656527667450653, 0.09793476454059358, 0.03657490775254752, 0.03160476987250149, -0.055783790101716954, -0.18332909553272414, 0.28197941340466726, -0.008870358340291333, 0.19480486789350987, -0.053210965305251975, 0.11617855567970431, -0.013019799110545238, -0.07391771048464825, 0.002459283314750228, -0.12544194474803205, 0.14470565753897102, 0.2237319374361902, 0.028896492955104356, 0.2590203486910929, -0.4463372752923046, -0.2194230832933435, 0.11092320019969533, 0.16103268667549703, 0.07866643079963158, -0.0031934895056290025, -0.3278043785289874, 0.0336149814391089, -0.1240939654911619, -0.1489816489957378, -0.09430030976179463, 0.04186599235735755, 0.05285562183683358, -0.27693514856321305, 0.13395876275427954, 0.10332867600397587, 0.01461239427239056, -0.053051509731285224, -0.11196636148764502, 0.017722388598280892, 0.07167459614443737, 0.02309635102574248, -0.06172374724558043, 0.12074032801360836, -0.09625105268623628, -0.1373488418987467, 0.4036920895458947, -0.05646990283234963, -0.31606692368899225, 0.14487908344099323, -0.17374405671816162, -0.1261747872693018, 0.16098035925435245, 0.16376953578265516, 0.16804280270277983, -0.23864222284854048, 0.13283628146746196, -0.012550035337458404, 0.07416643069820925, 0.07036577867389932, 0.021791587425084313, 0.1231809128010252, 0.0836839042833521, 0.09709424508119029, 0.14718115063298914, -0.009086139065633252, -0.18967969114170738, -0.30455786906654986, -0.15157766747665527, -0.1701384171987818, 0.0845014888623731, -0.11078685616062295, -0.19825275500737866, 0.3696865471634148, 0.11505307258815098, 0.20038800233397897, 0.07556315063020136, 0.21325608343541833, 0.27661510076190177, 0.028589850909758727, 0.06849304123939028, 0.16518624584046257, 0.15671715546156686, 0.10532655938639975, -0.20064979804430524, 0.025991411361528535, 0.12135852348800538] |
1,802.09046 | Multiclass Common Spatial Pattern for EEG based Brain Computer Interface
with Adaptive Learning Classifier | In Brain Computer Interface (BCI), data generated from Electroencephalogram
(EEG) is non-stationary with low signal to noise ratio and contaminated with
artifacts. Common Spatial Pattern (CSP) algorithm has been proved to be
effective in BCI for extracting features in motor imagery tasks, but it is
prone to overfitting. Many algorithms have been devised to regularize CSP for
two class problem, however they have not been effective when applied to
multiclass CSP. Outliers present in data affect extracted CSP features and
reduces performance of the system. In addition to this non-stationarity present
in the features extracted from the CSP present a challenge in classification.
We propose a method to identify and remove artifact present in the data during
pre-processing stage, this helps in calculating eigenvectors which in turn
generates better CSP features. To handle the non-stationarity, Self-Regulated
Interval Type-2 Neuro-Fuzzy Inference System (SRIT2NFIS) was proposed in the
literature for two class EEG classification problem. This paper extends the
SRIT2NFIS to multiclass using Joint Approximate Diagonalization (JAD). The
results on standard data set from BCI competition IV shows significant increase
in the accuracies from the current state of the art methods for multiclass
classification.
| cs.NE q-bio.NC | in brain computer interface bci data generated from electroencephalogram eeg is nonstationary with low signal to noise ratio and contaminated with artifacts common spatial pattern csp algorithm has been proved to be effective in bci for extracting features in motor imagery tasks but it is prone to overfitting many algorithms have been devised to regularize csp for two class problem however they have not been effective when applied to multiclass csp outliers present in data affect extracted csp features and reduces performance of the system in addition to this nonstationarity present in the features extracted from the csp present a challenge in classification we propose a method to identify and remove artifact present in the data during preprocessing stage this helps in calculating eigenvectors which in turn generates better csp features to handle the nonstationarity selfregulated interval type2 neurofuzzy inference system srit2nfis was proposed in the literature for two class eeg classification problem this paper extends the srit2nfis to multiclass using joint approximate diagonalization jad the results on standard data set from bci competition iv shows significant increase in the accuracies from the current state of the art methods for multiclass classification | [['in', 'brain', 'computer', 'interface', 'bci', 'data', 'generated', 'from', 'electroencephalogram', 'eeg', 'is', 'nonstationary', 'with', 'low', 'signal', 'to', 'noise', 'ratio', 'and', 'contaminated', 'with', 'artifacts', 'common', 'spatial', 'pattern', 'csp', 'algorithm', 'has', 'been', 'proved', 'to', 'be', 'effective', 'in', 'bci', 'for', 'extracting', 'features', 'in', 'motor', 'imagery', 'tasks', 'but', 'it', 'is', 'prone', 'to', 'overfitting', 'many', 'algorithms', 'have', 'been', 'devised', 'to', 'regularize', 'csp', 'for', 'two', 'class', 'problem', 'however', 'they', 'have', 'not', 'been', 'effective', 'when', 'applied', 'to', 'multiclass', 'csp', 'outliers', 'present', 'in', 'data', 'affect', 'extracted', 'csp', 'features', 'and', 'reduces', 'performance', 'of', 'the', 'system', 'in', 'addition', 'to', 'this', 'nonstationarity', 'present', 'in', 'the', 'features', 'extracted', 'from', 'the', 'csp', 'present', 'a', 'challenge', 'in', 'classification', 'we', 'propose', 'a', 'method', 'to', 'identify', 'and', 'remove', 'artifact', 'present', 'in', 'the', 'data', 'during', 'preprocessing', 'stage', 'this', 'helps', 'in', 'calculating', 'eigenvectors', 'which', 'in', 'turn', 'generates', 'better', 'csp', 'features', 'to', 'handle', 'the', 'nonstationarity', 'selfregulated', 'interval', 'type2', 'neurofuzzy', 'inference', 'system', 'srit2nfis', 'was', 'proposed', 'in', 'the', 'literature', 'for', 'two', 'class', 'eeg', 'classification', 'problem', 'this', 'paper', 'extends', 'the', 'srit2nfis', 'to', 'multiclass', 'using', 'joint', 'approximate', 'diagonalization', 'jad', 'the', 'results', 'on', 'standard', 'data', 'set', 'from', 'bci', 'competition', 'iv', 'shows', 'significant', 'increase', 'in', 'the', 'accuracies', 'from', 'the', 'current', 'state', 'of', 'the', 'art', 'methods', 'for', 'multiclass', 'classification']] | [-0.023222232726525772, -0.049067984751509454, -0.08084374972959123, 0.08261280429177478, -0.1097418114397596, -0.18967822073372426, 0.029112698987653608, 0.40437471736518166, -0.29107266818247146, -0.34635869082477355, 0.10740026833351564, -0.27450508062195567, -0.15835305471613845, 0.20251678790966118, -0.15377079694600845, 0.08696176052350975, 0.11826015642238041, 0.02225815973653601, -0.052453875677812865, -0.26752600637042806, 0.2837679770839199, 0.008937679100584574, 0.3476980859561572, -0.004140853687194447, 0.0720160021181785, -0.015621392233740716, -0.06632496828026084, 0.010387657589658542, -0.025421989761371777, 0.09305567794883496, 0.38300700949273375, 0.20276018481260588, 0.2978068312837018, -0.4003414246968176, -0.2430018649015221, 0.1326482595959629, 0.16280907253049826, 0.13830523559436814, -0.05293425387535343, -0.33537749975190434, 0.11845815569660059, -0.14248546344664184, -0.008357067673747975, -0.0970850866928539, 0.010276932200347935, -0.036084264367769556, -0.2953155199878864, 0.11500247158005429, 0.06421829390009402, 0.07574035117412528, -0.06322158126483263, -0.10515048250521498, 0.060514284385289385, 0.13412312414603697, 0.0544301151130447, 0.054571933142604334, 0.10197896966168647, -0.15336895799239675, -0.12270095479112887, 0.34886771460709276, -0.03397472235793002, -0.20704286289278162, 0.21300655492044315, -0.05602504990664779, -0.2002186288850175, 0.142363736455245, 0.24090800798749404, 0.06170266011000547, -0.1943887514571158, 0.024041996503011052, 0.015779162791592104, 0.18757487055919472, 0.03337382929271491, -0.037166284165722714, 0.15264081517751846, 0.22321747072538725, 0.02190525853290671, 0.19754137611001232, -0.1388454002774168, -0.033719880587702235, -0.17545641643837803, -0.05540466652788892, -0.1806743697333519, -0.047386459329534475, -0.07424701035502256, -0.14566798671271908, 0.4240908307323932, 0.24252675829465112, 0.17991860093125117, 0.06579906855914347, 0.3177303281026306, 0.09961119507971927, 0.09926480544169271, 0.08105508732811484, 0.20397932110871705, 0.03672901633634138, 0.14842804352797212, -0.2134170255096501, 0.10216575485737946, 0.047681764195206276] |
1,802.09047 | Power efficient Spiking Neural Network Classifier based on memristive
crossbar network for spike sorting application | In this paper authors have presented a power efficient scheme for
implementing a spike sorting module. Spike sorting is an important application
in the field of neural signal acquisition for implantable biomedical systems
whose function is to map the Neural-spikes (N-spikes) correctly to the neurons
from which it originates. The accurate classification is a pre-requisite for
the succeeding systems needed in Brain-Machine-Interfaces (BMIs) to give better
performance. The primary design constraint to be satisfied for the spike sorter
module is low power with good accuracy. There lies a trade-off in terms of
power consumption between the on-chip and off-chip training of the N-spike
features. In the former case care has to be taken to make the computational
units power efficient whereas in the later the data rate of wireless
transmission should be minimized to reduce the power consumption due to the
transceivers. In this work a 2-step shared training scheme involving a K-means
sorter and a Spiking Neural Network (SNN) is elaborated for on-chip training
and classification. Also, a low power SNN classifier scheme using memristive
crossbar type architecture is compared with a fully digital implementation. The
advantage of the former classifier is that it is power efficient while
providing comparable accuracy as that of the digital implementation due to the
robustness of the SNN training algorithm which has a good tolerance for
variation in memristance.
| cs.NE cs.LG | in this paper authors have presented a power efficient scheme for implementing a spike sorting module spike sorting is an important application in the field of neural signal acquisition for implantable biomedical systems whose function is to map the neuralspikes nspikes correctly to the neurons from which it originates the accurate classification is a prerequisite for the succeeding systems needed in brainmachineinterfaces bmis to give better performance the primary design constraint to be satisfied for the spike sorter module is low power with good accuracy there lies a tradeoff in terms of power consumption between the onchip and offchip training of the nspike features in the former case care has to be taken to make the computational units power efficient whereas in the later the data rate of wireless transmission should be minimized to reduce the power consumption due to the transceivers in this work a 2step shared training scheme involving a kmeans sorter and a spiking neural network snn is elaborated for onchip training and classification also a low power snn classifier scheme using memristive crossbar type architecture is compared with a fully digital implementation the advantage of the former classifier is that it is power efficient while providing comparable accuracy as that of the digital implementation due to the robustness of the snn training algorithm which has a good tolerance for variation in memristance | [['in', 'this', 'paper', 'authors', 'have', 'presented', 'a', 'power', 'efficient', 'scheme', 'for', 'implementing', 'a', 'spike', 'sorting', 'module', 'spike', 'sorting', 'is', 'an', 'important', 'application', 'in', 'the', 'field', 'of', 'neural', 'signal', 'acquisition', 'for', 'implantable', 'biomedical', 'systems', 'whose', 'function', 'is', 'to', 'map', 'the', 'neuralspikes', 'nspikes', 'correctly', 'to', 'the', 'neurons', 'from', 'which', 'it', 'originates', 'the', 'accurate', 'classification', 'is', 'a', 'prerequisite', 'for', 'the', 'succeeding', 'systems', 'needed', 'in', 'brainmachineinterfaces', 'bmis', 'to', 'give', 'better', 'performance', 'the', 'primary', 'design', 'constraint', 'to', 'be', 'satisfied', 'for', 'the', 'spike', 'sorter', 'module', 'is', 'low', 'power', 'with', 'good', 'accuracy', 'there', 'lies', 'a', 'tradeoff', 'in', 'terms', 'of', 'power', 'consumption', 'between', 'the', 'onchip', 'and', 'offchip', 'training', 'of', 'the', 'nspike', 'features', 'in', 'the', 'former', 'case', 'care', 'has', 'to', 'be', 'taken', 'to', 'make', 'the', 'computational', 'units', 'power', 'efficient', 'whereas', 'in', 'the', 'later', 'the', 'data', 'rate', 'of', 'wireless', 'transmission', 'should', 'be', 'minimized', 'to', 'reduce', 'the', 'power', 'consumption', 'due', 'to', 'the', 'transceivers', 'in', 'this', 'work', 'a', '2step', 'shared', 'training', 'scheme', 'involving', 'a', 'kmeans', 'sorter', 'and', 'a', 'spiking', 'neural', 'network', 'snn', 'is', 'elaborated', 'for', 'onchip', 'training', 'and', 'classification', 'also', 'a', 'low', 'power', 'snn', 'classifier', 'scheme', 'using', 'memristive', 'crossbar', 'type', 'architecture', 'is', 'compared', 'with', 'a', 'fully', 'digital', 'implementation', 'the', 'advantage', 'of', 'the', 'former', 'classifier', 'is', 'that', 'it', 'is', 'power', 'efficient', 'while', 'providing', 'comparable', 'accuracy', 'as', 'that', 'of', 'the', 'digital', 'implementation', 'due', 'to', 'the', 'robustness', 'of', 'the', 'snn', 'training', 'algorithm', 'which', 'has', 'a', 'good', 'tolerance', 'for', 'variation', 'in', 'memristance']] | [-0.12121111217063961, 0.002900225557725109, -0.045278249409150435, 0.03342323227017816, -0.07981899909901659, -0.20450678131719296, 0.04659146909090178, 0.41324313941436847, -0.2591293793998088, -0.32035644255947693, 0.09954981330644784, -0.23527887297022315, -0.1703120150292913, 0.23566131459626155, -0.12563728668668248, 0.07453451037977461, 0.08733424294513424, 0.05680425990968607, -0.015483863239579305, -0.2773363476006633, 0.22812697515080407, 0.14596182823932083, 0.3567705631071517, 0.0071446417646298, 0.13666945662787855, -0.053893049160513594, 0.010473970025945623, -0.03483940204993511, -0.005985924622019321, 0.15627731210426302, 0.3321633889195132, 0.1447274050667991, 0.3080813779185216, -0.41955699504621596, -0.21298855963857374, 0.1331359128151005, 0.13623745665835166, 0.09638516429752984, -0.057965950717360853, -0.2171943761153474, 0.16204888741108212, -0.19201081799267716, -0.022793664638926316, -0.08357601301526432, 0.019029180844931083, 0.030250617403899914, -0.3145312415771522, 0.05331248001220137, 0.07027231969006427, 0.046926891998212726, -0.025465069258971525, -0.06110153350701686, 0.023617760965108727, 0.1277996285421027, -0.015718772655000556, 0.06363064470818383, 0.11908201709691738, -0.1415237953880097, -0.10175395761679455, 0.36571130287405607, 0.000769725871725461, -0.20775427164820334, 0.13435740680706496, -0.028354887456238806, -0.10028939197251054, 0.13548752676060022, 0.21593334427866917, 0.036294332001702276, -0.1632879099280045, 0.01471004953140158, 0.045764498244803234, 0.2156074344965017, 0.0499905516731192, 0.052728168576167106, 0.14454126046123067, 0.29518601903272373, 0.07106092533931506, 0.16260972047100883, -0.08465035683852998, -0.04442144488194236, -0.2571149646631769, -0.1571597008433519, -0.21427350070512108, 0.012786243759045328, -0.09470085350688817, -0.11101071773042383, 0.41897992041083704, 0.1534677561454324, 0.19052414116785266, 0.10143499115905683, 0.3901487087478509, 0.12498041311318793, 0.1474638912147163, 0.09559076654657654, 0.20709130107970522, 0.09462414472363889, 0.15515798224274674, -0.21137045507124197, 0.06206380802852748, 0.011465137274851938] |
1,802.09048 | The role of spin in the calculation of Hubbard $U$ and Hund's $J$
parameters from first principles | The density functional theory (DFT)+$U$ method is a pragmatic and effective
approach for calculating the ground-state properties of strongly-correlated
systems, and linear response calculations are widely used to determine the
requisite Hubbard parameters from first principles. We provide a detailed
treatment of spin within this linear response approach, demonstrating that the
conventional Hubbard $U$ formula, unlike the conventional DFT+$U$ corrective
functional, incorporates interactions that are off-diagonal in the spin indices
and places greater weight on one spin channel over the other. We construct
alternative definitions for Hubbard and Hund's parameters that are consistent
with the contemporary DFT+$U$ functional, expanding upon the minimum-tracking
linear response method. This approach allows Hund's $J$ and spin-dependent $U$
parameters to be calculated with the same ease as for the standard Hubbard $U$.
Our methods accurately reproduce the experimental band gap, local magnetic
moments, and the valence band edge character of manganese oxide, a canonical
strongly-correlated system. We also apply our approach to a complete series of
transition-metal complexes [M(H$_2$O)$_6$]$^{n+}$ (for M = Ti to Zn), showing
that Hubbard corrections on oxygen atoms are necessary for preserving bond
lengths, and demonstrating that our methods are numerically well-behaved even
for near-filled subspaces such as in zinc. However, spectroscopic properties
appear beyond the reach of the standard DFT+$U$ approach. Collectively, these
results shed new light on the role of spin in the calculation of the corrective
parameters $U$ and $J$, and point the way towards avenues for further
development of DFT+$U$-type methods.
| cond-mat.str-el physics.chem-ph physics.comp-ph quant-ph | the density functional theory dftu method is a pragmatic and effective approach for calculating the groundstate properties of stronglycorrelated systems and linear response calculations are widely used to determine the requisite hubbard parameters from first principles we provide a detailed treatment of spin within this linear response approach demonstrating that the conventional hubbard u formula unlike the conventional dftu corrective functional incorporates interactions that are offdiagonal in the spin indices and places greater weight on one spin channel over the other we construct alternative definitions for hubbard and hunds parameters that are consistent with the contemporary dftu functional expanding upon the minimumtracking linear response method this approach allows hunds j and spindependent u parameters to be calculated with the same ease as for the standard hubbard u our methods accurately reproduce the experimental band gap local magnetic moments and the valence band edge character of manganese oxide a canonical stronglycorrelated system we also apply our approach to a complete series of transitionmetal complexes mh_2o_6n for m ti to zn showing that hubbard corrections on oxygen atoms are necessary for preserving bond lengths and demonstrating that our methods are numerically wellbehaved even for nearfilled subspaces such as in zinc however spectroscopic properties appear beyond the reach of the standard dftu approach collectively these results shed new light on the role of spin in the calculation of the corrective parameters u and j and point the way towards avenues for further development of dftutype methods | [['the', 'density', 'functional', 'theory', 'dftu', 'method', 'is', 'a', 'pragmatic', 'and', 'effective', 'approach', 'for', 'calculating', 'the', 'groundstate', 'properties', 'of', 'stronglycorrelated', 'systems', 'and', 'linear', 'response', 'calculations', 'are', 'widely', 'used', 'to', 'determine', 'the', 'requisite', 'hubbard', 'parameters', 'from', 'first', 'principles', 'we', 'provide', 'a', 'detailed', 'treatment', 'of', 'spin', 'within', 'this', 'linear', 'response', 'approach', 'demonstrating', 'that', 'the', 'conventional', 'hubbard', 'u', 'formula', 'unlike', 'the', 'conventional', 'dftu', 'corrective', 'functional', 'incorporates', 'interactions', 'that', 'are', 'offdiagonal', 'in', 'the', 'spin', 'indices', 'and', 'places', 'greater', 'weight', 'on', 'one', 'spin', 'channel', 'over', 'the', 'other', 'we', 'construct', 'alternative', 'definitions', 'for', 'hubbard', 'and', 'hunds', 'parameters', 'that', 'are', 'consistent', 'with', 'the', 'contemporary', 'dftu', 'functional', 'expanding', 'upon', 'the', 'minimumtracking', 'linear', 'response', 'method', 'this', 'approach', 'allows', 'hunds', 'j', 'and', 'spindependent', 'u', 'parameters', 'to', 'be', 'calculated', 'with', 'the', 'same', 'ease', 'as', 'for', 'the', 'standard', 'hubbard', 'u', 'our', 'methods', 'accurately', 'reproduce', 'the', 'experimental', 'band', 'gap', 'local', 'magnetic', 'moments', 'and', 'the', 'valence', 'band', 'edge', 'character', 'of', 'manganese', 'oxide', 'a', 'canonical', 'stronglycorrelated', 'system', 'we', 'also', 'apply', 'our', 'approach', 'to', 'a', 'complete', 'series', 'of', 'transitionmetal', 'complexes', 'mh_2o_6n', 'for', 'm', 'ti', 'to', 'zn', 'showing', 'that', 'hubbard', 'corrections', 'on', 'oxygen', 'atoms', 'are', 'necessary', 'for', 'preserving', 'bond', 'lengths', 'and', 'demonstrating', 'that', 'our', 'methods', 'are', 'numerically', 'wellbehaved', 'even', 'for', 'nearfilled', 'subspaces', 'such', 'as', 'in', 'zinc', 'however', 'spectroscopic', 'properties', 'appear', 'beyond', 'the', 'reach', 'of', 'the', 'standard', 'dftu', 'approach', 'collectively', 'these', 'results', 'shed', 'new', 'light', 'on', 'the', 'role', 'of', 'spin', 'in', 'the', 'calculation', 'of', 'the', 'corrective', 'parameters', 'u', 'and', 'j', 'and', 'point', 'the', 'way', 'towards', 'avenues', 'for', 'further', 'development', 'of', 'dftutype', 'methods']] | [-0.06448882494402355, 0.08955845537071339, -0.04169415608345566, 0.0864779055474139, -0.04163200146553719, -0.1419851483044577, 0.09025924661923512, 0.409580508414578, -0.2534381049689077, -0.2658253089470251, -0.004317700915003515, -0.3162820520918552, -0.14943456849869108, 0.18721848926346196, 0.03651712586833733, 0.042413799479412824, 0.02565733004735479, -0.04439696331133883, -0.14297229991290547, -0.2435046604417545, 0.2841600043490669, 0.011368822906493641, 0.2597489359091566, 0.0921407056505749, 0.019957446165881645, 0.04575041794046666, 0.05532971573564922, 0.016250259847921868, -0.15281318341434574, 0.1473832936230735, 0.2583281270590724, -0.0017055359349496444, 0.24015270286944995, -0.4532596503606526, -0.23494409369577549, -0.009812230314420358, 0.08589259354800968, 0.15490531822196238, -0.018855111825934544, -0.25787860249017197, 0.044523144217739445, -0.19925454987513064, -0.14451909915711653, -0.17719690367252133, 0.003989056306579404, 0.03396429556517406, -0.30499303903017644, 0.09213849521294688, 0.04101301670472905, 0.06152433299365873, -0.09565278670529417, -0.2042205322910856, -0.0611294836213103, 0.10591162420871617, 0.021199903801369976, 0.03907932333500128, 0.11950353926795858, -0.09247755136747092, -0.09447859033209634, 0.3872851911760773, -0.06618236853335847, -0.15954726411197256, 0.1805733404919665, -0.11701691765182312, -0.12404952867825567, 0.09806252199918748, 0.09778138395753459, 0.10411430480324947, -0.15024577801517175, 0.13218189766274951, -0.0027957165104270792, 0.1659439381297968, -0.023790222297473247, 0.09082573621872828, 0.19626103088680547, 0.16589761447067913, 0.07693929315416072, 0.062287507232650724, -0.09462777498347692, -0.1010684722110972, -0.271024015786664, -0.1618400315041011, -0.20372680989853945, 0.008698356205355922, -0.08256772971778054, -0.1905627132190789, 0.4343456948628049, 0.19208292698070686, 0.1300181957179969, 0.014520815494723586, 0.24085108184881088, 0.1155503111132557, 0.0717825356064263, 0.030670158285452793, 0.22725034920522108, 0.14765513477122186, 0.04480954824905905, -0.2847634838712811, 0.04643187085622006, 0.10433049787471078] |
1,802.09049 | On 1-factors with prescribed lengths in tournaments | K\"uhn, Osthus, and Townsend asked whether there exists a constant $C$ such
that every strongly $Ct$-connected tournament contains all possible $1$-factors
with at most $t$ components. We answer this question in the affirmative. This
is best possible up to constant. In addition, we can ensure that each cycle in
the $1$-factor contains a prescribed vertex.
Indeed, we derive this result from a more general result on partitioning
digraphs which are close to semicomplete. More precisely, we prove that there
exists a constant $C$ such that for any $k\geq 1$, if a strongly
$Ck^4t$-connected digraph $D$ is close to semicomplete, then we can partition
$D$ into $t$ strongly $k$-connected subgraphs with prescribed sizes, provided
that the prescribed sizes are $\Omega(n)$. This result improves the earlier
result of K\"uhn, Osthus, and Townsend. Here, the condition of connectivity
being linear in $t$ is best possible, and the condition of prescribed size
being $\Omega(n)$ is also best possible.
| math.CO | kuhn osthus and townsend asked whether there exists a constant c such that every strongly ctconnected tournament contains all possible 1factors with at most t components we answer this question in the affirmative this is best possible up to constant in addition we can ensure that each cycle in the 1factor contains a prescribed vertex indeed we derive this result from a more general result on partitioning digraphs which are close to semicomplete more precisely we prove that there exists a constant c such that for any kgeq 1 if a strongly ck4tconnected digraph d is close to semicomplete then we can partition d into t strongly kconnected subgraphs with prescribed sizes provided that the prescribed sizes are omegan this result improves the earlier result of kuhn osthus and townsend here the condition of connectivity being linear in t is best possible and the condition of prescribed size being omegan is also best possible | [['kuhn', 'osthus', 'and', 'townsend', 'asked', 'whether', 'there', 'exists', 'a', 'constant', 'c', 'such', 'that', 'every', 'strongly', 'ctconnected', 'tournament', 'contains', 'all', 'possible', '1factors', 'with', 'at', 'most', 't', 'components', 'we', 'answer', 'this', 'question', 'in', 'the', 'affirmative', 'this', 'is', 'best', 'possible', 'up', 'to', 'constant', 'in', 'addition', 'we', 'can', 'ensure', 'that', 'each', 'cycle', 'in', 'the', '1factor', 'contains', 'a', 'prescribed', 'vertex', 'indeed', 'we', 'derive', 'this', 'result', 'from', 'a', 'more', 'general', 'result', 'on', 'partitioning', 'digraphs', 'which', 'are', 'close', 'to', 'semicomplete', 'more', 'precisely', 'we', 'prove', 'that', 'there', 'exists', 'a', 'constant', 'c', 'such', 'that', 'for', 'any', 'kgeq', '1', 'if', 'a', 'strongly', 'ck4tconnected', 'digraph', 'd', 'is', 'close', 'to', 'semicomplete', 'then', 'we', 'can', 'partition', 'd', 'into', 't', 'strongly', 'kconnected', 'subgraphs', 'with', 'prescribed', 'sizes', 'provided', 'that', 'the', 'prescribed', 'sizes', 'are', 'omegan', 'this', 'result', 'improves', 'the', 'earlier', 'result', 'of', 'kuhn', 'osthus', 'and', 'townsend', 'here', 'the', 'condition', 'of', 'connectivity', 'being', 'linear', 'in', 't', 'is', 'best', 'possible', 'and', 'the', 'condition', 'of', 'prescribed', 'size', 'being', 'omegan', 'is', 'also', 'best', 'possible']] | [-0.17317203017362198, 0.1631436035516488, -0.027362424310443823, 0.029026005986930902, -0.09886248839872055, -0.21639107017912657, 0.06074915021829503, 0.3738204302805427, -0.24607478336685362, -0.29147982942308054, 0.06584037916151206, -0.291045079320228, -0.15973474621770087, 0.12884699238164007, -0.09910389566242597, 0.013423490669657966, 0.08601725328174468, 0.09699762817839847, 0.04032330480894368, -0.33341282448045123, 0.2808038312283124, -0.013877335932767508, 0.15280890076016812, 0.12783070696566842, 0.06709777675630328, -0.014964519950904344, 0.027600765668658392, 0.08061463997307185, -0.22197671967071647, 0.051857228415380964, 0.26420928332893373, 0.18126905719461656, 0.2762159761041403, -0.34967066181151923, -0.12523429744607328, 0.18680516918385892, 0.11220635289301802, 0.08355644652635276, 0.031168480443356156, -0.1606406956086989, 0.1809884345428528, -0.08689255489796203, -0.13636033338690667, -0.014922300007463874, 0.11791839949805044, -0.02715308769256808, -0.31109218506485614, 0.008596606952204112, 0.16024125671308292, 0.0031912511300393625, -0.0009051952863381686, -0.1390448846466729, -0.035353244199589094, 0.11661059360209804, -0.016817779857493213, 0.14541055260710173, 0.010642717690069204, -0.08562627471761325, -0.11369400590008713, 0.3488168163825513, -0.07589090011376691, -0.17045361531659423, 0.17878767115211017, -0.15829200072115973, -0.18562141541042365, 0.10361157978676554, 0.06454612056136523, 0.15253384600663067, -0.07778575400516274, 0.11808683451511713, -0.17015767106051116, 0.17714726629109415, 0.18358781224876447, -0.04492582767507931, 0.09851801503177021, 0.12416238561088808, 0.18278580616448667, 0.13092763140479005, 0.053098571062467896, 0.01037687605927012, -0.31923578152629106, -0.11975831665882938, -0.19752875122312138, 0.11074997437045615, -0.13814031768723858, -0.16360543770593053, 0.36499258959175723, 0.12617387830610632, 0.21795529676111122, 0.11551734367094468, 0.22630218920561387, 0.07662249357120968, 0.03237596834400105, 0.20797690302501187, 0.1517808367498219, 0.12035294306942408, -0.007326999872212151, -0.1592534540793981, 0.09429929953215546, 0.10747729616215158] |
1,802.0905 | Global phase diagram of Coulomb-interacting anisotropic Weyl semimetals
with disorder | Taking into account the interplay between the disorder and Coulomb
interaction, the phase diagram of three-dimensional anisotropic Weyl semimetal
is studied by renormalization group theory. Weak disorder is irrelevant in
anisotropic Weyl semimetal, while the disorder becomes relevant and drives a
quantum phase transition from semimetal to compressible diffusive metal phases
if the disorder strength is larger than a critical value. The long-range
Coulomb interaction is irrelevant in clean anisotropic Weyl semimetal. However,
interestingly, we find that the long-range Coulomb interaction exerts a
dramatic influence on the critical disorder strength for phase transition to
compressible diffusive metal. Specifically, the critical disorder strength can
receive a prominent change even though an arbitrarily weak Coulomb interaction
is included. This novel behavior is closely related to the anisotropic
screening effect of Coulomb interaction,and essentially results from the
specifical energy dispersion of the fermion excitations in anisotropic Weyl
semimetal. The theoretical results are helpful for understanding the physical
properties of the candidates of anisotropic Weyl semimetal, such as pressured
BiTeI, and some other related materials.
| cond-mat.dis-nn cond-mat.str-el | taking into account the interplay between the disorder and coulomb interaction the phase diagram of threedimensional anisotropic weyl semimetal is studied by renormalization group theory weak disorder is irrelevant in anisotropic weyl semimetal while the disorder becomes relevant and drives a quantum phase transition from semimetal to compressible diffusive metal phases if the disorder strength is larger than a critical value the longrange coulomb interaction is irrelevant in clean anisotropic weyl semimetal however interestingly we find that the longrange coulomb interaction exerts a dramatic influence on the critical disorder strength for phase transition to compressible diffusive metal specifically the critical disorder strength can receive a prominent change even though an arbitrarily weak coulomb interaction is included this novel behavior is closely related to the anisotropic screening effect of coulomb interactionand essentially results from the specifical energy dispersion of the fermion excitations in anisotropic weyl semimetal the theoretical results are helpful for understanding the physical properties of the candidates of anisotropic weyl semimetal such as pressured bitei and some other related materials | [['taking', 'into', 'account', 'the', 'interplay', 'between', 'the', 'disorder', 'and', 'coulomb', 'interaction', 'the', 'phase', 'diagram', 'of', 'threedimensional', 'anisotropic', 'weyl', 'semimetal', 'is', 'studied', 'by', 'renormalization', 'group', 'theory', 'weak', 'disorder', 'is', 'irrelevant', 'in', 'anisotropic', 'weyl', 'semimetal', 'while', 'the', 'disorder', 'becomes', 'relevant', 'and', 'drives', 'a', 'quantum', 'phase', 'transition', 'from', 'semimetal', 'to', 'compressible', 'diffusive', 'metal', 'phases', 'if', 'the', 'disorder', 'strength', 'is', 'larger', 'than', 'a', 'critical', 'value', 'the', 'longrange', 'coulomb', 'interaction', 'is', 'irrelevant', 'in', 'clean', 'anisotropic', 'weyl', 'semimetal', 'however', 'interestingly', 'we', 'find', 'that', 'the', 'longrange', 'coulomb', 'interaction', 'exerts', 'a', 'dramatic', 'influence', 'on', 'the', 'critical', 'disorder', 'strength', 'for', 'phase', 'transition', 'to', 'compressible', 'diffusive', 'metal', 'specifically', 'the', 'critical', 'disorder', 'strength', 'can', 'receive', 'a', 'prominent', 'change', 'even', 'though', 'an', 'arbitrarily', 'weak', 'coulomb', 'interaction', 'is', 'included', 'this', 'novel', 'behavior', 'is', 'closely', 'related', 'to', 'the', 'anisotropic', 'screening', 'effect', 'of', 'coulomb', 'interactionand', 'essentially', 'results', 'from', 'the', 'specifical', 'energy', 'dispersion', 'of', 'the', 'fermion', 'excitations', 'in', 'anisotropic', 'weyl', 'semimetal', 'the', 'theoretical', 'results', 'are', 'helpful', 'for', 'understanding', 'the', 'physical', 'properties', 'of', 'the', 'candidates', 'of', 'anisotropic', 'weyl', 'semimetal', 'such', 'as', 'pressured', 'bitei', 'and', 'some', 'other', 'related', 'materials']] | [-0.22107584607130026, 0.27081548750532364, -0.04512950973371249, 0.07596040765330304, -0.09562789585770053, -0.23879832938751755, 0.047828547024469384, 0.3351864939117256, -0.2546692158479024, -0.2343732662498951, -0.05097444115466822, -0.3671003941747853, -0.20683912350522243, 0.11315006581956849, 0.0857897887359072, -0.016759316234246775, -0.026629921278971083, -0.010704576109042938, -0.14162939609137967, -0.21076149320339455, 0.3665880985174547, 0.01624799569561968, 0.35929217083817894, 0.11790721355115666, -0.024023799413322087, 0.02096221054876771, 0.09865108563903692, 0.089748244653182, -0.1253848965952998, -0.023663128471440253, 0.22188568860840271, -0.18978172312079764, 0.22752653991337865, -0.4033815674702911, -0.23196870609638556, 0.03470735139870906, 0.1582307652268997, 0.14904595771667492, -0.1121272683273727, -0.3554533862892319, 0.02590913617545191, -0.15248973323169218, -0.14493577308021485, -0.076272644066964, 0.021135637314771027, -0.035383427630329284, -0.25752180984298534, 0.16230271473965224, 0.06379214664921165, 0.05857958874309107, -0.09035451274762368, -0.06340862414525712, -0.06906643245259629, 0.12819115949301596, 0.09394074029234402, 0.015146341724047328, 0.12715570708764168, -0.1929561978979858, -0.03384029756313847, 0.4488679951604675, -0.02427597601310802, -0.10729800655561335, 0.19148082412601283, -0.1373377041412716, -0.06795351720853325, 0.19678425823393114, 0.11758117036626893, 0.039723425963893534, -0.10216037937823463, 0.12119249395156444, 0.014929851684171488, 0.11676917780628976, -0.06015768097987508, 0.07087187810855754, 0.2500039583647295, 0.1639849237001994, 0.039149720550459975, 0.1455233151349068, -0.07920000285529942, -0.08879497513065443, -0.2595643488745041, -0.1625174528097405, -0.2526384170769769, 0.08653090412673704, -0.13671674066854927, -0.24086430565015796, 0.3847965257737087, 0.18720166206904276, 0.14827929273768164, -0.09212862893610316, 0.21505311640828628, 0.11847843692898202, 0.06602371226557914, 0.009623009670416223, 0.3156892517644926, 0.14845787447959405, 0.10825870178420754, -0.28592366801766567, 0.08545530749868382, 0.10427091301637975] |
1,802.09051 | Graphs with equal domination and covering numbers | A dominating set of a graph $G$ is a set $D\subseteq V_G$ such that every
vertex in $V_G-D$ is adjacent to at least one vertex in $D$, and the domination
number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of
$G$. A set $C\subseteq V_G$ is a covering set of $G$ if every edge of $G$ has
at least one vertex in $C$. The covering number $\beta(G)$ of $G$ is the
minimum cardinality of a covering set of $G$. The set of connected graphs $G$
for which $\gamma(G)=\beta(G)$ is denoted by ${\cal C}_{\gamma=\beta}$, while
${\cal B}$ denotes the set of all connected bipartite graphs in which the
domination number is equal to the cardinality of the smaller partite set. In
this paper, we provide alternative characterizations of graphs belonging to
${\cal C}_{\gamma=\beta}$ and ${\cal B}$. Next, we present a quadratic time
algorithm for recognizing bipartite graphs belonging to ${\cal B}$, and, as a
side result, we conclude that the algorithm of Arumugam et al. [2] allows to
recognize all the graphs belonging to the set ${\cal C}_{\gamma=\beta}$ in
quadratic time either. Finally, we consider the related problem of patrolling
grids with mobile guards, and show that this problem can be solved in $O(n \log
n + m)$ time, where $n$ is the number of line segments of the input grid and
$m$ is the number of its intersection points.
| math.CO | a dominating set of a graph g is a set dsubseteq v_g such that every vertex in v_gd is adjacent to at least one vertex in d and the domination number gammag of g is the minimum cardinality of a dominating set of g a set csubseteq v_g is a covering set of g if every edge of g has at least one vertex in c the covering number betag of g is the minimum cardinality of a covering set of g the set of connected graphs g for which gammagbetag is denoted by cal c_gammabeta while cal b denotes the set of all connected bipartite graphs in which the domination number is equal to the cardinality of the smaller partite set in this paper we provide alternative characterizations of graphs belonging to cal c_gammabeta and cal b next we present a quadratic time algorithm for recognizing bipartite graphs belonging to cal b and as a side result we conclude that the algorithm of arumugam et al 2 allows to recognize all the graphs belonging to the set cal c_gammabeta in quadratic time either finally we consider the related problem of patrolling grids with mobile guards and show that this problem can be solved in on log n m time where n is the number of line segments of the input grid and m is the number of its intersection points | [['a', 'dominating', 'set', 'of', 'a', 'graph', 'g', 'is', 'a', 'set', 'dsubseteq', 'v_g', 'such', 'that', 'every', 'vertex', 'in', 'v_gd', 'is', 'adjacent', 'to', 'at', 'least', 'one', 'vertex', 'in', 'd', 'and', 'the', 'domination', 'number', 'gammag', 'of', 'g', 'is', 'the', 'minimum', 'cardinality', 'of', 'a', 'dominating', 'set', 'of', 'g', 'a', 'set', 'csubseteq', 'v_g', 'is', 'a', 'covering', 'set', 'of', 'g', 'if', 'every', 'edge', 'of', 'g', 'has', 'at', 'least', 'one', 'vertex', 'in', 'c', 'the', 'covering', 'number', 'betag', 'of', 'g', 'is', 'the', 'minimum', 'cardinality', 'of', 'a', 'covering', 'set', 'of', 'g', 'the', 'set', 'of', 'connected', 'graphs', 'g', 'for', 'which', 'gammagbetag', 'is', 'denoted', 'by', 'cal', 'c_gammabeta', 'while', 'cal', 'b', 'denotes', 'the', 'set', 'of', 'all', 'connected', 'bipartite', 'graphs', 'in', 'which', 'the', 'domination', 'number', 'is', 'equal', 'to', 'the', 'cardinality', 'of', 'the', 'smaller', 'partite', 'set', 'in', 'this', 'paper', 'we', 'provide', 'alternative', 'characterizations', 'of', 'graphs', 'belonging', 'to', 'cal', 'c_gammabeta', 'and', 'cal', 'b', 'next', 'we', 'present', 'a', 'quadratic', 'time', 'algorithm', 'for', 'recognizing', 'bipartite', 'graphs', 'belonging', 'to', 'cal', 'b', 'and', 'as', 'a', 'side', 'result', 'we', 'conclude', 'that', 'the', 'algorithm', 'of', 'arumugam', 'et', 'al', '2', 'allows', 'to', 'recognize', 'all', 'the', 'graphs', 'belonging', 'to', 'the', 'set', 'cal', 'c_gammabeta', 'in', 'quadratic', 'time', 'either', 'finally', 'we', 'consider', 'the', 'related', 'problem', 'of', 'patrolling', 'grids', 'with', 'mobile', 'guards', 'and', 'show', 'that', 'this', 'problem', 'can', 'be', 'solved', 'in', 'on', 'log', 'n', 'm', 'time', 'where', 'n', 'is', 'the', 'number', 'of', 'line', 'segments', 'of', 'the', 'input', 'grid', 'and', 'm', 'is', 'the', 'number', 'of', 'its', 'intersection', 'points']] | [-0.21194380730512025, 0.1232982473731365, 0.004837725874360489, -0.03833940536968167, -0.08471992359415668, -0.13523389714486572, 0.06767935285941981, 0.33245216167491415, -0.25953914309325427, -0.34168635022057137, 0.06969532373654859, -0.33863340264860714, -0.09141203312041318, 0.11959445527273878, -0.08359572478448567, 0.01551835090263605, 0.06532846852813078, 0.14995598764596607, 0.040421539623006854, -0.28449475039568545, 0.294601950977686, -0.08725268151206167, 0.13891978559651127, 0.0441173963572668, 0.06366319756792939, -0.001104922619972216, 0.014172786974307636, 0.12259040242061019, -0.1463426583380446, 0.08640529774838006, 0.25524190856022355, 0.20285812795830324, 0.2849902135218777, -0.35325890741305954, -0.1182031556229998, 0.23111244540499604, 0.0864249941346276, -0.006354190131811344, 0.0690537116702889, -0.18046744451250718, 0.16053522603343362, -0.13614785826319586, -0.07969931829012121, 0.053511953042091234, 0.16884551030259742, -0.02795044171608701, -0.3242764294026015, -0.0388930630242533, 0.048320704884827134, 0.031516228456293115, 0.06671869618053872, -0.1506092939009566, -0.08174637892364484, 0.08318743439512732, -0.07876110342078153, 0.11586187960499007, 0.01509862949454185, -0.10135461765989337, -0.12780630713045274, 0.41241624115196907, -0.03020600288747, -0.13874072123966788, 0.12755444933478113, -0.1552761940477902, -0.15077590124033716, 0.11224482666863048, 0.1647111154505578, 0.1882319807469764, -0.08519965663714253, 0.18704885260946036, -0.15089593509860014, 0.10619215319419037, 0.09819611826425662, 0.02558928013212331, 0.12610377508377577, 0.15898245454300194, 0.18587615091869933, 0.17786379341268913, -0.026977684557356912, 0.06640507911569844, -0.3578276769501036, -0.09984125824867869, -0.24453914532863089, 0.0733379127326138, -0.14375637079881373, -0.19312597804338388, 0.42697948858789775, 0.10080739625162728, 0.22816768122593994, 0.09988692701976422, 0.20228080734934495, 0.08994250987952514, 0.048089770912243375, 0.19032188227764615, 0.09861799527526549, 0.15596419429993663, -0.07067651934364973, -0.21626963896029022, 0.02006591875207327, 0.16307722062034452] |
1,802.09052 | Wide Compression: Tensor Ring Nets | Deep neural networks have demonstrated state-of-the-art performance in a
variety of real-world applications. In order to obtain performance gains, these
networks have grown larger and deeper, containing millions or even billions of
parameters and over a thousand layers. The trade-off is that these large
architectures require an enormous amount of memory, storage, and computation,
thus limiting their usability. Inspired by the recent tensor ring
factorization, we introduce Tensor Ring Networks (TR-Nets), which significantly
compress both the fully connected layers and the convolutional layers of deep
neural networks. Our results show that our TR-Nets approach {is able to
compress LeNet-5 by $11\times$ without losing accuracy}, and can compress the
state-of-the-art Wide ResNet by $243\times$ with only 2.3\% degradation in
{Cifar10 image classification}. Overall, this compression scheme shows promise
in scientific computing and deep learning, especially for emerging
resource-constrained devices such as smartphones, wearables, and IoT devices.
| cs.LG cs.CV stat.ML | deep neural networks have demonstrated stateoftheart performance in a variety of realworld applications in order to obtain performance gains these networks have grown larger and deeper containing millions or even billions of parameters and over a thousand layers the tradeoff is that these large architectures require an enormous amount of memory storage and computation thus limiting their usability inspired by the recent tensor ring factorization we introduce tensor ring networks trnets which significantly compress both the fully connected layers and the convolutional layers of deep neural networks our results show that our trnets approach is able to compress lenet5 by 11times without losing accuracy and can compress the stateoftheart wide resnet by 243times with only 23 degradation in cifar10 image classification overall this compression scheme shows promise in scientific computing and deep learning especially for emerging resourceconstrained devices such as smartphones wearables and iot devices | [['deep', 'neural', 'networks', 'have', 'demonstrated', 'stateoftheart', 'performance', 'in', 'a', 'variety', 'of', 'realworld', 'applications', 'in', 'order', 'to', 'obtain', 'performance', 'gains', 'these', 'networks', 'have', 'grown', 'larger', 'and', 'deeper', 'containing', 'millions', 'or', 'even', 'billions', 'of', 'parameters', 'and', 'over', 'a', 'thousand', 'layers', 'the', 'tradeoff', 'is', 'that', 'these', 'large', 'architectures', 'require', 'an', 'enormous', 'amount', 'of', 'memory', 'storage', 'and', 'computation', 'thus', 'limiting', 'their', 'usability', 'inspired', 'by', 'the', 'recent', 'tensor', 'ring', 'factorization', 'we', 'introduce', 'tensor', 'ring', 'networks', 'trnets', 'which', 'significantly', 'compress', 'both', 'the', 'fully', 'connected', 'layers', 'and', 'the', 'convolutional', 'layers', 'of', 'deep', 'neural', 'networks', 'our', 'results', 'show', 'that', 'our', 'trnets', 'approach', 'is', 'able', 'to', 'compress', 'lenet5', 'by', '11times', 'without', 'losing', 'accuracy', 'and', 'can', 'compress', 'the', 'stateoftheart', 'wide', 'resnet', 'by', '243times', 'with', 'only', '23', 'degradation', 'in', 'cifar10', 'image', 'classification', 'overall', 'this', 'compression', 'scheme', 'shows', 'promise', 'in', 'scientific', 'computing', 'and', 'deep', 'learning', 'especially', 'for', 'emerging', 'resourceconstrained', 'devices', 'such', 'as', 'smartphones', 'wearables', 'and', 'iot', 'devices']] | [-0.10452099032439552, 0.0055977594819924485, 0.016644686050192044, -0.005923816370061384, -0.06381179214214215, -0.17152524712475967, 0.007520642714457704, 0.4577167509579575, -0.29136892890238525, -0.3720332362096418, 0.08456825511204405, -0.2724130444580337, -0.20187636766537137, 0.23333741900172422, -0.10048894464975333, 0.09504341084666394, 0.17620333718132697, -0.003527240239904373, -0.07490803449987792, -0.36408691394136294, 0.25041151680117407, 0.04765100807860865, 0.3800828114633898, 0.06787505102102885, 0.09888024283963796, -0.07478060421592497, 0.01580197815425121, -0.014495665292170916, -0.013661988200542478, 0.20790936560630538, 0.30849230325767785, 0.1492232964992836, 0.3183822736739982, -0.5001574021640357, -0.2840020105542315, 0.097566665716834, 0.178050940397189, 0.060864353729118886, -0.048577106841090886, -0.3055659334885178, 0.16980986566432602, -0.257152191965704, 0.022369737526844746, -0.19660114329080325, 0.00272096924229779, 0.037560345635951294, -0.24139187716589133, -0.001963513493016883, 0.046340582569917806, 0.04832806338725442, 0.009835141307757386, -0.14024694786582897, 0.02731114934797731, 0.15699075514913075, -0.035898119694768235, 0.04542652253058277, 0.16001155001430453, -0.24628480668244818, -0.12160364711018917, 0.3294789125927939, -0.058220541512535015, -0.14360725068181127, 0.20449251475112212, -0.020304720939977185, -0.10760470948970088, 0.11430480315551891, 0.2541566168159976, 0.09233272549129658, -0.12245344968473577, 0.024150937773251478, -0.016775864293681574, 0.19909811270638153, 0.07347431631719732, 0.08006028640832934, 0.16905522434093007, 0.2897644023430514, 0.03122846021233908, 0.13053198488733658, -0.1300838007787047, -0.06951271257545617, -0.13031145848880907, -0.11689311395549065, -0.19683275031010536, 0.07232287036697868, -0.16621274871263617, -0.11196570704085426, 0.37794145633607684, 0.22027421201265032, 0.20929059158877136, 0.11300684008307729, 0.37127434517015945, -0.01588015432121115, 0.22785659606399183, 0.14437278109713347, 0.21001823981442339, 0.05558256837995267, 0.17466891416547156, -0.12336609309207049, 0.05726440092369627, -0.011737222268760622] |
1,802.09053 | Estimation of the Evolutionary Spectra with Application to Stationarity
Test | In this work, we propose a new inference procedure for understanding
non-stationary processes, under the framework of evolutionary spectra developed
by Priestley. Among various frameworks of modeling non-stationary processes,
the distinguishing feature of the evolutionary spectra is its focus on the
physical meaning of frequency. The classical estimate of the evolutionary
spectral density is based on a double-window technique consisting of a
short-time Fourier transform and a smoothing. However, smoothing is known to
suffer from the so-called bias leakage problem. By incorporating Thomson's
multitaper method that was originally designed for stationary processes, we
propose an improved estimate of the evolutionary spectral density, and analyze
its bias/variance/resolution tradeoff. As an application of the new estimate,
we further propose a non-parametric rank-based stationarity test, and provide
various experimental studies.
| stat.ME | in this work we propose a new inference procedure for understanding nonstationary processes under the framework of evolutionary spectra developed by priestley among various frameworks of modeling nonstationary processes the distinguishing feature of the evolutionary spectra is its focus on the physical meaning of frequency the classical estimate of the evolutionary spectral density is based on a doublewindow technique consisting of a shorttime fourier transform and a smoothing however smoothing is known to suffer from the socalled bias leakage problem by incorporating thomsons multitaper method that was originally designed for stationary processes we propose an improved estimate of the evolutionary spectral density and analyze its biasvarianceresolution tradeoff as an application of the new estimate we further propose a nonparametric rankbased stationarity test and provide various experimental studies | [['in', 'this', 'work', 'we', 'propose', 'a', 'new', 'inference', 'procedure', 'for', 'understanding', 'nonstationary', 'processes', 'under', 'the', 'framework', 'of', 'evolutionary', 'spectra', 'developed', 'by', 'priestley', 'among', 'various', 'frameworks', 'of', 'modeling', 'nonstationary', 'processes', 'the', 'distinguishing', 'feature', 'of', 'the', 'evolutionary', 'spectra', 'is', 'its', 'focus', 'on', 'the', 'physical', 'meaning', 'of', 'frequency', 'the', 'classical', 'estimate', 'of', 'the', 'evolutionary', 'spectral', 'density', 'is', 'based', 'on', 'a', 'doublewindow', 'technique', 'consisting', 'of', 'a', 'shorttime', 'fourier', 'transform', 'and', 'a', 'smoothing', 'however', 'smoothing', 'is', 'known', 'to', 'suffer', 'from', 'the', 'socalled', 'bias', 'leakage', 'problem', 'by', 'incorporating', 'thomsons', 'multitaper', 'method', 'that', 'was', 'originally', 'designed', 'for', 'stationary', 'processes', 'we', 'propose', 'an', 'improved', 'estimate', 'of', 'the', 'evolutionary', 'spectral', 'density', 'and', 'analyze', 'its', 'biasvarianceresolution', 'tradeoff', 'as', 'an', 'application', 'of', 'the', 'new', 'estimate', 'we', 'further', 'propose', 'a', 'nonparametric', 'rankbased', 'stationarity', 'test', 'and', 'provide', 'various', 'experimental', 'studies']] | [-0.047082120394334195, 0.02903042888478376, -0.17126303017139435, 0.1144191602114588, -0.07365837980806828, -0.11391174765303731, 0.05043915816769004, 0.37380839347839356, -0.25759515188261867, -0.3077719816192985, 0.12204948287829756, -0.17871571071713696, -0.1760404254789464, 0.18933823189139365, -0.08273226023465395, 0.09063515643682331, 0.029915220871567727, -0.02937821471481584, -0.07693846453726291, -0.1696793921664357, 0.32984749230369925, 0.08031766994670034, 0.3232347067333758, -0.009309234055224807, 0.11085640281066299, 0.023570370245724916, -0.11242434159945697, -0.019804908196441828, -0.15375045530154602, 0.15198342487122862, 0.2078229983597994, 0.19430415366217493, 0.3243620970547199, -0.3865254830569029, -0.270589876703918, 0.09253831060696394, 0.1343351485710591, 0.08407603134214878, -0.07466705321450717, -0.2705185365825892, 0.06679479069262743, -0.13799629144743084, -0.08632565834745765, -0.09815035654604434, -0.02007839247956872, 0.03335251367371529, -0.29893540677428243, 0.09077702043950557, 0.0942191826980561, 0.041856116488575935, -0.0623116111587733, -0.11660248717293144, 0.04993146869726479, 0.12161454045027495, 0.030837837539613246, -0.02998422222211957, 0.10481791423633695, -0.09344733028672636, -0.15033430855721236, 0.33882807797193526, -0.0827192765455693, -0.1828124503493309, 0.21325298378802837, -0.05399907662719488, -0.1436372487526387, 0.09941363697126508, 0.2054142139106989, 0.14667517102509736, -0.22284555951040239, 0.09079602844873444, -0.0033075125832110644, 0.13891897420957686, 0.01873610421642661, 0.020687372621148826, 0.17082723782770334, 0.21157166686654091, 0.059870677564758806, 0.16632809544354676, -0.1566302811615169, -0.0809207981750369, -0.2641921077668667, -0.13817470769584178, -0.18744925800338388, 0.021603283332660796, -0.10116562263632659, -0.19957120448350907, 0.42475162344053385, 0.19607639736821875, 0.20350754744186997, 0.06423923944681884, 0.30813838018104434, 0.1529787801830098, 0.005285784941166639, 0.03580115082487464, 0.1885483783632517, 0.14507316319271923, 0.07995690688490868, -0.23469852789677678, 0.09028198241442442, 0.06411433332785964] |
1,802.09054 | Comparison of computational codes for direct numerical simulations of
turbulent Rayleigh-B\'enard convection | Computational codes for direct numerical simulations of Rayleigh-B\'enard
(RB) convection are compared in terms of computational cost and quality of the
solution. As a benchmark case, RB convection at $Ra=10^8$ and $Pr=1$ in a
periodic domain, in cubic and cylindrical containers is considered. A dedicated
second-order finite-difference code (AFID/RBflow) and a specialized
fourth-order finite-volume code (Goldfish) are compared with a general purpose
finite-volume approach (OpenFOAM) and a general purpose spectral-element code
(Nek5000). Reassuringly, all codes provide predictions of the average heat
transfer that converge to the same values. The computational costs, however,
are found to differ considerably. The specialized codes AFID/RBflow and
Goldfish are found to excel in efficiency, outperforming the general purpose
flow solvers Nek5000 and OpenFOAM by an order of magnitude with an error on the
Nusselt number $Nu$ below $5\%$. However, we find that $Nu$ alone is not
sufficient to assess the quality of the numerical results: in fact,
instantaneous snapshots of the temperature field from a near wall region
obtained for deliberately under-resolved simulations using Nek5000 clearly
indicate inadequate flow resolution even when $Nu$ is converged. Overall,
dedicated special purpose codes for RB convection are found to be more
efficient than general purpose codes.
| physics.flu-dyn | computational codes for direct numerical simulations of rayleighbenard rb convection are compared in terms of computational cost and quality of the solution as a benchmark case rb convection at ra108 and pr1 in a periodic domain in cubic and cylindrical containers is considered a dedicated secondorder finitedifference code afidrbflow and a specialized fourthorder finitevolume code goldfish are compared with a general purpose finitevolume approach openfoam and a general purpose spectralelement code nek5000 reassuringly all codes provide predictions of the average heat transfer that converge to the same values the computational costs however are found to differ considerably the specialized codes afidrbflow and goldfish are found to excel in efficiency outperforming the general purpose flow solvers nek5000 and openfoam by an order of magnitude with an error on the nusselt number nu below 5 however we find that nu alone is not sufficient to assess the quality of the numerical results in fact instantaneous snapshots of the temperature field from a near wall region obtained for deliberately underresolved simulations using nek5000 clearly indicate inadequate flow resolution even when nu is converged overall dedicated special purpose codes for rb convection are found to be more efficient than general purpose codes | [['computational', 'codes', 'for', 'direct', 'numerical', 'simulations', 'of', 'rayleighbenard', 'rb', 'convection', 'are', 'compared', 'in', 'terms', 'of', 'computational', 'cost', 'and', 'quality', 'of', 'the', 'solution', 'as', 'a', 'benchmark', 'case', 'rb', 'convection', 'at', 'ra108', 'and', 'pr1', 'in', 'a', 'periodic', 'domain', 'in', 'cubic', 'and', 'cylindrical', 'containers', 'is', 'considered', 'a', 'dedicated', 'secondorder', 'finitedifference', 'code', 'afidrbflow', 'and', 'a', 'specialized', 'fourthorder', 'finitevolume', 'code', 'goldfish', 'are', 'compared', 'with', 'a', 'general', 'purpose', 'finitevolume', 'approach', 'openfoam', 'and', 'a', 'general', 'purpose', 'spectralelement', 'code', 'nek5000', 'reassuringly', 'all', 'codes', 'provide', 'predictions', 'of', 'the', 'average', 'heat', 'transfer', 'that', 'converge', 'to', 'the', 'same', 'values', 'the', 'computational', 'costs', 'however', 'are', 'found', 'to', 'differ', 'considerably', 'the', 'specialized', 'codes', 'afidrbflow', 'and', 'goldfish', 'are', 'found', 'to', 'excel', 'in', 'efficiency', 'outperforming', 'the', 'general', 'purpose', 'flow', 'solvers', 'nek5000', 'and', 'openfoam', 'by', 'an', 'order', 'of', 'magnitude', 'with', 'an', 'error', 'on', 'the', 'nusselt', 'number', 'nu', 'below', '5', 'however', 'we', 'find', 'that', 'nu', 'alone', 'is', 'not', 'sufficient', 'to', 'assess', 'the', 'quality', 'of', 'the', 'numerical', 'results', 'in', 'fact', 'instantaneous', 'snapshots', 'of', 'the', 'temperature', 'field', 'from', 'a', 'near', 'wall', 'region', 'obtained', 'for', 'deliberately', 'underresolved', 'simulations', 'using', 'nek5000', 'clearly', 'indicate', 'inadequate', 'flow', 'resolution', 'even', 'when', 'nu', 'is', 'converged', 'overall', 'dedicated', 'special', 'purpose', 'codes', 'for', 'rb', 'convection', 'are', 'found', 'to', 'be', 'more', 'efficient', 'than', 'general', 'purpose', 'codes']] | [-0.09914696956473897, 0.059338774746052245, -0.022268240604958286, 0.0888911021697544, -0.02521817624207814, -0.1631279497630704, 0.0039194135306574104, 0.3619502198101943, -0.21625879259627998, -0.31016424203253523, 0.11642302177271482, -0.2555336212865267, -0.06599415124546053, 0.2631279251203226, -0.05646503703179888, 0.10498010957019929, 0.1297241525928851, -0.005012348932018076, -0.08984803839388295, -0.23933692007534663, 0.25143718187119907, 0.12853852126804388, 0.2758528991431302, 0.02818802452874275, 0.013987045251937792, -0.10997827324484076, -0.051933541406915355, 0.054636620780410323, -0.16955990377109442, 0.05951766461390546, 0.27516417050311265, 0.060638799602926084, 0.2454377230736712, -0.43332506014908456, -0.2334234604222358, 0.03314337594379975, 0.15514364129417024, 0.13380578206614496, -0.04683020143398162, -0.19066688660603512, 0.12491247495303728, -0.17272500816628109, -0.07153579578212253, -0.08444455357111648, -0.0169914035876139, 0.037376409542642305, -0.3156709395638876, 0.07209070630095975, 0.0104581372092516, 0.1234250511642669, -0.04574617866559753, -0.16665682636144363, -0.014276798382135374, 0.10803369879179126, 0.014722101265037129, 0.051736796890119355, 0.0860771252654911, -0.10734882558296834, -0.06249474424023029, 0.4305669749820871, -0.06325572569433147, -0.26813120625399967, 0.1926293063538187, -0.1252169177157101, -0.05698618163088603, 0.18784478306503044, 0.18070303375965782, 0.1311482611107545, -0.10237717720104099, 0.053352783997460004, -0.01786118088413638, 0.1961190461600437, 0.07869541664769379, -0.029655660825724503, 0.12895394837939922, 0.16296126518864185, 0.0322698163069376, 0.1329403009642229, -0.06746611824824608, -0.10814191861914432, -0.2733219373562582, -0.14408992520504993, -0.1808192280759056, 0.004399286132921793, -0.09952656437792252, -0.14893572413771206, 0.3391631181644067, 0.1521334984430055, 0.08310425089587867, 0.0942379459382358, 0.33195095026285903, 0.08104296520676664, 0.06070965854094687, 0.17534212055330983, 0.20839330265702374, 0.12931650625777905, 0.11861467259289811, -0.24844154685721448, 0.019903466903737614, 0.07327695293304491] |
1,802.09055 | Domain Specific Design Patterns: Designing For Conversational User
Interfaces | Designing conversational user interface experience is complicated because
conversation comes with many expectations. When these expectations are met, we
feel the interface is natural, but once violated, we feel something is amiss.
The last decade witnessed human language technologies and behaviours to enable
humans converse with software using spoken dialogue to access, create and
process information. Less is known about the practicalities of designing
chatbot interactions. In this paper, we introduce the nature of conversational
user interfaces (CUIs) and describe the underlying technologies they are based
on. Moreover, we define guidelines for designing conversational interfaces in
various domains. This paper particularly focuses on classifying the elements
and techniques used in CUI design patterns. After concluding certain challenges
with CUI, we discuss important features and chatbot states to be considered in
CUI design for specific domain. We envisage this study to support CUI
researchers to design tailored chatbots applicable into certain domain and
improve the current state of research challenges in the field of Artificial
Intelligence and conversational agents.
| cs.HC | designing conversational user interface experience is complicated because conversation comes with many expectations when these expectations are met we feel the interface is natural but once violated we feel something is amiss the last decade witnessed human language technologies and behaviours to enable humans converse with software using spoken dialogue to access create and process information less is known about the practicalities of designing chatbot interactions in this paper we introduce the nature of conversational user interfaces cuis and describe the underlying technologies they are based on moreover we define guidelines for designing conversational interfaces in various domains this paper particularly focuses on classifying the elements and techniques used in cui design patterns after concluding certain challenges with cui we discuss important features and chatbot states to be considered in cui design for specific domain we envisage this study to support cui researchers to design tailored chatbots applicable into certain domain and improve the current state of research challenges in the field of artificial intelligence and conversational agents | [['designing', 'conversational', 'user', 'interface', 'experience', 'is', 'complicated', 'because', 'conversation', 'comes', 'with', 'many', 'expectations', 'when', 'these', 'expectations', 'are', 'met', 'we', 'feel', 'the', 'interface', 'is', 'natural', 'but', 'once', 'violated', 'we', 'feel', 'something', 'is', 'amiss', 'the', 'last', 'decade', 'witnessed', 'human', 'language', 'technologies', 'and', 'behaviours', 'to', 'enable', 'humans', 'converse', 'with', 'software', 'using', 'spoken', 'dialogue', 'to', 'access', 'create', 'and', 'process', 'information', 'less', 'is', 'known', 'about', 'the', 'practicalities', 'of', 'designing', 'chatbot', 'interactions', 'in', 'this', 'paper', 'we', 'introduce', 'the', 'nature', 'of', 'conversational', 'user', 'interfaces', 'cuis', 'and', 'describe', 'the', 'underlying', 'technologies', 'they', 'are', 'based', 'on', 'moreover', 'we', 'define', 'guidelines', 'for', 'designing', 'conversational', 'interfaces', 'in', 'various', 'domains', 'this', 'paper', 'particularly', 'focuses', 'on', 'classifying', 'the', 'elements', 'and', 'techniques', 'used', 'in', 'cui', 'design', 'patterns', 'after', 'concluding', 'certain', 'challenges', 'with', 'cui', 'we', 'discuss', 'important', 'features', 'and', 'chatbot', 'states', 'to', 'be', 'considered', 'in', 'cui', 'design', 'for', 'specific', 'domain', 'we', 'envisage', 'this', 'study', 'to', 'support', 'cui', 'researchers', 'to', 'design', 'tailored', 'chatbots', 'applicable', 'into', 'certain', 'domain', 'and', 'improve', 'the', 'current', 'state', 'of', 'research', 'challenges', 'in', 'the', 'field', 'of', 'artificial', 'intelligence', 'and', 'conversational', 'agents']] | [-0.11652866957313938, 0.08488515703287115, -0.04813035232507105, 0.09847226445003934, -0.18898514784247933, -0.21135570747989738, 0.024723805170673543, 0.4319661007580643, -0.2545482663836464, -0.3156863390161338, 0.07553459394829136, -0.27221067501845475, -0.21680097970107715, 0.21257318984605594, -0.14155678053436702, 0.03916161472234362, 0.061298240143471135, 0.005374757748677166, 0.011858041447024056, -0.2732909028153465, 0.32931423130930365, 0.02501979352582893, 0.34074024247105966, 0.09686434515026916, 0.03855513769040208, 0.010981877897670883, -0.03487721132532788, -0.050804074312710834, -0.11410331796062831, 0.18542082158919748, 0.3996193224081803, 0.20563804772319996, 0.3399979661770923, -0.4747757258083292, -0.1734905546366566, 0.053540899683888664, 0.13562152728725582, 0.10492589068041368, -0.08622348559657837, -0.33026825207213084, 0.08692886031436327, -0.17080654918556354, -0.06964321310275016, -0.08391713700048112, -0.005837589823696651, -0.005578180392688241, -0.23141561815526315, -0.05181933254349285, 0.0931169698753779, 0.11364502731353758, -0.04766162731099182, -0.10909279207643233, 0.047804252496881486, 0.19734223070083895, 0.054938033006877586, 0.023358394010522275, 0.15346250127064076, -0.18819368926914196, -0.1506821932215355, 0.38887866235109503, 0.021730941189118398, -0.21393933626795245, 0.2378482662411797, -0.06918311707987757, -0.15945893248353532, 0.02255863940878632, 0.24497402091942794, 0.07176508407058295, -0.18750575759692445, 0.03743480268376461, 0.045951034759399954, 0.18710834390768213, 0.042677411642085904, 0.023834740709580346, 0.22706471870424683, 0.22443236610684877, 0.023744932353541165, 0.1132165491295153, 0.038122335418188824, -0.09029696870896363, -0.20035662451859362, -0.1755672243359627, -0.12012971637764956, 0.0001217889345758511, 0.013416682781033291, -0.11332242885565463, 0.34941730122946335, 0.24539719685826042, 0.12215150982241876, 0.01709903106595317, 0.27004027360921984, 0.04814796293890494, 0.06371615699654122, 0.07323320825238472, 0.1798411188682006, -0.0042884214697573, 0.1982091831752311, -0.1284040644099869, 0.1290406180841257, -0.010908819521738295] |
1,802.09056 | Analytic interpolation into the tetrablock and a $\mu$-synthesis problem | We give a solvability criterion for a special case of the $\mu$-synthesis
problem. That is, we prove the necessity and sufficiency of a condition for the
existence of an analytic $2 \times 2$ matrix-valued function on the disc
subject to a bound on the structured singular value and satisfying a finite set
of interpolation conditions. To do this we prove a realization theorem for
analytic functions from the disc to the tetrablock. We also obtain a
solvability criterion for the problem of analytic interpolation from the disc
to the tetrablock.
| math.CV | we give a solvability criterion for a special case of the musynthesis problem that is we prove the necessity and sufficiency of a condition for the existence of an analytic 2 times 2 matrixvalued function on the disc subject to a bound on the structured singular value and satisfying a finite set of interpolation conditions to do this we prove a realization theorem for analytic functions from the disc to the tetrablock we also obtain a solvability criterion for the problem of analytic interpolation from the disc to the tetrablock | [['we', 'give', 'a', 'solvability', 'criterion', 'for', 'a', 'special', 'case', 'of', 'the', 'musynthesis', 'problem', 'that', 'is', 'we', 'prove', 'the', 'necessity', 'and', 'sufficiency', 'of', 'a', 'condition', 'for', 'the', 'existence', 'of', 'an', 'analytic', '2', 'times', '2', 'matrixvalued', 'function', 'on', 'the', 'disc', 'subject', 'to', 'a', 'bound', 'on', 'the', 'structured', 'singular', 'value', 'and', 'satisfying', 'a', 'finite', 'set', 'of', 'interpolation', 'conditions', 'to', 'do', 'this', 'we', 'prove', 'a', 'realization', 'theorem', 'for', 'analytic', 'functions', 'from', 'the', 'disc', 'to', 'the', 'tetrablock', 'we', 'also', 'obtain', 'a', 'solvability', 'criterion', 'for', 'the', 'problem', 'of', 'analytic', 'interpolation', 'from', 'the', 'disc', 'to', 'the', 'tetrablock']] | [-0.13365391196890009, -0.010818801891259177, -0.12075893486746483, 0.10591436694893572, -0.10192492268720849, -0.08824360647445752, 0.06114340266212821, 0.31986711571613946, -0.26904672369774846, -0.19770885868411925, 0.1605457377464821, -0.21262125604941198, -0.1372343783784244, 0.22571455751571598, -0.07272345060482621, 0.07554861675533983, 0.05165916975173685, 0.03392037583722009, -0.11485388738154952, -0.2388077331913842, 0.382623204547498, -0.04777470261582898, 0.1758920833054516, 0.11452384852907724, 0.11622684912532956, 0.03232807450824314, 0.033631900237459274, -0.035883970393074886, -0.22984029850186843, 0.12440072472155508, 0.2148690700944927, 0.14618559231878156, 0.2992914479018913, -0.3884453849039144, -0.15180268820064763, 0.15828988742497233, 0.08869998528841987, 0.07734064567420218, -0.04009957735478464, -0.23413370069271575, 0.15938037179100017, -0.11940512138987995, -0.1978638158645481, -0.01971189285007616, 0.02718388883707424, -0.00011729743952552478, -0.3876988987593601, 0.06838813669067652, 0.1428873025876884, 0.0729543078587287, -0.1599166450685718, -0.06769662273840772, 0.027267621339867928, 0.060747945562212004, 0.009917101188976731, 0.0389042258159154, 0.05124504141923454, -0.10673571556754824, -0.055042143911123276, 0.34883780253068025, -0.029623839466108217, -0.2828099003682534, 0.15030050507048145, -0.12480418352513678, -0.12349790155680643, 0.06547310691870128, 0.14921878325856394, 0.15964892810669779, -0.08967898408364919, 0.12995883935105262, -0.1342543200072315, 0.12141853534202608, 0.08887497075936861, 0.0008508010715660122, 0.12274467507377267, 0.07535010584526591, 0.1797502050926495, 0.19234850804011028, -0.006733720133908921, -0.06639641502665149, -0.38010617304179406, -0.16323108364530425, -0.16621082829725412, 0.12038240752493341, -0.11040044875990133, -0.22186827669954962, 0.38469081152644424, 0.10369573439885345, 0.22023756448696885, 0.13959894714256127, 0.25693024622483385, 0.16428228013311227, 0.012999632799377044, 0.05366331529803574, 0.1768259723774261, 0.17369760118890554, 0.06126948923079504, -0.161455579702225, 0.026702341839619396, 0.1656395255484515] |
1,802.09057 | First derivatives at the optimum analysis (\textit{fdao}): An approach
to estimate the uncertainty in nonlinear regression involving stochastically
independent variables | An important problem of optimization analysis surges when parameters such as
$ \{\theta_j\}_{j=1,\, \dots \,,k }$, determining a function $
y=f(x\given\{\theta_j\}) $, must be estimated from a set of observables $ \{
x_i,y_i\}_{i=1,\, \dots \,,m} $. Where $ \{x_i\} $ are independent variables
assumed to be uncertainty-free. It is known that analytical solutions are
possible if $ y=f(x\given\theta_j) $ is a linear combination of $
\{\theta_{j=1,\, \dots \,,k} \}.$ Here it is proposed that determining the
uncertainty of parameters that are not \textit{linearly independent} may be
achieved from derivatives $ \tfrac{\partial f(x \given \{\theta_j\})}{\partial
\theta_j} $ at an optimum, if the parameters are \textit{stochastically
independent}.
| stat.ME | an important problem of optimization analysis surges when parameters such as theta_j_j1 dots k determining a function yfxgiventheta_j must be estimated from a set of observables x_iy_i_i1 dots m where x_i are independent variables assumed to be uncertaintyfree it is known that analytical solutions are possible if yfxgiventheta_j is a linear combination of theta_j1 dots k here it is proposed that determining the uncertainty of parameters that are not textitlinearly independent may be achieved from derivatives tfracpartial fx given theta_jpartial theta_j at an optimum if the parameters are textitstochastically independent | [['an', 'important', 'problem', 'of', 'optimization', 'analysis', 'surges', 'when', 'parameters', 'such', 'as', 'theta_j_j1', 'dots', 'k', 'determining', 'a', 'function', 'yfxgiventheta_j', 'must', 'be', 'estimated', 'from', 'a', 'set', 'of', 'observables', 'x_iy_i_i1', 'dots', 'm', 'where', 'x_i', 'are', 'independent', 'variables', 'assumed', 'to', 'be', 'uncertaintyfree', 'it', 'is', 'known', 'that', 'analytical', 'solutions', 'are', 'possible', 'if', 'yfxgiventheta_j', 'is', 'a', 'linear', 'combination', 'of', 'theta_j1', 'dots', 'k', 'here', 'it', 'is', 'proposed', 'that', 'determining', 'the', 'uncertainty', 'of', 'parameters', 'that', 'are', 'not', 'textitlinearly', 'independent', 'may', 'be', 'achieved', 'from', 'derivatives', 'tfracpartial', 'fx', 'given', 'theta_jpartial', 'theta_j', 'at', 'an', 'optimum', 'if', 'the', 'parameters', 'are', 'textitstochastically', 'independent']] | [-0.13115096806861748, 0.15070027395995567, -0.058060702363339566, 0.018340939820821706, -0.06481960998471117, -0.19017919621408164, 0.002118762298431691, 0.38986392310332685, -0.32673684709394973, -0.275665706223143, 0.1372475444804877, -0.29292930471932604, -0.11401076005062177, 0.21764180775720715, -0.0381637861691637, 0.023996156446325283, 0.04208653654487058, 0.04556642910687342, -0.04075247650048584, -0.24720480093466385, 0.2613738329777594, 0.0021482435875527913, 0.16424615176150664, -0.011410686317720405, 0.12356308550529536, -0.0350398700684309, 0.051538518602250234, 0.04967489711097663, -0.15036487258501957, 0.01908308672968165, 0.3004024178233175, 0.141446346438291, 0.26485992183110546, -0.35181232127139256, -0.17366286353873356, 0.1487926915080087, 0.1807262610001046, 0.022240702736391022, 0.02677129640332645, -0.1969252716129025, 0.12728168224428027, -0.07046202127821743, -0.08019464694163096, -0.045497283849510406, 0.10117561887350998, 0.0701181091467983, -0.39658332975869554, 0.042272526083425396, 0.014024105554978763, 0.009288899769065514, -0.009104340015688822, -0.1814321874130872, -0.02907320534688465, 0.12354616282980369, 0.06482594892371535, 0.08959589642472565, 0.14395960246301479, -0.07648855044750408, -0.07675642336142205, 0.35943157345588717, -0.005027773451902682, -0.24408516662550114, 0.07947287051605859, -0.11514380342504453, -0.1218647445646292, 0.11482596897154249, 0.10859753912691736, 0.14360772812229006, -0.17786724771836557, 0.10181241971579202, -0.09332599469260978, 0.2124548633139403, 0.0410429377918176, 0.04725881115328299, 0.20217715073349177, 0.09872572884861645, 0.09345341013700124, 0.06322081576772257, -0.011918476466754717, -0.031389983316157236, -0.3478757328398171, -0.10540890517378491, -0.2578252394506264, 0.1135267575004296, -0.13399841838205853, -0.12135907309129834, 0.313088621877666, 0.12056859972515321, 0.20532431751711383, -0.022967656941286156, 0.25508203608028235, 0.1977736014857891, 0.034875569199877124, 0.1004470026597292, 0.20265640914883642, 0.12912851655467725, -0.05275459270480843, -0.163719061889597, 0.1291336926099445, -0.004856283787549252] |
1,802.09058 | Seeing Small Faces from Robust Anchor's Perspective | This paper introduces a novel anchor design to support anchor-based face
detection for superior scale-invariant performance, especially on tiny faces.
To achieve this, we explicitly address the problem that anchor-based detectors
drop performance drastically on faces with tiny sizes, e.g. less than 16x16
pixels. In this paper, we investigate why this is the case. We discover that
current anchor design cannot guarantee high overlaps between tiny faces and
anchor boxes, which increases the difficulty of training. The new Expected Max
Overlapping (EMO) score is proposed which can theoretically explain the low
overlapping issue and inspire several effective strategies of new anchor design
leading to higher face overlaps, including anchor stride reduction with new
network architectures, extra shifted anchors, and stochastic face shifting.
Comprehensive experiments show that our proposed method significantly
outperforms the baseline anchor-based detector, while consistently achieving
state-of-the-art results on challenging face detection datasets with
competitive runtime speed.
| cs.CV | this paper introduces a novel anchor design to support anchorbased face detection for superior scaleinvariant performance especially on tiny faces to achieve this we explicitly address the problem that anchorbased detectors drop performance drastically on faces with tiny sizes eg less than 16x16 pixels in this paper we investigate why this is the case we discover that current anchor design cannot guarantee high overlaps between tiny faces and anchor boxes which increases the difficulty of training the new expected max overlapping emo score is proposed which can theoretically explain the low overlapping issue and inspire several effective strategies of new anchor design leading to higher face overlaps including anchor stride reduction with new network architectures extra shifted anchors and stochastic face shifting comprehensive experiments show that our proposed method significantly outperforms the baseline anchorbased detector while consistently achieving stateoftheart results on challenging face detection datasets with competitive runtime speed | [['this', 'paper', 'introduces', 'a', 'novel', 'anchor', 'design', 'to', 'support', 'anchorbased', 'face', 'detection', 'for', 'superior', 'scaleinvariant', 'performance', 'especially', 'on', 'tiny', 'faces', 'to', 'achieve', 'this', 'we', 'explicitly', 'address', 'the', 'problem', 'that', 'anchorbased', 'detectors', 'drop', 'performance', 'drastically', 'on', 'faces', 'with', 'tiny', 'sizes', 'eg', 'less', 'than', '16x16', 'pixels', 'in', 'this', 'paper', 'we', 'investigate', 'why', 'this', 'is', 'the', 'case', 'we', 'discover', 'that', 'current', 'anchor', 'design', 'can', 'not', 'guarantee', 'high', 'overlaps', 'between', 'tiny', 'faces', 'and', 'anchor', 'boxes', 'which', 'increases', 'the', 'difficulty', 'of', 'training', 'the', 'new', 'expected', 'max', 'overlapping', 'emo', 'score', 'is', 'proposed', 'which', 'can', 'theoretically', 'explain', 'the', 'low', 'overlapping', 'issue', 'and', 'inspire', 'several', 'effective', 'strategies', 'of', 'new', 'anchor', 'design', 'leading', 'to', 'higher', 'face', 'overlaps', 'including', 'anchor', 'stride', 'reduction', 'with', 'new', 'network', 'architectures', 'extra', 'shifted', 'anchors', 'and', 'stochastic', 'face', 'shifting', 'comprehensive', 'experiments', 'show', 'that', 'our', 'proposed', 'method', 'significantly', 'outperforms', 'the', 'baseline', 'anchorbased', 'detector', 'while', 'consistently', 'achieving', 'stateoftheart', 'results', 'on', 'challenging', 'face', 'detection', 'datasets', 'with', 'competitive', 'runtime', 'speed']] | [-0.0832266149111092, 0.017313025578235587, 0.0017668195689717928, 0.04362824545397113, -0.11597305920595924, -0.20563593394123017, 0.04886512203918149, 0.4207186095416546, -0.23342998575419188, -0.36724031962027465, 0.06815793984492, -0.283587135784328, -0.19577920427545906, 0.15257335243125755, -0.19633375079060594, 0.05709631627968823, 0.1341114885841186, -0.00890315586545815, -0.09241408692051967, -0.30225236700304475, 0.2593750926339999, 0.10499008848021428, 0.38009876266121867, 0.06850546989124268, 0.13004292734898626, -0.07381073912217592, -0.003515807033982128, 0.047521789647095525, -0.05402293979457075, 0.1721001217273685, 0.273103212180237, 0.13906737147830428, 0.2734943594845633, -0.4069481019244995, -0.17429560522393633, 0.10750583039596677, 0.16589609986025608, 0.08231737549814473, -0.06312532030744478, -0.31319936231244355, 0.14576643702263634, -0.15820854462993642, -0.03930991037768156, -0.10700156026209394, -0.05154356290896733, -0.03469727784434023, -0.2595059191963325, 0.0378744443077206, 0.04011530763780077, 0.007094378701100747, -0.0023426919026921194, -0.17718164627129832, 0.07660290452496459, 0.13485121611816187, 0.01760332628308485, 0.03176817000222703, 0.13845998064265586, -0.1726076774361233, -0.13909744546787503, 0.3671897344104946, -0.05045333310234128, -0.219470834415406, 0.2217380242375657, -0.052522874600253996, -0.13422324535844382, 0.14116346696391702, 0.22868480966736873, 0.1107496647113779, -0.12132861000485719, -0.024618794128958447, -0.013391307874893149, 0.1988244766741991, 0.0961682646162808, 0.026178240394219756, 0.1941943641938269, 0.26604303244540156, 0.12929098896992702, 0.1389576825631472, -0.1807675907559072, -0.060425202365343766, -0.20630021569939952, -0.10990499503095634, -0.1728248176133881, -0.06075841640267754, -0.11504699851978027, -0.14580466226674615, 0.4007947617210448, 0.2888200544783225, 0.2191452853040149, 0.1226224441997086, 0.3695414955820888, 0.009719541045681884, 0.1449851043956975, 0.05704776082498332, 0.23992663089806834, -0.07697048548298578, 0.07939704990790536, -0.19508755550409357, 0.09140764990045379, 0.026467704018577932] |
1,802.09059 | One Single Deep Bidirectional LSTM Network for Word Sense Disambiguation
of Text Data | Due to recent technical and scientific advances, we have a wealth of
information hidden in unstructured text data such as offline/online narratives,
research articles, and clinical reports. To mine these data properly,
attributable to their innate ambiguity, a Word Sense Disambiguation (WSD)
algorithm can avoid numbers of difficulties in Natural Language Processing
(NLP) pipeline. However, considering a large number of ambiguous words in one
language or technical domain, we may encounter limiting constraints for proper
deployment of existing WSD models. This paper attempts to address the problem
of one-classifier-per-one-word WSD algorithms by proposing a single
Bidirectional Long Short-Term Memory (BLSTM) network which by considering
senses and context sequences works on all ambiguous words collectively.
Evaluated on SensEval-3 benchmark, we show the result of our model is
comparable with top-performing WSD algorithms. We also discuss how applying
additional modifications alleviates the model fault and the need for more
training data.
| cs.LG cs.CL cs.IR stat.ML | due to recent technical and scientific advances we have a wealth of information hidden in unstructured text data such as offlineonline narratives research articles and clinical reports to mine these data properly attributable to their innate ambiguity a word sense disambiguation wsd algorithm can avoid numbers of difficulties in natural language processing nlp pipeline however considering a large number of ambiguous words in one language or technical domain we may encounter limiting constraints for proper deployment of existing wsd models this paper attempts to address the problem of oneclassifierperoneword wsd algorithms by proposing a single bidirectional long shortterm memory blstm network which by considering senses and context sequences works on all ambiguous words collectively evaluated on senseval3 benchmark we show the result of our model is comparable with topperforming wsd algorithms we also discuss how applying additional modifications alleviates the model fault and the need for more training data | [['due', 'to', 'recent', 'technical', 'and', 'scientific', 'advances', 'we', 'have', 'a', 'wealth', 'of', 'information', 'hidden', 'in', 'unstructured', 'text', 'data', 'such', 'as', 'offlineonline', 'narratives', 'research', 'articles', 'and', 'clinical', 'reports', 'to', 'mine', 'these', 'data', 'properly', 'attributable', 'to', 'their', 'innate', 'ambiguity', 'a', 'word', 'sense', 'disambiguation', 'wsd', 'algorithm', 'can', 'avoid', 'numbers', 'of', 'difficulties', 'in', 'natural', 'language', 'processing', 'nlp', 'pipeline', 'however', 'considering', 'a', 'large', 'number', 'of', 'ambiguous', 'words', 'in', 'one', 'language', 'or', 'technical', 'domain', 'we', 'may', 'encounter', 'limiting', 'constraints', 'for', 'proper', 'deployment', 'of', 'existing', 'wsd', 'models', 'this', 'paper', 'attempts', 'to', 'address', 'the', 'problem', 'of', 'oneclassifierperoneword', 'wsd', 'algorithms', 'by', 'proposing', 'a', 'single', 'bidirectional', 'long', 'shortterm', 'memory', 'blstm', 'network', 'which', 'by', 'considering', 'senses', 'and', 'context', 'sequences', 'works', 'on', 'all', 'ambiguous', 'words', 'collectively', 'evaluated', 'on', 'senseval3', 'benchmark', 'we', 'show', 'the', 'result', 'of', 'our', 'model', 'is', 'comparable', 'with', 'topperforming', 'wsd', 'algorithms', 'we', 'also', 'discuss', 'how', 'applying', 'additional', 'modifications', 'alleviates', 'the', 'model', 'fault', 'and', 'the', 'need', 'for', 'more', 'training', 'data']] | [-0.08717405194948034, 0.025333990108500532, -0.025169059078266123, 0.11225297074502834, -0.18082745239886194, -0.14309629984675165, 0.091030118721664, 0.42454330004802365, -0.3133930601559731, -0.3677231477396119, 0.09060996921406742, -0.2854105194168938, -0.15918843378312886, 0.18339487920645117, -0.19330029166461962, 0.08830631575642192, 0.17776596326874744, 0.05373125093146449, -0.018964857211475877, -0.2956097036517751, 0.3039825462362393, 0.030388434072259534, 0.31659179598371795, 0.020515614616063733, 0.10926465745492629, -0.04620958446544044, -0.10621451777025905, -0.023445095760006533, -0.06190312178932181, 0.1737722361355, 0.36256443790341175, 0.23396487786833728, 0.3603548454785986, -0.4392089344035251, -0.22722749343636084, 0.09684521109926938, 0.15480688143660928, 0.13946345834565177, -0.020268299713193084, -0.3243154118417249, 0.08473679589936794, -0.17613674305556787, 0.02031100462792682, -0.11580149781079266, 0.01575647859650404, 0.009333878932172293, -0.22329750743957527, 0.04527809298308218, 0.1267076793152896, 0.07164225223011711, -0.030565545045244856, -0.11878264115625979, 0.0794182678646579, 0.14901714292228171, 0.11504452810131749, 0.06285922194682188, 0.1059292390923567, -0.18138306126074524, -0.19105694220689612, 0.3920231416796138, -0.042881336543062816, -0.21495727687871374, 0.19783490288568673, -0.019334188420135453, -0.2058605968027192, 0.052029272443203094, 0.20336401252848965, 0.06648967370112129, -0.19077216206612635, 0.0382321731632474, -0.023330560144113034, 0.1948650401516431, 0.11502745106885982, 0.02139429239948996, 0.19005021447201773, 0.23358818204110476, -0.016316431014621186, 0.10951300966632584, -0.06743115065365929, -0.06583766191944379, -0.22092847465727555, -0.10075851485012796, -0.1556913661255761, -0.02554684169875572, -0.06365719908289294, -0.15453447996429642, 0.36151631245212185, 0.2628580070548963, 0.1694734791471135, 0.06324141752687568, 0.3323488987500773, -0.0020896343535705643, 0.12495917571628574, 0.07832458299476983, 0.10697169805287707, -0.011138811397847725, 0.15289550260672358, -0.1506049575721275, 0.10817794003056641, 0.016909776515245032] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.