Research Assistant @ - proposed the algorithms about finding dense subgraphs in large temporal networks - developed a data-driven approach to identifying k time intervals, instead of O(T^2) time intervals, which strikes a balance between the accuracy and computational complexity. - After showing that the problem has no constant factor approximation algorithms, developed better algorithm heuristics to attack the problem, by building the connection of nding dense subgraphs with a variant of the Prize Collecting Steiner Tree problem. - experimentally verified the effectiveness and efficiency of our approach, using both real-life and synthetic data. - teamed-work on a paper (on going) From January 2015 to August 2015 (8 months) product manager (internship) @ - Team member of entrepreneurial crew, E-business housekeeping team project - Implemented training program for 300+ participants including housekeeping skill training and application training - Analyzed participating rate and work performance of housekeeping workers and designed recruiting strategies - Established database of 1,000+ pieces of information of housekeeping workers through VBA tools From June 2014 to July 2014 (2 months)

Master's degree, Software Engineering @ Carnegie Mellon University From 2015 to 2016 Bachelor of Engineering (BE), Computer Science and Technology @ Beihang University From 2011 to 2015 Information Science @ University of California, Berkeley From 2013 to 2013 Luoshu Wang is skilled in: Java, Android, C, Python, C++, cloud computing, SQL, C#, Linux, Entrepreneurship, product management, JavaScript, CSS, HTML, MATLAB, OpenGL, VBA, marketing