Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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


    An Innovative K-Anonymity Privacy-Preserving Algorithm to Improve Data Availability in the Context of Big Data

    Linlin Yuan1,2, Tiantian Zhang1,3, Yuling Chen1,*, Yuxiang Yang1, Huang Li1

    CMC-Computers, Materials & Continua, Vol.79, No.1, pp. 1561-1579, 2024, DOI:10.32604/cmc.2023.046907

    Abstract The development of technologies such as big data and blockchain has brought convenience to life, but at the same time, privacy and security issues are becoming more and more prominent. The K-anonymity algorithm is an effective and low computational complexity privacy-preserving algorithm that can safeguard users’ privacy by anonymizing big data. However, the algorithm currently suffers from the problem of focusing only on improving user privacy while ignoring data availability. In addition, ignoring the impact of quasi-identified attributes on sensitive attributes causes the usability of the processed data on statistical analysis to be reduced. Based… More >

  • Open Access


    Generation of Low-Delay and High-Stability Multicast Tree

    Deshun Li1, Zhenchen Wang2, Yucong Wei2, Jiangyuan Yao1,*, Yuyin Tan2, Qiuling Yang1, Zhengxia Wang1, Xingcan Cao3

    CMC-Computers, Materials & Continua, Vol.76, No.1, pp. 561-572, 2023, DOI:10.32604/cmc.2023.033332

    Abstract Delay and stability are two key factors that affect the performance of multicast data transmission in a network. However, current algorithms of tree generation hardly meet the requirements of low delay and high stability simultaneously. Given a general network, the generation algorithm of a multicast tree with minimum delay and maximum stability is an NP-hard problem, without a precise and efficient algorithm. To address these challenges, this paper studies the generation of low-delay and high-stability multicast trees under the model of spanning tree based on stability probability, degree-constrained, edge-weighted for multicast (T-SDE). A class of algorithms… More >

  • Open Access


    Selection of Metaheuristic Algorithm to Design Wireless Sensor Network

    Rakhshan Zulfiqar1,2, Tariq Javed1, Zain Anwar Ali2,*, Eman H. Alkhammash3, Myriam Hadjouni4

    Intelligent Automation & Soft Computing, Vol.37, No.1, pp. 985-1000, 2023, DOI:10.32604/iasc.2023.037248

    Abstract The deployment of sensor nodes is an important aspect in mobile wireless sensor networks for increasing network performance. The longevity of the networks is mostly determined by the proportion of energy consumed and the sensor nodes’ access network. The optimal or ideal positioning of sensors improves the portable sensor networks effectiveness. Coverage and energy usage are mostly determined by successful sensor placement strategies. Nature-inspired algorithms are the most effective solution for short sensor lifetime. The primary objective of work is to conduct a comparative analysis of nature-inspired optimization for wireless sensor networks (WSNs’) maximum network More >

  • Open Access


    Optimizing the Software Testing Problem Using Search-Based Software Engineering Techniques

    Hissah A. Ben Zayed, Mashael S. Maashi*

    Intelligent Automation & Soft Computing, Vol.29, No.1, pp. 307-318, 2021, DOI:10.32604/iasc.2021.017239

    Abstract Software testing is a fundamental step in the software development lifecycle. Its purpose is to evaluate the quality of software applications. Regression testing is an important testing methodology in software testing. The purpose of regression testing is to validate the software after each change of its code. This involves adding new test cases to the test suite and running the test suite as the software changes, making the test suite larger. The cost and time of the project are affected by the test suite size. The challenge is to run regression testing with a smaller… More >

  • Open Access


    Exploring Hybrid Genetic Algorithm Based Large-Scale Logistics Distribution for BBG Supermarket

    Yizhi Liu1,2, Rutian Qing1,2,*, Liangran Wu1,2, Min Liu1,2, Zhuhua Liao1,2, Yijiang Zhao1,2

    Journal on Artificial Intelligence, Vol.3, No.1, pp. 33-43, 2021, DOI:10.32604/jai.2021.016565

    Abstract In the large-scale logistics distribution of single logistic center, the method based on traditional genetic algorithm is slow in evolution and easy to fall into the local optimal solution. Addressing at this issue, we propose a novel approach of exploring hybrid genetic algorithm based large-scale logistic distribution for BBG supermarket. We integrate greedy algorithm and hillclimbing algorithm into genetic algorithm. Greedy algorithm is applied to initialize the population, and then hill-climbing algorithm is used to optimize individuals in each generation after selection, crossover and mutation. Our approach is evaluated on the dataset of BBG Supermarket More >

  • Open Access


    Research on K Maximum Dominant Skyline and E-GA Algorithm Based on Data Stream Environment

    Wang Qi

    Computer Systems Science and Engineering, Vol.33, No.5, pp. 369-378, 2018, DOI:10.32604/csse.2018.33.369

    Abstract With the continuous development of database technology, the data volume that can be stored and processed by the database is increasing. How to dig out information that people are interested in from the massive data is one of the important issues in the field of database research. This article starts from the user demand analysis, and makes an in-depth study of various query expansion problems of skylines. Then, according to different application scenarios, this paper proposes efficient and targeted solutions to effectively meet the actual needs of people. Based on k- representative skyline query problem More >

  • Open Access


    Meshless Unsymmetric Collocation Method

    Leevan Ling1

    The International Conference on Computational & Experimental Engineering and Sciences, Vol.8, No.4, pp. 133-138, 2008, DOI:10.3970/icces.2008.008.133

    Abstract The history of meshless collocation methods featured plenty of nicely calculated practical solutions, but a solid mathematical basis was long missing for the most popular asymmetric technique introduced by E. Kansa. Thus the impact of this work will be to supply a lasting mathematical foundation which will also improve our general understanding of such technique. Our previous research gave a convergent algorithm. More >

Displaying 1-10 on page 1 of 7. Per Page