text stringlengths 8 3.91k | label int64 0 10 |
|---|---|
abstract
to each of the symmetry groups of the platonic solids we adjoin a carefully designed
involution yielding topological generators of pu (2) which have optimal covering properties
as well as efficient navigation. these are a consequence of optimal strong approximation
for integral quadratic forms associated with ... | 4 |
abstract
deep neural network (dnn) models have recently obtained state-of-the-art prediction accuracy for
the transcription factor binding (tfbs) site classification task. however, it remains unclear how
these approaches identify meaningful dna sequence signals and give insights as to why tfs bind
to certain locations.... | 9 |
abstract
for lengths 64 and 66, we construct extremal singly even self-dual
codes with weight enumerators for which no extremal singly even selfdual codes were previously known to exist. we also construct new
40 inequivalent extremal doubly even self-dual [64, 32, 12] codes with
covering radius 12 meeting the delsarte ... | 7 |
abstract | 6 |
abstract
we describe a question answering model that
applies to both images and structured knowledge bases. the model uses natural language strings to automatically assemble neural networks from a collection of composable
modules. parameters for these modules are
learned jointly with network-assembly parameters via rei... | 9 |
abstract. grammars written as constraint handling rules (chr) can
be executed as efficient and robust bottom-up parsers that provide a
straightforward, non-backtracking treatment of ambiguity. abduction
with integrity constraints as well as other dynamic hypothesis generation techniques fit naturally into such grammars... | 6 |
abstract
referential integrity (ri) is an important correctness property of a
shared, distributed object storage system. it is sometimes thought
that enforcing ri requires a strong form of consistency. in this paper, we argue that causal consistency suffices to maintain ri. we
support this argument with pseudocode for a ... | 8 |
abstract
the presence of behind-the-meter rooftop pv and storage in the residential sector is poised
to increase significantly. here we quantify in detail the value of these technologies to consumers
and service providers. we characterize the heterogeneity in household electricity cost savings
under time-varying prices... | 3 |
abstract
we consider inference in the scalar diffusion model dxt = b(xt ) dt + σ(xt ) dwt with
discrete data (xj∆n )0≤j≤n , n → ∞, ∆n → 0 and periodic coefficients. for σ given, we
prove a general theorem detailing conditions under which bayesian posteriors will contract
in l2 –distance around the true drift function b... | 10 |
abstract
expectation maximization (em) has recently been shown to be an efficient algorithm
for learning finite-state controllers (fscs) in large decentralized pomdps (dec-pomdps).
however, current methods use fixed-size fscs and often converge to maxima that are far
from optimal. this paper considers a variable-size f... | 3 |
abstract
deep learning methods have shown great promise in many practical applications,
ranging from speech recognition, visual object recognition, to text processing.
however, most of the current deep learning methods suffer from scalability problems for large-scale applications, forcing researchers or users to focus ... | 9 |
abstract
a shortcoming of existing reachability approaches for nonlinear systems is the poor scalability
with the number of continuous state variables. to mitigate this problem we present a simulationbased approach where we first sample a number of trajectories of the system and next establish
bounds on the convergence... | 3 |
abstract: one of the most recent architectures of networks is software-defined networks (sdns) using a controller appliance to control the set of switches on the network. the controlling process includes installing or
uninstalling packet-processing rules on flow tables of switches.
this paper presents a high-level impe... | 6 |
abstract—advances in de novo synthesis of dna and computational gene design methods make possible the customization of
genes by direct manipulation of features such as codon bias and mrna secondary structure. codon context is another feature
significantly affecting mrna translational efficiency, but existing methods an... | 5 |
abstract
initial population plays an important role in heuristic algorithms such as ga as it help to decrease
the time those algorithms need to achieve an acceptable result. furthermore, it may influence the
quality of the final answer given by evolutionary algorithms. in this paper, we shall introduce a
heuristic meth... | 9 |
abstract. given a positive integer κ, we investigate the class of numerical semigroups verifying the property that every two subsequent non gaps, smaller than the
conductor, are spaced by at least κ. these semigroups will be called κ-sparse and
generalize the concept of sparse numerical semigroups. | 0 |
abstract
solvency games, introduced by berger et al., provide an abstract framework for modelling
decisions of a risk-averse investor, whose goal is to avoid ever going broke. we study a new
variant of this model, where, in addition to stochastic environment and fixed increments and
decrements to the investor’s wealth,... | 5 |
abstract
new vision sensors, such as the dynamic and active-pixel vision sensor (davis), incorporate a conventional globalshutter camera and an event-based sensor in the same pixel array. these sensors have great potential for high-speed
robotics and computer vision because they allow us to combine the benefits of conv... | 1 |
abstract
health related social media mining is a valuable apparatus for the early recognition of the diverse antagonistic
medicinal conditions. mostly, the existing methods are based on machine learning with knowledge-based learning.
this working note presents the recurrent neural network (rnn) and long short-term memo... | 2 |
abstract
in this paper, we address the dataset scarcity issue with the
hyperspectral image classification. as only a few thousands
of pixels are available for training, it is difficult to effectively
learn high-capacity convolutional neural networks (cnns).
to cope with this problem, we propose a novel cross-domain
cnn... | 1 |
abstract syntax tree (ast), consisting of syntax nodes (corresponding to nonterminals in the programming language’s grammar) and syntax tokens (corresponding to terminals).
we label syntax nodes with the name of the nonterminal from the program’s grammar, whereas
syntax tokens are labeled with the string that they repr... | 2 |
abstract—wireless fading channels suffer from both channel
fadings and additive white gaussian noise (awgn). as a result,
it is impossible for fading channels to support a constant rate data
stream without using buffers. in this paper, we consider information transmission over an infinite-buffer-aided block rayleigh
fa... | 7 |
abstract
the millimeter wave spectra at 71-76ghz (70ghz) and 81-86ghz (80ghz) have the potential
to endow fifth-generation new radio (5g-nr) with mobile connectivity at gigabit rates. however, a
pressing issue is the presence of incumbent systems in these bands, which are primarily point-topoint fixed stations (fss). i... | 7 |
abstract. quantum machine learning witnesses an increasing amount of quantum
algorithms for data-driven decision making, a problem with potential applications
ranging from automated image recognition to medical diagnosis. many of those
algorithms are implementations of quantum classifiers, or models for the classificat... | 10 |
abstract
crowdsourced 3d cad models are becoming easily accessible online, and can potentially generate an infinite
number of training images for almost any object category.
we show that augmenting the training data of contemporary
deep convolutional neural net (dcnn) models with such
synthetic data can be effective, e... | 9 |
abstract. we show that a countable group is locally virtually cyclic if and only if its
bredon cohomological dimension for the family of virtually cyclic subgroups is at most one. | 4 |
abstract
an adaptive system for the suppression of vibration transmission using a single piezoelectric
actuator shunted by a negative capacitance circuit is presented. it is known that using negative
capacitance shunt, the spring constant of piezoelectric actuator can be controlled to extreme values
of zero or infinity... | 5 |
abstract
graphs provide a powerful means for representing complex
interactions between entities. recently, new deep learning approaches have emerged for representing and modeling graphstructured data while the conventional deep learning methods,
such as convolutional neural networks and recurrent neural
networks, have ... | 9 |
abstract
in survival analysis it often happens that some subjects under study do not experience the event of interest; they are considered to be ‘cured’. the population is thus
a mixture of two subpopulations : the one of cured subjects, and the one of ‘susceptible’ subjects. when covariates are present, a so-called mi... | 10 |
abstract
we prove that orthogonal constructor term rewrite systems and lambda-calculus with weak
(i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. in particular, weak call-by-value betareduction can be simulated by an orthogon... | 6 |
abstract
if every element of a matrix group is similar to a permutation matrix,
then it is called a permutation-like matrix group. references [4], [5] and
[6] showed that, if a permutation-like matrix group contains a maximal
cycle such that the maximal cycle generates a normal subgroup and the
length of the maximal cy... | 4 |
abstract
the main problems of school course timetabling are time, curriculum, and classrooms. in addition there
are other problems that vary from one institution to another. this paper is intended to solve the problem of
satisfying the teachers’ preferred schedule in a way that regards the importance of the teacher to ... | 9 |
abstract— over the years, data mining has attracted most of the
attention from the research community. the researchers attempt
to develop faster, more scalable algorithms to navigate over the
ever increasing volumes of spatial gene expression data in search
of meaningful patterns. association rules are a data mining
te... | 5 |
abstract—signal processing played an important role in improving the quality of communications over copper cables in
earlier dsl technologies. even more powerful signal processing
techniques are required to enable a gigabit per second data
rate in the upcoming g.fast standard. this new standard is
different from its pr... | 7 |
abstract
this paper presents a model for the simulation of liquid-gas-solid flows by means of the
lattice boltzmann method. the approach is built upon previous works for the simulation of
liquid-solid particle suspensions on the one hand, and on a liquid-gas free surface model on
the other. we show how the two approach... | 5 |
abstract syntax tree according to the provided
grammar and is implemented using recursive descent parsing techniques as described in [3]. the lexer is
a module used by this pass. errors and warnings reported by the first pass are only lexical and syntactic
errors. pass two traverses the syntax tree depth first, replaci... | 6 |
abstract
counting the number of permutations of a given total displacement is equivalent to counting
weighted motzkin paths of a given area (guay-paquet and petersen [10]). the former combinatorial problem is still open. in this work we show that this connection allows to construct
efficient algorithms for counting and... | 8 |
abstract
a promising technique to provide mobile applications with high computation resources is to offload
the processing task to the cloud. mobile cloud computing enables mobile devices with limited batteries
to run resource hungry applications with the help of abundant processing capabilities of the clouds and
to sa... | 7 |
abstract. in this preliminary note, we will illustrate our ideas on automated mechanisms for termination and non-termination reasoning. | 6 |
abstract: despite extensive research and remarkable advancements in the control of complex networks,
time-invariant control schedules (tics) still dominate
the literature. this is both due to their simplicity and
the fact that the potential benefits of time-varying control schedules (tvcs) have remained largely unchara... | 3 |
abstract
let k be a nonperfect separably closed field. let g be a connected reductive algebraic group defined over k. we study rationality problems for serre’s notion of complete
reducibility of subgroups of g. in particular, we present a new example of subgroup h
of g of type d4 in characteristic 2 such that h is g-co... | 4 |
abstract
an algebra has the howson property if the intersection of any two finitely generated subalgebras
is finitely generated. a simple necessary and sufficient condition is given for the howson property
to hold on an inverse semigroup with finitely many idempotents. in addition, it is shown that any
monogenic invers... | 4 |
abstract. the perfect phylogeny problem is a classic problem in computational biology, where we seek an unrooted phylogeny that is compatible with a set of qualitative characters. such a tree exists precisely
when an intersection graph associated with the character set, called the
partition intersection graph, can be t... | 5 |
abstract
we say that a polynomial automorphism φ in n variables is stably
co-tame if the tame subgroup in n variables is contained in the subgroup generated by φ and affine automorphisms in n + 1 variables. in
this paper, we give conditions for stably co-tameness of polynomial
automorphisms. | 4 |
abstract
in this paper, we introduce a generalized value iteration network (gvin), which is an end-to-end neural network planning
module. gvin emulates the value iteration algorithm by using
a novel graph convolution operator, which enables gvin to
learn and plan on irregular spatial graphs. we propose three
novel diff... | 2 |
abstract—this work proposes a new adaptive-robust control
(arc) architecture for a class of uncertain euler-lagrange (el)
systems where the upper bound of the uncertainty satisfies linear
in parameters (lip) structure. conventional arc strategies
either require structural knowledge of the system or presume
that the ove... | 3 |
abstract
python is a popular dynamic language with a large part of its
appeal coming from powerful libraries and extension modules. these augment the language and make it a productive
environment for a wide variety of tasks, ranging from web
development (django) to numerical analysis (numpy).
unfortunately, python’s pe... | 6 |
abstract. this paper investigates how high school students approach computing
through an introductory computer science course situated in the logic programming (lp) paradigm. this study shows how novice students operate within the
lp paradigm while engaging in foundational computing concepts and skills, and
presents a ... | 2 |
abstract
we prove an explicit formula for the first non-zero entry in the n-th
row of the graded betti table of an n-dimensional projective toric variety
associated to a normal polytope with at least one interior lattice point.
this applies to veronese embeddings of pn . we also prove an explicit
formula for the entire... | 0 |
abstract— as autonomous service robots become more affordable and thus available also for the general public, there
is a growing need for user friendly interfaces to control the
robotic system. currently available control modalities typically
expect users to be able to express their desire through either
touch, speech ... | 2 |
abstract | 2 |
abstraction
a directed graph g (v, e) is strongly connected if and only if, for any pair of vertices x and y from
v, there exists a path from x to y and a path from y to x. in computer science, the partition of a
graph in strongly connected components is represented by the partition of all vertices from the
graph, so t... | 8 |
abstract
first-order logic (fol) is widely regarded as one of the most important foundations for knowledge representation. nevertheless, in this paper, we argue that
fol has several critical issues for this purpose. instead, we propose an alternative called assertional logic, in which all syntactic objects are categori... | 2 |
abstract
this article is devoted to study the effects of the s-periodical fractional differencing filter (1 − ls )dt . to put this effect in evidence, we
have derived the periodic auto-covariance functions of two distinct univariate seasonally fractionally differenced periodic models. a multivariate
representation of p... | 10 |
abstract—cooperative adaptive cruise control (cacc) is
one of the driving applications of vehicular ad-hoc networks
(vanets) and promises to bring more efficient and faster
transportation through cooperative behavior between vehicles.
in cacc, vehicles exchange information, which is relied on to
partially automate driv... | 3 |
abstract. let g and g0 be two right-angled artin groups. we show they
are quasi-isometric if and only if they are isomorphic, under the assumption
that the outer automorphism groups out(g) and out(g0 ) are finite. if we
only assume out(g) is finite, then g0 is quasi-isometric g if and only if g0
is isomorphic to a subg... | 4 |
abstract
we study machine learning formulations of inductive program synthesis; that is,
given input-output examples, synthesize source code that maps inputs to corresponding outputs. our key contribution is t erpre t, a domain-specific language
for expressing program synthesis problems. a t erpre t model is composed o... | 9 |
abstract
the automatic coding of clinical documentation according
to diagnosis codes is a useful task in the electronic health
record, but a challenging one due to the large number
of codes and the length of patient notes. we investigate
four models for assigning multiple icd codes to discharge
summaries, and experimen... | 2 |
abstract. in this article, we introduce a procedure for selecting variables in principal components analysis. it is developed to identify a small
subset of the original variables that best explain the principal components through nonparametric relationships. there are usually some
noisy uninformative variables in a dat... | 10 |
abstract | 5 |
abstract. lyubeznik’s conjecture, ([ly1], remark 3.7) asserts the finiteness
of the set ssociated primes of local cohomology modules for regular rings. but,
in the case of ramified regular local ring, it is open. recently, in theorem 1.2
of [nu], it is proved that in any noetherian regular local ring s and for a fixed
... | 0 |
abstract. we analyze stable homology over associative rings and obtain results over artin algebras and commutative noetherian rings. our study develops similarly for these classes; for simplicity we only discuss the latter here.
stable homology is a broad generalization of tate homology. vanishing of
stable homology de... | 0 |
abstract | 5 |
abstract
it was recently proven that all free and many virtually free verbally closed subgroups are algebraically closed in any group. we establish sufficient conditions for a group that is an extension
of a free non-abelian group by a group satisfying a non-trivial law to be algebraically closed in any
group in which ... | 4 |
abstract | 8 |
abstract
this paper studies synchronization of dynamical networks with event-based communication. firstly, two estimators are
introduced into each node, one to estimate its own state, and the other to estimate the average state of its neighbours. then,
with these two estimators, a distributed event-triggering rule (etr... | 3 |
abstract | 3 |
abstract
this paper considers fully dynamic graph algorithms with both faster worst case update
time and sublinear space. the fully dynamic graph connectivity problem is the following: given
a graph on a fixed set of n nodes, process an online sequence of edge insertions, edge deletions,
and queries of the form “is the... | 8 |
abstract— in this paper a binary feature based loop closure
detection (lcd) method is proposed, which for the first time
achieves higher precision-recall (pr) performance compared
with state-of-the-art sift feature based approaches. the proposed system originates from our previous work multi-index
hashing for loop clos... | 1 |
abstract
we study the complexity of the problem detection pair. a detection pair of a graph
g is a pair (w, l) of sets of detectors with w ⊆ v (g), the watchers, and l ⊆ v (g), the
listeners, such that for every pair u, v of vertices that are not dominated by a watcher of w ,
there is a listener of l whose distances to... | 8 |
abstract. let g be the circulant graph cn (s) with s ⊆ {1, 2, . . . , ⌊ n2 ⌋}, and let i(g)
denote its the edge ideal in the ring r = k[x1 , . . . , xn ]. we consider the problem of
determining when g is cohen-macaulay, i.e, r/i(g) is a cohen-macaulay ring. because
a cohen-macaulay graph g must be well-covered, we focu... | 0 |
abstractions for optimal checkpointing in
inversion problems
navjot kukreja∗ | 5 |
abstract
the k-co-path set problem asks, given a graph g and a positive
integer k, whether one can delete k edges from g so that the remainder
is a collection of disjoint paths. we give a linear-time fpt algorithm
with complexity o∗ (1.588k ) for deciding k-co-path set, significantly
improving the previously best known... | 8 |
abstract. we present a parametric abstract domain for array content
analysis. the method maintains invariants for contiguous regions of the
array, similar to the methods of gopan, reps and sagiv, and of halbwachs and péron. however, it introduces a novel concept of an array
content graph, avoiding the need for an up-f... | 6 |
abstract
satellite radar altimetry is one of the most powerful techniques for measuring sea surface height variations,
with applications ranging from operational oceanography to climate research. over open oceans, altimeter
return waveforms generally correspond to the brown model, and by inversion, estimated shape para... | 1 |
abstract
an extremely simple, description of karmarkar’s algorithm with very few
technical terms is given. | 8 |
abstract. we prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups,
even under the assumption that they are contracting. | 4 |
abstract
consider a process satisfying a stochastic differential equation with unknown drift
parameter, and suppose that discrete observations are given. it is known that a simple
least squares estimator (lse) can be consistent, but numerically unstable in the sense
of large standard deviations under finite samples whe... | 10 |
abstract
we study approximations of the partition function of dense graphical models. partition
functions of graphical models play a fundamental role is statistical physics, in statistics and in
machine learning. two of the main methods for approximating the partition function are markov
chain monte carlo and variation... | 8 |
abstract—millimeter-wave (mmwave) communication and
network densification hold great promise for achieving highrate communication in next-generation wireless networks. cloud
radio access network (cran), in which low-complexity remote
radio heads (rrhs) coordinated by a central unit (cu) are
deployed to serve users in a... | 7 |
abstract
an oracle is a design for potentially high power
artificial intelligences (ais), where the ai is
made safe by restricting it to only answer questions. unfortunately most designs cause the oracle to be motivated to manipulate humans with
the contents of their answers, and oracles of potentially high intelligenc... | 2 |
abstract
this paper describes a generic algorithm for concurrent
resizing and on-demand per-bucket rehashing for an extensible
hash table. in contrast to known lock-based hash table algorithms,
the proposed algorithm separates the resizing and rehashing stages
so that they neither invalidate existing buckets nor block ... | 8 |
abstract
most reinforcement learning algorithms are inefficient for learning multiple tasks in complex robotic
systems, where different tasks share a set of actions. in such environments a compound policy
may be learnt with shared neural network parameters, which performs multiple tasks concurrently.
however such compo... | 2 |
abstract—this paper deals with the certification problem
for robust quadratic stability, robust state convergence, and
robust quadratic performance of linear systems that exhibit
bounded rates of variation in their parameters. we consider both
continuous-time (ct) and discrete-time (dt) parameter-varying
systems. in th... | 3 |
abstract
blind source separation, i.e. extraction of independent sources from
a mixture, is an important problem for both artificial and natural signal
processing. here, we address a special case of this problem when sources
(but not the mixing matrix) are known to be nonnegative, for example,
due to the physical natur... | 9 |
abstract
ultra-reliable, low latency communications (urllc) are currently attracting significant attention
due to the emergence of mission-critical applications and device-centric communication. urllc will
entail a fundamental paradigm shift from throughput-oriented system design towards holistic designs for
guaranteed... | 7 |
abstract explores two extensions to this system, which we explain in the
context of the actor model (although they are equally applicable to a system using locks). rather
than rejecting programs where actors leak internal objects, we allow an actor to bestow its
synchronisation mechanism upon the exposed objects. this ... | 6 |
abstract: high-dimensional linear regression with interaction effects is
broadly applied in research fields such as bioinformatics and social science.
in this paper, we first investigate the minimax rate of convergence for regression estimation in high-dimensional sparse linear models with two-way
interactions. we deri... | 10 |
abstract
this report studies data-driven estimation of the directed information (di) measure between
twoem discrete-time and continuous-amplitude random process, based on the k-nearest-neighbors
(k-nn) estimation framework. detailed derivations of two k-nn estimators are provided. the two
estimators differ in the metri... | 7 |
abstract
graphical models use the intuitive and well-studied methods of graph theory to implicitly represent
dependencies between variables in large systems. they can model the global behaviour of a complex
system by specifying only local factors.this thesis studies inference in discrete graphical models from
an “algeb... | 0 |
abstract
consider the standard nonparametric regression model and take as estimator the penalized least squares function. in this article, we study the trade-off
between closeness to the true function and complexity penalization of the estimator, where complexity is described by a seminorm on a class of functions.
firs... | 10 |
abstract. this is a short survey on existing upper and lower
bounds on the probability of the union of a finite number of events
using partial information given in terms of the individual or pairwise event probabilities (or their sums). new proofs for some of
the existing bounds are provided and new observations regard... | 7 |
abstract—we present kleuren, a novel assembly-free
method to reconstruct phylogenetic trees using the colored
de bruijn graph. kleuren works by constructing the colored de bruijn graph and then traversing it, finding bubble
structures in the graph that provide phylogenetic signal.
the bubbles are then aligned and conca... | 8 |
abstract— we consider an energy harvesting transmitter sending status updates regarding a physical phenomenon it observes
to a receiver. different from the existing literature, we consider
a scenario where the status updates carry information about
an independent message. the transmitter encodes this message
into the t... | 7 |
abstract
the evolution of the hemagglutinin amino acids sequences of influenza a virus is studied by a method
based on an informational metrics, originally introduced by rohlin for partitions in abstract probability
spaces. this metrics does not require any previous functional or syntactic knowledge about the sequences... | 5 |
abstract. finding the common structural features of two molecules is
a fundamental task in cheminformatics. most drugs are small molecules,
which can naturally be interpreted as graphs. hence, the task is formalized as maximum common subgraph problem. albeit the vast majority
of molecules yields outerplanar graphs this... | 8 |
abstract of thesis presented to lncc/mct in partial fulfillment of the requirements for the degree of doctor of sciences (d.sc.)
managing large-scale scientific hypotheses as
uncertain and probabilistic data
bernardo gonçalves
february - 2015 | 5 |
abstract
transversality is a simple and effective method for implementing quantum computation faulttolerantly. however, no quantum error-correcting code (qecc) can transversally implement a
quantum universal gate set (eastin and knill, phys. rev. lett., 102, 110502). since reversible
classical computation is often a do... | 7 |
abstract
minwise hashing is a fundamental and one of
the most successful hashing algorithm in the literature. recent advances based on the idea of
densification (shrivastava & li, 2014a;c) have
shown that it is possible to compute k minwise hashes, of a vector with d nonzeros, in
mere (d + k) computations, a significan... | 8 |
abstract
suppose that we wish to infer the value of a statistical parameter at a law from which we
sample independent observations. suppose that this parameter is smooth and that we can
define two variation-independent, infinite-dimensional features of the law, its so called q- and
g-components (comp.), such that if we... | 10 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.