Algorithm for optimising an arbitrary dendritic tree
Optimising and Adapting the Metropolis Algorithm
... • Another theorem says that the optimal increment distribution is N (0, (2.38) 2 Σ π / d), again under certain strong assumptions (though again with a fairly robust conclusion). • When certain key optimisation ...
17
Optimising Matrix Product State Simulations of Shor’s Algorithm
... Shor’s algorithm for in- teger factorisation lends itself to a particular matrix product state representation that quantifiably reduces the computational requirements for classical simula- ...Shor’s ...
9
Optimising the Volgenant–Jonker algorithm for approximating graph edit distance
... improved algorithm, but see a huge difference in the percentage of total runtime that the dominant augmentation step takes, hence we can conclude the improvements are most significant over augmenting row reduc- ...
10
Smart-Cache: Optimising Memory Accesses for Arbitrary Boundaries and Stencils on FPGAs
... configuration algorithm and transparent on-chip double buffering feature is ...for arbitrary stencils shapes and boundary conditions is—as best as we know—a novel feature of our ...
5
Optimising Tree Edit Distance with Subtrees for Textual Entailment
... ETED+ABC: this system uses the ABC algo- rithm to estimate the costs of edit single opera- tions and threshold(s) for ETED. For binary de- cision output, the chromosome is {cost of delet- ing a node, cost of inserting a ...
9
Optimising UCNS3D, a High-Order finite-Volume WENO Scheme Code for arbitrary unstructured Meshes
... reconstruction algorithm was already known as computational hotspot where 92% of the computational time has been spent with dense linear algebra operations, in particular with matrix-vector products and ...
10
Optimising drone image acquisition and analysis for mapping horticultural tree crops
... horticultural tree crop structure, as it provides both higher spatial and temporal resolution, potentially higher spectral and temporal precision, and the flexibility of operations (Zarco-Tejada et ...detecting ...
119
The dendritic cell algorithm for intrusion detection
... 6 demonstrated the application of the DCA to the detection of a single bot, to assess its performance on this novel problem area. The results indicated that the DCA was able to distinguish the bot from the normal ...
21
Invention Of Arbitrary Encryption System Using Applied Mathematical Tree Structure
... The main objective of this research work is to provide strong cryptosystem for text data. To protect privacy of data plenty of research work has done using different cryptosystem methods. To enhance the security level an ...
6
On the finding 2-(k,l)-core of a tree with arbitrary real weight
... a tree with pos/neg weights. The problem of finding a (k, l)-core of a tree with pos/neg weights is considered by Motevalli et ...an algorithm with time complexity of O(n 2 logn) for finding the (k, ...
13
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
... We assume that a shortest path P from s to t has been constructed. In the first phase, a spanning forest is constructed, where each tree in the for- est is rooted at a vertex on P with certain prop- erties. The ...
14
The deterministic Dendritic Cell Algorithm
... The Dendritic Cell Algorithm is an immune-inspired algorithm orig- inally based on the function of natural dendritic ...the algorithm is a highly stochastic ...the algorithm is ...
12
Selection criterion of stable dendritic growth at arbitrary Péclet numbers with convection
... Friedrich-Schiller-Universit¨at-Jena, Physikalisch-Astronomische Fakult¨at, 07743 Jena, Germany (Received 24 April 2013; published 7 June 2013) A free dendrite growth under forced fluid flow is analyzed for ...
5
Democratization in a passive dendritic tree: an analytical investigation
... a dendritic tree is to scale the amplitude and/or duration of the synap- tic conductance with its distance from the ...a dendritic tree with distributed exci- tatory synaptic conductances and ...
34
Democratization in a passive dendritic tree : an analytical investigation
... a dendritic tree is to scale the amplitude and/or duration of the synap- tic conductance with its distance from the ...a dendritic tree with distributed exci- tatory synaptic conductances and ...
35
How To Understand The Distributed Potential Of A Dendritic Tree
... Eric Young 5-3164 [email protected] Neurons are not a single compartment! The figures below show two snapshots of the membrane potential in a model of the dendritic tree of a Purkinje cell from the cerebellum ...
9
An extension of the Deutsch-Jozsa algorithm to arbitrary qudits
... Chapter 3 – Deutsch’s Algorithm and the Deutsch-Jozsa Algorithm Generalized to Arbitrary Qudits 3.1 Motivation As an emerging discipline, quantum computing offers the investigator many exciting ...
72
Detecting danger: the Dendritic Cell Algorithm
... 1.3.10 Accounting for Potency: Signal Processing The actual mechanisms of internal DC signal processing are vastly complex and are termed signal transduction mechanisms. For the purpose of the ab- stract model and ...
27
Dendritic Cell Algorithm with Optimised Parameters using Genetic Algorithm
... system, Dendritic Cell Algorithm (DCA) is a classification algorithm developed for the purpose of anomaly detection based on the danger theory and the functioning of human immune dendritic ...
9
Smoothed analysis of the ICP algorithm for arbitrary probability distributions
... To reconcile this gap between the practical and theoretical performance of an algorithm, Spielman and Teng developed ‘smoothed analysis’ [13]. Smoothed analysis is based on the idea that the worst-case instances ...
30