The name is absent



136

Appendix A

Constructing the Hines Matrix

A.l Current Implementation

Applying finite difference schemes to the spatial derivatives involved in the cable
equation and the boundary conditions is a straightforward procedure, but care must
be taken to properly account for coupling at junctions in order to maintain an accurate
numerical solution.

The Hines ordering implies that compartments are labeled in increasing order from
most distal to most proximal on a branch, starting with the most proximal branch
and ending with the soma. The latter is measured by called a branch’s
depth, which
is defined as the number of branches it must traverse to reach the soma, including
itself. Hence the soma compartment has depth = 0, roots have depth = 1, and so
on. Without loss of generality, assume further that each branch has
N compartments
numbered 1 through
N. This gives 6 possible compartment types whose entries in
the Hines matrix we must compute:

1. Interior compartment



More intriguing information

1. Surveying the welfare state: challenges, policy development and causes of resilience
2. The name is absent
3. THE DIGITAL DIVIDE: COMPUTER USE, BASIC SKILLS AND EMPLOYMENT
4. The growing importance of risk in financial regulation
5. On the Desirability of Taxing Charitable Contributions
6. The name is absent
7. Implementation of Rule Based Algorithm for Sandhi-Vicheda Of Compound Hindi Words
8. Linking Indigenous Social Capital to a Global Economy
9. The Economics of Uncovered Interest Parity Condition for Emerging Markets: A Survey
10. Measuring Semantic Similarity by Latent Relational Analysis