Search

Addressing the formidable challenges posed by multiple jammers jamming multiple radars, which arise from spatial discretization, many degrees of freedom, numerous model input parameters, and the complexity of constraints, along with a multi-peaked objective function, this paper proposes a cooperative jamming resource allocation method, based on evolutionary reinforcement learning, that uses joint multi-domain information. Firstly, an adversarial scenario model is established, characterizing the interaction between multiple jammers and radars based on a multi-beam jammer model and a radar detection model. Subsequently, considering real-world scenarios, this paper analyzes the constraints and objective function involved in cooperative jamming resource allocation by multiple jammers. Finally, accounting for the impact of spatial, frequency, and energy domain information on jamming resource allocation, matrices representing spatial condition constraints, jamming beam allocation, and jamming power allocation are formulated to characterize the cooperative jamming resource allocation problem. Based on this foundation, the joint allocation of the jamming beam and jamming power is optimized under the constraints of jamming resources. Through simulation experiments, it was determined that, compared to the dung beetle optimizer (DBO) algorithm and the particle swarm optimization (PSO) algorithm, the proposed evolutionary reinforcement learning algorithm based on DBO and Q-Learning (DBO-QL) offers 3.03% and 6.25% improvements in terms of jamming benefit and 26.33% and 50.26% improvements in terms of optimization success rate, respectively. In terms of algorithm response time, the proposed hybrid DBO-QL algorithm has a response time of 0.11 s, which is 97.35% and 96.57% lower than the response times of the DBO and PSO algorithms, respectively. The results show that the method proposed in this paper has good convergence, stability, and timeliness. [ABSTRACT FROM AUTHOR]

Mission scheduling is an essential function of the management control of remote-sensing satellite application systems. With the continuous development of remote-sensing satellite applications, mission scheduling faces significant challenges. Existing work has many inherent shortcomings in dealing with dynamic task scheduling for remote-sensing satellites. In high-load and complex remote sensing task scenarios, there is low scheduling efficiency and a waste of resources. The paper proposes a scheduling method for remote-sensing satellite applications based on dynamic task prioritization. This paper combines the and Bound methodologies with an onboard task queue scheduling band in an active task prioritization context. A purpose-built emotional task priority-based scheduling blueprint is implemented to mitigate the flux and unpredictability characteristics inherent in the traditional satellite scheduling paradigm, improve scheduling efficiency, and fine-tune satellite resource allocation. Therefore, the Branch and Bound method in remote-sensing satellite task scheduling will significantly save space and improve efficiency. The experimental results show that comparing the technique to the three heuristic algorithms (GA, PSO, DE), the BnB method usually performs better in terms of the maximum value of the objective function, always finds a better solution, and reduces about 80% in terms of running time. [ABSTRACT FROM AUTHOR]

In the field of armored vehicles, up to 70% of accidents are associated with low levels of situational awareness among the occupants, highlighting the importance of situational awareness in improving task performance. In this study, we explored the mechanisms influencing situational awareness by simulating an armored vehicle driving platform with 14 levels of experimentation in terms of five factors: experience, expectations, attention, the cueing channel, and automation. The experimental data included SART and SAGAT questionnaire scores, eye movement indicators, and electrocardiographic and electrodermal signals. Data processing and analysis revealed the following conclusions: (1) Experienced operators have higher levels of situational awareness. (2) Operators with certain expectations have lower levels of situational awareness. (3) Situational awareness levels are negatively correlated with information importance affiliations and the frequency of anomalous information in non-primary tasks. (4) Dual-channel cues lead to higher levels of situational awareness than single-channel cues. (5) Operators' situational awareness is lower at high automation levels. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) swarms serve as a dynamic platform for diverse missions, including communication relays, search and rescue operations, and environmental monitoring. The success of these operations crucially depends on the resilience of their electrical support systems, especially in terms of battery management. This paper examines the reliability of electrical support for UAV swarms engaged in missions that require prioritization into high and low categories. The paper proposes a dynamic resource allocation strategy that permits the flexible reassignment of drones across different-priority tasks, ensuring continuous operation while optimizing resource use. By leveraging the Markov chain theory, an analytical model for the evaluation of the resilience of the battery management system under different operational scenarios was developed. The paper quantitatively assesses the impact of different operational strategies and battery management approaches on the overall system resilience and mission efficacy. This approach aims to ensure uninterrupted service delivery for critical tasks while optimizing the overall utilization of available electrical resources. Through modeling and analytical evaluations, the paper quantifies the impact of various parameters and operating strategies on overall system resilience and mission availability, considering the utilization strategies of batteries and their reliability and maintenance metrics. The developed models and strategies can inform the development of robust battery management protocols, resource allocation algorithms, and mission planning frameworks, ultimately enhancing the operational availability and effectiveness of UAV swarms in critical special missions. [ABSTRACT FROM AUTHOR]

With the progression of smart vehicles, i.e., connected autonomous vehicles (CAVs), and wireless technologies, there has been an increased need for substantial computational operations for tasks such as path planning, scene recognition, and vision-based object detection. Managing these intensive computational applications is concerned with significant energy consumption. Hence, for this article, a low-cost and sustainable solution using computational offloading and efficient resource allocation at edge devices within the Internet of Vehicles (IoV) framework has been utilised. To address the quality of service (QoS) among vehicles, a trade-off between energy consumption and computational time has been taken into consideration while deciding on the offloading process and resource allocation. The offloading process has been assigned at a minimum wireless resource block level to adapt to the beyond 5G (B5G) network. The novel approach of joint optimisation of computational resources and task offloading decisions uses the meta-heuristic particle swarm optimisation (PSO) algorithm and decision analysis (DA) to find the near-optimal solution. Subsequently, a comparison is made with other proposed algorithms, namely CTORA, CODO, and Heuristics, in terms of computational efficiency and latency. The performance analysis reveals that the numerical results outperform existing algorithms, demonstrating an 8% and a 5% increase in energy efficiency. [ABSTRACT FROM AUTHOR]

Edge computing provides higher computational power and lower transmission latency by offloading tasks to nearby edge nodes with available computational resources to meet the requirements of time-sensitive tasks and computationally complex tasks. Resource allocation schemes are essential to this process. To allocate resources effectively, it is necessary to attach metadata to a task to indicate what kind of resources are needed and how many computation resources are required. However, these metadata are sensitive and can be exposed to eavesdroppers, which can lead to privacy breaches. In addition, edge nodes are vulnerable to corruption because of their limited cybersecurity defenses. Attackers can easily obtain end-device privacy through unprotected metadata or corrupted edge nodes. To address this problem, we propose a metadata privacy resource allocation scheme that uses searchable encryption to protect metadata privacy and zero-knowledge proofs to resist semi-malicious edge nodes. We have formally proven that our proposed scheme satisfies the required security concepts and experimentally demonstrated the effectiveness of the scheme. [ABSTRACT FROM AUTHOR]

