… Rough fractured section with massive voids at higher printing speed was observed on many
research findings and the tensile strength of PEEK, CF/PEEK, and GF/PEEK decreases by …

… Abstract We study a dynamically evolving directed random graph which randomly adds
vertices and directed edges using preferential attachment and prove that its vertice degree obey …

… 在下列的幾種情形中,我們探討了啟動δ∈[0,1]比例或更多的節點所需之最少種子數: G為一艾狄
胥-倫依隨機圖(Erdos-Renyi random graph)且任何一節點皆會在其有ρ∈(0,1]比例或更多的鄰居…

… From the perspective of theoretical evolution and practical … with massive data,polymorphic
heterogeneous network,complex network structure with uncertainty,and dynamic evolution …

… the evolution of industrial clusters through detailed research on the evolution mechanism …
复杂网络的研究始于20世纪60年代由Erdös和Rényi建立的随机图理论(random graph theory), …

… We apply the SPP method to graph mining and item-set … Experiments using various massive
high-dimensional data … between two groups of random variables from joint observations. …

… 通过HOT 模型与基于优先连接机理的无标度模 型PA(preferential attachment),以及基于随机
原则的无 标度模型GRG(general random graph)等在网络性能和 相关似然系数上的对比分析(如图…

… The massive historical user data can be exploited to accu… We find that the random forests
method can achieve the … Note that we only consider call detail records to construct social graph …

… In the next section (Section 2), we introduce graphparallel systems and existing graph … If a
graph partitioning algorithm distributes these vertices to random machines without awareness …