id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0896 | Bonnet: An Open-Source Training and Deployment Framework for Semantic
Segmentation in Robotics using CNNs | The ability to interpret a scene is an important capability for a robot that
is supposed to interact with its environment. The knowledge of what is in front
of the robot is, for example, relevant for navigation, manipulation, or
planning. Semantic segmentation labels each pixel of an image with a class
label and thus... | cs.RO cs.CV | the ability to interpret a scene is an important capability for a robot that is supposed to interact with its environment the knowledge of what is in front of the robot is for example relevant for navigation manipulation or planning semantic segmentation labels each pixel of an image with a class label and thus provide... | [['the', 'ability', 'to', 'interpret', 'a', 'scene', 'is', 'an', 'important', 'capability', 'for', 'a', 'robot', 'that', 'is', 'supposed', 'to', 'interact', 'with', 'its', 'environment', 'the', 'knowledge', 'of', 'what', 'is', 'in', 'front', 'of', 'the', 'robot', 'is', 'for', 'example', 'relevant', 'for', 'navigation',... | [-0.07400981494243987, -0.006985850404594563, -0.05576041537393957, 0.04937327306603732, -0.15299828977344168, -0.18205710178200932, 0.007248662526069357, 0.4725798832473727, -0.24806066410760094, -0.3449679928691053, 0.08013806507877483, -0.21442860309302592, -0.18380374527492782, 0.21612545060246793, -0.1488049440588... |
1,802.08961 | Optimal Containment of Epidemics over Temporal Activity-Driven Networks | In this paper, we study the dynamics of epidemic processes taking place in
temporal and adaptive networks. Building on the activity-driven network model,
we propose an adaptive model of epidemic processes, where the network topology
dynamically changes due to both exogenous factors independent of the epidemic
dynamic... | cs.SI math.OC physics.soc-ph | in this paper we study the dynamics of epidemic processes taking place in temporal and adaptive networks building on the activitydriven network model we propose an adaptive model of epidemic processes where the network topology dynamically changes due to both exogenous factors independent of the epidemic dynamics as we... | [['in', 'this', 'paper', 'we', 'study', 'the', 'dynamics', 'of', 'epidemic', 'processes', 'taking', 'place', 'in', 'temporal', 'and', 'adaptive', 'networks', 'building', 'on', 'the', 'activitydriven', 'network', 'model', 'we', 'propose', 'an', 'adaptive', 'model', 'of', 'epidemic', 'processes', 'where', 'the', 'network... | [-0.1240504972075167, 0.10828362231162221, -0.05184366023533192, 0.055973495814030126, -0.010491597192252384, -0.09843636797497572, 0.12699986828089344, 0.3534862131696024, -0.2510631451964549, -0.2788028258988573, 0.11899640399344825, -0.2608505655323563, -0.2065864429243055, 0.12444238378392423, -0.048877365278457506... |
1,802.08962 | Mode Multigrid - A novel convergence acceleration method | This paper proposes a mode multigrid (MMG) method, and applies it to
accelerate the convergence of the steady state flow on unstructured grids. The
dynamic mode decomposition (DMD) technique is used to analyze the convergence
process of steady flow field according to the solution vectors from the
previous time steps.... | physics.comp-ph | this paper proposes a mode multigrid mmg method and applies it to accelerate the convergence of the steady state flow on unstructured grids the dynamic mode decomposition dmd technique is used to analyze the convergence process of steady flow field according to the solution vectors from the previous time steps unlike t... | [['this', 'paper', 'proposes', 'a', 'mode', 'multigrid', 'mmg', 'method', 'and', 'applies', 'it', 'to', 'accelerate', 'the', 'convergence', 'of', 'the', 'steady', 'state', 'flow', 'on', 'unstructured', 'grids', 'the', 'dynamic', 'mode', 'decomposition', 'dmd', 'technique', 'is', 'used', 'to', 'analyze', 'the', 'converg... | [-0.05784660258075648, 0.0323430762329711, -0.12020245581790137, 0.033948303802822315, -0.09307178356914443, -0.1276078572783373, 0.028377403598591987, 0.3719047027819627, -0.2877812328113602, -0.3105002776761393, 0.15081831422684538, -0.19942582860921046, -0.1125218031500913, 0.21013624857377153, -0.060640188331314834... |
1,802.08963 | The Mutual Information in Random Linear Estimation Beyond i.i.d.
Matrices | There has been definite progress recently in proving the variational
single-letter formula given by the heuristic replica method for various
estimation problems. In particular, the replica formula for the mutual
information in the case of noisy linear estimation with random i.i.d. matrices,
a problem with application... | cs.IT math-ph math.IT math.MP | there has been definite progress recently in proving the variational singleletter formula given by the heuristic replica method for various estimation problems in particular the replica formula for the mutual information in the case of noisy linear estimation with random iid matrices a problem with applications ranging... | [['there', 'has', 'been', 'definite', 'progress', 'recently', 'in', 'proving', 'the', 'variational', 'singleletter', 'formula', 'given', 'by', 'the', 'heuristic', 'replica', 'method', 'for', 'various', 'estimation', 'problems', 'in', 'particular', 'the', 'replica', 'formula', 'for', 'the', 'mutual', 'information', 'in'... | [-0.04154635838711181, 0.05771273551173173, -0.1038956028400912, 0.08147927195353953, -0.041696441898894335, -0.20011473295220114, 0.07346269574230285, 0.35389038945992923, -0.24777318745734053, -0.27854325806067604, 0.15224620706175226, -0.22073011293268954, -0.22141782549075648, 0.16097596518879942, -0.11677967987719... |
1,802.08964 | The large sieve with power moduli for $\mathbb{Z}[i]$ | We establish a large sieve inequality for power moduli in $\mathbb{Z}[i]$,
extending earlier work by L. Zhao and the first-named author on the large sieve
for power moduli for the classical case of moduli in $\mathbb{Z}$. Our method
starts with a version of the large sieve for $\mathbb{R}^2$. We convert the
resulting... | math.NT | we establish a large sieve inequality for power moduli in mathbbzi extending earlier work by l zhao and the firstnamed author on the large sieve for power moduli for the classical case of moduli in mathbbz our method starts with a version of the large sieve for mathbbr2 we convert the resulting counting problem back in... | [['we', 'establish', 'a', 'large', 'sieve', 'inequality', 'for', 'power', 'moduli', 'in', 'mathbbzi', 'extending', 'earlier', 'work', 'by', 'l', 'zhao', 'and', 'the', 'firstnamed', 'author', 'on', 'the', 'large', 'sieve', 'for', 'power', 'moduli', 'for', 'the', 'classical', 'case', 'of', 'moduli', 'in', 'mathbbz', 'our... | [-0.10122382830477496, 0.06463896195687678, -0.1089751779007307, 0.024425358754461227, -0.09359116201707418, -0.13198041193781124, 0.05828300887799781, 0.24721694889518878, -0.3007279968064656, -0.26638179949646734, 0.10469156313194906, -0.2609237150653549, -0.11791384390190891, 0.2521383882216785, -0.11243463958195155... |
1,802.08965 | Diffusion Based Molecular Communication with Limited Molecule Production
Rate | This paper studies the impact of a transmitter's molecule generation process
on the capacity of a concentration based Molecular Communication (MC) system.
Constraints caused by the molecule generation process affect the availability
of the molecules at the transmitter. The transmitter has a storage of
molecules, and ... | cs.IT math.IT | this paper studies the impact of a transmitters molecule generation process on the capacity of a concentration based molecular communication mc system constraints caused by the molecule generation process affect the availability of the molecules at the transmitter the transmitter has a storage of molecules and should d... | [['this', 'paper', 'studies', 'the', 'impact', 'of', 'a', 'transmitters', 'molecule', 'generation', 'process', 'on', 'the', 'capacity', 'of', 'a', 'concentration', 'based', 'molecular', 'communication', 'mc', 'system', 'constraints', 'caused', 'by', 'the', 'molecule', 'generation', 'process', 'affect', 'the', 'availabi... | [-0.2324160017655231, 0.06632315303431824, -0.056145664403447884, 0.021215874875019837, -0.032688701403094454, -0.18730418240302243, 0.13530254260549554, 0.3328424794774037, -0.26678384594706583, -0.28073748861206693, 0.10437415005872026, -0.2566941395401955, -0.1074169721119688, 0.1334162878090865, -0.0560157052415888... |
1,802.08966 | Deciphering the fluctuations of high frequency birth rates | Here the term "high frequency" refers to daily, weekly or monthly birth data.
The fluctuations of daily birth numbers show a succession of spikes and dips
which, at least at first sight, looks almost as random as white noise. However
in recent times several studies were published, including by the present
authors, wh... | physics.bio-ph physics.soc-ph | here the term high frequency refers to daily weekly or monthly birth data the fluctuations of daily birth numbers show a succession of spikes and dips which at least at first sight looks almost as random as white noise however in recent times several studies were published including by the present authors which have gi... | [['here', 'the', 'term', 'high', 'frequency', 'refers', 'to', 'daily', 'weekly', 'or', 'monthly', 'birth', 'data', 'the', 'fluctuations', 'of', 'daily', 'birth', 'numbers', 'show', 'a', 'succession', 'of', 'spikes', 'and', 'dips', 'which', 'at', 'least', 'at', 'first', 'sight', 'looks', 'almost', 'as', 'random', 'as', ... | [-0.08460571130385974, 0.18995562145629755, -0.05994180243599092, 0.13439187644638928, -0.09197760569876047, -0.12635072377686213, 0.09590259616481388, 0.3304430324506093, -0.25242996490006886, -0.33125172098577543, 0.1809097365101708, -0.29918748522958866, -0.14986792579049024, 0.21324897861805048, -0.1150407418901739... |
1,802.08967 | Shape Control for Experimental Continuation | An experimental method has been developed to locate unstable equilibria of
nonlinear structures quasi-statically. The technique involves loading a
structure by application of either a force or a displacement at a main
actuation point, while simultaneously controlling the overall shape using
additional probe points. T... | physics.app-ph cond-mat.soft | an experimental method has been developed to locate unstable equilibria of nonlinear structures quasistatically the technique involves loading a structure by application of either a force or a displacement at a main actuation point while simultaneously controlling the overall shape using additional probe points the met... | [['an', 'experimental', 'method', 'has', 'been', 'developed', 'to', 'locate', 'unstable', 'equilibria', 'of', 'nonlinear', 'structures', 'quasistatically', 'the', 'technique', 'involves', 'loading', 'a', 'structure', 'by', 'application', 'of', 'either', 'a', 'force', 'or', 'a', 'displacement', 'at', 'a', 'main', 'actua... | [-0.10473231085484008, 0.09633568523513732, -0.14267612751163952, 0.008771574915294627, -0.07364035388812996, -0.14141551688170204, 0.05215626424894883, 0.3873593663940063, -0.3052735957061196, -0.284715761184938, 0.13218568309701487, -0.2185913963233131, -0.16371099568857392, 0.1970382517710287, -0.01624558205910764, ... |
1,802.08968 | Group Divisible Designs with $\lambda_1=3$ and Large Second Index | A group divisible design $\mbox{GDD}(m,n;\lambda_1,\lambda_2)$, is an ordered
pair $(V, \cal{B})$ where $V$ is an $(m+n)$-set of symbols while $\cal{B}$ is a
collection of $3$-subsets (called blocks) of $V$ satisfying the following
properties: the $(m+n)$-set is divided into 2 groups of size $m$ and of size
$n$: each... | math.CO | a group divisible design mboxgddmnlambda_1lambda_2 is an ordered pair v calb where v is an mnset of symbols while calb is a collection of 3subsets called blocks of v satisfying the following properties the mnset is divided into 2 groups of size m and of size n each pair of symbols from the same group occurs in exactly ... | [['a', 'group', 'divisible', 'design', 'mboxgddmnlambda_1lambda_2', 'is', 'an', 'ordered', 'pair', 'v', 'calb', 'where', 'v', 'is', 'an', 'mnset', 'of', 'symbols', 'while', 'calb', 'is', 'a', 'collection', 'of', '3subsets', 'called', 'blocks', 'of', 'v', 'satisfying', 'the', 'following', 'properties', 'the', 'mnset', '... | [-0.19334484725831108, 0.15576782755146779, -0.005730700532072469, -0.003963843882574062, -0.019133398078561743, -0.15495576015101714, 0.012258323221957605, 0.36619818764493656, -0.2807678019540107, -0.23833895459150276, 0.10063200051438782, -0.2971512613523948, -0.1148369120977198, 0.15461364849838183, -0.043421568594... |
1,802.08969 | Meta Multi-Task Learning for Sequence Modeling | Semantic composition functions have been playing a pivotal role in neural
representation learning of text sequences. In spite of their success, most
existing models suffer from the underfitting problem: they use the same shared
compositional function on all the positions in the sequence, thereby lacking
expressive po... | cs.AI cs.CL | semantic composition functions have been playing a pivotal role in neural representation learning of text sequences in spite of their success most existing models suffer from the underfitting problem they use the same shared compositional function on all the positions in the sequence thereby lacking expressive power du... | [['semantic', 'composition', 'functions', 'have', 'been', 'playing', 'a', 'pivotal', 'role', 'in', 'neural', 'representation', 'learning', 'of', 'text', 'sequences', 'in', 'spite', 'of', 'their', 'success', 'most', 'existing', 'models', 'suffer', 'from', 'the', 'underfitting', 'problem', 'they', 'use', 'the', 'same', '... | [-0.0281610915400578, 0.026344651723966786, -0.0762574041758566, 0.06833807601211256, -0.11238020322420389, -0.1004711196904904, 0.04674902274794141, 0.45716272714841916, -0.33698053203759054, -0.3598783611516027, 0.024644627137795874, -0.2437009955204925, -0.1718133268785957, 0.1827425072189822, -0.10684473953197564, ... |
1,802.0897 | Incorporating Discriminator in Sentence Generation: a Gibbs Sampling
Method | Generating plausible and fluent sentence with desired properties has long
been a challenge. Most of the recent works use recurrent neural networks (RNNs)
and their variants to predict following words given previous sequence and
target label. In this paper, we propose a novel framework to generate
constrained sentence... | cs.CL | generating plausible and fluent sentence with desired properties has long been a challenge most of the recent works use recurrent neural networks rnns and their variants to predict following words given previous sequence and target label in this paper we propose a novel framework to generate constrained sentences via g... | [['generating', 'plausible', 'and', 'fluent', 'sentence', 'with', 'desired', 'properties', 'has', 'long', 'been', 'a', 'challenge', 'most', 'of', 'the', 'recent', 'works', 'use', 'recurrent', 'neural', 'networks', 'rnns', 'and', 'their', 'variants', 'to', 'predict', 'following', 'words', 'given', 'previous', 'sequence'... | [-0.0038894647214975622, 0.05999143777219693, -0.054116103091035726, 0.11380193991166895, -0.17327417680464777, -0.14430704870387728, 0.0840330296167299, 0.4812628793311708, -0.30289313675013635, -0.3383976725033588, 0.0037070825382676206, -0.2691581881171046, -0.16492874476552746, 0.16032563119028684, -0.1354558604229... |
1,802.08971 | Advanced Fabrication of Single-crystal Diamond Membranes for Quantum
Technologies | Many promising applications of single crystal diamond and its color centers
as sensor platform and in photonics require free-standing membranes with a
thickness ranging from several micrometers to the few 100 nm range. In this
work, we present an approach to conveniently fabricate such thin membranes with
up to about... | physics.app-ph cond-mat.mes-hall cond-mat.mtrl-sci quant-ph | many promising applications of single crystal diamond and its color centers as sensor platform and in photonics require freestanding membranes with a thickness ranging from several micrometers to the few 100 nm range in this work we present an approach to conveniently fabricate such thin membranes with up to about one ... | [['many', 'promising', 'applications', 'of', 'single', 'crystal', 'diamond', 'and', 'its', 'color', 'centers', 'as', 'sensor', 'platform', 'and', 'in', 'photonics', 'require', 'freestanding', 'membranes', 'with', 'a', 'thickness', 'ranging', 'from', 'several', 'micrometers', 'to', 'the', 'few', '100', 'nm', 'range', 'i... | [0.02518421065975811, 0.13295299410085923, 0.014556087618753029, -0.09308420735180137, 0.01074602315498955, -0.2003179250498581, 0.03984491446071785, 0.5066528405822149, -0.24793020240476082, -0.3380997700818405, 0.10505004210403533, -0.30458885828139864, -0.049871828121572113, 0.2236631838486168, -0.09399537801417267,... |
1,802.08972 | I'll Be Back: On the Multiple Lives of Users of a Mobile Activity
Tracking Application | Mobile health applications that track activities, such as exercise, sleep,
and diet, are becoming widely used. While these activity tracking applications
have the potential to improve our health, user engagement and retention are
critical factors for their success. However, long-term user engagement patterns
in real-... | cs.CY cs.SI | mobile health applications that track activities such as exercise sleep and diet are becoming widely used while these activity tracking applications have the potential to improve our health user engagement and retention are critical factors for their success however longterm user engagement patterns in realworld activi... | [['mobile', 'health', 'applications', 'that', 'track', 'activities', 'such', 'as', 'exercise', 'sleep', 'and', 'diet', 'are', 'becoming', 'widely', 'used', 'while', 'these', 'activity', 'tracking', 'applications', 'have', 'the', 'potential', 'to', 'improve', 'our', 'health', 'user', 'engagement', 'and', 'retention', 'a... | [-0.09267761552598261, 0.07271060021760474, -0.060111883599477424, 0.0966784660662857, -0.11915786519447076, -0.16796242815076506, 0.11680627548401909, 0.42796154425512734, -0.19807845645284813, -0.3750151282642037, 0.11641605514409353, -0.30247575641478763, -0.18841731388155106, 0.21374370038871088, -0.135086536557147... |
1,802.08973 | Low-field magnetotransport in graphene cavity devices | Confinement and edge structures are known to play significant roles in
electronic and transport properties of two-dimensional materials. Here, we
report on low-temperature magnetotransport measurements of lithographically
patterned graphene cavity nanodevices. It is found that the evolution of the
low-field magnetoco... | cond-mat.mes-hall cond-mat.mtrl-sci | confinement and edge structures are known to play significant roles in electronic and transport properties of twodimensional materials here we report on lowtemperature magnetotransport measurements of lithographically patterned graphene cavity nanodevices it is found that the evolution of the lowfield magnetoconductanc... | [['confinement', 'and', 'edge', 'structures', 'are', 'known', 'to', 'play', 'significant', 'roles', 'in', 'electronic', 'and', 'transport', 'properties', 'of', 'twodimensional', 'materials', 'here', 'we', 'report', 'on', 'lowtemperature', 'magnetotransport', 'measurements', 'of', 'lithographically', 'patterned', 'graph... | [-0.22556874952087663, 0.2243419726513173, -0.059399216681438154, -0.014123816846882643, 0.015563381270486351, -0.16946482027829815, 0.0669508073893567, 0.4419380695342201, -0.2705131096267843, -0.26690578721989944, -0.052205112561015794, -0.3464703779948288, -0.1866584538166373, 0.1933760274750219, 0.02667207106125018... |
1,802.08974 | A Framework in CRM Customer Lifecycle: Identify Downward Trend and
Potential Issues Detection | Customer retention is one of the primary goals in the area of customer
relationship management. A mass of work exists in which machine learning models
or business rules are established to predict churn. However, targeting users at
an early stage when they start to show a downward trend is a better strategy.
In downwa... | cs.CY cs.AI | customer retention is one of the primary goals in the area of customer relationship management a mass of work exists in which machine learning models or business rules are established to predict churn however targeting users at an early stage when they start to show a downward trend is a better strategy in downward tre... | [['customer', 'retention', 'is', 'one', 'of', 'the', 'primary', 'goals', 'in', 'the', 'area', 'of', 'customer', 'relationship', 'management', 'a', 'mass', 'of', 'work', 'exists', 'in', 'which', 'machine', 'learning', 'models', 'or', 'business', 'rules', 'are', 'established', 'to', 'predict', 'churn', 'however', 'target... | [-0.06379784897647121, 0.06281579961613352, -0.08293598374902186, 0.07831690623896231, -0.12185606215201267, -0.151313409590247, 0.13095865515223543, 0.41056527991915914, -0.24618190189927713, -0.3180375171033991, 0.09743813188889852, -0.3012190553362944, -0.16934840741137472, 0.16765714996295714, -0.1409922220021278, ... |
1,802.08975 | Self-similar solutions of decaying Keller-Segel systems for several
populations | It is known that solutions of the parabolic elliptic Keller-Segel equations
in the two dimensional plane decay, as time goes to infinity, provided the
initial data admits sub-critical mass and finite second moments, while such
solution concentrate, as $t\rightarrow\infty$, in the critical mass. In the
sub-critical ca... | math.AP | it is known that solutions of the parabolic elliptic kellersegel equations in the two dimensional plane decay as time goes to infinity provided the initial data admits subcritical mass and finite second moments while such solution concentrate as trightarrowinfty in the critical mass in the subcritical case this decay c... | [['it', 'is', 'known', 'that', 'solutions', 'of', 'the', 'parabolic', 'elliptic', 'kellersegel', 'equations', 'in', 'the', 'two', 'dimensional', 'plane', 'decay', 'as', 'time', 'goes', 'to', 'infinity', 'provided', 'the', 'initial', 'data', 'admits', 'subcritical', 'mass', 'and', 'finite', 'second', 'moments', 'while',... | [-0.15157415442233688, 0.10648529725509688, -0.060514620914080636, 0.07620551530068718, -0.022359603283612795, -0.11885520069708311, 0.002116532060913308, 0.2722393509628641, -0.2743620814777218, -0.2178651814912121, 0.15110415213492287, -0.30278698709755486, -0.08699387948158695, 0.18728225475053986, 0.000904916409338... |
1,802.08976 | Reinforcement Learning for Dynamic Bidding in Truckload Markets: an
Application to Large-Scale Fleet Management with Advance Commitments | Truckload brokerages, a $100 billion/year industry in the U.S., plays the
critical role of matching shippers with carriers, often to move loads several
days into the future. Brokerages not only have to find companies that will
agree to move a load, the brokerage often has to find a price that both the
shipper and car... | stat.ML cs.LG | truckload brokerages a 100 billionyear industry in the us plays the critical role of matching shippers with carriers often to move loads several days into the future brokerages not only have to find companies that will agree to move a load the brokerage often has to find a price that both the shipper and carrier will a... | [['truckload', 'brokerages', 'a', '100', 'billionyear', 'industry', 'in', 'the', 'us', 'plays', 'the', 'critical', 'role', 'of', 'matching', 'shippers', 'with', 'carriers', 'often', 'to', 'move', 'loads', 'several', 'days', 'into', 'the', 'future', 'brokerages', 'not', 'only', 'have', 'to', 'find', 'companies', 'that',... | [-0.08025613071842362, 0.08895338064360415, -0.08319283666389977, 0.07836922636813837, -0.12423799358169485, -0.19577365655955276, 0.1463612600877557, 0.4346833238436013, -0.2617153266201849, -0.3251717968378216, 0.1350176731198274, -0.2792347242205363, -0.10577343832932828, 0.19212544202712012, -0.1313003810810978, 0.... |
1,802.08977 | Cylindric Reverse Plane Partitions and 2D TQFT | The ring of symmetric functions carries the structure of a Hopf algebra. When
computing the coproduct of complete symmetric functions $h_\lambda$ one arrives
at weighted sums over reverse plane partitions (RPP) involving binomial
coefficients. Employing the action of the extended affine symmetric group at
fixed level... | math.CO math-ph math.MP math.RT | the ring of symmetric functions carries the structure of a hopf algebra when computing the coproduct of complete symmetric functions h_lambda one arrives at weighted sums over reverse plane partitions rpp involving binomial coefficients employing the action of the extended affine symmetric group at fixed level n we gen... | [['the', 'ring', 'of', 'symmetric', 'functions', 'carries', 'the', 'structure', 'of', 'a', 'hopf', 'algebra', 'when', 'computing', 'the', 'coproduct', 'of', 'complete', 'symmetric', 'functions', 'h_lambda', 'one', 'arrives', 'at', 'weighted', 'sums', 'over', 'reverse', 'plane', 'partitions', 'rpp', 'involving', 'binomi... | [-0.16828001641189694, 0.10177685696579974, -0.0958802459820115, 0.07872883227354215, -0.13798100059246318, -0.12591049952393438, -0.05614618788606819, 0.33242421956745893, -0.32326417404611213, -0.1310673282071427, 0.07457651486180697, -0.25342830914964937, -0.17766796970427348, 0.13995636276936588, -0.050575352599518... |
1,802.08978 | Spatial-resolved X-ray photoelectron spectroscopy of Weyl semimetal NbAs | We utilized X-ray photoemission electron microscopy (XPEEM) and X-ray
photoelectron spectroscopy (XPS) to investigate the crystal surface of Weyl
semimetal NbAs. XPEEM images present white and black contrast in both the Nb 3d
and As 3d core level spectra. Surface-sensitive XPS spectra indicate that the
entire surface... | cond-mat.mtrl-sci | we utilized xray photoemission electron microscopy xpeem and xray photoelectron spectroscopy xps to investigate the crystal surface of weyl semimetal nbas xpeem images present white and black contrast in both the nb 3d and as 3d core level spectra surfacesensitive xps spectra indicate that the entire surface of the sam... | [['we', 'utilized', 'xray', 'photoemission', 'electron', 'microscopy', 'xpeem', 'and', 'xray', 'photoelectron', 'spectroscopy', 'xps', 'to', 'investigate', 'the', 'crystal', 'surface', 'of', 'weyl', 'semimetal', 'nbas', 'xpeem', 'images', 'present', 'white', 'and', 'black', 'contrast', 'in', 'both', 'the', 'nb', '3d', ... | [-0.03341077564305864, 0.12573215908162447, -0.0438062998785659, 0.055780244044970374, -0.0014197268025126569, -0.14294049331138647, 0.12282095770121465, 0.44106647801087345, -0.2038869867209605, -0.3516186039981454, -0.00669801946415371, -0.43471020241376274, -0.1457940222787519, 0.2071910930775799, -0.011773564939408... |
1,802.08979 | NL2Bash: A Corpus and Semantic Parser for Natural Language Interface to
the Linux Operating System | We present new data and semantic parsing methods for the problem of mapping
English sentences to Bash commands (NL2Bash). Our long-term goal is to enable
any user to perform operations such as file manipulation, search, and
application-specific scripting by simply stating their goals in English. We
take a first step ... | cs.CL cs.SE | we present new data and semantic parsing methods for the problem of mapping english sentences to bash commands nl2bash our longterm goal is to enable any user to perform operations such as file manipulation search and applicationspecific scripting by simply stating their goals in english we take a first step in this do... | [['we', 'present', 'new', 'data', 'and', 'semantic', 'parsing', 'methods', 'for', 'the', 'problem', 'of', 'mapping', 'english', 'sentences', 'to', 'bash', 'commands', 'nl2bash', 'our', 'longterm', 'goal', 'is', 'to', 'enable', 'any', 'user', 'to', 'perform', 'operations', 'such', 'as', 'file', 'manipulation', 'search',... | [-0.07163609691764204, -0.05350214355171491, -0.06919707169230932, 0.07122840036978371, -0.1903912310178081, -0.1697629950940609, 0.12346384917588857, 0.4579822842318278, -0.27920213422905177, -0.3913718782699643, 0.06220115946593861, -0.254497979931796, -0.0838553220935118, 0.23447055393794122, -0.14694708219777125, 0... |
1,802.0898 | Pulsed reset protocol for fixed-frequency superconducting qubits | Improving coherence times of quantum bits is a fundamental challenge in the
field of quantum computing. With long-lived qubits it becomes, however,
inefficient to wait until the qubits have relaxed to their ground state after
completion of an experiment. Moreover, for error-correction schemes it is
import to rapidly ... | quant-ph | improving coherence times of quantum bits is a fundamental challenge in the field of quantum computing with longlived qubits it becomes however inefficient to wait until the qubits have relaxed to their ground state after completion of an experiment moreover for errorcorrection schemes it is import to rapidly reinitial... | [['improving', 'coherence', 'times', 'of', 'quantum', 'bits', 'is', 'a', 'fundamental', 'challenge', 'in', 'the', 'field', 'of', 'quantum', 'computing', 'with', 'longlived', 'qubits', 'it', 'becomes', 'however', 'inefficient', 'to', 'wait', 'until', 'the', 'qubits', 'have', 'relaxed', 'to', 'their', 'ground', 'state', ... | [-0.1574465835186106, 0.2251414954460213, -0.03772345778443629, 0.021759489976656846, 0.009345069993287325, -0.2692363570695595, 0.1446451499442836, 0.43750532973735107, -0.2300234811439637, -0.2591306194700005, 0.08183520137321293, -0.24347453985348463, -0.004875687539525744, 0.23243580733440697, -0.03687218303093687,... |
1,802.08981 | Cohomological field theories with non-tautological classes | A method of constructing Cohomological Field Theories (CohFTs) with unit
using minimal classes on the moduli spaces of curves is developed. As a simple
consequence, CohFTs with unit are found which take values outside of the
tautological cohomology of the moduli spaces of curves. A study of minimal
classes in low gen... | math.AG | a method of constructing cohomological field theories cohfts with unit using minimal classes on the moduli spaces of curves is developed as a simple consequence cohfts with unit are found which take values outside of the tautological cohomology of the moduli spaces of curves a study of minimal classes in low genus is p... | [['a', 'method', 'of', 'constructing', 'cohomological', 'field', 'theories', 'cohfts', 'with', 'unit', 'using', 'minimal', 'classes', 'on', 'the', 'moduli', 'spaces', 'of', 'curves', 'is', 'developed', 'as', 'a', 'simple', 'consequence', 'cohfts', 'with', 'unit', 'are', 'found', 'which', 'take', 'values', 'outside', 'o... | [-0.18404299914836883, 0.10073499698191882, -0.08807932094981273, 0.07548701310297475, -0.08003920265861476, -0.11448927075446894, 0.006543387534717718, 0.3025942265832176, -0.2583178697930028, -0.27087327518189946, 0.10421409375267103, -0.19944572813110426, -0.1654819515068084, 0.2682917984978606, -0.16874330554467937... |
1,802.08982 | Sparse Network Estimation for Dynamical Spatio-temporal Array Models | Neural field models represent neuronal communication on a population level
via synaptic weight functions. Using voltage sensitive dye (VSD) imaging it is
possible to obtain measurements of neural fields with a relatively high spatial
and temporal resolution. The synaptic weight functions represent functional
connecti... | stat.ME | neural field models represent neuronal communication on a population level via synaptic weight functions using voltage sensitive dye vsd imaging it is possible to obtain measurements of neural fields with a relatively high spatial and temporal resolution the synaptic weight functions represent functional connectivity i... | [['neural', 'field', 'models', 'represent', 'neuronal', 'communication', 'on', 'a', 'population', 'level', 'via', 'synaptic', 'weight', 'functions', 'using', 'voltage', 'sensitive', 'dye', 'vsd', 'imaging', 'it', 'is', 'possible', 'to', 'obtain', 'measurements', 'of', 'neural', 'fields', 'with', 'a', 'relatively', 'hig... | [-0.1019865655989757, 0.05042864520760407, -0.08301440903672536, 0.06865440769968091, -0.08752664289020036, -0.15232759155649103, 0.023305304259445297, 0.41398264661566164, -0.2993500042344313, -0.2747439598807922, 0.12834239164283034, -0.211477419183491, -0.22258825936856177, 0.17831263704250705, -0.03314371459484754,... |
1,802.08983 | High phase space density loading of a falling magnetic trap | Loading an ultra-cold ensemble into a static magnetic trap involves
unavoidable loss of phase space density when the gravitational energy dominates
the kinetic energy of the ensemble. In such a case the gravitational energy is
transformed into heat, making a subsequent evaporation process slower and less
efficient. W... | physics.atom-ph | loading an ultracold ensemble into a static magnetic trap involves unavoidable loss of phase space density when the gravitational energy dominates the kinetic energy of the ensemble in such a case the gravitational energy is transformed into heat making a subsequent evaporation process slower and less efficient we appl... | [['loading', 'an', 'ultracold', 'ensemble', 'into', 'a', 'static', 'magnetic', 'trap', 'involves', 'unavoidable', 'loss', 'of', 'phase', 'space', 'density', 'when', 'the', 'gravitational', 'energy', 'dominates', 'the', 'kinetic', 'energy', 'of', 'the', 'ensemble', 'in', 'such', 'a', 'case', 'the', 'gravitational', 'ene... | [-0.1336912829601961, 0.23090691168692648, -0.046572366405303614, 0.05262474227800192, 0.004519370719601677, -0.10866090303249154, 0.07939500443800981, 0.39036177979731884, -0.21869263896872793, -0.2784401003327976, 0.05084963269512849, -0.220100251938896, -0.016607385561361, 0.21741350566515247, 0.03329615583690513, 0... |
1,802.08984 | Secure Serverless Computing Using Dynamic Information Flow Control | The rise of serverless computing provides an opportunity to rethink cloud
security. We present an approach for securing serverless systems using a novel
form of dynamic information flow control (IFC).
We show that in serverless applications, the termination channel found in
most existing IFC systems can be arbitrar... | cs.PL cs.CR | the rise of serverless computing provides an opportunity to rethink cloud security we present an approach for securing serverless systems using a novel form of dynamic information flow control ifc we show that in serverless applications the termination channel found in most existing ifc systems can be arbitrarily ampli... | [['the', 'rise', 'of', 'serverless', 'computing', 'provides', 'an', 'opportunity', 'to', 'rethink', 'cloud', 'security', 'we', 'present', 'an', 'approach', 'for', 'securing', 'serverless', 'systems', 'using', 'a', 'novel', 'form', 'of', 'dynamic', 'information', 'flow', 'control', 'ifc', 'we', 'show', 'that', 'in', 'se... | [-0.20942386003691224, -0.016822399466197558, -0.08120116721261787, 0.049833613108901255, -0.09830095823153656, -0.1958649853714206, 0.06527616410821149, 0.4035523547337646, -0.2787779878332502, -0.3187469539059474, 0.09236045022478608, -0.23222086437672904, -0.15526147184077552, 0.22824136811448673, -0.070791251096664... |
1,802.08985 | Origin of the anomalous semiconducting behaviour in dense lithium | Experimentally, it is known that lithium undergoes a metal to semiconductor
transition at about 80 GPA and a reentrant semiconductor to metal transition
near 120 GPA. This unusual behaviour has been attributed to the formation of
high-pressure electrides in the Li-\textit{Aba}2 phase. Using the accurate wave
function... | cond-mat.mtrl-sci | experimentally it is known that lithium undergoes a metal to semiconductor transition at about 80 gpa and a reentrant semiconductor to metal transition near 120 gpa this unusual behaviour has been attributed to the formation of highpressure electrides in the litextitaba2 phase using the accurate wave function based qua... | [['experimentally', 'it', 'is', 'known', 'that', 'lithium', 'undergoes', 'a', 'metal', 'to', 'semiconductor', 'transition', 'at', 'about', '80', 'gpa', 'and', 'a', 'reentrant', 'semiconductor', 'to', 'metal', 'transition', 'near', '120', 'gpa', 'this', 'unusual', 'behaviour', 'has', 'been', 'attributed', 'to', 'the', '... | [-0.10395493053383272, 0.21475419380028024, -0.08439422070709918, -0.01333168185785242, 0.008996466914092312, -0.13637058197286064, 0.14837998015191123, 0.4547077636127822, -0.24502309288861557, -0.30403042879694975, -0.0005563311954206638, -0.3511324789631003, -0.13575410883951905, 0.0806947338540562, 0.05431562203217... |
1,802.08986 | Wide field fluorescence epi-microscopy behind a scattering medium
enabled by speckle correlations | Fluorescence microscopy is widely used in biological imaging, however
scattering from tissues strongly limits its applicability to a shallow depth.
In this work we adapt a methodology inspired from stellar speckle
interferometry, and exploit the optical memory effect to enable fluorescence
microscopy through a turbid... | physics.optics physics.bio-ph | fluorescence microscopy is widely used in biological imaging however scattering from tissues strongly limits its applicability to a shallow depth in this work we adapt a methodology inspired from stellar speckle interferometry and exploit the optical memory effect to enable fluorescence microscopy through a turbid laye... | [['fluorescence', 'microscopy', 'is', 'widely', 'used', 'in', 'biological', 'imaging', 'however', 'scattering', 'from', 'tissues', 'strongly', 'limits', 'its', 'applicability', 'to', 'a', 'shallow', 'depth', 'in', 'this', 'work', 'we', 'adapt', 'a', 'methodology', 'inspired', 'from', 'stellar', 'speckle', 'interferomet... | [-0.011683082471376864, 0.09037167908431128, -0.05307912836814749, 0.0675730571752928, -0.06287074963610362, -0.1509735701734136, -0.006912867796751831, 0.4975819089674744, -0.30516767636391107, -0.33156238454554615, 0.0749775174386992, -0.275192552011717, -0.1556211012319244, 0.22992086483743684, -0.11084408583440657,... |
1,802.08987 | The Dividend Discount Model with Multiple Growth Rates of Any Order for
Stock Evaluation | In this paper we provide a general solution for the dividend discount model
in order to compute the intrinsic value of a common stock that allows for
multiple stage growth rates of any predetermined number of periods. A
mathematical proof is provided for the suggested general solution. A numerical
application is also... | q-fin.PR | in this paper we provide a general solution for the dividend discount model in order to compute the intrinsic value of a common stock that allows for multiple stage growth rates of any predetermined number of periods a mathematical proof is provided for the suggested general solution a numerical application is also pre... | [['in', 'this', 'paper', 'we', 'provide', 'a', 'general', 'solution', 'for', 'the', 'dividend', 'discount', 'model', 'in', 'order', 'to', 'compute', 'the', 'intrinsic', 'value', 'of', 'a', 'common', 'stock', 'that', 'allows', 'for', 'multiple', 'stage', 'growth', 'rates', 'of', 'any', 'predetermined', 'number', 'of', '... | [-0.08403114717817162, 0.022085292026309704, -0.09614352605067103, 0.09882954890391131, -0.1084193041684424, -0.10115139115965222, 0.09881231913672442, 0.3393192924615904, -0.26953642831252117, -0.26114334016129737, 0.17260268444859808, -0.2344894589870109, -0.1536395546366892, 0.22097133381417158, -0.12476965119755577... |
1,802.08988 | Deep Neural Network for Learning to Rank Query-Text Pairs | This paper considers the problem of document ranking in information retrieval
systems by Learning to Rank. We propose ConvRankNet combining a Siamese
Convolutional Neural Network encoder and the RankNet ranking model which could
be trained in an end-to-end fashion. We prove a general result justifying the
linear test... | cs.IR | this paper considers the problem of document ranking in information retrieval systems by learning to rank we propose convranknet combining a siamese convolutional neural network encoder and the ranknet ranking model which could be trained in an endtoend fashion we prove a general result justifying the linear testtime c... | [['this', 'paper', 'considers', 'the', 'problem', 'of', 'document', 'ranking', 'in', 'information', 'retrieval', 'systems', 'by', 'learning', 'to', 'rank', 'we', 'propose', 'convranknet', 'combining', 'a', 'siamese', 'convolutional', 'neural', 'network', 'encoder', 'and', 'the', 'ranknet', 'ranking', 'model', 'which', ... | [-0.0569767614290344, -0.05940102180973168, -0.05027796705888415, 0.06616336940329126, -0.10626597999715048, -0.23602462888723522, 0.02685333686443328, 0.48357759613656637, -0.3020691284204297, -0.29075291608883574, -0.005418617592306074, -0.26837457194359915, -0.25705538120007876, 0.12344082965247447, -0.1784919877959... |
1,802.08989 | Enhancing Gaussian Estimation of Distribution Algorithm by Exploiting
Evolution Direction with Archive | As a typical model-based evolutionary algorithm (EA), estimation of
distribution algorithm (EDA) possesses unique characteristics and has been
widely applied to global optimization. However, the common-used Gaussian EDA
(GEDA) usually suffers from premature convergence which severely limits its
search efficiency. Thi... | cs.NE | as a typical modelbased evolutionary algorithm ea estimation of distribution algorithm eda possesses unique characteristics and has been widely applied to global optimization however the commonused gaussian eda geda usually suffers from premature convergence which severely limits its search efficiency this study first ... | [['as', 'a', 'typical', 'modelbased', 'evolutionary', 'algorithm', 'ea', 'estimation', 'of', 'distribution', 'algorithm', 'eda', 'possesses', 'unique', 'characteristics', 'and', 'has', 'been', 'widely', 'applied', 'to', 'global', 'optimization', 'however', 'the', 'commonused', 'gaussian', 'eda', 'geda', 'usually', 'suf... | [-0.045441108029588145, 0.018182337944011053, -0.10636929806169386, 0.07570747918355591, -0.08331631495724473, -0.13962130979181522, 0.05293571251749465, 0.37609929629020494, -0.2804099276159123, -0.3359324764501534, 0.13602327231567074, -0.2351720835776604, -0.1460340209202264, 0.2111980803921279, -0.07207311311012102... |
1,802.0899 | Role of flow of information in the speedup of quantum evolution | The quantum evolution can be accelerated in non-Markovian environment.
Previous results showed that the formation of system-environment bound state
governs the quantum speedup. Although a stronger bound state in the
system-environment spectrum may seem like it should cause greater speed of
evolution, this seemingly i... | quant-ph | the quantum evolution can be accelerated in nonmarkovian environment previous results showed that the formation of systemenvironment bound state governs the quantum speedup although a stronger bound state in the systemenvironment spectrum may seem like it should cause greater speed of evolution this seemingly intuitive... | [['the', 'quantum', 'evolution', 'can', 'be', 'accelerated', 'in', 'nonmarkovian', 'environment', 'previous', 'results', 'showed', 'that', 'the', 'formation', 'of', 'systemenvironment', 'bound', 'state', 'governs', 'the', 'quantum', 'speedup', 'although', 'a', 'stronger', 'bound', 'state', 'in', 'the', 'systemenvironme... | [-0.13809827778001824, 0.1811833601182851, -0.12854371428445072, 0.059404178622037916, -0.05049391204636254, -0.13763008253024278, 0.015064380501123692, 0.3614942104483168, -0.2851945523417995, -0.3051012127163881, 0.054562187143657244, -0.20484552398312858, -0.1315030600153423, 0.21435678922320286, -0.0548279855391958... |
1,802.08991 | A Compactness Result for $\mathcal{H}-$holomorphic Curves in
Symplectizations | $\mathcal{H}-$holomorphic curves are solutions of a specific modification of
the pseudoholomorphic curve equation in symplectizations involving a harmonic
$1-$form as perturbation term. In this paper we compactify the moduli space of
$\mathcal{H}-$holomorphic curves with a priori bounds on the harmonic
$1-$forms.
| math.SG math.DG | mathcalhholomorphic curves are solutions of a specific modification of the pseudoholomorphic curve equation in symplectizations involving a harmonic 1form as perturbation term in this paper we compactify the moduli space of mathcalhholomorphic curves with a priori bounds on the harmonic 1forms | [['mathcalhholomorphic', 'curves', 'are', 'solutions', 'of', 'a', 'specific', 'modification', 'of', 'the', 'pseudoholomorphic', 'curve', 'equation', 'in', 'symplectizations', 'involving', 'a', 'harmonic', '1form', 'as', 'perturbation', 'term', 'in', 'this', 'paper', 'we', 'compactify', 'the', 'moduli', 'space', 'of', '... | [-0.23346719495588686, 0.06433943216121052, -0.15931402728324984, 0.08873327583835529, -0.16624306492144014, -0.10969717052151881, 0.005086582997336802, 0.2879729496723995, -0.2543780843659145, -0.22175203577229163, 0.10207165723734694, -0.28959283153185755, -0.2023313998630861, 0.238885735593191, -0.1424831922234195, ... |
1,802.08992 | Bayesian linear inverse problems in regularity scales | We obtain rates of contraction of posterior distributions in inverse problems
defined by scales of smoothness classes. We derive abstract results for general
priors, with contraction rates determined by Galerkin approximation. The rate
depends on the amount of prior concentration near the true function and the
prior ... | math.ST stat.TH | we obtain rates of contraction of posterior distributions in inverse problems defined by scales of smoothness classes we derive abstract results for general priors with contraction rates determined by galerkin approximation the rate depends on the amount of prior concentration near the true function and the prior mass ... | [['we', 'obtain', 'rates', 'of', 'contraction', 'of', 'posterior', 'distributions', 'in', 'inverse', 'problems', 'defined', 'by', 'scales', 'of', 'smoothness', 'classes', 'we', 'derive', 'abstract', 'results', 'for', 'general', 'priors', 'with', 'contraction', 'rates', 'determined', 'by', 'galerkin', 'approximation', '... | [-0.0034666700088022712, 0.03297959274698234, -0.11137357568170161, 0.09837869899215322, -0.10019979991533971, -0.10222335809392603, 0.06415165695923229, 0.4138713812468745, -0.29362186469659474, -0.27794508105276006, 0.15283346010854218, -0.21215028198541586, -0.1302206574126761, 0.19627541624643702, -0.09381490342107... |
1,802.08993 | Bayesian inverse problems with partial observations | We study a nonparametric Bayesian approach to linear inverse problems under
discrete observations. We use the discrete Fourier transform to convert our
model into a truncated Gaussian sequence model, that is closely related to the
classical Gaussian sequence model. Upon placing the truncated series prior on
the unkno... | math.ST stat.TH | we study a nonparametric bayesian approach to linear inverse problems under discrete observations we use the discrete fourier transform to convert our model into a truncated gaussian sequence model that is closely related to the classical gaussian sequence model upon placing the truncated series prior on the unknown pa... | [['we', 'study', 'a', 'nonparametric', 'bayesian', 'approach', 'to', 'linear', 'inverse', 'problems', 'under', 'discrete', 'observations', 'we', 'use', 'the', 'discrete', 'fourier', 'transform', 'to', 'convert', 'our', 'model', 'into', 'a', 'truncated', 'gaussian', 'sequence', 'model', 'that', 'is', 'closely', 'related... | [-0.026471583575281937, 0.030962196100377835, -0.10484209103061659, 0.09674419385518353, -0.11147122536427699, -0.0894348491460849, 0.10465483119929932, 0.38676142544509506, -0.32218902726442766, -0.29056031795708126, 0.13780256168012364, -0.23207338833106825, -0.1236244934425952, 0.18252009669436703, -0.09848730196991... |
1,802.08994 | Adaptive Streaming in Interactive Multiview Video Systems | Multiview applications endow final users with the possibility to freely
navigate within 3D scenes with minimum-delay. A real feeling of scene
navigation is enabled by transmitting multiple high-quality camera views, which
can be used to synthesize additional virtual views to offer a smooth
navigation. However, when n... | cs.MM | multiview applications endow final users with the possibility to freely navigate within 3d scenes with minimumdelay a real feeling of scene navigation is enabled by transmitting multiple highquality camera views which can be used to synthesize additional virtual views to offer a smooth navigation however when network r... | [['multiview', 'applications', 'endow', 'final', 'users', 'with', 'the', 'possibility', 'to', 'freely', 'navigate', 'within', '3d', 'scenes', 'with', 'minimumdelay', 'a', 'real', 'feeling', 'of', 'scene', 'navigation', 'is', 'enabled', 'by', 'transmitting', 'multiple', 'highquality', 'camera', 'views', 'which', 'can', ... | [-0.13302904212363229, -0.003964511368763203, -0.07864897334455853, 0.029208302091179406, -0.15354038350333332, -0.22596153094215804, 0.07207796742548829, 0.46104550430559377, -0.2891532215351313, -0.38600788402293157, 0.08401266783619472, -0.22980013629421592, -0.16767310414725858, 0.18040259722989496, -0.206479093325... |
1,802.08995 | Using Information Invariants to Compare Swarm Algorithms and General
Multi-Robot Algorithms: A Technical Report | Robotic swarms are decentralized multi-robot systems whose members use local
information from proximal neighbors to execute simple reactive control laws
that result in emergent collective behaviors. In contrast, members of a general
multi-robot system may have access to global information, all- to-all
communication o... | cs.RO cs.IT cs.MA math.IT | robotic swarms are decentralized multirobot systems whose members use local information from proximal neighbors to execute simple reactive control laws that result in emergent collective behaviors in contrast members of a general multirobot system may have access to global information all toall communication or sophist... | [['robotic', 'swarms', 'are', 'decentralized', 'multirobot', 'systems', 'whose', 'members', 'use', 'local', 'information', 'from', 'proximal', 'neighbors', 'to', 'execute', 'simple', 'reactive', 'control', 'laws', 'that', 'result', 'in', 'emergent', 'collective', 'behaviors', 'in', 'contrast', 'members', 'of', 'a', 'ge... | [-0.14496919116231077, 0.004386419514673315, -0.0718866673514548, 0.03131067589121739, -0.14273312217391312, -0.1851017936485622, 0.06990965101174126, 0.42808104753306114, -0.2622569961631506, -0.3584984550590264, 0.1251805015872562, -0.2584584960384727, -0.18108161802243705, 0.20110762032040516, -0.14128534200441356, ... |
1,802.08996 | Spectral gap property and strong ergodicity for groups of affine
transformations of solenoids | Let X be a solenoid, that is, a compact finite dimensional connected abelian
group with normalized Haar measure m, and let G be a countable discrete group
acting on X by continuous affine transformations. We show that the probability
measure preserving action of G on (X,m) does not have the spectral gap property
if a... | math.DS | let x be a solenoid that is a compact finite dimensional connected abelian group with normalized haar measure m and let g be a countable discrete group acting on x by continuous affine transformations we show that the probability measure preserving action of g on xm does not have the spectral gap property if and only i... | [['let', 'x', 'be', 'a', 'solenoid', 'that', 'is', 'a', 'compact', 'finite', 'dimensional', 'connected', 'abelian', 'group', 'with', 'normalized', 'haar', 'measure', 'm', 'and', 'let', 'g', 'be', 'a', 'countable', 'discrete', 'group', 'acting', 'on', 'x', 'by', 'continuous', 'affine', 'transformations', 'we', 'show', '... | [-0.1874557058551702, 0.18235224484684798, -0.14581696400740024, -0.02390722235150892, -0.10198656651030841, -0.14474235478917072, 0.0136824201535562, 0.4561126245249962, -0.3130350043290648, -0.18517030780043067, 0.11141765818144356, -0.27558120616294185, -0.08847530596118806, 0.18804245858397015, -0.14595638731623004... |
1,802.08997 | RLS-Based Adaptive Dereverberation Tracing Abrupt Position Change of
Target Speaker | Adaptive algorithm based on multi-channel linear prediction is an effective
dereverberation method balancing well between the attenuation of the long-term
reverberation and the dereverberated speech quality. However, the abrupt change
of the speech source position, usually caused by the shift of the speakers,
forms a... | eess.AS cs.SD | adaptive algorithm based on multichannel linear prediction is an effective dereverberation method balancing well between the attenuation of the longterm reverberation and the dereverberated speech quality however the abrupt change of the speech source position usually caused by the shift of the speakers forms an obstac... | [['adaptive', 'algorithm', 'based', 'on', 'multichannel', 'linear', 'prediction', 'is', 'an', 'effective', 'dereverberation', 'method', 'balancing', 'well', 'between', 'the', 'attenuation', 'of', 'the', 'longterm', 'reverberation', 'and', 'the', 'dereverberated', 'speech', 'quality', 'however', 'the', 'abrupt', 'change... | [-0.09372394615706026, 0.018841738220032288, -0.09324839350790913, 0.023786647825407944, -0.08403768958602131, -0.14189498719735807, 0.051032904415203556, 0.4367628752433953, -0.30093505091088657, -0.3041080712084463, 0.10816976523707707, -0.23087174645742448, -0.20799771506934106, 0.18904631639666417, -0.1185948413624... |
1,802.08998 | On some adjunctions in equivariant stable homotopy theory | We investigate certain adjunctions in derived categories of equivariant
spectra, including a right adjoint to fixed points, a right adjoint to pullback
by an isometry of universes, and a chain of two right adjoints to geometric
fixed points. This leads to a variety of interesting other adjunctions,
including a chain ... | math.AT | we investigate certain adjunctions in derived categories of equivariant spectra including a right adjoint to fixed points a right adjoint to pullback by an isometry of universes and a chain of two right adjoints to geometric fixed points this leads to a variety of interesting other adjunctions including a chain of 6 so... | [['we', 'investigate', 'certain', 'adjunctions', 'in', 'derived', 'categories', 'of', 'equivariant', 'spectra', 'including', 'a', 'right', 'adjoint', 'to', 'fixed', 'points', 'a', 'right', 'adjoint', 'to', 'pullback', 'by', 'an', 'isometry', 'of', 'universes', 'and', 'a', 'chain', 'of', 'two', 'right', 'adjoints', 'to'... | [-0.17849221284425743, 0.07451974042566223, -0.08977163229389368, 0.08931897612559181, -0.13733990392899392, -0.1661376629112842, 0.04939582841502301, 0.3773814167424634, -0.3982572017891987, -0.18886706754061822, 0.12313371722907382, -0.25421772173030077, -0.028318857531868726, 0.15469466999953463, -0.1554818844322014... |
1,802.08999 | Contragredient representations over local fields of positive
characteristic | It is conjectured by Adams-Vogan and Prasad that under the local Langlands
correspondence, the L-parameter of the contragredient representation equals
that of the original representation composed with the Chevalley involution of
the L-group. We verify a variant of their prediction for all connected
reductive groups o... | math.RT math.NT | it is conjectured by adamsvogan and prasad that under the local langlands correspondence the lparameter of the contragredient representation equals that of the original representation composed with the chevalley involution of the lgroup we verify a variant of their prediction for all connected reductive groups over loc... | [['it', 'is', 'conjectured', 'by', 'adamsvogan', 'and', 'prasad', 'that', 'under', 'the', 'local', 'langlands', 'correspondence', 'the', 'lparameter', 'of', 'the', 'contragredient', 'representation', 'equals', 'that', 'of', 'the', 'original', 'representation', 'composed', 'with', 'the', 'chevalley', 'involution', 'of',... | [-0.19434957358118315, 0.043668715727769515, -0.17974634892677635, 0.03433097549317277, -0.09270818273018283, -0.08004443934293125, -0.0038247809279710054, 0.2779322647246855, -0.31657213951058855, -0.2364567392294041, 0.058223988466620955, -0.1944538241977253, -0.17598773987794464, 0.21065729603552344, -0.106856032052... |
1,802.09 | Measurement of transverse wakefields induced by a misaligned positron
bunch in a hollow channel plasma accelerator | Hollow channel plasma wakefield acceleration is a proposed method to provide
high acceleration gradients for electrons and positrons alike: a key to future
lepton colliders. However, beams which are misaligned from the channel axis
induce strong transverse wakefields, deflecting beams and reducing the collider
lumino... | physics.acc-ph | hollow channel plasma wakefield acceleration is a proposed method to provide high acceleration gradients for electrons and positrons alike a key to future lepton colliders however beams which are misaligned from the channel axis induce strong transverse wakefields deflecting beams and reducing the collider luminosity t... | [['hollow', 'channel', 'plasma', 'wakefield', 'acceleration', 'is', 'a', 'proposed', 'method', 'to', 'provide', 'high', 'acceleration', 'gradients', 'for', 'electrons', 'and', 'positrons', 'alike', 'a', 'key', 'to', 'future', 'lepton', 'colliders', 'however', 'beams', 'which', 'are', 'misaligned', 'from', 'the', 'chann... | [-0.1400004439533521, 0.24455433865547932, -0.056618731683836535, 0.10446285943572338, -0.060938574254321747, -0.18904441096979138, -0.0399265963351354, 0.4646447783129083, -0.22041742272205397, -0.30881389822715366, -0.02147310443767784, -0.2678557175020568, 0.09717646280192158, 0.22610044622650513, 0.0245308575944768... |
1,802.09001 | The Complexity of the Possible Winner Problem over Partitioned
Preferences | The Possible-Winner problem asks, given an election where the voters'
preferences over the set of candidates is partially specified, whether a
distinguished candidate can become a winner. In this work, we consider the
computational complexity of Possible-Winner under the assumption that the voter
preferences are $par... | cs.GT cs.CC cs.DS | the possiblewinner problem asks given an election where the voters preferences over the set of candidates is partially specified whether a distinguished candidate can become a winner in this work we consider the computational complexity of possiblewinner under the assumption that the voter preferences are partitioned t... | [['the', 'possiblewinner', 'problem', 'asks', 'given', 'an', 'election', 'where', 'the', 'voters', 'preferences', 'over', 'the', 'set', 'of', 'candidates', 'is', 'partially', 'specified', 'whether', 'a', 'distinguished', 'candidate', 'can', 'become', 'a', 'winner', 'in', 'this', 'work', 'we', 'consider', 'the', 'comput... | [-0.12136442318939379, 0.06345103826245503, -0.06852398470492803, 0.0462172952800119, -0.12182172318499018, -0.19286233921965285, 0.17527964805001325, 0.39599531774755814, -0.261025580390608, -0.30039450150989266, 0.08948888528979906, -0.2985437018456903, -0.1133311597229301, 0.12085530845670159, -0.08409457348531833, ... |
1,802.09002 | Scaling Behavior of Anisotropy Relaxation in Deformed Polymers | Drawing an analogy to the paradigm of quasi-elastic neutron scattering, we
present a general approach for quantitatively investigating the spatiotemporal
dependence of structural anisotropy relaxation in deformed polymers by using
small-angle neutron scattering. Experiments and non-equilibrium molecular
dynamics simu... | cond-mat.soft | drawing an analogy to the paradigm of quasielastic neutron scattering we present a general approach for quantitatively investigating the spatiotemporal dependence of structural anisotropy relaxation in deformed polymers by using smallangle neutron scattering experiments and nonequilibrium molecular dynamics simulations... | [['drawing', 'an', 'analogy', 'to', 'the', 'paradigm', 'of', 'quasielastic', 'neutron', 'scattering', 'we', 'present', 'a', 'general', 'approach', 'for', 'quantitatively', 'investigating', 'the', 'spatiotemporal', 'dependence', 'of', 'structural', 'anisotropy', 'relaxation', 'in', 'deformed', 'polymers', 'by', 'using',... | [-0.1059498844240027, 0.1979700945553954, -0.13926545100236712, 0.05357813339131618, -0.0668614886152292, -0.13082858145103923, 0.028918205932963507, 0.3721007168559091, -0.3339019758360727, -0.25979508814011104, 0.0007643276060532246, -0.23662721363611386, -0.12445157429569267, 0.19954373164884082, 0.06992252730248895... |
1,802.09003 | A generating function for the Euler numbers of the second kind and its
application | In the paper, 2 explicit formulas for the Euler numbers of the second kind
are obtained. Based on those formulas a exponential generating function is
deduced. Using the generating function some well-known and new identities for
the Euler number of the second kind are obtained.
| math.CO | in the paper 2 explicit formulas for the euler numbers of the second kind are obtained based on those formulas a exponential generating function is deduced using the generating function some wellknown and new identities for the euler number of the second kind are obtained | [['in', 'the', 'paper', '2', 'explicit', 'formulas', 'for', 'the', 'euler', 'numbers', 'of', 'the', 'second', 'kind', 'are', 'obtained', 'based', 'on', 'those', 'formulas', 'a', 'exponential', 'generating', 'function', 'is', 'deduced', 'using', 'the', 'generating', 'function', 'some', 'wellknown', 'and', 'new', 'identi... | [-0.153638202821215, 0.07326938041175406, -0.06815238013449643, 0.14084466614294797, -0.12077946124805344, -0.07509151141469678, -0.011849147140876287, 0.23933119891832272, -0.2552895900275972, -0.31597843890388805, 0.11135474754652629, -0.24382638653947247, -0.18016610460148919, 0.3329449978760547, -0.0008100031532295... |
1,802.09004 | Liouville theorems for stable at infinity solutions of Lane-Emden system | We consider the Lane-Emden system $-\Delta u = v^p$, $-\Delta v= u^\theta$ in
$\mathbb{R}^N$, and we prove the nonexistence of smooth positive solutions
which are stable outside a compact set, for any $p, \theta > 0$ under the
Sobolev hyperbola.
| math.AP | we consider the laneemden system delta u vp delta v utheta in mathbbrn and we prove the nonexistence of smooth positive solutions which are stable outside a compact set for any p theta 0 under the sobolev hyperbola | [['we', 'consider', 'the', 'laneemden', 'system', 'delta', 'u', 'vp', 'delta', 'v', 'utheta', 'in', 'mathbbrn', 'and', 'we', 'prove', 'the', 'nonexistence', 'of', 'smooth', 'positive', 'solutions', 'which', 'are', 'stable', 'outside', 'a', 'compact', 'set', 'for', 'any', 'p', 'theta', '0', 'under', 'the', 'sobolev', 'h... | [-0.26555323360585853, 0.03738446935619179, -0.013356755046468032, 0.029455239565944986, -0.05224292161629388, -0.22824690107403225, 0.020719380289512247, 0.2881963062590282, -0.32649944418747173, -0.10873239864840319, 0.08108851472589824, -0.3307351811151755, -0.05597681843822724, 0.17294319644325265, -0.0523284410469... |
1,802.09005 | Frequency domain TRINICON-based blind source separation method with
multi-source activity detection for sparsely mixed signals | The TRINICON ('Triple-N ICA for convolutive mixtures') framework is an
effective blind signal separation (BSS) method for separating sound sources
from convolutive mixtures. It makes full use of the non-whiteness,
non-stationarity and non-Gaussianity properties of the source signals and can
be implemented either in t... | eess.AS cs.SD | the trinicon triplen ica for convolutive mixtures framework is an effective blind signal separation bss method for separating sound sources from convolutive mixtures it makes full use of the nonwhiteness nonstationarity and nongaussianity properties of the source signals and can be implemented either in time domain or ... | [['the', 'trinicon', 'triplen', 'ica', 'for', 'convolutive', 'mixtures', 'framework', 'is', 'an', 'effective', 'blind', 'signal', 'separation', 'bss', 'method', 'for', 'separating', 'sound', 'sources', 'from', 'convolutive', 'mixtures', 'it', 'makes', 'full', 'use', 'of', 'the', 'nonwhiteness', 'nonstationarity', 'and'... | [-0.08015264240869631, 0.02822995832892567, -0.09245452727560723, 0.037542872570662036, -0.11999901296156976, -0.1496978043985095, 0.039758177959204964, 0.42305359300521633, -0.2852101729377099, -0.2900595640955818, 0.15035529375272166, -0.23177139094424626, -0.12769163050965981, 0.18468136186083217, -0.075727088314052... |
1,802.09006 | Valuing life detection missions | Recent discoveries imply that Early Mars was habitable for
life-as-we-know-it; that Enceladus might be habitable; and that many stars have
Earth-sized exoplanets whose insolation favors surface liquid water. These
exciting discoveries make it more likely that spacecraft now under construction
- Mars 2020, ExoMars rov... | astro-ph.EP | recent discoveries imply that early mars was habitable for lifeasweknowit that enceladus might be habitable and that many stars have earthsized exoplanets whose insolation favors surface liquid water these exciting discoveries make it more likely that spacecraft now under construction mars 2020 exomars rover jwst europ... | [['recent', 'discoveries', 'imply', 'that', 'early', 'mars', 'was', 'habitable', 'for', 'lifeasweknowit', 'that', 'enceladus', 'might', 'be', 'habitable', 'and', 'that', 'many', 'stars', 'have', 'earthsized', 'exoplanets', 'whose', 'insolation', 'favors', 'surface', 'liquid', 'water', 'these', 'exciting', 'discoveries'... | [-0.11501970678012097, 0.20449594723871878, -0.09219588615721272, 0.09888677643386708, -0.14032948636600087, -0.11874484959689359, 0.1027859499490249, 0.3591036570198353, -0.1730714967774768, -0.3524069990482061, 0.16959092406060305, -0.2829005088897482, -0.166385510705802, 0.23259763403855746, -0.13462469125046364, 0.... |
1,802.09007 | Evaluating and Tuning n-fold Integer Programming | In recent years, algorithmic breakthroughs in stringology, computational
social choice, scheduling, etc., were achieved by applying the theory of
so-called $n$-fold integer programming. An $n$-fold integer program (IP) has a
highly uniform block structured constraint matrix. Hemmecke, Onn, and Romanchuk
[Math. Progra... | cs.DS cs.SE | in recent years algorithmic breakthroughs in stringology computational social choice scheduling etc were achieved by applying the theory of socalled nfold integer programming an nfold integer program ip has a highly uniform block structured constraint matrix hemmecke onn and romanchuk math programming 2013 showed an al... | [['in', 'recent', 'years', 'algorithmic', 'breakthroughs', 'in', 'stringology', 'computational', 'social', 'choice', 'scheduling', 'etc', 'were', 'achieved', 'by', 'applying', 'the', 'theory', 'of', 'socalled', 'nfold', 'integer', 'programming', 'an', 'nfold', 'integer', 'program', 'ip', 'has', 'a', 'highly', 'uniform'... | [-0.11566434772103093, 0.059534350136580705, -0.07536365894262086, 0.0333014628066766, -0.09716814518482848, -0.18457800736481494, 0.08409566074694422, 0.37951023936271666, -0.26535635702650656, -0.35073149896269157, 0.1228112379241396, -0.2298137537110597, -0.17251032385001466, 0.1817191035088829, -0.07258593461560932... |
1,802.09008 | Semiclassical resolvent bound for compactly supported $L^\infty$
potentials | We give an elementary proof of a weighted resolvent estimate for
semiclassical Schr\"odinger operators in dimension $n \ge 1$. We require the
potential belong to $L^\infty(\mathbb{R}^n)$ and have compact support, but do
not require that it have derivatives in $L^\infty(\mathbb{R}^n)$. The weighted
resolvent norm is b... | math.AP | we give an elementary proof of a weighted resolvent estimate for semiclassical schrodinger operators in dimension n ge 1 we require the potential belong to linftymathbbrn and have compact support but do not require that it have derivatives in linftymathbbrn the weighted resolvent norm is bounded by ech43logh1 where h i... | [['we', 'give', 'an', 'elementary', 'proof', 'of', 'a', 'weighted', 'resolvent', 'estimate', 'for', 'semiclassical', 'schrodinger', 'operators', 'in', 'dimension', 'n', 'ge', '1', 'we', 'require', 'the', 'potential', 'belong', 'to', 'linftymathbbrn', 'and', 'have', 'compact', 'support', 'but', 'do', 'not', 'require', '... | [-0.07777169850690044, 0.12362850347851219, -0.05719681334174414, 0.0836450008824819, -0.1284498254865197, -0.16034703760601157, -0.024842907129874768, 0.3969611131920005, -0.20870857316789762, -0.19053213133142805, 0.11122585943337741, -0.3167118615699264, -0.09444214202648134, 0.15998646121621482, -0.0798868218761921... |
1,802.09009 | Galaxy Tagging: photometric redshift refinement and group richness
enhancement | We present a new scheme, $\it{galtag}$, for refining the photometric redshift
measurements of faint galaxies by probabilistically tagging them to observed
galaxy groups constructed from a brighter, magnitude-limited spectroscopy
survey. First, this method is tested on the DESI light-cone data constructed on
the GALFO... | astro-ph.GA | we present a new scheme itgaltag for refining the photometric redshift measurements of faint galaxies by probabilistically tagging them to observed galaxy groups constructed from a brighter magnitudelimited spectroscopy survey first this method is tested on the desi lightcone data constructed on the galform galaxy form... | [['we', 'present', 'a', 'new', 'scheme', 'itgaltag', 'for', 'refining', 'the', 'photometric', 'redshift', 'measurements', 'of', 'faint', 'galaxies', 'by', 'probabilistically', 'tagging', 'them', 'to', 'observed', 'galaxy', 'groups', 'constructed', 'from', 'a', 'brighter', 'magnitudelimited', 'spectroscopy', 'survey', '... | [-0.049342053967706447, 0.006645154153327942, -0.1102339026197646, 0.0556108833270982, -0.14291852967535423, -0.03588270432581859, 0.06671598284390404, 0.4656380546617914, -0.1493696669697181, -0.3542346134388747, 0.08730797267401011, -0.32599658464299297, -0.02470419126526489, 0.24757479114647707, -0.04392114713184789... |
1,802.0901 | Branching ratios and $CP$ asymmetries of $B\rightarrow \chi_{c1}K(\pi)$
decays | We investigate the exclusive nonleptonic decays $B\rightarrow
\chi_{c1}K(\pi)$ in the conventional perturbative QCD (PQCD) formalism. The
predictions of branching ratios and $CP$ asymmetries are given in detail. We
compare our results with available experimental data as well as predictions of
other theoretical studie... | hep-ph | we investigate the exclusive nonleptonic decays brightarrow chi_c1kpi in the conventional perturbative qcd pqcd formalism the predictions of branching ratios and cp asymmetries are given in detail we compare our results with available experimental data as well as predictions of other theoretical studies existing in the... | [['we', 'investigate', 'the', 'exclusive', 'nonleptonic', 'decays', 'brightarrow', 'chi_c1kpi', 'in', 'the', 'conventional', 'perturbative', 'qcd', 'pqcd', 'formalism', 'the', 'predictions', 'of', 'branching', 'ratios', 'and', 'cp', 'asymmetries', 'are', 'given', 'in', 'detail', 'we', 'compare', 'our', 'results', 'with... | [-0.08726240365360463, 0.17792496568030317, -0.06607428272347281, 0.0892298264391967, -0.07231832925069905, -0.13706071490409555, 0.07778158224810729, 0.326858172205505, -0.19225317776042794, -0.21662914670313035, 0.0448132648613822, -0.3310755359853883, -0.024971071501194642, 0.18787689511941758, 0.053641753372989154,... |
1,802.09011 | $\eta'$ Production in Nucleus-Nucleus collisions as a probe of chiral
dynamics | We argue that, because of the peculiar properties of the $\eta'$ meson, it is
a promising probe of "chiral" dynamics. In particular, we show that a rotating
gluon-dominated plasma might lead to an enhanced production of $\eta'$ w.r.t.
statistical model expectations. The presence of a strong topological
susceptibility... | nucl-th hep-ph nucl-ex | we argue that because of the peculiar properties of the eta meson it is a promising probe of chiral dynamics in particular we show that a rotating gluondominated plasma might lead to an enhanced production of eta wrt statistical model expectations the presence of a strong topological susceptibility might give a similar... | [['we', 'argue', 'that', 'because', 'of', 'the', 'peculiar', 'properties', 'of', 'the', 'eta', 'meson', 'it', 'is', 'a', 'promising', 'probe', 'of', 'chiral', 'dynamics', 'in', 'particular', 'we', 'show', 'that', 'a', 'rotating', 'gluondominated', 'plasma', 'might', 'lead', 'to', 'an', 'enhanced', 'production', 'of', '... | [-0.1554692208508749, 0.17886851112257993, -0.14500476978719234, 0.07929831748139021, -0.08386130057422832, -0.09915011952917027, 0.05077017100970491, 0.31384843172007565, -0.21999411901809496, -0.26747688848414636, 0.05408761195036223, -0.27975319649581565, -0.12764296604384953, 0.17236153547661287, -0.007832062481395... |
1,802.09012 | Cost-benefit Analysis of Visualization in Virtual Environments | Visualization and virtual environments (VEs) have been two interconnected
parallel strands in visual computing for decades. Some VEs have been purposely
developed for visualization applications, while many visualization applications
are exemplary showcases in general-purpose VEs. Because of the development and
operat... | cs.HC cs.GR | visualization and virtual environments ves have been two interconnected parallel strands in visual computing for decades some ves have been purposely developed for visualization applications while many visualization applications are exemplary showcases in generalpurpose ves because of the development and operation cost... | [['visualization', 'and', 'virtual', 'environments', 'ves', 'have', 'been', 'two', 'interconnected', 'parallel', 'strands', 'in', 'visual', 'computing', 'for', 'decades', 'some', 'ves', 'have', 'been', 'purposely', 'developed', 'for', 'visualization', 'applications', 'while', 'many', 'visualization', 'applications', 'a... | [-0.05709089880632558, 0.019951369224923084, -0.060619510409968165, 0.04616470984183252, -0.10812166310718348, -0.12594620097942394, 0.03151943547217625, 0.4005976934499782, -0.22266555893845086, -0.3441143242224794, 0.11989446439025603, -0.2943180488807888, -0.20201375641346234, 0.27595543411624585, -0.089843364968767... |
1,802.09013 | On decompositions and approximations of conjugate partial-symmetric
complex tensors | Conjugate partial-symmetric (CPS) tensors are the high-order generalization
of Hermitian matrices. As the role played by Hermitian matrices in matrix
theory and quadratic optimization, CPS tensors have shown growing interest
recently in tensor theory and optimization, particularly in many
application-driven complex p... | math.OC | conjugate partialsymmetric cps tensors are the highorder generalization of hermitian matrices as the role played by hermitian matrices in matrix theory and quadratic optimization cps tensors have shown growing interest recently in tensor theory and optimization particularly in many applicationdriven complex polynomial ... | [['conjugate', 'partialsymmetric', 'cps', 'tensors', 'are', 'the', 'highorder', 'generalization', 'of', 'hermitian', 'matrices', 'as', 'the', 'role', 'played', 'by', 'hermitian', 'matrices', 'in', 'matrix', 'theory', 'and', 'quadratic', 'optimization', 'cps', 'tensors', 'have', 'shown', 'growing', 'interest', 'recently... | [-0.13429637649868692, 0.06068397567398687, -0.043868088757391184, 0.027859110916175937, -0.10003085813142967, -0.1375982785925307, -0.03566412529337923, 0.3471504446195987, -0.2973809719800816, -0.24107959041162869, 0.1316429631747733, -0.24734097761125778, -0.25054806485719866, 0.12594270024790752, -0.051934350474395... |
1,802.09014 | Reconstruction of Convergence power spectrum from SNLS weak lensing data | We estimate the lensing convergence power spectrum from supernovae
magnification data using real space correlation function technique. For our
analysis we have utilized 296 supernovae from 5-year Supernovae Legacy Survey
in the weak lensing limit. The data we used consists of measurements from four
different patches,... | astro-ph.CO astro-ph.GA gr-qc | we estimate the lensing convergence power spectrum from supernovae magnification data using real space correlation function technique for our analysis we have utilized 296 supernovae from 5year supernovae legacy survey in the weak lensing limit the data we used consists of measurements from four different patches each ... | [['we', 'estimate', 'the', 'lensing', 'convergence', 'power', 'spectrum', 'from', 'supernovae', 'magnification', 'data', 'using', 'real', 'space', 'correlation', 'function', 'technique', 'for', 'our', 'analysis', 'we', 'have', 'utilized', '296', 'supernovae', 'from', '5year', 'supernovae', 'legacy', 'survey', 'in', 'th... | [-0.04046564893491688, -0.01988503475078061, -0.12869532174262843, 0.12584942521975717, -0.09335086862632974, -0.07030559030025586, 0.04645641260307099, 0.3722936595335878, -0.2716735610356707, -0.31295471297210603, 0.10492361423780867, -0.36681730149038994, -0.07129585681784684, 0.2628393796135168, -0.0265622258466762... |
1,802.09015 | Exchangeable interval hypergraphs and limits of ordered discrete
structures | A hypergraph $(V,E)$ is called an interval hypergraph if there exists a
linear order $l$ on $V$ such that every edge $e\in E$ is an interval w.r.t.
$l$; we also assume that $\{j\}\in E$ for every $j\in V$. Our main result is a
de Finetti-type representation of random exchangeable interval hypergraphs on
$\mathbb{N}$ ... | math.PR | a hypergraph ve is called an interval hypergraph if there exists a linear order l on v such that every edge ein e is an interval wrt l we also assume that jin e for every jin v our main result is a de finettitype representation of random exchangeable interval hypergraphs on mathbbn eihs the law of every eih can be obta... | [['a', 'hypergraph', 've', 'is', 'called', 'an', 'interval', 'hypergraph', 'if', 'there', 'exists', 'a', 'linear', 'order', 'l', 'on', 'v', 'such', 'that', 'every', 'edge', 'ein', 'e', 'is', 'an', 'interval', 'wrt', 'l', 'we', 'also', 'assume', 'that', 'jin', 'e', 'for', 'every', 'jin', 'v', 'our', 'main', 'result', 'i... | [-0.17058209259338467, 0.12995573450851378, -0.07416971864893665, 0.057477818386347204, -0.0763337653733685, -0.13912884269850853, 0.07337535129332075, 0.3855633591194137, -0.29702317908334114, -0.2250775607953727, 0.11189088647903114, -0.30352986116014735, -0.1085146883150641, 0.1599988610398444, -0.08870806140803837,... |
1,802.09016 | Limits on Light Weakly Interacting Massive Particles from the First
102.8 kg ${\times}$ day Data of the CDEX-10 Experiment | We report the first results of a light weakly interacting massive particles
(WIMPs) search from the CDEX-10 experiment with a 10 kg germanium detector
array immersed in liquid nitrogen at the China Jinping Underground Laboratory
with a physics data size of 102.8 kg day. At an analysis threshold of 160 eVee,
improved ... | hep-ex physics.ins-det | we report the first results of a light weakly interacting massive particles wimps search from the cdex10 experiment with a 10 kg germanium detector array immersed in liquid nitrogen at the china jinping underground laboratory with a physics data size of 1028 kg day at an analysis threshold of 160 evee improved limits o... | [['we', 'report', 'the', 'first', 'results', 'of', 'a', 'light', 'weakly', 'interacting', 'massive', 'particles', 'wimps', 'search', 'from', 'the', 'cdex10', 'experiment', 'with', 'a', '10', 'kg', 'germanium', 'detector', 'array', 'immersed', 'in', 'liquid', 'nitrogen', 'at', 'the', 'china', 'jinping', 'underground', '... | [-0.06753991901335356, 0.264875402699966, 0.010452681039705088, 0.07625400755480913, 0.05259280522402964, -0.10539400875813475, 0.08104667142033577, 0.32226995106198286, -0.047878132157615924, -0.4534372150505844, 0.04958501023755066, -0.404023064947442, 0.10006993528651564, 0.2127978133723924, 0.10365027501002738, -0.... |
1,802.09017 | Disorder-free weak dynamic localization in deformable lattices | We study the electron transport in a deformable lattice modeled in the
semiclassical approximation as a discrete nonlinear elastic chain where
acoustic phonons are in thermal equilibrium at temperature T. We reveal that an
effective dynamic disorder induced in the system due to thermalized phonons is
not strong enoug... | cond-mat.dis-nn | we study the electron transport in a deformable lattice modeled in the semiclassical approximation as a discrete nonlinear elastic chain where acoustic phonons are in thermal equilibrium at temperature t we reveal that an effective dynamic disorder induced in the system due to thermalized phonons is not strong enough t... | [['we', 'study', 'the', 'electron', 'transport', 'in', 'a', 'deformable', 'lattice', 'modeled', 'in', 'the', 'semiclassical', 'approximation', 'as', 'a', 'discrete', 'nonlinear', 'elastic', 'chain', 'where', 'acoustic', 'phonons', 'are', 'in', 'thermal', 'equilibrium', 'at', 'temperature', 't', 'we', 'reveal', 'that', ... | [-0.17334874186721838, 0.26447733969808374, -0.0412483109037715, 0.0764650879463428, -0.021895902858552883, -0.2145770998453075, 0.060821705405144214, 0.3937765705418222, -0.31587320018787773, -0.21185840352685475, -0.009448268100362728, -0.3105957269174408, -0.11568037658093536, 0.14564562135623121, 0.0515980601253710... |
1,802.09018 | Distributions associated with simultaneous multiple hypothesis testing | We develop the distribution of the number of hypotheses found to be
statistically significant using the rule from Benjamini and Hochberg (1995) for
controlling the false discovery rate (FDR). This distribution has both a small
sample form and an asymptotic expression for testing many independent
hypotheses simultaneo... | stat.ME | we develop the distribution of the number of hypotheses found to be statistically significant using the rule from benjamini and hochberg 1995 for controlling the false discovery rate fdr this distribution has both a small sample form and an asymptotic expression for testing many independent hypotheses simultaneously we... | [['we', 'develop', 'the', 'distribution', 'of', 'the', 'number', 'of', 'hypotheses', 'found', 'to', 'be', 'statistically', 'significant', 'using', 'the', 'rule', 'from', 'benjamini', 'and', 'hochberg', '1995', 'for', 'controlling', 'the', 'false', 'discovery', 'rate', 'fdr', 'this', 'distribution', 'has', 'both', 'a', ... | [-0.07236891965925073, 0.05705092502272843, -0.13434122940384302, 0.12660922070499508, -0.04943035393812214, -0.1318952571770007, 0.11455405309627002, 0.3833564860943818, -0.2441447300272006, -0.3283341637727889, 0.10084548229351639, -0.239029870825735, -0.12587992095698913, 0.20299006638392297, -0.07054534476589072, 0... |
1,802.09019 | Compatibility of Riemannian structures and Jacobi structures | We give a notion of compatibility between a Riemannian structure and a Jacobi
structure. We prove that in case of fundamental examples of Jacobi structures :
Poisson structures, contact structures and locally conformally symplectic
structures, we get respectively Riemann-Poisson structures in the sense of M.
Boucetta... | math.DG | we give a notion of compatibility between a riemannian structure and a jacobi structure we prove that in case of fundamental examples of jacobi structures poisson structures contact structures and locally conformally symplectic structures we get respectively riemannpoisson structures in the sense of m boucetta 12kenmot... | [['we', 'give', 'a', 'notion', 'of', 'compatibility', 'between', 'a', 'riemannian', 'structure', 'and', 'a', 'jacobi', 'structure', 'we', 'prove', 'that', 'in', 'case', 'of', 'fundamental', 'examples', 'of', 'jacobi', 'structures', 'poisson', 'structures', 'contact', 'structures', 'and', 'locally', 'conformally', 'symp... | [-0.2629997827671468, 0.06765701761469245, -0.09182286128401757, 0.12039768122136593, -0.12802353797480465, -0.09425957080908119, -0.055770804081112145, 0.4557508327066898, -0.3308533579856157, -0.22121993955224753, 0.029060305901803075, -0.21302622877061367, -0.2847689459845424, 0.14304769635666162, -0.059058732744306... |
1,802.0902 | Entropy stable modeling of non-isothermal multi-component
diffuse-interface two-phase flows with realistic equations of state | In this paper, we consider mathematical modeling and numerical simulation of
non-isothermal compressible multi-component diffuse-interface two-phase flows
with realistic equations of state. A general model with general reference
velocity is derived rigorously through thermodynamical laws and Onsager's
reciprocal prin... | math.NA physics.comp-ph | in this paper we consider mathematical modeling and numerical simulation of nonisothermal compressible multicomponent diffuseinterface twophase flows with realistic equations of state a general model with general reference velocity is derived rigorously through thermodynamical laws and onsagers reciprocal principle and... | [['in', 'this', 'paper', 'we', 'consider', 'mathematical', 'modeling', 'and', 'numerical', 'simulation', 'of', 'nonisothermal', 'compressible', 'multicomponent', 'diffuseinterface', 'twophase', 'flows', 'with', 'realistic', 'equations', 'of', 'state', 'a', 'general', 'model', 'with', 'general', 'reference', 'velocity',... | [-0.13073255322600535, 0.11034548934373861, -0.11616182570584625, 0.02051226773204194, -0.027607785625607555, -0.13471757137845636, 0.033274735934198565, 0.282095976495696, -0.28220790779676425, -0.31119671042585567, 0.03269995676648574, -0.24949180406484148, -0.11053853579467718, 0.17206741278596144, -0.02396588805936... |
1,802.09021 | Instrumental effects in BRITE photometry | The raw photometry from BRITE satellites suffers from several instrumental
effects. We present the list of the known effects and discuss their origin and
the ways to correct for them.
| astro-ph.IM | the raw photometry from brite satellites suffers from several instrumental effects we present the list of the known effects and discuss their origin and the ways to correct for them | [['the', 'raw', 'photometry', 'from', 'brite', 'satellites', 'suffers', 'from', 'several', 'instrumental', 'effects', 'we', 'present', 'the', 'list', 'of', 'the', 'known', 'effects', 'and', 'discuss', 'their', 'origin', 'and', 'the', 'ways', 'to', 'correct', 'for', 'them']] | [-0.04917131988331676, 0.06099559923944374, -0.10405048513785005, 0.14653091526900727, -0.1306965846568346, -0.045334600595136484, 0.13072984310953567, 0.35996667817234995, -0.29180804261316856, -0.3833110935986042, 0.13716798339349529, -0.3534011240117252, -0.14931030701845885, 0.21827048311630884, -0.1177034652481476... |
1,802.09022 | An Accelerated Method for Derivative-Free Smooth Stochastic Convex
Optimization | We consider an unconstrained problem of minimizing a smooth convex function
which is only available through noisy observations of its values, the noise
consisting of two parts. Similar to stochastic optimization problems, the first
part is of stochastic nature. The second part is additive noise of unknown
nature, but... | math.OC cs.CC | we consider an unconstrained problem of minimizing a smooth convex function which is only available through noisy observations of its values the noise consisting of two parts similar to stochastic optimization problems the first part is of stochastic nature the second part is additive noise of unknown nature but bounde... | [['we', 'consider', 'an', 'unconstrained', 'problem', 'of', 'minimizing', 'a', 'smooth', 'convex', 'function', 'which', 'is', 'only', 'available', 'through', 'noisy', 'observations', 'of', 'its', 'values', 'the', 'noise', 'consisting', 'of', 'two', 'parts', 'similar', 'to', 'stochastic', 'optimization', 'problems', 'th... | [-0.10771642118575346, 0.04602310942609023, -0.08776622521436564, 0.0651286031969421, -0.08795074272717608, -0.1777065185539913, 0.04671177756161521, 0.37555452466234973, -0.2915222798601363, -0.3090175277772334, 0.11641526221083935, -0.2477057548494287, -0.17188098371318986, 0.20482343543178397, -0.0902899632000115, 0... |
1,802.09023 | OGLE-2017-BLG-1130: The First Binary Gravitational Microlens Detected
From Spitzer Only | We analyze the binary gravitational microlensing event OGLE-2017-BLG-1130
(mass ratio q~0.45), the first published case in which the binary anomaly was
only detected by the Spitzer Space Telescope. This event provides strong
evidence that some binary signals can be missed by observations from the ground
alone but det... | astro-ph.EP astro-ph.SR | we analyze the binary gravitational microlensing event ogle2017blg1130 mass ratio q045 the first published case in which the binary anomaly was only detected by the spitzer space telescope this event provides strong evidence that some binary signals can be missed by observations from the ground alone but detected by sp... | [['we', 'analyze', 'the', 'binary', 'gravitational', 'microlensing', 'event', 'ogle2017blg1130', 'mass', 'ratio', 'q045', 'the', 'first', 'published', 'case', 'in', 'which', 'the', 'binary', 'anomaly', 'was', 'only', 'detected', 'by', 'the', 'spitzer', 'space', 'telescope', 'this', 'event', 'provides', 'strong', 'evide... | [-0.14259700205271925, 0.11812572608081003, -0.08733814141952381, 0.1466923856846902, -0.1470629912542386, -0.0864967565123354, 0.05373002616343675, 0.36468483725804146, -0.2154280413200872, -0.3632764751609001, 0.11049575808660679, -0.31414515613923194, -0.15583210190568395, 0.2053199256926611, -0.04413469950668514, 0... |
1,802.09024 | Viable Inflationary Evolution from Loop Quantum Cosmology Scalar-Tensor
Theory | In this work we construct a bottom-up reconstruction technique for Loop
Quantum Cosmology scalar-tensor theories, from the observational indices.
Particularly, the reconstruction technique is based on fixing the functional
form of the scalar-to-tensor ratio as a function of the $e$-foldings number.
The aim of the tec... | gr-qc astro-ph.CO hep-th | in this work we construct a bottomup reconstruction technique for loop quantum cosmology scalartensor theories from the observational indices particularly the reconstruction technique is based on fixing the functional form of the scalartotensor ratio as a function of the efoldings number the aim of the technique is to ... | [['in', 'this', 'work', 'we', 'construct', 'a', 'bottomup', 'reconstruction', 'technique', 'for', 'loop', 'quantum', 'cosmology', 'scalartensor', 'theories', 'from', 'the', 'observational', 'indices', 'particularly', 'the', 'reconstruction', 'technique', 'is', 'based', 'on', 'fixing', 'the', 'functional', 'form', 'of',... | [-0.12260125745727397, 0.14260833380022386, -0.1361094789363168, 0.12040906258840753, -0.05372774739781706, -0.1286901922605716, -0.014143774304898703, 0.3102732301797606, -0.21787014033629404, -0.29935309421091216, 0.07580547912651873, -0.2291294179972693, -0.17262060595716275, 0.1669611515461811, -0.04423261934950300... |
1,802.09025 | Online Learning of Quantum States | Suppose we have many copies of an unknown $n$-qubit state $\rho$. We measure
some copies of $\rho$ using a known two-outcome measurement $E_{1}$, then other
copies using a measurement $E_{2}$, and so on. At each stage $t$, we generate a
current hypothesis $\sigma_{t}$ about the state $\rho$, using the outcomes of
the... | quant-ph cs.LG | suppose we have many copies of an unknown nqubit state rho we measure some copies of rho using a known twooutcome measurement e_1 then other copies using a measurement e_2 and so on at each stage t we generate a current hypothesis sigma_t about the state rho using the outcomes of the previous measurements we show that ... | [['suppose', 'we', 'have', 'many', 'copies', 'of', 'an', 'unknown', 'nqubit', 'state', 'rho', 'we', 'measure', 'some', 'copies', 'of', 'rho', 'using', 'a', 'known', 'twooutcome', 'measurement', 'e_1', 'then', 'other', 'copies', 'using', 'a', 'measurement', 'e_2', 'and', 'so', 'on', 'at', 'each', 'stage', 't', 'we', 'ge... | [-0.09887040944609214, 0.1312379119980982, -0.09520788245884303, 0.027130577533777494, 0.00044442904514393637, -0.16638663828295344, 0.06734923926636666, 0.3710928185554665, -0.24921623784411212, -0.29099402868831975, 0.10000516307038543, -0.2980080465786159, -0.08697606879494353, 0.1926632576796692, -0.083480630280627... |
1,802.09026 | Building Instance Classification Using Street View Images | Land-use classification based on spaceborne or aerial remote sensing images
has been extensively studied over the past decades. Such classification is
usually a patch-wise or pixel-wise labeling over the whole image. But for many
applications, such as urban population density mapping or urban utility
planning, a clas... | cs.CV eess.IV | landuse classification based on spaceborne or aerial remote sensing images has been extensively studied over the past decades such classification is usually a patchwise or pixelwise labeling over the whole image but for many applications such as urban population density mapping or urban utility planning a classificatio... | [['landuse', 'classification', 'based', 'on', 'spaceborne', 'or', 'aerial', 'remote', 'sensing', 'images', 'has', 'been', 'extensively', 'studied', 'over', 'the', 'past', 'decades', 'such', 'classification', 'is', 'usually', 'a', 'patchwise', 'or', 'pixelwise', 'labeling', 'over', 'the', 'whole', 'image', 'but', 'for',... | [-0.016201928579322795, -0.02273166462335676, -0.06295747983398194, 0.09308458205084613, -0.09229585253930789, -0.13563135036197987, 0.020360968399472767, 0.4588376501812897, -0.2578793897174616, -0.356493191484565, 0.15588240214484803, -0.2713038408063709, -0.21566735949872576, 0.24164723371715344, -0.1891315586636142... |
1,802.09027 | Holographic fermionic spectrum with Weyl correction | We study the ferminoic spectrum with Weyl correction, which exhibits the
non-Fermi liquid behavior. Also, we find that both the height of the peak of
the fermionic spectrum and the dispersion relation exhibit a nonlinearity with
the variety of the Weyl coupling parameter $\gamma$, which mean that such
nonlinearity ma... | hep-th | we study the ferminoic spectrum with weyl correction which exhibits the nonfermi liquid behavior also we find that both the height of the peak of the fermionic spectrum and the dispersion relation exhibit a nonlinearity with the variety of the weyl coupling parameter gamma which mean that such nonlinearity maybe ascrib... | [['we', 'study', 'the', 'ferminoic', 'spectrum', 'with', 'weyl', 'correction', 'which', 'exhibits', 'the', 'nonfermi', 'liquid', 'behavior', 'also', 'we', 'find', 'that', 'both', 'the', 'height', 'of', 'the', 'peak', 'of', 'the', 'fermionic', 'spectrum', 'and', 'the', 'dispersion', 'relation', 'exhibit', 'a', 'nonlinea... | [-0.1664227472041689, 0.17306385128038182, -0.12317476406516063, 0.019189576496414486, -0.05020196038697447, -0.18888546787645846, 0.004854752725389387, 0.3022186550533488, -0.25949016066179387, -0.27003280334174634, 0.028426022130242062, -0.32196279176998704, -0.15273597494787758, 0.18068455197804031, 0.03781571432149... |
1,802.09028 | Field-effect-driven half-metallic multilayer graphene | Rhombohedral stacked multilayer graphene displays the occurrence of a
magnetic surface state at low temperatures. Recent angular resolved
photoemission experiments demonstrate the robustness of the magnetic state in
long sequences of ABC graphene. Here, by using first-principles calculations,
we show that field-effec... | cond-mat.mtrl-sci cond-mat.mes-hall | rhombohedral stacked multilayer graphene displays the occurrence of a magnetic surface state at low temperatures recent angular resolved photoemission experiments demonstrate the robustness of the magnetic state in long sequences of abc graphene here by using firstprinciples calculations we show that fieldeffect doping... | [['rhombohedral', 'stacked', 'multilayer', 'graphene', 'displays', 'the', 'occurrence', 'of', 'a', 'magnetic', 'surface', 'state', 'at', 'low', 'temperatures', 'recent', 'angular', 'resolved', 'photoemission', 'experiments', 'demonstrate', 'the', 'robustness', 'of', 'the', 'magnetic', 'state', 'in', 'long', 'sequences'... | [-0.19791553776231732, 0.1917948346345289, -0.007396165051008805, -0.060846881907534706, -0.007356301341943517, -0.1603524399976624, 0.10150360825960295, 0.43560530042441764, -0.26807659403994416, -0.30952000892767223, -0.046699875751325844, -0.30184911003354753, -0.15015179866067327, 0.1981177312180188, 0.020225936533... |
1,802.09029 | On tetraquarks with hidden charm and strangeness as phi-psi(2S)
hadrocharmonium | In the hadrocharmonium picture a $\bar cc$ state and a light hadron form a
bound state. The effective interaction is described in terms of the
chromoelectric polarizability of the $\bar cc$ state and energy-momentum-tensor
densities of the light hadron. This picture is justified in the heavy quark
limit, and may succ... | hep-ph | in the hadrocharmonium picture a bar cc state and a light hadron form a bound state the effective interaction is described in terms of the chromoelectric polarizability of the bar cc state and energymomentumtensor densities of the light hadron this picture is justified in the heavy quark limit and may successfully acco... | [['in', 'the', 'hadrocharmonium', 'picture', 'a', 'bar', 'cc', 'state', 'and', 'a', 'light', 'hadron', 'form', 'a', 'bound', 'state', 'the', 'effective', 'interaction', 'is', 'described', 'in', 'terms', 'of', 'the', 'chromoelectric', 'polarizability', 'of', 'the', 'bar', 'cc', 'state', 'and', 'energymomentumtensor', 'd... | [-0.09495492207970323, 0.19517214767803243, -0.1470199530854779, 0.15139316362631375, -0.05237466356099457, -0.12792356926316428, 0.07377420010250378, 0.3078285154102549, -0.1855859309829519, -0.2674532519879693, -0.012925523769315647, -0.2763231566996645, -0.07302100611008745, 0.10549219391087733, 0.02275289586971456,... |
1,802.0903 | Cakewalk Sampling | We study the task of finding good local optima in combinatorial optimization
problems. Although combinatorial optimization is NP-hard in general, locally
optimal solutions are frequently used in practice. Local search methods however
typically converge to a limited set of optima that depend on their
initialization. S... | stat.ML cs.AI cs.LG | we study the task of finding good local optima in combinatorial optimization problems although combinatorial optimization is nphard in general locally optimal solutions are frequently used in practice local search methods however typically converge to a limited set of optima that depend on their initialization sampling... | [['we', 'study', 'the', 'task', 'of', 'finding', 'good', 'local', 'optima', 'in', 'combinatorial', 'optimization', 'problems', 'although', 'combinatorial', 'optimization', 'is', 'nphard', 'in', 'general', 'locally', 'optimal', 'solutions', 'are', 'frequently', 'used', 'in', 'practice', 'local', 'search', 'methods', 'ho... | [-0.04704084209643486, -0.017287114527709667, -0.14591498663876115, 0.12290859516516964, -0.11553983047786283, -0.1788577173734311, 0.08541370112798177, 0.46625266318186753, -0.28834254627070594, -0.3267033598490809, 0.12221829535768981, -0.1924908634638641, -0.2161143927221618, 0.20495908569669488, -0.1495098357562777... |
1,802.09031 | Functional Gradient Boosting based on Residual Network Perception | Residual Networks (ResNets) have become state-of-the-art models in deep
learning and several theoretical studies have been devoted to understanding why
ResNet works so well. One attractive viewpoint on ResNet is that it is
optimizing the risk in a functional space by combining an ensemble of effective
features. In th... | stat.ML cs.LG | residual networks resnets have become stateoftheart models in deep learning and several theoretical studies have been devoted to understanding why resnet works so well one attractive viewpoint on resnet is that it is optimizing the risk in a functional space by combining an ensemble of effective features in this paper ... | [['residual', 'networks', 'resnets', 'have', 'become', 'stateoftheart', 'models', 'in', 'deep', 'learning', 'and', 'several', 'theoretical', 'studies', 'have', 'been', 'devoted', 'to', 'understanding', 'why', 'resnet', 'works', 'so', 'well', 'one', 'attractive', 'viewpoint', 'on', 'resnet', 'is', 'that', 'it', 'is', 'o... | [-0.023429901204232512, -0.015315322679816746, -0.12905252740300935, 0.09651424315003357, -0.09930027674498229, -0.18304342785207875, 0.022035166837178686, 0.4299974428939408, -0.27566069610545346, -0.31579773410520484, 0.07775305182319776, -0.2556273982860148, -0.25324286682418834, 0.2283832190566343, -0.1509827968022... |
1,802.09032 | A note on Engel elements in the first Grigorchuk group | Let $\Gamma$ be the first Grigorchuk group. According to a result of
Bartholdi, the only left Engel elements of $\Gamma$ are the involutions. This
implies that the set of left Engel elements of $\Gamma$ is not a subgroup. Of
particular interest is to wonder whether this happens also for the sets of
bounded left Engel... | math.GR | let gamma be the first grigorchuk group according to a result of bartholdi the only left engel elements of gamma are the involutions this implies that the set of left engel elements of gamma is not a subgroup of particular interest is to wonder whether this happens also for the sets of bounded left engel elements right... | [['let', 'gamma', 'be', 'the', 'first', 'grigorchuk', 'group', 'according', 'to', 'a', 'result', 'of', 'bartholdi', 'the', 'only', 'left', 'engel', 'elements', 'of', 'gamma', 'are', 'the', 'involutions', 'this', 'implies', 'that', 'the', 'set', 'of', 'left', 'engel', 'elements', 'of', 'gamma', 'is', 'not', 'a', 'subgro... | [-0.15243791612773772, 0.16292068697284998, -0.045665927163166246, 0.009882169586844833, -0.11294634372177648, -0.1250511419436917, 0.0585253911161023, 0.38370562608285647, -0.3840292257642964, -0.1820422490979204, 0.0788927728100112, -0.31600715467570034, -0.07346445301593077, 0.1851073641730359, -0.15026001222204508,... |
1,802.09033 | Discovery of Intrinsic Ferromagnetic Ferroelectricity in Transition
Metal Halides Monolayer | The realization of multiferroics in nanostructures, combined with a large
electric dipole and ferromagnetic ordering, could lead to new applications,
such as high-density multi-state data storage. Although multiferroics have been
broadly studied for decades, ferromagnetic ferroelectricity is rarely explored,
especial... | cond-mat.mtrl-sci | the realization of multiferroics in nanostructures combined with a large electric dipole and ferromagnetic ordering could lead to new applications such as highdensity multistate data storage although multiferroics have been broadly studied for decades ferromagnetic ferroelectricity is rarely explored especially in twod... | [['the', 'realization', 'of', 'multiferroics', 'in', 'nanostructures', 'combined', 'with', 'a', 'large', 'electric', 'dipole', 'and', 'ferromagnetic', 'ordering', 'could', 'lead', 'to', 'new', 'applications', 'such', 'as', 'highdensity', 'multistate', 'data', 'storage', 'although', 'multiferroics', 'have', 'been', 'bro... | [-0.1924007514251199, 0.17514780071068192, 0.03675786174160775, -0.011741128136628191, -0.09667268551947264, -0.16211187334078617, 0.06457491176726338, 0.4585225881641581, -0.2591833572590003, -0.25019543173376224, 0.033022199952838956, -0.26655650473995146, -0.2091469473994072, 0.20955469539171478, 0.03082508077831381... |
1,802.09034 | Resonant and off-resonant microwave signal manipulation in coupled
superconducting resonators | We present an experimental demonstration as well as a theoretical model of an
integrated circuit designed for the manipulation of a microwave field down to
the single-photon level. The device is made of a superconducting resonator
coupled to a transmission line via a second frequency-tunable resonator. The
tunable re... | cond-mat.mes-hall cond-mat.supr-con quant-ph | we present an experimental demonstration as well as a theoretical model of an integrated circuit designed for the manipulation of a microwave field down to the singlephoton level the device is made of a superconducting resonator coupled to a transmission line via a second frequencytunable resonator the tunable resonato... | [['we', 'present', 'an', 'experimental', 'demonstration', 'as', 'well', 'as', 'a', 'theoretical', 'model', 'of', 'an', 'integrated', 'circuit', 'designed', 'for', 'the', 'manipulation', 'of', 'a', 'microwave', 'field', 'down', 'to', 'the', 'singlephoton', 'level', 'the', 'device', 'is', 'made', 'of', 'a', 'superconduct... | [-0.20451866762422716, 0.11251349026350373, -0.03336442543798133, -0.06147924437579261, -0.032579764441605534, -0.19928985740064292, 0.041901697410850335, 0.3965508220717311, -0.23346020182014893, -0.3091241311133895, 0.050695498758812886, -0.2739414596646432, -0.12302007623917319, 0.29078741381345746, 0.02052626555202... |
1,802.09035 | Retrodirective Large Antenna Energy Beamforming in Backscatter
Multi-User Networks | In this letter, we study a new technique for energy beamforming (EB) in
multi-user networks, which combines large antenna retrodirectivity at the
transmitter side with signal backscattering at the energy receivers. The
proposed technique has low complexity and achieves EB without any active
operation at the receivers... | cs.IT math.IT | in this letter we study a new technique for energy beamforming eb in multiuser networks which combines large antenna retrodirectivity at the transmitter side with signal backscattering at the energy receivers the proposed technique has low complexity and achieves eb without any active operation at the receivers or comp... | [['in', 'this', 'letter', 'we', 'study', 'a', 'new', 'technique', 'for', 'energy', 'beamforming', 'eb', 'in', 'multiuser', 'networks', 'which', 'combines', 'large', 'antenna', 'retrodirectivity', 'at', 'the', 'transmitter', 'side', 'with', 'signal', 'backscattering', 'at', 'the', 'energy', 'receivers', 'the', 'proposed... | [-0.2005587580477756, 0.05779953364785133, -0.05922112509273411, 0.04502356528916679, -0.05495239513026278, -0.23643407877534628, 0.08505396402618859, 0.39420489811997733, -0.261338175284896, -0.3014391316414884, 0.07470406610466372, -0.2659123357741183, -0.13063212865806614, 0.1573562917242015, -0.06978747001692151, 0... |
1,802.09036 | Towards Automatic SAR-Optical Stereogrammetry over Urban Areas using
Very High Resolution Imagery | In this paper we discuss the potential and challenges regarding SAR-optical
stereogrammetry for urban areas, using very-high-resolution (VHR) remote
sensing imagery. Since we do this mainly from a geometrical point of view, we
first analyze the height reconstruction accuracy to be expected for different
stereogrammet... | eess.IV | in this paper we discuss the potential and challenges regarding saroptical stereogrammetry for urban areas using veryhighresolution vhr remote sensing imagery since we do this mainly from a geometrical point of view we first analyze the height reconstruction accuracy to be expected for different stereogrammetric config... | [['in', 'this', 'paper', 'we', 'discuss', 'the', 'potential', 'and', 'challenges', 'regarding', 'saroptical', 'stereogrammetry', 'for', 'urban', 'areas', 'using', 'veryhighresolution', 'vhr', 'remote', 'sensing', 'imagery', 'since', 'we', 'do', 'this', 'mainly', 'from', 'a', 'geometrical', 'point', 'of', 'view', 'we', ... | [-0.06308820698220241, 0.009048150216425284, -0.0680594389161396, 0.04244897618413875, -0.05836609487339635, -0.13888472891994752, 0.04090823579035179, 0.44697488025378657, -0.25320944035261433, -0.33973540295161964, 0.16578453467124799, -0.26456979107495177, -0.18651135053026818, 0.19909326966958094, -0.16165229947278... |
1,802.09037 | Reflection Positivity---A Representation Theoretic Perspective | Refection Positivity is a central theme at the crossroads of Lie group
representations, euclidean and abstract harmonic analysis, constructive quantum
field theory, and stochastic processes. This book provides the first
presentation of the representation theoretic aspects of Refection Positivity
and discusses its con... | math.RT math-ph math.MP math.OA | refection positivity is a central theme at the crossroads of lie group representations euclidean and abstract harmonic analysis constructive quantum field theory and stochastic processes this book provides the first presentation of the representation theoretic aspects of refection positivity and discusses its connectio... | [['refection', 'positivity', 'is', 'a', 'central', 'theme', 'at', 'the', 'crossroads', 'of', 'lie', 'group', 'representations', 'euclidean', 'and', 'abstract', 'harmonic', 'analysis', 'constructive', 'quantum', 'field', 'theory', 'and', 'stochastic', 'processes', 'this', 'book', 'provides', 'the', 'first', 'presentatio... | [-0.12297174532629424, 0.08913508748982922, -0.13954466107790753, 0.11384488760604192, -0.1463957282130496, -0.10371972507623545, 0.03337234220175483, 0.308313826209534, -0.2710295501086166, -0.2568692310508025, 0.09228880601437857, -0.26033939193871064, -0.19103218678195596, 0.16578016509065183, -0.1205072481564041, -... |
1,802.09038 | Random walks in doubly random scenery | We provide a random walk in random scenery representation of a new class of
stable self-similar processes with stationary increments introduced recently by
Jung, Owada and Samorodnitsky. In the functional limit theorem they provided,
only a single instance of this class arose as a limit. We construct a model in
which... | math.PR | we provide a random walk in random scenery representation of a new class of stable selfsimilar processes with stationary increments introduced recently by jung owada and samorodnitsky in the functional limit theorem they provided only a single instance of this class arose as a limit we construct a model in which a sign... | [['we', 'provide', 'a', 'random', 'walk', 'in', 'random', 'scenery', 'representation', 'of', 'a', 'new', 'class', 'of', 'stable', 'selfsimilar', 'processes', 'with', 'stationary', 'increments', 'introduced', 'recently', 'by', 'jung', 'owada', 'and', 'samorodnitsky', 'in', 'the', 'functional', 'limit', 'theorem', 'they'... | [-0.08947492381776101, 0.13127584194444353, -0.13015973940491676, 0.060612411025431356, -0.03193812566314591, -0.10360904483968625, 0.12212004662433174, 0.3188591764192097, -0.26183820638107136, -0.22334523934841854, 0.10443905767533579, -0.2224693925018073, -0.17340077624976402, 0.19540761303142062, -0.104382159006490... |
1,802.09039 | Flag bundles, Segre polynomials and push-forwards | In this note, we give Gysin formulas for partial flag bundles for the
classical groups. We then give Gysin formulas for Schubert varieties in
Grassmann bundles, including isotropic ones. All these formulas are proved in a
rather uniform way by using the step-by-step construction of flag bundles and
the Gysin formula ... | math.AG | in this note we give gysin formulas for partial flag bundles for the classical groups we then give gysin formulas for schubert varieties in grassmann bundles including isotropic ones all these formulas are proved in a rather uniform way by using the stepbystep construction of flag bundles and the gysin formula for a pr... | [['in', 'this', 'note', 'we', 'give', 'gysin', 'formulas', 'for', 'partial', 'flag', 'bundles', 'for', 'the', 'classical', 'groups', 'we', 'then', 'give', 'gysin', 'formulas', 'for', 'schubert', 'varieties', 'in', 'grassmann', 'bundles', 'including', 'isotropic', 'ones', 'all', 'these', 'formulas', 'are', 'proved', 'in... | [-0.17677610592722004, 0.004743963689369552, -0.08884750092541104, 0.10623655081448603, -0.14766113676214174, -0.1481903707122069, 0.043768397323898416, 0.39014177224529323, -0.2724449409922557, -0.20128540321142038, 0.07518654893267093, -0.16034491461659992, -0.19909452117367912, 0.26851488199474205, -0.16438238067924... |
1,802.0904 | Quantum teleportation with infinite reference frame uncertainty and
without prior alignment | We present two new schemes for quantum teleportation between parties whose
local reference frames are misaligned by the action of a compact Lie group G.
These schemes require no prior alignment of reference frames and are unaffected
by arbitrary changes in reference frame alignment during execution, suiting
them to s... | quant-ph | we present two new schemes for quantum teleportation between parties whose local reference frames are misaligned by the action of a compact lie group g these schemes require no prior alignment of reference frames and are unaffected by arbitrary changes in reference frame alignment during execution suiting them to situa... | [['we', 'present', 'two', 'new', 'schemes', 'for', 'quantum', 'teleportation', 'between', 'parties', 'whose', 'local', 'reference', 'frames', 'are', 'misaligned', 'by', 'the', 'action', 'of', 'a', 'compact', 'lie', 'group', 'g', 'these', 'schemes', 'require', 'no', 'prior', 'alignment', 'of', 'reference', 'frames', 'an... | [-0.18970575644252405, 0.09459078948903106, -0.08478017437311737, 0.026425953502697285, -0.057194146709933655, -0.22339112841204475, 0.09697743453026346, 0.4777745590406234, -0.23752612876705825, -0.29340342881241394, 0.03450628466132695, -0.19656134701556346, -0.028105826572334364, 0.1656404032768098, -0.1570255413317... |
1,802.09041 | On well-posedness and uniqueness for general hierarchy equations of
Gross-Pitaevskii and Hartree type | Gross-Pitaevskii and Hartree hierarchies are infinite systems of coupled PDEs
emerging naturally from the mean field theory of Bose gases. Their solutions
are known to be related to an initial value problem, respectively the
Gross-Pitaevskii and Hartree equations. Due to their physical and mathematical
relevance, the... | math.AP | grosspitaevskii and hartree hierarchies are infinite systems of coupled pdes emerging naturally from the mean field theory of bose gases their solutions are known to be related to an initial value problem respectively the grosspitaevskii and hartree equations due to their physical and mathematical relevance the issues ... | [['grosspitaevskii', 'and', 'hartree', 'hierarchies', 'are', 'infinite', 'systems', 'of', 'coupled', 'pdes', 'emerging', 'naturally', 'from', 'the', 'mean', 'field', 'theory', 'of', 'bose', 'gases', 'their', 'solutions', 'are', 'known', 'to', 'be', 'related', 'to', 'an', 'initial', 'value', 'problem', 'respectively', '... | [-0.10290427345046124, 0.04413107822853585, -0.07807077503936409, 0.13763481953267961, -0.08208894541183877, -0.1419386858098902, -0.007289518513933344, 0.25011712959101207, -0.3301447918660246, -0.283930824172878, 0.16244124531486007, -0.2550674232784225, -0.15647738364113625, 0.1679187152166526, -0.03242553586660083,... |
1,802.09042 | Theoretical investigations of quantum correlations in NMR multiple-pulse
spin-locking experiments | Quantum correlations are investigated theoretically in a two-spin system with
the dipole-dipole interactions in the NMR multiple-pulse spin-locking
experiments. We consider two schemes of the multiple-pulse spin-locking. The
first scheme consists of $\pi/2$-pulses only and the delays between the pulses
can differ. Th... | quant-ph | quantum correlations are investigated theoretically in a twospin system with the dipoledipole interactions in the nmr multiplepulse spinlocking experiments we consider two schemes of the multiplepulse spinlocking the first scheme consists of pi2pulses only and the delays between the pulses can differ the second scheme ... | [['quantum', 'correlations', 'are', 'investigated', 'theoretically', 'in', 'a', 'twospin', 'system', 'with', 'the', 'dipoledipole', 'interactions', 'in', 'the', 'nmr', 'multiplepulse', 'spinlocking', 'experiments', 'we', 'consider', 'two', 'schemes', 'of', 'the', 'multiplepulse', 'spinlocking', 'the', 'first', 'scheme'... | [-0.1981719516816416, 0.21460057100432875, -0.07534589826204215, 0.03224558852380142, 0.09313596838286944, -0.16638021382303642, 0.03523696393572858, 0.40897322865203023, -0.2325609522738627, -0.26566202801519206, 0.019819739282164458, -0.27675504522610156, -0.0620190732613472, 0.2505655603317012, 0.01123395712846624, ... |
1,802.09043 | Free LSD: Prior-Free Visual Landing Site Detection for Autonomous Planes | Full autonomy for fixed-wing unmanned aerial vehicles (UAVs) requires the
capability to autonomously detect potential landing sites in unknown and
unstructured terrain, allowing for self-governed mission completion or handling
of emergency situations. In this work, we propose a perception system
addressing this chall... | cs.RO | full autonomy for fixedwing unmanned aerial vehicles uavs requires the capability to autonomously detect potential landing sites in unknown and unstructured terrain allowing for selfgoverned mission completion or handling of emergency situations in this work we propose a perception system addressing this challenge by d... | [['full', 'autonomy', 'for', 'fixedwing', 'unmanned', 'aerial', 'vehicles', 'uavs', 'requires', 'the', 'capability', 'to', 'autonomously', 'detect', 'potential', 'landing', 'sites', 'in', 'unknown', 'and', 'unstructured', 'terrain', 'allowing', 'for', 'selfgoverned', 'mission', 'completion', 'or', 'handling', 'of', 'em... | [-0.13404458070914754, 0.04340687598755571, -0.04917188979290574, 0.027299091600757462, -0.08610428804655047, -0.14566878458201293, 0.04988477564422993, 0.43359585321008765, -0.20657810266283866, -0.411482471602642, 0.12054534328389074, -0.21717030834406614, -0.18764543187471464, 0.21296012143000023, -0.180512159489386... |
1,802.09044 | The solution space to the Einstein's vacuum field equations for the case
of five-dimensional Bianchi Type I (Type 4A1) | We consider the 4+1 Einstein's field equations (EFE's) in vacuum, simplified
by the assumption that there is a four-dimensional sub-manifold on which an
isometry group of dimension four acts simply transitive. In particular we
consider the Abelian group Type 4A1; and thus the emerging homogeneous
sub-space is flat. T... | gr-qc | we consider the 41 einsteins field equations efes in vacuum simplified by the assumption that there is a fourdimensional submanifold on which an isometry group of dimension four acts simply transitive in particular we consider the abelian group type 4a1 and thus the emerging homogeneous subspace is flat through the use... | [['we', 'consider', 'the', '41', 'einsteins', 'field', 'equations', 'efes', 'in', 'vacuum', 'simplified', 'by', 'the', 'assumption', 'that', 'there', 'is', 'a', 'fourdimensional', 'submanifold', 'on', 'which', 'an', 'isometry', 'group', 'of', 'dimension', 'four', 'acts', 'simply', 'transitive', 'in', 'particular', 'we'... | [-0.18435130901888114, 0.08624128732748321, -0.06325007914913958, 0.03341865124811298, -0.13661580439656973, -0.1318078134018852, -0.02623767510601351, 0.3345975717846431, -0.2541452383204382, -0.23602606703568452, 0.13438885388135605, -0.2743669241273991, -0.13635189238489054, 0.14905709041944598, -0.0714734558120598,... |
1,802.09045 | Exact spectral asymptotics of fractional processes | Eigenproblems frequently arise in theory and applications of stochastic
processes, but only a few have explicit solutions. Those which do, are usually
solved by reduction to the generalized Sturm--Liouville theory for differential
operators. This includes the Brownian motion and a whole class of processes,
which deri... | math.PR math.FA | eigenproblems frequently arise in theory and applications of stochastic processes but only a few have explicit solutions those which do are usually solved by reduction to the generalized sturmliouville theory for differential operators this includes the brownian motion and a whole class of processes which derive from i... | [['eigenproblems', 'frequently', 'arise', 'in', 'theory', 'and', 'applications', 'of', 'stochastic', 'processes', 'but', 'only', 'a', 'few', 'have', 'explicit', 'solutions', 'those', 'which', 'do', 'are', 'usually', 'solved', 'by', 'reduction', 'to', 'the', 'generalized', 'sturmliouville', 'theory', 'for', 'differentia... | [-0.05472958619271005, 0.08242906227586529, -0.10081851200606841, 0.09454011114141882, -0.12331772583018674, -0.118187615228161, -0.0016740644030915704, 0.3495506915381887, -0.3293847358346143, -0.25229283906257066, 0.15001233431599167, -0.26486838731462214, -0.20434087245646393, 0.21572952836663398, -0.066565276674506... |
1,802.09046 | Multiclass Common Spatial Pattern for EEG based Brain Computer Interface
with Adaptive Learning Classifier | In Brain Computer Interface (BCI), data generated from Electroencephalogram
(EEG) is non-stationary with low signal to noise ratio and contaminated with
artifacts. Common Spatial Pattern (CSP) algorithm has been proved to be
effective in BCI for extracting features in motor imagery tasks, but it is
prone to overfitti... | cs.NE q-bio.NC | in brain computer interface bci data generated from electroencephalogram eeg is nonstationary with low signal to noise ratio and contaminated with artifacts common spatial pattern csp algorithm has been proved to be effective in bci for extracting features in motor imagery tasks but it is prone to overfitting many algo... | [['in', 'brain', 'computer', 'interface', 'bci', 'data', 'generated', 'from', 'electroencephalogram', 'eeg', 'is', 'nonstationary', 'with', 'low', 'signal', 'to', 'noise', 'ratio', 'and', 'contaminated', 'with', 'artifacts', 'common', 'spatial', 'pattern', 'csp', 'algorithm', 'has', 'been', 'proved', 'to', 'be', 'effec... | [-0.023222232726525772, -0.049067984751509454, -0.08084374972959123, 0.08261280429177478, -0.1097418114397596, -0.18967822073372426, 0.029112698987653608, 0.40437471736518166, -0.29107266818247146, -0.34635869082477355, 0.10740026833351564, -0.27450508062195567, -0.15835305471613845, 0.20251678790966118, -0.15377079694... |
1,802.09047 | Power efficient Spiking Neural Network Classifier based on memristive
crossbar network for spike sorting application | In this paper authors have presented a power efficient scheme for
implementing a spike sorting module. Spike sorting is an important application
in the field of neural signal acquisition for implantable biomedical systems
whose function is to map the Neural-spikes (N-spikes) correctly to the neurons
from which it ori... | cs.NE cs.LG | in this paper authors have presented a power efficient scheme for implementing a spike sorting module spike sorting is an important application in the field of neural signal acquisition for implantable biomedical systems whose function is to map the neuralspikes nspikes correctly to the neurons from which it originates... | [['in', 'this', 'paper', 'authors', 'have', 'presented', 'a', 'power', 'efficient', 'scheme', 'for', 'implementing', 'a', 'spike', 'sorting', 'module', 'spike', 'sorting', 'is', 'an', 'important', 'application', 'in', 'the', 'field', 'of', 'neural', 'signal', 'acquisition', 'for', 'implantable', 'biomedical', 'systems'... | [-0.12121111217063961, 0.002900225557725109, -0.045278249409150435, 0.03342323227017816, -0.07981899909901659, -0.20450678131719296, 0.04659146909090178, 0.41324313941436847, -0.2591293793998088, -0.32035644255947693, 0.09954981330644784, -0.23527887297022315, -0.1703120150292913, 0.23566131459626155, -0.12563728668668... |
1,802.09048 | The role of spin in the calculation of Hubbard $U$ and Hund's $J$
parameters from first principles | The density functional theory (DFT)+$U$ method is a pragmatic and effective
approach for calculating the ground-state properties of strongly-correlated
systems, and linear response calculations are widely used to determine the
requisite Hubbard parameters from first principles. We provide a detailed
treatment of spin... | cond-mat.str-el physics.chem-ph physics.comp-ph quant-ph | the density functional theory dftu method is a pragmatic and effective approach for calculating the groundstate properties of stronglycorrelated systems and linear response calculations are widely used to determine the requisite hubbard parameters from first principles we provide a detailed treatment of spin within thi... | [['the', 'density', 'functional', 'theory', 'dftu', 'method', 'is', 'a', 'pragmatic', 'and', 'effective', 'approach', 'for', 'calculating', 'the', 'groundstate', 'properties', 'of', 'stronglycorrelated', 'systems', 'and', 'linear', 'response', 'calculations', 'are', 'widely', 'used', 'to', 'determine', 'the', 'requisit... | [-0.06448882494402355, 0.08955845537071339, -0.04169415608345566, 0.0864779055474139, -0.04163200146553719, -0.1419851483044577, 0.09025924661923512, 0.409580508414578, -0.2534381049689077, -0.2658253089470251, -0.004317700915003515, -0.3162820520918552, -0.14943456849869108, 0.18721848926346196, 0.03651712586833733, 0... |
1,802.09049 | On 1-factors with prescribed lengths in tournaments | K\"uhn, Osthus, and Townsend asked whether there exists a constant $C$ such
that every strongly $Ct$-connected tournament contains all possible $1$-factors
with at most $t$ components. We answer this question in the affirmative. This
is best possible up to constant. In addition, we can ensure that each cycle in
the $... | math.CO | kuhn osthus and townsend asked whether there exists a constant c such that every strongly ctconnected tournament contains all possible 1factors with at most t components we answer this question in the affirmative this is best possible up to constant in addition we can ensure that each cycle in the 1factor contains a pr... | [['kuhn', 'osthus', 'and', 'townsend', 'asked', 'whether', 'there', 'exists', 'a', 'constant', 'c', 'such', 'that', 'every', 'strongly', 'ctconnected', 'tournament', 'contains', 'all', 'possible', '1factors', 'with', 'at', 'most', 't', 'components', 'we', 'answer', 'this', 'question', 'in', 'the', 'affirmative', 'this'... | [-0.17317203017362198, 0.1631436035516488, -0.027362424310443823, 0.029026005986930902, -0.09886248839872055, -0.21639107017912657, 0.06074915021829503, 0.3738204302805427, -0.24607478336685362, -0.29147982942308054, 0.06584037916151206, -0.291045079320228, -0.15973474621770087, 0.12884699238164007, -0.0991038956624259... |
1,802.0905 | Global phase diagram of Coulomb-interacting anisotropic Weyl semimetals
with disorder | Taking into account the interplay between the disorder and Coulomb
interaction, the phase diagram of three-dimensional anisotropic Weyl semimetal
is studied by renormalization group theory. Weak disorder is irrelevant in
anisotropic Weyl semimetal, while the disorder becomes relevant and drives a
quantum phase transi... | cond-mat.dis-nn cond-mat.str-el | taking into account the interplay between the disorder and coulomb interaction the phase diagram of threedimensional anisotropic weyl semimetal is studied by renormalization group theory weak disorder is irrelevant in anisotropic weyl semimetal while the disorder becomes relevant and drives a quantum phase transition f... | [['taking', 'into', 'account', 'the', 'interplay', 'between', 'the', 'disorder', 'and', 'coulomb', 'interaction', 'the', 'phase', 'diagram', 'of', 'threedimensional', 'anisotropic', 'weyl', 'semimetal', 'is', 'studied', 'by', 'renormalization', 'group', 'theory', 'weak', 'disorder', 'is', 'irrelevant', 'in', 'anisotrop... | [-0.22107584607130026, 0.27081548750532364, -0.04512950973371249, 0.07596040765330304, -0.09562789585770053, -0.23879832938751755, 0.047828547024469384, 0.3351864939117256, -0.2546692158479024, -0.2343732662498951, -0.05097444115466822, -0.3671003941747853, -0.20683912350522243, 0.11315006581956849, 0.0857897887359072,... |
1,802.09051 | Graphs with equal domination and covering numbers | A dominating set of a graph $G$ is a set $D\subseteq V_G$ such that every
vertex in $V_G-D$ is adjacent to at least one vertex in $D$, and the domination
number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of
$G$. A set $C\subseteq V_G$ is a covering set of $G$ if every edge of $G$ has
at least o... | math.CO | a dominating set of a graph g is a set dsubseteq v_g such that every vertex in v_gd is adjacent to at least one vertex in d and the domination number gammag of g is the minimum cardinality of a dominating set of g a set csubseteq v_g is a covering set of g if every edge of g has at least one vertex in c the covering nu... | [['a', 'dominating', 'set', 'of', 'a', 'graph', 'g', 'is', 'a', 'set', 'dsubseteq', 'v_g', 'such', 'that', 'every', 'vertex', 'in', 'v_gd', 'is', 'adjacent', 'to', 'at', 'least', 'one', 'vertex', 'in', 'd', 'and', 'the', 'domination', 'number', 'gammag', 'of', 'g', 'is', 'the', 'minimum', 'cardinality', 'of', 'a', 'dom... | [-0.21194380730512025, 0.1232982473731365, 0.004837725874360489, -0.03833940536968167, -0.08471992359415668, -0.13523389714486572, 0.06767935285941981, 0.33245216167491415, -0.25953914309325427, -0.34168635022057137, 0.06969532373654859, -0.33863340264860714, -0.09141203312041318, 0.11959445527273878, -0.08359572478448... |
1,802.09052 | Wide Compression: Tensor Ring Nets | Deep neural networks have demonstrated state-of-the-art performance in a
variety of real-world applications. In order to obtain performance gains, these
networks have grown larger and deeper, containing millions or even billions of
parameters and over a thousand layers. The trade-off is that these large
architectures... | cs.LG cs.CV stat.ML | deep neural networks have demonstrated stateoftheart performance in a variety of realworld applications in order to obtain performance gains these networks have grown larger and deeper containing millions or even billions of parameters and over a thousand layers the tradeoff is that these large architectures require an... | [['deep', 'neural', 'networks', 'have', 'demonstrated', 'stateoftheart', 'performance', 'in', 'a', 'variety', 'of', 'realworld', 'applications', 'in', 'order', 'to', 'obtain', 'performance', 'gains', 'these', 'networks', 'have', 'grown', 'larger', 'and', 'deeper', 'containing', 'millions', 'or', 'even', 'billions', 'of... | [-0.10452099032439552, 0.0055977594819924485, 0.016644686050192044, -0.005923816370061384, -0.06381179214214215, -0.17152524712475967, 0.007520642714457704, 0.4577167509579575, -0.29136892890238525, -0.3720332362096418, 0.08456825511204405, -0.2724130444580337, -0.20187636766537137, 0.23333741900172422, -0.100488944649... |
1,802.09053 | Estimation of the Evolutionary Spectra with Application to Stationarity
Test | In this work, we propose a new inference procedure for understanding
non-stationary processes, under the framework of evolutionary spectra developed
by Priestley. Among various frameworks of modeling non-stationary processes,
the distinguishing feature of the evolutionary spectra is its focus on the
physical meaning ... | stat.ME | in this work we propose a new inference procedure for understanding nonstationary processes under the framework of evolutionary spectra developed by priestley among various frameworks of modeling nonstationary processes the distinguishing feature of the evolutionary spectra is its focus on the physical meaning of frequ... | [['in', 'this', 'work', 'we', 'propose', 'a', 'new', 'inference', 'procedure', 'for', 'understanding', 'nonstationary', 'processes', 'under', 'the', 'framework', 'of', 'evolutionary', 'spectra', 'developed', 'by', 'priestley', 'among', 'various', 'frameworks', 'of', 'modeling', 'nonstationary', 'processes', 'the', 'dis... | [-0.047082120394334195, 0.02903042888478376, -0.17126303017139435, 0.1144191602114588, -0.07365837980806828, -0.11391174765303731, 0.05043915816769004, 0.37380839347839356, -0.25759515188261867, -0.3077719816192985, 0.12204948287829756, -0.17871571071713696, -0.1760404254789464, 0.18933823189139365, -0.0827322602346539... |
1,802.09054 | Comparison of computational codes for direct numerical simulations of
turbulent Rayleigh-B\'enard convection | Computational codes for direct numerical simulations of Rayleigh-B\'enard
(RB) convection are compared in terms of computational cost and quality of the
solution. As a benchmark case, RB convection at $Ra=10^8$ and $Pr=1$ in a
periodic domain, in cubic and cylindrical containers is considered. A dedicated
second-orde... | physics.flu-dyn | computational codes for direct numerical simulations of rayleighbenard rb convection are compared in terms of computational cost and quality of the solution as a benchmark case rb convection at ra108 and pr1 in a periodic domain in cubic and cylindrical containers is considered a dedicated secondorder finitedifference ... | [['computational', 'codes', 'for', 'direct', 'numerical', 'simulations', 'of', 'rayleighbenard', 'rb', 'convection', 'are', 'compared', 'in', 'terms', 'of', 'computational', 'cost', 'and', 'quality', 'of', 'the', 'solution', 'as', 'a', 'benchmark', 'case', 'rb', 'convection', 'at', 'ra108', 'and', 'pr1', 'in', 'a', 'pe... | [-0.09914696956473897, 0.059338774746052245, -0.022268240604958286, 0.0888911021697544, -0.02521817624207814, -0.1631279497630704, 0.0039194135306574104, 0.3619502198101943, -0.21625879259627998, -0.31016424203253523, 0.11642302177271482, -0.2555336212865267, -0.06599415124546053, 0.2631279251203226, -0.056465037031798... |
1,802.09055 | Domain Specific Design Patterns: Designing For Conversational User
Interfaces | Designing conversational user interface experience is complicated because
conversation comes with many expectations. When these expectations are met, we
feel the interface is natural, but once violated, we feel something is amiss.
The last decade witnessed human language technologies and behaviours to enable
humans c... | cs.HC | designing conversational user interface experience is complicated because conversation comes with many expectations when these expectations are met we feel the interface is natural but once violated we feel something is amiss the last decade witnessed human language technologies and behaviours to enable humans converse... | [['designing', 'conversational', 'user', 'interface', 'experience', 'is', 'complicated', 'because', 'conversation', 'comes', 'with', 'many', 'expectations', 'when', 'these', 'expectations', 'are', 'met', 'we', 'feel', 'the', 'interface', 'is', 'natural', 'but', 'once', 'violated', 'we', 'feel', 'something', 'is', 'amis... | [-0.11652866957313938, 0.08488515703287115, -0.04813035232507105, 0.09847226445003934, -0.18898514784247933, -0.21135570747989738, 0.024723805170673543, 0.4319661007580643, -0.2545482663836464, -0.3156863390161338, 0.07553459394829136, -0.27221067501845475, -0.21680097970107715, 0.21257318984605594, -0.1415567805343670... |
1,802.09056 | Analytic interpolation into the tetrablock and a $\mu$-synthesis problem | We give a solvability criterion for a special case of the $\mu$-synthesis
problem. That is, we prove the necessity and sufficiency of a condition for the
existence of an analytic $2 \times 2$ matrix-valued function on the disc
subject to a bound on the structured singular value and satisfying a finite set
of interpol... | math.CV | we give a solvability criterion for a special case of the musynthesis problem that is we prove the necessity and sufficiency of a condition for the existence of an analytic 2 times 2 matrixvalued function on the disc subject to a bound on the structured singular value and satisfying a finite set of interpolation condit... | [['we', 'give', 'a', 'solvability', 'criterion', 'for', 'a', 'special', 'case', 'of', 'the', 'musynthesis', 'problem', 'that', 'is', 'we', 'prove', 'the', 'necessity', 'and', 'sufficiency', 'of', 'a', 'condition', 'for', 'the', 'existence', 'of', 'an', 'analytic', '2', 'times', '2', 'matrixvalued', 'function', 'on', 't... | [-0.13365391196890009, -0.010818801891259177, -0.12075893486746483, 0.10591436694893572, -0.10192492268720849, -0.08824360647445752, 0.06114340266212821, 0.31986711571613946, -0.26904672369774846, -0.19770885868411925, 0.1605457377464821, -0.21262125604941198, -0.1372343783784244, 0.22571455751571598, -0.07272345060482... |
1,802.09057 | First derivatives at the optimum analysis (\textit{fdao}): An approach
to estimate the uncertainty in nonlinear regression involving stochastically
independent variables | An important problem of optimization analysis surges when parameters such as
$ \{\theta_j\}_{j=1,\, \dots \,,k }$, determining a function $
y=f(x\given\{\theta_j\}) $, must be estimated from a set of observables $ \{
x_i,y_i\}_{i=1,\, \dots \,,m} $. Where $ \{x_i\} $ are independent variables
assumed to be uncertaint... | stat.ME | an important problem of optimization analysis surges when parameters such as theta_j_j1 dots k determining a function yfxgiventheta_j must be estimated from a set of observables x_iy_i_i1 dots m where x_i are independent variables assumed to be uncertaintyfree it is known that analytical solutions are possible if yfxgi... | [['an', 'important', 'problem', 'of', 'optimization', 'analysis', 'surges', 'when', 'parameters', 'such', 'as', 'theta_j_j1', 'dots', 'k', 'determining', 'a', 'function', 'yfxgiventheta_j', 'must', 'be', 'estimated', 'from', 'a', 'set', 'of', 'observables', 'x_iy_i_i1', 'dots', 'm', 'where', 'x_i', 'are', 'independent'... | [-0.13115096806861748, 0.15070027395995567, -0.058060702363339566, 0.018340939820821706, -0.06481960998471117, -0.19017919621408164, 0.002118762298431691, 0.38986392310332685, -0.32673684709394973, -0.275665706223143, 0.1372475444804877, -0.29292930471932604, -0.11401076005062177, 0.21764180775720715, -0.03816378616916... |
1,802.09058 | Seeing Small Faces from Robust Anchor's Perspective | This paper introduces a novel anchor design to support anchor-based face
detection for superior scale-invariant performance, especially on tiny faces.
To achieve this, we explicitly address the problem that anchor-based detectors
drop performance drastically on faces with tiny sizes, e.g. less than 16x16
pixels. In t... | cs.CV | this paper introduces a novel anchor design to support anchorbased face detection for superior scaleinvariant performance especially on tiny faces to achieve this we explicitly address the problem that anchorbased detectors drop performance drastically on faces with tiny sizes eg less than 16x16 pixels in this paper we... | [['this', 'paper', 'introduces', 'a', 'novel', 'anchor', 'design', 'to', 'support', 'anchorbased', 'face', 'detection', 'for', 'superior', 'scaleinvariant', 'performance', 'especially', 'on', 'tiny', 'faces', 'to', 'achieve', 'this', 'we', 'explicitly', 'address', 'the', 'problem', 'that', 'anchorbased', 'detectors', '... | [-0.0832266149111092, 0.017313025578235587, 0.0017668195689717928, 0.04362824545397113, -0.11597305920595924, -0.20563593394123017, 0.04886512203918149, 0.4207186095416546, -0.23342998575419188, -0.36724031962027465, 0.06815793984492, -0.283587135784328, -0.19577920427545906, 0.15257335243125755, -0.19633375079060594, ... |
1,802.09059 | One Single Deep Bidirectional LSTM Network for Word Sense Disambiguation
of Text Data | Due to recent technical and scientific advances, we have a wealth of
information hidden in unstructured text data such as offline/online narratives,
research articles, and clinical reports. To mine these data properly,
attributable to their innate ambiguity, a Word Sense Disambiguation (WSD)
algorithm can avoid numbe... | cs.LG cs.CL cs.IR stat.ML | due to recent technical and scientific advances we have a wealth of information hidden in unstructured text data such as offlineonline narratives research articles and clinical reports to mine these data properly attributable to their innate ambiguity a word sense disambiguation wsd algorithm can avoid numbers of diffi... | [['due', 'to', 'recent', 'technical', 'and', 'scientific', 'advances', 'we', 'have', 'a', 'wealth', 'of', 'information', 'hidden', 'in', 'unstructured', 'text', 'data', 'such', 'as', 'offlineonline', 'narratives', 'research', 'articles', 'and', 'clinical', 'reports', 'to', 'mine', 'these', 'data', 'properly', 'attribut... | [-0.08717405194948034, 0.025333990108500532, -0.025169059078266123, 0.11225297074502834, -0.18082745239886194, -0.14309629984675165, 0.091030118721664, 0.42454330004802365, -0.3133930601559731, -0.3677231477396119, 0.09060996921406742, -0.2854105194168938, -0.15918843378312886, 0.18339487920645117, -0.19330029166461962... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.