PowerLyra
309
Citation
58
Reference
10
Related Paper
Citation Trend
Abstract:
Natural graphs with skewed distribution raise unique challenges to graph computation and partitioning. Existing graph-parallel systems usually use a "one size fits all" design that uniformly processes all vertices, which either suffer from notable load imbalance and high contention for high-degree vertices (e.g., Pregel and GraphLab), or incur high communication cost and memory consumption even for low-degree vertices (e.g., PowerGraph and GraphX).Keywords:
Degree (music)
Graph partition
This paper analyzes the characteristics of degree category and the degree quantity expressed by the characteristics, and also analyzes the degree quantity marker function of the ‘you’ degree structure. The characteristics of degree category are hierarchy, subjectivity and fuzziness. Firstly, the hierarchical characteristics are semantically reflected in the degree of dispersion and degree of solidification. Whether a certain structure is modified by degree adverb as a standard to analyze, ‘有+NP’ to express the degree of dispersion, in contrast, ‘有X有Y’, ‘有的是X’ and ‘有X那麽A’ express the degree of solidification. Secondly, the characteristics of subjectivity are semantically reflected in subjective degree and objective degree. Analyzing with the object of comparison as the standard, ‘有點, 有些’ represents the subjective degree, while ‘有的是X’, ‘有X有Y’ and ‘有X那麽A’ represent the objective degree. Thirdly, the characteristics of fuzziness are semantically reflected as the degree of vagueness and the degree of certainty. In terms of the magnitude and point of expression as the standard to analyze, ‘有+NP’ express the degree of vagueness, ‘有點, 有些’, ‘有X有Y’, ‘有的是X’ and ‘有X那麽A’ express the degree of certainty.
Degree (music)
Vagueness
Cite
Citations (0)
This paper considers the degree-diameter problem for undirected circulant graphs. The focus is on extremal graphs of given (small) degree and arbitrary diameter. The published literature only covers graphs of up to degree 7. The approach used to establish the results for degree 6 and 7 has been extended successfully to degree 8 and 9. Candidate graphs are defined as functions of the diameter for both degree 8 and degree 9. They are proven to be extremal for small diameters. They establish new lower bounds for all greater diameters, and are conjectured to be extremal. The existence of the degree 8 solution is proved for all diameters. Finally some conjectures are made about solutions for circulant graphs of higher degree.
Degree (music)
Cite
Citations (0)
765. We have already shewn how equations of the third degree are resolved by the rule of Cardan; so that the principal object, with regard to equations of the fourth degree, is to reduce them to equations of the third degree. For it is impossible to resolve, generally, equations of the fourth degree, without the aid of those of the third; since, when we have determined one of the roots, the others always depend on an equation of the third degree. And hence we may conclude, that the resolution of equations of higher dimensions presupposes the resolution of all equations of lower degrees.
Degree (music)
Independent equation
Cite
Citations (0)
Equivalent sphere illumination (ESI) can be calculated by an efficient technique that will make computation for many target locations in a room practical. The technique can be easily coded into a computer program, and results will be provided much faster than programs based on other computational techniques. Computations for the background and task luminance of a target are separated into two components: Part I of this paper considers the calculation of the direct components (the Appendices give a specific algorithm for their computation); Part II considers the computation of the reflected components.
Cite
Citations (25)
In Saccharomyces cerevisiae, we synthesized and secreted L-HBVsAg (named as pre-S(Met1 to Asn174)::S(Met175 to Ile400)) and three mutants, i.e., pre-S°°::S (Asn15Gln and Asn123Gln), pre-S°°::S° (Asn15Gln, Asn123Gln, and Asn320Gln), and pre-S°°::S°° (Asn15Gln, Asn123Gln, Asn233Gln, and Asn320Gln). All of the secreted pre-S::S was N-glycosylated, i.e., hyper-mannosylated. In the secretion of pre-S°°::S and pre-S°°::S°, besides the hyper-mannosylated form, another immunoreactive protein with much lower molecular mass was observed, which seems to be unglycosylated form of pre-S°°::S and pre-S°°::S°. Only a part of the secreted pre-S°°::S or pre-S°°::S° molecules was N-glycosylated, and the site for the partial N-glycosylation seems to be Asn233 in S-antigen region. Compared to the N-glycosylated pre-S°°::S and pre-S°°::S°, pre-S°°::S°° (non-N-glycosylated mutant) was secreted with lower secretion efficiency but showed apparent immunoreactivity to anti-S antigen monoclonal Ab. Interestingly, unlike pre-S°°::S°° with authentic C-terminus, the recombinant pre-S°°::S°° with C-terminal myc or poly-histidine tag (pre-S°°::S°°::tag) was almost all aggregated into insoluble proteins in the intracellular region. Conclusively, the C-terminal sequence and glycosylation in S-antigen region seem to be of crucial importance in determining the secretion efficiency of L-HBVsAg in S. cerevisiae. © 2005 Wiley Periodicals, Inc.
Degree (music)
Degree of polymerization
First-degree relatives
Cite
Citations (5)
Degree (music)
Scale-free network
Synchronization networks
Cite
Citations (80)
The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations. In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that this bound is optimal. As a direct consequence, we prove an upper bound for the last fall degree and a Macaulay bound.
Degree (music)
Cite
Citations (0)
Degree (music)
Cite
Citations (0)