id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.09467 | A Switch to the Concern of User: Importance Coefficient in Utility
Distribution and Message Importance Measure | This paper mainly focuses on the utilization frequency in receiving end of
communication systems, which shows the inclination of the user about different
symbols. When the average number of use is limited, a specific utility
distribution is proposed on the best effort in term of fairness, which is also
the closest on... | cs.IT math.IT math.PR math.ST stat.TH | this paper mainly focuses on the utilization frequency in receiving end of communication systems which shows the inclination of the user about different symbols when the average number of use is limited a specific utility distribution is proposed on the best effort in term of fairness which is also the closest one to o... | [['this', 'paper', 'mainly', 'focuses', 'on', 'the', 'utilization', 'frequency', 'in', 'receiving', 'end', 'of', 'communication', 'systems', 'which', 'shows', 'the', 'inclination', 'of', 'the', 'user', 'about', 'different', 'symbols', 'when', 'the', 'average', 'number', 'of', 'use', 'is', 'limited', 'a', 'specific', 'u... | [-0.1592985142335677, 0.04788491636477161, -0.054602394177384626, 0.0823040111990483, -0.1334571039457274, -0.14125945671905307, 0.11689394786907048, 0.35238957080065003, -0.26339947969821476, -0.29729831918148986, 0.06481518263103528, -0.29512714377085636, -0.14611960071195293, 0.17507475468286332, -0.1231847192073278... |
1,803.09468 | Clipping free attacks against artificial neural networks | During the last years, a remarkable breakthrough has been made in AI domain
thanks to artificial deep neural networks that achieved a great success in many
machine learning tasks in computer vision, natural language processing, speech
recognition, malware detection and so on. However, they are highly vulnerable
to ea... | cs.LG cs.CR stat.ML | during the last years a remarkable breakthrough has been made in ai domain thanks to artificial deep neural networks that achieved a great success in many machine learning tasks in computer vision natural language processing speech recognition malware detection and so on however they are highly vulnerable to easily cra... | [['during', 'the', 'last', 'years', 'a', 'remarkable', 'breakthrough', 'has', 'been', 'made', 'in', 'ai', 'domain', 'thanks', 'to', 'artificial', 'deep', 'neural', 'networks', 'that', 'achieved', 'a', 'great', 'success', 'in', 'many', 'machine', 'learning', 'tasks', 'in', 'computer', 'vision', 'natural', 'language', 'p... | [-0.08454373824491981, 0.03366508844651674, -0.06788486746381409, 0.06128965723843764, -0.08323284656796745, -0.23257826903967985, 0.05461474376095151, 0.40678680192721184, -0.2281719934662692, -0.31931768139212435, 0.1409910517658065, -0.2939333966653094, -0.204757515983516, 0.21675440453385053, -0.15965032577339588, ... |
1,803.09469 | The Effects of Interfacial Recombination and Injection Barrier on the
Electrical Characteristics of Perovskite Solar Cells | Charge carrier recombination in the perovskite solar cells (PSCs) has a deep
influence on the electrical performance, such as open circuit voltage, short
circuit current, fill factor and ultimately power conversion efficiency. The
impacts of injection barrier, recombination channels, doping properties of
carrier tran... | cond-mat.mes-hall cond-mat.mtrl-sci physics.app-ph physics.optics | charge carrier recombination in the perovskite solar cells pscs has a deep influence on the electrical performance such as open circuit voltage short circuit current fill factor and ultimately power conversion efficiency the impacts of injection barrier recombination channels doping properties of carrier transport laye... | [['charge', 'carrier', 'recombination', 'in', 'the', 'perovskite', 'solar', 'cells', 'pscs', 'has', 'a', 'deep', 'influence', 'on', 'the', 'electrical', 'performance', 'such', 'as', 'open', 'circuit', 'voltage', 'short', 'circuit', 'current', 'fill', 'factor', 'and', 'ultimately', 'power', 'conversion', 'efficiency', '... | [-0.1437326498983547, 0.1489046780296134, 0.01353854699066926, -0.0033223824319594825, 0.019399780357349003, -0.13267595052049522, 0.12987484707966024, 0.39528727637445354, -0.29187395729468013, -0.31824942989975, 0.012718010671496232, -0.25701599200883657, -0.10427651728060863, 0.22053907162192812, -0.0391527545334546... |
1,803.0947 | Real Time Surveillance for Low Resolution and Limited-Data Scenarios: An
Image Set Classification Approach | This paper proposes a novel image set classification technique based on the
concept of linear regression. Unlike most other approaches, the proposed
technique does not involve any training or feature extraction. The gallery
image sets are represented as subspaces in a high dimensional space. Class
specific gallery su... | cs.CV | this paper proposes a novel image set classification technique based on the concept of linear regression unlike most other approaches the proposed technique does not involve any training or feature extraction the gallery image sets are represented as subspaces in a high dimensional space class specific gallery subspace... | [['this', 'paper', 'proposes', 'a', 'novel', 'image', 'set', 'classification', 'technique', 'based', 'on', 'the', 'concept', 'of', 'linear', 'regression', 'unlike', 'most', 'other', 'approaches', 'the', 'proposed', 'technique', 'does', 'not', 'involve', 'any', 'training', 'or', 'feature', 'extraction', 'the', 'gallery'... | [-0.05323867644611532, -0.03455580056018742, -0.05942312189131633, 0.03291316699482843, -0.07632731206597354, -0.17147085671152534, 0.002924116858918134, 0.41058096779917164, -0.23235269505115783, -0.32724950078542975, 0.13770116637822177, -0.2615660915697186, -0.11830073896957423, 0.23891217464811287, -0.1371054846402... |
1,803.09471 | Low-lying states in even Gd isotopes studied with five-dimensional
collective Hamiltonian based on covariant density functional theory | Five-dimensional collective Hamiltonian based on the covariant density
functional theory has been applied to study the the low-lying states of
even-even $^{148-162}$Gd isotopes. The shape evolution from $^{148}$Gd to
$^{162}$Gd is presented. The experimental energy spectra and intraband $B(E2)$
transition probabiliti... | nucl-th | fivedimensional collective hamiltonian based on the covariant density functional theory has been applied to study the the lowlying states of eveneven 148162gd isotopes the shape evolution from 148gd to 162gd is presented the experimental energy spectra and intraband be2 transition probabilities for the 148162gd isotope... | [['fivedimensional', 'collective', 'hamiltonian', 'based', 'on', 'the', 'covariant', 'density', 'functional', 'theory', 'has', 'been', 'applied', 'to', 'study', 'the', 'the', 'lowlying', 'states', 'of', 'eveneven', '148162gd', 'isotopes', 'the', 'shape', 'evolution', 'from', '148gd', 'to', '162gd', 'is', 'presented', '... | [-0.03854198754351172, 0.17849524710327386, -0.05838292749702102, 0.11534023417625576, 0.04993686570475499, -0.09870442333113816, 0.027473856010732964, 0.39209698498662976, -0.12950767476836011, -0.289877253688044, -0.05837051924059374, -0.356924422395726, -0.07832798404722578, 0.13817935256132235, 0.05549143198877573,... |
1,803.09472 | Analytic estimation of transition between instantaneous eigenstates of
quantum two-level system | Transition amplitudes between instantaneous eigenstates of quantum two-level
system are evaluated analytically on the basis of a new parametrization of its
evolution operator, which has recently been proposed to construct exact
solutions. In particular, they are estimated when the Hamiltonian varies
infinitesimally s... | quant-ph | transition amplitudes between instantaneous eigenstates of quantum twolevel system are evaluated analytically on the basis of a new parametrization of its evolution operator which has recently been proposed to construct exact solutions in particular they are estimated when the hamiltonian varies infinitesimally slowly ... | [['transition', 'amplitudes', 'between', 'instantaneous', 'eigenstates', 'of', 'quantum', 'twolevel', 'system', 'are', 'evaluated', 'analytically', 'on', 'the', 'basis', 'of', 'a', 'new', 'parametrization', 'of', 'its', 'evolution', 'operator', 'which', 'has', 'recently', 'been', 'proposed', 'to', 'construct', 'exact',... | [-0.1371851269377214, 0.15832267338910463, -0.13496056864628705, 0.0704676408232644, -0.025665651404912154, -0.16368134738877416, 0.0612618622182664, 0.3696298971772194, -0.2125676421266867, -0.2627747848788958, 0.07776313438364191, -0.22220770542640467, -0.1399405994566112, 0.18836610949393817, -0.007012153436179932, ... |
1,803.09473 | code2vec: Learning Distributed Representations of Code | We present a neural model for representing snippets of code as continuous
distributed vectors ("code embeddings"). The main idea is to represent a code
snippet as a single fixed-length $\textit{code vector}$, which can be used to
predict semantic properties of the snippet. This is performed by decomposing
code to a c... | cs.LG cs.AI cs.PL stat.ML | we present a neural model for representing snippets of code as continuous distributed vectors code embeddings the main idea is to represent a code snippet as a single fixedlength textitcode vector which can be used to predict semantic properties of the snippet this is performed by decomposing code to a collection of pa... | [['we', 'present', 'a', 'neural', 'model', 'for', 'representing', 'snippets', 'of', 'code', 'as', 'continuous', 'distributed', 'vectors', 'code', 'embeddings', 'the', 'main', 'idea', 'is', 'to', 'represent', 'a', 'code', 'snippet', 'as', 'a', 'single', 'fixedlength', 'textitcode', 'vector', 'which', 'can', 'be', 'used'... | [-0.017369034501172387, 0.013337573712650411, -0.10004566827544815, 0.07463436589454238, -0.10569686395143277, -0.14994059580245997, 0.07050487655441015, 0.4428695213700672, -0.29466832049408004, -0.3369984087597543, 0.053656820548603365, -0.2966382228498103, -0.15352400191901341, 0.20421762584970848, -0.06745878451851... |
1,803.09474 | Semantic See-Through Rendering on Light Fields | We present a novel semantic light field (LF) refocusing technique that can
achieve unprecedented see-through quality. Different from prior art, our
semantic see-through (SST) differentiates rays in their semantic meaning and
depth. Specifically, we combine deep learning and stereo matching to provide
each ray a seman... | cs.CV | we present a novel semantic light field lf refocusing technique that can achieve unprecedented seethrough quality different from prior art our semantic seethrough sst differentiates rays in their semantic meaning and depth specifically we combine deep learning and stereo matching to provide each ray a semantic label we... | [['we', 'present', 'a', 'novel', 'semantic', 'light', 'field', 'lf', 'refocusing', 'technique', 'that', 'can', 'achieve', 'unprecedented', 'seethrough', 'quality', 'different', 'from', 'prior', 'art', 'our', 'semantic', 'seethrough', 'sst', 'differentiates', 'rays', 'in', 'their', 'semantic', 'meaning', 'and', 'depth',... | [-0.019106816167157946, 0.045176672679315064, -0.08247807685413636, 0.07828835217629139, -0.14021943456164615, -0.10701046497606691, 0.04253010301595079, 0.5131357048327724, -0.25313704057286185, -0.3399824499992617, 0.014258434838505791, -0.26251753459812377, -0.17024512794644883, 0.20634508785773434, -0.1346359679420... |
1,803.09475 | Theoretical spin-wave dispersions in the antiferromagnetic phase AF1 of
MnWO$_4$ based on the polar atomistic model in P2 | The spin wave dispersions of the low temperature antiferromagnetic phase
(AF1) MnWO$_4$ have been numerically calculated based on the recently reported
non-collinear spin configuration with two different canting angles. A
Heisenberg model with competing magnetic exchange couplings and single-ion
anisotropy terms coul... | cond-mat.mtrl-sci | the spin wave dispersions of the low temperature antiferromagnetic phase af1 mnwo_4 have been numerically calculated based on the recently reported noncollinear spin configuration with two different canting angles a heisenberg model with competing magnetic exchange couplings and singleion anisotropy terms could properl... | [['the', 'spin', 'wave', 'dispersions', 'of', 'the', 'low', 'temperature', 'antiferromagnetic', 'phase', 'af1', 'mnwo_4', 'have', 'been', 'numerically', 'calculated', 'based', 'on', 'the', 'recently', 'reported', 'noncollinear', 'spin', 'configuration', 'with', 'two', 'different', 'canting', 'angles', 'a', 'heisenberg'... | [-0.21392029397031095, 0.2961272502793594, 0.024583386168121658, 0.07697370649746402, -0.08664372335144745, -0.11875047321193555, -0.013755601404749967, 0.43044612951021877, -0.24560507922433317, -0.2950320215697618, -0.017972662559452842, -0.301151055842638, -0.04709197914208028, 0.13535585809756626, 0.166522608554743... |
1,803.09476 | Gromov-Witten theory with derived algebraic geometry | In this survey we add two new results that are not in our paper [MR15]. Using
the idea of brane actions discovered by Toen, we construct a lax associative
action of the operad of stable curves of genus zero on a smooth variety X seen
as an object in correspondences in derived stacks. This action encodes the
Gromov-Wi... | math.AG | in this survey we add two new results that are not in our paper mr15 using the idea of brane actions discovered by toen we construct a lax associative action of the operad of stable curves of genus zero on a smooth variety x seen as an object in correspondences in derived stacks this action encodes the gromovwitten the... | [['in', 'this', 'survey', 'we', 'add', 'two', 'new', 'results', 'that', 'are', 'not', 'in', 'our', 'paper', 'mr15', 'using', 'the', 'idea', 'of', 'brane', 'actions', 'discovered', 'by', 'toen', 'we', 'construct', 'a', 'lax', 'associative', 'action', 'of', 'the', 'operad', 'of', 'stable', 'curves', 'of', 'genus', 'zero'... | [-0.17768719858577242, 0.025547443003461012, -0.13466015900485218, 0.060055539548557135, -0.08301105129066855, -0.10624173590622377, -0.005115903877594974, 0.35947958209726494, -0.3179105660528876, -0.24416604267025832, 0.04722507366386708, -0.2257493118813727, -0.22171632392564788, 0.1960067257459741, -0.2242936006514... |
1,803.09477 | Reignited star formation in dwarf galaxies quenched during reionization | Irregular dwarf galaxies of the Local Group have very varied properties and
star formation histories. Some of them formed the majority of their stars very
late compared to the others. Extreme examples are Leo A and Aquarius which
reached the peak of star formation at $z<1$ ( > 6 Gyr after BB). This fact
seemingly cha... | astro-ph.GA | irregular dwarf galaxies of the local group have very varied properties and star formation histories some of them formed the majority of their stars very late compared to the others extreme examples are leo a and aquarius which reached the peak of star formation at z1 6 gyr after bb this fact seemingly challenges the l... | [['irregular', 'dwarf', 'galaxies', 'of', 'the', 'local', 'group', 'have', 'very', 'varied', 'properties', 'and', 'star', 'formation', 'histories', 'some', 'of', 'them', 'formed', 'the', 'majority', 'of', 'their', 'stars', 'very', 'late', 'compared', 'to', 'the', 'others', 'extreme', 'examples', 'are', 'leo', 'a', 'and... | [-0.0743135138091205, 0.153929599881038, -0.12496277121353452, 0.14856891678606743, -0.10330455382749186, -0.02993976162209854, 0.014512170156290345, 0.3881718157853742, -0.13445769900582352, -0.38007021207023034, 0.02476451206021011, -0.2367228923649606, -0.02500947523325429, 0.1461840099363067, -0.034538361425432616,... |
1,803.09478 | User Positioning in mmW 5G Networks using Beam-RSRP Measurements and
Kalman Filtering | In this paper, we exploit the 3D-beamforming features of multiantenna
equipment employed in fifth generation (5G) networks, operating in the
millimeter wave (mmW) band, for accurate positioning and tracking of users. We
consider sequential estimation of users' positions, and propose a two-stage
extended Kalman filter... | cs.IT eess.SP math.IT | in this paper we exploit the 3dbeamforming features of multiantenna equipment employed in fifth generation 5g networks operating in the millimeter wave mmw band for accurate positioning and tracking of users we consider sequential estimation of users positions and propose a twostage extended kalman filter ekf that is b... | [['in', 'this', 'paper', 'we', 'exploit', 'the', '3dbeamforming', 'features', 'of', 'multiantenna', 'equipment', 'employed', 'in', 'fifth', 'generation', '5g', 'networks', 'operating', 'in', 'the', 'millimeter', 'wave', 'mmw', 'band', 'for', 'accurate', 'positioning', 'and', 'tracking', 'of', 'users', 'we', 'consider',... | [-0.20188942609948288, -0.007522727146946326, 0.01766806300729513, -0.007566419165445174, -0.07493734207890201, -0.2398209317610031, 0.07857046590652317, 0.4168496992140895, -0.22584057610209396, -0.27757447245065386, 0.09257138409231586, -0.2590897407269151, -0.16697326845279326, 0.16343346432464698, -0.10146997822448... |
1,803.09479 | Interpolation error of misspecified Gaussian process regression | An interpolation error is an integral of the squared error of a regression
model over a domain of interest. We consider the interpolation error for the
case of misspecified Gaussian process regression: used covariance function
differs from the true one. We derive the interpolation error for an infinite
grid design of... | math.ST stat.TH | an interpolation error is an integral of the squared error of a regression model over a domain of interest we consider the interpolation error for the case of misspecified gaussian process regression used covariance function differs from the true one we derive the interpolation error for an infinite grid design of expe... | [['an', 'interpolation', 'error', 'is', 'an', 'integral', 'of', 'the', 'squared', 'error', 'of', 'a', 'regression', 'model', 'over', 'a', 'domain', 'of', 'interest', 'we', 'consider', 'the', 'interpolation', 'error', 'for', 'the', 'case', 'of', 'misspecified', 'gaussian', 'process', 'regression', 'used', 'covariance', ... | [-0.053657082477669926, -0.015864653897993995, -0.05437388704286529, 0.1612503869794161, -0.0463693319657527, -0.12699574094539115, 0.05136823100507806, 0.3968265040888699, -0.28945341961214816, -0.232366822053328, 0.14459286155414108, -0.255801384567941, -0.16878103121363242, 0.20754013163808716, -0.11266503880364359,... |
1,803.0948 | Diagrammatic treatment of few-photon scattering from a Rydberg blockaded
atomic ensemble in a cavity | In a previous letter we studied the giant optical nonlinearities of a Rydberg
atomic medium within an optical cavity, in the Schwinger-Keldysh formalism. In
particular, we calculated the non-linear contributions to the spectrum of the
light transmitted through the cavity. In this article we spell out the
essential de... | quant-ph physics.atom-ph physics.optics | in a previous letter we studied the giant optical nonlinearities of a rydberg atomic medium within an optical cavity in the schwingerkeldysh formalism in particular we calculated the nonlinear contributions to the spectrum of the light transmitted through the cavity in this article we spell out the essential details of... | [['in', 'a', 'previous', 'letter', 'we', 'studied', 'the', 'giant', 'optical', 'nonlinearities', 'of', 'a', 'rydberg', 'atomic', 'medium', 'within', 'an', 'optical', 'cavity', 'in', 'the', 'schwingerkeldysh', 'formalism', 'in', 'particular', 'we', 'calculated', 'the', 'nonlinear', 'contributions', 'to', 'the', 'spectru... | [-0.1307206464676573, 0.1376561843319236, -0.07491096673875977, 0.07647072724593838, 0.016879372720448475, -0.07093137487898721, 0.0629099587380517, 0.4022082581694396, -0.23869508381862686, -0.2769762286564933, 0.018849343403005304, -0.26416213651416154, -0.16056347824633121, 0.17293435712081362, 0.019552193780842605,... |
1,803.09481 | Uniqueness of the sum of points of the period five cycle of quadratic
polynomials | It is well known that the sum of points of the period five cycle of the
quadratic polynomial $f_{c}(x)=x^{2}+c$ is generally not one-valued. In this
paper we will show that the sum of cycle points of the curves of period five is
at most three-valued on a new coordinate plane, and that this result is
essentially the b... | math.DS | it is well known that the sum of points of the period five cycle of the quadratic polynomial f_cxx2c is generally not onevalued in this paper we will show that the sum of cycle points of the curves of period five is at most threevalued on a new coordinate plane and that this result is essentially the best possible the ... | [['it', 'is', 'well', 'known', 'that', 'the', 'sum', 'of', 'points', 'of', 'the', 'period', 'five', 'cycle', 'of', 'the', 'quadratic', 'polynomial', 'f_cxx2c', 'is', 'generally', 'not', 'onevalued', 'in', 'this', 'paper', 'we', 'will', 'show', 'that', 'the', 'sum', 'of', 'cycle', 'points', 'of', 'the', 'curves', 'of', ... | [-0.17008805491077977, 0.06377033937053803, -0.11128267338977028, 0.013120080407064121, -0.06945001567678097, -0.06992964228042044, 0.06425009424147458, 0.3029214170976327, -0.2835300344785747, -0.2560374804485876, 0.14143616545987195, -0.2491774001182654, -0.2160789932195957, 0.26204568948835516, -0.07653119944883749,... |
1,803.09482 | A new approach to simple modules for preprojective algebras | The work of the first author on the moment map for representations of quivers
included a classification of the possible dimension vectors of simple modules
for deformed preprojective algebras. That classification was later used to
solve an additive analogue of the Deligne-Simpson problem. The last step in the
proof o... | math.RT | the work of the first author on the moment map for representations of quivers included a classification of the possible dimension vectors of simple modules for deformed preprojective algebras that classification was later used to solve an additive analogue of the delignesimpson problem the last step in the proof of the... | [['the', 'work', 'of', 'the', 'first', 'author', 'on', 'the', 'moment', 'map', 'for', 'representations', 'of', 'quivers', 'included', 'a', 'classification', 'of', 'the', 'possible', 'dimension', 'vectors', 'of', 'simple', 'modules', 'for', 'deformed', 'preprojective', 'algebras', 'that', 'classification', 'was', 'later... | [-0.0911107032434709, 0.014451803982044126, -0.09906099287014622, 0.08565817334438994, -0.11319133366194012, -0.12375262579203013, 0.022740483343941784, 0.32215565587602446, -0.31392769170091, -0.2340144355148911, 0.11539518912218567, -0.19593549111107392, -0.1935027649090973, 0.1930639284815806, -0.15233805831243744, ... |
1,803.09483 | Clustering to Given Connectivities | We define a general variant of the graph clustering problem where the
criterion of density for the clusters is (high) connectivity. In {\sc
Clustering to Given Connectivities}, we are given an $n$-vertex graph $G$, an
integer $k$, and a sequence $\Lambda=\langle
\lambda_{1},\ldots,\lambda_{t}\rangle$ of positive inte... | cs.DS | we define a general variant of the graph clustering problem where the criterion of density for the clusters is high connectivity in sc clustering to given connectivities we are given an nvertex graph g an integer k and a sequence lambdalangle lambda_1ldotslambda_trangle of positive integers and we ask whether it is pos... | [['we', 'define', 'a', 'general', 'variant', 'of', 'the', 'graph', 'clustering', 'problem', 'where', 'the', 'criterion', 'of', 'density', 'for', 'the', 'clusters', 'is', 'high', 'connectivity', 'in', 'sc', 'clustering', 'to', 'given', 'connectivities', 'we', 'are', 'given', 'an', 'nvertex', 'graph', 'g', 'an', 'integer... | [-0.16617658154831993, 0.12251998034834186, -0.07117872801609337, 0.04592286063982303, -0.1215533784141169, -0.1624758197576739, 0.05592162514626074, 0.4067212170145164, -0.3237978755795565, -0.3285762537852861, 0.062150604326032206, -0.2706053285930668, -0.16539564917911775, 0.1312426771045365, -0.05399452906325072, 0... |
1,803.09484 | Quantum key distribution with setting-choice-independently correlated
light sources | Despite the enormous theoretical and experimental progress made so far in
quantum key distribution (QKD), the security of most existing QKD
implementations is not rigorously established yet. A critical obstacle is that
almost all existing security proofs make ideal assumptions on the QKD devices.
Problematically, suc... | quant-ph | despite the enormous theoretical and experimental progress made so far in quantum key distribution qkd the security of most existing qkd implementations is not rigorously established yet a critical obstacle is that almost all existing security proofs make ideal assumptions on the qkd devices problematically such assump... | [['despite', 'the', 'enormous', 'theoretical', 'and', 'experimental', 'progress', 'made', 'so', 'far', 'in', 'quantum', 'key', 'distribution', 'qkd', 'the', 'security', 'of', 'most', 'existing', 'qkd', 'implementations', 'is', 'not', 'rigorously', 'established', 'yet', 'a', 'critical', 'obstacle', 'is', 'that', 'almost... | [-0.1908760453082828, 0.07063706321848763, -0.11371221013781097, 0.05992083726606021, -0.0030573333034084904, -0.22822797145073612, 0.07636748917142136, 0.40073727030720974, -0.2451569567543144, -0.27921848712075087, 0.10954218567918159, -0.24972960761230853, -0.09894785959584018, 0.2513680707042416, -0.132126520607206... |
1,803.09485 | Comparing the degrees of enumerability and the closed Medvedev degrees | We compare the degrees of enumerability and the closed Medvedev degrees and
find that many situations occur. There are nonzero closed degrees that do not
bound nonzero degrees of enumerability, there are nonzero degrees of
enumerability that do not bound nonzero closed degrees, and there are degrees
that are nontrivi... | math.LO | we compare the degrees of enumerability and the closed medvedev degrees and find that many situations occur there are nonzero closed degrees that do not bound nonzero degrees of enumerability there are nonzero degrees of enumerability that do not bound nonzero closed degrees and there are degrees that are nontrivially ... | [['we', 'compare', 'the', 'degrees', 'of', 'enumerability', 'and', 'the', 'closed', 'medvedev', 'degrees', 'and', 'find', 'that', 'many', 'situations', 'occur', 'there', 'are', 'nonzero', 'closed', 'degrees', 'that', 'do', 'not', 'bound', 'nonzero', 'degrees', 'of', 'enumerability', 'there', 'are', 'nonzero', 'degrees'... | [-0.3022906006096977, 0.2648693246843472, -0.03262446633195632, 0.011561246308153623, -0.06126884978315602, -0.13369074254615665, 0.03342474142268096, 0.3511282659123001, -0.21705113596295658, -0.26164111872650175, 0.05719284130234833, -0.27690618214746043, -0.14383902860014405, 0.14070552791953597, -0.0534611735365366... |
1,803.09486 | Continuity properties of multilinear localization operators on
modulation spaces | We introduce multilinear localization operators in terms of the short-time
Fourier transform, and multilinear Weyl pseudodifferential operators. We prove
that such localization operators are in fact Weyl pseudodifferential operators
whose symbols are given by the convolution between the symbol of the
localization ope... | math.FA | we introduce multilinear localization operators in terms of the shorttime fourier transform and multilinear weyl pseudodifferential operators we prove that such localization operators are in fact weyl pseudodifferential operators whose symbols are given by the convolution between the symbol of the localization operator... | [['we', 'introduce', 'multilinear', 'localization', 'operators', 'in', 'terms', 'of', 'the', 'shorttime', 'fourier', 'transform', 'and', 'multilinear', 'weyl', 'pseudodifferential', 'operators', 'we', 'prove', 'that', 'such', 'localization', 'operators', 'are', 'in', 'fact', 'weyl', 'pseudodifferential', 'operators', '... | [-0.12437483616830672, 0.09311086429173455, -0.050674764236763994, 0.13039242492660003, -0.09588522140402347, -0.07193298611570807, -0.01822489663712023, 0.34492963648894254, -0.35448408959543004, -0.1262723129680928, 0.15388920306885506, -0.29620713875355087, -0.2528902869890718, 0.21787513326853514, -0.10259184171171... |
1,803.09487 | Lower bounds on the maximum delay margin by analytic interpolation | We study the delay margin problem in the context of recent works by T. Qi, J.
Zhu, and J. Chen, where a sufficient condition for the maximal delay margin is
formulated in terms of an interpolation problem obtained after introducing a
rational approximation. Instead we omit the approximation step and solve the
same pr... | math.OC cs.SY eess.SY | we study the delay margin problem in the context of recent works by t qi j zhu and j chen where a sufficient condition for the maximal delay margin is formulated in terms of an interpolation problem obtained after introducing a rational approximation instead we omit the approximation step and solve the same problem dir... | [['we', 'study', 'the', 'delay', 'margin', 'problem', 'in', 'the', 'context', 'of', 'recent', 'works', 'by', 't', 'qi', 'j', 'zhu', 'and', 'j', 'chen', 'where', 'a', 'sufficient', 'condition', 'for', 'the', 'maximal', 'delay', 'margin', 'is', 'formulated', 'in', 'terms', 'of', 'an', 'interpolation', 'problem', 'obtaine... | [-0.11140373663135594, 0.018419822193688453, -0.058674630568793386, 0.056402389749994765, -0.08517857345061437, -0.11429046675743114, 0.12981610974392063, 0.35687169290438137, -0.3049076705850581, -0.3140438300587477, 0.09982126476042853, -0.2187542775145141, -0.17115443320794693, 0.1838585216732275, -0.135281480217893... |
1,803.09488 | Solving linear parabolic rough partial differential equations | We study linear rough partial differential equations in the setting of [Friz
and Hairer, Springer, 2014, Chapter 12]. More precisely, we consider a linear
parabolic partial differential equation driven by a deterministic rough path
$\mathbf{W}$ of H\"older regularity $\alpha$ with $1/3 < \alpha
\le 1/2$. Based on a... | math.PR | we study linear rough partial differential equations in the setting of friz and hairer springer 2014 chapter 12 more precisely we consider a linear parabolic partial differential equation driven by a deterministic rough path mathbfw of holder regularity alpha with 13 alpha le 12 based on a stochastic representation of ... | [['we', 'study', 'linear', 'rough', 'partial', 'differential', 'equations', 'in', 'the', 'setting', 'of', 'friz', 'and', 'hairer', 'springer', '2014', 'chapter', '12', 'more', 'precisely', 'we', 'consider', 'a', 'linear', 'parabolic', 'partial', 'differential', 'equation', 'driven', 'by', 'a', 'deterministic', 'rough',... | [-0.10006083526125227, -0.0124453137076534, -0.1023397953805835, 0.06659124034716525, -0.1007429636928327, -0.09697472735151516, 0.035687484020218915, 0.31178740553755674, -0.2913477573774557, -0.2763096975838452, 0.12354164497011992, -0.27887639222847943, -0.1897465130396649, 0.2034701842575672, -0.055411048583785254,... |
1,803.09489 | Genome packaging within icosahedral capsids and large-scale segmentation
in viral genomic sequences | The assembly and maturation of viruses with icosahedral capsids must be
coordinated with icosahedral symmetry. The icosahedral symmetry imposes also
the restrictions on the cooperative specific interactions between genomic
RNA/DNA and coat proteins that should be reflected in quasi-regular
segmentation of viral genom... | q-bio.QM q-bio.BM | the assembly and maturation of viruses with icosahedral capsids must be coordinated with icosahedral symmetry the icosahedral symmetry imposes also the restrictions on the cooperative specific interactions between genomic rnadna and coat proteins that should be reflected in quasiregular segmentation of viral genomic se... | [['the', 'assembly', 'and', 'maturation', 'of', 'viruses', 'with', 'icosahedral', 'capsids', 'must', 'be', 'coordinated', 'with', 'icosahedral', 'symmetry', 'the', 'icosahedral', 'symmetry', 'imposes', 'also', 'the', 'restrictions', 'on', 'the', 'cooperative', 'specific', 'interactions', 'between', 'genomic', 'rnadna',... | [-0.11386149300038723, 0.12191862629330026, -0.05082068668873197, 0.10662331544831026, -0.03616816664372783, -0.13299899659376582, 0.030030149081549006, 0.4137900179565543, -0.26983509330300265, -0.2688074945204195, 0.08837618183351519, -0.2668640368101118, -0.24228843136593736, 0.1501513537063291, -0.09166515910523104... |
1,803.0949 | Unsupervised Learning and Segmentation of Complex Activities from Video | This paper presents a new method for unsupervised segmentation of complex
activities from video into multiple steps, or sub-activities, without any
textual input. We propose an iterative discriminative-generative approach which
alternates between discriminatively learning the appearance of sub-activities
from the vid... | cs.CV | this paper presents a new method for unsupervised segmentation of complex activities from video into multiple steps or subactivities without any textual input we propose an iterative discriminativegenerative approach which alternates between discriminatively learning the appearance of subactivities from the videos visu... | [['this', 'paper', 'presents', 'a', 'new', 'method', 'for', 'unsupervised', 'segmentation', 'of', 'complex', 'activities', 'from', 'video', 'into', 'multiple', 'steps', 'or', 'subactivities', 'without', 'any', 'textual', 'input', 'we', 'propose', 'an', 'iterative', 'discriminativegenerative', 'approach', 'which', 'alte... | [-0.019807030223309995, -0.0007029422825144138, -0.09310184885489889, 0.056495596980676056, -0.14097330174874514, -0.1439926779596135, 0.03226636288804002, 0.466547141559422, -0.24475504256784916, -0.3393632200174034, 0.018089765630429612, -0.27844442875590175, -0.1950992793275509, 0.13848447474883868, -0.1541391118941... |
1,803.09491 | The decisive future of inflation | How much more will we learn about single-field inflationary models in the
future? We address this question in the context of Bayesian design and
information theory. We develop a novel method to compute the expected utility
of deciding between models and apply it to a set of futuristic measurements.
This necessarily r... | astro-ph.CO hep-th | how much more will we learn about singlefield inflationary models in the future we address this question in the context of bayesian design and information theory we develop a novel method to compute the expected utility of deciding between models and apply it to a set of futuristic measurements this necessarily require... | [['how', 'much', 'more', 'will', 'we', 'learn', 'about', 'singlefield', 'inflationary', 'models', 'in', 'the', 'future', 'we', 'address', 'this', 'question', 'in', 'the', 'context', 'of', 'bayesian', 'design', 'and', 'information', 'theory', 'we', 'develop', 'a', 'novel', 'method', 'to', 'compute', 'the', 'expected', '... | [-0.043825366764501376, 0.047393616709463834, -0.10251709096697956, 0.10549174859251424, -0.1161166205163206, -0.12255604485855312, 0.056255082586708874, 0.38340417555373935, -0.2548854129099463, -0.3436124551147726, 0.10645647756629498, -0.2344260265986327, -0.13774137132222186, 0.20721056595809656, -0.052930512920710... |
1,803.09492 | Latency and Throughput Characterization of Convolutional Neural Networks
for Mobile Computer Vision | We study performance characteristics of convolutional neural networks (CNN)
for mobile computer vision systems. CNNs have proven to be a powerful and
efficient approach to implement such systems. However, the system performance
depends largely on the utilization of hardware accelerators, which are able to
speed up th... | cs.CV | we study performance characteristics of convolutional neural networks cnn for mobile computer vision systems cnns have proven to be a powerful and efficient approach to implement such systems however the system performance depends largely on the utilization of hardware accelerators which are able to speed up the execut... | [['we', 'study', 'performance', 'characteristics', 'of', 'convolutional', 'neural', 'networks', 'cnn', 'for', 'mobile', 'computer', 'vision', 'systems', 'cnns', 'have', 'proven', 'to', 'be', 'a', 'powerful', 'and', 'efficient', 'approach', 'to', 'implement', 'such', 'systems', 'however', 'the', 'system', 'performance',... | [-0.16792989295063307, -0.010121745138894767, -0.060484698248910715, 0.014213704229041469, -0.06643699630221818, -0.21063162365171592, 0.006015226506860927, 0.4652780540112872, -0.25184798750269694, -0.35157629146706315, 0.12714109645457938, -0.2557822353905067, -0.21055982225807385, 0.3088032957399264, -0.084425119051... |
1,803.09493 | Manipulability Maximization Using Continuous-Time Gaussian Processes | A significant challenge in motion planning is to avoid being in or near
\emph{singular configurations} (\textit{singularities}), that is, joint
configurations that result in the loss of the ability to move in certain
directions in task space. A robotic system's capacity for motion is reduced
even in regions that are ... | cs.RO | a significant challenge in motion planning is to avoid being in or near emphsingular configurations textitsingularities that is joint configurations that result in the loss of the ability to move in certain directions in task space a robotic systems capacity for motion is reduced even in regions that are in close proxi... | [['a', 'significant', 'challenge', 'in', 'motion', 'planning', 'is', 'to', 'avoid', 'being', 'in', 'or', 'near', 'emphsingular', 'configurations', 'textitsingularities', 'that', 'is', 'joint', 'configurations', 'that', 'result', 'in', 'the', 'loss', 'of', 'the', 'ability', 'to', 'move', 'in', 'certain', 'directions', '... | [-0.13437739501147838, 0.016452736552529688, -0.10805853051383474, 0.0558512812345945, -0.0974010299616212, -0.10829908637042414, 0.06991180836304323, 0.417350710888437, -0.2913644908389839, -0.2926335407971036, 0.08558081034586558, -0.2893448369796294, -0.15955575948093562, 0.15962246721672932, -0.15982904637329307, 0... |
1,803.09494 | Equation of state of boron subarsenide B12As2 to 47 GPa | Compressibility of boron subarsenide B12As2 has been studied by synchrotron
X-ray diffraction up to 47 GPa at room temperature in a diamond anvil cell
using Ne pressure transmitting medium. A fit of experimental p-V data by Vinet
equation of state yielded the bulk modulus of 150(4) GPa and its first pressure
derivati... | cond-mat.mtrl-sci | compressibility of boron subarsenide b12as2 has been studied by synchrotron xray diffraction up to 47 gpa at room temperature in a diamond anvil cell using ne pressure transmitting medium a fit of experimental pv data by vinet equation of state yielded the bulk modulus of 1504 gpa and its first pressure derivative of 6... | [['compressibility', 'of', 'boron', 'subarsenide', 'b12as2', 'has', 'been', 'studied', 'by', 'synchrotron', 'xray', 'diffraction', 'up', 'to', '47', 'gpa', 'at', 'room', 'temperature', 'in', 'a', 'diamond', 'anvil', 'cell', 'using', 'ne', 'pressure', 'transmitting', 'medium', 'a', 'fit', 'of', 'experimental', 'pv', 'da... | [-0.07291444500718834, 0.17991530633200023, -0.09255924367669464, -0.12019609539943227, -0.00976723047383761, -0.121730453674129, 0.18718674449818368, 0.4628115420750642, -0.248917008544934, -0.3036363931625324, 0.0385002837244074, -0.3777929142243781, -0.007090687171666552, 0.12574427011343886, 0.06368872465272789, 0.... |
1,803.09495 | Symmetry Breaking and Lattice Kirigami | In this work we consider an interacting quantum field theory on a curved
two-dimensional manifold that we construct by geometrically deforming a flat
hexagonal lattice by the insertion of a defect. Depending on how the
deformation is done, the resulting geometry acquires a locally non-vanishing
curvature that can be ... | hep-th cond-mat.str-el gr-qc math-ph math.MP | in this work we consider an interacting quantum field theory on a curved twodimensional manifold that we construct by geometrically deforming a flat hexagonal lattice by the insertion of a defect depending on how the deformation is done the resulting geometry acquires a locally nonvanishing curvature that can be either... | [['in', 'this', 'work', 'we', 'consider', 'an', 'interacting', 'quantum', 'field', 'theory', 'on', 'a', 'curved', 'twodimensional', 'manifold', 'that', 'we', 'construct', 'by', 'geometrically', 'deforming', 'a', 'flat', 'hexagonal', 'lattice', 'by', 'the', 'insertion', 'of', 'a', 'defect', 'depending', 'on', 'how', 'th... | [-0.17293123169910424, 0.19557219385119812, -0.08351183641528667, 0.024170087188366773, -0.09638388988800174, -0.12692414906756708, -0.011123191270175888, 0.368393830947809, -0.2523814834647112, -0.25058260729965975, 0.11406377631748571, -0.2155674867974522, -0.1892061174338207, 0.14833996261383386, -0.0621936251553742... |
1,803.09496 | On the loss of Fisher information in some multi-object tracking
observation models | The concept of Fisher information can be useful even in cases where the
probability distributions of interest are not absolutely continuous with
respect to the natural reference measure on the underlying space. Practical
examples where this extension is useful are provided in the context of
multi-object tracking stat... | math.ST stat.TH | the concept of fisher information can be useful even in cases where the probability distributions of interest are not absolutely continuous with respect to the natural reference measure on the underlying space practical examples where this extension is useful are provided in the context of multiobject tracking statisti... | [['the', 'concept', 'of', 'fisher', 'information', 'can', 'be', 'useful', 'even', 'in', 'cases', 'where', 'the', 'probability', 'distributions', 'of', 'interest', 'are', 'not', 'absolutely', 'continuous', 'with', 'respect', 'to', 'the', 'natural', 'reference', 'measure', 'on', 'the', 'underlying', 'space', 'practical',... | [-0.03197943139448165, 0.04553688167092892, -0.13243150679418483, 0.10234346028226309, -0.08670759221347861, -0.14777004636991292, 0.00765163420389096, 0.3825713750064516, -0.26918205926314187, -0.28664183390747683, 0.14496712272730058, -0.2731728457356206, -0.14458186704760942, 0.22199850929423404, -0.1456524007685052... |
1,803.09497 | Long time behavior of the volume of the Wiener sausage on Dirichlet
spaces | In the present paper, we consider long time behaviors of the volume of the
Wiener sausage on Dirichlet spaces. We focus on the volume of the Wiener
sausage for diffusion processes on metric measure spaces other than the Euclid
space equipped with the Lebesgue measure. We obtain the growth rate of the
expectations and... | math.PR | in the present paper we consider long time behaviors of the volume of the wiener sausage on dirichlet spaces we focus on the volume of the wiener sausage for diffusion processes on metric measure spaces other than the euclid space equipped with the lebesgue measure we obtain the growth rate of the expectations and almo... | [['in', 'the', 'present', 'paper', 'we', 'consider', 'long', 'time', 'behaviors', 'of', 'the', 'volume', 'of', 'the', 'wiener', 'sausage', 'on', 'dirichlet', 'spaces', 'we', 'focus', 'on', 'the', 'volume', 'of', 'the', 'wiener', 'sausage', 'for', 'diffusion', 'processes', 'on', 'metric', 'measure', 'spaces', 'other', '... | [-0.12436288642065992, 0.11641142386418771, -0.08993634191297349, 0.11343005548198042, -0.07745012034854246, -0.02803333163897078, 0.023744780526843867, 0.3672289008289457, -0.2652600591795312, -0.16315140413297785, 0.1754456143817007, -0.3268911782060824, -0.0969982182843581, 0.21507577776228862, -0.10572086756915919,... |
1,803.09498 | Alternative interpretation of the Pl\"ucker quadric's ambient space and
its application | It is well-known that there exists a bijection between the set of lines of
the projective 3-dimensional space $P^3$ and all real points of the so-called
Pl\"ucker quadric $\Psi$. Moreover one can identify each point of the Pl\"ucker
quadric's ambient space with a linear complex of lines in $P^3$. Within this
paper we... | cs.CG | it is wellknown that there exists a bijection between the set of lines of the projective 3dimensional space p3 and all real points of the socalled plucker quadric psi moreover one can identify each point of the plucker quadrics ambient space with a linear complex of lines in p3 within this paper we give an alternative ... | [['it', 'is', 'wellknown', 'that', 'there', 'exists', 'a', 'bijection', 'between', 'the', 'set', 'of', 'lines', 'of', 'the', 'projective', '3dimensional', 'space', 'p3', 'and', 'all', 'real', 'points', 'of', 'the', 'socalled', 'plucker', 'quadric', 'psi', 'moreover', 'one', 'can', 'identify', 'each', 'point', 'of', 'th... | [-0.17858027777457167, 0.06953073421325479, -0.04662602288382394, 0.04234512035812562, -0.07206431490125223, -0.1222313227331532, 0.01790827456141068, 0.4028051064868036, -0.2530008161529189, -0.21924016508939012, 0.08294883263408251, -0.2646849167533219, -0.17780590474694258, 0.23171306275540873, -0.09051374135583284,... |
1,803.09499 | Inverse scattering for Schr\"{o}dinger operators on perturbed lattices | We study the inverse scattering for Schr{\"o}dinger operators on locally
perturbed periodic lattices. We show that the associated scattering matrix is
equivalent to the Dirichlet-to-Neumann map for a boundary value problem on a
finite part of the graph, and reconstruct scalar potentials as well as the
graph structure... | math.SP | we study the inverse scattering for schrodinger operators on locally perturbed periodic lattices we show that the associated scattering matrix is equivalent to the dirichlettoneumann map for a boundary value problem on a finite part of the graph and reconstruct scalar potentials as well as the graph structure from the ... | [['we', 'study', 'the', 'inverse', 'scattering', 'for', 'schrodinger', 'operators', 'on', 'locally', 'perturbed', 'periodic', 'lattices', 'we', 'show', 'that', 'the', 'associated', 'scattering', 'matrix', 'is', 'equivalent', 'to', 'the', 'dirichlettoneumann', 'map', 'for', 'a', 'boundary', 'value', 'problem', 'on', 'a'... | [-0.10451691268262134, 0.08143581926767061, -0.04506290296732045, 0.06746532565934944, -0.0709545326023015, -0.09088023571964743, -0.0009065542557735496, 0.4120834168713929, -0.31135396481449923, -0.19244225727005013, 0.13074739167202654, -0.3256820892887329, -0.20835560974456482, 0.1490178611407529, 0.0015931380078641... |
1,803.095 | The theta bump condition for product fractional integrals | We extend some one parameter theorems on fractional integrals due to Sawyer
and Wheeden to the two parameter setting using a recent iteration method of
Tanaka and Yabuta.
| math.CA | we extend some one parameter theorems on fractional integrals due to sawyer and wheeden to the two parameter setting using a recent iteration method of tanaka and yabuta | [['we', 'extend', 'some', 'one', 'parameter', 'theorems', 'on', 'fractional', 'integrals', 'due', 'to', 'sawyer', 'and', 'wheeden', 'to', 'the', 'two', 'parameter', 'setting', 'using', 'a', 'recent', 'iteration', 'method', 'of', 'tanaka', 'and', 'yabuta']] | [-0.08028765954077244, 0.007447815383784473, -0.09534527665735888, 0.04752657103485295, -0.14680493350273796, -0.1461449903934928, 0.12000225191669804, 0.2931155243090221, -0.2684196570355977, -0.2656461847946048, 0.1727188139588439, -0.266591029108635, -0.13093111777145947, 0.2697803552395531, -0.15987830133443431, 0.... |
1,803.09501 | A general white noise test based on kernel lag-window estimates of the
spectral density operator | We propose a general white noise test for functional time series based on
estimating a distance between the spectral density operator of a weakly
stationary time series and the constant spectral density operator of an
uncorrelated time series. The estimator that we propose is based on a kernel
lag-window type estimat... | math.ST stat.TH | we propose a general white noise test for functional time series based on estimating a distance between the spectral density operator of a weakly stationary time series and the constant spectral density operator of an uncorrelated time series the estimator that we propose is based on a kernel lagwindow type estimator o... | [['we', 'propose', 'a', 'general', 'white', 'noise', 'test', 'for', 'functional', 'time', 'series', 'based', 'on', 'estimating', 'a', 'distance', 'between', 'the', 'spectral', 'density', 'operator', 'of', 'a', 'weakly', 'stationary', 'time', 'series', 'and', 'the', 'constant', 'spectral', 'density', 'operator', 'of', '... | [-0.07450351411138069, 0.041314964475969905, -0.11602927401741558, 0.08540516883012823, -0.05558267084851781, -0.13104639520101688, 0.06852833818977967, 0.37432289009983527, -0.22819959427314726, -0.2943245938974109, 0.11872150054709478, -0.24921814383774557, -0.15723769472324275, 0.21360535839980938, -0.09076420165956... |
1,803.09502 | Long-term Tracking in the Wild: A Benchmark | We introduce the OxUvA dataset and benchmark for evaluating single-object
tracking algorithms. Benchmarks have enabled great strides in the field of
object tracking by defining standardized evaluations on large sets of diverse
videos. However, these works have focused exclusively on sequences that are
just tens of se... | cs.CV | we introduce the oxuva dataset and benchmark for evaluating singleobject tracking algorithms benchmarks have enabled great strides in the field of object tracking by defining standardized evaluations on large sets of diverse videos however these works have focused exclusively on sequences that are just tens of seconds ... | [['we', 'introduce', 'the', 'oxuva', 'dataset', 'and', 'benchmark', 'for', 'evaluating', 'singleobject', 'tracking', 'algorithms', 'benchmarks', 'have', 'enabled', 'great', 'strides', 'in', 'the', 'field', 'of', 'object', 'tracking', 'by', 'defining', 'standardized', 'evaluations', 'on', 'large', 'sets', 'of', 'diverse... | [-0.07493545691607593, 0.028447871758991477, -0.04526467540941342, 0.05594755217430374, -0.08414308743436909, -0.14526800893757014, 0.01842129509505821, 0.4515291707038713, -0.19949670687809523, -0.3998002610949789, 0.13869092423226892, -0.2833913050825427, -0.09816484024596021, 0.24951201248731902, -0.1130546389158045... |
1,803.09503 | V2676 Oph: Estimating physical parameters of a moderately fast nova | Using our previously reported observations, we derive some physical
parameters of the moderately fast nova V2676 Ophiuchi 2012 # 1. The best-fit
CLOUDY model of the nebular spectrum obtained on 2015 May 8 shows a hot white
dwarf source with Tbb = 1.0 x 10^{5} K having a luminosity of 1.0 x 10^{38}
ergs/s. Our abundan... | astro-ph.SR | using our previously reported observations we derive some physical parameters of the moderately fast nova v2676 ophiuchi 2012 1 the bestfit cloudy model of the nebular spectrum obtained on 2015 may 8 shows a hot white dwarf source with tbb 10 x 105 k having a luminosity of 10 x 1038 ergss our abundance analysis shows t... | [['using', 'our', 'previously', 'reported', 'observations', 'we', 'derive', 'some', 'physical', 'parameters', 'of', 'the', 'moderately', 'fast', 'nova', 'v2676', 'ophiuchi', '2012', '1', 'the', 'bestfit', 'cloudy', 'model', 'of', 'the', 'nebular', 'spectrum', 'obtained', 'on', '2015', 'may', '8', 'shows', 'a', 'hot', '... | [-0.015083336266247135, 0.1177242311247944, -0.04550432105188387, 0.06942046354575776, -0.0338752634574134, -0.1284178659510221, 0.0981838411573375, 0.44772735175533884, -0.1061235692209299, -0.4242812323751078, 0.061015559209979746, -0.33248794162441997, 0.021070292926509016, 0.1721356955601623, -0.054242200765378064,... |
1,803.09504 | Efficient space virtualisation for Hoshen--Kopelman algorithm | In this paper the efficient space virtualisation for Hoshen--Kopelman
algorithm is presented. We observe minimal parallel overhead during
computations, due to negligible communication costs. The proposed algorithm is
applied for computation of random-site percolation thresholds for four
dimensional simple cubic latti... | physics.comp-ph cs.DC | in this paper the efficient space virtualisation for hoshenkopelman algorithm is presented we observe minimal parallel overhead during computations due to negligible communication costs the proposed algorithm is applied for computation of randomsite percolation thresholds for four dimensional simple cubic lattice with ... | [['in', 'this', 'paper', 'the', 'efficient', 'space', 'virtualisation', 'for', 'hoshenkopelman', 'algorithm', 'is', 'presented', 'we', 'observe', 'minimal', 'parallel', 'overhead', 'during', 'computations', 'due', 'to', 'negligible', 'communication', 'costs', 'the', 'proposed', 'algorithm', 'is', 'applied', 'for', 'com... | [-0.15349089741133726, 0.07705700926196117, 0.08087580999216208, 0.06136669437221896, -0.012209129645130955, -0.24626779885819325, 0.15319990768419722, 0.4711238604110594, -0.2051022628035683, -0.23876931813473884, 0.05121972559270664, -0.328530120004255, -0.14437469276957787, 0.07546304624456053, 0.028327286351346768,... |
1,803.09505 | Energetics of Hi-C EUV Brightenings | We study the thermal structure and energetics of the point-like EUV
brightenings within a system of fan loops observed in the active region
\textsl{AR~11520}. These brightenings were simultaneously observed on 2012 July
11 by the HIgh-resolution Coronal (Hi-C) imager and the Atmospheric Imaging
Assembly (AIA) on boar... | astro-ph.SR | we study the thermal structure and energetics of the pointlike euv brightenings within a system of fan loops observed in the active region textslar11520 these brightenings were simultaneously observed on 2012 july 11 by the highresolution coronal hic imager and the atmospheric imaging assembly aia on board the solar dy... | [['we', 'study', 'the', 'thermal', 'structure', 'and', 'energetics', 'of', 'the', 'pointlike', 'euv', 'brightenings', 'within', 'a', 'system', 'of', 'fan', 'loops', 'observed', 'in', 'the', 'active', 'region', 'textslar11520', 'these', 'brightenings', 'were', 'simultaneously', 'observed', 'on', '2012', 'july', '11', 'b... | [-0.06832143228655313, 0.19431536769862198, 0.013651564924912468, 0.1763272256609705, -0.02398617011287315, -0.03333113369810733, 0.013908521129874287, 0.47904067353647983, -0.20427155205801983, -0.4023041744141062, 0.09428873717824551, -0.3164375328346138, -0.11534478515386581, 0.2311839518866911, -0.00029172200526431... |
1,803.09506 | Existence of constant scalar curvature Kaehler cone metrics, properness and geodesic stability | We show that the existence of constant scalar curvature K\"ahler (cscK) metrics with cone singularities is equivalent to the properness of log $K$-energy. We also prove their equivalence to the geodesic stability. They are extensions of the solution of the properness conjecture and Donaldson's geodesic stability conjec... | math.DG math.AP | we show that the existence of constant scalar curvature kahler csck metrics with cone singularities is equivalent to the properness of log kenergy we also prove their equivalence to the geodesic stability they are extensions of the solution of the properness conjecture and donaldsons geodesic stability conjecture of th... | [['we', 'show', 'that', 'the', 'existence', 'of', 'constant', 'scalar', 'curvature', 'kahler', 'csck', 'metrics', 'with', 'cone', 'singularities', 'is', 'equivalent', 'to', 'the', 'properness', 'of', 'log', 'kenergy', 'we', 'also', 'prove', 'their', 'equivalence', 'to', 'the', 'geodesic', 'stability', 'they', 'are', 'e... | [-0.23594366329535843, -0.05473870079219341, -0.11320041262451559, 0.13502427654154597, -0.1308798474818468, -0.17488137893378736, -0.03627194178313948, 0.3703618403151631, -0.2888687746450305, -0.19295501281693578, 0.12445600832626223, -0.2908665977809578, -0.21587134148180484, 0.18017014651373028, -0.2018455654010176... |
1,803.09507 | Wavelet spectral testing: application to nonstationary circadian rhythms | Rhythmic data are ubiquitous in the life sciences. Biologists need reliable
statistical tests to identify whether a particular experimental treatment has
caused a significant change in a rhythmic signal. When these signals display
nonstationary behaviour, as is common in many biological systems, the
established metho... | stat.AP | rhythmic data are ubiquitous in the life sciences biologists need reliable statistical tests to identify whether a particular experimental treatment has caused a significant change in a rhythmic signal when these signals display nonstationary behaviour as is common in many biological systems the established methodologi... | [['rhythmic', 'data', 'are', 'ubiquitous', 'in', 'the', 'life', 'sciences', 'biologists', 'need', 'reliable', 'statistical', 'tests', 'to', 'identify', 'whether', 'a', 'particular', 'experimental', 'treatment', 'has', 'caused', 'a', 'significant', 'change', 'in', 'a', 'rhythmic', 'signal', 'when', 'these', 'signals', '... | [-0.0458858586785027, 0.049897372814787865, -0.10103832459814537, 0.10266389943414349, -0.0964824750359791, -0.12524217056973916, 0.05385014433219718, 0.39927924673005083, -0.26427436445889424, -0.3118742381144936, 0.11453253173143214, -0.24049310984635971, -0.21774268663072385, 0.2748685605811261, -0.10617992343948875... |
1,803.09508 | Finite-key security analysis for quantum key distribution with leaky
sources | Security proofs of quantum key distribution (QKD) typically assume that the
devices of the legitimate users are perfectly shielded from the eavesdropper.
This assumption is, however, very hard to meet in practice, and thus the
security of current QKD implementations is not guaranteed. Here, we fill this
gap by provid... | quant-ph | security proofs of quantum key distribution qkd typically assume that the devices of the legitimate users are perfectly shielded from the eavesdropper this assumption is however very hard to meet in practice and thus the security of current qkd implementations is not guaranteed here we fill this gap by providing a fini... | [['security', 'proofs', 'of', 'quantum', 'key', 'distribution', 'qkd', 'typically', 'assume', 'that', 'the', 'devices', 'of', 'the', 'legitimate', 'users', 'are', 'perfectly', 'shielded', 'from', 'the', 'eavesdropper', 'this', 'assumption', 'is', 'however', 'very', 'hard', 'to', 'meet', 'in', 'practice', 'and', 'thus',... | [-0.19075252045340613, 0.03778534887626054, -0.10673109066287875, 0.04839499724799189, -0.0059832158954219615, -0.265234885238613, 0.11375031262761683, 0.36042541338804557, -0.19447221355066893, -0.28936778787021517, 0.08302586161901394, -0.2351936995520765, -0.07170264429828906, 0.22355899022535441, -0.163596280125557... |
1,803.09509 | A comparative study above two self-tuning controllers with application
to the control of synchronous generator excitation system | This paper presents two self-tuning control structures synthesized through
the minimization of two criterion functions. It is described the computation
methodology of the control laws, both being particularized for the case of the
synchronous generator's excitation control. The parameters estimator is
considered the ... | cs.SY | this paper presents two selftuning control structures synthesized through the minimization of two criterion functions it is described the computation methodology of the control laws both being particularized for the case of the synchronous generators excitation control the parameters estimator is considered the recursi... | [['this', 'paper', 'presents', 'two', 'selftuning', 'control', 'structures', 'synthesized', 'through', 'the', 'minimization', 'of', 'two', 'criterion', 'functions', 'it', 'is', 'described', 'the', 'computation', 'methodology', 'of', 'the', 'control', 'laws', 'both', 'being', 'particularized', 'for', 'the', 'case', 'of'... | [-0.17957263376394456, 0.02441180477652586, -0.05885502927456841, 0.07289603143087306, -0.025139168970230403, -0.1734736478379504, -0.009364131624655178, 0.37677604885715427, -0.2927790003137268, -0.3188974948769266, 0.14774435488189655, -0.2147518659970074, -0.17975474752937304, 0.22173427170932744, -0.039518798556386... |
1,803.0951 | Asymptotic expansions of the Witten-Reshetikhin-Turaev Invariants of
Mapping Tori I | In this paper we engage in a general study of the asymptotic expansion of the
Witten-Reshetikhin-Turaev invariants of mapping tori of surface mapping class
group elements. We use the geometric construction of the
Witten-Reshetikhin-Turaev TQFT via the geometric quantization of moduli spaces
of flat connections on sur... | math.DG | in this paper we engage in a general study of the asymptotic expansion of the wittenreshetikhinturaev invariants of mapping tori of surface mapping class group elements we use the geometric construction of the wittenreshetikhinturaev tqft via the geometric quantization of moduli spaces of flat connections on surfaces w... | [['in', 'this', 'paper', 'we', 'engage', 'in', 'a', 'general', 'study', 'of', 'the', 'asymptotic', 'expansion', 'of', 'the', 'wittenreshetikhinturaev', 'invariants', 'of', 'mapping', 'tori', 'of', 'surface', 'mapping', 'class', 'group', 'elements', 'we', 'use', 'the', 'geometric', 'construction', 'of', 'the', 'wittenre... | [-0.1236150198088338, 0.02847261693328619, -0.14179606466864547, 0.07429722796582307, -0.11296046068426221, -0.08229515301374098, 0.07565390951621036, 0.3366127336894472, -0.2565575276811918, -0.23278994232338543, 0.10992158442270011, -0.23000701313692842, -0.20552778687948983, 0.23788970006164165, -0.11028107004240155... |
1,803.09511 | Left-eigenvectors are certificates of the Orbit Problem | This paper investigates the connexion between the Kannan-Lipton Orbit Problem
and the polynomial invariant generator algorithm PILA based on eigenvectors
computation. Namely, we reduce the problem of generating linear and polynomial
certificates of non-reachability for the Orbit Problem for linear
transformations wit... | cs.LO | this paper investigates the connexion between the kannanlipton orbit problem and the polynomial invariant generator algorithm pila based on eigenvectors computation namely we reduce the problem of generating linear and polynomial certificates of nonreachability for the orbit problem for linear transformations with rati... | [['this', 'paper', 'investigates', 'the', 'connexion', 'between', 'the', 'kannanlipton', 'orbit', 'problem', 'and', 'the', 'polynomial', 'invariant', 'generator', 'algorithm', 'pila', 'based', 'on', 'eigenvectors', 'computation', 'namely', 'we', 'reduce', 'the', 'problem', 'of', 'generating', 'linear', 'and', 'polynomi... | [-0.17208673473713654, 0.004733269335702062, -0.05451407141185233, 0.036881857671375785, -0.1302006764869605, -0.14836220592925592, -0.0018438635377346405, 0.3006657427176833, -0.38870518423084705, -0.23330618893128952, 0.14643775425585254, -0.24767338155901858, -0.23076993418591363, 0.20108544482583446, -0.05379897505... |
1,803.09512 | Domain-wall-assisted giant magnetoimpedance of thin-wall ferromagnetic
nanotubes | We study the effciency of the magnetoimpedance (MI) of thin-wall
circumferentially ordered nanotubes in sub-GHz and GHz frequency regimes using
micromagnetic simulations. We consider empty ferromagnetic tubes as well as
tubes filled with non-magnetic conductors of circular cross-section (nanowire
coverings) focusing ... | cond-mat.mes-hall | we study the effciency of the magnetoimpedance mi of thinwall circumferentially ordered nanotubes in subghz and ghz frequency regimes using micromagnetic simulations we consider empty ferromagnetic tubes as well as tubes filled with nonmagnetic conductors of circular crosssection nanowire coverings focusing on the lowf... | [['we', 'study', 'the', 'effciency', 'of', 'the', 'magnetoimpedance', 'mi', 'of', 'thinwall', 'circumferentially', 'ordered', 'nanotubes', 'in', 'subghz', 'and', 'ghz', 'frequency', 'regimes', 'using', 'micromagnetic', 'simulations', 'we', 'consider', 'empty', 'ferromagnetic', 'tubes', 'as', 'well', 'as', 'tubes', 'fil... | [-0.21514480941720862, 0.18609625481049272, 0.010375319123069974, -0.019142491535526364, -0.05521399436885134, -0.10881664517132486, 0.03882873885858645, 0.41546979899260594, -0.23908636931508304, -0.26576759129703204, 0.09050380526868468, -0.23966488661368357, -0.05692339937222448, 0.22571374986944917, 0.0307753522322... |
1,803.09513 | Enabling Aloha-NOMA for Massive M2M Communication in IoT Networks | The Internet of things (IoT), which is the network of physical devices
embedded with sensors, actuators, and connec- tivity, is being accelerated into
the mainstream by the emergence of 5G wireless networking. This paper presents
an uncoordinated non-orthogonal random access protocol, an enhancement to the
recently i... | eess.SP | the internet of things iot which is the network of physical devices embedded with sensors actuators and connec tivity is being accelerated into the mainstream by the emergence of 5g wireless networking this paper presents an uncoordinated nonorthogonal random access protocol an enhancement to the recently introduced al... | [['the', 'internet', 'of', 'things', 'iot', 'which', 'is', 'the', 'network', 'of', 'physical', 'devices', 'embedded', 'with', 'sensors', 'actuators', 'and', 'connec', 'tivity', 'is', 'being', 'accelerated', 'into', 'the', 'mainstream', 'by', 'the', 'emergence', 'of', '5g', 'wireless', 'networking', 'this', 'paper', 'pr... | [-0.24603931485351338, 0.07534596147988229, -0.028864198709948, -0.02714634804569925, -0.059918675566618534, -0.23177252201506612, 0.09644644849525869, 0.3858806080653431, -0.25628733039133667, -0.30425378588253854, 0.06326684150671275, -0.2320494360452437, -0.1725330715304854, 0.15755970915779471, -0.15251016841842707... |
1,803.09514 | Cluster analysis of stocks using price movements of high frequency data
from National Stock Exchange | This paper aims to develop new techniques to describe joint behavior of
stocks, beyond regression and correlation. For example, we want to identify the
clusters of the stocks that move together. Our work is based on applying Kernel
Principal Component Analysis(KPCA) and Functional Principal Component
Analysis(FPCA) t... | q-fin.ST stat.CO | this paper aims to develop new techniques to describe joint behavior of stocks beyond regression and correlation for example we want to identify the clusters of the stocks that move together our work is based on applying kernel principal component analysiskpca and functional principal component analysisfpca to high fre... | [['this', 'paper', 'aims', 'to', 'develop', 'new', 'techniques', 'to', 'describe', 'joint', 'behavior', 'of', 'stocks', 'beyond', 'regression', 'and', 'correlation', 'for', 'example', 'we', 'want', 'to', 'identify', 'the', 'clusters', 'of', 'the', 'stocks', 'that', 'move', 'together', 'our', 'work', 'is', 'based', 'on'... | [-0.03810652848700748, 0.056480887154956645, -0.14117725245611693, 0.08647117989235803, -0.11131038193983075, -0.14690139835308258, 0.0430484415908148, 0.40833582476173574, -0.2836975915578047, -0.2794028398433798, 0.1406580897981736, -0.32681238844892696, -0.1187957927020953, 0.1908780917108647, -0.06130748104279567, ... |
1,803.09515 | A Low-Resolution ADC Module Assisted Hybrid Beamforming Architecture for
mmWave Communications | We propose a low-resolution analog-to-digital converter (ADC) module assisted
hybrid beamforming architecture for millimeter-wave (mmWave) communications. We
prove that the proposed low-cost and flexible architecture can reduce the beam
training time and complexity dramatically without degradation in the data
transmi... | cs.IT math.IT | we propose a lowresolution analogtodigital converter adc module assisted hybrid beamforming architecture for millimeterwave mmwave communications we prove that the proposed lowcost and flexible architecture can reduce the beam training time and complexity dramatically without degradation in the data transmission perfor... | [['we', 'propose', 'a', 'lowresolution', 'analogtodigital', 'converter', 'adc', 'module', 'assisted', 'hybrid', 'beamforming', 'architecture', 'for', 'millimeterwave', 'mmwave', 'communications', 'we', 'prove', 'that', 'the', 'proposed', 'lowcost', 'and', 'flexible', 'architecture', 'can', 'reduce', 'the', 'beam', 'tra... | [-0.20056629864252115, 0.027639271568013244, -0.0026358059124953776, -0.022644102502914414, -0.1008507642868334, -0.2619548971282251, 0.0564758682971349, 0.45908688376825973, -0.25144583274082966, -0.3202919343778168, 0.058738723085879026, -0.17785036741020943, -0.1572213529283742, 0.22242799563423157, -0.1435197106540... |
1,803.09516 | Role of salt valency in the switch of H-NS proteins between DNA-bridging
and DNA-stiffening modes | This work investigates the interactions of H-NS proteins and bacterial
genomic DNA through computer simulations performed with a coarse-grained model.
The model was developed specifically to study the switch of H-NS proteins from
the DNA-stiffening to the DNA-bridging mode, which has been observed repeatedly
upon add... | physics.bio-ph q-bio.BM q-bio.GN | this work investigates the interactions of hns proteins and bacterial genomic dna through computer simulations performed with a coarsegrained model the model was developed specifically to study the switch of hns proteins from the dnastiffening to the dnabridging mode which has been observed repeatedly upon addition of ... | [['this', 'work', 'investigates', 'the', 'interactions', 'of', 'hns', 'proteins', 'and', 'bacterial', 'genomic', 'dna', 'through', 'computer', 'simulations', 'performed', 'with', 'a', 'coarsegrained', 'model', 'the', 'model', 'was', 'developed', 'specifically', 'to', 'study', 'the', 'switch', 'of', 'hns', 'proteins', '... | [-0.12375127352731254, 0.16192927087091416, 0.005444162835932761, 0.07031805912112377, -0.02838280763662943, -0.16303937030310758, 0.0860132217660481, 0.38943052449541393, -0.26170917265329063, -0.277738806022905, 0.014296825061472574, -0.298293457944518, -0.17327525331475363, 0.13310150389244021, 0.017992690142260438,... |
1,803.09517 | On the Approximation Ratio of Ordered Parsings | Shannon's entropy is a clear lower bound for statistical compression. The
situation is not so well understood for dictionary-based compression. A
plausible lower bound is $b$, the least number of phrases of a general
bidirectional parse of a text, where phrases can be copied from anywhere else
in the text. Since comp... | cs.DS | shannons entropy is a clear lower bound for statistical compression the situation is not so well understood for dictionarybased compression a plausible lower bound is b the least number of phrases of a general bidirectional parse of a text where phrases can be copied from anywhere else in the text since computing b is ... | [['shannons', 'entropy', 'is', 'a', 'clear', 'lower', 'bound', 'for', 'statistical', 'compression', 'the', 'situation', 'is', 'not', 'so', 'well', 'understood', 'for', 'dictionarybased', 'compression', 'a', 'plausible', 'lower', 'bound', 'is', 'b', 'the', 'least', 'number', 'of', 'phrases', 'of', 'a', 'general', 'bidir... | [-0.09653442964050599, 0.14270730543433796, -0.05938053554839285, 0.08212309462599188, -0.10987290422051274, -0.16397794561230183, 0.1058652814818927, 0.37792864967060763, -0.31858865931840963, -0.29445166350042296, 0.06442089156644527, -0.3055873750388955, -0.10273525620253814, 0.18005001410994761, -0.0556148215168222... |
1,803.09518 | Fr\'echet ChemNet Distance: A metric for generative models for molecules
in drug discovery | The new wave of successful generative models in machine learning has
increased the interest in deep learning driven de novo drug design. However,
assessing the performance of such generative models is notoriously difficult.
Metrics that are typically used to assess the performance of such generative
models are the pe... | cs.LG q-bio.QM stat.ML | the new wave of successful generative models in machine learning has increased the interest in deep learning driven de novo drug design however assessing the performance of such generative models is notoriously difficult metrics that are typically used to assess the performance of such generative models are the percent... | [['the', 'new', 'wave', 'of', 'successful', 'generative', 'models', 'in', 'machine', 'learning', 'has', 'increased', 'the', 'interest', 'in', 'deep', 'learning', 'driven', 'de', 'novo', 'drug', 'design', 'however', 'assessing', 'the', 'performance', 'of', 'such', 'generative', 'models', 'is', 'notoriously', 'difficult'... | [-0.049651683139992346, 0.053684668047445185, -0.07341836315792487, 0.08990093474607733, -0.07015499240659484, -0.14562524782235592, 0.013288977589939585, 0.42631563181511023, -0.27401639103596465, -0.29112405796476015, 0.057894239238766805, -0.2691891404829766, -0.18929945145932475, 0.2030070001357113, -0.079485731215... |
1,803.09519 | Self-Attentional Acoustic Models | Self-attention is a method of encoding sequences of vectors by relating these
vectors to each-other based on pairwise similarities. These models have
recently shown promising results for modeling discrete sequences, but they are
non-trivial to apply to acoustic modeling due to computational and modeling
issues. In th... | cs.CL | selfattention is a method of encoding sequences of vectors by relating these vectors to eachother based on pairwise similarities these models have recently shown promising results for modeling discrete sequences but they are nontrivial to apply to acoustic modeling due to computational and modeling issues in this paper... | [['selfattention', 'is', 'a', 'method', 'of', 'encoding', 'sequences', 'of', 'vectors', 'by', 'relating', 'these', 'vectors', 'to', 'eachother', 'based', 'on', 'pairwise', 'similarities', 'these', 'models', 'have', 'recently', 'shown', 'promising', 'results', 'for', 'modeling', 'discrete', 'sequences', 'but', 'they', '... | [-0.06728869967427555, 0.07049123403059597, -0.06434472336904841, 0.08324950446167977, -0.14866322288610812, -0.15910433829111723, 0.03623409422439652, 0.44267294505723465, -0.3033910490647386, -0.2887332111907502, 0.05867440942688256, -0.2579761799920823, -0.2174458039654205, 0.19548794881162374, -0.09127188673050239,... |
1,803.0952 | Universal Compressed Text Indexing | The rise of repetitive datasets has lately generated a lot of interest in
compressed self-indexes based on dictionary compression, a rich and
heterogeneous family that exploits text repetitions in different ways. For each
such compression scheme, several different indexing solutions have been
proposed in the last two... | cs.DS | the rise of repetitive datasets has lately generated a lot of interest in compressed selfindexes based on dictionary compression a rich and heterogeneous family that exploits text repetitions in different ways for each such compression scheme several different indexing solutions have been proposed in the last two decad... | [['the', 'rise', 'of', 'repetitive', 'datasets', 'has', 'lately', 'generated', 'a', 'lot', 'of', 'interest', 'in', 'compressed', 'selfindexes', 'based', 'on', 'dictionary', 'compression', 'a', 'rich', 'and', 'heterogeneous', 'family', 'that', 'exploits', 'text', 'repetitions', 'in', 'different', 'ways', 'for', 'each', ... | [-0.10698426812335751, 0.11631142301484942, -0.08271529205923348, 0.06016072092483282, -0.11764243949546926, -0.14034571654261335, 0.045290933137223884, 0.38845936944218057, -0.2852612493469562, -0.27430599496377756, 0.11074916675557292, -0.2623680935388333, -0.13016182922975236, 0.22970844521926878, -0.077844947069722... |
1,803.09521 | On the Tits cone of a Weyl groupoid | We translate the axioms of a Weyl groupoid with (not necessarily finite) root
system in terms of arrangements. The result is a correspondence between Weyl
groupoids permitting a root system and Tits arrangements satisfying an
integrality condition which we call the crystallographic property.
| math.CO | we translate the axioms of a weyl groupoid with not necessarily finite root system in terms of arrangements the result is a correspondence between weyl groupoids permitting a root system and tits arrangements satisfying an integrality condition which we call the crystallographic property | [['we', 'translate', 'the', 'axioms', 'of', 'a', 'weyl', 'groupoid', 'with', 'not', 'necessarily', 'finite', 'root', 'system', 'in', 'terms', 'of', 'arrangements', 'the', 'result', 'is', 'a', 'correspondence', 'between', 'weyl', 'groupoids', 'permitting', 'a', 'root', 'system', 'and', 'tits', 'arrangements', 'satisfyin... | [-0.26348209968053327, 0.09602800778520759, -0.10737608004967834, 0.009850539930359743, -0.1837692039390636, -0.181910817847089, 0.035336778730663015, 0.32450409467483676, -0.35985964558325534, -0.21914991654109123, 0.03606059332648942, -0.25147211993503016, -0.14541080221533775, 0.1464959430226753, -0.1691986773986109... |
1,803.09522 | A Provably Correct Algorithm for Deep Learning that Actually Works | We describe a layer-by-layer algorithm for training deep convolutional
networks, where each step involves gradient updates for a two layer network
followed by a simple clustering algorithm. Our algorithm stems from a deep
generative model that generates mages level by level, where lower resolution
images correspond t... | cs.LG stat.ML | we describe a layerbylayer algorithm for training deep convolutional networks where each step involves gradient updates for a two layer network followed by a simple clustering algorithm our algorithm stems from a deep generative model that generates mages level by level where lower resolution images correspond to laten... | [['we', 'describe', 'a', 'layerbylayer', 'algorithm', 'for', 'training', 'deep', 'convolutional', 'networks', 'where', 'each', 'step', 'involves', 'gradient', 'updates', 'for', 'a', 'two', 'layer', 'network', 'followed', 'by', 'a', 'simple', 'clustering', 'algorithm', 'our', 'algorithm', 'stems', 'from', 'a', 'deep', '... | [-0.02949043429488766, 0.02397191531891967, -0.0963401084830021, 0.09559894875976546, -0.09621925825766962, -0.17440311680066176, 0.050701596318133944, 0.47649655604156954, -0.28442622597232975, -0.3210997588161765, 0.08923109383322299, -0.22959384344646644, -0.22487391032888715, 0.20987593760746048, -0.118670546481835... |
1,803.09523 | White dwarf-main sequence binaries from LAMOST: the DR5 catalogue | We present the data release (DR) 5 catalogue of white dwarf-main sequence
(WDMS) binaries from the Large Area Multi-Object fiber Spectroscopic Telescope
(LAMOST). The catalogue contains 876 WDMS binaries, of which 757 are additions
to our previous LAMOST DR1 sample and 357 are systems that have not been
published bef... | astro-ph.SR | we present the data release dr 5 catalogue of white dwarfmain sequence wdms binaries from the large area multiobject fiber spectroscopic telescope lamost the catalogue contains 876 wdms binaries of which 757 are additions to our previous lamost dr1 sample and 357 are systems that have not been published before we also ... | [['we', 'present', 'the', 'data', 'release', 'dr', '5', 'catalogue', 'of', 'white', 'dwarfmain', 'sequence', 'wdms', 'binaries', 'from', 'the', 'large', 'area', 'multiobject', 'fiber', 'spectroscopic', 'telescope', 'lamost', 'the', 'catalogue', 'contains', '876', 'wdms', 'binaries', 'of', 'which', '757', 'are', 'additi... | [-0.07687562180503622, 0.09036897853103688, -0.05954327729156577, 0.10687883396882976, -0.17987100989557803, -0.08164199444724889, 0.11831838430380678, 0.400738013908267, -0.1047865837988001, -0.3982132523946586, 0.06051786148111473, -0.42355668344161596, -0.044619744305058044, 0.2658075180236769, -0.1080329981527566, ... |
1,803.09524 | Ordinary lines in space | We prove that if a finite point set in real space does not have too many
points on a plane, then it spans a quadratic number of ordinary lines. This
answers the real case of a question of Basit, Dvir, Saraf, and Wolf. It shows
that there is a significant difference in terms of ordinary lines between
planar point sets... | math.CO | we prove that if a finite point set in real space does not have too many points on a plane then it spans a quadratic number of ordinary lines this answers the real case of a question of basit dvir saraf and wolf it shows that there is a significant difference in terms of ordinary lines between planar point sets which m... | [['we', 'prove', 'that', 'if', 'a', 'finite', 'point', 'set', 'in', 'real', 'space', 'does', 'not', 'have', 'too', 'many', 'points', 'on', 'a', 'plane', 'then', 'it', 'spans', 'a', 'quadratic', 'number', 'of', 'ordinary', 'lines', 'this', 'answers', 'the', 'real', 'case', 'of', 'a', 'question', 'of', 'basit', 'dvir', '... | [-0.15805724573948857, 0.055275346827218116, -0.08752607852481875, 0.01893817984061886, -0.0656197832918688, -0.08974371338738318, 0.1261725744840746, 0.3103907666720298, -0.2432162454161717, -0.2704476718885862, 0.0763909700778028, -0.2945087868479741, -0.15376139713489279, 0.258846318016627, -0.0820034385506748, -0.0... |
1,803.09525 | Strong coupling in conserved surface roughening: A new universality
class? | The Kardar-Parisi-Zhang (KPZ) equation defines the main universality class
for nonlinear growth and roughening of surfaces. But under certain conditions,
a conserved KPZ equation (cKPZ) is thought to set the universality class
instead. This has non-mean-field behavior only in spatial dimension $d<2$. We
point out her... | cond-mat.stat-mech | the kardarparisizhang kpz equation defines the main universality class for nonlinear growth and roughening of surfaces but under certain conditions a conserved kpz equation ckpz is thought to set the universality class instead this has nonmeanfield behavior only in spatial dimension d2 we point out here that ckpz is in... | [['the', 'kardarparisizhang', 'kpz', 'equation', 'defines', 'the', 'main', 'universality', 'class', 'for', 'nonlinear', 'growth', 'and', 'roughening', 'of', 'surfaces', 'but', 'under', 'certain', 'conditions', 'a', 'conserved', 'kpz', 'equation', 'ckpz', 'is', 'thought', 'to', 'set', 'the', 'universality', 'class', 'in... | [-0.1571510981659465, 0.15347155622927652, -0.08980080000436565, 0.07146699646968514, -0.07434439596733183, -0.19298030415009107, 0.05055866267667302, 0.28539027304448666, -0.26379220849518, -0.19574264521830745, 0.07496315850632175, -0.2638065202402011, -0.17501378048872274, 0.12062570188126917, 0.009495186735875905, ... |
1,803.09526 | Circulant matrices: norm, powers, and positivity | In their recent paper "The spectral norm of a Horadam circulant matrix",
Merikoski, Haukkanen, Mattila and Tossavainen study under which conditions the
spectral norm of a general real circulant matrix ${\bf C}$ equals the modulus
of its row/column sum. We improve on their sufficient condition until we have a
necessar... | math.FA | in their recent paper the spectral norm of a horadam circulant matrix merikoski haukkanen mattila and tossavainen study under which conditions the spectral norm of a general real circulant matrix bf c equals the modulus of its rowcolumn sum we improve on their sufficient condition until we have a necessary one our resu... | [['in', 'their', 'recent', 'paper', 'the', 'spectral', 'norm', 'of', 'a', 'horadam', 'circulant', 'matrix', 'merikoski', 'haukkanen', 'mattila', 'and', 'tossavainen', 'study', 'under', 'which', 'conditions', 'the', 'spectral', 'norm', 'of', 'a', 'general', 'real', 'circulant', 'matrix', 'bf', 'c', 'equals', 'the', 'mod... | [-0.13180611369510492, 0.08085152020677924, -0.017684892919690658, 0.01883031786729892, -0.0603549085278064, -0.11390002422034741, 0.042007581341701246, 0.36795574257771174, -0.302173609683911, -0.22766822481527924, 0.16010330132984868, -0.23015169988075893, -0.20103964249913892, 0.11061190052578847, -0.102696862990657... |
1,803.09527 | On the utility of Metropolis-Hastings with asymmetric acceptance ratio | The Metropolis-Hastings algorithm allows one to sample asymptotically from
any probability distribution $\pi$. There has been recently much work devoted
to the development of variants of the MH update which can handle scenarios
where such an evaluation is impossible, and yet are guaranteed to sample from
$\pi$ asympt... | stat.CO | the metropolishastings algorithm allows one to sample asymptotically from any probability distribution pi there has been recently much work devoted to the development of variants of the mh update which can handle scenarios where such an evaluation is impossible and yet are guaranteed to sample from pi asymptotically th... | [['the', 'metropolishastings', 'algorithm', 'allows', 'one', 'to', 'sample', 'asymptotically', 'from', 'any', 'probability', 'distribution', 'pi', 'there', 'has', 'been', 'recently', 'much', 'work', 'devoted', 'to', 'the', 'development', 'of', 'variants', 'of', 'the', 'mh', 'update', 'which', 'can', 'handle', 'scenario... | [-0.06691142603846029, 0.05996321397505287, -0.1416081522129252, 0.09400347558058504, -0.07726651994219134, -0.1573465830555424, 0.08279823110030993, 0.40913960279868844, -0.22994836929509824, -0.32220888568116424, 0.10647645341827625, -0.24054636645379837, -0.09853006914171349, 0.2209079477654182, -0.10863006231550099... |
1,803.09528 | Topological footprints of the 1D Kitaev chain with long range
superconducting pairings at a finite temperature | We study the 1D Kitaev chain with long range superconductive pairing terms at
a finite temperature where the system is prepared in a mixed state in
equilibrium with a heat reservoir maintained at a constant temperature $T$. In
order to probe the footprint of the ground state topological behavior of the
model at finit... | cond-mat.stat-mech cond-mat.str-el | we study the 1d kitaev chain with long range superconductive pairing terms at a finite temperature where the system is prepared in a mixed state in equilibrium with a heat reservoir maintained at a constant temperature t in order to probe the footprint of the ground state topological behavior of the model at finite tem... | [['we', 'study', 'the', '1d', 'kitaev', 'chain', 'with', 'long', 'range', 'superconductive', 'pairing', 'terms', 'at', 'a', 'finite', 'temperature', 'where', 'the', 'system', 'is', 'prepared', 'in', 'a', 'mixed', 'state', 'in', 'equilibrium', 'with', 'a', 'heat', 'reservoir', 'maintained', 'at', 'a', 'constant', 'tempe... | [-0.1571197140523616, 0.20911346979345344, -0.11722457330642629, 0.016782625477581026, -7.454998118161154e-05, -0.12931329261574173, 0.07333884058136712, 0.31548397881644114, -0.2550237890481636, -0.26475696390330355, 0.09178935600632504, -0.29812780550892365, -0.04132773960577842, 0.14710979245430908, 0.03385278210435... |
1,803.09529 | Poster: Communication in Open-Source Projects--End of the E-mail Era? | Communication is essential in software engineering. Especially in distributed
open-source teams, communication needs to be supported by channels including
mailing lists, forums, issue trackers, and chat systems. Yet, we do not have a
clear understanding of which communication channels stakeholders in open-source
proj... | cs.SE | communication is essential in software engineering especially in distributed opensource teams communication needs to be supported by channels including mailing lists forums issue trackers and chat systems yet we do not have a clear understanding of which communication channels stakeholders in opensource projects use in... | [['communication', 'is', 'essential', 'in', 'software', 'engineering', 'especially', 'in', 'distributed', 'opensource', 'teams', 'communication', 'needs', 'to', 'be', 'supported', 'by', 'channels', 'including', 'mailing', 'lists', 'forums', 'issue', 'trackers', 'and', 'chat', 'systems', 'yet', 'we', 'do', 'not', 'have'... | [-0.21017146488383495, 0.04470686547431454, -0.037172233036978815, 0.10750885337560637, -0.08395190894809841, -0.21779279268850557, 0.0917784069344157, 0.4456686040111741, -0.21626653595799847, -0.3448695605468066, 0.1539293384231001, -0.3677531559111886, -0.11311474107406255, 0.20344789356058157, -0.05175345008200431,... |
1,803.0953 | Merger estimates for rotating Kerr black holes in modified gravity | In this paper, we explore the signatures of non-rotating and rotating black
hole mergers in the matter-free modified gravity. First, we solve the unstable
circular null orbits and the innermost stable circular timelike orbits via the
geodesic motion. The characteristic quantities of these orbits are
systematically an... | gr-qc hep-th | in this paper we explore the signatures of nonrotating and rotating black hole mergers in the matterfree modified gravity first we solve the unstable circular null orbits and the innermost stable circular timelike orbits via the geodesic motion the characteristic quantities of these orbits are systematically analyzed b... | [['in', 'this', 'paper', 'we', 'explore', 'the', 'signatures', 'of', 'nonrotating', 'and', 'rotating', 'black', 'hole', 'mergers', 'in', 'the', 'matterfree', 'modified', 'gravity', 'first', 'we', 'solve', 'the', 'unstable', 'circular', 'null', 'orbits', 'and', 'the', 'innermost', 'stable', 'circular', 'timelike', 'orbi... | [-0.17926691609466353, 0.15643772735039435, -0.07542038443821415, 0.13728720530910984, -0.06577352893349352, -0.10535251357103304, -0.039017286995165365, 0.3195967598171052, -0.1712117815780911, -0.2731155209416934, 0.09278627914688313, -0.29590250719022954, -0.10159881693366284, 0.21616150176752422, -0.010859696802256... |
1,803.09531 | Projective geometry of Sasaki-Einstein structures and their
compactification | We show that the standard definitions of Sasaki structures have elegant and
simplifying interpretations in terms of projective differential geometry. For
Sasaki-Einstein structures we use projective geometry to provide a resolution
of such structures into geometrically less rigid components; the latter
elemental comp... | math.DG | we show that the standard definitions of sasaki structures have elegant and simplifying interpretations in terms of projective differential geometry for sasakieinstein structures we use projective geometry to provide a resolution of such structures into geometrically less rigid components the latter elemental component... | [['we', 'show', 'that', 'the', 'standard', 'definitions', 'of', 'sasaki', 'structures', 'have', 'elegant', 'and', 'simplifying', 'interpretations', 'in', 'terms', 'of', 'projective', 'differential', 'geometry', 'for', 'sasakieinstein', 'structures', 'we', 'use', 'projective', 'geometry', 'to', 'provide', 'a', 'resoluti... | [-0.19503802319463248, 0.031343172281123814, -0.08232802807902678, 0.07783076944163976, -0.14869130659275331, -0.13726204590012248, -0.04324184069290566, 0.3692826211165923, -0.25483636329046044, -0.20645379398782285, 0.10343025142061285, -0.21969275873345442, -0.17633091233527431, 0.18024366444979723, -0.1522491653593... |
1,803.09532 | Gaussian kernel quadrature at scaled Gauss-Hermite nodes | This article derives an accurate, explicit, and numerically stable
approximation to the kernel quadrature weights in one dimension and on tensor
product grids when the kernel and integration measure are Gaussian. The
approximation is based on use of scaled Gauss-Hermite nodes and truncation of
the Mercer eigendecompo... | math.NA | this article derives an accurate explicit and numerically stable approximation to the kernel quadrature weights in one dimension and on tensor product grids when the kernel and integration measure are gaussian the approximation is based on use of scaled gausshermite nodes and truncation of the mercer eigendecomposition... | [['this', 'article', 'derives', 'an', 'accurate', 'explicit', 'and', 'numerically', 'stable', 'approximation', 'to', 'the', 'kernel', 'quadrature', 'weights', 'in', 'one', 'dimension', 'and', 'on', 'tensor', 'product', 'grids', 'when', 'the', 'kernel', 'and', 'integration', 'measure', 'are', 'gaussian', 'the', 'approxi... | [-0.08111358524098974, 0.04124017449441136, -0.08470355829413871, 0.07464960378988023, -0.05426479245364232, -0.08428068072489887, 0.049769846148318746, 0.41771782174688377, -0.277063951474949, -0.17610930537497535, 0.13001131158077964, -0.25984579859554624, -0.1453384116509007, 0.18576644573505352, -0.0158715292775225... |
1,803.09533 | Deep Representation for Patient Visits from Electronic Health Records | We show how to learn low-dimensional representations (embeddings) of patient
visits from the corresponding electronic health record (EHR) where
International Classification of Diseases (ICD) diagnosis codes are removed. We
expect that these embeddings will be useful for the construction of predictive
statistical mode... | cs.CY cs.LG stat.ML | we show how to learn lowdimensional representations embeddings of patient visits from the corresponding electronic health record ehr where international classification of diseases icd diagnosis codes are removed we expect that these embeddings will be useful for the construction of predictive statistical models anticip... | [['we', 'show', 'how', 'to', 'learn', 'lowdimensional', 'representations', 'embeddings', 'of', 'patient', 'visits', 'from', 'the', 'corresponding', 'electronic', 'health', 'record', 'ehr', 'where', 'international', 'classification', 'of', 'diseases', 'icd', 'diagnosis', 'codes', 'are', 'removed', 'we', 'expect', 'that'... | [0.049593109883029354, 0.033807261689269744, -0.05973404316358607, 0.17586996059187435, -0.1086707266047597, -0.20156874764625998, 0.014510300023142587, 0.4736254491589286, -0.32661491600288584, -0.27685379871505905, 0.08908162269786275, -0.32245909816331486, -0.21011827686293558, 0.2445162752770226, -0.155288207437843... |
1,803.09534 | Tidal Love numbers of neutron stars in $f(R)$ gravity | The recent detection of gravitational waves from a neutron star merger was a
significant step towards constraining the nuclear matter equation of state by
using the tidal Love numbers (TLNs) of the merging neutron stars. Measuring or
constraining the neutron star TLNs allows us in principle to exclude or
constraint m... | gr-qc astro-ph.HE | the recent detection of gravitational waves from a neutron star merger was a significant step towards constraining the nuclear matter equation of state by using the tidal love numbers tlns of the merging neutron stars measuring or constraining the neutron star tlns allows us in principle to exclude or constraint many e... | [['the', 'recent', 'detection', 'of', 'gravitational', 'waves', 'from', 'a', 'neutron', 'star', 'merger', 'was', 'a', 'significant', 'step', 'towards', 'constraining', 'the', 'nuclear', 'matter', 'equation', 'of', 'state', 'by', 'using', 'the', 'tidal', 'love', 'numbers', 'tlns', 'of', 'the', 'merging', 'neutron', 'sta... | [-0.10465119192661416, 0.11505371831585226, -0.08927862001298296, 0.11539112868938416, -0.10145053434222286, -0.051893045310354, -0.015859021197732002, 0.24566510095826338, -0.2141616858443343, -0.30956410264848494, 0.054043275670668994, -0.26400587714373036, -0.08564037565288325, 0.20440911625890168, -0.03908285041267... |
1,803.09535 | Connectionist Recommendation in the Wild: On the utility and
scrutability of neural networks for personalized course guidance | The aggregate behaviors of users can collectively encode deep semantic
information about the objects with which they interact. In this paper, we
demonstrate novel ways in which the synthesis of these data can illuminate the
terrain of users' environment and support them in their decision making and
wayfinding. A nove... | cs.AI cs.CY | the aggregate behaviors of users can collectively encode deep semantic information about the objects with which they interact in this paper we demonstrate novel ways in which the synthesis of these data can illuminate the terrain of users environment and support them in their decision making and wayfinding a novel appl... | [['the', 'aggregate', 'behaviors', 'of', 'users', 'can', 'collectively', 'encode', 'deep', 'semantic', 'information', 'about', 'the', 'objects', 'with', 'which', 'they', 'interact', 'in', 'this', 'paper', 'we', 'demonstrate', 'novel', 'ways', 'in', 'which', 'the', 'synthesis', 'of', 'these', 'data', 'can', 'illuminate'... | [-0.057929876901615066, 0.045650806044549734, -0.10590738853896985, 0.06457461789494358, -0.1356656684032725, -0.13035539695769996, 0.08762717028286149, 0.42466744257717165, -0.2995639709688857, -0.3705701905297127, 0.08552195538116987, -0.291449197322621, -0.19109101490881628, 0.17160002230304086, -0.10330073463501865... |
1,803.09536 | SEAT: A Taxonomy to Characterize Automation in Software Engineering | Reducing cost and time required to build high quality software is a major
goal for software developers. Building tools and techniques that can help
achieve such a goal is the chief aim for Automated Software Engineering (ASE)
researchers. However, in order to be effective an ASE researcher or
professional must unders... | cs.SE | reducing cost and time required to build high quality software is a major goal for software developers building tools and techniques that can help achieve such a goal is the chief aim for automated software engineering ase researchers however in order to be effective an ase researcher or professional must understand th... | [['reducing', 'cost', 'and', 'time', 'required', 'to', 'build', 'high', 'quality', 'software', 'is', 'a', 'major', 'goal', 'for', 'software', 'developers', 'building', 'tools', 'and', 'techniques', 'that', 'can', 'help', 'achieve', 'such', 'a', 'goal', 'is', 'the', 'chief', 'aim', 'for', 'automated', 'software', 'engin... | [-0.059725804914925115, 0.02899328911781653, -0.07250233187508631, 0.06865854916436902, -0.1241102747665388, -0.13091209341758692, 0.08248597102327246, 0.43250235176731083, -0.25328833503053766, -0.37251475344392215, 0.1113535780736232, -0.26199380333654265, -0.1925133655932633, 0.23342301195044837, -0.1081497698460031... |
1,803.09537 | Nucleon internal degrees of freedom and the uniqueness of the
Gamow-Teller state | The Gamow-Teller strength in nuclei can be strongly affected by the internal
degrees of freedom of the nucleon. It is demonstrated that this feature is
unique to the Gamow-Teller. Excitation modes that involve spatial degrees of
freedom are much less influenced by the internal excitation of nucleons. The
fact that th... | nucl-th nucl-ex | the gamowteller strength in nuclei can be strongly affected by the internal degrees of freedom of the nucleon it is demonstrated that this feature is unique to the gamowteller excitation modes that involve spatial degrees of freedom are much less influenced by the internal excitation of nucleons the fact that the obser... | [['the', 'gamowteller', 'strength', 'in', 'nuclei', 'can', 'be', 'strongly', 'affected', 'by', 'the', 'internal', 'degrees', 'of', 'freedom', 'of', 'the', 'nucleon', 'it', 'is', 'demonstrated', 'that', 'this', 'feature', 'is', 'unique', 'to', 'the', 'gamowteller', 'excitation', 'modes', 'that', 'involve', 'spatial', 'd... | [-0.09666933562304522, 0.31281378908347135, -0.04614254545319725, 0.08909628809920538, -0.01227271171739778, -0.047985621753173904, 0.03335269052862517, 0.3716284369898809, -0.19565060865637418, -0.27844811628597815, -0.07779579873848078, -0.2630767739705137, -0.0887072692165856, 0.10748817728882706, 0.0356998117137196... |
1,803.09538 | Determining a fractional Helmholtz system with unknown source and medium
parameter | We are concerned with an inverse problem associated with the fractional
Helmholtz system that arises from the study of viscoacoustics in geophysics and
thermoviscous modelling of lossy media. We are particularly interested in the
case that both the medium parameter and the internal source of the wave
equation are unk... | math.AP math-ph math.MP | we are concerned with an inverse problem associated with the fractional helmholtz system that arises from the study of viscoacoustics in geophysics and thermoviscous modelling of lossy media we are particularly interested in the case that both the medium parameter and the internal source of the wave equation are unknow... | [['we', 'are', 'concerned', 'with', 'an', 'inverse', 'problem', 'associated', 'with', 'the', 'fractional', 'helmholtz', 'system', 'that', 'arises', 'from', 'the', 'study', 'of', 'viscoacoustics', 'in', 'geophysics', 'and', 'thermoviscous', 'modelling', 'of', 'lossy', 'media', 'we', 'are', 'particularly', 'interested', ... | [-0.1042129760715869, 0.10306440569749814, -0.01855215774116072, 0.043949032952595085, -0.08391755417041066, -0.08675207097204057, -0.03439509907426933, 0.3750706023226182, -0.3100017849959571, -0.2780163487402239, 0.1606733194176168, -0.2824736044578323, -0.16018099317982518, 0.2265315430963205, -0.0395418391821699, 0... |
1,803.09539 | On Matching Pursuit and Coordinate Descent | Two popular examples of first-order optimization methods over linear spaces
are coordinate descent and matching pursuit algorithms, with their randomized
variants. While the former targets the optimization by moving along
coordinates, the latter considers a generalized notion of directions.
Exploiting the connection ... | stat.ML cs.LG math.OC | two popular examples of firstorder optimization methods over linear spaces are coordinate descent and matching pursuit algorithms with their randomized variants while the former targets the optimization by moving along coordinates the latter considers a generalized notion of directions exploiting the connection between... | [['two', 'popular', 'examples', 'of', 'firstorder', 'optimization', 'methods', 'over', 'linear', 'spaces', 'are', 'coordinate', 'descent', 'and', 'matching', 'pursuit', 'algorithms', 'with', 'their', 'randomized', 'variants', 'while', 'the', 'former', 'targets', 'the', 'optimization', 'by', 'moving', 'along', 'coordina... | [-0.12529304289523888, -0.010555241000624972, -0.09663150725253952, 0.08089935451045359, -0.07767958731663951, -0.16685431371784742, 0.017682945764561638, 0.4307481916535885, -0.33684029629231865, -0.22840890346453824, 0.1305772321567862, -0.2244869447270528, -0.1677459197593084, 0.20303525089568228, -0.104665200166199... |
1,803.0954 | Considerations Regarding the Flux Estimation in Induction Generator with
Application at the Control of Unconventional Energetic Conversion Systems | The paper presents issues regarding the flux estimation of induction
machines. The electrical machines variables estimation represents a major
problem in the actual context of modern control approaches, especially of
sensorless control strategies. There are considered several implementations of
induction machine flux... | cs.SY | the paper presents issues regarding the flux estimation of induction machines the electrical machines variables estimation represents a major problem in the actual context of modern control approaches especially of sensorless control strategies there are considered several implementations of induction machine flux esti... | [['the', 'paper', 'presents', 'issues', 'regarding', 'the', 'flux', 'estimation', 'of', 'induction', 'machines', 'the', 'electrical', 'machines', 'variables', 'estimation', 'represents', 'a', 'major', 'problem', 'in', 'the', 'actual', 'context', 'of', 'modern', 'control', 'approaches', 'especially', 'of', 'sensorless',... | [-0.15515989041463896, 0.05486139917576855, -0.03862280437553471, 0.04661414184480567, -0.04880620498972183, -0.16127144236286933, 0.07128521415870637, 0.3922831109978936, -0.2604447471655228, -0.32835642715746705, 0.165818745479919, -0.23336070811545306, -0.11806759207763455, 0.25754959132861005, -0.14466847528449514,... |
1,803.09541 | Schmidt decomposition of mixed-pure states for (d,infinity ) systems and
some applications | Summary. A simple derivation of finite Schmidt decomposition of pure states
describing finite dimensional systems interacting with the infinite dimensional
ones is presented. In particular, maximally entangled pure states in such
systems are being characterized. The concept of mixed-pure states has been
introduced an... | quant-ph | summary a simple derivation of finite schmidt decomposition of pure states describing finite dimensional systems interacting with the infinite dimensional ones is presented in particular maximally entangled pure states in such systems are being characterized the concept of mixedpure states has been introduced and some ... | [['summary', 'a', 'simple', 'derivation', 'of', 'finite', 'schmidt', 'decomposition', 'of', 'pure', 'states', 'describing', 'finite', 'dimensional', 'systems', 'interacting', 'with', 'the', 'infinite', 'dimensional', 'ones', 'is', 'presented', 'in', 'particular', 'maximally', 'entangled', 'pure', 'states', 'in', 'such'... | [-0.1482487183510318, 0.21808146429443812, -0.11804162336810797, 0.07093462115740638, 0.015130468174627348, -0.21972393424899764, 0.024142382759405223, 0.2990611203312248, -0.2244032207062515, -0.21927547904060168, 0.08902843452074385, -0.26848117285212425, -0.08619323974287435, 0.1364586854963994, -0.08168319833832753... |
1,803.09542 | \b{eta}-KMS Green functions generating functionals - the convexity based
approach | The notion of the stochastically positive \b{eta}-KMS (Euclidean time ) Green
functionals on ( the abelian sectors of ) the CCR-algebras in Weyl form has
been introduced .The main observation is that the essential properties of such
functionals are stable against taking convex superpositions of them. Starting
from th... | quant-ph | the notion of the stochastically positive betakms euclidean time green functionals on the abelian sectors of the ccralgebras in weyl form has been introduced the main observation is that the essential properties of such functionals are stable against taking convex superpositions of them starting from the free bose matt... | [['the', 'notion', 'of', 'the', 'stochastically', 'positive', 'betakms', 'euclidean', 'time', 'green', 'functionals', 'on', 'the', 'abelian', 'sectors', 'of', 'the', 'ccralgebras', 'in', 'weyl', 'form', 'has', 'been', 'introduced', 'the', 'main', 'observation', 'is', 'that', 'the', 'essential', 'properties', 'of', 'suc... | [-0.11458473584045553, 0.15902553220102736, -0.13984235973718265, 0.1009458326163305, -0.021051426185294986, -0.09717614262330311, -0.027738924817337345, 0.33358996552932596, -0.25247457785600863, -0.2356232614773843, 0.06130024174624985, -0.2936122195570971, -0.12361246852809994, 0.196456053621929, -0.0331277305829442... |
1,803.09543 | Adaptive Fuzzy Controller for Synchronous Generator | This paper describes a PI fuzzy adaptive control structure. Based on
classical PI fuzzy control structure (with integration on controller output)
the authors have developed, implemented and validated an on-line self-tuning
mechanism of regulator parameter. A study case for validation of proposed
tuning mechanism is p... | cs.SY | this paper describes a pi fuzzy adaptive control structure based on classical pi fuzzy control structure with integration on controller output the authors have developed implemented and validated an online selftuning mechanism of regulator parameter a study case for validation of proposed tuning mechanism is presented ... | [['this', 'paper', 'describes', 'a', 'pi', 'fuzzy', 'adaptive', 'control', 'structure', 'based', 'on', 'classical', 'pi', 'fuzzy', 'control', 'structure', 'with', 'integration', 'on', 'controller', 'output', 'the', 'authors', 'have', 'developed', 'implemented', 'and', 'validated', 'an', 'online', 'selftuning', 'mechani... | [-0.15229370935182823, 0.005836721846942071, -0.09125081452504291, 0.001693281394086386, -0.1125444555328342, -0.18906446681929784, 0.061889393003902546, 0.38022121434148987, -0.25071136133843347, -0.2985816215932892, 0.11987259475261039, -0.1794623173283119, -0.19829840597026704, 0.2092696371929426, -0.086986447635449... |
1,803.09544 | A General Path-Based Representation for Predicting Program Properties | Predicting program properties such as names or expression types has a wide
range of applications. It can ease the task of programming and increase
programmer productivity. A major challenge when learning from programs is
$\textit{how to represent programs in a way that facilitates effective
learning}$.
We present a... | cs.PL cs.LG | predicting program properties such as names or expression types has a wide range of applications it can ease the task of programming and increase programmer productivity a major challenge when learning from programs is textithow to represent programs in a way that facilitates effective learning we present a textitgener... | [['predicting', 'program', 'properties', 'such', 'as', 'names', 'or', 'expression', 'types', 'has', 'a', 'wide', 'range', 'of', 'applications', 'it', 'can', 'ease', 'the', 'task', 'of', 'programming', 'and', 'increase', 'programmer', 'productivity', 'a', 'major', 'challenge', 'when', 'learning', 'from', 'programs', 'is... | [-0.03397363061627383, -0.02556409944765388, -0.09935709842106219, 0.10291441127417052, -0.17704747228947265, -0.18750653426759142, 0.05737616415394263, 0.4395668307151744, -0.30732410756634576, -0.36262155317506756, 0.04329582187100733, -0.24331350738520516, -0.1644237571674345, 0.22329736388382063, -0.100402852769192... |
1,803.09545 | Infinitesimal Weak Rigidity, Formation Control of Three Agents, and
Extension to 3-dimensional Space | In this paper, we introduce new concepts of weak rigidity matrix and
infinitesimal weak rigidity for planar frameworks. The weak rigidity matrix is
used to directly check if a framework is infinitesimally weakly rigid while
previous work can check a weak rigidity of a framework indirectly. An
infinitesimal weak rigid... | cs.SY | in this paper we introduce new concepts of weak rigidity matrix and infinitesimal weak rigidity for planar frameworks the weak rigidity matrix is used to directly check if a framework is infinitesimally weakly rigid while previous work can check a weak rigidity of a framework indirectly an infinitesimal weak rigidity f... | [['in', 'this', 'paper', 'we', 'introduce', 'new', 'concepts', 'of', 'weak', 'rigidity', 'matrix', 'and', 'infinitesimal', 'weak', 'rigidity', 'for', 'planar', 'frameworks', 'the', 'weak', 'rigidity', 'matrix', 'is', 'used', 'to', 'directly', 'check', 'if', 'a', 'framework', 'is', 'infinitesimally', 'weakly', 'rigid', ... | [-0.12677220275004705, 0.12040786569094053, -0.1061846549405406, 0.06083131418408205, -0.1051490443572402, -0.1633187254021565, 0.03693163788023715, 0.3633855162685116, -0.3321213346688698, -0.2522692865350594, 0.0994091659768795, -0.2011118238947044, -0.17872332072040686, 0.13484809726321448, -0.11410154681963225, 0.0... |
1,803.09546 | Calibrated Prediction Intervals for Neural Network Regressors | Ongoing developments in neural network models are continually advancing the
state of the art in terms of system accuracy. However, the predicted labels
should not be regarded as the only core output; also important is a
well-calibrated estimate of the prediction uncertainty. Such estimates and
their calibration are c... | stat.ML cs.LG | ongoing developments in neural network models are continually advancing the state of the art in terms of system accuracy however the predicted labels should not be regarded as the only core output also important is a wellcalibrated estimate of the prediction uncertainty such estimates and their calibration are critical... | [['ongoing', 'developments', 'in', 'neural', 'network', 'models', 'are', 'continually', 'advancing', 'the', 'state', 'of', 'the', 'art', 'in', 'terms', 'of', 'system', 'accuracy', 'however', 'the', 'predicted', 'labels', 'should', 'not', 'be', 'regarded', 'as', 'the', 'only', 'core', 'output', 'also', 'important', 'is'... | [-0.04460319349083067, 0.017501355442382866, -0.04675781140125495, 0.1281582615349045, -0.058647707027072705, -0.1859970260627085, 0.02627619563632093, 0.47060105913422173, -0.2223571866213913, -0.3497568123102947, 0.12813822090996568, -0.2593727067406117, -0.13868167550713728, 0.28500554704536357, -0.10904736313279029... |
1,803.09547 | A new probabilistic interpretation of Bramble-Hilbert lemma | The aim of this paper is to provide new perspectives on relative finite
element accuracy which is usually based on the asymptotic speed of convergence
comparison when the mesh size $h$ goes to zero. Starting from a geometrical
reading of the error estimate due to Bramble-Hilbert lemma, we derive two
probability distr... | math.NA | the aim of this paper is to provide new perspectives on relative finite element accuracy which is usually based on the asymptotic speed of convergence comparison when the mesh size h goes to zero starting from a geometrical reading of the error estimate due to bramblehilbert lemma we derive two probability distribution... | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'provide', 'new', 'perspectives', 'on', 'relative', 'finite', 'element', 'accuracy', 'which', 'is', 'usually', 'based', 'on', 'the', 'asymptotic', 'speed', 'of', 'convergence', 'comparison', 'when', 'the', 'mesh', 'size', 'h', 'goes', 'to', 'zero', 'starting', 'from', ... | [-0.09395134341668064, 0.10686692555323926, -0.11453053656401574, 0.05637172878070504, -0.08332585793740432, -0.1368790364849868, 0.10274735493948597, 0.33909796214226734, -0.2828406695289315, -0.30677310830204313, 0.08827227272452154, -0.2607078818249764, -0.07506566695813431, 0.17945059827836488, -0.09471844721995636... |
1,803.09548 | Reaction kinetics in open reactors and serial transfers between closed
reactors | Kinetic theory and thermodynamics of reaction networks are extended to the
out-of-equilibrium dynamics of continuous-flow stirred tank reactors (CSTR) and
serial transfers. On the basis of their stoichiometry matrix, the conservation
laws and the cycles of the network are determined for both dynamics. It is
shown tha... | cond-mat.stat-mech | kinetic theory and thermodynamics of reaction networks are extended to the outofequilibrium dynamics of continuousflow stirred tank reactors cstr and serial transfers on the basis of their stoichiometry matrix the conservation laws and the cycles of the network are determined for both dynamics it is shown that the cstr... | [['kinetic', 'theory', 'and', 'thermodynamics', 'of', 'reaction', 'networks', 'are', 'extended', 'to', 'the', 'outofequilibrium', 'dynamics', 'of', 'continuousflow', 'stirred', 'tank', 'reactors', 'cstr', 'and', 'serial', 'transfers', 'on', 'the', 'basis', 'of', 'their', 'stoichiometry', 'matrix', 'the', 'conservation'... | [-0.1312666009596624, 0.16687531459383603, -0.06109698030338827, 0.04885492383342671, 0.013879621867090464, -0.09780115541410599, 0.013209756688949019, 0.3472335237574621, -0.29871766361659463, -0.28060590863622126, 0.08468801434233404, -0.2854887709075952, -0.1147563405994353, 0.19103348980501403, 0.011039600578429055... |
1,803.09549 | Comparative Study Regarding Control of Wind Energy Conversion Systems
Based on the Usage of Classical and Adaptive Neuro Fuzzy Controllers | The paper presents a comparative study regarding the control (using an
adaptive neuro-fuzzy controller and a PD controller) based on the simulation of
wind energy conversion systems functioning. There are considered several
simulations based on asynchronous generator usage, by using the dedicated
MATLAB-PSB (Power Sy... | cs.SY | the paper presents a comparative study regarding the control using an adaptive neurofuzzy controller and a pd controller based on the simulation of wind energy conversion systems functioning there are considered several simulations based on asynchronous generator usage by using the dedicated matlabpsb power system bloc... | [['the', 'paper', 'presents', 'a', 'comparative', 'study', 'regarding', 'the', 'control', 'using', 'an', 'adaptive', 'neurofuzzy', 'controller', 'and', 'a', 'pd', 'controller', 'based', 'on', 'the', 'simulation', 'of', 'wind', 'energy', 'conversion', 'systems', 'functioning', 'there', 'are', 'considered', 'several', 's... | [-0.16362729911570964, -0.055096254169968786, -0.06673198314788549, -0.030257416667629277, -0.02966077049748729, -0.16937420715618393, 0.032012811763232334, 0.39377528914938803, -0.22605989784326241, -0.30996630838869704, 0.15639009473480933, -0.23061640383473234, -0.16672169311862925, 0.30814084021941474, -0.074831734... |
1,803.0955 | Hyperuniformity in amorphous speckle patterns | Hyperuniform structures possess the ability to confine and drive light,
although their fabrication is extremely challenging. Here we demonstrate that
speckle patters obtained by a superposition of randomly arranged sources of
Bessel beams can be used to generate hyperunifrom scalar fields. By exploiting
laser light t... | physics.optics | hyperuniform structures possess the ability to confine and drive light although their fabrication is extremely challenging here we demonstrate that speckle patters obtained by a superposition of randomly arranged sources of bessel beams can be used to generate hyperunifrom scalar fields by exploiting laser light tailor... | [['hyperuniform', 'structures', 'possess', 'the', 'ability', 'to', 'confine', 'and', 'drive', 'light', 'although', 'their', 'fabrication', 'is', 'extremely', 'challenging', 'here', 'we', 'demonstrate', 'that', 'speckle', 'patters', 'obtained', 'by', 'a', 'superposition', 'of', 'randomly', 'arranged', 'sources', 'of', '... | [-0.09011935451999306, 0.17789446043185309, -0.14150453955400735, 0.04693377721356228, -0.06968506227713078, -0.16276823986787348, 0.019562995815649627, 0.49993851030245423, -0.26390405304729936, -0.3250025856681168, 0.0590069084521383, -0.26599585828371347, -0.15633809197694062, 0.18324025623500348, -0.029241603212431... |
1,803.09551 | Collaborative Filtering with Topic and Social Latent Factors
Incorporating Implicit Feedback | Recommender systems (RSs) provide an effective way of alleviating the
information overload problem by selecting personalized items for different
users. Latent factors based collaborative filtering (CF) has become the popular
approaches for RSs due to its accuracy and scalability. Recently, online social
networks and ... | cs.IR cs.AI cs.CL cs.LG | recommender systems rss provide an effective way of alleviating the information overload problem by selecting personalized items for different users latent factors based collaborative filtering cf has become the popular approaches for rss due to its accuracy and scalability recently online social networks and usergener... | [['recommender', 'systems', 'rss', 'provide', 'an', 'effective', 'way', 'of', 'alleviating', 'the', 'information', 'overload', 'problem', 'by', 'selecting', 'personalized', 'items', 'for', 'different', 'users', 'latent', 'factors', 'based', 'collaborative', 'filtering', 'cf', 'has', 'become', 'the', 'popular', 'approac... | [-0.025887006192408756, -0.02995426623045419, -0.04186831689302755, 0.10315360184376557, -0.16888270617060946, -0.15615248732387507, 0.10220776434917021, 0.4421894647838438, -0.2637370730585912, -0.33843721213348793, 0.06629065106989954, -0.34523520811789615, -0.20890671828779958, 0.12161652853726135, -0.06435146062536... |
1,803.09552 | A new mixed functional-probabilistic approach for finite element
accuracy | The aim of this paper is to provide a new perspective on finite element
accuracy. Starting from a geometrical reading of the Bramble-Hilbert lemma, we
recall the two probabilistic laws we got in previous works that estimate the
relative accuracy, considered as a random variable, between two finite elements
$P_k$ and ... | math.NA | the aim of this paper is to provide a new perspective on finite element accuracy starting from a geometrical reading of the bramblehilbert lemma we recall the two probabilistic laws we got in previous works that estimate the relative accuracy considered as a random variable between two finite elements p_k and p_m k m t... | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'provide', 'a', 'new', 'perspective', 'on', 'finite', 'element', 'accuracy', 'starting', 'from', 'a', 'geometrical', 'reading', 'of', 'the', 'bramblehilbert', 'lemma', 'we', 'recall', 'the', 'two', 'probabilistic', 'laws', 'we', 'got', 'in', 'previous', 'works', 'that'... | [-0.10712020704264028, 0.12522020678346354, -0.11473690237229069, 0.062493221347944605, -0.07034335872158408, -0.12531869782445332, 0.11897637445815942, 0.3367526344075385, -0.2751532415962882, -0.29695293627058467, 0.06042270055558119, -0.28606923196413037, -0.09388754008557751, 0.17237460422588305, -0.109343072389149... |
1,803.09553 | Local verification of global proofs | In this work we study the cost of local and global proofs on distributed
verification. In this setting the nodes of a distributed system are provided
with a nondeterministic proof for the correctness of the state of the system,
and the nodes need to verify this proof by looking at only their local
neighborhood in the... | cs.DC cs.LO | in this work we study the cost of local and global proofs on distributed verification in this setting the nodes of a distributed system are provided with a nondeterministic proof for the correctness of the state of the system and the nodes need to verify this proof by looking at only their local neighborhood in the sys... | [['in', 'this', 'work', 'we', 'study', 'the', 'cost', 'of', 'local', 'and', 'global', 'proofs', 'on', 'distributed', 'verification', 'in', 'this', 'setting', 'the', 'nodes', 'of', 'a', 'distributed', 'system', 'are', 'provided', 'with', 'a', 'nondeterministic', 'proof', 'for', 'the', 'correctness', 'of', 'the', 'state'... | [-0.14255520378828984, 0.037208901295679844, -0.11521288063698287, 0.033632992770811866, -0.06122913982563198, -0.14424790998489545, 0.10979494083158929, 0.3352078203790881, -0.28543218900334877, -0.3099889682394824, 0.11925292363203374, -0.2347590849904591, -0.13517348667414025, 0.16932832877601273, -0.096902628580631... |
1,803.09554 | Determinants, Choices and Combinatorics | We prove a formula which generalizes both Onn's colorful determinantal
formula, related to Rota's basis conjecture, and Svrtan's $n!$ formula, related
to the Atiyah-Sutcliffe problem. In some cases, our formula allows us to prove
some results similar in spirit to the statement of Rota's basis conjecture. We
prove suc... | math.CO | we prove a formula which generalizes both onns colorful determinantal formula related to rotas basis conjecture and svrtans n formula related to the atiyahsutcliffe problem in some cases our formula allows us to prove some results similar in spirit to the statement of rotas basis conjecture we prove such a result using... | [['we', 'prove', 'a', 'formula', 'which', 'generalizes', 'both', 'onns', 'colorful', 'determinantal', 'formula', 'related', 'to', 'rotas', 'basis', 'conjecture', 'and', 'svrtans', 'n', 'formula', 'related', 'to', 'the', 'atiyahsutcliffe', 'problem', 'in', 'some', 'cases', 'our', 'formula', 'allows', 'us', 'to', 'prove'... | [-0.10401172730480394, -0.022062841056299114, -0.1628996469967422, 0.13949477648924266, -0.12458212404615349, -0.19654547051334428, 0.06823009548206178, 0.22768294970904077, -0.2474969548897611, -0.25922960773228654, 0.05567912710460997, -0.2280879767488278, -0.2140194973021391, 0.2659887158208423, -0.16642619288777785... |
1,803.09555 | Radiation-reaction electromagnetic fields in metasurfaces, a complete
description of their optical properties | This paper derives the macroscopic electric and magnetic fields and the
surface susceptibilities for a metasurface, starting from the microscopic
scatterer distribution. It is assumed that these scatterers behave as electric
and magnetic dipoles under the influence of the incident radiation.
Interestingly not only th... | physics.optics cond-mat.mes-hall cond-mat.mtrl-sci | this paper derives the macroscopic electric and magnetic fields and the surface susceptibilities for a metasurface starting from the microscopic scatterer distribution it is assumed that these scatterers behave as electric and magnetic dipoles under the influence of the incident radiation interestingly not only the ret... | [['this', 'paper', 'derives', 'the', 'macroscopic', 'electric', 'and', 'magnetic', 'fields', 'and', 'the', 'surface', 'susceptibilities', 'for', 'a', 'metasurface', 'starting', 'from', 'the', 'microscopic', 'scatterer', 'distribution', 'it', 'is', 'assumed', 'that', 'these', 'scatterers', 'behave', 'as', 'electric', 'a... | [-0.1856425131255811, 0.2444594150224516, -0.08679137521985548, 0.06758894726554318, -0.10873954922699176, -0.08481337009249507, -0.034500270764142076, 0.3757897032810761, -0.2470473215688725, -0.317010502305788, 0.011998765044719787, -0.28277336342914683, -0.11578795298732616, 0.17624551811263905, 0.0567073037403191, ... |
1,803.09556 | Local well-posedness for the Hall-MHD system in optimal Sobolev Spaces | We show that the viscous resistive magneto-hydrodynamics system with Hall
effect is locally well-posed in $H^s(\mathbb R^n)\times
H^{s+1-\varepsilon}(\mathbb R^n)$ with $s>\frac{n}2-1$ and any small enough
$\varepsilon>0$ such that $s+1-\varepsilon>\frac{n}2$. This space is to date
the largest local well-posedness sp... | math.AP | we show that the viscous resistive magnetohydrodynamics system with hall effect is locally wellposed in hsmathbb rntimes hs1varepsilonmathbb rn with sfracn21 and any small enough varepsilon0 such that s1varepsilonfracn2 this space is to date the largest local wellposedness space in the class of sobolev spaces for the s... | [['we', 'show', 'that', 'the', 'viscous', 'resistive', 'magnetohydrodynamics', 'system', 'with', 'hall', 'effect', 'is', 'locally', 'wellposed', 'in', 'hsmathbb', 'rntimes', 'hs1varepsilonmathbb', 'rn', 'with', 'sfracn21', 'and', 'any', 'small', 'enough', 'varepsilon0', 'such', 'that', 's1varepsilonfracn2', 'this', 'sp... | [-0.17023075633351842, 0.11034075636228907, -0.03559284323766347, 0.05114410652764021, -0.0588645082335138, -0.10342118886089133, -0.06612347980450478, 0.30239652337566497, -0.32036590702351064, -0.20366137432715586, 0.16017890005229762, -0.28934675404020854, -0.11748692599095163, 0.20960026656675543, -0.07034912368192... |
1,803.09557 | RELICS: Strong Lensing analysis of the galaxy clusters Abell S295, Abell
697, MACS J0025.4-1222, and MACS J0159.8-0849 | We present a strong-lensing analysis of four massive galaxy clusters imaged
with the Hubble Space Telescope in the Reionization Lensing Cluster Survey. We
use a Light-Traces-Mass technique to uncover sets of multiply images and
constrain the mass distribution of the clusters. These mass models are the
first published... | astro-ph.CO astro-ph.GA | we present a stronglensing analysis of four massive galaxy clusters imaged with the hubble space telescope in the reionization lensing cluster survey we use a lighttracesmass technique to uncover sets of multiply images and constrain the mass distribution of the clusters these mass models are the first published for ab... | [['we', 'present', 'a', 'stronglensing', 'analysis', 'of', 'four', 'massive', 'galaxy', 'clusters', 'imaged', 'with', 'the', 'hubble', 'space', 'telescope', 'in', 'the', 'reionization', 'lensing', 'cluster', 'survey', 'we', 'use', 'a', 'lighttracesmass', 'technique', 'to', 'uncover', 'sets', 'of', 'multiply', 'images',... | [-0.05780597299942073, 0.025338210780589652, -0.07664452286240883, 0.10535563607190251, -0.10704016131118002, -0.09450302556761317, 0.04625617946913727, 0.4605819621885365, -0.12386761067535206, -0.3635357733785121, 0.042676348430162284, -0.3070940379888466, -0.030375501006256696, 0.2186034196470133, 0.0484888724976003... |
1,803.09558 | Notes on the motivic McKay correspondence for the group scheme
$\alpha_{p}$ | We formulate a conjecture on the motivic McKay correspondence for the group
scheme $ \alpha_{p}$ in characteristic $p>0$ and give a few evidences. The
conjecture especially claims that there would be a close relation between
quotient varieties by $\alpha_{p}$ and ones by the cyclic group of order $p$.
| math.AG | we formulate a conjecture on the motivic mckay correspondence for the group scheme alpha_p in characteristic p0 and give a few evidences the conjecture especially claims that there would be a close relation between quotient varieties by alpha_p and ones by the cyclic group of order p | [['we', 'formulate', 'a', 'conjecture', 'on', 'the', 'motivic', 'mckay', 'correspondence', 'for', 'the', 'group', 'scheme', 'alpha_p', 'in', 'characteristic', 'p0', 'and', 'give', 'a', 'few', 'evidences', 'the', 'conjecture', 'especially', 'claims', 'that', 'there', 'would', 'be', 'a', 'close', 'relation', 'between', '... | [-0.2382037054469928, 0.05768360076670317, -0.17865483843265695, 0.10842884908568987, -0.04380152446336727, -0.1981661827501623, 0.09041307128450655, 0.32243003268191156, -0.2951719954292825, -0.27734979075637267, 0.06414508515166396, -0.21192697545592773, -0.15270231430359343, 0.21598033884421308, -0.14234177710765855... |
1,803.09559 | On Expansion and Resolution in CEGAR Based QBF Solving | A quantified Boolean formula (QBF) is a propositional formula extended with
universal and existential quantification over propositions. There are two
methodologies in CEGAR based QBF solving techniques, one that is based on a
refinement loop that builds partial expansions and a more recent one that is
based on the co... | cs.LO | a quantified boolean formula qbf is a propositional formula extended with universal and existential quantification over propositions there are two methodologies in cegar based qbf solving techniques one that is based on a refinement loop that builds partial expansions and a more recent one that is based on the communic... | [['a', 'quantified', 'boolean', 'formula', 'qbf', 'is', 'a', 'propositional', 'formula', 'extended', 'with', 'universal', 'and', 'existential', 'quantification', 'over', 'propositions', 'there', 'are', 'two', 'methodologies', 'in', 'cegar', 'based', 'qbf', 'solving', 'techniques', 'one', 'that', 'is', 'based', 'on', 'a... | [-0.09415744451793476, 0.0061842229624744505, -0.1345065644418355, 0.07179392241336505, -0.13674555965865562, -0.171806006945969, 0.07748191679482781, 0.36916775246416883, -0.22048695013342826, -0.28309268141830607, 0.09489571558515308, -0.23982479662767478, -0.17089151097960503, 0.28221059031784534, -0.095684402672174... |
1,803.0956 | Forecasting Cyber Attacks with Imbalanced Data Sets and Different Time
Granularities | If cyber incidents are predicted a reasonable amount of time before they
occur, defensive actions to prevent their destructive effects could be planned.
Unfortunately, most of the time we do not have enough observables of the
malicious activities before they are already under way. Therefore, this work
suggests to use... | cs.CR | if cyber incidents are predicted a reasonable amount of time before they occur defensive actions to prevent their destructive effects could be planned unfortunately most of the time we do not have enough observables of the malicious activities before they are already under way therefore this work suggests to use unconv... | [['if', 'cyber', 'incidents', 'are', 'predicted', 'a', 'reasonable', 'amount', 'of', 'time', 'before', 'they', 'occur', 'defensive', 'actions', 'to', 'prevent', 'their', 'destructive', 'effects', 'could', 'be', 'planned', 'unfortunately', 'most', 'of', 'the', 'time', 'we', 'do', 'not', 'have', 'enough', 'observables', ... | [-0.09785625378135591, 0.10682489004539093, -0.10076110596564831, 0.13562840330923792, -0.11549388667044695, -0.17207646079768893, 0.09084093720302917, 0.3868061563873198, -0.23803669868866564, -0.33479940772231204, 0.10395489303118666, -0.3025942055508494, -0.15149480464460793, 0.19920808776587365, -0.1156676016747951... |
1,803.09561 | The Yagita invariant of symplectic groups of large rank | Fix a prime $p$, and let $R$ be any subring of the complex numbers that is
either integrally closed or contains a primitive $p$th root of 1. For each
$n\geq p-1$ we compute the Yagita invariant at the prime $p$ for the symplectic
group $Sp(2n,R)$.
| math.GR | fix a prime p and let r be any subring of the complex numbers that is either integrally closed or contains a primitive pth root of 1 for each ngeq p1 we compute the yagita invariant at the prime p for the symplectic group sp2nr | [['fix', 'a', 'prime', 'p', 'and', 'let', 'r', 'be', 'any', 'subring', 'of', 'the', 'complex', 'numbers', 'that', 'is', 'either', 'integrally', 'closed', 'or', 'contains', 'a', 'primitive', 'pth', 'root', 'of', '1', 'for', 'each', 'ngeq', 'p1', 'we', 'compute', 'the', 'yagita', 'invariant', 'at', 'the', 'prime', 'p', '... | [-0.28803518662850064, 0.11669041038775403, -0.09031131564536028, 0.03675918437592271, -0.06028709568911129, -0.23546939767483208, -0.057062046871417096, 0.25457218711574875, -0.3638373381147782, -0.1679983947840002, 0.06833893343185385, -0.2906187646504905, -0.05371861624945369, 0.18177791574659447, -0.083452077582478... |
1,803.09562 | On maximum and comparison principles for parabolic problems with the
$p$-Laplacian | We investigate strong and weak versions of maximum and comparison principles
for a class of quasilinear parabolic equations with the $p$-Laplacian $$
\partial_t u - \Delta_p u = \lambda |u|^{p-2} u + f(x,t) $$ under zero boundary
and nonnegative initial conditions on a bounded cylindrical domain $\Omega
\times (0, T)... | math.AP | we investigate strong and weak versions of maximum and comparison principles for a class of quasilinear parabolic equations with the plaplacian partial_t u delta_p u lambda up2 u fxt under zero boundary and nonnegative initial conditions on a bounded cylindrical domain omega times 0 t lambda in mathbbr and f in linftyo... | [['we', 'investigate', 'strong', 'and', 'weak', 'versions', 'of', 'maximum', 'and', 'comparison', 'principles', 'for', 'a', 'class', 'of', 'quasilinear', 'parabolic', 'equations', 'with', 'the', 'plaplacian', 'partial_t', 'u', 'delta_p', 'u', 'lambda', 'up2', 'u', 'fxt', 'under', 'zero', 'boundary', 'and', 'nonnegative... | [-0.22587530381667117, 0.08442031553325553, 0.06213894994774213, 0.01880964763307323, -0.09071432600030675, -0.24108420399328073, -0.03507659003759424, 0.3339441879031559, -0.3510013489673535, -0.11250016367994249, 0.12026282212076088, -0.37461993809168537, -0.00474083824083209, 0.12514096667485622, -0.0166153034816185... |
1,803.09563 | Computational modeling of multiphase viscoelastic and elastoviscoplastic
flows | In this paper, a three-dimensional numerical solver is developed for
suspensions of rigid and soft particles and droplets in viscoelastic and
elastoviscoplastic (EVP) fluids. The presented algorithm is designed to allow
for the first time three-dimensional simulations of inertial and turbulent EVP
fluids with a large... | physics.flu-dyn | in this paper a threedimensional numerical solver is developed for suspensions of rigid and soft particles and droplets in viscoelastic and elastoviscoplastic evp fluids the presented algorithm is designed to allow for the first time threedimensional simulations of inertial and turbulent evp fluids with a large number ... | [['in', 'this', 'paper', 'a', 'threedimensional', 'numerical', 'solver', 'is', 'developed', 'for', 'suspensions', 'of', 'rigid', 'and', 'soft', 'particles', 'and', 'droplets', 'in', 'viscoelastic', 'and', 'elastoviscoplastic', 'evp', 'fluids', 'the', 'presented', 'algorithm', 'is', 'designed', 'to', 'allow', 'for', 'th... | [-0.09771620742768443, 0.15406144496902438, -0.11275572759431514, -0.01768074449193399, -0.04426083707807177, -0.14023678162990788, -0.05881949313476159, 0.33612578017334266, -0.27167340923797306, -0.3210188693790962, 0.0975210393009503, -0.2511171172316209, -0.1151531909550332, 0.19265669390438048, -0.0237286490496111... |
1,803.09564 | Absence of ballistic charge transport in the half-filled 1D Hubbard
model | Whether in the thermodynamic limit of lattice length infinite, hole
concentration tending to zero, nonzero temperature, and U/t > 0 the charge
stiffness of the 1D Hubbard model with first neighbor transfer integral t and
on-site repulsion U is finite or vanishes and thus whether there is or there is
no ballistic char... | cond-mat.str-el | whether in the thermodynamic limit of lattice length infinite hole concentration tending to zero nonzero temperature and ut 0 the charge stiffness of the 1d hubbard model with first neighbor transfer integral t and onsite repulsion u is finite or vanishes and thus whether there is or there is no ballistic charge transp... | [['whether', 'in', 'the', 'thermodynamic', 'limit', 'of', 'lattice', 'length', 'infinite', 'hole', 'concentration', 'tending', 'to', 'zero', 'nonzero', 'temperature', 'and', 'ut', '0', 'the', 'charge', 'stiffness', 'of', 'the', '1d', 'hubbard', 'model', 'with', 'first', 'neighbor', 'transfer', 'integral', 't', 'and', '... | [-0.14414631852090265, 0.21487057214479535, -0.036686030018068694, 0.05696531601263925, 0.01441577583048414, -0.16372115952886232, 0.10224239745340408, 0.3447204256776076, -0.266655981295078, -0.24123436736752463, 0.042912918583584266, -0.342670595886398, -0.08048762490320557, 0.14352282560391172, 0.02593426887370363, ... |
1,803.09565 | SIG-DB: leveraging homomorphic encryption to Securely Interrogate
privately held Genomic DataBases | Genomic data are becoming increasingly valuable as we develop methods to
utilize the information at scale and gain a greater understanding of how
genetic information relates to biological function. Advances in synthetic
biology and the decreased cost of sequencing are increasing the amount of
privately held genomic d... | q-bio.QM cs.CR cs.DB q-bio.GN | genomic data are becoming increasingly valuable as we develop methods to utilize the information at scale and gain a greater understanding of how genetic information relates to biological function advances in synthetic biology and the decreased cost of sequencing are increasing the amount of privately held genomic data... | [['genomic', 'data', 'are', 'becoming', 'increasingly', 'valuable', 'as', 'we', 'develop', 'methods', 'to', 'utilize', 'the', 'information', 'at', 'scale', 'and', 'gain', 'a', 'greater', 'understanding', 'of', 'how', 'genetic', 'information', 'relates', 'to', 'biological', 'function', 'advances', 'in', 'synthetic', 'bi... | [-0.09976907738786395, 0.018098243085551077, -0.07286663823140165, 0.09261493887409111, -0.12015389058738947, -0.17158764292641232, 0.1054425960034132, 0.3835988926390807, -0.36253994847647847, -0.3347493918527228, 0.11831194025386746, -0.32326733416877684, -0.09768915493196498, 0.19411373093569032, -0.1241497629353155... |
1,803.09566 | BoSy: An Experimentation Framework for Bounded Synthesis | We present BoSy, a reactive synthesis tool based on the bounded synthesis
approach. Bounded synthesis ensures the minimality of the synthesized
implementation by incrementally increasing a bound on the size of the solutions
it considers. For each bound, the existence of a solution is encoded as a
logical constraint s... | cs.LO | we present bosy a reactive synthesis tool based on the bounded synthesis approach bounded synthesis ensures the minimality of the synthesized implementation by incrementally increasing a bound on the size of the solutions it considers for each bound the existence of a solution is encoded as a logical constraint solving... | [['we', 'present', 'bosy', 'a', 'reactive', 'synthesis', 'tool', 'based', 'on', 'the', 'bounded', 'synthesis', 'approach', 'bounded', 'synthesis', 'ensures', 'the', 'minimality', 'of', 'the', 'synthesized', 'implementation', 'by', 'incrementally', 'increasing', 'a', 'bound', 'on', 'the', 'size', 'of', 'the', 'solutions... | [-0.05478579391621881, 0.015100784262823354, -0.075340129647197, 0.0470062214622481, -0.09923223998328602, -0.2004767025579457, 0.04168439206529271, 0.3513060223794094, -0.30540261689909837, -0.36185323900922584, 0.16232133134423446, -0.2230938259581173, -0.10068242395710614, 0.24219359777074445, -0.03718302006384841, ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.