Showing 1,521 - 1,540 results of 3,562 for search 'improve (((cost OR most) OR post) OR root) optimization algorithm', query time: 0.40s Refine Results
  1. 1521

    Dynamic Coal Flow-Based Energy Consumption Optimization of Scraper Conveyor by Qi Lu, Yonghao Chen, Xiangang Cao, Tao Xie, Qinghua Mao, Jiewu Leng

    Published 2025-06-01
    “…Conversely, simultaneously increasing both chain and drum speeds helps to maintain lump coal size. The final optimization scheme demonstrates this balance—achieving improved energy efficiency at the cost of increased coal fragmentation. …”
    Get full text
    Article
  2. 1522

    Optimization mechanism of attack and defense strategy in honeypot game with evidence for deception by Lihua SONG, Yangyang JIANG, Changyou XING, Guomin ZHANG

    Published 2022-11-01
    “…Using game theory to optimize honeypot behavior is an important method in improving defender’s trapping ability.Existing work tends to use over simplified action spaces and consider isolated game stages.A game model named HoneyED with expanded action spaces and covering comprehensively the whole interaction process between a honeypot and its adversary was proposed.The model was focused on the change in the attacker’s beliefs about its opponent’s real identity.A pure-strategy-equilibrium involving belief was established for the model by theoretical analysis.Then, based on the idea of deep counterfactual regret minimization (Deep-CFR), an optimization algorithm was designed to find an approximate hybrid-strategy-equilibrium.Agents for both sides following hybrid strategies from the approximate equilibrium were obtained.Theoretical and experimental results show that the attacker should quit the game when its belief reaches a certain threshold for maximizing its payoff.But the defender’s strategy is able to maximize the honeypot’s profit by reducing the attacker’s belief to extend its stay as long as possible and by selecting the most suitable response to attackers with different deception recognition abilities.…”
    Get full text
    Article
  3. 1523

    Binary program taint analysis optimization method based on function summary by Pan YANG, Fei KANG, Hui SHU, Yuyao HUANG, Xiaoshao LYU

    Published 2023-04-01
    “…Taint analysis is a popular software analysis method, which has been widely used in the field of information security.Most of the existing binary program dynamic taint analysis frameworks use instruction-level instrumentation analysis methods, which usually generate huge performance overhead and reduce the program execution efficiency by several times or even dozens of times.This limits taint analysis technology’s wide usage in complex malicious samples and commercial software analysis.An optimization method of taint analysis based on function summary was proposed, to improve the efficiency of taint analysis, reduce the performance loss caused by instruction-level instrumentation analysis, and make taint analysis to be more widely used in software analysis.The taint analysis method based on function summary used function taint propagation rules instead of instruction taint propagation rules to reduce the number of data stream propagation analysis and effectively improve the efficiency of taint analysis.For function summary, the definition of function summary was proposed.And the summary generation algorithms of different function structures were studied.Inside the function, a path-sensitive analysis method was designed for acyclic structures.For cyclic structures, a finite iteration method was designed.Moreover, the two analysis methods were combined to solve the function summary generation of mixed structure functions.Based on this research, a general taint analysis framework called FSTaint was designed and implemented, consisting of a function summary generation module, a data flow recording module, and a taint analysis module.The efficiency of FSTaint was evaluated in the analysis of real APT malicious samples, where the taint analysis efficiency of FSTaint was found to be 7.75 times that of libdft, and the analysis efficiency was higher.In terms of accuracy, FSTaint has more accurate and complete propagation rules than libdft.…”
    Get full text
    Article
  4. 1524

    Optimization of Identification and Zoning Method for Landscape Characters of Urban Historic Districts by Hong YUN, Zixuan HU, Zehao HU

    Published 2025-01-01
    “…Then the research utilizes K-means clustering algorithm to optimize the zoning method for historic landscape characters. …”
    Get full text
    Article
  5. 1525
  6. 1526

    Optimization of microwave components using machine learning and rapid sensitivity analysis by Slawomir Koziel, Anna Pietrenko-Dabrowska

    Published 2024-12-01
    “…On the other hand, the most widely used nature-inspired algorithms require large numbers of system simulations to yield a satisfactory design. …”
    Get full text
    Article
  7. 1527

    Shape optimization of non-uniform parametric piezoelectric energy harvester beam by Milad Hasani, Hossein Shahverdi

    Published 2025-04-01
    “…The model, validated through finite element method (FEM) simulations and experimental data, enables rapid analysis and optimization of PEHs. The Nelder-Mead optimization algorithm was employed to enhance power generation performance across three cross-sectional configurations: rectangular, trapezoidal, and quadratic. …”
    Get full text
    Article
  8. 1528

    Multi-Attribute Collaborative Optimization for Multimodal Transportation Based on User Preferences by Youpeng Lu, Gang Gao

    Published 2025-05-01
    “…In terms of solution methods, an improved Genetic Algorithm (GA) and Aptenodytes Forsteri Optimization (AFO) hybrid algorithm (GA-AFO) is proposed, which introduces GA to generate a high-quality initial population to accelerate convergence. …”
    Get full text
    Article
  9. 1529

    Research on pose estimation algorithm of non-cooperative target tracked vehicles based on PnP model by Zhigang Ren, Xinagjun Tang, Guoquan Ren, Dinghai Wu

    Published 2025-03-01
    “…Finally, the pose equation is solved by finding the local minimum of the cost function through algebraic optimization, thus avoiding convergence issues in iterative optimization. …”
    Get full text
    Article
  10. 1530

    Efficient and Composable Masked AES S-Box Designs Using Optimized Inverters by Vedad Hadžic, Roderick Bloem

    Published 2024-12-01
    “… Hardware implementations of cryptographic algorithms are susceptible to power analysis attacks, allowing attackers to break the otherwise strong security guarantees. …”
    Get full text
    Article
  11. 1531
  12. 1532

    Greedy gradient-free adaptive variational quantum algorithms on a noisy intermediate scale quantum computer by César Feniou, Muhammad Hassan, Baptiste Claudon, Axel Courtat, Olivier Adjoua, Yvon Maday, Jean-Philip Piquemal

    Published 2025-05-01
    “…However, practical implementations on current quantum processing units (QPUs) are challenging due to the noisy evaluation of a polynomially scaling number of observables, undertaken for operator selection and high-dimensional cost function optimization. We introduce an adaptive algorithm using analytic, gradient-free optimization, called Greedy Gradient-free Adaptive VQE (GGA-VQE). …”
    Get full text
    Article
  13. 1533

    Enhancing LoRaWAN Performance Using Boosting Machine Learning Algorithms Under Environmental Variations by Maram A. Alkhayyal, Almetwally M. Mostafa

    Published 2025-06-01
    “…Bayesian Optimization was applied to fine-tune hyperparameters to improve model accuracy. …”
    Get full text
    Article
  14. 1534
  15. 1535

    Modern approaches for management patients with craniofacial tumors (literature review) by A. S. Dikarev, S. A. Vartanyan, A. A. Martirosyan

    Published 2024-12-01
    “…An immediate observation that follows the realization of the practical significance of a surgical treatment algorithm common to all physicians and mid-level medical staff is that the most effective achievement of the above task lies in learning from one’s own mistakes during patient care. …”
    Get full text
    Article
  16. 1536

    Optimization of Flight Scheduling in Urban Air Mobility Considering Spatiotemporal Uncertainties by Lingzhong Meng, Minggong Wu, Xiangxi Wen, Zhichong Zhou, Qingguo Tian

    Published 2025-05-01
    “…Additionally, the proposed phased artificial lemming algorithm (ALA) outperforms traditional optimization algorithms in terms of solution quality. …”
    Get full text
    Article
  17. 1537
  18. 1538

    Selective opposition based constrained barnacle mating optimization: Theory and applications by Marzia Ahmed, Mohd Herwan Sulaiman, Md. Maruf Hassan, Md. Atikur Rahaman, Masuk Abdullah

    Published 2024-12-01
    “…In addition to increasing efficiency by cutting down on wasted time spent exploring, this also increases the likelihood of stumbling onto optimal solutions. After that, it is put through its paces in a real-world case study, where it proves to be superior to the most cutting-edge algorithms available.…”
    Get full text
    Article
  19. 1539

    Structural optimization and performance evaluation of a sugarcane leaf mulching machine by Weihua Huang, Shuo Wang, Chang Ge, Lijiao Wei, Dongjie Du, Zhaojun Niu, Ming Li, Zhenhui Zheng

    Published 2025-12-01
    “…Field tests under typical post-harvest conditions (leaf moisture content of 31.8 %, representing the average humidity of sugarcane leaves in tropical regions) demonstrated that the optimized machine achieved a pick-up rate of 98.4 % and a mulching rate of 94.4 % (≤20 cm), reflecting improvements of 0.8 % and 7.1 % over the previous design, respectively. …”
    Get full text
    Article
  20. 1540

    Entire aerial-aquatic trajectory modeling and optimization for trans-medium vehicles by Teng Long, Nianhui Ye, Baoshou Zhang, Jingliang Sun, Renhe Shi

    Published 2025-07-01
    “…Simultaneously, several constraints, i.e., the max impact load, trajectory height, etc., are involved in the optimization problem. Rather than directly optimizing by a heuristic algorithm, a multi-surrogate cooperative sampling-based optimization method is proposed to alleviate the computational complexity of the entire trajectory optimization problem. …”
    Get full text
    Article