In this paper, the problem of joint transmission and computation resource allocation for a multi-user probabilistic semantic communication (PSC) network is investigated. In the considered model, users employ semantic information extraction techniques to compress their large-sized data before transmitting them to a multi-antenna base station (BS). Our model represents large-sized data through substantial knowledge graphs, utilizing shared probability graphs between the users and the BS for efficient semantic compression. The resource allocation problem is formulated as an optimization problem with the objective of maximizing the sum of the equivalent rate of all users, considering the total power budget and semantic resource limit constraints. The computation load considered in the PSC network is formulated as a non-smooth piecewise function with respect to the semantic compression ratio. To tackle this non-convex non-smooth optimization challenge, a three-stage algorithm is proposed, where the solutions for the received beamforming matrix of the BS, the transmit power of each user, and the semantic compression ratio of each user are obtained stage by stage. The numerical results validate the effectiveness of our proposed scheme. [ABSTRACT FROM AUTHOR]

This paper considers a resource allocation problem involving servers and mobile users (MUs) operating in a serverless edge computing (SEC)-enabled Internet of Things (IoT) network. Each MU has a fixed budget, and each server is powered by the grid and has energy harvesting (EH) capability. Our objective is to maximize the revenue of the operator that operates the said servers and the number of resources purchased by the MUs. We propose a Stackelberg game approach, where servers and MUs act as leaders and followers, respectively. We prove the existence of a Stackelberg game equilibrium and develop an iterative algorithm to determine the final game equilibrium price. Simulation results show that the proposed scheme is efficient in terms of the SEC's profit and MU's demand. Moreover, both MUs and SECs gain benefits from renewable energy. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) use multiple channels to communicate using wireless access in vehicular environment (WAVE) standards to provide a variety of vehicle-related applications. The current IEEE 802.11p WAVE communication channel structure is composed of one control channel (CCH) and several service channels (SCHs). SCHs are used for non-safety data transmission, while the CCH is used for broadcasting beacons, control, and safety. WAVE devices transmit data that alternate between CCHs and SCHs, and each channel is active for a duration called the CCH interval (CCHI) and SCH interval (SCHI), respectively. Currently, both intervals are fixed at 50 ms. However, fixed-length intervals cannot effectively respond to dynamically changing traffic loads. Additionally, when many vehicles are simultaneously using the limited channel resources for data transmission, the network performance significantly degrades due to numerous packet collisions. Herein, we propose an adaptive resource allocation technique for efficient data transmission. The technique dynamically adjusts the SCHI and CCHI to improve network performance. Moreover, to reduce data collisions and optimize the network's backoff distribution, the proposed scheme applies reinforcement learning (RL) to provide an intelligent channel access algorithm. The simulation results demonstrate that the proposed scheme can ensure high throughputs and low transmission delays. [ABSTRACT FROM AUTHOR]

Network disintegration is a fundamental issue in the field of complex networks, with its core in identifying critical nodes or sets and removing them to weaken network functionality. The research on this problem has significant strategic value and has increasingly attracted attention, including in controlling the spread of diseases and dismantling terrorist organizations. In this paper, we focus on the problem of network disintegration with discrete entity resources from the attack view, that is, optimizing resource allocation to maximize the effect of network disintegration. Specifically, we model the network disintegration problem with limited entity resources as a nonlinear optimization problem and prove its NP-hardness. Then, we design a method based on deep reinforcement learning (DRL), Net-Cracker, which transforms the two-stage entity resource and network node selection task into a single-stage object selection problem. Extensive experiments demonstrate that compared with the benchmark algorithm, Net-Cracker can improve the solution quality by about 8∼62%, while enabling a 30-to-160-fold speed up. Net-Cracker also exhibits strong generalization ability and can find better results in a near real-time manner even when the network scale is much larger than that in training data. [ABSTRACT FROM AUTHOR]

Cooperative alternatives need complex multi-criteria decision-making (MCDM) consideration, especially in resource allocation, where the alternatives exhibit interdependent relationships. Traditional MCDM methods like the Analytic Hierarchy Process (AHP) and Analytic Network Process (ANP) often overlook the synergistic potential of cooperative alternatives. This study introduces a novel method integrating AHP/ANP with Shapley values, specifically designed to address this gap by evaluating alternatives on individual merits and their contributions within coalitions. Our methodology begins with defining problem structures and applying AHP/ANP to determine the criteria weights and alternatives' scores. Subsequently, we compute Shapley values based on coalition values, synthesizing these findings to inform resource allocation decisions more equitably. A numerical example of budget allocation illustrates the method's efficacy, revealing significant insights into resource distribution when cooperative dynamics are considered. Our results demonstrate the proposed method's superiority in capturing the nuanced interplay between criteria and alternatives, leading to more informed urban planning decisions. This approach marks a significant advancement in MCDM, offering a comprehensive framework that incorporates both the analytical rigor of AHP/ANP and the equitable considerations of cooperative game theory through Shapley values. [ABSTRACT FROM AUTHOR]

This paper studies the single-machine group scheduling problem with convex resource allocation and learning effect. The number of jobs in each group is different, and the corresponding common due dates are also different, where the processing time of jobs follows a convex function of resource allocation. Under common due date assignment, the objective is to minimize the weighted sum of earliness, tardiness, common due date, resource consumption, and makespan. To solve the problem, we present the heuristic, simulated annealing, and branch-and-bound algorithms. Computational experiments indicate that the proposed algorithms are effective. [ABSTRACT FROM AUTHOR]

The rapid growth of edge devices and mobile applications has driven the adoption of edge computing to handle computing tasks closer to end-users. However, the heterogeneity of edge devices and their limited computing resources raise challenges in the efficient allocation of computing resources to complete services with different characteristics and preferences. In this paper, we delve into an edge scenario comprising multiple Edge Computing Servers (ECSs), multiple Device-to-Device (D2D) Edge Nodes (ENs), and multiple edge devices. In order to address the resource allocation challenge among ECSs, ENs, and edge devices in high-workload environments, as well as the pricing of edge resources within the resource market framework, we propose a Risk Assessment Contract Algorithm (RACA) based on risk assessment theory. The RACA enables ECSs to assess risks associated with local users by estimating their future revenue potential and updating the contract autonomously at present and in the future. ENs acquire additional resources from ECSs to efficiently complete local users' tasks. Simultaneously, ENs can also negotiate reasonable resource requests and pricing with ECSs by a Stackelberg game algorithm. Furthermore, we prove the unique existence of Nash equilibrium in the established game, implying that equilibrium solutions can stably converge through computational methods in heterogeneous environments. Finally, through simulation experiments on the dataset, we demonstrate that risk assessment can better enhance the overall profit capability of the system. Moreover, through multiple experiments, we showcase the stability of the contract's autonomous update capability. The RACA exhibits better utility in terms of system profit capabilities, stability in high-workload environments, and energy consumption. This work provides a more dynamic and effective solution to the resource allocation problem in edge systems under high-workload environments. [ABSTRACT FROM AUTHOR]

Nowadays, one of the main challenges facing green innovation management is how to enhance the performance of innovation processes by utilizing asymmetric input and output data. Therefore, this paper develops an improved SBM model analysis framework for evaluating the green innovation efficiency of asymmetric input and output data. The framework is applied to assess the technical (TE), managerial (PTE), and scale (SE) efficiencies of new energy companies under three input variables (R&D personnel input, R&D capital input, and comprehensive energy consumption input), two desirable output variables (green technology output and economic output), and one undesirable output variable (greenhouse gas emissions). Then, environmental factors and random factors are eliminated from the obtained input slack variables based on the SFA model, placing decision-making units in a homogeneous environment. The results demonstrate that TE, PTE, and SE are improved after eliminating environmental factors and random factors. Subsequently, based on the entropy method, this paper classifies companies' green innovation patterns into four categories and provides targeted solutions. The purpose of this paper is to provide an evaluation method for new energy companies to understand green innovation efficiency and assist decision makers in identifying the most optimal resource allocation approach. The proposed improved SBM model contributes to the literature and to industry practice by (1) providing a reliable evaluation of green innovation efficiency under asymmetric input and output data; (2) determining effective improvement actions based on a slack analysis of environmental variables and random variables that lead to improved process performance; and (3) making fuzzy innovation performance efficient to facilitate understanding and managing innovation resource allocation quality. [ABSTRACT FROM AUTHOR]

