Section outline

  • ჩაკეცვა Expand

    ზოგადი

    ჩაკეცე ყველა გაშალე ყველა

    The course is divided in two distinct sections. They can be taken independently.

    They are given face to face by 3 professors from INSA Rennes, France. 

    First session (5 ECTS)

    1. Logic programming (Prof. Mireille Ducassé <mireille.ducasse@insa-rennes.fr>)

    Second session (5 ECTS)

    1. Big Data Storage and Processing (Prof. Alexandru Costan <alexandru.costan@insa-rennes.fr>)
    2. Cloud computing (Prof. Nikos Parlavantzas <nikolaos.parlavantzas@insa-rennes.fr>

  • ჩაკეცვა Expand

    25 March - 12 April, Logic programming (Mireille Ducassé)

    Logic programming languages are declarative: programs state “what” has to be done and the compiler cares for “how” it should be done.

    Content of this part of the course

    • The basics of Prolog: unification, recursion, backtracking, list processing, resolution, 
    • Introduction to Constraint logic programming: programming with equations
    • A small project - about logic programming for real applications.

    Programming will be done on Eclipse Prolog (http://eclipseclp.org). It is recommended that students install it on their private machines.
    Some exercises may be done on-line with Swi Prolog (https://swish.swi-prolog.org).

    Quizz at the beginning of lectures may be done on https://app.wooclap.com/events/OROZXB.

  • ჩაკეცვა Expand

    Assessment of Logic programming course

    Home work

    In order to be able to take the exams students MUST have uploaded

    Midterm intermediate project individual defense (mid-May)

    • Students will have uploaded the first part of their individual project before the defense
    • They will explain their code and get personal feedbacks
    • They will also be asked
      • to "read" a given predicate 
      • to write a small predicate similar to the ones studied during the classes
    • The criteria for a good assessment are
      • personal work
      • good understanding of material seen during classes
    • Planning and connections details will be sent by email
    • A remote class of 3 hours will be planned to debrief the defenses
      • to help finish the project

    Project with individual defense (end of June)

    • Students will have uploaded the final version of their individual project before the defense
    • They will explain their code and get personal feedbacks
    • They will present a slide show of 10 slides (see format in the assignment section)
    • The criteria for a good assessment are
      • personal work
      • remarks from the intermediate defense and debriefing taken into account
    • Planning and connections details will be sent by email

    Student's achievements are evaluated by a 100-point system, which includes the interim assessment and the final assessment:                            

    Intermediate assessment

    30 points          

    Midterm individual project defense

    30 points

    Final Assessment

    70 points

    Minimal Competency Level

    Final individual project with individual defense

    70 points

    40 points

                            

    • Preliminary defense: plannings and organisation (Zoom link, time slots, ...) გვერდი
    • 1st July 5pm-8pm Final defense: plannings and organisation (Zoom link, time slots, ...) გვერდი
    • Project description ფაილი
      Uploaded 11/04/24, 10:56
    • Mid-term individual defense documents დავალება
      გაიხსნა: ოთხშაბათი, მაისი 1 2024, 8:00 AM
      დასრულება: სამშაბათი, მაისი 21 2024, 10:00 PM

      Please upload two files

      • the code of the first part of the individual project.
      • the results of the tests in a separate file (please name it <your-name>_test.pdf

      File format must be either .pdf, or .docx, or .doc.

      Project description will be given after the last class (11/04)

    • Documents for the final individual defense of Logic programming project დავალება
      გაიხსნა: პარასკევი, მაისი 31 2024, 8:00 AM
      დასრულება: კვირა, ივნისი 30 2024, 6:00 PM

      Upload two files here:

      1. <your_name>_project.pl : Your project code,
      2. <your_name>_test_and slide.pdf:  Your tests followed by your slide show in pdf format

      Slide show template (t is mandatory to follow it and to cover all the requested sections):

      Slide 1         Presentation of yourself; your cursus, which level; if you plan to go for an international mobility; date of the presentation; logo of TSU and INSA Rennes

      Slides 2-7   1 slide per main project step: the essential of the version, how it has been tested, with the important comments on the slide

      • New set of facts and the update of french_menu/2
      • Vegetarian/vegan menus
      • Wines 
      • Useful interface predicates
      • User-friendly display
      • Removing redundant solutions

      Slide 8        What was easy and what was difficult (both aspects must me covered)

      Slide 9        What you have learnt during the course

      Slide 10     How you think you will reuse the acquired knowledgeI

  • ჩაკეცვა Expand

    20 May - 25 May, Big data storage and processing (Alexandru Costan)

    These lectures provide the theoretical and practical bases for storing and effectively processing large volumes of data: collecting, retrieving, accessing Big Data. 

    We will first study how to analyze, organize and present Big Data in order to address their specific challenges: reduce the complexity, process the data deluge in real time, propose new paradigms to allow the extraction of relevant knowledge. The course will then introduce the state-of-art Big Data computing platforms with the focus on how to utilize them in processing (managing and analyzing) massive datasets. Specifically, we will discuss the Apache Hadoop MapReduce and Apache Spark frameworks, which provide the most accessible and practical means of computing with large datasets in the Cloud. 

    • Big Data overview (definition, characteristics)
    • Storage models for Cloud (Binary Large Objects: Amazon S3, Azure Blobs), NoSQL(Google BigTable, Cassandra), disk storage (GoogleFS, HDFS, PVFS, Lustre), in-memory storage (key-value stores, hybrid systems: memecached, mongoDB)
    • Batch vs. stream processing
    • Consistency models
    • Big Data processing models: MapReduce
    • Big Data platforms: Apache Hadoop, Apache Spark

    Lecturer: Alexandru Costan alexandru.costan@insa-rennes.fr

  • ჩაკეცვა Expand

    22 May - 26 May, Cloud computing (Nikos Parlavantzas)

    Students learn the main concepts and principles of cloud computing, architectures, and technologies. Covered topics include:

    • Deployment models, service models, cloud architecture
    • Virtualisation
    • Infrastructure-as-a-Service, Platform-as-a-Service, Serverless computing. 

    Practical exercises with a public cloud platform (Amazon Web Services)

  • ჩაკეცვა Expand

    Required Literature

    First session

    [1 ] Logic Programming with Prolog, M Bramer, Springer-Verlag, 2005; 

    [2] Constraint logic programming using ECLiPSe, Krzysztof R. Apt and Mark G. Wallace, Cambridge University Press, 2007

    Second session

    [1] The Cloud at Your Service, Jothy Rosenberg and Arthur Mateos, Manning Publications Co.

    [2] MapReduce: Simplified Data Processing on Large Clusters, Jeffrey Dean, Sanjay Ghemawat, Google Research

    [3] Introduction to Data Science, B. Howe

    Additional Literature

    [A1] Cloud Computing: Concepts, Technology & Architecture, Thomas Erl, Ricardo Puttini, Zaigham Mahmood, Prentice Hall, 2013 

    [A2] Tom White, Hadoop: The Definitive Guide, 3rd Edition Storage and Analysis at Internet Scale, O’Reilly

    [A3] The Fourth Paradigm: Data-Intensive Scientific Discovery, Microsoft Research

    [A4] Big Data Now, O’Reilly Media

    [A5] Pramod J. Sadalage, Martin Fowler, NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot Persistence, Addison-Wesley

    [A6] R. Swan, J. Allan, Automatic Generation of Overview Timelines

    [A7] J. Allan, R. Papka, V. Lavrenko, On-line New Event Detection and Tracking

    [A8] R. Bandari, S. Asur, B. Huberman, The Pulse of News in Social Media: Forecasting Popularity