text
stringlengths 27
153
| label
stringlengths 27
153
| id
int64 0
40k
|
---|---|---|
forms two consider of We organization. genome | We consider two forms of genome organization. | 900 |
sexual the multi-chromosomed is exception the reproduction only for pathway The genome. | The only exception is the sexual reproduction pathway for the multi-chromosomed genome. | 901 |
distribution, depth, habitat The to behaviour (water the coast), distance (i.e. temporal | The temporal distribution, habitat (water depth, distance to the coast), behaviour (i.e. | 902 |
convincing. the most hypothesis was foraging advantage The | The foraging advantage hypothesis was the most convincing. | 903 |
benefits the associations the mixed-species depend of appeared species. to However, on | However, the benefits of mixed-species associations appeared to depend on the species. | 904 |
can if algorithm And we find so, construct an to one? effective | And if so, can we find an effective algorithm to construct one? | 905 |
we paper give this case. the answer a complete to general In | In this paper we give a complete answer to the general case. | 906 |
level-k special The main property of SN-sets a idea a to use network. is in | The main idea is to use a special property of SN-sets in a level-k network. | 907 |
present the Topology Fuzzy extension the Intuitionistic Topologies. as Also, of we Neutrosophic an | Also, as an extension of the Intuitionistic Fuzzy Topology we present the Neutrosophic Topologies. | 908 |
In all is intractable. full summation terms over correction general, | In general, full summation over all correction terms is intractable. | 909 |
similar \textit{et Reichenbach to of recent results These results al.} are | These results are similar to recent results of Reichenbach \textit{et al.} | 910 |
below. with functional silicon neuronal is modeling presented proposed framework networks interfaced chips A for | A proposed modeling framework for functional neuronal networks interfaced with silicon chips is presented below. | 911 |
A two-species parasitoids and system is studied. of extended hosts spatially | A two-species spatially extended system of hosts and parasitoids is studied. | 912 |
metrics patterns thereof. characterize to introduce several the onset and We | We introduce several metrics to characterize the patterns and onset thereof. | 913 |
experiments. can The be protocols implemented in behavioral | The protocols can be implemented in behavioral experiments. | 914 |
errors. pyrosequencing generated reads the However, size contain are numerous in short by and | However, the reads generated by pyrosequencing are short in size and contain numerous errors. | 915 |
has Furthermore, specific the a reference in position genome. each read | Furthermore, each read has a specific position in the reference genome. | 916 |
alignment accuracy the from obtained The consensus multiple from confirmed the the alignments. is of | The accuracy of the alignment is confirmed from the consensus obtained from the multiple alignments. | 917 |
of extended presented. autocatalytic systems spatially Analytical analysis hypercyclic and is | Analytical analysis of spatially extended autocatalytic and hypercyclic systems is presented. | 918 |
stability are stationary of studied. Existence solutions and | Existence and stability of stationary solutions are studied. | 919 |
that stable values proved spatially some solutions it For is parameter appear. non-uniform | For some parameter values it is proved that stable spatially non-uniform solutions appear. | 920 |
data our to Littorina We the apply snail, marine algorithm saxatilis. from | We apply our algorithm to data from the marine snail, Littorina saxatilis. | 921 |
set-up. results cognitive An emergent from capability this | An emergent cognitive capability results from this set-up. | 922 |
different into Also translating are with them documentation along examples. programs for formats, provided and | Also provided are programs for translating them into different formats, along with documentation and examples. | 923 |
the code are all for programs included. Source binaries and | Source code and binaries for all the programs are included. | 924 |
will for reaction of thorough studies network space. the networks This library allow of | This library of networks will allow for thorough studies of the reaction network space. | 925 |
divided reproduction into neutral followed can two by model selection. Such be phases: | Such model can be divided into two phases: reproduction followed by neutral selection. | 926 |
correlations be underestimated. gene-history may situation, this significantly In the | In this situation, the gene-history correlations may be significantly underestimated. | 927 |
the case. We why explain this is | We explain why this is the case. | 928 |
our remains this In sparse. neuroanatomical of genomes, knowledge circuitry of era complete surprisingly | In this era of complete genomes, our knowledge of neuroanatomical circuitry remains surprisingly sparse. | 929 |
basic for and knowledge into however clinical function. research brain Such is both critical | Such knowledge is however critical both for basic and clinical research into brain function. | 930 |
and knowledge rationale We review briefly and techniques. experimental detail scientific medical and existing the | We detail the scientific and medical rationale and briefly review existing knowledge and experimental techniques. | 931 |
being transition attractors, types called Their graph modeled. cycles, organism cell state the represent of | Their state transition graph cycles, called attractors, represent cell types of the organism being modeled. | 932 |
finding checking. for We a present bounded an algorithm model SAT-based attractors which uses | We present an algorithm for finding attractors which uses a SAT-based bounded model checking. | 933 |
of case consist (AEs). events pharmacovigilance The several involving drugs databases reports adverse and | The pharmacovigilance databases consist of several case reports involving drugs and adverse events (AEs). | 934 |
consistently all methods are to Some signals, highlight i.e. applied | Some methods are applied consistently to highlight all signals, i.e. | 935 |
drug AE. an significant and statistically a between associations all | all statistically significant associations between a drug and an AE. | 936 |
for have as been Boolean networks useful models control. potentially proposed genetic | Boolean networks have been proposed as potentially useful models for genetic control. | 937 |
uncorrelated approaches network assumed stability have structure. random Previous to | Previous approaches to stability have assumed uncorrelated random network structure. | 938 |
from gene nontrivial have network paradigm. random different topology typically significantly Real networks the | Real gene networks typically have nontrivial topology significantly different from the random network paradigm. | 939 |
to gene work the We application experimentally of networks. our discuss also possible inferred | We also discuss the possible application of our work to experimentally inferred gene networks. | 940 |
the algorithm both decisional estimates data. REMAPF from The new and the epsilon-machine states | The new REMAPF algorithm estimates both the epsilon-machine and the decisional states from data. | 941 |
for new we detection. object a paper, keypoint-based this In approach propose | In this paper, we propose a new approach for keypoint-based object detection. | 942 |
in to Traditional pose discard classifying keypoint-based and using methods individual misclassifications. estimation points consist | Traditional keypoint-based methods consist in classifying individual points and using pose estimation to discard misclassifications. | 943 |
video sequences experimental in Successful obtained real-time reported. detection are object for results | Successful experimental results obtained for real-time object detection in video sequences are reported. | 944 |
a a to probe biomolecules. of new Translocation nanopore properties physical technique experimental is through | Translocation through a nanopore is a new experimental technique to probe physical properties of biomolecules. | 945 |
a based Moreover, incorporates consolidation mining realistic a the data architecture memory process on algorithm. | Moreover, the architecture incorporates a realistic memory consolidation process based on a data mining algorithm. | 946 |
However, to is domain for hard the domains, explicitly. ill-defined knowledge many define | However, for many ill-defined domains, the domain knowledge is hard to define explicitly. | 947 |
death. out-of-phase and both model modes, oscillation in-phase exhibits The oscillatory and | The model exhibits both in-phase and out-of-phase oscillatory modes, and oscillation death. | 948 |
as can oscillations. such Interactions oscillatory complex behaviours generate intermittent between modes | Interactions between oscillatory modes can generate complex behaviours such as intermittent oscillations. | 949 |
direct logic axiomatisation over We a of give first this Minspaces. | We first give a direct axiomatisation of this logic over Minspaces. | 950 |
procedure decision a a define of tableaux form We calculus. the in next | We next define a decision procedure in the form of a tableaux calculus. | 951 |
algorithms with huge data. Data now to amount able deal are efficiently mining of | Data mining algorithms are now able to efficiently deal with huge amount of data. | 952 |
patterns drawback. to be an may Post that of answer processing | Post processing of patterns may be an answer to that drawback. | 953 |
aerial of populations fly hypothetical tsetse investigated. impact on spraying The is | The hypothetical impact of aerial spraying on tsetse fly populations is investigated. | 954 |
extra while. be worth argued is to cost The | The extra cost is argued to be worth while. | 955 |
does and uracil hypothesis between not thymine. wobble discriminate The | The wobble hypothesis does not discriminate between uracil and thymine. | 956 |
the of Methylation in favor could form. uracil further stabilization keto | Methylation could favor further stabilization of uracil in the keto form. | 957 |
up pair only and keto can form adenine. is present with Thymine in but | Thymine is present in keto form only and can pair up but with adenine. | 958 |
enol can it pair. U-G is that form; why forms the Uracil easily the construct | Uracil can easily construct the enol form; that is why it forms the U-G pair. | 959 |
we implications of phenomena. findings aggregation protein of discuss the our Finally, context possible in | Finally, we discuss possible implications of our findings in the context of protein aggregation phenomena. | 960 |
XML. to new format extended networks propose represent constraint using We a | We propose a new extended format to represent constraint networks using XML. | 961 |
or constraints This to extension either intension. defined format represent allows us in in | This format allows us to represent constraints defined either in extension or in intension. | 962 |
constraints. allows global It also us reference to | It also allows us to reference global constraints. | 963 |
pancreatic functional $\beta$-cells. motif in network controlling appears The of regulatory gene the activity the | The motif appears in the gene regulatory network controlling the functional activity of pancreatic $\beta$-cells. | 964 |
appropriate model parameter exhibits hysteresis in and bistability regions. The | The model exhibits bistability and hysteresis in appropriate parameter regions. | 965 |
the the reducing region. of has the loop of negative feedback bistable effect size The | The negative feedback loop has the effect of reducing the size of the bistable region. | 966 |
the has withdrawn author been ali pourmohammad. by paper This | This paper has been withdrawn by the author ali pourmohammad. | 967 |
A it is digraph. if with its cover regular isomorphic network is | A network is regular if it is isomorphic with its cover digraph. | 968 |
work a consisted The game. developing present in plateau | The present work consisted in developing a plateau game. | 969 |
ect.) cluedo, (monopoly, traditional the ones are There | There are the traditional ones (monopoly, cluedo, ect.) | 970 |
uses partitioning The procedure, a trees. simple randomized variant RPtree k-d the regressor of | The regressor uses the RPtree partitioning procedure, a simple randomized variant of k-d trees. | 971 |
otherwise planar Mathematically, protuberances an LD as modeled were ER spherical in membrane. | Mathematically, LD were modeled as spherical protuberances in an otherwise planar ER membrane. | 972 |
we LD bud-off thermodynamically show cannot otherwise. addition, is demixing necessary In that as | In addition, we show that demixing is thermodynamically necessary as LD cannot bud-off otherwise. | 973 |
typical This below of is diameter size far experimentally the LD. yeast determined | This diameter is far below the experimentally determined size of typical yeast LD. | 974 |
the Refer to for updates. latest www.urdme.org | Refer to www.urdme.org for the latest updates. | 975 |
came small-world networks and into of architecture Recently, focus. scale-free | Recently, networks of small-world and scale-free architecture came into focus. | 976 |
are quantities a quadrupole moments dipole These the distribution. of charge and | These quantities are the dipole and quadrupole moments of a charge distribution. | 977 |
model are that to more networks of yeast. structurally similar | model networks are structurally more similar to that of yeast. | 978 |
stochastic was recently neural of formulated. at which A statistics all networks includes orders theory | A stochastic theory of neural networks which includes statistics at all orders was recently formulated. | 979 |
Each yields the equations, of level i.e. closed approximation | Each level of the approximation yields closed equations, i.e. | 980 |
use. presentations neither suitable are intended nor for Often these human | Often these presentations are neither intended nor suitable for human use. | 981 |
patterns. these for We propagation specialised two algorithms design | We design specialised propagation algorithms for these two patterns. | 982 |
inherit propagation a patterns these and constraints occurrence thus using specified algorithm. Counting directly | Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. | 983 |
copula--or "nonparanormal"--for to dimensional Gaussian show how semiparametric inference. high use a We | We show how to use a semiparametric Gaussian copula--or "nonparanormal"--for high dimensional inference. | 984 |
satisfaction solving factor constraint in an Symmetry many problems. is important | Symmetry is an important factor in solving many constraint satisfaction problems. | 985 |
of common we One type have is values. symmetric when symmetry | One common type of symmetry is when we have symmetric values. | 986 |
we to break have of In methods papers, symmetries. value studied a recent series | In a recent series of papers, we have studied methods to break value symmetries. | 987 |
computational symmetry. Our on eliminating value results identify limits | Our results identify computational limits on eliminating value symmetry. | 988 |
that general. NP-hard all For in symmetric we is instance, values prove pruning | For instance, we prove that pruning all symmetric values is NP-hard in general. | 989 |
that in value practice. symmetry can Nevertheless, show experiments broken much be | Nevertheless, experiments show that much value symmetry can be broken in practice. | 990 |
requirements which analysis. for analysis exercise necessary the Our for the domain includes are reasoner | Our analysis includes requirements for the domain reasoner which are necessary for the exercise analysis. | 991 |
This ali the paper author pourmohammad. been has by withdrawn | This paper has been withdrawn by the author ali pourmohammad. | 992 |
cost We an online of problems. estimating the present SAT solving for method | We present an online method for estimating the cost of solving SAT problems. | 993 |
trained linear gathered search. the uses method start Our of model at on data a | Our method uses a linear model trained on data gathered at the start of search. | 994 |
problems. We the random of and this show effectiveness method structured using | We show the effectiveness of this method using random and structured problems. | 995 |
be in that predictions. demonstrate made can improve to predictions later early restarts We used | We demonstrate that predictions made in early restarts can be used to improve later predictions. | 996 |
on for scenario trees. We constraint stochastic semantics provide programs based a | We provide a semantics for stochastic constraint programs based on scenario trees. | 997 |
conventional constraint can programs semantics, constraint this compile Using stochastic into programs. down (non-stochastic) we | Using this semantics, we can compile stochastic constraint programs down into conventional (non-stochastic) constraint programs. | 998 |
allows the This us exploit of to power existing constraint full solvers. | This allows us to exploit the full power of existing constraint solvers. | 999 |