Two groups produce a network good perceived by a third party, such as a police or military institution, as a 'public bad', referred to as 'crime' for simplicity. These two groups, considered mafias, are assumed to be antagonists, whether they are enemies or competitors in the same market, causing harm to each other's activities. This paper provides guidelines for the policymaker, typically the police, seeking to minimize overall crime levels by internalizing these negative externalities. One specific question is investigated: the allocation of resources for the police. In general, we recommend a balanced crackdown on both antagonists, but an imbalance in group sizes may lead the police to focus on the more criminal group. [ABSTRACT FROM AUTHOR]

Due to a rising share of renewable energy sources on the production side and electrification of transport and heating on the consumption side, the efficient management of flexibility in distribution networks is crucial for ensuring optimal operation and utilization of resources. Nowadays, the sensitivity-based approach is mainly used in medium-voltage (MV) networks for regulating voltage profiles with reactive power of distributed energy resources (DER). The main disadvantage of the simplified sensitivity-based method is its inaccuracy in case of a high deviation of the network voltage from the nominal values. Furthermore, it was also noted that despite the fact that the method is well described in the literature, there is a lack of systematic approach to its implementation in real-life applications. Thus, the main objective of this paper is to address this disadvantage and to propose an algorithm designed to calculate required consumer flexibility in near real-time to ensure distribution grid operation within operational criteria. In the first part of the paper, network state, including line loading and node voltages, is assessed to determine distribution network node capacity. By analyzing the sensitivity of network busbars to changes in consumption and production, our algorithm effectively identifies the most efficient nodes and facilitates strategic decision-making for resource allocation. We demonstrate the effectiveness of our approach through simulations of real-world distribution network data, highlighting its ability to enhance network flexibility and improve resource utilization. Leveraging sensitivity coefficients, the algorithm enables flexible consumption and production management across various scenarios, supporting the transition to a more dynamic and efficient power system. [ABSTRACT FROM AUTHOR]

In Vehicular Edge Computing Network (VECN) scenarios, the mobility of vehicles causes the uncertainty of channel state information, which makes it difficult to guarantee the Quality of Service (QoS) in the process of computation offloading and the resource allocation of a Vehicular Edge Computing Server (VECS). A multi-user computation offloading and resource allocation optimization model and a computation offloading and resource allocation algorithm based on the Deep Deterministic Policy Gradient (DDPG) are proposed to address this problem. Firstly, the problem is modeled as a Mixed Integer Nonlinear Programming (MINLP) problem according to the optimization objective of minimizing the total system delay. Then, in response to the large state space and the coexistence of discrete and continuous variables in the action space, a reinforcement learning algorithm based on DDPG is proposed. Finally, the proposed method is used to solve the problem and compared with the other three benchmark schemes. Compared with the baseline algorithms, the proposed scheme can effectively select the task offloading mode and reasonably allocate VECS computing resources, ensure the QoS of task execution, and have a certain stability and scalability. Simulation results show that the total completion time of the proposed scheme can be reduced by 24–29% compared with the existing state-of-the-art techniques. [ABSTRACT FROM AUTHOR]

Vehicular clouds represent an appealing approach, leveraging vehicles' resources to generate value-added services. Thus, efficiently searching for and allocating resources is a challenge for the successful construction of vehicular clouds. Many recent schemes have relied on hierarchical network architectures using clusters to address this challenge. These clusters are typically constructed based on vehicle proximity, such as being on the same road or within the same region. However, this approach struggles to rapidly search for and consistently allocate resources, especially considering the diverse resource types and varying mobility of vehicles. To address these limitations, we propose the Resource Cluster-based Resource Search and Allocation (RCSA) scheme. RCSA constructs resource clusters based on resource types rather than vehicle proximity. This allows for more efficient resource searching and allocation. Within these resource clusters, RCSA supports both intra-resource cluster search for the same resource type and inter-resource cluster search for different resource types. In RCSA, vehicles with longer connection times and larger resource capacities are allocated in vehicular clouds to minimize cloud breakdowns and communication traffic. To handle the reconstruction of resource clusters due to vehicle mobility, RCSA implements mechanisms for replacing Resource Cluster Heads (RCHs) and managing Resource Cluster Members (RCMs). Simulation results validate the effectiveness of RCSA, demonstrating its superiority over existing schemes in terms of resource utilization, allocation efficiency, and overall performance. [ABSTRACT FROM AUTHOR]

Smart cities are powered by several new technologies to enhance connectivity between devices and develop a network of connected objects which can lead to many smart industrial applications. This network known as the Industrial Internet of Things (IIoT) consists of sensor nodes that have limited computing capacity and are sometimes not able to execute intricate industrial tasks within their stipulated time frame. For faster execution, these tasks are offloaded to nearby fog nodes. Internet access and the diverse nature of network types make IIoT nodes vulnerable and are under serious malicious attacks. Malicious attacks can cause anomalies in the IIoT network by overloading complex tasks, which can compromise the fog processing capabilities. This results in an increased delay of task computation for trustworthy nodes. To improve the task execution capability of the fog computing node, it is important to avoid complex offloaded tasks due to malicious attacks. However, even after avoiding the malicious tasks, if the offloaded tasks are too complex for the fog node to execute, then the fog nodes may struggle to process all legitimate tasks within their stipulated time frame. To address these challenges, the Trust-based Efficient Execution of Offloaded IIoT Trusted tasks (EEOIT) is proposed for fog nodes. EEOIT proposes a mechanism to detect malicious nodes as well as manage the allocation of computing resources so that IIoT tasks can be completed in the specified time frame. Simulation results demonstrate that EEOIT outperforms other techniques in the literature in an IIoT setting with different task densities. Another significant feature of the proposed EEOIT technique is that it enhances the computation of trustable tasks in the network. The results show that EEOIT entertains more legitimate nodes in executing their offloaded tasks with more executed data, with reduced time and with increased mean trust values as compared to other schemes. [ABSTRACT FROM AUTHOR]

This research addresses the problem of multi-objective resource allocation or resource deficits, offering robust answers to planning decisions that involve the elementary question: "How is it done?". The solution to the problem is realized using the general scheme of multi-criteria decision-making in uncertain conditions. The bases of the proposed scheme are associated with the possibilistic approach, which involves the generalization of fuzzy sets from the classical approach to process the uncertainty of information to produce robust (non-dominated) solutions in multi-criteria analysis. Applying this general scheme makes it possible to reduce regions of decision uncertainty through the maximum use of available quantitative information. In the case where quantitative information analysis is insufficient to obtain a unique solution, the proposed approach presupposes the appropriation of qualitative data extracted from experts, who express their opinions considering their knowledge, experience, and intuition. The information on the qualitative character can be represented in diverse preference formats processed by transformation functions to provide homogeneous information for decision procedures used at the final decision stage. The presented results have been implemented within the system of multi-criteria decision-making under uncertain conditions described in the paper. Its functioning is illustrated by solving the typical problem in investment planning activities. [ABSTRACT FROM AUTHOR]

