Week 7 Review: 7/16 - 7/20

By
In this week much effort was put into being able to compare average window throughput and degree of change. One challenge to overcome was how to scale the throughput data. To best understand the distribution of the average throughput's for every window, we made a histogram using the unscaled throughputs.


It was evident that the magnitudes of the very high throughput dwarfed the small throughput by at least 10^2. Two methods were considered to scale the throughput; apply the reciprocal operation, (^-1), or apply a logarithmic function. The  logarithmic function most evenly represents small throughput and high throughput.

After choosing our scaling method we graphed the log(throughput) with the degree of change over time. From these figures, it seems there is no discernible relationship between degree of change and log(throughput). This was a big step back as Alina and I had to rethink an approach to this project.




2

Comments

Post a Comment

Popular posts from this blog

Week 10 Review: 9/6 - 9/10

By
Image
I spent all my time this week preparing for the end of the internship. I submitted a poster for admittance to the Association for Computing Machinery poster competition to be held at the Super Computing Conference in Dallas, Texas this year. Beyond that, I spent a lot of time organizing files and finishing mandatory assignments. On Monday I submitted a minute long video to a small competition for giving elevator pitches and got an honorable mention award on Thursday, which was a tie between 5th and 6th place out of 10. Not bad for one hour of recording at midnight. Thursday was the poster session for all the interns and it went fairly well. The expense of organizing the event probably wasn't worth the amount of visitors that came to participate, though. I will say that I was one of the few interns that presented their poster to Michael Stewart Witherell, the director of the lab! Now that was cool! The research poster presented at the final poster session There was a lot plan
Read more

Research update 3 ~Alex

By
Image
I was looking over what I posted last time and actually couldn't believe how much we have accomplished in just one week. I also realized I never explained how Optimal Matching is. Optimal Matching to a non-Euclidean distance metric which can be used on large sequences of data. It works through a series of substitutions; the less substitution it takes to match two series the "further apart" they are.  Determining the substitution cost for missing values can be tricky especially for missing values due to the alignment of data. Too high of a cost can cause artificial clusters to form by the alignment variable, and too little can under represent possible similarities in the missing data. So determining the optimal cost for missing values, "NA cost", will be an important part of our analysis. Since I last posted there have been good times and bad times. Monday and Tuesday were good days. We worked through the methods used in the last publication on our data set to ge
Read more