• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with L′evy flight

    2024-01-25 07:14:58PengliLu盧鵬麗JimaoLan攬繼茂JianxinTang唐建新LiZhang張莉ShihuiSong宋仕輝andHongyuZhu朱虹羽
    Chinese Physics B 2024年1期
    關鍵詞:張莉

    Pengli Lu(盧鵬麗), Jimao Lan(攬繼茂), Jianxin Tang(唐建新)1,,?, Li Zhang(張莉),Shihui Song(宋仕輝), and Hongyu Zhu(朱虹羽)

    1Wenzhou Engineering Institute of Pump&Valve,Lanzhou University of Technology,Wenzhou 325100,China

    2School of Computer and Communication,Lanzhou University of Technology,Lanzhou 730050,China

    Keywords: social networks, influence maximization, metaheuristic optimization, quantum-behaved particle swarm optimization,L′evy flight

    1.Introduction

    As the pandemic spread around the world, lifestyles and the ways in which people obtain information were unexpectedly transferred to online mediums.[1]The virtual world has provided essential services, while reducing the distance between individuals.In particular,online social platforms,such as Facebook,WeChat,and TikTok,have promoted the growth of information consumption with the growing number of users and have nourished the emergence of online viral marketing on social networks.

    While online social networks provide convenience to the users, they also offer opportunities to companies to market their products.[3]Generally, companies first select a group of influential individuals as adopters and give them free access to the product in the expectation that they will recommend the product to their family and friends through word of mouth.If there are strong connections among these users to sustain the exponential spread of the message, then the viral marketing campaign will probably be successful and the referral behavior will, partly, influence the final choice of the purchasers.This scenario has applications in practical campaigns, such as rumor restriction,[4]where one would identify the superspreaders of rumors and restrict them to reduce the risk to society.

    Due to the inherent heterogeneity of individuals and the different ways of communication,the influence maximization(IM)problem here refers to the selection of a set of independent individuals that can maximize the coverage of information dissemination through the social relationships among the individuals.

    The IM problem was first proposed by Domingos and Richardson,[5]who suggested that we should consider the consumer market as a social network and model it as a Markov random field.Researchers have since proposed a series of IM algorithms to conduct an in-depth study.Kempeet al.[6]proved that the optimization problem of selecting the most influential nodes is NP-hard under the independent cascade(IC)model and linear threshold (LT) model, and proposed a natural greedy strategy, promising that the obtained solution is approximately within 63% of the optimal based on submodular function analysis.However, to accurately evaluate the marginal gain of influence of each candidate node,thousands of Monte Carlo simulations are required in each round of seed selection.This leads to the high time complexityO(knmR)of the algorithm.In particular,the running time of the algorithm increases exponentially with the increase of the network scale,thereby limiting its application in large-scale social networks.

    Researchers have subsequently tried to directly selectknodes as influential nodes according to the network topology features,such as degree centrality,[7]PageRank,[8]and so on.Alshahraniet al.[9]tried to combine the local influence with global influence of each node by using classical centrality metrics and proposed two algorithms, which are called Max-CDegKatzd-hops and MinCDegKatzd-hops.However, the approach of using network topology centrality fails to provide stable performance guarantees due to the lack of diversity in the selected nodes in different networks.In addition,community-based approaches have been developed to find influential nodes in the network.Bozorgiet al.[10]considered the influence of nodes within communities as a local influence and the influence of communities in the whole network as a global influence, and proposed INICIM to evaluate influential nodes by combining global influence and local influence.Caiet al.[11]explored the community property to improve the efficiency of the algorithm and proposed a communitybased greedy algorithm to identify the seed nodes.The advantage of community-based methods is that they provide a good trade-off between influence propagation and runtime.However, there are two problems: first,there is a lack of effective strategies to reduce the search space when selecting select seed nodes in large networks; and second, some of the algorithms suffer from the community overlap problem.

    In recent years, metaheuristic algorithms have been proposed to efficiently solve the IM problem.Zareieet al.[12]defined the cost function as the influence of nodes and the distance between them,and proposed a population-based gray wolf algorithm to solve the IM problem.Liet al.[13]proposed a discrete crow optimization metaheuristic algorithm to efficiently solve the IM problem.This type of algorithm has a significant improvement in running time when compared with the greedy strategy-based approach.There is also a substantial improvement in the solution accuracy when compared to the centrality-based methods.However, the existing metaheuristic algorithms have some limitations because they may fall into another local optimum when they try to get rid of the local optimum.With this in mind, we develop a discrete twostage metaheuristic optimization(DTMO)algorithm combining QPSO and L′evy flight to efficiently identify the influential nodes in the network.The main contributions of this paper are as follows:

    A new two-stage metaheuristic optimization algorithm framework was formulated to solve the IM problem.

    (i) The evolution rules of the quantum-behaved particle swarm optimization algorithm were modified and a discrete quantum-behaved particle swarm optimization(DQPSO)algorithm with nonlinearly decreasing randomized crossover operation was developed.

    (ii) A discrete L′evy flight (DLF) algorithm with automatic candidate pool selection based on greedy strategy was presented to enhance the performance of the DQPSO.

    (iii) A new method for population diversity calculation was designed and a novel algorithmic transformation strategy was introduced using this method.

    (iv) Our method was compared with other well-known methods on six real-world social networks.The experiments showed that our method can obtain comparable effects to the algorithms based on greedy strategy but with low time complexity.

    The rest of this paper is organized as follows.Section 2 reviews and discusses the related work.The problem description,the fitness assessment function,and the propagation model are given in Section 3.Section 4 presents the original QPSO and L′evy algorithms and describes our proposed framework in detail.The experimental results and analysis are given in Section 5.Finally, this study is summarized and future research directions are proposed in Section 6.

    2.Related work

    The IM problem was first proposed from a network perspective by Domingos and Richardson,[5]where the authors argued that consumers and the individuals around them are interconnected and have an interacting influence, which was modeled through Markov random field theory.Kempeet al.[6]transformed the IM problem into a combinatorial optimization problem.They adopted the Monte Carlo simulation mechanism to evaluate the influence of candidate nodes and introduced a greedy algorithm that was based on a hill-climbing search strategy to find the influential nodes.To reduce the expensive computational cost that arose from the Monte Carlo simulations,Leskovecet al.[14]developed an improved greedy algorithm that was scalable to large-scale social networks.Their experiments showed that it is 700 times faster than the simple greedy algorithm, while the results are nearly optimal.Subsequently, Goyalet al.[15]proposed a superior version called CELF++, which is 35%–55% faster than CELF.Following this seminal work, Zhanget al.[16]introduced a residual-based algorithm RCELF that can achieve good time efficiency, low memory consumption, and approximate quality of the results.Compared with the original greedy algorithm, the improved greedy algorithm has a certain degree of improvement in terms of time cost.However,some algorithms need to record the states during propagation to reduce the number of Monte Carlo simulations.Meanwhile,some algorithms increase the memory consumption,which means that they cannot be scaled to real large-scale social networks.

    Several heuristic algorithms have been put forward to tackle IM variations.Chenet al.[17]gave a more accurate discount value to the neighbors of the nodes selected as seeds and proposed the DegreeDiscount under the IC model with small propagation probability.Their experiments showed that the fine-tuned heuristic can provide a truly scalable solution to the IM problem with satisfactory propagation range and greater efficiency.Zareieet al.[18]proposed a special hierarchical measure to provide sufficient information about the topological position of the nodes,which ranks the influence of nodes more accurately than other state-of-the-art measures.Wanget al.[19]introduced a new metric, which they called node key degree,to measure the importance of nodes,and proposed the IT¨O algorithm to balance the conflict between exploration and exploitation.More recently, considering the dynamic nature and local aggregation factors on diffusion,Liet al.[20]adopted various entropy calculations to obtain the cohesion between neighboring nodes and then identify whether the node has the ability to become a propagable pioneer of other nodes.Menget al.[21]combined H-index,K-shell iteration factor,and clustering coefficient to attach weights to connected edges,which were in turn combined with the neighborhood, position and topology of nodes in the network to identify influential nodes.Liet al.[22]combined an improved gravity model with the community detection method to identify influence propagators in the network by finding bridge nodes in the network’s topology.Compared with traditional centrality methods, the methods combining the node characteristics can achieve a certain degree of improvement in accuracy.However,there is also a high time complexity,which makes it difficult to apply these methods to large-scale networks.In addition, some methods only measure the local structure of the network without diversity,and therefore lack solution stability when dealing with the IM problem.

    Some recent research interest has focused on the use of metaheuristic algorithms,broadly referring to the construction of low computational cost influence evaluating models and the utilization of appropriate evolutionary optimization strategies to view the IM problem as a fitness optimization problem.Jianget al.[23]were the first to use the fitness evaluation function, named expected diffusion value (EDV), as an influence evaluation measurement and proposed a simulated annealing algorithm to optimize EDV to identify a set of influential seed nodes.Their experimental results showed that the proposed algorithm runs 2–3 orders of magnitude faster than the state-of-the-art greedy algorithm,while improving the optimal solution accuracy.Gonget al.[24]proposed a discrete particle swarm optimization algorithm to map candidate seeds to particles in the population and established a novel evaluation function called local influence estimation (LIE), which can be evaluated more accurately under the IC model with lower time complexity.A metaheuristic discrete bat algorithm based on the collective intelligence of individual bats from the population was proposed by Tanget al.[25]This algorithm combines the evolutionary rules of the original bat algorithm and designs a seed node candidate pool to enhance the search capability of the algorithm, and finally achieves satisfactory experimental results.By analyzing the efficiency of the greedy algorithm,Cuiet al.[26]proposed a degree-descending search strategy and developed a more efficient evolutionary algorithm,named degree-descending search evolution(DDSE),through the operations of mutation,crossover,and greedy selection.Singhet al.[27]extended EDV to a two-hop area to realize a more accurate evaluation of seed nodes and proposed a variant of discrete particle swarm optimization(DPSO)based on the mechanism of learning automata.To maximize the distance between the seed nodes and ensure that different parts of the network are reached,Zareieet al.[12]solved the IM problem by optimizing the influence of nodes and the distance between them via the gray wolf optimization algorithm, which performed well in experimental results and had lower computational cost.Wanget al.[28]developed an influence evaluation model based on the total valuation and valuation differences of neighboring nodes.The authors developed an evolutionary strategy with local crossover and variation on natural moth evolutionary rules.Their experiments showed that the method is effective and robust in dealing with the IM problem.After conducting extensive experiments, Weskidaet al.[29]showed computationally that evolutionary algorithms not only overcome the limitations of greedy algorithms but also have several advantages, such as the transferability of their parameters.However,a reasonable discrete evolutionary mechanism can provide a balanced trade-off in terms of solution accuracy,time consumption,and even memory management.Therefore,the design of more effective influence evaluation mechanisms and more reasonable evolution mechanisms deserves further discussion.

    Quantum-behaved particle swarm optimization, as a swarm intelligence algorithm, was proposed by Sunet al.[30]from a quantum mechanical perspective by combining some features of the original particle swarm optimization(PSO)algorithm.Due to its efficiency and robustness, this algorithm has recently been applied to solve problems in various fields.For example, a hybrid inversion method based on the quantum particle swarm optimization method was introduced to solve the electromagnetic inverse problem by Yanget al.[31]Bajajet al.[32]proposed a discrete quantitative particle swarm optimization to improve the efficiency of test case prioritization.There are many other studies and applications of QPSO,such as path planning and the design of mobile robots in the workspace,[33]the constrained portfolio selection problem,[34]and the network clustering problem.[35]The results of these studies show that the QPSO algorithm provides strong robustness and solution efficiency thanks to its excellent evolutionary rules.

    QPSO has attracted the attention of many researchers due to the simplicity of the evolution equation,few control parameters, and fast convergence, but it also suffers from problems such as premature convergence.As a random wandering strategy,L′evy flight is mainly adopted by combinatorial optimization algorithms to effectively solve intractable optimization problems, such as the green scheduling problem of the flexible manufacturing cell.[36]However,the use of combinatorial algorithms based on QPSO and L′evy flight for the IM problem has not yet been reported in the literature.Therefore, exploring reasonable evolutionary mechanisms based on QPSO and L′evy flight to effectively identify influential nodes is worth further investigation.

    3.Preliminary information

    3.1.Influence maximization

    In the study of IM,a social network can be abstracted as a graphG=(V,E),whereV={v1,v2,...,vn}is the set of vertices, representing the individuals or organizations in the social network, andE={e1,e2,...,em}is the set of connected edges, indicating the existence of connections and cooperation between individuals or organizations in the social network.Note thatnandmdenote the number of vertices and the number of connected edges in the network,respectively.

    For a given graphG,a set ofk(k ?n)influential nodes are selected and ignited.The number of nodes activated by the seed set in the graph is expected to be maximized under a specific propagation model.This problem can be formalized as

    whereσ(·) is a measure of influence spread,Srepresents a candidate seed set withknodes andS?denotes the optimal seed set that maximizes the influence spread.

    3.2.Influence estimation function

    In the IM problem, the influence evaluation methods are divided into two main categories: (i) in the first category, a Monte Carlo simulation evaluates the propagation outcomes of the influential nodes;and(ii)in the second category,information based on the neighborhood structure characteristics of the nodes is utilized to estimate the diffusion effect of the seed nodes.

    Although the Monte Carlo simulation method can achieve high accuracy, it is not well satisfied with practical scenarios due to its tremendous computational complexity.Therefore,to reduce computational cost, Jianget al.[23]proposed an influence evaluation function based on the direct adjacent neighbors of its corresponding seed nodes.Inspired by the principle of two-degree theory on influence spreading,[37]Gonget al.[24]proposed a LIE function, which approximates the expected influence spread based on the two-hop neighbors area of the influential nodes,

    3.3.Influence propagation model

    Currently, there are three widely spreading models for simulating influence propagation in the IM problem: the IC model,the LT model,and the weighted cascade model.Based on the influence estimator, we employ the classical IC model to simulate the spread of influence in given networks.In the IC model, nodes have two states: active and inactive.The node can only be converted from the inactive state to the active state during the propagation process, and vice versa.In the diffusion process,when a node is activated at timet,it has a single chance at timet+1 to activate its direct inactive neighbors with probabilityp.When a new node is activated, it repeats the previous step until no new node is activated,the propagation ends,and all nodes in the active state are returned.

    4.Algorithm

    4.1.Quantum-behaved particle swarm optimization

    PSO, one of the most widely used swarm intelligence algorithms, was originally proposed by Kennedy and Eberhart.[38]PSO is often used to solve optimization problems due to its effectiveness and robustness.The original updating rules for PSO can be described as follows:

    wherewis the inertia weight,c1is the individual learning factor,c2is the social learning factor, andr1andr2are random numbers drawn uniformly from[0,1].Xi=(x1,x2,...,xd)andVi=(v1,v2,...,vd)represent the position vector of theith particle in thedth dimension and its corresponding velocity vector,respectively.Pbestidenotes the historical best position of particleiand Gbest is defined as the best position in the whole population.More specifically,the first partwVtiin Eq.(4)reflects the effect of the particle’s velocity at timeton its new velocity at timet+1,and the second partc1r1(Pbesti?Xti)and the third partc2r2(Gbest?Xti) imply that the particle learns information from its corresponding historical optimal position and global optimal position of the population,respectively.

    In recent years, many strategies have been proposed to enhance the performance of PSO, such as L′evy flight,[39]multi-swarm cooperative approach,[40]and fitness landscape features.[41]Inspired by quantum mechanics theory and trajectory analysis,[42]the ideology of quantum parallel mechanics is introduced into the framework of PSO to improve the performance of the algorithm,termed the quantum particle swarm optimisation algorithm,which outperforms traditional PSO in terms of exploration capability but with fewer control parameters.In QPSO,the position of theith particle is updated according to the following equations:

    where Pbestiand Gbest denote the historical best position and the global best position of theith particle, respectively.Piis defined as a local attractor.According to Eq.(6), it can be seen that the local attractorPiis located in a hyper-rectangle with Pbestiand Gbest as vertices.?anduare random numbers in the interval(0,1),βis a contraction-expansion factor,and mbest is the average of the best positions of all particles.Ifu <0.5, then the minus symbol “?” is selected in Eq.(7),otherwise the plus sign“+”will be selected.The framework of QPSO is given in Algorithm 1.

    Algorithm 1 The framework of QPSO.Initialize each particle’s position,Pbest,Gbest while T <Tmax do for each particle do Calculate local attractor Pi using Eq.(6)Compute particle’s position using Eq.(7)Update Pbest and Gbest end for end while Return the best position Gbest.

    4.2.L′evy flight

    In nature,most animals generally combine frequent shortdistance wandering with occasional long-distance travel when foraging food.As a random walk process,L′evy flight mainly consists of frequent local exploitation and occasional global exploration of the search space.The application of this mechanism to swarm-based intelligence algorithms can enhance the global search capability of the metaheuristics and prevent them from falling into premature convergence.By combining the characteristics of L′evy flight, some researchers have introduced hybrid swarm intelligence optimization algorithms[36]with promising results.The following are the rules to calculate the inherent step lengths of L′evy flight:

    wherelrepresents the random step.For the parameter setting,1<m ≤3,andμ~N(0,σ2μ),υ~N(0,σ2υ).υandυare random numbers obeying Gaussian distribution,whileσμandσυsatisfy the following equations:

    where Γ(·)denotes Gamma function.Figure 1 shows the trajectory of an individual wandering randomly in the search space under the L′evy flight mechanism.

    Fig.1.The trajectory of an individual after flying 1000 steps under theL′evy flight in two dimensions.

    4.3.Proposed algorithm

    The whole framework of the proposed algorithm for IM is outlined in Algorithm 2.The algorithm is divided into three main stages: (i) initialize the particles in the population; (ii)update the positions of the particles in the population according to the rules of DQPSO;and(iii)apply the L′evy flight strategy on the Gbest and finally output the optimal solution.

    Algorithm 2 The framework of the proposed algorithm.Input Graph G=(V,E),size of particle swarm n,size of seed set k,number of iterations Tmax and the contraction-expansion coefficient β1 and β2.Initialize particle position vectors X and Pbest Initialize historical diversity value HDV ←0 Initialize stages of algorithm evolution Stage ←1 Initialize iterator T ←0 Compute the shortest path length matrix M for graph G Compute fitness(X)and fitness(Pbest)Select out the initial global best position vector Gbest while T <Tmax do Update the stage of the evolution Stage and identify the algorithm to be selected Algorithm switch Algorithm do case Algorithm==“DQPSO”do Apply the DQPSO algorithm to update X Update Pbest and Gbest end case case Algorithm==“DLF”do Apply the DLF algorithm to update Gbest end case end switch T ←T+1 end while Output Output the best position Gbest as the seed set S.

    4.3.1.Initialization

    During the initialization phase,a degree-based initialization strategy similar to that of DPSO is employed.First, all particles in the population select the topknodes with the greatest degree in the graphG.At the same time,to guarantee the diversity of the population, a random replacement operation on the nodes in each particle is performed,i.e.,when the random value is greater than 0.5,the corresponding node will be replaced by any node in the graphGthat has not been selected as a candidate node in that particle.The same approach is utilized when initializing Pbest.The detailed initialization procedure is given in Algorithm 3.

    Algorithm 3 Initialization.Input Graph G=(V,E),the size of particle swarm n,size of seed set k.for each i ≤n do Xi ←degree(G,k)for each element xij ∈Xi do if random>0.5 then xij ←replace(xij,N)end if end for end for Output The initial position vector X.

    4.3.2.Discrete quantum-behaved particle swarm optimization algorithm

    The original QPSO algorithm is only applicable to solve optimization problems with continuous space.Therefore, the update rules are redesigned in discrete form to solve the IM problem.The new evolutionary mechanism of DQPSO is defined as

    whereuis a random value between 1/e and 1,Xtiis the position vector of theith particle at iterationt,βrepresents contraction-expansion coefficient, andβln(1/u) is redefined as the crossover probability, as described by the following equation:

    forβ1=1,β2=0.5.Tmaxrepresents the maximum number of iterations.From Eqs.(10) and (11), it is obvious thatβgenerally varies nonlinearly from 1 to 0.Whenβreaches a large value in the first few steps, the crossover ability of the particles becomes stronger,which indicates that the particles have stronger exploration ability.In the later stages, the crossover ability of the particles gradually becomes weaker and ostensibly the particles gradually tend to converge.However, since ln(1/u)is a random value,there is also a lower probability of obtaining a stronger crossover ability, which to some extent increases the diversity of the population.

    In Eq.(10),Ptiis given by

    where?is a random value drawn from [0,1],k?is rounded upward to determine the number of nodes to be randomly selected in Gbest or Pbest, and then the selected nodes are merged to obtain the local attractorPi.When selecting nodes at random, it is important to ensure that the selected nodes cannot be duplicated.The specific operation is shown in Fig.2, assuming that Pbesti={1,5,10,17,20}, Gbest={3,5,11,14,19},k=5,?=0.36,thenk?=2;therefore,two nodes in Pbset and three nodes in Gbest need to be taken for combination.

    Fig.2.Illustration of how to obtain local attractor Pi.The blue boxes represent the nodes to be randomly selected.

    In the original QPSO algorithm, mbest is the average of the best positions of all of the particles.When mbest takes this case, it does not guide the particles very well, and therefore mbest is redefined as the average of the optimal positions of the top three particles.First,the top three particles are divided into two portions,the first portion includes the common nodes belonging to the three particles,and the second portion maintains the remaining nodes in the particles.All of the nodes in the first portion are then selected into Mbest.Finally, the nodes are randomly selected from the second component until there areknodes in the Mbest.A detailed illustration of this operator is shown in Fig.3.It is assumed that the top three historical optimal positions are Pbest1={1,3,4,7,11},Pbest2={1,4,6,8,10},Pbest3={1,5,4,8,11},the identical nodes are then{1,4},and the remaining nodes are{3,10,11,6,8,7,5},finally Mbest={1,4,8,5,10}is obtained by the restructuring mechanism.

    Fig.3.Illustration of the calculation of Mbest.The blue boxes represent common nodes belonging to all three particles and the green boxes represent randomly selected nodes.

    The operator∩in Eq.(10)is a logical operator that is defined as a similar intersection operation to determine whether there are different elements in Mbest andXi.When a node inXiis a unique node to Mbest, the crossover probabilityβln(1/u)is calculated.Ifβln(1/u)is greater than a random value drawn from[0,1],then a node in Mbest that is not inXiis selected for the intersection exchange operation;otherwise,no operation is performed on that node.The⊕operation is the process of greedy search of the local attractorPsubject to the new particle position vectorXiobtained by the crossover operation.In this process, the nodes in the local attractorPithat are identical to those inXiare removed and then treated as a pool of candidate nodes.For each node inXi,an arbitrary node from the candidate node pool is selected to replace it.Meanwhile, the selected node is removed from the candidate node pool.When the position of the node after being replaced is better than the previous position, then any node from the candidate node pool continues to be selected for replacement;otherwise, the same operation is performed for the next node inXi.It should be noted that the operation is terminated when there is no node in the candidate pool.The framework of the DQPSO algorithm for IM is presented in Algorithm 4.

    Algorithm 4 DQPSO algorithm framework.Input Particle position vectors X,the size of particle swarm n,size of seed set k,particle local attractor position vectors P attr,iterator T,the mean of the best position of the top three particles Mbest,the number of iterations Tmax,and the contraction-expansion coefficient β1 and β2.for each i ≤n do if Xij /∈M best do Compute the probability of mutation pmu if pmu >rand do Xi ←replace(Xi j,Mbest)end if end if end for for each i ≤n do candidate pool= /0 if P attrij /∈Xi do cand pool ←cand pool∪P attrij end if X'i ←Xi for each j ≤k do if cand pool== /0 do break end if Flag ←False while Flag==False do if cand pool== /0 do break end if X'ij ←replace(X'i j,cand pool)if fitness(X'i)>fitness(Xi)do Xij ←X'ij else do Flag ←True end if end while X'ij ←Xij end for Xi ←X'i end for Output Output particle position vectors X.

    4.3.3.Algorithm transformation

    To avoid the DQPSO algorithm converging swiftly to a suboptimal global solution,a metric to assess the diversity of the population is conceived.The diversity metric can be formulated as follows:

    wherenis the size of the particle swarm,kis the size of the seed set, and the∩operation returns the number of identical nodes in the two position vectors.It can be seen from Eq.(13)that the diversity value becomes larger and the diversity of the population decreases with the evolution of the algorithm.When the diversity value of the population is less than its historical,it indicates that the population has converged to a stagnation.In this case,the algorithm will perform the second stage,i.e.,discrete L′evy flight,to identify a more optimal position.The framework of updating stage and identifying algorithm is given in Algorithm 5.

    Algorithm 5 Update Stage and identify Algorithm.Input.Particle position vectors X,particle best position vectors Pbest,evolution stage Stage,and historical diversity value HDV.switch Stage do case Stage==1 do Compute Mbest Compute P attr Compute the current diversity value CDV if CDV?HDV >0 do HDV=CDV Algorithm=“DQPSO”end if else do Stage=2 Algorithm=“DLF”end case case Stage==2 do Algorithm=“DLF”end case end switch Output Output the stage of the evolution Stage and identify the algorithm to be selected Algorithm.

    4.3.4.Discrete L′evy flight

    The original L′evy flight is not available to solve discrete IM problem directly.Therefore, a discrete L′evy flight mechanism based on the shortest path length of the network is proposed.

    Since the previous stage evolves through the DQPSO algorithm, the population tends to remain in an optimal state.Therefore,there is no need to perform discrete L′evy flight for all of the particles in the population but only for the Gbest.The shortest path length matrixMof graphGis first obtained in the initialization phase,and then L′evy flight step lengthlis derived from Eq.(7)and rounded upward.During the searching process, each node in Gbest will be replaced with a randomly selected node from the candidate pool, which is composed of nodes in Gbest with the same shortest path length in the network and the same flight step lengthlbut not the same as in Gbest.When the step flight lengthlis greater than the maximum shortest path length of that node in the network,the flight lengthltakes the maximum shortest path length of that node in the network.The detailed replacement process is the same as the⊕operation mentioned earlier.The framework of the DLF algorithm for IM is described in Algorithm 6.

    Algorithm 6 DLF framework of algorithm.Input The best position Gbest and the shortest path length matrix M.Gbest'←Gbest for each i ≤k do compute the step size of the L′evy flight l cand pool ←M(Gbest(i),l)if cand pool== /0 do break end if Flag ←False while Flag==False do if cand pool== /0 do break end if Gbest'i ←replace(Gbest'i,cand pool)if fitness(Gbest')>fitness(Gbest)do Gbest ←Gbest'else do Flag ←True end if end while Gbest'←Gbest end for Output Output the best position Gbest'.

    5.Experiment and analysis

    5.1.Network data sets and baselines

    To verify the performance of the proposed DTMO on the IM problem,we conducted extensive experiments on six realworld networks that were collected from NR with the topological characteristics shown in Table 1,where〈k〉represents the average node degree,Cis the average clustering coefficient,andACrepresents the assortativity coefficient.Figure 4 shows the node degree distribution of the networks.The results of influence spread are compared with several state-of-the-art methods, including the degree centrality (DC) based on the network topology, discrete moth-flame optimization (DMFO),[28]DDSE,[26]DPSO,[24]learning automatabased discrete particle swarm optimization(LAPSO),[27]costeffective lazy forward (CELF)[14]algorithm based on greedy strategy,and layered gravity bridge algorithm(LGB).[22]

    Table 1.Topological characteristics of the six social networks.

    5.2.Parameter configuration

    To test the scalability of the algorithm, the size of the seed setkwas set to 5, 10, 15, 20, 25, 30, 35, 40, 45, and 50, respectively, the maximum iterationsTmaxwere 100 and the population size was chosen as 100.In DMFO,the amplification factor was set toc=4, the mutation probability was 0.1,and the coefficientωwas 0.8.In DPSO and LAPSO,the learning factors were set toc1=c2=2,the inertia weight was 0.8,and additionally the values of the reward and punishment parameters were set toar=bp=0.6 in LAPSO.In DDSE,the probabilities of mutation, crossover, and diversity operations were set to 0.1, 0.4, and 0.6, respectively.The number of Monte Carlo simulations for CELF was set to 10000.In addition, 1000 Monte Carlo simulations were performed on the optimal set of seeds obtained by all of the other algorithms to obtain the average spreading coverage under the IC model with propagation probabilityp=0.01.

    5.3.Comparison of the LIE evaluation

    To validate that DQPSO and DLF play a desirable effect on their respective phases, we compared the fitness values of the obtained optimal seed sets of DTMO,DQPSO,and DPSO.Figure 5 shows the average LIE of different seed sizekon the six networks.

    In the Delaunay network,as shown in Fig.5(a),all three algorithms perform competitive results over the entire interval, and a detail view atk=50 shows that DTMO gains a better marginal gain.In Blog and CaGrQc, the algorithms gradually show visible gaps as the seed numberkincreases and the gap gradually becomes more evident as the network’s scale increases.In Figs.5(d) and 5(e), it can be seen that DPSO is highly prone to suboptimal solutions, while DTMO and DQPSO have no evident instability, which indicates that the proposed algorithm has strong robustness.It is worth mentioning that, except for the Ca-GrQc network, the fitness values of DTMO and DQPSO are not significantly different throughout the interval ofk.In contrast, in Fig.5(c), there is a significant gap between the algorithm DTMO and DQPSO atk=50.This indicates that the random wandering strategy in the second stage of the algorithm compensates for the deficiency of the DQPSO algorithm falling into premature convergence.Overall,both the two-stage DTMO and the separate DQPSO achieved satisfactory results in all six networks.

    Fig.5.Comparison of LIE optimization of the three algorithms in the six social networks at different seed size k under p=0.01.

    5.4.Performance comparison of the typical algorithms

    To further validate the ability of the proposed DTMO algorithm to solve the IM problem,six state-of-the-art methods were selected to compare with DTMO in terms of the number of nodes activated in the network under the IC model.As shown in Fig.6, the spread size achieved by DTMO shows that it can return satisfactory propagation in the six networks.Moreover,it can be seen that DTMO has the most stable performance in different scenarios.

    More specially, in the Delaunay network, it can be observed that the algorithms achieve similar influence spread throughout the range of 5≤k ≤50,and the proposed DTMO algorithm achieves the best result.In the Blog network shown in Fig.6(b), comparable results are obtained for all six algorithms except DMFO on the interval of 15≤k ≤25.There is a significant decline in the effectiveness of DPSO whenk ≥30.Atk=50,DDSE outperforms the others by a significant margin,while DTMO comes in a close second.

    Figure 6(c)shows that CELF,DMFO,LGB,and DTMO can maintain good momentum whenk ≥15.LAPSO and LGB algorithms achieve similar performance over the entire interval,while the other algorithms show different levels of performance degradation.Atk=45 andk=50, both DTMO and DMFO outperformed the CELF and achieved the best influence spread.In addition,DTMO and DMFO achieved one optimal result each,indicating that both DTMO and DMFO have strong competitiveness in this network.Figure 6(d)shows that the ranking of all algorithms remains essentially constant over the entire range of seed size, with CELF and DTMO achieving comparable performance, and LAPSO coming in second.It should be noted that in Figs.6(c)and 6(d),both DDSE and DC showed lower efficiency.This is probably due to the fact that in both networks only the one-hop neighbors of the candidate nodes are evaluated,which leads to the problem of overlapped influence propagation in the propagation process.

    In Fig.6(e), similar experimental results were obtained by LAPSO,CELF,DC,LGB,and DTMO.More specifically,LAPSO performed the best in the interval of 15≤k ≤45,while CELF and DTMO were entangled with each other in the influence size.Atk=50,DTMO,LGB,and LAPSO obtained the same results.It is worth mentioning that the topology of the network is a star structure, so DC can achieve satisfactory results.Meanwhile,DC degenerated atk=50 because it suffers from the influence overlap problem as the number of selected nodes increases.In the AstroPh network of Fig.6(f),DMFO and DTMO have achieved relatively high performance but were slightly inferior to CELF.

    In summary, DTMO achieved comparable or even better results than CELF in most cases, indicating that DTMO can effectively solve the IM problem.DC and DDSE performed poorly in some networks because they only evaluated the one-hop neighbors of the nodes, resulting in inaccurate evaluation of influence.Although DPSO was more accurate in evaluating candidate nodes,the algorithm tended to be stagnant because its local search strategy easily returns the local optimum.LGB offers a dramatic improvement in influence dissemination when compared to traditional centrality-based approaches.LAPSO and DMFO achieved desirable results in some scenarios.This indicates that the improvement of PSO and the searching strategy in DMFO are very effective, and the respective evaluation functions can accurately evaluate the influence of the nodes.

    Fig.6.Comparison of the influence spread size of DTMO against six other algorithms under the IC model(p=0.01)on the six networks.

    5.5.Statistical tests

    To demonstrate the effectiveness of the proposed DTMO algorithm in identifying influence spreaders,a statistical analysis was employed to test the statistical significance of the performance differences of the six algorithms on the six networks,the results are reported in Table 2.In all six networks,the scenarios ofk=10,20,30,40, and 50 were chosen as independent problems,and hypotheses were tested for each scenario.Wilcoxon rank sum test at the confidence level of 0.05 was conducted to show the superior performance of DTMO over the other six algorithms.

    From the statistical results, it can be seen that the influence propagation obtained by the DTMO algorithm is better than DPSO algorithm on the whole selected interval.DDSE, DMFO, DC, and LGB have similar performance,while LAPSO has slightly better performance.At the same time, it can give a similar performance guarantee when compared with CELF.

    Table 2.Statistical results of the Wilcoxon test for the seven algorithms at α =0.05.

    6.Conclusion

    In this paper,a DTMO algorithm combining QPSO with L′evy is proposed to solve the IM problem.In the first stage of the algorithm,the evolutionary rules of the redefined DQPSO are used to update the particle positions to make the particles fly to a more optimal position.At the same time, population diversity is defined to determine whether the particles in the population converge to the optimal.When the particles in the population are in convergence, the second stage of the algorithm is performed to obtain the global optimal solution by updating the optimal positions of the particles in the population using the redesigned DLF mechanism.Finally, experiments with other well-known algorithms on six real networks show that the proposed algorithm obtains comparable or even slightly superior results to CELF but with less computational cost and obtains significantly better results when compared to the other algorithms.

    Acknowledgments

    Project supported by the Zhejiang Provincial Natural Science Foundation (Grant No.LQ20F020011), the Gansu Provincial Foundation for Distinguished Young Scholars(Grant No.23JRRA766),the National Natural Science Foundation of China (Grant No.62162040), and the National Key Research and Development Program of China (Grant No.2020YFB1713600).

    猜你喜歡
    張莉
    BLOW-UP SOLUTIONS OF TWo-COUPLEDNONLINEAR SCHRODINGER EQUATIONS IN THE RADIAL CASE*
    熟人好辦事
    故事會(2022年20期)2022-10-20 09:21:56
    追尋兩份立功喜報背后的故事
    黨史縱覽(2022年4期)2022-04-25 22:49:42
    是講述,也是辨認(外一篇)
    作品(2021年6期)2021-07-29 14:08:51
    Cluster mean-field study of spinor Bose–Hubbard ladder:Ground-state phase diagram and many-body population dynamics?
    教與學
    金秋(2021年18期)2021-02-14 08:25:40
    幼兒圖畫
    完美少婦欲出軌:你可知道放縱的代價多沉重
    冬天里的溫暖
    冬天里的溫暖
    東方劍(2017年4期)2017-06-19 16:25:32
    看免费成人av毛片| av在线亚洲专区| 能在线免费观看的黄片| 嫩草影院新地址| 久久久成人免费电影| 欧美最新免费一区二区三区| 天堂网av新在线| 能在线免费观看的黄片| 少妇猛男粗大的猛烈进出视频 | 插逼视频在线观看| 亚洲av中文字字幕乱码综合| 欧美成人精品欧美一级黄| 欧美成人a在线观看| 亚洲精品国产成人久久av| 精华霜和精华液先用哪个| 欧美精品一区二区大全| 日本免费a在线| 婷婷亚洲欧美| 赤兔流量卡办理| 日本三级黄在线观看| 久久精品夜色国产| 18禁裸乳无遮挡免费网站照片| 国产精品爽爽va在线观看网站| 国产av不卡久久| 亚洲精品日韩av片在线观看| 亚洲精品日韩在线中文字幕 | 男女视频在线观看网站免费| 久久国内精品自在自线图片| 国产视频内射| 简卡轻食公司| 丝袜美腿在线中文| 欧美性猛交黑人性爽| 日韩制服骚丝袜av| 久久欧美精品欧美久久欧美| 日本-黄色视频高清免费观看| 91狼人影院| 99热精品在线国产| 欧美高清性xxxxhd video| a级毛色黄片| 久久久色成人| 欧美激情在线99| a级毛片免费高清观看在线播放| 国产精品久久久久久精品电影| 人人妻人人澡欧美一区二区| 身体一侧抽搐| 岛国毛片在线播放| 免费av观看视频| 国产精品电影一区二区三区| 嘟嘟电影网在线观看| 能在线免费观看的黄片| 亚洲欧美中文字幕日韩二区| 99在线视频只有这里精品首页| 亚洲欧美中文字幕日韩二区| 女人被狂操c到高潮| 亚洲精品国产av成人精品| 亚洲av熟女| 国产精品三级大全| 亚洲av.av天堂| 亚洲av免费在线观看| 国产精品无大码| 精品人妻偷拍中文字幕| 看十八女毛片水多多多| 日韩欧美在线乱码| 亚洲欧美日韩高清在线视频| 国内久久婷婷六月综合欲色啪| 麻豆精品久久久久久蜜桃| 老司机影院成人| 一边摸一边抽搐一进一小说| 国产黄片视频在线免费观看| 欧美一区二区国产精品久久精品| 丰满人妻一区二区三区视频av| 99热这里只有是精品50| 麻豆av噜噜一区二区三区| 老司机影院成人| 99久久精品国产国产毛片| 卡戴珊不雅视频在线播放| 国产一区二区三区在线臀色熟女| 久久精品影院6| 久久久久久大精品| 性插视频无遮挡在线免费观看| 久久韩国三级中文字幕| 精品不卡国产一区二区三区| 伦精品一区二区三区| 午夜免费男女啪啪视频观看| 欧美最新免费一区二区三区| 自拍偷自拍亚洲精品老妇| 亚洲乱码一区二区免费版| 日韩制服骚丝袜av| 日本免费a在线| 最近2019中文字幕mv第一页| 亚洲人成网站在线播| 99久久精品一区二区三区| 欧美高清成人免费视频www| 日本-黄色视频高清免费观看| 亚洲成人中文字幕在线播放| 哪里可以看免费的av片| 岛国在线免费视频观看| 99久久精品国产国产毛片| 狂野欧美白嫩少妇大欣赏| 在线免费观看不下载黄p国产| 亚洲真实伦在线观看| av免费观看日本| 国产av在哪里看| 午夜福利在线在线| 欧美一区二区精品小视频在线| 18禁黄网站禁片免费观看直播| 亚洲精品亚洲一区二区| 成人毛片60女人毛片免费| 国产黄片美女视频| 一个人看的www免费观看视频| 少妇熟女aⅴ在线视频| 国产免费男女视频| 国产免费男女视频| 熟妇人妻久久中文字幕3abv| 国产精品蜜桃在线观看 | 免费看美女性在线毛片视频| a级毛片免费高清观看在线播放| 国产亚洲91精品色在线| 亚洲精品色激情综合| av免费在线看不卡| 国产精品国产三级国产av玫瑰| 精品一区二区免费观看| 爱豆传媒免费全集在线观看| 久久久久久久久久黄片| 在线免费观看的www视频| 丰满人妻一区二区三区视频av| 日日撸夜夜添| 国产精品,欧美在线| 丰满人妻一区二区三区视频av| 五月玫瑰六月丁香| 天堂√8在线中文| 久久精品影院6| 成人特级av手机在线观看| 一级毛片电影观看 | 你懂的网址亚洲精品在线观看 | 黄色日韩在线| 国产精品国产高清国产av| 国产白丝娇喘喷水9色精品| 九草在线视频观看| 久久久久久久久久久免费av| 亚洲欧美日韩东京热| 久久久久国产网址| .国产精品久久| 在线天堂最新版资源| 国产极品精品免费视频能看的| 悠悠久久av| 亚洲精品自拍成人| 免费看a级黄色片| 国产精品无大码| 最新中文字幕久久久久| 色综合亚洲欧美另类图片| 菩萨蛮人人尽说江南好唐韦庄 | 内射极品少妇av片p| 99久久九九国产精品国产免费| 免费av不卡在线播放| 亚洲人成网站在线播放欧美日韩| 免费观看在线日韩| 中文字幕av成人在线电影| 国产精品久久久久久亚洲av鲁大| 亚洲自拍偷在线| eeuss影院久久| 菩萨蛮人人尽说江南好唐韦庄 | 免费无遮挡裸体视频| av福利片在线观看| 夫妻性生交免费视频一级片| 国产一级毛片七仙女欲春2| 午夜福利在线在线| 久久热精品热| 亚洲精品自拍成人| 日本色播在线视频| 亚洲av.av天堂| 亚洲内射少妇av| 美女xxoo啪啪120秒动态图| 日本免费a在线| 成人无遮挡网站| 国产片特级美女逼逼视频| 久久精品夜色国产| 如何舔出高潮| 男女那种视频在线观看| 麻豆一二三区av精品| 日韩国内少妇激情av| 国语自产精品视频在线第100页| 欧美区成人在线视频| 1000部很黄的大片| 日韩精品青青久久久久久| 亚洲欧美日韩无卡精品| 国产伦精品一区二区三区视频9| www.色视频.com| 一边亲一边摸免费视频| 黄色视频,在线免费观看| 亚洲av第一区精品v没综合| 欧美成人a在线观看| 久久久色成人| 桃色一区二区三区在线观看| 99久久人妻综合| 国内精品久久久久精免费| 国产精品野战在线观看| 内射极品少妇av片p| 女同久久另类99精品国产91| 在线观看av片永久免费下载| 亚洲精品日韩av片在线观看| 日韩欧美一区二区三区在线观看| 久久精品影院6| 激情 狠狠 欧美| 亚洲精品影视一区二区三区av| 亚洲精品国产av成人精品| 少妇人妻精品综合一区二区 | 国内精品久久久久精免费| 91精品一卡2卡3卡4卡| 一个人看的www免费观看视频| 免费观看在线日韩| 亚洲精品亚洲一区二区| 久久亚洲精品不卡| 国产黄a三级三级三级人| 国产黄片视频在线免费观看| 日本一二三区视频观看| 人妻系列 视频| 高清在线视频一区二区三区 | 禁无遮挡网站| 成人亚洲精品av一区二区| 熟女人妻精品中文字幕| 99热这里只有是精品在线观看| 欧洲精品卡2卡3卡4卡5卡区| 国产在线男女| 亚洲精品久久久久久婷婷小说 | 岛国毛片在线播放| 少妇人妻一区二区三区视频| 天天躁日日操中文字幕| 成人亚洲精品av一区二区| 日日摸夜夜添夜夜添av毛片| 中文欧美无线码| 欧美性猛交黑人性爽| 精品一区二区三区视频在线| 精品久久久久久久久久久久久| 国产熟女欧美一区二区| 一边亲一边摸免费视频| 午夜爱爱视频在线播放| 亚洲国产精品久久男人天堂| 少妇的逼水好多| 国语自产精品视频在线第100页| 99久久精品热视频| 能在线免费看毛片的网站| 精品国内亚洲2022精品成人| 国产午夜福利久久久久久| 搡女人真爽免费视频火全软件| 亚洲av免费高清在线观看| 亚洲人成网站高清观看| 午夜福利在线在线| 99久久无色码亚洲精品果冻| 真实男女啪啪啪动态图| 欧美一区二区精品小视频在线| 淫秽高清视频在线观看| 国产一级毛片在线| 黄色配什么色好看| 免费不卡的大黄色大毛片视频在线观看 | 99热只有精品国产| 久久九九热精品免费| 国产伦精品一区二区三区四那| 91久久精品电影网| 美女xxoo啪啪120秒动态图| 蜜桃久久精品国产亚洲av| 在线天堂最新版资源| 色吧在线观看| 好男人视频免费观看在线| 国产大屁股一区二区在线视频| 亚洲中文字幕一区二区三区有码在线看| 日韩三级伦理在线观看| 久久久色成人| 欧美日韩国产亚洲二区| avwww免费| 午夜老司机福利剧场| 天堂影院成人在线观看| 插逼视频在线观看| 九九热线精品视视频播放| 国产精品永久免费网站| 欧美三级亚洲精品| 色综合站精品国产| 欧美性感艳星| 亚洲国产精品成人久久小说 | 成人漫画全彩无遮挡| 亚洲美女搞黄在线观看| 精品熟女少妇av免费看| 国产精品精品国产色婷婷| 午夜精品国产一区二区电影 | 国产av麻豆久久久久久久| 12—13女人毛片做爰片一| 久久久久久久午夜电影| 在线免费观看不下载黄p国产| 看黄色毛片网站| 99久久久亚洲精品蜜臀av| АⅤ资源中文在线天堂| 国产淫片久久久久久久久| 国产在线男女| 久久久午夜欧美精品| 听说在线观看完整版免费高清| 欧美xxxx性猛交bbbb| 赤兔流量卡办理| 免费看a级黄色片| 少妇裸体淫交视频免费看高清| 亚洲av电影不卡..在线观看| 国产毛片a区久久久久| av国产免费在线观看| av视频在线观看入口| 欧美极品一区二区三区四区| 免费av不卡在线播放| 天堂√8在线中文| 欧美色欧美亚洲另类二区| 国产欧美日韩精品一区二区| 此物有八面人人有两片| 综合色av麻豆| 色视频www国产| 亚洲性久久影院| 久久久午夜欧美精品| 国产视频首页在线观看| 午夜激情福利司机影院| 麻豆一二三区av精品| 日韩av不卡免费在线播放| 亚洲国产欧美人成| 久久精品久久久久久久性| 欧美激情国产日韩精品一区| 中文欧美无线码| 99国产精品一区二区蜜桃av| 精品久久久久久成人av| 伦理电影大哥的女人| 久久这里只有精品中国| 中国美女看黄片| 又黄又爽又刺激的免费视频.| 中文字幕久久专区| 午夜福利高清视频| a级毛片免费高清观看在线播放| 美女 人体艺术 gogo| 日韩欧美在线乱码| av免费观看日本| 精品久久久久久久末码| 欧美高清性xxxxhd video| 欧美日韩一区二区视频在线观看视频在线 | 日本一本二区三区精品| 国产女主播在线喷水免费视频网站 | 在线免费观看不下载黄p国产| 国产激情偷乱视频一区二区| 亚洲精品亚洲一区二区| 青春草亚洲视频在线观看| 如何舔出高潮| 网址你懂的国产日韩在线| 日日撸夜夜添| 男人和女人高潮做爰伦理| 国产成人a区在线观看| 你懂的网址亚洲精品在线观看 | 久久精品影院6| 精品人妻熟女av久视频| 在线国产一区二区在线| 亚洲真实伦在线观看| 亚洲av熟女| 亚洲天堂国产精品一区在线| av在线蜜桃| 久久久精品94久久精品| 99热这里只有是精品在线观看| 伦精品一区二区三区| avwww免费| 欧美色视频一区免费| 欧美变态另类bdsm刘玥| 人人妻人人澡欧美一区二区| 天美传媒精品一区二区| 午夜精品国产一区二区电影 | 亚洲人成网站在线观看播放| 日产精品乱码卡一卡2卡三| 亚洲av第一区精品v没综合| 国产又黄又爽又无遮挡在线| 亚洲中文字幕一区二区三区有码在线看| 一级毛片电影观看 | 日韩成人av中文字幕在线观看| 中文字幕制服av| 在线观看免费视频日本深夜| 五月玫瑰六月丁香| 少妇人妻精品综合一区二区 | 国产精品福利在线免费观看| 91在线精品国自产拍蜜月| 99久久人妻综合| 日本-黄色视频高清免费观看| 九色成人免费人妻av| 成年免费大片在线观看| 黄色配什么色好看| 精品午夜福利在线看| 日韩一区二区三区影片| 国产毛片a区久久久久| 丰满人妻一区二区三区视频av| 国产精品久久久久久精品电影小说 | 亚洲国产精品sss在线观看| 能在线免费看毛片的网站| 国内精品久久久久精免费| 亚洲精品自拍成人| 69人妻影院| 日本三级黄在线观看| 国产高潮美女av| 日本av手机在线免费观看| 一级二级三级毛片免费看| 直男gayav资源| av在线蜜桃| 一级二级三级毛片免费看| 中文字幕免费在线视频6| 免费观看在线日韩| 淫秽高清视频在线观看| 午夜福利成人在线免费观看| 国产精品久久久久久久电影| 一级毛片电影观看 | 91久久精品国产一区二区成人| 青春草视频在线免费观看| 国产亚洲5aaaaa淫片| 天天躁日日操中文字幕| 久久久精品大字幕| 国产一区二区三区av在线 | 久久精品国产亚洲av涩爱 | 成熟少妇高潮喷水视频| 日本黄色视频三级网站网址| 中文字幕熟女人妻在线| 精品日产1卡2卡| 国内精品美女久久久久久| 免费看美女性在线毛片视频| 亚洲第一电影网av| 一进一出抽搐gif免费好疼| 成人漫画全彩无遮挡| 直男gayav资源| 国产精品久久久久久亚洲av鲁大| 性插视频无遮挡在线免费观看| 欧美潮喷喷水| 日本色播在线视频| 亚洲精品国产av成人精品| 亚洲人成网站在线观看播放| 久久精品国产自在天天线| 欧美xxxx性猛交bbbb| 国产成人精品久久久久久| 男女视频在线观看网站免费| 99精品在免费线老司机午夜| 亚洲精品日韩av片在线观看| 国内精品宾馆在线| 岛国毛片在线播放| 久久精品综合一区二区三区| 精品99又大又爽又粗少妇毛片| 欧美精品一区二区大全| 日日干狠狠操夜夜爽| 可以在线观看毛片的网站| 看非洲黑人一级黄片| 老司机影院成人| 国产精品99久久久久久久久| 国产成人精品婷婷| 女的被弄到高潮叫床怎么办| 在线观看av片永久免费下载| 中国美女看黄片| 欧美人与善性xxx| 亚洲av免费在线观看| 国产v大片淫在线免费观看| 寂寞人妻少妇视频99o| 亚洲av一区综合| 亚洲国产精品久久男人天堂| 亚洲精品自拍成人| 久久国内精品自在自线图片| 国产成人freesex在线| 国产精品三级大全| 日本三级黄在线观看| 神马国产精品三级电影在线观看| 国产探花在线观看一区二区| 伦精品一区二区三区| 亚洲国产欧洲综合997久久,| 99热这里只有是精品在线观看| 中文亚洲av片在线观看爽| 一夜夜www| 国内精品久久久久精免费| 日韩精品有码人妻一区| 国产中年淑女户外野战色| 亚洲人成网站在线播放欧美日韩| av在线天堂中文字幕| 精品久久久噜噜| 99久久精品热视频| 99久国产av精品| 日韩av不卡免费在线播放| 日韩欧美精品免费久久| 日韩,欧美,国产一区二区三区 | 国产国拍精品亚洲av在线观看| 99久久人妻综合| 国内揄拍国产精品人妻在线| 美女高潮的动态| 国内少妇人妻偷人精品xxx网站| 99riav亚洲国产免费| 欧美激情久久久久久爽电影| a级毛片免费高清观看在线播放| 一本精品99久久精品77| 亚洲精品成人久久久久久| 国产成人aa在线观看| 一级黄色大片毛片| 精品久久久久久久末码| 国产黄片美女视频| 最后的刺客免费高清国语| 在线观看免费视频日本深夜| 亚洲va在线va天堂va国产| 国产极品精品免费视频能看的| 毛片女人毛片| 国产成人精品久久久久久| 亚洲国产精品成人久久小说 | 久久午夜亚洲精品久久| 亚洲第一区二区三区不卡| 日本一二三区视频观看| 欧美最新免费一区二区三区| 国产黄片视频在线免费观看| 欧美日本视频| 国产国拍精品亚洲av在线观看| 国产色爽女视频免费观看| 草草在线视频免费看| 午夜精品国产一区二区电影 | 黄色一级大片看看| 深爱激情五月婷婷| 亚洲av中文字字幕乱码综合| 国产男人的电影天堂91| 国产综合懂色| 国产高清激情床上av| 蜜桃亚洲精品一区二区三区| 亚洲真实伦在线观看| 欧美xxxx性猛交bbbb| 国产女主播在线喷水免费视频网站 | 如何舔出高潮| 只有这里有精品99| 国产美女午夜福利| 12—13女人毛片做爰片一| 国产精华一区二区三区| 久久久久久九九精品二区国产| 国产精品久久视频播放| 国内精品一区二区在线观看| 舔av片在线| 亚洲av中文字字幕乱码综合| 国产高清视频在线观看网站| 高清在线视频一区二区三区 | 国产女主播在线喷水免费视频网站 | 日本三级黄在线观看| 哪个播放器可以免费观看大片| 久久人人爽人人片av| 在线观看av片永久免费下载| 老司机影院成人| 国产午夜福利久久久久久| 男插女下体视频免费在线播放| 欧美日韩综合久久久久久| 精品久久久久久久末码| 看十八女毛片水多多多| 岛国在线免费视频观看| 成人永久免费在线观看视频| or卡值多少钱| 日韩欧美在线乱码| 色综合站精品国产| 看片在线看免费视频| 99在线人妻在线中文字幕| 可以在线观看毛片的网站| 国产成人福利小说| av专区在线播放| 少妇的逼好多水| 欧美最黄视频在线播放免费| 亚洲av成人av| 国产探花在线观看一区二区| 国产男人的电影天堂91| 午夜精品一区二区三区免费看| avwww免费| 高清毛片免费看| 成人国产麻豆网| 亚洲图色成人| 草草在线视频免费看| 亚洲国产精品国产精品| 九九久久精品国产亚洲av麻豆| 高清毛片免费看| 丰满的人妻完整版| 又黄又爽又刺激的免费视频.| 五月玫瑰六月丁香| 大又大粗又爽又黄少妇毛片口| 国产高清视频在线观看网站| 欧美最黄视频在线播放免费| 久久久久久久午夜电影| 久久久欧美国产精品| or卡值多少钱| 国产伦一二天堂av在线观看| 免费看美女性在线毛片视频| 成人高潮视频无遮挡免费网站| 日日摸夜夜添夜夜爱| 伦理电影大哥的女人| 亚洲婷婷狠狠爱综合网| 欧美最新免费一区二区三区| videossex国产| 亚洲国产高清在线一区二区三| 国内精品宾馆在线| 国产爱豆传媒在线观看| 99热6这里只有精品| 91aial.com中文字幕在线观看| 国产一级毛片在线| 久久亚洲精品不卡| 亚洲天堂国产精品一区在线| 免费不卡的大黄色大毛片视频在线观看 | 亚洲色图av天堂| 18禁在线无遮挡免费观看视频| 国产熟女欧美一区二区| 一本一本综合久久| 国产女主播在线喷水免费视频网站 | 国产av麻豆久久久久久久| 日韩强制内射视频| 国产成人freesex在线| 精品久久久久久久末码| 亚洲第一区二区三区不卡| 简卡轻食公司| 2022亚洲国产成人精品| 成人二区视频| 久久婷婷人人爽人人干人人爱| 亚洲天堂国产精品一区在线| 哪里可以看免费的av片| 少妇的逼水好多| 一个人免费在线观看电影| 国产精品.久久久| 美女cb高潮喷水在线观看| 国内少妇人妻偷人精品xxx网站| 久久精品国产亚洲网站| 国产 一区精品| 日本三级黄在线观看|