Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (52)
  • 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 >

  • Open Access

    ARTICLE

    Optimization Algorithm for Reduction the Size of Dixon Resultant Matrix: A Case Study on Mechanical Application

    Shang Zhang1, *, Seyedmehdi Karimi2, Shahaboddin Shamshirband3, 4, *, Amir Mosavi5,6

    CMC-Computers, Materials & Continua, Vol.58, No.2, pp. 567-583, 2019, DOI:10.32604/cmc.2019.02795

    Abstract In the process of eliminating variables in a symbolic polynomial system, the extraneous factors are referred to the unwanted parameters of resulting polynomial. This paper aims at reducing the number of these factors via optimizing the size of Dixon matrix. An optimal configuration of Dixon matrix would lead to the enhancement of the process of computing the resultant which uses for solving polynomial systems. To do so, an optimization algorithm along with a number of new polynomials is introduced to replace the polynomials and implement a complexity analysis. Moreover, the monomial multipliers are optimally positioned More >

  • Open Access

    ARTICLE

    Identification of adults with congenital heart disease of moderate or great complexity from administrative data

    Jill M. Steiner1, James N. Kirkpatrick1, Susan R. Heckbert2, Asma Habib1, James Sibley3, William Lober3, J. Randall Curtis3

    Congenital Heart Disease, Vol.13, No.1, pp. 65-71, 2018, DOI:10.1111/chd.12524

    Abstract Introduction: There is relatively sparse literature on the use of administrative datasets for research in patients with adult congenital heart disease (ACHD). The goal of this analysis is to examine the accuracy of administrative data for identifying patients with ACHD who died.
    Methods: A list of the International Classification of Diseases codes representing ACHD of moderate- or great-complexity was created. A search for these codes in the electronic health record of adults who received care in 2010–2016 was performed, and used state death records to identify patients who died during this period. Manual record review was completed… More >

  • Open Access

    ARTICLE

    Grey Wolf Optimizer to Real Power Dispatch with Non-Linear Constraints

    G. R. Venkatakrishnan1,*, R. Rengaraj2, S. Salivahanan3

    CMES-Computer Modeling in Engineering & Sciences, Vol.115, No.1, pp. 25-45, 2018, DOI:10.3970/cmes.2018.115.025

    Abstract A new and efficient Grey Wolf Optimization (GWO) algorithm is implemented to solve real power economic dispatch (RPED) problems in this paper. The nonlinear RPED problem is one the most important and fundamental optimization problem which reduces the total cost in generating real power without violating the constraints. Conventional methods can solve the ELD problem with good solution quality with assumptions assigned to fuel cost curves without which these methods lead to suboptimal or infeasible solutions. The behavior of grey wolves which is mimicked in the GWO algorithm are leadership hierarchy and hunting mechanism. The More >

  • Open Access

    REVIEW

    The complexity of nitric oxide generation and function in plants

    María P BENAVIDES1, Susana M GALLEGO1, Facundo RAMOS ARTUSO2, Mariana CHECOVICH3, Andrea GALATRO*

    BIOCELL, Vol.40, No.1, pp. 1-6, 2016, DOI:10.32604/biocell.2016.40.001

    Abstract Plants are exposed to environmental stress, in natural and agricultural conditions.Nitric oxide (NO), a small gaseous molecule which plays important roles in plants, has been involved in many physiological processes, and emerged as an important endogenous signaling molecule in the adaptation of plants to biotic and abiotic stress. NO is produced from a variety of enzymatic and non enzymatic sources, which are not yet fully understood. Also, NO and reactive nitrogen species (RNS) can produce posttranslational modifications affecting protein function. Nitrate reductase, a key enzyme in the nitrogen metabolism, is a proposed source of NO More >

Displaying 41-50 on page 5 of 52. Per Page