Discover @ouyanguf Open Source projects

Yang Ou (@ouyanguf)

ouyanguf

Stars
14
Global Rank 798,133 (Top 28 %)
Followers 3
Following 3
Registered about 11 years ago
Most used languages

Java
44.4 %

Scala
33.3 %

PHP
11.1 %

CSS
11.1 %
Location 🇺🇸 United States
Country Total Rank 135,062
Country Ranking

Scala
2,092

hadoop-page-rank

Iterative MapReduce program to implement Page Rank using Amazon EC2 and FutureGrid given sample graphs(each line starts with the node id and then its adjacency list).

hadoop-page-rank-new

code-practice

Code Practice in Java(Still Updating)

hadoop-word-count

Three versions of word count using Hadoop distributed computing: (1) Basic Word Count (2) Two-Word Count (3) Word Count Using Specified Word List

pastry-protocol

The goal of this project is to implement the Pastry protocol in Scala using the actor model and use a simple object access service to prove its usefulness.

ouyanguf.github.io

Personal Website

movie-time

Movie Time is a movie related website with a huge movie database that supports DVD sale, movie ranking, movie rating. And a movie related social network is attached.

distributed-debugger

Logging information about what actors send what message to what other actor can help in figuring out problems. This project consists in two phases. In phase I, logging capabilities were added to Scala so that information is captured about the execution. these logs were used to produce useful information for the user to figure out what could have gone wrong.

gossip-simulator

Gossip type algorithms can be used both for group communication and for aggregate computation. The goal of this project is to determine the convergence of such algorithms through a simulator based on actors written in Scala. Since actors in Scala are fully asynchronous, the particular type of Gossip implemented is the so called Asynchronous Gossip.

find-perfect-square

Input: The input provided (as command line to your project1.scala) will be two numbers: N and k. The overall goal of your program is to find all k consecutive numbers, starting at 1, such that the sum of squares is itself a perfect square (square of an integer). Output: Print, on independent lines, the first number in the sequence for each solution.