Research on load-balanced construction algorithm of logical carrying network by Hao-xue WANG, Ming JIANG, Ji FU

“…To improve the extensibility of network service,constructing algorithm of logical carrying network was pro-posed by mapping the demands of network service into substrate network.To solve the problem of construction efficiency,on-demand carrying strategy was introduced to provide different resources to meet different service requirements.Based on available resource and current link load,an improved multi-commodity flow model was proposed to compute the re-source allocation.Simulation results indicate this al ithm can improve network service capability from construction success rate and average construction profit.…”
Get full text

Partial blind signature scheme based on SM9 algorithm by Yao LYU, Jinpeng HOU, Chong NIE, Mang SU, Bin WANG, Hongling JIANG

Subjects: “…SM9 algorithm…”
Get full text

Time shift TDT timing acquisition algorithm for PPM-UWB by XIANG Xin1, TIAN Bin1, YI Ke-chu1, LIU Lei1

“…It was proved that the TDT （timing with a dirty template） blind timing algorithm was only suitable for PAM-UWB systems rather than PPM-UWB systems.Furthermore,a TS-TDT （time-shift-TDT） blind timing synchronization algorithm was presented for PPM-UWB,which got synchronizing information from calculating the delay cross-correlation values by means of two correlation branches.Theoretical analysis and simulation results demonstrate that the implementation of the algorithm is of low complexity and flexible in precision control.…”
Get full text

Interior design assistant algorithm based on indoor scene analysis by Lu Zhang

“…The scene analysis algorithm in interior design is widely used in computer vision. …”
Get full text

Privacy preserving algorithm based on trajectory location and shape similarity by Chao WANG, Jing YANG, Jian-pei ZHANG

“…In order to reduce the privacy disclosure risks when trajectory data is released,a variety of trajectories anonymity methods were proposed.However,while calculating similarity of trajectories,the existing methods ignore the impact that the shape factor of trajectory has on similarity of trajectories,and therefore the produced set of trajectory anonymity has a lower utility.To solve this problem,a trajectory similarity measure model was presented,considered not only the time and space elements of the trajectory,but also the shape factor of trajectory.It is computable in polynomial time,and can calculate the distance of trajectories not defined over the same time span.On this basis,a greedy clustering and data mask based trajectory anonymization algorithm was presented,which maximized the trajectory similarity in the clusters,and formed data ＂mask＂ which is formed by fully accurate true original locations information to meet the trajectory k-anonymity.Finally,experimental results on a synthetic data set and a real-life data set were presented; our method offer better utility and cost less time than comparable previous proposals in the literature.…”
Get full text

Research on the Optimization of Agricultural Industry Structure Based on Genetic Algorithm by Lingxiao Liu

“…By examining the water balance of submerged irrigation, an optimization model of the agricultural industry structure was developed using genetic algorithms, and the model was solved using an accelerated genetic algorithm. …”
Get full text

Detection and Estimation of Damage in Structures Using Imperialist Competitive Algorithm by A. Bagheri, H.R. Razeghi, G. Ghodrati Amiri

“…This paper presents a method for detection and estimation of structural damage on the basis of modal parameters of a damaged structure using imperialist competitive algorithm. The imperialist competitive algorithm was developed over the last few years in an attempt to overcome inherent limitations of traditional optimize method. …”
Get full text

Fair Resource Allocation Algorithm for OFDMA System with Imperfect CSI by Yaohui Wu, Youming Li, Liping Jin, Pengfei Shao

“…Existing resource allocation algorithms can't balance system capacity and fairness well when the channel state information is imperfect. …”
Get full text

Evolving multicast tree based artificial fish swarm algorithm by Xuan MA, Qing LIU

Subjects: “…artificial fish swarm algorithm…”
Get full text

Distributed Asynchronous Fusion Algorithm for Sensor Networks with Packet Losses by Tianpeng Chu, Guoqing Qi, Yinya Li, Andong Sheng

