Fuju Zhou^*, Li Li, Tengfei Jia, Yongchang Yin, Aixiang Shi, Shengrong Xu

Energy Engineering, Vol.121, No.6, pp. 1697-1711, 2024, DOI:10.32604/ee.2024.047680

Abstract When a line failure occurs in a power grid, a load transfer is implemented to reconfigure the network by changing the states of tie-switches and load demands. Computation speed is one of the major performance indicators in power grid load transfer, as a fast load transfer model can greatly reduce the economic loss of post-fault power grids. In this study, a reinforcement learning method is developed based on a deep deterministic policy gradient. The tedious training process of the reinforcement learning model can be conducted offline, so the model shows satisfactory performance in real-time operation, More >

Hongliang Zhang^1,2, Yi Chen¹, Yuteng Zhang¹, Gongjie Xu^3,*

CMES-Computer Modeling in Engineering & Sciences, Vol.140, No.2, pp. 1459-1483, 2024, DOI:10.32604/cmes.2024.049756

Abstract The distributed flexible job shop scheduling problem (DFJSP) has attracted great attention with the growth of the global manufacturing industry. General DFJSP research only considers machine constraints and ignores worker constraints. As one critical factor of production, effective utilization of worker resources can increase productivity. Meanwhile, energy consumption is a growing concern due to the increasingly serious environmental issues. Therefore, the distributed flexible job shop scheduling problem with dual resource constraints (DFJSP-DRC) for minimizing makespan and total energy consumption is studied in this paper. To solve the problem, we present a multi-objective mathematical model for… More >

Han Zhou^1,2, Hongtao Xu^1,2, Xinyue Chang^1,2, Wei Zhang^1,2, Heng Dong^1,2,*

CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 2295-2313, 2024, DOI:10.32604/cmc.2024.047754

Abstract Many deep learning-based registration methods rely on a single-stream encoder-decoder network for computing deformation fields between 3D volumes. However, these methods often lack constraint information and overlook semantic consistency, limiting their performance. To address these issues, we present a novel approach for medical image registration called the Dual-VoxelMorph, featuring a dual-channel cross-constraint network. This innovative network utilizes both intensity and segmentation images, which share identical semantic information and feature representations. Two encoder-decoder structures calculate deformation fields for intensity and segmentation images, as generated by the dual-channel cross-constraint network. This design facilitates bidirectional communication between grayscale More >

Jinlin Xu^1,2, Wansu Pan^1,*, Longle Cheng^1,2, Haibo Tan^1,2, Munan Yuan^1,*, Xiaofeng Li^1,2

CMC-Computers, Materials & Continua, Vol.79, No.1, pp. 1399-1418, 2024, DOI:10.32604/cmc.2024.049622

Abstract The existing multipath routing in Software Defined Network (SDN) is relatively blind and inefficient, and there is a lack of cooperation between the terminal and network sides, making it difficult to achieve dynamic adaptation of service requirements and network resources. To address these issues, we propose a multi-constraint path optimization scheme based on information fusion in SDN. The proposed scheme collects network topology and network state information on the network side and computes disjoint paths between end hosts. It uses the Fuzzy Analytic Hierarchy Process (FAHP) to calculate the weight coefficients of multiple constrained parameters… More >

Zibin Mao¹, Qinghai Zhao^1,2,*, Liang Zhang¹

CMES-Computer Modeling in Engineering & Sciences, Vol.140, No.1, pp. 757-792, 2024, DOI:10.32604/cmes.2024.048016

Abstract This paper proposes a multi-material topology optimization method based on the hybrid reliability of the probability-ellipsoid model with stress constraint for the stochastic uncertainty and epistemic uncertainty of mechanical loads in optimization design. The probabilistic model is combined with the ellipsoidal model to describe the uncertainty of mechanical loads. The topology optimization formula is combined with the ordered solid isotropic material with penalization (ordered-SIMP) multi-material interpolation model. The stresses of all elements are integrated into a global stress measurement that approximates the maximum stress using the normalized p-norm function. Furthermore, the sequential optimization and reliability assessment… More >

