2,522 research outputs found

    Undergraduate Catalog of Studies, 2023-2024

    Get PDF

    Graduate Catalog of Studies, 2023-2024

    Get PDF

    Deep generative models for network data synthesis and monitoring

    Get PDF
    Measurement and monitoring are fundamental tasks in all networks, enabling the down-stream management and optimization of the network. Although networks inherently have abundant amounts of monitoring data, its access and effective measurement is another story. The challenges exist in many aspects. First, the inaccessibility of network monitoring data for external users, and it is hard to provide a high-fidelity dataset without leaking commercial sensitive information. Second, it could be very expensive to carry out effective data collection to cover a large-scale network system, considering the size of network growing, i.e., cell number of radio network and the number of flows in the Internet Service Provider (ISP) network. Third, it is difficult to ensure fidelity and efficiency simultaneously in network monitoring, as the available resources in the network element that can be applied to support the measurement function are too limited to implement sophisticated mechanisms. Finally, understanding and explaining the behavior of the network becomes challenging due to its size and complex structure. Various emerging optimization-based solutions (e.g., compressive sensing) or data-driven solutions (e.g. deep learning) have been proposed for the aforementioned challenges. However, the fidelity and efficiency of existing methods cannot yet meet the current network requirements. The contributions made in this thesis significantly advance the state of the art in the domain of network measurement and monitoring techniques. Overall, we leverage cutting-edge machine learning technology, deep generative modeling, throughout the entire thesis. First, we design and realize APPSHOT , an efficient city-scale network traffic sharing with a conditional generative model, which only requires open-source contextual data during inference (e.g., land use information and population distribution). Second, we develop an efficient drive testing system — GENDT, based on generative model, which combines graph neural networks, conditional generation, and quantified model uncertainty to enhance the efficiency of mobile drive testing. Third, we design and implement DISTILGAN, a high-fidelity, efficient, versatile, and real-time network telemetry system with latent GANs and spectral-temporal networks. Finally, we propose SPOTLIGHT , an accurate, explainable, and efficient anomaly detection system of the Open RAN (Radio Access Network) system. The lessons learned through this research are summarized, and interesting topics are discussed for future work in this domain. All proposed solutions have been evaluated with real-world datasets and applied to support different applications in real systems

    Undergraduate Catalog of Studies, 2023-2024

    Get PDF

    Combining deep reinforcement learning and multi-stage stochastic programming to address the supply chain inventory management problem

    Get PDF
    We introduce a novel heuristic designed to address the supply chain inventory management problem in the context of a two-echelon divergent supply chain. The proposed heuristic advances the current state-of-the-art by combining deep reinforcement learning with multi-stage stochastic programming. In particular, deep reinforcement learning is employed to determine the number of batches to produce, while multi-stage stochastic programming is applied to make shipping decisions. To support further research, we release a publicly available software environment that simulates a wide range of two-echelon divergent supply chain settings, allowing the manipulation of various parameter values, including those associated with seasonal demands. We then present a comprehensive set of numerical experiments considering constraints on production and warehouse capacities under fixed and variable logistic costs. The results demonstrate that the proposed heuristic significantly and consistently outperforms pure deep reinforcement learning algorithms in minimizing total costs. Moreover, it overcomes several inherent limitations of multi-stage stochastic programming models, thus underscoring its potential advantages in addressing complex supply chain scenarios

    An Improvement of Load Flow Solution for Power System Networks using Evolutionary-Swarm Intelligence Optimizers

    Get PDF
    Load flow report which reveals the existing state of the power system network under steady operating conditions, subject to certain constraints is being bedeviled by issues of accuracy and convergence. In this research, five AI-based load flow solutions classified under evolutionary-swarm intelligence optimizers are deployed for power flow studies in the 330kV, 34-bus, 38-branch section of the Nigerian transmission grid. The evolutionary-swarm optimizers used in this research consist of one evolutionary algorithm and four swarm intelligence algorithms namely; biogeography-based optimization (BBO), particle swarm optimization (PSO), spider monkey optimization (SMO), artificial bee colony optimization (ABCO) and ant colony optimization (ACO). BBO as a sole evolutionary algorithm is being configured alongside four swarm intelligence optimizers for an optimal power flow solution with the aim of performance evaluation through physical and statistical means. Assessment report upon application of these standalone algorithms on the 330kV Nigerian grid under two (accuracy and convergence) metrics produced PSO and ACO as the best-performed algorithms. Three test cases (scenarios) were adopted based on the number of iterations (100, 500, and 1000) for proper assessment of the algorithms and the results produced were validated using mean average percentage error (MAPE) with values of voltage profile created by each solution algorithm in line with the IEEE voltage regulatory standards. All algorithms proved to be good load flow solvers with distinct levels of precision and speed. While PSO and SMO produced the best and worst results for accuracy with MAPE values of 3.11% and 36.62%, ACO and PSO produced the best and worst results for convergence (computational speed) after 65 and 530 average number of iterations. Since accuracy supersedes speed from scientific considerations, PSO is the overall winner and should be cascaded with ACO for an automated hybrid swarm intelligence load flow model in future studies. Future research should consider hybridizing ACO and PSO for a more computationally efficient solution model

    Graduate Catalog of Studies, 2023-2024

    Get PDF

    Reinforcement learning approaches for the stochastic discrete lot-sizing problem on parallel machines

    Get PDF
    This paper addresses the stochastic discrete lot-sizing problem on parallel machines, which is a computationally challenging problem also for relatively small instances. We propose two heuristics to deal with it by leveraging reinforcement learning. In particular, we propose a technique based on approximate value iteration around post-decision state variables and one based on multi-agent reinforcement learning. We compare these two approaches with other reinforcement learning methods and more classical solution techniques, showing their effectiveness in addressing realistic size instances
    • …
    corecore