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.03867 | Attosecond electronic recollision as field detector | We demonstrate the complete reconstruction of the electric field of
visible-infrared pulses with energy as low as a few tens of nanojoules. The
technique allows for the reconstruction of the instantaneous electric field
vector direction and magnitude, thus giving access to the characterisation of
pulses with an arbit... | physics.optics | we demonstrate the complete reconstruction of the electric field of visibleinfrared pulses with energy as low as a few tens of nanojoules the technique allows for the reconstruction of the instantaneous electric field vector direction and magnitude thus giving access to the characterisation of pulses with an arbitrary ... | [['we', 'demonstrate', 'the', 'complete', 'reconstruction', 'of', 'the', 'electric', 'field', 'of', 'visibleinfrared', 'pulses', 'with', 'energy', 'as', 'low', 'as', 'a', 'few', 'tens', 'of', 'nanojoules', 'the', 'technique', 'allows', 'for', 'the', 'reconstruction', 'of', 'the', 'instantaneous', 'electric', 'field', '... | [-0.1325521600956563, 0.14507355163573266, -0.06366349207382882, 0.008376513547773357, -0.03179139716303325, -0.08831796468439279, 0.02132126827200409, 0.4433687721611932, -0.23995375928643625, -0.3960637618438341, 0.05552611336315749, -0.2288153631127443, -0.0163378962315619, 0.23618056715349667, 0.00887068855081452, ... |
1,803.03868 | Perturbation bounds for eigenspaces under a relative gap condition | A basic problem in operator theory is to estimate how a small perturbation
effects the eigenspaces of a self-adjoint compact operator. In this paper, we
prove upper bounds for the subspace distance, taylored for structured random
perturbations. As a main example, we consider the empirical covariance
operator, and sho... | math.PR math.FA | a basic problem in operator theory is to estimate how a small perturbation effects the eigenspaces of a selfadjoint compact operator in this paper we prove upper bounds for the subspace distance taylored for structured random perturbations as a main example we consider the empirical covariance operator and show that a ... | [['a', 'basic', 'problem', 'in', 'operator', 'theory', 'is', 'to', 'estimate', 'how', 'a', 'small', 'perturbation', 'effects', 'the', 'eigenspaces', 'of', 'a', 'selfadjoint', 'compact', 'operator', 'in', 'this', 'paper', 'we', 'prove', 'upper', 'bounds', 'for', 'the', 'subspace', 'distance', 'taylored', 'for', 'structu... | [-0.1345052999847879, 0.09960471090084563, -0.1323139593191445, 0.12335896210900198, -0.07700845178837577, -0.11377336695169409, 0.04585658095777035, 0.33551659145702917, -0.2831375589470069, -0.2170087033758561, 0.13692984015059967, -0.25601778204242387, -0.21862494071091837, 0.1635798102244735, -0.12361232177664837, ... |
1,803.03869 | Jamming in Perspective | Jamming occurs when objects like grains are packed tightly together (e.g.
grain silos). It is highly cooperative and can lead to phenomena like
earthquakes, traffic jams, etc. In this Letter we point out the paramount
importance of the underlying contact network for jammed systems; the network
must have one contact i... | cond-mat.dis-nn cond-mat.soft | jamming occurs when objects like grains are packed tightly together eg grain silos it is highly cooperative and can lead to phenomena like earthquakes traffic jams etc in this letter we point out the paramount importance of the underlying contact network for jammed systems the network must have one contact in excess of... | [['jamming', 'occurs', 'when', 'objects', 'like', 'grains', 'are', 'packed', 'tightly', 'together', 'eg', 'grain', 'silos', 'it', 'is', 'highly', 'cooperative', 'and', 'can', 'lead', 'to', 'phenomena', 'like', 'earthquakes', 'traffic', 'jams', 'etc', 'in', 'this', 'letter', 'we', 'point', 'out', 'the', 'paramount', 'im... | [-0.13933543069520252, 0.19182981394996945, -0.0739959662414493, 0.01622605454276653, -0.0679647205140373, -0.13875026483820077, 0.06835463942897055, 0.3708128888114281, -0.30114715972035394, -0.2901519347336486, 0.10866933888284364, -0.28635145546697033, -0.1956968389557206, 0.11982063989532095, -0.09226379336709259, ... |
1,803.0387 | Detecting Adversarial Examples via Neural Fingerprinting | Deep neural networks are vulnerable to adversarial examples, which
dramatically alter model output using small input changes. We propose Neural
Fingerprinting, a simple, yet effective method to detect adversarial examples
by verifying whether model behavior is consistent with a set of secret
fingerprints, inspired by... | cs.LG | deep neural networks are vulnerable to adversarial examples which dramatically alter model output using small input changes we propose neural fingerprinting a simple yet effective method to detect adversarial examples by verifying whether model behavior is consistent with a set of secret fingerprints inspired by the us... | [['deep', 'neural', 'networks', 'are', 'vulnerable', 'to', 'adversarial', 'examples', 'which', 'dramatically', 'alter', 'model', 'output', 'using', 'small', 'input', 'changes', 'we', 'propose', 'neural', 'fingerprinting', 'a', 'simple', 'yet', 'effective', 'method', 'to', 'detect', 'adversarial', 'examples', 'by', 'ver... | [-0.06994919420373205, -0.014529069524444507, -0.024903368829988934, 0.1024521613897398, -0.09226386242488262, -0.2557152272215229, 0.042221360149303985, 0.40636431730725925, -0.2512458026998461, -0.35338160613457026, 0.0798338523337165, -0.27034431878979825, -0.25586088850836425, 0.23386387972655776, -0.14935080581055... |
1,803.03871 | The Dynamical Mordell-Lang Conjecture for skew-linear self-maps | Let k be an algebraically closed field of characteristic 0, let X=P^1\times
A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y),
where g is a rational function, while A is an N-by-N matrix with entries in
k(x). We prove that if g is of the form x--->ax+b, then each irreducible curve
C of X w... | math.NT math.AG math.DS | let k be an algebraically closed field of characteristic 0 let xp1times an and let f be a rational endomorphism of x given by xygx axy where g is a rational function while a is an nbyn matrix with entries in kx we prove that if g is of the form xaxb then each irreducible curve c of x which intersects some orbit of f in... | [['let', 'k', 'be', 'an', 'algebraically', 'closed', 'field', 'of', 'characteristic', '0', 'let', 'xp1times', 'an', 'and', 'let', 'f', 'be', 'a', 'rational', 'endomorphism', 'of', 'x', 'given', 'by', 'xygx', 'axy', 'where', 'g', 'is', 'a', 'rational', 'function', 'while', 'a', 'is', 'an', 'nbyn', 'matrix', 'with', 'ent... | [-0.20733991970135804, 0.08309627967693588, -0.12160612837448295, -0.01793317837406497, -0.04444831822035929, -0.14920564623560104, -0.01619817638548754, 0.33639594398459977, -0.32136493387216397, -0.1867171131642693, 0.07024829631531875, -0.26479927167864675, -0.1426350550310381, 0.2186129484167796, -0.118208643169301... |
1,803.03872 | Continuous Combinatorics of Abelian Group Actions | This paper develops techniques which are used to answer a number of questions
in the theory of equivalence relations generated by continuous actions of
abelian groups. The methods center around the construction of certain
specialized hyper-aperiodic elements, which produce compact subflows with
useful properties. For... | math.LO math.CO math.GR | this paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups the methods center around the construction of certain specialized hyperaperiodic elements which produce compact subflows with useful properties for examp... | [['this', 'paper', 'develops', 'techniques', 'which', 'are', 'used', 'to', 'answer', 'a', 'number', 'of', 'questions', 'in', 'the', 'theory', 'of', 'equivalence', 'relations', 'generated', 'by', 'continuous', 'actions', 'of', 'abelian', 'groups', 'the', 'methods', 'center', 'around', 'the', 'construction', 'of', 'certa... | [-0.10330392364455664, 0.1158574797431536, -0.0809512489485101, 0.06847358828289779, -0.09605586944423893, -0.10831117658749406, 0.06554496259123868, 0.3712519746687677, -0.29038102240416647, -0.2843191523599312, 0.12101248827731283, -0.2609587221831819, -0.13323481403935103, 0.2183192245113192, -0.10637163851168696, 0... |
1,803.03873 | Non--geodesic circular motion of massive spinning test bodies | Recent interest on studying possible violations of the Equivalence Principle
has led to the development of space satellite missions testing it for bodies
moving on circular orbits around Earth. This experiment establishes that the
validity of the Equivalence Principle is independent of the composition of
bodies. Howe... | gr-qc | recent interest on studying possible violations of the equivalence principle has led to the development of space satellite missions testing it for bodies moving on circular orbits around earth this experiment establishes that the validity of the equivalence principle is independent of the composition of bodies however ... | [['recent', 'interest', 'on', 'studying', 'possible', 'violations', 'of', 'the', 'equivalence', 'principle', 'has', 'led', 'to', 'the', 'development', 'of', 'space', 'satellite', 'missions', 'testing', 'it', 'for', 'bodies', 'moving', 'on', 'circular', 'orbits', 'around', 'earth', 'this', 'experiment', 'establishes', '... | [-0.17323329082560227, 0.1505368268206143, -0.10700489580631256, 0.024302874123244438, -0.09609365687694747, -0.04180927031002073, -0.019860846205881178, 0.3258631133723484, -0.22727216453410598, -0.2979639449233303, 0.06035777597571723, -0.2656522022484433, -0.07263399383525614, 0.23694668630094723, -0.072624593764695... |
1,803.03874 | Tracking of the Internal Jugular Vein in Ultrasound Images Using Optical
Flow | Detection of relative changes in circulating blood volume is important to
guide resuscitation and manage variety of medical conditions including sepsis,
trauma, dialysis and congestive heart failure. Recent studies have shown that
estimates of circulating blood volume can be obtained from ultrasound imagery
of the of... | eess.IV | detection of relative changes in circulating blood volume is important to guide resuscitation and manage variety of medical conditions including sepsis trauma dialysis and congestive heart failure recent studies have shown that estimates of circulating blood volume can be obtained from ultrasound imagery of the of the ... | [['detection', 'of', 'relative', 'changes', 'in', 'circulating', 'blood', 'volume', 'is', 'important', 'to', 'guide', 'resuscitation', 'and', 'manage', 'variety', 'of', 'medical', 'conditions', 'including', 'sepsis', 'trauma', 'dialysis', 'and', 'congestive', 'heart', 'failure', 'recent', 'studies', 'have', 'shown', 't... | [-0.06100933867062188, 0.06138439415530725, -0.08273951699533923, 0.011118200502824038, -0.025909351148981262, -0.09759775302796202, -0.012427426160270856, 0.35950420442968606, -0.23460880412550814, -0.2980260025074875, 0.14813492066353898, -0.25298338154838845, -0.19343130305748094, 0.23487874410030515, -0.22792598569... |
1,803.03875 | Empirical Likelihood Based Summary ROC Curve for Meta-Analysis of
Diagnostic Studies | Objectives: This study provides an effective model selection method based on
the empirical likelihood approach for constructing summary receiver operating
characteristic (sROC) curves from meta-analyses of diagnostic studies.
Methods: We considered models from combinations of family indices and
specific pairs of tr... | stat.ME | objectives this study provides an effective model selection method based on the empirical likelihood approach for constructing summary receiver operating characteristic sroc curves from metaanalyses of diagnostic studies methods we considered models from combinations of family indices and specific pairs of transformati... | [['objectives', 'this', 'study', 'provides', 'an', 'effective', 'model', 'selection', 'method', 'based', 'on', 'the', 'empirical', 'likelihood', 'approach', 'for', 'constructing', 'summary', 'receiver', 'operating', 'characteristic', 'sroc', 'curves', 'from', 'metaanalyses', 'of', 'diagnostic', 'studies', 'methods', 'w... | [-0.0044350347830913964, -0.01763495418417733, -0.10371636514072165, 0.11303281681329914, -0.054964681604707785, -0.17650060183227514, 0.08070160506970503, 0.4268803744379318, -0.17214822651038764, -0.36181882504148016, 0.10353713009548797, -0.2522049025322, -0.16490902549474304, 0.26352238589721366, -0.072031028692921... |
1,803.03876 | Correlation Measurements Between Flow Harmonics in Au+Au Collisions at
RHIC | Flow harmonics ($v_n$) in the Fourier expansion of the azimuthal distribution
of particles are widely used to quantify the anisotropy in particle emission in
high-energy heavy-ion collisions. The symmetric cumulants, $SC(m,n)$, are used
to measure the correlations between different orders of flow harmonics. These
cor... | nucl-ex hep-ex | flow harmonics v_n in the fourier expansion of the azimuthal distribution of particles are widely used to quantify the anisotropy in particle emission in highenergy heavyion collisions the symmetric cumulants scmn are used to measure the correlations between different orders of flow harmonics these correlations are use... | [['flow', 'harmonics', 'v_n', 'in', 'the', 'fourier', 'expansion', 'of', 'the', 'azimuthal', 'distribution', 'of', 'particles', 'are', 'widely', 'used', 'to', 'quantify', 'the', 'anisotropy', 'in', 'particle', 'emission', 'in', 'highenergy', 'heavyion', 'collisions', 'the', 'symmetric', 'cumulants', 'scmn', 'are', 'use... | [-0.08923732484975051, 0.2316987514189781, -0.17572069725572642, 0.11963668827758883, 0.027858201860332152, -0.0805206424840879, -0.13236619265828753, 0.37077033102753937, -0.22765501900335572, -0.3354740624836353, -0.05550717191602335, -0.40293333907458634, 0.08712277933080712, 0.1617044838153027, 0.0856430183381756, ... |
1,803.03877 | On dynamic ensemble selection and data preprocessing for multi-class
imbalance learning | Class-imbalance refers to classification problems in which many more
instances are available for certain classes than for others. Such imbalanced
datasets require special attention because traditional classifiers generally
favor the majority class which has a large number of instances. Ensemble of
classifiers have be... | stat.ML cs.LG | classimbalance refers to classification problems in which many more instances are available for certain classes than for others such imbalanced datasets require special attention because traditional classifiers generally favor the majority class which has a large number of instances ensemble of classifiers have been re... | [['classimbalance', 'refers', 'to', 'classification', 'problems', 'in', 'which', 'many', 'more', 'instances', 'are', 'available', 'for', 'certain', 'classes', 'than', 'for', 'others', 'such', 'imbalanced', 'datasets', 'require', 'special', 'attention', 'because', 'traditional', 'classifiers', 'generally', 'favor', 'the... | [-0.04545704754106565, 0.026718817454082822, -0.018030365689428174, 0.12236518410508575, -0.07559817597485971, -0.2037383216176776, 0.04100618808466158, 0.4257060452161924, -0.1961483891641694, -0.3640663380653638, 0.12369401806263604, -0.2876208581560143, -0.1508289887772306, 0.2638464483189518, -0.11348850391400249, ... |
1,803.03878 | Identification of SM-OFDM and AL-OFDM Signals Based on Their
Second-Order Cyclostationarity | Automatic signal identification (ASI) has important applications to both
commercial and military communications, such as software defined radio,
cognitive radio, spectrum surveillance and monitoring, and electronic warfare.
While ASI has been intensively studied for single-input single-output systems,
only a few inve... | eess.SP | automatic signal identification asi has important applications to both commercial and military communications such as software defined radio cognitive radio spectrum surveillance and monitoring and electronic warfare while asi has been intensively studied for singleinput singleoutput systems only a few investigations h... | [['automatic', 'signal', 'identification', 'asi', 'has', 'important', 'applications', 'to', 'both', 'commercial', 'and', 'military', 'communications', 'such', 'as', 'software', 'defined', 'radio', 'cognitive', 'radio', 'spectrum', 'surveillance', 'and', 'monitoring', 'and', 'electronic', 'warfare', 'while', 'asi', 'has... | [-0.23566681187930366, 0.017163731664749642, -0.028856556794996702, -0.018172129865683194, -0.0987417115942545, -0.2401382081818977, 0.007074315522444404, 0.41721756895253015, -0.19357885688077658, -0.27822387454310255, 0.15910069592909196, -0.21802603819167182, -0.2316220290132708, 0.22947431668909568, -0.105709942335... |
1,803.03879 | Knowledge Aided Consistency for Weakly Supervised Phrase Grounding | Given a natural language query, a phrase grounding system aims to localize
mentioned objects in an image. In weakly supervised scenario, mapping between
image regions (i.e., proposals) and language is not available in the training
set. Previous methods address this deficiency by training a grounding system
via learni... | cs.CV | given a natural language query a phrase grounding system aims to localize mentioned objects in an image in weakly supervised scenario mapping between image regions ie proposals and language is not available in the training set previous methods address this deficiency by training a grounding system via learning to recon... | [['given', 'a', 'natural', 'language', 'query', 'a', 'phrase', 'grounding', 'system', 'aims', 'to', 'localize', 'mentioned', 'objects', 'in', 'an', 'image', 'in', 'weakly', 'supervised', 'scenario', 'mapping', 'between', 'image', 'regions', 'ie', 'proposals', 'and', 'language', 'is', 'not', 'available', 'in', 'the', 't... | [-0.035423975391593955, -0.014058959201109422, -0.03613673665010965, 0.08729659237250888, -0.1781115573522332, -0.18636675176760517, 0.06627115705513384, 0.43856764208884486, -0.2884532187739948, -0.3317197066821517, 0.01339822057185762, -0.2860272065904665, -0.15833234578281283, 0.12703299534181695, -0.188311934492870... |
1,803.0388 | Combating Adversarial Attacks Using Sparse Representations | It is by now well-known that small adversarial perturbations can induce
classification errors in deep neural networks (DNNs). In this paper, we make
the case that sparse representations of the input data are a crucial tool for
combating such attacks. For linear classifiers, we show that a sparsifying
front end is pro... | stat.ML cs.IT cs.LG math.IT | it is by now wellknown that small adversarial perturbations can induce classification errors in deep neural networks dnns in this paper we make the case that sparse representations of the input data are a crucial tool for combating such attacks for linear classifiers we show that a sparsifying front end is provably eff... | [['it', 'is', 'by', 'now', 'wellknown', 'that', 'small', 'adversarial', 'perturbations', 'can', 'induce', 'classification', 'errors', 'in', 'deep', 'neural', 'networks', 'dnns', 'in', 'this', 'paper', 'we', 'make', 'the', 'case', 'that', 'sparse', 'representations', 'of', 'the', 'input', 'data', 'are', 'a', 'crucial', ... | [-0.10023071316498347, 0.051267015782078026, -0.07273038608006767, 0.07828289805720637, -0.07961454855461346, -0.19154168293643437, 0.04781731188423229, 0.39053164175558897, -0.28170157160579423, -0.269675275089494, 0.10481521234366677, -0.27196914185464505, -0.25678731902258195, 0.19574971056779938, -0.131242529004354... |
1,803.03881 | The linear stability of the Schwarzschild spacetime in the harmonic
gauge: odd part | In this paper, we study the odd solution of the linearlized Einstein equation
on the Schwarzschild background and in the harmonic gauge. With the aid of
Regge-Wheeler quantities, we are able to estimate the odd part of Lichnerowicz
d'Alembertian equation. In particular, we prove the solution decays at rate
$\tau^{-1+... | math.DG math.AP | in this paper we study the odd solution of the linearlized einstein equation on the schwarzschild background and in the harmonic gauge with the aid of reggewheeler quantities we are able to estimate the odd part of lichnerowicz dalembertian equation in particular we prove the solution decays at rate tau1delta to a line... | [['in', 'this', 'paper', 'we', 'study', 'the', 'odd', 'solution', 'of', 'the', 'linearlized', 'einstein', 'equation', 'on', 'the', 'schwarzschild', 'background', 'and', 'in', 'the', 'harmonic', 'gauge', 'with', 'the', 'aid', 'of', 'reggewheeler', 'quantities', 'we', 'are', 'able', 'to', 'estimate', 'the', 'odd', 'part'... | [-0.16487692369936177, 0.033804340252222925, -0.08903939836622718, 0.09223916187049606, -0.09843944077594922, -0.09301899447858047, -0.047116361742015354, 0.27917199635591644, -0.20609096838877752, -0.23721206492672747, 0.08947944608203565, -0.35194232837798506, -0.14664496538842706, 0.1438829955071784, -0.040935878212... |
1,803.03882 | An Iterative Global Structure-Assisted Labeled Network Aligner | Integrating data from heterogeneous sources is often modeled as merging
graphs. Given two or more 'compatible', but not-isomorphic graphs, the first
step is to identify a graph alignment, where a potentially partial mapping of
vertices between two graphs is computed. A significant portion of the
literature on this pr... | cs.SI | integrating data from heterogeneous sources is often modeled as merging graphs given two or more compatible but notisomorphic graphs the first step is to identify a graph alignment where a potentially partial mapping of vertices between two graphs is computed a significant portion of the literature on this problem only... | [['integrating', 'data', 'from', 'heterogeneous', 'sources', 'is', 'often', 'modeled', 'as', 'merging', 'graphs', 'given', 'two', 'or', 'more', 'compatible', 'but', 'notisomorphic', 'graphs', 'the', 'first', 'step', 'is', 'to', 'identify', 'a', 'graph', 'alignment', 'where', 'a', 'potentially', 'partial', 'mapping', 'o... | [-0.09930866753697515, 0.04874321611057366, -0.05434758733477323, 0.0777720526792109, -0.13701887601505844, -0.12277770675268145, 0.01947486881136654, 0.4183681869068213, -0.2878053546988315, -0.3489440866896222, 0.11966258110778948, -0.2749376383940539, -0.1482798252374895, 0.18738577150919986, -0.08461950666631662, 0... |
1,803.03883 | Deformation of product of complex Fano manifolds | Let X be a connected family of complex Fano manifolds. We show that if some
fiber is the product of two manifolds of lower dimensions, then so is every
fiber. Combining with previous work of Hwang and Mok, this implies immediately
that if a fiber is (possibly reducible) Hermitian symmetric space of compact
type, then... | math.AG | let x be a connected family of complex fano manifolds we show that if some fiber is the product of two manifolds of lower dimensions then so is every fiber combining with previous work of hwang and mok this implies immediately that if a fiber is possibly reducible hermitian symmetric space of compact type then all fibe... | [['let', 'x', 'be', 'a', 'connected', 'family', 'of', 'complex', 'fano', 'manifolds', 'we', 'show', 'that', 'if', 'some', 'fiber', 'is', 'the', 'product', 'of', 'two', 'manifolds', 'of', 'lower', 'dimensions', 'then', 'so', 'is', 'every', 'fiber', 'combining', 'with', 'previous', 'work', 'of', 'hwang', 'and', 'mok', 't... | [-0.17662017990554135, 0.13089724102367958, -0.07468573315926487, -0.0353605614167579, -0.1166383882407986, -0.20307269803292693, -0.05339303005131937, 0.4195399399004167, -0.2567546293065543, -0.13651113915774557, 0.14072562249318238, -0.2503699860609477, -0.2239472589913815, 0.237858765034212, -0.15201315183251624, -... |
1,803.03884 | Fibered varieties over curves with low slope and sharp bounds in
dimension three | In this paper, we first construct varieties of any dimension $n>2$ fibered
over curves with low slopes. These examples violate the conjectural slope
inequality of Barja and Stoppino [BS14b].
Led by their conjecture, we focus on finding the lowest possible slope when
$n=3$. Based on a characteristic $p > 0$ method, ... | math.AG | in this paper we first construct varieties of any dimension n2 fibered over curves with low slopes these examples violate the conjectural slope inequality of barja and stoppino bs14b led by their conjecture we focus on finding the lowest possible slope when n3 based on a characteristic p 0 method we prove that the shar... | [['in', 'this', 'paper', 'we', 'first', 'construct', 'varieties', 'of', 'any', 'dimension', 'n2', 'fibered', 'over', 'curves', 'with', 'low', 'slopes', 'these', 'examples', 'violate', 'the', 'conjectural', 'slope', 'inequality', 'of', 'barja', 'and', 'stoppino', 'bs14b', 'led', 'by', 'their', 'conjecture', 'we', 'focus... | [-0.14366143610791168, 0.04741964188024384, -0.09560054845217639, 0.12041062386867549, -0.06669803984234778, -0.23560537686044314, 0.047325057487893826, 0.3051538651943816, -0.22380884675859655, -0.28680152817974863, 0.0856843227183786, -0.24801095878359797, -0.17646009589504427, 0.27967796313324533, -0.161580268923286... |
1,803.03885 | Parallel FPGA Router using Sub-Gradient method and Steiner tree | In the FPGA (Field Programmable Gate Arrays) design flow, one of the most
time-consuming step is the routing of nets. Therefore, there is a need to
accelerate it. In a recent paper by Hoo et. al., the authors have developed a
Linear Programming based framework that parallelizes this routing process to
achieve signifi... | cs.DC math.OC | in the fpga field programmable gate arrays design flow one of the most timeconsuming step is the routing of nets therefore there is a need to accelerate it in a recent paper by hoo et al the authors have developed a linear programming based framework that parallelizes this routing process to achieve significant speedup... | [['in', 'the', 'fpga', 'field', 'programmable', 'gate', 'arrays', 'design', 'flow', 'one', 'of', 'the', 'most', 'timeconsuming', 'step', 'is', 'the', 'routing', 'of', 'nets', 'therefore', 'there', 'is', 'a', 'need', 'to', 'accelerate', 'it', 'in', 'a', 'recent', 'paper', 'by', 'hoo', 'et', 'al', 'the', 'authors', 'have... | [-0.08391558485105634, 0.009348940063267946, -0.08119351616874337, 0.027118987690926587, -0.06022194571234286, -0.1505133404377848, 0.07192435973836109, 0.4085598911922425, -0.2587926419959404, -0.3639086230099201, 0.11213586829043924, -0.23201484483480453, -0.16271509517729282, 0.22007643120083958, -0.0892094148974865... |
1,803.03886 | Structure preserving schemes for the continuum Kuramoto model: phase
transitions | The construction of numerical schemes for the Kuramoto model is challenging
due to the structural properties of the system which are essential in order to
capture the correct physical behavior, like the description of stationary
states and phase transitions. Additional difficulties are represented by the
high dimensi... | math.NA math.AP | the construction of numerical schemes for the kuramoto model is challenging due to the structural properties of the system which are essential in order to capture the correct physical behavior like the description of stationary states and phase transitions additional difficulties are represented by the high dimensional... | [['the', 'construction', 'of', 'numerical', 'schemes', 'for', 'the', 'kuramoto', 'model', 'is', 'challenging', 'due', 'to', 'the', 'structural', 'properties', 'of', 'the', 'system', 'which', 'are', 'essential', 'in', 'order', 'to', 'capture', 'the', 'correct', 'physical', 'behavior', 'like', 'the', 'description', 'of',... | [-0.14460031986150337, 0.10747381057202195, -0.04021639642478139, 0.0504262094640311, -0.032740380614995956, -0.11512752156704664, 0.017971096087152277, 0.34402870666235685, -0.27805847221450813, -0.30962670786754676, 0.09806472793355135, -0.25465592958412514, -0.1964103930319349, 0.16059306881140434, -0.03430902255543... |
1,803.03887 | Path of Vowel Raising in Chengdu Dialect of Mandarin | He and Rao (2013) reported a raising phenomenon of /a/ in /Xan/ (X being a
consonant or a vowel) in Chengdu dialect of Mandarin, i.e. /a/ is realized as
[epsilon] for young speakers but [ae] for older speakers, but they offered no
acoustic analysis. We designed an acoustic study that examined the realization
of /Xan/... | cs.CL | he and rao 2013 reported a raising phenomenon of a in xan x being a consonant or a vowel in chengdu dialect of mandarin ie a is realized as epsilon for young speakers but ae for older speakers but they offered no acoustic analysis we designed an acoustic study that examined the realization of xan in speakers of differe... | [['he', 'and', 'rao', '2013', 'reported', 'a', 'raising', 'phenomenon', 'of', 'a', 'in', 'xan', 'x', 'being', 'a', 'consonant', 'or', 'a', 'vowel', 'in', 'chengdu', 'dialect', 'of', 'mandarin', 'ie', 'a', 'is', 'realized', 'as', 'epsilon', 'for', 'young', 'speakers', 'but', 'ae', 'for', 'older', 'speakers', 'but', 'the... | [-0.07864768415122482, 0.13893318375287184, -0.03857928099939643, 0.09751718428742606, -0.08743063639202672, -0.19357871869578958, 0.09890760844508703, 0.3858550562419825, -0.19794988158833735, -0.32527992820487944, 0.0332981047772423, -0.308587123325668, -0.10673213680274785, 0.18268797645308682, -0.15232737056363407,... |
1,803.03888 | Large Leptonic Dirac CP Phase from Broken Democracy with Random
Perturbations | A large value of the leptonic Dirac CP phase can arise from broken democracy,
where the mass matrices are democratic up to small random perturbations. Such
perturbations are a natural consequence of broken residual $\mathbb S_3$
symmetries that dictate the democratic mass matrices at leading order. With
random pertur... | hep-ph | a large value of the leptonic dirac cp phase can arise from broken democracy where the mass matrices are democratic up to small random perturbations such perturbations are a natural consequence of broken residual mathbb s_3 symmetries that dictate the democratic mass matrices at leading order with random perturbations ... | [['a', 'large', 'value', 'of', 'the', 'leptonic', 'dirac', 'cp', 'phase', 'can', 'arise', 'from', 'broken', 'democracy', 'where', 'the', 'mass', 'matrices', 'are', 'democratic', 'up', 'to', 'small', 'random', 'perturbations', 'such', 'perturbations', 'are', 'a', 'natural', 'consequence', 'of', 'broken', 'residual', 'ma... | [-0.14345177915589563, 0.24492050127351078, -0.03715482185562623, 0.08815931732573642, -0.07242964321811651, -0.15068805549486444, 0.05176278799290544, 0.2914195545949042, -0.2642445472679262, -0.2973358066078147, 0.0909355052730775, -0.2756811881726929, -0.10711428534464333, 0.06209074821291042, -0.005518732724133237,... |
1,803.03889 | Fast algorithms for Jacobi expansions via nonoscillatory phase functions | We describe a suite of fast algorithms for evaluating Jacobi polynomials,
applying the corresponding discrete Sturm-Liouville eigentransforms and
calculating Gauss-Jacobi quadrature rules. Our approach is based on the
well-known fact that Jacobi's differential equation admits a nonoscillatory
phase function which can... | math.NA | we describe a suite of fast algorithms for evaluating jacobi polynomials applying the corresponding discrete sturmliouville eigentransforms and calculating gaussjacobi quadrature rules our approach is based on the wellknown fact that jacobis differential equation admits a nonoscillatory phase function which can be loos... | [['we', 'describe', 'a', 'suite', 'of', 'fast', 'algorithms', 'for', 'evaluating', 'jacobi', 'polynomials', 'applying', 'the', 'corresponding', 'discrete', 'sturmliouville', 'eigentransforms', 'and', 'calculating', 'gaussjacobi', 'quadrature', 'rules', 'our', 'approach', 'is', 'based', 'on', 'the', 'wellknown', 'fact',... | [-0.0768419081548181, -0.007167642279222118, -0.12857780941069508, 0.08060848349496388, -0.1367171064663965, -0.1502265710180673, 0.0012069327058270574, 0.39091085247361124, -0.27933802861177054, -0.24506188191186923, 0.14404903415990516, -0.2550495049725167, -0.17466432264206025, 0.31992181363061833, -0.03197564513315... |
1,803.0389 | Multigrid preconditioners for the Newton-Krylov method in the optimal
control of the stationary Navier-Stokes equations | The focus of this work is on the construction and analysis of optimal-order
multigrid preconditioners to be used in the Newton-Krylov method for a
distributed optimal control problem constrained by the stationary Navier-Stokes
equations. As in our earlier work [7] on the optimal control of the stationary
Stokes equat... | math.NA | the focus of this work is on the construction and analysis of optimalorder multigrid preconditioners to be used in the newtonkrylov method for a distributed optimal control problem constrained by the stationary navierstokes equations as in our earlier work 7 on the optimal control of the stationary stokes equations the... | [['the', 'focus', 'of', 'this', 'work', 'is', 'on', 'the', 'construction', 'and', 'analysis', 'of', 'optimalorder', 'multigrid', 'preconditioners', 'to', 'be', 'used', 'in', 'the', 'newtonkrylov', 'method', 'for', 'a', 'distributed', 'optimal', 'control', 'problem', 'constrained', 'by', 'the', 'stationary', 'navierstok... | [-0.12363962647224387, 0.03978934159819433, -0.08246932293664902, 0.0016545890450662543, -0.04048025945749741, -0.10361003432528558, 0.03822969336554752, 0.29091274156565416, -0.2894289498151353, -0.3356849396244643, 0.14507501926487773, -0.23647006520182423, -0.16251030311662149, 0.23193684054030014, -0.11694728220806... |
1,803.03891 | Predestined Dark Matter in Gauge Extensions of the Standard Model | In any gauge extension of the standard model (SM) of quarks and leptons,
there is a minimal set of fermion and scalar multiplets which encompasses all
the particles and interactions of the SM. Included within this set, there may
be a suitable dark-matter candidate. If not, one may still exist from the
judicious addit... | hep-ph | in any gauge extension of the standard model sm of quarks and leptons there is a minimal set of fermion and scalar multiplets which encompasses all the particles and interactions of the sm included within this set there may be a suitable darkmatter candidate if not one may still exist from the judicious addition of a s... | [['in', 'any', 'gauge', 'extension', 'of', 'the', 'standard', 'model', 'sm', 'of', 'quarks', 'and', 'leptons', 'there', 'is', 'a', 'minimal', 'set', 'of', 'fermion', 'and', 'scalar', 'multiplets', 'which', 'encompasses', 'all', 'the', 'particles', 'and', 'interactions', 'of', 'the', 'sm', 'included', 'within', 'this', ... | [-0.12202825270593166, 0.24661756813526153, -0.025560433589077246, 0.13479012542714675, -0.1300155258613328, -0.19893219366048773, 0.019581056653211516, 0.30842525356138745, -0.19165032607813676, -0.29784044772386553, 0.033917498320030666, -0.2711112957447767, -0.07458058085603018, 0.10578992883364359, 0.02026029142861... |
1,803.03892 | Toward Understanding the B[e] Phenomenon. VII. AS 386, a single-lined
binary with a candidate black hole component | We report the results of spectroscopic and photometric observations of the
emission-line object AS 386. For the first time, we found that it exhibits the
B[e] phenomenon and fits the definition of an FS CMa type object. The optical
spectrum shows the presence of a B-type star with the following properties: T_
eff = 1... | astro-ph.SR | we report the results of spectroscopic and photometric observations of the emissionline object as 386 for the first time we found that it exhibits the be phenomenon and fits the definition of an fs cma type object the optical spectrum shows the presence of a btype star with the following properties t_ eff 11000500 k lo... | [['we', 'report', 'the', 'results', 'of', 'spectroscopic', 'and', 'photometric', 'observations', 'of', 'the', 'emissionline', 'object', 'as', '386', 'for', 'the', 'first', 'time', 'we', 'found', 'that', 'it', 'exhibits', 'the', 'be', 'phenomenon', 'and', 'fits', 'the', 'definition', 'of', 'an', 'fs', 'cma', 'type', 'ob... | [-0.126722669797404, 0.10204644885226291, -0.09324499218033919, 0.019236493333981912, -0.08150276926200871, -0.08869979194570504, 0.04701589004600147, 0.424755714434293, -0.17716352725155873, -0.32673896619849285, 0.06772613114999915, -0.294911126418193, -0.03518511616377109, 0.18750302209476127, -0.06781646380320601, ... |
1,803.03893 | Unsupervised Learning of Monocular Depth Estimation and Visual Odometry
with Deep Feature Reconstruction | Despite learning based methods showing promising results in single view depth
estimation and visual odometry, most existing approaches treat the tasks in a
supervised manner. Recent approaches to single view depth estimation explore
the possibility of learning without full supervision via minimizing photometric
error... | cs.CV | despite learning based methods showing promising results in single view depth estimation and visual odometry most existing approaches treat the tasks in a supervised manner recent approaches to single view depth estimation explore the possibility of learning without full supervision via minimizing photometric error in ... | [['despite', 'learning', 'based', 'methods', 'showing', 'promising', 'results', 'in', 'single', 'view', 'depth', 'estimation', 'and', 'visual', 'odometry', 'most', 'existing', 'approaches', 'treat', 'the', 'tasks', 'in', 'a', 'supervised', 'manner', 'recent', 'approaches', 'to', 'single', 'view', 'depth', 'estimation',... | [-0.03795724633105454, -0.03540922942615691, -0.07383582113598962, 0.02434050232765176, -0.12297397017301548, -0.1784069652303255, 0.032507600638616296, 0.501410434253159, -0.2867638755262652, -0.3405700583631794, 0.057706770131785774, -0.26150818663604913, -0.1724342040753635, 0.23239503590656177, -0.20289068475276942... |
1,803.03894 | Twistor geometry of Hermitian surfaces induced by canonical connections | In this paper, following the constructions of N. R. O'Brian, J. H. Rawnsley
and I. Vaisman, we define four almost Hermitian structures (up to conjugation)
on the twistor space of a Hermitian surface by using canonical connections,
including the Lichnerowicz connection and the Chern connection. We also study
the relat... | math.DG | in this paper following the constructions of n r obrian j h rawnsley and i vaisman we define four almost hermitian structures up to conjugation on the twistor space of a hermitian surface by using canonical connections including the lichnerowicz connection and the chern connection we also study the relations between th... | [['in', 'this', 'paper', 'following', 'the', 'constructions', 'of', 'n', 'r', 'obrian', 'j', 'h', 'rawnsley', 'and', 'i', 'vaisman', 'we', 'define', 'four', 'almost', 'hermitian', 'structures', 'up', 'to', 'conjugation', 'on', 'the', 'twistor', 'space', 'of', 'a', 'hermitian', 'surface', 'by', 'using', 'canonical', 'co... | [-0.20532367604651622, 0.10361703763168956, -0.0504655476570839, 0.08310686482582241, -0.10345921894564988, -0.1228569341187794, 0.013925808487415668, 0.3641390378276507, -0.2621632766215101, -0.26576860018429305, 0.06334260887178104, -0.25030741188675165, -0.273235000377994, 0.12824979765961567, -0.10056142055148644, ... |
1,803.03895 | Reduction of Restricted Maximum Likelihood for Random Coefficient Models | The restricted maximum likelihood (REML) estimator of the dispersion matrix
for random coefficient models is rewritten in terms of the sufficient
statistics of the individual regressions.
| stat.ME math.ST stat.TH | the restricted maximum likelihood reml estimator of the dispersion matrix for random coefficient models is rewritten in terms of the sufficient statistics of the individual regressions | [['the', 'restricted', 'maximum', 'likelihood', 'reml', 'estimator', 'of', 'the', 'dispersion', 'matrix', 'for', 'random', 'coefficient', 'models', 'is', 'rewritten', 'in', 'terms', 'of', 'the', 'sufficient', 'statistics', 'of', 'the', 'individual', 'regressions']] | [-0.08410304471348914, 0.03696138755633281, -0.07385815669280979, 0.1104248665103044, -0.03895687999633642, -0.1594438158835356, 0.032166385682872854, 0.313378698264177, -0.2754519647703721, -0.28777504440110463, 0.11700299508923379, -0.26475748075888705, -0.12493589291205773, 0.12476645628563486, -0.05793906855755127,... |
1,803.03896 | Improved Asymptotics for Zeros of Kernel Estimates via a Reformulation
of the Leadbetter-Cryer Integral | The expected number of false inflection points of kernel smoothers is
evaluated. To obtain the small noise limit, we use a reformulation of the
Leadbetter-Cryer integral for the expected number of zero crossings of a
differentiable Gaussian process.
| stat.ME eess.SP math.PR math.ST physics.data-an stat.TH | the expected number of false inflection points of kernel smoothers is evaluated to obtain the small noise limit we use a reformulation of the leadbettercryer integral for the expected number of zero crossings of a differentiable gaussian process | [['the', 'expected', 'number', 'of', 'false', 'inflection', 'points', 'of', 'kernel', 'smoothers', 'is', 'evaluated', 'to', 'obtain', 'the', 'small', 'noise', 'limit', 'we', 'use', 'a', 'reformulation', 'of', 'the', 'leadbettercryer', 'integral', 'for', 'the', 'expected', 'number', 'of', 'zero', 'crossings', 'of', 'a',... | [-0.17660444431208275, 0.03941717412876519, -0.09837526762606325, 0.1366169472790667, -0.06383792886737029, -0.10692758981541202, 0.13200086685577156, 0.28741376625524984, -0.26473251851023855, -0.26800942239729136, 0.10138961495328191, -0.26622779788512335, -0.14988388876254494, 0.1949155841626831, -0.0990970461578989... |
1,803.03897 | Optimal Data-based Kernel Estimation of Evolutionary Spectra | Complex demodulation of evolutionary spectra is formulated as a
two-dimensional kernel smoother in the time-frequency domain. In the first
stage, a tapered Fourier transform, $y_{nu}(f,t)$, is calculated. Second, the
log-spectral estimate, $\hat{\theta}_{\nu}(f,t) \equiv \ln(|y_{nu}(f,t)|^2$, is
smoothed. As the char... | stat.ME eess.AS eess.IV eess.SP physics.data-an | complex demodulation of evolutionary spectra is formulated as a twodimensional kernel smoother in the timefrequency domain in the first stage a tapered fourier transform y_nuft is calculated second the logspectral estimate hattheta_nuft equiv lny_nuft2 is smoothed as the characteristic widths of the kernel smoother inc... | [['complex', 'demodulation', 'of', 'evolutionary', 'spectra', 'is', 'formulated', 'as', 'a', 'twodimensional', 'kernel', 'smoother', 'in', 'the', 'timefrequency', 'domain', 'in', 'the', 'first', 'stage', 'a', 'tapered', 'fourier', 'transform', 'y_nuft', 'is', 'calculated', 'second', 'the', 'logspectral', 'estimate', 'h... | [-0.1113263233518689, 0.11594539303286462, -0.07458808309500023, 0.1016427171001635, -0.0660748932842571, -0.13277252062597303, 0.013878339415734247, 0.40729159106947666, -0.3165443331270599, -0.2527455004337843, 0.1103384703113052, -0.24918667909384953, -0.06490896452082284, 0.1854115226121601, 0.010266576064888868, 0... |
1,803.03898 | Posterior Contraction and Credible Sets for Filaments of Regression
Functions | A filament consists of local maximizers of a smooth function $f$ when moving
in a certain direction. A filamentary structure is an important feature of the
shape of an object and is also considered as an important lower dimensional
characterization of multivariate data. There have been some recent theoretical
studies... | math.ST stat.TH | a filament consists of local maximizers of a smooth function f when moving in a certain direction a filamentary structure is an important feature of the shape of an object and is also considered as an important lower dimensional characterization of multivariate data there have been some recent theoretical studies of fi... | [['a', 'filament', 'consists', 'of', 'local', 'maximizers', 'of', 'a', 'smooth', 'function', 'f', 'when', 'moving', 'in', 'a', 'certain', 'direction', 'a', 'filamentary', 'structure', 'is', 'an', 'important', 'feature', 'of', 'the', 'shape', 'of', 'an', 'object', 'and', 'is', 'also', 'considered', 'as', 'an', 'importan... | [-0.0902558002538355, 0.019413000489114852, -0.09934481288182545, 0.06448513618785098, -0.07422687088740357, -0.07971353450643238, 0.028068286341384485, 0.42488012134368197, -0.2545014800402918, -0.2546922945431227, 0.10886056946643302, -0.22701441151844945, -0.13489781038863172, 0.21376476762472224, -0.063515081648425... |
1,803.03899 | Piecewise Convex Function Estimation: Pilot Estimators | Given noisy data, function estimation is considered when the unknown function
is known a priori to consist of a small number of regions where the function is
either convex or concave. When the number of regions is unknown, the model
selection problem is to determine the number of convexity change points. For
kernel e... | stat.ME eess.SP math.ST stat.TH | given noisy data function estimation is considered when the unknown function is known a priori to consist of a small number of regions where the function is either convex or concave when the number of regions is unknown the model selection problem is to determine the number of convexity change points for kernel estimat... | [['given', 'noisy', 'data', 'function', 'estimation', 'is', 'considered', 'when', 'the', 'unknown', 'function', 'is', 'known', 'a', 'priori', 'to', 'consist', 'of', 'a', 'small', 'number', 'of', 'regions', 'where', 'the', 'function', 'is', 'either', 'convex', 'or', 'concave', 'when', 'the', 'number', 'of', 'regions', '... | [-0.10986528390652925, 0.04557537008485381, -0.07272024304358893, 0.08053879564926192, -0.07638011687525074, -0.1324239991229485, 0.10443132312196356, 0.33699254439980314, -0.29755396450657334, -0.3120305833075882, 0.14443368025802142, -0.2773968583552918, -0.10687040542037912, 0.13793859526866295, -0.1146862730191124,... |
1,803.039 | Transfer Learning with Bellwethers to find Good Configurations | As software systems grow in complexity, the space of possible configurations
grows exponentially. Within this increasing complexity, developers,
maintainers, and users cannot keep track of the interactions between all the
various configuration options. Finding the optimally performing configuration
of a software syst... | cs.SE | as software systems grow in complexity the space of possible configurations grows exponentially within this increasing complexity developers maintainers and users cannot keep track of the interactions between all the various configuration options finding the optimally performing configuration of a software system for a... | [['as', 'software', 'systems', 'grow', 'in', 'complexity', 'the', 'space', 'of', 'possible', 'configurations', 'grows', 'exponentially', 'within', 'this', 'increasing', 'complexity', 'developers', 'maintainers', 'and', 'users', 'can', 'not', 'keep', 'track', 'of', 'the', 'interactions', 'between', 'all', 'the', 'variou... | [-0.09933999173739783, 0.029012236886231575, -0.07587263267807923, 0.05984057084227107, -0.08928730563749954, -0.18220028692809076, 0.0716986023698602, 0.3829811632996267, -0.2213739846690984, -0.38429236018209384, 0.10494059546242894, -0.23971491414951002, -0.15675226901460565, 0.239789015784173, -0.08938240514457979,... |
1,803.03901 | Piecewise Convex Function Estimation: Representations, Duality and Model
Selection | We consider spline estimates which preserve prescribed piecewise convex
properties of the unknown function. A robust version of the penalized
likelihood is given and shown to correspond to a variable halfwidth kernel
smoother where the halfwidth adaptively decreases in regions of rapid change of
the unknown function.... | stat.ME cs.SY eess.SP eess.SY math.ST physics.data-an stat.TH | we consider spline estimates which preserve prescribed piecewise convex properties of the unknown function a robust version of the penalized likelihood is given and shown to correspond to a variable halfwidth kernel smoother where the halfwidth adaptively decreases in regions of rapid change of the unknown function whe... | [['we', 'consider', 'spline', 'estimates', 'which', 'preserve', 'prescribed', 'piecewise', 'convex', 'properties', 'of', 'the', 'unknown', 'function', 'a', 'robust', 'version', 'of', 'the', 'penalized', 'likelihood', 'is', 'given', 'and', 'shown', 'to', 'correspond', 'to', 'a', 'variable', 'halfwidth', 'kernel', 'smoot... | [-0.06155802417299984, 0.05242516931475085, -0.09351709296598154, 0.07461244792485719, -0.11607809344525723, -0.1379364176708109, 0.0352086726548698, 0.37731128352529864, -0.32753272170255726, -0.23523959190420368, 0.14503223507884233, -0.2449005749405307, -0.14204073808334, 0.12886938467238318, -0.147306016712066, 0.0... |
1,803.03902 | Decay Rate of Electroweak Vacuum in the Standard Model and Beyond | We perform a precise calculation of the decay rate of the electroweak vacuum
in the standard model as well as in models beyond the standard model. We use a
recently-developed technique to calculate the decay rate of a false vacuum,
which provides a gauge invariant calculation of the decay rate at the one-loop
level. ... | hep-ph | we perform a precise calculation of the decay rate of the electroweak vacuum in the standard model as well as in models beyond the standard model we use a recentlydeveloped technique to calculate the decay rate of a false vacuum which provides a gauge invariant calculation of the decay rate at the oneloop level we give... | [['we', 'perform', 'a', 'precise', 'calculation', 'of', 'the', 'decay', 'rate', 'of', 'the', 'electroweak', 'vacuum', 'in', 'the', 'standard', 'model', 'as', 'well', 'as', 'in', 'models', 'beyond', 'the', 'standard', 'model', 'we', 'use', 'a', 'recentlydeveloped', 'technique', 'to', 'calculate', 'the', 'decay', 'rate',... | [-0.08360585172015887, 0.17385303516982673, -0.06738499386522633, 0.13463269002938597, -0.041533994370211776, -0.1225872172603909, 0.07125835160378557, 0.2970478097597758, -0.24391281305072018, -0.2805629041045904, 0.09461322291992987, -0.23625575558951076, -0.04468962780128305, 0.1639943588572817, 0.03387133980122132,... |
1,803.03903 | Piecewise Convex Function Estimation and Model Selection | Given noisy data, function estimation is considered when the unknown function
is known apriori to consist of a small number of regions where the function is
either convex or concave. When the regions are known apriori, the estimate is
reduced to a finite dimensional convex optimization in the dual space. When the
num... | stat.ME cs.LG eess.SP math.ST physics.data-an stat.TH | given noisy data function estimation is considered when the unknown function is known apriori to consist of a small number of regions where the function is either convex or concave when the regions are known apriori the estimate is reduced to a finite dimensional convex optimization in the dual space when the number of... | [['given', 'noisy', 'data', 'function', 'estimation', 'is', 'considered', 'when', 'the', 'unknown', 'function', 'is', 'known', 'apriori', 'to', 'consist', 'of', 'a', 'small', 'number', 'of', 'regions', 'where', 'the', 'function', 'is', 'either', 'convex', 'or', 'concave', 'when', 'the', 'regions', 'are', 'known', 'apri... | [-0.12176809222659185, 0.06375341824189361, -0.04660991297679998, 0.08422859056459163, -0.11433287606009149, -0.12806216135643245, 0.08124376580096959, 0.32455270267313435, -0.29867800963776453, -0.3091372211763103, 0.16506569051887796, -0.27900492219210027, -0.15145630058569146, 0.15272003488193842, -0.135011250031225... |
1,803.03904 | Banded Matrix Fraction Representation of Triangular Input Normal Pairs | An input pair $(A,B)$ is triangular input normal if and only if $A$ is
triangular and $AA^* + BB^* = I_n$, where $I_n$ is theidentity matrix. Input
normal pairs generate an orthonormal basis for the impulse response. Every
input pair may be transformed to a triangular input normal pair. A new system
representation is... | stat.ME cs.SY eess.SY math.OC math.RT | an input pair ab is triangular input normal if and only if a is triangular and aa bb i_n where i_n is theidentity matrix input normal pairs generate an orthonormal basis for the impulse response every input pair may be transformed to a triangular input normal pair a new system representation is given ab is triangular n... | [['an', 'input', 'pair', 'ab', 'is', 'triangular', 'input', 'normal', 'if', 'and', 'only', 'if', 'a', 'is', 'triangular', 'and', 'aa', 'bb', 'i_n', 'where', 'i_n', 'is', 'theidentity', 'matrix', 'input', 'normal', 'pairs', 'generate', 'an', 'orthonormal', 'basis', 'for', 'the', 'impulse', 'response', 'every', 'input', ... | [-0.17079771543288325, 0.15228930038643368, -0.010826250648228671, 0.0005732290721755094, -0.06225854951125665, -0.17446503038408132, 0.007787214093438284, 0.3998968181764986, -0.302588047709052, -0.23157881166947286, 0.07082722560726253, -0.3148392856719869, -0.11282385876548924, 0.14895233261860966, 1.947367637176213... |
1,803.03905 | Graph Laplacian Spectrum and Primary Frequency Regulation | We present a framework based on spectral graph theory that captures the
interplay among network topology, system inertia, and generator and load
damping in determining the overall grid behavior and performance. Specifically,
we show that the impact of network topology on a power system can be quantified
through the n... | cs.SY | we present a framework based on spectral graph theory that captures the interplay among network topology system inertia and generator and load damping in determining the overall grid behavior and performance specifically we show that the impact of network topology on a power system can be quantified through the network... | [['we', 'present', 'a', 'framework', 'based', 'on', 'spectral', 'graph', 'theory', 'that', 'captures', 'the', 'interplay', 'among', 'network', 'topology', 'system', 'inertia', 'and', 'generator', 'and', 'load', 'damping', 'in', 'determining', 'the', 'overall', 'grid', 'behavior', 'and', 'performance', 'specifically', '... | [-0.17408412501440165, 0.06376329364585134, -0.05474900315642695, 0.045460409730201885, -0.08006838383285371, -0.16715034882178192, 0.08046746719688516, 0.3875051484633745, -0.261162557660348, -0.3156032051734986, 0.121000506289089, -0.23412173994107766, -0.22869576388356191, 0.22066175739548105, -0.13403064645800358, ... |
1,803.03906 | Adaptive Kernel Estimation of the Spectral Density with Boundary Kernel
Analysis | A hybrid estimator of the log-spectral density of a stationary time series is
proposed. First, a multiple taper estimate is performed, followed by kernel
smoothing the log-multitaper estimate. This procedure reduces the expected mean
square error by $({\pi^2 \over 4})^{.8}$ over simply smoothing the log tapered
perio... | stat.ME cs.CV eess.AS eess.SP math.ST stat.TH | a hybrid estimator of the logspectral density of a stationary time series is proposed first a multiple taper estimate is performed followed by kernel smoothing the logmultitaper estimate this procedure reduces the expected mean square error by pi2 over 48 over simply smoothing the log tapered periodogram the optimal nu... | [['a', 'hybrid', 'estimator', 'of', 'the', 'logspectral', 'density', 'of', 'a', 'stationary', 'time', 'series', 'is', 'proposed', 'first', 'a', 'multiple', 'taper', 'estimate', 'is', 'performed', 'followed', 'by', 'kernel', 'smoothing', 'the', 'logmultitaper', 'estimate', 'this', 'procedure', 'reduces', 'the', 'expecte... | [-0.11069991787601459, 0.026913229657925274, -0.14134703490785078, 0.07066013370709506, -0.05622355350734372, -0.17482763545367083, 0.05520626771766202, 0.4291771052797374, -0.26416397463579316, -0.26612978162072404, 0.16908248079524033, -0.23974393692945964, -0.10497768964207928, 0.22597688492877702, -0.08578234635857... |
1,803.03907 | Pickup and Delivery Problem with Transfers | In this article we will be talking about Pickup and Delivery Problems with
Transfers (PDP-T), the main idea is to show first the Pickup and Delivery
Problem (PDP), which is the problem from which the PDP-T derives from, later
show a description of the problem and the mathematical formulation to get a
clear view of wh... | math.OC | in this article we will be talking about pickup and delivery problems with transfers pdpt the main idea is to show first the pickup and delivery problem pdp which is the problem from which the pdpt derives from later show a description of the problem and the mathematical formulation to get a clear view of what we are g... | [['in', 'this', 'article', 'we', 'will', 'be', 'talking', 'about', 'pickup', 'and', 'delivery', 'problems', 'with', 'transfers', 'pdpt', 'the', 'main', 'idea', 'is', 'to', 'show', 'first', 'the', 'pickup', 'and', 'delivery', 'problem', 'pdp', 'which', 'is', 'the', 'problem', 'from', 'which', 'the', 'pdpt', 'derives', '... | [-0.059360778311619886, 0.043774234886105, -0.10871649796860544, 0.029708247455592092, -0.09686786356394657, -0.10408090408639731, 0.035617700770082, 0.32365755500221577, -0.33402984211421133, -0.3610322945499541, 0.08150578040875041, -0.2598423582715662, -0.17672354279941804, 0.16704741189558361, -0.11723407802197176,... |
1,803.03908 | Fast Adaptive Identification of Stable Innovation Filters | The adaptive identification of the impulse response of an innovation filter
is considered. The impulse response is a finite sum of known basis functions
with unknown coefficients. These unknown coefficients are estimated using a
pseudolinear regression. This estimate is implemented using a square root
algorithm based... | stat.ME cs.SY eess.SP eess.SY math.ST stat.TH | the adaptive identification of the impulse response of an innovation filter is considered the impulse response is a finite sum of known basis functions with unknown coefficients these unknown coefficients are estimated using a pseudolinear regression this estimate is implemented using a square root algorithm based on a... | [['the', 'adaptive', 'identification', 'of', 'the', 'impulse', 'response', 'of', 'an', 'innovation', 'filter', 'is', 'considered', 'the', 'impulse', 'response', 'is', 'a', 'finite', 'sum', 'of', 'known', 'basis', 'functions', 'with', 'unknown', 'coefficients', 'these', 'unknown', 'coefficients', 'are', 'estimated', 'us... | [-0.10583699723197655, 0.07386422694534386, -0.08665304182266648, 0.024405038091406987, -0.10828067075238902, -0.182657568001146, -0.025492394554682753, 0.4416591442105445, -0.2985242351212285, -0.2176624233199453, 0.2097182409541512, -0.2203607355159792, -0.18481643903082426, 0.1180211713548157, -0.06692646743348715, ... |
1,803.03909 | Vortex coronagraphs for the Habitable Exoplanet Imaging Mission (HabEx)
concept: theoretical performance and telescope requirements | The Habitable Exoplanet Imaging Mission (HabEx) concept requires an optical
coronagraph that provides deep starlight suppression over a broad spectral
bandwidth, high throughput for point sources at small angular separation, and
insensitivity to temporally-varying, low-order aberrations. Vortex coronagraphs
are a pro... | astro-ph.IM | the habitable exoplanet imaging mission habex concept requires an optical coronagraph that provides deep starlight suppression over a broad spectral bandwidth high throughput for point sources at small angular separation and insensitivity to temporallyvarying loworder aberrations vortex coronagraphs are a promising sol... | [['the', 'habitable', 'exoplanet', 'imaging', 'mission', 'habex', 'concept', 'requires', 'an', 'optical', 'coronagraph', 'that', 'provides', 'deep', 'starlight', 'suppression', 'over', 'a', 'broad', 'spectral', 'bandwidth', 'high', 'throughput', 'for', 'point', 'sources', 'at', 'small', 'angular', 'separation', 'and', ... | [-0.13886097692330146, 0.16556190611050364, -0.04189257348244566, 0.05356910605221942, -0.11242235433088527, -0.13465501924400172, 0.009018210523451368, 0.4504181889196237, -0.19696776633195223, -0.37006550057835524, 0.13599983687135614, -0.2684339357739581, -0.0873331276212065, 0.2417706068826928, -0.17199113628206153... |
1,803.0391 | A pathway-based kernel boosting method for sample classification using
genomic data | The analysis of cancer genomic data has long suffered "the curse of
dimensionality". Sample sizes for most cancer genomic studies are a few
hundreds at most while there are tens of thousands of genomic features studied.
Various methods have been proposed to leverage prior biological knowledge, such
as pathways, to mo... | stat.ML cs.LG q-bio.QM | the analysis of cancer genomic data has long suffered the curse of dimensionality sample sizes for most cancer genomic studies are a few hundreds at most while there are tens of thousands of genomic features studied various methods have been proposed to leverage prior biological knowledge such as pathways to more effec... | [['the', 'analysis', 'of', 'cancer', 'genomic', 'data', 'has', 'long', 'suffered', 'the', 'curse', 'of', 'dimensionality', 'sample', 'sizes', 'for', 'most', 'cancer', 'genomic', 'studies', 'are', 'a', 'few', 'hundreds', 'at', 'most', 'while', 'there', 'are', 'tens', 'of', 'thousands', 'of', 'genomic', 'features', 'stud... | [-0.00900172614586024, 0.013435741861203929, -0.010814738131427606, 0.10751919442485641, -0.09509141268929289, -0.17040834897419527, 0.0762364004843957, 0.4178708300238386, -0.2390877789085997, -0.27466696231082705, 0.08204301896096565, -0.31141528332539437, -0.22228807693630057, 0.22858266588480633, -0.076716963090889... |
1,803.03911 | Optimal Estimation of Dynamically Evolving Diffusivities | The augmented, iterated Kalman smoother is applied to system identification
for inverse problems in evolutionary differential equations. In the augmented
smoother, the unknown, time-dependent coefficients are included in the state
vector, and have a stochastic component. At each step in the iteration, the
estimate of... | stat.ME eess.SP math.OC physics.data-an | the augmented iterated kalman smoother is applied to system identification for inverse problems in evolutionary differential equations in the augmented smoother the unknown timedependent coefficients are included in the state vector and have a stochastic component at each step in the iteration the estimate of the time ... | [['the', 'augmented', 'iterated', 'kalman', 'smoother', 'is', 'applied', 'to', 'system', 'identification', 'for', 'inverse', 'problems', 'in', 'evolutionary', 'differential', 'equations', 'in', 'the', 'augmented', 'smoother', 'the', 'unknown', 'timedependent', 'coefficients', 'are', 'included', 'in', 'the', 'state', 'v... | [-0.08236887260978476, 0.11578254635822488, -0.09636236082898515, 0.03911380760052524, -0.0376781335184246, -0.11775259532589005, -0.06188320492007089, 0.37053494578164614, -0.3249004992834303, -0.25995276177699644, 0.1457965865474864, -0.24544850410370345, -0.10044197910373738, 0.1672650691582246, -0.02361252718720208... |
1,803.03912 | On the linear complexity for multidimensional sequences | In this paper, we define the linear complexity for multidimensional sequences
over finite fields, generalizing the one-dimensional case. We give some lower
and upper bounds, valid with large probability, for the linear complexity and
$k$-error linear complexity of multidimensional periodic sequences.
| math.NT cs.IT math.IT | in this paper we define the linear complexity for multidimensional sequences over finite fields generalizing the onedimensional case we give some lower and upper bounds valid with large probability for the linear complexity and kerror linear complexity of multidimensional periodic sequences | [['in', 'this', 'paper', 'we', 'define', 'the', 'linear', 'complexity', 'for', 'multidimensional', 'sequences', 'over', 'finite', 'fields', 'generalizing', 'the', 'onedimensional', 'case', 'we', 'give', 'some', 'lower', 'and', 'upper', 'bounds', 'valid', 'with', 'large', 'probability', 'for', 'the', 'linear', 'complexi... | [-0.14260814436597796, 0.13210625251437105, -0.004157265137154155, 0.11202021177983047, -0.058884338453048614, -0.11650388199472572, 0.08335115990839989, 0.2826324527083737, -0.3005242782940225, -0.22212573170389344, 0.12680559703887145, -0.19273673334136243, -0.16270771509081852, 0.2889177149343418, -0.113351617917055... |
1,803.03913 | Forbidden subgraphs for constant domination number | In this paper, we characterize the sets $\mathcal{H}$ of connected graphs
such that there exists a constant $c=c(\mathcal{H})$ satisfying $\gamma (G)\leq
c$ for every connected $\mathcal{H}$-free graph $G$, where $\gamma (G)$ is the
domination number of $G$.
| math.CO | in this paper we characterize the sets mathcalh of connected graphs such that there exists a constant ccmathcalh satisfying gamma gleq c for every connected mathcalhfree graph g where gamma g is the domination number of g | [['in', 'this', 'paper', 'we', 'characterize', 'the', 'sets', 'mathcalh', 'of', 'connected', 'graphs', 'such', 'that', 'there', 'exists', 'a', 'constant', 'ccmathcalh', 'satisfying', 'gamma', 'gleq', 'c', 'for', 'every', 'connected', 'mathcalhfree', 'graph', 'g', 'where', 'gamma', 'g', 'is', 'the', 'domination', 'numbe... | [-0.2879147487692535, 0.2019900553083668, -0.01180013372666306, -0.04299667431041598, -0.10909819643064919, -0.1619351275342827, 0.046473766344004415, 0.4016143549233675, -0.30010238501967657, -0.24012946719045025, 0.026123276235820312, -0.31911787463145125, -0.14369126342030036, 0.16703439778130916, -0.096313938356211... |
1,803.03914 | Optimized Dynamic Cache Instantiation and Accurate LRU Approximations
under Time-varying Request Volume | Content-delivery applications can achieve scalability and reduce wide-area
network traffic using geographically distributed caches. However, each deployed
cache has an associated cost, and under time-varying request rates (e.g., a
daily cycle) there may be long periods when the request rate from the local
region is n... | cs.NI cs.PF | contentdelivery applications can achieve scalability and reduce widearea network traffic using geographically distributed caches however each deployed cache has an associated cost and under timevarying request rates eg a daily cycle there may be long periods when the request rate from the local region is not high enoug... | [['contentdelivery', 'applications', 'can', 'achieve', 'scalability', 'and', 'reduce', 'widearea', 'network', 'traffic', 'using', 'geographically', 'distributed', 'caches', 'however', 'each', 'deployed', 'cache', 'has', 'an', 'associated', 'cost', 'and', 'under', 'timevarying', 'request', 'rates', 'eg', 'a', 'daily', '... | [-0.1697682879843787, 0.04204567966156233, -0.04959104156207141, 0.07131068158909032, -0.10093819186903955, -0.21995089985715338, 0.18694368020301133, 0.4311512412541375, -0.2783715287900568, -0.29781607930591253, 0.1239142951826394, -0.22317066033235966, -0.13568481222764417, 0.15337242978525215, -0.17467087095295084,... |
1,803.03915 | Fair Efficiency Comparisons of Decoy-state Quantum Key Distribution
Protocols | Secure key rate of decoy-state quantum key distribution protocols has been
improved with biased basis choice, however, the security standards and
parameters of current protocols are different. As a result, we cannot give an
accurate key rate comparison between different kinds of protocols. Taking the
schemes based on... | quant-ph | secure key rate of decoystate quantum key distribution protocols has been improved with biased basis choice however the security standards and parameters of current protocols are different as a result we cannot give an accurate key rate comparison between different kinds of protocols taking the schemes based on differe... | [['secure', 'key', 'rate', 'of', 'decoystate', 'quantum', 'key', 'distribution', 'protocols', 'has', 'been', 'improved', 'with', 'biased', 'basis', 'choice', 'however', 'the', 'security', 'standards', 'and', 'parameters', 'of', 'current', 'protocols', 'are', 'different', 'as', 'a', 'result', 'we', 'can', 'not', 'give',... | [-0.1842481759376824, 0.0171901687660147, -0.08717661081969284, 0.05965657852741365, 0.031264948522728785, -0.25138913075850927, 0.13487630931963093, 0.3797798852819174, -0.2355932404528263, -0.2795810317478809, 0.08586229294004287, -0.17623876767034458, -0.0914290342432669, 0.3067698608043835, -0.12449262059544246, 0.... |
1,803.03916 | Deep reinforcement learning for time series: playing idealized trading
games | Deep Q-learning is investigated as an end-to-end solution to estimate the
optimal strategies for acting on time series input. Experiments are conducted
on two idealized trading games. 1) Univariate: the only input is a wave-like
price time series, and 2) Bivariate: the input includes a random stepwise price
time seri... | cs.LG stat.ML | deep qlearning is investigated as an endtoend solution to estimate the optimal strategies for acting on time series input experiments are conducted on two idealized trading games 1 univariate the only input is a wavelike price time series and 2 bivariate the input includes a random stepwise price time series and a nois... | [['deep', 'qlearning', 'is', 'investigated', 'as', 'an', 'endtoend', 'solution', 'to', 'estimate', 'the', 'optimal', 'strategies', 'for', 'acting', 'on', 'time', 'series', 'input', 'experiments', 'are', 'conducted', 'on', 'two', 'idealized', 'trading', 'games', '1', 'univariate', 'the', 'only', 'input', 'is', 'a', 'wav... | [-0.08207996481110992, 0.01641690056248367, -0.08271474772522047, 0.13700053489955194, -0.08994068054495098, -0.26767018166919276, 0.07736863499293614, 0.4943509124576637, -0.3261091621107843, -0.2654770076281251, 0.08375732646298224, -0.2653168940865626, -0.21213270739647433, 0.1107115788378893, -0.10446319889838565, ... |
1,803.03917 | Generating Bilingual Pragmatic Color References | Contextual influences on language often exhibit substantial cross-lingual
regularities; for example, we are more verbose in situations that require finer
distinctions. However, these regularities are sometimes obscured by semantic
and syntactic differences. Using a newly-collected dataset of color reference
games in ... | cs.CL | contextual influences on language often exhibit substantial crosslingual regularities for example we are more verbose in situations that require finer distinctions however these regularities are sometimes obscured by semantic and syntactic differences using a newlycollected dataset of color reference games in mandarin ... | [['contextual', 'influences', 'on', 'language', 'often', 'exhibit', 'substantial', 'crosslingual', 'regularities', 'for', 'example', 'we', 'are', 'more', 'verbose', 'in', 'situations', 'that', 'require', 'finer', 'distinctions', 'however', 'these', 'regularities', 'are', 'sometimes', 'obscured', 'by', 'semantic', 'and'... | [-0.026076609153115455, 0.050866265509588025, -0.07898142462214217, 0.16638138507364486, -0.1862193006866922, -0.15537826514516312, 0.07411440155761412, 0.49804165672797424, -0.267406617709546, -0.3398611163899589, 0.0180426748679915, -0.30774808028199446, -0.16734526908168426, 0.20548110013642612, -0.14509114221371605... |
1,803.03918 | Dynamical formation and interaction-induced stabilization of dark
condensates of dipolar excitons | The formation of a dense Bose-Einstein condensate in dark spin states of
two-dimensional dipolar excitons is shown to be driven by a dynamical
transition to the long-lived dark states. The condensate is stabilized by
strong dipole-dipole interactions up to densities high enough for a dark
quantum liquid to form. The ... | cond-mat.quant-gas | the formation of a dense boseeinstein condensate in dark spin states of twodimensional dipolar excitons is shown to be driven by a dynamical transition to the longlived dark states the condensate is stabilized by strong dipoledipole interactions up to densities high enough for a dark quantum liquid to form the persiste... | [['the', 'formation', 'of', 'a', 'dense', 'boseeinstein', 'condensate', 'in', 'dark', 'spin', 'states', 'of', 'twodimensional', 'dipolar', 'excitons', 'is', 'shown', 'to', 'be', 'driven', 'by', 'a', 'dynamical', 'transition', 'to', 'the', 'longlived', 'dark', 'states', 'the', 'condensate', 'is', 'stabilized', 'by', 'st... | [-0.18806077808088137, 0.28950021643422347, -0.10421677231551683, 0.0766182189201524, -0.003285296718730072, -0.1279478181798456, -0.02741104836855908, 0.3088383696215079, -0.22377673281867683, -0.29184230283496126, -0.03745783760729534, -0.2819479383627134, -0.0615766556228849, 0.12460341736513594, 0.07613226040307663... |
1,803.03919 | Detecting Nonlinear Causality in Multivariate Time Series with Sparse
Additive Models | We propose a nonparametric method for detecting nonlinear causal relationship
within a set of multidimensional discrete time series, by using sparse additive
models (SpAMs). We show that, when the input to the SpAM is a $\beta$-mixing
time series, the model can be fitted by first approximating each unknown
function w... | stat.ML cs.LG stat.ME | we propose a nonparametric method for detecting nonlinear causal relationship within a set of multidimensional discrete time series by using sparse additive models spams we show that when the input to the spam is a betamixing time series the model can be fitted by first approximating each unknown function with a linear... | [['we', 'propose', 'a', 'nonparametric', 'method', 'for', 'detecting', 'nonlinear', 'causal', 'relationship', 'within', 'a', 'set', 'of', 'multidimensional', 'discrete', 'time', 'series', 'by', 'using', 'sparse', 'additive', 'models', 'spams', 'we', 'show', 'that', 'when', 'the', 'input', 'to', 'the', 'spam', 'is', 'a'... | [-0.045960869339801605, -0.030634981123560553, -0.12468571307763984, 0.07698475029031061, -0.1033600452891757, -0.19108390021014265, 0.07233078970648019, 0.431115739138187, -0.3551616689140818, -0.2655249929109143, 0.1357819563886913, -0.221128587635745, -0.22495433783047394, 0.12657025875935776, -0.09553066913221164, ... |
1,803.0392 | On the approximation of Koopman spectra for measure preserving
transformations | For the class of continuous, measure-preserving automorphisms on compact
metric spaces, a procedure is proposed for constructing a sequence of
finite-dimensional approximations to the associated Koopman operator on a
Hilbert space. These finite-dimensional approximations are obtained from the
so-called "periodic appr... | math.DS | for the class of continuous measurepreserving automorphisms on compact metric spaces a procedure is proposed for constructing a sequence of finitedimensional approximations to the associated koopman operator on a hilbert space these finitedimensional approximations are obtained from the socalled periodic approximation ... | [['for', 'the', 'class', 'of', 'continuous', 'measurepreserving', 'automorphisms', 'on', 'compact', 'metric', 'spaces', 'a', 'procedure', 'is', 'proposed', 'for', 'constructing', 'a', 'sequence', 'of', 'finitedimensional', 'approximations', 'to', 'the', 'associated', 'koopman', 'operator', 'on', 'a', 'hilbert', 'space'... | [-0.08314568860805593, 0.08073535253410227, -0.10922381140757352, 0.07689779681386426, -0.04822591083822772, -0.09436143789323978, 0.007566602576407604, 0.39089018718805163, -0.31866112468764185, -0.20159590743482114, 0.16423764490580653, -0.2768673195980955, -0.16149269322981127, 0.2210324472654611, -0.074943406991660... |
1,803.03921 | A walk outside spheres for the fractional Laplacian: fields and first
eigenvalue | The Feynman-Kac formula for the exterior-value problem for the fractional
Laplacian leads to a walk-outside-spheres algorithm via sampling alpha-stable
Levy processes on their exit from maximally inscribed balls and sampling their
occupation distribution. Kyprianou, Osojnik, and Shardlow (2017) developed this
algorit... | math.NA | the feynmankac formula for the exteriorvalue problem for the fractional laplacian leads to a walkoutsidespheres algorithm via sampling alphastable levy processes on their exit from maximally inscribed balls and sampling their occupation distribution kyprianou osojnik and shardlow 2017 developed this algorithm providing... | [['the', 'feynmankac', 'formula', 'for', 'the', 'exteriorvalue', 'problem', 'for', 'the', 'fractional', 'laplacian', 'leads', 'to', 'a', 'walkoutsidespheres', 'algorithm', 'via', 'sampling', 'alphastable', 'levy', 'processes', 'on', 'their', 'exit', 'from', 'maximally', 'inscribed', 'balls', 'and', 'sampling', 'their',... | [-0.05394590876002345, 0.03373786426121455, -0.12302207658952959, 0.06798198269508733, -0.06471808374133761, -0.09570595362377952, 0.06669263716964223, 0.3568044951217009, -0.26246549970001853, -0.305147413198659, 0.12270614487173298, -0.2599136147568105, -0.14362322770064823, 0.22398983168507144, -0.05991907692742905,... |
1,803.03922 | Scalable Breadth-First Search on a GPU Cluster | On a GPU cluster, the ratio of high computing power to communication
bandwidth makes scaling breadth-first search (BFS) on a scale-free graph
extremely challenging. By separating high and low out-degree vertices, we
present an implementation with scalable computation and a model for scalable
communication for BFS and... | cs.DC cs.DS | on a gpu cluster the ratio of high computing power to communication bandwidth makes scaling breadthfirst search bfs on a scalefree graph extremely challenging by separating high and low outdegree vertices we present an implementation with scalable computation and a model for scalable communication for bfs and direction... | [['on', 'a', 'gpu', 'cluster', 'the', 'ratio', 'of', 'high', 'computing', 'power', 'to', 'communication', 'bandwidth', 'makes', 'scaling', 'breadthfirst', 'search', 'bfs', 'on', 'a', 'scalefree', 'graph', 'extremely', 'challenging', 'by', 'separating', 'high', 'and', 'low', 'outdegree', 'vertices', 'we', 'present', 'an... | [-0.19720077868590147, 0.05349323392697481, -0.012114775781871891, -0.0024935315840509758, -0.11956710484418862, -0.1931751464501399, 0.14092602752571723, 0.41076166348672716, -0.26079664332792163, -0.3922598968737391, 0.07965415435991868, -0.2863594715272178, -0.12331636075787403, 0.1618387759800124, -0.03606337922191... |
1,803.03923 | The cohomology of free loop spaces of rank 2 flag manifolds | A complete flag manifold is the quotient of a Lie group by its maximal torus.
The rank of a flag manifold is the dimension of the maximal torus of the Lie
group. The rank 2 complete flag manifolds are $SU(3)/T^2$, $Sp(2)/T^2$,
$Spin(4)/T^2$, $Spin(5)/T^2$ and $G_2/T^2$. In this paper we calculate the
cohomology of th... | math.AT | a complete flag manifold is the quotient of a lie group by its maximal torus the rank of a flag manifold is the dimension of the maximal torus of the lie group the rank 2 complete flag manifolds are su3t2 sp2t2 spin4t2 spin5t2 and g_2t2 in this paper we calculate the cohomology of the free loop space of rank 2 complete... | [['a', 'complete', 'flag', 'manifold', 'is', 'the', 'quotient', 'of', 'a', 'lie', 'group', 'by', 'its', 'maximal', 'torus', 'the', 'rank', 'of', 'a', 'flag', 'manifold', 'is', 'the', 'dimension', 'of', 'the', 'maximal', 'torus', 'of', 'the', 'lie', 'group', 'the', 'rank', '2', 'complete', 'flag', 'manifolds', 'are', 's... | [-0.23426483257405334, 0.03826457345700365, -0.04545477868483986, 0.04944559418146451, -0.15007729705233694, -0.08781950308357254, -0.03239766599697266, 0.318723302081985, -0.26928030427987293, -0.17019038805264539, 0.2013247128935152, -0.20454097277153346, -0.16278148352531557, 0.14849904005936646, -0.1717766491948800... |
1,803.03924 | Lie-Poisson structures over differential algebras | In this paper we use key elements of the Olver's approach to Hamiltonian
evolution equations in partial derivatives and propose an algebraic
construction appropriate for Hamiltonian evolution systems with constraints.
| math-ph math.MP | in this paper we use key elements of the olvers approach to hamiltonian evolution equations in partial derivatives and propose an algebraic construction appropriate for hamiltonian evolution systems with constraints | [['in', 'this', 'paper', 'we', 'use', 'key', 'elements', 'of', 'the', 'olvers', 'approach', 'to', 'hamiltonian', 'evolution', 'equations', 'in', 'partial', 'derivatives', 'and', 'propose', 'an', 'algebraic', 'construction', 'appropriate', 'for', 'hamiltonian', 'evolution', 'systems', 'with', 'constraints']] | [-0.16565300561487675, 0.03475016388547374, -0.08953579490383466, 0.018551009206566958, -0.10546196792274713, -0.061585656367242336, -0.0373203589542148, 0.29801882257064183, -0.306089760363102, -0.3030947070258359, 0.09135104306818297, -0.22559881396591663, -0.22549082164963086, 0.10898566173952227, -0.083923166066718... |
1,803.03925 | Fermi-Dirac Statistics Applied to Very Dense Plasmas at Medium or Low
Temperatures with Optical Parameters Calculations | Fermi Dirac free electron model is applied to very dense plasmas with medium
or low temperatures. While Boltzmann statistics can lead to very high densities
of ionized electrons, only at very high temperatures, Fermi Dirac statistics
can support the high densities of ionized electrons at medium or low
temperatures du... | physics.plasm-ph | fermi dirac free electron model is applied to very dense plasmas with medium or low temperatures while boltzmann statistics can lead to very high densities of ionized electrons only at very high temperatures fermi dirac statistics can support the high densities of ionized electrons at medium or low temperatures due to ... | [['fermi', 'dirac', 'free', 'electron', 'model', 'is', 'applied', 'to', 'very', 'dense', 'plasmas', 'with', 'medium', 'or', 'low', 'temperatures', 'while', 'boltzmann', 'statistics', 'can', 'lead', 'to', 'very', 'high', 'densities', 'of', 'ionized', 'electrons', 'only', 'at', 'very', 'high', 'temperatures', 'fermi', 'd... | [-0.07593310002253897, 0.27331499419922595, -0.0614019246003999, 0.11041755959587662, -0.026410328920750896, -0.1462441060708411, 0.010344450752120139, 0.38936035928169366, -0.19521379322957313, -0.34193160674093587, 0.053452147276083564, -0.28540198786772397, 0.046065451663085503, 0.19298548803648405, -0.0145172051056... |
1,803.03926 | Electromagnetic proximity effect in planar superconductor-ferromagnet
structures | The spread of the Cooper pairs into the ferromagnet in proximity coupled
superconductor - ferromagnet (SF) structures is shown to cause a strong inverse
electromagnetic phenomenon, namely, the long-range transfer of the magnetic
field from the ferromagnet to the superconductor. Contrary to the previously
investigated... | cond-mat.supr-con | the spread of the cooper pairs into the ferromagnet in proximity coupled superconductor ferromagnet sf structures is shown to cause a strong inverse electromagnetic phenomenon namely the longrange transfer of the magnetic field from the ferromagnet to the superconductor contrary to the previously investigated inverse p... | [['the', 'spread', 'of', 'the', 'cooper', 'pairs', 'into', 'the', 'ferromagnet', 'in', 'proximity', 'coupled', 'superconductor', 'ferromagnet', 'sf', 'structures', 'is', 'shown', 'to', 'cause', 'a', 'strong', 'inverse', 'electromagnetic', 'phenomenon', 'namely', 'the', 'longrange', 'transfer', 'of', 'the', 'magnetic', ... | [-0.17669645854039118, 0.1984078197701213, -0.03969681527776023, 0.10112355043025066, -0.07727893905403714, -0.08658350496242444, 0.006039216148977478, 0.336622095387429, -0.2904835388188561, -0.28608951786533, 0.017520792512999227, -0.2894802177262803, -0.09807578687711309, 0.20544755883825322, 0.06494699305544296, -0... |
1,803.03927 | On Hamiltonian operators in differential algebras | Before we proposed an algebraic technics for the Hamiltonian approach to the
evolution systems of partial differential equations, including systems with
constraints. Here we further develop this approach and present the defining
system of equations (suitable for the computer calculations), characterizing
the Hamilton... | math-ph math.MP | before we proposed an algebraic technics for the hamiltonian approach to the evolution systems of partial differential equations including systems with constraints here we further develop this approach and present the defining system of equations suitable for the computer calculations characterizing the hamiltonian ope... | [['before', 'we', 'proposed', 'an', 'algebraic', 'technics', 'for', 'the', 'hamiltonian', 'approach', 'to', 'the', 'evolution', 'systems', 'of', 'partial', 'differential', 'equations', 'including', 'systems', 'with', 'constraints', 'here', 'we', 'further', 'develop', 'this', 'approach', 'and', 'present', 'the', 'defini... | [-0.13961890692423498, 0.01563311878193677, -0.10644262054535959, 0.030626814752135294, -0.0519008742953052, -0.09638532912192334, 0.011867388970650998, 0.2792769509500691, -0.2899965790233442, -0.2938147820532322, 0.11482442244388429, -0.25018311930554255, -0.24716230204129325, 0.23879059427002045, -0.0207866557092139... |
1,803.03928 | Density of orbits of endomorphisms of commutative linear algebraic
groups | We prove a conjecture of Medvedev and Scanlon for endomorphisms of connected
commutative linear algebraic groups $G$ defined over an algebraically closed
field $\mathbb{k}$ of characteristic $0$. That is, if $\Phi\colon
G\longrightarrow G$ is a dominant endomorphism, we prove that one of the
following holds: either t... | math.NT math.AG | we prove a conjecture of medvedev and scanlon for endomorphisms of connected commutative linear algebraic groups g defined over an algebraically closed field mathbbk of characteristic 0 that is if phicolon glongrightarrow g is a dominant endomorphism we prove that one of the following holds either there exists a noncon... | [['we', 'prove', 'a', 'conjecture', 'of', 'medvedev', 'and', 'scanlon', 'for', 'endomorphisms', 'of', 'connected', 'commutative', 'linear', 'algebraic', 'groups', 'g', 'defined', 'over', 'an', 'algebraically', 'closed', 'field', 'mathbbk', 'of', 'characteristic', '0', 'that', 'is', 'if', 'phicolon', 'glongrightarrow', ... | [-0.3373198906035238, 0.12299566614819923, -0.09594238374533283, 0.015446270487233493, -0.061930091359426044, -0.23110730495977191, -0.029079736227710807, 0.3618868023433999, -0.3816045723050027, -0.06988572410144214, 0.017967172575850242, -0.2639128510695505, -0.13166883506975766, 0.20989345807921947, -0.1033798038087... |
1,803.03929 | Parallel Translates of Represented Matroids | Given an $\Bbb{F}$-represented matroid $(M,\rho)$ with the ground set $[m]$,
the representation $\rho$ naturally defines a hyperplane arrangement
$\mathcal{A}_\rho$. We will study its parallel translates
$\mathcal{A}_{\rho,{g}}$ of $\mathcal{A}_\rho$ for all ${ g}\in \mathbb{F}^m$.
Its intersection semi-lattices $L(\... | math.CO | given an bbbfrepresented matroid mrho with the ground set m the representation rho naturally defines a hyperplane arrangement mathcala_rho we will study its parallel translates mathcala_rhog of mathcala_rho for all gin mathbbfm its intersection semilattices lmathcala_rho g and the characteristic polynomials chimathcala... | [['given', 'an', 'bbbfrepresented', 'matroid', 'mrho', 'with', 'the', 'ground', 'set', 'm', 'the', 'representation', 'rho', 'naturally', 'defines', 'a', 'hyperplane', 'arrangement', 'mathcala_rho', 'we', 'will', 'study', 'its', 'parallel', 'translates', 'mathcala_rhog', 'of', 'mathcala_rho', 'for', 'all', 'gin', 'mathb... | [-0.2186307739574722, 0.05896938828562608, -0.06733936142328001, 0.02461204158824457, -0.0815913498044274, -0.10908575560139536, 0.02471726676882353, 0.33934081303832925, -0.3319483625507632, -0.23602109510711458, 0.10346573274135915, -0.22584954761835033, -0.1429602568346444, 0.16216370723004517, -0.07457946746631763,... |
1,803.0393 | Thorough evaluation of GHZ generation protocols using conference key
agreement | The generation of GHZ states in quantum networks is a key element for the
realization of several quantum information tasks. Given the complexity of the
implementation of such generation, it is not easy to find an unambigous proof
for an optimal protocol. Motivated by recent improvements in NV center
manipulation, we ... | quant-ph | the generation of ghz states in quantum networks is a key element for the realization of several quantum information tasks given the complexity of the implementation of such generation it is not easy to find an unambigous proof for an optimal protocol motivated by recent improvements in nv center manipulation we presen... | [['the', 'generation', 'of', 'ghz', 'states', 'in', 'quantum', 'networks', 'is', 'a', 'key', 'element', 'for', 'the', 'realization', 'of', 'several', 'quantum', 'information', 'tasks', 'given', 'the', 'complexity', 'of', 'the', 'implementation', 'of', 'such', 'generation', 'it', 'is', 'not', 'easy', 'to', 'find', 'an',... | [-0.14041072327031376, 0.05367218046201203, -0.016751695790810994, 0.023991181686546445, -0.02224595408403763, -0.1322466138560601, 0.07171709307564285, 0.40149702397347603, -0.23260932921052532, -0.31908354997910837, 0.10377896297399679, -0.23381364664614754, -0.1250460979235531, 0.27687321954268823, -0.06761618197304... |
1,803.03931 | Algebraic dynamics of skew-linear self-maps | Let $X$ be a variety defined over an algebraically closed field $k$ of
characteristic $0$, let $N\in\mathbb{N}$, let $g:X\dashrightarrow X$ be a
dominant rational self-map, and let $A:\mathbb{A}^N\to \mathbb{A}^N$ be a
linear transformation defined over $k(X)$, i.e., for a Zariski open dense
subset $U\subset X$, we h... | math.AG math.DS | let x be a variety defined over an algebraically closed field k of characteristic 0 let ninmathbbn let gxdashrightarrow x be a dominant rational selfmap and let amathbbanto mathbban be a linear transformation defined over kx ie for a zariski open dense subset usubset x we have that for xin uk the specialization ax is a... | [['let', 'x', 'be', 'a', 'variety', 'defined', 'over', 'an', 'algebraically', 'closed', 'field', 'k', 'of', 'characteristic', '0', 'let', 'ninmathbbn', 'let', 'gxdashrightarrow', 'x', 'be', 'a', 'dominant', 'rational', 'selfmap', 'and', 'let', 'amathbbanto', 'mathbban', 'be', 'a', 'linear', 'transformation', 'defined',... | [-0.27924738950292827, 0.0784968571480393, -0.09602301764551183, -0.03929148045693144, -0.058197759131205756, -0.1991563597308721, 0.021404916860005806, 0.3760777659169857, -0.3835749498135607, -0.0504779598780606, 0.06953154278437043, -0.31586930670113056, -0.13015464498353205, 0.20885632817902353, -0.1104627653430084... |
1,803.03932 | Cubic Range Error Model for Stereo Vision with Illuminators | Use of low-cost depth sensors, such as a stereo camera setup with
illuminators, is of particular interest for numerous applications ranging from
robotics and transportation to mixed and augmented reality. The ability to
quantify noise is crucial for these applications, e.g., when the sensor is used
for map generation... | cs.CV | use of lowcost depth sensors such as a stereo camera setup with illuminators is of particular interest for numerous applications ranging from robotics and transportation to mixed and augmented reality the ability to quantify noise is crucial for these applications eg when the sensor is used for map generation or to dev... | [['use', 'of', 'lowcost', 'depth', 'sensors', 'such', 'as', 'a', 'stereo', 'camera', 'setup', 'with', 'illuminators', 'is', 'of', 'particular', 'interest', 'for', 'numerous', 'applications', 'ranging', 'from', 'robotics', 'and', 'transportation', 'to', 'mixed', 'and', 'augmented', 'reality', 'the', 'ability', 'to', 'qu... | [-0.07166282996786322, 0.06203443631522987, -0.05344750974836643, 0.015138005931021326, -0.057605530770388214, -0.15825209394097328, 0.0156902462385915, 0.41137663891095144, -0.25904022119584624, -0.38074602342021535, 0.13052226334775696, -0.29370509155705804, -0.14747196899043047, 0.26712963335830864, -0.1417277396269... |
1,803.03933 | Towards a Gordon form of the Kerr spacetime | It is not currently known how to put the Kerr spacetime metric into the
so-called Gordon form, although the closely related Kerr-Schild form of the
Kerr metric is well known. A Gordon form for the Kerr geometry, if it could be
found, would be particularly useful in developing analogue models for the Kerr
spacetime, s... | gr-qc | it is not currently known how to put the kerr spacetime metric into the socalled gordon form although the closely related kerrschild form of the kerr metric is well known a gordon form for the kerr geometry if it could be found would be particularly useful in developing analogue models for the kerr spacetime since the ... | [['it', 'is', 'not', 'currently', 'known', 'how', 'to', 'put', 'the', 'kerr', 'spacetime', 'metric', 'into', 'the', 'socalled', 'gordon', 'form', 'although', 'the', 'closely', 'related', 'kerrschild', 'form', 'of', 'the', 'kerr', 'metric', 'is', 'well', 'known', 'a', 'gordon', 'form', 'for', 'the', 'kerr', 'geometry', ... | [-0.13782336309563414, 0.06214962097418534, -0.08997025421225531, 0.1019144424171389, -0.16773390164598823, -0.09919223256064831, -0.02384832416414227, 0.31108676093133975, -0.19035913611773447, -0.25363921332565775, 0.0982089320720869, -0.2646729271236179, -0.16843234413269773, 0.2149215916856136, -0.07253291983022747... |
1,803.03934 | Empirical bounds for functions with weak interactions | We provide sharp empirical estimates of expectation, variance and normal
approximation for a class of statistics whose variation in any argument does
not change too much when another argument is modified. Examples of such weak
interactions are furnished by U- and V-statistics, Lipschitz L-statistics and
various error... | stat.ML | we provide sharp empirical estimates of expectation variance and normal approximation for a class of statistics whose variation in any argument does not change too much when another argument is modified examples of such weak interactions are furnished by u and vstatistics lipschitz lstatistics and various error functio... | [['we', 'provide', 'sharp', 'empirical', 'estimates', 'of', 'expectation', 'variance', 'and', 'normal', 'approximation', 'for', 'a', 'class', 'of', 'statistics', 'whose', 'variation', 'in', 'any', 'argument', 'does', 'not', 'change', 'too', 'much', 'when', 'another', 'argument', 'is', 'modified', 'examples', 'of', 'suc... | [-0.0704757083526433, 0.08261366314427168, -0.11855400191227629, 0.19686779858656572, -0.07605227771973996, -0.18146329986241957, 0.0840197973712175, 0.39352402177259876, -0.2579768637596216, -0.2905059292464069, 0.11832334999107169, -0.27456030021939015, -0.13727257207156746, 0.21895015695028835, -0.1100740926598923, ... |
1,803.03935 | Duality and ground-state phase diagram for the quantum XYZ model with
arbitrary spin $s$ in one spatial dimension | Five duality transformations are unveiled for the quantum XYZ model with
arbitrary spin $s$ in one spatial dimension. The presence of these duality
transformations drastically reduces the entire ground-state phase diagram to
two {\it finite} regimes - the principal regimes, with all the other ten
regimes dual to them... | cond-mat.str-el cond-mat.stat-mech | five duality transformations are unveiled for the quantum xyz model with arbitrary spin s in one spatial dimension the presence of these duality transformations drastically reduces the entire groundstate phase diagram to two it finite regimes the principal regimes with all the other ten regimes dual to them combining w... | [['five', 'duality', 'transformations', 'are', 'unveiled', 'for', 'the', 'quantum', 'xyz', 'model', 'with', 'arbitrary', 'spin', 's', 'in', 'one', 'spatial', 'dimension', 'the', 'presence', 'of', 'these', 'duality', 'transformations', 'drastically', 'reduces', 'the', 'entire', 'groundstate', 'phase', 'diagram', 'to', '... | [-0.1724944560899862, 0.19467821817716244, -0.03621941877370876, 0.03691720935360839, -0.01646829284317557, -0.20321241695633005, 0.07846566534062273, 0.3286196154266971, -0.24883848682936258, -0.2640759890793629, 0.08667625182633341, -0.29034067489464516, -0.13234549387703715, 0.14533216123316883, 0.025235995185362327... |
1,803.03936 | K-theory for generalized Lamplighter groups | We compute K-theory for the reduced group C*-algebras of generalized
Lamplighter groups.
| math.KT math.OA | we compute ktheory for the reduced group calgebras of generalized lamplighter groups | [['we', 'compute', 'ktheory', 'for', 'the', 'reduced', 'group', 'calgebras', 'of', 'generalized', 'lamplighter', 'groups']] | [-0.1824678983539343, 0.12290926347486675, -0.11530895515655477, 0.16791806680460772, -0.08343378578623135, -0.11671006353572011, 0.027889525207380455, 0.42929133120924234, -0.43649434732894105, -0.14500490195738772, 0.11705363848401855, -0.23005274218060853, -0.1144752538530156, 0.2084894465903441, -0.2515107385503749... |
1,803.03937 | From Tarski to G\"odel. Or, how to derive the Second Incompleteness
Theorem from the Undefinability of Truth without Self-reference | In this paper, we provide a fairly general self-reference-free proof of the
Second Incompleteness Theorem from Tarski's Theorem of the Undefinability of
Truth.
| math.LO | in this paper we provide a fairly general selfreferencefree proof of the second incompleteness theorem from tarskis theorem of the undefinability of truth | [['in', 'this', 'paper', 'we', 'provide', 'a', 'fairly', 'general', 'selfreferencefree', 'proof', 'of', 'the', 'second', 'incompleteness', 'theorem', 'from', 'tarskis', 'theorem', 'of', 'the', 'undefinability', 'of', 'truth']] | [-0.07475552860308778, -0.05028707788071849, -0.22289867834611374, 0.14759984135691245, -0.10327362785623832, -0.0625859817108986, 0.17721604323543777, 0.18815255668860945, -0.24215140989558262, -0.29429483091966674, 0.10092830623563548, -0.18102087554606525, -0.12404952655461701, 0.20540937849066473, -0.25818957172503... |
1,803.03938 | On monogenic functions defined in different commutative algebras | A correspondence between a monogenic function in an arbitrary
finite-dimensional commutative associative algebra and a finite set of
monogenic functions in a special commutative associative algebra is
established.
| math.AC | a correspondence between a monogenic function in an arbitrary finitedimensional commutative associative algebra and a finite set of monogenic functions in a special commutative associative algebra is established | [['a', 'correspondence', 'between', 'a', 'monogenic', 'function', 'in', 'an', 'arbitrary', 'finitedimensional', 'commutative', 'associative', 'algebra', 'and', 'a', 'finite', 'set', 'of', 'monogenic', 'functions', 'in', 'a', 'special', 'commutative', 'associative', 'algebra', 'is', 'established']] | [-0.21450160679939603, 0.03622890023117569, -0.046103924446340115, 0.1296706553756459, -0.16737693228891917, -0.18031027972964303, -0.11787206220573612, 0.3610281640929835, -0.44590697437524796, -0.0586171737605972, 0.08452228557351711, -0.18428813028315613, -0.1606090608152694, 0.21869943979462342, -0.1509572964028588... |
1,803.03939 | 50 Years of Permutation, Spatial and Index Modulation: From Classic RF
to Visible Light Communications and Data Storage | In this treatise, we provide an interdisciplinary survey on spatial
modulation (SM), where multiple-input multiple-output microwave and visible
light, as well as single and multicarrier communications are considered.
Specifically, we first review the permutation modulation (PM) concept, which
was originally proposed ... | eess.SP | in this treatise we provide an interdisciplinary survey on spatial modulation sm where multipleinput multipleoutput microwave and visible light as well as single and multicarrier communications are considered specifically we first review the permutation modulation pm concept which was originally proposed by slepian in ... | [['in', 'this', 'treatise', 'we', 'provide', 'an', 'interdisciplinary', 'survey', 'on', 'spatial', 'modulation', 'sm', 'where', 'multipleinput', 'multipleoutput', 'microwave', 'and', 'visible', 'light', 'as', 'well', 'as', 'single', 'and', 'multicarrier', 'communications', 'are', 'considered', 'specifically', 'we', 'fi... | [-0.12329960663878346, 0.06077827022398222, -0.04293681311578503, -0.011688647373426954, -0.12072153963004305, -0.14894250498979655, 0.033019633406222285, 0.3639613368030323, -0.22948343106742267, -0.30042973616239155, 0.08506914180077114, -0.2645554971671335, -0.18548185285508736, 0.20865014691273093, -0.1280542818868... |
1,803.0394 | Electrical transient laws in neuronal microdomains based on
electro-diffusion | The current-voltage (I-V) conversion characterizes the physiology of cellular
microdomains and reflects cellular communication, excitability, and electrical
transduction. Yet deriving such I-V laws remains a major challenge in most
cellular microdomains due to their small sizes and the difficulty of accessing
voltage... | q-bio.NC math.AP physics.bio-ph | the currentvoltage iv conversion characterizes the physiology of cellular microdomains and reflects cellular communication excitability and electrical transduction yet deriving such iv laws remains a major challenge in most cellular microdomains due to their small sizes and the difficulty of accessing voltage with a hi... | [['the', 'currentvoltage', 'iv', 'conversion', 'characterizes', 'the', 'physiology', 'of', 'cellular', 'microdomains', 'and', 'reflects', 'cellular', 'communication', 'excitability', 'and', 'electrical', 'transduction', 'yet', 'deriving', 'such', 'iv', 'laws', 'remains', 'a', 'major', 'challenge', 'in', 'most', 'cellul... | [-0.15516774969556105, 0.15936718938725167, -0.0080296114197393, 0.040272113627380396, -0.046479268276782115, -0.19151011254871264, 0.09110342981569518, 0.3511952246404498, -0.32044110281506283, -0.26113957486047995, 0.03554530024427406, -0.22636276239676303, -0.19786521074925795, 0.23042627963188447, -0.09711576631985... |
1,803.03941 | Calibration of Local Volatility Model with Stochastic Interest Rates by
Efficient Numerical PDE Method | Long maturity options or a wide class of hybrid products are evaluated using
a local volatility type modelling for the asset price S(t) with a stochastic
interest rate r(t). The calibration of the local volatility function is usually
time-consuming because of the multi-dimensional nature of the problem. In this
paper... | q-fin.MF | long maturity options or a wide class of hybrid products are evaluated using a local volatility type modelling for the asset price st with a stochastic interest rate rt the calibration of the local volatility function is usually timeconsuming because of the multidimensional nature of the problem in this paper we develo... | [['long', 'maturity', 'options', 'or', 'a', 'wide', 'class', 'of', 'hybrid', 'products', 'are', 'evaluated', 'using', 'a', 'local', 'volatility', 'type', 'modelling', 'for', 'the', 'asset', 'price', 'st', 'with', 'a', 'stochastic', 'interest', 'rate', 'rt', 'the', 'calibration', 'of', 'the', 'local', 'volatility', 'fun... | [-0.1001627943382512, -0.014419776395088681, -0.08503351662999269, 0.06359183561364692, -0.07904379127892791, -0.1447337290425737, 0.055101615331764574, 0.3449398023172368, -0.29839945188483474, -0.2661913895701087, 0.14225944461356177, -0.2411804545771111, -0.12308580380475591, 0.22220422557018668, -0.0569329455905334... |
1,803.03942 | Self-organized system-size oscillation of a stochastic lattice-gas model | The totally asymmetric simple exclusion process (TASEP) is a paradigmatic
stochastic model for non-equilibrium physics, and has been successfully applied
to describe active transport of molecular motors along cytoskeletal filaments.
Building on this simple model, we consider a two-lane lattice-gas model that
couples ... | physics.bio-ph cond-mat.stat-mech q-bio.SC | the totally asymmetric simple exclusion process tasep is a paradigmatic stochastic model for nonequilibrium physics and has been successfully applied to describe active transport of molecular motors along cytoskeletal filaments building on this simple model we consider a twolane latticegas model that couples directed t... | [['the', 'totally', 'asymmetric', 'simple', 'exclusion', 'process', 'tasep', 'is', 'a', 'paradigmatic', 'stochastic', 'model', 'for', 'nonequilibrium', 'physics', 'and', 'has', 'been', 'successfully', 'applied', 'to', 'describe', 'active', 'transport', 'of', 'molecular', 'motors', 'along', 'cytoskeletal', 'filaments', ... | [-0.1297189266998177, 0.17020915739718925, -0.07708194935406298, 0.07508900903377656, -0.05115452870131307, -0.15269321091857152, 0.02459602851898304, 0.3677645830375133, -0.3039400538756061, -0.24508664822301915, 0.0631075931530561, -0.22343991025706234, -0.19464708230645425, 0.19267856355422877, -0.030987156487847726... |
1,803.03943 | Nonconvex weak sharp minima on Riemannian manifolds | We are to establish necessary conditions (of the primal and dual types) for
the set of weak sharp minima of a nonconvex optimization problem on a
Riemannian manifold. Here, we are to provide a generalization of some
characterizations of weak sharp minima for convex problems on Riemannian
manifold introduced by Li et ... | math.OC | we are to establish necessary conditions of the primal and dual types for the set of weak sharp minima of a nonconvex optimization problem on a riemannian manifold here we are to provide a generalization of some characterizations of weak sharp minima for convex problems on riemannian manifold introduced by li et al sia... | [['we', 'are', 'to', 'establish', 'necessary', 'conditions', 'of', 'the', 'primal', 'and', 'dual', 'types', 'for', 'the', 'set', 'of', 'weak', 'sharp', 'minima', 'of', 'a', 'nonconvex', 'optimization', 'problem', 'on', 'a', 'riemannian', 'manifold', 'here', 'we', 'are', 'to', 'provide', 'a', 'generalization', 'of', 'so... | [-0.12814611362890133, -0.016284347278856023, -0.08171544906127186, 0.11844511882591884, -0.1441999720816401, -0.1252968743741874, 0.04992320417376796, 0.38753999088262436, -0.29427545753226264, -0.25389000168748344, 0.1452985487802596, -0.2324388296347907, -0.19311286210200018, 0.17223556533577916, -0.1717439285384545... |
1,803.03944 | Extendible cardinals and the mantle | The mantle is the intersection of all ground models of $V$. We show that if
there exists an extendible cardinal then the mantle is a ground model of $V$.
| math.LO | the mantle is the intersection of all ground models of v we show that if there exists an extendible cardinal then the mantle is a ground model of v | [['the', 'mantle', 'is', 'the', 'intersection', 'of', 'all', 'ground', 'models', 'of', 'v', 'we', 'show', 'that', 'if', 'there', 'exists', 'an', 'extendible', 'cardinal', 'then', 'the', 'mantle', 'is', 'a', 'ground', 'model', 'of', 'v']] | [-0.1808951431564216, 0.17124575584101218, -0.05313503934905447, 0.01941082688401742, -0.024577755336489142, -0.11687102533298833, 0.03381734722342085, 0.37050795670727205, -0.3234870361870733, -0.1450703159167335, 0.09987440356856277, -0.3299499624248209, -0.12231366323499844, 0.14463605962147744, -0.02341178692235001... |
1,803.03945 | Exact uniform sampling over catalan structures | We present a new framework for creating elegant algorithms for exact uniform
sampling of important Catalan structures, such as triangulations of convex
polygons, Dyck words, monotonic lattice paths and mountain ranges. Along with
sampling, we obtain optimal coding, and optimal number of random bits required
for the a... | cs.DM cs.CG cs.DS | we present a new framework for creating elegant algorithms for exact uniform sampling of important catalan structures such as triangulations of convex polygons dyck words monotonic lattice paths and mountain ranges along with sampling we obtain optimal coding and optimal number of random bits required for the algorithm... | [['we', 'present', 'a', 'new', 'framework', 'for', 'creating', 'elegant', 'algorithms', 'for', 'exact', 'uniform', 'sampling', 'of', 'important', 'catalan', 'structures', 'such', 'as', 'triangulations', 'of', 'convex', 'polygons', 'dyck', 'words', 'monotonic', 'lattice', 'paths', 'and', 'mountain', 'ranges', 'along', '... | [-0.11152668099699391, 0.09927321403262573, -0.09011506465754497, 0.08031839493314447, -0.09820776029703887, -0.16435878891639435, 0.10728776590061702, 0.3435249151850774, -0.3265612049254815, -0.29706840656502675, 0.10609014711627497, -0.2312989967617181, -0.18029491356070582, 0.20175165079598553, -0.09550525360375743... |
1,803.03946 | Explaining the morphology of supernova remnant (SNR) 1987A with the
jittering jets explosion mechanism | We find that the remnant of supernova (SN) 1987A share some morphological
features with four supernova remnants (SNRs) that have signatures of shaping by
jets, and from that we strengthen the claim that jets played a crucial role in
the explosion of SN 1987A. Some of the morphological features appear also in
planetar... | astro-ph.HE astro-ph.SR | we find that the remnant of supernova sn 1987a share some morphological features with four supernova remnants snrs that have signatures of shaping by jets and from that we strengthen the claim that jets played a crucial role in the explosion of sn 1987a some of the morphological features appear also in planetary nebula... | [['we', 'find', 'that', 'the', 'remnant', 'of', 'supernova', 'sn', '1987a', 'share', 'some', 'morphological', 'features', 'with', 'four', 'supernova', 'remnants', 'snrs', 'that', 'have', 'signatures', 'of', 'shaping', 'by', 'jets', 'and', 'from', 'that', 'we', 'strengthen', 'the', 'claim', 'that', 'jets', 'played', 'a'... | [-0.08310212927711447, 0.106595264553595, -0.1146695374715619, 0.173776805723404, -0.15347433911818192, -0.06928270333332986, 0.03919578392467484, 0.41562028385517075, -0.18964671526422225, -0.2588427939338655, 0.04364722065525357, -0.2546856077251638, -0.020167569667328057, 0.16860224362803486, -0.023455918903452652, ... |
1,803.03947 | Nonsingular Block Graphs: An Open Problem | A block graph is a graph in which every block is a complete graph. Let $G$ be
a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called
nonsingular (singular) if $A(G)$ is nonsingular (singular). An interesting open
problem, proposed in 2013 by Bapat and Roy, is to characterize nonsingular
block... | cs.DM math.CO | a block graph is a graph in which every block is a complete graph let g be a block graph and let ag be its 01adjacency matrix graph g is called nonsingular singular if ag is nonsingular singular an interesting open problem proposed in 2013 by bapat and roy is to characterize nonsingular block graphs in this article we ... | [['a', 'block', 'graph', 'is', 'a', 'graph', 'in', 'which', 'every', 'block', 'is', 'a', 'complete', 'graph', 'let', 'g', 'be', 'a', 'block', 'graph', 'and', 'let', 'ag', 'be', 'its', '01adjacency', 'matrix', 'graph', 'g', 'is', 'called', 'nonsingular', 'singular', 'if', 'ag', 'is', 'nonsingular', 'singular', 'an', 'in... | [-0.17335224454619094, 0.07035055442595965, -0.088024889437062, -0.02150984257328468, -0.1522181391302811, -0.21088183783388265, -0.0577109910082072, 0.35579944868952457, -0.3118121126063273, -0.16037843266213445, 0.1974941395095248, -0.30446921955321876, -0.24277615553738785, 0.11008519116579227, -0.17581248840868052,... |
1,803.03948 | Light-Cone Reduction vs. TsT transformations : A Fluid Dynamics
Perspective | We compute constitutive relations for a charged $(2+1)$ dimensional
Schr\"odinger fluid up to first order in derivative expansion, using
holographic techniques. Starting with a locally boosted, asymptotically $AdS$,
$4+1$ dimensional charged black brane geometry, we uplift that to ten
dimensions and perform $TsT$ tra... | hep-th | we compute constitutive relations for a charged 21 dimensional schrodinger fluid up to first order in derivative expansion using holographic techniques starting with a locally boosted asymptotically ads 41 dimensional charged black brane geometry we uplift that to ten dimensions and perform tst transformations to obtai... | [['we', 'compute', 'constitutive', 'relations', 'for', 'a', 'charged', '21', 'dimensional', 'schrodinger', 'fluid', 'up', 'to', 'first', 'order', 'in', 'derivative', 'expansion', 'using', 'holographic', 'techniques', 'starting', 'with', 'a', 'locally', 'boosted', 'asymptotically', 'ads', '41', 'dimensional', 'charged',... | [-0.07839035217987438, 0.13704766986725034, -0.09471770833519384, 0.05735773687845032, -0.087604846586955, -0.17935720506798605, -0.018509990664134765, 0.2876790375336362, -0.20318886667233088, -0.25037875819052086, 0.07450975451762949, -0.31368137976989663, -0.1203658219523214, 0.12817611846880153, -0.0054530642541318... |
1,803.03949 | An Efficient Volumetric Mesh Representation for Real-time Scene
Reconstruction using Spatial Hashing | Mesh plays an indispensable role in dense real-time reconstruction essential
in robotics. Efforts have been made to maintain flexible data structures for 3D
data fusion, yet an efficient incremental framework specifically designed for
online mesh storage and manipulation is missing. We propose a novel framework
to co... | cs.RO cs.GR | mesh plays an indispensable role in dense realtime reconstruction essential in robotics efforts have been made to maintain flexible data structures for 3d data fusion yet an efficient incremental framework specifically designed for online mesh storage and manipulation is missing we propose a novel framework to compactl... | [['mesh', 'plays', 'an', 'indispensable', 'role', 'in', 'dense', 'realtime', 'reconstruction', 'essential', 'in', 'robotics', 'efforts', 'have', 'been', 'made', 'to', 'maintain', 'flexible', 'data', 'structures', 'for', '3d', 'data', 'fusion', 'yet', 'an', 'efficient', 'incremental', 'framework', 'specifically', 'desig... | [-0.12511702088083027, 0.06279851612990903, -0.038425946970832056, 0.03093709088592104, -0.12218878642495105, -0.17067261112907486, 0.06363535730717637, 0.47335103708955883, -0.3036902442092089, -0.3608360466875618, 0.11550887113875917, -0.22046318445220697, -0.08637815445205933, 0.094972319652246, -0.1456286210142555,... |
1,803.0395 | Paths between colourings of sparse graphs | The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph~$G$ has
as vertex set the set of all possible $k$-colourings of $G$ and two colourings
are adjacent if they differ on exactly one vertex. We give a short proof of the
following theorem of Bousquet and Perarnau (\emph{European Journal of
Combinatorics... | math.CO cs.DM | the reconfiguration graph r_kg of the kcolourings of a graphg has as vertex set the set of all possible kcolourings of g and two colourings are adjacent if they differ on exactly one vertex we give a short proof of the following theorem of bousquet and perarnau empheuropean journal of combinatorics 2016 let d and k be ... | [['the', 'reconfiguration', 'graph', 'r_kg', 'of', 'the', 'kcolourings', 'of', 'a', 'graphg', 'has', 'as', 'vertex', 'set', 'the', 'set', 'of', 'all', 'possible', 'kcolourings', 'of', 'g', 'and', 'two', 'colourings', 'are', 'adjacent', 'if', 'they', 'differ', 'on', 'exactly', 'one', 'vertex', 'we', 'give', 'a', 'short'... | [-0.21789226726142932, 0.13359071105597137, -0.06273922527451878, -0.03838830361871616, -0.07482357498703768, -0.22622577696228804, 0.07601125560214986, 0.3600286828758924, -0.28535667361043715, -0.3043899897445479, 0.015154562622268239, -0.3111046206368052, -0.1186467452885826, 0.12257203202208747, -0.0543610851442360... |
1,803.03951 | The Secure Machine: Efficient Secure Execution On Untrusted Platforms | In this work we present the Secure Machine, SeM for short, a CPU architecture
extension for secure computing. SeM uses a small amount of in-chip additional
hardware that monitors key communication channels inside the CPU chip, and only
acts when required. SeM provides confidentiality and integrity for a secure
progra... | cs.CR cs.AR cs.DC cs.OS | in this work we present the secure machine sem for short a cpu architecture extension for secure computing sem uses a small amount of inchip additional hardware that monitors key communication channels inside the cpu chip and only acts when required sem provides confidentiality and integrity for a secure program withou... | [['in', 'this', 'work', 'we', 'present', 'the', 'secure', 'machine', 'sem', 'for', 'short', 'a', 'cpu', 'architecture', 'extension', 'for', 'secure', 'computing', 'sem', 'uses', 'a', 'small', 'amount', 'of', 'inchip', 'additional', 'hardware', 'that', 'monitors', 'key', 'communication', 'channels', 'inside', 'the', 'cp... | [-0.21901769057491466, -0.005331838466083675, -0.04714560996045988, 0.033679749366830734, -0.09985598476487212, -0.25820479646448374, 0.11080997815160491, 0.41894457290661247, -0.28875168015442526, -0.36688341033946287, 0.1410583864635555, -0.24510777402525386, -0.06271456959845689, 0.24491024397138972, -0.121144556045... |
1,803.03952 | A hybrid of two theorems of Piatetski-Shapiro | Let $c > 1$ and $0 < \gamma < 1$ be real, with $c \notin \mathbb N$. We study
the solubility of the Diophantine inequality \[ \left| p_1^c + p_2^c + \dots +
p_s^c - N \right| < \varepsilon \] in Piatetski-Shapiro primes $p_1, p_2,
\dots, p_s$ of index $\gamma$---that is, primes of the form $p = \lfloor
m^{1/\gamma} \... | math.NT | let c 1 and 0 gamma 1 be real with c notin mathbb n we study the solubility of the diophantine inequality left p_1c p_2c dots p_sc n right varepsilon in piatetskishapiro primes p_1 p_2 dots p_s of index gammathat is primes of the form p lfloor m1gamma rfloor for some m in mathbb n | [['let', 'c', '1', 'and', '0', 'gamma', '1', 'be', 'real', 'with', 'c', 'notin', 'mathbb', 'n', 'we', 'study', 'the', 'solubility', 'of', 'the', 'diophantine', 'inequality', 'left', 'p_1c', 'p_2c', 'dots', 'p_sc', 'n', 'right', 'varepsilon', 'in', 'piatetskishapiro', 'primes', 'p_1', 'p_2', 'dots', 'p_s', 'of', 'index'... | [-0.2922139847475403, 0.17797148261078685, 0.0011570096929680626, -0.0399681608662677, 0.058595215462429344, -0.31734515245090117, -0.026110500677154876, 0.31099106954797257, -0.3176907367898889, -0.19385890792703853, -0.006301473294613215, -0.43910732696641164, -0.02050355303030953, 0.10963404592003603, -0.06813905598... |
1,803.03953 | Switched Wave Packets with Spectrally Truncated Chirped Pulses | A new technique for obtaining switched wave packets using spectrally
truncated chirped laser pulses is demonstrated experimentally and numerically
by one-dimensional alignment of both linear and asymmetric top molecules. Using
a simple long-pass transmission filter, a pulse with a slow turn on and a rapid
turn off is... | physics.chem-ph | a new technique for obtaining switched wave packets using spectrally truncated chirped laser pulses is demonstrated experimentally and numerically by onedimensional alignment of both linear and asymmetric top molecules using a simple longpass transmission filter a pulse with a slow turn on and a rapid turn off is produ... | [['a', 'new', 'technique', 'for', 'obtaining', 'switched', 'wave', 'packets', 'using', 'spectrally', 'truncated', 'chirped', 'laser', 'pulses', 'is', 'demonstrated', 'experimentally', 'and', 'numerically', 'by', 'onedimensional', 'alignment', 'of', 'both', 'linear', 'and', 'asymmetric', 'top', 'molecules', 'using', 'a'... | [-0.13847401009819982, 0.1447105047498612, -0.09441418517305847, 0.03827619103005066, -0.017442347955018762, -0.1863352346023725, 0.045453588238864716, 0.4473651649370309, -0.23066303533531965, -0.26317081968450257, 0.07851047495721779, -0.2306467250804886, -0.09090398522769852, 0.22079925075353635, 0.01846726591728868... |
1,803.03954 | Fractional L-intersecting families | Let $L = \{\frac{a_1}{b_1}, \ldots , \frac{a_s}{b_s}\}$, where for every $i
\in [s]$, $\frac{a_i}{b_i} \in [0,1)$ is an irreducible fraction. Let
$\mathcal{F} = \{A_1, \ldots , A_m\}$ be a family of subsets of $[n]$. We say
$\mathcal{F}$ is a \emph{fractional $L$-intersecting family} if for every
distinct $i,j \in [m... | math.CO cs.DM | let l fraca_1b_1 ldots fraca_sb_s where for every i in s fraca_ib_i in 01 is an irreducible fraction let mathcalf a_1 ldots a_m be a family of subsets of n we say mathcalf is a emphfractional lintersecting family if for every distinct ij in m there exists an fracab in l such that a_i cap a_j in fracaba_i fracab a_j in ... | [['let', 'l', 'fraca_1b_1', 'ldots', 'fraca_sb_s', 'where', 'for', 'every', 'i', 'in', 's', 'fraca_ib_i', 'in', '01', 'is', 'an', 'irreducible', 'fraction', 'let', 'mathcalf', 'a_1', 'ldots', 'a_m', 'be', 'a', 'family', 'of', 'subsets', 'of', 'n', 'we', 'say', 'mathcalf', 'is', 'a', 'emphfractional', 'lintersecting', '... | [-0.2699498034797717, 0.20136636402837568, 0.0039845761586574545, -0.0880398045655043, 0.006348185423437668, -0.18296476136353138, -0.05182296832166342, 0.3394147084782953, -0.33431566306862276, -0.126863336610267, 0.010326093727506805, -0.36783679731298186, -0.08744152724756386, 0.11430508385925298, -0.131880056632655... |
1,803.03955 | On singularity-resolution in mimetic gravity | Recently, it was shown that modified mimetic gravity, with a $f(\square\phi)$
term, results in a singularity-free model of gravity, for both cosmological and
black hole spacetimes [1, 2]. In this work, we analyze this model further and
show that, since the function $f$ was tuned to vanish rapidly for small values
of ... | gr-qc hep-th | recently it was shown that modified mimetic gravity with a fsquarephi term results in a singularityfree model of gravity for both cosmological and black hole spacetimes 1 2 in this work we analyze this model further and show that since the function f was tuned to vanish rapidly for small values of the argument the nons... | [['recently', 'it', 'was', 'shown', 'that', 'modified', 'mimetic', 'gravity', 'with', 'a', 'fsquarephi', 'term', 'results', 'in', 'a', 'singularityfree', 'model', 'of', 'gravity', 'for', 'both', 'cosmological', 'and', 'black', 'hole', 'spacetimes', '1', '2', 'in', 'this', 'work', 'we', 'analyze', 'this', 'model', 'furt... | [-0.1341854231526837, 0.0910430158770015, -0.1259749719201652, 0.11083389349216811, -0.08115700240311928, -0.20740072475204807, 0.031645780854295334, 0.30677091590193817, -0.222332783451515, -0.29155591089105193, 0.06925464133721192, -0.2203383415850789, -0.2159642441533939, 0.20128672139794934, -0.06535409977876169, 0... |
1,803.03956 | On higher order Codazzi tensors on complete Riemannian manifolds | We prove several Liouville-type non-existence theorems for higher order
Codazzi tensors and classical Codazzi tensors on complete and compact
Riemannian manifolds, in particular. These results will be obtained by using
theorems of the connections between the geometry of a complete smooth manifold
and the global behav... | math.DG | we prove several liouvilletype nonexistence theorems for higher order codazzi tensors and classical codazzi tensors on complete and compact riemannian manifolds in particular these results will be obtained by using theorems of the connections between the geometry of a complete smooth manifold and the global behavior of... | [['we', 'prove', 'several', 'liouvilletype', 'nonexistence', 'theorems', 'for', 'higher', 'order', 'codazzi', 'tensors', 'and', 'classical', 'codazzi', 'tensors', 'on', 'complete', 'and', 'compact', 'riemannian', 'manifolds', 'in', 'particular', 'these', 'results', 'will', 'be', 'obtained', 'by', 'using', 'theorems', '... | [-0.17912930437958194, 0.03509819307319314, -0.09542533478618247, 0.09017003128797865, -0.1482074058714133, -0.11658786134613515, -0.08908556273333657, 0.3409549445908481, -0.2367502254732315, -0.18817309800476667, 0.16648122244876204, -0.2502077761675837, -0.21064046415889148, 0.17495219003481483, -0.0878691052457372,... |
1,803.03957 | Soft tilt and rotational modes in the hybrid improper ferroelectric
Ca$_{3}$Mn$_{2}$O$_{7}$ | Raman spectroscopy is employed to probe directly the soft rotation and
tilting modes, which are two primary order parameters predicted in the hybrid
improper ferroelectric material Ca$_3$Mn$_2$O$_7$. We observe a giant softening
of the 107-cm$^{-1}$ octahedron tilting mode by 26~cm$^{-1}$, on heating
through the stru... | cond-mat.str-el | raman spectroscopy is employed to probe directly the soft rotation and tilting modes which are two primary order parameters predicted in the hybrid improper ferroelectric material ca_3mn_2o_7 we observe a giant softening of the 107cm1 octahedron tilting mode by 26cm1 on heating through the structural transition from a ... | [['raman', 'spectroscopy', 'is', 'employed', 'to', 'probe', 'directly', 'the', 'soft', 'rotation', 'and', 'tilting', 'modes', 'which', 'are', 'two', 'primary', 'order', 'parameters', 'predicted', 'in', 'the', 'hybrid', 'improper', 'ferroelectric', 'material', 'ca_3mn_2o_7', 'we', 'observe', 'a', 'giant', 'softening', '... | [-0.1841717200699897, 0.2685768675899743, -0.07382091059786293, -0.03403476449280804, -0.1263019130173741, -0.07979293400009649, 0.10654348006216496, 0.4186098042183218, -0.2985837733645025, -0.2549539769513417, 0.05512485766898742, -0.27389687141485974, -0.1592533619728236, 0.12151088906386126, 0.020697063032900337, -... |
1,803.03958 | Reliable and Real-Time End-to-End Delivery Protocol in Wireless Sensor
Networks | Many routing protocols have been proposed to handle reliability and real-time
routing energy efficiency for wireless sensor networks. In this paper we
propose a new routing protocol with QoS based capabilities for WSNs. We used
priority queues for improve real-time and non-real-time packets forwarding
according to de... | cs.NI | many routing protocols have been proposed to handle reliability and realtime routing energy efficiency for wireless sensor networks in this paper we propose a new routing protocol with qos based capabilities for wsns we used priority queues for improve realtime and nonrealtime packets forwarding according to deadline o... | [['many', 'routing', 'protocols', 'have', 'been', 'proposed', 'to', 'handle', 'reliability', 'and', 'realtime', 'routing', 'energy', 'efficiency', 'for', 'wireless', 'sensor', 'networks', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'routing', 'protocol', 'with', 'qos', 'based', 'capabilities', 'for', 'wsns', 'w... | [-0.25363427806433625, -0.0014496968018706904, -0.026541777360215176, 0.012716441202295444, -0.08560329077507907, -0.239948857045634, 0.2060283931905434, 0.4637920802319044, -0.24135439361377461, -0.34073579643012547, 0.053013544993444794, -0.2429432499457181, -0.09787989553154969, 0.1494027956850766, -0.18601485040432... |
1,803.03959 | Variations of the Hydrogen Bonding and of the Hydrogen Bonded Network in
Ethanol-Water Mixtures on Cooling | Extensive molecular dynamics computer simulations have been conducted for
ethanol-water liquid mixtures in the water-rich side of the composition range,
with 10, 20 and 30 mol % of the alcohol, at temperatures between room
temperature and the experimental freezing point of the given mixture. All-atom
type (OPLS) inte... | physics.chem-ph cond-mat.soft | extensive molecular dynamics computer simulations have been conducted for ethanolwater liquid mixtures in the waterrich side of the composition range with 10 20 and 30 mol of the alcohol at temperatures between room temperature and the experimental freezing point of the given mixture allatom type opls interatomic poten... | [['extensive', 'molecular', 'dynamics', 'computer', 'simulations', 'have', 'been', 'conducted', 'for', 'ethanolwater', 'liquid', 'mixtures', 'in', 'the', 'waterrich', 'side', 'of', 'the', 'composition', 'range', 'with', '10', '20', 'and', '30', 'mol', 'of', 'the', 'alcohol', 'at', 'temperatures', 'between', 'room', 'te... | [-0.05721977820755469, 0.15757284271572797, -0.028311618505305246, -0.004980747882781819, 0.04688578708194641, -0.14934282237084684, 0.05084450813520014, 0.4121611500911841, -0.2155178660439705, -0.32482078737713654, 0.048946850787181015, -0.32150627737424675, -0.09095815065043483, 0.12716770080434836, 0.05743149653877... |
1,803.0396 | EarthFinder: A Precise Radial Velocity Probe Mission Concept For the
Detection of Earth-Mass Planets Orbiting Sun-like Stars | EarthFinder is a Probe Mission concept selected for study by NASA for input
to the 2020 astronomy decadal survey. This study is currently active and a
final white paper report is due to NASA at the end of calendar 2018. We are
tasked with evaluating the scientific rationale for obtaining precise radial
velocity (PRV)... | astro-ph.IM astro-ph.EP astro-ph.SR | earthfinder is a probe mission concept selected for study by nasa for input to the 2020 astronomy decadal survey this study is currently active and a final white paper report is due to nasa at the end of calendar 2018 we are tasked with evaluating the scientific rationale for obtaining precise radial velocity prv measu... | [['earthfinder', 'is', 'a', 'probe', 'mission', 'concept', 'selected', 'for', 'study', 'by', 'nasa', 'for', 'input', 'to', 'the', '2020', 'astronomy', 'decadal', 'survey', 'this', 'study', 'is', 'currently', 'active', 'and', 'a', 'final', 'white', 'paper', 'report', 'is', 'due', 'to', 'nasa', 'at', 'the', 'end', 'of', ... | [-0.06970236550380544, 0.12871871523301653, -0.08576667809677196, 0.04213207643535897, -0.1496727935348948, -0.07590688049520661, 0.040272659153632095, 0.3423921772983016, -0.23809585386766044, -0.36019419525121527, 0.14082667828732495, -0.28412863860527676, -0.11506929942898876, 0.2292609176886215, -0.0898482711205819... |
1,803.03961 | Solvent hydrodynamics enhances the collective diffusion of membrane
lipids | The collective motion of membrane lipids over hundred of nanometers and
nanoseconds is essential for the formation of submicron complexes of lipids and
proteins in the cell membrane. These dynamics are difficult to access
experimentally and are currently poorly understood. One of the conclusions of
the celebrated Saf... | physics.bio-ph | the collective motion of membrane lipids over hundred of nanometers and nanoseconds is essential for the formation of submicron complexes of lipids and proteins in the cell membrane these dynamics are difficult to access experimentally and are currently poorly understood one of the conclusions of the celebrated saffman... | [['the', 'collective', 'motion', 'of', 'membrane', 'lipids', 'over', 'hundred', 'of', 'nanometers', 'and', 'nanoseconds', 'is', 'essential', 'for', 'the', 'formation', 'of', 'submicron', 'complexes', 'of', 'lipids', 'and', 'proteins', 'in', 'the', 'cell', 'membrane', 'these', 'dynamics', 'are', 'difficult', 'to', 'acce... | [-0.12238000298588815, 0.2151533338617076, -0.038654485465863406, 0.04401844278882034, 0.015827362697261076, -0.1435720148844895, -0.029165228296408965, 0.38530339392675467, -0.2979191253887631, -0.2606889867708523, -0.013101981539546092, -0.28034238665424593, -0.1499376536363311, 0.12248186401209973, -0.00561335789072... |
1,803.03962 | Confluent and non-confluent phases in a model of cell tissue | The Voronoi-based cellular model is highly successful in describing the
motion of two-dimensional confluent cell tissues. In the homogeneous version of
this model, the energy of each cell is determined solely by its geometric shape
and size, and the interaction between adjacent cells is a byproduct of this
additive e... | q-bio.CB cond-mat.soft physics.bio-ph | the voronoibased cellular model is highly successful in describing the motion of twodimensional confluent cell tissues in the homogeneous version of this model the energy of each cell is determined solely by its geometric shape and size and the interaction between adjacent cells is a byproduct of this additive energy w... | [['the', 'voronoibased', 'cellular', 'model', 'is', 'highly', 'successful', 'in', 'describing', 'the', 'motion', 'of', 'twodimensional', 'confluent', 'cell', 'tissues', 'in', 'the', 'homogeneous', 'version', 'of', 'this', 'model', 'the', 'energy', 'of', 'each', 'cell', 'is', 'determined', 'solely', 'by', 'its', 'geomet... | [-0.08728055548985963, 0.1474969744065091, -0.010178736641669189, 0.02401137528479767, -0.042976100674285644, -0.16121247345757372, 0.04584252737673386, 0.36021893679269784, -0.27925927028661807, -0.2737849918457697, 0.0773883568131769, -0.23816857482130938, -0.2349965458951082, 0.157454861852973, -0.08313823996533481,... |
1,803.03963 | BTS-DSN: Deeply Supervised Neural Network with Short Connections for
Retinal Vessel Segmentation | Background and Objective: The condition of vessel of the human eye is an
important factor for the diagnosis of ophthalmological diseases. Vessel
segmentation in fundus images is a challenging task due to complex vessel
structure, the presence of similar structures such as microaneurysms and
hemorrhages, micro-vessel ... | cs.CV | background and objective the condition of vessel of the human eye is an important factor for the diagnosis of ophthalmological diseases vessel segmentation in fundus images is a challenging task due to complex vessel structure the presence of similar structures such as microaneurysms and hemorrhages microvessel with on... | [['background', 'and', 'objective', 'the', 'condition', 'of', 'vessel', 'of', 'the', 'human', 'eye', 'is', 'an', 'important', 'factor', 'for', 'the', 'diagnosis', 'of', 'ophthalmological', 'diseases', 'vessel', 'segmentation', 'in', 'fundus', 'images', 'is', 'a', 'challenging', 'task', 'due', 'to', 'complex', 'vessel',... | [-0.05058933361313767, -0.005457219027380446, -0.0425394039022275, 0.07103133806305999, -0.08222946053518801, -0.17780187415072224, 0.016011739388368283, 0.4603599291120734, -0.20424642351281364, -0.3398472629443995, 0.1012346332829672, -0.2867938023034448, -0.1589549011670523, 0.22967485835009785, -0.14501709885085784... |
1,803.03964 | Characterizing optical variability of OJ 287 in 2016 - 2017 | We report on a recent multi-band optical photometric and polarimetric
observational campaign of the blazar OJ 287 which was carried out during
September 2016 -- December 2017. We employed nine telescopes in Bulgaria,
China, Georgia, Japan, Serbia, Spain and the United States. We collected over
1800 photometric image ... | astro-ph.HE | we report on a recent multiband optical photometric and polarimetric observational campaign of the blazar oj 287 which was carried out during september 2016 december 2017 we employed nine telescopes in bulgaria china georgia japan serbia spain and the united states we collected over 1800 photometric image frames in bvr... | [['we', 'report', 'on', 'a', 'recent', 'multiband', 'optical', 'photometric', 'and', 'polarimetric', 'observational', 'campaign', 'of', 'the', 'blazar', 'oj', '287', 'which', 'was', 'carried', 'out', 'during', 'september', '2016', 'december', '2017', 'we', 'employed', 'nine', 'telescopes', 'in', 'bulgaria', 'china', 'g... | [-0.09462924595986907, 0.13921208759465825, -0.10717975448403094, 0.06436155656766561, -0.0619883268357565, -0.09746202827431262, 0.06872865407520698, 0.5001521743834019, -0.1791357159221338, -0.39824324901163993, 0.10728190110944626, -0.3115461185119218, -0.07981150288121878, 0.1869631417778631, -0.11721179354108043, ... |
1,803.03965 | BEBP: An Poisoning Method Against Machine Learning Based IDSs | In big data era, machine learning is one of fundamental techniques in
intrusion detection systems (IDSs). However, practical IDSs generally update
their decision module by feeding new data then retraining learning models in a
periodical way. Hence, some attacks that comprise the data for training or
testing classifie... | cs.LG cs.CR stat.ML | in big data era machine learning is one of fundamental techniques in intrusion detection systems idss however practical idss generally update their decision module by feeding new data then retraining learning models in a periodical way hence some attacks that comprise the data for training or testing classifiers signif... | [['in', 'big', 'data', 'era', 'machine', 'learning', 'is', 'one', 'of', 'fundamental', 'techniques', 'in', 'intrusion', 'detection', 'systems', 'idss', 'however', 'practical', 'idss', 'generally', 'update', 'their', 'decision', 'module', 'by', 'feeding', 'new', 'data', 'then', 'retraining', 'learning', 'models', 'in', ... | [-0.10128924583899275, 0.02452922079687536, -0.0723344855439246, 0.06658225087807945, -0.09975546174415999, -0.25448262917353787, 0.10742181518355114, 0.39209450598568185, -0.27240697645617135, -0.3189713927252538, 0.12941227319685225, -0.28810645876451557, -0.20042873721360538, 0.21861987833819857, -0.1545744949460737... |
1,803.03966 | Low-cost Autonomous Navigation System Based on Optical Flow
Classification | This work presents a low-cost robot, controlled by a Raspberry Pi, whose
navigation system is based on vision. The strategy used consisted of
identifying obstacles via optical flow pattern recognition. Its estimation was
done using the Lucas-Kanade algorithm, which can be executed by the Raspberry
Pi without harming ... | cs.RO | this work presents a lowcost robot controlled by a raspberry pi whose navigation system is based on vision the strategy used consisted of identifying obstacles via optical flow pattern recognition its estimation was done using the lucaskanade algorithm which can be executed by the raspberry pi without harming its perfo... | [['this', 'work', 'presents', 'a', 'lowcost', 'robot', 'controlled', 'by', 'a', 'raspberry', 'pi', 'whose', 'navigation', 'system', 'is', 'based', 'on', 'vision', 'the', 'strategy', 'used', 'consisted', 'of', 'identifying', 'obstacles', 'via', 'optical', 'flow', 'pattern', 'recognition', 'its', 'estimation', 'was', 'do... | [-0.12821677944057772, 0.034152938668172345, -0.13389467825301182, -0.025574105551951908, -0.06724027666844364, -0.15709704177008352, 0.022785493878162123, 0.422593614898431, -0.24554572908036634, -0.3411671419938405, 0.12493950959084094, -0.24612649102321166, -0.18147295910833228, 0.2451875387449922, -0.14092105404378... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.