id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,801.04469 | On the equivalence of the Mizoguchi-Takahashi locally contractive map to
Nadler's locally contractive map | In this article, we have proved the equivalence between the
Mizoguchi-Takahashi uniformly~locally~contractive map to the multi-valued map
satisfying the Nadler contractive condition uniformly~locally~on a metrically
convex space.
| math.FA | in this article we have proved the equivalence between the mizoguchitakahashi uniformlylocallycontractive map to the multivalued map satisfying the nadler contractive condition uniformlylocallyon a metrically convex space | [['in', 'this', 'article', 'we', 'have', 'proved', 'the', 'equivalence', 'between', 'the', 'mizoguchitakahashi', 'uniformlylocallycontractive', 'map', 'to', 'the', 'multivalued', 'map', 'satisfying', 'the', 'nadler', 'contractive', 'condition', 'uniformlylocallyon', 'a', 'metrically', 'convex', 'space']] | [-0.15226806368445978, 0.006755897969317933, -0.1045919790728173, 0.08991938283725176, -0.09428928350098431, -0.12692765136792636, 0.05269199959002435, 0.36284114389369887, -0.38577695509108406, -0.1593100690903763, 0.09786756404112869, -0.257943993085064, -0.1968877753339863, 0.15890412191705158, -0.17710823297966272,... |
1,801.0447 | Simple Unsupervised Keyphrase Extraction using Sentence Embeddings | Keyphrase extraction is the task of automatically selecting a small set of
phrases that best describe a given free text document. Supervised keyphrase
extraction requires large amounts of labeled training data and generalizes very
poorly outside the domain of the training data. At the same time, unsupervised
systems ... | cs.CL | keyphrase extraction is the task of automatically selecting a small set of phrases that best describe a given free text document supervised keyphrase extraction requires large amounts of labeled training data and generalizes very poorly outside the domain of the training data at the same time unsupervised systems have ... | [['keyphrase', 'extraction', 'is', 'the', 'task', 'of', 'automatically', 'selecting', 'a', 'small', 'set', 'of', 'phrases', 'that', 'best', 'describe', 'a', 'given', 'free', 'text', 'document', 'supervised', 'keyphrase', 'extraction', 'requires', 'large', 'amounts', 'of', 'labeled', 'training', 'data', 'and', 'generali... | [-0.03460894518897736, 0.030433485317127112, 0.0031181205596242634, 0.09280524824213769, -0.17792592414255654, -0.14009100683831743, 0.09794524854714318, 0.40931675509682725, -0.24590030276083522, -0.37211404695042544, 0.03703106390578406, -0.31430495998689106, -0.07572995018213988, 0.1816883525711351, -0.1669683704046... |
1,801.04471 | Analytical approaches to the determination of spin-dependent parton
distribution functions at NNLO approximation | In this paper, we present {\tt SMKA18} analysis which is a first attempt to
extract the set of next-to-next-leading-order (NNLO) spin-dependent parton
distribution functions (spin-dependent PDFs) and their uncertainties determined
through the Laplace transform technique and Jacobi polynomial approach. Using
the Lapla... | hep-ph | in this paper we present tt smka18 analysis which is a first attempt to extract the set of nexttonextleadingorder nnlo spindependent parton distribution functions spindependent pdfs and their uncertainties determined through the laplace transform technique and jacobi polynomial approach using the laplace transformation... | [['in', 'this', 'paper', 'we', 'present', 'tt', 'smka18', 'analysis', 'which', 'is', 'a', 'first', 'attempt', 'to', 'extract', 'the', 'set', 'of', 'nexttonextleadingorder', 'nnlo', 'spindependent', 'parton', 'distribution', 'functions', 'spindependent', 'pdfs', 'and', 'their', 'uncertainties', 'determined', 'through', ... | [-0.051322838605775786, 0.07696234960086855, -0.11697033792448465, 0.12883941400967583, -0.05847906410669839, -0.03800872453464126, -0.0011529747696316292, 0.3942412359331466, -0.2280865402990792, -0.27674583495063193, 0.029975981828670926, -0.33417166616950483, -0.07852569166170947, 0.22737987915145383, 0.082511078320... |
1,801.04472 | Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and
Applications | A Not-All-Equal (NAE) decomposition of a graph $G$ is a decomposition of the
vertices of $G$ into two parts such that each vertex in $G$ has at least one
neighbor in each part. Also, a 1-in-Degree decomposition of a graph $G$ is a
decomposition of the vertices of $G$ into two parts $A$ and $B$ such that each
vertex i... | cs.DM math.CO | a notallequal nae decomposition of a graph g is a decomposition of the vertices of g into two parts such that each vertex in g has at least one neighbor in each part also a 1indegree decomposition of a graph g is a decomposition of the vertices of g into two parts a and b such that each vertex in the graph g has exactl... | [['a', 'notallequal', 'nae', 'decomposition', 'of', 'a', 'graph', 'g', 'is', 'a', 'decomposition', 'of', 'the', 'vertices', 'of', 'g', 'into', 'two', 'parts', 'such', 'that', 'each', 'vertex', 'in', 'g', 'has', 'at', 'least', 'one', 'neighbor', 'in', 'each', 'part', 'also', 'a', '1indegree', 'decomposition', 'of', 'a',... | [-0.1610202387155887, 0.07794170832870521, -0.09085468056756904, 0.007131792057372856, -0.10361642760628331, -0.14134104286777316, 0.029859013666005754, 0.39786976712716904, -0.26410636625220796, -0.27378358233174727, 0.09884749030952869, -0.2856235109524582, -0.16563496641467676, 0.12458485519042514, -0.08192864430452... |
1,801.04473 | Channel Whispering: a Protocol for Physical Layer Group Key Generation.
Application to IR-UWB through Deconvolution | As wireless ad hoc and mobile networks are emerging and the transferred data
become more sensitive, information security measures should make use of all the
available contextual resources to secure information flows. The physical layer
security framework provides models, algorithms, and proofs of concept for
generati... | cs.CR cs.IT math.IT | as wireless ad hoc and mobile networks are emerging and the transferred data become more sensitive information security measures should make use of all the available contextual resources to secure information flows the physical layer security framework provides models algorithms and proofs of concept for generating pai... | [['as', 'wireless', 'ad', 'hoc', 'and', 'mobile', 'networks', 'are', 'emerging', 'and', 'the', 'transferred', 'data', 'become', 'more', 'sensitive', 'information', 'security', 'measures', 'should', 'make', 'use', 'of', 'all', 'the', 'available', 'contextual', 'resources', 'to', 'secure', 'information', 'flows', 'the', ... | [-0.1841170878299077, 0.013855827690414177, -0.04772433773543553, 0.055476135167714, -0.07698951781665916, -0.22496171221657074, 0.08866970434780162, 0.40871219708570067, -0.2647983007827953, -0.3063786444514233, 0.09556780873944387, -0.24722132112282486, -0.14892502527135582, 0.18417022697306074, -0.08798276024237087,... |
1,801.04474 | An invariant related to the existence of conformally compact Einstein
fillings | We define an invariant for compact spin manifolds $X$ of dimension $4k$
equipped with a metric $h$ of positive Yamabe invariant on its boundary. The
vanishing of this invariant is a necessary condition for the conformal class of
$h$ to be the conformal infinity of a conformally compact Einstein metric on
$X$.
| math.DG | we define an invariant for compact spin manifolds x of dimension 4k equipped with a metric h of positive yamabe invariant on its boundary the vanishing of this invariant is a necessary condition for the conformal class of h to be the conformal infinity of a conformally compact einstein metric on x | [['we', 'define', 'an', 'invariant', 'for', 'compact', 'spin', 'manifolds', 'x', 'of', 'dimension', '4k', 'equipped', 'with', 'a', 'metric', 'h', 'of', 'positive', 'yamabe', 'invariant', 'on', 'its', 'boundary', 'the', 'vanishing', 'of', 'this', 'invariant', 'is', 'a', 'necessary', 'condition', 'for', 'the', 'conformal... | [-0.23506317839313012, 0.1515163701554299, -0.08013586499370061, 0.05489413166203751, -0.13407288594708705, -0.20587632729886815, -0.08242567039829177, 0.3533020971987683, -0.19564957049890205, -0.1589373797357369, 0.12805489039209744, -0.27491952665150166, -0.09779102462702073, 0.13232503944219878, -0.1021639618019645... |
1,801.04475 | On fully residually-$\mathcal{R}$ groups | We consider the class $\mathcal{R}$ of finitely generated toral relatively
hyperbolic groups. We show that groups from $\mathcal{R}$ are commutative
transitive and generalize a theorem proved by Benjamin Baumslag to this class.
We also discuss two definitions of (fully) residually-$\mathcal{C}$ groups and
prove the e... | math.GR | we consider the class mathcalr of finitely generated toral relatively hyperbolic groups we show that groups from mathcalr are commutative transitive and generalize a theorem proved by benjamin baumslag to this class we also discuss two definitions of fully residuallymathcalc groups and prove the equivalence of the two ... | [['we', 'consider', 'the', 'class', 'mathcalr', 'of', 'finitely', 'generated', 'toral', 'relatively', 'hyperbolic', 'groups', 'we', 'show', 'that', 'groups', 'from', 'mathcalr', 'are', 'commutative', 'transitive', 'and', 'generalize', 'a', 'theorem', 'proved', 'by', 'benjamin', 'baumslag', 'to', 'this', 'class', 'we', ... | [-0.1555311920439029, 0.15426148244211316, -0.10879490863687048, 0.06305207830543319, -0.11171545369240145, -0.14666832494161403, -0.03061986200142807, 0.3773730858539542, -0.3671237365885948, -0.17673609556319814, 0.10116868759505451, -0.2654609595968698, -0.13227326098519068, 0.26978259862711035, -0.15879780321847647... |
1,801.04476 | Cosupports and minimal pure-injective resolutions of affine rings | We prove that any affine ring $R$ over a field $k$ has full cosupport, i.e.,
the cosupport of $R$ is equal to ${\rm Spec}\, R$. Using this fact, we give a
complete description of all terms in a minimal pure-injective resolution of
$R$, provided that $|k|=\aleph_1$ and ${\rm dim}\, R\geq 2$, or $|k|\geq
\aleph_1$ and ... | math.AC math.RA | we prove that any affine ring r over a field k has full cosupport ie the cosupport of r is equal to rm spec r using this fact we give a complete description of all terms in a minimal pureinjective resolution of r provided that kaleph_1 and rm dim rgeq 2 or kgeq aleph_1 and rm dim r2 as a corollary we obtain a partial a... | [['we', 'prove', 'that', 'any', 'affine', 'ring', 'r', 'over', 'a', 'field', 'k', 'has', 'full', 'cosupport', 'ie', 'the', 'cosupport', 'of', 'r', 'is', 'equal', 'to', 'rm', 'spec', 'r', 'using', 'this', 'fact', 'we', 'give', 'a', 'complete', 'description', 'of', 'all', 'terms', 'in', 'a', 'minimal', 'pureinjective', '... | [-0.20299817766728145, 0.019339143112301827, -0.0630932018293866, 0.0412640065486942, -0.03291161236619311, -0.1866798290317612, -0.053705603642655274, 0.34887822193891876, -0.255110648893086, -0.19928463002932922, 0.12427979098200533, -0.2572959273488128, -0.06933035705172058, 0.16919472367569272, -0.09851468635024503... |
1,801.04477 | Dimension Reduction for the Landau-de Gennes Model: The Vanishing
Nematic Correlation Length Limit | We study nematic liquid crystalline films within the framework of the
Landau-de Gennes theory in the limit when both the thickness of the film and
the nematic correlation length are vanishingly small compared to the lateral
extent of the film. We prove $\Gamma$-convergence for a sequence of singularly
perturbed funct... | math.AP | we study nematic liquid crystalline films within the framework of the landaude gennes theory in the limit when both the thickness of the film and the nematic correlation length are vanishingly small compared to the lateral extent of the film we prove gammaconvergence for a sequence of singularly perturbed functionals w... | [['we', 'study', 'nematic', 'liquid', 'crystalline', 'films', 'within', 'the', 'framework', 'of', 'the', 'landaude', 'gennes', 'theory', 'in', 'the', 'limit', 'when', 'both', 'the', 'thickness', 'of', 'the', 'film', 'and', 'the', 'nematic', 'correlation', 'length', 'are', 'vanishingly', 'small', 'compared', 'to', 'the'... | [-0.1515565340243678, 0.08483270848283672, -0.07933061574194722, 0.06624730393727744, -0.04212853195899315, -0.047218781160119606, 0.026284729635328737, 0.2676468821569481, -0.2929648044199206, -0.2829261813810422, 0.07585057917136329, -0.2748516089593297, -0.11812774918418918, 0.13640137030280955, -0.06300148999723712... |
1,801.04478 | Turbulent superstructures in Rayleigh-B\'enard convection | Turbulent Rayleigh-B\'enard convection displays a large-scale order in the
form of rolls and cells on lengths larger than the layer height once the
fluctuations of temperature and velocity are removed. These turbulent
superstructures are reminiscent of the patterns close to the onset of
convection. They are analyzed ... | physics.flu-dyn astro-ph.SR nlin.CD nlin.PS | turbulent rayleighbenard convection displays a largescale order in the form of rolls and cells on lengths larger than the layer height once the fluctuations of temperature and velocity are removed these turbulent superstructures are reminiscent of the patterns close to the onset of convection they are analyzed by numer... | [['turbulent', 'rayleighbenard', 'convection', 'displays', 'a', 'largescale', 'order', 'in', 'the', 'form', 'of', 'rolls', 'and', 'cells', 'on', 'lengths', 'larger', 'than', 'the', 'layer', 'height', 'once', 'the', 'fluctuations', 'of', 'temperature', 'and', 'velocity', 'are', 'removed', 'these', 'turbulent', 'superstr... | [-0.17202222030609846, 0.2477792255430212, -0.03897020166078883, 0.05461060096239371, -0.007963451509508999, -0.04338430393817684, 0.007469297673613313, 0.2698300365628975, -0.2980250873542841, -0.3522832476744248, 0.08554351158560283, -0.26381735825468033, -0.09010325285696215, 0.21854402231833628, 0.02721604397520423... |
1,801.04479 | Knowledge Organization Systems (KOS) in the Semantic Web: A
Multi-Dimensional Review | Since the Simple Knowledge Organization System (SKOS) specification and its
SKOS eXtension for Labels (SKOS-XL) became formal W3C recommendations in 2009 a
significant number of conventional knowledge organization systems (KOS)
(including thesauri, classification schemes, name authorities, and lists of
codes and term... | cs.DL | since the simple knowledge organization system skos specification and its skos extension for labels skosxl became formal w3c recommendations in 2009 a significant number of conventional knowledge organization systems kos including thesauri classification schemes name authorities and lists of codes and terms produced be... | [['since', 'the', 'simple', 'knowledge', 'organization', 'system', 'skos', 'specification', 'and', 'its', 'skos', 'extension', 'for', 'labels', 'skosxl', 'became', 'formal', 'w3c', 'recommendations', 'in', '2009', 'a', 'significant', 'number', 'of', 'conventional', 'knowledge', 'organization', 'systems', 'kos', 'includ... | [-0.11694707668982773, 0.017092345589940362, -0.051394529211776036, 0.07701816760808262, -0.1757582991543275, -0.08679488805067019, 0.10666383121350552, 0.3746888300612275, -0.30062958264208745, -0.3673783305709724, 0.10192110980227753, -0.32245216157548784, -0.0826548983214276, 0.1474184742097318, -0.13648808179341518... |
1,801.0448 | MAC-Oriented Programmable Terahertz PHY via Graphene-based Yagi-Uda
Antennas | Graphene is enabling a plethora of applications in a wide range of fields due
to its unique electrical, mechanical, and optical properties. In the realm of
wireless communications, graphene shows great promise for the implementation of
miniaturized and tunable antennas in the terahertz band. These unique
advantages o... | cs.ET | graphene is enabling a plethora of applications in a wide range of fields due to its unique electrical mechanical and optical properties in the realm of wireless communications graphene shows great promise for the implementation of miniaturized and tunable antennas in the terahertz band these unique advantages open the... | [['graphene', 'is', 'enabling', 'a', 'plethora', 'of', 'applications', 'in', 'a', 'wide', 'range', 'of', 'fields', 'due', 'to', 'its', 'unique', 'electrical', 'mechanical', 'and', 'optical', 'properties', 'in', 'the', 'realm', 'of', 'wireless', 'communications', 'graphene', 'shows', 'great', 'promise', 'for', 'the', 'i... | [-0.2024109415453056, 0.055045499549857504, -0.0034653124174681203, -0.09671925158633304, -0.0675291279459308, -0.17351503291905954, 0.07774040708719784, 0.46023534854857956, -0.2748840851773476, -0.33078686447878336, 0.04949677943107512, -0.2071343341047458, -0.17821037055089556, 0.27445666355819537, -0.07017623979983... |
1,801.04481 | Density of power-free values of polynomials | We establish asymptotic formulae for the number of $k$-free values of
polynmilas $F(x_1,\cdots,x_n)\in\mathbb{Z}[x_1,\cdots,x_n]$ of degree $d\geq 2$
for any $n\geq 1$, including when the variables are prime, as long as $k\geq
(3d+1)/4$. Thus we generalize a work of Browning, while we use a different
sieveing techniq... | math.NT | we establish asymptotic formulae for the number of kfree values of polynmilas fx_1cdotsx_ninmathbbzx_1cdotsx_n of degree dgeq 2 for any ngeq 1 including when the variables are prime as long as kgeq 3d14 thus we generalize a work of browning while we use a different sieveing technique for the middle range of primes | [['we', 'establish', 'asymptotic', 'formulae', 'for', 'the', 'number', 'of', 'kfree', 'values', 'of', 'polynmilas', 'fx_1cdotsx_ninmathbbzx_1cdotsx_n', 'of', 'degree', 'dgeq', '2', 'for', 'any', 'ngeq', '1', 'including', 'when', 'the', 'variables', 'are', 'prime', 'as', 'long', 'as', 'kgeq', '3d14', 'thus', 'we', 'gene... | [-0.15518856844088683, 0.12683458564500447, -0.04433732441005608, 0.06303252889968765, -0.02025994413997978, -0.15761534008197486, 0.019171661477836704, 0.3187376234758024, -0.20386235170978276, -0.334096416986237, 0.09927063407182384, -0.24163530939646685, -0.12210343428887427, 0.25037485953847255, -0.0587982745103848... |
1,801.04482 | Semantic integration of UML class diagram with semantic validation on
segments of mappings | Recently, attention has focused on the software development, specially by
differ-ent teams that are geographically distant to support collaborative work.
Manage-ment, description and modeling in such collaborative approach are
through sever-al tools and techniques based on UML models. It is now supported
by a large n... | cs.SE | recently attention has focused on the software development specially by different teams that are geographically distant to support collaborative work management description and modeling in such collaborative approach are through several tools and techniques based on uml models it is now supported by a large number of t... | [['recently', 'attention', 'has', 'focused', 'on', 'the', 'software', 'development', 'specially', 'by', 'different', 'teams', 'that', 'are', 'geographically', 'distant', 'to', 'support', 'collaborative', 'work', 'management', 'description', 'and', 'modeling', 'in', 'such', 'collaborative', 'approach', 'are', 'through',... | [-0.05937174426884774, 0.030881937196039978, -0.06565275913796059, 0.07273858170768055, -0.12485553185208975, -0.13675915558055482, 0.038563813149641434, 0.44761771968949365, -0.19646998970026341, -0.3538983560660306, 0.09237420221496209, -0.26365810923743993, -0.17304482269237803, 0.24133855031858034, -0.0808417515226... |
1,801.04483 | Waring's Theorem for Binary Powers | A natural number is a binary $k$'th power if its binary representation
consists of $k$ consecutive identical blocks. We prove an analogue of Waring's
theorem for sums of binary $k$'th powers. More precisely, we show that for each
integer $k \geq 2$, there exists a positive integer $W(k)$ such that every
sufficiently ... | math.NT cs.DM math.CO | a natural number is a binary kth power if its binary representation consists of k consecutive identical blocks we prove an analogue of warings theorem for sums of binary kth powers more precisely we show that for each integer k geq 2 there exists a positive integer wk such that every sufficiently large multiple of e_k ... | [['a', 'natural', 'number', 'is', 'a', 'binary', 'kth', 'power', 'if', 'its', 'binary', 'representation', 'consists', 'of', 'k', 'consecutive', 'identical', 'blocks', 'we', 'prove', 'an', 'analogue', 'of', 'warings', 'theorem', 'for', 'sums', 'of', 'binary', 'kth', 'powers', 'more', 'precisely', 'we', 'show', 'that', '... | [-0.2439140608238867, 0.15009252592628602, -0.05575335107278079, 0.04327273854222666, -0.06487831393153304, -0.14903147297014516, -0.0005677955708018055, 0.3233442737772647, -0.3333164260828333, -0.23195428570249566, 0.06892572456746604, -0.3062791374201576, -0.16549972616808695, 0.20261122159556383, -0.011493744755474... |
1,801.04484 | 2D problems in groups | We investigate a conjecture about stabilisation of deficiency in finite index
subgroups and relate it to the D2 Problem of C.T.C. Wall and the Relation Gap
problem. We verify the pro-$p$ version of the conjecture, as well as its higher
dimensional abstract analogues.
| math.GR math.AT | we investigate a conjecture about stabilisation of deficiency in finite index subgroups and relate it to the d2 problem of ctc wall and the relation gap problem we verify the prop version of the conjecture as well as its higher dimensional abstract analogues | [['we', 'investigate', 'a', 'conjecture', 'about', 'stabilisation', 'of', 'deficiency', 'in', 'finite', 'index', 'subgroups', 'and', 'relate', 'it', 'to', 'the', 'd2', 'problem', 'of', 'ctc', 'wall', 'and', 'the', 'relation', 'gap', 'problem', 'we', 'verify', 'the', 'prop', 'version', 'of', 'the', 'conjecture', 'as', '... | [-0.09789729866383294, 0.046387415793507775, -0.08097732327012129, 0.15155815812596662, -0.06736955284899057, -0.10672060441399037, 0.05159451375000699, 0.3585514653647362, -0.32332643710596615, -0.3135048190868178, 0.15515867192677202, -0.2312619133289297, -0.13158270283493884, 0.15947132546801207, -0.1521526034271647... |
1,801.04485 | Persistence of one-dimensional AR(1)-sequences | For a class of one-dimensional autoregressive processes $(X_n)$ we consider
the tail behaviour of the stopping time $T_0=\min \lbrace n\geq 1: X_n\leq 0
\rbrace$. We discuss existing general analytical approaches to this and related
problems and propose a new one, which is based on a renewal-type decomposition
for th... | math.PR | for a class of onedimensional autoregressive processes x_n we consider the tail behaviour of the stopping time t_0min lbrace ngeq 1 x_nleq 0 rbrace we discuss existing general analytical approaches to this and related problems and propose a new one which is based on a renewaltype decomposition for the moment generating... | [['for', 'a', 'class', 'of', 'onedimensional', 'autoregressive', 'processes', 'x_n', 'we', 'consider', 'the', 'tail', 'behaviour', 'of', 'the', 'stopping', 'time', 't_0min', 'lbrace', 'ngeq', '1', 'x_nleq', '0', 'rbrace', 'we', 'discuss', 'existing', 'general', 'analytical', 'approaches', 'to', 'this', 'and', 'related'... | [-0.10122907693100085, 0.09520215220982209, -0.12787284640944563, 0.09166474094551329, -0.037753565404273104, -0.1300930996076204, 0.00966314145201371, 0.39937202938987565, -0.27799998689442873, -0.16613578897279999, 0.1232083786004902, -0.27412739111847867, -0.16548723084755088, 0.1815071475187627, -0.0416883114279092... |
1,801.04486 | Can Computers Create Art? | This essay discusses whether computers, using Artificial Intelligence (AI),
could create art. First, the history of technologies that automated aspects of
art is surveyed, including photography and animation. In each case, there were
initial fears and denial of the technology, followed by a blossoming of new
creative... | cs.AI cs.CV cs.GR cs.LG | this essay discusses whether computers using artificial intelligence ai could create art first the history of technologies that automated aspects of art is surveyed including photography and animation in each case there were initial fears and denial of the technology followed by a blossoming of new creative and profess... | [['this', 'essay', 'discusses', 'whether', 'computers', 'using', 'artificial', 'intelligence', 'ai', 'could', 'create', 'art', 'first', 'the', 'history', 'of', 'technologies', 'that', 'automated', 'aspects', 'of', 'art', 'is', 'surveyed', 'including', 'photography', 'and', 'animation', 'in', 'each', 'case', 'there', 'w... | [-0.043338942508310524, 0.12130599438713224, -0.12052319628454106, 0.08318940260353734, -0.17464037621115794, -0.16584370910092744, 0.004771563558102544, 0.3768325503359535, -0.2544614594818941, -0.3729870232489349, 0.1374634097889761, -0.27965478369368435, -0.23031454837408416, 0.23651797250399728, -0.1407490958695981... |
1,801.04487 | Better Runtime Guarantees Via Stochastic Domination | Apart from few exceptions, the mathematical runtime analysis of evolutionary
algorithms is mostly concerned with expected runtimes. In this work, we argue
that stochastic domination is a notion that should be used more frequently in
this area. Stochastic domination allows to formulate much more informative
performanc... | cs.NE cs.AI | apart from few exceptions the mathematical runtime analysis of evolutionary algorithms is mostly concerned with expected runtimes in this work we argue that stochastic domination is a notion that should be used more frequently in this area stochastic domination allows to formulate much more informative performance guar... | [['apart', 'from', 'few', 'exceptions', 'the', 'mathematical', 'runtime', 'analysis', 'of', 'evolutionary', 'algorithms', 'is', 'mostly', 'concerned', 'with', 'expected', 'runtimes', 'in', 'this', 'work', 'we', 'argue', 'that', 'stochastic', 'domination', 'is', 'a', 'notion', 'that', 'should', 'be', 'used', 'more', 'fr... | [-0.10025883787646749, 0.049895930938855415, -0.127794677677395, 0.12269650687842225, -0.09918822604349127, -0.1600506034811413, 0.09449774727714483, 0.32799866160076824, -0.26282106956815104, -0.3087613506223818, 0.11127873290491272, -0.23227119620791237, -0.16380463975759205, 0.21336815930489036, -0.11321636812874314... |
1,801.04488 | An asymptotically compatible meshfree quadrature rule for non-local
problems with applications to peridynamics | We present a meshfree quadrature rule for compactly supported non-local
integro-differential equations (IDEs) with radial kernels. We apply this rule
to develop a strong-form meshfree discretization of a peridynamic solid
mechanics model that requires no background mesh. Existing discretizations of
peridynamic models... | math.NA physics.comp-ph | we present a meshfree quadrature rule for compactly supported nonlocal integrodifferential equations ides with radial kernels we apply this rule to develop a strongform meshfree discretization of a peridynamic solid mechanics model that requires no background mesh existing discretizations of peridynamic models have bee... | [['we', 'present', 'a', 'meshfree', 'quadrature', 'rule', 'for', 'compactly', 'supported', 'nonlocal', 'integrodifferential', 'equations', 'ides', 'with', 'radial', 'kernels', 'we', 'apply', 'this', 'rule', 'to', 'develop', 'a', 'strongform', 'meshfree', 'discretization', 'of', 'a', 'peridynamic', 'solid', 'mechanics',... | [-0.07157090427403516, -0.005966136660319522, -0.11985414721078325, 0.07425521872937679, -0.10925355062040612, -0.13212905229062688, 0.012277989685436355, 0.38730780618654975, -0.26653931895270944, -0.26244321989278635, 0.1309990651330891, -0.2502811006369426, -0.1494149780462344, 0.19268057501795602, -0.06999010343850... |
1,801.04489 | A Stochastic Singular Vector Based MIMO Channel Model for MAC Layer
Tracking | A novel stochastic technique is presented to directly model singular vectors
and singular values of a multiple input multiple output channel. Thus the
component smodeled directly in the eigen domain can be adapted to exhibit
realistic physical domain behavior when assembled. The model exploites natural
paths of eigen... | cs.IT math.IT math.ST stat.TH | a novel stochastic technique is presented to directly model singular vectors and singular values of a multiple input multiple output channel thus the component smodeled directly in the eigen domain can be adapted to exhibit realistic physical domain behavior when assembled the model exploites natural paths of eigenmode... | [['a', 'novel', 'stochastic', 'technique', 'is', 'presented', 'to', 'directly', 'model', 'singular', 'vectors', 'and', 'singular', 'values', 'of', 'a', 'multiple', 'input', 'multiple', 'output', 'channel', 'thus', 'the', 'component', 'smodeled', 'directly', 'in', 'the', 'eigen', 'domain', 'can', 'be', 'adapted', 'to', ... | [-0.13499731223453723, 0.11223723753261895, -0.08732453797988239, 0.034315015720548694, -0.14652767366663152, -0.18391134479904958, 0.0034073425696468413, 0.39078755443915725, -0.310337663265056, -0.26299589049137595, 0.10940834725971356, -0.1953584554749319, -0.16030900304238976, 0.1951330927272682, -0.038003598669699... |
1,801.0449 | On a statistical approach to mate choices in reproduction | We provide a probabilistic approach to modeling the movements of subjects
through multiple stages, with "stays" or survival at each stage for a random
length of time, and ending at a desired final stage. We use conditional Markov
chains with exponential survival times to model the movement of each subject.
This is mo... | stat.ME | we provide a probabilistic approach to modeling the movements of subjects through multiple stages with stays or survival at each stage for a random length of time and ending at a desired final stage we use conditional markov chains with exponential survival times to model the movement of each subject this is motivated ... | [['we', 'provide', 'a', 'probabilistic', 'approach', 'to', 'modeling', 'the', 'movements', 'of', 'subjects', 'through', 'multiple', 'stages', 'with', 'stays', 'or', 'survival', 'at', 'each', 'stage', 'for', 'a', 'random', 'length', 'of', 'time', 'and', 'ending', 'at', 'a', 'desired', 'final', 'stage', 'we', 'use', 'con... | [-0.05054712873553076, 0.11387825413877445, -0.11139611062563716, 0.039214109814155004, -0.01756585110279341, -0.136399403737197, 0.09498861586231919, 0.3811762259371819, -0.21980645059938392, -0.3232254845060168, 0.0988761356641208, -0.24368393417567977, -0.1189427710709072, 0.1557644000321987, -0.09390305121759734, 0... |
1,801.04491 | Irreversible investment with fixed adjustment costs: a stochastic
impulse control approach | We consider an optimal stochastic impulse control problem over an infinite
time horizon motivated by a model of irreversible investment choices with fixed
adjustment costs. By employing techniques of viscosity solutions and relying on
semiconvexity arguments, we prove that the value function is a classical
solution t... | math.OC q-fin.MF | we consider an optimal stochastic impulse control problem over an infinite time horizon motivated by a model of irreversible investment choices with fixed adjustment costs by employing techniques of viscosity solutions and relying on semiconvexity arguments we prove that the value function is a classical solution to th... | [['we', 'consider', 'an', 'optimal', 'stochastic', 'impulse', 'control', 'problem', 'over', 'an', 'infinite', 'time', 'horizon', 'motivated', 'by', 'a', 'model', 'of', 'irreversible', 'investment', 'choices', 'with', 'fixed', 'adjustment', 'costs', 'by', 'employing', 'techniques', 'of', 'viscosity', 'solutions', 'and',... | [-0.1285732902978596, 0.010204821187040867, -0.08542123593782124, 0.029874555707762117, -0.0920030361458071, -0.10901405133405014, 0.10007225165241643, 0.33521644453469074, -0.312041449919343, -0.26092190470754806, 0.18370681443423229, -0.2627296524906629, -0.15274512413153915, 0.2073705873550161, -0.09494143316375189,... |
1,801.04492 | An Explicit Convergence Rate for Nesterov's Method from SDP | The framework of Integral Quadratic Constraints (IQC) introduced by Lessard
et al. (2014) reduces the computation of upper bounds on the convergence rate
of several optimization algorithms to semi-definite programming (SDP). In
particular, this technique was applied to Nesterov's accelerated method (NAM).
For quadrat... | math.OC cs.LG cs.NA | the framework of integral quadratic constraints iqc introduced by lessard et al 2014 reduces the computation of upper bounds on the convergence rate of several optimization algorithms to semidefinite programming sdp in particular this technique was applied to nesterovs accelerated method nam for quadratic functions thi... | [['the', 'framework', 'of', 'integral', 'quadratic', 'constraints', 'iqc', 'introduced', 'by', 'lessard', 'et', 'al', '2014', 'reduces', 'the', 'computation', 'of', 'upper', 'bounds', 'on', 'the', 'convergence', 'rate', 'of', 'several', 'optimization', 'algorithms', 'to', 'semidefinite', 'programming', 'sdp', 'in', 'pa... | [-0.08169586585831388, -0.024165588642669416, -0.11699282036149977, 0.0809490541262979, -0.11173365865963408, -0.11339801411829992, 0.09569298602824954, 0.30806178888694075, -0.2694592231224912, -0.33119740522751173, 0.13085802875866648, -0.201437163606493, -0.18671883718666826, 0.2663015090058454, -0.09409425378524044... |
1,801.04493 | Finite size analysis of a double crossover in transitional wall
turbulence | This article presents the finite size analysis of two consecutive crossovers
leading laminar-turbulent bands to uniform wall turbulence in transitional
plane Couette flow. Direct numerical simulations and low order modeling
simulations of the flow are performed. The kinetic energy $E$ of the turbulent
flow and the or... | physics.flu-dyn | this article presents the finite size analysis of two consecutive crossovers leading laminarturbulent bands to uniform wall turbulence in transitional plane couette flow direct numerical simulations and low order modeling simulations of the flow are performed the kinetic energy e of the turbulent flow and the order par... | [['this', 'article', 'presents', 'the', 'finite', 'size', 'analysis', 'of', 'two', 'consecutive', 'crossovers', 'leading', 'laminarturbulent', 'bands', 'to', 'uniform', 'wall', 'turbulence', 'in', 'transitional', 'plane', 'couette', 'flow', 'direct', 'numerical', 'simulations', 'and', 'low', 'order', 'modeling', 'simul... | [-0.19108042830117078, 0.19007207431953552, -0.09628260516344905, 0.019173986003604822, -0.030882881309985857, -0.0876642862729366, 0.04526197486160931, 0.311114266838154, -0.2638993303618109, -0.2923760927345332, 0.057995162405859446, -0.28534284263150766, -0.09167836667903531, 0.12925391443342152, 0.01125892914812235... |
1,801.04494 | Spin filling and orbital structure of the first six holes in a silicon
metal-oxide-semiconductor quantum dot | The spin states of electrons confined in semiconductor quantum dots form a
promising platform for quantum computation. Recent studies of silicon CMOS
qubits have shown coherent manipulation of electron spin states with extremely
high fidelity. However, manipulation of single electron spins requires large
oscillatory ... | cond-mat.mes-hall | the spin states of electrons confined in semiconductor quantum dots form a promising platform for quantum computation recent studies of silicon cmos qubits have shown coherent manipulation of electron spin states with extremely high fidelity however manipulation of single electron spins requires large oscillatory magne... | [['the', 'spin', 'states', 'of', 'electrons', 'confined', 'in', 'semiconductor', 'quantum', 'dots', 'form', 'a', 'promising', 'platform', 'for', 'quantum', 'computation', 'recent', 'studies', 'of', 'silicon', 'cmos', 'qubits', 'have', 'shown', 'coherent', 'manipulation', 'of', 'electron', 'spin', 'states', 'with', 'ext... | [-0.1649061654779534, 0.22820944353878547, 0.008353846796294587, 0.02349077072371815, -0.00726730940193563, -0.23147876761827824, 0.034033163813917244, 0.4399205538642558, -0.23912400222400687, -0.3454591863728301, -0.0028867119835922495, -0.3005986077683634, -0.07029538304777816, 0.23518994947112837, 0.014528415461326... |
1,801.04495 | Model Predictive Control in Spacecraft Rendezvous and Soft Docking | This paper discusses translation and attitude control in spacecraft
rendezvous and soft docking. The target spacecraft orbit can be either circular
or elliptic. The high fidelity model for this problem is intrinsically a
nonlinear system but can be viewed as a linear time varying system (LTV).
Therefore, a model pred... | math.OC | this paper discusses translation and attitude control in spacecraft rendezvous and soft docking the target spacecraft orbit can be either circular or elliptic the high fidelity model for this problem is intrinsically a nonlinear system but can be viewed as a linear time varying system ltv therefore a model predictive c... | [['this', 'paper', 'discusses', 'translation', 'and', 'attitude', 'control', 'in', 'spacecraft', 'rendezvous', 'and', 'soft', 'docking', 'the', 'target', 'spacecraft', 'orbit', 'can', 'be', 'either', 'circular', 'or', 'elliptic', 'the', 'high', 'fidelity', 'model', 'for', 'this', 'problem', 'is', 'intrinsically', 'a', ... | [-0.1462120622745715, 0.07026242897789017, -0.08224257279653102, 0.012287019142915108, -0.09068923099988663, -0.1776004426320447, 0.04809163993000189, 0.4034783156906686, -0.29316723539789274, -0.33204066974292623, 0.14345719782649236, -0.19751527735100285, -0.1480957550953551, 0.18504056908621838, -0.1403606063201839,... |
1,801.04496 | Shell model study on the possibility of using an effective field theory
for disentangling several contributions to the neutrinoless double-beta decay | Neutrinoless double-beta decay represents the most promising approach for
revealing some of the most important, yet-unknown, properties of neutrinos
related to their absolute masses and their nature. This transition involves
beyond standard model theories that predict the violation of the lepton number
conservation b... | nucl-th hep-ph hep-th | neutrinoless doublebeta decay represents the most promising approach for revealing some of the most important yetunknown properties of neutrinos related to their absolute masses and their nature this transition involves beyond standard model theories that predict the violation of the lepton number conservation by two u... | [['neutrinoless', 'doublebeta', 'decay', 'represents', 'the', 'most', 'promising', 'approach', 'for', 'revealing', 'some', 'of', 'the', 'most', 'important', 'yetunknown', 'properties', 'of', 'neutrinos', 'related', 'to', 'their', 'absolute', 'masses', 'and', 'their', 'nature', 'this', 'transition', 'involves', 'beyond'... | [-0.06078220418697449, 0.19393379939333105, -0.028747102875542434, 0.14148201372150085, -0.02094728898020149, -0.15063268316080633, 0.08031124769335861, 0.31749542922083007, -0.19450294695433898, -0.31424946188280695, 0.036207357013727286, -0.31457636136066364, -0.0668794751016563, 0.22703058501797044, 0.05484978173660... |
1,801.04497 | Near-optimal approximation algorithm for simultaneous Max-Cut | In the simultaneous Max-Cut problem, we are given $k$ weighted graphs on the
same set of $n$ vertices, and the goal is to find a cut of the vertex set so
that the minimum, over the $k$ graphs, of the cut value is as large as
possible. Previous work [BKS15] gave a polynomial time algorithm which achieved
an approximat... | cs.CC cs.DS | in the simultaneous maxcut problem we are given k weighted graphs on the same set of n vertices and the goal is to find a cut of the vertex set so that the minimum over the k graphs of the cut value is as large as possible previous work bks15 gave a polynomial time algorithm which achieved an approximation factor of 12... | [['in', 'the', 'simultaneous', 'maxcut', 'problem', 'we', 'are', 'given', 'k', 'weighted', 'graphs', 'on', 'the', 'same', 'set', 'of', 'n', 'vertices', 'and', 'the', 'goal', 'is', 'to', 'find', 'a', 'cut', 'of', 'the', 'vertex', 'set', 'so', 'that', 'the', 'minimum', 'over', 'the', 'k', 'graphs', 'of', 'the', 'cut', 'v... | [-0.1261491801395702, 0.02019694490164208, -0.04821070397272706, 0.0430876444093883, -0.05465875969578823, -0.12574759436150393, 0.10621787724395593, 0.352704459632126, -0.3112614472024143, -0.3542960255530973, 0.0697626669316863, -0.2553035698427508, -0.12346371020035198, 0.14466250030013422, -0.02077953519920508, 0.0... |
1,801.04498 | Fast Methods for Solving the Cluster Containment Problem for
Phylogenetic Networks | Genetic and comparative genomic studies indicate that extant genomes are more
properly considered to be a fusion product of random mutations over generations
and genomic material transfers between individuals of different lineages. This
has motivated researchers to adopt phylogenetic networks and other general
models... | q-bio.QM cs.DS | genetic and comparative genomic studies indicate that extant genomes are more properly considered to be a fusion product of random mutations over generations and genomic material transfers between individuals of different lineages this has motivated researchers to adopt phylogenetic networks and other general models to... | [['genetic', 'and', 'comparative', 'genomic', 'studies', 'indicate', 'that', 'extant', 'genomes', 'are', 'more', 'properly', 'considered', 'to', 'be', 'a', 'fusion', 'product', 'of', 'random', 'mutations', 'over', 'generations', 'and', 'genomic', 'material', 'transfers', 'between', 'individuals', 'of', 'different', 'li... | [-0.10197390860505402, 0.0768680095981108, -0.06032932908460498, 0.13030964211793616, -0.07152797585353256, -0.16216955913975833, 0.07181022444367409, 0.38833180231601, -0.30800628988072276, -0.2758237016499043, 0.08827337307296693, -0.22963800598308445, -0.19707548971287905, 0.18074611045978964, -0.09583451887220144, ... |
1,801.04499 | Measurement of dE/dx resolution of TPC prototype with gating GEM exposed
to an electron beam | The Time Projection Chamber (TPC) can identify particle species using the
energy loss (dE/dx) measured by the readout pad rows. The dE/dx resolution for
the ILD (International Large Detector) -TPC for the International Linear
Collider experiment is expected to have high resolution for clear
identification. The dE/dx ... | physics.ins-det hep-ex | the time projection chamber tpc can identify particle species using the energy loss dedx measured by the readout pad rows the dedx resolution for the ild international large detector tpc for the international linear collider experiment is expected to have high resolution for clear identification the dedx resolution of ... | [['the', 'time', 'projection', 'chamber', 'tpc', 'can', 'identify', 'particle', 'species', 'using', 'the', 'energy', 'loss', 'dedx', 'measured', 'by', 'the', 'readout', 'pad', 'rows', 'the', 'dedx', 'resolution', 'for', 'the', 'ild', 'international', 'large', 'detector', 'tpc', 'for', 'the', 'international', 'linear', ... | [-0.06538841634034372, 0.12817975749407917, -0.06905645774754364, -0.004979102384522249, 0.006411366072321727, -0.1623577715690471, -0.016754090153873892, 0.3999440432333749, -0.22662872629608644, -0.38085050000385806, 0.05219286501653923, -0.3433442085919794, 0.07906111690007951, 0.16879956864401668, -0.01269016880542... |
1,801.045 | A forcing relation of braids from Nielsen fixed point theory | In this paper, we focus our attention on the connections between the braid
group and the Nielsen fixed point theory. A new forcing relation between braids
is introduced, and shown that it can be fulfilled by using Nielsen fixed point
theory.
| math.AT | in this paper we focus our attention on the connections between the braid group and the nielsen fixed point theory a new forcing relation between braids is introduced and shown that it can be fulfilled by using nielsen fixed point theory | [['in', 'this', 'paper', 'we', 'focus', 'our', 'attention', 'on', 'the', 'connections', 'between', 'the', 'braid', 'group', 'and', 'the', 'nielsen', 'fixed', 'point', 'theory', 'a', 'new', 'forcing', 'relation', 'between', 'braids', 'is', 'introduced', 'and', 'shown', 'that', 'it', 'can', 'be', 'fulfilled', 'by', 'usin... | [-0.13475422508639806, 0.15111071693642839, -0.14365281646208064, 0.07937302513093483, -0.06861798420957313, -0.1622600444910548, 0.13353561805050093, 0.3347257556530034, -0.2854856852805469, -0.29034649987318895, 0.033009154355812184, -0.24576049493398608, -0.2750603800139776, 0.1646481551139093, -0.1401537009969172, ... |
1,801.04501 | Extinction and coming down from infinity of CB-processes with
competition in a L\'evy environment | In this note, we are interested on the event of extinction and the property
of coming down from infinity of continuous state branching (or CB for short)
processes with competition in a L\'evy environment whose branching mechanism
satisfies the so-called Grey's condition. In particular, we deduce, under the
assumption... | math.PR | in this note we are interested on the event of extinction and the property of coming down from infinity of continuous state branching or cb for short processes with competition in a levy environment whose branching mechanism satisfies the socalled greys condition in particular we deduce under the assumption that the le... | [['in', 'this', 'note', 'we', 'are', 'interested', 'on', 'the', 'event', 'of', 'extinction', 'and', 'the', 'property', 'of', 'coming', 'down', 'from', 'infinity', 'of', 'continuous', 'state', 'branching', 'or', 'cb', 'for', 'short', 'processes', 'with', 'competition', 'in', 'a', 'levy', 'environment', 'whose', 'branchi... | [-0.10131976195279815, 0.17703427459469145, -0.12030192552441635, 0.06902971198037777, -0.06414261179947361, -0.1345407597134946, 0.10576397406787026, 0.35407534384495126, -0.31817199072810176, -0.17902343895900802, 0.15509477741632266, -0.25698605567677735, -0.09610841194042917, 0.1281830461206126, -0.0660722319164576... |
1,801.04502 | Saturated configuration and new large construction of equiangular lines | A set of lines through the origin in Euclidean space is called equiangular
when any pair of lines from the set intersects with each other at a common
angle. We study the maximum size of equiangular lines in Euclidean space and
use graph theoretic approach to prove that all the currently known construction
for maximum... | math.CO | a set of lines through the origin in euclidean space is called equiangular when any pair of lines from the set intersects with each other at a common angle we study the maximum size of equiangular lines in euclidean space and use graph theoretic approach to prove that all the currently known construction for maximum eq... | [['a', 'set', 'of', 'lines', 'through', 'the', 'origin', 'in', 'euclidean', 'space', 'is', 'called', 'equiangular', 'when', 'any', 'pair', 'of', 'lines', 'from', 'the', 'set', 'intersects', 'with', 'each', 'other', 'at', 'a', 'common', 'angle', 'we', 'study', 'the', 'maximum', 'size', 'of', 'equiangular', 'lines', 'in'... | [-0.16853636029427724, 0.0894756461050184, 0.10551979770839569, 0.002044028566507179, -0.04193164248551641, -0.17634924035888935, 0.08307891016981254, 0.43552362852330717, -0.18494158298874805, -0.2710929087821453, 0.05382299328976799, -0.3487406402441954, -0.04452524674938075, 0.1554401140024383, -0.05972365668368718,... |
1,801.04503 | Multivariate LSTM-FCNs for Time Series Classification | Over the past decade, multivariate time series classification has received
great attention. We propose transforming the existing univariate time series
classification models, the Long Short Term Memory Fully Convolutional Network
(LSTM-FCN) and Attention LSTM-FCN (ALSTM-FCN), into a multivariate time series
classific... | cs.LG stat.ML | over the past decade multivariate time series classification has received great attention we propose transforming the existing univariate time series classification models the long short term memory fully convolutional network lstmfcn and attention lstmfcn alstmfcn into a multivariate time series classification model b... | [['over', 'the', 'past', 'decade', 'multivariate', 'time', 'series', 'classification', 'has', 'received', 'great', 'attention', 'we', 'propose', 'transforming', 'the', 'existing', 'univariate', 'time', 'series', 'classification', 'models', 'the', 'long', 'short', 'term', 'memory', 'fully', 'convolutional', 'network', '... | [-0.0594905367032403, -0.04361891884001948, -0.03974093750917486, 0.03770962580151501, -0.099865541895408, -0.2235298406953613, -0.00451026786384838, 0.4618734259047501, -0.28177025045955645, -0.3098425948194095, 0.1519894023370441, -0.2183415773812504, -0.1836151893760654, 0.19927251265339907, -0.10588999659798684, 0.... |
1,801.04504 | Non-Orthogonal Multiple Access for mmWave Drone Networks with Limited
Feedback | Unmanned aerial vehicle (UAV) base stations (BSs) can be a promising solution
to provide connectivity and quality of service (QoS) guarantees during
temporary events and after disasters. In this paper, we consider a scenario
where UAV-BSs are serving large number of mobile users in a hot spot area
(e.g., in a stadium... | cs.IT math.IT | unmanned aerial vehicle uav base stations bss can be a promising solution to provide connectivity and quality of service qos guarantees during temporary events and after disasters in this paper we consider a scenario where uavbss are serving large number of mobile users in a hot spot area eg in a stadium we introduce n... | [['unmanned', 'aerial', 'vehicle', 'uav', 'base', 'stations', 'bss', 'can', 'be', 'a', 'promising', 'solution', 'to', 'provide', 'connectivity', 'and', 'quality', 'of', 'service', 'qos', 'guarantees', 'during', 'temporary', 'events', 'and', 'after', 'disasters', 'in', 'this', 'paper', 'we', 'consider', 'a', 'scenario',... | [-0.24341589382092935, 0.027988229431211948, -0.00807109309709631, 0.03393419227882987, -0.08921580805676058, -0.2139443976513576, 0.16214372275688219, 0.4378106600604951, -0.2412878098525107, -0.29358811300247906, 0.05163610149349552, -0.2555979928537272, -0.13019573339319324, 0.1573468415858224, -0.12495410670308046,... |
1,801.04505 | Temporal scaling of the growth dependent radiative properties of
microalgae | The radiative properties of microalgae are basic parameters for analyzing
light field distribution in photobioreactors (PBRs). With the growth of
microalgae cell, their radiative properties will vary with growth time due to
accumulation of pigment and lipid, cell division and metabolism. In this work,
we report both ... | physics.bio-ph | the radiative properties of microalgae are basic parameters for analyzing light field distribution in photobioreactors pbrs with the growth of microalgae cell their radiative properties will vary with growth time due to accumulation of pigment and lipid cell division and metabolism in this work we report both experimen... | [['the', 'radiative', 'properties', 'of', 'microalgae', 'are', 'basic', 'parameters', 'for', 'analyzing', 'light', 'field', 'distribution', 'in', 'photobioreactors', 'pbrs', 'with', 'the', 'growth', 'of', 'microalgae', 'cell', 'their', 'radiative', 'properties', 'will', 'vary', 'with', 'growth', 'time', 'due', 'to', 'a... | [-0.07167970599751187, 0.17270242089573382, -0.07006251767401306, 0.03108225092821494, -0.01074131466095199, -0.0877740247190546, 0.014462529855970099, 0.402717062848139, -0.23885119912519132, -0.30228202120882075, 0.07863730664742379, -0.2652187767985908, -0.11433231399915406, 0.19531920820946908, 0.013542046320240645... |
1,801.04506 | Random projections in gravitational wave searches of compact binaries | Random projection (RP) is a powerful dimension reduction technique widely
used in the analysis of high dimensional data. We demonstrate how this
technique can be used to improve the computational efficiency of gravitational
wave searches from compact binaries of neutron stars or black holes.
Improvements in low-frequ... | gr-qc astro-ph.CO | random projection rp is a powerful dimension reduction technique widely used in the analysis of high dimensional data we demonstrate how this technique can be used to improve the computational efficiency of gravitational wave searches from compact binaries of neutron stars or black holes improvements in lowfrequency re... | [['random', 'projection', 'rp', 'is', 'a', 'powerful', 'dimension', 'reduction', 'technique', 'widely', 'used', 'in', 'the', 'analysis', 'of', 'high', 'dimensional', 'data', 'we', 'demonstrate', 'how', 'this', 'technique', 'can', 'be', 'used', 'to', 'improve', 'the', 'computational', 'efficiency', 'of', 'gravitational'... | [-0.08041577306197724, 0.061813352842145834, -0.06578300166060216, 0.11160978591942694, -0.11535977352876216, -0.10912571679335087, 0.06195106727071106, 0.35791788037866357, -0.22434722058475018, -0.33298489965032785, 0.10678156292822677, -0.2672106685966719, -0.12617780024302191, 0.22853629804681985, -0.08289538201293... |
1,801.04507 | Schwarz type lemma, Landau type theorem and Lipschitz type space of
solutions to biharmonic equations | The purpose of this paper is to study the properties of the solutions to the
biharmonic equations: $\Delta(\Delta f)=g$, where $g:$
$\overline{\mathbb{D}}\rightarrow\mathbb{C}$ is a continuous function and
$\overline{\mathbb{D}}$ denotes the closure of the unit disk $\mathbb{D}$ in
the complex plane $\mathbb{C}$. In ... | math.CV | the purpose of this paper is to study the properties of the solutions to the biharmonic equations deltadelta fg where g overlinemathbbdrightarrowmathbbc is a continuous function and overlinemathbbd denotes the closure of the unit disk mathbbd in the complex plane mathbbc in fact we establish the following properties fo... | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'study', 'the', 'properties', 'of', 'the', 'solutions', 'to', 'the', 'biharmonic', 'equations', 'deltadelta', 'fg', 'where', 'g', 'overlinemathbbdrightarrowmathbbc', 'is', 'a', 'continuous', 'function', 'and', 'overlinemathbbd', 'denotes', 'the', 'closure', 'of', '... | [-0.16519569757541544, 0.008895828468283932, -0.06202288882463778, 0.06620703693509936, -0.10236172241428376, -0.05507592559105864, 0.03904437993218093, 0.33640345681066575, -0.32529773655053423, -0.16923236599388092, 0.10120853408864748, -0.2594168202087626, -0.17626202414670078, 0.18900972344348893, -0.09934692567606... |
1,801.04508 | Voltage Control of DC Islanded Microgrids: Scalable Decentralised L1
Adaptive Controllers | Voltage stability is a critical feature of an efficiently operating power
distribution system such as a DC islanded microgrid. Large-scale autonomous
power systems can be defined by heterogeneous elements, uncertainty and
changing conditions. This paper proposes a novel scalable decentralised control
scheme at the pr... | cs.SY | voltage stability is a critical feature of an efficiently operating power distribution system such as a dc islanded microgrid largescale autonomous power systems can be defined by heterogeneous elements uncertainty and changing conditions this paper proposes a novel scalable decentralised control scheme at the primary ... | [['voltage', 'stability', 'is', 'a', 'critical', 'feature', 'of', 'an', 'efficiently', 'operating', 'power', 'distribution', 'system', 'such', 'as', 'a', 'dc', 'islanded', 'microgrid', 'largescale', 'autonomous', 'power', 'systems', 'can', 'be', 'defined', 'by', 'heterogeneous', 'elements', 'uncertainty', 'and', 'chang... | [-0.2625008699508678, 0.027488465462030084, -0.009321241558676488, -0.048615655527254074, -0.07002878889784608, -0.2356532391136218, 0.05583919907466656, 0.39961856782044236, -0.3014833115727494, -0.33587358767951003, 0.1316924265297865, -0.16854117741213964, -0.13389511266447554, 0.2200994255437859, -0.146441146440951... |
1,801.04509 | Admissible sequences for positive operators | A sequence of scalars is said to be admissible for a positive operator A on a
Hilbert space if it is the diagonal of VAV* for some partial isometry V having
as domain the closure of the range of A. When A is a projection, the celebrated
Kadison's carpenter theorem provides a sufficient condition for a sequence to
be ... | math.OA | a sequence of scalars is said to be admissible for a positive operator a on a hilbert space if it is the diagonal of vav for some partial isometry v having as domain the closure of the range of a when a is a projection the celebrated kadisons carpenter theorem provides a sufficient condition for a sequence to be admiss... | [['a', 'sequence', 'of', 'scalars', 'is', 'said', 'to', 'be', 'admissible', 'for', 'a', 'positive', 'operator', 'a', 'on', 'a', 'hilbert', 'space', 'if', 'it', 'is', 'the', 'diagonal', 'of', 'vav', 'for', 'some', 'partial', 'isometry', 'v', 'having', 'as', 'domain', 'the', 'closure', 'of', 'the', 'range', 'of', 'a', 'w... | [-0.14885088934430055, 0.11133490596575382, -0.1381171895476172, 0.06508491395934655, -0.10078859258899275, -0.10926201726233929, 0.0317471609581547, 0.3236673750287416, -0.3017327953130007, -0.17127375011997564, 0.17144613693900673, -0.21829665195653025, -0.09842321722131527, 0.21529196052602967, -0.10824346583697717,... |
1,801.0451 | Brain EEG Time Series Selection: A Novel Graph-Based Approach for
Classification | Brain Electroencephalography (EEG) classification is widely applied to
analyze cerebral diseases in recent years. Unfortunately, invalid/noisy EEGs
degrade the diagnosis performance and most previously developed methods ignore
the necessity of EEG selection for classification. To this end, this paper
proposes a novel... | cs.LG q-bio.NC stat.ML | brain electroencephalography eeg classification is widely applied to analyze cerebral diseases in recent years unfortunately invalidnoisy eegs degrade the diagnosis performance and most previously developed methods ignore the necessity of eeg selection for classification to this end this paper proposes a novel maximum ... | [['brain', 'electroencephalography', 'eeg', 'classification', 'is', 'widely', 'applied', 'to', 'analyze', 'cerebral', 'diseases', 'in', 'recent', 'years', 'unfortunately', 'invalidnoisy', 'eegs', 'degrade', 'the', 'diagnosis', 'performance', 'and', 'most', 'previously', 'developed', 'methods', 'ignore', 'the', 'necessi... | [-0.037021820534477536, -0.057353235582270845, -0.04183392730137368, 0.05511205763674675, -0.157999753192032, -0.23082040921995803, 0.051592121789240684, 0.4468885762089828, -0.22442228095452213, -0.2960254506225575, 0.060851090590970346, -0.2960940428816204, -0.24573523964170577, 0.17616988030890496, -0.18293596224481... |
1,801.04511 | Regularity of Desingularised Models for Vortex Filaments in
Incompressible Viscous Flows: A Geometrical Approach | We establish the regularity of weak solutions for the vorticity equation
associated to a family of desingularised models for vortex filament dynamics in
3D incompressible viscous flows. These include and generalise the classical
model "of an allowance for the thickness of the vortices" due to Louis
Rosenhead in 1930.... | math.AP | we establish the regularity of weak solutions for the vorticity equation associated to a family of desingularised models for vortex filament dynamics in 3d incompressible viscous flows these include and generalise the classical model of an allowance for the thickness of the vortices due to louis rosenhead in 1930 our a... | [['we', 'establish', 'the', 'regularity', 'of', 'weak', 'solutions', 'for', 'the', 'vorticity', 'equation', 'associated', 'to', 'a', 'family', 'of', 'desingularised', 'models', 'for', 'vortex', 'filament', 'dynamics', 'in', '3d', 'incompressible', 'viscous', 'flows', 'these', 'include', 'and', 'generalise', 'the', 'cla... | [-0.1399372309159774, 0.06120431538214549, -0.08704560570991957, 0.0949560691190597, -0.0510357301753874, -0.06726173262040203, -0.05836325826553198, 0.27925012891109174, -0.30115898913488937, -0.24198666550219058, 0.09584124584395726, -0.26750108344623674, -0.11530832866063485, 0.22945311694549253, -0.0678228121967269... |
1,801.04512 | Boundary Regularity for Asymptotically Hyperbolic Metrics with Smooth
Weyl Curvature | In this paper, we study the regularity of asymptotically hyperbolic metrics
with Einstein condition near boundary and Weyl curvature smooth enough in
arbitrary dimension. Following Michael Anderson's method, we show that
$C^{m,\alpha}$ conformally compact Riemannian metrics with Einstein equation
vanishing to finite ... | math.DG | in this paper we study the regularity of asymptotically hyperbolic metrics with einstein condition near boundary and weyl curvature smooth enough in arbitrary dimension following michael andersons method we show that cmalpha conformally compact riemannian metrics with einstein equation vanishing to finite order near bo... | [['in', 'this', 'paper', 'we', 'study', 'the', 'regularity', 'of', 'asymptotically', 'hyperbolic', 'metrics', 'with', 'einstein', 'condition', 'near', 'boundary', 'and', 'weyl', 'curvature', 'smooth', 'enough', 'in', 'arbitrary', 'dimension', 'following', 'michael', 'andersons', 'method', 'we', 'show', 'that', 'cmalpha... | [-0.19382874759427016, 0.1404269392824853, -0.06683147968589395, 0.03297938652964228, -0.1295784024818652, -0.21890356154113577, -0.10063519425845395, 0.3543668890884821, -0.17353165279264035, -0.19408656076352665, 0.1410024351798052, -0.3113733953863814, -0.19128422654382343, 0.12446887040024866, -0.1575352589775255, ... |
1,801.04513 | Neutrinoless Double Beta Decay with $^{82}$SeF$_6$ and Direct Ion
Imaging | We present a new neutrinoless double beta decay concept: the high pressure
selenium hexafluoride gas time projection chamber. Combining techniques
pioneered in high pressure xenon gas such as topological discrimination, with
the high Q-value afforded by double beta decay isotope $^{82}$Se, a promising
new detection t... | physics.ins-det hep-ex | we present a new neutrinoless double beta decay concept the high pressure selenium hexafluoride gas time projection chamber combining techniques pioneered in high pressure xenon gas such as topological discrimination with the high qvalue afforded by double beta decay isotope 82se a promising new detection technique is ... | [['we', 'present', 'a', 'new', 'neutrinoless', 'double', 'beta', 'decay', 'concept', 'the', 'high', 'pressure', 'selenium', 'hexafluoride', 'gas', 'time', 'projection', 'chamber', 'combining', 'techniques', 'pioneered', 'in', 'high', 'pressure', 'xenon', 'gas', 'such', 'as', 'topological', 'discrimination', 'with', 'th... | [-0.0009683773782394758, 0.2101693268270721, -0.03195994964014705, 0.06691691206625039, 0.011909282868813485, -0.1691706716745169, 0.03810210159227867, 0.34690615551870896, -0.2427745289340137, -0.33776891532294245, 0.057531777838749146, -0.31854291516569777, 0.023912630411326338, 0.2273978246819151, -0.002521858608548... |
1,801.04514 | Nonequilibrium limit cycle oscillators: fluctuations in hair bundle
dynamics | We develop a framework for the general interpretation of the stochastic
dynamical system near a limit cycle. Such quasi-periodic dynamics are commonly
found in a variety of nonequilibrium systems, including the spontaneous
oscillations of hair cells in the inner ear. We demonstrate quite generally
that in the presenc... | cond-mat.stat-mech physics.bio-ph | we develop a framework for the general interpretation of the stochastic dynamical system near a limit cycle such quasiperiodic dynamics are commonly found in a variety of nonequilibrium systems including the spontaneous oscillations of hair cells in the inner ear we demonstrate quite generally that in the presence of n... | [['we', 'develop', 'a', 'framework', 'for', 'the', 'general', 'interpretation', 'of', 'the', 'stochastic', 'dynamical', 'system', 'near', 'a', 'limit', 'cycle', 'such', 'quasiperiodic', 'dynamics', 'are', 'commonly', 'found', 'in', 'a', 'variety', 'of', 'nonequilibrium', 'systems', 'including', 'the', 'spontaneous', 'o... | [-0.16339198984057893, 0.15736494602502457, -0.07922576119502385, 0.06680209063629192, -0.014183379451019896, -0.09378666323258557, 0.04754921181925705, 0.33937454347809154, -0.26330825454409473, -0.24635569083075676, 0.12277261030283712, -0.24653279632773428, -0.20636313390134584, 0.2142618295130512, -0.06827374211512... |
1,801.04515 | Solving constraint-satisfaction problems with distributed
neocortical-like neuronal networks | Finding actions that satisfy the constraints imposed by both external inputs
and internal representations is central to decision making. We demonstrate that
some important classes of constraint satisfaction problems (CSPs) can be solved
by networks composed of homogeneous cooperative-competitive modules that have
con... | q-bio.NC | finding actions that satisfy the constraints imposed by both external inputs and internal representations is central to decision making we demonstrate that some important classes of constraint satisfaction problems csps can be solved by networks composed of homogeneous cooperativecompetitive modules that have connectiv... | [['finding', 'actions', 'that', 'satisfy', 'the', 'constraints', 'imposed', 'by', 'both', 'external', 'inputs', 'and', 'internal', 'representations', 'is', 'central', 'to', 'decision', 'making', 'we', 'demonstrate', 'that', 'some', 'important', 'classes', 'of', 'constraint', 'satisfaction', 'problems', 'csps', 'can', '... | [-0.13893714059410509, 0.08248164435697086, -0.030981676191822335, 0.06030740752887498, -0.12691435660792594, -0.18506370096926414, 0.0575273455517215, 0.40223917294667955, -0.33111229317004315, -0.3131384754901012, 0.0990849166922494, -0.23422168173976787, -0.21839674210630394, 0.16649166141908492, -0.0753889641763239... |
1,801.04516 | Rashba-driven anomalous Nernst conductivity of lead chalcogenide films | The presence of a finite Berry curvature $\left(\Omega\left(k\right)\right)$
leads to anomalous thermal effects. In this letter, we compute the coefficients
for the anomalous Nernst effect $\left(ANE\right) $ and its spin analogue, the
spin Nernst effect $\left(SNE\right)$ in lead chalcogenide (\textit{PbX};
\textit{... | cond-mat.mtrl-sci cond-mat.mes-hall | the presence of a finite berry curvature leftomegaleftkrightright leads to anomalous thermal effects in this letter we compute the coefficients for the anomalous nernst effect leftaneright and its spin analogue the spin nernst effect leftsneright in lead chalcogenide textitpbx textitx s se te films the narrow gapped te... | [['the', 'presence', 'of', 'a', 'finite', 'berry', 'curvature', 'leftomegaleftkrightright', 'leads', 'to', 'anomalous', 'thermal', 'effects', 'in', 'this', 'letter', 'we', 'compute', 'the', 'coefficients', 'for', 'the', 'anomalous', 'nernst', 'effect', 'leftaneright', 'and', 'its', 'spin', 'analogue', 'the', 'spin', 'n... | [-0.1915160220976966, 0.19889786181029426, -0.04599195809245015, 0.035209161670778324, -0.09226740407020655, -0.1391102607580067, 0.07355693997181598, 0.36556525238424165, -0.26916380625076686, -0.276470846543678, 0.011116612828601906, -0.2890884824615868, -0.1345786217664946, 0.22750820320606516, -0.011270164124537966... |
1,801.04517 | Polynomial stability of exact solution and a numerical method for
stochastic differential equations with time-dependent delay | Polynomial stability of exact solution and modified truncated Euler-Maruyama
method for stochastic differential equations with time-dependent delay are
investigated in this paper. By using the well known discrete semimartingale
convergence theorem, sufficient conditions are obtained for both bounded and
unbounded del... | math.PR | polynomial stability of exact solution and modified truncated eulermaruyama method for stochastic differential equations with timedependent delay are investigated in this paper by using the well known discrete semimartingale convergence theorem sufficient conditions are obtained for both bounded and unbounded delay del... | [['polynomial', 'stability', 'of', 'exact', 'solution', 'and', 'modified', 'truncated', 'eulermaruyama', 'method', 'for', 'stochastic', 'differential', 'equations', 'with', 'timedependent', 'delay', 'are', 'investigated', 'in', 'this', 'paper', 'by', 'using', 'the', 'well', 'known', 'discrete', 'semimartingale', 'conve... | [-0.11359325136054087, -0.011528602353360314, -0.04415021664699761, 0.10853609862397977, -0.05426168617382014, -0.15750991014795282, -0.002036390098017025, 0.348143256348321, -0.3224309823333712, -0.26582793416297534, 0.18371577671989484, -0.20834818053043494, -0.1597997820146887, 0.2118004598197038, -0.092917826784364... |
1,801.04518 | Plasmonic instabilities and terahertz waves amplification in graphene
metamaterials | Plasmon oscillations have been intensively studied for more than forty years
in conventional two-dimensional electron gas systems in order to find new
alternatives to the vacuum devices based on the Smith-Purcell effect in the
far-infrared region. However, beside the multiple endeavors, up to date, the
plasmon genera... | physics.app-ph cond-mat.mes-hall | plasmon oscillations have been intensively studied for more than forty years in conventional twodimensional electron gas systems in order to find new alternatives to the vacuum devices based on the smithpurcell effect in the farinfrared region however beside the multiple endeavors up to date the plasmon generation in s... | [['plasmon', 'oscillations', 'have', 'been', 'intensively', 'studied', 'for', 'more', 'than', 'forty', 'years', 'in', 'conventional', 'twodimensional', 'electron', 'gas', 'systems', 'in', 'order', 'to', 'find', 'new', 'alternatives', 'to', 'the', 'vacuum', 'devices', 'based', 'on', 'the', 'smithpurcell', 'effect', 'in'... | [-0.14250381783505403, 0.16429379914446376, 0.0035967143435191593, 0.023310064209478076, -0.0537665011845841, -0.1260217609146886, 0.0568311002682538, 0.4594016364468128, -0.21498614620934262, -0.33994434468011464, 0.010412401816602707, -0.29607528840017877, -0.11206480598441464, 0.28131345850772016, -0.022189786358715... |
1,801.04519 | Linear maps preserve the covariance sets | Let $\mathcal{A}$ and $\mathcal{B}$\ are $C^{{\huge \ast}}%
$-algebras\textbf{.} A\textbf{ }linear map $\phi:\mathcal{A\rightarrow B}$ is
$C^{\ast}$-Jordan homomorphism if it is a Jordan homomorphism which preserves
the adjoint operation. In this note we show that $C^{\ast}$-Jordan
homomorphisms -- under mild assumpt... | math.FA | let mathcala and mathcalb are chuge ast algebrastextbf atextbf linear map phimathcalarightarrow b is castjordan homomorphism if it is a jordan homomorphism which preserves the adjoint operation in this note we show that castjordan homomorphisms under mild assumptions preserving covariance set and covariance coset in ca... | [['let', 'mathcala', 'and', 'mathcalb', 'are', 'chuge', 'ast', 'algebrastextbf', 'atextbf', 'linear', 'map', 'phimathcalarightarrow', 'b', 'is', 'castjordan', 'homomorphism', 'if', 'it', 'is', 'a', 'jordan', 'homomorphism', 'which', 'preserves', 'the', 'adjoint', 'operation', 'in', 'this', 'note', 'we', 'show', 'that',... | [-0.1667811932391487, 0.07057672801893204, -0.07672503406647593, 0.004235166046419181, -0.1311027866555378, -0.19537528365617618, -0.03813505694270134, 0.4282980700023472, -0.4476094466168433, -0.11987237283028662, 0.13973700894857757, -0.2514776953496039, -0.14103781336452811, 0.08204070972278714, -0.21427107935305684... |
1,801.0452 | Non-Parametric Transformation Networks | ConvNets, through their architecture, only enforce invariance to translation.
In this paper, we introduce a new class of deep convolutional architectures
called Non-Parametric Transformation Networks (NPTNs) which can learn
\textit{general} invariances and symmetries directly from data. NPTNs are a
natural generaliza... | cs.CV cs.AI cs.LG | convnets through their architecture only enforce invariance to translation in this paper we introduce a new class of deep convolutional architectures called nonparametric transformation networks nptns which can learn textitgeneral invariances and symmetries directly from data nptns are a natural generalization of convn... | [['convnets', 'through', 'their', 'architecture', 'only', 'enforce', 'invariance', 'to', 'translation', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'class', 'of', 'deep', 'convolutional', 'architectures', 'called', 'nonparametric', 'transformation', 'networks', 'nptns', 'which', 'can', 'learn', 'textitgeneral... | [-0.03412267061728126, 0.026862355036885326, -0.09296845810497618, 0.08047789198112386, -0.11342479608933495, -0.17358302416679747, 0.006134628376153088, 0.48112601933132915, -0.26517850216185546, -0.31198677161698724, 0.08480289210114356, -0.23546091080472575, -0.24618069313866384, 0.1862852542474622, -0.1072517238089... |
1,801.04521 | Analytical Design of Printed-Circuit-Board (PCB) Metagratings for
Perfect Anomalous Reflection | We present an analytical scheme for the design of realistic metagratings for
wide-angle engineered reflection. These recently proposed planar structures can
reflect an incident plane wave into a prescribed (generally non-specular) angle
with very high efficiencies, using only a single meta-atom per period. Such
devic... | physics.app-ph | we present an analytical scheme for the design of realistic metagratings for wideangle engineered reflection these recently proposed planar structures can reflect an incident plane wave into a prescribed generally nonspecular angle with very high efficiencies using only a single metaatom per period such devices offer a... | [['we', 'present', 'an', 'analytical', 'scheme', 'for', 'the', 'design', 'of', 'realistic', 'metagratings', 'for', 'wideangle', 'engineered', 'reflection', 'these', 'recently', 'proposed', 'planar', 'structures', 'can', 'reflect', 'an', 'incident', 'plane', 'wave', 'into', 'a', 'prescribed', 'generally', 'nonspecular',... | [-0.135705440590424, 0.07197614510120977, -0.03283141762949526, -0.04608384179763644, -0.12701116185450123, -0.1830469904467794, 0.07307587868556518, 0.4592655170814727, -0.2112703546206996, -0.33151918911607936, 0.04390826133352344, -0.20750666644554175, -0.1255809852869292, 0.2600478240069192, -0.056172344703968105, ... |
1,801.04522 | Discrete Boltzmann trans-scale modeling of high-speed compressible flows | We present a general framework for constructing trans-scale \emph{discrete
Boltzmann models} (DBMs) for high-speed compressible flows ranging from
continuum to transition regime. This is achieved by designing a higher-order
discrete equilibrium distribution function which satisfies additional
nonhydrodynamic kinetic ... | physics.flu-dyn physics.comp-ph | we present a general framework for constructing transscale emphdiscrete boltzmann models dbms for highspeed compressible flows ranging from continuum to transition regime this is achieved by designing a higherorder discrete equilibrium distribution function which satisfies additional nonhydrodynamic kinetic moments in ... | [['we', 'present', 'a', 'general', 'framework', 'for', 'constructing', 'transscale', 'emphdiscrete', 'boltzmann', 'models', 'dbms', 'for', 'highspeed', 'compressible', 'flows', 'ranging', 'from', 'continuum', 'to', 'transition', 'regime', 'this', 'is', 'achieved', 'by', 'designing', 'a', 'higherorder', 'discrete', 'equ... | [-0.08954310678527691, 0.12506202157237567, -0.08217868352476217, 0.10749793720242451, -0.026354815694503486, -0.14392317069577984, 0.02976538323418936, 0.3026822863044799, -0.27569200871512295, -0.3139683215646073, 0.05633697355951881, -0.24589914440584834, -0.07539304494894168, 0.161769921288942, 0.005336962718865834... |
1,801.04523 | Shrink or Substitute: Handling Process Failures in HPC Systems using
In-situ Recovery | Efficient utilization of today's high-performance computing (HPC) systems
with complex hardware and software components requires that the HPC
applications are designed to tolerate process failures at runtime. With low
mean time to failure (MTTF) of current and future HPC systems, long running
simulations on these sys... | cs.DC | efficient utilization of todays highperformance computing hpc systems with complex hardware and software components requires that the hpc applications are designed to tolerate process failures at runtime with low mean time to failure mttf of current and future hpc systems long running simulations on these systems requi... | [['efficient', 'utilization', 'of', 'todays', 'highperformance', 'computing', 'hpc', 'systems', 'with', 'complex', 'hardware', 'and', 'software', 'components', 'requires', 'that', 'the', 'hpc', 'applications', 'are', 'designed', 'to', 'tolerate', 'process', 'failures', 'at', 'runtime', 'with', 'low', 'mean', 'time', 't... | [-0.16078857208528305, 0.04783703904973752, -0.02297664783105663, 0.02116936502999102, -0.07707991444636364, -0.17174173292431344, 0.05041181564646228, 0.40575187214332203, -0.261027186663208, -0.31626456941012293, 0.16377503489905104, -0.2144712860519975, -0.13713619942640567, 0.18801410834123267, -0.1206296871603671,... |
1,801.04524 | Probing Episodic Accretion in Very Low Luminosity Objects | Episodic accretion has been proposed as a solution to the long-standing
luminosity problem in star formation; however, the process remains poorly
understood. We present observations of line emission from N2H+ and CO
isotopologues using the Atacama Large Millimeter/submillimeter Array (ALMA) in
the envelopes of eight ... | astro-ph.GA | episodic accretion has been proposed as a solution to the longstanding luminosity problem in star formation however the process remains poorly understood we present observations of line emission from n2h and co isotopologues using the atacama large millimetersubmillimeter array alma in the envelopes of eight very low l... | [['episodic', 'accretion', 'has', 'been', 'proposed', 'as', 'a', 'solution', 'to', 'the', 'longstanding', 'luminosity', 'problem', 'in', 'star', 'formation', 'however', 'the', 'process', 'remains', 'poorly', 'understood', 'we', 'present', 'observations', 'of', 'line', 'emission', 'from', 'n2h', 'and', 'co', 'isotopolog... | [-0.03825129473852754, 0.08454632359171971, 0.015286677235699429, 0.06416966550659338, -0.043698720053332495, -0.055195939561770276, 0.03159048964687604, 0.4657396564982375, -0.1404944439697773, -0.3263691358724419, 0.0933408938258012, -0.30743256828614646, -0.01553603252871152, 0.14640422905106287, -0.0010201453853740... |
1,801.04525 | Covariance in the Batalin-Vilkovisky formalism and the Maurer-Cartan
equation for curved Lie algebras | We express covariance of the Batalin-Vilkovisky formalism in classical
mechanics by means of the Maurer-Cartan equation in a curved Lie superalgebra,
defined using the formal variational calculus and Sullivan's Thom-Whitney
construction. We use this framework to construct a Batalin-Vilkovisky canonical
transformation... | math-ph hep-th math.MP | we express covariance of the batalinvilkovisky formalism in classical mechanics by means of the maurercartan equation in a curved lie superalgebra defined using the formal variational calculus and sullivans thomwhitney construction we use this framework to construct a batalinvilkovisky canonical transformation identify... | [['we', 'express', 'covariance', 'of', 'the', 'batalinvilkovisky', 'formalism', 'in', 'classical', 'mechanics', 'by', 'means', 'of', 'the', 'maurercartan', 'equation', 'in', 'a', 'curved', 'lie', 'superalgebra', 'defined', 'using', 'the', 'formal', 'variational', 'calculus', 'and', 'sullivans', 'thomwhitney', 'construc... | [-0.09912432052240344, 0.013540226511530043, -0.1341303424840724, 0.11014860970856345, -0.19551043545275373, -0.10635526664555073, -0.07242156347234009, 0.29713151520721753, -0.3391034620710545, -0.2810053077733351, -0.00424235701535104, -0.1515798384875611, -0.25216350583704533, 0.08828474254631954, -0.181681344630541... |
1,801.04526 | The Nuclear Contact Formalism - the Deuteron Channel | The contact formalism, devised to elucidate the important role of short-range
correlations, was recently generalized for systems with coupled channels, such
as the deuteron channel, where s and d waves are coupled into a $J=1$ state.
The coupling of the two channels implies two independent asymptotic solutions
and re... | nucl-th cond-mat.quant-gas nucl-ex physics.atm-clus physics.atom-ph | the contact formalism devised to elucidate the important role of shortrange correlations was recently generalized for systems with coupled channels such as the deuteron channel where s and d waves are coupled into a j1 state the coupling of the two channels implies two independent asymptotic solutions and results a 2x2... | [['the', 'contact', 'formalism', 'devised', 'to', 'elucidate', 'the', 'important', 'role', 'of', 'shortrange', 'correlations', 'was', 'recently', 'generalized', 'for', 'systems', 'with', 'coupled', 'channels', 'such', 'as', 'the', 'deuteron', 'channel', 'where', 's', 'and', 'd', 'waves', 'are', 'coupled', 'into', 'a', ... | [-0.17517540293200073, 0.15925906184646818, -0.08198248194248388, 0.09935422463700025, -0.007691452093892778, -0.18532786055496245, 0.007261692525141619, 0.3063763746747164, -0.2365559371884423, -0.24021220340797997, 0.052245264743558235, -0.2890240220879816, -0.12745312845917664, 0.12584013816891143, 0.105322006614784... |
1,801.04527 | The maximum diam theorem on Finsler manifolds | We prove that, for a Finsler space, if the weighted Ricci curvature is
bounded below by a positive number and the diam attains its maximal value, then
it is isometric to a standard Finsler sphere. As an application, we show that
the first eigenvalue of the Finsler-Laplacian attains its lower bound if and
only if the ... | math.DG | we prove that for a finsler space if the weighted ricci curvature is bounded below by a positive number and the diam attains its maximal value then it is isometric to a standard finsler sphere as an application we show that the first eigenvalue of the finslerlaplacian attains its lower bound if and only if the finsler ... | [['we', 'prove', 'that', 'for', 'a', 'finsler', 'space', 'if', 'the', 'weighted', 'ricci', 'curvature', 'is', 'bounded', 'below', 'by', 'a', 'positive', 'number', 'and', 'the', 'diam', 'attains', 'its', 'maximal', 'value', 'then', 'it', 'is', 'isometric', 'to', 'a', 'standard', 'finsler', 'sphere', 'as', 'an', 'applica... | [-0.12930483150442965, 0.08721510068809087, -0.06794887697814327, 0.08726051286641068, -0.15563845472704424, -0.13848557174941034, -0.020824685521227747, 0.36749315448105335, -0.2766673755096762, -0.20247576173738038, 0.17076652296696251, -0.32115416402168767, -0.18050353496188395, 0.18896517549690448, -0.1100818419730... |
1,801.04528 | Entropy Measures of Human Communication Dynamics | Human communication is commonly represented as a temporal social network, and
evaluated in terms of its uniqueness. We propose a set of new entropy-based
measures for human communication dynamics represented within the temporal
social network as event sequences. Using real world datasets and random
interaction series... | cs.SI physics.soc-ph | human communication is commonly represented as a temporal social network and evaluated in terms of its uniqueness we propose a set of new entropybased measures for human communication dynamics represented within the temporal social network as event sequences using real world datasets and random interaction series of di... | [['human', 'communication', 'is', 'commonly', 'represented', 'as', 'a', 'temporal', 'social', 'network', 'and', 'evaluated', 'in', 'terms', 'of', 'its', 'uniqueness', 'we', 'propose', 'a', 'set', 'of', 'new', 'entropybased', 'measures', 'for', 'human', 'communication', 'dynamics', 'represented', 'within', 'the', 'tempo... | [-0.11884300988709458, 0.08484424152357996, -0.05754851784300188, 0.10428519026729567, -0.04325068243725718, -0.10822432834153925, 0.05521287295121657, 0.4065984339378346, -0.27589430387035524, -0.3136933674372133, 0.027792187240349406, -0.2899345349943287, -0.256379000039707, 0.17835090026773256, -0.0956860230218662, ... |
1,801.04529 | Temperature control in dissipative cavities by entangled dimers | We show that the temperature of a cavity field can be drastically varied by
its interaction with suitably-entangled atom pairs (dimers) traversing the
cavity under realistic atomic decoherence. To this end we resort to the
hitherto untapped resource of naturally entangled dimers whose state can be
simply controlled v... | quant-ph | we show that the temperature of a cavity field can be drastically varied by its interaction with suitablyentangled atom pairs dimers traversing the cavity under realistic atomic decoherence to this end we resort to the hitherto untapped resource of naturally entangled dimers whose state can be simply controlled via mol... | [['we', 'show', 'that', 'the', 'temperature', 'of', 'a', 'cavity', 'field', 'can', 'be', 'drastically', 'varied', 'by', 'its', 'interaction', 'with', 'suitablyentangled', 'atom', 'pairs', 'dimers', 'traversing', 'the', 'cavity', 'under', 'realistic', 'atomic', 'decoherence', 'to', 'this', 'end', 'we', 'resort', 'to', '... | [-0.11576709749597403, 0.27978843189594516, -0.04526335852184369, 0.023544884221809736, -0.004280514283371823, -0.1962348137976142, 0.06766529868707641, 0.4320940623353175, -0.25161596866590635, -0.3104133307026675, 0.03301299096224225, -0.2626239923463965, -0.017271726944048393, 0.19410117078185468, 0.0129035216901306... |
1,801.0453 | A Bio-inspired Collision Detecotr for Small Quadcopter | Sense and avoid capability enables insects to fly versatilely and robustly in
dynamic complex environment. Their biological principles are so practical and
efficient that inspired we human imitating them in our flying machines. In this
paper, we studied a novel bio-inspired collision detector and its application
on a... | cs.NE cs.RO | sense and avoid capability enables insects to fly versatilely and robustly in dynamic complex environment their biological principles are so practical and efficient that inspired we human imitating them in our flying machines in this paper we studied a novel bioinspired collision detector and its application on a quadc... | [['sense', 'and', 'avoid', 'capability', 'enables', 'insects', 'to', 'fly', 'versatilely', 'and', 'robustly', 'in', 'dynamic', 'complex', 'environment', 'their', 'biological', 'principles', 'are', 'so', 'practical', 'and', 'efficient', 'that', 'inspired', 'we', 'human', 'imitating', 'them', 'in', 'our', 'flying', 'mach... | [-0.11418442691593281, 0.08199830203741655, -0.07830655134537003, 0.018320031188936395, -0.07500780649952121, -0.14503659048423798, -0.006263387528690998, 0.426555618200894, -0.2390026961375106, -0.32254661266672446, 0.06928098181969246, -0.2514356784962144, -0.2275541003767427, 0.2277530877723951, -0.13012743215532518... |
1,801.04531 | Regularity of stochastic nonlocal diffusion equations | In this paper, we are concerned with regularity of nonlocal stochastic
partial differential equations of parabolic type. By using Companato estimates
and Sobolev embedding theorem, we first show the H\"{o}lder continuity (locally
in the whole state space $\mathbb{R}^d$) for mild solutions of stochastic
nonlocal diffu... | math.PR | in this paper we are concerned with regularity of nonlocal stochastic partial differential equations of parabolic type by using companato estimates and sobolev embedding theorem we first show the holder continuity locally in the whole state space mathbbrd for mild solutions of stochastic nonlocal diffusion equations in... | [['in', 'this', 'paper', 'we', 'are', 'concerned', 'with', 'regularity', 'of', 'nonlocal', 'stochastic', 'partial', 'differential', 'equations', 'of', 'parabolic', 'type', 'by', 'using', 'companato', 'estimates', 'and', 'sobolev', 'embedding', 'theorem', 'we', 'first', 'show', 'the', 'holder', 'continuity', 'locally', ... | [-0.09775952870978999, 0.040167216540220055, -0.0805838928959259, 0.07742366188444737, -0.11247991947886093, -0.12207031669707871, 0.025244109194701242, 0.3625360612365368, -0.3218025576068995, -0.1899781088209956, 0.1542460793096229, -0.2805348562695527, -0.12227480305897954, 0.2115784190399082, -0.12174300072059084, ... |
1,801.04532 | A dimensional acceleration of gradient descent-like methods, using
persistent random walkers | Finding a local minimum or maximum of a function is often achieved through
the gradient-descent optimization method. For a function in dimension d, the
gradient requires to compute at each step d partial derivatives. This method is
for instance used in machine-learning, to fit the models parameters so as to
minimize ... | physics.comp-ph cond-mat.stat-mech | finding a local minimum or maximum of a function is often achieved through the gradientdescent optimization method for a function in dimension d the gradient requires to compute at each step d partial derivatives this method is for instance used in machinelearning to fit the models parameters so as to minimize the erro... | [['finding', 'a', 'local', 'minimum', 'or', 'maximum', 'of', 'a', 'function', 'is', 'often', 'achieved', 'through', 'the', 'gradientdescent', 'optimization', 'method', 'for', 'a', 'function', 'in', 'dimension', 'd', 'the', 'gradient', 'requires', 'to', 'compute', 'at', 'each', 'step', 'd', 'partial', 'derivatives', 'th... | [-0.060794403615293965, 0.05467232250114695, -0.09199225696398408, 0.04529898123006556, -0.06009764507622786, -0.13355670906078648, 0.06744630209130931, 0.4027295458937247, -0.31795098980617637, -0.31118849630384515, 0.12239932164794683, -0.21253073430825636, -0.15853830636724908, 0.19316103381319016, -0.05176797239388... |
1,801.04533 | Coupling between death spikes and birth troughs. Part 1: Evidence | In the wake of the influenza pandemic of 1889-1890 Jacques Bertillon, a
pioneer of medical statistics, noticed that after the massive death spike there
was a dip in birth numbers around 9 months later which was significantly larger
than that which could be explained by the population change as a result of
excess deat... | physics.soc-ph physics.bio-ph | in the wake of the influenza pandemic of 18891890 jacques bertillon a pioneer of medical statistics noticed that after the massive death spike there was a dip in birth numbers around 9 months later which was significantly larger than that which could be explained by the population change as a result of excess deaths in... | [['in', 'the', 'wake', 'of', 'the', 'influenza', 'pandemic', 'of', '18891890', 'jacques', 'bertillon', 'a', 'pioneer', 'of', 'medical', 'statistics', 'noticed', 'that', 'after', 'the', 'massive', 'death', 'spike', 'there', 'was', 'a', 'dip', 'in', 'birth', 'numbers', 'around', '9', 'months', 'later', 'which', 'was', 's... | [-0.09066847377955385, 0.17124230746693375, -0.09931277590161462, 0.12446260283697455, -0.05616907784018636, -0.10532286648792545, 0.06821515189445262, 0.33788041364287913, -0.20210373392841946, -0.320769822855634, 0.134308648832861, -0.26494838626263295, -0.198044588341099, 0.18594857344704527, -0.1139335475337699, -0... |
1,801.04534 | Reconstruction of energy conditions from observations and implications
for extended theories of gravity | The attempt to describe the recent accelerated expansion of the Universe
includes different propositions for dark energy models and modified gravity
theories. Establish their features in order to discriminate and even rule out
part of these models using observational data is a fundamental issue of
cosmology. In the p... | astro-ph.CO | the attempt to describe the recent accelerated expansion of the universe includes different propositions for dark energy models and modified gravity theories establish their features in order to discriminate and even rule out part of these models using observational data is a fundamental issue of cosmology in the prese... | [['the', 'attempt', 'to', 'describe', 'the', 'recent', 'accelerated', 'expansion', 'of', 'the', 'universe', 'includes', 'different', 'propositions', 'for', 'dark', 'energy', 'models', 'and', 'modified', 'gravity', 'theories', 'establish', 'their', 'features', 'in', 'order', 'to', 'discriminate', 'and', 'even', 'rule', ... | [-0.11234988145256028, 0.10253216883442116, -0.10322871345903743, 0.10374388781253267, -0.10221565269089782, -0.10241152367644428, -0.006972127215260744, 0.30954911961187115, -0.21638717082905853, -0.32432045279836597, 0.0840216844122819, -0.2377560218455752, -0.07418891202261303, 0.14434162396370306, -0.01975696677103... |
1,801.04535 | Coupling between death spikes and birth troughs. Part 2: Comparative
analysis of salient features | In part 1 we identified a new coupling between death spikes and birth dips
that occurs following catastrophic events such as influenza pandemics and
earthquakes. Here we seek to characterize some of the key features. We
introduce a transfer function defined as the amplitude of the birth trough (the
output) divided by... | physics.soc-ph physics.bio-ph | in part 1 we identified a new coupling between death spikes and birth dips that occurs following catastrophic events such as influenza pandemics and earthquakes here we seek to characterize some of the key features we introduce a transfer function defined as the amplitude of the birth trough the output divided by the a... | [['in', 'part', '1', 'we', 'identified', 'a', 'new', 'coupling', 'between', 'death', 'spikes', 'and', 'birth', 'dips', 'that', 'occurs', 'following', 'catastrophic', 'events', 'such', 'as', 'influenza', 'pandemics', 'and', 'earthquakes', 'here', 'we', 'seek', 'to', 'characterize', 'some', 'of', 'the', 'key', 'features'... | [-0.10002476995424858, 0.1599046174157449, -0.06573353059540846, 0.14390575530782562, -0.056867141235622844, -0.13627667124934592, 0.08342185327752591, 0.3397002852871083, -0.2629646515951639, -0.2837444551558675, 0.15276208966755994, -0.3110767526331505, -0.20437672155860223, 0.18008690899449376, -0.1045014890428559, ... |
1,801.04536 | Linear stability of an active fluid interface | Motivated by studies suggesting that the patterns exhibited by the
collectively expanding fronts of thin cells during the closing of a wound [Mark
et al., Biophys. J., 98:361-370, 2010] and the shapes of single cells crawling
on surfaces [Callan-Jones et al., Phys. Rev. Lett., 100:258106, 2008] are due
to fingering i... | cond-mat.soft | motivated by studies suggesting that the patterns exhibited by the collectively expanding fronts of thin cells during the closing of a wound mark et al biophys j 98361370 2010 and the shapes of single cells crawling on surfaces callanjones et al phys rev lett 100258106 2008 are due to fingering instabilities we investi... | [['motivated', 'by', 'studies', 'suggesting', 'that', 'the', 'patterns', 'exhibited', 'by', 'the', 'collectively', 'expanding', 'fronts', 'of', 'thin', 'cells', 'during', 'the', 'closing', 'of', 'a', 'wound', 'mark', 'et', 'al', 'biophys', 'j', '98361370', '2010', 'and', 'the', 'shapes', 'of', 'single', 'cells', 'crawl... | [-0.17156728129205706, 0.16904210452961296, -0.04352653112273509, -0.030303497876580696, -0.04033056629639802, -0.1334788470374718, 0.057540051675588996, 0.34471894748035004, -0.26440044388329315, -0.29115646361709524, 0.07002326272105655, -0.25058653351944493, -0.17633491640183083, 0.1876035768100606, -0.0892738530916... |
1,801.04537 | Compressed Neighbour Discovery using Sparse Kerdock Matrices | We study the network-wide neighbour discovery problem in wireless networks in
which each node in a network must discovery the network interface addresses
(NIAs) of its neighbours. We work within the rapid on-off division duplex
framework proposed by Guo and Zhang (2010) in which all nodes are assigned
different on-of... | cs.IT math.IT | we study the networkwide neighbour discovery problem in wireless networks in which each node in a network must discovery the network interface addresses nias of its neighbours we work within the rapid onoff division duplex framework proposed by guo and zhang 2010 in which all nodes are assigned different onoff signatur... | [['we', 'study', 'the', 'networkwide', 'neighbour', 'discovery', 'problem', 'in', 'wireless', 'networks', 'in', 'which', 'each', 'node', 'in', 'a', 'network', 'must', 'discovery', 'the', 'network', 'interface', 'addresses', 'nias', 'of', 'its', 'neighbours', 'we', 'work', 'within', 'the', 'rapid', 'onoff', 'division', ... | [-0.160167073068971, 0.07004001274048774, -0.011367012570421635, 0.019556269440164958, -0.06881516183599491, -0.23814893371997062, 0.13080222879811612, 0.4255155831406062, -0.2962809266723608, -0.2822361708830365, 0.12042778936976736, -0.24159296568303198, -0.21218211823248898, 0.07539985430511562, -0.09203797901493752... |
1,801.04538 | Linking Entanglement and Discrete Anomaly | In $3d$ Chern-Simons theory, there is a discrete one-form symmetry, whose
symmetry group is isomorphic to the center of the gauge group. We study the 't
Hooft anomaly associated to this discrete one-form symmetry in theories with
generic gauge groups, $A,B,C,D$-types. We propose to detect the discrete
anomaly by comp... | hep-th cond-mat.stat-mech cond-mat.str-el quant-ph | in 3d chernsimons theory there is a discrete oneform symmetry whose symmetry group is isomorphic to the center of the gauge group we study the t hooft anomaly associated to this discrete oneform symmetry in theories with generic gauge groups abcdtypes we propose to detect the discrete anomaly by computing the hopf stat... | [['in', '3d', 'chernsimons', 'theory', 'there', 'is', 'a', 'discrete', 'oneform', 'symmetry', 'whose', 'symmetry', 'group', 'is', 'isomorphic', 'to', 'the', 'center', 'of', 'the', 'gauge', 'group', 'we', 'study', 'the', 't', 'hooft', 'anomaly', 'associated', 'to', 'this', 'discrete', 'oneform', 'symmetry', 'in', 'theor... | [-0.19868405930792504, 0.1437974046973977, -0.08319970827869838, 0.027424206124123884, -0.13493271042243576, -0.1414874287438579, 0.02040379961836152, 0.37442782981088385, -0.2615560116013512, -0.25303043085150423, 0.09829633101617219, -0.2338765768450685, -0.18336553692352026, 0.05605542695266195, -0.06873733045067638... |
1,801.04539 | From Black Holes to Baby Universes: Exploring the Possibility of
Creating a Cosmos in the Laboratory | We discuss the essential features of baby-universe production, starting from
a description of black holes and wormholes, in terms of the causal structure of
spacetime, and following a qualitative review of the connection between vacuum
decay and inflation in early universe cosmology. Related open questions are
also a... | gr-qc | we discuss the essential features of babyuniverse production starting from a description of black holes and wormholes in terms of the causal structure of spacetime and following a qualitative review of the connection between vacuum decay and inflation in early universe cosmology related open questions are also addresse... | [['we', 'discuss', 'the', 'essential', 'features', 'of', 'babyuniverse', 'production', 'starting', 'from', 'a', 'description', 'of', 'black', 'holes', 'and', 'wormholes', 'in', 'terms', 'of', 'the', 'causal', 'structure', 'of', 'spacetime', 'and', 'following', 'a', 'qualitative', 'review', 'of', 'the', 'connection', 'b... | [-0.1250957256642222, 0.16567423903486794, -0.11855076777283102, 0.15246312021756442, -0.06164260547828033, -0.13204962534493664, -0.005097531901103341, 0.31280189341244596, -0.20739280521067688, -0.2865413143752246, 0.12003853910330993, -0.26322661432075417, -0.1011249555384792, 0.1548595616461373, -0.0219847363607388... |
1,801.0454 | Fix your classifier: the marginal value of training the last weight
layer | Neural networks are commonly used as models for classification for a wide
variety of tasks. Typically, a learned affine transformation is placed at the
end of such models, yielding a per-class value used for classification. This
classifier can have a vast number of parameters, which grows linearly with the
number of ... | cs.LG cs.CV stat.ML | neural networks are commonly used as models for classification for a wide variety of tasks typically a learned affine transformation is placed at the end of such models yielding a perclass value used for classification this classifier can have a vast number of parameters which grows linearly with the number of possible... | [['neural', 'networks', 'are', 'commonly', 'used', 'as', 'models', 'for', 'classification', 'for', 'a', 'wide', 'variety', 'of', 'tasks', 'typically', 'a', 'learned', 'affine', 'transformation', 'is', 'placed', 'at', 'the', 'end', 'of', 'such', 'models', 'yielding', 'a', 'perclass', 'value', 'used', 'for', 'classificat... | [-0.0677560882846592, 0.07295307324966416, -0.030833813889573018, 0.044890457479050384, -0.08543882936355658, -0.16793289577472023, 0.05534583321617295, 0.43093043512587126, -0.2866503086028388, -0.3644331855272564, 0.12427193280600476, -0.21751522284078723, -0.1759855931799393, 0.24241453448206204, -0.0797150717815384... |
1,801.04541 | Cooperative Multi-Agent Reinforcement Learning for Low-Level Wireless
Communication | Traditional radio systems are strictly co-designed on the lower levels of the
OSI stack for compatibility and efficiency. Although this has enabled the
success of radio communications, it has also introduced lengthy standardization
processes and imposed static allocation of the radio spectrum. Various
initiatives hav... | eess.SP cs.AI | traditional radio systems are strictly codesigned on the lower levels of the osi stack for compatibility and efficiency although this has enabled the success of radio communications it has also introduced lengthy standardization processes and imposed static allocation of the radio spectrum various initiatives have been... | [['traditional', 'radio', 'systems', 'are', 'strictly', 'codesigned', 'on', 'the', 'lower', 'levels', 'of', 'the', 'osi', 'stack', 'for', 'compatibility', 'and', 'efficiency', 'although', 'this', 'has', 'enabled', 'the', 'success', 'of', 'radio', 'communications', 'it', 'has', 'also', 'introduced', 'lengthy', 'standard... | [-0.13464485615457472, 0.011514873562852947, -0.06531709861221978, 0.016681467708787586, -0.12201992463087663, -0.18464572515486824, 0.06788648144125049, 0.4538467920131304, -0.266255557733199, -0.34275545038028876, 0.10169304433723235, -0.2195939482322005, -0.21053118776762858, 0.21415955129090103, -0.1185571419561959... |
1,801.04542 | Geometric classification of 4d $\mathcal{N}=2$ SCFTs | The classification of 4d $\mathcal{N}=2$ SCFTs boils down to the
classification of conical special geometries with closed Reeb orbits (CSG).
Under mild assumptions, one shows that the underlying complex space of a CSG is
(birational to) an affine cone over a simply-connected $\mathbb{Q}$-factorial
log-Fano variety wi... | hep-th math-ph math.MP | the classification of 4d mathcaln2 scfts boils down to the classification of conical special geometries with closed reeb orbits csg under mild assumptions one shows that the underlying complex space of a csg is birational to an affine cone over a simplyconnected mathbbqfactorial logfano variety with hodge numbers hpqde... | [['the', 'classification', 'of', '4d', 'mathcaln2', 'scfts', 'boils', 'down', 'to', 'the', 'classification', 'of', 'conical', 'special', 'geometries', 'with', 'closed', 'reeb', 'orbits', 'csg', 'under', 'mild', 'assumptions', 'one', 'shows', 'that', 'the', 'underlying', 'complex', 'space', 'of', 'a', 'csg', 'is', 'bira... | [-0.16185511245821543, 0.08942918073941351, -0.04935184537122647, 0.05153598094378443, -0.09001392459273726, -0.14906408013387892, 0.01785830549148765, 0.31912826279488704, -0.24653290006244788, -0.2602638650588536, 0.06006269301239323, -0.2440612447836126, -0.1780498472993107, 0.1921697492323195, -0.10996735258183131,... |
1,801.04543 | Interband excitations in the 1D limit of two-band fractional Chern
insulators | We investigate the stability of the one-dimensional limit of $\nu=1/3$
Laughlin-like fractional Chern insulator with respect to the interband
interaction. We propose a construction for the excitations in the
infinite-interaction case and show that the energy gap remains finite in the
thermodynamic limit. Next, by mea... | cond-mat.str-el | we investigate the stability of the onedimensional limit of nu13 laughlinlike fractional chern insulator with respect to the interband interaction we propose a construction for the excitations in the infiniteinteraction case and show that the energy gap remains finite in the thermodynamic limit next by means of exact d... | [['we', 'investigate', 'the', 'stability', 'of', 'the', 'onedimensional', 'limit', 'of', 'nu13', 'laughlinlike', 'fractional', 'chern', 'insulator', 'with', 'respect', 'to', 'the', 'interband', 'interaction', 'we', 'propose', 'a', 'construction', 'for', 'the', 'excitations', 'in', 'the', 'infiniteinteraction', 'case', ... | [-0.15830059370569663, 0.13512561530878134, -0.06920959078946833, 0.06719322885823503, 0.0011601751170975646, -0.112750072152229, 0.10547936878637555, 0.3534602092329374, -0.28826363707806185, -0.2375183034017346, 0.07931772001884571, -0.29666641364162116, -0.16385628292145035, 0.10972422839816871, 0.016625431738313788... |
1,801.04544 | Hire the Experts: Combinatorial Auction Based Scheme for Experts
Selection in E-Healthcare | During the last decade, scheduling the healthcare services (such as staffs
and OTs) inside the hospitals have assumed a central role in healthcare.
Recently, some works are addressed in the direction of hiring the expert
consultants (mainly doctors) for the critical healthcare scenarios from outside
of the medical un... | cs.GT | during the last decade scheduling the healthcare services such as staffs and ots inside the hospitals have assumed a central role in healthcare recently some works are addressed in the direction of hiring the expert consultants mainly doctors for the critical healthcare scenarios from outside of the medical unit in bot... | [['during', 'the', 'last', 'decade', 'scheduling', 'the', 'healthcare', 'services', 'such', 'as', 'staffs', 'and', 'ots', 'inside', 'the', 'hospitals', 'have', 'assumed', 'a', 'central', 'role', 'in', 'healthcare', 'recently', 'some', 'works', 'are', 'addressed', 'in', 'the', 'direction', 'of', 'hiring', 'the', 'expert... | [-0.061579278875142335, 0.024793182692180078, -0.04444508290849626, 0.03649830353756746, -0.16707555608513455, -0.12009020702292522, 0.14780100327450782, 0.3938292010128498, -0.236364271279114, -0.31592696510255336, 0.14618314700278764, -0.28509705680112046, -0.11274738875993838, 0.1675952907713751, -0.1841828747683515... |
1,801.04545 | Throughput Maximization for UAV-Enabled Wireless Powered Communication
Networks | This paper studies an unmanned aerial vehicle (UAV)-enabled wireless powered
communication network (WPCN), in which a UAV is dispatched as a mobile access
point (AP) to serve a set of ground users periodically. The UAV employs the
radio frequency (RF) wireless power transfer (WPT) to charge the users in the
downlink,... | cs.IT math.IT | this paper studies an unmanned aerial vehicle uavenabled wireless powered communication network wpcn in which a uav is dispatched as a mobile access point ap to serve a set of ground users periodically the uav employs the radio frequency rf wireless power transfer wpt to charge the users in the downlink and the users u... | [['this', 'paper', 'studies', 'an', 'unmanned', 'aerial', 'vehicle', 'uavenabled', 'wireless', 'powered', 'communication', 'network', 'wpcn', 'in', 'which', 'a', 'uav', 'is', 'dispatched', 'as', 'a', 'mobile', 'access', 'point', 'ap', 'to', 'serve', 'a', 'set', 'of', 'ground', 'users', 'periodically', 'the', 'uav', 'em... | [-0.27588649430612533, -0.0012895201063024022, 0.020111479615941105, -0.019279234710257446, -0.11741572285688523, -0.23717924996879816, 0.15884955659588001, 0.3938869119164588, -0.3104691157164727, -0.2923805287168564, 0.08418285324697153, -0.2502969997104905, -0.1548433189847223, 0.13209351892515586, -0.16274051243722... |
1,801.04546 | Evaluation of Machine Learning Fameworks on Finis Terrae II | Machine Learning (ML) and Deep Learning (DL) are two technologies used to
extract representations of the data for a specific purpose. ML algorithms take
a set of data as input to generate one or several predictions. To define the
final version of one model, usually there is an initial step devoted to train
the algori... | cs.DC cs.LG | machine learning ml and deep learning dl are two technologies used to extract representations of the data for a specific purpose ml algorithms take a set of data as input to generate one or several predictions to define the final version of one model usually there is an initial step devoted to train the algorithm get t... | [['machine', 'learning', 'ml', 'and', 'deep', 'learning', 'dl', 'are', 'two', 'technologies', 'used', 'to', 'extract', 'representations', 'of', 'the', 'data', 'for', 'a', 'specific', 'purpose', 'ml', 'algorithms', 'take', 'a', 'set', 'of', 'data', 'as', 'input', 'to', 'generate', 'one', 'or', 'several', 'predictions', ... | [-0.048970773166058044, 0.01915611353346956, -0.09411464739378367, 0.07155581317832631, -0.09953526980649904, -0.1972500322599139, 0.028163892579508708, 0.41128168656997033, -0.27389753634897657, -0.34611138832074084, 0.12481254377580504, -0.26425146784527137, -0.11617420698928603, 0.2253264447646028, -0.08021650753990... |
1,801.04547 | Controllable unidirectional transport and photon storage in an
one-dimensional lattice with complex hopping rates | We study an one-dimensional non-Hermitian lattice with complex hopping rates,
which can be realized by a quasi-one-dimensional sawtooth-type Hermitian
lattice after adiabatic elimination with proper conditions. By means of
synthetic magnetic fluxes, the imaginary parts of the complex hopping rates can
be modulated by... | quant-ph physics.optics | we study an onedimensional nonhermitian lattice with complex hopping rates which can be realized by a quasionedimensional sawtoothtype hermitian lattice after adiabatic elimination with proper conditions by means of synthetic magnetic fluxes the imaginary parts of the complex hopping rates can be modulated by additiona... | [['we', 'study', 'an', 'onedimensional', 'nonhermitian', 'lattice', 'with', 'complex', 'hopping', 'rates', 'which', 'can', 'be', 'realized', 'by', 'a', 'quasionedimensional', 'sawtoothtype', 'hermitian', 'lattice', 'after', 'adiabatic', 'elimination', 'with', 'proper', 'conditions', 'by', 'means', 'of', 'synthetic', 'm... | [-0.15929961942461449, 0.2513645064833389, -0.04508686570836038, -0.013079414927352477, -0.07557293730787933, -0.19624241426715563, 0.07417216605651353, 0.44221039190888406, -0.3156541444425439, -0.2607754066843411, 0.07473351428975704, -0.21604958416508704, -0.13670634653114166, 0.2301863704775942, -0.0162571415256965... |
1,801.04548 | Frame Moments and Welch Bound with Erasures | The Welch Bound is a lower bound on the root mean square cross correlation
between $n$ unit-norm vectors $f_1,...,f_n$ in the $m$ dimensional space
($\mathbb{R} ^m$ or $\mathbb{C} ^m$), for $n\geq m$. Letting $F =
[f_1|...|f_n]$ denote the $m$-by-$n$ frame matrix, the Welch bound can be
viewed as a lower bound on the... | cs.IT math.IT | the welch bound is a lower bound on the root mean square cross correlation between n unitnorm vectors f_1f_n in the m dimensional space mathbbr m or mathbbc m for ngeq m letting f f_1f_n denote the mbyn frame matrix the welch bound can be viewed as a lower bound on the second moment of f namely on the trace of the squa... | [['the', 'welch', 'bound', 'is', 'a', 'lower', 'bound', 'on', 'the', 'root', 'mean', 'square', 'cross', 'correlation', 'between', 'n', 'unitnorm', 'vectors', 'f_1f_n', 'in', 'the', 'm', 'dimensional', 'space', 'mathbbr', 'm', 'or', 'mathbbc', 'm', 'for', 'ngeq', 'm', 'letting', 'f', 'f_1f_n', 'denote', 'the', 'mbyn', '... | [-0.1843528415340458, 0.11360583436605326, -0.03251427384071123, 0.03531908488422454, -0.024736490454881244, -0.16621047369389388, 0.06834367785962638, 0.29180956468249014, -0.26070657618896387, -0.259682137661716, 0.0902546133320226, -0.27939856861624424, -0.1344373498599905, 0.1702245771177514, -0.08154270676985098, ... |
1,801.04549 | Divergent Trajectories in Arithmetic Homogeneous Spaces of Rational Rank
Two | Let $G$ be a real algebraic group defined over $\mathbb{Q}$, $\Gamma$ be an
arithmetic subgroup of $G$, and $T$ be a maximal $\mathbb{R}$-split torus. A
trajectory in $G/\Gamma$ is divergent if eventually it leaves every compact
subset. In some cases there is a finite collection of explicit algebraic data
which accou... | math.DS | let g be a real algebraic group defined over mathbbq gamma be an arithmetic subgroup of g and t be a maximal mathbbrsplit torus a trajectory in ggamma is divergent if eventually it leaves every compact subset in some cases there is a finite collection of explicit algebraic data which account for the divergence if this ... | [['let', 'g', 'be', 'a', 'real', 'algebraic', 'group', 'defined', 'over', 'mathbbq', 'gamma', 'be', 'an', 'arithmetic', 'subgroup', 'of', 'g', 'and', 't', 'be', 'a', 'maximal', 'mathbbrsplit', 'torus', 'a', 'trajectory', 'in', 'ggamma', 'is', 'divergent', 'if', 'eventually', 'it', 'leaves', 'every', 'compact', 'subset'... | [-0.22292954971962567, 0.11559585868629281, -0.16899346506411056, 0.06517022191824545, -0.10874513385458551, -0.13272810350983924, 0.04895856052876339, 0.3606466557317918, -0.30542887029998483, -0.16850394638652547, 0.123389655274527, -0.26529498167609405, -0.12858673237657192, 0.21425602723494036, -0.13958622795452766... |
1,801.0455 | Properties of non-symmetric Macdonald polynomials at $q=1$ and $q=0$ | We examine the non-symmetric Macdonald polynomials $E_\lambda(x;q,t)$ at
$q=1$, as well as the more general permuted-basement Macdonald polynomials.
When $q=1$, we show that $E_\lambda(x;1,t)$ is symmetric and independent of $t$
whenever $\lambda$ is a partition. Furthermore, we show that for general
$\lambda$, this ... | math.CO math.RT | we examine the nonsymmetric macdonald polynomials e_lambdaxqt at q1 as well as the more general permutedbasement macdonald polynomials when q1 we show that e_lambdax1t is symmetric and independent of t whenever lambda is a partition furthermore we show that for general lambda this expression factors into a symmetric an... | [['we', 'examine', 'the', 'nonsymmetric', 'macdonald', 'polynomials', 'e_lambdaxqt', 'at', 'q1', 'as', 'well', 'as', 'the', 'more', 'general', 'permutedbasement', 'macdonald', 'polynomials', 'when', 'q1', 'we', 'show', 'that', 'e_lambdax1t', 'is', 'symmetric', 'and', 'independent', 'of', 't', 'whenever', 'lambda', 'is'... | [-0.11505103968881761, 0.11732018943325018, -0.05456779124816943, 0.03366526369701318, -0.04789192878949885, -0.12566101916783143, 0.01232576525110877, 0.3165554326456668, -0.27150001885432207, -0.19411460476341458, 0.07789603616843481, -0.2659472067934576, -0.19925474727119508, 0.17027717033987133, -0.0648597999844762... |
1,801.04551 | On Congruence Permutable $G$-sets | An algebraic structure is said to be congruence permutable if its arbitrary
congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta
=\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary
relations. For an arbitrary $G$-set $X$ with $G\cap X=\emptyset$, we define a
semigroup $(G,... | math.GR | an algebraic structure is said to be congruence permutable if its arbitrary congruences alpha and beta satisfy the equation alpha circ beta beta circ alpha where circ denotes the usual composition of binary relations for an arbitrary gset x with gcap xemptyset we define a semigroup gx0 with a zero 0 0notin gcup x and g... | [['an', 'algebraic', 'structure', 'is', 'said', 'to', 'be', 'congruence', 'permutable', 'if', 'its', 'arbitrary', 'congruences', 'alpha', 'and', 'beta', 'satisfy', 'the', 'equation', 'alpha', 'circ', 'beta', 'beta', 'circ', 'alpha', 'where', 'circ', 'denotes', 'the', 'usual', 'composition', 'of', 'binary', 'relations',... | [-0.19778964866103754, 0.18238550745229223, -0.05213674192153219, 0.042337167271840816, -0.1135388240186699, -0.1949265162095528, 0.02356445010613046, 0.341227257322218, -0.3889114359343374, -0.15126615631821994, 0.06262783401620549, -0.3081879833511807, -0.07726469082046754, 0.17777924058405128, -0.006245792428081906,... |
1,801.04552 | Energy-Efficient Resource Allocation in NOMA Heterogeneous Networks | Non-orthogonal multiple access (NOMA) has attracted much recent attention
owing to its capability for improving the system spectral efficiency in
wireless communications. Deploying NOMA in heterogeneous network can satisfy
users' explosive data traffic requirements, and NOMA will likely play an
important role in the ... | cs.IT math.IT | nonorthogonal multiple access noma has attracted much recent attention owing to its capability for improving the system spectral efficiency in wireless communications deploying noma in heterogeneous network can satisfy users explosive data traffic requirements and noma will likely play an important role in the fifthgen... | [['nonorthogonal', 'multiple', 'access', 'noma', 'has', 'attracted', 'much', 'recent', 'attention', 'owing', 'to', 'its', 'capability', 'for', 'improving', 'the', 'system', 'spectral', 'efficiency', 'in', 'wireless', 'communications', 'deploying', 'noma', 'in', 'heterogeneous', 'network', 'can', 'satisfy', 'users', 'ex... | [-0.34579406427889087, -0.05732501848527379, 0.05668816568323843, 0.011392563760274522, -0.10260456693632637, -0.28267284721026525, 0.13178758062817936, 0.4223517474225339, -0.25991659437962866, -0.25769789011698535, 0.031248383078681538, -0.2252514003380354, -0.192910464818352, 0.12143217911030732, -0.175444621264058,... |
1,801.04553 | Fast computation of approximant bases in canonical form | In this article, we design fast algorithms for the computation of approximant
bases in shifted Popov normal form. We first recall the algorithm known as
PM-Basis, which will be our second fundamental engine after polynomial matrix
multiplication: most other fast approximant basis algorithms basically aim at
efficient... | cs.SC | in this article we design fast algorithms for the computation of approximant bases in shifted popov normal form we first recall the algorithm known as pmbasis which will be our second fundamental engine after polynomial matrix multiplication most other fast approximant basis algorithms basically aim at efficiently redu... | [['in', 'this', 'article', 'we', 'design', 'fast', 'algorithms', 'for', 'the', 'computation', 'of', 'approximant', 'bases', 'in', 'shifted', 'popov', 'normal', 'form', 'we', 'first', 'recall', 'the', 'algorithm', 'known', 'as', 'pmbasis', 'which', 'will', 'be', 'our', 'second', 'fundamental', 'engine', 'after', 'polyno... | [-0.06769721670427835, 0.06731287645318416, -0.051922210663310195, 0.07474216516410191, -0.09242592138204589, -0.154883874995432, 0.059488959988344456, 0.3676078963237459, -0.26220392420687844, -0.3234868926112073, 0.13561341237000013, -0.23224730179340056, -0.17457724862633694, 0.22713309545986293, -0.0640861251667080... |
1,801.04554 | DCDistance: A Supervised Text Document Feature extraction based on class
labels | Text Mining is a field that aims at extracting information from textual data.
One of the challenges of such field of study comes from the pre-processing
stage in which a vector (and structured) representation should be extracted
from unstructured data. The common extraction creates large and sparse vectors
representi... | cs.IR cs.CL cs.LG | text mining is a field that aims at extracting information from textual data one of the challenges of such field of study comes from the preprocessing stage in which a vector and structured representation should be extracted from unstructured data the common extraction creates large and sparse vectors representing the ... | [['text', 'mining', 'is', 'a', 'field', 'that', 'aims', 'at', 'extracting', 'information', 'from', 'textual', 'data', 'one', 'of', 'the', 'challenges', 'of', 'such', 'field', 'of', 'study', 'comes', 'from', 'the', 'preprocessing', 'stage', 'in', 'which', 'a', 'vector', 'and', 'structured', 'representation', 'should', '... | [-0.035458324658252695, 0.009154889294692617, -0.07024680069549047, 0.04379923259207227, -0.13179743644898598, -0.13651738173385392, 0.04518407428890023, 0.35728628732362727, -0.30909706310242635, -0.33727767846442214, 0.09213445142500522, -0.29951364486570786, -0.1507578595781958, 0.19853068965900417, -0.0994779884488... |
1,801.04555 | Remarks on Graphons | L. Lov\'asz and B. Szegedy proved in 2006 that the limits of convergent graph
sequences can be described by measurable symmetric functions $W: [0, 1]\times
[0, 1]\to [0, 1]$ called graphons. In our present paper we investigate the
structure of the set of all graphons within the semigroup $(\mathfrak{F}([0,
1]^2); \ci... | math.CO | l lovasz and b szegedy proved in 2006 that the limits of convergent graph sequences can be described by measurable symmetric functions w 0 1times 0 1to 0 1 called graphons in our present paper we investigate the structure of the set of all graphons within the semigroup mathfrakf0 12 circ of all fuzzy subsets of the uni... | [['l', 'lovasz', 'and', 'b', 'szegedy', 'proved', 'in', '2006', 'that', 'the', 'limits', 'of', 'convergent', 'graph', 'sequences', 'can', 'be', 'described', 'by', 'measurable', 'symmetric', 'functions', 'w', '0', '1times', '0', '1to', '0', '1', 'called', 'graphons', 'in', 'our', 'present', 'paper', 'we', 'investigate',... | [-0.1768295231122005, 0.17318099820868502, 0.029105109952484505, 0.01848663880837539, 0.018829219874371833, -0.12285993492843796, 0.05103848734244268, 0.36743516687162314, -0.357080243346635, -0.20622808920054497, 0.1138476273575444, -0.2992128077128171, -0.1172941683001722, 0.1439754196289408, -0.057148330258441314, 0... |
1,801.04556 | Poisson Cox Point Processes for Vehicular Networks | This paper analyzes statistical properties of the Poisson line Cox point
process useful in the modeling of vehicular networks. The point process is
created by a two-stage construction: a Poisson line process to model road
infrastructure and independent Poisson point processes, conditionally on the
Poisson lines, to m... | cs.IT math.IT | this paper analyzes statistical properties of the poisson line cox point process useful in the modeling of vehicular networks the point process is created by a twostage construction a poisson line process to model road infrastructure and independent poisson point processes conditionally on the poisson lines to model ve... | [['this', 'paper', 'analyzes', 'statistical', 'properties', 'of', 'the', 'poisson', 'line', 'cox', 'point', 'process', 'useful', 'in', 'the', 'modeling', 'of', 'vehicular', 'networks', 'the', 'point', 'process', 'is', 'created', 'by', 'a', 'twostage', 'construction', 'a', 'poisson', 'line', 'process', 'to', 'model', 'r... | [-0.13714625515809684, 0.02543921219446113, -0.06800624423659794, 0.04803677284732411, -0.04008102727723177, -0.10731330023921817, 0.10474813863239034, 0.383508046862678, -0.30439636457459046, -0.2051740969209192, 0.0658901345124033, -0.26867384453539117, -0.20858225109769363, 0.14024014932660508, -0.09811247456992898,... |
1,801.04557 | Surveying exotic pentaquarks with the typical $QQqq\bar{q}$
configuration | As a hot issue, exploring exotic pentaquarks is full of challenges and
opportunities for both theorist and experimentalist. In this work, we focus on
a type of pentaquark with the $QQqq\bar{q}$ ($Q=b,c$; $q=u,d,s$) configuration,
where their mass spectrum is estimated systematically. Especially, our result
indicates ... | hep-ph hep-lat nucl-th | as a hot issue exploring exotic pentaquarks is full of challenges and opportunities for both theorist and experimentalist in this work we focus on a type of pentaquark with the qqqqbarq qbc quds configuration where their mass spectrum is estimated systematically especially our result indicates that there may exist some... | [['as', 'a', 'hot', 'issue', 'exploring', 'exotic', 'pentaquarks', 'is', 'full', 'of', 'challenges', 'and', 'opportunities', 'for', 'both', 'theorist', 'and', 'experimentalist', 'in', 'this', 'work', 'we', 'focus', 'on', 'a', 'type', 'of', 'pentaquark', 'with', 'the', 'qqqqbarq', 'qbc', 'quds', 'configuration', 'where'... | [-0.10433195348571431, 0.1673273621325163, -0.11833352000115717, 0.1300373320787293, -0.1199959357184893, -0.19206916549778047, 0.085840725439026, 0.36016281151232565, -0.15127315948856004, -0.30386021714459394, 0.07490029436922534, -0.2854140023601816, -0.09355665962063173, 0.1652849229458878, 0.01295558676282142, 0.0... |
1,801.04558 | On the effect of blockage objects in dense MIMO SWIPT networks | Simultaneous information and power transfer (SWIPT) is characterised by the
ambiguous role of multi-user interference. In short, the beneficial effect of
multi-user interference on RF energy harvesting is obtained at the price of a
reduced link capacity, thus originating nontrivial trade-offs between the
achievable i... | cs.IT math.IT | simultaneous information and power transfer swipt is characterised by the ambiguous role of multiuser interference in short the beneficial effect of multiuser interference on rf energy harvesting is obtained at the price of a reduced link capacity thus originating nontrivial tradeoffs between the achievable information... | [['simultaneous', 'information', 'and', 'power', 'transfer', 'swipt', 'is', 'characterised', 'by', 'the', 'ambiguous', 'role', 'of', 'multiuser', 'interference', 'in', 'short', 'the', 'beneficial', 'effect', 'of', 'multiuser', 'interference', 'on', 'rf', 'energy', 'harvesting', 'is', 'obtained', 'at', 'the', 'price', '... | [-0.20495384565665914, 0.09120723319742272, -0.042865221371175724, 0.07494907201093472, -0.06605917147725172, -0.14130578680247394, 0.10072594444247206, 0.3754053782550213, -0.29782721642404797, -0.2914089408951164, 0.09102978672295728, -0.27011336183539875, -0.1759433825965971, 0.16206757260445992, -0.0999879719568011... |
1,801.04559 | Asymptotic Enumeration of Graph Classes with Many Components | We consider graph classes $\mathcal G$ in which every graph has components in
a class $\mathcal{C}$ of connected graphs. We provide a framework for the
asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in
$\mathcal{G}$ with $n$ vertices and $N:=\lfloor\lambda n\rfloor$ components,
where $\lamb... | math.CO | we consider graph classes mathcal g in which every graph has components in a class mathcalc of connected graphs we provide a framework for the asymptotic study of lvertmathcalg_nnrvert the number of graphs in mathcalg with n vertices and nlfloorlambda nrfloor components where lambdain01 assuming that the number of grap... | [['we', 'consider', 'graph', 'classes', 'mathcal', 'g', 'in', 'which', 'every', 'graph', 'has', 'components', 'in', 'a', 'class', 'mathcalc', 'of', 'connected', 'graphs', 'we', 'provide', 'a', 'framework', 'for', 'the', 'asymptotic', 'study', 'of', 'lvertmathcalg_nnrvert', 'the', 'number', 'of', 'graphs', 'in', 'mathca... | [-0.14153069509854596, 0.08099238991464582, -0.01982370671160387, 0.035797332463780494, -0.050589413055599, -0.1459846423261044, 0.018779015579445498, 0.3523394599895836, -0.2965727159973873, -0.23791992311095875, 0.06916401995354217, -0.3488802500592666, -0.13119344696879232, 0.15310356996818472, -0.10396598154656897,... |
1,801.0456 | G-twisted braces and orbifold Landau-Ginzburg Models | Given an algebra with group $G$-action, we construct brace structures for its
$G$-twisted Hochschild cochains. An an application, we construct $G$-Frobenius
algebras for orbifold Landau-Ginzburg B-models and present explicit orbifold
cup product formula for all invertible polynomials.
| math.QA hep-th math-ph math.MP | given an algebra with group gaction we construct brace structures for its gtwisted hochschild cochains an an application we construct gfrobenius algebras for orbifold landauginzburg bmodels and present explicit orbifold cup product formula for all invertible polynomials | [['given', 'an', 'algebra', 'with', 'group', 'gaction', 'we', 'construct', 'brace', 'structures', 'for', 'its', 'gtwisted', 'hochschild', 'cochains', 'an', 'an', 'application', 'we', 'construct', 'gfrobenius', 'algebras', 'for', 'orbifold', 'landauginzburg', 'bmodels', 'and', 'present', 'explicit', 'orbifold', 'cup', '... | [-0.22462651526203026, -0.033180933271462376, -0.06640050445708472, 0.09460590972338577, -0.17145646719664737, -0.1976067843544926, -0.11877174170159206, 0.3989880872588303, -0.40021727073031504, -0.11896654455041564, 0.13446902395603624, -0.193249518265696, -0.20603095458166018, 0.11671939550118672, -0.235297854813570... |
1,801.04561 | Regular orbits of sporadic simple groups | Given a finite group $G$ and a faithful irreducible $FG$-module $V$ where $F$
has prime order, does $G$ have a regular orbit on $V$? This problem is
equivalent to determining which primitive permutation groups of affine type
have a base of size 2. Let $G$ be a covering group of an almost simple group
whose socle $T$ ... | math.RT math.GR | given a finite group g and a faithful irreducible fgmodule v where f has prime order does g have a regular orbit on v this problem is equivalent to determining which primitive permutation groups of affine type have a base of size 2 let g be a covering group of an almost simple group whose socle t is sporadic and let v ... | [['given', 'a', 'finite', 'group', 'g', 'and', 'a', 'faithful', 'irreducible', 'fgmodule', 'v', 'where', 'f', 'has', 'prime', 'order', 'does', 'g', 'have', 'a', 'regular', 'orbit', 'on', 'v', 'this', 'problem', 'is', 'equivalent', 'to', 'determining', 'which', 'primitive', 'permutation', 'groups', 'of', 'affine', 'type... | [-0.24064579239736, 0.11257062485007434, -0.08599715487410625, -0.052416272344999015, -0.12652144935370113, -0.1700509066421849, 0.01884558881186725, 0.37826391788354763, -0.2974426189127068, -0.24054478365384663, 0.05842168128098516, -0.25839821292708315, -0.05718763927773883, 0.17361329157526295, -0.11327063749389102... |
1,801.04562 | Modeling diffusion in colloidal suspensions by dynamical density
functional theory using fundamental measure theory of hard spheres | We study the dynamics of colloidal suspensions of hard spheres that are
subject to Brownian motion in the overdamped limit. We obtain the time
evolution of the self and distinct parts of the van Hove function by means of
dynamical density functional theory (DDFT). The free energy model for the hard
sphere fluid that ... | cond-mat.soft | we study the dynamics of colloidal suspensions of hard spheres that are subject to brownian motion in the overdamped limit we obtain the time evolution of the self and distinct parts of the van hove function by means of dynamical density functional theory ddft the free energy model for the hard sphere fluid that we use... | [['we', 'study', 'the', 'dynamics', 'of', 'colloidal', 'suspensions', 'of', 'hard', 'spheres', 'that', 'are', 'subject', 'to', 'brownian', 'motion', 'in', 'the', 'overdamped', 'limit', 'we', 'obtain', 'the', 'time', 'evolution', 'of', 'the', 'self', 'and', 'distinct', 'parts', 'of', 'the', 'van', 'hove', 'function', 'b... | [-0.08021985883011397, 0.12242848170523084, -0.14641486443374804, 0.08190103729152412, -0.010900672624698121, -0.0774647097115739, 0.024510005785806376, 0.35160134365881673, -0.26681193331156977, -0.327618112311279, 0.04023718918080065, -0.3070671287372367, -0.1789973426880386, 0.1632190082161794, -0.011251427345191136... |
1,801.04563 | A case of the generalized vanishing conjecture | In this paper, we show that the GVC (generalized vanishing conjecture) holds
for the differential operator $\Lambda=(\partial_x-\Phi(\partial_y))\partial_y$
and all polynomials $P(x,y)$, where $\Phi(t)$ is any polynomial over the base
field. The GVC arose from the study of the Jacobian conjecture.
| math.AG | in this paper we show that the gvc generalized vanishing conjecture holds for the differential operator lambdapartial_xphipartial_ypartial_y and all polynomials pxy where phit is any polynomial over the base field the gvc arose from the study of the jacobian conjecture | [['in', 'this', 'paper', 'we', 'show', 'that', 'the', 'gvc', 'generalized', 'vanishing', 'conjecture', 'holds', 'for', 'the', 'differential', 'operator', 'lambdapartial_xphipartial_ypartial_y', 'and', 'all', 'polynomials', 'pxy', 'where', 'phit', 'is', 'any', 'polynomial', 'over', 'the', 'base', 'field', 'the', 'gvc', ... | [-0.20805229502133069, 0.05537206342873665, -0.0813459708618048, 0.025096327842523653, -0.060767532899402656, -0.1258753029963909, -0.05520162463653833, 0.24051668057934597, -0.33778475067363334, -0.16138034355707276, 0.07273241743528977, -0.2370329486588255, -0.21484379755715147, 0.1993686870122567, -0.104902361686795... |
1,801.04564 | Impact of infrasound atmospheric noise on gravity detectors used for
astrophysical and geophysical applications | Density changes in the atmosphere produce a fluctuating gravity field that
affect gravity strainmeters or gravity gradiometers used for the detection of
gravitational-waves and for geophysical applications. This work addresses the
impact of the atmospheric local gravity noise on such detectors, extending
previous ana... | astro-ph.IM | density changes in the atmosphere produce a fluctuating gravity field that affect gravity strainmeters or gravity gradiometers used for the detection of gravitationalwaves and for geophysical applications this work addresses the impact of the atmospheric local gravity noise on such detectors extending previous analyses... | [['density', 'changes', 'in', 'the', 'atmosphere', 'produce', 'a', 'fluctuating', 'gravity', 'field', 'that', 'affect', 'gravity', 'strainmeters', 'or', 'gravity', 'gradiometers', 'used', 'for', 'the', 'detection', 'of', 'gravitationalwaves', 'and', 'for', 'geophysical', 'applications', 'this', 'work', 'addresses', 'th... | [-0.11356663288416731, 0.13614600143224306, -0.08102926975876397, 0.10752651652639579, -0.05286498698500954, -0.08288940653794122, -0.043878546281603675, 0.2793205719422169, -0.16704987783973313, -0.34770674502229965, 0.10595053811890207, -0.3180969850521307, -0.15595226930882022, 0.22431246783318265, -0.05093428826586... |
1,801.04565 | Shai: Enforcing Data-Specific Policies with Near-Zero Runtime Overhead | Data retrieval systems such as online search engines and online social
networks must comply with the privacy policies of personal and selectively
shared data items, regulatory policies regarding data retention and censorship,
and the provider's own policies regarding data use. Enforcing these policies is
difficult an... | cs.CR cs.OS | data retrieval systems such as online search engines and online social networks must comply with the privacy policies of personal and selectively shared data items regulatory policies regarding data retention and censorship and the providers own policies regarding data use enforcing these policies is difficult and erro... | [['data', 'retrieval', 'systems', 'such', 'as', 'online', 'search', 'engines', 'and', 'online', 'social', 'networks', 'must', 'comply', 'with', 'the', 'privacy', 'policies', 'of', 'personal', 'and', 'selectively', 'shared', 'data', 'items', 'regulatory', 'policies', 'regarding', 'data', 'retention', 'and', 'censorship'... | [-0.1357687631798153, -0.02118049697884409, -0.05599128609221127, 0.08527064936839648, -0.16884570111256295, -0.2102020846402927, 0.18003039834706264, 0.43270643635376077, -0.261912631575723, -0.35708395993034986, 0.17006655293076325, -0.2877526878479969, -0.09555495926556555, 0.19255052526431107, -0.14534007761426068,... |
1,801.04566 | Nondegenerate parametric oscillations in a tunable superconducting
resonator | We investigate nondegenerate parametric oscillations in a multimode
superconducting microwave resonator that is terminated by a SQUID. The
parametric effect is achieved by modulating magnetic flux through the SQUID at
a frequency close to the sum of two resonator-mode frequencies. For modulation
amplitudes exceeding ... | quant-ph cond-mat.supr-con | we investigate nondegenerate parametric oscillations in a multimode superconducting microwave resonator that is terminated by a squid the parametric effect is achieved by modulating magnetic flux through the squid at a frequency close to the sum of two resonatormode frequencies for modulation amplitudes exceeding an in... | [['we', 'investigate', 'nondegenerate', 'parametric', 'oscillations', 'in', 'a', 'multimode', 'superconducting', 'microwave', 'resonator', 'that', 'is', 'terminated', 'by', 'a', 'squid', 'the', 'parametric', 'effect', 'is', 'achieved', 'by', 'modulating', 'magnetic', 'flux', 'through', 'the', 'squid', 'at', 'a', 'frequ... | [-0.20325739297781462, 0.2505779417298367, -0.020347956858655526, 0.046601632754133385, -0.027078511218065458, -0.13691540687832215, 0.07583303030793068, 0.4040252065890475, -0.23986005316186226, -0.2598687792906155, 0.03234914550943214, -0.2621977980686537, -0.13273285677200122, 0.2699491930585848, 0.00129015512675022... |
1,801.04567 | Dynamical density functional theory for dense suspensions of colloidal
hard spheres | We study structural relaxation of colloidal hard spheres undergoing Brownian
motion using dynamical density functional theory. Contrary to the partial
linearization route [Stopper {\em et al.}, Phys. Rev. E {\bf 92}, 022151
(2015)] which amounts to using different free energy functionals for the self
and distinct par... | cond-mat.soft | we study structural relaxation of colloidal hard spheres undergoing brownian motion using dynamical density functional theory contrary to the partial linearization route stopper em et al phys rev e bf 92 022151 2015 which amounts to using different free energy functionals for the self and distinct part of the van hove ... | [['we', 'study', 'structural', 'relaxation', 'of', 'colloidal', 'hard', 'spheres', 'undergoing', 'brownian', 'motion', 'using', 'dynamical', 'density', 'functional', 'theory', 'contrary', 'to', 'the', 'partial', 'linearization', 'route', 'stopper', 'em', 'et', 'al', 'phys', 'rev', 'e', 'bf', '92', '022151', '2015', 'wh... | [-0.09120194770085314, 0.12057324877319237, -0.11933029635072065, 0.009366040600774188, -0.02140083335960905, -0.0731595165662778, 0.04148788587966313, 0.361992770973593, -0.24457827943998078, -0.27574004761874676, 0.003416090259173264, -0.28346116400013366, -0.16523828188888728, 0.14360967917367817, -0.029915166179028... |
1,801.04568 | The dependence of galaxy clustering on tidal environment in the Sloan
Digital Sky Survey | The influence of the Cosmic Web on galaxy formation and evolution is of great
observational and theoretical interest. We investigate whether the Cosmic Web
leaves an imprint in the spatial clustering of galaxies in the Sloan Digital
Sky Survey (SDSS), using the group catalog of Yang et al. and tidal field
estimates a... | astro-ph.GA astro-ph.CO | the influence of the cosmic web on galaxy formation and evolution is of great observational and theoretical interest we investigate whether the cosmic web leaves an imprint in the spatial clustering of galaxies in the sloan digital sky survey sdss using the group catalog of yang et al and tidal field estimates at sim2h... | [['the', 'influence', 'of', 'the', 'cosmic', 'web', 'on', 'galaxy', 'formation', 'and', 'evolution', 'is', 'of', 'great', 'observational', 'and', 'theoretical', 'interest', 'we', 'investigate', 'whether', 'the', 'cosmic', 'web', 'leaves', 'an', 'imprint', 'in', 'the', 'spatial', 'clustering', 'of', 'galaxies', 'in', 't... | [-0.05671385917122717, 0.07166497702094718, -0.10843514515194322, 0.11628394043015569, -0.11363935374191085, 0.009932152398022604, 0.0008839596495982796, 0.4156587907868158, -0.18093886548258487, -0.37964110050365757, 0.012543240557290582, -0.33681194681684784, -0.10949732561369614, 0.22830650857898863, 0.0092562880528... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.