scholarly journals A Parallel Version for the Propagation Algorithm

2005 ◽  
pp. 403-412
Author(s):  
Márcio Bastos Castro ◽  
Lucas Baldo ◽  
Luiz Gustavo Fernandes ◽  
Mateus Raeder ◽  
Pedro Velho
Keyword(s):  
Propagation Algorithm ◽  
Parallel Version

Exploiting Soft Constraints within Decomposition and Coordination Methods for Sub-hourly Unit Commitment

2020 ◽  
Author(s):  
Niranjan Raghunathan ◽  
Mikhail Bragin ◽  
Bing Yan ◽  
Peter Luh ◽  
Khosrow Moslehi ◽  
...  
Keyword(s):  
Unit Commitment ◽  
Daily Basis ◽  
Time Limit ◽  
Soft Constraints ◽  
Problem Complexity ◽  
Surrogate Optimization ◽  
Parallel Version ◽  
Improved Performance ◽  
Coordination Methods ◽  
Relaxed Problem

Unit commitment (UC) is an important problem solved on a daily basis within a strict time limit. While hourly UC problems are currently considered, they may not be flexible enough with the fast-changing demand and the increased penetration of intermittent renewables. Sub-hourly UC is therefore recommended. This, however, will significantly increase problem complexity even under the deterministic setting, and current methods may not be able to obtain good solutions within the time limit. In this paper, deterministic sub-hourly UC is considered, with the innovative exploitation of soft constraints – constraints that do not need to be strictly satisfied, but with predetermined penalty coefficients for their violations. The key idea is the “surrogate optimization” concept that ensures multiplier convergence within “surrogate” Lagrangian relaxation as long as the “surrogate optimality condition” is satisfied without the need to optimally solve the “relaxed problem.” Consequently, subproblems can still be formed and optimized when soft constraints are not relaxed, leading to a drastically reduced number of multipliers and improved performance. To further enhance the method, a parallel version is developed. Testing results on the Polish system demonstrate the effectiveness and robustness of both the sequential and parallel versions at finding high-quality solutions within the time limit.

Label propagation algorithm based on LDA model

2013 ◽  
Vol 32 (2) ◽  
pp. 403-406
Author(s):  
Pei-qi LIU ◽  
Jie-han SUN
Keyword(s):  
Label Propagation ◽  
Propagation Algorithm

scholarly journals Two-Stage Water Jet Landing Point Prediction Model for Intelligent Water Shooting Robot

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2704
Author(s):  
Yunhan Lin ◽  
Wenlong Ji ◽  
Haowei He ◽  
Yaojie Chen
Keyword(s):  
Pitch Angle ◽  
Back Propagation ◽  
Water Jet ◽  
The State ◽  
Model Parameters ◽  
Propagation Time ◽  
Back Propagation Algorithm ◽  
Angle Error ◽  
Landing Point ◽  
Propagation Algorithm

In this paper, an intelligent water shooting robot system for situations of carrier shake and target movement is designed, which uses a 2 DOF (degree of freedom) robot as an actuator, a photoelectric camera to detect and track the desired target, and a gyroscope to keep the robot’s body stable when it is mounted on the motion carriers. Particularly, for the accurate shooting of the designed system, an online tuning model of the water jet landing point based on the back-propagation algorithm was proposed. The model has two stages. In the first stage, the polyfit function of Matlab is used to fit a model that satisfies the law of jet motion in ideal conditions without interference. In the second stage, the model uses the back-propagation algorithm to update the parameters online according to the visual feedback of the landing point position. The model established by this method can dynamically eliminate the interference of external factors and realize precise on-target shooting. The simulation results show that the model can dynamically adjust the parameters according to the state relationship between the landing point and the desired target, which keeps the predicted pitch angle error within 0.1°. In the test on the actual platform, when the landing point is 0.5 m away from the position of the desired target, the model only needs 0.3 s to adjust the water jet to hit the target. Compared to the state-of-the-art method, GA-BP (genetic algorithm-back-propagation), the proposed method’s predicted pitch angle error is within 0.1 degree with 1/4 model parameters, while costing 1/7 forward propagation time and 1/200 back-propagation calculation time.

scholarly journals LPA-MNI: An Improved Label Propagation Algorithm Based on Modularity and Node Importance for Community Detection

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 497
Author(s):  
Huan Li ◽  
Ruisheng Zhang ◽  
Zhili Zhao ◽  
Xin Liu
Keyword(s):  
Community Detection ◽  
Real World ◽  
Label Propagation ◽  
Node Importance ◽  
Propagation Algorithm ◽  
Synthetic Networks

Community detection is of great significance in understanding the structure of the network. Label propagation algorithm (LPA) is a classical and effective method, but it has the problems of randomness and instability. An improved label propagation algorithm named LPA-MNI is proposed in this study by combining the modularity function and node importance with the original LPA. LPA-MNI first identify the initial communities according to the value of modularity. Subsequently, the label propagation is used to cluster the remaining nodes that have not been assigned to initial communities. Meanwhile, node importance is used to improve the node order of label updating and the mechanism of label selecting when multiple labels are contained by the maximum number of nodes. Extensive experiments are performed on twelve real-world networks and eight groups of synthetic networks, and the results show that LPA-MNI has better accuracy, higher modularity, and more reasonable community numbers when compared with other six algorithms. In addition, LPA-MNI is shown to be more robust than the traditional LPA algorithm.

Sign in / Sign up

Export Citation Format

Share Document