|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A Novel Fast Dimension-Reducing Ranked Query Method with High Security for Encrypted Cloud Data显示文摘We propose a novel Fast dimensionreducing ranked query method(FDRQM) with high security for encrypted cloud data.We use Principal component analysis(PCA) algorithm to improve the speed of data encryption and search efficiency. Moreover, a random threshold of accumulated contribution rate of principal components is set to realize the randomness of data dimension reduction and improve data security further. Besides, we introduce a unit matrix before dimension reduction of index, which can not only improve the security of the system, but also ensure the accuracy of query. We demonstrate that our algorithm is more effective and efficient than existing algorithms. | LIU Lianggui LIU Zhengjin | 2020 | Chinese Journal of Electronics2020，29，2： | 2 |
| 2 | Simulated annealing based multi-constrained QoS routing in mobile ad hoc networks显示文摘 | Liu Lianggui Feng Guangzeng | 2007 | Wireless Personal Communications2007，41，3： | 1 |
| 3 | Simulated annealing based multi-constrained QoS muting in mobile ad hoc networks显示文摘 | LIU Lianggui FENG Guangzeng | 2007 | Wireless Personal Communication2007，41，3： | 1 |
| 4 | Method of Time Series Similarity Measurement Based on Dynamic Time Warping显示文摘With the rapid development of mobile communication all over the world,the similarity of mobile phone communication data has received widely attention due to its advantage for the construction of smart cities.Mobile phone communication data can be regarded as a type of time series and dynamic time warping(DTW)and derivative dynamic time warping(DDTW)are usually used to analyze the similarity of these data.However,many traditional methods only calculate the distance between time series while neglecting the shape characteristics of time series.In this paper,a novel hybrid method based on the combination of dynamic time warping and derivative dynamic time warping is proposed.The new method considers not only the distance between time series,but also the shape characteristics of time series.We demonstrated that our method can outperform DTW and DDTW through extensive experiments with respect to cophenetic correlation. | Lianggui Liu Wei Li Huiling Jia | 2018 | Computers, Materials & Continua2018，，10： | 1 |
| 5 | Simulated Annealing Based Multi-constrained QoS Routing in Mobile ad hoc Networks显示文摘 | Lianggui Liu Guangzeng Feng | 2007 | Wireless Personal Communications2007，，： | 1 |
| 6 | Simulated annealing based multiconstrained QoS routing in mobile Ad hoc networks显示文摘 | Liu Lianggui Feng Guangzeng | 2007 | Wireless Personal Communications2007，41，3： | 1 |
| 7 | A novel and effective multi-constrained QoS routing scheme in WMNs显示文摘Multi-constrained quality of service(QoS)routing aims at finding an optimal path that satisfies a set of QoS parameters,as an NP complete problem,which is also a big challenge for wireless mesh networks(WMNs).Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem.However,existing solutions,most of which suffered either from excessive computational complexities or from low performance,were proposed only for wired networks and cannot be used directly in wireless mesh networks.In this paper,we propose a novel routing scheme based on mean field annealing(MFA-RS)to solve this problem.MFA-RS first uses a function of two QoS parameters,wireless link’s delay and transmission success rate as the cost function,and then seeks to find a feasible path by MFA.Because MFA-RS uses a set of deterministic equations to replace the stochastic process in simulated annealing(SA)and uses saddle point approximation in the calculation of the stationary probability distribution at equilibrium,the convergence time is much less than the routing scheme based on SA(SA-RS).Simulation results demonstrate that MFA-RS is an effective algorithm and is very fit for WMNs. | Lianggui LIU Weiqiang XU Huiling JIA Jie WU | 2011 | Frontiers of Electrical and Electronic Engineering in China2011，6，4： | 0 |
| 8 | SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS显示文摘Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The pa- per outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing (QoSR) in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time. | Liu Lianggui Feng Guangzeng | 2006 | Journal of Electronics(China)2006，23，5： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员