text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
peptide/protein structures complicated of a is with An self-assembly. of several example system aggregation levels | An example of a complicated aggregation system with several levels of structures is peptide/protein self-assembly. | 3,700 |
used Euclidean measurement. is for similarity distance | Euclidean distance is used for similarity measurement. | 3,701 |
be space. calculations But the carried a in out finite-dimensional can | But the calculations can be carried out in a finite-dimensional space. | 3,702 |
linear paid penalties based operators. is attention Particular on to differential | Particular attention is paid to penalties based on linear differential operators. | 3,703 |
In minimizer can sometimes calculate Green's functions. using the case, easily this explicitly, one | In this case, one can sometimes easily calculate the minimizer explicitly, using Green's functions. | 3,704 |
order is in In preserve enrollment to consistency. other consistent words, system mandatory | In other words, consistent enrollment is mandatory in order to preserve system consistency. | 3,705 |
assumption that process obtain are branching rare, bursty we innovations the speciations. of a Under | Under the assumption that innovations are rare, we obtain a bursty branching process of speciations. | 3,706 |
of rules determining and Lipophilicity are biological activities conformations of groups in functional interchangeably TCs. | Lipophilicity of functional groups and conformations interchangeably are determining rules in biological activities of TCs. | 3,707 |
affects complication encephalopathy memory. and a attention is that Hepatic neurological | Hepatic encephalopathy is a neurological complication that affects attention and memory. | 3,708 |
reversal in and were learning for tested rats water maze. Portacaval shunt Morris sham-operated the | Portacaval shunt and sham-operated rats were tested for reversal learning in the Morris water maze. | 3,709 |
for cytochrome were oxidase Brains histochemistry. processed | Brains were processed for cytochrome oxidase histochemistry. | 3,710 |
learning capacity the of measure dimension algorithms. is generalization fundamental Vapnik-Chervonenkis of a (VC) | Vapnik-Chervonenkis (VC) dimension is a fundamental measure of the generalization capacity of learning algorithms. | 3,711 |
hard analytically. from is impossible it or few to a apart calculate special However, cases, | However, apart from a few special cases, it is hard or impossible to calculate analytically. | 3,712 |
in contexts, some voting In may the new of process. course candidates the show up | In voting contexts, some new candidates may show up in the course of the process. | 3,713 |
for reason and our They research. clue main are | They are our clue and main reason for research. | 3,714 |
their nature Here exposing investigate barriers we of process. and these mental features the | Here we investigate these barriers and their features exposing the nature of mental process. | 3,715 |
special the structures start between We objects. from to define reflect ways relations which | We start from special structures which reflect the ways to define relations between objects. | 3,716 |
be can mental a This dynamics. called | This can be called a mental dynamics. | 3,717 |
help can us be This to optimal. more | This can help us to be more optimal. | 3,718 |
use We algebra objects. and the relation invariant nature in stay abstract of to | We use abstract algebra and stay invariant in relation to the nature of objects. | 3,719 |
Facial years. recent Expression Classification in is problem research an interesting | Facial Expression Classification is an interesting research problem in recent years. | 3,720 |
are There problem. methods a solve this lot to of | There are a lot of methods to solve this problem. | 3,721 |
preprocessing of for we region facial detection Firstly, images. in Canny local use phase, | Firstly, in preprocessing phase, we use Canny for local region detection of facial images. | 3,722 |
will (PCA). based features Component Analysis presented be Principal local Then region's on of each | Then each of local region's features will be presented based on Principal Component Analysis (PCA). | 3,723 |
Expression Network Classification. Finally, for Artificial Neural using Facial (ANN)applies | Finally, using Artificial Neural Network (ANN)applies for Facial Expression Classification. | 3,724 |
The shows of method. the feasibility our experimental result proposal | The experimental result shows the feasibility of our proposal method. | 3,725 |
dense paper including main type Our this regularizations target in is \ellp-MKL. | Our main target in this paper is dense type regularizations including \ellp-MKL. | 3,726 |
of performances compare us to of generalization types the enables various regularizations. This | This enables us to compare the generalization performances of various types of regularizations. | 3,727 |
is as presented theory by the consistent with The known T.Y. outcome | The outcome is consistent with the known theory as presented by T.Y. | 3,728 |
higher dimensions. M. and Herman in gives et.al and insights new Khachan | Herman and M. Khachan et.al and gives new insights in higher dimensions. | 3,729 |
given proposed the the data transform distances utilizes The between points. | The proposed transform utilizes the distances between the given data points. | 3,730 |
have date studied IAMs as To of spaces. submanifolds Euclidean been embedded | To date IAMs have been studied as embedded submanifolds of Euclidean spaces. | 3,731 |
exact both mechanism can The is explain not that force-velocity known. yet curves | The exact mechanism that can explain both force-velocity curves is not yet known. | 3,732 |
simulation a agent-based such an mechanism. carried to stochastic explore out We | We carried out an agent-based stochastic simulation to explore such a mechanism. | 3,733 |
to decay possibility membranes balance recurrent with and is excitation. of synapses One modes | One possibility is to balance decay modes of membranes and synapses with recurrent excitation. | 3,734 |
well-studied the we motion For task. dot random discrimination focus on concreteness, | For concreteness, we focus on the well-studied random dot motion discrimination task. | 3,735 |
robust leads mistuned. This to gains when performance becomes feedback integrators | This leads robust integrators to performance gains when feedback becomes mistuned. | 3,736 |
evolving this area. our perspective on paper This presents | This paper presents our perspective on this evolving area. | 3,737 |
have summarize results methods. We obtained that for been of these each the | We summarize the results that have been obtained for each of these methods. | 3,738 |
for given derived SDE ion kinetic explicitly the scheme. channel any We | We derived the SDE explicitly for any given ion channel kinetic scheme. | 3,739 |
this the simulation demonstrated method of efficiency MC considerable over superiority Also, DA methods. | Also, the simulation efficiency of this DA method demonstrated considerable superiority over MC methods. | 3,740 |
some do directly distances. determine to In proceed not clusters we directly cases, and the | In some cases, we proceed directly to clusters and do not directly determine the distances. | 3,741 |
We precision offer of insights on also measurement. of implications practical data | We offer insights also on practical implications of precision of data measurement. | 3,742 |
These are several well comply of with web defined processes. that composed services services | These services are composed of several web services that comply with well defined processes. | 3,743 |
method Graph based Our is on Theory. | Our method is based on Graph Theory. | 3,744 |
a the between graph. involved services through relationship the web We model semantic directed | We model the semantic relationship between the involved web services through a directed graph. | 3,745 |
related Then, creates SWDs. it a for sub-graph most the | Then, it creates a sub-graph for the most related SWDs. | 3,746 |
algorithm. returns by authorities document using and the It hubs the these HITS Finally, of | Finally, It returns the hubs and authorities of these document by using the HITS algorithm. | 3,747 |
classification We a consider binary standard problem. | We consider a standard binary classification problem. | 3,748 |
its dependence We also parameters classification margin the study of problem. on | We also study its dependence on margin parameters of the classification problem. | 3,749 |
behaviour. demands agent's an Solomonoff external identify We characterizing by on Induction principles | We identify principles characterizing Solomonoff Induction by demands on an agent's external behaviour. | 3,750 |
and consistency. Key indifference computability, time are concepts rationality, | Key concepts are rationality, computability, indifference and time consistency. | 3,751 |
case full derive we the to extensions AIXI. Furthermore, AI to discuss | Furthermore, we discuss extensions to the full AI case to derive AIXI. | 3,752 |
value can The mean but the is variance change. is second case when constant, the | The second case is when the mean value is constant, but the variance can change. | 3,753 |
denoising. idea related variation This is to total closely | This idea is closely related to total variation denoising. | 3,754 |
involved matrix and osteoclasts, resorbing are bone The cells producing osteoblasts mechanosensing bone osteocytes. | The cells involved are bone resorbing osteoclasts, bone matrix producing osteoblasts and mechanosensing osteocytes. | 3,755 |
other. consists each toggle mutually genes repress of that two A switch | A toggle switch consists of two genes that mutually repress each other. | 3,756 |
protein mRNA We high binding. monomeric numbers, and focus on abundance factor transcription low | We focus on low mRNA numbers, high protein abundance and monomeric transcription factor binding. | 3,757 |
SGIM-D a on is evaluated skill learning experiment. fishing | SGIM-D is evaluated on a fishing skill learning experiment. | 3,758 |
proposed simulation of the algorithm. study the computational A shows behavior good | A simulation study shows the good computational behavior of the proposed algorithm. | 3,759 |
a of data in application An the using on real illustrates MCA. rotation set interest | An application on a real data set illustrates the interest of using rotation in MCA. | 3,760 |
package codes "PCAmixdata". in All source are R the available | All source codes are available in the R package "PCAmixdata". | 3,761 |
accurate. regions, For approximation rectangular integration the is highly | For rectangular integration regions, the approximation is highly accurate. | 3,762 |
case of also We the to more polyhedral integration the regions. general derivations extend | We also extend the derivations to the more general case of polyhedral integration regions. | 3,763 |
yet studied and elucidate interesting non-obvious results an detail. not in of These feature EP | These results elucidate an interesting and non-obvious feature of EP not yet studied in detail. | 3,764 |
costly. screening of consuming compound plants time be of and Pharmacology active medicinal would | Pharmacology screening of active compound of medicinal plants would be time consuming and costly. | 3,765 |
for useful approaches dimension be can These reduction and selection. variable then | These approaches can then be useful for dimension reduction and variable selection. | 3,766 |
specific of numerical for variables. have developed been Several clustering methods the | Several specific methods have been developed for the clustering of numerical variables. | 3,767 |
The package developed ClustOfVar purpose. was this R for specifically | The R package ClustOfVar was specifically developed for this purpose. | 3,768 |
with principal component obtained the method. synthetic PCAMIX is This the first variable | This synthetic variable is the first principal component obtained with the PCAMIX method. | 3,769 |
suitable to clusters. also We numbers of determine in approach order propose a bootstrap | We also propose a bootstrap approach in order to determine suitable numbers of clusters. | 3,770 |
associated and We methodologies the illustrate on small the package datasets. | We illustrate the methodologies and the associated package on small datasets. | 3,771 |
the of the experiments, demonstrate Through we approach. usefulness proposed | Through experiments, we demonstrate the usefulness of the proposed approach. | 3,772 |
material. The supporting simulations is for code used distributed our R computer as | The R code used for our computer simulations is distributed as supporting material. | 3,773 |
the pool is feature objects. compute to A score used matching detected between two | A feature pool is used to compute the matching score between two detected objects. | 3,774 |
A noisy trajectory remove trajectories. filter is proposed to | A trajectory filter is proposed to remove noisy trajectories. | 3,775 |
component to inter-related. parts degree some are by that formed biological systems are Most | Most biological systems are formed by component parts that to some degree are inter-related. | 3,776 |
We selection degrees ratio signal-to-noise on of consequences of modularity varying the reconstruction. and explore | We explore the consequences of varying degrees of modularity and signal-to-noise ratio on selection reconstruction. | 3,777 |
selection our controlling improves gradients. In vastly for matrices simulations, reconstruction of noise the | In our simulations, controlling matrices for noise vastly improves the reconstruction of selection gradients. | 3,778 |
counterintuitive the analysis unravels Mean-field astrocytes of mediate model that may effects. | Mean-field analysis of the model unravels that astrocytes may mediate counterintuitive effects. | 3,779 |
explicit do are they neither reactions terms. cross-inhibition The contain enantiomeric autocatalytic nor | The reactions are neither autocatalytic nor do they contain explicit enantiomeric cross-inhibition terms. | 3,780 |
a samples come into that from sites two fall number groupings. of These | These samples come from a number of sites that fall into two groupings. | 3,781 |
types, from burials. derived samples burial The several kurgan including | The samples derived from several burial types, including kurgan burials. | 3,782 |
dynamics We analyse terms metapopulation. in individual-based, of finite an metapopulation stochastic of model a | We analyse metapopulation dynamics in terms of an individual-based, stochastic model of a finite metapopulation. | 3,783 |
brink focus the extinction. metapopulations on We on of | We focus on metapopulations on the brink of extinction. | 3,784 |
to the estimate and extinction path describe likely extinction. the to time We most | We estimate the time to extinction and describe the most likely path to extinction. | 3,785 |
Exact in intractable. slab regression linear spike model and inference priors often with the is | Exact inference in the linear regression model with spike and slab priors is often intractable. | 3,786 |
inference. propagation be approximate can (EP) used for Expectation | Expectation propagation (EP) can be used for approximate inference. | 3,787 |
As alternative, a convergent provably (PC-EP). algorithm EP we propose an | As an alternative, we propose a provably convergent EP algorithm (PC-EP). | 3,788 |
when converges, similarly. By methods both contrast, perform R-EP | By contrast, when R-EP converges, both methods perform similarly. | 3,789 |
of chaos also of the algorithm. We propagation properties marginal establish | We also establish marginal propagation of chaos properties of the algorithm. | 3,790 |
high-dimensions is of SMC-based The discussed. schemes filtering some approximate accuracy also in | The accuracy in high-dimensions of some approximate SMC-based filtering schemes is also discussed. | 3,791 |
make preprocessor agents and learning properties unsupervised a for IncSFA autonomous These generally useful robots. | These properties make IncSFA a generally useful unsupervised preprocessor for autonomous learning agents and robots. | 3,792 |
fails. It where can handle SFA cases batch | It can handle cases where batch SFA fails. | 3,793 |
Diffusion for in Catalysts and that are Channels are sense Enzymes. | Channels are Catalysts for Diffusion and in that sense are Enzymes. | 3,794 |
useful idea interpretation experiments. the of This and for design is | This idea is useful for the design and interpretation of experiments. | 3,795 |
popular approaches these for Graph-based problems. are tools | Graph-based approaches are popular tools for these problems. | 3,796 |
an construction is graph-based of aspect learning. important Graph | Graph construction is an important aspect of graph-based learning. | 3,797 |
then our justify analysis. method cut through theoretically limit We | We then theoretically justify our method through limit cut analysis. | 3,798 |
available the singularity a transformation unique of solution be However, may matrix. of because not | However, a unique solution may not be available because of the singularity of transformation matrix. | 3,799 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.