Search Results (41)

The abnormal proliferation of Ulva in the Yellow Sea has instigated the notorious green tide phenomenon. Mitigating this ecological challenge necessitates a holistic comprehension of Ulva’s nitrogen and phosphorus uptake behaviors. Investigating the mechanisms governing nutrient absorption, encompassing factors like concentration, form, and input dynamics, has unveiled their profound influence on nutrient assimilation rates. The nutrient absorption characteristics of Ulva prolifera, including its preference for abundant nutrients, a high nitrogen-to-phosphorus (N/P) ratio, and its ability to efficiently absorb nutrients during pulse nutrient input events, determine its dominant role in the green tide events in the Yellow Sea. Although source control and preemptive salvaging are effective methods for managing green tides, addressing the root causes of these coastal ecological disasters requires the implementation of long-term pollution control strategies that align with sustainable development goals, with a priority on reducing marine eutrophication. This is crucial for the effective management and restoration of the coastal ecosystem in the Yellow Sea. Full article

In this paper, we develop an exact schedulability test and sufficient infeasibility test for fixed-priority scheduling on multiprocessor platforms. We base our tests on presenting real-time systems as a Kripke model for dynamic real-time systems with sporadic non-preemptible tasks running on a multiprocessor platform and an online scheduler using global fixed priorities. This model includes states and transitions between these states, allows us to formally justify a polynomial-time algorithm for an exact schedulability test using the idea of backward reachability. Using this algorithm, we perform the exact schedulability test for the above real-time systems, in which there is one more task than the processors. The main advantage of this algorithm is its polynomial complexity, while, in general, the problem of the exact schedulability testing of real-time systems on multiprocessor platforms is NP-hard. The infeasibility test uses the same algorithm for an arbitrary task-to-processor ratio, providing a sufficient infeasibility condition: if the real-time system under test is not schedulable in some cases, the algorithm detects this. We conduct an experimental study of our algorithms on the datasets generated with different utilization values and compare them to several state-of-the-art schedulability tests. The experiments show that the performance of our algorithm exceeds the performance of its analogues while its accuracy is similar. Full article

As advancements in autonomous underwater vehicle (AUV) technology unfold, the role of underwater wireless sensor networks (UWSNs) is becoming increasingly pivotal. However, the high energy consumption in these networks can significantly reduce their operational lifespan, while latency issues can impair overall network performance. To address these challenges, a novel mixed packet forwarding strategy is developed, which incorporates a wakeup threshold and a dynamically adjusted access probability for the cluster head (CH). This approach aims to conserve energy while maintaining acceptable network latency levels. The wakeup threshold restricts the frequency of state switching for the CH, thereby reducing energy consumption. Meanwhile, the dynamic access probability regulates the influx of packets to mitigate system congestion based on current network conditions. Furthermore, to accommodate the network’s varied transmission demands, packets generated by sensor nodes (SNs) are categorized into two types according to their sensitivity to latency. A discrete−time queueing model with preemptive priority is then established to evaluate the performance of different packets and the CH. Numerical results show how different parameters affect network performance and demonstrate that the proposed mixed packet forwarding mechanism can effectively manage the trade−off between latency and energy consumption, outperforming the traditional mechanism within a specific range of parameters. Full article

To address the optimal scheduling of islanded microgrids under extreme operating conditions, this paper proposes a demand response (DR) economic optimization scheduling strategy based on model predictive control (MPC). The strategy improves the utilization of photovoltaic (PV) and energy storage systems while ensuring stable power supply to critical loads through a dynamic load shedding approach based on load priority and power system constraints. By incorporating time-of-use electricity pricing and load importance assessment, an innovative demand response incentive policy is designed to optimize consumer behavior and reduce grid load pressure. Experimental results demonstrate that the DR-MPC-based method reduces operating costs and increases renewable energy utilization compared to traditional methods. This approach is broadly applicable to pre-emptive load shedding and energy storage optimization in islanded microgrids during emergencies and is expected to be extended to the optimal scheduling of microgrid clusters in the future. Full article

