Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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


    Clustered Wireless Sensor Network in Precision Agriculture via Graph Theory

    L. R. Bindu1,*, P. Titus2, D. Dhanya3

    Intelligent Automation & Soft Computing, Vol.36, No.2, pp. 1435-1449, 2023, DOI:10.32604/iasc.2023.030591

    Abstract Food security and sustainable development is making a mandatory move in the entire human race. The attainment of this goal requires man to strive for a highly advanced state in the field of agriculture so that he can produce crops with a minimum amount of water and fertilizer. Even though our agricultural methodologies have undergone a series of metamorphoses in the process of a present smart-agricultural system, a long way is ahead to attain a system that is precise and accurate for the optimum yield and profitability. Towards such a futuristic method of cultivation, this paper proposes a novel method… More >

  • Open Access


    A Graph Theory Based Self-Learning Honeypot to Detect Persistent Threats

    R. T. Pavendan1,*, K. Sankar1, K. A. Varun Kumar2

    Intelligent Automation & Soft Computing, Vol.35, No.3, pp. 3331-3348, 2023, DOI:10.32604/iasc.2023.028029

    Abstract Attacks on the cyber space is getting exponential in recent times. Illegal penetrations and breaches are real threats to the individuals and organizations. Conventional security systems are good enough to detect the known threats but when it comes to Advanced Persistent Threats (APTs) they fails. These APTs are targeted, more sophisticated and very persistent and incorporates lot of evasive techniques to bypass the existing defenses. Hence, there is a need for an effective defense system that can achieve a complete reliance of security. To address the above-mentioned issues, this paper proposes a novel honeypot system that tracks the anonymous behavior… More >

  • Open Access


    Model for Generating Scale-Free Artificial Social Networks Using Small-World Networks

    Farhan Amin, Gyu Sang Choi*

    CMC-Computers, Materials & Continua, Vol.73, No.3, pp. 6367-6391, 2022, DOI:10.32604/cmc.2022.029927

    Abstract The Internet of Things (IoT) has the potential to be applied to social networks due to innovative characteristics and sophisticated solutions that challenge traditional uses. Social network analysis (SNA) is a good example that has recently gained a lot of scientific attention. It has its roots in social and economic research, as well as the evaluation of network science, such as graph theory. Scientists in this area have subverted predefined theories, offering revolutionary ones regarding interconnected networks, and they have highlighted the mystery of six degrees of separation with confirmation of the small-world phenomenon. The motivation of this study is… More >

  • Open Access


    An Intelligent Prediction Model for Target Protein Identification in Hepatic Carcinoma Using Novel Graph Theory and ANN Model

    G. Naveen Sundar1, Stalin Selvaraj2, D. Narmadha1, K. Martin Sagayam3, A. Amir Anton Jone3, Ayman A. Aly4, Dac-Nhuong Le5,6,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.133, No.1, pp. 31-46, 2022, DOI:10.32604/cmes.2022.019914

    Abstract Hepatocellular carcinoma (HCC) is one major cause of cancer-related mortality around the world. However, at advanced stages of HCC, systematic treatment options are currently limited. As a result, new pharmacological targets must be discovered regularly, and then tailored medicines against HCC must be developed. In this research, we used biomarkers of HCC to collect the protein interaction network related to HCC. Initially, DC (Degree Centrality) was employed to assess the importance of each protein. Then an improved Graph Coloring algorithm was used to rank the target proteins according to the interaction with the primary target protein after assessing the top… More >

  • Open Access


    Vertex Cover Optimization Using a Novel Graph Decomposition Approach

    Abdul Manan1, Shahida Bashir1, Abdul Majid2,*

    CMC-Computers, Materials & Continua, Vol.73, No.1, pp. 701-717, 2022, DOI:10.32604/cmc.2022.027064

    Abstract The minimum vertex cover problem (MVCP) is a well-known combinatorial optimization problem of graph theory. The MVCP is an NP (nondeterministic polynomial) complete problem and it has an exponential growing complexity with respect to the size of a graph. No algorithm exits till date that can exactly solve the problem in a deterministic polynomial time scale. However, several algorithms are proposed that solve the problem approximately in a short polynomial time scale. Such algorithms are useful for large size graphs, for which exact solution of MVCP is impossible with current computational resources. The MVCP has a wide range of applications… More >

  • Open Access


    Person Re-Identification Using LBPH and K-Reciprocal Encoding

    V. Manimaran*, K. G. Srinivasagan

    Intelligent Automation & Soft Computing, Vol.34, No.2, pp. 1109-1121, 2022, DOI:10.32604/iasc.2022.023145

    Abstract Individual re-identification proof (Re-ID) targets recovering an individual of interest across different non-covering cameras. With the recent development of technological algorithm and expanding request of intelligence video observation, it has acquired fundamentally expanded interest in the computer vision. Person re-identification is characterized as the issue of perceiving an individual caught in different occasions and additionally areas more than a few nonoverlapping camera sees, thinking about a huge arrangement of up-and-comers. This issue influences essentially the administration of disseminated, multiview observation frameworks, in which subjects should be followed across better places, either deduced or on-the-fly when they travel through various areas.… More >

  • Open Access


    Optimal Path Planning for Intelligent UAVs Using Graph Convolution Networks

    Akshya Jothi, P. L. K. Priyadarsini*

    Intelligent Automation & Soft Computing, Vol.31, No.3, pp. 1577-1591, 2022, DOI:10.32604/iasc.2022.020974

    Abstract Unmanned Aerial Vehicles (UAVs) are in use for surveillance services in the geographic areas, that are very hard and sometimes not reachable by humans. Nowadays, UAVs are being used as substitutions to manned operations in various applications. The intensive utilization of autonomous UAVs has given rise to many new challenges. One of the vital problems that arise while deploying UAVs in surveillance applications is the Coverage Path Planning(CPP) problem. Given a geographic area, the problem is to find an optimal path/tour for the UAV such that it covers the entire area of interest with minimal tour length. A graph can… More >

  • Open Access


    Kalman Filter Dynamic Mode Decomposition for Data Assimilation

    Taku Nonomura

    The International Conference on Computational & Experimental Engineering and Sciences, Vol.21, No.4, pp. 73-74, 2019, DOI:10.32604/icces.2019.05266

    Abstract In this presentation, a family of Kalman filter dynamic mode decomposition, which consists of algorithms of the linear Kalman filter DMD method which identify the linear system and the extended Kalman filter DMD method which simultaneously identify the system and estimates state variable, is introduced. Then, the application of the extended Kalman filter DMD to data assimilation is discussed. More >

  • Open Access


    The Algorithm of Chemical Species Analysis for Ab Intio Molecular Dynamics Simulations and Its Application

    Zhiyi Han1, Yugai Huang2,3, Xiaoqiang Xie1, Ying Mei1, Bin Gu1,*

    CMC-Computers, Materials & Continua, Vol.59, No.3, pp. 995-1003, 2019, DOI:10.32604/cmc.2019.02181

    Abstract In ab initio molecular dynamics (AIMD) simulations of chemical reactions, it is important but difficult to identify the chemical species in the trajectory automatically and quickly. In this paper, based on the chemical graph theory, an algorithm for molecular species identification, according to the molecular coordinates and empirical bond length database, is presented. As an example, the chemical species in condensed glycine at room temperature are investigated with our algorithm in detail. The chemical species, including canonical and zwitterionic glycine, their protonated and de-protonated states, and the free protons, are all identified, counted and recorded correctly. Potential applications and further… More >

  • Open Access


    Some Topological Indices Computing Results If Archimedean Lattices L(4,6,12)

    Kang Qiong1,*, Xinting Li2

    CMC-Computers, Materials & Continua, Vol.58, No.1, pp. 121-133, 2019, DOI:10.32604/cmc.2019.03723

    Abstract The introduction of graph-theoretical structure descriptors represents an important step forward in the research of predictive models in chemistry and falls within the lines of the increasing use of mathematical and computational methods in contemporary chemistry. The basis for these models is the study of the quantitative structure-property and structure-activity relationship. In this paper, we investigate Great rhom-bitrihexagonal which is a kind of dodecagon honeycomb net-work covered by quadrangle and hexagon. Many topological indexes of Great rhom-bitrihexagonal have being investigated, such as sum-connectivity index, atom-bond connectivity index, geometric-arithmetic index, fifth, harmonic index, Randić connectivity index, first Zagreb index, second Zagreb… More >

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

Share Link