Seraphina

About meHello! My name is Haoyu Wu. You can call me Seraphina. I'm a master student of University of Southern California. My major is Computer Engineering. I’m very communicative, detail-oriented, and versatile. I like to think of myself as a team player. While I don’t mind taking on solo projects, I prefer to work with others. I like to think that I’m persistent and creative. Working in Software Engineering, these traits have served me well. Outside of work, I enjoy my leisure time. I ...

I used to be interviewed with Java and Python. Currently, I’m preparing an interview with C++. Here are some top C++ questions that are frequently asked in a real interview. Question: Define C++?Answer: C++ is a computer programming language that is a superset of C wherein additional features are made in the C language. Question: Can we call C++ OOPS? and Why?Answer: Yes, C++ can be called OOPS. The full form of OOPS is an Object-Oriented Programming System, which means a paradigm that provide ...

In the class Data Network, professor Neely taught about the Poisson Point Process in 2 Dimension. How to analyze data connection probability if different data access points pop according to Poisson Process in 2 dimensions. However, I was thinking about how to extend this scenario into 3 dimensions during the class. I thought this would be an interesting topic to do research on. Since it would involve different scenarios and it would be closer to real-world problems. I Introductionλ = points/vol ...

I Project DescriptionMany network related applications require fast identification of the shortest path between a pair of nodes to optimize routing performance. Given a weighted graph 𝐺(𝑉, 𝐸) consisting of a set of vertices 𝑉 and a set of edges 𝐸, we aim at finding the path in 𝐺 connecting the source vertex 𝑣1 and the destination vertex 𝑣𝑛, such that the total edge weight along the path is minimized.This project implements a distributed system to compute shortest path based on client’s ...

When I learn the discussion of Leetcode 1755, I found a really interesting linesum+= nums[j]*((i>>j)&1);And I don’t know what’s the meaning. Then I realize I need to get deep thought about Bitwise Operators.（i>>j&1) means in the binary of i, count from right to left and take the value at the position of j+1. If we write in Java code, it should be: 1234int a = i;a = a / (int)pow(2, j);if (a % 2 == 0)return 0;else return 1; Determine the odd and even n ...

This project was completed by my friend and I and it was put into use in October 2019.Link: https://usgolife.com Requirements Analysis1.1 User Module1) Registration page Check whether the user name has been registered during registration. Complete the registration of user information Send an email to the user’s registered mailbox, and the user clicks the activation link in the email to complete the activation of the user account. 2) Landing page Realize user login function 3) User Center The u ...

As we know, JWT(JSON Web Token) is very useful in the authorization scenario. Here, I will list all steps when I need to get JWT in Node.js. I Initial preparationsIf you haven’t already, set up the Node environment for this project. Then, install the following packages that we will be using for this tutorial. Express: The Node.js framework we will be using Cookie-Parser: Since we will be sending the JWT token in a cookie, use this package to parse the cookie sent along with requests Body-Pars ...

For the extraction of color and texture part, see Content-based Image Retrieved System I II Realization HOG-based shape feature extraction HOG (Histogram of Oriented Gradient) means the histogram of orientation gradient, which is a description of the histogram of gradient orientation by counting the number of orientations of a certain pixel or pixel area edge in the image local features. By normalizing the image to form a consistent spatial density matrix and other methods, Hog’s calculations h ...

I DescriptionWith the development of image processing technology and machine learning, image retrieval is a technology that combines them perfectly and plays an indispensable role in today’s network world. The main contents are as followings: First of all, acquisition of database images. I have obtained a large number of training sets for feature extraction through reptiles, and all database images are processed by foreground extraction. By foreground extraction, we can directly extract the main ...

Welcome! This note is about a wonderful data structure - PriorityQueue (Heap).I think I need to write by myself since I have been asked about heap sort in the real interview of Byte Dance. During that interview, I have some ideas, but not very clear. Therefore, I found that people cannot make impressive performance during an interview unless you can totally understand the whole information about one particular technical point. I About Heap sortHeap Sort Algorithm for sorting in increasing order ...