• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    Journal of Computational Design and Engineering

    Journal of Computational Design and Engineering

    JournalISSN 2288-4300eISSN 2288-5048中科院 工程技术 2区

    年发文量

    研究主题

    论文(3158)

    排序
    1NewAn Emperor Penguin Optimizer with Intelligent Modular Arithmetic-Driven Multi-Population Partitioning
    Othman Waleed Khalid,Nor Ashidi Mat Isa,Wei Hong Lim

    Abstract Metaheuristic optimization algorithms are essential for solving complex and high-dimensional problems, yet their performance is often constrained by premature convergence and insufficient population diversity. Although the Emperor Penguin Optimizer (EPO) has demonstrated promising results, its single-population structure and static search behavior limit robustness and scalability. To overcome these drawbacks, this paper proposes a Multi-Population Emperor Penguin Optimizer with Joint Opposite Selection (MLPEPO-JOS), an adaptive multi-population optimization framework that introduces a process innovation in how population coordination, diversity preservation, and opposition learning are integrated. The proposed approach integrates three complementary mechanisms: an adaptive multi-population regulation strategy driven by real-time fitness improvement trends, an intelligent modular arithmetic-based division scheme that ensures balanced population partitioning under arbitrary population sizes, and a Joint Opposite Selection (JOS) mechanism that combines Selective Leading Opposition and Dynamic Opposition to enhance exploration-exploitation balance. MLPEPO-JOS is evaluated on 41 benchmark functions from the IEEE CEC2017 and CEC2022 suites, achieving the best mean ranking and competitive performance in terms of accuracy, robustness, and convergence behavior. Statistical analyses indicate significant improvements over many of the evaluated competitors, although the significance varies across individual comparisons.

    2026
    引用
    AI阅读
    加入学术空间
    2NewBEVTraj: Map-Free Multimodal Trajectory Prediction with Sensor-Derived BEV Context and Sparse Goal Reasoning
    Minsang Kong, Myeongjun Kim, Sang Gu Kang, Hejiu Lu, Yupeng Zhong,Sang Hun Lee

    Abstract Trajectory prediction is a key task in autonomous driving, where a model must forecast plausible future motions of surrounding agents from dynamic histories and scene context. Many recent methods use high-definition (HD) maps to provide explicit road topology and semantic constraints, but such maps are costly to maintain, geographically limited, and difficult to update in changing environments. This paper presents Bird’s-Eye View Trajectory Prediction (BEVTraj), a map-free trajectory prediction framework that directly uses BEV features constructed from raw multi-sensor data. Since sensor-derived BEV features are dense and only implicitly structured, BEVTraj employs deformable attention to selectively aggregate agent-relevant spatial context from sparse locations rather than processing the entire BEV grid uniformly. In addition, a Sparse Goal Candidate Proposal (SGCP) module combines overlapping mode-wise anchor clusters with attention-based goal prediction to generate compact, scene-adaptive goal hypotheses. These goals are decoded and iteratively refined into multimodal trajectories, while trajectory-aware mode scoring and temporal consistency modeling improve confidence estimation and suppress abrupt, physically implausible refinement updates. Experiments on nuScenes and Argoverse 2 Sensor show that BEVTraj achieves competitive results under a map-free setting without using pre-built HD maps, while ablation studies and qualitative analyses illustrate the roles of BEV context aggregation and sparse goal reasoning. The source code is available at https://github.com/Kongminsang/bevtraj.

    2026
    引用
    AI阅读
    加入学术空间
    3NewManyROCKET: Adaptive Parallel Multi-Representation MiniROCKET for Time Series Classification
    Mehmet Kurnaz, Celal Alagöz

    Abstract Time series classification has achieved strong performance through transformation-based methods such as MiniROCKET, which rely on fast random convolutional feature extraction from raw temporal signals. However, representing time series data in a single domain limits the ability to capture complex temporal–spectral and structural characteristics in diverse real-world datasets. In this study, we propose ManyROCKET, an adaptive parallel MiniROCKET framework that integrates multiple complementary signal representations within a unified and computationally efficient classification pipeline. The framework incorporates seven established transformations spanning time-domain, frequency-domain, time–frequency, analytic, and derivative-based representations. By systematically combining these transformations, we explore a broad set of multi-representation configurations on benchmark datasets from the UCR Time Series Archive to identify the most effective representation subset. The selected configuration is then evaluated at archive scale and directly compared with the Raw Time (Identity) MiniROCKET baseline. To ensure scalability, we introduce an adaptive two-tier parallel execution strategy that enables concurrent processing of multiple representations while preserving the core efficiency of MiniROCKET-style feature extraction. Extensive experimental results demonstrate that multi-representation learning consistently and robustly outperforms the standard raw time-domain MiniROCKET baseline across diverse datasets. The proposed ManyROCKET framework achieves superior classification performance while maintaining practical computational efficiency, highlighting the effectiveness of integrating complementary signal domains within a unified architecture.

    2026
    引用
    AI阅读
    加入学术空间
    4NewAn Improved Escape Algorithm with Multi-Strategy Enhancement for Solving Global Optimum Problems
    Ming Wang, Qipeng Chen, Silei Fan, Ning Yu, Junqiang Zheng

    Abstract The Escape algorithm (ESC), which simulates crowd evacuation behavior, is a novel algorithm. However, it has certain limitations in terms of convergence speed and the avoidance of local optima. This paper proposes a multi-strategy enhanced variant (ESCSA), which introduces three key improvements: First, it incorporates a dynamic mask probability adjustment mechanism that adapts the dimension update ratio throughout the iteration process, thereby achieving a better balance between exploration and exploitation. Second, it incorporates stagnation detection and Simulated Annealing local search. When the optimal solution shows no significant improvement over several consecutive iterations, the Simulated Annealing optimization mechanism is triggered to generate Gaussian-perturbed neighboring solutions, avoiding local optima via the Metropolis criterion. Third, it implements a worst-elimination strategy, periodically injecting randomly positioned new individuals to replace the worst solutions in the population, thereby maintaining diversity. On the CEC 2017 benchmark suite (10/30/50/100 dimensions), ESCSA achieved the best overall performance among 11 algorithms, ranking first in the Friedman mean rank test across all four dimensions with average ranks of 2.217, 1.383, 1.400, and 1.933, respectively. It obtained the optimal mean fitness on 17, 22, 21, and 17 functions for the four dimensions, respectively. In three engineering design problems (speed reducer design, multi-disc clutch braking, and rolling element bearing design), ESCSA ranked second, third, and first, respectively, demonstrating strong and consistent performance across constrained optimization tasks. When subsequently applied to path planning for mobile robots in static environments, ESCSA was experimentally confirmed to plan robot paths and identify superior solutions efficiently.

    2026
    引用
    AI阅读
    加入学术空间
    5NewOperational Strategies for Patient Isolation Units to Control Aerosol Transmission: a Computational Fluid Dynamics-Based Multi-Objective Optimization Approach
    Jong Hyeon Lee, Min Hyuk Lim, Jae Woo Shim, Dong Hyun Choi,Byoungjun Jeon, Ki Hong Kim, Jongmo Seo,Changhoon Baek, Sungwan Kim

    Abstract The COVID-19 pandemic overwhelmed hospital capacities, prompting the use of patient isolation units (PIUs) to flexibly expand containment in emergency rooms (ERs). However, existing studies primarily rely on static analyses and rarely quantify the direct infection risk to healthcare workers (HCWs). To address these, we propose an integrated framework to simultaneously minimize the aerosol dispersion index (ADI) and infection risk index (IRI) under dynamic conditions. A multistage methodology integrating computational fluid dynamics, surrogate modeling, and the non-dominated sorting genetic algorithm II was developed to analyze 120 dynamic scenarios. Optimal solutions were derived to quantify the improvements in ADI and IRI relative to general operation. Furthermore, the technique for order preference by similarity to ideal solution algorithm was employed to determine the optimal distributions of the PIU operational parameters and HCW behavioral factors based on weighted priorities. The optimized strategy demonstrated enhanced improvements in both ADI and IRI compared to the general operation. Optimal control minimized instances where IRI exceeded levels observed without a PIU, while simultaneously enhancing ADI. Variable analysis revealed that the optimal fan filter unit operation depends heavily on the specific dynamic conditions. Furthermore, maintaining physical distance emerged as a consistently dominant factor in reducing IRI, whereas respiratory avoidance efficacy was largely negated by turbulence. This study highlights the necessity and effectiveness of adaptive optimization in PIUs. Implementing intelligent strategies and adaptive control algorithms that respond to real-world environmental changes is essential for comprehensive infection control in high-risk environments.

    2026
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 3158 篇论文

    高被引作者

    作者引用发文
    Arora, S.10162
    Maziar Yazdani8125
    Fariborz Jolai7234
    Huiling Chen52224
    Ali Asghar Heidari49420
    Vimal Savsani4505
    Vivek Patel4284
    Ghanshyam G. Tejani4284
    Heming Jia31711
    Hong-Bae Jun2972

    高产作者

    作者引用发文
    A. Yu. Albagachiev6344
    R. F. Ganiev18542
    O. V. Barmina6038
    V. I. Kucheryavyi4236
    Igor Kravchenko7235
    S. N. Mil’kov4035
    D. U. Khasyanova14434
    Nikolai Andreevich Makhutov12029
    A. V. Glazunov24228
    G. Zh. Sakhvadze11827

    相关期刊

    Journal of Computing and Information Science in Engineering
    Advanced Engineering Informatics
    Advances in Engineering Software
    Archives of Computational Methods in Engineering
    Structural Health Monitoring
    Engineering Optimization
    Bulletin of the Polish Academy of Sciences: Technical Sciences
    Advances in Mechanical Engineering
    Sādhanā
    Journal of Applied Science and Engineering