Showing 15,681 - 15,700 results of 19,511 for search '"algorithms"', query time: 0.12s Refine Results
  1. 15681

    Trust management scheme for driver-vehicle separation on dual-layer blockchain by ZHANG Haibo, HUANG Honglong, LI Fangwei, XU Yongjun

    Published 2024-11-01
    “…Additionally, the adaptive size-practical Byzantine fault tolerance (AS-PBFT) consensus algorithm was designed to optimize the consensus scale and reduce consensus time. …”
    Get full text
    Article
  2. 15682

    Numerical Simulation Method Study of Rock Fracture Based on Strain Energy Density Theory by Shuchen Li, Luchen Zhang, Qian Sun, Ma Tengfei

    Published 2018-12-01
    “…The rock fracture calculation program on the basis of the preceding algorithm is successfully applied to the fracture simulation process in Brazilian splitting and intermediate crack tensile tests.…”
    Get full text
    Article
  3. 15683

    Research on Small Sample Nonlinear Cointegration Test and Modeling Based on the LS-SVM Optimized by PSO by Jungang Du

    Published 2022-01-01
    “…We also compare the prediction results with the wavelet neural network algorithm, and the results show that the generalization ability of LS-SVM Optimized by PSO is better, and the prediction accuracy of small samples is higher.…”
    Get full text
    Article
  4. 15684

    MULTI-OBJECTIVE OPTIMIZATION DESIGN OF BACKHOE HYDRAULIC EXCAVATOR WORKING DEVICE BASED ON RESPONSE SURFACE METHODOLOGY by ZHANG XianMeng, LI XiangLong, WANG YouGuo

    Published 2019-01-01
    “…By using the optimal Latin hypercube experimental design and response surface methodology, the approximate model of boom strength, bucket strength, working equipment quality, 1 order modal and 2 order modal is established, and the optimization efficiency is improved. Using NSGA-II algorithm, the multi-objective optimization design of the working device is carried out, and the Pareto solution set is obtained. …”
    Get full text
    Article
  5. 15685

    Efficient optimization of the Held–Karp lower bound by Righini, Giovanni

    Published 2021-11-01
    “…Although motivated by the optimization of the Held–Karp lower bound for the TSP, the algorithm solves a more general problem, allowing for the efficient pre-computation of alternative minimum spanning trees in weighted graphs where any vertex can be deleted.…”
    Get full text
    Article
  6. 15686

    Topology optimization and forwarding strategy design for blockchain network by Ru HUO, Xiangfeng CHENG, Chuang SUN, Shuo WANG, Tao HUANG, Yu F.Richard

    Published 2022-12-01
    “…In order to solve the problem of the low data transmission efficiency of the blockchain network, an optimization method of blockchain transmission efficiency was proposed to optimize the network topology and forwarding strategy.First, the trusted value function was designed to calculate the trusted value of blockchain nodes, and a tree topology was constructed by comprehensively considering the trusted value and transmission time.Furthermore, the forwarding path selection strategy was designed based on the tree topology, with the minimum overall concurrent transmission time as the goal, and the forwarding table of the node about the forwarding order of its neighbor nodes was established.To reduce the impact of the node changed on the tree topology, a topology dynamic optimization strategy was proposed to adjust tree topology locally.The forwarding path selection strategy enabled the entire data transmission process to have the minimum transmission time, and the dynamic optimization strategy avoided reconfiguration of the entire network topology and effectively shortened the data transmission time.The simulation results show that, compared with the weight-first algorithm, the transmission time of the proposed method is reduced by about 20%, and the data transmission efficiency is significantly improved.…”
    Get full text
    Article
  7. 15687

    Discrete optimizations’ problems of deliveries of heterogeneous products by V. V. Egorov

    Published 2023-06-01
    “…A method for finding the optimal solution one of the many such solutions, based on the ideas of the Hungarian algorithm is proposed, the justification of which is given on the basis of the corresponding lemma. …”
    Get full text
    Article
  8. 15688

    LEO satellite Internet resource allocation strategy based on terminal traffic prediction by SHEN Fei, LYU Chengcheng, ZHANG Jiaxuan, RUAN Xiaoting

    Published 2024-07-01
    “…An improved LSTM-ARIMA algorithm was proposed with real datasets by the strategy to accurately predict the data traffic generated in the ground area over a certain period of time in the future. …”
    Get full text
    Article
  9. 15689

    Kinematics and Dynamics Analysis of Lower Limb Robot based on Human Motion Data by Hailong Du, Ningning Hu

    Published 2022-03-01
    “…Therefore, based on the idea of importing human motion data as a reference trajectory into the robot system,the human lower limb motion data and plantar force data are collected experimentally through 3D infrared motion capture system and 3D force measuring platform system. The algorithm is used to filter and fit the collected data. …”
    Get full text
    Article
  10. 15690

    Key path analysis method for large-scale industrial control network by Yaofang ZHANG, Zheyu ZHANG, Haikuo QU, Ge ZHANG, Zibo WANG, Bailing WANG

    Published 2021-12-01
    “…In order to solve the problem of high time-consuming and resource-consuming quantitative calculation of large-scale industrial control network attack graphs, a key path analysis method for large-scale industrial control networks was proposed.Firstly, the idea of cut set was used to calculate the key nodes set of Bayesian attack graph by combining the atomic attack income in industrial control network, which solved the problem that the current cut set algorithm only considers the key nodes in graph structure.Secondly, a dynamic updating strategy of Bayesian attack graph which only updated the attack probability of key nodes was proposed to efficiently calculate the attack probability of the whole graph and analyze the key path of attack graph.The experimental results show that the proposed method can not only ensure the reliability of the calculation results of large-scale industrial control attack graphs, but also can significantly reduce the time consumption and have a significant improvement in the calculation efficiency.…”
    Get full text
    Article
  11. 15691

    Social-aware caching and forwarding for video streaming in information-centric 5G VANET by Tengfei CAO, Cuili JIANG, Zhiqiang LIU, Xiaoying WANG

    Published 2019-12-01
    “…The arrival of 5G-enabled communication technology has laid the foundation for providing high-quality video stream services in vehicular Ad Hoc network (VANET).However,current VANET still distribute video content over IP networks which design for host communication instead of content distribution.The mismatch between network function and design goals brings huge challenges for providing high quality video service.Based on the above questions,a social-aware caching and forwarding was proposed to support efficient video streaming services and the time complexity of the algorithm was O(m<sup>2</sup>).Firstly,a virtual community was constructed by analyzing the user's behaviors.Then,a fast forwarding scheme was introduced to ensure that users could discover the requested videos nearby.Finally,a community-based caching policy was proposed to optimize the in-community caching distributions.Simulation results show how the proposed strategy achieves better performance than other state-of-art solutions in terms of caching hit ratio,searching delay and control overhead.…”
    Get full text
    Article
  12. 15692

    Object detection and tracking in video sequences: formalization, metrics and results by R. P. Bohush, S. V. Ablameyko

    Published 2021-03-01
    “…Based on the considered generalization, an algorithm for tracking people has been developed that uses the tracking through detection method and convolutional neural networks to detect people and form features. …”
    Get full text
    Article
  13. 15693

    Class imbalance learning–driven Alzheimer’s detection using hybrid features by Ran Baik

    Published 2019-02-01
    “…Fisher linear discriminant analysis is used for dimensionality reduction and the resampling method is used to handle the class imbalance problem. The algorithm is evaluated using the three classifiers k -nearest neighbour, support vector machine and random forest. …”
    Get full text
    Article
  14. 15694

    Source localization based on time delay estimation in complex environment by Da-wei ZHANG, Chang-chun BAO, Bing-yin XIA

    Published 2014-01-01
    “…In order to improve the performance of source localization in noisy and reverberant environments,a novel time delay estimation (TDE) method was proposed.This method is called acoustical transfer function ratio based on statistical model (ATFR-SM).In the proposed algorithm,the noise reduction method based on the statistical model was adopted to reduce the effect of noise on acoustical transfer Function (ATF).In the ATF method,the power spectral density (PSD) was smoothed and whitened to reduce the effect of reverberations.voice activity detection (VAD) was used to distinguish the speech period from the noise period,and the TDE was performed in the speech period to improve the estimation accuracy.Moreover,the proposed TDE method and the linear closed-form method for source localization were combined to constitute a source localization system.The results of performance evaluation show that,in both the noisy and reverberant conditions,the lower percentage of abnormal points (PAP) and lower root mean square error (RMSE) can be achieved by the proposed TDE method than those of the reference methods.Meanwhile,the source localization has higher accuracy than the reference methods.…”
    Get full text
    Article
  15. 15695

    Prediction of optimal growth parameters of barley seedling based on Kalman filter and multilayer perceptron by Yunlong HUANG, Zhengquan LI, Yujia SUN

    Published 2021-12-01
    “…In order to improve the quality and planting efficiency of barley seedlings in the growth chamber, the Kalman filter algorithm was firstly used to process the data collected by the sensor, which effectively reduced the influence of environmental factors and the error of the sensor itself, improved the accuracy of the collected data, and ensured the precise control in the growth chamber and accurate test data.Then multiple nonlinear regression, radial basis function and multilayer perceptron neural network were used to analyze the average growth height, seedling weight and seed weight of barley seeds about 160 hours after germination under different conditions.The drying ratio was analyzed and compared.The results show that the multi-layer perceptron network model fits the data best.Using this model to predict the average height of barley seedlings and the ratio of seedling weight of barley seedlings in the optimal environment is basically consistent with the actual planting effect, which provides a certain reference for the planting of barley seedlings in the growth chamber.…”
    Get full text
    Article
  16. 15696

    Modification of the Pitch Curve Design Defect of Non-circular Gear based on Spline Interpolation Method by Liu Qinqin, Lü Gang, Deng Xingqiao

    Published 2018-01-01
    “…The results indicate that design deficiency such as pitch curve for high-order Achimedean spiral gear pair can be amended quickly by the algorithm,while it is exactly.…”
    Get full text
    Article
  17. 15697

    Analysis of packet loss rate based on the measured traffic by Ting MI, Wei DING

    Published 2013-09-01
    “…The packet loss rate is one of key indicators to evaluate the performance of network.A method for calculating packet loss rate in the measured data based on the intact TCP flows was presented.Based on the measured data,the packet loss rate of Jiangsu Province in CERNET network and different partitions outside was analysed.The algorithm gives the packet loss rate including first packet loss rate p<sub>fl</sub>,overall packet loss rate p<sub>sl</sub>and retransmission rate p<sub>rp</sub>.Through statistical analysis,p<sub>fl</sub>is smaller than p<sub>sl</sub>in the vast majority of cases,and p<sub>rp</sub>is significantly higher than p<sub>fl</sub>and p<sub>sl</sub>,which proves the impact of packet loss on the performance of network,and retransmission rate is obviously higher than packet loss rate.…”
    Get full text
    Article
  18. 15698

    TCP-friendly streaming medium transmitting mechanism in wireless network by CHEN Zhi-gang, DENG Xiao-heng, ZHANG Lian-ming, ZHAO Ming

    Published 2007-01-01
    “…To maintain Streaming media services flows friendly to TCP flows and h/ld the QoS of the streaming service in wireless networks,an adaptive rate control mechanism was proposed.Packet loss between.etwork congestion and wireless link error was distinguished to ’et the accurate state of the networks by the receiver.Occupati/n of the receiver buffer,which reflected how long the temporar)ly stored streaming medium data could be played,was also combined into this algorithm.And tradeoff between TCP-friendly and QoS of streaming media service was achieved through multi-level rate adjustment according to packet loss rate of congestion and queue length of receiver.The results of simulations show that good throughput was gained compared with TCP and TFRC,at most reaching 2M,in condition of 0-0.1 link drop rate,2 and 32 conncections.As link error and congestion was seperated by WTFCC,therefor,end to end packet drop rate was higher than TCP and TFRC,and also of higer throughput.Nomalized throughput indicated that WTFCC was friendly to TCP.…”
    Get full text
    Article
  19. 15699

    Research on incremental deployment mechanism of network modality for polymorphic network environment by Jiong LI, Yuxiang HU, Pengshuai CUI, Le TIAN, Yongji DONG

    Published 2023-06-01
    “…Polymorphic networks support diverse network requirements and can coexist, evolve, and change on a unified physical or logical infrastructure in the form of network modality.They can maximize the innovation vitality of network technology driven by new applications.The evolution and development of modality require the incremental deployment of modality to meet the needs of convenience and privacy protection in the multi-user deployment process.However, the deployment of current network functions still uses the one-by-one deployment method, resulting in high complexity of the deployment of new modality, and mutual exposure of processing logic between different users.To address these issues, an incremental deployment mechanism for polymorphic network environments was proposed.Firstly, an incremental deployment mechanism for network modality was designed.Then, the incremental deployment of modality was abstracted as a graph merging problem based on this mechanism, and an adjacency list-based merge parsing graph algorithm was designed.The simulation results indicate that the proposed mechanism can achieve fast and correct merging of network modality, support incremental modality deployment, and greatly reduce the application deployment and service provision threshold of new network systems.…”
    Get full text
    Article
  20. 15700

    Code vulnerability detection method based on graph neural network by Hao CHEN, Ping YI

    Published 2021-06-01
    “…The schemes of using neural networks for vulnerability detection are mostly based on traditional natural language processing ideas, processing the code as array samples and ignoring the structural features in the code, which may omit possible vulnerabilities.A code vulnerability detection method based on graph neural network was proposed, which realized function-level code vulnerability detection through the control flow graph feature of the intermediate language.Firstly, the source code was compiled into an intermediate representation, and then the control flow graph containing structural information was extracted.At the same time, the word vector embedding algorithm was used to initialize the vector of basic block to extract the code semantic information.Then both of above were spliced to generate the graph structure sample data.The multilayer graph neural network model was trained and tested on graph structure data features.The open source vulnerability sample data set was used to generate test data to evaluate the method proposed.The results show that the method effectively improves the vulnerability detection ability.…”
    Get full text
    Article