Match!
Bei Wang
East China University of Science and Technology
239Publications
22H-index
1,891Citations
Publications 247
Newest
#1Bei Wang (ECUST: East China University of Science and Technology)H-Index: 22
#2Yudong Sun (ECUST: East China University of Science and Technology)
Last.Xingyu Wang (ECUST: East China University of Science and Technology)H-Index: 29
view all 5 authors...
Abstract In this study, a Bayesian classifier with the multivariate distribution based on the D-vine copula model is developed and evaluated for the awake/drowsiness interpretation during the power nap. The objective is to consider the correlation among the features into the automatic classification algorithm. A power nap is a short sleep process, which is commonly considered as a supplement to the insufficient overnight sleep. It may involve the states of awake and drowsiness. Neurophysiologica...
Source
Graphs are commonly used to encode relationships among entities, yet their abstractness makes them difficult to analyze. Node-link diagrams are popular for drawing graphs, and force-directed layouts provide a flexible method for node arrangements that use local relationships in an attempt to reveal the global shape of the graph. However, clutter and overlap of unrelated structures can lead to confusing graph visualizations. This paper leverages the persistent homology features of an undirected g...
1 CitationsSource
Physical phenomena in science and engineering are frequently modeled using scalar fields. In scalar field topology, graph-based topological descriptors such as merge trees, contour trees, and Reeb graphs are commonly used to characterize topological changes in the (sub)level sets of scalar fields. One of the biggest challenges and opportunities to advance topology-based visualization is to understand and incorporate uncertainty into such topological descriptors to effectively reason about their ...
1 CitationsSource
#1Mustafa HajijH-Index: 5
#2Paul Rosen (USF: University of South Florida)H-Index: 9
Last.Bei Wang (UofU: University of Utah)H-Index: 22
view all 3 authors...
Networks are an exceedingly popular type of data for representing relationships between individuals, businesses, proteins, brain regions, telecommunication endpoints, etc. Network or graph visualization provides an intuitive way to explore the node-link structures of network data for instant sense-making. However, naive node-link diagrams can fail to convey insights regarding network structures, even for moderately sized data of a few hundred nodes. We propose to apply the mapper construction--a...
#1René CorbetH-Index: 2
#2Ulderico FugacciH-Index: 1
Last.Bei Wang (UofU: University of Utah)H-Index: 22
view all 5 authors...
Abstract Topological data analysis and its main method, persistent homology, provide a toolkit for computing topological information of high-dimensional and noisy data sets. Kernels for one-parameter persistent homology have been established to connect persistent homology with machine learning techniques with applicability on shape analysis, recognition and classification. We contribute a kernel construction for multi-parameter persistence by integrating a one-parameter kernel weighted along str...
3 CitationsSource
#1Yi-Chao Wang (SJTU: Shanghai Jiao Tong University)H-Index: 2
#2Jin-Kun Chen (SJTU: Shanghai Jiao Tong University)
Last.James Lin (SJTU: Shanghai Jiao Tong University)H-Index: 3
view all 9 authors...
The ARM-based server processors have been gaining momentum in high performance computing (HPC). While not designed specifically for HPC, Huawei Kunpeng 916 processor has 32 ARMv8 cores and is tempting for HPC workloads. However, its potential remains unknown. To throughly understand the potential, we conducted a systematic evaluation in three steps by using: 1) three well-known benchmarks (HPL, STREAM, and LMbench); 2) three typical scientific kernels (SpMV, N-body, and GEMM); 3) three widely us...
Source
#1Kevin P. Knudson (UF: University of Florida)H-Index: 6
#2Bei Wang (UofU: University of Utah)H-Index: 22
Inspired by the works of Forman on discrete Morse theory, which is a combinatorial adaptation to cell complexes of classical Morse theory on manifolds, we introduce a discrete analogue of the stratified Morse theory of Goresky and MacPherson. We describe the basics of this theory and prove fundamental theorems relating the topology of a general simplicial complex with the critical simplices of a discrete stratified Morse function on the complex. We also provide an algorithm that constructs a dis...
#1Archit Rathore (UofU: University of Utah)
#2Sourabh Palande (UofU: University of Utah)H-Index: 3
Last.Bei Wang (UofU: University of Utah)H-Index: 22
view all 6 authors...
The identification of autistic individuals using resting state functional connectivity networks can provide an objective diagnostic method for autism spectrum disorder (ASD). The present state-of-the-art machine learning model using deep learning has a classification accuracy of 70.2% on the ABIDE (Autism Brain Imaging Data Exchange) data set. In this paper, we explore the utility of topological features in the classification of ASD versus typically developing control subjects. These topological...
Source
#2Bei Wang (UofU: University of Utah)H-Index: 22
Last.Xingyu Wang (ECUST: East China University of Science and Technology)H-Index: 29
view all 4 authors...
Sleep staging has important significance for the monitoring, prevention and treatment of sleep disorders. In this study, the clustering algorithm of K-means is investigated in order to realize the automatic sleep stage classification. Unlike the traditional K-means clustering algorithm, density-distance-based processing procedures were presented to determine the cluster centers. Additionally, the clustering results were amended based on the regularity of sleep stages during one's overnight sleep...
Source
#1Michael J. Catanzaro (Iowa State University)
#2Justin Curry (University at Albany, SUNY)H-Index: 5
Last.Matthew Zabka (Southwest Minnesota State University)H-Index: 1
view all 8 authors...
We consider different notions of equivalence for Morse functions on the sphere in the context of persistent homology, and introduce new invariants to study these equivalence classes. These new invariants are as simple, but more discerning than existing topological invariants, such as persistence barcodes and Reeb graphs. We give a method to relate any two Morse--Smale vector fields on the sphere by a sequence of fundamental moves by considering graph-equivalent Morse functions. We also explore t...
1 Citations
12345678910