Reasonable matching of capacity resources and transported cargoes is the key to realizing intelligent scheduling of less-than-truck-load (LTL) logistics. In practice, there are many types and numbers of participating objects involved in LTL logistics, such as customers, orders, trucks, unitized implements, etc. This results in a complex and large number of matching schemes where truck assignments interact with customer order service sequencing. For the truck–cargo online matching problem under real-time demand, it is necessary to comprehensively consider the online matching process of multi-node orders and the scheduling of multi-types of trucks. Combined with the actual operation scenario, a mixed-integer nonlinear programming model is introduced, and an online matching algorithm with a double-layer nested time window is designed to solve it. By solving the model in a small numerical case using Gurobi and the online matching algorithm, the validity of the model and the effectiveness of the algorithm are verified. The results indicate that the online matching algorithm can obtain optimization results with a lower gap while outperforming in terms of computation time. Relying on the realistic large-scale case for empirical analysis, the optimization results in a significant reduction in the number of trips for smaller types of trucks, and the average truck loading efficiency has reached close to 95%. The experimental results demonstrate the general applicability and effectiveness of the algorithm. Thus, it helps to realize the on-demand allocation of capacity resources and the timely response of transportation scheduling of LTL logistics hubs. [ABSTRACT FROM AUTHOR]

Under the influence of international trade, labor flow not only exists in the waves of international labor migration but is also embodied in international products and services. This paper focused on members of the China–Africa Cooperation Forum (FOCAC). We computed and analyzed the sectoral embodied labor transfer between China and Africa from 2000 to 2015 based on the Multiregional Input-Output Method. Our results are as follows: (1) Both China and Africa play roles as labor suppliers in the global supply chain. By ameliorating the trade structure, both China and Africa can better utilize their labor surplus. (2) China and Africa share complementarity in sectoral labor allocation. In short, the embodied labor transfer via international trade between China and Africa has, to some extent, relieved the labor shortage on both sides. (3) Africa has transformed into a net exporter of industrial labor since 2011. By analyzing the embodied labor flow from the global perspective, this paper beats a new path in depicting the effect of international trade on labor allocation, enriches the evaluation of embodied labor transfer between China and Africa, and also provides a beneficial supplement to Multiregional Input-Output analysis in the field of factor flows. [ABSTRACT FROM AUTHOR]

(1) Background: The pandemic led to significant healthcare disruptions, resulting in postponed surgeries and extended waiting times for non-urgent treatments, including hysteroscopies essential for diagnosing endometrial cancer. This study aims to formulate a risk stratification model to enhance the prioritization of hysteroscopy procedures in Brazil; (2) Methods: A case-control study was conducted at Vila Santa Catarina Hospital in São Paulo, analyzing the medical records of 2103 women who underwent hysteroscopy between March 2019 and March 2022. We used bivariate analysis and multivariate linear regression to identify risk factors associated with endometrial cancer and formulate a nomogram; (3) Results: The findings revealed a 5.5% incidence of pre-invasive and invasive endometrial disease in the study population, with an average waiting time of 120 days for hysteroscopy procedures. The main risk factors identified were hypertension, diabetes, postmenopausal bleeding, and obesity; (4) Conclusions: This research highlights the urgent need for efficient prioritization of hysteroscopy procedures in the wake of the pandemic. The developed nomogram is an innovative tool for identifying patients at higher risk of endometrial cancer, thus facilitating timely diagnosis and treatment and improving overall patient outcomes in a strained healthcare system. [ABSTRACT FROM AUTHOR]

As the number and variety of remote sensing satellites continue to grow, user demands are becoming increasingly complex and diverse. Concurrently, there is an escalating requirement for timeliness in satellite observations, thereby augmenting the complexity of task processing and resource allocation. In response to these challenges, this paper proposes an innovative method for dynamic task planning in multi-source remote sensing satellite cooperative observations tailored to complex scenarios. In the task processing phase, this study develops a preprocessing model suitable for various types of targets, enabling the decomposition of complex scenes into multiple point targets for independent satellite observation, thereby reducing the complexity of the problem. In the resource allocation phase, a dynamic task planning algorithm for multi-satellite cooperative observation is designed to achieve dynamic and optimized scheduling of the processed point targets, catering to the needs of multi-source remote sensing satellites. Empirical validation demonstrated that this method effectively implements dynamic adjustment plans for point targets, comprehensively optimizing the number of observation targets, computation time, task priority, and satellite resource utilization, significantly enhancing the dynamic observation efficiency of remote sensing satellites. [ABSTRACT FROM AUTHOR]

The effective allocation of limited resources and the establishment of targeted goals play a pivotal role in enhancing the overall efficiency of large enterprises and organizations. To achieve optimal organizational efficiency, managers seek dynamic strategies that adapt to the constraints of limited and uncertain historical data. This paper introduces an evaluation of organizational efficiency through a stochastic framework, employing a bilevel data envelopment analysis (DEA) approach. This decision-making process is centralized within a decision-making unit (DMU) overseeing subordinate decision-making units (subDMUs). Discrete scenarios, each associated with a realization probability, define the uncertain parameters in the bilevel DEA-based model. This stochastic approach allows for recourse actions upon scenario realization leading to an enhanced overall organizational strategy. Decision-makers acting within uncertain and dynamic environments can benefit from this research since it allows the investigation of efficiency assessment under alternative scenarios in the presence of volatility and risk. The potential impact of applying this methodology varies depending on the specific domain. Although, the context of this paper focuses on banking, in general, enhancing resource allocation and target setting under stochasticity, contributes to advancing sustainability across all its three dimensions (economic, environmental, social). As mentioned earlier, the practical application of our approach is demonstrated via a case study in the banking sector. [ABSTRACT FROM AUTHOR]

Car-sharing systems require accurate demand prediction to ensure efficient resource allocation and scheduling decisions. However, developing precise predictive models for vehicle demand remains a challenging problem due to the complex spatio-temporal relationships. This paper introduces USTIN, the Unified Spatio-Temporal Inference Prediction Network, a novel neural network architecture for demand prediction. The model consists of three key components: a temporal feature unit, a spatial feature unit, and a spatio-temporal feature unit. The temporal unit utilizes historical demand data and comprises four layers, each corresponding to a different time scale (hourly, daily, weekly, and monthly). Meanwhile, the spatial unit incorporates contextual points of interest data to capture geographic demand factors around parking stations. Additionally, the spatio-temporal unit incorporates weather data to model the meteorological impacts across locations and time. We conducted extensive experiments on real-world car-sharing data. The proposed USTIN model demonstrated its ability to effectively learn intricate temporal, spatial, and spatiotemporal relationships, and outperformed existing state-of-the-art approaches. Moreover, we employed negative binomial regression with uncertainty to identify the most influential factors affecting car usage. [ABSTRACT FROM AUTHOR]

