Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    A Secure Visual Secret Sharing Scheme with Authentication Based on QR Code

    Xinwei Zhong*, Lizhi Xiong, Zhihua Xia

    Journal on Big Data, Vol.3, No.2, pp. 85-95, 2021, DOI:10.32604/jbd.2021.018618 - 13 April 2021

    Abstract With the rise of the Internet of Things (IoT), various devices in life and industry are closely linked. Because of its high payload, stable error correction capability, and convenience in reading and writing, Quick Response (QR) code has been widely researched in IoT. However, the security of privacy data in IoT is also a very important issue. At the same time, because IoT is developing towards low-power devices in order to be applied to more fields, the technology protecting the security of private needs to have the characteristics of low computational complexity. Visual Secret Sharing… More >

  • Open Access

    ARTICLE

    Low Complexity Decoding Algorithm for Uplink SCMA Based on Aerial Spherical Decoding

    Xiaohong Ji1, Junjun Du1, Guoqing Jia1,*, Weidong Fang2,3

    Intelligent Automation & Soft Computing, Vol.27, No.3, pp. 737-746, 2021, DOI:10.32604/iasc.2021.013009 - 01 March 2021

    Abstract As a new non-orthogonal multiple access technology for 5G massive machine type communication scenario, the sparse code multiple access (SCMA) has greatly improved the spectrum efficiency due to the high connection density. SCMA combines QAM (Quadrature Amplitude Modulation) modulation and sparse spreading into a codebook set to obtain forming gain. The user binary bit data is directly mapped into multi-dimensional codewords in the transmitter. The receiver uses the message passing algorithm (MPA) for multi-user detection to achieve efficient decoding. However, MPA is a good solution for SCMA, though its high complexity limits the application in… More >

  • Open Access

    ARTICLE

    Energy-Efficient Low-Complexity Algorithm in 5G Massive MIMO Systems

    Adeeb Salh1, Lukman Audah1,*, Qazwan Abdullah1, Nor Shahida M. Shah2, Shipun A. Hamzah1, Shahilah Nordin3, Nabil Farah2

    CMC-Computers, Materials & Continua, Vol.67, No.3, pp. 3189-3214, 2021, DOI:10.32604/cmc.2021.014746 - 01 March 2021

    Abstract Energy efficiency (EE) is a critical design when taking into account circuit power consumption (CPC) in fifth-generation cellular networks. These problems arise because of the increasing number of antennas in massive multiple-input multiple-output (MIMO) systems, attributable to inter-cell interference for channel state information. Apart from that, a higher number of radio frequency (RF) chains at the base station and active users consume more power due to the processing activities in digital-to-analogue converters and power amplifiers. Therefore, antenna selection, user selection, optimal transmission power, and pilot reuse power are important aspects in improving energy efficiency in… More >

  • Open Access

    ARTICLE

    Weighted Gauss-Seidel Precoder for Downlink Massive MIMO Systems

    Jun-Yong Jang1, Won-Seok Lee1, Jae-Hyun Ro1, Young-Hawn You2, Hyoung-Kyu Song1,*

    CMC-Computers, Materials & Continua, Vol.67, No.2, pp. 1729-1745, 2021, DOI:10.32604/cmc.2021.015424 - 05 February 2021

    Abstract In this paper, a novel precoding scheme based on the Gauss-Seidel (GS) method is proposed for downlink massive multiple-input multiple-output (MIMO) systems. The GS method iteratively approximates the matrix inversion and reduces the overall complexity of the precoding process. In addition, the GS method shows a fast convergence rate to the Zero-forcing (ZF) method that requires an exact invertible matrix. However, to satisfy demanded error performance and converge to the error performance of the ZF method in the practical condition such as spatially correlated channels, more iterations are necessary for the GS method and increase… More >

  • Open Access

    ARTICLE

    A Phase Estimation Algorithm for Quantum Speed-Up Multi-Party Computing

    Wenbin Yu1, Hao Feng1, Yinsong Xu1, Na Yin1, Yadang Chen2,3, Zhi-Xin Yang3,*

    CMC-Computers, Materials & Continua, Vol.67, No.1, pp. 241-252, 2021, DOI:10.32604/cmc.2021.012649 - 12 January 2021

    Abstract Security and privacy issues have attracted the attention of researchers in the field of IoT as the information processing scale grows in sensor networks. Quantum computing, theoretically known as an absolutely secure way to store and transmit information as well as a speed-up way to accelerate local or distributed classical algorithms that are hard to solve with polynomial complexity in computation or communication. In this paper, we focus on the phase estimation method that is crucial to the realization of a general multi-party computing model, which is able to be accelerated by quantum algorithms. A More >

  • Open Access

    ARTICLE

    Efficient Routing Protection Algorithm in Large-Scale Networks

    Haijun Geng1,2,*, Han Zhang3, Yangyang Zhang4

    CMC-Computers, Materials & Continua, Vol.66, No.2, pp. 1733-1744, 2021, DOI:10.32604/cmc.2020.013355 - 26 November 2020

    Abstract With an increasing urgent demand for fast recovery routing mechanisms in large-scale networks, minimizing network disruption caused by network failure has become critical. However, a large number of relevant studies have shown that network failures occur on the Internet inevitably and frequently. The current routing protocols deployed on the Internet adopt the reconvergence mechanism to cope with network failures. During the reconvergence process, the packets may be lost because of inconsistent routing information, which reduces the network’s availability greatly and affects the Internet service provider’s (ISP’s) service quality and reputation seriously. Therefore, improving network availability… More >

  • Open Access

    ARTICLE

    Reducing Operational Time Complexity of k-NN Algorithms Using Clustering in Wrist-Activity Recognition

    Sun-Taag Choe, We-Duke Cho*, Jai-Hoon Kim, and Ki-Hyung Kim

    Intelligent Automation & Soft Computing, Vol.26, No.4, pp. 679-691, 2020, DOI:10.32604/iasc.2020.010102

    Abstract Recent research on activity recognition in wearable devices has identified a key challenge: k-nearest neighbors (k-NN) algorithms have a high operational time complexity. Thus, these algorithms are difficult to utilize in embedded wearable devices. Herein, we propose a method for reducing this complexity. We apply a clustering algorithm for learning data and assign labels to each cluster according to the maximum likelihood. Experimental results show that the proposed method achieves effective operational levels for implementation in embedded devices; however, the accuracy is slightly lower than that of a traditional k-NN algorithm. Additionally, our method provides More >

  • Open Access

    ARTICLE

    Prediction of Intrinsically Disordered Proteins with a Low Computational Complexity Method

    Jia Yang1, Haiyuan Liu1,*, Hao He2

    CMES-Computer Modeling in Engineering & Sciences, Vol.125, No.1, pp. 111-123, 2020, DOI:10.32604/cmes.2020.010347 - 18 September 2020

    Abstract The prediction of intrinsically disordered proteins is a hot research area in bio-information. Due to the high cost of experimental methods to evaluate disordered regions of protein sequences, it is becoming increasingly important to predict those regions through computational methods. In this paper, we developed a novel scheme by employing sequence complexity to calculate six features for each residue of a protein sequence, which includes the Shannon entropy, the topological entropy, the sample entropy and three amino acid preferences including Remark 465, Deleage/Roux, and Bfactor(2STD). Particularly, we introduced the sample entropy for calculating time series… More >

  • Open Access

    ARTICLE

    Complexity Effective Frequency and Sidelink Synchronization Algorithm for LTE Device-to-Device Communication Systems

    Yong-An Jung1, Min-Goo Kang2, Young-Hwan You1, *

    CMC-Computers, Materials & Continua, Vol.62, No.1, pp. 443-458, 2020, DOI:10.32604/cmc.2020.08777

    Abstract Device-to-device (D2D) communication is considered as a major challenge in the long term evolution (LTE) network wherein devices directly communicate with each other. One of the key challenges in D2D sidelink is reliable and reduced-complexity synchronization. To address this issue, a computationally efficient sequential detection scheme for integer carrier frequency offset and sidelink identity is proposed in the LTED2D system. To perform the frequency offset detection without retrieving the sidelink identity, the conjugate relation between two primary sidelink synchronization sequences is exploited, which facilitates the detection tasks of frequency offset and sidelink identity to be More >

  • Open Access

    ARTICLE

    Research on Complexity of China’s Manufacturing Networks

    Tong Zhao, Bangwen Peng

    Intelligent Automation & Soft Computing, Vol.25, No.4, pp. 725-733, 2019, DOI:10.31209/2019.100000076

    Abstract In this article, the industry complex network of China’s manufacturing is built based on the central input flow matrix data of 2012 Input-Output Tables of China through industry network modeling. This article analyses the complex nature of China’s manufacturing network in three aspects, which are feature of industry network in general, community structure and industry nodes, using a series of statistics measuring complex network. More >

Displaying 31-40 on page 4 of 46. Per Page