Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (42)

Search Parameters:
Keywords = semi-Markov chain

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
26 pages, 2081 KiB  
Article
Tariff-Sensitive Global Supply Chains: Semi-Markov Decision Approach with Reinforcement Learning
by Duygu Yilmaz Eroglu
Systems 2025, 13(8), 645; https://doi.org/10.3390/systems13080645 - 1 Aug 2025
Viewed by 193
Abstract
Global supply chains often face uncertainties in production lead times, fluctuating exchange rates, and varying tariff regulations, all of which can significantly impact total profit. To address these challenges, this study formulates a multi-country supply chain problem as a Semi-Markov Decision Process (SMDP), [...] Read more.
Global supply chains often face uncertainties in production lead times, fluctuating exchange rates, and varying tariff regulations, all of which can significantly impact total profit. To address these challenges, this study formulates a multi-country supply chain problem as a Semi-Markov Decision Process (SMDP), integrating both currency variability and tariff levels. Using a Q-learning-based method (SMART), we explore three scenarios: (1) wide currency gaps under a uniform tariff, (2) narrowed currency gaps encouraging more local sourcing, and (3) distinct tariff structures that highlight how varying duties can reshape global fulfillment decisions. Beyond these baselines we analyze uncertainty-extended variants and targeted sensitivities (quantity discounts, tariff escalation, and the joint influence of inventory holding costs and tariff costs). Simulation results, accompanied by policy heatmaps and performance metrics, illustrate how small or large shifts in exchange rates and tariffs can alter sourcing strategies, transportation modes, and inventory management. A Deep Q-Network (DQN) is also applied to validate the Q-learning policy, demonstrating alignment with a more advanced neural model for moderate-scale problems. These findings underscore the adaptability of reinforcement learning in guiding practitioners and policymakers, especially under rapidly changing trade environments where exchange rate volatility and incremental tariff changes demand robust, data-driven decision-making. Full article
(This article belongs to the Special Issue Modelling and Simulation of Transportation Systems)
Show Figures

Figure 1

26 pages, 11207 KiB  
Article
Glacier, Wetland, and Lagoon Dynamics in the Barroso Mountain Range, Atacama Desert: Past Trends and Future Projections Using CA-Markov
by German Huayna, Edwin Pino-Vargas, Jorge Espinoza-Molina, Carolina Cruz-Rodríguez, Fredy Cabrera-Olivera, Lía Ramos-Fernández, Bertha Vera-Barrios, Karina Acosta-Caipa and Eusebio Ingol-Blanco
Hydrology 2025, 12(3), 64; https://doi.org/10.3390/hydrology12030064 - 20 Mar 2025
Cited by 1 | Viewed by 1047
Abstract
Glacial retreat is a major global challenge, particularly in arid and semi-arid regions where glaciers serve as critical water sources. This research focuses on glacial retreat and its impact on land cover and land use changes (LULC) in the Barroso Mountain range, Tacna, [...] Read more.
Glacial retreat is a major global challenge, particularly in arid and semi-arid regions where glaciers serve as critical water sources. This research focuses on glacial retreat and its impact on land cover and land use changes (LULC) in the Barroso Mountain range, Tacna, Peru, which is a critical area for water resources in the hyperarid Atacama Desert. Employing advanced remote sensing techniques through the Google Earth Engine (GEE) cloud computing platform, we analyzed historical trends (1985–2022) using Landsat satellite imagery. A normalized index classification was carried out to generate LULC maps for the years 1986, 2001, 2012, and 2022. Future projections until 2042 were developed using Cellular Automata–Markov (CA–Markov) modeling in QGIS, incorporating six predictive environmental variables. The resulting maps presented an overall accuracy (OA) greater than 83%. Historical analysis revealed a dramatic glacier reduction from 44.7 km2 in 1986 to 7.4 km2 in 2022. In contrast, wetlands expanded substantially from 5.70 km2 to 12.14 km2, indicating ecosystem shifts potentially driven by glacier meltwater availability. CA–Markov chain modeling projected further glacier loss to 3.07 km2 by 2042, while wetlands are expected to expand to 18.8 km2 and bodies of water will reach 4.63 km2. These future projections (with accuracies above 84%) underline urgent implications for water management, environmental sustainability, and climate adaptation strategies, particularly with regard to downstream hydrological risks and ecosystem resilience. Full article
Show Figures

Figure 1

24 pages, 2642 KiB  
Article
Mixed Student’s T-Distribution Regression Soft Measurement Model and Its Application Based on VI and MCMC
by Qirui Li, Cuixian Li, Zhiping Peng, Delong Cui and Jieguang He
Processes 2025, 13(3), 861; https://doi.org/10.3390/pr13030861 - 14 Mar 2025
Viewed by 614
Abstract
The conventional diagnostic techniques for ethylene cracker furnace tube coking rely on manual expertise, offline analysis and on-site inspection. However, these methods have inherent limitations, including prolonged inspection times, low accuracy and poor real-time performance. This makes it challenging to meet the requirements [...] Read more.
The conventional diagnostic techniques for ethylene cracker furnace tube coking rely on manual expertise, offline analysis and on-site inspection. However, these methods have inherent limitations, including prolonged inspection times, low accuracy and poor real-time performance. This makes it challenging to meet the requirements of chemical production. The necessity for high efficiency, high reliability and high safety, coupled with the inherent complexity of the production process, results in data that is characterized by multimodal, nonlinear, non-Gaussian and strong noise. This renders the traditional data processing and analysis methods ineffective. In order to address these issues, this paper puts forth a novel soft measurement approach, namely the ‘Mixed Student’s t-distribution regression soft measurement model based on Variational Inference (VI) and Markov Chain Monte Carlo (MCMC)’. The initial variational distribution is selected during the initialization step of VI. Subsequently, VI is employed to iteratively refine the distribution in order to more closely approximate the true posterior distribution. Subsequently, the outcomes of VI are employed to initiate the MCMC, which facilitates the placement of the iterative starting point of the MCMC in a region that more closely approximates the true posterior distribution. This approach allows the convergence process of MCMC to be accelerated, thereby enabling a more rapid approach to the true posterior distribution. The model integrates the efficiency of VI with the accuracy of the MCMC, thereby enhancing the precision of the posterior distribution approximation while preserving computational efficiency. The experimental results demonstrate that the model exhibits enhanced accuracy and robustness in the diagnosis of ethylene cracker tube coking compared to the conventional Partial Least Squares Regression (PLSR), Gaussian Process Regression (GPR), Gaussian Mixture Regression (GMR), Bayesian Student’s T-Distribution Mixture Regression (STMR) and Semi-supervised Bayesian T-Distribution Mixture Regression (SsSMM). This method provides a scientific basis for optimizing and maintaining the ethylene cracker, enhancing its production efficiency and reliability, and effectively addressing the multimodal, non-Gaussian distribution and uncertainty of the coking data of the ethylene cracker furnace tube. Full article
(This article belongs to the Section Chemical Processes and Systems)
Show Figures

Figure 1

16 pages, 9480 KiB  
Article
Assessing Climate and Land-Use Change Scenarios on Future Desertification in Northeast Iran: A Data Mining and Google Earth Engine-Based Approach
by Weibo Yin, Qingfeng Hu, Jinping Liu, Peipei He, Dantong Zhu and Abdolhossein Boali
Land 2024, 13(11), 1802; https://doi.org/10.3390/land13111802 - 31 Oct 2024
Viewed by 1307
Abstract
Desertification poses a significant threat to dry and semi-arid regions worldwide, including Northeast Iran. This study investigates the impact of future climate and land-use changes on desertification in this region. Six remote sensing indices were selected to model desertification using four machine learning [...] Read more.
Desertification poses a significant threat to dry and semi-arid regions worldwide, including Northeast Iran. This study investigates the impact of future climate and land-use changes on desertification in this region. Six remote sensing indices were selected to model desertification using four machine learning algorithms: Random Forest (RF), Support Vector Machine (SVM), Gradient Boosting Machine (GBM), and Generalized Linear Models (GLM). To enhance the model’s reliability, an ensemble model was employed. Future climate and land-use scenarios were projected using the CNRM-CM6 model and Markov chain analysis, respectively. Results indicate that the RF and SVM models performed best in mapping current desertification patterns. The ensemble model highlights a 2% increase in decertified areas by 2040, primarily in the northwestern regions. The study underscores the importance of land-use change and climate change in driving desertification and emphasizes the need for sustainable land management practices and climate change adaptation strategies to mitigate future impacts. Full article
Show Figures

Figure 1

19 pages, 602 KiB  
Article
Workflow Trace Profiling and Execution Time Analysis in Quantitative Verification
by Guoxin Su and Li Liu
Future Internet 2024, 16(9), 319; https://doi.org/10.3390/fi16090319 - 3 Sep 2024
Cited by 1 | Viewed by 1304
Abstract
Workflows orchestrate a collection of computing tasks to form a complex workflow logic. Different from the traditional monolithic workflow management systems, modern workflow systems often manifest high throughput, concurrency and scalability. As service-based systems, execution time monitoring is an important part of maintaining [...] Read more.
Workflows orchestrate a collection of computing tasks to form a complex workflow logic. Different from the traditional monolithic workflow management systems, modern workflow systems often manifest high throughput, concurrency and scalability. As service-based systems, execution time monitoring is an important part of maintaining the performance for those systems. We developed a trace profiling approach that leverages quantitative verification (also known as probabilistic model checking) to analyse complex time metrics for workflow traces. The strength of probabilistic model checking lies in the ability of expressing various temporal properties for a stochastic system model and performing automated quantitative verification. We employ semi-Makrov chains (SMCs) as the formal model and consider the first passage times (FPT) measures in the SMCs. Our approach maintains simple mergeable data summaries of the workflow executions and computes the moment parameters for FPT efficiently. We describe an application of our approach to AWS Step Functions, a notable workflow web service. An empirical evaluation shows that our approach is efficient for computer high-order FPT moments for sizeable workflows in practice. It can compute up to the fourth moment for a large workflow model with 10,000 states within 70 s. Full article
Show Figures

Figure 1

18 pages, 341 KiB  
Article
On a Mixed Transient–Asymptotic Result for the Sequential Interval Reliability for Semi-Markov Chains
by Guglielmo D’Amico and Thomas Gkelsinis
Mathematics 2024, 12(12), 1842; https://doi.org/10.3390/math12121842 - 13 Jun 2024
Cited by 3 | Viewed by 825
Abstract
In this paper, we are concerned with the study of sequential interval reliability, a measure recently introduced in the literature. This measure represents the probability of the system working during a sequence of nonoverlapping time intervals. In the cited work, the authors proposed [...] Read more.
In this paper, we are concerned with the study of sequential interval reliability, a measure recently introduced in the literature. This measure represents the probability of the system working during a sequence of nonoverlapping time intervals. In the cited work, the authors proposed a recurrent-type formula for computing this indicator in the transient case and investigated the asymptotic behavior as all the time intervals go to infinity. The purpose of the present work is to further explore the asymptotic behavior when only some of the time intervals are allowed to go to infinity while the remaining ones are not. In this way, we provide a unique indicator that is able to describe the process evolution in the transient and asymptotic cases as well. It is important to mention that this is not a straightforward result since, in order to achieve it, we need to develop several mathematical ingredients that generalize the classical renewal and Markov renewal frameworks. A numerical example illustrates our theoretical results. Full article
Show Figures

Figure 1

14 pages, 325 KiB  
Article
Attainability for Markov and Semi-Markov Chains
by Brecht Verbeken and Marie-Anne Guerry
Mathematics 2024, 12(8), 1227; https://doi.org/10.3390/math12081227 - 19 Apr 2024
Cited by 2 | Viewed by 1201
Abstract
When studying Markov chain models and semi-Markov chain models, it is useful to know which state vectors n, where each component ni represents the number of entities in the state Si, can be maintained or attained. This question leads [...] Read more.
When studying Markov chain models and semi-Markov chain models, it is useful to know which state vectors n, where each component ni represents the number of entities in the state Si, can be maintained or attained. This question leads to the definitions of maintainability and attainability for (time-homogeneous) Markov chain models. Recently, the definition of maintainability was extended to the concept of state reunion maintainability (SR-maintainability) for semi-Markov chains. Within the framework of semi-Markov chains, the states are subdivided further into seniority-based states. State reunion maintainability assesses the maintainability of the distribution across states. Following this idea, we introduce the concept of state reunion attainability, which encompasses the potential of a system to attain a specific distribution across the states after uniting the seniority-based states into the underlying states. In this paper, we start by extending the concept of attainability for constant-sized Markov chain models to systems that are subject to growth or contraction. Afterwards, we introduce the concepts of attainability and state reunion attainability for semi-Markov chain models, using SR-maintainability as a starting point. The attainable region, as well as the state reunion attainable region, are described as the convex hull of their respective vertices, and properties of these regions are investigated. Full article
Show Figures

Figure 1

23 pages, 1126 KiB  
Article
Bayesian Feature Extraction for Two-Part Latent Variable Model with Polytomous Manifestations
by Qi Zhang, Yihui Zhang and Yemao Xia
Mathematics 2024, 12(5), 783; https://doi.org/10.3390/math12050783 - 6 Mar 2024
Viewed by 1485
Abstract
Semi-continuous data are very common in social sciences and economics. In this paper, a Bayesian variable selection procedure is developed to assess the influence of observed and/or unobserved exogenous factors on semi-continuous data. Our formulation is based on a two-part latent variable model [...] Read more.
Semi-continuous data are very common in social sciences and economics. In this paper, a Bayesian variable selection procedure is developed to assess the influence of observed and/or unobserved exogenous factors on semi-continuous data. Our formulation is based on a two-part latent variable model with polytomous responses. We consider two schemes for the penalties of regression coefficients and factor loadings: a Bayesian spike and slab bimodal prior and a Bayesian lasso prior. Within the Bayesian framework, we implement a Markov chain Monte Carlo sampling method to conduct posterior inference. To facilitate posterior sampling, we recast the logistic model from Part One as a norm-type mixture model. A Gibbs sampler is designed to draw observations from the posterior. Our empirical results show that with suitable values of hyperparameters, the spike and slab bimodal method slightly outperforms Bayesian lasso in the current analysis. Finally, a real example related to the Chinese Household Financial Survey is analyzed to illustrate application of the methodology. Full article
(This article belongs to the Special Issue Multivariate Statistical Analysis and Application)
Show Figures

Figure 1

25 pages, 316 KiB  
Article
A Two-Server Queue with Interdependence between Arrival and Service Processes
by Sindhu S, Achyutha Krishnamoorthy and Dmitry Kozyrev
Mathematics 2023, 11(22), 4692; https://doi.org/10.3390/math11224692 - 18 Nov 2023
Cited by 2 | Viewed by 2801
Abstract
In this paper, we analyse a queueing system with two servers where the arrival and service processes are interdependent. The evolution of these processes is governed by transitions on the product space of three Markov chains, which are descriptors of the arrival and [...] Read more.
In this paper, we analyse a queueing system with two servers where the arrival and service processes are interdependent. The evolution of these processes is governed by transitions on the product space of three Markov chains, which are descriptors of the arrival and service processes. The transitions in this Markov chain follow a semi-Markov rule and the exponential distribution governs the sojourn times in the states. The stability condition of the system is derived and the stationary distribution is calculated for the system in equilibrium. Several important performance measures are provided, and numerical illustrations of the model are presented. Full article
16 pages, 1920 KiB  
Article
Investigation of the Information Interaction of the Sensor Network End IoT Device and the Hub at the Transport Protocol Level
by Viacheslav Kovtun, Krzysztof Grochla and Konrad Połys
Electronics 2023, 12(22), 4662; https://doi.org/10.3390/electronics12224662 - 15 Nov 2023
Cited by 9 | Viewed by 1665
Abstract
The study examines the process of information transfer between the sensor network end IoT device and the hub at the transport protocol level focused on using the 5G platform. The authors interpreted the researched process as a semi-Markov (focused on the dynamics of [...] Read more.
The study examines the process of information transfer between the sensor network end IoT device and the hub at the transport protocol level focused on using the 5G platform. The authors interpreted the researched process as a semi-Markov (focused on the dynamics of the size of the protocol sliding window) process with two nested Markov chains (the first characterizes the current size of the sliding window, and the second, the number of data blocks sent at the current value of this characteristic). As a result, a stationary distribution of the size of the sliding window was obtained both for the resulting semi-Markov process and for nested Markov chains, etc. A recursive approach to the calculation of the mentioned stationary distribution is formalized. This approach is characterized by linear computational complexity. Based on the obtained stationary distribution of the size of the sliding window, a distribution function is formulated that characterizes the bandwidth of the communication channel between the entities specified in the research object. Using the resulting mathematical apparatus, the Window Scale parameter of the TCP Westwood+ protocol was tuned. Testing has shown the superiority of the modified protocol over the basic versions of the BIC TCP, TCP Vegas, TCP NewReno, and TCP Veno protocols in conditions of data transfer between two points in the wireless sensor network environment. Full article
Show Figures

Figure 1

30 pages, 489 KiB  
Article
Pricing Variance Swaps under MRG Model with Regime-Switching: Discrete Observations Case
by Anqi Zou, Jiajie Wang and Chiye Wu
Mathematics 2023, 11(12), 2730; https://doi.org/10.3390/math11122730 - 16 Jun 2023
Cited by 1 | Viewed by 3721
Abstract
In this paper, we creatively price the discretely sampled variance swaps under the mean-reverting Gaussian model (MRG model in short) with regime-switching asymmetric double exponential jump diffusion. We extend the traditional MRG model by further considering the trend of the financial market as [...] Read more.
In this paper, we creatively price the discretely sampled variance swaps under the mean-reverting Gaussian model (MRG model in short) with regime-switching asymmetric double exponential jump diffusion. We extend the traditional MRG model by further considering the trend of the financial market as well as a sudden and unexpected event of the market. This new model is meaningful because it uses observable Markov chains that represent market states to adjust its parameters, which helps capture the movement of the market and fluctuations in asset prices. By utilizing the characteristic function and the conditional transition characteristic function, we obtain analytical solutions for pricing formulae. Note that this is our first effort to provide the analytical solution for the ordinary differential equations satisfied by the Feynman–Kac theorem. To achieve this, we have developed a new methodology in Proposition 2 that involves dividing the sampling interval into more detailed switching and non-switching intervals. One significant advantage of our closed-form solution is its high computational accuracy and efficiency. Subsequent semi-Monte Carlo simulations will provide specific validation results. Full article
(This article belongs to the Section E5: Financial Mathematics)
Show Figures

Figure 1

21 pages, 5135 KiB  
Article
Improved Dynamic Event-Triggered Robust Control for Flexible Robotic Arm Systems with Semi-Markov Jump Process
by Huiyan Zhang, Zixian Chen, Wengang Ao and Peng Shi
Sensors 2023, 23(12), 5523; https://doi.org/10.3390/s23125523 - 12 Jun 2023
Cited by 7 | Viewed by 2320
Abstract
In this paper, we investigate the problem of a dynamic event-triggered robust controller design for flexible robotic arm systems with continuous-time phase-type semi-Markov jump process. In particular, the change in moment of inertia is first considered in the flexible robotic arm system, which [...] Read more.
In this paper, we investigate the problem of a dynamic event-triggered robust controller design for flexible robotic arm systems with continuous-time phase-type semi-Markov jump process. In particular, the change in moment of inertia is first considered in the flexible robotic arm system, which is necessary for ensuring the security and stability control of special robots employed under special circumstances, such as surgical robots and assisted-living robots which have strict lightweight requirements. To handle this problem, a semi-Markov chain is conducted to model this process. Furthermore, the dynamic event-triggered scheme is used to solve the problem of limited bandwidth in the network transmission environment, while considering the impact of DoS attacks. With regard to the challenging circumstances and negative elements previously mentioned, the adequate criteria for the existence of the resilient H controller are obtained using the Lyapunov function approach, and the controller gains, Lyapunov parameters and event-triggered parameters are co-designed. Finally, the effectiveness of the designed controller is demonstrated via numerical simulation using the LMI toolbox in MATLAB. Full article
Show Figures

Figure 1

16 pages, 436 KiB  
Article
On Queues with Working Vacation and Interdependence in Arrival and Service Processes
by S Sindhu, Achyutha Krishnamoorthy and Dmitry Kozyrev
Mathematics 2023, 11(10), 2280; https://doi.org/10.3390/math11102280 - 13 May 2023
Cited by 9 | Viewed by 1628
Abstract
In this paper, we consider two queuing models. Model 1 considers a single-server working vacation queuing system with interdependent arrival and service processes. The arrival and service processes evolve by transitions on the product space of two Markovian chains. The transitions in the [...] Read more.
In this paper, we consider two queuing models. Model 1 considers a single-server working vacation queuing system with interdependent arrival and service processes. The arrival and service processes evolve by transitions on the product space of two Markovian chains. The transitions in the two Markov chains in the product space are governed by a semi-Markov rule, with sojourn times in states governed by the exponential distribution. In contrast, in the second model, we consider independent arrival and service processes following phase-type distributions with representation (α,T) of order m and (β,S) of order n, respectively. The service time during normal working is the above indicated phase-type distribution whereas that during working vacation is a phase-type distribution with representation (β,θS), 0<θ<1. The duration of the latter is exponentially distributed. The latter model is already present in the literature and will be briefly described. The main objective is to make a theoretical comparison between the two. Numerical illustrations for the first model are provided. Full article
(This article belongs to the Special Issue Stochastic Modeling and Applied Probability, 2nd Edition)
Show Figures

Figure 1

21 pages, 662 KiB  
Article
Gain Scheduled Fault Detection Filter for Markovian Jump Linear System with Nonhomogeneous Markov Chain
by Leonardo Carvalho, Jonathan M. Palma, Cecília F. Morais, Bayu Jayawardhana and Oswaldo L. V. Costa
Mathematics 2023, 11(7), 1713; https://doi.org/10.3390/math11071713 - 3 Apr 2023
Cited by 2 | Viewed by 1691
Abstract
In a networked control system scenario, the packet dropout is usually modeled by a time-invariant (homogeneous) Markov chain (MC) process. However, from a practical point of view, the probabilities of packet loss can vary in time and/or probability parameter dependency. Therefore, to design [...] Read more.
In a networked control system scenario, the packet dropout is usually modeled by a time-invariant (homogeneous) Markov chain (MC) process. However, from a practical point of view, the probabilities of packet loss can vary in time and/or probability parameter dependency. Therefore, to design a fault detection filter (FDF) implemented in a semi-reliable communication network, it is important to consider the variation in time of the network parameters, by assuming the more accurate scenario provided by a nonhomogeneous jump system. Such a premise can be properly taken into account within the linear parameter varying (LPV) framework. In this sense, this paper proposes a new design method of H gain-scheduled FDF for Markov jump linear systems under the assumption of a nonhomogeneous MC. To illustrate the applicability of the theoretical solution, a numerical simulation is presented. Full article
(This article belongs to the Special Issue Dynamic Modeling and Simulation for Control Systems, 2nd Edition)
Show Figures

Figure 1

26 pages, 625 KiB  
Article
A Novel Computational Procedure for the Waiting-Time Distribution (In the Queue) for Bulk-Service Finite-Buffer Queues with Poisson Input
by Mohan Chaudhry, Abhijit Datta Banik, Sitaram Barik and Veena Goswami
Mathematics 2023, 11(5), 1142; https://doi.org/10.3390/math11051142 - 24 Feb 2023
Cited by 8 | Viewed by 2521
Abstract
In this paper, we discuss the waiting-time distribution for a finite-space, single-server queueing system, in which customers arrive singly following a Poisson process and the server operates under (a,b)-bulk service rule. The queueing system has a finite-buffer capacity [...] Read more.
In this paper, we discuss the waiting-time distribution for a finite-space, single-server queueing system, in which customers arrive singly following a Poisson process and the server operates under (a,b)-bulk service rule. The queueing system has a finite-buffer capacity ‘N’ excluding the batch in service. The service-time distribution of batches follows a general distribution, which is independent of the arrival process. We first develop an alternative approach of obtaining the probability distribution for the queue length at a post-departure epoch of a batch and, subsequently, the probability distribution for the queue length at a random epoch using an embedded Markov chain, Markov renewal theory and the semi-Markov process. The waiting-time distribution (in the queue) of a random customer is derived using the functional relation between the probability generating function (pgf) for the queue-length distribution and the Laplace–Stieltjes transform (LST) of the queueing-time distribution for a random customer. Using LSTs, we discuss the derivation of the probability density function of a random customer’s waiting time and its numerical implementations. Full article
Show Figures

Figure 1

Back to TopTop