[Read More]This is a blogging version of the guildeline on committing code to GitHub repository.
The GitHub version is available here. You are welcomed to clone/fork and use them as your team's guildeline.
[HOW TO] Commit and Code Review on GitHub
[Read More]This is a blogging version of the guildeline on committing code to GitHub repository.
The GitHub version is available here. You are welcomed to clone/fork and use them as your team's guildeline.
[Networking] Network Layer
Introduction Two key functions forwarding: move packets from router’s input to appropriate router output routing: determine route taken by packets from source to destination. Forwarding Table header value Output Link 0100 3 0101 2 0111 2 1001 1 Network Service Model Example services for individual datagrams guaranteed delivery guaranteed delivery with less than 40 msec delay Example services for a flow of datagrams in-order datagram delivery guaranteed minimum bandwidth to flow restrictions on changes in inter-packet spacing Virtual Circuit and Datagram Networks Connection, Connect-less Service Datagram network provides network-layer connectionless service.
[Read More]
[Networking] Application Layer
Principles of Network Applications 1. Network Application Architectures An application architecture is designed by application developer and dictates how the application is structured over the various end system. There are two predominant architectural paradigms used in modern network applications: the client-server architecture or the peer-to-peer (P2P) architecture.
Client-server architecture (Web, FTP, e-mail) Server has a permanent IP address. clients do not directly communicate with each other, but with server. P2P architecture: application exploits direct communication between pairs of intermittently connected hosts.
[Read More]
[Networking] Foundation of Networking
What is the internet? 1. Nuts-and-Bolts Description. connected computing devices are called hosts = end systems running network apps End systems are connected by a network of communication links and packet switches Different links can transmit data at different transmission rate: bandwidth Packet switches: takes a packet arriving on one of its incoming communication links and forwards that packet on one of its outgoing communication links types of packet switches: routers and link-layer switches route / path:the sequence of communication links and packet switches traversed by a packet from the sending end system to the receiving end system Internet service Providers (ISPs): end system access the internet through ISPs.
[Read More]
[Paper Reading] Improving Aggregate Recommendation Diversity Using Ranking Based Techniques
This paper focuses on the diversity issue in recommender system. You could find the original paper here.
[Read More][Paper Reading] Evaluation of Session Based Recommendation Algorithms
This blog is a reading note for paper Evaluation of Session-based Recommendation Algorithms. They formulate an experimental protocol for evaluating session-based RS algorithms, as well as supply a concrete performance comparison of these algorithms with variety of datasets and evaluation measures. This is a high-quality paper which shows each evaluating metrics as well as protocols in substantial details.
Introduction In academia, sequential recommendation problems are typically operationalized as the task of predicting the next user action.
[Read More]
[Introduction to Algorithm] Elementary Graph
A graph-searching algorithm can discover much about the structure of a graph. The graph algorithm is essential in social network searching, artificial intelligence, etc. This chapter mainly discusses about the representation of graphs, BFS and DFS.
Representation of Graphs
We have two kinds of graph: directed and undirected graphs. In either way, we can represent the graph in adjacency-list representation or adjacency-matrix representation.
[Read More][Introduction to Algorithm] Amortized Analysis
In amortized analysis, we can show that the average cost of an operation. An amortized analysis guarantees the average performance of each operation in the worst case.
[Read More][Introduction to Algorithm] Greedy Algorithm
Greedy Algorithm always makes the choice that looks best at the moment, which can solve many optimal problems effectively. However, local optimum does not necessarily result in the global optimum, and we need to take care of it.
[Read More]