prashanth08 Goto Github PK
Name: Prashanth Basappa
Type: User
Company: Amazon
Location: Seattle, WA
Name: Prashanth Basappa
Type: User
Company: Amazon
Location: Seattle, WA
Amazon Redshift offers a common query interface against data stored in fast, local storage as well as data from high-capacity, inexpensive storage (S3). This workshop will cover the basics of this tiered storage model and outline the design patterns you can leverage to get the most from large volumes of data. You will build out your own Redshift cluster with multiple data sets to illustrate the trade-offs between the storage systems. By the time you leave, you’ll know how to distribute your data and design your DDL to deliver the best data warehouse for your business.
I designed and implemented a tangible game interface using projector-camera systems. The system offers a simple and quick setup and economic design. The projection onto a paper board held by the user provides more direct viewing as well as more natural and flexible interaction than bulky HMD’s or monitor-based game interfaces. Homography calibration techniques are used to provide geometrically compensated projections on the board with robustness and accuracy. With the prevalence of low-cost projectors and cameras, more and more projector based entertainment systems come into existence. Traditional displays such as CRT monitors and LCD panels are limited by their display size and heavy weight. For large-scale display walls, projectors provide better display quality compared to screens because of the lack of physical seams. However, entertainment activities involving projectors are usually watching movies, playing video games, etc. which only exploit the projector’s characteristics in creating large displays. Cameras, if combined with projectors, can enable an intelligent projection system to project certain content and “see” it at the same time. This empowers a projector-camera system to support more complex interactions with the virtual and real world. A projector’s capability of projecting images onto objects or surfaces, combined with a camera’s capability of seeing the objects and surfaces, enables the use of projector-camera systems in a variety of augmented reality applications.
Boyce–Codd normal form (or BCNF or 3.5NF) is a normal form used in database normalization. It is a slightly stronger version of the third normal form (3NF). BCNF was developed in 1974 by Raymond F. Boyce and Edgar F. Codd to address certain types of anomaly not dealt with by 3NF as originally defined.
A Byte of Python book
Data Science Crash Course for Cornell Data Science
My final semester Master of Engineering project was performed under the guidance of Prof. Stuart Staniford and was integrated into a local startup in Ithaca - Cayuga Networks (http://www.cayuganetworks.com/). The primary aim of this research project was to be able to play potentially malicious HTTP requests in one or many application servers hosted on honeypots and determine its anomalousness based on its health. Real-time Shell Shock, SQL Injection web attacks were detected on Cornell's network.
Computed Page Rank for a large Web graph (685230 nodes, 7600595 edges) using AWS Elastic Map Reduce and Hadoop. Increased Convergence Rate of Page Rank by applying Jacobi's Block Page Rank method on partitioned graph. Further improved performance by using Gauss Seidel method instead of Jacobi's. Also analyzed performance of the algorithm on a randomly partitioned graph.
k-Means allows us to partition vectorial data into k clusters.
A Hamiltonian path or traceable path is a path that visits each vertex exactly once. A graph that contains a Hamiltonian path is called a traceable graph. A graph is Hamiltonian-connected if for every pair of vertices there is a Hamiltonian path between the two vertices. A Hamiltonian cycle, Hamiltonian circuit, vertex tour or graph cycle is a cycle that visits each vertex exactly once (except for the vertex that is both the start and end, which is visited twice). A graph that contains a Hamiltonian cycle is called a Hamiltonian graph.
ISAM stands for Indexed Sequential Access Method where data is organized into records which are composed of fixed length fields.
This project provides a framework for Scalable and Available Website that is resilient to K server node failures. This framework uses Gossip protocol so that each server knows which other servers are up and RPCs to read and write session states.
A first fit linked list-backed malloc implementation
Built a mini-search engine in Java using Lucene by indexing the query and documents for given set of collections.
Enhanced the search engine by adding pseudo relevance and rochhio relevance feedback along with complete clustering.
The main objective of this project is to simulate and analyze protocols associated with Alternate path routing (APR) which can be used to achieve efficient routing in communications networks. We describe the link state routing approach to APR in connection-oriented networks, and evaluate their performance using simulations. The source node transmits the node to its nearest neighbor and depending on the approach, alternate paths can be computed at intermediate nodes. We present initial simulation results to show the working and mechanism of APR using J2ME Wireless Toolkit. Further, we look at full network level privacy spectrum which comprises of identity, route, location and data privacy. Existing privacy schemes of wireless sensor networks only provide partial network level privacy. In this project, we propose full network level privacy solution that addresses this problem in APR protocols. This solution comprises of Identity, Route, Location (IRL) and data privacy mechanism that collectively provides protection against privacy disclosure attacks such as eavesdropping and hop-by-hop trace back attacks.
Build an Active/Active Multi-Region Serverless Application for Resilience and High Availability
Worked along with Prof Dr.Shalabh Bhatnagar to introduce a ‘Discrete Event Simulation Approach’ mechanism | Worked as a Project Trainee on a project on Routing in Communication Networks | Designed algorithm to generate discrete and continuous random variables | Implemented the M/M/c Queuing Theory with varying probabilities | Worked on Spall’s SPSA (Simultaneous perturbation stochastic approximation) algorithm. It is used to optimize systems with multiple unknown parameters using stochastic approximation.
Papers from the computer science community to read and discuss.
https://isis2.codeplex.com/. In this assignment, we were asked to port project 3 on a EC2 instance and vary the number of clients to access the WCF service running on the cloud and observe the variation in results.
Built a network port scan detector in C, to identify various TCP port scan attacks.
http://www.cs.cornell.edu/Courses/cs5412/2015sp/projects.htm. A simple realtime web application that will determine and show the locations of the user’s input address directly on a map along with the nearest restaurants extracted from a large CSV file located within a particular radius. For this purpose I am using Node.js and MongoDB for the server side and the HTML5 for front end. Node.jsis an asynchronous web server which is built on the Google V8 JavaScript engine and is a perfect solution as a backend for realtime apps. My app will let users see addresses on the map with the help of the MongoDB which is queried on the zipcode of the restaurants for a realtime data channel. Our example will work in all modern browsers that support the HTML5.
Presented a demo where the back end of the proposed system used node.js script to store data in mongo database. Implemented the base64 method to encode the image, then stored it using mongo’s BinData type as a BSON bit array. This approach utilized 20% less space than the original binary image and also resulted in a 10x increase in server’s responsiveness.
Basic OS sync q's
The primary objective of this project was to gain experience in porting a program to the cloud and talking to it from a browser -- a real hands-on experience of the full sequence of cloud technologies.
A meta-JavaScript adventure game by Alex Nisnevich and Greg Shuflin.
Practical experience in exploiting computer vulnerabilities like buffer overflow,system vulnerability etc
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.