Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformaticanetworking:spm:spm1617exams [13/12/2016 alle 15:44 (9 anni fa)] – [RTS/library] Marco Danelutto
+++ magistraleinformaticanetworking:spm:spm1617exams [04/08/2017 alle 10:42 (8 anni fa)] (versione attuale) – [Exam dates] Marco Danelutto
@@ Linea 4: / Linea 4: @@
 ^ Term ^ Deadline for submitting project ^ Oral exams calendar |
-| Extraordinary term | November 2nd, 2016 (deadline to submit projects) | [[spm1617appstra1|Calendar]] |
+| Extraordinary term | November 2nd, 2016 | [[spm1617appstra1|Calendar]] |
-| First term 2016-17 | January 17th, 2017 (deadline to submit projects) | |
+| First term 2016-17 | January 17th, 2017 | [[spm1617app1|Calendar]] |
-| Second term 2016-17 | February 13rd, 2017 (deadline to submit projects) | |
+| Second term 2016-17 | February 13rd, 2017 | [[spm1617app2|Calendar]] |
+| Extraordinary term | April 6th, 2017 (deadline to submit the projects) **9.00am** | |
+| First summer term 2016-17 | June 13th | [[spm1617app3|Calendar]] |
+| Second summer term 2016-17 | July 3rd | |
+| Third summer term 2016-17 | July 24th | |
+| Autumn term 2016-17 | Sept. 12 (//there will be some possibility to extend the deadline, upon motivated request//)| |
+===== Machine access =====
+[[spm1617|Here]] you may find the instructions to access the machine(s) avaialable for the project.
+===== List of assigned accounts =====
+[[accounts1617| Here]]
 ===== Final project =====
@@ Linea 32: / Linea 41: @@
 === Successive approximation pattern ===
-The pattern process a stream of input tasks and a global state value. For each one of the input tasks //x// one or more output tasks //f(x,s)// may be produced onto the input stream and the state value //s// is updated to //s'(x,s)//. The function updating the state is monotonic. The computation of an //f(x,s)// with a non updated state //s// does not produce any damage/side effect (but using computational resources.
+The pattern process a stream of input tasks and a global state value. For each one of the input tasks //x// one or more output tasks //f(x,s)// may be produced onto the input stream and the state value //s// is updated to //s'(x,s)//. The function updating the state is monotonic. The computation of an //f(x,s)// with a non updated state //s// does not produce any damage/side effect (but using additional computational resources).
 === Free choice RTS ===
@@ Linea 48: / Linea 57: @@
 ===== Implementation possibilities =====
-  * Appkications should be implemented using FastFlow. Alternative programming frameworks may be discussed with the professor. A comparison implementation using plain C++ threads will be helpful and appreciated.
+  * Applications should be implemented using FastFlow. Alternative programming frameworks may be discussed with the professor. A comparison implementation using plain C++ threads will be helpful and appreciated.
   * Run time supports should be implemented using C++ threads. Alternative proramming frameworks may be discussed with the professor.
+===== OpenCV =====
+The students using OpenCV for the Video processing application will get a different account on a machine with openCV pre-installed, in case.
 ==== Workflow ====