Generative models have gained significant attention in recent years. They are increasingly used to estimate the underlying structure of high-dimensional data and artificially generate various kinds of data similar to those from the real world. The performance of generative models depends critically on a good set of hyperparameters. Yet, finding the right hyperparameter configuration can be an extremely time-consuming task. In this paper, we focus on speeding up the hyperparameter search through adaptive resource allocation, early stopping underperforming candidates quickly and allocating more computational resources to promising ones by comparing their intermediate performance. The hyperparameter search is formulated as a non-stochastic best-arm identification problem where resources like iterations or training time constrained by some predetermined budget are allocated to different hyperparameter configurations. A procedure which uses hypothesis testing coupled with Successive Halving is proposed to make the resource allocation and early stopping decisions and compares the intermediate performance of generative models by their exponentially weighted Maximum Means Discrepancy (MMD). The experimental results show that the proposed method selects hyperparameter configurations that lead to a significant improvement in the model performance compared to Successive Halving for a wide range of budgets across several real-world applications. [ABSTRACT FROM AUTHOR]

This research aims to explore the spatiotemporal distribution patterns of negative emotions in mainland China during different stages of the COVID-19 pandemic and the external factors influencing this clustering. Using Baidu Index data for 91 negative emotion keywords, a retrospective geographic analysis was conducted across Chinese provinces from 14 October 2019 to 7 July 2022. Four spatial analysis methods (Global Moran's Index, Local Moran's Index, Bivariate Global Moran's Index, and Bivariate Local Moran's Index) are employed to identify potential clustering patterns and influencing factors of negative emotions at different stages. The results indicate that the COVID-19 pandemic significantly intensified the clustering effect of negative emotions in China, particularly with a more pronounced radiation effect in northwestern provinces. Spatial positive correlations are observed between pandemic-related Baidu indices (pandemic Baidu index, government Baidu index, nucleic acid Baidu index) and negative emotions. These findings contribute to understanding the spatiotemporal distribution characteristics of negative emotions in China post the COVID-19 outbreak and can guide the allocation of psychological resources during emergencies, thereby promoting social stability. [ABSTRACT FROM AUTHOR]

In this paper, we consider different due-date assignment scheduling with group technology and resource allocation on a single machine, where the due date of each job may be different. Under constant processing times, the objective function is to minimize the scheduling cost (i.e., the weighted sum of earliness, tardiness, and due-date assignment cost, where the weights are position dependent). Under some optimal properties, we prove that this problem can be solved in  O (ζ log ζ)  time, where  ζ  is the number of jobs. The problem is also extended to cases which include linear and convex functions of the quantity of resource allocation. The objective function is minimizing the sum of the scheduling cost and the resource-consumption cost. For the special case of linear and convex functions, we show that the problem is polynomially solvable in  O (ζ 3)  time. [ABSTRACT FROM AUTHOR]

As distributed computing evolves, edge computing has become increasingly important. It decentralizes resources like computation, storage, and bandwidth, making them more accessible to users, particularly in dynamic Telematics environments. However, these environments are marked by high levels of dynamic uncertainty due to frequent changes in vehicle location, network status, and edge server workload. This complexity poses substantial challenges in rapidly and accurately handling computation offloading, resource allocation, and delivering low-latency services in such a variable environment. To address these challenges, this paper introduces a "Cloud–Edge–End" collaborative model for Telematics edge computing. Building upon this model, we develop a novel distributed service offloading method, LSTM Muti-Agent Deep Reinforcement Learning (L-MADRL), which integrates deep learning with deep reinforcement learning. This method includes a predictive model capable of forecasting the future demands on intelligent vehicles and edge servers. Furthermore, we conceptualize the computational offloading problem as a Markov decision process and employ the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) approach for autonomous, distributed offloading decision-making. Our empirical results demonstrate that the L-MADRL algorithm substantially reduces service latency and energy consumption by 5–20%, compared to existing algorithms, while also maintaining a balanced load across edge servers in diverse Telematics edge computing scenarios. [ABSTRACT FROM AUTHOR]

The development of emerging information technologies, such as the Internet of Things (IoT), edge computing, and blockchain, has triggered a significant increase in IoT application services and data volume. Ensuring satisfactory service quality for diverse IoT application services based on limited network resources has become an urgent issue. Generalized processor sharing (GPS), functioning as a central resource scheduling mechanism guiding differentiated services, stands as a key technology for implementing on-demand resource allocation. The performance prediction of GPS is a crucial step that aims to capture the actual allocated resources using various queue metrics. Some methods (mainly analytical methods) have attempted to establish upper and lower bounds or approximate solutions. Recently, artificial intelligence (AI) methods, such as deep learning, have been designed to assess performance under self-similar traffic. However, the proposed methods in the literature have been developed for specific traffic scenarios with predefined constraints, thus limiting their real-world applicability. Furthermore, the absence of a benchmark in the literature leads to an unfair performance prediction comparison. To address the drawbacks in the literature, an AI-enabled performance benchmark with comprehensive traffic-oriented experiments showcasing the performance of existing methods is presented. Specifically, three types of methods are employed: traditional approximate analytical methods, traditional machine learning-based methods, and deep learning-based methods. Following that, various traffic flows with different settings are collected, and intricate experimental analyses at both the feature and method levels under different traffic conditions are conducted. Finally, insights from the experimental analysis that may be beneficial for the future performance prediction of GPS are derived. [ABSTRACT FROM AUTHOR]

Mobile cloud computing (MCC) provides resources to users to handle smart mobile applications. In MCC, task scheduling is the solution for mobile users' context-aware computation resource-rich applications. Most existing approaches have achieved a moderate service reliability rate due to a lack of instance-centric resource estimations and task offloading, a statistical NP-hard problem. The current intelligent scheduling process cannot address NP-hard problems due to traditional task offloading approaches. To address this problem, the authors design an efficient context-aware service offloading approach based on instance-centric measurements. The revised machine learning model/algorithm employs task adaptation to make decisions regarding task offloading. The proposed MCVS scheduling algorithm predicts the usage rates of individual microservices for a practical task scheduling scheme, considering mobile device time, cost, network, location, and central processing unit (CPU) power to train data. One notable feature of the microservice software architecture is its capacity to facilitate the scalability, flexibility, and independent deployment of individual components. A series of simulation results show the efficiency of the proposed technique based on offloading, CPU usage, and execution time metrics. The experimental results efficiently show the learning rate in training and testing in comparison with existing approaches, showing efficient training and task offloading phases. The proposed system has lower costs and uses less energy to offload microservices in MCC. Graphical results are presented to define the effectiveness of the proposed model. For a service arrival rate of 80%, the proposed model achieves an average 4.5% service offloading rate and 0.18% CPU usage rate compared with state-of-the-art approaches. The proposed method demonstrates efficiency in terms of cost and energy savings for microservice offloading in mobile cloud computing (MCC). [ABSTRACT FROM AUTHOR]