The success of software projects is inseparable from the effective scheduling of multi-skilled human resources. In software development, employees’ personality traits often affect the performance of their work. Additionally, software developers are usually multi-tasking, which makes software development tasks preemptive. In view of this, we investigate the preemptive software project scheduling problem considering personality traits (PSPSP-PT), which aims at assigning employees with different skills and personality traits to suitable tasks and determining the start time of each task with the consideration of preemption, multi-skill, and precedence relations such that the total cost of the project is minimized. We formulate a mixed-integer linear programming model for the PSPSP-PT and design a dual priority rules-based heuristic (DPRH). Based on a benchmark dataset that is generated using a full factorial design, computational experiments are conducted to analyze the performance of our DPRH. Comparative analysis with existing algorithms reveals that our DPRH is competitive in terms of efficiency and effectiveness. Full article

Ground hazards are a significant problem in the global economy, costing millions of dollars in damage each year. Railroad tracks are vulnerable to ground hazards like flooding since they traverse multiple terrains with complex environmental factors and diverse human developments. Traditionally, flood-hazard assessments are generated using models like the Hydrological Engineering Center–River Analysis System (HEC-RAS). However, these maps are typically created for design flood events (10, 50, 100, 500 years) and are not available for any specific storm event, as they are not designed for individual flood predictions. Remotely sensed methods, on the other hand, offer precise flood extents only during the flooding, which means the actual flood extents cannot be determined beforehand. Railroad agencies need daily flood extent maps before rainfall events to manage and plan for the parts of the railroad network that will be impacted during each rainfall event. A new approach would involve using traditional flood-modeling layers and remotely sensed flood model outputs such as flood maps created using the Google Earth Engine. These new approaches will use machine-learning tools in flood prediction and extent mapping. This new approach will allow for determining the extent of flood for each rainfall event on a daily basis using rainfall forecast; therefore, flooding extents will be modeled before the actual flood, allowing railroad managers to plan for flood events pre-emptively. Two approaches were used: support vector machines and deep neural networks. Both methods were fine-tuned using grid-search cross-validation; the deep neural network model was chosen as the best model since it was computationally less expensive in training the model and had fewer type II errors or false negatives, which were the priorities for the flood modeling and would be suitable for developing the automated system for the entire railway corridor. The best deep neural network was then deployed and used to assess the extent of flooding for two floods in 2020 and 2022. The results indicate that the model accurately approximates the actual flooding extent and can predict flooding on a daily temporal basis using rainfall forecasts. Full article

In the domain of cognitive radio (CR), unlicensed users have the opportunity to efficiently use available spectrum bands without interfering with licensed primary users (PUs). Our study addresses the challenge of secondary user (SU) spectrum shortage due to high arrival rates of licensed users. We propose two models aimed at improving the average total waiting time for SUs in such scenarios. These models incorporate non-acquired and preemptive priority mechanisms within the M/D/1 model of a PU delay system. Through quantitative evaluations and Monte Carlo simulations, we evaluate the performance of these models. Our findings show significant improvements in average waiting time for both PUs and SUs, especially under the priority scheme. Furthermore, we explore these models in the context of real-time systems, considering the limited buffer capacity for both user types. This further improves the average waiting time for PUs and SUs in both priority schemes. Our contribution lies in providing effective solutions to mitigate SU shortages in CR networks, providing insight into priority-based approaches and real-time system considerations. Full article

The exponential growth in data traffic in the real world has drawn attention to the emerging computing technique called Fog Computing (FC) for offloading tasks in fault-free environments. This is a promising computing standard that offers higher computing benefits with a reduced cost, higher flexibility, and increased availability. With the increased number of tasks, the occurrence of faults increases and affects the offloading of tasks. A suitable mechanism is essential to rectify the faults that occur in the Fog network. In this research, the fault-tolerance (FT) mechanism is proposed based on cost optimization and fault minimization. Initially, the faulty nodes are identified based on the remaining residual energy with the proposed Priority Task-based Fault-Tolerance (PTFT) mechanism. The Minimum-Cost Neighbour Candidate Node Discovery (MCNCND) algorithm is proposed to discover the neighbouring candidate Fog access node that can replace the faulty Fog node. The Replication and Pre-emptive Forwarding (RPF) algorithm is proposed to forward the task information to the new candidate Fog access node for reliable transmission. These proposed mechanisms are simulated, analysed, and compared with existing FT methods. It is observed that the proposed FT mechanism improves the utilization of an active number of Fog access nodes. It also saved a residual energy of 1.55 J without replicas, compared to the 0.85 J of energy that is used without the FT method. Full article

