CNYAO.ME

note.yuhc.me

Sample Page – Simple Note

http://note.yuhc.me/sample-page

This is an example page. It’s different from a blog post because it will stay in one place and will show up in your site navigation (in most themes). Most people start with an About page that introduces them to potential site visitors. It might say something like this:. I’m a bike messenger by day, aspiring actor by night, and this is my blog. I live in Los Angeles, have a great dog named Jack, and I like piña coladas. (And gettin’ caught in the rain.). 8230;or something like this:. January 5, 2015.

note.yuhc.me

February 2015 – Simple Note

http://note.yuhc.me/2015/02

It’s well known that, the Euclidean algorithm can compute the greatest common divisor of integers a and b, gcd(a,b). The …. Commonly Used Active Record Operations on Rails. Migrations within Rails To generate a new migration, use $ rails generate migration MyNewMigration where MyNewMigration is the name of …. February 2, 2015. Repair Boot Issues in Ubuntu. I encountered a boot issue after I reinstalled Windows 7 several days ago. I ran both Windows 7 and Ubuntu …. Minimal x86 Kernel Practice (Basic).

note.yuhc.me

Solution to SGU #167 I-country – Simple Note

http://note.yuhc.me/2015/04/solution-to-sgu-167

April 30, 2015. Solution to SGU #167 I-country. The problem description can be found in. It asks to find the connected blocks which meet the requirements and own the largest value. The requirement is that we can move only in two directions from arbitrary block to another. For example, the following one doesn’t meet the requirement because. Needs to move in right, down and left directions to reach. A* * * * * * * B* * * *. Be the maximum oils could be get when occupying k squares in the first. At the same...

note.yuhc.me

July 2015 – Simple Note

http://note.yuhc.me/2015/07

Learn Perl in about 2 hours 30 minutes. Minimal x86 Kernel Practice (Basic). How to Read an Engineering Research Paper. Repair a broken Ext4 Superblock in Ubuntu. A Simple Explanation of Paxos, from 2PC. Install QEMU-2.2.1 on Ubuntu Server. On Triangle Count in GraphX. On Triangle Count in GraphX. On Pregel and Shortest Path Algorithm in GraphX. On PageRank using Pregel API or GraphX. On Pregel and Shortest Path Algorithm in GraphX. Proudly powered by WordPress.

note.yuhc.me

May 2015 – Simple Note

http://note.yuhc.me/2015/05

May 29, 2015. Solution to SGU #173 Coins. The transformation X contains two steps: Cyclic left shift Turn over (totally several times) k-th coin if i-th coin and …. Minimal x86 Kernel Practice (Basic). How to Read an Engineering Research Paper. Repair a broken Ext4 Superblock in Ubuntu. A Simple Explanation of Paxos, from 2PC. Install QEMU-2.2.1 on Ubuntu Server. On Triangle Count in GraphX. On Triangle Count in GraphX. On Pregel and Shortest Path Algorithm in GraphX. Proudly powered by WordPress.

note.yuhc.me

Graph Operators in GraphX – Part 2 – Simple Note

http://note.yuhc.me/2015/03/graphx-property-operator-2

Graph Operators in GraphX – Part 2. Besides the operations mentioned in Part One. GraphX also defines a special data structure for node degree in GraphOps.scala. There are three types of degree,. Is the in-degree of each vertex. Vertices whose in-degree are. Won’t be included in the result RDD. Is the out-degree of each vertex. Is the sum of. To compute the neighboring vertex degrees. EdgeDirection is defined in EdgeDirection.scala. It has three kinds of attributes:. Create the graph from. Def max(a :(Ve...

note.yuhc.me

Graph Operators in GraphX – Part 1 – Simple Note

http://note.yuhc.me/2015/03/graphx-property-operator-1

March 21, 2015. Graph Operators in GraphX – Part 1. GraphX defines several operators which can process graph information. As introduced before. Some operators are defined in Graph.scala. These are three important property operators, which will be introduced in this post. Can transform each vertex attribute in graph. Is the function from a vertex object to a new vertex value. The new graph structure is the same as the old one, so the underlying index structures can be reused. Is the new vertex data type.

note.yuhc.me

Pregel and Shortest Path Algorithm in GraphX – Simple Note

http://note.yuhc.me/2015/03/graphx-pregel-shortest-path

March 30, 2015. Pregel and Shortest Path Algorithm in GraphX. If you pay enough attention to Graph.scala. API is provided in Pregel.scala. It’s not the same as the original Pergel API, it’s Pregel-like. It implements a bulk-synchronous message-passing API, which enables the message sending computation to read both vertex attributes, and constrains messages to the graph structure. Is the vertex data type,. Is the edge data type, and. Is the Pregel message type. Each vertex in. For example, if this is.

note.yuhc.me

Data Loading in GraphX – Simple Note

http://note.yuhc.me/2015/03/data-loading-in-graphx

March 18, 2015. Data Loading in GraphX. Normally, we create the graph manually only we are practicing the tutorial or doing some debugging. We prefer to read the graph from files automatically when we write a script or a project. GraphX provides a very convenient and useful file reading and graph importing API,. Which is contained in GraphLoader.scala. Only one method is defined:. Can load a graph from an edge list formatted file. The file should only contain two integers in each line, a. Nodes represent...

note.yuhc.me

Graph Elements in GraphX – Simple Note

http://note.yuhc.me/2015/03/graphx-graph-elements/comment-page-1

May 22, 2015. Graph Elements in GraphX. It defines a abstract class. Representing a graph in which vertices and edges can be associate with arbitrary objects. The comments for. Contains mainly three objects,. The triplet is a three-node complete graph. Is the vertex attribute type, and. Is the edge attribute type. These three objects contain several sub-objects (vertex, edge and triplet), and are returned as RDDs. They are marked as. Which means they can’t be serialized. By the way, Scala provides a.