Canal-U

Mon compte

Résultats de recherche

Nombre de programmes trouvés : 10947
Label UNT Vidéocours

le (5m25s)

1.1. The cell, atom of the living world

Welcome to this introduction to bioinformatics. We will speak of genomes and algorithms. More specifically, we will see how genetic information can be analysed by algorithms. In these five weeks to come, we will see first, what are these genomic texts, we will try to analyse using algorithms and programs. We will then speak of genes and proteins. Proteins being coded by genes. We will study and design algorithms to predict genes on the DNA sequences or genomic texts. We will study, more deeply, an algorithm to compare genomic sequences. And we will use this algorithm to reconstruct phylogenetic trees that is to say the evolution of species over time. During this ...
Voir la vidéo
Label UNT Vidéocours

le (5m49s)

1.4. What is an algorithm?

We have seen that a genomic textcan be indeed a very long sequence of characters. And to interpret this sequence of characters, we will need to use computers. Using computers means writing program. Writing program means designing first algorithm. So, let's see what an algorithm is. An algorithm is a series of operationsto be executed by a computer, but maybe also executed by ahuman, for solving a problem.  In the first algorithm we will study in this session and next one, the problem will be to count the number of different of the four different nucleotides which appeared in the sequence. It's a sequence of operations. You may say that in ...
Voir la vidéo
Entretiens

le (2m51s)

Entretien #57 avec Murat Çizakça

Projet de recherche : « Une histoire des fondations philanthropiques islamiques » Prof. Murat ÇIZAKÇA a publié en 2000 un ouvrage à succès sur les fondations de bienfaisance islamiques (awqaf ou waqf) : A History of Philanthropic Foundations: Islamic World from the Seventh Century to the Present (‘Une histoire des fondations philanthropiques: le monde islamique du viie siècle à nos jours’). Beaucoup de choses ont changé depuis dans le milieu de la philanthropie islamique. Il compte mettre à jour cet ouvrage et l’étoffer en y introduisant une dimension ...
Voir la vidéo
Label UNT Vidéocours

le (7m19s)

1.1. Introduction I - Cryptography

Welcome to this MOOC which is entitled: code-based cryptography. This MOOC is divided in five weeks. The first week, we will talk about error-correcting codes and cryptography, this is an introduction week.Then, we will introduce the McEliece cryptosystem, and the security proof for the McEliece cryptosystem. We will talk about generic attack, message attack, in other words. This course will be given by Nicolas Sendrier. Then, we'll give structural attacks or key attacks, and at the end, we will talk about othercryptographic constructions relying on coding theory. This last week will be given by Matthieu Finiasz.  Today is the first ...
Voir la vidéo
Label UNT Vidéocours

le (5m51s)

1.2. Introduction II - Coding Theory

In this session, we will give a brief introduction to Coding Theory. Claude Shannon's paper from 1948 entitled "A Mathematical Theory of Communication" gave birth to the disciplines of Information Theory and Coding Theory. The main goal of these disciplines is efficient transfer of reliable information. To be efficient, the transfer of information must not require a big amount of time and effort.  To be reliable, the transmitted and received data must resemble. However, during the transmission over a noisy channel, the information will be damaged. So, it has become necessary to develop ways of detecting when an error has ...
Voir la vidéo
Label UNT Vidéocours

le (4m15s)

1.3. Encoding (Linear Transformation)

In this session, we will talk about the easy map of the  - one-way trapdoor functions based on error-correcting codes. We suppose that the set of all messages that we wish to transmit is the set of k-tuples having elements from the field Fq. There are qk possible messages and we referred to it as the message space.  In order to detect and possibly correct errors, we add some redundancy, thus the k tuples will be embedded into n-tuples with n greater than k. In this MOOC, we will focus on linear ...
Voir la vidéo
Label UNT Vidéocours

le (4m47s)

1.4. Parity Checking

 There are two standard ways to describe a subspace, explicitly by giving a basis, or implicitly, by the solution space of the set of homogeneous linear equations. Therefore, there are two ways of describing a linear code, explicitly, as we have seen in the previous sequence, by a generator matrix, or implicitly, by the null space of a matrix. This is what we will see in this sequence. This leads to the following definition: H is a parity check matrix of a linear code, if the code is the null space ...
Voir la vidéo

 
FMSH
 
Facebook Twitter
Mon Compte