4 resultados para Dynamic Tasks, Ecological Constraints, Cognitive Function, Computer Simulation
em Digital Peer Publishing
Resumo:
Artificial neural networks are based on computational units that resemble basic information processing properties of biological neurons in an abstract and simplified manner. Generally, these formal neurons model an input-output behaviour as it is also often used to characterize biological neurons. The neuron is treated as a black box; spatial extension and temporal dynamics present in biological neurons are most often neglected. Even though artificial neurons are simplified, they can show a variety of input-output relations, depending on the transfer functions they apply. This unit on transfer functions provides an overview of different transfer functions and offers a simulation that visualizes the input-output behaviour of an artificial neuron depending on the specific combination of transfer functions.
Resumo:
This tutorial gives a step by step explanation of how one uses experimental data to construct a biologically realistic multicompartmental model. Special emphasis is given on the many ways that this process can be imprecise. The tutorial is intended for both experimentalists who want to get into computer modeling and for computer scientists who use abstract neural network models but are curious about biological realistic modeling. The tutorial is not dependent on the use of a specific simulation engine, but rather covers the kind of data needed for constructing a model, how they are used, and potential pitfalls in the process.
Resumo:
Almost all regions of the brain receive one or more neuromodulatory inputs, and disrupting these inputs produces deficits in neuronal function. Neuromodulators act through intracellular second messenger pathways to influence the electrical properties of neurons, integration of synaptic inputs, spatio-temporal firing dynamics of neuronal networks, and, ultimately, systems behavior. Second messengers pathways consist of series of bimolecular reactions, enzymatic reactions, and diffusion. Calcium is the second messenger molecule with the most effectors, and thus is highly regulated by buffers, pumps and intracellular stores. Computational modeling provides an innovative, yet practical method to evaluate the spatial extent, time course and interaction among second messenger pathways, and the interaction of second messengers with neuron electrical properties. These processes occur both in compartments where the number of molecules are large enough to describe reactions deterministically (e.g. cell body), and in compartments where the number of molecules is small enough that reactions occur stochastically (e.g. spines). – In this tutorial, I explain how to develop models of second messenger pathways and calcium dynamics. The first part of the tutorial explains the equations used to model bimolecular reactions, enzyme reactions, calcium release channels, calcium pumps and diffusion. The second part explains some of the GENESIS, Kinetikit and Chemesis objects that implement the appropriate equations. In depth explanation of calcium and second messenger models is provided by reviewing code, both in XPP, Chemesis and Kinetikit, that implements simple models of calcium dynamics and second messenger cascades.
Resumo:
Physically-based modeling for computer animation allows to produce more realistic motions in less time without requiring the expertise of skilled animators. But, a computer animation is not only a numerical simulation based on classical mechanics since it follows a precise story-line. One common way to define aims in an animation is to add geometric constraints. There are several methods to manage these constraints within a physically-based framework. In this paper, we present an algorithm for constraints handling based on Lagrange multipliers. After few remarks on the equations of motion that we use, we present a first algorithm proposed by Platt. We show with a simple example that this method is not reliable. Our contribution consists in improving this algorithm to provide an efficient and robust method to handle simultaneous active constraints.