This work focuses on the problem of distributed optimization in multi-agent cyberphysical systems, where a legitimate agent's iterates are influenced both by the values it receives from potentially malicious neigh...
详细信息
In this work, we introduce a new approach to model group actions in autoencoders. Diverging from prior research in this domain, we propose to learn the group actions on the latent space rather than strictly on the dat...
Over the past years,many efforts have been accomplished to achieve fast and accurate meta-heuristic algorithms to optimize a variety of real-world *** study presents a new optimization method based on an unusual geolo...
详细信息
Over the past years,many efforts have been accomplished to achieve fast and accurate meta-heuristic algorithms to optimize a variety of real-world *** study presents a new optimization method based on an unusual geological phenomenon in nature,named Geyser inspired Algorithm(GEA).The mathematical modeling of this geological phenomenon is carried out to have a better understanding of the optimization *** efficiency and accuracy of GEA are verified using statistical examination and convergence rate comparison on numerous CEC 2005,CEC 2014,CEC 2017,and real-parameter benchmark ***,GEA has been applied to several real-parameter engineering optimization problems to evaluate its *** addition,to demonstrate the applicability and robustness of GEA,a comprehensive investigation is performed for a fair comparison with other standard optimization *** results demonstrate that GEA is noticeably prosperous in reaching the optimal solutions with a high convergence rate in comparison with other well-known nature-inspired algorithms,including ABC,BBO,PSO,and *** that the source code of the GEA is publicly available at https://***/projects/gea.
Graph neural networks (GNNs) have gained increasing popularity, while usually suffering from unaffordable computations for real-world large-scale applications. Hence, pruning GNNs is of great need but largely unexplor...
详细信息
Graph neural networks (GNNs) have gained increasing popularity, while usually suffering from unaffordable computations for real-world large-scale applications. Hence, pruning GNNs is of great need but largely unexplored. The recent work Unified GNN Sparsification (UGS) studies lottery ticket learning for GNNs, aiming to find a subset of model parameters and graph structures that can best maintain the GNN performance. However, it is tailed for the transductive setting, failing to generalize to unseen graphs, which are common in inductive tasks like graph classification. In this work, we propose a simple and effective learning paradigm, Inductive Co-Pruning of GNNs (ICPG), to endow graph lottery tickets with inductive pruning capacity. To prune the input graphs, we design a predictive model to generate importance scores for each edge based on the input. To prune the model parameters, it views the weight’s magnitude as their importance scores. Then we design an iterative co-pruning strategy to trim the graph edges and GNN weights based on their importance scores. Although it might be strikingly simple, ICPG surpasses the existing pruning method and can be universally applicable in both inductive and transductive learning settings. On 10 graph-classification and two node-classification benchmarks, ICPG achieves the same performance level with 14.26%–43.12% sparsity for graphs and 48.80%–91.41% sparsity for the GNN model.
We propose a new method called the Metropolis-adjusted Mirror Langevin algorithm for approximate sampling from distributions whose support is a compact and convex set. This algorithm adds an accept-reject filter to th...
详细信息
Scheduling tasks in overloaded real-time systems is a challenging problem that has received a significant amount of attention in recent years. The processor is overloaded with more tasks than its capacity, resulting i...
详细信息
Research has demonstrated the positive influence of Undergraduate Research Experience (URE) programs in science, Technology, engineering, and Mathematics (STEM) on students' educational journey and their developme...
Research has demonstrated the positive influence of Undergraduate Research Experience (URE) programs in science, Technology, engineering, and Mathematics (STEM) on students' educational journey and their development as scientists, ultimately aiding them in making informed career choices. However, traditionally, URE programs have primarily targeted junior and senior students who already possess disciplinary knowledge and exhibit a strong inclination to persist in STEM fields. This study aims to examine the effects of involving freshmen in the Industry-Research Inclusion in STEM Education (I-RISE) program, specifically in the disciplines of electricalengineering (EE) and computerscience (CS), on student retention. The I-RISE program integrated research opportunities for undergraduate students with mentorship activities, facilitating the acquisition of relevant skills in applied computing and engineering techniques, research methodologies, and the attainment of internships. Analyzing the retention rates of three distinct cohorts of I-RISE participants over a span of three years revealed significantly higher retention rates compared to students who did not partake in the I-RISE program.
In pursuit of enhancing the Wireless Sensor Networks(WSNs)energy efficiency and operational lifespan,this paper delves into the domain of energy-efficient routing ***,the limited energy resources of Sensor Nodes(SNs)a...
详细信息
In pursuit of enhancing the Wireless Sensor Networks(WSNs)energy efficiency and operational lifespan,this paper delves into the domain of energy-efficient routing ***,the limited energy resources of Sensor Nodes(SNs)are a big challenge for ensuring their efficient and reliable *** data gathering involves the utilization of a mobile sink(MS)to mitigate the energy consumption problem through periodic network *** mobile sink(MS)strategy minimizes energy consumption and latency by visiting the fewest nodes or predetermined locations called rendezvous points(RPs)instead of all cluster heads(CHs).CHs subsequently transmit packets to neighboring *** unique determination of this study is the shortest path to reach *** the mobile sink(MS)concept has emerged as a promising solution to the energy consumption problem in WSNs,caused by multi-hop data collection with static *** this study,we proposed two novel hybrid algorithms,namely“ Reduced k-means based on Artificial Neural Network”(RkM-ANN)and“Delay Bound Reduced kmeans with ANN”(DBRkM-ANN)for designing a fast,efficient,and most proficient MS path depending upon rendezvous points(RPs).The first algorithm optimizes the MS’s latency,while the second considers the designing of delay-bound paths,also defined as the number of paths with delay over bound for the *** methods use a weight function and k-means clustering to choose RPs in a way that maximizes efficiency and guarantees network-wide *** addition,a method of using MS scheduling for efficient data collection is *** simulations and comparisons to several existing algorithms have shown the effectiveness of the suggested methodologies over a wide range of performance indicators.
The exchange of knowledge is widely recognized as a crucial aspect of effective knowledge management. When it comes to sharing knowledge within Prison settings, things get complicated due to various challenges such as...
详细信息
Non-orthogonal multiple access (NOMA), multiple-input multiple-output (MIMO) and mobile edge computing (MEC) are prominent technologies to meet high data rate demand in the sixth generation (6G) communication networks...
详细信息
Non-orthogonal multiple access (NOMA), multiple-input multiple-output (MIMO) and mobile edge computing (MEC) are prominent technologies to meet high data rate demand in the sixth generation (6G) communication networks. In this paper, we aim to minimize the transmission delay in the MIMO-MEC in order to improve the spectral efficiency, energy efficiency, and data rate of MEC offloading. Dinkelbach transform and generalized singular value decomposition (GSVD) method are used to solve the delay minimization problem. Analytical results are provided to evaluate the performance of the proposed Hybrid-NOMA-MIMO-MEC system. Simulation results reveal that the H-NOMA-MIMO-MEC system can achieve better delay performance and lower energy consumption compared to OMA.
暂无评论