| ID |
Date |
Author |
Subject |
|
58
|
Fri May 29 17:36:04 2020 |
Alex Machtay | Daily Update |
| Name |
Today's Update |
Plans for Monday |
| Alex M |
I wasn't available in the morning. I met with Amy and Alex P around 1 to talk about how to use the AraSim function for throwing the same neutrinos to search for bugs in the loop. We want to compare three types of antennas we've evolved to the actual ARA bicone: a small antenna with 0 effective volume, a small antenna with a normal effective volume, and a normal antenna with a normal effective volume.
I also spoke with Amy and Julie about the paper and worked on getting the paper in the right format, but I still can't get the citations to work.
|
I won't be available til late Monday morning, but I'll try to talk to Alex P about using the AraSim function and looking for bugs. Julie and I are supposed to meet at 1 with Ben to discuss him joining, and then I think we have a meeting at 1:30. |
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
|
|
|
|
65
|
Tue Jun 9 15:00:09 2020 |
Alex Machtay | Daily Update 6/9/20 |
| Name |
Today's Update |
Plams for Tomorrow |
| Alex M |
Alex P and I kept working on finding differences in AraSim between antennas. We still haven't found any and we've checked: electric field, maximum peak voltage, effective height, threshold (factor and offset), and the fft (and maybe more I'm forgetting). I'm not sure where to go from here in investigating AraSim.
I tried running the loop with a smaller grid size to see if we could get some more comparisons, but I ran into errors that I need to resolve.
Julie and I resolved some comments on the paper.
|
|
| Alex P |
Went through more of AraSim after more of Amy's comments. Found V_forfft and they were the same between individuals and then looked for other information to compare but what is interesting is that with the smaller grid spacing on the smaller antennas we have two generations with the exact same dimensions and the smaller grid spacing had lower vEff across the board, such as the larger grid spacing on small antennas had 4 individuals with a vEffective above 5 but the small grid spacing didn't have any that got above 5. So it is possible that the zero vEffective for the small antennas wasn't an error but that the larger fitness scores were the error. |
Plan is to continue to look into how grid spacing affects the vEffectives especially of smaller antennas and also make sure the grid spacing we were using for the larger antenna is appropriate and then look into the automatic grid spacing whether we can do it within XF or by having it automatically update the Xmacro based off the lengths |
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
|
|
|
|
66
|
Wed Jun 10 15:47:43 2020 |
Alex Machtay | Daily Update 6/10/20 |
| Name |
Today's Update |
Plans for Tomorrow |
| Alex M |
I wasn't available for most of the day, but I jumped onto the meeting to help Alex P continue looking for the problem with the effective volumes. Amy asked us to investigate the phase responses coming out of XF. I posted the plots in the drop box--see the text below this table for more details. |
I think we need to try a run of XF with variable grid spacings so that we can put in the same individuals with increasingly small grid spacings and get a clear view of how that affects the gain/phase vs frequency. |
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
Continued working on the Roulette algorithm all the function definitions, constants and most of the main function are complete aside from parts that pertain to the genes of the paperclip antennas. |
If all goes well, I hope to find the gene parameters used in the paperclip tournament algorithm and then implement those into the work I did today and finish the roulette algorithm completely. If I complete that I plan on testing to make sure everything is working properly before merging onto the main development branch. |
For the phase vs frequency plots, see this link: https://www.dropbox.com/home/GP_Antennas/Updates/Phase%20vs%20Frequency%20plots .The plots show the average phase vs frequency for all 10 individuals in one generation of a run. The names of the plot files correspond to which run they come from.The runs which were examined were: XF_Data_Test, Grid_Space_Test, and Ryan_test_run3. They were chosen because they provide use with different antenna, grid spacing, and effective volume data.
The plot for XF_Data_Test is named p_vs_f_XFDT.png. The plot for Grid_Space_Test is named p_vs_f_GST.png. The plot for Ryan_test_run3 is named p_vs_f_Rtr3.png.
- XF_Data_Test a grid spacing of 0.1 cm. The antennas in generation 0 were large, but it evolved to make small antennas in generation 5, which is what the phase plot comes from. Individuals 7 and 10 had effective volumes of 0, while the remaining effective volumes were large.
- Grid_Space_Test used a grid spacing of 0.01 cm. The antennas in generation 0 were small, which is where the phase plot comes from. None of the individuals had 0 effective volume, but overall the effective volumes were lower than in the similarly sized antennas in generation 5 of XF_Data_Test.
- Ryan_test_run3 used a grid spacing of 0.1 cm. The antennas in generation 0, which is where the plot is from, were large and all had similar effective volumes to the actual bicone.
There are two things we noticed about these plots. First, they seem very noisy at low frequencies--they don't have much of a nice pattern here (actually, XF_Data_Test shows generally high phases at low frequencies that decrease with frequency up until around 200 MHz). The other detail we noticed is the periodic behavior of the average phase once it settles down beyond low frequencies. We don't know why this would occur. It's also worth noting that the phase diverge seemingly randomly at the last frequency--we assumed this was similar to how the phase is always wild at theta = 0 and theta = 360 in the .uan files. |
|
70
|
Wed Jun 17 17:21:16 2020 |
Alex Machtay | Daily Update 6/17/20 |
| Name |
Update for Today |
Plans for tomorrow |
| Alex M |
Worked more with Alex P on AraSim. We've found the cause of the low effective volumes. The function GainToHeight in Report.cc uses another function called GetGain_1D_OutZero in Detector.cc. The problem is that for some small individuals, we get that the output from GetGain_1D_OutZero is negative, which leads to -nan values from GainToHeight because it takes the square root of the negative values from GetGain_1D_OutZero. We aren't quite sure *why* we're getting those negative values (we know which variables and operations are giving them, but not why they're so different for some small individuals), but we think a solution is to set any negative output from GetGain_1D_OutZero to just be 0, since they're all lower than the lowest frequency in the band of interest anyway. |
We can implement the change to fix these effective volumes. I'm still concerned that we're getting high effective volumes from this, when I would have expected the resolution to have decreased effective volumes for all of the small antennas. We should also be testing this with the actual Bicone to see how it changes that effective volume. |
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
Possibly made progress with the roulette algorithm for paperclips. However I will not know for sure until I fix the syntax errors in the code ( which seems to be largely just me mistyping something up to this point). |
fix the errors in roulette.cpp and make sure the output is desired. Fingers crossed. |
|
|
72
|
Fri Jun 19 16:27:53 2020 |
Alex Machtay | Daily Update 6/19/20 |
| Name |
Today's Update |
Plans for Monday |
| Alex M |
Ran the loop with the same individuals in each "generation" to test how decreasing the grid size would affect the effective volume. Using individuals with lengths of 5cm, I startde with a grid spacing of 0.01 cm and kept cutting down by a factor of 2. I'm down to 0.00125 cm right now. Once I find where the effective volumes stop decreasing, I'll do a binary search for what the optimal grid spacing is for that size. |
I'll try doing the same thing that I'm doing for small antennas for large ones to see what the optimal grid size is there, but I think ultimately we're going to want to compare to the progrid to see if XF optimizes better. Amy came up with an idea for finding a function for what the grid spacing should be at a given length, so we'll try to compare that to the progrid. Meaning I'll spend Monday looking through more XF scripting while the large antennas run. |
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
|
|
|
|
231
|
Wed Jul 12 21:30:56 2023 |
Alex Machtay | Zoom training on XF 07/12/23 | Recording of training on XFdtd by Alex Machtay on July 12, 2023.
https://osu.zoom.us/rec/share/FVKiTcQrRh8NLNYJADwugy0H2VjDo8ZlBsH16sJAGv2JINNwxxzyNfo5ueqVgOTO._XErF57Kz8KOM3a5
This link will expire in 120 days so note that we need to post a permanent recording.
Here's the GitHub repository with examples of Xmacros: https://github.com/Machtay/XFdtd_Scripts |
|
69
|
Tue Jun 16 16:10:52 2020 |
Alex M | Daily Update 6/16/20 |
| Name |
Update for today |
Plans for Tomorrow |
| Alex M |
Continued working to find the AraSim error. We think we're very close to finding where the difference between the two individuals (one with nonzero effective volume, one with 0) is arising. We've pinned it down to a series of if statements around line 952 of Report.cc. We should be able to piece it apart tomorrow. |
Continue working on AraSim to find the error we think it in that if statement. |
| Alex P |
|
|
| Eliot |
Tried to run a couple tests of asymmetric bicone. Finished up on the git codecademy. Getting close to being ready for merge. |
Test runs, meeting, hopefully develop new plans. |
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
|
|
|
|
76
|
Fri Jun 26 16:13:18 2020 |
Alex M | Daily Update |
| Name |
Today's Update |
Plans for Monday |
| Alex M |
Worked to run the loop with Alex P to test a smaller initial mean and standard deviation of the opening angle. Worked some more on the paper too--I fixed some citations issues (and found some good ones to add) but the references are still spilling into the margins and off the page. |
I'm going to look for where the 3D gain plots in XF for small antennas with different cone separations start to converge so that we can figure out what length we want to set as a cut off minimum to stop them from evolving to be so small. |
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Ryan |
|
|
| Evelyn |
(Finally) got Code Academy to work on my browser, started on the git tutotial |
Get as far into the git tutorial as I can |
| Ben |
|
|
| Ethan |
|
|
|
|
78
|
Tue Jun 30 17:12:32 2020 |
Alex M | Daily Update 6/30/20 |
| Name |
Update for Today |
Plans for Tomorrow |
| Alex M |
Continued looking in XF for why the frequency where two antennas separated by a small amount give the same gain. I made a script which plots the gain at each frequency for a chosen number of individuals at a specific polar angle and used it on two antennas, one with a separation of 0.01 cm and one with a separation of 0.005 cm. The plots look similar, but there is some difference--see the genstudents slack. |
I'll continue to work on figuring out the frequency where these antennas start to give the same gain. Our ultimate goal is to find a minimum length for the antennas to cut off at so that we don't evolve antennas that are too small. |
| Alex P |
|
|
| Eliot |
Made little progress on the separation gene throughout the loop, however we know where all we need to make changes(I think). |
Should be able to make significant strides in regard to separation throughout the loop(ie plotting, fitness function, etc). Hopefully can also begin testing and debugging. |
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
|
|
| Ben |
|
|
| Ethan |
|
|
|
|
79
|
Wed Jul 1 16:18:35 2020 |
Alex M | Daily Update 7/1/20 |
| Name |
Today's Update |
Plans for Tomorrow |
| Alex M |
Worked to make the frequency plots up to ~2.5 GHz. Amy said we should put a cut off for the length of the antennas based on the minimum frequency, but right now I'm not sure how to find what that minimum length should be based on the frequency (we should be using the lowest frequency for this calculation though, since it corresponds to the highest minimum length). |
I'll keep looking at how to figure out the minimum length and implement it into the loop. |
| Alex P |
|
|
| Eliot |
Implemented the asymmetric radius and separation parameter throughout the rest of the loop. Began a first test. |
Will check on and fix any errors and either tonight or tomorrow do a run for Alex to see about length convergence. |
| Leo |
|
|
| Evelyn |
Continued working on code academy, got about 3/4 of the way done |
Try to finish the code academy class before my free trial runs out! |
| Ryan |
Fixed the issues in the roulette function from Monday and integrated it into the rest of the code. seems to be running fine so far. |
Next step is to code in a user input for how many of ten individuals get selected by tournament vs roulette. Once this is complete I will try to run some tests and probably try to have the results output to a file to save results for comparisons. |
| Ben |
|
|
| Ethan |
|
|
|
|
82
|
Mon Jul 6 16:49:21 2020 |
Alex M | Daily Update |
| Name |
Update for Today |
Plans for Tomorrow |
| Alex M |
Fixed up a few more errors in the new roulette algorithm with the length cut. Started a run to test the loop.
Edited and added a few things to the paper.
|
My goal is to get a few generations done over night to look at in the morning. If it looks like things are working out, we're going to go ahead and start the process of merging (by adding our edits in to the database version fitst, then Eliot and Leo's asymmetric version, then merging on Wednesday hopefully). |
| Alex P |
Worked with Alex M to have our length test run and also helped ben with an issue with his code when submitted as a job |
Look at run in the morning and if it is good start merging and continuing to test the database feature on a variable amount of genes |
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
Continued refining the Roulette function in Paperclips. Now negative or zero fitness scores cannot be passed along and the roulette can be isolated from algorithm 1 in the code. |
For now, I am continuing to have the last two algorithms mutate for the rest of the individuals but am planning to write in the roulette to create new individuals that are mutated from the chosen. Once I complete this, I plan of coding in a way for user input to decide how many individuals are sent to each algorithm for selection and mutation. |
| Ben |
|
|
| Ethan |
|
|
|
|
85
|
Thu Jul 9 16:54:27 2020 |
Alex M | Daily Update 7/9/20 |
| Name |
Update |
Plans for Tomorrow |
| Alex M |
Finished running the loop for 15 generations. The last plots are on Dropbox under Length_Cutoff_Test_3. There are three things to fix before running this version of the loop again. See below the table.
We started running the next step, which is the database version.
Julie, Ben, Ethan, and I all met to talk about AREA. We started going through the code to understand it, but we're stuck because we don't know if AraSim Lite is actually in the directory or not.
I started rewriting the AREA section.
|
I'll keep the run going, but I might have to stop it and look for bugs if the evolution doesn't track with the previous run. We named this one Data_Base_Test_7_9.
|
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
|
|
| Ben |
|
|
| Ethan |
|
|
Three things to change before doing the next symmetric run (w/o database):
1. Change how the mutation is done. We have at least a partial solution to this--the standard deviations were all 1 due to type errors in c++. We already have a fix for this.
2. The bicone separation distance was too small (0.05 cm). We should increase it to 2-3 cm to represent an actual buildable bicone.
3. We kept the random number seeds in. This isn't a bug, but it's something we need to remember to change before we run this again. |
|
86
|
Fri Jul 10 16:35:26 2020 |
Alex M | Daily Update 7/10/20 |
| Name |
Update |
Plans for Monday |
| Alex M |
Yesterday we started a run of the database version of the loop. The goal was to use it to replicate the results from the run we finished yesterday using the same parameters (NPOP=8, SEEDS=10, bicone separation = 0.05 cm). We initially ran into problems with the databse which we fixed this morning. We successfully completed the 0th generation, but then the .uan files for the next generation weren't created properly. Alex and I will try to resolve this. Amy suggested we only need to run 6-7 generations to confirm that we get the same results as from the previous run. The 0th generation agreed with the 0th generation of the previous run (in terms of DNA; the effective volume/fitness score plots looked similar, but there is slight room for noise in AraSim so the exact values are slightly different; but overall they look very similar). I also confirmed that the generation DNA is the same in generation 1 of the current database run as in the previous run.
The name of this run is Data_Base_Test_7_10.
The name of the previous run we are comparing against is Length_Cutoff_Test_3.
|
The top priority right now needs to be with fixing the error in the database version that is causing the uan files to be made incorrectly. Once that is fixed, we can continue the run and confirm that we get the same results After that, we'll have Eliot and Leo run their version using the same parameters to confirm that they get the same results as the previous two runs. From there, we'll merge the branches and begin a real run.
The first real run will use NPOP=8, 3 dimensions (LRT), a separation distance of 3 cm, and will run for up to 15 generations. We'll also fix the issue of the mutation standard deviation (see yesterday's update for the three differences between our current runs and the future real runs).
Our goal is to get as much real data as possible next week. I'm confident that we can have at least one with 3 dimensions (LRT) done by next Friday (we'll shoot for 15 generations, but if it seems to converge between 10-15 we can stop it).
If we can finish that run, we can start another run using 4 dimensions, where we add an option to make the bicone assymetric in length (L1L2RT). These are the runs we're hoping to use in the paper.
|
| Alex P |
|
|
| Eliot |
|
|
| Leo |
Today we looked at the results of our last run. This run consisted of 8 individuals and was set at 20 generations, but we just wanted to see how far it would evolve. We noticed that the error came from LRTS.py when we need to reshape the arrays from gensData.py in order to plot them. The error said that the array couldn't be reshaped because the new array's dimensions were too small. After digging around and rerunning with past save states, we were thinking that the issue wasn't with the code, but was actually an issue with generation the loop said it was on. For instance if we were on gen 5, LRTS thought we were on 4. Eliot was pretty sure this was because we had been interupted during part of our run, so Leo gave him the benefit of the doubt and decided to run again. This time we only ran 3 individuals up to the 1st generation, just to make sure the plots were working. Leo was running, making sure not to have any interuptions, and indeed all the plotting softwares worked. So, to the best of our knowledge our version of the loop is ready to go. |
Next week we are just waiting for the Alexs to finish up with their testing so we can start merging. We didn't have any plans to work on outside of that. |
| Evelyn |
|
|
| Ryan |
Finished the crossover function for Paperclips and ran a few tests for the roulette + crossover. Tests seem to show that the paperclips quickly (between 3-5 generations ) converge to become the same paperclip and fitness scores (determined by z-curl) dropped off after the second generation. This is most likely due to the fact that currently there is no form of gene mutations written into the crossover function for repopulation and so the angles the segments can have are locked from the first selection. However, I am not 100% certain on this and there could just be a hidden error somewhere as at times in some (not all ) of the tests I did there were times where the roulette function passed many of the same paperclip to the next generation, therefore decreasing the size of the gene pool. I need to do further tests to be certain of one or the other but otherwise, everything seems to be working as intended. |
The next step I plan on taking is creating a mutation function in effort to make the gene pool larger. It is likely that I will look at the bicone's roulette program to model this mutation but I am considering writing a simple one first just to run tests on the effect on the diversity. After this step is complete, I will move on to creating a function that is able to send certain amounts of the population to the tournament and the rest to roulette to see what mix gives the best results. I also as a pre-step to this may take the existing algorithms in paperclips and re-write them as functions rather than loops in main to make the passing of different parts easier and faster. |
| Ben |
|
|
| Ethan |
Continued documenting AREA project in google doc. Worked with Ben on getting AraSim running and fixing errors. |
Meeting with Ben to continue on AREA project. We may try to get AraSim run the children in parallel to make it go faster as it takes a very large amount of time currently. |
|
|
Draft
|
Mon Jul 13 15:34:40 2020 |
Alex M | Daily Update 7/13/20 |
| Name |
Update |
Plans for Tomorrow |
| Alex M |
Alex and I continued running the loop for the database test. We ran into an error over the weekend that was affecting generations after gen 0. Alex fixed it this morning and continued the run.
The goal of this run is to test the database. We are comparing it to the previous run we did last week to make sure that we get the same individuals. We're using the same parameters as the previous run: NPOP of 8, separation distance of 0.05 cm, and the same roulette algorithm (AKA the same seeds). In principle we should generate the same DNA for the individuals.
Starting in generation 2, we have a divergence--one of the individuals is different from generation 2 of the previous run. We think this is because there is noise in AraSim (I don't think we can turn the noise off when we're using the effective volume). This makes the probabilities of choosing each individual different and allows different ones to be chosen even though the random number being selected is the same. Oveall it looks ok and we're going to keep the run going to see if it converges to the same individuals as the previous run after a few more generations.
I also wrote a bit in the paper. I took a look at the paper Amy sent on the effective volumes to try to understand it better. I think I understand it, but I'm trying to see how the equation we used in AREA in the proceeding is related (what the weights represent).
|
We'll try finishing up this run and doing Eliot and Leo's run. If we can get results fast, we can start merging. Our intention is to start a real run on Wednesday. That would likely take ~1.5 days. |
| Alex P |
I made a fix to the database over the weekend when I noticed it was incorrectly counting the array indexes for counting failures. And then I found an error in our output.xmacro generation when making one for the database with the simulation number fix and that xmacro wasn't using the right bounds. We got the database version working through multiple generations. On the second generation the individuals matched exactly to our previous run except one individual. Looking at the fitness scores of the previous run, the parent individual in the previous generation had a fitness score of .18 compared to 4's of other parents, so it's reasonable that it wouldn't get picked from another run of the algorithm. While the GA is seeded so that it makes the same changes when it picks the same parent individuals, the fitness scores vary slightly between these two runs which alter how the parent individuals get picked especially when it comes to smaller fitness scores like this.
Also fixed an issue on Eliot and Leo's copy of AraSim, the extrapolation issue we found earlier hadn't been implemented on their branch so to make sure all the tests before merging were accurate we made that change.
The name of this run is Data_Base_Test_7_10.
The name of the previous run we are comparing against is Length_Cutoff_Test_3.
|
Continue running this overnight to get results and hopefully start merging tomorrow or at least start the process of setting up for the merge and finishing up any of these runs. |
| Eliot |
Began a final test run with constant separation to ensure 2 chromosome loop is working before we merge. Stopped during gen 0 to implement progrid in arasim. Thanks Alex M! Continued the run from just before arasim. Had very slow progress due to bad wifi connection. I kept getting kicked off OSC! So far everything looks good but wifi made for a shotty test at best. Name is FERSTL_20200713_PREMERGE_TEST. Lastly, commited one last time before we merge. Had some issues with that as always but believe I have it worked out. |
Will try to run a couple more gens on that run and begin merging with the Alexs. |
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
Created a temporary mutation function to test to see if the convergence problem from Friday would be resolved. For the most part, it did resolve the problem and the function has not converged onto a single paperclip and the fitness scored being produced are higher than before. However, I noticed that in test runs with on average greater than ten individuals (usually) the individuals being chosen are the same every run regardless of fitness scores and it seems to be causing the scores to stall out. for example in a run of 100 generations the 90th-100th generations would only pick the 0th and 1st individual for all ten chosen. Even when seeding the random number generator, this appears to be happening and I am not sure why. Some runs with higher chances of mutations seemed to have this effect happen later than ones with low mutation chance but so far this just seems like a correlation and not causation. |
Fix the aforementioned issue. Then, rework the mutation function to more closely model the one in bicone's roulette algorithm. |
| Ben |
|
|
| Ethan |
|
|
|
|
90
|
Fri Jul 17 18:09:16 2020 |
Alex M | Daily Update 7/17/20 |
| Name |
Update |
Plans for Monday |
| Alex M |
We may have found the error in the asymmetric bicone. It appears there may have been two problems. First, the setup for the simulation_PEC.xmacro script in the asymmetric version appears to have been slightly different in that the positions of the cones, relative to the positions of the coordinate systems, are different from in the other versions of the loop. This was giving different uan and gain files than the previous runs did. We fixed this, but it revealed another potential issue: in order to evolve the separation distance, we need to make it so that the coordinate systems use the separation genes. This wasn't implemented in the asymmetric version, so there would have always been a disparity in the position of the cones relative to their coordinate systems when compared to the database version of the simulation_PEC.xmacro. I have a work around for when we don't evolve the separation distance, but if we want to evolve it we need to change this script.
Second, the version of Report.cc in AraSim on Eliot's user differed from the one in the database version. The other files agreed, so I copied our version into his directory and started a run with that. It's running now and should take ~1 hour before I can see if this has fully fixed the issue.
|
I might be out on Monday, but my main goal for next week is to see if the fixes we implemented today resolve the differences in effective volumes and evolved parameters. Once we have them in agreement, we can start a real run on the database version of the loop to get symmetric data for the paper. While that happens, we'll need to try fixing the asymmetric simulation_PEC script so that it can use the separation distances properly. Then we can test that again using those separation distance variables (I used a hardcoded value) to make sure we get correct results. After that we can merge the asymmetric branch with the database branch and then the database branch with master and get data for the asymmetric version of the loop. |
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
|
|
| Ben |
|
|
| Ethan |
|
|
|
|
91
|
Mon Jul 20 17:01:35 2020 |
Alex M | Daily Update 7/20/20 |
| Name |
Update |
Plans for tomorrow |
| Alex M |
The arasim jobs I submitted over the weekend kept failing. I've been looking for the cause but I can't pinpoint it right now. The issue arose on Friday when I overwrote the version of Report.cc on Eliot's user with the one we have on the databse branch (but I don't think there were realy differences aside from comments). Before I had done this, we were getting effective volumes that differed from the ones we got on the database branch. Now, the araSim jobs are just failing after 5 seconds of running. And now I'm getting an error when I try to recompile AraSim (I might need Eliot to do this?).
I tried getting an interactive job so I could confirm that things are still working on the database branch, but I couldn't get it because it was blocked. I think that was because we had too many concurrent jobs running, which has happened a couple times over the past week-week and a half or so.
|
I need to track down why these AraSim jobs are failing. Besides maybe needing Eliot to make AraSim, one difference I noticed is that it appears we are sourcing Lauren's version of ANITA build tools rather than the one on the shared space. But I couldn't test this because I need to recompile AraSim. |
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
|
|
| Ben |
|
|
| Ethan |
|
|
|
|
92
|
Tue Jul 21 17:01:58 2020 |
Alex M | Daily Update 7/21/20 |
| Name |
Update |
Plans for tomorrow |
| Alex M |
I replaced AraSim on Eliot's user with the one we have on the shared space since I wasn't able to compile his yesterday. It compiled correctly and I ran the loop but got the same results from last week (effective volumes that differed from the ones we got in the original and database test runs). I found one potential error in the seed we were passing to AraSim from the loop, so I'm currently running with that fix. I'm hopeful, but not convinved it will fix things because the setup.txt files on each version of AraSim looked the same before I made this fix. Regardless of whether or not it fixes the problem, it was a problem so it was important to run with that fix. This also gives me another thing to add to the list of changes to make before doing a real run. You can find the list below. |
I'll continue this run for 4-5 generations if it looks like it's working just to confirm that we're getting agreement with the previous runs. If it agrees, I can turn my attention to either merging or doing a real run. I can do a real run without merging, but it depends on if Amy wants me to merge first or not. Eliot gave me his account info for OSC and github so I should be able to merge correctly (hopefully I can meet with Julie over this so we can make sure we don't have a problem) but it might take me some time to resolve the conflicts. |
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
Worked on rewriting certain parts of the paperclips code so that it runs better. |
Fix the bugs in the code. |
| Ben |
|
|
| Ethan |
|
|
Here's the list of changes to make when doing a real run (undo some of these when doing a test run):
1. Change the separation distance from 0.05 cm to 2-3 cm.
2. Remove the seed in AraSim by changing the setup.txt file so that Random_Mode = 1 instead of 0.
3. Add noise to AraSim (unless Amy says not to?) by changing the setup.txt file so that Trig_Analysis_Mode = 0 (or whatever the setting is--see the comments).
4. Make sure all of the frequency lists are the same! I think this has largely been resolved, but basically there was a time when the frequencies we were using differed from those used by AraSim for the actual bicone. We changed our lists to agree with the AraSim one, but I think there could be a few lists floaitng around (potentially just commented out) that I'm going to want to take our or correct.
5. Remove the seeds from the roulette algortihm. To do this, search for where "seed" is used and comment out the one that has 1 as an argument and comment in the one that uses time(0). Also, do the same for srand().
6. Fix the exponent in the calculation of the standard deviation of the genes in the roulette algorithm. Right now it has an integer division error, so the exponent becomes 0 leading to all the sigmas being 1. This is an easy fix--I'll just change 1/2 to 1.0/2.0.
I haven't made these changes yet because we are testing and want to confirm that we get the same results from the asymmetric version with the original and database versions. Since those didn't have these fixes, I haven't put them into the asymmetric version yet either. |
|
93
|
Wed Jul 22 16:00:18 2020 |
Alex M | Daily Update 7/21/20 |
| Name |
Update |
Plans for Tomorrow |
| Alex M |
Leo and I worked on the roulette algorithm to figure out why the new individuals being formed are different in the asymmetric bicone version of the loop than the original and database versions. We made some fixes, but we came across a complicated problem. Essentially, we think that the difference is coming down to the different number of times the random number generator is being called. Oddly, we can get the lengths that are generated to be the same. But getting all of the genes to be the same would require substantial reworking of the structure of the roulette algorithm and how to do it isn't obvious. We can keep trying to figure it out, but the restructuring was important to allow the mutations to occur on either chromosome (vs in the original and database versions, where we just have one chromosome to mutate, here we need to allow for more mutations since we have up to 6 genes). In principle though, I feel like this is possible, just difficult and requires substantial rewriting. |
I'll keep looking at the roulette algorithm to see how we can get the same new individuals as the previous two runs. Julie and I were also planning on meeting with Ben about AREA to better understand how to run it properly, |
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Evelyn |
|
|
| Ryan |
I fixed the bugs that I was having yesterday and the algorithm should run more properly. I also added functionality for sending certain parts per ten individuals to either tournament or roulette. However, neither function is getting "optimized" results by 100 gens (though the tournament is significantly closer than roulette in isolation) with the highest fitness score I have been able to get was ~8.65. But, I also do not know what the theoretical max fitness score, given the parameters, would be. |
Find out what an optimized fitness score's value would be so I know how close I am to achieving that. Run preliminary tests to see what combinations work best for now. |
| Ben |
|
|
| Ethan |
|
|
|
|
94
|
Thu Jul 23 16:44:05 2020 |
Alex M | Daily Update 7/23/20 |
| Name |
Update |
Plans for Tomorrow |
| Alex M |
Leo and I continued working on the roulette algorithm for the asymmetric bicone to try to get the evolved generations to match the original and database ones. We went through the mutation part of the algorithm and made sure we were rrunning all of the random number sequences in the correct order (for example, we need to make sure that if we define variables A and B from a random number generator, that in both cases we define A first, then B). We also had to make sure that we were using these random sequences the same number of times (for example, we don't want to define A once in the original/database versions and twice in the asymmetric version when the asymmetric version is set to evolve symmetric antennas--this puts the random number generator "off sequence" relative to how it is in the original/database version). We tested this with the gen 0 DNA and effective volumes (which matched with the results from the original/database runs) to evolve generation 1 and got it to match. I'm currently running the loop to test this over multiple generations.
Julie and I met with Ben to talk about AREA. Yesterday, Ben was able to generate the 0th generation of individuals and then run AraSim from a job to get effective volumes. Today, we focused on editing the scripts to work for OSC job submissions (he wrote the one he used yesterday; we modified the main script today and will continue to do so). We edited it so that we could submit the main script as a job which then submits other jobs for the arasim portion and waits for those jobs to finish before continuing on (since it needs those effective volumes for its fitness score). We're going to keep incrementally fixing the main script so that it can run over multiple generations as a job submission without errors.
|
I have a doctor's appointment in the morning, but maybe Leo can continue my current run. Once it's done, optimally we would work with Julie to get everything merged so that we can start a real run (we also have to implement the changes I outlined in the ELOG post a couple days ago before we do a real run/merge--most of those are pretty simple).
Julie and I will take a look at the paperclip script Ryan's been writing to see if we can help him figure out why the roulette algorithm is giving such worse fitness scores than the tournament algorithm (~ fact of 2 worse).
|
| Alex P |
|
|
| Eliot |
|
|
| Leo |
Alex covered it above for the most part. I just worked with him today trying to correct roulette so we get the same DNA for gen 1. Just to reiterate, the last step that was hanging us up was making sure the new GA used the random number generator the same amount of times and in the same order as the old GA. After that, Alex started another run to make sure everything is running smoothly. |
Tomorrow, Alex and I will make sure the results for the first few generations match. Then, Alex, Julie and I will move on to merging. |
| Evelyn |
|
|
| Ryan |
|
|
| Ben |
|
|
| Ethan |
|
|
|
|
95
|
Fri Jul 24 16:25:06 2020 |
Alex M | Daily Update 7/24/20 |
| Name |
Update |
Plans for Monday |
| Alex M |
|
|
| Alex P |
|
|
| Eliot |
|
|
| Leo |
|
|
| Ryan |
|
|
| Evelyn |
|
|
| Ben |
|
|
| Ethan |
|
|
|
|