Datasets:
damilojohn
/
Text-Descrambling

Dataset card Data Studio Files
xet
Community
text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
This intrinsic stochasticity? Does this raises significant two irregularity imply questions:
This raises two questions: Does this irregularity imply significant intrinsic stochasticity?
2,800
long to at neuron existing Can be models extended readily describe behavior timescales?
Can existing neuron models be readily extended to describe behavior at long timescales?
2,801
and questions, we to Thus "no" above answer respectively. the "yes"
Thus we answer "yes" and "no" to the above questions, respectively.
2,802
speciation. the sympatric of problem This is
This is the problem of sympatric speciation.
2,803
However, not mating entirely need random. be
However, mating need not be entirely random.
2,804
are probabilities the in rare of of in interested computer events experiments. bounding context We
We are interested in bounding probabilities of rare events in the context of computer experiments.
2,805
on events variables. the output of physical with rare a input These random depend model
These rare events depend on the output of a physical model with random input variables.
2,806
deal sampling then importance on to difficulty a We strategy with propose methods. this based
We then propose a strategy to deal with this difficulty based on importance sampling methods.
2,807
is Kriging into the due account. properly step taken The variability to metamodeling
The variability due to the Kriging metamodeling step is properly taken into account.
2,808
study case Finally, challenging analyzed. a is real
Finally, a challenging real case study is analyzed.
2,809
model. consists standard generative `spike-and-slab' of a Gaussian The underlying model and prior noise a
The underlying generative model consists of a standard `spike-and-slab' prior and a Gaussian noise model.
2,810
by Closed-form solutions M-step and probabilistic generalizing are equations derived for PCA. E-
Closed-form solutions for E- and M-step equations are derived by generalizing probabilistic PCA.
2,811
resulting a account. algorithm potentially posterior of can take into all multi-modal The EM modes
The resulting EM algorithm can take all modes of a potentially multi-modal posterior into account.
2,812
cost of The the scales with algorithm exponentially hidden computational of the number dimensions.
The computational cost of the algorithm scales exponentially with the number of hidden dimensions.
2,813
range the source model tasks. can to applied be separation of typical the Thus
Thus the model can be applied to the typical range of source separation tasks.
2,814
which To he this species random. interact large prove point, at networks analyzed in
To prove this point, he analyzed large networks in which species interact at random.
2,815
have pairs systems However, natural mutualistic predator-prey, (e.g., well-defined interactions or competitive). of in species
However, in natural systems pairs of species have well-defined interactions (e.g., predator-prey, mutualistic or competitive).
2,816
all stability analytic provide criteria cases. We for
We provide analytic stability criteria for all cases.
2,817
results ecology. broad in applicability These have
These results have broad applicability in ecology.
2,818
mutualistic stability is by in negatively impacted nestedness Similarly, networks. bipartite
Similarly, stability is negatively impacted by nestedness in bipartite mutualistic networks.
2,819
pages. World of no longer consists just Wide HTML The Web
The World Wide Web no longer consists just of HTML pages.
2,820
the grows top On a common structured Semantic of as Web data XML, source.
On top of XML, the Semantic Web grows as a common structured data source.
2,821
we In detail. explain first of this these developments work, in each
In this work, we first explain each of these developments in detail.
2,822
domains. the also we in these the On avenues current research illustrate way,
On the way, we also illustrate the current research avenues in these domains.
2,823
inferring cloud data. point methodology underlying topology the for A proposed is
A methodology is proposed for inferring the topology underlying point cloud data.
2,824
models. Gaussian an popular, extremely flexible class are models Latent of
Latent Gaussian models are an extremely popular, flexible class of models.
2,825
however, tricky these is, for and consuming. inference models Bayesian time
Bayesian inference for these models is, however, tricky and time consuming.
2,826
we In the approximation this INLA and related outline its R package. paper,
In this paper, we outline the INLA approximation and its related R package.
2,827
factorization. and of finite models, It mixture conjugate calculation properties the families exploits
It exploits the calculation properties of finite mixture models, conjugate families and factorization.
2,828
certain This ability, extremely situations, is useful in most in alternative not methods. found
This ability, extremely useful in certain situations, is not found in most alternative methods.
2,829
of such examples procedure Markov replica construct the a hidden for We models.
We construct the examples of such a replica procedure for hidden Markov models.
2,830
and based describes parts. classifies data pattern on recognition features relationships Structural and of the
Structural pattern recognition describes and classifies data based on the relationships of features and parts.
2,831
structure number, dimension. of the characterize Topological objects like invariants, of any Euler the
Topological invariants, like the Euler number, characterize the structure of objects of any dimension.
2,832
provide invariants a more to homology. refined can topological space Cohomology does algebraic than
Cohomology can provide more refined algebraic invariants to a topological space than does homology.
2,833
of dimension. to homology used the chains characterize holes assigns any in to It `quantities'
It assigns `quantities' to the chains used in homology to characterize holes of any dimension.
2,834
and invariant scanning An is extension obtain given. to cocycles rotation
An extension to obtain scanning and rotation invariant cocycles is given.
2,835
the to architecture: reasoning. perform introduce cognitive Xapagy designed a software system We narrative
We introduce the Xapagy cognitive architecture: a software system designed to perform narrative reasoning.
2,836
smoother substantial a has a base bias. resulting The variance small but
The resulting base smoother has a small variance but a substantial bias.
2,837
in the their Then, package implementation. the rules available explain and stopping we
Then, we explain the stopping rules available in the package and their implementation.
2,838
modeling has Hepatitis paper. dynamics A this presented (HCV) in been of C Virus mathematical
A mathematical modeling of Hepatitis C Virus (HCV) dynamics has been presented in this paper.
2,839
computed on complexes. has traditionally Cohomology simplicial been ring
Cohomology ring has been traditionally computed on simplicial complexes.
2,840
decisions suggest may lead and belief to A wrong actions. false harmful
A false belief may suggest wrong decisions and lead to harmful actions.
2,841
as So beliefs to false as important goal possible. make unlikely is an
So an important goal is to make false beliefs as unlikely as possible.
2,842
in forms cancer women Uterine of Cervical Cancer the is one most worldwide. of common
Uterine Cervical Cancer is one of the most common forms of cancer in women worldwide.
2,843
images form. in cervigrams Colposcopy, During acquired are raw colposcopic or Digital
During Digital Colposcopy, colposcopic images or cervigrams are acquired in raw form.
2,844
about of half The image. raw cervix region occupies the cervigram
The cervix region occupies about half of the raw cervigram image.
2,845
the of cervix. identification the tissues This information automatic irrelevant can confuse within
This irrelevant information can confuse automatic identification of the tissues within the cervix.
2,846
a the solution five-point give problem. well-known pose relative to new algorithmic We
We give a new algorithmic solution to the well-known five-point relative pose problem.
2,847
cubic deal an with famous the matrix. not does on approach essential constraint Our
Our approach does not deal with the famous cubic constraint on an essential matrix.
2,848
induced. of can nucleation complexes or Scaffold-mediated protein either constitutive be
Scaffold-mediated nucleation of protein complexes can be either constitutive or induced.
2,849
the resolved before must make This towards goals. can achieving plans be its crisis agent
This crisis must be resolved before the agent can make plans towards achieving its goals.
2,850
a is forgery. of splicing Image form common image
Image splicing is a common form of image forgery.
2,851
no clues alterations of tampering. may visual leave Such
Such alterations may leave no visual clues of tampering.
2,852
camera are are characteristic and inherent Such unique. camera from constant manufacturing properties processes
Such constant camera characteristic properties are inherent from camera manufacturing processes and are unique.
2,853
used. the from classification algorithm is independent proposal The
The proposal is independent from the classification algorithm used.
2,854
"Ariadne's planning, approach called to algorithm". a We clew path the present new
We present a new approach to path planning, called the "Ariadne's clew algorithm".
2,855
target. builds looks Explore the while the space accessible Search representation a for of
Explore builds a representation of the accessible space while Search looks for the target.
2,856
found any about show without second a results one pre-processing. that Experimental path in is
Experimental results show that a path is found in about one second without any pre-processing.
2,857
We Wheel' Optimization term general we describe approach (SWO). a optimization which to `Squeaky
We describe a general approach to optimization which we term `Squeaky Wheel' Optimization (SWO).
2,858
cycle until solution is acceptable limit reached, continues found. or some is an Construct/Analyze/Prioritize This
This Construct/Analyze/Prioritize cycle continues until some limit is reached, or an acceptable solution is found.
2,859
and two prioritizations. be viewed spaces: can operating search on SWO as solutions
SWO can be viewed as operating on two search spaces: solutions and prioritizations.
2,860
prioritizations Similarly, constructing successive generated solutions. are analyzing by and
Similarly, successive prioritizations are generated by constructing and analyzing solutions.
2,861
discuss. This which `coupled search' has properties, we interesting some
This `coupled search' has some interesting properties, which we discuss.
2,862
disadvantages. Top-down approaches have and specific advantages and each bottom-up theorem proving
Top-down and bottom-up theorem proving approaches each have specific advantages and disadvantages.
2,863
prover a are subgoal A they top-down generates by clauses, prover. bottom-up processed then
A top-down prover generates subgoal clauses, they are then processed by a bottom-up prover.
2,864
the use second The deals in bottom-up a lemmas with top-down technique of prover. generated
The second technique deals with the use of bottom-up generated lemmas in a top-down prover.
2,865
the areas We and model of apply to elimination superposition. our concept
We apply our concept to the areas of model elimination and superposition.
2,866
of the article investigate default logic. latter formalizations we in Reiter's this approach In
In this article we investigate formalizations of the latter approach in Reiter's default logic.
2,867
both decidable. of reasoning is is proposal in notable our that feature cases A
A notable feature of our proposal is that reasoning in both cases is decidable.
2,868
concurrently explore AntNet's and exchange agents network the information. collected
AntNet's agents concurrently explore the network and exchange collected information.
2,869
asynchronous, is mediated the among the communication agents by The network indirect itself. and
The communication among the agents is indirect and asynchronous, mediated by the network itself.
2,870
is typical of social stigmergy. communication form and insects of is called This
This form of communication is typical of social insects and is called stigmergy.
2,871
testbeds. of The algorithms' evaluated over a performance set realistic is
The algorithms' performance is evaluated over a set of realistic testbeds.
2,872
under conditions experimental performance all with AntNet to superior its respect competitors. the showed
AntNet showed superior performance under all the experimental conditions with respect to its competitors.
2,873
the methods %existing previous significantly approximation that these method. known outperform Experiments show best
Experiments show that these methods significantly outperform the previous best known %existing approximation method.
2,874
optimal almost randomly are to generated tested. all find in able manipulations elections the We
We are able to find optimal manipulations in almost all the randomly generated elections tested.
2,875
logic automatic extensive conducted of programs. Recently, control research generation has for on been
Recently, extensive research has been conducted on automatic generation of control for logic programs.
2,876
novel this paper a automatic for algorithm of finding lowest-cost subgoal orderings. In present we
In this paper we present a novel algorithm for automatic finding of lowest-cost subgoal orderings.
2,877
strategy. The divide-and-conquer works using algorithm the
The algorithm works using the divide-and-conquer strategy.
2,878
provably a optimal are yielding subsets and recursively order. The ordered merged,
The subsets are ordered recursively and merged, yielding a provably optimal order.
2,879
variational a in We models. inference approximation describe probabilistic method large-scale for efficient
We describe a variational approximation method for efficient inference in large-scale probabilistic models.
2,880
to probabilities of interest. that deterministic procedures Variational marginal provide and are conditional approximations methods
Variational methods are deterministic procedures that provide approximations to marginal and conditional probabilities of interest.
2,881
sampling or inference provide stochastic search. on methods based to approximate They alternatives
They provide alternatives to approximate inference methods based on stochastic sampling or search.
2,882
a knowledge. and network probabilistic statistical built is model large-scale graphical expert on QMR The
The QMR network is a large-scale probabilistic graphical model built on statistical and expert knowledge.
2,883
The to of conditional comparative disprove Fine same result counterexample is a on used probability.
The same counterexample is used to disprove a result of Fine on comparative conditional probability.
2,884
from quite simpler different those are the answers in framework. The classical
The answers are quite different from those in the simpler classical framework.
2,885
formulae. planning Boolean to we quantified conditional Instead, translate
Instead, we translate conditional planning to quantified Boolean formulae.
2,886
that simple recover of proofs most previous results. provide the We
We provide simple proofs that recover most of the previous results.
2,887
for game. We upper propose bounds semi-bandit new the
We propose new upper bounds for the semi-bandit game.
2,888
three for derive all we Moreover feedback lower bounds assumptions.
Moreover we derive lower bounds for all three feedback assumptions.
2,889
answer et asked we al. a by Koolen Finally, question
Finally, we answer a question asked by Koolen et al.
2,890
systems suggests posses that capacities. different chemical Our semantic different study
Our study suggests that different chemical systems posses different semantic capacities.
2,891
Hypotheses origin evolution life. and concern of the
Hypotheses concern the origin and evolution of life.
2,892
corrections without incurring terms the on Higher-order cost. much variational approach describe further computational
Higher-order terms describe corrections on the variational approach without incurring much further computational cost.
2,893
to is elucidated. approaches as also other such relationship perturbational TAP The
The relationship to other perturbational approaches such as TAP is also elucidated.
2,894
with of over study problem probabilistic the basic constraints events. conditional deduction We
We study the problem of probabilistic deduction with conditional constraints over basic events.
2,895
constraints conditional show We complete is over basic probabilistic deduction with globally NP-hard. that events
We show that globally complete probabilistic deduction with conditional constraints over basic events is NP-hard.
2,896
trees. special the on in We constraint then concentrate conditional of probabilistic case deduction
We then concentrate on the special case of probabilistic deduction in conditional constraint trees.
2,897
complete globally efficient for We deduction. very techniques elaborate probabilistic
We elaborate very efficient techniques for globally complete probabilistic deduction.
2,898
decidable. We the is theory first-order prove that such constraints over also
We also prove that the first-order theory over such constraints is decidable.
2,899