projects descriptions - bfh-ti staff: homepagesfrc1/www/v1a/projets/projectsslides.pdf · projects...

Projects Descriptions

Claude Fuhrer

Haute Ecole Specialisee BernoiseDepartement Technique et Informatique

Section Automobile

Spring 2015

frc1 (HESB-TI) Projects Descriptions Spring 2015 1 / 23

Evaluation

Evaluation

The project should be developed in four phases :

Project requirement (3 points)

Description of the algorithms (7 points)

Code and documentation (13 points)

Presentation of the results (2 points)


Evaluation

Project calendar

Event Week Date

Start of the project 0Requirements and description 2Algorithms description 4Code and final report 7Presentation 8


Playfair coding

Playfair coding

Simple coding of a message using a password.

The message to be coded is read from a file which name is given bythe user.

The whole message should be converted into lower cases, nonumbers, no spaces, no punctuation.

The ciphered message should be written into a file which name isgiven by the user.

The deciphering process should also be implemented


Playfair coding

The Playfair grid

Let choose a password, for example : playfair. The password is used tostart the filling of the grid. The grid is then completed with missingcharacters.

P L A Y F

I R

P L A Y F

I R B C D

E G H J K

M N O Q S

T U V X Z


Playfair coding

Playfair encoding process

Text to encode (groups of two letters) :

OP ER AT IO ND EC HI FF RE ME NT UN DE UX TR OI SX.

P L A Y F

I R B C D

E G H J K

M N O Q S

T U V X Z

The first group of letter is replaced by : AM


Playfair coding

Playfair encoding process

A group of two letter is replaced by the two others letters of the otherends of the defined rectangle.

If two letters are on the same row, one can replace them by the twoletters immediatly at their right.

If two letters are at the same column, one can replace them with thetwo letters immediatly below.

If a group of two letters is composed by the same letter, one can inserta supplementary character (for example ’X’) and use the rules above.


Vigeneres cipher

Vigeneres cipher

The using conditions are the same as for the Playfair coding.

One use a grid as seen in the file Vigenres-grid.pdf

Each letter of the password define the line.

Each letter of the text define the column

The intersection of colums and lines give the ciphered letter.


Vigeneres cipher

Vigeneres example

Text O P E R A T I O N D E C R Y P T A G E U N

Password m o t d e p a s s e m o t d e p a s s e m

Ciphered text A D X U E I I G F H Q Q K B T I A Y W Y Z


Wolfram cellular automata


In his book A new kind of science Stephen Wolfram studied some onedimensional cellular automata.

A one dimensional cellular automata may be modelised by a onedimensional array where each cell has the state occupied or empty.The first state of the automata is choosen by the user.

To compute the next generation of this automata, one has to applyone rule choosen among a set of availables rules. Applying this rulemany times shows sometines intrigating behaviour.



Wolfram rules

The rules proposed by Wolfram are explained on the page :http://mathworld.wolfram.com/ElementaryCellularAutomaton.html

Let us consider the following diagram :

For every group of three cells, one has 8 different possibleconfiguration. Each of these configuration my be considered as a bitnumber.

For every configuration, the rules defines if the cell of the nextgeneration will be empty or occupied.

Applying the rule iteratively give sometimes interesting results.


http://mathworld.wolfram.com/ElementaryCellularAutomaton.html


Example of rule 26

X

X X

X X

X X X X

X X

X X X X

X X X X

X X X X X X X X

X X

X X X X

X X X X

X X X X X X X X

X X X X

X X X X X X X X

X X X X X X X X

X X X X X X X X X X X X X X X X

X X

X X X X

X X X X

X X X X X X X X

X X X X

X X X X X X X X

X X X X X X X X

X X X X X X X X X X X X X X X X


Game of life

Game of life

The Game of Life, also known simply as Life, is a cellular automatondevised by the British mathematician John Horton Conway in 1970.

The ”game” is a zero-player game, meaning that its evolution isdetermined by its initial state, requiring no further input. Oneinteracts with the Game of Life by creating an initial configurationand observing how it evolves or, for advanced players, by creatingpatterns with particular properties.


Game of life

Game of life rules

The universe of the Game of Life is an infinite two-dimensional orthogonalgrid of square cells, each of which is in one of two possible states, alive ordead. Every cell interacts with its eight neighbours, which are the cellsthat are horizontally, vertically, or diagonally adjacent. At each step intime, the following transitions occur :

Any live cell with fewer than two live neighbours dies, as if caused byunder-population.

Any live cell with two or three live neighbours lives on to the nextgeneration.

Any live cell with more than three live neighbours dies, as if byovercrowding.

Any dead cell with exactly three live neighbours becomes a live cell,as if by reproduction.


Game of life

Game of life : an example


Steganography

Steganography

Steganography is the art of hiding a sensitive information into ananother trivial one.

For this project, one will hide text into an image of type BMP 24 bits(and only this kind of image !)

An image may be considered as a suite of bytes, each describing apixel.

For BMP-24 bits images, the first 54 bytes describe the header of theimage and should not be modified

After, each pixel is represented by three bytes, one for the red color,one for the green color and one for the blue color.


Steganography

Steganography

To hide a text into an image, we would read the text, character aftercharacter.

A character is divided into 4 block of each 2 bytes.

Each block is then incorporated into the image colors at the lower bits(bits b1 and b0). One need then 1.33 pixels for one character.

This would slightly modify the colors of the pixels but thismodification is not visible for human eye. Caution, statistical methodmay be used to define if a picture has been modified to containstenographical information, but that is not our point.


Tic-tac-toe

Tic-tac-toe

Tic-tac-toe is a two player pencil and paper well knows in classrooms. Thegoal of the game is to align three X or tree O on a 3×3 board.


Tic-tac-toe

Tic-tac-toe

Implement a text version of the game where each player play at histurn.

For each round, the program should check if a winning position hasbeen reeched and display the winner.


Mastermind

Mastermind

Mastermind is a code-breaking game for two players invented in 1970 byMordecai Meirowitz.


Mastermind

Mastermind

The pegs colors are modelized by letter, for example :

R red G greenB blue O orangeM magenta Y yellow

The programm choose a random combination of colors (four pegs)

The user enter a combination as word of four chararacter, forexample : ”RGGO”.

The program check the user input and write :Well placed pegs : x

Bad placed pegs : y

One may limit the number of user input (for example 12).


Thymio robot

Thymio robot

Aseba is a startup of the EPFL, which goal is to develop and sell robotsfor education purposes. This project will use the ThymioII robot.

One may program this robot to do different tasks (like following a blackline). The programming language is not C but a other language simple tolearn and apply.


Thymio robot

Thymio robot

The goal of this project is to program the robot for a race.

The race takes part in 4 rounds :1 The first round use a standard track.2 For subsequent rounds, each team develop a track where its own robot

is optimised for and difficult for the other teams.

The time used for the 4 round defines the winner.


projects descriptions - bfh-ti staff: homepagesfrc1/www/v1a/projets/projectsslides.pdf · projects...

Documents