With the development and popularization of Intelligent Transportation Systems (ITS), Vehicle Ad-Hoc Networks (VANETs) have attracted extensive attention as a key technology. In order to achieve real-time monitoring, VANET technology enables vehicles to collect real-time traffic updates through information collection devices and transmit this information to Roadside Units (RSUs), which are processed and integrated by an information processing center. However, high vehicle density leads to a conflict between minimizing the interval for vehicles to send Basic Safety Messages (BSMs) to RSUs and the limited communication resources of VANETs. To address this issue, we propose a MAC protocol based on the 802.11 CSMA/CA mechanism with the Preemptive-Resume Priority scheme. The arbitration device provides preemptive service to data packets with higher priority levels, thereby reducing data transmission delay. Moreover, queuing theory is employed to calculate the total delay for vehicles to send BSMs to a drone receiver, minimizing the BSM transmission interval and achieving minimal delay to meet safety driving requirements. The effectiveness and superiority of this mechanism and algorithm are demonstrated through simulation experiments. Full article

This paper presents a queuing system model that incorporates multiple priorities, multiple abandonments, and heterogeneous servers. Waiting for service easily leads to impatient behaviors. The impact of two kinds of impatient behaviors, balking and reneging, on queueing system performance is examined. The problem is formulated as continuous-time Markov chains. It also introduces a special state called the non-sojourn state to record the number of customers who abandon the system. The state transition rate matrix is transformed into a block tridiagonal matrix by appropriately setting the state numbers. A novel indicator called interstate transition frequency is proposed, which aids in distinguishing state transitions during the system evaluation process. Based on the interstate transition frequency, a set of indicators is derived to offer additional analytical perspectives for the queuing system. Finally, the proposed model is applied to an automobile repair shop to validate its effectiveness in practical scenarios. Full article

The Contention-Free (CF) policy has been extensively researched in the realm of real-time multi-processor scheduling due to its wide applicability and the performance enhancement benefits it provides to existing scheduling algorithms. The CF policy improves the feasibility of executing other real-time tasks by assigning the lowest priority to a task at a moment when it is guaranteed not to miss its deadline during the remaining execution time. Despite its effectiveness, existing studies on the CF policy are largely confined to preemptive scheduling, leaving the efficiency and applicability of limited preemption scheduling unexplored. Limited preemption scheduling permits a job to execute to completion with a limited number of preemptions, setting it apart from preemptive scheduling. This type of scheduling is crucial when preemption or migration overheads are either excessively large or unpredictable. In this paper, we introduce SP-CF, a single preemption scheduling approach that incorporates the CF policy. SP-CF allows a preemption only once during each job’s execution, following a priority demotion under the CF policy. We also propose a new schedulability analysis method for SP-CF to determine whether each task is executed in a timely manner and without missing its deadline. Through simulation experiments, we demonstrate that SP-CF can significantly enhance the schedulability of the traditional rate-monotonic algorithm and the earliest deadline first algorithm. Full article

African swine fever (ASF) is a highly contagious disease affecting domestic pigs and wild boars, with no effective vaccine or treatment available. In South Korea, extensive measures have been implemented to prevent ASF transmission between wild boars and ASF spillover from wild boars to pig farm sectors, including the search for ASF-infected carcasses in mountainous forests and the installation of fences across wide areas of these forests. To determine the priority search range for infected carcasses and establish pig farm-centered quarantine measures, it is necessary to predict the specific path of ASF outbreaks in wild boars and identify pig farms at high risk of ASF spillover from wild boars. Here, we aimed to predict suitable areas and geographical paths for ASF outbreaks in wild boars using the MaxEnt model and shortest-path betweenness centrality analysis. The analysis identified a high frequency of ASF outbreaks in areas with a suitability value ≥0.4 on the suitability map and in areas within a 1.8 km range from the path on the shortest-path map, indicating these areas were high-risk zones for ASF outbreaks. Among the 5063 pig farms analyzed, 37 were in the high-risk zone on the suitability map, 499 were in the high-risk zone on the shortest-path map, and 9 were in both risk zones. Of the 51 pig farm sectors with a dense distribution of pig farms (kernel density ≥ 8), 25 sectors were in contact with or partially overlapped the high risk zone on the suitability map, 18 sectors were located within the high risk zone on the shortest-path map, and 14 sectors were located within both risk zones. These findings aided in determining the priority range for searches for wild boar carcasses and enabled the establishment of preemptive ASF prevention measures around the pig farming sectors that are at risk of ASF spillover from wild boars. Full article

