Commit 7419e796 authored by Orkun Şensebat's avatar Orkun Şensebat
Browse files

Working version

parent 5d726908
Pipeline #462509 passed with stage
in 49 seconds
......@@ -56,13 +56,13 @@ for ipsi0 in range(0, nsteps): # loop over different settings of EOM1
count[j1,j2,1,ipsi0] = count[j1,j2,1,ipsi0] + 1 # Malus law model + time window
# data analysis
tot = np.zeros(shape=(nsteps,2), dtype=np.int16)
E12 = np.zeros(shape=(nsteps,2), dtype=np.int16)
E1 = np.zeros(shape=(nsteps,2), dtype=np.int16)
E2 = np.zeros(shape=(nsteps,2), dtype=np.int16)
tot = np.zeros(shape=(2, nsteps), dtype=np.int16)
E12 = np.zeros(shape=(2, nsteps), dtype=np.int16)
E1 = np.zeros(shape=(2, nsteps), dtype=np.int16)
E2 = np.zeros(shape=(2, nsteps), dtype=np.int16)
for j in range(0, nsteps):
for i in range(0, 1): # i = 0 <==> no time window, i = 1 <=> use time coincidences
tot[i,j] = sum(count[:,:,i,j])
tot[i,j] = np.sum(count[:,:,i,j])
E12[i,j] = count[0,0,i,j] + count[1,1,i,j] - count[1,0,i,j] - count[0,1,i,j]
E1[i,j] = count[0,0,i,j] + count[0,1,i,j] - count[1,1,i,j] - count[1,0,i,j]
E2[i,j] = count[0,0,i,j] + count[1,0,i,j] - count[1,1,i,j] - count[0,1,i,j]
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment