Search Results (16)

The increasing application of underwater robotic systems in deep-sea exploration, inspection, and resource extraction has created a strong demand for reliable visual perception under challenging conditions. However, image quality is severely degraded in low-light underwater environments due to the combined effects of light absorption and scattering, resulting in color imbalance, low contrast, and illumination instability. These factors limit the effectiveness of visual-based autonomous operations. We propose ATS-UGAN, a Dual-domain Adaptive Synergy Generative Adversarial Network for low-light underwater image enhancement to confront the above issues. The network integrates Multi-scale Hybrid Attention (MHA) that synergizes spatial and frequency domain representations to capture key image features adaptively. An Adaptive Parameterized Convolution (AP-Conv) module is introduced to handle non-uniform scattering by dynamically adjusting convolution kernels through a multi-branch design. In addition, a Dynamic Content-aware Markovian Discriminator (DCMD) is employed to perceive the dual-domain information synergistically, enhancing image texture realism and improving color correction. Extensive experiments on benchmark underwater datasets demonstrate that ATS-UGAN surpasses state-of-the-art approaches, achieving 28.7/0.92 PSNR/SSIM on EUVP and 28.2/0.91 on UFO-120. Additional reference and no-reference metrics further confirm the improved visual quality and realism of the enhanced images. Full article

This paper presents an optimization model for wireless channel allocation in cellular networks, specifically designed for the transmission of smart meter (SM) data through a mobile virtual network operator (MVNO). The model efficiently allocates transmission channels, minimizing smart grid (SG) costs. The MVNO manages fixed and random channels through a shared access scheme, optimizing meter connectivity. Channel allocation is based on a Markovian approach and optimized through the Hungarian algorithm that minimizes the weight in a bipartite network between meters and channels. In addition, cumulative tokens are introduced that weight transmissions according to channel availability and network congestion. Simulations show that dynamic allocation in virtual networks improves transmission performance, contributing to sustainability and cost reduction in cellular networks. This study highlights the importance of inefficient resource management by cognitive mobile virtual network and cognitive radio virtual network operators (C-MVNOs), laying a solid foundation for future applications in intelligent networks. This work is motivated by the increasing demand for efficient and scalable data transmission in smart metering systems. The novelty lies in integrating cumulative tokens and a Markovian-based bipartite graph matching algorithm, which jointly optimize channel allocation and transmission reliability under heterogeneous wireless conditions. Full article

This study considers an application of the first-order Grey Markov Model to foresee the values of Italian power generation in relation to the available energy sources. The model is used to fit data from the Italian energy system from 2000 to 2022. The integration of Markovian error introduces a random element to the model, which is able now to capture inherent uncertainties and misalignments between the Grey Model predictions and the real data. This application provides valuable insights for strategic planning in the energy sector and future developments. The results show good accuracy of the predictions, which could provide powerful information for the effective implementation of energy policies concerning the evolution of energy demand in the country. Results show an improvement in the performance of more than 50% in terms of Root Mean Squared Error (RMSE) when the Markov chain is integrated in the analysis. Despite advancements, Italy’s 2032 energy mix will still significantly rely on fossil fuels, emphasizing the need for sustained efforts beyond 2032 to enhance sustainability. Full article

Heterogeneous systems of limited capacity have general applications in manufacturing, but also in logistic or service systems due to the differences in server or workstation performance or work assignment; this is in close relationship with system flexibility, where saturation and blocking are ordinary situations of systems with high demand and limited capacity, and thus, accurate loss quantification is essential for performance evaluation. Multi-class systems of limited capacity have been studied much less than parallel homogeneous systems (Erlang models). In this context, accurate models for parallel heterogeneous ordered-entry systems were developed: without any prior queue, i.e., M/Mi/c/c, and with a k-capacity queue, i.e., M/Mi/c/c + k. These new matrix models gave an exact state formulation, and their accuracy was verified using discrete event simulation and comparison with literature results. Also, the effect of the queue capacity was studied in relationship to the pattern of service rates. Next, the heterogeneous recirculating system model was also developed with good approximation results. Finally, the proposed models were applied to evaluate systems with non-exponential service times using a new hybrid methodology by combining the Markovian model and the Monte Carlo method (MCM) for normal or lognormal service times, which also yielded useful good approximations to the simulated system. Full article

Due to its flexibility and versatility, the electric distributed drive micro-tillage chassis can be used more often in the future in Intelligence agriculture scenarios. However, due to the complex working conditions of the agricultural operation environment, it is a challenging task to distribute the torque demand of four wheels reasonably and effectively. In this paper, we propose a drive torque allocation strategy based on deep reinforcement learning to ensure straight-line retention and energy saving, using a distributed electric traction chassis for greenhouses as the research object. The torque assignment strategy can be represented as a Markovian decision process, and the approximate action values and policy functions are obtained through an Actor–Critic network, and the Twin Delayed Deep Deterministic Policy Gradient (TD3) is used to incorporate the vehicle straight-line retention rate into the cumulative reward to reduce energy consumption. The training results under plowing working conditions show that the proposed strategy has a better straight-line retention rate. For typical farming operation conditions, the proposed control strategy significantly improves the energy utilization and reduces the energy by 10.5% and 3.7% compared to the conventional average torque (CAT) distribution strategy and Deep Deterministic Policy Gradient (DDPG) algorithm, respectively. Finally, the real-time executability of the proposed torque distribution strategy is verified by Soil-tank experiments. The TD3 algorithm used in this study has stronger applicability than the traditional control algorithm in dealing with continuous control problems, and provides a research basis for the practical application of intelligent control algorithms in future greenhouse micro-tillage chassis drive control strategies. Full article

Nowadays, high-performance audio communication devices demand superior audio quality. To improve the audio quality, several authors have developed acoustic echo cancellers based on particle swarm optimization algorithms (PSO). However, its performance is reduced significantly since the PSO algorithm suffers from premature convergence. To overcome this issue, we propose a new variant of the PSO algorithm based on the Markovian switching technique. Furthermore, the proposed algorithm has a mechanism to dynamically adjust the population size over the filtering process. In this way, the proposed algorithm exhibits great performance by reducing its computational cost significantly. To adequately implement the proposed algorithm in a Stratix IV GX EP4SGX530 FPGA, we present for the first time, the development of a parallel metaheuristic processor, in which each processing core simulates the different number of particles by using the time-multiplexing technique. In this way, the variation of the size of the population can be effective. Therefore, the properties of the proposed algorithm along with the proposed parallel hardware architecture potentially allow the development of high-performance acoustic echo canceller (AEC) systems. Full article

The use of a Markovian inventory system is a critical part of inventory management. The purpose of this study is to examine the demand for two commodities in a Markovian inventory system, one of which is designated as a major item (Commodity-I) and the other as a complimentary item (Commodity-II). Demand arrives according to a Poisson process, and service time is exponential at a queue-dependent rate. We investigate a strategy of $(s,Q)$ type control for commodity-I with a random lead time but instantaneous replenishment for commodity-II. If the waiting hall reaches its maximum capacity of N, any arriving primary client may enter an infinite capacity orbit with a specified ratio. For orbiting consumers, the classical retrial policy is used. In a steady-state setting, the joint probability distributions for commodities and the number of demands in the queue and the orbit, are derived. From this, we derive a waiting time analysis and a variety of system performance metrics in the steady-state. Additionally, the physical properties of various performance measures are evaluated using various numerical assumptions associated with diverse stochastic behaviours. Full article

This research analyses the performance of a perishable queueing-inventory system for two commodities with optional customers demands. We assume in the article that all customers who come to the system can only purchase the first item or the second item or service (they do not purchase both items). This is the original aspect of the paper. We show the significance of the impact of optional demands on the system’s performance, which is the purpose of the paper. In this system, customers arrive, using the Markovian arrival process (MAP), to a demand for a single unit. The system is composed of a waiting hall with a limited capacity of F. The arriving customer observes the waiting hall is filled to capacity or the stock stage is zero, and they decide to leave the system. In the steady-state case, the joint probability distribution for the first commodity, the second commodity, and the number of customers in the system are computed using matrix geometric methods. We evaluate diverse system performance measures. Finally, we provide a numerical illustration of the optimal value for diverse parameters of the system, which highlights the results and implications of the article. Full article

The present study deals with the stock-dependent Markovian demand of a retrial queueing system with a single server and multiple server vacation. The items are restocked under a continuous review $(s,Q)$ ordering policy. When there is no item in the system, the server goes on vacation. Further, any arrival demand permits entry into an infinite orbit whenever the server is on vacation. In the Matrix geometric approach with the Neuts-Rao truncation technique, the steady-state joint distribution of the number of customers in orbit, the server status, and the inventory level is obtained. Under the steady-state conditions, some significant system performance measures, including the long-run total cost rate, are derived, and the Laplace-Stieltjes transform is also used to investigate the waiting time distribution. According to various considerations of uncontrollable parameters and costs, the merits of the proposed model, especially the important characteristics of the system with stock dependency over non-stock dependency, are explored. Ultimately, the important facts and ideas behind this model are given in conclusion. Full article

We consider a queueing inventory with one essential and m optional items for sale. The system evolves in environments that change randomly. There are n environments that appear in a random fashion governed by a Marked Markovian Environment change process. Customers demand the main item plus none, one, or more of the optional items, but were restricted to at most one unit of each optional item. Service time of the main item is phase type distributed and that of optional items have exponential distributions with parameters that depend on the type of the item, as well as the environment under consideration. If the essential item is not available, service will not be provided. The lead times of optional and main items have exponential distributions having parameters that depend on the type of the item. The condition for stability of the system is analyzed by considering a multi-dimensional continuous time Markov chain that represent the evolution of the system. Under this condition, various performance characteristics of the system are derived. In terms of these, a cost function is constructed and optimal control policies of the different types of commodities are investigated. Numerical results are provided to give a glimpse of the system performance. Full article

To solve the problems of bus bunching and large gaps, this study combines bus holding and speed adjusting to alleviate them respectively considering the characteristics of passenger’s perceived waiting time. The difference between passenger’s perceived waiting time at stops and actual time is described quantitatively through the expected waiting time of passengers. Bus holding based on a threshold method is implemented at any stops for bunching buses, and speed adjusting based on a Markovian decision model is implemented at limited stops for lagging buses. Simulations based on real data of a bus route show that the integrated control strategy is able to improve the service reliability and to decrease passengers’ perceived waiting time at stops. Several insights have been uncovered through performance analysis: (1) The increase of holding control strength results in improvement of the headway regularity, and leads to a greater perceived waiting time though; (2) Compared to traveling freely, suitable speed guidance will not slow down the average cruising speed in the trip; (3) The scale of passenger demand and through passengers are the two key factors influencing whether a stop should be selected as a speed-adjusting control point. Full article

Combining the study of queuing with inventory is very common and such systems are referred to as queuing-inventory systems in the literature. These systems occur naturally in practice and have been studied extensively in the literature. The inventory systems considered in the literature generally include $(s,S)$-type. However, in this paper we look at opportunistic-type inventory replenishment in which there is an independent point process that is used to model events that are called opportunistic for replenishing inventory. When an opportunity (to replenish) occurs, a probabilistic rule that depends on the inventory level is used to determine whether to avail it or not. Assuming that the customers arrive according to a Markovian arrival process, the demands for inventory occur in batches of varying size, the demands require random service times that are modeled using a continuous-time phase-type distribution, and the point process for the opportunistic replenishment is a Poisson process, we apply matrix-analytic methods to study two of such models. In one of the models, the customers are lost when at arrivals there is no inventory and in the other model, the customers can enter into the system even if the inventory is zero but the server has to be busy at that moment. However, the customers are lost at arrivals when the server is idle with zero inventory or at service completion epochs that leave the inventory to be zero. Illustrative numerical examples are presented, and some possible future work is highlighted. Full article

The imbalanced distribution of shared bikes in the dockless bike-sharing system (a typical example of the resource-sharing system), which may lead to potential customer churn and lost profit, gradually becomes a vital problem for bike-sharing firms and their users. To resolve the problem, we first formulate the bike-sharing system as a Markovian queueing network with higher-demand nodes and lower-demand nodes, which can provide steady-state probabilities of having a certain number of bikes at one node. A model reduction method is then designed to reduce the complexity of the proposed model. Subsequently, we adopt an operator-based relocation strategy to optimize the reduced network. The objective of the optimization model is to maximize the total profit and act as a decision-making tool for operators to determine the optimal relocation frequency. The results reveal that it is possible for most of the shared bikes to gather at one low-demand node eventually in the long run under the influence of the various arrival rates at different nodes. However, the decrease of the number of bikes at the high-demand nodes is more sensitive to the unequal demands, especially when the size of the network and the number of bikes in the system are large. It may cause a significant loss for operators, to which they should pay attention. Meanwhile, different estimated values of parameters related with revenue and cost affect the optimization results differently. Full article

We present a comprehensive numerical approach with reasonably light complexity in terms of implementation and computation for assessing the performance of hybrid make-to-stock (MTS)/make-to-order (MTO) systems. In such hybrid systems, semi-finished products are produced up front and stored in a decoupling inventory. When an order arrives, the products are completed and possibly customised. We study this system in a stochastic setting: demand and production are modelled by random processes. In particular, our model includes two coupled Markovian queues: one queue represents the decoupling inventory and the other the order backlog. These queues are coupled as order processing can only occur when both queues are non-empty. We rely on matrix analytic techniques to study the performance of the MTO/MTS system under non-restrictive stochastic assumptions. In particular, we allow for arrival correlation and non-exponential setup and MTS and MTO processing times, while the hybrid MTS/MTO system is managed by an $(s,S)$-type threshold policy that governs switching from MTO to MTS and back. By some numerical examples, we assess the impact of inventory control, irregular order arrivals, setup and order processing times on inventory levels and lead times. Full article

Designing the crossroads capacity is a prerequisite for achieving a high level of service with the same sustainability in stochastic traffic flow. Also, modeling of crossroad capacity can influence on balancing (symmetry) of traffic flow. Loss of priority in a left turn and optimal dimensioning of shared-short line is one of the permanent problems at intersections. A shared–short lane for taking a left turn from a priority direction at unsignalized intersections with a homogenous traffic flow and heterogeneous demands is a two-phase queueing system requiring a first in–first out (FIFO) service discipline and single-server service facility. The first phase (short lane) of the system is the queueing system M(pλ)/M(μ)/1/∞, whereas the second phase (shared lane) is a system with a binomial distribution service. In this research, we explicitly derive the probability of the state of a queueing system with a short lane of a finite capacity for taking a left turn and shared lane of infinite capacity. The presented formulas are under the presumption that the system is Markovian, i.e., the vehicle arrivals in both the minor and major streams are distributed according to the Poisson law, and that the service of the vehicles is exponentially distributed. Complex recursive operations in the two-phase queueing system are explained and solved in manuscript. Full article