This study investigates the problem of decentralized dynamic resource allocation optimization for ad-hoc network communication with the support of reconfigurable intelligent surfaces (RIS), leveraging a reinforcement learning framework. In the present context of cellular networks, device-to-device (D2D) communication stands out as a promising technique to enhance the spectrum efficiency. Simultaneously, RIS have gained considerable attention due to their ability to enhance the quality of dynamic wireless networks by maximizing the spectrum efficiency without increasing the power consumption. However, prevalent centralized D2D transmission schemes require global information, leading to a significant signaling overhead. Conversely, existing distributed schemes, while avoiding the need for global information, often demand frequent information exchange among D2D users, falling short of achieving global optimization. This paper introduces a framework comprising an outer loop and inner loop. In the outer loop, decentralized dynamic resource allocation optimization has been developed for self-organizing network communication aided by RIS. This is accomplished through the application of a multi-player multi-armed bandit approach, completing strategies for RIS and resource block selection. Notably, these strategies operate without requiring signal interaction during execution. Meanwhile, in the inner loop, the Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm has been adopted for cooperative learning with neural networks (NNs) to obtain optimal transmit power control and RIS phase shift control for multiple users, with a specified RIS and resource block selection policy from the outer loop. Through the utilization of optimization theory, distributed optimal resource allocation can be attained as the outer and inner reinforcement learning algorithms converge over time. Finally, a series of numerical simulations are presented to validate and illustrate the effectiveness of the proposed scheme. [ABSTRACT FROM AUTHOR]

Aeluropus lagopoides, a dominant palatable species in various sabkha and coastal regions of Saudi Arabia, can withstand harsh saline environments through phenotypic plasticity. When subjected to grazing, how A. lagopoides adapt phenotypically is currently unknown. There is a breakage in the chain of study on the spatial and temporal expansion strategy of A. lagopoides plants when subjected to different grazing stresses in different saline soil habitats. A grazing experiment was conducted to investigate the phenotypic plasticity and resource allocation pattern response of A. lagopoides in different saline soils. Individual A. lagopoides rhizomes from five saline regions were grown and exposed to varied grazing treatments in the form of clipping, viz; light, moderate, and heavy grazing, as compared to a grazing exclusion control. Our results showed that heavy grazing/clipping significantly decreased the shoot system and above-ground biomass in high-saline region plants in the early season. Plant length, root length, root and shoot biomass, the number of stolons, average stolon length, leaf area, and SLA of A. lagopiodes responded significantly to grazing intensities. A. lagopoides from the Qareenah, Qaseem, and Jizan regions were more tolerant to light grazing than A. lagopoides from the Salwa and Jouf regions. Light grazing showed significantly good re-growth, especially during the late season. Light grazing decreased the synthesis of chlorophyll content. Also, A. lagopiodes reduced the risk caused by reactive oxygen species via the increased accumulation of proline content. Overall, plants adapted to different morphological and physiological strategies to tolerate different levels of grazing intensities by adapting their morphological attributes. Though heavy grazing damages the plant, light and moderate grazing can be allowed to maintain the productivity and economic benefits of sabka habitats where soil conditions are moderately saline. [ABSTRACT FROM AUTHOR]

An imbalance in urban development in China has become a contradiction. Points of Interest (POIs) serve as representations of the spatial distribution of urban functions. Analyzing POI spatial co-occurrence patterns can reveal the agglomeration patterns of urban functions across cities at different levels, providing insights into imbalances in urban development. Using POI data from 297 cities in China, the Word2vec model was employed to model the POI spatial co-occurrence patterns, allowing for the quantification of fine-granular urban functionality. Subsequently, the cities were clustered into five tiers representing different levels of development. An urban hierarchical disparity index and graph were introduced to examine variations in urban functions across different tiers. A significant correlation between POI spatial co-occurrence patterns and the GDP of cities at different levels was demonstrated. This study revealed a notable polarization trend characterized by the development of top-tier cities and lagging tail-end cities. Top-tier cities exhibit advantages in terms of their commercial environments, such as international banks, companies, and transportation facilities. Conversely, tail-end cities face deficiencies in urban infrastructure. It is crucial to coordinate resource allocation and establish sustainable development strategies that foster mutual support between the top-tier and tail-end cities. [ABSTRACT FROM AUTHOR]

Federated learning is a promising technique in cloud computing and edge computing environments, and designing a reasonable resource allocation scheme for federated learning is particularly important. In this paper, we propose an auction mechanism for federated learning resource allocation in the edge–cloud collaborative environment, which can motivate data owners to participate in federated learning and effectively utilize the resources and computing power of edge servers, thereby reducing the pressure on cloud services. Specifically, we formulate the federated learning platform data value maximization problem as an integer programming model with multiple constraints, develop a resource allocation algorithm based on the monotone submodular value function, devise a payment algorithm based on critical price theory and demonstrate that the mechanism satisfies truthfulness and individual rationality. [ABSTRACT FROM AUTHOR]

This paper investigates an intelligent reflecting surface (IRS)-aided integrated sensing and communication (ISAC) framework to cope with the problem of spectrum scarcity and poor wireless environment. The main goal of the proposed framework in this work is to optimize the overall performance of the system, including sensing, communication, and computational offloading. We aim to achieve the trade-off between system performance and overhead by optimizing spectrum and computing resource allocation. On the one hand, the joint design of transmit beamforming and phase shift matrices can enhance the radar sensing quality and increase the communication data rate. On the other hand, task offloading and computation resource allocation optimize energy consumption and delay. Due to the coupled and high dimension optimization variables, the optimization problem is non-convex and NP-hard. Meanwhile, given the dynamic wireless channel condition, we formulate the optimization design as a Markov decision process. To tackle this complex optimization problem, we proposed two innovative deep reinforcement learning (DRL)-based schemes. Specifically, a deep deterministic policy gradient (DDPG) method is proposed to address the continuous high-dimensional action space, and the prioritized experience replay is adopted to speed up the convergence process. Then, a twin delayed DDPG algorithm is designed based on this DRL framework. Numerical results confirm the effectiveness of proposed schemes compared with the benchmark methods. [ABSTRACT FROM AUTHOR]

Traditional low earth orbit (LEO) satellite networks are typically independent of terrestrial networks, which develop relatively slowly due to the on-board capacity limitation. By integrating emerging mobile edge computing (MEC) with LEO satellite networks to form the business-oriented "end-edge-cloud" multi-level computing architecture, some computing-sensitive tasks can be offloaded by ground terminals to satellites, thereby satisfying more tasks in the network. How to make computation offloading and resource allocation decisions in LEO satellite edge networks, nevertheless, indeed poses challenges in tracking network dynamics and handling sophisticated actions. For the discrete-continuous hybrid action space and time-varying networks, this work aims to use the parameterized deep Q-network (P-DQN) for the joint computation offloading and resource allocation. First, the characteristics of time-varying channels are modeled, and then both communication and computation models under three different offloading decisions are constructed. Second, the constraints on task offloading decisions, on remaining available computing resources, and on the power control of LEO satellites as well as the cloud server are formulated, followed by the maximization problem of satisfied task number over the long run. Third, using the parameterized action Markov decision process (PAMDP) and P-DQN, the joint computing offloading, resource allocation, and power control are made in real time, to accommodate dynamics in LEO satellite edge networks and dispose of the discrete-continuous hybrid action space. Simulation results show that the proposed P-DQN method could approach the optimal control, and outperforms other reinforcement learning (RL) methods for merely either discrete or continuous action space, in terms of the long-term rate of satisfied tasks. [ABSTRACT FROM AUTHOR]

