Questa è una vecchia versione del documento!
The course is focused on practical skills. Students will learn to apply quantitative methods for solving design and management problems in the context of data science and artificial intelligence. The students will acquire knowledge that is transversal to the Master Degree in Data Science and Business Informatics. In particular, the students at the end of the course will:
• Be aware of the whole process of value generation in a data science process
• Know available methods for designing data-driven products and services
• Understand the differences between research projects and a development process
• Be aware of the business, environmental and social impact of data science solutions
The course has been co-designed with three companies of the innovation ecosystem of Pisa:
These companies have helped to select the content for the course and are open have students for traineeships and work collaborations.
The course is also in synergy with the research team B4DS, where some students interested in doing research can find placement too:
The course has a fo us on different soft-skills. Some of these skills (i.e. creativity and critical thinking) will be faced using methodological approaches, to help students develop behaviours towards the use of methods using the approach developed in the European Project Ulisse. During the activities of the course (lessons and project activities) the students will also develop the following behaviours:
• Be able to work in a diverse, multi-cultural and interdisciplinary team
• Be positive and methodological towards complex socio-technical problems
• Be curious about the continuous development of the data science sector
• Listen and discuss actively in a team
The Righ It: Why So Many Ideas Fail and How to Make Sure Yours, Alberto Savoia (2019)
The Signal and the Noise: Why So Many Predictions Fail - but Some Don't, Nate Silver (2015)
The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World, Pedro Domingos (2015)
The grade for the exam will be computed as follows:
Project Document: 30%, evaluated by the teacher Project Presentation: 20%, evaluated by the teacher Project Document: 10%, evaluated by peers students Peer Evaluation: 20%, evaluated by the teacher Report Review: 20%, evaluated by the teacher
Registration to the exam is mandatory.
Non-attending students are welcome to attend the exam. All the lessons will be recorded, and students will have access to the material of the course. Non-attending students are strongly encouraged to use office hours to interact with the teacher during the preparation of the exam, especially for the preparation of the project. Also, students are encouraged to work in teams even if they are not attending the course.
The percentages for non-attending students are the following:
Project Document: 30%, evaluated by the teacher Project Presentation: 20%, evaluated by the teacher Paper Review: 50%, evaluated by the teacher
Registration to the exam is mandatory.
The students will be asked to make a teamwork project, where they will design a data-science based product or service. Students will be followed in the development of the project, towards the final discussion, thanks to class activities. Attending students will also be asked to participate in the peer-to-peer evaluation of the project activities.
During the course, students will be asked to make a review of a scientific contribution, This can be:
The student will decide the content to review and send an e-mail to the professor at least one week before the date of the exam. The report will be in the form of a short report (two pages).
Here is a list of already discussed contents (can not be taken again):
Virtual classroom: To join a lecture enter the virtual classroom, go to the Calendar tab and click on the scheduled lecture.
N | Date | Time | Room | Lecture notes | Topics | Links |
---|---|---|---|---|---|---|
1 | Mon 14/09 | 11:00-12:45 | Microsoft Teams | Lecture 1 | Course introduction: course objectives, textbooks, BPM aim and motivation, models and abstraction | |
2 | Wed 16/09 | 16:15-18:00 | Microsoft Teams | Lecture 2 | Introduction to Business Processes: Taylorism, work units, processes, terminology, organizational structures | |
- | Mon 21/09 | 11:00-12:45 | Canceled | Election day | ||
3 | Thu 24/09 | 16:15-18:00 | Microsoft Teams | Lecture 2 (2nd part) | Introduction to Business Processes: Processo orientation and reengineering, main definitions, visual notations | |
4 | Mon 28/09 | 11:00-12:45 | Microsoft Teams | Exercises Examples | Examples and Exercises | |
5 | Thu 01/10 | 16:15-18:00 | Microsoft Teams | Examples (ctd.) | Examples and Exercises | |
6 | Mon 05/10 | 11:00-12:45 | Microsoft Teams | Examples and Exercises (ctd.) Lecture 3 | Examples and Exercises Evolution of Enterprise Systems Architectures: separation of concerns, sw architectures individual enterprise applications, enterprise resource planning system, siloed enterprise applications, enterprise application integration, message-oriented middleware | |
7 | Thu 08/10 | 16:15-18:00 | Microsoft Teams | Lecture 3 (2nd part) Lecture 4 | Evolution of Enterprise Systems Architectures: enterprise service computing Business Process Modelling Abstractions: Separation of concerns, horizontal abstraction, aggregation abstraction, vertical abstraction | |
8 | Mon 12/10 | 11:00-12:45 | Microsoft Teams | Lecture 5 Lecture 6 | Business Process Methodology: levels of business processes, business strategies, operational goals, organizational BP, operational BP, implemented BP, design guidelines, from business functions to processes Business Processes Lifecyle: design and analysis, configuration, enactment, evaluation, administration and stakeholders Mathematical background: Sets, functions, relations | |
- | Thu 15/10 | 16:15-18:00 | Canceled | |||
9 | Mon 19/10 | 11:00-12:45 | Microsoft Teams | Lecture 7 (1st part) | Mathematical background: predicate logic, induction, recursion Introduction to Petri nets: finite state automata | |
10 | Thu 22/10 | 16:15-18:00 | Microsoft Teams | Exercises (from Lecture 7) Lecture 7 (2nd part) Lecture 8 (1st part) | Introduction to Petri nets: from automata to Petri nets More concepts about Petri nets: multisets and markings | |
11 | Mon 26/10 | 11:00-12:45 | Microsoft Teams | Woped basics Lecture 8 (2nd part) | More concepts about Petri nets: multisets and markings, transition enabling and firing, firing sequences, reachable markings, occurrence graph | Woped |
12 | Wed 28/10 | 16:15-18:00 | Microsoft Teams | Exercises (from Lecture 8) | Modelling with Petri nets: Examples and Exercises | |
13 | Thu 29/10 | 16:15-18:00 | Microsoft Teams | Exercises (from Lecture 8) Lecture 9 (1st part) | Modelling with Petri nets: Examples and Exercises Behavioural properties: liveness | |
14 | Mon 02/11 | 11:00-12:45 | Microsoft Teams | Lecture 9 (2nd part) Exercises (from Lecture 9) | Behavioural properties: dead transitions, place liveness, dead places | |
15 | Thu 05/11 | 16:15-18:00 | Microsoft Teams | Exercises (from Lecture 9) Lecture 9 (3rd part) | Behavioural properties: deadlock freedom, boundedness, safeness, cyclicity Structural properties: weak and strong connectedness, S-systems, T-systems, free-choice nets | |
16 | Mon 09/11 | 11:00-12:45 | Microsoft Teams | Exercises (from Lecture 9) Lecture 10 (1st part) | Nets as matrices: markings as vectors | |
17 | Thu 12/11 | 16:15-18:00 | Microsoft Teams | Lecture 10 (2nd part) | Nets as matrices: incidence matrices, Parikh vectors, marking equation lemma, monotonicity lemma, boundedness lemma, repetition lemma |
Virtual classroom: To join a lecture enter the virtual classroom, go to the Calendar tab and click on the scheduled lecture.
N | Date | Time | Room | Lecture notes | Topics | Links |
---|---|---|---|---|---|---|
18 | Mon 16/11 | 11:00-12:45 | Microsoft Teams | Exercises (from Lecture 10) Lecture 11 (1st part) | Invariants: S-invariants, fundamental property of S-invariants, alternative characterization of S-invariant, support, positive S-invariants, about boundedness, reachability and liveness | |
19 | Thu 19/11 | 16:15-18:00 | Microsoft Teams | Lecture 11 (2nd part) Exercises (from Lecture 11) Lecture 12 | Invariants: T-invariants, fundamental property of T-invariants, alternative characterization of T-invariants, reproduction lemma, about liveness and boundedness On strong connectedness: connectedness theorems | |
20 | Mon 23/11 | 11:00-12:45 | Microsoft Teams | Lecture 13 Exercises (from Lecture 13) Lecture 14 (1st part) | Workflow nets: definition, syntax sugar, subprocesses, control flow aspects, triggers Analysis of workflow nets: structural analysis, activity analysis, token analysis, net analysis, verification and validation, reachability analysis, coverability graph | Woped |
21 | Thu 26/11 | 16:15-18:00 | Microsoft Teams | Lecture 14 (2nd part) Exercises (from Lecture 14) Lecture 15 Lecture 16 (1st part) | Analysis of workflow nets: soundness, N*, strong connectedness of N*, main soundness theorem Safe Workflow nets: soundness (and safeness) by construction S-systems: fundamental property of S-systems, S-invariants of S-nets | |
22 | Mon 30/11 | 11:00-12:45 | Microsoft Teams | More Exercises (from Lecture 14) Exercises (from Lecture 15) Lecture 16 (2nd part) Lecture 17 Lecture 18 (1st part) | S-systems: liveness theorem, reachability lemma, reachability theorem, boundedness theorem, workflow S-nets T-systems: circuits and token count on a circuit, fundamental property of T-systems, T-invariants of T-nets, boundedness in strongly connected T-systems, liveness theorem for T-systems, workflow T-nets Free-choice nets: Fundamental property of free-choice nets clusters, stable sets, siphons, proper siphons, fundamental property of siphons, siphons and liveness, Rank theorem | |
23 | Thu 03/12 | 16:15-18:00 | Microsoft Teams | Exercises (from Lecture 16) Exercises (from Lecture 17) Exercises (from Lecture 18) A note on P and NP (optional reading) Lecture 18 (2nd part) Lecture 19 | Decision problems and computational complexity (optional reading) Free-choice nets: traps (optional reading), place-liveness = liveness in f.c. nets (optional reading), Commoner's theorem and its complexity issues, Rank theorem and its complexity issues, sound f.c wf nets are safe Diagnosis of Workflow nets: Woped, S-components, S-cover, T-cover (optional reading), TP-handles, PT-handles, well-handled nets, well-structured wf nets, Woflan, ProM, error sequences, non-live sequences, unbounded sequences | Woped Woflan ProM |
24 | Mon 07/12 | 11:00-12:45 | Microsoft Teams | Exercises (from Lecture 19) Lecture 20 Lecture 21 | Workflow systems: I/O interfaces, workflow modules, stuctural compatibility, workflow system, weak soundness EPC: Events, functions, connectors, EPC diagrams, guidelines, soundness analysis, from EPC to wf nets, net fragments, dummy style, fusion style, unique start, unique end, three transformations, semantics ambiguities, relaxed sound nets (optional), relaxed sound EPC diagrams (optional), from restricted EPC diagrams to f.c. nets, problems with (X)OR joins, candidate split, corresponding split, matching split, OR join policies (wfa, fc, et), from decorated EPC diagrams to nets | VP yEd |
25 | Thu 10/12 | 16:15-18:00 | Microsoft Teams | Exercises (from Lecture 20) Exercises (from Lecture 21) Lecture 22 Exercises (from Lecture 22) A final note (with project instructions) | BPMN: Notation, swimlanes, flow objects, artefacts, connecting objects, collaborations, choreographies, from BPMN to nets | Yaoqiang BPMN.io BPMS Bizagi VP ProM |
end |
Date | Time | Room | Info | |
---|---|---|---|---|
Fri | 22/01 | 09:00 | Teams | Exam |
Fri | 12/02 | 09:00 | Teams | Exam |
Mon | 12/04 | 11:00 | Teams | Extra-ordinary Exam |
Tue | 01/06 | 11:00 | Teams | Exam The actual date of the oral exam will be agreed with the teacher |
Mon | 21/06 | 11:00 | Teams | Exam Exams registration system The actual date of the oral exam will be agreed with the teacher |
Tue | 20/07 | 11:00 | Teams | Exam Exams registration system The actual date of the oral exam will be agreed with the teacher |
Mon | 30/08 | 11:00 | Teams | Exam Exams registration system The actual date of the oral exam will be agreed with the teacher |