Yuanqing Ye
Pittsburgh, Pennsylvania, United States
3K followers
500+ connections
About
I am a master's student in Electrical and Computer Engineering Department at Carnegie…
Experience
Education
Volunteer Experience
-
Team Leader
Yuanzhiyuan Volunteer Teacher Association
- Present 12 years 10 months
Education
Publications
-
Performance Comparison between Network Coding in Space and Routing in Space
WIT Press
Network coding in geometric space, a new research direction also known as Space Information Flow, is a promising research field which shows the superiority of network coding in space over routing in space. Present literature proves that given six terminal nodes, network coding in space is strictly superior to routing in space in terms of single-source multicast in regular (5+1) model, in which five terminal nodes forms a regular pentagon centered at a terminal node. In order to compare the…
Network coding in geometric space, a new research direction also known as Space Information Flow, is a promising research field which shows the superiority of network coding in space over routing in space. Present literature proves that given six terminal nodes, network coding in space is strictly superior to routing in space in terms of single-source multicast in regular (5+1) model, in which five terminal nodes forms a regular pentagon centered at a terminal node. In order to compare the performance between network coding in space and routing in space, this paper quantitatively studies two classes of network coding in space and optimal routing in space when any terminal node moves arbitrarily in two-dimensional Euclidean space, and cost advantage is used as the metric. Furthermore, the upper-bound of cost advantage is figured out as well as the region where network coding in space is superior to routing in space. Several properties of Space Information Flow are also presented.
Other authors -
Courses
-
Applied Machine Learning
18899 K2
-
Cognitive Video
18799
-
Computer Networks
-
-
Computer Vision
16720
-
Data & Inference
18899 K1
-
Data Structures
-
-
Data Structures for Application Programmers
08722
-
Distributed Systems
15440
-
Intro to Computer Systems
15213
-
Introduction to Machine Learning
10701
-
Numerical Methods for Engineering Design and Optimization
18660
-
Principles of Software Construction: Objects, Design and Concurrency
15214
-
Probability and Mathematics Statistic
-
-
Search Engine
11642
-
Service Oriented Computing
18655
Projects
-
Movement Decoding for Brain Computer Interfaces (BCI)
• Implemented a two-class Support Vector machine (SVM) classifier to decode BCI features
• Maximized the classification margin by Implementing the interior point algorithm, Newton method and two-level cross validation in MATLAB
• Achieved classification accuracy of 93.75% on the given real brain feature data -
Web Browser Proxy
• Implemented a concurrent multi-thread proxy in C based on HTTP/1.0 protocol
• Used semaphore to avoid multi-thread race conditions
• Applied LRU policy to cache web objects between servers and clients -
Dynamic Memory Allocator
• Designed and implemented a dynamic heap memory allocator
• Implemented library functions including malloc, free, calloc and realloc
• Implemented malloc() based on segregated doubly linked list and first-fit searching algorithm -
Map-Reduce Distributed Computing Framework
• Designed and implemented a Hadoop-like Map-Reduce Framework
• Scheduled and dispatched map and reduce tasks to worker nodes
• Maintained thread-safety using concurrent data structure
• Stored input/output files in a distributed file system(AFS)
• Provided application developers with Framework API -
Pittsburgh Urban Transit Simulator
• Designed a medium-sized extensible transit system simulator with GUI in JAVA
• Simulated the behavior of buses and riders based on real transit data in Pittsburgh
• Used Strategy pattern, Decorator pattern, Factory pattern and Builder pattern
• Analyzed the performance of transit system in scenarios where five delay factors are arbitrary applied
• Used adjacency list to store all the transit stop-time information
• Implemented Dijkstra algorithm to find the shortest path in the…• Designed a medium-sized extensible transit system simulator with GUI in JAVA
• Simulated the behavior of buses and riders based on real transit data in Pittsburgh
• Used Strategy pattern, Decorator pattern, Factory pattern and Builder pattern
• Analyzed the performance of transit system in scenarios where five delay factors are arbitrary applied
• Used adjacency list to store all the transit stop-time information
• Implemented Dijkstra algorithm to find the shortest path in the transit graph -
Simple Image Recovery
• Implemented the Orthogonal Matching Pursuit (OMP) algorithm and five-fold cross validation to calculate the discrete cosine transform (DCT) coefficients
• Achieved low mean square error, which is between 3.6%~17.3% on the given pictures -
Simple Unix Shell
• Implemented a Unix shell supporting job control and I/O redirection
• Implemented a set of signal handlers including SIGCHLD, SIGINT, SIGTSTP
• Supported switching process status between background and foreground -
Scalable Web (Online Shopping) Service
-
• Implemented 4-tier scalable service, with front-tier servers, app servers, cache and database enabled with Java RMI.
• Support auto-scaling of front-tier servers and app servers based on request coming rate and availability of servers, which can service any combinations of constant, uniform and exponential request queueing (browse / purchase) pattern.
• Support one cache semantics to provide simple consistency to upper layers.
• Statistics (ranking the 7th among all the classmates):…• Implemented 4-tier scalable service, with front-tier servers, app servers, cache and database enabled with Java RMI.
• Support auto-scaling of front-tier servers and app servers based on request coming rate and availability of servers, which can service any combinations of constant, uniform and exponential request queueing (browse / purchase) pattern.
• Support one cache semantics to provide simple consistency to upper layers.
• Statistics (ranking the 7th among all the classmates):
(1) Real Black Friday (c-125-0 0 60): Stats: {purchased=178, dropped=57, failed=2, ok=231, timeout=10, Total sales: 109385.35, Total VM time: 832234}
(2) Super Black Friday (c-100-0 0 60): Stats: {purchased=193, dropped=82, failed=1, ok=308, timeout=14, Total sales: 132044.72, Total VM time: 981342}
(3) Step Up (c-750-0,30,c-125-0 0 60): Stats: {purchased=86, dropped=58, ok=117, timeout=18, Total sales: 63348.883, Total VM time: 529260}
(4) Step Down (c-160-0,30,c-1150-0 0 60): Stats: {purchased=81, dropped=35, failed=1, ok=94, timeout=3, Total sales: 31066.406, Total VM time: 463956}
(5) Ugly (e-150-0 0 60): Stats: {purchased=141, dropped=55, failed=4, ok=162, timeout=2, Total sales: 80422.98, Total VM time: 722554}
(6) Go Crazy (e-100-0 0 60): Stats: {purchased=179, dropped=98, failed=5, ok=261, timeout=18, Total sales: 122044.56, Total VM time: 965273}
-
File-Caching Proxy for Distributed System
-
• Implemented a client-side file caching proxy with LRU policy to improve throughput of file operations from client requests to server.
• Apply one-copy semantic during each open-close session to resolve file operation conflicts between concurrent clients. One public copy for all read-only sessions, and one private copy for each write session.
• Invoke Java RMI model between Proxy and Server to achieve data serialization. -
C Library for Transparent Remote File Operations
-
• Implemented a C library to achieve RPC between client and server with typical system calls under UNIX environment, such as open, close, read, write, lseek, unlink, getdirentries, etc
• Implemented a server to receive RPC of system calls listed above. Marshall the RPC, execute system call locally and then return the result to library
• Designed the RPC protocol on top of TCP to achieve data serialization and deserialization so that RPC is transparent to client. -
Design & Implementation of a Polynomial Algorithm for Space Information Flow (SIF)
-
• Funded by National Natural Science Foundation of China
• Introduced Delaunay triangulation method to decrease the complexity of SIF algorithms
• Utilized linear programming to determine the suboptimal topology of SIF
• Conducted simulations with OR-Library using MatlabOther creators -
-
Performance Comparison Between Network Coding in Space and Routing in Space
-
• Led a national undergraduate innovation project supported by the Ministry of Education, P.R. China
• Extended the research of network coding from graph (discrete) to space (successive)
• Delved in-depth into the Regular & Irregular (5+1) Model through geometry and topology
• Obtained the specific areas where network coding in space is strictly superior to routing in space
• Discovered several properties of network coding in space that differ from those of routing in spaceOther creators -
-
Examination Paper Generation and Database Management System
-
• Designed and analyzed the examination paper auto-generating algorithm
• Programmed the login module, examination papers generating and printing module with C++
• Built the SQL Server and created related tablesOther creators -
Languages
-
English
-
-
Chinese
Native or bilingual proficiency
Organizations
-
Eta Kappa Nu (HKN) - Sigma Chapter
Member
- PresentChapters of Eta Kappa Nu, the Electrical and Computer Engineering Honor Society, exist at nearly 200 colleges and universities worldwide. Members of Sigma Chapter at Carnegie Mellon University strive to serve Carnegie Mellon's Department of Electrical and Computer Engineering and their fellow students through service projects, professional enhancement activities and social events. (http://hkn.ece.cmu.edu)
Other similar profiles
Explore collaborative articles
We’re unlocking community knowledge in a new way. Experts add insights directly into each article, started with the help of AI.
Explore MoreOthers named Yuanqing Ye
30 others named Yuanqing Ye are on LinkedIn
See others named Yuanqing Ye