NORTHLINE
RECORDS — WRITING

Things worth keeping.

Research, working notes, and small observations.
A collection in progress, arranged from newest to oldest.

THE RECORDS26 records
RECORD / 032

What is Base64 and how to base anything?

CTF3 min read

When you see a string like RG8gdSBrbm93IEJBU0U2ND8=, random letters and numbers with = at the end, you should guess it might be a Base64 string. How does it work? How to write you

READ
RECORD / 046

What is Sepeculative Decoding

Speculative Decoding14 min read

We have a slow, big target model M_p, inference from which we're trying to accelerate (distribution p(x)). We also have a quick, efficient approximation model M_q (distribution q(x

READ
RECORD / 037

What is KV Cache

LLM7 min read

问各路 ai 半天也没怎么特别搞清楚,最后总算找到一个讲的不错的 🤪。

READ
RECORD / 028

复刻明日方舟官网粒子特效

FrontEnd4 min read

看到这个粒子效果,我第一反应是真实的物理模拟,然后我嗯写俩小时加速度写了个抽象玩意出来😎,思路错的很。还好洗澡的时候想明白了()

READ
RECORD / 045

TX·IEG菁英班3期作业wp

Re16 min read

使用Windows API CreateRemoteThread 远程注入模块到 crackme 进程中并且不崩溃,然后使用 ark 工具(例如 processhacker 等)能够查看注入模块的信息;

READ
RECORD / 030

2023·CSSS安全招新MISC部分

CTF4 min read

四个阿拉伯数字表示一个数字,由此出发,我发现我刚才那一串 01 写反了,要倒着看:

READ
RECORD / 053

UDP打洞理论及实现

Linux4 min read

NAT(Network Address Translation,网络地址转换),是一种在IP数据包通过路由器或防火墙时重写IP地址或目的IP地址的技术。这种技术使得多台主机可以通过一个共有IP地址访问互联网的私有网络中,解决了IPv4地址短缺的问题[2]。

READ
RECORD / 041

Linux初步

Linux1 min read

VMware 安卓 Ubuntu,固定 IP,SSH 远程登录

READ
RECORD / 043

Parameterized algorithms

Algorithms59 min read

F is the family of sets over a universe U, k is a positive integer. The task is to check whether there exists a subfamily F' \subseteq F of size k that covers U, which means that e

READ
RECORD / 052

Little Vampire

Unity7 min read

前面的都好办,和C++啥的都大差不差,后面的给我看的云里雾里,要用的话再看吧

READ
RECORD / 044

QQ机器人制作

Bot1 min read

BV1aZ4y1f7e2是很好的教程,我自己摸索很久最后还是看了这个教程,简单有效

READ
RECORD / 048

暑期集训 Data Structures

ACM22 min read

题意:有n个罐子,每个罐子有坚固度a_i,同时有m个钥匙,每个钥匙型号为b_i,可以打开坚固度恰好为b_i的罐子。我们可以不断攻击罐子,每次攻击让罐子的坚固度x变为x/d(向下取整)。Q次询问,每次询问L到R区间,在满足用钥匙开罐子最多的情况下,使用钥匙的最少数。

READ
RECORD / 047

暑期集训DP

ACM21 min read

题意: 有A,B两个字符串,求f(a,b)_{max} = x*LCS(a,b)-y*|a|-z*|b|,其中x,y,z是题目里给的常数,a,b是A,B在子串。

READ
RECORD / 049

暑期集训图论

ACM29 min read

题意:给定一个无向连通图,求至少要去掉几条边才能使图不连通,即求无向连通图的最小割

READ
RECORD / 050

暑期集训数学和计算几何

ACM20 min read

题意:给定n个点,顺次连接这些点得到折线。m次询问,每次给出一个点,询问折线绕该点的回转数

READ