Difference between revisions of "Course schedule"
From Research management course
| Line 21: | Line 21: | ||
|1 | |1 | ||
|Set the workflow, schedule, tools. | |Set the workflow, schedule, tools. | ||
| − | | | + | | |
| − | | | + | | |
|- | |- | ||
| | | | ||
| Line 36: | Line 36: | ||
|List references, write Abstract, Introduction, LinkReview. | |List references, write Abstract, Introduction, LinkReview. | ||
|Abstract, Introduction, References in bib-file. | |Abstract, Introduction, References in bib-file. | ||
| − | |'''A'''bstract, '''I'''ntroduction, '''L'''iterature, '''B*'''-talk | + | |'''A'''bstract, '''I'''ntroduction, '''L'''iterature <!--, '''B*'''-talk--> |
|- | |- | ||
| | | | ||
| Line 43: | Line 43: | ||
|State a problem, write a description of your basic algorithm, prepare a computational experiment. | |State a problem, write a description of your basic algorithm, prepare a computational experiment. | ||
|Write the problem statement, write the basic algorithm description. | |Write the problem statement, write the basic algorithm description. | ||
| − | |''' | + | |'''P'''roblem statement |
|- | |- | ||
| | | | ||
|12 | |12 | ||
|5 | |5 | ||
| − | |Set your basic computational experiment. Make a preliminary analysis of your algorithm. | + | |Set your basic computational experiment. Make a preliminary analysis (plan of report) of your algorithm. |
| − | |Basic code, report on the basic algorithm. | + | |Basic code, draft report on the basic algorithm. Ready to the first checkpoint. |
|'''B'''asic code, '''R'''eport, c'''H'''eck-1 | |'''B'''asic code, '''R'''eport, c'''H'''eck-1 | ||
|- | |- | ||
| Line 55: | Line 55: | ||
|19 | |19 | ||
|6 | |6 | ||
| − | |Set your computational experiment using proposed algorithm and your previous | + | |Set your computational experiment using proposed algorithm and your previous results. |
|Code, visual presentation of results, error and quality analysis. Create a draft of your presentation for 2-3 minutes. | |Code, visual presentation of results, error and quality analysis. Create a draft of your presentation for 2-3 minutes. | ||
| − | |''' | + | |'''C'''ode, '''V'''isualization <!-- '''M'''-talk,--> |
|- | |- | ||
| | | | ||
| Line 84: | Line 84: | ||
|10 | |10 | ||
|Checkpoint: the paper is ready. | |Checkpoint: the paper is ready. | ||
| − | |Your paper is ready to the peer-review. | + | |Your paper is ready to the peer-review. Ready to the second checkpoint. |
| − | | | + | |c'''H'''eck-2, Revie'''W''' |
|- | |- | ||
| | | | ||
|23 | |23 | ||
|11 | |11 | ||
| − | | | + | |Finalization |
| − | | | + | |The paper and slides are subjects to submit. |
| − | |''' | + | |'''J'''ournal |
|- | |- | ||
| | | | ||
|30 | |30 | ||
|12 | |12 | ||
| − | | | + | |Prepare your presentation. |
| − | | | + | |Presentation day. |
| − | |''' | + | |'''F'''inal show, '''S'''lides |
|- | |- | ||
|} | |} | ||
Revision as of 02:36, 25 February 2020
Schedule and consultations
- The workflow goes around each week.
- See Todo list for this week.
- The iterative consultations and delivery of results are highly welcome! Start during the weekends.
- Deadline of the last version is: Wednesday 6:00am. The review goes on Wednesday working day.
- Each symbol gives +1 according the system (А--, А-, А, А+, А++). No symbol gives A0.
- (To be clarified) Motivated delay. (Non-motivated delay interferes peer-review).
Schedule
| Date | N | To be done | Result to discuss | Symbol | |
| February | 13 | 1 | Set the workflow, schedule, tools. | ||
| 20 | 2 | Select a project. | Tools are ready to use. The project initial status is set. | ||
| 27 | 3 | List references, write Abstract, Introduction, LinkReview. | Abstract, Introduction, References in bib-file. | Abstract, Introduction, Literature | |
| March | 4 | State a problem, write a description of your basic algorithm, prepare a computational experiment. | Write the problem statement, write the basic algorithm description. | Problem statement | |
| 12 | 5 | Set your basic computational experiment. Make a preliminary analysis (plan of report) of your algorithm. | Basic code, draft report on the basic algorithm. Ready to the first checkpoint. | Basic code, Report, cHeck-1 | |
| 19 | 6 | Set your computational experiment using proposed algorithm and your previous results. | Code, visual presentation of results, error and quality analysis. Create a draft of your presentation for 2-3 minutes. | Code, Visualization | |
| 26 | 7 | Describe the algorithm. | The theory and and algorithms of the paper. | Theory | |
| April | 2 | 8 | Finalise the computational experiment. | The experiment description with error analysis. | Error |
| 9 | 9 | Prepare the theoretical part and computational experiment. Explain the figures, write conclusions. | The paper draft with the sections Computational experiment and Conclusions. | Document | |
| 16 | 10 | Checkpoint: the paper is ready. | Your paper is ready to the peer-review. Ready to the second checkpoint. | cHeck-2, RevieW | |
| 23 | 11 | Finalization | The paper and slides are subjects to submit. | Journal | |
| 30 | 12 | Prepare your presentation. | Presentation day. | Final show, Slides |