Difference between revisions of "Course schedule"
From Research management course
Line 35: | Line 35: | ||
|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 ([https://goo.gl/forms/nPosqP4HQ154Wjf02 | + | |'''A'''bstract, '''I'''ntroduction, '''L'''iterature, '''B*'''-talk ([https://goo.gl/forms/nPosqP4HQ154Wjf02 Questionnary]) |
|- | |- | ||
| | | | ||
Line 42: | Line 42: | ||
|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. | ||
− | |'''S'''tatement ([https://goo.gl/forms/c7SEQfQicmdoEEyF2 | + | |'''S'''tatement ([https://goo.gl/forms/c7SEQfQicmdoEEyF2 Questionnary]) |
|- | |- | ||
| | | |
Revision as of 00:51, 13 February 2020
Schedule and consultations
- The workflow goes around each 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 | Set the workflow, schedule, tools. | Tools are ready to use. | (Questionnary) | |
20 | 1 | 1. Select a project | The project initial status is set. | (Questionnary) | |
27 | 2 | List references, write Abstract, Introduction, LinkReview. | Abstract, Introduction, References in bib-file. | Abstract, Introduction, Literature, B*-talk (Questionnary) | |
March | 5 | State a problem, write a description of your basic algorithm, prepare a computational experiment. | Write the problem statement, write the basic algorithm description. | Statement (Questionnary) | |
12 | 4 | Set your basic computational experiment. Make a preliminary analysis of your algorithm. (Ready to first checkpoint) | Basic code, report on the basic algorithm. | Basic code, Report, cHeck-1 | |
19 | 5 | Set your computational experiment using proposed algorithm and your previous resluts. | Code, visual presentation of results, error and quality analysis. Create a draft of your presentation for 2-3 minutes. | M-talk, Code, Visualization | |
26 | 6 | Describe the algorithm. | The theory and and algorithms of the paper. | Theory | |
April | 2 | 7 | Finalise the computational experiment. | The experiment description with error analysis. | Error |
9 | 8 | Prepare the theoretical part and computational experiment. Explain the figures, write conclusions. | The paper draft with the sections Computational experiment and Conclusions. | Document | |
16 | 9 | Checkpoint: the paper is ready. | Your paper is ready to the peer-review. | сHeck-2, RevieW | |
23 | 10 | Prepare your presentation. | Presentation day. | Final show, Slides | |
30 | 11 | Finalization | The paper and slides are subjects to submit. | Journal |