Sentence examples for implementations of the classical from inspiring English sources
If it does, then connectionist models are implementations of the classical LOT architecture and have little new to offer (i.e., they fail to compete with classicism, and thus connectionism does not constitute a radically new way of modeling cognition).
The aim of this paper is to show an industrial case study, where two different implementations of the classical gradient-based (GB) method are used in combination with a technique for vehicle body concept modelling to achieve a multi-objective BIW optimization of a passenger car.
Nucleation routines are governed by a novel implementation of the classical nucleation theory in a general phase-field code.
This paper proposes a fractional order implementation of the classical integral tracking scheme employed in tandem with the IRC scheme to deliver damping and tracking.
The precipitation state (in terms of volume fraction and precipitate size distribution) is modelled thanks to a recent implementation of the classical nucleation and growth theories for needle-shaped precipitates.
The resulting activity map can be viewed as a quantitative implementation of the classical Sabatier principle, which states that there is an optimum "bond strength" defining the best catalyst for a given reaction.
All simulations used the NEURON (versions 5.9 and 6.0) simulation environment [41], with an integration time step of 25 µs.We used the default NEURON implementation of the classical Hodgkin-Huxley model of the giant squid axon [42].
Our genome-wide implementation of the classical salt-fractionation method indicated that the low-salt-soluble "active" chromatin fraction is enriched for the H2A.Z replication-independent histone variant and so might be turning over during transcription (Henikoff et al. 2009).
The Supplementary Material available online gives a detailed presentation of the equations that allow O nK) implementations of the HMM classical algorithms, namely: likelihood computation (ℙ(x 1… n )), forward backward algorithm (computation of ℙ u t | x 1… n ) for each t ), Viterbi algorithm (finding the trajectory u 1… n that maximizes ℙ u 1… n | x 1… n )).
The regularizing operators are constructed on the basis of the single layer operator, and can thus be incorporated easily within any existing surface integral equation implementation for the solution of the classical CFIE.
We consider space efficient implementations of some classical applications of DFS including the problem of testing biconnectivity and 2-edge connectivity, finding cut vertices and cut edges, computing chain decomposition and st-numbering of a given undirected graph G on n vertices and m edges.
