Improved meet-in-the-middle attack on reduced-round Kiasu-BC algorithm by Manman LI, Shaozhen CHEN

Subjects: Get full text

Application of Evolutionary Algorithms and Statistical Analysis in the Numerical Optimization of an Axial Compressor by Alberto Clarich, Giovanni Mosetti, Valentino Pediroda, Carlo Poloni

“…This analysis has helped us to choose the most appropriate variables and their ranges in order to implement the optimization algorithm more efficiently and rapidly. For the simulation of the fluid flow through the machine, we have used a cluster of 12 processors.…”
Get full text

Localization algorithm based on support vector regression for wirless sensor networks by WEI Ye-hua1, LI Ren-fa2, LUO Juan2, FU Bin2

“…In some incremental localization algorithms, error can be easily accumulated. Some centralized algorithms needs to collect information of the entire network, thus the communication cost is high. …”
Get full text

YOLOGX: an improved forest fire detection algorithm based on YOLOv8 by Caixiong Li, Yue Du, Xing Zhang, Peng Wu

“…To tackle issues, including environmental sensitivity, inadequate fire source recognition, and inefficient feature extraction in existing forest fire detection algorithms, we developed a high-precision algorithm, YOLOGX. …”
Get full text

Design and analysis of active queue management algorithm based on predictive control by WANG Ping, CHEN Hong, LU Xiao-hui

“…Model predictive control as a novel active queue management（AQM） algorithm was proposed for Internet system with large delay,called MPAQM.Considering the causality of time-delay system,the predicted output was defined.Then,the control requirement was converted to the optimal control objective,and the drop probability was obtained by solving the optimal problem.Furthermore,the delay-independent stability condition of closed-loop system was derived,which gave the guidelines how to select the parameters of MPAQM algorithm to assure the stability and fast convergence of the network system.The performances of MPAQM were evaluated through a series of simulations in NS2 under the single/multiple topology.The simulation results show that the queue length with MPAQM algorithm reaches the desired value with minimal tracking error and lower drop probability.MPAQM algorithm outperforms RED,PI and SPI-RED algorithms in terms of disturbance rejection,stability,and robustness.…”
Get full text

Dynamic frame length selection algorithm for slotted access in LTE-Advanced by Hongguang DUAN, Songpin LU, Lifei WANG, Sheng WANG, Tonghui LI, Dan TAN

“…Through analyzing the random access model of slotted access based channel access control protocol (SCACP) in LTE-Advanced system, an optimization algorithm for access frame length selection based on slotted access was proposed. …”
Get full text

Improved F-RRT∗ Algorithm for Flight-Path Optimization in Hazardous Weather by Xue Qiu, Yaohui Li, Rui Jin, Zhi Zhao, Jiajun Li, Donglin Lu, Linhui Ma

“…Then, under the grid environment model, the range of influence, size, and distribution characteristics of the flight-restricted area was examined, and the path optimization model was created according to constraints related to the path distance, corner size, and number of turning points. An improved F-RRT∗ algorithm was developed to solve the model. The algorithm can overcome the problems of traditional path planning algorithms, such as strong randomness, poor guidance, slow convergence speed, unsmooth paths, and poor tracing smoothness. …”
Get full text

Task urgency-based resource allocation algorithm in industrial Internet of things by ZOU Hong, ZHUO Sai, ZHANG Hong, ZHANG Mingxing, WU Dapeng

Subjects: Get full text

Aggregation algorithm for MPLS multicast flows based on bidirectional shared tree by LI Ling-zhi1, ZHU Yan-qin1, YANG Zhe1

“…Scalability is the mainly problem that impedes the extensive deployment of multicast in MPLS networks. An aggregation algorithm for multicast flow based on bidirectional shared tree was proposed in order to resolve the problem. …”
Get full text

Sparse Bayesian learning-based massive multi-user detection algorithm by Pingping CHEN, Xuanda WANG, Zhaopeng XIE, Yi FANG, Jiahui CHEN

“…Aiming at the problem that most existing algorithms were based on the Gaussian inverse gamma prior model (GIG-SBL), which ignored the sparsity of the support set vector within the sparse solution, a sparse Bayesian learning framework based on the Bernoulli Gaussian inverse gamma prior model (BGIG-SBL) was proposed.By introducing a binary vector of Bernoulli prior, the BGIG-SBL-SMV algorithm based on single measurement vector (SMV) was designed, which utilized the sparsity of the support set vector to improve reconstruction performance.Then the proposed algorithm was extended to multiple measurement vector (MMV) models by sharing the same hyperparameters.The BGIG-SBL-MMV algorithm was developed based on the joint sparsity of MMV.The experimental results show that the proposed BGIG-SBL-SMV can achieve a performance gain of 2 dB in mMTC over the traditional GIG-SBL-SMV.Moreover, BGIG-SBL-MMV has a performance gain of 4 dB as compared with its SMV counterparts, which demonstrates the advantages of the proposed schemes.…”
Get full text

