Posts by Tags

algebra

Polynomial Algorithms

10 minute read

Published:

This post introduces some tricks on polynomials widely used in ICPC. I will try to practice algebraic knowledge as well.

Chess Picking Problem

3 minute read

Published:

Rephrase the chess picking problem in a more formal way.

Algebra Miscs

15 minute read

Published:

Misc things that are taught in class but not written in the note of MATH 210.

algorithm

Polynomial Algorithms

10 minute read

Published:

This post introduces some tricks on polynomials widely used in ICPC. I will try to practice algebraic knowledge as well.

Chess Picking Problem

3 minute read

Published:

Rephrase the chess picking problem in a more formal way.

LIS and network flow

19 minute read

Published:

This post discusses Longest Increasing Subsequence (LIS) and network flow problem.

The sqrt thesis of mixing strategies

23 minute read

Published:

When solving a problem, it is common that we have two different strategies that fit in different cases. For example, one algorithm may have a better time complexity but uses more memory than the other. Or, one is fast when there are only a few of large objects, but the other works better when there are many small objects. However, I found that there usually exists a solution which is a naive mixture of the two strategies, and its performance will be the sqrt of the two.

api

Service Invocation: A Brief Survey

30 minute read

Published:

Service invocation is tricky. The protocol itself seems to be super simple: we call a function, and it returns. But the problem is, when the function is on another machine, how we know the state of that machine / the whole system. The developers of the caller do not want to care, so we protocol designers should care for them. But trying to make everyone happy is so tough here.

NDN API 1: Encoding

21 minute read

Published:

TL; DR: Reflection should be used for encoding or serilization.

combinatorics

Chess Picking Problem

3 minute read

Published:

Rephrase the chess picking problem in a more formal way.

Residue Theorem and its Application

8 minute read

Published:

This post makes notes on residue theorem and its application, since most non-mathematicians only need to remember this after learning complex analysis. Some definitions may be not defined very rigorously from a complex analysis view.

LIS and network flow

19 minute read

Published:

This post discusses Longest Increasing Subsequence (LIS) and network flow problem.

complex analysis

Residue Theorem and its Application

8 minute read

Published:

This post makes notes on residue theorem and its application, since most non-mathematicians only need to remember this after learning complex analysis. Some definitions may be not defined very rigorously from a complex analysis view.

course review

data structure

The sqrt thesis of mixing strategies

23 minute read

Published:

When solving a problem, it is common that we have two different strategies that fit in different cases. For example, one algorithm may have a better time complexity but uses more memory than the other. Or, one is fast when there are only a few of large objects, but the other works better when there are many small objects. However, I found that there usually exists a solution which is a naive mixture of the two strategies, and its performance will be the sqrt of the two.

functional analysis

応用解析学通論

less than 1 minute read

Published:

京都大学の応用解析学通論Bのノート

logic

math

Stability of DLedger

5 minute read

Published:

In this post I want to analyze the stability of Dledger, a DAG-based distributed logging system.

ndn

Service Invocation: A Brief Survey

30 minute read

Published:

Service invocation is tricky. The protocol itself seems to be super simple: we call a function, and it returns. But the problem is, when the function is on another machine, how we know the state of that machine / the whole system. The developers of the caller do not want to care, so we protocol designers should care for them. But trying to make everyone happy is so tough here.

Service Discovery: A Survey

19 minute read

Published:

There is always a need for service discovery and load balancing, but no universal solution. Sometimes naive ways may satisfy most needs.

Confusing Terms

6 minute read

Published:

I find that some terms are confusing.

NDN API 1: Encoding

21 minute read

Published:

TL; DR: Reflection should be used for encoding or serilization.

network flow

LIS and network flow

19 minute read

Published:

This post discusses Longest Increasing Subsequence (LIS) and network flow problem.

service-dicvovery

Service Discovery: A Survey

19 minute read

Published:

There is always a need for service discovery and load balancing, but no universal solution. Sometimes naive ways may satisfy most needs.

service-invocation

Service Invocation: A Brief Survey

30 minute read

Published:

Service invocation is tricky. The protocol itself seems to be super simple: we call a function, and it returns. But the problem is, when the function is on another machine, how we know the state of that machine / the whole system. The developers of the caller do not want to care, so we protocol designers should care for them. But trying to make everyone happy is so tough here.

term

Confusing Terms

6 minute read

Published:

I find that some terms are confusing.