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

    A PID-incorporated Latent Factorization of Tensors Approach to Dynamically Weighted Directed Network Analysis

    2022-01-26 00:36:06HaoWuXinLuoMengChuZhouMuhyaddinRawaKhaledSedraouiandAiiadAlbeshri
    IEEE/CAA Journal of Automatica Sinica 2022年3期

    Hao Wu,Xin Luo,,MengChu Zhou,,Muhyaddin J.Rawa,,Khaled Sedraoui,and Aiiad Albeshri

    Abstract—A large-scale dynamically weighted directed network(DWDN) involving numerous entities and massive dynamic interaction is an essential data source in many big-data-related applications,like in a terminal interaction pattern analysis system(TIPAS).It can be represented by a high-dimensional and incomplete (HDI) tensor whose entries are mostly unknown.Yet such an HDI tensor contains a wealth knowledge regarding various desired patterns like potential links in a DWDN.A latent factorization-of-tensors (LFT) model proves to be highly efficient in extracting such knowledge from an HDI tensor,which is commonly achieved via a stochastic gradient descent (SGD)solver.However,an SGD-based LFT model suffers from slow convergence that impairs its efficiency on large-scale DWDNs.To address this issue,this work proposes a proportional-integralderivative (PID)-incorporated LFT model.It constructs an adjusted instance error based on the PID control principle,and then substitutes it into an SGD solver to improve the convergence rate.Empirical studies on two DWDNs generated by a real TIPAS show that compared with state-of-the-art models,the proposed model achieves significant efficiency gain as well as highly competitive prediction accuracy when handling the task of missing link prediction for a given DWDN.

    I.INTRODUCTION

    IN this era of big data,a large-scale dynamically weighted directed network (DWDN) representing dynamic interactions among massive entities is frequently encountered in various big data analysis projects [1]–[5].Its examples include a terminal interaction network [6],[7],a social network [8],[9],and a wireless sensor network [10],[11].However,owing to the huge number of involved entities,it becomes impossible to observe their full interactions,making a corresponding DWDN high-dimensional and incomplete(HDI).For instance,a terminal interaction pattern analysis system (TIPAS) concerned in this study focuses on a largescale terminal interaction network that involves 1 400 742 terminals (e.g.,personal computers,intellectual mobiles and servers) and 77 441 650 directed interactions scattering in 1158 time slots.Its dimensions come to 1 400 742 × 1 400 742 ×1158,while its data density (known data entry count over total) is about 3.41 × 10–8only.Despite its HDI nature,it contains rich knowledge describing various desired patterns like potential links and abnormal terminals [1],[2].Therefore,determining how to acquire such desired knowledge from it becomes a thorny issue.

    To date,researchers have proposed a myriad of data analysis models for extracting useful knowledge from an unweighted network.For example,a static network can be analyzed through a node similarity-based model [12],a metropolis-hasting random walk model [13],a kernel extreme learning machine-based model [14],and a random walk-based deepwalk model [15].When a target network is dynamic,its knowledge acquisition can be implemented through a kernel similarity-based model [16],a Louvain-based dynamic community detection model [17],a spectral graph wavelet model [18],and a dynamic node embedding model [19].The above mentioned models are able to perform knowledge discovery given an unweighted network.However,they are incompatible with DWDN with directed and weighted links.

    On the other hand,an HDI tensor is able to fully preserve a DWDN’s structural,spatial and temporal patterns [20],[21],making it possess inherent advantages in describing DWDN.Therefore,a latent factorization-of-tensors (LFT)-based approach to DWDN representation learning has become popular in recent years [22]–[26].Representative models of this kind include a regularized tensor decomposition model[22],a Candecomp/Parafac (CP) weighted optimization model[23],a biased non-negative LFT model [24],a fused CP factorization model [25],and a non-negative CP factorization model [26].

    When building an LFT-based model,stochastic gradient descent (SGD) is mostly adopted as the learning algorithm to build desired latent features (LFs) [27]–[29].However,an SGD-based LFT model updates an LF depending on the stochastic gradient defined on the instant loss only,without considering historical update information.Consequently,it takes many iterations to convergence,thus resulting in low computational efficiency given large-scale DWDNs from industrial applications [30]–[32].For instance,considering the aforementioned DWDN generated by a real TIAPS,an SGDbased LFT model needs to traverse 77441650 entries in one iteration,which is computationally expensive.

    A proportional-integral-derivative (PID) controller utilizes the past,current and future information of prediction error to control an automated system [33],[34].It has been widely adopted in various control-related applications [35],[36],e.g.,a digital fractional order PID controller for a magnetic levitation system [37],a PID passivity-based controller for the regulation of port-Hamiltonian systems [38],a cascaded PID controller for automatic generation control analysis [39],and a nonlinear self-tuning PID controller for position control of a flexible manipulator [40].However,a PID-based method is rarely adopted in HDI tensor representation,which is frequently encountered in many big data-related applications[31],[32].

    Motivated by the above discovery,the following research question is proposed:

    Research Question:Is it possible to incorporate the PID principle into an SGD-based LFT model,thereby improving its performance on an HDI tensor?

    To answer it,this work innovatively proposes a PIDincorporated LFT (PLFT) model,which seamlessly integrates the PID control principle into an SGD solver.A PLFT model’s main idea is to construct an adjusted instance error by using a PID controller,and then adopt this adjusted error to perform an SGD-based learning process,thereby improving the convergence rate.This work aims to make the following contributions:

    1) A PLFT model.It performs latent feature analysis on an HDI tensor with high efficiency and preciseness;

    2) Detailed algorithm design and analysis for PLFT.It provides specific guidance for researchers to implement PLFT for analyzing DWDNs.

    Empirical studies on two large-scale DWDNs from a real TIPAS demonstrate that compared with state-of-the-art models,PLFT achieves impressively high efficiency as well as highly competitive prediction accuracy for link prediction.

    The remainder of this paper is organized as follows.Section II provides the preliminaries.Section III provides a detailed description of PLFT.Section IV reports experimental results.Section V discusses related work.Finally,Section VI concludes this paper.

    II.PRELIMINARIES

    A.Symbols Appointment

    Adopted symbols in this paper are summarized in Table I.

    TABLE IADOPTED SYMBOLS AND THEIR DESCRIPTIONS

    B.A DWDN and an HDI Tensor

    Fig.1 depicts a small example illustrating the connections between a DWDN and an HDI tensor.Consider the dynamic states of a DWDN during |K| time slots.The net can be described by a snapshot sequence where each one describes its state observed during a specified time slot.

    Definition 1 (DWDN State):Gk= (V,Lk) is thekth state of a DWDN whereLkis the weighted directed link set observed at time slotk∈K= {1,2,...,|K|}.

    An HDI tensor can accurately describe a DWDN [24],[25].Formally,it is defined as follows.

    Definition 2 (HDI Tensor):Given entity setsI,J,andK,letY|I|×|J|×|K|∈ R be a tensor where each entryyijkrepresents certain relationship among entitiesi∈I,j∈Jandk∈K.GivenY’s known and unknown entry sets Λ and Γ,Yis an HDI tensor if |Λ| ? |Γ|.

    Fig.1.A DWDN and an HDI tensor Y.

    To obtain three LF matricesS,DandT,we build an objective functionεto measure the difference betweenYand,which relies on the commonly-used Euclidean distance[21]–[25]

    As shown in Fig.2,Yis an HDI tensor with only a few known entries.Hence,we defineεon Λ only to representY’s known entries precisely [20],[24],[28],[29] to reformulate(3) as

    Fig.2.Latent factorization of an HDI tensor Y.

    According to prior research [24]–[26],due to the imbalanced distribution ofY’s known entries,it is essential to incorporate Tikhonov regularization into (4) to avoid overfitting

    With SGD,the learning scheme for desired LFs is given as

    whereeijk=denotes the instant error onyijk.With (6),an SGD-based LFT model can extract latent patterns form an HDI tensor.For instance,Fig.3 depicts the process of performing missing link prediction forGthrough an LFT model.

    D.A PID Controller

    A PID controller adjusts the observed error based on proportional,integral,and derivative terms [33]–[36].Fig.4 depicts the flowchart of a discrete PID controller.Note that this paper adopts this base controller because it is directly compatible with an SGD-based LFT model’s learning scheme as shown later.As shown in Fig.4,at themth time point,a discrete PID controller builds the adjusted erroras follows:

    whereEmandEiare the observed error at themandith time points,CP,CIandCDare the coefficients for controlling the proportional,integral and derivative effects,respectively.With the adjusted error,the system considers prior errors to implement precise control.Next,we integrate the PID control principle into SGD-based LFT to achieve a PLFT model.

    III.PLFT MODEL

    A.Model

    According to [41]–[43],an LFT model’s stability and representation learning ability can be enhanced by incorporating linear bias (LB) into its learning objective.According to [24],for a three-way HDI tensorY|I|×|J|×|K|,the LBs can be modeled through three LB vectorsa,b,andcwith length |I|,|J|,and |K|.By introducing them into (5),we arrive at the biased learning objective given as

    With (8),consists ofRrank-one tensors {Xr|r∈ {1,…,R}} built on LF matricesS,DandT,and three rank-one bias tensorsH1–H3built on LB matricesA,BandC.The LB vectorsa,bandcare respectively set as the first,second and third columns ofA,BandC,and other columns are set as onevalued column vectors,which is similar to LBs involved in a matrix factorization model [42],[43].This design is shown in Fig.5.

    Fig.3.Missing link prediction by performing LFT on an HDI tensor Y.

    Fig.4.Flow chart of a discrete PID controller.

    As given in (5),with SGD,the instant error of an instanceyijkat thenth training iteration is.Following(7),such instant error can be regarded as a PID controller’s proportional term.Moreover,the information ofyijkis passed into a parameter update througheijkonly in a training iteration.Therefore,this process can be described by a simplified PID controller by settingCP= 1 andCI=CD= 0.

    Fig.5.Building HDI tensor Y’s biased approximation tensor .

    With (10)–(15) a PLFT model is achieved.Its flow is in Fig.6.

    B.Algorithm Design and Analysis

    Based on the above inferences,we design Algorithm PLFT.According to PLFT,the main task in each iteration is to update LF matrices and LB vectors.Hence,its computation cost is

    Note that (16) adopts the condition that |Λ| ? max{|I|,|J|,|K|} which is constantly fulfilled in real applications.SincenandRare positive constants in practice,a PLFT model’s computation cost is linear with an HDI tensor’s known entry count.

    Fig.6.Flowchart of PLFT.

    Its storage cost mainly depends on the following three factors: 1) arrays caching the input known entries Λ and the corresponding estimations; 2) auxiliary arrays caching the integral and derivative terms on each instance; and 3) LF matricesS,DandT,and linear vectorsa,bandc.Hence,the PLFT’s storage cost is given as

    which is linear with the target HDI tensor’s known entry count and its LF count.The next section conducts experiments to validate a PLFT model’s performance.

    IV.EXPERIMENTAL RESULTS AND ANALYSES

    A.General Settings

    Datasets:The experiments are conducted on two large-scale DWDNs labeled asD1 andD2 from a real TIPAS that concerns the dynamic interactions over two million terminals.Table II summarizes their details.On them,we build two different HDI tensors,e.g.,the HDI tensor corresponding toD1 has the size of 1 400 742 × 1 400 742 × 1158 and data density of 8.41 × 10–8only.

    TABLE IIDATASET DETAILS

    To achieve objective results,each dataset is randomly split into the disjoint training setK,validation set Ψ,and testing set Ω at the ratio of 7:1:2.A tested model is built onK,validated on Ψ,and tested on Ω to obtain the final outcomes.The training process of a model terminates if 1) the number of consumed iterations reaches a preset threshold,e.g.,500,or 2)it converges,i.e.,the error difference between two consecutive iterations is less than 10–6.Note that for all involved models,the LF space dimensionRis fixed at 20 uniformly to balance their computational cost and representation learning ability,following the settings in [20]–[25].

    Evaluation Metrics:We choose weighted missing link prediction as the evaluation protocol due to the great need of building full interaction mapping among involved entities in real systems [20]–[25].The root mean squared error (RMSE)and mean absolute error (MAE) are the evaluation metrics

    Note that for a tested model,a small RMSE and MAE denote high prediction accuracy for missing links in a DWDN.

    B.Parameters Sensitivity Test

    As shown in Section III,PLFT’s performance is affected by learning rateη,regularization coefficientλ,and PID constantsCP,CI,andCD.Thus,we start with parameter sensitivity tests.

    1) Effects of η and λ

    Fig.7.Impacts of η and λ.

    This set of experiments fixes the PID coefficients and makesηincrease from 0.001 to 0.006 andλfrom 0.05 to 0.25.Figs.7(a) and 7(c) records PLFT’s RMSE and MAE asηand λ changes.Figs.7(b) and 7(d) depicts the corresponding iteration count.From these results,we have the following findings:

    a) PLFT’s convergence is related with η and λ:As shown in Figs.7(b) and 7(d),the converging iteration counts of PLFT in RMSE and MAE decrease asηincreases while they increase asλincreases onD1 andD2.For instance,as shown in Fig.7(b),asηincreases from 0.001 to 0.006 onD2,the converging iteration count of PLFT decreases from 21 to 5 in RMSE,and from 20 to 5 in MAE,respectively.This results is consistent with the role ofηin PLFT,i.e.,the larger the learning rate,the faster the parameter update velocity,resulting in fewer iterations for convergence.However,we also note that owing to its incorporation of PID,PLFT’s convergence rate stays consistently high even if the learning rate is set to be small.On the other hand,as shown in Fig.7(d),PLFT’s converging iteration count is generally linear withλ.For instance,asλincreases from 0.05 to 0.25 onD2,its converging iteration count increases from 21 to 24 in RMSE,and from 20 to 26 in MAE.This is because whenλgrows larger,the parameter update process requires more fitting regularization term,which leads to more iterations.

    b) PLFT’s prediction error increases as η and λ increase:For instance,as depicted in Fig.7(a),PLFT’s RMSE is 0.2954 and 0.3004 asη= 0.001 and 0.006 onD1,where the increment ((RMSEhigh–RMSElow)/RMSEhigh) is 1.66%.This result indicates that sinceηgrows larger,the parameter update process overshoots an optimum.As shown in Fig.7(c),PLFT’s RMSE is 0.2954 and 0.2961 asλincreases from 0.05 to 0.25 onD1,where the increment is 0.24%.This phenomenon demonstrates the occurrence of underfitting asλincreases continually.Note that similar situations are seen onD2,as shown in Figs.7(a) and 7(c).In general,the PLFT’s prediction error increases more rapidly inηthan inλ.

    2) Effects of CP,CI,andCD

    This set of experiments fixesηandλ,and makes the PID coefficients increase to test their effects on PLFT’s performance.The experimental results are illustrated in Fig.8.From them,we have the following findings:

    a) PLFT’s converging iteration count relies on CP,CI,and CD:As shown in Figs.8(b) and 8(d),PLFT’s converging iteration count in RMSE and MAE decreases asCPandCIincrease.However,it increases asCDincreases as shown in Fig.8(f).For instance,as shown in Fig.8(b),onD1,PLFT’s converging iteration count in RMSE is 57 withCP= 1.WhenCPincreases to 5,it decreases to 23.Likewise,asCIincreases from 0.01 to 0.09,it decreases from 34 to 15.In contrast,PLFT’s converging iteration count in RMSE increases from 24 to 43 asCDincreases from 10 to 90.Similar phenomena are encountered onD2 as shown in Figs.8(b),8(d) and 8(f).

    b) CP and CI affect PLFT’s prediction error slightly:As shown in Fig.8(a) and 8(c),onD1 andD2,PLFT’s RMSE and MAE increase slightly withCPandCI,while they are generally steady asCDincreases.For instance,onD1,as shown in Fig.8(a),PLFT’s MAE increases from 0.2180 to 0.2196 asCPincreases from 1 to 5,where the increment is 0.73%.According to Fig.8(c),PLFT’s MAE is 0.2184 withCI= 0.01 and 0.2193 withCI= 0.09,where the increment is 0.42%.In comparison,as shown in Fig.8(e),whenCDincreases from 10 to 90,the difference in PLFT’s MAE is 0.0002 only.Similar results are obtained onD2,as shown in Figs.8(a),8(c) and 8(e).

    Fig.8.Impacts of CP,CI and CD.

    Note that the above results are consistent with the theoretical analysis in Section III-A.CPcontrols the proportional term,and actually plays the role of the learning rate in the current update.CIcontrols the adjustment of a learning direction.Accordingly,a largerCIhas a stronger restriction on the oscillation of a parameter update process,which can make PLFT converge faster but also cause slight accuracy loss.CDcontrols the future expectations of a parameter update process.CDin an appropriate range can effectively avoid overshooting.Moreover,a relatively smallCDcan make PLFT converge faster to an optimum.

    3) Summary

    Based on the above results,we summarize that PLFT’s convergence rate is sensitive in its hyper-parameters,while its prediction accuracy is less sensitive in them.However,to further increase a PLFT model’s practicability in addressing DWDN analysis problems,a hyper-parameter self-adaptive scheme is desired.We plan to address it as a future issue.

    C.Comparison With State-of-the-art Models

    Three state-of-the-art models with the ability of analyzing an HDI tensor are compared with the proposed model.Their details are as follows:

    a) M1:A time-SVD++ model [44].It models the temporal effects into the objective function of a latent factor model such that the model can well represent an HDI tensor.

    TABLE IIIHYPER-PARAMETERS SETTINGS OF M1-M4

    Fig.9.Training curves of M1–M4 on D1 and D2.

    b) M2:A PARAFAC decomposition-based model [45].It builds anl1norm-based regularization scheme,and adopts nonnegative alternating least squares as its learning scheme.

    c) M3:An SGD-based LFT model [29].It adopts a standard SGD to perform parameters learning.

    d) M4:A PLFT model proposed in this paper.

    Note that hyper-parameter settings of M1–M4 are given in Table III.Considering M1–M4,we perform a grid search for their related hyper-parameters on one set of experiments out of 20 independent runs in total to achieve their best performance,and then adopt the same settings on the remaining 19 sets of experiments.

    Fig.9 depicts M1–M4’ training curves.Fig.10 records their total time costs.Fig.11 depicts their RMSE and MAE.From these results,we have the following important findings:

    a) M4 converges much faster than its peers do:As shown in Fig.9(a),M4 takes 23 iterations only to converge in RMSE on D1.In comparison,M1–M3 takes 64,26 and 67 iterations to converge in RMSE onD1,respectively.Considering MAE,as shown in Fig.9(b),M1–M3 respectively requires 68,26 and 60 iterations to converge onD1,while M4 only consumes 21 iterations.Similar phenomena can be found onD2,as depicted in Figs.9(c) and 9(d).From these results,we can obviously see that by incorporating a PID control principle,PLFT’s convergence rate is improved significantly over an SGD-LFT model.It turns out that incorporating the PID control principle into an SGD-based LFT model is feasible and highly effective.

    b) M4 achieves higher computational efficiency than its peers do:For instance,as shown in 10(a),onD1,M4 takes about 10 min to converge in RMSE,which is 8.13% of 123 min by M1,7.63% of 131 min by M2,and 40% of 25 min by M3.Considering MAE,M1 takes about 9 min to converge,which is 6.87% of 131 min by M1,6.62% of 136 min by M2,and 40.90% of 22 min by M3.Similar outputs are obtained onD2,as in Fig.10(b).As summarized in Algorithm 1,the computation cost of a PLFT model mainly relies on an HDI tensor’s known entry set.From the above experimental results,we evidently see that such design is extremely suitable and necessary when analyzing a large-scale HDI DWDN.

    Fig.10.Total time cost (min) of M1–M4 on D1 and D2.

    Fig.11.The RMSE and MAE of M1–M4 on D1 and D2.

    c) M4 has highly competitive prediction accuracy for missing data of an HDI tensor when compared with its peers:As depicted in Fig.11(a),onD1,M4’s RMSE is 0.2954,which is about 14.10% lower than the 0.3439 RMSE obtained by M1 and 4.15% lower than the 0.3082 RMSE obtained by M2,but 0.14% higher than the 0.2950 RMSE obtained by M3.Likewise,onD2,M1–M4 respectively achieve RMSEs of 0.3645,0.3223,0.3096 and 0.3103,where the RMSE of M4 is 14.87% and 3.72% lower than that of M1 and M2 while 0.23% higher than that of M3.When measured by MAE,similar results are achieved on both datasets,as shown in Fig.11(b).Note that M4 suffers from a small accuracy loss when compared with M3.Yet its computational efficiency is much higher than that of M3.This phenomenon indicates the performance of a PLFT model can still be further improved by incorporating another advanced controller,e.g.,a nonlinear PID controller.We plan to address this issue in the next work.

    D.Summary

    According to the experimental results,we conclude that PLFT is equipped with: a) a high convergence rate,b)impressively high computational efficiency,and c) highly competitive prediction accuracy.Therefore,PLFT is a highly effective model to large-scale DWDNs analysis.

    V.RELATED WORK

    A network has become increasingly important to model a complex system consisting of numerous entities and interactions.Network data analysis is widely involved in many fields,where missing link prediction is one of the essential and vital tasks in network analysis [1]–[5].To date,many sophisticated models to missing link prediction in a given network are proposed.They can be roughly divided into the following three categories:

    1)LF Analysis-based Models

    Duanet al.[46] propose an ensemble approach,which decomposes traditional link prediction into sub-problems of smaller size and each sub-problem is solved with LF analysis models.Nguyenet al.[47] utilize LF kernels and cast the link prediction problem into a binary classification to implement link prediction on sparse graphs.Zhuet al.[48] propose a temporal latent space model for dynamic link prediction,where the dynamic link over time is predicted by a sequence of previous graph snapshots.Yeet al.[49] use nonnegative matrix tri-factorization to construct network latent topological features,which acquires the principal common factors of the network link structures.Wanget al.[50] present a fusion model to fuse an adjacent matrix and key topological metrics into a unified probability LF analysis-based model for link prediction,which considers both the symmetric and asymmetric metrics.

    2)Neural Networks-based Models

    Wanget al.[51] design a Bayesian-based relational network model that combines network structures and node attributes to predict missing links.Chenet al.[52] propose a dynamic link prediction model by combining long short-term memory and encoder-decoder mechanisms.Liet al.[53] develop a temporal-restricted Boltzmann machine-based deep network,which predicts missing links by utilizing individual transition variances and influence of local neighbors.Ozcanet al.[54]propose a multivariate link prediction model for evolving heterogeneous networks via a nonlinear autoregressive neural network.Liet al.[55] model the evolution pattern of each link in a network by incorporating a gradient boosting decision tree and temporal restricted Boltzmann machine.

    3)Network Analysis-based Models

    Groveret al.[56] map involved nodes into low-dimensional feature space and adopts a biased random walk method to implement link prediction.Fuet al.[57] utilize line graph indices along with original graph indices to implement link weight prediction.Wanget al.[58] develop a cold-start link prediction approach by establishing the connections between topological and non-topological information.Xiaet al.[59]design a model based on a random walk with restart,which can determine potential collaborators in academic social networks.Deet al.[60] design a novel framework by using a stacked two-level learning paradigm for link prediction,which integrates local,community,and global signals.

    The above mentioned approaches can efficiently perform missing link prediction on a specified network.However,they all fail to address DWDN with directed and weighted missing links.Moreover,they commonly suffer from high computational cost due to their model structure or learning scheme.In comparison,the proposed PLFT model describe a DWDN via an HDI tensor smoothly,and achieves high efficiency via incorporating the PID principle into its learning scheme.

    VI.CONCLUSIONS

    In order to improve an SGD-based LFT model’s efficiency,this work proposes a PLFT model that combines the information of past,current and future updates into its parameters update following the PID control principle,which is never seen in existing studies to our best knowledge.It exhibits a higher convergence rate and greater computational efficiency than state-of-the-art methods,and very competitive accuracy in missing link prediction in comparison with them.Hence,it provides highly effective solutions for large-scale DWDN analysis.However,the following issues remain open:

    1) The performance of a PLFT model is affected by its hyper-parameters.Thus,making them adaptable to various applications is of great importance [61],[62].

    2) A nonlinear PID [40],[63] has shown excellent performance in real applications.Thus,we may consider further performance gain by incorporating its principle into an SGD-based LFT model.

    3) Determining how to further improve PLFT’s computational efficiency via a parallel computation framework [64]–[65],and apply PLFT to other datasets [66]–[69].We plan to address them as our future work.

    欧美精品国产亚洲| 久久精品国产自在天天线| 国产女主播在线喷水免费视频网站| 91久久精品电影网| xxx大片免费视频| 热re99久久国产66热| 在线免费观看不下载黄p国产| 亚洲不卡免费看| 久久毛片免费看一区二区三区| 99视频精品全部免费 在线| 18在线观看网站| 国产国拍精品亚洲av在线观看| 卡戴珊不雅视频在线播放| 日本黄色片子视频| kizo精华| freevideosex欧美| 丰满乱子伦码专区| a 毛片基地| 一级爰片在线观看| 美女脱内裤让男人舔精品视频| 日产精品乱码卡一卡2卡三| 国产成人91sexporn| 久久精品久久精品一区二区三区| 国产无遮挡羞羞视频在线观看| 国产一区有黄有色的免费视频| 久久精品国产亚洲av涩爱| 亚洲精品日韩在线中文字幕| 久久影院123| 美女国产高潮福利片在线看| 国产色爽女视频免费观看| 人妻一区二区av| 美女大奶头黄色视频| 黑人高潮一二区| 亚洲国产最新在线播放| 免费黄频网站在线观看国产| 欧美xxⅹ黑人| 国产男女内射视频| 少妇熟女欧美另类| 在线精品无人区一区二区三| 国产一区二区三区av在线| 中文字幕最新亚洲高清| 亚洲五月色婷婷综合| 亚洲精品久久成人aⅴ小说 | 免费高清在线观看视频在线观看| 丰满乱子伦码专区| 亚洲欧美中文字幕日韩二区| h视频一区二区三区| 国产免费福利视频在线观看| 中文精品一卡2卡3卡4更新| 亚洲精品国产av成人精品| 97在线人人人人妻| 日本-黄色视频高清免费观看| 日韩不卡一区二区三区视频在线| 一区二区三区四区激情视频| 国产深夜福利视频在线观看| 精品国产露脸久久av麻豆| 亚洲国产av影院在线观看| 国产成人免费无遮挡视频| 飞空精品影院首页| 女性生殖器流出的白浆| 日韩大片免费观看网站| a级毛片黄视频| 欧美一级a爱片免费观看看| 亚洲经典国产精华液单| 国产伦精品一区二区三区视频9| 黄色怎么调成土黄色| 另类精品久久| 大陆偷拍与自拍| 日本vs欧美在线观看视频| 精品少妇内射三级| av在线app专区| 最近中文字幕2019免费版| 国产伦精品一区二区三区视频9| 啦啦啦视频在线资源免费观看| 啦啦啦啦在线视频资源| 人妻制服诱惑在线中文字幕| 久久久久精品久久久久真实原创| av卡一久久| 亚洲不卡免费看| 五月开心婷婷网| 国产极品粉嫩免费观看在线 | 欧美丝袜亚洲另类| 国语对白做爰xxxⅹ性视频网站| 中文精品一卡2卡3卡4更新| 久久久久久伊人网av| 欧美亚洲 丝袜 人妻 在线| 国产精品成人在线| 桃花免费在线播放| 多毛熟女@视频| 久久ye,这里只有精品| 国产高清有码在线观看视频| 久久国产亚洲av麻豆专区| 亚洲成人手机| 一本一本综合久久| 欧美 日韩 精品 国产| 天天影视国产精品| kizo精华| 亚洲成色77777| 免费高清在线观看日韩| 国产免费福利视频在线观看| 国产精品国产三级专区第一集| av在线观看视频网站免费| 汤姆久久久久久久影院中文字幕| 五月伊人婷婷丁香| 精品久久久久久久久亚洲| 国产极品粉嫩免费观看在线 | 国产伦精品一区二区三区视频9| 日本vs欧美在线观看视频| 色吧在线观看| 日韩大片免费观看网站| 高清av免费在线| 亚洲欧洲精品一区二区精品久久久 | 国产日韩欧美亚洲二区| 久热这里只有精品99| 亚洲成人av在线免费| 男女啪啪激烈高潮av片| 夜夜看夜夜爽夜夜摸| 伊人亚洲综合成人网| 九九久久精品国产亚洲av麻豆| 国产精品三级大全| 18禁在线播放成人免费| 亚洲精品av麻豆狂野| 五月天丁香电影| 韩国高清视频一区二区三区| 中文字幕制服av| 亚洲精品一区蜜桃| 亚洲第一av免费看| 国产伦理片在线播放av一区| 女人久久www免费人成看片| 久久精品人人爽人人爽视色| 国产高清不卡午夜福利| 肉色欧美久久久久久久蜜桃| 91aial.com中文字幕在线观看| 18禁裸乳无遮挡动漫免费视频| 天美传媒精品一区二区| 欧美丝袜亚洲另类| 少妇被粗大的猛进出69影院 | 99热这里只有精品一区| 国产白丝娇喘喷水9色精品| 亚洲伊人久久精品综合| 少妇人妻精品综合一区二区| 99国产精品免费福利视频| 日韩伦理黄色片| 亚洲国产最新在线播放| 色5月婷婷丁香| 亚洲色图 男人天堂 中文字幕 | 日韩免费高清中文字幕av| 亚洲欧美色中文字幕在线| 久久久久久久久久久久大奶| 国产精品久久久久久av不卡| 美女中出高潮动态图| 婷婷色麻豆天堂久久| 国产黄片视频在线免费观看| 日韩视频在线欧美| 一区在线观看完整版| 一区二区三区乱码不卡18| 美女中出高潮动态图| 91国产中文字幕| 少妇猛男粗大的猛烈进出视频| 亚洲图色成人| 亚洲激情五月婷婷啪啪| 好男人视频免费观看在线| 欧美97在线视频| freevideosex欧美| 久久韩国三级中文字幕| 在线观看免费视频网站a站| 亚洲精品,欧美精品| 精品卡一卡二卡四卡免费| 大又大粗又爽又黄少妇毛片口| 视频在线观看一区二区三区| 国模一区二区三区四区视频| 久久国产精品男人的天堂亚洲 | 亚洲av电影在线观看一区二区三区| 啦啦啦啦在线视频资源| 欧美三级亚洲精品| 日日爽夜夜爽网站| 久久毛片免费看一区二区三区| 国产精品无大码| 中文字幕av电影在线播放| 丝袜喷水一区| 国产 一区精品| 毛片一级片免费看久久久久| 免费人成在线观看视频色| 视频在线观看一区二区三区| 国产亚洲精品久久久com| 久热这里只有精品99| 国产一区二区在线观看日韩| 春色校园在线视频观看| 色5月婷婷丁香| 日韩不卡一区二区三区视频在线| 女性被躁到高潮视频| 人妻一区二区av| 99久久中文字幕三级久久日本| 曰老女人黄片| 亚洲久久久国产精品| 亚洲av.av天堂| 曰老女人黄片| 插逼视频在线观看| 男女无遮挡免费网站观看| 亚洲一区二区三区欧美精品| av电影中文网址| 日韩成人伦理影院| 自拍欧美九色日韩亚洲蝌蚪91| 亚洲精品第二区| .国产精品久久| 亚洲综合色网址| 亚洲国产欧美日韩在线播放| 亚洲欧美精品自产自拍| 亚洲内射少妇av| 热re99久久精品国产66热6| 国产有黄有色有爽视频| 国产高清有码在线观看视频| 精品亚洲成a人片在线观看| 男女啪啪激烈高潮av片| 精品久久久精品久久久| 国产成人午夜福利电影在线观看| 久久99蜜桃精品久久| 久久久久久久精品精品| 亚洲av成人精品一区久久| 中文欧美无线码| 插阴视频在线观看视频| 亚洲精品美女久久av网站| 日韩不卡一区二区三区视频在线| 亚洲五月色婷婷综合| 夫妻性生交免费视频一级片| 久久人人爽av亚洲精品天堂| 精品亚洲成a人片在线观看| 大香蕉久久成人网| 国产 精品1| 性高湖久久久久久久久免费观看| 国产亚洲午夜精品一区二区久久| 高清毛片免费看| 国产永久视频网站| 国产在视频线精品| 国产在线视频一区二区| 久久久精品94久久精品| 免费少妇av软件| 国产熟女午夜一区二区三区 | 国产黄色免费在线视频| 18禁在线无遮挡免费观看视频| 老女人水多毛片| 成人亚洲欧美一区二区av| 成人手机av| tube8黄色片| 九色成人免费人妻av| 多毛熟女@视频| 狂野欧美激情性bbbbbb| 欧美日韩精品成人综合77777| av播播在线观看一区| 午夜免费鲁丝| 中文字幕制服av| 免费高清在线观看日韩| 日韩不卡一区二区三区视频在线| 一级a做视频免费观看| 水蜜桃什么品种好| 国产高清三级在线| av视频免费观看在线观看| 精品国产一区二区三区久久久樱花| 日本午夜av视频| 日日摸夜夜添夜夜爱| 欧美成人精品欧美一级黄| 国产精品.久久久| 成人国产麻豆网| 99久久综合免费| 欧美3d第一页| 一级毛片我不卡| 精品国产国语对白av| 一区二区日韩欧美中文字幕 | 国产精品熟女久久久久浪| 另类亚洲欧美激情| 国产午夜精品久久久久久一区二区三区| 2018国产大陆天天弄谢| 中文乱码字字幕精品一区二区三区| 在线观看一区二区三区激情| a级毛片在线看网站| 一区二区三区四区激情视频| 久久久a久久爽久久v久久| 亚洲av国产av综合av卡| 18禁在线无遮挡免费观看视频| 免费黄网站久久成人精品| 精品国产露脸久久av麻豆| 一级毛片 在线播放| 热99国产精品久久久久久7| 久热这里只有精品99| 街头女战士在线观看网站| 9色porny在线观看| 91精品国产九色| 成年人免费黄色播放视频| 精品久久久久久电影网| 一本大道久久a久久精品| 亚洲精品久久成人aⅴ小说 | 婷婷色综合大香蕉| xxxhd国产人妻xxx| 午夜精品国产一区二区电影| 最近中文字幕2019免费版| 一级片'在线观看视频| 国产乱来视频区| 国产欧美亚洲国产| 成人国语在线视频| 在现免费观看毛片| 国产色爽女视频免费观看| 免费观看在线日韩| 成人国语在线视频| 水蜜桃什么品种好| 在线精品无人区一区二区三| 十分钟在线观看高清视频www| 亚洲精品国产av成人精品| 国产一区有黄有色的免费视频| 黄片无遮挡物在线观看| 亚洲五月色婷婷综合| 天天操日日干夜夜撸| 美女内射精品一级片tv| 国产成人精品在线电影| 久久久久久久精品精品| 国产成人一区二区在线| 在线观看三级黄色| 伊人久久国产一区二区| 日韩制服骚丝袜av| 国产精品久久久久久久久免| 欧美日韩成人在线一区二区| 青春草国产在线视频| 男女啪啪激烈高潮av片| 亚洲精品国产av成人精品| 亚洲经典国产精华液单| 精品少妇久久久久久888优播| tube8黄色片| 少妇人妻久久综合中文| 自线自在国产av| 亚洲美女黄色视频免费看| 亚洲五月色婷婷综合| 欧美精品人与动牲交sv欧美| 老司机影院成人| 九九在线视频观看精品| 国产成人a∨麻豆精品| 亚洲久久久国产精品| 青春草亚洲视频在线观看| 久热这里只有精品99| 一级片'在线观看视频| 免费少妇av软件| 一本—道久久a久久精品蜜桃钙片| 日日啪夜夜爽| 搡女人真爽免费视频火全软件| 99热全是精品| 2022亚洲国产成人精品| 久久精品国产亚洲网站| 两个人的视频大全免费| 国产 精品1| 高清黄色对白视频在线免费看| 黄片播放在线免费| 欧美+日韩+精品| 国产亚洲午夜精品一区二区久久| 大又大粗又爽又黄少妇毛片口| 日本vs欧美在线观看视频| 久久精品国产亚洲av天美| 久久99蜜桃精品久久| 青春草国产在线视频| 亚洲精品久久久久久婷婷小说| 婷婷色综合www| 99精国产麻豆久久婷婷| 国产成人a∨麻豆精品| av有码第一页| 免费观看无遮挡的男女| 精品酒店卫生间| 亚洲色图综合在线观看| 久久久国产精品麻豆| 亚洲欧美日韩卡通动漫| 亚洲国产日韩一区二区| 一区二区三区四区激情视频| 国产欧美亚洲国产| 精品卡一卡二卡四卡免费| 久久久国产精品麻豆| 久久韩国三级中文字幕| 人体艺术视频欧美日本| 热99国产精品久久久久久7| 亚洲欧美一区二区三区黑人 | 我的女老师完整版在线观看| 久久久久久久国产电影| 精品久久久久久电影网| videos熟女内射| 99久久中文字幕三级久久日本| 丝瓜视频免费看黄片| 日韩不卡一区二区三区视频在线| 亚洲不卡免费看| 最黄视频免费看| 三上悠亚av全集在线观看| 国产极品粉嫩免费观看在线 | 视频在线观看一区二区三区| 建设人人有责人人尽责人人享有的| 日韩av不卡免费在线播放| a级毛片黄视频| 国产永久视频网站| 国产乱来视频区| 成人手机av| 欧美 日韩 精品 国产| 少妇被粗大猛烈的视频| 成年av动漫网址| 视频区图区小说| 久久久久久久久久久丰满| 久久久久久伊人网av| 亚洲精品一区蜜桃| 在线观看三级黄色| 另类亚洲欧美激情| 精品少妇久久久久久888优播| 亚洲在久久综合| 天美传媒精品一区二区| 久久鲁丝午夜福利片| 久久 成人 亚洲| 黑丝袜美女国产一区| 一本大道久久a久久精品| 寂寞人妻少妇视频99o| 亚洲国产精品成人久久小说| 国产极品天堂在线| 蜜桃国产av成人99| 亚洲美女视频黄频| 精品亚洲成国产av| 国产精品三级大全| 18+在线观看网站| 久久久精品94久久精品| 日日摸夜夜添夜夜添av毛片| 天堂8中文在线网| 十八禁网站网址无遮挡| 一区二区三区免费毛片| 夜夜看夜夜爽夜夜摸| 日韩亚洲欧美综合| 国产精品 国内视频| 国产精品国产三级国产专区5o| 免费人妻精品一区二区三区视频| 啦啦啦啦在线视频资源| 观看av在线不卡| 亚洲精品乱码久久久v下载方式| av福利片在线| 亚洲av在线观看美女高潮| 亚洲av.av天堂| 日本91视频免费播放| 国产成人精品婷婷| 午夜免费观看性视频| 91久久精品国产一区二区三区| 午夜视频国产福利| 狂野欧美激情性xxxx在线观看| 在线播放无遮挡| 黑人欧美特级aaaaaa片| 亚洲av二区三区四区| 午夜老司机福利剧场| 免费观看在线日韩| a 毛片基地| 免费人妻精品一区二区三区视频| 国产无遮挡羞羞视频在线观看| 亚洲熟女精品中文字幕| 97在线人人人人妻| 一级a做视频免费观看| 色5月婷婷丁香| 校园人妻丝袜中文字幕| videosex国产| 男人爽女人下面视频在线观看| 22中文网久久字幕| 天堂俺去俺来也www色官网| 亚洲天堂av无毛| 亚洲国产精品国产精品| 国产男女内射视频| 高清视频免费观看一区二区| 午夜福利视频精品| 三级国产精品欧美在线观看| 国产亚洲精品第一综合不卡 | 美女福利国产在线| 精品熟女少妇av免费看| 久久精品夜色国产| 少妇被粗大猛烈的视频| 精品人妻一区二区三区麻豆| 国产国拍精品亚洲av在线观看| 两个人免费观看高清视频| 人人澡人人妻人| 久久久久久久久久久免费av| 日本欧美国产在线视频| 一级,二级,三级黄色视频| 国产无遮挡羞羞视频在线观看| 少妇丰满av| av线在线观看网站| 777米奇影视久久| a级片在线免费高清观看视频| 18禁在线播放成人免费| 亚洲中文av在线| 日韩亚洲欧美综合| 这个男人来自地球电影免费观看 | 亚洲天堂av无毛| 亚洲少妇的诱惑av| av一本久久久久| 人妻制服诱惑在线中文字幕| 性色avwww在线观看| 三级国产精品欧美在线观看| 亚洲欧美一区二区三区国产| 看非洲黑人一级黄片| 中文字幕人妻熟人妻熟丝袜美| 国产男人的电影天堂91| 在线观看免费视频网站a站| 午夜免费鲁丝| 欧美三级亚洲精品| 在线观看www视频免费| www.色视频.com| 久久久久久久亚洲中文字幕| 免费av中文字幕在线| 日韩,欧美,国产一区二区三区| 王馨瑶露胸无遮挡在线观看| 日韩av不卡免费在线播放| 18禁动态无遮挡网站| 国产欧美另类精品又又久久亚洲欧美| 精品人妻在线不人妻| 日日爽夜夜爽网站| 在线看a的网站| 免费看av在线观看网站| 亚洲综合色惰| 久久这里有精品视频免费| 91在线精品国自产拍蜜月| 99视频精品全部免费 在线| a级毛片黄视频| 一区在线观看完整版| 亚洲av成人精品一区久久| 丰满迷人的少妇在线观看| 国产男女超爽视频在线观看| 午夜激情av网站| 欧美bdsm另类| 国产日韩欧美在线精品| 亚洲情色 制服丝袜| 熟女电影av网| 丰满饥渴人妻一区二区三| 女人精品久久久久毛片| 熟女av电影| 午夜老司机福利剧场| 日韩人妻高清精品专区| 国产精品蜜桃在线观看| 精品午夜福利在线看| 欧美老熟妇乱子伦牲交| 人妻人人澡人人爽人人| 免费人妻精品一区二区三区视频| 狠狠精品人妻久久久久久综合| 七月丁香在线播放| 尾随美女入室| 国模一区二区三区四区视频| 人人妻人人爽人人添夜夜欢视频| 久久国产亚洲av麻豆专区| 亚洲av欧美aⅴ国产| 婷婷成人精品国产| 亚洲综合色网址| 国产探花极品一区二区| 日韩免费高清中文字幕av| 亚洲精品,欧美精品| 国产色爽女视频免费观看| 国产亚洲最大av| 国产男女超爽视频在线观看| 国产日韩欧美视频二区| 最近最新中文字幕免费大全7| 亚洲人成网站在线观看播放| 欧美日韩国产mv在线观看视频| 22中文网久久字幕| 飞空精品影院首页| 有码 亚洲区| 日本黄色日本黄色录像| 下体分泌物呈黄色| 一区二区av电影网| 日韩在线高清观看一区二区三区| 一区二区三区免费毛片| 男女边摸边吃奶| 日日啪夜夜爽| 人人澡人人妻人| 男女免费视频国产| 丝袜在线中文字幕| 自拍欧美九色日韩亚洲蝌蚪91| 高清视频免费观看一区二区| 免费日韩欧美在线观看| 日韩伦理黄色片| 人妻 亚洲 视频| 一级毛片我不卡| 欧美日韩在线观看h| 亚洲欧美色中文字幕在线| 久久青草综合色| 国产成人精品无人区| 三上悠亚av全集在线观看| 黑人猛操日本美女一级片| 久久国产精品大桥未久av| 日韩一区二区三区影片| 黑人高潮一二区| 看免费成人av毛片| 美女国产高潮福利片在线看| 亚洲美女视频黄频| 欧美激情 高清一区二区三区| 欧美日韩国产mv在线观看视频| 亚洲av中文av极速乱| 少妇精品久久久久久久| 亚洲,一卡二卡三卡| 伊人亚洲综合成人网| 精品人妻一区二区三区麻豆| 人人澡人人妻人| 男女免费视频国产| 蜜桃久久精品国产亚洲av| av天堂久久9| 寂寞人妻少妇视频99o| 99热这里只有精品一区| 男女高潮啪啪啪动态图| 你懂的网址亚洲精品在线观看| 一级黄片播放器| 色婷婷av一区二区三区视频| 亚洲欧美成人精品一区二区| 色婷婷久久久亚洲欧美| 人人妻人人澡人人看| 色5月婷婷丁香| 欧美 亚洲 国产 日韩一| 99热国产这里只有精品6| 熟女av电影| a级毛片黄视频| 亚洲av.av天堂| 高清视频免费观看一区二区| 男人爽女人下面视频在线观看| 又大又黄又爽视频免费| 亚洲国产精品999| 久久久久精品性色| 99热网站在线观看|