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...
详细信息
Leveraging machine learning algorithms (ML) for AC optimal power flow (ACOPF) is an inevitable tendency in power system analysis and operation. A wide range of ML models' applications such as deep neural networks ...
详细信息
This work presents an accelerator that performs blind deblurring based on the dark channel prior. The alternating minimization algorithm is leveraged for latent image and blur kernel estimation. A 2-D Laplace equation...
详细信息
Uncrewed Aerial Vehicles (UAVs) have enabled key duties in emergency preparedness, traffic monitoring, environmental monitoring, and public safety. Since the presence of GPS-enabled contexts is not always guaranteed, ...
详细信息
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...
详细信息
We consider the multiobjective optimization problem for the resource allocation of the multiagent network, where each agent contains multiple conflicting local objective functions. The goal is to find compromise solut...
详细信息
We consider the multiobjective optimization problem for the resource allocation of the multiagent network, where each agent contains multiple conflicting local objective functions. The goal is to find compromise solutions minimizing all local objective functions subject to resource constraints as much as possible, i.e., the Pareto optimums. To this end, we first reformulate the multiobjective optimization problem into one single-objective distributed optimization problem by using the weighted Lppreference index,where the weighting factors of all local objective functions are obtained from the optimization procedure so that the optimizer of the latter is the desired Pareto optimum of the former. Next, we propose novel predefined-time algorithms to solve the reformulated problem by time-based generators. We show that the reformulated problem is solved within a predefined time if the local objective functions are strongly convex and smooth. Moreover, the settling time can be arbitrarily preset since it does not depend on the initial values and designed parameters. Finally, numerical simulations are presented to illustrate the effectiveness of the proposed algorithms.
Covert communication is considered a promising technology for hiding transmission processes and activities from malicious eavesdropping. With the development of detection technology, the traditional point-to-point cov...
详细信息
From AI-assisted art creation to large language model (LLM)-powered ChatGPT, AI-generated contents and services are becoming a transforming force. It calls for the telecom industry to embrace the prospects of AIGC ser...
详细信息
Population growth in cities results in a demand for parking lots from an increasing number of automobiles, which frequently contributes to the global problem of traffic congestion. This study presents the smart parkin...
详细信息
Robots have shown promising prospect in numerous applications, such as space exploration and disaster rescue. Due to the harsh environmental conditions (e.g., high temperature) in many applications, motor drive system...
详细信息
暂无评论