Search alternatives:
spatial research » pain research (Expand Search)
Showing 381 - 400 results of 1,830 for search 'spatial research algorithm', query time: 0.14s Refine Results
  1. 381
  2. 382

    A Review: The Application of Path Optimization Algorithms in Building Mechanical, Electrical, and Plumbing Pipe Design by Ruijun Deng, Xiaoliang Li, Yuhua Tian

    Published 2025-06-01
    “…This review systematically integrates recent advancements in path optimization algorithms for the automated layout of mechanical, electrical, and plumbing (MEP) systems within complex building environments. …”
    Get full text
    Article
  3. 383
  4. 384
  5. 385
  6. 386
  7. 387

    The Application of Genetic Algorithm in Seismic Performance Optimization of a Y-Eccentrically Braced Composite Frame by Wenxuan Zhang, Yongfei Zhao, Zhenhao Wu, Jizhi Zhao, Shuke Wang

    Published 2025-02-01
    “…An efficient fiber beam–spring element model, which considers the spatial composite effect of the RC slab, was proposed and used to simulate the research objects. …”
    Get full text
    Article
  8. 388
  9. 389
  10. 390
  11. 391

    Novel fruit fly algorithm for global optimisation and its application to short-term wind forecasting by Yang Chen, DeChang Pi

    Published 2019-07-01
    “…In order to overcome the shortcoming and improve the precision of solution, we propose a new fruit fly optimisation algorithm (SEDMFOA) based on spatial expansion and dynamic mutation. …”
    Get full text
    Article
  12. 392
  13. 393
  14. 394

    Machine learning applications in river research: Trends, opportunities and challenges by Long Ho, Peter Goethals

    Published 2022-11-01
    “…In contrast, river researchers have had few applications in multiclass and multilabel algorithm, associate rule and Naïve Bayes. …”
    Get full text
    Article
  15. 395
  16. 396
  17. 397
  18. 398

    Location privacy protection method based on lightweight K-anonymity incremental nearest neighbor algorithm by Saite CHEN, Weihai LI, Yuanzhi YAO, Nenghai YU

    Published 2023-06-01
    “…The use of location-based service brings convenience to people’s daily lives, but it also raises concerns about users’ location privacy.In the k-nearest neighbor query problem, constructing K-anonymizing spatial regions is a method used to protects users’ location privacy, but it results in a large waste of communication overhead.The SpaceTwist scheme is an alternative method that uses an anchor point instead of the real location to complete the k-nearest neighbor query,which is simple to implement and has less waste of communication overhead.However,it cannot guarantee K-anonymous security, and the specific selection method of the anchor point is not provided.To address these shortcomings in SpaceTwist, some schemes calculate the user’s K-anonymity group by introducing a trusted anonymous server or using the way of user collaboration, and then enhance the end condition of the query algorithm to achieve K-anonymity security.Other schemes propose the anchor point optimization method based on the approximate distribution of interest points, which can further reduce the average communication overhead.A lightweight K-anonymity incremental nearest neighbor (LKINN) location privacy protection algorithm was proposed to improve SpaceTwist.LKINN used convex hull mathematical tool to calculate the key points of K-anonymity group, and proposed an anchor selection method based on it, achieving K-anonymity security with low computational and communication costs.LKINN was based on a hybrid location privacy protection architecture, making only semi-trusted security assumptions for all members of the system, which had lax security assumptions compared to some existing research schemes.Simulation results show that LKINN can prevent semi-trusted users from stealing the location privacy of normal users and has smaller query response time and communication overhead compare to some existing schemes.…”
    Get full text
    Article
  19. 399
  20. 400