Microchannel heat sinks have attracted considerable attention in thermal management applications owing to their high heat transfer capabilities and compact size. Amongst the cooling techniques, flow boiling in microch...
详细信息
ISBN:
(纸本)9798350375657
Microchannel heat sinks have attracted considerable attention in thermal management applications owing to their high heat transfer capabilities and compact size. Amongst the cooling techniques, flow boiling in microchannels has emerged as a promising method for efficient heat dissipation. However, the intricate flow patterns in microchannels present challenges for accurate classification, pattern recognition, and inefficient data handling practices. This paper presented a comparative analysis of flow boiling classification techniques for pattern recognition in microchannel heat sinks. Three different clustering algorithm-driven convolutional neural networks (CNNs) were analysed and compared alongside a base CNN to establish a data pipeline capable of agile flow boiling pattern recognition. The Gaussian Mixture Model clustering-based CNN exhibited the best performance, achieving an overall mean accuracy of 88% for the test set validation. Thus, this study lays the groundwork for improving the performance of flow boiling pattern recognition in microchannel heat sinks.
Traditional Chinese medicine (TCM) is a holistic medical approach and the formula's composition discipline is still a mystery. Detecting a formula's structure and herb communities/clusters in TCM Formula netwo...
详细信息
ISBN:
(纸本)9781509001637
Traditional Chinese medicine (TCM) is a holistic medical approach and the formula's composition discipline is still a mystery. Detecting a formula's structure and herb communities/clusters in TCM Formula networks (TCMF) is a mainly existing problem in data mining of the data sets. In this paper, we devise a novel community similarity calculating method in the process of clustering, which is called Random Walk Hierarchical clustering (RWHC) algorithm, to identify herb communities by using clustering algorithms based on the formula network of atrophic lung disease. And we also use classic NG modularity function to evaluate the experimental results. The studies suggest that the TCM network clustering approach provides a new research paradigm for mining TCM data from an experience-based medicine, will accelerate TCM drug discovery, and also improve current drug discovery strategies.
This paper proposes a consistency bundle algorithm based on clustering grouping for large-scale task allocation problems. Large scale task allocation problems often result in incomplete network coverage, exponential i...
详细信息
ISBN:
(纸本)9798350390780;9798350379228
This paper proposes a consistency bundle algorithm based on clustering grouping for large-scale task allocation problems. Large scale task allocation problems often result in incomplete network coverage, exponential increase in communication frequency, and communication obstruction. Therefore, this article first uses clustering algorithms to group robots based on the number of tasks, transforming large-scale problems into small-scale problems;Secondly, use the consistency bundle algorithm to solve the task allocation problem for each group separately;Finally, the algorithm was used for simulation experiments on large-scale task allocation problems, and the results showed that the proposed algorithm can solve the problem while effectively reducing the number of communications.
The wireless video transmission process, due to the complexity and variability of wireless communication channels, requires to adjust the bitrates to match the dynamic wireless channel. An analysis of the video frame ...
详细信息
ISBN:
(纸本)9781614997221;9781614997214
The wireless video transmission process, due to the complexity and variability of wireless communication channels, requires to adjust the bitrates to match the dynamic wireless channel. An analysis of the video frame quality could be used as an important basis to adjust the wireless video bitrates. This paper aims at detecting and recognizing transmission bitrates based on video frame quality for wireless networks. According to the distribution characteristics of video frame quality, this paper proposes a GOP-level bitrate clustering recognition algorithm (GLBCR) by video coding GOP structural feature and temporal continuity of video frames to recognize different bitrates for wireless video. GLBCR uses PSNR between each pair of original and terminal decoding frame as the feature to quantify the degradation of video frame quality. The algorithm extracts the PSNR values of all I-frames by the peak detector function, then uses PSNR similarity measure to recursively split the frame interval into subintervals. Finally, the different video bitrates can be recognized by GLBCR. The proposed algorithm is evaluated by using the LIVE mobile video quality assessment (VQA) database. The results show that the proposed algorithm can recognize the change of video bitrates by analyzing video frame quality, it is well consistent with the real bitrate changes in wireless video transmission with small amount of calculation.
Recent research activities have recognized the essentiality of node mobility for the creation of stable, scalable and adaptive clusters with good performance in mobile ad hoc networks (MANETs). In this paper, we propo...
详细信息
ISBN:
(纸本)9784885522963
Recent research activities have recognized the essentiality of node mobility for the creation of stable, scalable and adaptive clusters with good performance in mobile ad hoc networks (MANETs). In this paper, we propose a distributed clustering algorithm based on the group mobility and a revised group mobility metric which is derived from the instantaneous speed and direction of nodes. Our dynamic, distributed clustering approach use Gauss Markov group mobility model for mobility prediction that enables each node to anticipate its mobility relative to its neighbors. In particular, it is suitable for reflecting group mobility pattern where group partitions and mergence are prevalent behaviors of mobile groups. We also take the residual energy of nodes and the number of neighbor nodes into consideration. The proposed clustering scheme aims to form stable clusters by reducing the clustering iterations even in a highly dynamic environment. Simulation results show that the performance of the proposed framework is superior to two well-known clustering approaches, the MOBIC and DGMA, in terms of average number of clusterhead changes.
The purpose of data clustering algorithm is to form clusters (groups) of data points such that there is high intra-cluster and low inter-cluster similarity. There are different types of clustering methods such as hier...
详细信息
ISBN:
(纸本)9781479985623
The purpose of data clustering algorithm is to form clusters (groups) of data points such that there is high intra-cluster and low inter-cluster similarity. There are different types of clustering methods such as hierarchical, partitioning, grid and density based. Hierarchical clustering is a method of cluster analysis which seeks to build a hierarchy of clusters. A hierarchical clustering method can be thought of as a set of ordinary (flat) clustering methods organized in a tree structure. These methods construct the clusters by recursively partitioning the objects in either a top-down or bottom-up fashion. In this paper we present a new hierarchical clustering algorithm using Euclidean distance. To validate this method we have performed some experiments with low dimensional artificial datasets and high dimensional fMRI dataset. Finally the result of our method is compared to some of existing clustering methods.
With the continuous and rapid development of online questionnaire survey, the low response rate has plagued operating companies. To solve this problem, this paper proposed an effective user invitation model by our imp...
详细信息
ISBN:
(纸本)9781467377232
With the continuous and rapid development of online questionnaire survey, the low response rate has plagued operating companies. To solve this problem, this paper proposed an effective user invitation model by our improved clustering algorithm, which analyzed large-scale historical user behavior characteristic data, including users' quality data, users' preferential data and users' similarity data. Extensive experiments with large-scale data from an online survey company have been conducted to validate the feasibility and effectiveness of our proposed approach. Experimental results demonstrate that the questionnaire response rate is increased and our approach can be easily deployed in real-world online survey application for effective personalized survey recommendation.
clustering is an important algorithm for data mining. FSC is a kind of clustering algorithm based on density, which has been proposed in the journal Science in 2014. FSC only requires one input parameter and has a hig...
详细信息
ISBN:
(纸本)9781509018932
clustering is an important algorithm for data mining. FSC is a kind of clustering algorithm based on density, which has been proposed in the journal Science in 2014. FSC only requires one input parameter and has a higher practicability. RFSC, which is an improved algorithm of FSC algorithm, is less sensitive to the input parameters and faster. However, neither RFSC nor FSC can deal with uneven density data sets. In order to solve that problem, we propose an improved algorithm KFSC in this paper by dynamically controlling of the width of the kernel function. KFSC uses the idea of attractor of the DENCLUE and can customize their own personalized attraction for each point. The experimental results on synthetic data sets show that KFSC has a better performance on uneven density data sets than FSC and RFSC.
Recently, a variety of medical imaging technologies have been used widely in clinical diagnosis. As a large number of medical images are produced everyday, it becomes a hot issue of data mining on medical image in cur...
详细信息
ISBN:
(纸本)9781467376822
Recently, a variety of medical imaging technologies have been used widely in clinical diagnosis. As a large number of medical images are produced everyday, it becomes a hot issue of data mining on medical image in current that how to make full use of these medical images and cluster efficiently to help doctors to diagnose. In this paper, we propose a medical image clustering method. Firstly, medical image dataset is represented as a weighted, undirected and completed graph. Secondly, the graph is sparsified and pruned. This model can describe the similarity between medical images very well. Last, weighted and undirected graph clustering method based on graph entropy is proposed to cluster these medical images. The experimental results show that this method can cluster medical images efficiently and run well in time complexity and clustering results.
Flat routing protocols proposed for MANETs suffer from scalability problem. For this purpose, clustering schemes are proposed to improve the efficiency of routing by organizing the MANET into a hierarchical structure....
详细信息
ISBN:
(纸本)9781479953448
Flat routing protocols proposed for MANETs suffer from scalability problem. For this purpose, clustering schemes are proposed to improve the efficiency of routing by organizing the MANET into a hierarchical structure. In this context, we propose SKCA, a stable K-hop clustering algorithm with the view to provide a stable cluster topology and reduce the control overhead. The algorithm proposes a new maintenance function that attempts to reduce cluster topology changes and increases cluster lifetime. Besides, SKCA introduces a novel two-round cluster-head election that reduces the diffusion of the cluster information in the K-hop neighborhood. Using simulation, the performances of SKCA is compared to KCMM algorithm. Also, we study the performances of a cluster-based link state routing protocol in presence of our clustering algorithm SKCA.
暂无评论