Daniel Chin

Education
University of California, Berkeley Electrical Engineering and Computer Science, B.S. Mathematics, B.A.

2535 Channing Way | Berkeley, CA 94704 danielchin@berkeley.edu | (650) 793 - 5970

Berkeley, CA 2011 - 2015 (expected May 2015 graduation)

Relevant Coursework: Data Structures, Machine Structures, Ecient Algorithms and Intractable Problems, Computability and Complexity, Database Systems, Mathematical Logic

Work Experience
Advenira Enterprises, Inc. Engineering Intern Sunnyvale, CA May 2012 - August 2012

Created a digital database for easier management of the chemical inventory Designed and simulated tests that analyzed eectiveness of chemicals for industrial use Documented and presented results to executives in collaboration with research scientists Interface Masters Technologies Engineering Intern San Jose, CA November 2010 - March 2011

Converted the companys hard copy database of equipment sales to a digital database using SQL Wrote documentation for the database as a tutorial for the employees Quickly learned UNIX and Javascript to help redesign their website

Projects
MapReduce in the Cloud Implemented MapReduce to analyze large text les for co-occurrence and frequency of certain phrases Ran code on Amazon EC2 clusters in Java with Apache Hadoop for optimization Twitter Attitude Analyzer Determined the attitude in geographic locations towards certain phrases in Tweets Utilized dierent data structures and sorting algorithms that dealt with large amounts of data

Class Competitions
Matrix Multiply Parallelization Performance (1st Place) CS 61C (Machine Structures) Implemented single-precision general matrix multiply (SGEMM) in C with OpenMP Worked with a partner and achieved a 90% increase over the benchmark, the fastest speed in the class Utilized cache blocking, loop unrolling, padding, and multithreading for optimization Maximum Leaf Spanning Tree (MLST) Contest (1st Place) CS 170 (Ecient Algorithms and Intractable Problems) Collaborated with a team to solve the MLST problem as correctly as possible Implemented variations of algorithms documented in research papers on the topic of MLST Achieved the result that discovered spanning trees with the most leaves in the class

Skills
A Procient Languages: Python, Java, C, UNIX, HTML, CSS, L TEX Experience with: Javascript, SQL, Ruby, R Tools: Apache Hadoop, OpenMP, Django, Node.js

Personal Interests and Hobbies

Competitive strategy games