Sharif Digital Repository

With the growth of the number of online service providers and the need to innovate in these services, in this study, the processes and the journeys taken by visitors of a website that provides employment services and employment insurance has been analyzed. In this research, process mining techniques and predictive process monitoring were implemented. With the use of a supervised and unsupervised learning algorithm, it attempted to identify the customer journeys' output and the existing patterns that lead to the complaint. In the first step, the website event log is extracted. Afterward, by using frequency-based encoding methods, the journeys traveled by users were clustered based on the... 

In order to survive in today's business world, which is changing at a very fast pace, organizations can detect deviations even before they occur, quickly and with a high percentage of confidence, by analyzing their processes, in order to prevent disruptions in the processes. by monitoring the information systems that automatically execute business processes, it is possible to ensure the correct implementation of the existing processes. For this purpose, various techniques for monitoring business processes have been presented so that managers have a comprehensive and real view of how implement processes and be able to identify possible deviations in the future and try to fix them because the... 

In recent years, several studies have been conducted in the field of data mining techniques in the field of process mining with the aim of improving the performance of organizations. Predictive process monitoring is a data-driven approach that helps business managers to improve the status and conditions of their organization. In this approach, the event log, which includes a set of completed examples of a process, is received as input, and machine learning methods are used to predict the outcome and results of the organization's processes before the process is completed. This prediction can include the prediction of the final result, the next event, the time remaining until the completion of... 

The inventory costs constitute a significant portion of the supply chain costs. Therefore, choosing an optimal inventory policy for orders is of great importance. The aim of this research is to find the optimal inventory policy for a distribution center in a three-tier supply chain consisting of a manufacturer, a distribution center, and a retailer. This research simulates a supply chain in agent-based framework and optimizes it using reinforcement learning. The optimization KPI in this research is the mean daily cost of the supply chain. Finally, the result obtained from reinforcement learning is compared with the optimized result of AnyLogic and the mean daily cost in the model optimized... 

Business processes are an essential part of every business as they provide insights on how to optimize and make them more efficient. Predictive Business Process Monitoring has garnered significant attention in recent years due to its capability to forecast process outcomes and predict the next activity within an ongoing process. In the last few years, there have been works that focused on deep learning and its applications in predicting the next activity. Some research used Long Term Short Memory, while others used Convolutional Neural Networks. However, long term short term memory models have the constraint of relatively slow training, while Convolutional Neural Networks are fast but may... 

The analysis of customer journeys has gained significant attention due to the critical role of customer behavior data in enhancing business decision-making and formulating strategies for customer acquisition and retention. By segmenting customers based on their journey patterns, businesses can offer personalized recommendations, thereby improving customer engagement and loyalty. Additionally, predicting the next steps in a customer’s journey based on historical data allows for timely and appropriate interventions at various touchpoints. By understanding where customers are in their journey, businesses can provide targeted recommendations that increase the likelihood of converting potential... 

To maintain adaptability, businesses should anticipate changes in their environment. The commonly employed forecasting method within corporate circles is the bottom-up approach, which relies on historical data for projecting future trends. However, research suggests that this approach often falls short of accurately reflecting real-world events. This has led to the adoption of dynamic systems modeling, a technique grounded in the assumption of stable conditions. This method effectively replicates the system's current state, thereby assisting in predicting future behaviors over a longer timeframe. The dynamic systems modeling approach was employed in this study, underscoring the imperative... 

OFDMA multi-hop cellular network (MCN) is the topic of a wide range of research today. In this thesis, we analyse this type of networks, regarding shadowing status, mobility patterns and different service requirements. In the multi-hop (MH) scenario, six fixed relays are set up in each cell, which split the cell into seven subcells. For mobility modeling, each subcell is split into several sub-regions. Mobile nodes are able to maintain at each sub-region with a random time distribution and migrate from it to one of its neighboring sub-regions. We also consider three types of services requiring specific number of subcarriers with specific BERs. The set of subcarriers is distributed among... 

We consider extending the visibility polygon of a given point q inside a simple polygon by converting one or some of the edges to mirrors. It is known that the visibility polygon of a point inside a polygon in the presence of a mirror can be computed in linear time. We propose a linear time algorithm that checks whether a given segment inside a simple polygon is visible by a given point q via a mirror-edge, and finds all such edges. And we prove that finding edges to add exactly k unit squares to the visibility polygon of a query point q in most cases is NP-complete and its minimization is NP-hard. These cases contain single and muliple, either with secular or difuse reflections. Moreover,... 

Cooperative networks have attracted much attention in the last decade. Being introduced to mitigate the inefficiencies in the physical layer, cooperation can also be beneficial in upper layers, such as MAC layer. Using cooperative communications is specifically more challenging in the random access networks, where collision is a main concern. Delay, as one of the main performance metrics in random access networks, can decrease significantly by using cooperative communications. Transmission delay, i.e., the required time for delivering one packet form its source to destination, is an important metric in many communication networks, such as the networks in which each node generates and... 

This document deals with the following results in details:Given a simple polygon P with $n$ vertices, the visibility polygon (VP) of a point q, or a segment pq inside P can be computed in linear time. It is known that the visibility polygon of a point inside a polygon in the presence of a mirror can be computed in linear time. We propose a linear time algorithm to extend the VP of a viewer (point or segment) by converting some edges of P into mirrors (reflecting-edges with specular type of reflection), such that a given non-visible segment uw can also be seen from the viewer.Various definitions for the visibility of a segment, such as weak, strong, or complete visibility, are considered. Our...