Thanh-Lam Nguyen¹, Hao Kao¹, Thanh-Tuan Nguyen², Mong-Fong Horng^1,*, Chin-Shiuh Shieh^1,*

CMC-Computers, Materials & Continua, Vol.78, No.2, pp. 2181-2205, 2024, DOI:10.32604/cmc.2024.047387

Abstract Since its inception, the Internet has been rapidly evolving. With the advancement of science and technology and the explosive growth of the population, the demand for the Internet has been on the rise. Many applications in education, healthcare, entertainment, science, and more are being increasingly deployed based on the internet. Concurrently, malicious threats on the internet are on the rise as well. Distributed Denial of Service (DDoS) attacks are among the most common and dangerous threats on the internet today. The scale and complexity of DDoS attacks are constantly growing. Intrusion Detection Systems (IDS) have… More >

Lalit Mohan Patnaik^1,5, Wenfeng Wang^2,3,4,5,6,*

CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.2, pp. 1203-1215, 2024, DOI:10.32604/cmes.2023.029451

Abstract This article reviews the theory of fairness in AI–from machine learning to federated learning, where the constraints on precision AI fairness and perspective solutions are also discussed. For a reliable and quantitative evaluation of AI fairness, many associated concepts have been proposed, formulated and classified. However, the inexplicability of machine learning systems makes it almost impossible to include all necessary details in the modelling stage to ensure fairness. The privacy worries induce the data unfairness and hence, the biases in the datasets for evaluating AI fairness are unavoidable. The imbalance between algorithms’ utility and humanization More >

Ngoc-Khuong Nguyen^1,2, Dac-Nhuong Le¹, Viet-Ha Nguyen², Anh-Cuong Le^3,*

Intelligent Automation & Soft Computing, Vol.38, No.1, pp. 1-18, 2023, DOI:10.32604/iasc.2023.037083

Abstract Text summarization aims to generate a concise version of the original text. The longer the summary text is, the more detailed it will be from the original text, and this depends on the intended use. Therefore, the problem of generating summary texts with desired lengths is a vital task to put the research into practice. To solve this problem, in this paper, we propose a new method to integrate the desired length of the summarized text into the encoder-decoder model for the abstractive text summarization problem. This length parameter is integrated into the encoding phase More >

Xiuhui Diao¹, Pengfei Wang^1,2,*, Weidong Li², Xianwu Chu², Yunming Wang²

CMES-Computer Modeling in Engineering & Sciences, Vol.138, No.2, pp. 1795-1812, 2024, DOI:10.32604/cmes.2023.030008

Abstract To solve the problem of data fusion for prior information such as track information and train status in train positioning, an adaptive H_∞ filtering algorithm with combination constraint is proposed, which fuses prior information with other sensor information in the form of constraints. Firstly, the train precise track constraint method of the train is proposed, and the plane position constraint and train motion state constraints are analysed. A model for combining prior information with constraints is established. Then an adaptive H_∞ filter with combination constraints is derived based on the adaptive adjustment method of the robustness More >

Zhihong Ouyang^*, Lei Xue, Feng Ding, Yongsheng Duan

CMC-Computers, Materials & Continua, Vol.77, No.1, pp. 983-1008, 2023, DOI:10.32604/cmc.2023.042222

Abstract Affinity propagation (AP) is a widely used exemplar-based clustering approach with superior efficiency and clustering quality. Nevertheless, a common issue with AP clustering is the presence of excessive exemplars, which limits its ability to perform effective aggregation. This research aims to enable AP to automatically aggregate to produce fewer and more compact clusters, without changing the similarity matrix or customizing preference parameters, as done in existing enhanced approaches. An automatic aggregation enhanced affinity propagation (AAEAP) clustering algorithm is proposed, which combines a dependable partitioning clustering approach with AP to achieve this purpose. The partitioning clustering… More >