def NormalizedStrat3():
# Walk through all the lower directories
for root, dirs, files in os.walk(CSV_OUTPUT_DIR):
# We only care about directories that have files
if(len(files) != 0):
files.sort()
# The directories with files have the .csv files
# Get the pressure data from them and store in list
challengeList = []
pressureList = []
respList = []
testerName = ""
deviceName = ""
for fileName in files:
seed = int(fileName.split(":")[0])
#Only seeds above 1000 are extra long paths likely to create
#bit strings of atleast 128 bits
if( seed > 1000 ):
print fileName
with open(join(root, fileName), "rb") as csvfile:
respReader = csv.reader(csvfile)
responseStarted = False
for row in respReader:
if(responseStarted):
respX = float(row[0])
respY = float(row[1])
respList.append((respX, respY)) #Append the points as x,y tuples
pressureList.append(float(row[2]))
elif(row[0] != "ChallengeX" and row[0] != "X"):
challX = float(row[0])
challY = float(row[1])
challengeList.append((challX, challY))
testerName = row[2]
deviceName = row[3]
if(row[0] == "X" and row[1] == "Y" and row[2] == "PRESSURE"):
responseStarted = True
challengeLength = 0
for i in range(0, len(challengeList)-1):
challengeLength += distBetweenPts(challengeList[i], challengeList[i+1])
normalizedDist = challengeLength/32.0
normalizedList = []
currPt = challengeList[0]
for i in range(0, len(challengeList)-1):
currPt = challengeList[i]
nextPt = challengeList[i+1]
while(distBetweenPts(currPt, nextPt) > normalizedDist):
normalizedList.append(currPt)
currPt = calcNextPt(currPt, nextPt, normalizedDist)
normalizedList.append(challengeList[-1])
normalizedPressList = []
print len(respList)
print len(pressureList)
for normPt in normalizedList:
closestPtIndex = 0
secondClosestPtIndex = 0
closestPt = respList[0]
secondClosestPt = respList[0]
closestPtDist = distBetweenPts(normPt, closestPt)
for i in range(0, len(respList)):
if(distBetweenPts(normPt, respList[i]) <= closestPtDist):
closestPtDist = distBetweenPts(normPt, respList[i])
secondClosestPt = closestPt
secondClosestPtIndex = closestPtIndex
closestPt = respList[i]
closestPtIndex = i
secondClosestPtDist = distBetweenPts(normPt, secondClosestPt)
distBetweenClosestPts = secondClosestPtDist + closestPtDist
normPressure = (closestPtDist/distBetweenClosestPts)*pressureList[closestPtIndex] + (secondClosestPtDist/distBetweenClosestPts)*pressureList[secondClosestPtIndex] #weighted average weighted towards the closer point
normalizedPressList.append(normPressure)
#Calculate moving average n = 5 for use in arbiter
movingAvg5 = simpleMovingAverage(normalizedPressList, 5)
#Build the bit string and convert it to a bytearray() type for writing
#to a binary file
bitString = ""
for i in range(0, len(normalizedPressList)):
bitString += str(arbiter(normalizedPressList[i], movingAvg5[i]))
byteArr = convBitStrToByteArr(bitString)
#Copy the directory structure of the OutputCSVs folder
deviceName = basename(dirname(root))
testerName = basename(root)
#If the directory doesn't exist make it
att_path = os.path.join(GENERATED_OUTPUT_DIR, "NormalizedStrat3", deviceName, testerName, fileName + ".bin")
if not os.path.exists(os.path.dirname(att_path)):
os.makedirs(os.path.dirname(att_path))
#Write binary file
with open(att_path, "wb") as outputFile:
outputFile.write(byteArr)
pressureList = []
respList = []
challengeList = []
testerName = ""
deviceName = ""
def NormalizedStrat2():
# Walk through all the lower directories
for root, dirs, files in os.walk(CSV_OUTPUT_DIR):
# We only care about directories that have files
if(len(files) != 0):
files.sort()
# The directories with files have the .csv files
# Get the pressure data from them and store in list
challengeList = []
pressureList = []
respList = []
testerName = ""
deviceName = ""
for fileName in files:
seed = int(fileName.split(":")[0])
#Only seeds above 1000 are extra long paths likely to create
#bit strings of atleast 128 bits
if( seed > 1000 ):
print fileName
with open(join(root, fileName), "rb") as csvfile:
respReader = csv.reader(csvfile)
responseStarted = False
for row in respReader:
if(responseStarted):
respX = float(row[0])
respY = float(row[1])
respList.append((respX, respY)) #Append the points as x,y tuples
pressureList.append(float(row[2]))
elif(row[0] != "ChallengeX" and row[0] != "X"):
challX = float(row[0])
challY = float(row[1])
challengeList.append((challX, challY))
testerName = row[2]
deviceName = row[3]
if(row[0] == "X" and row[1] == "Y" and row[2] == "PRESSURE"):
responseStarted = True
challengeLength = 0
for i in range(0, len(challengeList)-1):
challengeLength += distBetweenPts(challengeList[i], challengeList[i+1])
normalizedDist = challengeLength/32.0
normalizedList = []
currPt = challengeList[0]
for i in range(0, len(challengeList)-1):
currPt = challengeList[i]
nextPt = challengeList[i+1]
while(distBetweenPts(currPt, nextPt) > normalizedDist):
normalizedList.append(currPt)
currPt = calcNextPt(currPt, nextPt, normalizedDist)
normalizedList.append(challengeList[-1])
normalizedPressList = []
print len(respList)
print len(pressureList)
lastPtIndex = 0
for normPt in normalizedList:
lastIndexChanged = False
closestPt = respList[lastPtIndex]
closestPtDist = distBetweenPts(normPt, closestPt)
if(len(respList[lastPtIndex:lastPtIndex+100]) < 100):
lastPtIndex = len(respList) - 100 #I always want to ensure we atleast search through 20 points
for i in range(0, len(respList)):#lastPtIndex+100): #The assumption is the next closest point won't be 20 points away from the last one. This reduces search time and prevents the situation of two intersecting pressure lines mismatching
if(distBetweenPts(normPt, respList[i]) <= closestPtDist):
closestPtDist = distBetweenPts(normPt, respList[i])
closestPt = respList[i]
if(i != lastPtIndex):
lastPtIndex = i
lastIndexChanged = True
print "%s, lastPtInd = %d, normPt = %s, closestPt = %s, dist = %f" % (lastIndexChanged, lastPtIndex, normPt, closestPt, closestPtDist)
normalizedPressList.append(pressureList[lastPtIndex])
if not lastIndexChanged:
lastPtIndex = lastPtIndex+1
#Calculate moving average n = 5 for use in arbiter
movingAvg5 = simpleMovingAverage(normalizedPressList, 5)
#Build the bit string and convert it to a bytearray() type for writing
#to a binary file
bitString = ""
for i in range(0, len(normalizedPressList)):
bitString += str(arbiter(normalizedPressList[i], movingAvg5[i]))
byteArr = convBitStrToByteArr(bitString)
#Copy the directory structure of the OutputCSVs folder
deviceName = basename(dirname(root))
testerName = basename(root)
#If the directory doesn't exist make it
att_path = os.path.join(GENERATED_OUTPUT_DIR, "NormalizedStrat2", deviceName, testerName, fileName + ".bin")
if not os.path.exists(os.path.dirname(att_path)):
os.makedirs(os.path.dirname(att_path))
#Write binary file
with open(att_path, "wb") as outputFile:
outputFile.write(byteArr)
pressureList = []
respList = []
challengeList = []
testerName = ""
deviceName = ""
