dirac-institute / hybrid_sso_catalogue Goto Github PK
View Code? Open in Web Editor NEWA package for creating hybrid solar system catalogues for making LSST predictions
License: MIT License
A package for creating hybrid solar system catalogues for making LSST predictions
License: MIT License
Consider why the variant orbit predictions are off by a constant factor from Scout. Mario may contact Davide about this.
I've written most of this but there are some things left to add/check
To start, we need to first complete
And then make a judgement on the improved purity and traffic of the NEOCP at this time.
Mario
Eric
Additionally, Eric wonders if we could optimise this for the most dangerous of objects. Mario and I discussed this a while ago but perhaps we could actually check the orbits of the NEOs that get lost and see whether it is specifically ones that are close/far away. Would be useful to comment on that
Jess
Currently the way I have it set up is that the algorithm doesn't account for any observations prior to the detection window. This leaves us with 3 cases
For 1, we proceed as usual. For 3, we should remove these objects from the run since we've already found them.
2 is more complicated but I propose we do the following. For each object, pass a list/dict of nights on which 2 observations have occurred that meet the usual criteria. We can then prepend this to unique_nights
in get_probability_by_id
and run it in exactly the same way.
Need to discuss this with Mario but the current algorithm does the following for each object in a night:
i
, check if the predicted RA/Dec is within 2.1 degrees of the ra/dec of field i
and field i - 1
TODOs
Use difi
to work out how many NEOs and MBAs are discovered within the first year. Ask Mario for a total number ish in the solar system to get a rough completeness.
Then we can use this numbers without needing to cite a conference proceeding that no one can see ๐
Weight probabilities by the distribution of distances and radial velocities in the hybrid catalogue (in this file).
Things to consider:
Mario and I discussed it and we think we should just focus on the NEO range. When we chat with Davide we may make these more specific but now we are thinking
Use Peter's new run of a predicted schedule to try making predictions without prior knowledge of weather.
Unsure why this is happening but it seems to happen for orbits with large distances. For now I am just patching this by setting NaN=0.0 but we should investigate why this is happening.
Use colour definitions to convert between them. Mario saying the expression is basically (for example for converting from r to y)
Where you grab
MPC colours
LSST colours (5.1.3, Table 1)
A better method than what I currently do. Evolve all of the orbits until the start, midpoint and end of each night. Take the greater separation of (start, midpoint) and (midpoint, end) and use that to calculate the distance the object can cover during night.
Use this to restrict to only fields that the object can reach to speed things up.
If we're going to run this for more detection windows/MBAs as well we need it to be much faster.
Need to upgrade to the latest thor
version and use the workers in generateEphemeris
Majority of this is written but there are some things left to do. Mainly I need to add how well my mitigation strategy works...once I've finished it ๐
I'll need help from Mario on this. I want to make a brief outline with him before attempting this. I think it will look something like this
E.g. MBAs are not going to exist at the ecliptic poles, can we leverage that to improve the NEO score?
I was thinking about this and it is sort of backwards though, we want to rule out NEOs rather than rule out MBAs so perhaps we'll need to penalise scores for objects that are close to the ecliptic at that time?
We can then add this number to the diagonal square and see whether it is worth sending anything to the NEOCP.
We want to know how many of the undetectable column are undetectable over the whole year. Additionally the median time before detection would be nice. Or perhaps a series of cumulative bins?
This requires
digest2
on years 2-4Basically just implementing the following expressions
A couple of things to improve the plots
Quick things
Fixes
Additions
I want to make a full flowchart of the whole nightly workflow (hybrid catalogue + NEOCP stuff)
Honestly not sure exactly what goes into the discussion here, may move some stuff from the results?
What detection probability should necessitate an object being sent to the NEOCP?
Should be able to decide this statistically once we have a large sample of probabilities/realities and maximise the accuracy.
A fair dinkum of this is here too, it basically just needs #5 to be finished first.
digest
run on the first yeardigest2
at the start of each year (removing discovered objects) - check ratio of NEOs to unknown MBAs with digest2 > 65Use this from ipywidgets import interact
to show plots of predictions for one particular object. It makes one plot for each night showing the schedule and positions.
I'm also interested in the idea of animating the plot for one night where you can see the scheduled visits and object locations change over time.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.