psjyothiprasad Goto Github PK

2048_game_with_haskell_blankcanvas

The 2048 game using Blank Canvas which is a Haskell binding to HTML5 Canvas API.

coursera---frontend-web-ui-frameworks---bootstrap

In this session we implemented the Bootstrap and other tools and frameworks. We implemented task-runners such as Grunt and Gulp. We developed a complete restaurant website in this course from the scratch using Java Script functionalities.

coursera---html-css-js---assignment1

Implementing Forms, Styles and CSS

coursera---html-css-js---assignment2

Find the color probability game using HTML

coursera---html-css-js---assignment3

Matching Game using JS - Here we divide the GUI into two halves and randomly display smiley images. On one side there will be an extra smiley. If the player clicks on the correct one, he gets a point. The game progresses exponentially.

goget-searchengine---information-retrieval

The purpose of this project is to implement the academic project on informationretrieval(IR) of unstructured content. Unstructured content typically includes text,music,video,or still-images. This evaluation focuses on the retrieval of unstructured text. This project targets at ranking and retrieval of documents mainly based on the similarities between Query Vector and Document Vector.

mining-special-data---error-correction-and-performance-assessment

mlem2---datamining

In this project, we present the newest version of the MLEM2 algorithm for rule induction, a basic component of the LERS data mining system. This version of the MLEM2 algorithm is based on local lower and upper approximations, and in its current form is presented in this project for the first time. Additionally, we present results of experiments comparing the local version of the MLEM2 algorithm for rule induction with an older version of MLEM2, which was based on global lower and upper approximations. Our experiments show that the local version of MLEM2 is significantly better than the global version of MLEM2 (2% significance level, two-tailed Wilcoxon test).

software-modelling---theorem-provers---program-verification---cryptography

Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs. Typical applications include the certification of properties of programming languages (e.g. the CompCert compiler certification project, or the Bedrock verified low-level programming library), the formalization of mathematics (e.g. the full formalization of the Feit-Thompson theorem or homotopy type theory) and teaching.