Mobility-Assisted on-Demand Routing Algorithm for MANETs in the Presence of Location Errors by Trung Kien Vu, Sungoh Kwon

“…We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. …”
Get full text

Time deterministic network routing algorithm based on stochastic temporal graph by Peng WANG, Xiushe ZHANG, Long SUO, Keyi SHI

“…With respect to the contradiction between the randomness of space-terrestrial integrated network resources and the deterministic requirements of service delay in the network, a stochastic temporal graph model was proposed, based on which a routing algorithm that could guarantee the service delay was constructed.Firstly, how to compute the time-deterministic route over the space information network was modeled as a non-linear programming.To mitigate the problem, a stochastic temporal graph model was proposed, which characterized the stochastic features, caused by the stochastic services of communication links, storage and temporal resources.In addition, the coupling relationship between storage and communication links was also modeled by the graph.Thus, a model was provided by the graph for enhancing the communication link utilization and supporting the time-deterministic routing.Based on this, a routing algorithm fulfilling service delay requirements with the highest probability was proposed with O(n²) polynomial time.The optimality of the algorithm was proved.…”
Get full text

AN IMPROVED ALGORITHM FOR TIME DOMAIN AVERAGING BASED ON FRACTIONAL DELAY FILTERING by ZOU JinChun, QU Lei, DAI GuangHao, WANG XiuFeng, SHEN YuDi

“…For reducing the influence of truncation error on the accuracy of time domain averaging（ TDA） induced by noninteger-period sampling,an improved algorithm of TDA based on fractional delay filtering（ FDF） is presented.On the basis of analyzing the disadvantages of current methods of TDA and the characteristics of FDF,a presently improved method of signal truncation was used in the method to avoid the accumulation of truncation error and obtain a delay factor on each of the truncated signals,the reconstruction and resample for the truncated signals were implemented with FDF,and finally the arithmetic mean were computed after all of the truncated signals were added.The theoretical analysis and experimental results demonstrate that the method which fully makes using of the advantages of FDF on the change of delay factor,apparently reduces the truncation error of signals with non-integer-period sampling,and could obviously improve the accuracy of TDA without key-phase signal.…”
Get full text

Adaptive Spatial Regularization Target Tracking Algorithm Based on Multifeature Fusion by Turdi Tohti, Xifeng Guo, Askar Hamdulla

“…The accuracy and robustness of object-tracking algorithms are challenging tasks in the field of artificial intelligence. …”
Get full text

Malware recognition approach based on self‐similarity and an improved clustering algorithm by Jinfu Chen, Chi Zhang, Saihua Cai, Zufa Zhang, Lu Liu, Longxia Huang

“…Since the traditional K‐means algorithm needs to determine the number of clusters in advance and it is easily affected by the initial cluster centres, we propose an improved K‐means clustering algorithm (NIKClustering algorithm) for cluster analysis. …”
Get full text

ALGORITHM OF PREPARATION OF THE TRAINING SAMPLE USING 3D-FACE MODELING by D. I. Samal, I. I. Frolov

“…The algorithm of preparation and sampling for training of the multiclass qualifier of support vector machines (SVM) is provided. …”
Get full text

Low Complexity, Low Probability Patterns and Consequences for Algorithmic Probability Applications by Mohammad Alaskandarani, Kamaludin Dingle

“…These algorithmic probability predictions do not depend on a detailed knowledge of how output patterns were produced, or historical statistical data. …”
Get full text

Image forgery detection algorithm based on U-shaped detection network by Zhuzhu WANG

“…Aiming at the defects of traditional image tampering detection algorithm relying on single image attribute,low applicability and current high time-complexity detection algorithm based on deep learning,an U-shaped detection network image forgery detection algorithm was proposed.Firstly,the multi-stage feature information in the image by using the continuous convolution layers and the max-pooling layers was extracted by U-shaped detection network,and then the obtained feature information to the resolution of the input image through the upsampling operation was restored.At the same time,in order to ensure higher detection accuracy while extracting high-level semantic information of the image,the output features of each stage in U-shaped detection network would be merged with the corresponding output features through the upsampling layer.Further the hidden feature information between tampered and un-tampered regions in the image upon the characteristics of the general network was explored by U-shaped detection network,which could be realized quickly by using its end-to-end network structure and extracting the attributes of strong correlation information among image contexts that could ensure high-precision detection results.Finally,the conditional random field was used to optimize the output of the U-shaped detection network to obtain a more exact detection results.The experimental results show that the proposed algorithm outperforms those traditional forgery detection algorithms based on single image attribute and the current deep learning-based detection algorithm,and has good robustness.…”
Get full text

Design of an Anti-Windup PID Algorithm for Differential Torque Steering Systems by Dengzhi Peng, Bin Huang, Hao Huang

“…Therefore, a lot of work has been done to investigate the torque allocation algorithm for the mechanical and differential torque integration steering system. …”
Get full text

Influence of shortest path algorithms on energy consumption of multi-core processors by A. A. Prihozhy, O. N. Karasik

Subjects: Get full text