“…A distributed asynchronous fusion algorithm is proposed via the covariance intersection method. …”
Get full text

Multi-path backup optimized power algorithm for wideband networks by XU Yu-bin, TAN Wei

“…This algorithm was suitable for structure-changed mobile ad hoc network and power-restricted UWB network. …”
Get full text

Self-Adaptive K-Means Based on a Covering Algorithm by Yiwen Zhang, Yuanyuan Zhou, Xing Guo, Jintao Wu, Qiang He, Xiao Liu, Yun Yang

“…The K-means algorithm is one of the ten classic algorithms in the area of data mining and has been studied by researchers in numerous fields for a long time. …”
Get full text

SVR Prediction Algorithm for Crack Propagation of Aviation Aluminum Alloy by Jincai Chang, Zhihang Wang, Qingyu Zhu, Zhao Wang

“…In this paper, support vector regression (SVR) was used to fit the crack data, and the parameters of SVR are optimized by the grid search algorithm at the same time. And then the model of SVR to predict the crack length was established. …”
Get full text

Fast intra prediction algorithm applied in QS enhancement layer by WANG Da-yong1 SHU Jian2

“…A fast intra coding algorithm was proposed which was suitable for enhancement layer in quality salability.Base on the coding structure of quality scalability,our algorithm used the relationships between layers,the relationships between rate distortion and modes,and temporal and spatial relationships to predict the modes and coding order to be ap-plied,with an early termination determined by the relationships between quantization parameters and modes,residual co-efficients,and rate distortion.The experimental results show that the encoding speed of the proposed algorithm can be improved by 70%,with negligible coding loss.…”
Get full text

Routing lookup algorithm based on parallel BP neural network by Xiao-bo XU, Kang-feng ZHENG, Dan LI, Yi-xian YANG, IUXin-xin N

Subjects: Get full text

Mass public opinion: algorithmic colonisation and synthetisation of the public sphere by Carlos Saura García, Patrici Calvo

“…This paper examines the strategic change in the manipulation of public opinion through algorithmic colonisation, technological imperialism, data generation and the creation of synthetic content. …”
Get full text

Clustering routing protocol based on improved PSO algorithm in WSN by Xiaonian WU, Chuyun ZHANG, Runlian ZHANG, Yaping SUN

Subjects: “…particle swarm optimization algorithm…”
Get full text

Cell Selection Algorithm for Edge Users in Heterogeneous Wireless Network by Zhendong Zhao, Weijiao Niu, Dongsheng Han, Shasha Ding

“…The simulation results show that, compared with the reference algorithms, the proposed algorithm can effectively reduce the load of macrocells, balance the load between different picocells and improve the throughput and resource utilization of the light load picocells.…”
Get full text

Minimum Delay Node Scheduling Algorithm for Wireless Sensor Network by Taoshen Li, Jun Tang, Junbin Liang, Hongxing Lan

“…In order to solve that problem, a new minimum delay scheduling（MDS）algorithm was proposed. Through the analysis and calculation of energy and delay of nodes, this algorithm may calculate the node energy threshold. …”
Get full text

Graph partition based mapping algorithm on multiprocessors for streaming applications by Qi TANG, Shang-feng WU, Jun-wu SHI, Ji-bo WEI

“…To take advantage of multiprocessor platform,it is a necessity to map tasks of the application properly onto different processors to exploit the concurrency in the application and thus meet the stringent timing requirements.Parallelism graph was proposed to quantify and model the concurrency among tasks of the application.An algorithm was also proposed to construct the parallelism graph based on the self-timed schedule and transform the mapping problem to a graph partitioning problem.The graph partitioning problem as a pure 0-1 integer linear programming model was further formulated and the ILP solver to find the optimal result.A lot of randomly generated synchronous dataflow graphs and a set of practical applications were used to evaluate the performance of the proposed method.The experimental results demonstrate that the proposed method outperforms available algorithms.…”
Get full text