Creating policy measures is the final step in the process of e-learning roadmap development. Policy measures can be seen as long-term activities that need to be implemented and constantly upgraded to achieve strategic goals. For resource allocation, it is useful to prioritize policy measures. Prioritization can be implemented using multi-criteria decision-making methods. This paper analyzes policy measures in the Maldives National University's e-learning roadmap using the social network analysis process (SNAP), which includes the analytic hierarchy process (AHP), the decision-making trial and evaluation laboratory (DEMATEL), and the PageRank centrality. In policy measure evaluation, there were more than 20 participants: persons with managerial functions at the Maldives National University (MNU) (deans, heads of departments) and persons in lecturer and researcher positions. By using the AHP, participants prioritized policy measures with respect to their importance to them. By using the DEMATEL, participants identified and prioritized policy measures with respect to their effect on other measures. Finally, by using the SNAP, it was possible to determine the prioritization list for resource allocation since it aggregates the aspects of the policy measures, their importance, and their effect on other measures. [ABSTRACT FROM AUTHOR]

Accurate building extraction holds paramount importance in various applications such as urbanization rate calculations, urban planning, and resource allocation. In response to the escalating demand for precise low-altitude unmanned aerial vehicle (UAV) building segmentation in intricate scenarios, this study introduces a semi-supervised methodology to alleviate the labor-intensive process of procuring pixel-level annotations. Within the framework of adversarial networks, we employ a dual-channel parallel generator strategy that amalgamates the morphology-driven optical flow estimation channel with an enhanced multilayer sensing Deeplabv3+ module. This approach aims to comprehensively capture both the morphological attributes and textural intricacies of buildings while mitigating the dependency on annotated data. To further enhance the network's capability to discern building features, we introduce an adaptive attention mechanism via a feature fusion module. Additionally, we implement a composite loss function to augment the model's sensitivity to building structures. Across two distinct low-altitude UAV datasets within the domain of UAV-based building segmentation, our proposed method achieves average mean pixel intersection-over-union (mIoU) ratios of 82.69% and 79.37%, respectively, with unlabeled data constituting 70% of the overall dataset. These outcomes signify noteworthy advancements compared with contemporaneous networks, underscoring the robustness of our approach in tackling intricate building segmentation challenges in the domain of UAV-based architectural analysis. [ABSTRACT FROM AUTHOR]

Green scheduling that aims to enhance efficiency by optimizing resource allocation and job sequencing concurrently has gained growing academic attention. To tackle such problems with the consideration of scheduling and resource allocation, this paper considers a single-machine group scheduling problem with common/slack due-date assignment and a controllable processing time. The objective is to decide the optimized schedule of the group/job sequence, resource allocation, and due-date assignment. To solve the generalized case, this paper proves several optimal properties and presents a branch-and-bound algorithm and heuristic algorithms. Numerical experiments show that the branch-and-bound algorithm is efficient and the heuristic algorithm developed based on the analytical properties outruns the tabu search. [ABSTRACT FROM AUTHOR]

This study explored the effects of the sowing stage and nitrogen application rate on the grain yield and its allocation of light-temperature resources over a 9-year experiment from 2011 to 2019. Measurement indicators include the effective accumulative temperature on different growth durations, leaf area index (LAI), above-ground biomass production, and harvest index (HI). Methods: A split-plot design was arranged in the treatment, with N supply as the main plot and the sowing stage as the subplot. The main plots consisted of two nitrogen treatments: low nitrogen (LN: 120 kg ha−1) and high nitrogen (HN: 180 kg ha−1). The subplots contained two sowing stages: the early sowing stage (ES) and the late sowing stage (LS). Results: Compared with LNLS, LNES, and HNLS from 2011 to 2019, HNES of HHZ increased the grain yield by 9.5%, 2.5%, and 5.3%, while the difference in grain yield in YY8 was higher than HHZ, especially under HNES. Compared with LNLS, LNES, and HNLS from 2011 to 2019, HNES of HHZ increased the panicle number by 6.0%, 5.9%, and 1.0%, and HNES of YY8 increased by 12.7%, 11.4%, and 3.8%. Compared with HNLS of HHZ, LNES, LNLS, and HNES decreased the spikelets per panicle by 2.3%, 2.9%, and 1.1%, and decreased by 3.5%, 1.9%, and 2.2% in YY8. The early sowing or increasing N supply significantly increased the dry matter accumulated, grain weight, LAI, and HI. The higher grain yield in LNES was more closely related to the average temperature and the number of spikelets per panicle. The grain yield in HNES was more dependent on the effective accumulative temperature. Conclusions: Sowing in mid-May and increasing the N application (180 kg ha−1) are beneficial to the allocation of light temperature and the increase in yield. Therefore, this research provides a theoretical basis for improving rice yield and optimizing the utilization of light-temperature resources in the future. [ABSTRACT FROM AUTHOR]

D2D communication is a promising technology for enhancing spectral efficiency (SE) in cellular networks, and full-duplex (FD) has the potential to double SE. Due to D2D's short-distance communication and low transmittance power, it is natural to integrate FD into D2D, creating FD-D2D to underlay a cellular network to further improve SE. However, the residual self-interference (RSI) resulting from FD-D2D and interference arising from spectrum sharing between D2D users (DUs) and cellular users (CUs) can restrict D2D link performance. Therefore, we propose an FD-D2D underlying cellular system in which DUs jointly share uplink and downlink spectral resources with CUs. Moreover, we present two algorithms to enhance the performance experience of DUs while improving the system's SE. For the first algorithm, we tackle an optimization problem aimed at maximizing the sum rate of FD-DUs in the system while adhering to transmittance power constraints. This problem is formulated as a mixed-integer nonlinear programming problem (MINLP), known for its mathematical complexity and NP-hard nature. In order to address this MINLP, our first algorithm decomposes it into two subproblems: power control and spectral resource allocation. The power control aspect is treated as a nonlinear problem, which we solve through one-dimensional searching. Meanwhile, spectral resource allocation is achieved using the Kuhn–Munkres algorithm, determining the pairing of CUs and DUs sharing the same spectrum. As for the second algorithm, our objective is to enhance the individual performance of FD-DUs by maximizing the minimum rate among them, ensuring more uniform rate performance across all FD-DUs. In order to solve this optimization problem, we propose a novel spectral resource allocation algorithm based on bisection searching and the Kuhn–Munkres algorithm, whereas the power control aspect remains the same as in the first algorithm. The numerical results demonstrate that our proposed algorithm effectively enhances the performance of DUs in an FD-D2D underlying cellular network when compared to the sum rate maximization design. [ABSTRACT FROM AUTHOR]

This meta-analysis of observational studies aimed at estimating the overall prevalence of overdiagnosis and overtreatment in subjects with a clinical diagnosis of Chronic Obstructive Pulmonary Disease (COPD). MedLine, Scopus, Embase and Cochrane databases were searched, and random-effect meta-analyses of proportions were stratified by spirometry criteria (Global Initiative for COPD (GOLD) or Lower Limit of Normal (LLN)), and setting (hospital or primary care). Forty-two studies were included. Combining the data from 39 datasets, including a total of 23,765 subjects, the pooled prevalence of COPD overdiagnosis, according to the GOLD definition, was 42.0% (95% Confidence Interval (CI): 37.3–46.8%). The pooled prevalence according to the LLN definition was 48.2% (40.6–55.9%). The overdiagnosis rate was higher in primary care than in hospital settings. Fourteen studies, including a total of 8183 individuals, were included in the meta-analysis estimating the prevalence of COPD overtreatment. The pooled rates of overtreatment according to GOLD and LLN definitions were 57.1% (40.9–72.6%) and 36.3% (17.8–57.2%), respectively. When spirometry is not used, a large proportion of patients are erroneously diagnosed with COPD. Approximately half of them are also incorrectly treated, with potential adverse effects and a massive inefficiency of resources allocation. Strategies to increase the compliance to current guidelines on COPD diagnosis are urgently needed. [ABSTRACT FROM AUTHOR]

