# Minimal x86 Kernel Practice (Basic)

The post is to present basic knowledge of the minimal x86 kernel. The project is hosted on GitHub. This work follows …

Skip to content
# Simple Note

## Full of worms

# Tag: programming

# Minimal x86 Kernel Practice (Basic)

### July 2015

# Learn Perl in about 2 hours 30 minutes

### May 2015

# Solution to SGU #173 Coins

### April 2015

# Solution to SGU #167 I-country

# The Solution to MSBOP 2015 Warmup

### March 2015

# Triangle Count in GraphX

# PageRank using Pregel API or GraphX

# Pregel and Shortest Path Algorithm in GraphX

# Graph Operators in GraphX – Part 2

# Graph Operators in GraphX – Part 1

The post is to present basic knowledge of the minimal x86 kernel. The project is hosted on GitHub. This work follows …

This article is copied from Things Of Interest (qntm.org) without any changes. All the copyrights belongs to the author Sam Hughes (many thanks …

The transformation X contains two steps: Cyclic left shift Turn over (totally several times) k-th coin if i-th coin and …

The problem description can be found in . It asks to find the connected blocks which meet the requirements and …

The following includes the solution to the first two problems in MSBoP 2015 Warmup. The third problem seems a maximum …

Triangle Count is very useful in social network analysis. The triangle is a three-node small graph, where every two nodes …

GraphX provides PageRank API for users to calculate the PageRank of a graph conveniently. The API is defined in [[lib/PageRank.scala]]. …

If you pay enough attention to Graph.scala, you may find cache function. It can cache the graph at specific storage …

Besides the operations mentioned in Part One, GraphX also defines a special data structure for node degree in GraphOps.scala, stored …

GraphX defines several operators which can process graph information. As introduced before, some operators are defined in Graph.scala, such as …

Close Drawer
## Simple Note