Jianbin Huang
Biographic Data
| ID | 6350453 |
|---|---|
| NAME | Jianbin Huang |
| GIVEN NAMES | Jianbin |
| FAMILY NAME | Huang |
| SIGNATURE | HUANG J |
| AFFILIATIONS | Xidian University |
| ORCID | 0000-0001-8488-4111 |
| VERIFIED | Yes |
| TOTAL WORKS | 2 |
| TOTAL CITATIONS | 0 |
| AUTHOR COUNT | 2 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2004 |
| LATEST PUBLICATION YEAR | 2022 |
| H-INDEX | 0 |
Edge Repartitioning via Structure-Aware Group Migration
Graph partitioning is a mandatory step in distributed graph computing systems. Some existing systems use edge partitioning methods to partition static graphs. However, the structure of the real-world graphs changes dynamically, which leads to unnecessary vertex replicas and load imbalance, reducing the performance of graph computation. In this article, we focus on improving the lower partitioning quality caused by the dynamics of the graph struct…
A note on dependent compounds and the function of the morpheme -s in English
This paper deals with a specific type of word formation in Modern English, the noun + s + noun compound, in which {-s-} functions as a special component, namely as what we call a pseudo-morpheme. This pseudo-morpheme of English has remained relatively neglected by linguists. Our discussion focusses on the origin and function of compounds with {-s-}, and a comparison is made with compounds without {-s-}
No prominent works on this page.
A note on dependent compounds and the function of the morpheme -s in English
This paper deals with a specific type of word formation in Modern English, the noun + s + noun compound, in which {-s-} functions as a special component, namely as what we call a pseudo-morpheme. This pseudo-morpheme of English has remained relatively neglected by linguists. Our discussion focusses on the origin and function of compounds with {-s-}, and a comparison is made with compounds without {-s-}
Edge Repartitioning via Structure-Aware Group Migration
Graph partitioning is a mandatory step in distributed graph computing systems. Some existing systems use edge partitioning methods to partition static graphs. However, the structure of the real-world graphs changes dynamically, which leads to unnecessary vertex replicas and load imbalance, reducing the performance of graph computation. In this article, we focus on improving the lower partitioning quality caused by the dynamics of the graph struct…
Mathematics (2 works) · Algorithm (1 works) · Biology (1 works) · Cloud Computing and Resource Management (1 works) · Combinatorics (1 works) · Component (thermodynamics (1 works) · Compound (1 works) · Computation (1 works) · Computer Science (1 works) · Distributed computing (1 works)