Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (72)
  • Open Access

    ARTICLE

    Case Study: Spark GPU-Enabled Framework to Control COVID-19 Spread Using Cell-Phone Spatio-Temporal Data

    Hussein Shahata Abdallah1, *, Mohamed H. Khafagy1, Fatma A. Omara2

    CMC-Computers, Materials & Continua, Vol.65, No.2, pp. 1303-1320, 2020, DOI:10.32604/cmc.2020.011313

    Abstract Nowadays, the world is fighting a dangerous form of Coronavirus that represents an emerging pandemic. Since its early appearance in China Wuhan city, many countries undertook several strict regulations including lockdowns and social distancing measures. Unfortunately, these procedures have badly impacted the world economy. Detecting and isolating positive/probable virus infected cases using a tree tracking mechanism constitutes a backbone for containing and resisting such fast spreading disease. For helping this hard effort, this research presents an innovative case study based on big data processing techniques to build a complete tracking system able to identify the central areas of infected/suspected people,… More >

  • Open Access

    ARTICLE

    A Clustering-based Approach for Balancing and Scheduling Bicycle-sharing Systems

    Imed Kacem, Ahmed Kadri, Pierre Laroche

    Intelligent Automation & Soft Computing, Vol.24, No.2, pp. 421-430, 2018, DOI:10.31209/2018.100000016

    Abstract This paper addresses an inventory regulation problem in bicycle sharingsystems. The problem is to balance a network consisting of a set of stations by using a single vehicle, with the aim of minimizing the weighted sum of the waiting times during which some stations remain imbalanced. Motivated by the complexity of this problem, we propose a two-stage procedure based on decomposition. First, the network is divided into multiple zones by using two different clustering strategies. Then, the balancing problem is solved in each zone. Finally, the order in which the zones must be visited is defined. To solve these problems,… More >

  • Open Access

    ARTICLE

    A Nonuniform Clustering Routing Algorithm Based on an Improved K-Means Algorithm

    Xinliang Tang1, Man Zhang1, Pingping Yu1, Wei Liu2, Ning Cao3, *, Yunfeng Xu4

    CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1725-1739, 2020, DOI:10.32604/cmc.2020.010272

    Abstract In a large-scale wireless sensor network (WSN), densely distributed sensor nodes process a large amount of data. The aggregation of data in a network can consume a great amount of energy. To balance and reduce the energy consumption of nodes in a WSN and extend the network life, this paper proposes a nonuniform clustering routing algorithm based on the improved K-means algorithm. The algorithm uses a clustering method to form and optimize clusters, and it selects appropriate cluster heads to balance network energy consumption and extend the life cycle of the WSN. To ensure that the cluster head (CH) selection… More >

  • Open Access

    ARTICLE

    Deer Body Adaptive Threshold Segmentation Algorithm Based on Color Space

    Yuheng Sun1, Ye Mu1, 2, 3, 4, *, Qin Feng5, Tianli Hu1, 2, 3, 4, He Gong1, 2, 3, 4, Shijun Li1, 2, 3, 4, Jing Zhou6

    CMC-Computers, Materials & Continua, Vol.64, No.2, pp. 1317-1328, 2020, DOI:10.32604/cmc.2020.010510

    Abstract In large-scale deer farming image analysis, K-means or maximum betweenclass variance (Otsu) algorithms can be used to distinguish the deer from the background. However, in an actual breeding environment, the barbed wire or chain-link fencing has a certain isolating effect on the deer which greatly interferes with the identification of the individual deer. Also, when the target and background grey values are similar, the multiple background targets cannot be completely separated. To better identify the posture and behaviour of deer in a deer shed, we used digital image processing to separate the deer from the background. To address the problems… More >

  • Open Access

    ARTICLE

    An Encrypted Image Retrieval Method Based on SimHash in Cloud Computing

    Jiaohua Qin1, Yusi Cao1, Xuyu Xiang1, *, Yun Tan1, Lingyun Xiang2, Jianjun Zhang3

    CMC-Computers, Materials & Continua, Vol.63, No.1, pp. 389-399, 2020, DOI:10.32604/cmc.2020.07819

    Abstract With the massive growth of images data and the rise of cloud computing that can provide cheap storage space and convenient access, more and more users store data in cloud server. However, how to quickly query the expected data with privacy-preserving is still a challenging in the encryption image data retrieval. Towards this goal, this paper proposes a ciphertext image retrieval method based on SimHash in cloud computing. Firstly, we extract local feature of images, and then cluster the features by K-means. Based on it, the visual word codebook is introduced to represent feature information of images, which hashes the… More >

  • Open Access

    ARTICLE

    A Differentially Private Data Aggregation Method Based on Worker Partition and Location Obfuscation for Mobile Crowdsensing

    Shuyu Li1, Guozheng Zhang1, *

    CMC-Computers, Materials & Continua, Vol.63, No.1, pp. 223-241, 2020, DOI:10.32604/cmc.2020.07499

    Abstract With the popularity of sensor-rich mobile devices, mobile crowdsensing (MCS) has emerged as an effective method for data collection and processing. However, MCS platform usually need workers’ precise locations for optimal task execution and collect sensing data from workers, which raises severe concerns of privacy leakage. Trying to preserve workers’ location and sensing data from the untrusted MCS platform, a differentially private data aggregation method based on worker partition and location obfuscation (DP-DAWL method) is proposed in the paper. DP-DAWL method firstly use an improved K-means algorithm to divide workers into groups and assign different privacy budget to the group… More >

  • Open Access

    ARTICLE

    Hybrid Clustering Algorithms with GRASP to Construct an Initial Solution for the MVPPDP

    Abeer I. Alhujaylan1, 2, *, Manar I. Hosny1

    CMC-Computers, Materials & Continua, Vol.62, No.3, pp. 1025-1051, 2020, DOI:10.32604/cmc.2020.08742

    Abstract Mobile commerce (m-commerce) contributes to increasing the popularity of electronic commerce (e-commerce), allowing anybody to sell or buy goods using a mobile device or tablet anywhere and at any time. As demand for e-commerce increases tremendously, the pressure on delivery companies increases to organise their transportation plans to achieve profits and customer satisfaction. One important planning problem in this domain is the multi-vehicle profitable pickup and delivery problem (MVPPDP), where a selected set of pickup and delivery customers need to be served within certain allowed trip time. In this paper, we proposed hybrid clustering algorithms with the greedy randomised adaptive… More >

  • Open Access

    ARTICLE

    A Hybrid Model for Anomalies Detection in AMI System Combining K-means Clustering and Deep Neural Network

    Assia Maamar1,*, Khelifa Benahmed2

    CMC-Computers, Materials & Continua, Vol.60, No.1, pp. 15-39, 2019, DOI:10.32604/cmc.2019.06497

    Abstract Recently, the radical digital transformation has deeply affected the traditional electricity grid and transformed it into an intelligent network (smart grid). This mutation is based on the progressive development of advanced technologies: advanced metering infrastructure (AMI) and smart meter which play a crucial role in the development of smart grid. AMI technologies have a promising potential in terms of improvement in energy efficiency, better demand management, and reduction in electricity costs. However the possibility of hacking smart meters and electricity theft is still among the most significant challenges facing electricity companies. In this regard, we propose a hybrid approach to… More >

  • Open Access

    ARTICLE

    A Multi-Feature Weighting Based K-Means Algorithm for MOOC Learner Classification

    Yuqing Yang1,2, Dequn Zhou1,*, Xiaojiang Yang1,3,4

    CMC-Computers, Materials & Continua, Vol.59, No.2, pp. 625-633, 2019, DOI:10.32604/cmc.2019.05246

    Abstract Massive open online courses (MOOC) have recently gained worldwide attention in the field of education. The manner of MOOC provides a new option for learning various kinds of knowledge. A mass of data miming algorithms have been proposed to analyze the learner’s characteristics and classify the learners into different groups. However, most current algorithms mainly focus on the final grade of the learners, which may result in an improper classification. To overcome the shortages of the existing algorithms, a novel multi-feature weighting based K-means (MFWK-means) algorithm is proposed in this paper. Correlations between the widely used feature grade and other… More >

  • Open Access

    ARTICLE

    SMK-means: An Improved Mini Batch K-means Algorithm Based on Mapreduce with Big Data

    Bo Xiao1, Zhen Wang2, Qi Liu3,*, Xiaodong Liu3

    CMC-Computers, Materials & Continua, Vol.56, No.3, pp. 365-379, 2018, DOI: 10.3970/cmc.2018.01830

    Abstract In recent years, the rapid development of big data technology has also been favored by more and more scholars. Massive data storage and calculation problems have also been solved. At the same time, outlier detection problems in mass data have also come along with it. Therefore, more research work has been devoted to the problem of outlier detection in big data. However, the existing available methods have high computation time, the improved algorithm of outlier detection is presented, which has higher performance to detect outlier. In this paper, an improved algorithm is proposed. The SMK-means is a fusion algorithm which… More >

Displaying 61-70 on page 7 of 72. Per Page