Networks and Heterogeneous Media最新文献

{"title":"High-order schemes for the fractional coupled nonlinear Schrödinger equation","authors":"Fengli Yin, Dongliang Xu, Wenjie Yang","doi":"10.3934/nhm.2023063","DOIUrl":"https://doi.org/10.3934/nhm.2023063","url":null,"abstract":"This paper considers the fractional coupled nonlinear Schrödinger equation with high degree polynomials in the energy functional that cannot be handled by using the quadratic auxiliary variable method. To this end, we develop the multiple quadratic auxiliary variable approach and then construct a family of structure-preserving schemes with the help of the symplectic Runge-Kutta method for solving the equation. The given schemes have high accuracy in time and can both inherit the mass and Hamiltonian energy of the system. Ample numerical results are given to confirm the accuracy and conservation of the developed schemes at last.","PeriodicalId":54732,"journal":{"name":"Networks and Heterogeneous Media","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70228164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Influence maximization in social networks using role-based embedding","authors":"Xu Gu, Zhibin Wang, Xiaoliang Chen, Peng Lu, Yajun Du, Mingwei Tang","doi":"10.3934/nhm.2023068","DOIUrl":"https://doi.org/10.3934/nhm.2023068","url":null,"abstract":"Influence maximization (IM), a central issue in optimizing information diffusion on social platforms, aims to spread posts or comments more widely, rapidly, and efficiently. Existing studies primarily focus on the positive effects of incorporating heuristic calculations in IM approaches. However, heuristic models fail to consider the potential enhancements that can be achieved through network representation learning techniques. Some recent work is keen to use representation learning to deal with IM issues. However, few in-depth studies have explored the existing challenges in IM representation learning, specifically regarding the role characteristics and role representations. This paper highlights the potential advantages of combining heuristic computing and role embedding to solve IM problems. First, the method introduces role granularity classification to effectively categorize users into three distinct roles: opinion leaders, structural holes and normal nodes. This classification enables a deeper understanding of the dynamics of users within the network. Second, a novel role-based network embedding (RbNE) algorithm is proposed. By leveraging the concept of node roles, RbNE captures the similarity between nodes, allowing for a more accurate representation of the network structure. Finally, a superior IM approach, named RbneIM, is recommended. RbneIM combines heuristic computing and role embedding to establish a fusion-enhanced IM solution, resulting in an improved influence analysis process. Exploratory outcomes on six social network datasets indicate that the proposed approach outperforms state-of-the-art seeding algorithms in terms of maximizing influence. This finding highlights the effectiveness and efficacy of the proposed method in achieving higher levels of influence within social networks. The code is available at https://github.com/baiyazi/IM2.","PeriodicalId":54732,"journal":{"name":"Networks and Heterogeneous Media","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70228396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Secure keys data distribution based user-storage-transit server authentication process model using mathematical post-quantum cryptography methodology","authors":"Santosh Kumar Henge, Gitanjali Jayaraman, M. Sreedevi, Rajakumar R, Mamoon Rashid, Sultan S. Alshamrani, Mrim M. Alnfiai, A. Alghamdi","doi":"10.3934/nhm.2023057","DOIUrl":"https://doi.org/10.3934/nhm.2023057","url":null,"abstract":"The central remote servers are essential for storing and processing data for cloud computing evaluation. However, traditional systems need to improve their ability to provide technical data security solutions. Many data security challenges and complexities await technical solutions in today's fast-growing technology. These complexities will not be resolved by combining all secure encryption techniques. Quantum computing efficiently evolves composite algorithms, allowing for natural advances in cyber security, forensics, artificial intelligence, and machine learning-based complex systems. It also demonstrates solutions to many challenging problems in cloud computing security. This study proposes a user-storage-transit-server authentication process model based on secure keys data distribution and mathematical post-quantum cryptography methodology. The post-quantum cryptography mathematical algorithm is used in this study to involve the quantum computing-based distribution of security keys. It provides security scenarios and technical options for securing data in transit, storage, user, and server modes. Post-quantum cryptography has defined and included the mathematical algorithm in generating the distributed security key and the data in transit, on-storage, and on-editing. It has involved reversible computations on many different numbers by super positioning the qubits to provide quantum services and other product-based cloud-online access used to process the end-user's artificial intelligence-based hardware service components. This study will help researchers and industry experts prepare specific scenarios for synchronizing data with medicine, finance, engineering, and banking cloud servers. The proposed methodology is implemented with single-tenant, multi-tenant, and cloud-tenant-level servers and a database server. This model is designed for four enterprises with 245 users, and it employs integration parity rules that are implemented using salting techniques. The experimental scenario considers the plain text size ranging from 24 to 8248 for analyzing secure key data distribution, key generation, encryption, and decryption time variations. The key generation and encryption time variations are 2.3233 ms to 8.7277 ms at quantum-level 1 and 0.0355 ms to 1.8491 ms at quantum-level 2. The key generation and decryption time variations are 2.1533 ms to 19.4799 ms at quantum-level 1 and 0.0525 ms to 3.3513 ms at quantum-level 2.","PeriodicalId":54732,"journal":{"name":"Networks and Heterogeneous Media","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70228603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"High-order finite difference approximation of the Keller-Segel model with additional self- and cross-diffusion terms and a logistic source","authors":"Panpan Xu, Y. Ge, Lin Zhang","doi":"10.3934/nhm.2023065","DOIUrl":"https://doi.org/10.3934/nhm.2023065","url":null,"abstract":"In this paper, we consider the Keller-Segel chemotaxis model with self- and cross-diffusion terms and a logistic source. This system consists of a fully nonlinear reaction-diffusion equation with additional cross-diffusion. We establish some high-order finite difference schemes for solving one- and two-dimensional problems. The truncation error remainder correction method and fourth-order Padé compact schemes are employed to approximate the spatial and temporal derivatives, respectively. It is shown that the numerical schemes yield second-order accuracy in time and fourth-order accuracy in space. Some numerical experiments are demonstrated to verify the accuracy and reliability of the proposed schemes. Furthermore, the blow-up phenomenon and bacterial pattern formation are numerically simulated.","PeriodicalId":54732,"journal":{"name":"Networks and Heterogeneous Media","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70228296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Stochastic homogenization on perforated domains III–General estimates for stationary ergodic random connected Lipschitz domains","authors":"M. Heida","doi":"10.3934/nhm.2023062","DOIUrl":"https://doi.org/10.3934/nhm.2023062","url":null,"abstract":"This is Part III of a series on the existence of uniformly bounded extension operators on randomly perforated domains in the context of homogenization theory. Recalling that randomly perforated domains are typically not John and hence extension is possible only from $ W^{1, p} $ to $ W^{1, r} $, $ r < p $, we will show that the existence of such extension operators can be guaranteed if the weighted expectations of four geometric characterizing parameters are bounded: The local Lipschitz constant $ M $, the local inverse Lipschitz radius $ delta^{-1} $ resp. $ rho^{-1} $, the mesoscopic Voronoi diameter $ {mathfrak{d}} $ and the local connectivity radius $ {mathscr{R}} $.","PeriodicalId":54732,"journal":{"name":"Networks and Heterogeneous Media","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70228569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Synchronization of the generalized Kuramoto model with time delay and frustration","authors":"Tingting Zhu","doi":"10.3934/nhm.2023077","DOIUrl":"https://doi.org/10.3934/nhm.2023077","url":null,"abstract":"<abstract><p>We studied the collective behaviors of the time-delayed Kuramoto model with frustration under general network topology. For the generalized Kuramoto model with the graph diameter no greater than two and under a sufficient regime in terms of small time delay and frustration and large coupling strength, we showed that the complete frequency synchronization occurs exponentially fast when the initial configuration is distributed in a half circle. We also studied a complete network, which is a small perturbation of all-to-all coupling, as well as presented sufficient frameworks leading to the exponential emergence of frequency synchronization for the initial data confined in a half circle.</p></abstract>","PeriodicalId":54732,"journal":{"name":"Networks and Heterogeneous Media","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135052318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Cardiovascular disease classification based on a multi-classification integrated model","authors":"Ai-Ping Zhang, Guang-xin Wang, Wei Zhang, Jing-Yu Zhang","doi":"10.3934/nhm.2023071","DOIUrl":"https://doi.org/10.3934/nhm.2023071","url":null,"abstract":"<abstract> <p>Cardiovascular disease (CVD) has now become the disease with the highest mortality worldwide and coronary artery disease (CAD) is the most common form of CVD. This paper makes effective use of patients' condition information to identify the risk factors of CVD and predict the disease according to these risk factors in order to guide the treatment and life of patients according to these factors, effectively reduce the probability of disease and ensure that patients can carry out timely treatment. In this paper, a novel method based on a new classifier, named multi-agent Adaboost (MA_ADA), has been proposed to diagnose CVD. The proposed method consists of four steps: pre-processing, feature extraction, feature selection and classification. In this method, feature extraction is performed by principal component analysis (PCA). Then a subset of extracted features is selected by the genetics algorithm (GA). This method also uses the novel MA_ADA classifier to diagnose CVD in patients. This method uses a dataset containing information on 303 cardiovascular surgical patients. During the experiments, a four-stage multi-classification study on the prediction of coronary heart disease was conducted. The results show that the prediction model proposed in this paper can effectively identify CVDs using different groups of risk factors, and the highest diagnosis accuracy is obtained when 45 features are used for diagnosis. The results also show that the MA_ADA algorithm could achieve an accuracy of 98.67% in diagnosis, which is at least 1% higher than the compared methods.</p> </abstract>","PeriodicalId":54732,"journal":{"name":"Networks and Heterogeneous Media","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135401856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimal secret share distribution in degree splitting communication networks","authors":"Raúl M. Falcón, Venkitachalam Aparna, Nagaraj Mohanapriya","doi":"10.3934/nhm.2023075","DOIUrl":"https://doi.org/10.3934/nhm.2023075","url":null,"abstract":"<abstract><p>Dynamic coloring has recently emerged as a valuable tool to optimize cryptographic protocols based on secret sharing, which enforce data security in communication networks and have significant importance in both online storage and cloud computing. This type of graph labeling enables the dealer to distribute secret shares among the nodes of a communication network so that everybody can recover the secret after a minimum number of rounds of communication. This paper delves into this topic by dealing with the dynamic coloring problem for degree splitting graphs. The topological structure of the latter enables the dealer to avoid dishonesty by adding control nodes that supervise all those participants with a similar influence in the network. More precisely, we solve the dynamic coloring problem for degree splitting graphs of any regular graph. The irregular case is partially solved by establishing a lower bound for the corresponding dynamic chromatic number. As illustrative examples, we solve the dynamic coloring problem for the degree splitting graphs of cycles, cocktail, book, comb, fan, jellyfish, windmill and barbell graphs.</p></abstract>","PeriodicalId":54732,"journal":{"name":"Networks and Heterogeneous Media","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136305114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Iterative learning algorithms for boundary tracing problems of nonlinear fractional diffusion equations","authors":"Jungang Wang, Qingyang Si, Jun Bao, Qian Wang","doi":"10.3934/nhm.2023059","DOIUrl":"https://doi.org/10.3934/nhm.2023059","url":null,"abstract":"In this paper, the iterative learning control technique is extended to distributed parameter systems governed by nonlinear fractional diffusion equations. Based on $ P $-type and $ PI^{theta} $-type iterative learning control methods, sufficient conditions for the convergences of systems are given. Finally, numerical examples are presented to illustrate the efficiency of the proposed iterative schemes. The numerical results show that the closed-loop iterative learning control scheme converges faster than the open-loop iterative learning control scheme and the $ PI^{theta} $-type iterative learning control scheme converges faster than the $ P $-type and the $ PI $-type iterative learning control scheme.","PeriodicalId":54732,"journal":{"name":"Networks and Heterogeneous Media","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70228272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Bicriteria multi-machine scheduling with equal processing times subject to release dates","authors":"Zhimeng Liu, Shuguang Li, Muhammad Ijaz Khan, Shaimaa A M Abdelmohsen, S. M. Eldin","doi":"10.3934/nhm.2023060","DOIUrl":"https://doi.org/10.3934/nhm.2023060","url":null,"abstract":"This paper addresses the problem of scheduling $ n $ equal-processing-time jobs with release dates non-preemptively on identical machines to optimize two criteria simultaneously or hierarchically. For simultaneous optimization of total completion time (and makespan) and maximum cost, an algorithm is presented which can produce all Pareto-optimal points together with the corresponding schedules. The algorithm is then adapted to solve the hierarchical optimization of two min-max criteria, and the final schedule has a minimum total completion time and minimum makespan among the hierarchical optimal schedules. The two algorithms provided in this paper run in $ O(n^3) $ time.","PeriodicalId":54732,"journal":{"name":"Networks and Heterogeneous Media","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70228395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}