Infinite


  • Home

  • Categories

  • Archives

  • Tags

  • Sitemap

  • RSS

  • Search

first docker app

Posted on 2018-09-05 | Post modified 2018-11-06 | In docker | Visitors

Preparation

Create a new directory where all the files would live.

Read more »

PY ML 3: KMeans

Posted on 2018-08-27 | Post modified 2018-11-06 | In Practical Machine Learning with Python | Visitors

KMeans Code

Read more »

PY ML 2: classification

Posted on 2018-08-27 | Post modified 2018-11-06 | In Practical Machine Learning with Python | Visitors

KNN Code

Read more »

PY ML 1: Regression

Posted on 2018-08-26 | Post modified 2018-11-06 | In Practical Machine Learning with Python | Visitors

Regression Code

Read more »

MPI configuration

Posted on 2018-07-25 | Post modified 2018-11-06 | In other | Visitors

Install MPI in each node server

http://mpitutorial.com/tutorials/installing-mpich2/

Run hello world.

这里只是简单的把编译程序复制到用户的 home 目录下,然后执行。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
# replace hello.c with your own source code file name
filename=hello.c
output=hello

master=10.0.0.10
slave1=10.0.0.15
slave2=10.0.0.16
slave3=10.0.0.18

# compile the source code
mpicc -o $output $filename

# copy the executable file to other slaves
scp $output $USER@$slave1:~/
scp $output $USER@$slave2:~/
scp $output $USER@$slave3:~/

# deploy the program to 4 nodes
mpirun -n 4 -H $master,$slave1,$slave2,$slave3 ./$output

Read more »

Review: SuRF: Practical Range Query Filtering with Fast Succinct Tries

Posted on 2018-07-18 | Post modified 2018-11-06 | In review | Visitors

Succinct Data Structure

Succinct: expressed clearly and in a few words. 中文意思就是简洁明了的。首先看一下 wiki 引用对于 succinct data structure 的描述:

In computer science, a succinct data structure is a data structure which uses an amount of space that is “close” to the information-theoretic lower bound, but (unlike other compressed representations) still allows for efficient query operations.

Suppose that Z is the information-theoretical optimal number of bits needed to store some data. A representation of this data is called:

  • implicit: if it takes Z+O(1) bits of space,
  • succinct: if it takes Z+o(Z) bits of space,
  • compact: if it takes O(Z) bits of space.

For example, a data structure that uses 2Z bits of storage is compact, Z + \sqrt{Z} bits is succinct, Z+lgZ bits is also succinct, and Z+3 bits is implicit.

Read more »
123…11
XS Zhao

XS Zhao

63 posts
13 categories
37 tags
RSS
GitHub Facebook Instagram E-Mail
Recent Posts
  1. Ethereum Project Infrastructure
  2. Dapp: Lottery Contract
  3. Write ethereum test code
  4. Review: bLSM:* A General Purpose Log Structured Merge Tree
  5. Review: ElasticBF: Fine-grained and Elastic Bloom Filter Towards Efficient Read for LSM-tree-based KV Stores
© 2017 - 2019 XS Zhao
Powered by Hexo
Theme - NexT.Muse
0%