This work considers a preemptive priority queueing system with vacation, where the single server may break down with imperfect coverage. Various combinations of server vacation priority queueing models have been studied by many scholars. A common assumption in these models is that the server will only resume its normal service rate after the vacation is over. However, such speculation is more limited in real-world situations. Hence, in this study, the vacation will be interrupted if a customer waits for service in the system at the moment of completion of service during vacation. The stationary probability distribution is derived by using the probability generating function approach. We also develop varieties of performance measures and provide a simple numerical example to illustrate these measures. Optimization analysis is finally carried out, including cost optimization and tri-object optimization. Full article

Background: Ventilator-associated lower respiratory tract infectious complications in critically ill patients cover a wide spectrum of one disease process (respiratory infection), initiating from tracheal tube and/or tracheobronchial colonization, to ventilator associated tracheobronchitis (VAT) and ventilator-associated pneumonia (VAP). VAP occurence has been associated with increased intensive care unit (ICU) morbidity (ventilator days, as well as length of ICU and hospital stay) and ICU mortality. Therefore, treatments that aim at VAP/VAT incidence reduction are a high priority. Aim: The aim of the present review is to discuss the current literature concerning two major aspects: (a) can aerosolized antibiotics (AA) administered in a pre-emptive way prevent the occurrence of ventilator-associated infections? and (b) can VAT treatment with aerosolized avert the potential evolution to VAP? Results: There were identified eight studies that provided data on the use of aerosolized antibiotics for the prevention of VAT/VAP. Most of them report favorable data on reducing the colonisation rate and the progression to VAP/VAT. Another four studies dealt with the treatment of VAT/VAP. The results support the decrease in the incidence to VAP transition and/or the improvement in signs and symptoms of VAP. Moreover, there are concise reports on higher cure rates and microbiological eradication in patients treated with aerosolized antibiotics. Yet, differences in the delivery modality adopted and resistance emergence issues preclude the generalisability of the results. Conclusion: Aerosolized antibiotic therapy can be used to manage ventilator-associated infections, especially those with difficult to treat resistance. The limited clinical data raise the need for large randomized controlled trials to confirm the benefits of AA and to evaluate the impact on antibiotic selection pressure. Full article

Fifth-generation (5G) New Radio (NR) systems are expected to support multiple traffic classes including enhanced mobile broadband (eMBB), ultra-reliable low-latency communications (URLLC), and massive machine-type communications (mMTC) at the same air interface. This functionality is assumed to be implemented by utilizing the network slicing concept. According to the 3rd Generation Partnership Project (3GPP), the efficient support of this feature requires statistical multiplexing and, at the same time, traffic isolation between slices. In this paper, we formulate and solve a mathematical model for a class of Radio Access Network (RAN) slicing algorithms that simultaneously include resource reservation and a priority-based service discipline allowing us to incur fine granularity in the service processes of different traffic aggregates. The system is based on a queueing model and allows parametrization by accounting for the specifics of wireless channel impairments. As metrics of interest, we utilize K-class session drop probability, K-class session pre-emption probability, and system resource utilization. To showcase the capabilities of the model, we also compare performance guarantees provided for URLLC, eMBB, and mMTC traffic when multiplexed over the same NR radio interface. Our results demonstrate that the performance trade-off is dictated by the offered traffic load of the highest priority sessions: (i) when it is small, mixed reservation/priority scheme outperforms the full reservation mechanism; (ii) for overloaded conditions, full reservations provides better traffic isolation. The mixed strategy is beneficial to traffic aggregates with short-lived lightweight sessions, such as URLLC and mMTC, while the reservation only scheme works better for elastic eMBB traffic. The most important feature is that the mixed strategy allows resource utilization to be improved up to 95%, which is 10–15% higher compared to the reservation-only scheme while still providing isolation between traffic types. Full article