indrayudhroy

100-days-of-code

Fork this template for the 100 days journal - to keep yourself accountable (multiple languages available)

Battleships

An implementation in C++ of the well known game of Battleships, with a powerful Artificial Intelligence engine for the computer. This implementation is a full-fledged, feature-rich version of the game, supporting Player vs. Player, in addition to Player vs. Computer. It also contains advanced video-game features, over and above the traditional format of Battleships (optionally), such as "one-time power-ups", and a helpful Artificial Intelligence to guide novice players.

bwColorizer

Distributed-Network-Intrusion-Detection-System-with-Machine-Learning

A research & development project to create and deploy a Network-based Intrusion Detection System (IDS) to detect intruders on a distributed system. That is, it detects and classify threatening or anomalous network traffic as opposed to safe traffic and usage. The project runs on a real-time, distributed cluster on Apache Storm which processes incoming network packets, and uses our novel algorithms and Machine Learning to detect intruders. It uses supervised Machine Learning classifiers such as decision trees, ensemble decision trees, support vector machines, etc. as well as being built with the principles of anomaly-based Intrusion Detection Systems.

hello-world

Getting started.

Infosys_June_6

PoC and SQL code

keep-graph

Keep Graph is a open source clone of Google Keep. It's built on top of React and GraphQL.

milc-communication-behavior

A project to profile a benchmark to analyze its computation/communication structure. A synthetic program is used for studying network behavior.

Multi-Level-Graph-Spanners

A graph spanner is an open NP-complete problem, dealing with approximating shortest-path optimizations in a very dense graph. A spanner is a (usually sparse) graph whose shortest path distances approximate the original graph's distances (in the dense graph). The goal is to find a weighted graph over a set of points as its vertices for which there is a t-path between any pair of vertices for a fixed parameter t. A t-path is defined as a path through the graph with weight at most t times the spatial distance between its endpoints. The parameter t is called the stretch factor or dilation factor of the spanner.

proximity-search

Proximity search using a positional index.

indrayudhroy/Distributed-Network-Intrusion-Detection-System-with-Machine-Learning

A research & development project to create and deploy a Network-based Intrusion Detection System (IDS) to detect intruders on a distributed system. That is, it detects and classify threatening or anomalous network traffic as opposed to safe traffic and usage. The project runs on a real-time, distributed cluster on Apache Storm which processes incoming network packets, and uses our novel algorithms and Machine Learning to detect intruders. It uses supervised Machine Learning classifiers such as decision trees, ensemble decision trees, support vector machines, etc. as well as being built with the principles of anomaly-based Intrusion Detection Systems.

indrayudhroy/100-days-of-code

Fork this template for the 100 days journal - to keep yourself accountable (multiple languages available)

indrayudhroy/Battleships

An implementation in C++ of the well known game of Battleships, with a powerful Artificial Intelligence engine for the computer. This implementation is a full-fledged, feature-rich version of the game, supporting Player vs. Player, in addition to Player vs. Computer. It also contains advanced video-game features, over and above the traditional format of Battleships (optionally), such as "one-time power-ups", and a helpful Artificial Intelligence to guide novice players.

indrayudhroy/bwColorizer

indrayudhroy/hello-world

Getting started.

indrayudhroy/Infosys_June_6

PoC and SQL code

indrayudhroy/keep-graph

Keep Graph is a open source clone of Google Keep. It's built on top of React and GraphQL.

indrayudhroy/lit-element

A simple base class for creating fast, lightweight web components

indrayudhroy/milc-communication-behavior

A project to profile a benchmark to analyze its computation/communication structure. A synthetic program is used for studying network behavior.

indrayudhroy/mpifileutils

File utilities designed for scalability and performance.

indrayudhroy/Multi-Level-Graph-Spanners

A graph spanner is an open NP-complete problem, dealing with approximating shortest-path optimizations in a very dense graph. A spanner is a (usually sparse) graph whose shortest path distances approximate the original graph's distances (in the dense graph). The goal is to find a weighted graph over a set of points as its vertices for which there is a t-path between any pair of vertices for a fixed parameter t. A t-path is defined as a path through the graph with weight at most t times the spatial distance between its endpoints. The parameter t is called the stretch factor or dilation factor of the spanner.

indrayudhroy/proximity-search

Proximity search using a positional index.

indrayudhroy/spanner_ILP

indrayudhroy/git_training