id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.09167 | 3D Reconstruction & Assessment Framework based on affordable 2D Lidar | Lidar is extensively used in the industry and mass-market. Due to its
measurement accuracy and insensitivity to illumination compared to cameras, It
is applied onto a broad range of applications, like geodetic engineering, self
driving cars or virtual reality. But the 3D Lidar with multi-beam is very
expensive, and t... | cs.RO | lidar is extensively used in the industry and massmarket due to its measurement accuracy and insensitivity to illumination compared to cameras it is applied onto a broad range of applications like geodetic engineering self driving cars or virtual reality but the 3d lidar with multibeam is very expensive and the massive... | [['lidar', 'is', 'extensively', 'used', 'in', 'the', 'industry', 'and', 'massmarket', 'due', 'to', 'its', 'measurement', 'accuracy', 'and', 'insensitivity', 'to', 'illumination', 'compared', 'to', 'cameras', 'it', 'is', 'applied', 'onto', 'a', 'broad', 'range', 'of', 'applications', 'like', 'geodetic', 'engineering', '... | [-0.08988217252087505, 0.07367733962685427, -0.046334931449847246, -0.006548066292361145, -0.03250805863194919, -0.15063513072986282, -0.01015528357155355, 0.4291967257442532, -0.27418674204592447, -0.3274815930347076, 0.12732649473556584, -0.2822824840633465, -0.112882018213536, 0.2651468034307355, -0.0703383334562624... |
1,803.09168 | Vacua on the Brink of Decay | We consider free massive matter fields in static scalar, electric and
gravitational backgrounds. Tuning these backgrounds to the brink of vacuum
decay, we identify a term in their effective action that is singular. This
singular term is universal, being independent of the features of the background
configuration. In ... | hep-th | we consider free massive matter fields in static scalar electric and gravitational backgrounds tuning these backgrounds to the brink of vacuum decay we identify a term in their effective action that is singular this singular term is universal being independent of the features of the background configuration in the case... | [['we', 'consider', 'free', 'massive', 'matter', 'fields', 'in', 'static', 'scalar', 'electric', 'and', 'gravitational', 'backgrounds', 'tuning', 'these', 'backgrounds', 'to', 'the', 'brink', 'of', 'vacuum', 'decay', 'we', 'identify', 'a', 'term', 'in', 'their', 'effective', 'action', 'that', 'is', 'singular', 'this', ... | [-0.18672636546323013, 0.19918349045917563, -0.08576787484745527, 0.12297352093630524, -0.07439080032723389, -0.1200971616560529, -0.008997806594118305, 0.268576162104527, -0.23942951477486, -0.2552872882920435, 0.0751728536467464, -0.28047387721552247, -0.1331507660309388, 0.1575570253912231, -0.026563026535528146, 0.... |
1,803.09169 | FROST -- Fast row-stochastic optimization with uncoordinated step-sizes | In this paper, we discuss distributed optimization over directed graphs,
where doubly-stochastic weights cannot be constructed. Most of the existing
algorithms overcome this issue by applying push-sum consensus, which utilizes
column-stochastic weights. The formulation of column-stochastic weights
requires each agent... | math.OC | in this paper we discuss distributed optimization over directed graphs where doublystochastic weights cannot be constructed most of the existing algorithms overcome this issue by applying pushsum consensus which utilizes columnstochastic weights the formulation of columnstochastic weights requires each agent to know at... | [['in', 'this', 'paper', 'we', 'discuss', 'distributed', 'optimization', 'over', 'directed', 'graphs', 'where', 'doublystochastic', 'weights', 'can', 'not', 'be', 'constructed', 'most', 'of', 'the', 'existing', 'algorithms', 'overcome', 'this', 'issue', 'by', 'applying', 'pushsum', 'consensus', 'which', 'utilizes', 'co... | [-0.13052234637338345, 0.08772736390803731, -0.055314064865535875, 0.007995487118023448, -0.14519629013673294, -0.24343821839942764, 0.06504382985171048, 0.45309428530415213, -0.3188486774754527, -0.243297218517437, 0.10261694126758783, -0.20438212607290565, -0.16150915456979764, 0.11397761508353113, -0.154580938310809... |
1,803.0917 | Hermitian non-K\"{a}hler structures on products of principal
$S^{1}$-bundles over complex flag manifolds and applications in Hermitian
geometry with torsion | In this paper we provide an explicit description of normal almost contact
structures obtained from Cartan-Ehresmann connections (gauge fields) on
principal $S^{1}$-bundles over complex flag manifolds. The main feature of our
approach is to employ elements of representation theory of complex simple Lie
algebras in ord... | math.DG | in this paper we provide an explicit description of normal almost contact structures obtained from cartanehresmann connections gauge fields on principal s1bundles over complex flag manifolds the main feature of our approach is to employ elements of representation theory of complex simple lie algebras in order to descri... | [['in', 'this', 'paper', 'we', 'provide', 'an', 'explicit', 'description', 'of', 'normal', 'almost', 'contact', 'structures', 'obtained', 'from', 'cartanehresmann', 'connections', 'gauge', 'fields', 'on', 'principal', 's1bundles', 'over', 'complex', 'flag', 'manifolds', 'the', 'main', 'feature', 'of', 'our', 'approach'... | [-0.17294441442138384, 0.0073883971338260124, -0.040821553170681, 0.08941013046407274, -0.12928996426718575, -0.09208046470369612, -0.06497916266588229, 0.40668371534773284, -0.26678238210401367, -0.22058613408756042, 0.12751549610136342, -0.23058280575488294, -0.251917346481766, 0.27377237755805256, -0.147361681296357... |
1,803.09171 | Extended Abstract: Mimicry Resilient Program Behavior Modeling with LSTM
based Branch Models | In the software design, protecting a computer system from a plethora of
software attacks or malware in the wild has been increasingly important. One
branch of research to detect the existence of attacks or malware, there has
been much work focused on modeling the runtime behavior of a program. Stemming
from the semin... | cs.CR | in the software design protecting a computer system from a plethora of software attacks or malware in the wild has been increasingly important one branch of research to detect the existence of attacks or malware there has been much work focused on modeling the runtime behavior of a program stemming from the seminal wor... | [['in', 'the', 'software', 'design', 'protecting', 'a', 'computer', 'system', 'from', 'a', 'plethora', 'of', 'software', 'attacks', 'or', 'malware', 'in', 'the', 'wild', 'has', 'been', 'increasingly', 'important', 'one', 'branch', 'of', 'research', 'to', 'detect', 'the', 'existence', 'of', 'attacks', 'or', 'malware', '... | [-0.11861466944442589, -0.012114933606588248, -0.15089953170372514, 0.05428398346421138, -0.10942272502558394, -0.18170997172628203, 0.057629925341477026, 0.357349028567057, -0.23308744928549674, -0.3529366475008233, 0.1475649790738402, -0.29053021192609174, -0.19634422806276897, 0.22640935087171798, -0.128424531202373... |
1,803.09172 | Multiple Sclerosis Lesion Segmentation from Brain MRI via Fully
Convolutional Neural Networks | Multiple Sclerosis (MS) is an autoimmune disease that leads to lesions in the
central nervous system. Magnetic resonance (MR) images provide sufficient
imaging contrast to visualize and detect lesions, particularly those in the
white matter. Quantitative measures based on various features of lesions have
been shown t... | cs.CV | multiple sclerosis ms is an autoimmune disease that leads to lesions in the central nervous system magnetic resonance mr images provide sufficient imaging contrast to visualize and detect lesions particularly those in the white matter quantitative measures based on various features of lesions have been shown to be usef... | [['multiple', 'sclerosis', 'ms', 'is', 'an', 'autoimmune', 'disease', 'that', 'leads', 'to', 'lesions', 'in', 'the', 'central', 'nervous', 'system', 'magnetic', 'resonance', 'mr', 'images', 'provide', 'sufficient', 'imaging', 'contrast', 'to', 'visualize', 'and', 'detect', 'lesions', 'particularly', 'those', 'in', 'the... | [-0.03537797087901197, -0.005313223211670268, -0.0695667387562314, 0.07267217350381251, -0.05901808749199901, -0.17218711578575183, 0.014267137013497317, 0.4155270556870653, -0.17880692104079637, -0.3258751501800515, 0.09718313174094093, -0.29314060081507126, -0.20411159577461552, 0.21679119901529637, -0.16040992201025... |
1,803.09173 | An Introduction to Imperfect Competition via Bilateral Oligopoly | The aim of this paper is threefold. First, we provide a unified framework, by
means of non-trivial examples, to compare the results obtained in
simultaneous-move and sequential-move versions of bilateral oligopoly with the
Cournot model and the Cournot-Walras approach. We also survey the main
contributions on imperfe... | cs.GT | the aim of this paper is threefold first we provide a unified framework by means of nontrivial examples to compare the results obtained in simultaneousmove and sequentialmove versions of bilateral oligopoly with the cournot model and the cournotwalras approach we also survey the main contributions on imperfect competit... | [['the', 'aim', 'of', 'this', 'paper', 'is', 'threefold', 'first', 'we', 'provide', 'a', 'unified', 'framework', 'by', 'means', 'of', 'nontrivial', 'examples', 'to', 'compare', 'the', 'results', 'obtained', 'in', 'simultaneousmove', 'and', 'sequentialmove', 'versions', 'of', 'bilateral', 'oligopoly', 'with', 'the', 'co... | [-0.10248131977425436, 0.057229017234825784, -0.07435866715082817, 0.10170376032550374, -0.12855782015654055, -0.1838111399318196, 0.13033249540392822, 0.4328496888063956, -0.2840526167276329, -0.2750481399235086, 0.11854165307485728, -0.27999764665002946, -0.2349697456221042, 0.0971389078544419, -0.11413485812279733, ... |
1,803.09174 | Microstructural constitutive model for polycrystal viscoplasticity in
cold and warm regimes based on continuum dislocation dynamics | Viscoplastic flow of polycrystalline metallic materials is the result of
motion and interaction of dislocations, line defects of the crystalline
structure. In the microstructural (physics-based) constitutive model presented
in this paper, the main underlying microstructural processes influencing
viscoplastic deformat... | cond-mat.mtrl-sci physics.app-ph | viscoplastic flow of polycrystalline metallic materials is the result of motion and interaction of dislocations line defects of the crystalline structure in the microstructural physicsbased constitutive model presented in this paper the main underlying microstructural processes influencing viscoplastic deformation and ... | [['viscoplastic', 'flow', 'of', 'polycrystalline', 'metallic', 'materials', 'is', 'the', 'result', 'of', 'motion', 'and', 'interaction', 'of', 'dislocations', 'line', 'defects', 'of', 'the', 'crystalline', 'structure', 'in', 'the', 'microstructural', 'physicsbased', 'constitutive', 'model', 'presented', 'in', 'this', '... | [-0.12442306452387986, 0.23279133368301771, -0.03653624488837451, -0.012312261483577244, -0.028488740743840953, -0.09512118734054122, 0.003931253998398818, 0.4266535060881984, -0.2688952341844675, -0.2626112234569269, 0.03640843782626439, -0.2556500960867304, -0.13930702121362237, 0.07141886231279475, -0.03680088137180... |
1,803.09175 | Distributed Energy and Resource Management for Full-Duplex Dense Small
Cells for 5G | We consider a multi-carrier and densely deployed small cell network, where
small cells are powered by renewable energy source and operate in a full-duplex
mode. We formulate an energy and traffic aware resource allocation optimization
problem, where a joint design of the beamformers, power and sub-carrier
allocation,... | eess.SP | we consider a multicarrier and densely deployed small cell network where small cells are powered by renewable energy source and operate in a fullduplex mode we formulate an energy and traffic aware resource allocation optimization problem where a joint design of the beamformers power and subcarrier allocation and users... | [['we', 'consider', 'a', 'multicarrier', 'and', 'densely', 'deployed', 'small', 'cell', 'network', 'where', 'small', 'cells', 'are', 'powered', 'by', 'renewable', 'energy', 'source', 'and', 'operate', 'in', 'a', 'fullduplex', 'mode', 'we', 'formulate', 'an', 'energy', 'and', 'traffic', 'aware', 'resource', 'allocation'... | [-0.2520291919431531, 0.023992764100497357, 0.0021527164914125567, 0.021329265599813085, -0.0957566474497483, -0.23083128376210427, 0.18304097208127543, 0.4008265908869261, -0.3102106245141991, -0.28507333708855, 0.05795804747941168, -0.23325605112133105, -0.12413996053365631, 0.12543976882688743, -0.12993199022960186,... |
1,803.09176 | Predictions for the isolated diphoton production through NNLO in QCD and
comparison to the 8 TeV ATLAS data | We present cross section predictions for the isolated diphoton production in
next-to-next-to-leading order (NNLO) QCD using the computational framework
MATRIX. Both the integrated and the differential fiducial cross sections are
calculated. We found that the arbitrary setup of the isolation procedure
introduces uncer... | hep-ph | we present cross section predictions for the isolated diphoton production in nexttonexttoleading order nnlo qcd using the computational framework matrix both the integrated and the differential fiducial cross sections are calculated we found that the arbitrary setup of the isolation procedure introduces uncertainties w... | [['we', 'present', 'cross', 'section', 'predictions', 'for', 'the', 'isolated', 'diphoton', 'production', 'in', 'nexttonexttoleading', 'order', 'nnlo', 'qcd', 'using', 'the', 'computational', 'framework', 'matrix', 'both', 'the', 'integrated', 'and', 'the', 'differential', 'fiducial', 'cross', 'sections', 'are', 'calcu... | [-0.07557593061899145, 0.06834574711198609, -0.11739475616564353, 0.1130898141907528, -0.0028485978146394093, -0.03319518603384495, -0.016901661222800613, 0.35378109470009805, -0.1947634973625342, -0.316072838306427, 0.024959682049229742, -0.2938780842969815, -0.021091045942157507, 0.12093772048751514, 0.01445467644681... |
1,803.09177 | Balanced Random Survival Forests for Extremely Unbalanced, Right
Censored Data | Accuracies of survival models for life expectancy prediction as well as
critical-care applications are significantly compromised due to the sparsity of
samples and extreme imbalance between the survival (usually, the majority) and
mortality class sizes. While a recent random survival forest (RSF) model
overcomes the ... | stat.ML cs.LG | accuracies of survival models for life expectancy prediction as well as criticalcare applications are significantly compromised due to the sparsity of samples and extreme imbalance between the survival usually the majority and mortality class sizes while a recent random survival forest rsf model overcomes the limitatio... | [['accuracies', 'of', 'survival', 'models', 'for', 'life', 'expectancy', 'prediction', 'as', 'well', 'as', 'criticalcare', 'applications', 'are', 'significantly', 'compromised', 'due', 'to', 'the', 'sparsity', 'of', 'samples', 'and', 'extreme', 'imbalance', 'between', 'the', 'survival', 'usually', 'the', 'majority', 'a... | [-0.031524666841515406, 0.07099952896284052, -0.020362404848692967, 0.10038065109003515, -0.0053233499688539595, -0.11793375022978307, 0.11917704380152219, 0.3818158883461978, -0.1856049666689201, -0.3384878331606082, 0.11372554388126349, -0.3073285947439266, -0.11714676457810848, 0.20374302611497036, -0.14210121194025... |
1,803.09178 | On the Enhancement of Heat Transfer and Reduction of Entropy Generation
by Asymmetric Slip in Pressure-Driven Non-Newtonian Microflows | We study hydrodynamics, heat transfer and entropy generation in
pressure-driven microchannel flow of a power-law fluid. Specifically, we
address the effect of asymmetry in the slip boundary condition at the channel
walls. Constant, uniform but unequal heat fluxes are imposed at the walls in
this thermally developed f... | physics.flu-dyn | we study hydrodynamics heat transfer and entropy generation in pressuredriven microchannel flow of a powerlaw fluid specifically we address the effect of asymmetry in the slip boundary condition at the channel walls constant uniform but unequal heat fluxes are imposed at the walls in this thermally developed flow the e... | [['we', 'study', 'hydrodynamics', 'heat', 'transfer', 'and', 'entropy', 'generation', 'in', 'pressuredriven', 'microchannel', 'flow', 'of', 'a', 'powerlaw', 'fluid', 'specifically', 'we', 'address', 'the', 'effect', 'of', 'asymmetry', 'in', 'the', 'slip', 'boundary', 'condition', 'at', 'the', 'channel', 'walls', 'const... | [-0.16243791911417238, 0.1841402710818498, -0.07448950644780312, 0.002562670085570915, -0.06789363830337977, -0.11844465000950526, 0.013201017417446339, 0.3558294800464558, -0.27012408184777714, -0.3183461196434198, 0.08331161483800846, -0.26719057684109043, -0.04116763421478558, 0.17605611067409505, -0.043768983614523... |
1,803.09179 | FaceForensics: A Large-scale Video Dataset for Forgery Detection in
Human Faces | With recent advances in computer vision and graphics, it is now possible to
generate videos with extremely realistic synthetic faces, even in real time.
Countless applications are possible, some of which raise a legitimate alarm,
calling for reliable detectors of fake videos. In fact, distinguishing between
original ... | cs.CV | with recent advances in computer vision and graphics it is now possible to generate videos with extremely realistic synthetic faces even in real time countless applications are possible some of which raise a legitimate alarm calling for reliable detectors of fake videos in fact distinguishing between original and manip... | [['with', 'recent', 'advances', 'in', 'computer', 'vision', 'and', 'graphics', 'it', 'is', 'now', 'possible', 'to', 'generate', 'videos', 'with', 'extremely', 'realistic', 'synthetic', 'faces', 'even', 'in', 'real', 'time', 'countless', 'applications', 'are', 'possible', 'some', 'of', 'which', 'raise', 'a', 'legitimate... | [-0.05819692889793364, 0.044785745268324365, -0.03194605495622942, 0.04596097435283124, -0.09386468202109789, -0.18269986460300905, -0.010285281001137254, 0.4558748973767614, -0.22537598943673684, -0.4164365282882758, 0.13429991410895062, -0.31420630957839674, -0.14888728897423162, 0.2543191138738919, -0.16447932103933... |
1,803.0918 | Unsupervised Domain Adaptation: from Simulation Engine to the RealWorld | Large-scale labeled training datasets have enabled deep neural networks to
excel on a wide range of benchmark vision tasks. However, in many applications
it is prohibitively expensive or time-consuming to obtain large quantities of
labeled data. To cope with limited labeled training data, many have attempted
to direc... | cs.CV cs.LG stat.ML | largescale labeled training datasets have enabled deep neural networks to excel on a wide range of benchmark vision tasks however in many applications it is prohibitively expensive or timeconsuming to obtain large quantities of labeled data to cope with limited labeled training data many have attempted to directly appl... | [['largescale', 'labeled', 'training', 'datasets', 'have', 'enabled', 'deep', 'neural', 'networks', 'to', 'excel', 'on', 'a', 'wide', 'range', 'of', 'benchmark', 'vision', 'tasks', 'however', 'in', 'many', 'applications', 'it', 'is', 'prohibitively', 'expensive', 'or', 'timeconsuming', 'to', 'obtain', 'large', 'quantit... | [-0.006638920258824961, -0.008799737991317164, -0.025151110075921104, 0.1057872678907706, -0.1898963874695186, -0.19431881125297257, 0.0381655877911415, 0.5041310820681385, -0.3101180967804092, -0.35490587402335544, 0.10581129701304119, -0.2549595582038105, -0.15591296526644663, 0.22047730247325065, -0.1768520389609127... |
1,803.09181 | Saturated Fully Leafed Tree-Like Polyforms and Polycubes | We present recursive formulas giving the maximal number of leaves in
tree-like polyforms living in two-dimensional regular lattices and in tree-like
polycubes in the three-dimensional cubic lattice.
We call these tree-like polyforms and polycubes \emph{fully leafed}.
The proof relies on a combinatorial algorithm ... | math.CO | we present recursive formulas giving the maximal number of leaves in treelike polyforms living in twodimensional regular lattices and in treelike polycubes in the threedimensional cubic lattice we call these treelike polyforms and polycubes emphfully leafed the proof relies on a combinatorial algorithm that enumerates ... | [['we', 'present', 'recursive', 'formulas', 'giving', 'the', 'maximal', 'number', 'of', 'leaves', 'in', 'treelike', 'polyforms', 'living', 'in', 'twodimensional', 'regular', 'lattices', 'and', 'in', 'treelike', 'polycubes', 'in', 'the', 'threedimensional', 'cubic', 'lattice', 'we', 'call', 'these', 'treelike', 'polyfor... | [-0.1784055384453731, 0.16007672224055838, -0.011519993041400556, 0.04836338153195188, -0.09710174865537771, -0.08652385468422263, 0.0821781985703166, 0.3593874915882393, -0.26656751898979697, -0.22602565719021692, 0.06017001144829447, -0.26831408163739573, -0.2094312236506354, 0.1292370105093276, -0.09949346758302353,... |
1,803.09182 | Harmonic determinants and unique continuation | We give partial answers to the following question: if $F$ is an $m$ by $m$
matrix on $\mathbb{R}^n$ satisfying a second order linear elliptic equation,
does $\det F$ satisfy the strong unique continuation property? We give
counterexamples in the case when the operator is a general non-diagonal
operator and also for s... | math.AP math.DG | we give partial answers to the following question if f is an m by m matrix on mathbbrn satisfying a second order linear elliptic equation does det f satisfy the strong unique continuation property we give counterexamples in the case when the operator is a general nondiagonal operator and also for some diagonal operator... | [['we', 'give', 'partial', 'answers', 'to', 'the', 'following', 'question', 'if', 'f', 'is', 'an', 'm', 'by', 'm', 'matrix', 'on', 'mathbbrn', 'satisfying', 'a', 'second', 'order', 'linear', 'elliptic', 'equation', 'does', 'det', 'f', 'satisfy', 'the', 'strong', 'unique', 'continuation', 'property', 'we', 'give', 'coun... | [-0.14206085767307616, 0.0782404983197497, 0.012306181044833175, 0.048611078092611386, -0.09429528091545895, -0.18789222254643886, -0.030006606529638605, 0.3270540471704116, -0.2607982130133484, -0.22091273089997399, 0.1306637826898967, -0.3357642772404061, -0.16254036461943489, 0.19126876739522858, -0.0816127042855742... |
1,803.09183 | COHERENT 2018 at the Spallation Neutron Source | The primary goal of the COHERENT collaboration is to measure and study
coherent elastic neutrino-nucleus scattering (CEvNS) using the high-power,
few-tens-of-MeV, pulsed source of neutrinos provided by the Spallation Neutron
Source (SNS) at Oak Ridge National Laboratory (ORNL). The COHERENT
collaboration reported the... | physics.ins-det hep-ex nucl-ex | the primary goal of the coherent collaboration is to measure and study coherent elastic neutrinonucleus scattering cevns using the highpower fewtensofmev pulsed source of neutrinos provided by the spallation neutron source sns at oak ridge national laboratory ornl the coherent collaboration reported the first detection... | [['the', 'primary', 'goal', 'of', 'the', 'coherent', 'collaboration', 'is', 'to', 'measure', 'and', 'study', 'coherent', 'elastic', 'neutrinonucleus', 'scattering', 'cevns', 'using', 'the', 'highpower', 'fewtensofmev', 'pulsed', 'source', 'of', 'neutrinos', 'provided', 'by', 'the', 'spallation', 'neutron', 'source', 's... | [-0.06129328685710789, 0.22037785474822158, -0.042234320904753986, 0.09797195781175105, -0.03196824833563975, -0.13149970043014036, 0.029913077985838754, 0.35037603422703495, -0.2055855097616283, -0.32525768014844897, 0.01360027050880793, -0.39733760295954806, 0.006330880574144733, 0.22542480219635763, 0.08655044622719... |
1,803.09184 | Measurement of Source Star Colors with the K2C9-CFHT Multi-color
Microlensing Survey | K2 Campaign 9 (K2C9) was the first space-based microlensing parallax survey
capable of measuring microlensing parallaxes of free-floating planet candidate
microlensing events. Simultaneous to K2C9 observations we conducted the K2C9
Canada-France-Hawaii Telescope Multi-Color Microlensing Survey (K2C9-CFHT MCMS)
in ord... | astro-ph.EP | k2 campaign 9 k2c9 was the first spacebased microlensing parallax survey capable of measuring microlensing parallaxes of freefloating planet candidate microlensing events simultaneous to k2c9 observations we conducted the k2c9 canadafrancehawaii telescope multicolor microlensing survey k2c9cfht mcms in order to measure... | [['k2', 'campaign', '9', 'k2c9', 'was', 'the', 'first', 'spacebased', 'microlensing', 'parallax', 'survey', 'capable', 'of', 'measuring', 'microlensing', 'parallaxes', 'of', 'freefloating', 'planet', 'candidate', 'microlensing', 'events', 'simultaneous', 'to', 'k2c9', 'observations', 'we', 'conducted', 'the', 'k2c9', '... | [-0.0888117962104745, 0.04321830732389375, -0.10647498850793766, 0.11461482961288273, -0.1896808196882337, -0.04578095709985918, 0.07046458786331607, 0.37712258005191185, -0.1707440890916164, -0.41143418879995886, 0.08457750307850785, -0.3908156266812008, -0.03155199088431685, 0.2579016653632859, -0.12437508691172225, ... |
1,803.09185 | Slim cyclotomic q-Schur algebras | We construct a new basis for a slim cyclotomic $q$-Schur algebra $\cysSr$ via
symmetric polynomials in Jucys--Murphy operators of the cyclotomic Hecke
algebra $\cysHr$. We show that this basis, labelled by matrices, is not the
double coset basis when $\cysHr$ is the Hecke algebra of a Coxeter group, but
coincides wit... | math.RT math.QA math.RA | we construct a new basis for a slim cyclotomic qschur algebra cyssr via symmetric polynomials in jucysmurphy operators of the cyclotomic hecke algebra cyshr we show that this basis labelled by matrices is not the double coset basis when cyshr is the hecke algebra of a coxeter group but coincides with the double coset b... | [['we', 'construct', 'a', 'new', 'basis', 'for', 'a', 'slim', 'cyclotomic', 'qschur', 'algebra', 'cyssr', 'via', 'symmetric', 'polynomials', 'in', 'jucysmurphy', 'operators', 'of', 'the', 'cyclotomic', 'hecke', 'algebra', 'cyshr', 'we', 'show', 'that', 'this', 'basis', 'labelled', 'by', 'matrices', 'is', 'not', 'the', ... | [-0.15250941870511847, 0.08562461863965093, -0.08823451301379298, 0.07092258605619216, -0.1677323460383129, -0.14702614670386538, -0.006700383901426738, 0.3293556593125686, -0.3918088870334693, -0.13665713721738112, 0.1268400594986319, -0.20697587553877383, -0.18203908509828828, 0.18652100989129394, -0.1447783938687776... |
1,803.09186 | Finite-Data Performance Guarantees for the Output-Feedback Control of an
Unknown System | As the systems we control become more complex, first-principle modeling
becomes either impossible or intractable, motivating the use of machine
learning techniques for the control of systems with continuous action spaces.
As impressive as the empirical success of these methods have been, strong
theoretical guarantees... | math.OC cs.LG | as the systems we control become more complex firstprinciple modeling becomes either impossible or intractable motivating the use of machine learning techniques for the control of systems with continuous action spaces as impressive as the empirical success of these methods have been strong theoretical guarantees of per... | [['as', 'the', 'systems', 'we', 'control', 'become', 'more', 'complex', 'firstprinciple', 'modeling', 'becomes', 'either', 'impossible', 'or', 'intractable', 'motivating', 'the', 'use', 'of', 'machine', 'learning', 'techniques', 'for', 'the', 'control', 'of', 'systems', 'with', 'continuous', 'action', 'spaces', 'as', '... | [-0.11451401947756651, -0.02620474344735628, -0.06824024763150975, 0.03073832342593834, -0.06251221709916818, -0.16660819001945443, 0.06963886447282958, 0.4136478333637632, -0.249897766357352, -0.34275446153920275, 0.15030522320403492, -0.23556878235319564, -0.17298648083855495, 0.2593565465191957, -0.11324589126538896... |
1,803.09187 | The Probability that Ideals in a Number Ring are k-wise Relatively
r-Prime | We say that n ideals of algebraic integers in a fixed number ring are k-wise
relatively r-prime if any k of them are relatively r-prime. In this article, we
provide an exact formula for the probability that n nonzero ideals of algebraic
integers in a fixed number ring are k-wise relatively r-prime.
| math.NT | we say that n ideals of algebraic integers in a fixed number ring are kwise relatively rprime if any k of them are relatively rprime in this article we provide an exact formula for the probability that n nonzero ideals of algebraic integers in a fixed number ring are kwise relatively rprime | [['we', 'say', 'that', 'n', 'ideals', 'of', 'algebraic', 'integers', 'in', 'a', 'fixed', 'number', 'ring', 'are', 'kwise', 'relatively', 'rprime', 'if', 'any', 'k', 'of', 'them', 'are', 'relatively', 'rprime', 'in', 'this', 'article', 'we', 'provide', 'an', 'exact', 'formula', 'for', 'the', 'probability', 'that', 'n', ... | [-0.2942152366113777, 0.1634783610064075, -0.08498315576266927, 0.0481803480853649, -0.05341142327345621, -0.24097765263958046, 0.023429007591822974, 0.3656986292021779, -0.2831993695491782, -0.20331622527793605, 0.04219218615952951, -0.3024679899502259, -0.07170057813457859, 0.1666798136340311, -0.08648661968226616, -... |
1,803.09188 | Parareal exponential $\theta$-scheme for longtime simulation of
stochastic Schr\"odinger equations with weak damping | A parareal algorithm based on an exponential $\theta$-scheme is proposed for
the stochastic Schr\"odinger equation with weak damping and additive noise. It
proceeds as a two-level temporal parallelizable integrator with the exponential
$\theta$-scheme as the propagator on the coarse grid. The proposed algorithm in
th... | math.NA | a parareal algorithm based on an exponential thetascheme is proposed for the stochastic schrodinger equation with weak damping and additive noise it proceeds as a twolevel temporal parallelizable integrator with the exponential thetascheme as the propagator on the coarse grid the proposed algorithm in the linear case i... | [['a', 'parareal', 'algorithm', 'based', 'on', 'an', 'exponential', 'thetascheme', 'is', 'proposed', 'for', 'the', 'stochastic', 'schrodinger', 'equation', 'with', 'weak', 'damping', 'and', 'additive', 'noise', 'it', 'proceeds', 'as', 'a', 'twolevel', 'temporal', 'parallelizable', 'integrator', 'with', 'the', 'exponent... | [-0.09232245468642233, 0.024250113871839486, -0.10370419667336811, 0.059979943413648526, -0.05049204091433765, -0.13255675669544104, 0.018339054883920215, 0.3580461736945879, -0.2717445985775213, -0.29168240468138135, 0.1220733934508947, -0.22134821140999292, -0.1503396543300375, 0.2301887465457964, -0.0163917667834328... |
1,803.09189 | Scene Graph Parsing as Dependency Parsing | In this paper, we study the problem of parsing structured knowledge graphs
from textual descriptions. In particular, we consider the scene graph
representation that considers objects together with their attributes and
relations: this representation has been proved useful across a variety of
vision and language applic... | cs.CL cs.CV | in this paper we study the problem of parsing structured knowledge graphs from textual descriptions in particular we consider the scene graph representation that considers objects together with their attributes and relations this representation has been proved useful across a variety of vision and language applications... | [['in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'parsing', 'structured', 'knowledge', 'graphs', 'from', 'textual', 'descriptions', 'in', 'particular', 'we', 'consider', 'the', 'scene', 'graph', 'representation', 'that', 'considers', 'objects', 'together', 'with', 'their', 'attributes', 'and', 'relations... | [-0.029612769529668858, -0.02211762145916641, -0.05362350799386268, 0.0415611160038363, -0.16636666035755415, -0.10948365781645196, 0.05740662594831994, 0.48217336977224634, -0.2761999259110662, -0.37164146332002745, 0.016549418333654656, -0.2677645664493405, -0.17518828744979817, 0.1816957078172245, -0.172325272570310... |
1,803.0919 | Bayesian Optimal Data Detector for Hybrid mmWave MIMO-OFDM Systems with
Low-Resolution ADCs | Hybrid analog-digital precoding architectures and low-resolution
analog-to-digital converter (ADC) receivers are two solutions to reduce
hardware cost and power consumption for millimeter wave (mmWave) multiple-input
multiple-output (MIMO) communication systems with large antenna arrays. In this
study, we consider a ... | cs.IT math.IT | hybrid analogdigital precoding architectures and lowresolution analogtodigital converter adc receivers are two solutions to reduce hardware cost and power consumption for millimeter wave mmwave multipleinput multipleoutput mimo communication systems with large antenna arrays in this study we consider a mmwave mimoofdm ... | [['hybrid', 'analogdigital', 'precoding', 'architectures', 'and', 'lowresolution', 'analogtodigital', 'converter', 'adc', 'receivers', 'are', 'two', 'solutions', 'to', 'reduce', 'hardware', 'cost', 'and', 'power', 'consumption', 'for', 'millimeter', 'wave', 'mmwave', 'multipleinput', 'multipleoutput', 'mimo', 'communic... | [-0.2301539440513036, -0.0033035803994068175, -0.0036376468902374853, 0.009851314562276179, -0.07737402232083634, -0.24418367210665118, 0.07868311848487484, 0.4093633044927413, -0.2137421284081075, -0.30103278995523136, 0.1282260994682428, -0.23633469999728376, -0.19594120234571658, 0.1908083584236565, -0.1228438969622... |
1,803.09191 | Phase transition in the recoverability of network history | Network growth processes can be understood as generative models of the
structure and history of complex networks. This point of view naturally leads
to the problem of network archaeology: reconstructing all the past states of a
network from its structure---a difficult permutation inference problem. In this
paper, we ... | physics.soc-ph cond-mat.stat-mech stat.ML | network growth processes can be understood as generative models of the structure and history of complex networks this point of view naturally leads to the problem of network archaeology reconstructing all the past states of a network from its structurea difficult permutation inference problem in this paper we introduce... | [['network', 'growth', 'processes', 'can', 'be', 'understood', 'as', 'generative', 'models', 'of', 'the', 'structure', 'and', 'history', 'of', 'complex', 'networks', 'this', 'point', 'of', 'view', 'naturally', 'leads', 'to', 'the', 'problem', 'of', 'network', 'archaeology', 'reconstructing', 'all', 'the', 'past', 'stat... | [-0.06985812132748273, 0.05146143572990415, -0.09453499071204509, 0.10399870728948511, -0.07448410164588729, -0.07992121287418577, 0.07269797715633057, 0.3980380297945932, -0.3359854667184827, -0.32790012658537865, 0.09167099758409537, -0.21418792066367295, -0.21759412612598866, 0.15490896783385558, -0.0638063353163978... |
1,803.09192 | The Shifted-inverse Power Weak Galerkin Method for Eigenvalue Problems | This paper proposes and analyzes a new weak Galerkin method for the
eigenvalue problem by using the shifted-inverse power technique. A high order
lower bound can be obtained at a relatively low cost via the proposed method.
The error estimates for both eigenvalue and eigenfunction are provided and
asymptotic lower bo... | math.NA | this paper proposes and analyzes a new weak galerkin method for the eigenvalue problem by using the shiftedinverse power technique a high order lower bound can be obtained at a relatively low cost via the proposed method the error estimates for both eigenvalue and eigenfunction are provided and asymptotic lower bounds ... | [['this', 'paper', 'proposes', 'and', 'analyzes', 'a', 'new', 'weak', 'galerkin', 'method', 'for', 'the', 'eigenvalue', 'problem', 'by', 'using', 'the', 'shiftedinverse', 'power', 'technique', 'a', 'high', 'order', 'lower', 'bound', 'can', 'be', 'obtained', 'at', 'a', 'relatively', 'low', 'cost', 'via', 'the', 'propose... | [-0.0791976694846667, 0.024738060423370564, -0.09143731485572502, 0.0897854531208533, -0.054789619760192705, -0.13877105150569344, 0.06016708377247789, 0.34575171384847525, -0.22717578892567844, -0.3423063153767902, 0.2020223903554407, -0.2538511742922393, -0.16933727010407232, 0.2808827371054301, -0.0691760358626418, ... |
1,803.09193 | Optimal Spectrum Sensing Policy with Traffic Classification in
RF-Powered CRNs | An orthogonal frequency division multiple access (OFDMA)-based primary user
(PU) network is considered, which provides different spectral access/energy
harvesting opportunities in RF-powered cognitive radio networks (CRNs). In this
scenario, we propose an optimal spectrum sensing policy for opportunistic
spectrum acc... | cs.IT math.IT | an orthogonal frequency division multiple access ofdmabased primary user pu network is considered which provides different spectral accessenergy harvesting opportunities in rfpowered cognitive radio networks crns in this scenario we propose an optimal spectrum sensing policy for opportunistic spectrum accessenergy harv... | [['an', 'orthogonal', 'frequency', 'division', 'multiple', 'access', 'ofdmabased', 'primary', 'user', 'pu', 'network', 'is', 'considered', 'which', 'provides', 'different', 'spectral', 'accessenergy', 'harvesting', 'opportunities', 'in', 'rfpowered', 'cognitive', 'radio', 'networks', 'crns', 'in', 'this', 'scenario', '... | [-0.19503287372423866, 0.0632249893676379, -0.04371478099261499, 0.03467378008682627, -0.07746409370652374, -0.24527449160814285, 0.158702185481537, 0.4190874842656308, -0.29454652735880216, -0.31991046706381043, 0.057498547642663454, -0.2400056300996985, -0.15555549660494666, 0.14442958524346602, -0.11334705514333851,... |
1,803.09194 | A categorical approach to cyclic cohomology of quasi-Hopf algebras and
Hopf algebroids | We apply categorical machinery to the problem of defining cyclic cohomology
with coefficients in two particular cases, namely quasi-Hopf algebras and Hopf
algebroids. In the case of the former, no definition was thus far available in
the literature, and while a definition exists for the latter, we feel that our
appro... | math.KT math.CT math.QA | we apply categorical machinery to the problem of defining cyclic cohomology with coefficients in two particular cases namely quasihopf algebras and hopf algebroids in the case of the former no definition was thus far available in the literature and while a definition exists for the latter we feel that our approach demy... | [['we', 'apply', 'categorical', 'machinery', 'to', 'the', 'problem', 'of', 'defining', 'cyclic', 'cohomology', 'with', 'coefficients', 'in', 'two', 'particular', 'cases', 'namely', 'quasihopf', 'algebras', 'and', 'hopf', 'algebroids', 'in', 'the', 'case', 'of', 'the', 'former', 'no', 'definition', 'was', 'thus', 'far',... | [-0.14875592504484722, 0.060685594678743855, -0.06741504878788204, 0.0996225346736917, -0.13518719452914302, -0.15556286048696755, -0.0014881045828767858, 0.36115030352804034, -0.3248594910121308, -0.20918337873357173, 0.09725645967953644, -0.19702055373732485, -0.19614676530933478, 0.18852192433653298, -0.163313897269... |
1,803.09195 | The $0\nu\beta\beta$-decay nuclear matrix element for light and heavy
neutrino mass mechanisms from deformed QRPA cacluations for $^{76}$Ge,
$^{82}$Se, $^{130}$Te, $^{136}$Xe and $^{150}$Nd with isospin restoration | In this work, with restored isospin symmetry, we evaluated the neutrinoless
double beta decay nuclear matrix elements for $^{76}$Ge, $^{82}$Se, $^{130}$Te,
$^{136}$Xe and $^{150}$Nd for both the light and heavy neutrino mass mechanisms
using the deformed QRPA approach with realistic forces. We give detailed
decomposi... | nucl-th hep-ph | in this work with restored isospin symmetry we evaluated the neutrinoless double beta decay nuclear matrix elements for 76ge 82se 130te 136xe and 150nd for both the light and heavy neutrino mass mechanisms using the deformed qrpa approach with realistic forces we give detailed decompositions of the nuclear matrix eleme... | [['in', 'this', 'work', 'with', 'restored', 'isospin', 'symmetry', 'we', 'evaluated', 'the', 'neutrinoless', 'double', 'beta', 'decay', 'nuclear', 'matrix', 'elements', 'for', '76ge', '82se', '130te', '136xe', 'and', '150nd', 'for', 'both', 'the', 'light', 'and', 'heavy', 'neutrino', 'mass', 'mechanisms', 'using', 'the... | [-0.024982000975998946, 0.23805968859475493, -0.04979027087554439, 0.1450470152057177, 0.04162705196682105, -0.1073274554057409, 0.07728227245065176, 0.3448260683928513, -0.22292028177050977, -0.3064543646436909, -0.01939051011949131, -0.3191173809658115, -0.04076176312648588, 0.15040107527036323, 0.08349268748093487, ... |
1,803.09196 | Learning Type-Aware Embeddings for Fashion Compatibility | Outfits in online fashion data are composed of items of many different types
(e.g. top, bottom, shoes) that share some stylistic relationship with one
another. A representation for building outfits requires a method that can learn
both notions of similarity (for example, when two tops are interchangeable) and
compati... | cs.CV | outfits in online fashion data are composed of items of many different types eg top bottom shoes that share some stylistic relationship with one another a representation for building outfits requires a method that can learn both notions of similarity for example when two tops are interchangeable and compatibility items... | [['outfits', 'in', 'online', 'fashion', 'data', 'are', 'composed', 'of', 'items', 'of', 'many', 'different', 'types', 'eg', 'top', 'bottom', 'shoes', 'that', 'share', 'some', 'stylistic', 'relationship', 'with', 'one', 'another', 'a', 'representation', 'for', 'building', 'outfits', 'requires', 'a', 'method', 'that', 'c... | [-0.03649645107453344, 0.004671517372911761, -0.06742751038702274, 0.06887638466346457, -0.1491597243619186, -0.19388468439725262, 0.050647870494328714, 0.4535607901436311, -0.28342181310333586, -0.37052080743014815, 0.0452883235069479, -0.35112981073282384, -0.14089350070183476, 0.2018000360561052, -0.1300554079314073... |
1,803.09197 | Stephen Hawking: To Understand the Universe | A brief remembrance of some aspects of the author's scientific interaction
with Stephen Hawking. A contribution to Physics Today's March 14, 2018 web page
in which Stephen Hawking is remembered by his colleagues.
| physics.hist-ph gr-qc hep-th | a brief remembrance of some aspects of the authors scientific interaction with stephen hawking a contribution to physics todays march 14 2018 web page in which stephen hawking is remembered by his colleagues | [['a', 'brief', 'remembrance', 'of', 'some', 'aspects', 'of', 'the', 'authors', 'scientific', 'interaction', 'with', 'stephen', 'hawking', 'a', 'contribution', 'to', 'physics', 'todays', 'march', '14', '2018', 'web', 'page', 'in', 'which', 'stephen', 'hawking', 'is', 'remembered', 'by', 'his', 'colleagues']] | [-0.09173973361876878, 0.11747043297597856, -0.11759879098584254, 0.11391518286880896, -0.21376266798964053, -0.14476374635529338, 0.02873963817502513, 0.19252253741477476, -0.13442403800559766, -0.42461980647887243, 0.06609532439897796, -0.43930095626097737, -0.15938228571956808, 0.16449054288254542, -0.19990120709619... |
1,803.09198 | Quadratic differentials, measured foliations and metric graphs on
punctured surfaces | A meromorphic quadratic differential on a punctured Riemann surface induces
horizontal and vertical measured foliations with pole-singularities. In a
neighborhood of a pole such a foliation comprises foliated strips and
half-planes, and its leaf-space determines a metric graph. We introduce the
notion of an asymptoti... | math.GT | a meromorphic quadratic differential on a punctured riemann surface induces horizontal and vertical measured foliations with polesingularities in a neighborhood of a pole such a foliation comprises foliated strips and halfplanes and its leafspace determines a metric graph we introduce the notion of an asymptotic direct... | [['a', 'meromorphic', 'quadratic', 'differential', 'on', 'a', 'punctured', 'riemann', 'surface', 'induces', 'horizontal', 'and', 'vertical', 'measured', 'foliations', 'with', 'polesingularities', 'in', 'a', 'neighborhood', 'of', 'a', 'pole', 'such', 'a', 'foliation', 'comprises', 'foliated', 'strips', 'and', 'halfplane... | [-0.27580191008746624, 0.01781052892911248, -0.12718203289227353, 0.0786567716928268, -0.13902813384343904, -0.14281938374387446, -0.004154522199597624, 0.2978003963828087, -0.3002612967113102, -0.19626396646792138, 0.06976151219757783, -0.27318043130691405, -0.17727675243384308, 0.21457595264332163, -0.104614542203920... |
1,803.09199 | Peano Model for Planar Compacta and a Lemma by Beardon | It is known that, among all the monotone decompositions of a planar compact
set K with Peano hyperspaces, there exists a unique one that is finer than all
the others. We call it the "core decomposition" of K with Peano hyperspace. The
resulted hyperspace under quotient topology will be referred to as the "Peano
model... | math.DS | it is known that among all the monotone decompositions of a planar compact set k with peano hyperspaces there exists a unique one that is finer than all the others we call it the core decomposition of k with peano hyperspace the resulted hyperspace under quotient topology will be referred to as the peano model for k we... | [['it', 'is', 'known', 'that', 'among', 'all', 'the', 'monotone', 'decompositions', 'of', 'a', 'planar', 'compact', 'set', 'k', 'with', 'peano', 'hyperspaces', 'there', 'exists', 'a', 'unique', 'one', 'that', 'is', 'finer', 'than', 'all', 'the', 'others', 'we', 'call', 'it', 'the', 'core', 'decomposition', 'of', 'k', '... | [-0.1365338308483751, 0.1253152934926174, -0.09305408714245335, 0.013893016536130483, -0.07753209878435935, -0.13960556527633194, 0.039754591329465454, 0.3374777509958195, -0.3190318410345119, -0.23655674636879895, 0.0917259233016705, -0.2927848157663863, -0.13312154295083753, 0.17490827448568944, -0.04241978624172294,... |
1,803.092 | Automated Driving Maneuvers under Interactive Environment based on Deep
Reinforcement Learning | Safe and efficient autonomous driving maneuvers in an interactive and complex
environment can be considerably challenging due to the unpredictable actions of
other surrounding agents that may be cooperative or adversarial in their
interactions with the ego vehicle. One of the state-of-the-art approaches is to
apply R... | cs.RO | safe and efficient autonomous driving maneuvers in an interactive and complex environment can be considerably challenging due to the unpredictable actions of other surrounding agents that may be cooperative or adversarial in their interactions with the ego vehicle one of the stateoftheart approaches is to apply reinfor... | [['safe', 'and', 'efficient', 'autonomous', 'driving', 'maneuvers', 'in', 'an', 'interactive', 'and', 'complex', 'environment', 'can', 'be', 'considerably', 'challenging', 'due', 'to', 'the', 'unpredictable', 'actions', 'of', 'other', 'surrounding', 'agents', 'that', 'may', 'be', 'cooperative', 'or', 'adversarial', 'in... | [-0.08826401368334737, 0.025443839216343488, -0.10210657236118782, 0.039702941572806814, -0.14317875261969712, -0.18435887501632073, 0.054135179754859784, 0.4829048618978384, -0.2821407971884675, -0.3241063945204476, 0.08820772557923266, -0.2000199453002412, -0.2006680034443128, 0.18919373226295016, -0.1608367938158691... |
1,803.09201 | On the Euler-Poincar\'e characteristic and mixed multiplicities of
maximal degrees | This paper defines the Euler-Poincar\'{e} characteristic of joint reductions
of ideals which concerns the maximal terms in the Hilbert polynomial;
characterizes the positivity of mixed multiplicities in terms of minimal joint
reductions; proves the additivity and other elementary properties for mixed
multiplicities. ... | math.AC | this paper defines the eulerpoincare characteristic of joint reductions of ideals which concerns the maximal terms in the hilbert polynomial characterizes the positivity of mixed multiplicities in terms of minimal joint reductions proves the additivity and other elementary properties for mixed multiplicities the result... | [['this', 'paper', 'defines', 'the', 'eulerpoincare', 'characteristic', 'of', 'joint', 'reductions', 'of', 'ideals', 'which', 'concerns', 'the', 'maximal', 'terms', 'in', 'the', 'hilbert', 'polynomial', 'characterizes', 'the', 'positivity', 'of', 'mixed', 'multiplicities', 'in', 'terms', 'of', 'minimal', 'joint', 'redu... | [-0.15873419371113848, 0.09174787157229078, -0.11258160917839008, 0.0663929931982768, -0.03878640881114041, -0.05779033265451887, -0.03134724544708742, 0.21119174609349958, -0.31842792551241705, -0.26935476508797773, 0.05771240673667348, -0.2168631020988991, -0.10770580510577576, 0.16915063754439966, -0.164001376284703... |
1,803.09202 | Unsupervised Depth Estimation, 3D Face Rotation and Replacement | We present an unsupervised approach for learning to estimate three
dimensional (3D) facial structure from a single image while also predicting 3D
viewpoint transformations that match a desired pose and facial geometry. We
achieve this by inferring the depth of facial keypoints of an input image in an
unsupervised man... | cs.CV stat.ML | we present an unsupervised approach for learning to estimate three dimensional 3d facial structure from a single image while also predicting 3d viewpoint transformations that match a desired pose and facial geometry we achieve this by inferring the depth of facial keypoints of an input image in an unsupervised manner w... | [['we', 'present', 'an', 'unsupervised', 'approach', 'for', 'learning', 'to', 'estimate', 'three', 'dimensional', '3d', 'facial', 'structure', 'from', 'a', 'single', 'image', 'while', 'also', 'predicting', '3d', 'viewpoint', 'transformations', 'that', 'match', 'a', 'desired', 'pose', 'and', 'facial', 'geometry', 'we', ... | [0.004300808794131236, -0.030583925524260848, -0.06186594176239201, 0.052634369651121754, -0.10347923911841853, -0.20778953532555275, -0.011028949012979865, 0.45433918599039314, -0.3180324304636036, -0.3467849557740348, 0.08406094759370067, -0.2553110995516181, -0.19755787175980263, 0.14127392716373183, -0.200144314596... |
1,803.09203 | Autonomous Ramp Merge Maneuver Based on Reinforcement Learning with
Continuous Action Space | Ramp merging is a critical maneuver for road safety and traffic efficiency.
Most of the current automated driving systems developed by multiple automobile
manufacturers and suppliers are typically limited to restricted access freeways
only. Extending the automated mode to ramp merging zones presents substantial
chall... | cs.AI cs.RO | ramp merging is a critical maneuver for road safety and traffic efficiency most of the current automated driving systems developed by multiple automobile manufacturers and suppliers are typically limited to restricted access freeways only extending the automated mode to ramp merging zones presents substantial challenge... | [['ramp', 'merging', 'is', 'a', 'critical', 'maneuver', 'for', 'road', 'safety', 'and', 'traffic', 'efficiency', 'most', 'of', 'the', 'current', 'automated', 'driving', 'systems', 'developed', 'by', 'multiple', 'automobile', 'manufacturers', 'and', 'suppliers', 'are', 'typically', 'limited', 'to', 'restricted', 'access... | [-0.10776542642433197, 0.058036929039866667, -0.07452142946235836, 0.04406043044132093, -0.143385632510297, -0.15691403509490193, 0.08768654631171376, 0.428603213571012, -0.27103855695435775, -0.319121692661196, 0.1152351475271862, -0.23612018752656877, -0.16350658644386568, 0.2052204650316853, -0.12003147060051561, 0.... |
1,803.09204 | New general parametrization of quintessence fields and its observational
constraints | We present a new parameterization of quintessence potentials for dark energy
based directly upon the dynamical properties of the equations of motion. Such
parameterization arises naturally once the equations of motion are written as a
dynamical system in terms of properly defined polar variables. We have
identified t... | gr-qc astro-ph.CO math.DS | we present a new parameterization of quintessence potentials for dark energy based directly upon the dynamical properties of the equations of motion such parameterization arises naturally once the equations of motion are written as a dynamical system in terms of properly defined polar variables we have identified two d... | [['we', 'present', 'a', 'new', 'parameterization', 'of', 'quintessence', 'potentials', 'for', 'dark', 'energy', 'based', 'directly', 'upon', 'the', 'dynamical', 'properties', 'of', 'the', 'equations', 'of', 'motion', 'such', 'parameterization', 'arises', 'naturally', 'once', 'the', 'equations', 'of', 'motion', 'are', '... | [-0.13871356877843263, 0.1358710210563408, -0.1240860327112454, 0.092841336049174, -0.09314548691941632, -0.10709093396758868, -0.03969424888319163, 0.2961077181570646, -0.2719579434884643, -0.3408682346895889, 0.07120941336594384, -0.21566399197887492, -0.15151566124900623, 0.17249513273989714, -0.02293260791166513, 0... |
1,803.09205 | Updating the MACHO fraction of the Milky Way dark halo with improved
mass models | Recent interest in primordial black holes as a possible dark matter candidate
has motivated the reanalysis of previous methods for constraining massive
astrophysical compact objects in the Milky Way halo and beyond. In order to
derive these constraints, a model for the dark matter distribution around the
Milky Way mu... | astro-ph.CO | recent interest in primordial black holes as a possible dark matter candidate has motivated the reanalysis of previous methods for constraining massive astrophysical compact objects in the milky way halo and beyond in order to derive these constraints a model for the dark matter distribution around the milky way must b... | [['recent', 'interest', 'in', 'primordial', 'black', 'holes', 'as', 'a', 'possible', 'dark', 'matter', 'candidate', 'has', 'motivated', 'the', 'reanalysis', 'of', 'previous', 'methods', 'for', 'constraining', 'massive', 'astrophysical', 'compact', 'objects', 'in', 'the', 'milky', 'way', 'halo', 'and', 'beyond', 'in', '... | [-0.07735469785617943, 0.07365155934656817, -0.12073090606493743, 0.13654758227121921, -0.15221427821583577, -0.08598756426981995, 0.04306350782051624, 0.35298909112723087, -0.19432910099601755, -0.41531827480818223, 0.044346621695916924, -0.2685916188400327, -0.04442405004024975, 0.2147512967234448, -0.029550724734067... |
1,803.09206 | Agent-Based Implementation of Particle Hopping Traffic Model With
Stochastic and Queuing Elements | Lagging or halted traffic is bothersome. As such, it is desirable to have a
model that can begin to determine the efficiency of various traffic
standardizations. Our model intended to create a multifaceted realistic
simulation of traffic flow while considering several factors. These factors
included: passing conventi... | nlin.CG stat.AP | lagging or halted traffic is bothersome as such it is desirable to have a model that can begin to determine the efficiency of various traffic standardizations our model intended to create a multifaceted realistic simulation of traffic flow while considering several factors these factors included passing conventions eg ... | [['lagging', 'or', 'halted', 'traffic', 'is', 'bothersome', 'as', 'such', 'it', 'is', 'desirable', 'to', 'have', 'a', 'model', 'that', 'can', 'begin', 'to', 'determine', 'the', 'efficiency', 'of', 'various', 'traffic', 'standardizations', 'our', 'model', 'intended', 'to', 'create', 'a', 'multifaceted', 'realistic', 'si... | [-0.15997920173699534, 0.11863519076960496, -0.0673341264915761, 0.04632590629192892, -0.05025060294239327, -0.12947152700101913, 0.10658278878680755, 0.3517911774994329, -0.28688606024221625, -0.352923186968059, 0.11077907659860631, -0.27303509806867604, -0.11256971202335905, 0.17627910432124208, -0.10232350356270407,... |
1,803.09207 | Revisiting Mayer: Symmetric solutions for sporadic cases of the Map
Color Theorem | The original proof of the genus of the complete graphs $K_n$ depended on
Mayer's \emph{ad hoc} solutions for $n = 18, 20, 23$. Recently, an improved
solution for $K_{20}$ was found by the author. The purpose of this note is to
use the theory of current graphs to interpret the aforementioned result and to
provide new ... | math.CO | the original proof of the genus of the complete graphs k_n depended on mayers emphad hoc solutions for n 18 20 23 recently an improved solution for k_20 was found by the author the purpose of this note is to use the theory of current graphs to interpret the aforementioned result and to provide new embeddings of k_18 an... | [['the', 'original', 'proof', 'of', 'the', 'genus', 'of', 'the', 'complete', 'graphs', 'k_n', 'depended', 'on', 'mayers', 'emphad', 'hoc', 'solutions', 'for', 'n', '18', '20', '23', 'recently', 'an', 'improved', 'solution', 'for', 'k_20', 'was', 'found', 'by', 'the', 'author', 'the', 'purpose', 'of', 'this', 'note', 'i... | [-0.10673786036007232, 0.027542449646655046, -0.05189028001879736, 0.07367894945318922, -0.08649026578828944, -0.0834051834940279, 0.05194050131042062, 0.31583480420127763, -0.19773961180994698, -0.37377356785207483, 0.10369137478045236, -0.2917105003370572, -0.13661026520954478, 0.16778426866788984, -0.125641956049317... |
1,803.09208 | Unsupervised Domain Adaptation: A Multi-task Learning-based Method | This paper presents a novel multi-task learning-based method for unsupervised
domain adaptation. Specifically, the source and target domain classifiers are
jointly learned by considering the geometry of target domain and the divergence
between the source and target domains based on the concept of multi-task
learning.... | cs.CV | this paper presents a novel multitask learningbased method for unsupervised domain adaptation specifically the source and target domain classifiers are jointly learned by considering the geometry of target domain and the divergence between the source and target domains based on the concept of multitask learning two nov... | [['this', 'paper', 'presents', 'a', 'novel', 'multitask', 'learningbased', 'method', 'for', 'unsupervised', 'domain', 'adaptation', 'specifically', 'the', 'source', 'and', 'target', 'domain', 'classifiers', 'are', 'jointly', 'learned', 'by', 'considering', 'the', 'geometry', 'of', 'target', 'domain', 'and', 'the', 'div... | [0.0021995068377103, -0.0486053936621722, -0.07020733508774463, 0.029044743938207187, -0.14041050520232495, -0.1838725309106795, 0.013262896964271718, 0.5142628578578725, -0.264993522086126, -0.28563056960701944, 0.1016330586910686, -0.2535703192519791, -0.20836941941696055, 0.22539028862819951, -0.1224967522546649, 0.... |
1,803.09209 | Watt-level dysprosium fiber laser at 3.15 {\mu}m with 73% slope
efficiency | Rare-earth-doped fiber lasers are emerging as promising high-power
mid-infrared sources for the 2.6-3.0 {\mu}m and 3.3-3.8 {\mu}m regions based on
erbium and holmium ions. The intermediate wavelength range, however, remains
vastly underserved, despite prospects for important manufacturing and defense
applications. He... | physics.optics | rareearthdoped fiber lasers are emerging as promising highpower midinfrared sources for the 2630 mum and 3338 mum regions based on erbium and holmium ions the intermediate wavelength range however remains vastly underserved despite prospects for important manufacturing and defense applications here we demonstrate the p... | [['rareearthdoped', 'fiber', 'lasers', 'are', 'emerging', 'as', 'promising', 'highpower', 'midinfrared', 'sources', 'for', 'the', '2630', 'mum', 'and', '3338', 'mum', 'regions', 'based', 'on', 'erbium', 'and', 'holmium', 'ions', 'the', 'intermediate', 'wavelength', 'range', 'however', 'remains', 'vastly', 'underserved'... | [-0.055321467319630425, 0.11024085586382584, 0.02510781750844961, -0.04022158012481999, -0.04030336636033925, -0.1755841739475727, 0.0805432253898206, 0.478871306294406, -0.2128999545831572, -0.3194006197646641, 0.07021673313680697, -0.29182622488588095, -0.044037811098281636, 0.2917426518757235, -0.05494108223356307, ... |
1,803.0921 | Importance Weighted Adversarial Nets for Partial Domain Adaptation | This paper proposes an importance weighted adversarial nets-based method for
unsupervised domain adaptation, specific for partial domain adaptation where
the target domain has less number of classes compared to the source domain.
Previous domain adaptation methods generally assume the identical label spaces,
such tha... | cs.CV | this paper proposes an importance weighted adversarial netsbased method for unsupervised domain adaptation specific for partial domain adaptation where the target domain has less number of classes compared to the source domain previous domain adaptation methods generally assume the identical label spaces such that redu... | [['this', 'paper', 'proposes', 'an', 'importance', 'weighted', 'adversarial', 'netsbased', 'method', 'for', 'unsupervised', 'domain', 'adaptation', 'specific', 'for', 'partial', 'domain', 'adaptation', 'where', 'the', 'target', 'domain', 'has', 'less', 'number', 'of', 'classes', 'compared', 'to', 'the', 'source', 'doma... | [-0.05152192861558153, 0.03763718848819665, -0.03493955534023161, 0.05809475982812448, -0.16684370117190367, -0.13038657134255538, 0.0508075500292202, 0.4232523627794133, -0.28335336730457267, -0.32135002268478274, 0.08535267872144826, -0.2197637309965033, -0.1213260412789308, 0.18722160067409277, -0.1476027762588973, ... |
1,803.09211 | Bernoulli Embeddings for Graphs | Just as semantic hashing can accelerate information retrieval, binary valued
embeddings can significantly reduce latency in the retrieval of graphical data.
We introduce a simple but effective model for learning such binary vectors for
nodes in a graph. By imagining the embeddings as independent coin flips of
varying... | cs.LG cs.AI stat.ML | just as semantic hashing can accelerate information retrieval binary valued embeddings can significantly reduce latency in the retrieval of graphical data we introduce a simple but effective model for learning such binary vectors for nodes in a graph by imagining the embeddings as independent coin flips of varying bias... | [['just', 'as', 'semantic', 'hashing', 'can', 'accelerate', 'information', 'retrieval', 'binary', 'valued', 'embeddings', 'can', 'significantly', 'reduce', 'latency', 'in', 'the', 'retrieval', 'of', 'graphical', 'data', 'we', 'introduce', 'a', 'simple', 'but', 'effective', 'model', 'for', 'learning', 'such', 'binary', ... | [-0.05739911001834893, 0.0468416807001059, -0.06295092995644788, 0.13253173296041576, -0.13370436877587788, -0.18829999019697916, 0.07299531503381688, 0.47503792804278683, -0.34046326196762955, -0.3418473265646549, 0.09145875726277114, -0.2778637905845816, -0.1547278816696633, 0.1818377051183305, -0.1430390145409894, 0... |
1,803.09212 | Shape, Scale, and Minimality of Matrix Ranges | We study containment and uniqueness problems concerning matrix convex sets.
First, to what extent is a matrix convex set determined by its first level? Our
results in this direction quantify the disparity between two product
operations, namely the product of the smallest matrix convex sets over $K_i
\subseteq \mathbb... | math.OA math.FA | we study containment and uniqueness problems concerning matrix convex sets first to what extent is a matrix convex set determined by its first level our results in this direction quantify the disparity between two product operations namely the product of the smallest matrix convex sets over k_i subseteq mathbbcd and th... | [['we', 'study', 'containment', 'and', 'uniqueness', 'problems', 'concerning', 'matrix', 'convex', 'sets', 'first', 'to', 'what', 'extent', 'is', 'a', 'matrix', 'convex', 'set', 'determined', 'by', 'its', 'first', 'level', 'our', 'results', 'in', 'this', 'direction', 'quantify', 'the', 'disparity', 'between', 'two', 'p... | [-0.114593056586778, 0.1153688687604194, -0.0171864406715435, 0.035786288162247125, -0.0804091092965488, -0.11048712039418104, 0.03732892686578756, 0.35978325083205065, -0.365842170909875, -0.20794501409788305, 0.15356654667508943, -0.2935592655396451, -0.1452369394537527, 0.18240145892034182, -0.09892273983859923, 0.0... |
1,803.09213 | Almost para-Hermitian and almost paracontact metric structures induced
by natural Riemann extensions | In this paper we consider a manifold $(M,\nabla )$ with a symmetric linear
connection $\nabla $ which induces on the cotangent bundle $T^*M$ of $M$ a
semi-Riemannian metric $\overline g$ with a neutral signature. The metric
$\overline g$ is called natural Riemann extension and it is a generalization
(made by M. Sekiz... | math.DG | in this paper we consider a manifold mnabla with a symmetric linear connection nabla which induces on the cotangent bundle tm of m a semiriemannian metric overline g with a neutral signature the metric overline g is called natural riemann extension and it is a generalization made by m sekizawa and o kowalski of the rie... | [['in', 'this', 'paper', 'we', 'consider', 'a', 'manifold', 'mnabla', 'with', 'a', 'symmetric', 'linear', 'connection', 'nabla', 'which', 'induces', 'on', 'the', 'cotangent', 'bundle', 'tm', 'of', 'm', 'a', 'semiriemannian', 'metric', 'overline', 'g', 'with', 'a', 'neutral', 'signature', 'the', 'metric', 'overline', 'g... | [-0.25481342032336357, 0.08332063973450489, -0.056598380321955945, 0.07177638610726741, -0.13221431883102674, -0.15088154206077764, -0.041626916144226936, 0.4088344970895421, -0.23722762248928653, -0.23739240743017115, 0.06475163832050274, -0.2674102819854153, -0.22375331819374242, 0.12106670860239134, -0.1038218957029... |
1,803.09214 | Prospective phosphors for white LEDs based on double molybdates of the
composition Ln2Zr3 (MoO4) 9 (Ln: Eu, Tb) | The results of the investigation of the spectral characteristics of new
luminescent substances based on rare-earth ions Eu3 + and Tb3 + in matrices of
double molybdates are presented in the article. The luminescence and excitation
spectra are considered, the decay times of the main transitions are determined,
and the... | physics.app-ph cond-mat.mtrl-sci | the results of the investigation of the spectral characteristics of new luminescent substances based on rareearth ions eu3 and tb3 in matrices of double molybdates are presented in the article the luminescence and excitation spectra are considered the decay times of the main transitions are determined and the color coo... | [['the', 'results', 'of', 'the', 'investigation', 'of', 'the', 'spectral', 'characteristics', 'of', 'new', 'luminescent', 'substances', 'based', 'on', 'rareearth', 'ions', 'eu3', 'and', 'tb3', 'in', 'matrices', 'of', 'double', 'molybdates', 'are', 'presented', 'in', 'the', 'article', 'the', 'luminescence', 'and', 'exci... | [-0.07601565272728009, 0.17486718542345647, 0.00047743388229230446, 0.0004054557031659938, 0.04436147345035379, -0.09631367672735186, 0.0316097883285204, 0.4221053354775728, -0.20106680240871302, -0.26395691645595787, 0.06303043146409205, -0.35227348099448785, -0.1000690934345571, 0.19698718926911032, -0.01431341447047... |
1,803.09215 | Electrical Resistivity and Hall Effect in Binary Neutron-Star Mergers | We examine the range of rest-mass densities, temperatures and magnetic fields
involved in simulations of binary neutron-star mergers and identify the
conditions under which the ideal-magnetohydrodynamics approximation breaks down
and hence the magnetic-field decay should be accounted for. We use recent
calculations o... | astro-ph.HE nucl-th | we examine the range of restmass densities temperatures and magnetic fields involved in simulations of binary neutronstar mergers and identify the conditions under which the idealmagnetohydrodynamics approximation breaks down and hence the magneticfield decay should be accounted for we use recent calculations of the co... | [['we', 'examine', 'the', 'range', 'of', 'restmass', 'densities', 'temperatures', 'and', 'magnetic', 'fields', 'involved', 'in', 'simulations', 'of', 'binary', 'neutronstar', 'mergers', 'and', 'identify', 'the', 'conditions', 'under', 'which', 'the', 'idealmagnetohydrodynamics', 'approximation', 'breaks', 'down', 'and'... | [-0.10924487089063843, 0.23361576786585922, -0.0665562207264633, 0.10602605090089441, -0.023675321484113047, -0.0642072729380994, 0.01303823170059457, 0.3785459251881673, -0.22690237719116027, -0.31745143463385517, 0.08785484121983934, -0.2198097238702507, -0.027603529958889404, 0.2186284037547764, 0.04965257164299616,... |
1,803.09216 | Real-Variable Characterizations of Orlicz-Slice Hardy Spaces | In this article, the authors first introduce a class of Orlicz-slice spaces
which generalize the slice spaces recently studied by P. Auscher et al. Based
on these Orlicz-slice spaces, the authors introduce a new kind of Hardy type
spaces, the Orlicz-slice Hardy spaces, via the radial maximal functions. This
new scale... | math.CA math.AP math.FA | in this article the authors first introduce a class of orliczslice spaces which generalize the slice spaces recently studied by p auscher et al based on these orliczslice spaces the authors introduce a new kind of hardy type spaces the orliczslice hardy spaces via the radial maximal functions this new scale of orliczsl... | [['in', 'this', 'article', 'the', 'authors', 'first', 'introduce', 'a', 'class', 'of', 'orliczslice', 'spaces', 'which', 'generalize', 'the', 'slice', 'spaces', 'recently', 'studied', 'by', 'p', 'auscher', 'et', 'al', 'based', 'on', 'these', 'orliczslice', 'spaces', 'the', 'authors', 'introduce', 'a', 'new', 'kind', 'o... | [-0.0763849349918239, 0.09667760393068704, -0.05843575332534848, 0.14576866868189584, -0.10127937010221297, -0.05418009297437778, 0.02296419706985806, 0.3419166672598533, -0.3122917539581205, -0.17285905364869078, 0.1551844666510905, -0.23955794950156953, -0.13768317619094042, 0.23017580549684213, -0.11935056819382941,... |
1,803.09217 | Inside a VAMDC data node - Putting standards into practical software | Access to molecular and atomic data is critical for many forms of remote
sensing analysis across different fields. Many atomic and molecular databases
are however highly specialized for their intended application, complicating
querying and combination data between sources. The Virtual Atomic and Molecular
Data Centre... | astro-ph.IM cs.SE physics.atm-clus physics.atom-ph physics.comp-ph | access to molecular and atomic data is critical for many forms of remote sensing analysis across different fields many atomic and molecular databases are however highly specialized for their intended application complicating querying and combination data between sources the virtual atomic and molecular data centre vamd... | [['access', 'to', 'molecular', 'and', 'atomic', 'data', 'is', 'critical', 'for', 'many', 'forms', 'of', 'remote', 'sensing', 'analysis', 'across', 'different', 'fields', 'many', 'atomic', 'and', 'molecular', 'databases', 'are', 'however', 'highly', 'specialized', 'for', 'their', 'intended', 'application', 'complicating... | [-0.12680776692349868, 0.01842357516335757, -0.033733904866432275, 0.04112440548180631, -0.09405927263454807, -0.15437862013252626, 0.08725722745257597, 0.4072787934532447, -0.2935909503284171, -0.3341191884922731, 0.11565051779804623, -0.3002037042478043, -0.10934734789897567, 0.21531644488991417, -0.04204526895900135... |
1,803.09218 | Image Recognition Using Scale Recurrent Neural Networks | Convolutional Neural Network(CNN) has been widely used for image recognition
with great success. However, there are a number of limitations of the current
CNN based image recognition paradigm. First, the receptive field of CNN is
generally fixed, which limits its recognition capacity when the input image is
very larg... | cs.CV | convolutional neural networkcnn has been widely used for image recognition with great success however there are a number of limitations of the current cnn based image recognition paradigm first the receptive field of cnn is generally fixed which limits its recognition capacity when the input image is very large second ... | [['convolutional', 'neural', 'networkcnn', 'has', 'been', 'widely', 'used', 'for', 'image', 'recognition', 'with', 'great', 'success', 'however', 'there', 'are', 'a', 'number', 'of', 'limitations', 'of', 'the', 'current', 'cnn', 'based', 'image', 'recognition', 'paradigm', 'first', 'the', 'receptive', 'field', 'of', 'c... | [-0.0317039477303877, -0.003765663536035296, -0.06914142144810223, 0.0384854818889197, -0.11492652015031496, -0.23247264891049543, -0.031200065352844402, 0.465981145191314, -0.2721246329275259, -0.33008831996066135, 0.08206800607557733, -0.2293321091505384, -0.20734348616402648, 0.21305682762353195, -0.1597078659790842... |
1,803.09219 | Digital Cardan Grille: A Modern Approach for Information Hiding | In this paper, a new framework for construction of Cardan grille for
information hiding is proposed. Based on the semantic image inpainting
technique, the stego image are driven by secret messages directly. A mask
called Digital Cardan Grille (DCG) for determining the hidden location is
introduced to hide the message... | cs.MM cs.CR | in this paper a new framework for construction of cardan grille for information hiding is proposed based on the semantic image inpainting technique the stego image are driven by secret messages directly a mask called digital cardan grille dcg for determining the hidden location is introduced to hide the message the mes... | [['in', 'this', 'paper', 'a', 'new', 'framework', 'for', 'construction', 'of', 'cardan', 'grille', 'for', 'information', 'hiding', 'is', 'proposed', 'based', 'on', 'the', 'semantic', 'image', 'inpainting', 'technique', 'the', 'stego', 'image', 'are', 'driven', 'by', 'secret', 'messages', 'directly', 'a', 'mask', 'calle... | [-0.07355998938631576, -0.05164214751615267, -0.07852956908755004, 0.07279330573413366, -0.11577869144578774, -0.22177469158389915, 0.046764756852644494, 0.4009142237715423, -0.31934872375180323, -0.2811585864905889, 0.12046415985872348, -0.2792261717608199, -0.16139084780588747, 0.12050530503426368, -0.234207994423195... |
1,803.0922 | A Minimal Mechanosensing Model Predicts Keratocyte Evolution on Flexible
Substrates | A mathematical model is proposed for shape evolution and locomotion of fish
epidermal keratocytes on elastic substrates. The model is based on
mechanosensing concepts: cells apply contractile forces onto the elastic
substrate, while cell shape evolution depends locally on the substrate stress
generated by themselves ... | physics.bio-ph q-bio.CB | a mathematical model is proposed for shape evolution and locomotion of fish epidermal keratocytes on elastic substrates the model is based on mechanosensing concepts cells apply contractile forces onto the elastic substrate while cell shape evolution depends locally on the substrate stress generated by themselves or ex... | [['a', 'mathematical', 'model', 'is', 'proposed', 'for', 'shape', 'evolution', 'and', 'locomotion', 'of', 'fish', 'epidermal', 'keratocytes', 'on', 'elastic', 'substrates', 'the', 'model', 'is', 'based', 'on', 'mechanosensing', 'concepts', 'cells', 'apply', 'contractile', 'forces', 'onto', 'the', 'elastic', 'substrate'... | [-0.12124025794250852, 0.19772806042454033, -0.06007379607681732, -0.03503999783546775, -0.09294590893872343, -0.1400962783173508, 0.021521360545021878, 0.4186324159959917, -0.3002286206807134, -0.2706920651106776, 0.03495246498728288, -0.2565820826171943, -0.2249090973649278, 0.15972742738553902, -0.030169456908555145... |
1,803.09221 | Nonconventional Random Matrix Products | Let $\xi_1,\xi_2,...$ be independent identically distributed random variables
and $F:\bbR^\ell\to SL_d(\bbR)$ be a Borel measurable matrix-valued function.
Set $X_n=F(\xi_{q_1(n)},\xi_{q_2(n)},...,\xi_{q_\ell(n)})$ where $0\leq
q_1<q_2<...<q_\ell$ are increasing functions taking on integer values on
integers. We stud... | math.PR | let xi_1xi_2 be independent identically distributed random variables and fbbrellto sl_dbbr be a borel measurable matrixvalued function set x_nfxi_q_1nxi_q_2nxi_q_elln where 0leq q_1q_2q_ell are increasing functions taking on integer values on integers we study the asymptotic behavior as ntoinfty of the singular values ... | [['let', 'xi_1xi_2', 'be', 'independent', 'identically', 'distributed', 'random', 'variables', 'and', 'fbbrellto', 'sl_dbbr', 'be', 'a', 'borel', 'measurable', 'matrixvalued', 'function', 'set', 'x_nfxi_q_1nxi_q_2nxi_q_elln', 'where', '0leq', 'q_1q_2q_ell', 'are', 'increasing', 'functions', 'taking', 'on', 'integer', '... | [-0.1354895576524238, 0.20072310608811678, -0.0538972416271766, 0.04038198118279171, -0.012628469606473422, -0.15794451704455748, 0.008188736564221068, 0.35921745403773253, -0.29649599968559215, -0.1542192433834619, 0.1264092232268821, -0.3047142482466168, -0.1460016612817223, 0.15839082728036577, -0.050018819581924216... |
1,803.09222 | Multi-SpaM: a Maximum-Likelihood approach to Phylogeny reconstruction
based on Multiple Spaced-Word Matches | Motivation: Word-based or `alignment-free' methods for phylogeny
reconstruction are much faster than traditional approaches, but they are
generally less accurate. Most of these methods calculate pairwise distances for
a set of input sequences, for example from word frequencies, from so-called
spaced-word matches or f... | q-bio.PE | motivation wordbased or alignmentfree methods for phylogeny reconstruction are much faster than traditional approaches but they are generally less accurate most of these methods calculate pairwise distances for a set of input sequences for example from word frequencies from socalled spacedword matches or from the avera... | [['motivation', 'wordbased', 'or', 'alignmentfree', 'methods', 'for', 'phylogeny', 'reconstruction', 'are', 'much', 'faster', 'than', 'traditional', 'approaches', 'but', 'they', 'are', 'generally', 'less', 'accurate', 'most', 'of', 'these', 'methods', 'calculate', 'pairwise', 'distances', 'for', 'a', 'set', 'of', 'inpu... | [-0.0584787823010831, 0.06428051023330125, -0.055044163749294564, 0.13153591168520506, -0.0779431484649346, -0.13729531774879433, 0.06875258816580754, 0.4141982523465736, -0.2702523821668971, -0.3459768878076122, 0.07608564317585358, -0.3117158056185063, -0.12121710806806935, 0.20381555052073155, -0.017969644122381903,... |
1,803.09223 | Edge correlations in random regular hypergraphs and applications to
subgraph testing | Compared to the classical binomial random (hyper)graph model, the study of
random regular hypergraphs is made more challenging due to correlations between
the occurrence of different edges. We develop an edge-switching technique for
hypergraphs which allows us to show that these correlations are limited for a
large r... | math.CO | compared to the classical binomial random hypergraph model the study of random regular hypergraphs is made more challenging due to correlations between the occurrence of different edges we develop an edgeswitching technique for hypergraphs which allows us to show that these correlations are limited for a large range of... | [['compared', 'to', 'the', 'classical', 'binomial', 'random', 'hypergraph', 'model', 'the', 'study', 'of', 'random', 'regular', 'hypergraphs', 'is', 'made', 'more', 'challenging', 'due', 'to', 'correlations', 'between', 'the', 'occurrence', 'of', 'different', 'edges', 'we', 'develop', 'an', 'edgeswitching', 'technique'... | [-0.10211928617884693, 0.06667187658334754, -0.06511680753734524, 0.08532966944147591, -0.07585398453563728, -0.12602465892682013, 0.08961171723534296, 0.3524364403989396, -0.22913893678942035, -0.34229648677505736, 0.075193690091521, -0.29009739141690294, -0.1473833796809669, 0.18427480379820882, -0.15421534556734526,... |
1,803.09224 | Inexact Sequential Quadratic Optimization with Penalty Parameter Updates
Within the QP Solve: Extended Version | This paper focuses on the design of sequential quadratic optimization
(commonly known as SQP) methods for solving large-scale nonlinear optimization
problems. The most computationally demanding aspect of such an approach is the
computation of the search direction during each iteration, for which we
consider the use o... | math.OC | this paper focuses on the design of sequential quadratic optimization commonly known as sqp methods for solving largescale nonlinear optimization problems the most computationally demanding aspect of such an approach is the computation of the search direction during each iteration for which we consider the use of matri... | [['this', 'paper', 'focuses', 'on', 'the', 'design', 'of', 'sequential', 'quadratic', 'optimization', 'commonly', 'known', 'as', 'sqp', 'methods', 'for', 'solving', 'largescale', 'nonlinear', 'optimization', 'problems', 'the', 'most', 'computationally', 'demanding', 'aspect', 'of', 'such', 'an', 'approach', 'is', 'the'... | [-0.08533421485728697, -0.03826818998980138, -0.12169589910288073, 0.04816360404856347, -0.12248770543983625, -0.15366349330279216, 0.08879347596834389, 0.4016279231766678, -0.3251898105077065, -0.32231987595402134, 0.13846056492260478, -0.18448145152282955, -0.1984455030879581, 0.1867359944872792, -0.07651436089337511... |
1,803.09225 | NOMA for throughput and EE maximization in Energy Harvesting Enabled
Networks | Wireless power transfer via radio-frequency (RF) radiation is regarded as a
potential solution to energize energy-constrained users, who are deployed close
to the base stations (near-by users). However, energy transfer requires much
more transmit power than normal information transfer, which makes it very
challenging... | cs.IT math.IT | wireless power transfer via radiofrequency rf radiation is regarded as a potential solution to energize energyconstrained users who are deployed close to the base stations nearby users however energy transfer requires much more transmit power than normal information transfer which makes it very challenging to provide t... | [['wireless', 'power', 'transfer', 'via', 'radiofrequency', 'rf', 'radiation', 'is', 'regarded', 'as', 'a', 'potential', 'solution', 'to', 'energize', 'energyconstrained', 'users', 'who', 'are', 'deployed', 'close', 'to', 'the', 'base', 'stations', 'nearby', 'users', 'however', 'energy', 'transfer', 'requires', 'much',... | [-0.22337201491601624, -0.03509346042604496, -0.0020597591715794737, 0.07541195262617675, -0.11140127421071332, -0.2722252280960205, 0.12143802788529184, 0.41653376783654894, -0.24959954948875532, -0.33460274873481644, 0.04031018487062626, -0.26898655331423205, -0.13534907237451363, 0.18582078558392823, -0.122886744669... |
1,803.09226 | Kernel-based Detection of Coincidentally Correct Test Cases to Improve
Fault Localization Effectiveness | Although empirical studies have confirmed the effectiveness of spectrum-based
fault localization (SBFL) techniques, their performance may be degraded due to
presence of some undesired circumstances such as the existence of coincidental
correctness (CC) where one or more passing test cases exercise a faulty
statement ... | cs.SE | although empirical studies have confirmed the effectiveness of spectrumbased fault localization sbfl techniques their performance may be degraded due to presence of some undesired circumstances such as the existence of coincidental correctness cc where one or more passing test cases exercise a faulty statement and thus... | [['although', 'empirical', 'studies', 'have', 'confirmed', 'the', 'effectiveness', 'of', 'spectrumbased', 'fault', 'localization', 'sbfl', 'techniques', 'their', 'performance', 'may', 'be', 'degraded', 'due', 'to', 'presence', 'of', 'some', 'undesired', 'circumstances', 'such', 'as', 'the', 'existence', 'of', 'coincide... | [-0.07544235529064242, -0.015637902269625793, -0.10619417314613373, 0.09629480951411677, -0.10728893951728832, -0.17199162612804145, 0.10693646128208417, 0.37436550226656423, -0.242725045453973, -0.3063418630382343, 0.11311452488408194, -0.2434298748983934, -0.187391933866952, 0.20785021367212891, -0.10978642952007552,... |
1,803.09227 | A General Dichotomy of Evolutionary Algorithms on Monotone Functions | It is known that the evolutionary algorithm $(1+1)$-EA with mutation rate
$c/n$ optimises every monotone function efficiently if $c<1$, and needs
exponential time on some monotone functions (HotTopic functions) if $c\geq
2.2$. We study the same question for a large variety of algorithms,
particularly for $(1+\lambda)... | cs.NE | it is known that the evolutionary algorithm 11ea with mutation rate cn optimises every monotone function efficiently if c1 and needs exponential time on some monotone functions hottopic functions if cgeq 22 we study the same question for a large variety of algorithms particularly for 1lambdaea mu1ea mu1ga their fast co... | [['it', 'is', 'known', 'that', 'the', 'evolutionary', 'algorithm', '11ea', 'with', 'mutation', 'rate', 'cn', 'optimises', 'every', 'monotone', 'function', 'efficiently', 'if', 'c1', 'and', 'needs', 'exponential', 'time', 'on', 'some', 'monotone', 'functions', 'hottopic', 'functions', 'if', 'cgeq', '22', 'we', 'study', ... | [-0.1203246431619015, 0.16584751718737134, -0.02444958314030415, 0.13481502480282734, -0.03546285597779761, -0.1948291581134834, 0.08145059763912833, 0.3960947874082909, -0.2731092091289085, -0.26478640169895795, 0.10967142235910293, -0.21470296046174417, -0.13342103548751702, 0.20347517324918396, -0.049399384152079596... |
1,803.09228 | The Gross-Pitaevskii equation: B\"acklund transformations and admitted
solutions | B\"acklund transformations are applied to study the Gross-Pitaevskii
equation. Supported by previous results, a class of B\"acklund transformations
admitted by this equation are constructed. Schwartzian derivative as well as
its invariance properties turn out to represent a key tool in the present
investigation. Exam... | math-ph math.AP math.MP | backlund transformations are applied to study the grosspitaevskii equation supported by previous results a class of backlund transformations admitted by this equation are constructed schwartzian derivative as well as its invariance properties turn out to represent a key tool in the present investigation examples and ex... | [['backlund', 'transformations', 'are', 'applied', 'to', 'study', 'the', 'grosspitaevskii', 'equation', 'supported', 'by', 'previous', 'results', 'a', 'class', 'of', 'backlund', 'transformations', 'admitted', 'by', 'this', 'equation', 'are', 'constructed', 'schwartzian', 'derivative', 'as', 'well', 'as', 'its', 'invari... | [-0.13864429737880546, 0.0037263639464552674, -0.07963356870129916, 0.1007305300807721, -0.13047764770124318, -0.1421140766491727, -0.016172120457444834, 0.32617021457485434, -0.2671076885231261, -0.2827081692246896, 0.1183685320012166, -0.28358996586153673, -0.2009514549852542, 0.21420058007088472, 0.02045650499046973... |
1,803.09229 | Logarithmic girth expander graphs of $SL_n(\mathbb F_p)$ | We provide an explicit construction of finite 4-regular graphs
$(\Gamma_k)_{k\in \mathbb N}$ with ${girth \Gamma_k\to\infty}$ as $k\to\infty$
and $\frac{diam \Gamma_k}{girth \Gamma_k}\leqslant D$ for some $D>0$ and all
$k\in\mathbb{N}$. For each fixed dimension $n\geqslant 2,$ we find a pair of
matrices in $SL_{n}(\m... | math.GR math.CO math.MG | we provide an explicit construction of finite 4regular graphs gamma_k_kin mathbb n with girth gamma_ktoinfty as ktoinfty and fracdiam gamma_kgirth gamma_kleqslant d for some d0 and all kinmathbbn for each fixed dimension ngeqslant 2 we find a pair of matrices in sl_nmathbbz such that i they generate a free subgroup iit... | [['we', 'provide', 'an', 'explicit', 'construction', 'of', 'finite', '4regular', 'graphs', 'gamma_k_kin', 'mathbb', 'n', 'with', 'girth', 'gamma_ktoinfty', 'as', 'ktoinfty', 'and', 'fracdiam', 'gamma_kgirth', 'gamma_kleqslant', 'd', 'for', 'some', 'd0', 'and', 'all', 'kinmathbbn', 'for', 'each', 'fixed', 'dimension', '... | [-0.19329564471336655, 0.1705049804014442, -0.009762779660171495, 0.07234076004615932, -0.06557196482090549, -0.18613115281346929, -0.02530268424702369, 0.4049819027917143, -0.2343233556306552, -0.29373513490441927, 0.11056627844073721, -0.3495190067058605, -0.11548893894918216, 0.15808557656904063, -0.0806418772663850... |
1,803.0923 | Pay More Attention - Neural Architectures for Question-Answering | Machine comprehension is a representative task of natural language
understanding. Typically, we are given context paragraph and the objective is
to answer a question that depends on the context. Such a problem requires to
model the complex interactions between the context paragraph and the question.
Lately, attention... | cs.CL | machine comprehension is a representative task of natural language understanding typically we are given context paragraph and the objective is to answer a question that depends on the context such a problem requires to model the complex interactions between the context paragraph and the question lately attention mechan... | [['machine', 'comprehension', 'is', 'a', 'representative', 'task', 'of', 'natural', 'language', 'understanding', 'typically', 'we', 'are', 'given', 'context', 'paragraph', 'and', 'the', 'objective', 'is', 'to', 'answer', 'a', 'question', 'that', 'depends', 'on', 'the', 'context', 'such', 'a', 'problem', 'requires', 'to... | [-0.05010924614330251, -0.019193427287973464, -0.05952164448123849, 0.09122636495928019, -0.13828620635879735, -0.17849179448697855, 0.05351169833731123, 0.4638581091252269, -0.22905393879584693, -0.31197279597978755, 0.0469102130786432, -0.2531154419655207, -0.23454944169513448, 0.24670982101523176, -0.118435590219974... |
1,803.09231 | Biomolecular System Energetics | Efficient energy transduction is one driver of evolution; and thus
understanding biomolecular energy transduction is crucial to understanding
living organisms. As an energy-orientated modelling methodology, bond graphs
provide a useful approach to describing and modelling the efficiency of living
systems. This paper ... | q-bio.MN | efficient energy transduction is one driver of evolution and thus understanding biomolecular energy transduction is crucial to understanding living organisms as an energyorientated modelling methodology bond graphs provide a useful approach to describing and modelling the efficiency of living systems this paper gives s... | [['efficient', 'energy', 'transduction', 'is', 'one', 'driver', 'of', 'evolution', 'and', 'thus', 'understanding', 'biomolecular', 'energy', 'transduction', 'is', 'crucial', 'to', 'understanding', 'living', 'organisms', 'as', 'an', 'energyorientated', 'modelling', 'methodology', 'bond', 'graphs', 'provide', 'a', 'usefu... | [-0.08373867626851578, 0.0955436426373752, -0.05992622238385384, 0.08310879331242416, -0.06402477081559721, -0.1289550075689178, 0.02935907699847136, 0.3336595471215541, -0.22425323205648875, -0.30555446094787514, 0.027560124753928574, -0.1979192500384372, -0.25786176281141454, 0.24788757242628787, -0.07133851920972105... |
1,803.09232 | On the a posteriori error analysis for linear Fokker-Planck models in
convection-dominated diffusion problems | This work is aimed at the derivation of reliable and efficient a posteriori
error estimates for convection-dominated diffusion problems motivated by a
linear Fokker-Planck problem appearing in computational neuroscience. We obtain
computable error bounds of the functional type for the static and
time-dependent case a... | cs.NA math.NA | this work is aimed at the derivation of reliable and efficient a posteriori error estimates for convectiondominated diffusion problems motivated by a linear fokkerplanck problem appearing in computational neuroscience we obtain computable error bounds of the functional type for the static and timedependent case and for... | [['this', 'work', 'is', 'aimed', 'at', 'the', 'derivation', 'of', 'reliable', 'and', 'efficient', 'a', 'posteriori', 'error', 'estimates', 'for', 'convectiondominated', 'diffusion', 'problems', 'motivated', 'by', 'a', 'linear', 'fokkerplanck', 'problem', 'appearing', 'in', 'computational', 'neuroscience', 'we', 'obtain... | [-0.09222631659906577, 0.0018300302491030273, -0.03726455044987447, 0.09130924839033362, -0.06648914232740508, -0.13836100816397984, 0.06828647451064385, 0.32989393667427497, -0.24528894897221643, -0.2908738375586622, 0.19476643039653188, -0.21831026826163424, -0.13859633244026234, 0.24691331548725856, -0.1005582821747... |
1,803.09233 | On modules with self Tor vanishing | The long-standing Auslander and Reiten Conjecture states that a finitely
generated module over a finite-dimensional algebra is projective if certain
Ext-groups vanish. Several authors, including Avramov, Buchweitz, Iyengar,
Jorgensen, Nasseh, Sather-Wagstaff, and \c{S}ega, have studied a possible
counterpart of the c... | math.AC | the longstanding auslander and reiten conjecture states that a finitely generated module over a finitedimensional algebra is projective if certain extgroups vanish several authors including avramov buchweitz iyengar jorgensen nasseh satherwagstaff and csega have studied a possible counterpart of the conjecture or quest... | [['the', 'longstanding', 'auslander', 'and', 'reiten', 'conjecture', 'states', 'that', 'a', 'finitely', 'generated', 'module', 'over', 'a', 'finitedimensional', 'algebra', 'is', 'projective', 'if', 'certain', 'extgroups', 'vanish', 'several', 'authors', 'including', 'avramov', 'buchweitz', 'iyengar', 'jorgensen', 'nass... | [-0.20618128857458942, 0.022930063132662326, -0.09554584973957389, 0.058955132921983025, -0.04972774019697681, -0.16777144444640726, -0.04780718269903446, 0.2984141361434013, -0.3418513639597222, -0.18823551612440498, 0.09333425089134835, -0.19219968137913385, -0.13932610972842668, 0.23407630101719407, -0.1888781400048... |
1,803.09234 | Tetrads in solids: from elasticity theory to topological quantum Hall
systems and Weyl fermions | Theory of elasticity in topological insulators has many common features with
relativistic quantum fields interacting with gravitational field in the tetrad
form. Here we discuss several issues in the effective topological
(pseudo)electromagnetic response in three-dimensional weak crystalline
topological insulators wi... | cond-mat.str-el gr-qc hep-ph | theory of elasticity in topological insulators has many common features with relativistic quantum fields interacting with gravitational field in the tetrad form here we discuss several issues in the effective topological pseudoelectromagnetic response in threedimensional weak crystalline topological insulators with no ... | [['theory', 'of', 'elasticity', 'in', 'topological', 'insulators', 'has', 'many', 'common', 'features', 'with', 'relativistic', 'quantum', 'fields', 'interacting', 'with', 'gravitational', 'field', 'in', 'the', 'tetrad', 'form', 'here', 'we', 'discuss', 'several', 'issues', 'in', 'the', 'effective', 'topological', 'pse... | [-0.24241683315417237, 0.22945591920795458, -0.05553660215039546, 0.034999071442357754, -0.11030188312425333, -0.13352538432638325, -0.046990802017663716, 0.3141323443748714, -0.23510014477377647, -0.2449161288985873, 0.0014529632659533115, -0.28748253463110063, -0.2261266328414957, 0.06475274814703666, -0.056654754928... |
1,803.09235 | An improved Popoviciu-type inequality for a new Bernstein-type operator | Recently we introduced a new Bernstein-type operator using P\'olya's urn
model with negative replacement, and we showed that it satisfies a
Popoviciu-type inequality with a constant slightly larger than that of the
corresponding inequality for the classical Bernstein operator.
In the present paper we prove an inequ... | math.CA | recently we introduced a new bernsteintype operator using polyas urn model with negative replacement and we showed that it satisfies a popoviciutype inequality with a constant slightly larger than that of the corresponding inequality for the classical bernstein operator in the present paper we prove an inequality for t... | [['recently', 'we', 'introduced', 'a', 'new', 'bernsteintype', 'operator', 'using', 'polyas', 'urn', 'model', 'with', 'negative', 'replacement', 'and', 'we', 'showed', 'that', 'it', 'satisfies', 'a', 'popoviciutype', 'inequality', 'with', 'a', 'constant', 'slightly', 'larger', 'than', 'that', 'of', 'the', 'correspondin... | [-0.03683199681663176, 0.11028990642201582, -0.07546303669611613, 0.08192681127166863, -0.0706927160222438, -0.17767268725826094, 0.02848993610851245, 0.3156994731647761, -0.26624199872215587, -0.23329741146326774, 0.11124437660605292, -0.2912983317815122, -0.1650739045636285, 0.23071953960018055, -0.10273498295628954,... |
1,803.09236 | A mathematical justification of the Isobe-Kakinuma model for water waves
with and without bottom topography | We consider the Isobe-Kakinuma model for water waves in both cases of the
flat and the variable bottoms. The Isobe-Kakinuma model is a system of
Euler-Lagrange equations for an approximate Lagrangian which is derived from
Luke's Lagrangian for water waves by approximating the velocity potential in
the Lagrangian appr... | math.AP | we consider the isobekakinuma model for water waves in both cases of the flat and the variable bottoms the isobekakinuma model is a system of eulerlagrange equations for an approximate lagrangian which is derived from lukes lagrangian for water waves by approximating the velocity potential in the lagrangian appropriate... | [['we', 'consider', 'the', 'isobekakinuma', 'model', 'for', 'water', 'waves', 'in', 'both', 'cases', 'of', 'the', 'flat', 'and', 'the', 'variable', 'bottoms', 'the', 'isobekakinuma', 'model', 'is', 'a', 'system', 'of', 'eulerlagrange', 'equations', 'for', 'an', 'approximate', 'lagrangian', 'which', 'is', 'derived', 'fr... | [-0.1394315791732975, 0.08188259077896394, -0.02789777718288334, 0.05782197838523548, -0.028129723226332937, -0.09552236939290244, 0.003296795028482417, 0.26716286443345444, -0.2673818515782171, -0.28404589818857956, 0.11010836185060295, -0.2822790603294331, -0.1325250060736404, 0.13265117734983123, 0.00032881965346046... |
1,803.09237 | Goldbach's Function Approximation Using Deep Learning | Goldbach conjecture is one of the most famous open mathematical problems. It
states that every even number, bigger than two, can be presented as a sum of 2
prime numbers. % In this work we present a deep learning based model that
predicts the number of Goldbach partitions for a given even number.
Surprisingly, our mo... | cs.LG stat.ML | goldbach conjecture is one of the most famous open mathematical problems it states that every even number bigger than two can be presented as a sum of 2 prime numbers in this work we present a deep learning based model that predicts the number of goldbach partitions for a given even number surprisingly our model outper... | [['goldbach', 'conjecture', 'is', 'one', 'of', 'the', 'most', 'famous', 'open', 'mathematical', 'problems', 'it', 'states', 'that', 'every', 'even', 'number', 'bigger', 'than', 'two', 'can', 'be', 'presented', 'as', 'a', 'sum', 'of', '2', 'prime', 'numbers', 'in', 'this', 'work', 'we', 'present', 'a', 'deep', 'learning... | [-0.09972465419682713, 0.05822715744159748, -0.09531977228348104, 0.07940491688565653, -0.13258168938804196, -0.16676880184456078, 0.031457924927604505, 0.29135710328266445, -0.26216350841617975, -0.3584915427031966, 0.06980531045701355, -0.26410399177390426, -0.17229714361183399, 0.2363289003211244, -0.077113973032551... |
1,803.09238 | Hydrogen energy-levels shifts induced by the atom motion. Crossover from
the Lamb shifts to the motion-induced shifts | When the hydrogen atom moves, the proton current generates a magnetic field
which interacts with the hydrogen electron. A simple analyze shows that this
interaction between the hydrogen momentum and the electron is of order of
$\alpha^3\frac{v}{c}m$, where $\alpha$ is the fine structure constant, $v$ is
the atom velo... | physics.atom-ph quant-ph | when the hydrogen atom moves the proton current generates a magnetic field which interacts with the hydrogen electron a simple analyze shows that this interaction between the hydrogen momentum and the electron is of order of alpha3fracvcm where alpha is the fine structure constant v is the atom velocity c is the speed ... | [['when', 'the', 'hydrogen', 'atom', 'moves', 'the', 'proton', 'current', 'generates', 'a', 'magnetic', 'field', 'which', 'interacts', 'with', 'the', 'hydrogen', 'electron', 'a', 'simple', 'analyze', 'shows', 'that', 'this', 'interaction', 'between', 'the', 'hydrogen', 'momentum', 'and', 'the', 'electron', 'is', 'of', ... | [-0.15018497908893078, 0.22284650774115758, -0.023873393655310965, 0.05949831482409829, -0.022556081025904288, -0.09680524398458161, 0.017284976329020128, 0.33776722507419316, -0.2753619924297659, -0.3049255844176285, 0.004973588873426921, -0.3200521354424202, -0.05750432893758508, 0.13698470586907177, 0.03902275502538... |
1,803.09239 | What is a true spectra of a finite Fourier transform | In this paper we deal with a finite abelian group $G$ and the abstract
Fourier transform ${\mathcal F}:{\mathbb C}^G\to {\mathbb C}^\hat{G}$. Then, we
consider $\tilde{j}\circ {\mathcal F}:{\mathbb C}^G\to {\mathbb C}^\hat{G}$
where $\tilde j:{\mathbb C}^\hat{G}\to {\mathbb C}^G$ is defined by the
composition with a ... | math.GR math.RT | in this paper we deal with a finite abelian group g and the abstract fourier transform mathcal fmathbb cgto mathbb chatg then we consider tildejcirc mathcal fmathbb cgto mathbb chatg where tilde jmathbb chatgto mathbb cg is defined by the composition with a bijection jgto hatg tilde j is a pullback of j in particular w... | [['in', 'this', 'paper', 'we', 'deal', 'with', 'a', 'finite', 'abelian', 'group', 'g', 'and', 'the', 'abstract', 'fourier', 'transform', 'mathcal', 'fmathbb', 'cgto', 'mathbb', 'chatg', 'then', 'we', 'consider', 'tildejcirc', 'mathcal', 'fmathbb', 'cgto', 'mathbb', 'chatg', 'where', 'tilde', 'jmathbb', 'chatgto', 'math... | [-0.18324443467427046, 0.12541088230209424, -0.05503159972140566, -0.03754132776666665, -0.1082135571341496, -0.15240210277843289, -0.022329149056167806, 0.37347510498948394, -0.35178859981242566, -0.14224719199119135, 0.07074838110420387, -0.2808852919144556, -0.14323735341895372, 0.11585792558034883, -0.1389144245069... |
1,803.0924 | Ultraflat bands and shear solitons in Moir\'e patterns of twisted
bilayer transition metal dichalcogenides | Ultraflat bands in twisted bilayers of two-dimensional materials have
potential to host strong correlations, including the Mott-insulating phase at
half-filling of the band. Using first principles density functional theory
calculations, we show the emergence of ultraflat bands at the valence band edge
in twisted bila... | cond-mat.mtrl-sci | ultraflat bands in twisted bilayers of twodimensional materials have potential to host strong correlations including the mottinsulating phase at halffilling of the band using first principles density functional theory calculations we show the emergence of ultraflat bands at the valence band edge in twisted bilayer mos_... | [['ultraflat', 'bands', 'in', 'twisted', 'bilayers', 'of', 'twodimensional', 'materials', 'have', 'potential', 'to', 'host', 'strong', 'correlations', 'including', 'the', 'mottinsulating', 'phase', 'at', 'halffilling', 'of', 'the', 'band', 'using', 'first', 'principles', 'density', 'functional', 'theory', 'calculations... | [-0.1746898059027444, 0.19618314656963776, 0.006508399563244893, 0.06152509171079146, 0.018378781741830608, -0.14680258920270717, 0.11671519527135388, 0.5002210248931078, -0.26306056681823975, -0.29823231311729614, -0.04078123025010427, -0.320727759230067, -0.18402767033967393, 0.11380836972239194, 0.07950949871758439,... |
1,803.09241 | The axial symmetry of Kerr without the rigidity theorem | Local condition that imply the no-hair property of black holes are completed.
The conditions take the form of constraints on the geometry of the
2-dimensional crossover surface of black hole horizon. They imply also the
axial symmetry without the rigidity theorem. This is the new result contained
in this letter. The ... | gr-qc hep-th | local condition that imply the nohair property of black holes are completed the conditions take the form of constraints on the geometry of the 2dimensional crossover surface of black hole horizon they imply also the axial symmetry without the rigidity theorem this is the new result contained in this letter the family o... | [['local', 'condition', 'that', 'imply', 'the', 'nohair', 'property', 'of', 'black', 'holes', 'are', 'completed', 'the', 'conditions', 'take', 'the', 'form', 'of', 'constraints', 'on', 'the', 'geometry', 'of', 'the', '2dimensional', 'crossover', 'surface', 'of', 'black', 'hole', 'horizon', 'they', 'imply', 'also', 'the... | [-0.1643275217160829, 0.0834352571944406, -0.10100565081046632, 0.09461812762455045, -0.12031689204067793, -0.12248534675733733, -0.02093919569026094, 0.26334792292438264, -0.21445089278835033, -0.29538059040657744, 0.1556736236437674, -0.27313829023845126, -0.08362539220324233, 0.20215503530084225, -0.0795809412067217... |
1,803.09242 | Controlling Dynamical Quantum Phase Transitions | We study the dynamics arising from a double quantum quench where the
parameters of a given Hamiltonian are abruptly changed from being in an
equilibrium phase A to a different phase B and back (A$\to$B$\to$A). As
prototype models, we consider the (integrable) transverse field Ising as well
as the (non-integrable) ANN... | cond-mat.stat-mech cond-mat.quant-gas cond-mat.str-el quant-ph | we study the dynamics arising from a double quantum quench where the parameters of a given hamiltonian are abruptly changed from being in an equilibrium phase a to a different phase b and back atobtoa as prototype models we consider the integrable transverse field ising as well as the nonintegrable annni model the retu... | [['we', 'study', 'the', 'dynamics', 'arising', 'from', 'a', 'double', 'quantum', 'quench', 'where', 'the', 'parameters', 'of', 'a', 'given', 'hamiltonian', 'are', 'abruptly', 'changed', 'from', 'being', 'in', 'an', 'equilibrium', 'phase', 'a', 'to', 'a', 'different', 'phase', 'b', 'and', 'back', 'atobtoa', 'as', 'proto... | [-0.1478957017218428, 0.21939737265451445, -0.13149045968228684, 0.045226898035200844, 0.0013095119768487555, -0.17992897114350592, 0.08101280972228518, 0.3289336551113852, -0.30873438468136427, -0.25618512172784125, 0.13188735745996902, -0.2657017492722454, -0.14504534430036853, 0.1487649357312226, 0.01961096207212124... |
1,803.09243 | On algebraic properties of low rank approximations of Prony systems | We consider the reconstruction of spike train signals of the form $$F(x) =
\sum_{i=1}^d a_i \delta(x-x_i),$$ from their moments measurements $m_k(F)=\int
x^k F(x) dx = \sum_{i=1}^d a_ix^k$. When some of the nodes $x_i$ near collide
the inversion becomes unstable. Given noisy moments measurements, a typical
consequenc... | math.CA | we consider the reconstruction of spike train signals of the form fx sum_i1d a_i deltaxx_i from their moments measurements m_kfint xk fx dx sum_i1d a_ixk when some of the nodes x_i near collide the inversion becomes unstable given noisy moments measurements a typical consequence is that reconstruction algorithms estima... | [['we', 'consider', 'the', 'reconstruction', 'of', 'spike', 'train', 'signals', 'of', 'the', 'form', 'fx', 'sum_i1d', 'a_i', 'deltaxx_i', 'from', 'their', 'moments', 'measurements', 'm_kfint', 'xk', 'fx', 'dx', 'sum_i1d', 'a_ixk', 'when', 'some', 'of', 'the', 'nodes', 'x_i', 'near', 'collide', 'the', 'inversion', 'beco... | [-0.22398228728738817, 0.0841986425044867, -0.026244191331383976, 0.03759306056198893, -0.05224858922208997, -0.19691949728133995, 0.04883114484887894, 0.33213610972102353, -0.278704442257615, -0.22261230870946377, 0.06639215085938897, -0.3601897814972461, -0.10979633735015354, 0.13801127146301873, -0.00826956663091761... |
1,803.09244 | Proximity-reduced range of internal phase differences in double
Josephson junctions with closely spaced interfaces | A substantial influence of the proximity and pair breaking effects on the
range of internal phase differences is shown to take place in symmetric double
Josephson junctions with closely spaced interfaces and to affect the evolution
of the supercurrent j with the changing central lead's length L. If the phase
differen... | cond-mat.supr-con cond-mat.mes-hall | a substantial influence of the proximity and pair breaking effects on the range of internal phase differences is shown to take place in symmetric double josephson junctions with closely spaced interfaces and to affect the evolution of the supercurrent j with the changing central leads length l if the phase difference p... | [['a', 'substantial', 'influence', 'of', 'the', 'proximity', 'and', 'pair', 'breaking', 'effects', 'on', 'the', 'range', 'of', 'internal', 'phase', 'differences', 'is', 'shown', 'to', 'take', 'place', 'in', 'symmetric', 'double', 'josephson', 'junctions', 'with', 'closely', 'spaced', 'interfaces', 'and', 'to', 'affect'... | [-0.24369886362667215, 0.23647229476972556, -0.04351916511301471, 0.02891125693404712, -0.03596507669707332, -0.15228354396539734, 0.07280385946325636, 0.3518896017143195, -0.2845464568156347, -0.29754600055907726, 0.03480214931040654, -0.2940544595174733, -0.05295213102530554, 0.16424421706109596, 0.02273742502836658,... |
1,803.09245 | On comparison between relative log de Rham-Witt cohomology and relative
log crystalline cohomology | In this article, we prove the comparison theorem between the relative log de
Rham-Witt cohomology and the relative log crystalline cohomology for a log
smooth saturated morphism of fs log schemes satisfying certain condition. Our
result covers the case where the base fs log scheme is etale locally log smooth
over a s... | math.NT math.AG | in this article we prove the comparison theorem between the relative log de rhamwitt cohomology and the relative log crystalline cohomology for a log smooth saturated morphism of fs log schemes satisfying certain condition our result covers the case where the base fs log scheme is etale locally log smooth over a scheme... | [['in', 'this', 'article', 'we', 'prove', 'the', 'comparison', 'theorem', 'between', 'the', 'relative', 'log', 'de', 'rhamwitt', 'cohomology', 'and', 'the', 'relative', 'log', 'crystalline', 'cohomology', 'for', 'a', 'log', 'smooth', 'saturated', 'morphism', 'of', 'fs', 'log', 'schemes', 'satisfying', 'certain', 'condi... | [-0.1805194966228945, -0.007216428211719102, -0.10160596684163094, 0.06925526340800926, -0.032980988289191555, -0.1709165678036456, 0.0553187393507331, 0.3424434234597245, -0.27825572326950426, -0.28499038038509233, 0.030528428439259986, -0.23196096264053973, -0.13833193412782357, 0.24923307323894864, -0.16886973738366... |
1,803.09246 | Ground states of the $L^2$-critical NLS equation with localized
nonlinearity on a tadpole graph | The paper aims at giving a first insight on the existence/nonexistence of
ground states for the $L^2$-critical NLS equation on metric graphs with
localized nonlinearity. In particular, we focus on the tadpole graph, which,
albeit being a toy model, allows to point out some specific features of the
problem, whose unde... | math.AP | the paper aims at giving a first insight on the existencenonexistence of ground states for the l2critical nls equation on metric graphs with localized nonlinearity in particular we focus on the tadpole graph which albeit being a toy model allows to point out some specific features of the problem whose understanding wil... | [['the', 'paper', 'aims', 'at', 'giving', 'a', 'first', 'insight', 'on', 'the', 'existencenonexistence', 'of', 'ground', 'states', 'for', 'the', 'l2critical', 'nls', 'equation', 'on', 'metric', 'graphs', 'with', 'localized', 'nonlinearity', 'in', 'particular', 'we', 'focus', 'on', 'the', 'tadpole', 'graph', 'which', 'a... | [-0.12677442552031656, 0.04636429851106776, -0.10959529701064814, 0.08939769119024277, -0.13294997373432443, -0.1661588792247992, 0.0469493297655789, 0.32085141268346395, -0.2203097630357533, -0.2645296877854618, 0.1572937566211055, -0.30715375053395083, -0.1681677060561222, 0.19981405779049455, -0.02248370999535709, 0... |
1,803.09247 | Qualitative behavior of cosmological models combining various matter
fields | The late time accelerated expansion of the universe can be realized using
scalar fields with given self-interacting potentials. Here we consider a
straightforward approach where a three cosmic fluid mixture is assumed. The
fluids are standard matter perfect fluid, dark matter, and a scalar field with
the role of dark... | gr-qc | the late time accelerated expansion of the universe can be realized using scalar fields with given selfinteracting potentials here we consider a straightforward approach where a three cosmic fluid mixture is assumed the fluids are standard matter perfect fluid dark matter and a scalar field with the role of dark energy... | [['the', 'late', 'time', 'accelerated', 'expansion', 'of', 'the', 'universe', 'can', 'be', 'realized', 'using', 'scalar', 'fields', 'with', 'given', 'selfinteracting', 'potentials', 'here', 'we', 'consider', 'a', 'straightforward', 'approach', 'where', 'a', 'three', 'cosmic', 'fluid', 'mixture', 'is', 'assumed', 'the',... | [-0.1703008679345388, 0.17751428934193594, -0.16888208563991444, 0.055641299706487055, -0.05864066245568985, -0.08506211908900661, -0.06519771175657364, 0.26494180107558213, -0.23469476053422247, -0.32729661412951017, 0.06654437679875021, -0.19255086068827681, -0.0749841412050753, 0.1228600386098993, 0.0396349834390329... |
1,803.09248 | Construction of nice nilpotent Lie groups | We illustrate an algorithm to classify nice nilpotent Lie algebras of
dimension $n$ up to a suitable notion of equivalence; applying the algorithm,
we obtain complete listings for $n\leq9$. On every nilpotent Lie algebra of
dimension $\leq 7$, we determine the number of inequivalent nice bases, which
can be $0$, $1$,... | math.DG | we illustrate an algorithm to classify nice nilpotent lie algebras of dimension n up to a suitable notion of equivalence applying the algorithm we obtain complete listings for nleq9 on every nilpotent lie algebra of dimension leq 7 we determine the number of inequivalent nice bases which can be 0 1 or 2 we show that an... | [['we', 'illustrate', 'an', 'algorithm', 'to', 'classify', 'nice', 'nilpotent', 'lie', 'algebras', 'of', 'dimension', 'n', 'up', 'to', 'a', 'suitable', 'notion', 'of', 'equivalence', 'applying', 'the', 'algorithm', 'we', 'obtain', 'complete', 'listings', 'for', 'nleq9', 'on', 'every', 'nilpotent', 'lie', 'algebra', 'of... | [-0.16405956178221484, 0.07246486598180614, -0.03517104074699988, 0.04456957967453439, -0.11903023174767133, -0.1953839799979518, -0.04126208465100384, 0.4016307034647801, -0.3103171105801561, -0.23563471352550344, 0.09881440871460757, -0.24180120838360047, -0.1008792262832621, 0.1814535655520699, -0.11424498927687675,... |
1,803.09249 | LTE-advanced simulation framework based on OMNeT++ | Long Term Evolution-Advanced (LTE-Advanced) is the most recent mobile
telecommunication technology proposed by 3GPP. LTE-Advanced is applied in some
countries, but still in development and testing phase, because of that, a
simulation model is needed to test this technology. This paper introduces a
LTE-Advanced simula... | cs.NI | long term evolutionadvanced lteadvanced is the most recent mobile telecommunication technology proposed by 3gpp lteadvanced is applied in some countries but still in development and testing phase because of that a simulation model is needed to test this technology this paper introduces a lteadvanced simulation framewor... | [['long', 'term', 'evolutionadvanced', 'lteadvanced', 'is', 'the', 'most', 'recent', 'mobile', 'telecommunication', 'technology', 'proposed', 'by', '3gpp', 'lteadvanced', 'is', 'applied', 'in', 'some', 'countries', 'but', 'still', 'in', 'development', 'and', 'testing', 'phase', 'because', 'of', 'that', 'a', 'simulation... | [-0.09861229923054841, 0.012226471189586889, -0.06749555490733612, 0.031505395765028275, -0.058809420914344844, -0.20191764781650687, -0.007250628493715166, 0.3939362402916664, -0.19490563723818577, -0.30311281426942777, 0.1539290852683951, -0.186447408757106, -0.20648084284870752, 0.24158848838470431, -0.0882378766268... |
1,803.0925 | Kinetics, pseudo-kinetics, uncertainty principle and quantum 1/f noise | 1/f noise at arbitrary low frequences is the way of existence of
irreversibility in thermal motion governed by reversible laws of mechanics.
This statement not once was confirmed in statistical mechanics beyond its
traditional kinetical roughenings. Here we point out that in case of quantum
statistical mechanics in p... | cond-mat.stat-mech quant-ph | 1f noise at arbitrary low frequences is the way of existence of irreversibility in thermal motion governed by reversible laws of mechanics this statement not once was confirmed in statistical mechanics beyond its traditional kinetical roughenings here we point out that in case of quantum statistical mechanics in princi... | [['1f', 'noise', 'at', 'arbitrary', 'low', 'frequences', 'is', 'the', 'way', 'of', 'existence', 'of', 'irreversibility', 'in', 'thermal', 'motion', 'governed', 'by', 'reversible', 'laws', 'of', 'mechanics', 'this', 'statement', 'not', 'once', 'was', 'confirmed', 'in', 'statistical', 'mechanics', 'beyond', 'its', 'tradi... | [-0.07835393863177159, 0.18432072925847023, -0.1333874640101567, 0.10892202122602612, -0.016081980324815958, -0.1268060218100436, 0.08376167526468635, 0.29606280647218225, -0.3018015940021723, -0.28469318717718123, 0.030798797040479258, -0.2704015766456723, -0.1360474329488352, 0.2008591318037361, -0.08476281869225204,... |
1,803.09251 | The DEIMOS 10k spectroscopic survey catalog of the COSMOS field | We present a catalog of 10718 objects in the COSMOS field observed through
multi-slit spectroscopy with the Deep Imaging Multi-Object Spectrograph
(DEIMOS) on the Keck II telescope in the wavelength range ~5500-9800A. The
catalog contains 6617 objects with high-quality spectra (two or more spectral
features), and 179... | astro-ph.GA astro-ph.CO | we present a catalog of 10718 objects in the cosmos field observed through multislit spectroscopy with the deep imaging multiobject spectrograph deimos on the keck ii telescope in the wavelength range 55009800a the catalog contains 6617 objects with highquality spectra two or more spectral features and 1798 objects wit... | [['we', 'present', 'a', 'catalog', 'of', '10718', 'objects', 'in', 'the', 'cosmos', 'field', 'observed', 'through', 'multislit', 'spectroscopy', 'with', 'the', 'deep', 'imaging', 'multiobject', 'spectrograph', 'deimos', 'on', 'the', 'keck', 'ii', 'telescope', 'in', 'the', 'wavelength', 'range', '55009800a', 'the', 'cat... | [-0.057201113366853996, 0.06682400082314952, -0.08757429536027733, 0.0445060778306364, -0.0852728763797371, -0.06898864437898174, 0.07362825584791009, 0.4461305358324402, -0.13499432711640028, -0.3895444643373291, 0.05530049192968236, -0.3295685848899821, -0.026620378678975005, 0.21649300986034578, -0.02119802631881781... |
1,803.09252 | Investigation of a sample of carbon-enhanced metal-poor stars observed
with FORS and GMOS | Carbon-enhanced metal-poor (CEMP) stars represent a sizeable fraction of all
known metal-poor stars in the Galaxy. Their formation and composition remains a
significant topic of investigation within the stellar astrophysics community.
We analysed a sample of low-resolution spectra of 30 dwarf stars, obtained
using th... | astro-ph.SR | carbonenhanced metalpoor cemp stars represent a sizeable fraction of all known metalpoor stars in the galaxy their formation and composition remains a significant topic of investigation within the stellar astrophysics community we analysed a sample of lowresolution spectra of 30 dwarf stars obtained using the the visua... | [['carbonenhanced', 'metalpoor', 'cemp', 'stars', 'represent', 'a', 'sizeable', 'fraction', 'of', 'all', 'known', 'metalpoor', 'stars', 'in', 'the', 'galaxy', 'their', 'formation', 'and', 'composition', 'remains', 'a', 'significant', 'topic', 'of', 'investigation', 'within', 'the', 'stellar', 'astrophysics', 'community... | [-0.032911278650010374, 0.12141997149439564, -0.04491563743146457, 0.06446036619614738, -0.1168838128844976, -0.09966970349596754, 0.10873308545868297, 0.43229476341111644, -0.13338227269453276, -0.3723225304560297, 0.015687860387590992, -0.32362792829561765, -0.012189807768489953, 0.18592382451537165, -0.0702407567652... |
1,803.09253 | Boundary behavior for random walks in cones | We study the asymptotic behavior of zero-drift random walks confined to
multidimensional convex cones, when the endpoint is close to the boundary. We
derive a local limit theorem in the fluctuation regime.
| math.PR | we study the asymptotic behavior of zerodrift random walks confined to multidimensional convex cones when the endpoint is close to the boundary we derive a local limit theorem in the fluctuation regime | [['we', 'study', 'the', 'asymptotic', 'behavior', 'of', 'zerodrift', 'random', 'walks', 'confined', 'to', 'multidimensional', 'convex', 'cones', 'when', 'the', 'endpoint', 'is', 'close', 'to', 'the', 'boundary', 'we', 'derive', 'a', 'local', 'limit', 'theorem', 'in', 'the', 'fluctuation', 'regime']] | [-0.15826872999969055, 0.13414045347599313, -0.15178323100553825, 0.11024267229731777, -0.030351280060131103, -0.1289947406767169, 0.1250041747407522, 0.3155820998363197, -0.286679987788375, -0.1294770439271815, 0.13163272263409453, -0.30520191992400214, -0.14004581957124174, 0.13562033727794187, -0.09817328261851799, ... |
1,803.09254 | A theory of the phenomenology of multipopulation genetic algorithm with
an application to the Ising model | Genetic algorithm (GA) is a stochastic metaheuristic process consisting on
the evolution of a population of candidate solutions for a given optimization
problem. By extension, multipopulation genetic algorithm (MPGA) aims for
efficiency by evolving many populations, or islands, in parallel and performing
migrations b... | cs.NE cond-mat.stat-mech | genetic algorithm ga is a stochastic metaheuristic process consisting on the evolution of a population of candidate solutions for a given optimization problem by extension multipopulation genetic algorithm mpga aims for efficiency by evolving many populations or islands in parallel and performing migrations between the... | [['genetic', 'algorithm', 'ga', 'is', 'a', 'stochastic', 'metaheuristic', 'process', 'consisting', 'on', 'the', 'evolution', 'of', 'a', 'population', 'of', 'candidate', 'solutions', 'for', 'a', 'given', 'optimization', 'problem', 'by', 'extension', 'multipopulation', 'genetic', 'algorithm', 'mpga', 'aims', 'for', 'effi... | [-0.10479155818179045, 0.05915481111519948, -0.08300558740451727, 0.09023935175736532, -0.03416895363097117, -0.10627664346885804, 0.07539110517205849, 0.35721494284241573, -0.2990518470505278, -0.3543886193393232, 0.09036647634619005, -0.2281105674975488, -0.17771071858412255, 0.18568693946932174, -0.04491255792297984... |
1,803.09255 | Improvement of heat exchanger efficiency by using hydraulic and thermal
entrance regions | This study investigates one of the possible approaches of improvement of heat
exchangers efficiency. Literature review shows that most approaches of
improvement are based on the heat transfer surface increasing and
laminar-to-turbulent flow transition using different types of riffles forming
and shaped inserts. In th... | physics.app-ph physics.comp-ph | this study investigates one of the possible approaches of improvement of heat exchangers efficiency literature review shows that most approaches of improvement are based on the heat transfer surface increasing and laminartoturbulent flow transition using different types of riffles forming and shaped inserts in this art... | [['this', 'study', 'investigates', 'one', 'of', 'the', 'possible', 'approaches', 'of', 'improvement', 'of', 'heat', 'exchangers', 'efficiency', 'literature', 'review', 'shows', 'that', 'most', 'approaches', 'of', 'improvement', 'are', 'based', 'on', 'the', 'heat', 'transfer', 'surface', 'increasing', 'and', 'laminartot... | [-0.11364059368158445, 0.060321270122529906, -0.03638183202257414, -0.007311734061223862, -0.07223395759131233, -0.12910998724629544, 0.06692269505601536, 0.3398615458203148, -0.251904726100577, -0.29902874081869796, 0.10343440636375383, -0.2895284652112886, -0.12120558146995841, 0.25064738508009643, -0.056795107195028... |
1,803.09256 | Detecting Heads using Feature Refine Net and Cascaded Multi-Scale
Architecture | This paper presents a method that can accurately detect heads especially
small heads under the indoor scene. To achieve this, we propose a novel method,
Feature Refine Net (FRN), and a cascaded multi-scale architecture. FRN exploits
the multi-scale hierarchical features created by deep convolutional neural
networks. ... | cs.CV | this paper presents a method that can accurately detect heads especially small heads under the indoor scene to achieve this we propose a novel method feature refine net frn and a cascaded multiscale architecture frn exploits the multiscale hierarchical features created by deep convolutional neural networks the proposed... | [['this', 'paper', 'presents', 'a', 'method', 'that', 'can', 'accurately', 'detect', 'heads', 'especially', 'small', 'heads', 'under', 'the', 'indoor', 'scene', 'to', 'achieve', 'this', 'we', 'propose', 'a', 'novel', 'method', 'feature', 'refine', 'net', 'frn', 'and', 'a', 'cascaded', 'multiscale', 'architecture', 'frn... | [-0.07651957832080225, 0.006065887042833184, -0.08054266669571597, 0.021698441282408127, -0.11830498051323884, -0.18675308608887903, 0.0037827130309953695, 0.41633009600965, -0.2471852815426294, -0.34717301188641236, 0.07071727351748094, -0.26411887007882656, -0.1915258816474222, 0.14843725821231524, -0.131428137424691... |
1,803.09257 | DEFenD: A Secure and Privacy-Preserving Decentralized System for Freight
Declaration | Millions of shipping containers filled with goods move around the world every
day. Before such a container may enter a trade bloc, the customs agency of the
goods' destination country must ensure that it does not contain illegal or
mislabeled goods. Due to the high volume of containers, customs agencies make a
select... | cs.CR | millions of shipping containers filled with goods move around the world every day before such a container may enter a trade bloc the customs agency of the goods destination country must ensure that it does not contain illegal or mislabeled goods due to the high volume of containers customs agencies make a selection of ... | [['millions', 'of', 'shipping', 'containers', 'filled', 'with', 'goods', 'move', 'around', 'the', 'world', 'every', 'day', 'before', 'such', 'a', 'container', 'may', 'enter', 'a', 'trade', 'bloc', 'the', 'customs', 'agency', 'of', 'the', 'goods', 'destination', 'country', 'must', 'ensure', 'that', 'it', 'does', 'not', ... | [-0.1166832656997097, 0.04078585102855336, -0.10431688242356248, 0.08045183818094523, -0.12177962130238491, -0.1824138059330029, 0.17074940763167826, 0.3689232958505324, -0.2585839891420087, -0.3060649816340547, 0.17583515290199303, -0.3339423528679351, -0.10641743798126899, 0.15178495822133634, -0.17827455630162503, 0... |
1,803.09258 | Evolutionary n-level Hypergraph Partitioning with Adaptive Coarsening | Hypergraph partitioning is an NP-hard problem that occurs in many computer
science applications where it is necessary to reduce large problems into a
number of smaller, computationally tractable sub-problems. Current techniques
use a multilevel approach wherein an initial partitioning is performed after
compressing t... | cs.NE cs.DC | hypergraph partitioning is an nphard problem that occurs in many computer science applications where it is necessary to reduce large problems into a number of smaller computationally tractable subproblems current techniques use a multilevel approach wherein an initial partitioning is performed after compressing the hyp... | [['hypergraph', 'partitioning', 'is', 'an', 'nphard', 'problem', 'that', 'occurs', 'in', 'many', 'computer', 'science', 'applications', 'where', 'it', 'is', 'necessary', 'to', 'reduce', 'large', 'problems', 'into', 'a', 'number', 'of', 'smaller', 'computationally', 'tractable', 'subproblems', 'current', 'techniques', '... | [-0.09196218496518672, 0.0810194380714425, -0.11778583175443585, 0.06628797569671872, -0.07278315190265261, -0.13746922019938076, 0.05414553102667606, 0.40410480472855465, -0.29738528053793645, -0.3321209589127826, 0.0951044599974661, -0.1911237074441656, -0.16079382199754633, 0.1588124077466548, -0.10779668411816515, ... |
1,803.09259 | Dynamics on the Wandering Components of the Fatou Set of Three
Transcendental Entire Functions and Their Composites | We prove that there exist three transcendental entire functions that have
infinite number of domains which lie in the wandering component of each of
these functions and their composites. This result is a generalization of the
result of Dinesh Kumar, Gopal Datt and Sanjay Kumar. In particular, they proved
that there e... | math.DS | we prove that there exist three transcendental entire functions that have infinite number of domains which lie in the wandering component of each of these functions and their composites this result is a generalization of the result of dinesh kumar gopal datt and sanjay kumar in particular they proved that there exist t... | [['we', 'prove', 'that', 'there', 'exist', 'three', 'transcendental', 'entire', 'functions', 'that', 'have', 'infinite', 'number', 'of', 'domains', 'which', 'lie', 'in', 'the', 'wandering', 'component', 'of', 'each', 'of', 'these', 'functions', 'and', 'their', 'composites', 'this', 'result', 'is', 'a', 'generalization'... | [-0.1817557768151164, 0.12690032583350935, -0.08735678264250359, 0.03345845684409141, -0.04116837690273921, -0.06552869221195579, 0.01850198951860269, 0.3588486549258232, -0.2476928231950539, -0.24431953263779482, 0.11978092073579319, -0.24564231678843498, -0.19182539471735557, 0.23855224582056203, -0.01728363875299692... |
1,803.0926 | Depleted Fully Monolithic Active CMOS Pixel Sensors (DMAPS) in High
Resistivity 150~nm Technology for LHC | Depleted monolithic CMOS active pixel sensors (DMAPS) have been developed in
order to demonstrate their suitability as pixel detectors in the outer layers
of a toroidal LHC apparatus inner tracker (ATLAS ITk) pixel detector in the
high-luminosity large hadron collider (HL-LHC). Two prototypes have been
fabricated usi... | physics.ins-det | depleted monolithic cmos active pixel sensors dmaps have been developed in order to demonstrate their suitability as pixel detectors in the outer layers of a toroidal lhc apparatus inner tracker atlas itk pixel detector in the highluminosity large hadron collider hllhc two prototypes have been fabricated using 150 nm c... | [['depleted', 'monolithic', 'cmos', 'active', 'pixel', 'sensors', 'dmaps', 'have', 'been', 'developed', 'in', 'order', 'to', 'demonstrate', 'their', 'suitability', 'as', 'pixel', 'detectors', 'in', 'the', 'outer', 'layers', 'of', 'a', 'toroidal', 'lhc', 'apparatus', 'inner', 'tracker', 'atlas', 'itk', 'pixel', 'detecto... | [-0.024288441756873995, 0.15517890012246757, 0.021859703184162055, -0.052567367209764765, 0.03603835733998464, -0.17488838871683698, -0.026908756627377062, 0.448253795450543, -0.16219710285945163, -0.40519770310203757, 0.09481860141756106, -0.332238615176625, 0.038926660968248025, 0.21146014428733545, -0.09556461744993... |
1,803.09261 | Some remarks on the model of rigid heat conductor with memory: unbounded
heat relaxation function | The model of rigid linear heat conductor with memory is reconsidered
focussing the interest on the heat relaxation function. Thus, the definitions
of heat flux and thermal work are revised to understand where changes are
required when the heat flux relaxation function $k$ is assumed to be unbounded
at the initial tim... | math-ph math.MP | the model of rigid linear heat conductor with memory is reconsidered focussing the interest on the heat relaxation function thus the definitions of heat flux and thermal work are revised to understand where changes are required when the heat flux relaxation function k is assumed to be unbounded at the initial time t0 t... | [['the', 'model', 'of', 'rigid', 'linear', 'heat', 'conductor', 'with', 'memory', 'is', 'reconsidered', 'focussing', 'the', 'interest', 'on', 'the', 'heat', 'relaxation', 'function', 'thus', 'the', 'definitions', 'of', 'heat', 'flux', 'and', 'thermal', 'work', 'are', 'revised', 'to', 'understand', 'where', 'changes', '... | [-0.11751596109118036, 0.15393853271457036, -0.06681203796655279, 0.06453759176464181, -0.0911409728640829, -0.14623404527852726, 0.018601529525346622, 0.36524305575765853, -0.30041299916588327, -0.2335852809742955, 0.135132289431943, -0.27390668334146917, -0.09663781790786292, 0.20924011819364796, -0.04616937842912787... |
1,803.09262 | On the pro-$p$-Iwahori invariants of supersingular representations of
unramified $U(2, 1)$ | Let $G$ be the unramified unitary group $U(2, 1)(E/F)$ over a non-archimedean
local field $F$ of odd residue characteristic $p$. In this paper, for any
supersingular representation of $G$ that contains the Steinberg weight, we
prove its pro-$p$-Iwahori invariants, as a right module over the
pro-$p$-Iwahori--Hecke alg... | math.RT math.NT | let g be the unramified unitary group u2 1ef over a nonarchimedean local field f of odd residue characteristic p in this paper for any supersingular representation of g that contains the steinberg weight we prove its propiwahori invariants as a right module over the propiwahorihecke algebra of g is emphnot simple | [['let', 'g', 'be', 'the', 'unramified', 'unitary', 'group', 'u2', '1ef', 'over', 'a', 'nonarchimedean', 'local', 'field', 'f', 'of', 'odd', 'residue', 'characteristic', 'p', 'in', 'this', 'paper', 'for', 'any', 'supersingular', 'representation', 'of', 'g', 'that', 'contains', 'the', 'steinberg', 'weight', 'we', 'prove... | [-0.2858551883210356, 0.07705163425886824, -0.18946866524549058, -0.025486444329054884, -0.12725776996320257, -0.17430442364778942, -0.06282601973641878, 0.3117545754290544, -0.3850247208387233, -0.15565911021370155, -0.0011346334112414087, -0.20178153014813477, -0.10910161423425262, 0.19480117579671338, -0.15733678692... |
1,803.09263 | P2P-NET: Bidirectional Point Displacement Net for Shape Transform | We introduce P2P-NET, a general-purpose deep neural network which learns
geometric transformations between point-based shape representations from two
domains, e.g., meso-skeletons and surfaces, partial and complete scans, etc.
The architecture of the P2P-NET is that of a bi-directional point displacement
network, whi... | cs.GR cs.CV | we introduce p2pnet a generalpurpose deep neural network which learns geometric transformations between pointbased shape representations from two domains eg mesoskeletons and surfaces partial and complete scans etc the architecture of the p2pnet is that of a bidirectional point displacement network which transforms a s... | [['we', 'introduce', 'p2pnet', 'a', 'generalpurpose', 'deep', 'neural', 'network', 'which', 'learns', 'geometric', 'transformations', 'between', 'pointbased', 'shape', 'representations', 'from', 'two', 'domains', 'eg', 'mesoskeletons', 'and', 'surfaces', 'partial', 'and', 'complete', 'scans', 'etc', 'the', 'architectur... | [-0.07180868083711975, 0.02354755887322745, -0.0705113379005936, 0.05263252436942688, -0.11820870141386036, -0.14669938894228973, 0.0860619785569632, 0.4499018618831067, -0.341986714891947, -0.2867506193530977, 0.05410822045063944, -0.2850153069456766, -0.1701355619522132, 0.18091549112752175, -0.07747413875285987, 0.0... |
1,803.09264 | Searching for H$_{\alpha}$ emitting sources around MWC758: SPHERE/ZIMPOL
high-contrast imaging | MWC758 is a young star surrounded by a transitional disk. Recently, a
protoplanet candidate has been detected around MWC758 through high-resolution
$L'$-band observations. The candidate is located inside the disk cavity at a
separation of $\sim$111 mas from the central star, and at an average position
angle of $\sim$... | astro-ph.SR astro-ph.EP | mwc758 is a young star surrounded by a transitional disk recently a protoplanet candidate has been detected around mwc758 through highresolution lband observations the candidate is located inside the disk cavity at a separation of sim111 mas from the central star and at an average position angle of sim1655 degrees we h... | [['mwc758', 'is', 'a', 'young', 'star', 'surrounded', 'by', 'a', 'transitional', 'disk', 'recently', 'a', 'protoplanet', 'candidate', 'has', 'been', 'detected', 'around', 'mwc758', 'through', 'highresolution', 'lband', 'observations', 'the', 'candidate', 'is', 'located', 'inside', 'the', 'disk', 'cavity', 'at', 'a', 's... | [-0.09708569000835891, 0.05662002442513439, -0.06219006041148761, 0.041483047279856494, -0.0953797613992146, -0.12866010619243523, 0.05111880110931239, 0.4068848331173597, -0.1299046978211819, -0.3649600669489922, 0.09631290661038931, -0.3021203633325058, 0.03834219796578861, 0.2005662197574369, -0.05066912702435779, -... |
1,803.09265 | Entropy production and rectification efficiency in colloids transport
along a pulsating channel | We study the current rectification of particles moving in a pulsating channel
under the in uence of an applied force. We have shown the existence of diferent
rectification scenarios in which entropic and energetic effects compete. The
effect can be quantified by means of a rectification coefficient that is
analyzed i... | cond-mat.soft | we study the current rectification of particles moving in a pulsating channel under the in uence of an applied force we have shown the existence of diferent rectification scenarios in which entropic and energetic effects compete the effect can be quantified by means of a rectification coefficient that is analyzed in te... | [['we', 'study', 'the', 'current', 'rectification', 'of', 'particles', 'moving', 'in', 'a', 'pulsating', 'channel', 'under', 'the', 'in', 'uence', 'of', 'an', 'applied', 'force', 'we', 'have', 'shown', 'the', 'existence', 'of', 'diferent', 'rectification', 'scenarios', 'in', 'which', 'entropic', 'and', 'energetic', 'ef... | [-0.1569162241591103, 0.19354504885535895, -0.09159565909067169, 0.05586880532791838, -0.016938669536851674, -0.09367963079335716, -0.0015403034213865314, 0.323517472606481, -0.3058380040970138, -0.26333325420615866, 0.03368517439915141, -0.26290460696841095, -0.13585925093845136, 0.22622926135698115, -0.05438391480814... |
1,803.09266 | New SOCP relaxation and branching rule for bipartite bilinear programs | A bipartite bilinear program (BBP) is a quadratically constrained quadratic
optimization problem where the variables can be partitioned into two sets such
that fixing the variables in any one of the sets results in a linear program.
We propose a new second order cone representable (SOCP) relaxation for BBP,
which we ... | math.OC | a bipartite bilinear program bbp is a quadratically constrained quadratic optimization problem where the variables can be partitioned into two sets such that fixing the variables in any one of the sets results in a linear program we propose a new second order cone representable socp relaxation for bbp which we show is ... | [['a', 'bipartite', 'bilinear', 'program', 'bbp', 'is', 'a', 'quadratically', 'constrained', 'quadratic', 'optimization', 'problem', 'where', 'the', 'variables', 'can', 'be', 'partitioned', 'into', 'two', 'sets', 'such', 'that', 'fixing', 'the', 'variables', 'in', 'any', 'one', 'of', 'the', 'sets', 'results', 'in', 'a'... | [-0.11293150832181495, 0.04478288955589746, -0.09704636025879368, 0.06653730518711895, -0.1352434237658813, -0.15074024795938065, 0.06520544238361146, 0.30726770444615636, -0.3917698398342027, -0.2432301437263103, 0.12958235520465464, -0.22657696245518952, -0.17113750262925512, 0.19518627098124638, -0.05023808984825497... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.