SNNAP: A Tool for Teaching Neuroscience

Simulation tools aid in learning neuroscience by providing the student with an interactive environment to carry out simulated experiments and test hypotheses. The field of neuroscience is well suited for the use of simulation tools since nerve cell signaling can be described by mathematical equations and solved by computer. Neural signaling entails the propagation of electrical current along nerve membrane and transmission to neighboring neurons through synaptic connections. Action potentials and synaptic transmission can be simulated and results displayed for visualization and analysis. The neurosimulator SNNAP (Simulator for Neural Networks and Action Potentials) is a simulation environment that provides users with editors for model building, simulator engine and visual display editor. This paper presents several modeling examples that illustrate some of the capabilities and features of SNNAP. First, the Hodgkin-Huxley (HH) model is presented and the threshold phenomenon is illustrated. Second, small neural networks are described with HH models using various synaptic connections available with SNNAP. Synaptic connections may be modulated through facilitation or depression with SNNAP. A study of vesicle pool dynamics is presented using an AMPA receptor model. Finally, a central pattern generator model of the Aplysia feeding circuit is illustrated as an example of a complex network that may be studied with SNNAP. Simulation code is provided for each case study described and tasks are suggested for further investigation.

GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions

The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper's task of selecting a subset of the submitted bids which efficiently trades off total procurement cost against expected carrier performance. To solve this bi-objective winner determination problem, we propose a Pareto-based greedy randomized adaptive search procedure (GRASP). As a post-optimizer we use a path relinking procedure which is hybridized with branch-and-bound. Several variants of this algorithm are evaluated by means of artificial test instances which comply with important real-world characteristics. The two best variants prove superior to a previously published Pareto-based evolutionary algorithm.