Sun‐Yuan Hsieh
YOU?
Author Swipe
View article: Machine learning approach for predicting ovarian maturation in Penaeus monodon
Machine learning approach for predicting ovarian maturation in Penaeus monodon Open
View article: The g-good-neighbor diagnosability of product networks under the PMC model
The g-good-neighbor diagnosability of product networks under the PMC model Open
View article: A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: Applications to Hamiltonian decomposition and fault-tolerant Hamiltonicity
A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: Applications to Hamiltonian decomposition and fault-tolerant Hamiltonicity Open
This paper focuses on the embeddability of hypercubes in an important class of Cayley graphs, known as augmented cubes. An $n$-dimensional augmented cube $AQ_n$ is constructed by augmenting the $n$-dimensional hypercube $Q_n$ with addition…
View article: Deep learning-based prediction of mortality using brain midline shift and clinical information
Deep learning-based prediction of mortality using brain midline shift and clinical information Open
View article: The $g$-extra diagnosability of product networks under the PMC model
The $g$-extra diagnosability of product networks under the PMC model Open
View article: P253 Next-generation phenotyping facilitates the identification of structural brain malformations in rare disorders through computational brain MRI analysis
P253 Next-generation phenotyping facilitates the identification of structural brain malformations in rare disorders through computational brain MRI analysis Open
This study demonstrates the application of NGP to structural brain malformations in rare disorders. While our initial analysis focused on two specific conditions, the results highlight the feasibility of extending this approach to a broade…
View article: Efficient Hierarchical Hash-Based Multi-Field Packet Classification With Fast Update for Software Switches
Efficient Hierarchical Hash-Based Multi-Field Packet Classification With Fast Update for Software Switches Open
Packet classification that attracts wide interests in router designs is one of the most important functionalities to provide services such as QoS, packet forwarding, firewall, and VPN. With the expanding network and the rise of software-de…
View article: The complexity of strong conflict-free vertex-connection $k$-colorability
The complexity of strong conflict-free vertex-connection $k$-colorability Open
We study a new variant of graph coloring by adding a connectivity constraint. A path in a vertex-colored graph is called conflict-free if there is a color that appears exactly once on its vertices. A connected graph $G$ is said to be stron…
View article: The g-extra connectivity of graph products
The g-extra connectivity of graph products Open
View article: Deep Learning Model for Prediction of Bronchopulmonary Dysplasia in Preterm Infants Using Chest Radiographs
Deep Learning Model for Prediction of Bronchopulmonary Dysplasia in Preterm Infants Using Chest Radiographs Open
Bronchopulmonary dysplasia (BPD) is common in preterm infants and may result in pulmonary vascular disease, compromising lung function. This study aimed to employ artificial intelligence (AI) techniques to help physicians accurately diagno…
View article: Monitoring the edges of a graph using distances with given girth
Monitoring the edges of a graph using distances with given girth Open
International audience
View article: Global Reliable Diagnosis of Networks Based on Self-Comparative Diagnosis Model and G-Good-Neighbor Property
Global Reliable Diagnosis of Networks Based on Self-Comparative Diagnosis Model and G-Good-Neighbor Property Open
View article: A novel deep learning-based algorithm combining histopathological features with tissue areas to predict colorectal cancer survival from whole-slide images
A novel deep learning-based algorithm combining histopathological features with tissue areas to predict colorectal cancer survival from whole-slide images Open
View article: A Novel Relative Distance Protein Fingerprint Algorithm for Searching DNA Mimic Proteins
A Novel Relative Distance Protein Fingerprint Algorithm for Searching DNA Mimic Proteins Open
Backgground: DNA mimic proteins are relatively obscure control factors that share some similarities with DNA. They emulate the negative charge distribution of the phosphate backbone of DNA by using negatively charged amino acids, namely, a…
View article: A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks Open
View article: Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs Open
View article: On the $d$-Claw Vertex Deletion Problem
On the $d$-Claw Vertex Deletion Problem Open
Let $d$-claw (or $d$-star) stand for $K_{1,d}$, the complete bipartite graph with 1 and $d\ge 1$ vertices on each part. The $d$-claw vertex deletion problem, $d$-CLAW-VD, asks for a given graph $G$ and an integer $k$ if one can delete at m…
View article: Authentication of NIfTI Neuroimages Using Lifting Wavelet Transform, Arnold Cat Map, Z-Transform, and Hessenberg Decomposition
Authentication of NIfTI Neuroimages Using Lifting Wavelet Transform, Arnold Cat Map, Z-Transform, and Hessenberg Decomposition Open
The technological progress in digital medical imaging has enabled the diagnosis of various ailments, and thus upgraded the global healthcare system. In the era of coronavirus 2019 (COVID-19), telemedicine plays the crucial role of supporti…
View article: On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality Open
View article: On the Hardness and Approximation of the Densest $K$-Subgraph Problem in Parameterized Metric Graphs
On the Hardness and Approximation of the Densest $K$-Subgraph Problem in Parameterized Metric Graphs Open
View article: Improved Ip Lookup Technology for Trie-Based Methods
Improved Ip Lookup Technology for Trie-Based Methods Open
View article: A Scalable Analytical Framework for Complex Event Episode Mining With Various Domains Applications
A Scalable Analytical Framework for Complex Event Episode Mining With Various Domains Applications Open
With the ubiquity of sensor networks and smart devices that continuously collect data, we face the challenge of analyzing the growing stream of data in real time. In recent years, there has been a huge need to gain useful knowledge by incr…
View article: G-Good-Neighbour Diagnosability Under the Modified Comparison Model for Multiprocessor Systems
G-Good-Neighbour Diagnosability Under the Modified Comparison Model for Multiprocessor Systems Open
View article: Data Compression Strategies for Use in Advanced Metering Infrastructure Networks
Data Compression Strategies for Use in Advanced Metering Infrastructure Networks Open
Internet of Things technology has advanced rapidly. For example, numerous sensors can be deployed in a city to collect a variety of data, and such data can be used to monitor the city’s situation. A possible application of such data is sma…
View article: Using Evolutionary Trees for the Colorectal Cancer Prognosis Prediction
Using Evolutionary Trees for the Colorectal Cancer Prognosis Prediction Open
The measurement of tree similarity based on structure comparison has been long used in diverse fields. We applied the evolutionary tree method to study the cancer genome. Cancer evolutionary trees, representing cancer diversity, provide in…
View article: The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks Open
A set of the spanning trees in a graph is called independent spanning trees if they have a common root and for each vertex , the paths from to in any two trees are directed edge-disjoint and internally vertex-disjoint. The construction…
View article: A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks
A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks Open
View article: Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs
Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs Open
The generalized recursive circulant networking can be widely used in the design and implementation of interconnection networks. It consists of a series of processors, each is connected through bidirectional, point-to-point communication ch…
View article: Matching Cut in Graphs with Large Minimum Degree
Matching Cut in Graphs with Large Minimum Degree Open
In a graph, a matching cut is an edge cut that is a matching. M atching C ut is the problem of deciding whether or not a given graph has a matching cut, which is known to be $${\mathsf {NP}}$$ -complete. While M atching C ut is trivial f…
View article: Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks Open
International audience