Compared to cloud computing, mobile edge computing (MEC) is a promising solution for delay-sensitive applications due to its proximity to end users. Because of its ability to offload resource-intensive tasks to nearby edge servers, MEC allows a diverse range of compute- and storage-intensive applications to operate on resource-constrained devices. The optimal utilization of MEC can lead to enhanced responsiveness and quality of service, but it requires careful design from the perspective of user-base station association, virtualized resource provisioning, and task distribution. Also, considering the limited exploration of the federation concept in the existing literature, its impacts on the allocation and management of resources still remain not widely recognized. In this paper, we study the network and MEC resource scheduling problem, where some edge servers are federated, limiting resource expansion within the same federations. The integration of network and MEC is crucial, emphasizing the necessity of a joint approach. In this work, we present NAFEOS, a proposed solution formulated as a two-stage algorithm that can effectively integrate association optimization with vertical and horizontal scaling. The Stage-1 problem optimizes the user-base station association and federation assignment so that the edge servers can be utilized in a balanced manner. The following Stage-2 dynamically schedules both vertical and horizontal scaling so that the fluctuating task-offloading demands from users are fulfilled. The extensive evaluations and comparison results show that the proposed approach can effectively achieve optimal resource utilization. [ABSTRACT FROM AUTHOR]

The increasing densification and diversification of modern and upcoming wireless networks have become an important motivation for the development of agile spectrum sharing. Radio environment maps (REMs) are a basic tool for spectrum utilisation characterisation and adaptive resource allocation, but they need to be estimated through accurate interpolation methods. This work evaluated the performance of two established algorithms for spatial three-dimensional (3D) data collected in two real-world scenarios: indoors, through a mechanical measuring system, and outdoors, through an unmanned aerial vehicle (UAV) for measurement collection. The investigation was undertaken for the complete dataset on two-dimensional (2D) planes of different altitudes and for a subset of limited samples (representing the regions of interest or RoIs), which were combined together to describe the spatial 3D environment. A minimum error of −9.5 dB was achieved for a sampling ratio of 21%. The methods' performance and the input data were analysed through the resulting Kriging error standard deviation (STD) and the STD of the distances between the measurement and the estimated points. Based on the results, several challenges for the interpolation performance and the analysis of the spatial RoIs are described. They facilitate the future development of 3D spectrum occupancy characterisation in indoor and UAV-based scenarios. [ABSTRACT FROM AUTHOR]

In this paper, in order to reduce the energy consumption and time of data transmission, the non-orthogonal multiple access (NOMA) and mobile edge caching technologies are jointly considered in mobile edge computing (MEC) networks. As for the cache-assisted vehicular NOMA–MEC networks, a problem of minimizing the energy consumed by vehicles (mobile devices, MDs) is formulated under time and resource constraints, which jointly optimize the computing resource allocation, subchannel selection, device association, offloading and caching decisions. To solve the formulated problem, we develop an effective joint computation offloading and task-caching algorithm based on the twin-delayed deep deterministic policy gradient (TD3) algorithm. Such a TD3-based offloading (TD3O) algorithm includes a designed action transformation (AT) algorithm used for transforming continuous action space into a discrete one. In addition, to solve the formulated problem in a non-iterative manner, an effective heuristic algorithm (HA) is also designed. As for the designed algorithms, we provide some detailed analyses of computation complexity and convergence, and give some meaningful insights through simulation. Simulation results show that the TD3O algorithm could achieve lower local energy consumption than several benchmark algorithms, and HA could achieve lower consumption than the completely offloading algorithm and local execution algorithm. [ABSTRACT FROM AUTHOR]

The backfill mining method is adopted in many mines around the world because it can reliably handle underground mine tailings and eliminate dangers in goafs. It is necessary to improve backfilling resource allocation and efficiency, thereby eliminating safety hazards and providing reliable support for the next stage of mining as quickly as possible. In this paper, we propose a backfill-scheduling optimization model that considers multiple processes, resource constraints, and operating capabilities. The purpose of this model is to minimize the exposure time of goafs. This NP-hard (Nondeterministic Polynomial-time hard) problem has a non-inferior implemented solution through multiple iterations of genetic, crossover, and mutation operations of the genetic algorithm. The results show that the model significantly reduces the backfilling-delay time and backfilling-operation time. [ABSTRACT FROM AUTHOR]

With advances in Internet of Things (IoT) technologies, billions of devices are becoming connected, which can result in the unprecedented sensing and control of the physical environments. IoT devices have diverse quality of service (QoS) requirements, including data rate, latency, reliability, and energy consumption. Meeting the diverse QoS requirements presents great challenges to existing fifth-generation (5G) cellular networks, especially in unprecedented scenarios in 5G networks, such as connected vehicle networks, where strict data packet latency may be required. The IoT devices with these scenarios have higher requirements on the packet latency in networking, which is essential to the utilization of 5G networks. In this paper, we propose a multi-tier cellular-based IoT network to address this challenge, with a particular focus on meeting application latency requirements. In the multi-tier network, access points (APs) can relay and forward packets from IoT devices or other APs, which can support higher data rates with multi-hops between IoT devices and cellular base stations. However, as multiple-hop relaying may cause additional delay, which is crucial to delay-sensitive applications, we develop new schemes to mitigate the adverse impact. Firstly, we design a traffic-prioritization scheduling scheme to classify packets with different priorities in each AP based on the age of information (AoI). Then, we design different channel-access protocols for the transmission of packets according to their priorities to ensure the QoS in networking and the effective utilization of the limited network resources. A queuing-theory-based theoretical model is proposed to analyze the packet delay for each type of packet at each tier of the multi-tier IoT networks. An optimal algorithm for the distribution of spectrum and power resources is developed to reduce the overall packet delay in a multi-tier way. The numerical results achieved in a two-tier cellular-based IoT network show that the target packet delay for delay-sensitive applications can be achieved without a large cost in terms of traffic fairness. [ABSTRACT FROM AUTHOR]

In this study, we evaluated the impact of brown seaweed extract (Ecklonia maxima) on the morphology and physiology of three different plant species. We conducted experiments using two types of fertilizers: an artificial fertilizer (0.1 g/L) and a biological extract of brown seaweed (Ecklonia maxima) at two concentrations (C1 at 1 mL/L and C2 at 2.5 mL/L). For melon, the application of C1 resulted in significant improvements in photosynthesis parameters, total chlorophyll content, and overall plant growth. When C2 was applied, it further enhanced these parameters, leading to a notable increase in shoot phytomass. In the case of cucumber, C1 led to increased resource allocation towards stems and leaves. Conversely, C2 increased the number of green leaves and contributed to higher shoot phytomass. For tomato plants, the application of C1 resulted in a slight increase in photosynthesis, but it did not significantly impact leaf growth. On the other hand, C2 induced a modest increase in photosynthesis, chlorophyll content, and root growth. In summary, our findings indicate that brown seaweed extract has a discernible influence on the physiology of the studied plants. However, the specific effects on resource allocation largely depend on the plant species and the concentration of the extract applied. [ABSTRACT FROM AUTHOR]