• Nie Znaleziono Wyników

Wywołanie okienka ShapePlot w hoc

N/A
N/A
Protected

Academic year: 2021

Share "Wywołanie okienka ShapePlot w hoc"

Copied!
5
0
0

Pełen tekst

(1)

Wywołanie okienka ShapePlot w hoc

objref ShapeWindow

proc shape(){

ShapeWindow = new PlotShape() ShapeWindow.show(0)

ShapeWindow.exec_menu("Shape Plot") ShapeWindow.scale(-1,2)

fast_flush_list.append(ShapeWindow) //adding object to list of objects whose elements are notified at every step

}

PLOT_SHAPE = 1 if (PLOT_SHAPE) { shape()

}

Wywołanie:

(2)

Interfejs graficzny

xpanel("Model parameters") //Title of a new panel

variable_domain(&IAF_tau, 0, 1e99) //domain limits for the variable xvalue("Tau (ms)","IAF_tau", 1,"settau(IAF_tau)", 0, 0 )

//”prompt”, “variable”, 0/1 – no/yes checkbox, “action”,

// 0 – button appearance , 0/1 – if true, the address of variable (pointer) is used xvalue("Connection Weight","w", 1,"weight(w)", 0, 0 )

xvalue("Tstop","tstop", 1,"", 0, 0 )

xbutton("go", "go()") //the “prompt” on the button and the “action” to execute xbutton("quit","quit()")

//xpanel() //closing command

xpanel(250,300) //optionally, position of the new panel Przykladowy interfejs graficzny do modyfikacji parametrów:

IAF.tau, CONNECTION_WEIGHT i tstop:

(3)

Interfejsy graficzne cd

Wewnatrz programu (np. moduł CreateNetwork) musi zawierac procedury weight() i settau()

IAF_tau = IAF_TAU proc settau() { local i

for i=0, NumberCells-1 { neuron[i].IAF.tau = $1 }

}

w = CONNECTION_WEIGHT proc weight() { local i

for i=0, NumberConnections-1 { CellConnection[i].weight = $1 }

}

(4)

Kontrolowanie położenia okienek

objref g1

proc plotraster() {

g1 = new Graph(0)

g1.view(tstart, 0, tstop, NumberCells, 250, 20, 300, 200) idvec.mark(g1, timevec, "|")

}

Aby umiescic okienko graficzne w okreslonym miejscu na ekranie nalezy go wywołac z argumentem ‘0’, a nastepnie użyć

polecenia .view i podac zakresy, wspolrzedne i rozmiar:

xmin, ymin, xmax, ymax, x_position, y_position, x_size, y_size.

Np. dla rasterplotu:

(5)

Rozszerzenie modelu

Siec składająca się ze 100 neuronów IAF pobudzających i 25 hamujących.

Cytaty

Powiązane dokumenty

Then we deal with a positive answer, in particular KL(ℵ n , 2), and we show that the negation of a relative of the free subset property for λ implies KL(λ, 2).. We thank

Write a program which implements an unbounded queue (a First-In-First-Out structure using sequential memory storage), aimed at storing real numbers, and a set of methods operating

Write a program which implements an unbounded vector container (using sequential memory storage) as a template structure (aimed at storing values of any type), and

We note that the work in this section allows us also to handle the case b = 3 here, but we have chosen to indicate the proof of the case b = 3 separately in the previous

denote a sequence of mutually exclusive bounded simple domains in the plane such that for each posi­.. satisfies all the requirements of Axiom

3 In a youth camp, each participant must take part in at least one of the following activities: chess, backgammon or dominoes.. Show the above information in

Since each Gaussian system with positive entropy is a direct product of a zero entropy Gaussian automorphism and a Bernoulli automorphism with infinite entropy (see e.g. [26]),

We shall combine Dowker’s example (see [8], Example 6.2.20) with Sie- klucki’s foregoing example to obtain an auxiliary space T with a clopen base and with a clopen map q H of order ≤