Готові списки джерел за темами / Load graph

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Load graph"

Автор: Grafiati

Опубліковано: 30 травня 2022

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Load graph".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Load graph"

Rutten, Daan, and Debankur Mukherjee. "Load Balancing Under Strict Compatibility Constraints." ACM SIGMETRICS Performance Evaluation Review 49, no. 1 (2022): 51–52. http://dx.doi.org/10.1145/3543516.3456275.

Повний текст джерела

Анотація:

Consider a system with N identical single-server queues and M(N) task types, where each server is able to process only a small subset of possible task types. Arriving tasks select d≥2 random compatible servers, and join the shortest queue among them. The compatibility constraints are captured by a fixed bipartite graph GN between the servers and the task types. When GN is complete bipartite, the meanfield approximation is accurate. However, such dense compatibility graphs are infeasible for large-scale implementation. We characterize a class of sparse compatibility graphs for which the meanfie

Стилі APA, Harvard, Vancouver, ISO та ін.

Sidorov, V. V., A. Z. Ter-Martirosyan, and A. S. Almakaeva. "Determination of application limits of graph-analytical method of a single pile settlement calculation." Zhilishchnoe Stroitel stvo, no. 11 (December 11, 2024): 47–54. https://doi.org/10.31659/0044-4472-2024-11-47-54.

Повний текст джерела

Анотація:

The limits of application of the graph-analytical method for calculating the settlement of a single pile in a single-layer soil massif depending on the length and diameter of the pile are investigated. The graph-analytical method makes it possible to take into account non-linear work of the soil on the whole surface of the pile, exclusion from further work of the soil area along the lateral surface of the pile, where the ultimate strength of the soil was reached, mechanism of load distribution on the pile and friction reduction at the contact “pile–soil”. A comparative analysis of the results

Стилі APA, Harvard, Vancouver, ISO та ін.

Cui, Huanqing, Yifan Wu, and Silin Lv. "Property Graph Partition Algorithm Based on Improved Barnacle Mating Optimization." Journal of Physics: Conference Series 2832, no. 1 (2024): 012005. http://dx.doi.org/10.1088/1742-6596/2832/1/012005.

Повний текст джерела

Анотація:

Abstract Distributed graph processing systems have been used more frequently in various fields, and graph partitioning is the basis of these systems. Graph partitioning algorithms generally aim to minimize the communication cost while the number of vertices or edges reach the load balance. But the vertices and/or edges of property graphs require some storage volume, so the traditional graph partition algorithms will lead to an unbalanced storage volume load. This paper proposes an edge-cut graph partitioning algorithm to generate partitions with equal size and storage volume as well as low cut

Стилі APA, Harvard, Vancouver, ISO та ін.

Ai, Xin, Hao Yuan, Zeyu Ling, et al. "NeutronTP: Load-Balanced Distributed Full-Graph GNN Training with Tensor Parallelism." Proceedings of the VLDB Endowment 18, no. 2 (2024): 173–86. https://doi.org/10.14778/3705829.3705837.

Повний текст джерела

Анотація:

Graph neural networks (GNNs) have emerged as a promising direction. Training large-scale graphs that relies on distributed computing power poses new challenges. Existing distributed GNN systems leverage data parallelism by partitioning the input graph and distributing it to multiple workers. However, due to the irregular nature of the graph structure, existing distributed approaches suffer from unbalanced workloads and high overhead in managing cross-worker vertex dependencies. In this paper, we leverage tensor parallelism for distributed GNN training. GNN tensor parallelism eliminates cross-w

Стилі APA, Harvard, Vancouver, ISO та ін.

Seon, Yu-Rim, Chul Min Lee, and Duk Ho Chung. "Study on the Middle School Students’ Cognitive Load When Interpreting the Graphs on Sea Surface Temperature around the Korean Peninsula." Korean Association For Learner-Centered Curriculum And Instruction 24, no. 19 (2024): 351–65. http://dx.doi.org/10.22251/jlcci.2024.24.19.351.

Повний текст джерела

Анотація:

Objectives The purpose of this study is to identify the cognitive load that middle school students perceive in interpreting of sea surface temperature around the Korean Peninsula according to the type of graph, and to help middle school teachers develop teaching and learning materials by providing information related to cognitive load. Methods For This, we collected and analyzed data on the fixation duration and pupil diameter of middle school students(N=32) while interpreting of sea surface temperature around the Korean Peninsula using the eye tracker(Tobii Pro Glass 2 model). And we conducte

Стилі APA, Harvard, Vancouver, ISO та ін.

Bok, Kyoungsoo, Junwon Kim, and Jaesoo Yoo. "Dynamic Partitioning Supporting Load Balancing for Distributed RDF Graph Stores." Symmetry 11, no. 7 (2019): 926. http://dx.doi.org/10.3390/sym11070926.

Повний текст джерела

Анотація:

Various resource description framework (RDF) partitioning methods have been studied for the efficient distributed processing of a large RDF graph. The RDF graph has symmetrical characteristics because subject and object can be used interchangeably if predicate is changed. This paper proposes a dynamic partitioning method of RDF graphs to support load balancing in distributed environments where data insertion and change continue to occur. The proposed method generates clusters and subclusters by considering the usage frequency of the RDF graph that are used by queries as the criteria to perform

Стилі APA, Harvard, Vancouver, ISO та ін.

Sidorov, Vitaly, Armen Ter-Martirosyan, and Anastasiya Almakaeva. "Graph-analytical calculating pile’s settlement verification." E3S Web of Conferences 533 (2024): 02044. http://dx.doi.org/10.1051/e3sconf/202453302044.

Повний текст джерела

Анотація:

The paper presents the solution of the problem of interaction of a single reinforced concrete compressible pile with an elastoplastic single-layer soil mass. The settlement is calculated on the basis of the analytical equation in the elastic formulation. A graph-analytical method is proposed to account for the nonlinear behavior of soils, which limits the bearing capacity of the pile on the lateral surface to the strength of the adjacent soil and under the pile toe to the ultimate load determined by the Brinch Hansen formula. The novelty of this method consists in taking into account the mecha

Стилі APA, Harvard, Vancouver, ISO та ін.

Paulin, S. Shiny, and T. Bharathi. "Adjacency Sequence and Adjacency Spectrum of Power Fuzzy Graphs." Indian Journal Of Science And Technology 17, no. 47 (2024): 5016–24. https://doi.org/10.17485/ijst/v17i47.3605.

Повний текст джерела

Анотація:

Objectives: To find the adjacency sequence, spectrum of the power fuzzy graphs and discuss its properties. Methods: The spectrum and energy of the power fuzzy graphs are derived using the adjacency matrices. Energy of the power fuzzy graph is computed by adding the absolute eigenvalues of the adjacency matrix. Findings: The condition for a power fuzzy graph, 𝐺𝑓 𝑘 to be vertex regular in terms of adjacency sequence has been verified. The energy sequence for the power fuzzy graph with increasing 𝑘 has been established. Novelty: The concept of minimizing the interval of the edge membership values

Стилі APA, Harvard, Vancouver, ISO та ін.

S, Shiny Paulin, and Bharathi T. "Adjacency Sequence and Adjacency Spectrum of Power Fuzzy Graphs." Indian Journal of Science and Technology 17, no. 47 (2024): 5016–24. https://doi.org/10.17485/IJST/v17i47.3605.

Повний текст джерела

Анотація:

Abstract Objectives: To find the adjacency sequence, spectrum of the power fuzzy graphs and discuss its properties. Methods: The spectrum and energy of the power fuzzy graphs are derived using the adjacency matrices. Energy of the power fuzzy graph is computed by adding the absolute eigenvalues of the adjacency matrix. Findings: The condition for a power fuzzy graph, 𝐺𝑓 𝑘 to be vertex regular in terms of adjacency sequence has been verified. The energy sequence for the power fuzzy graph with increasing 𝑘 has been estab

Стилі APA, Harvard, Vancouver, ISO та ін.

Ding, Zezhong, Yongan Xiang, Shangyou Wang, Xike Xie, and S. Kevin Zhou. "Play like a Vertex: A Stackelberg Game Approach for Streaming Graph Partitioning." Proceedings of the ACM on Management of Data 2, no. 3 (2024): 1–27. http://dx.doi.org/10.1145/3654965.

Повний текст джерела

Анотація:

In the realm of distributed systems tasked with managing and processing large-scale graph-structured data, optimizing graph partitioning stands as a pivotal challenge. The primary goal is to minimize communication overhead and runtime cost. However, alongside the computational complexity associated with optimal graph partitioning, a critical factor to consider is memory overhead. Real-world graphs often reach colossal sizes, making it impractical and economically unviable to load the entire graph into memory for partitioning. This is also a fundamental premise in distributed graph processing,

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Load graph"

Barat, Remi. "Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0961/document.

Повний текст джерела

Анотація:

Les simulations dites multi-physiques couplent plusieurs phases de calcul. Lorsqu’elles sont exécutées en parallèle sur des architectures à mémoire distribuée, la minimisation du temps de restitution nécessite dans la plupart des cas d’équilibrer la charge entre les unités de traitement, pour chaque phase de calcul. En outre, la distribution des données doit minimiser les communications qu’elle induit. Ce problème peut être modélisé comme un problème de partitionnement de graphe multi-critères. On associe à chaque sommet du graphe un vecteur de poids, dont les composantes, appelées « critères

Стилі APA, Harvard, Vancouver, ISO та ін.

Predari, Maria. "Load balancing for parallel coupled simulations." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0369/document.

Повний текст джерела

Анотація:

Dans le contexte du calcul scientique, l'équilibrage de la charge est un problème crucial qui conditionne la performance des simulations numériques parallèles. L'objectif est de répartir la charge de travail entre un nombre de processeurs donné, afin de minimiser le temps global d'exécution. Une stratégie populaire pour résoudre ce problème consiste à modéliser la simulation à l'aide d'un graphe et à appliquer des algorithmes de partitionnement. En outre, les simulations numériques tendent à se complexifier, notamment en mixant plusieurs codes représentant des physiques différentes ou des éche

Стилі APA, Harvard, Vancouver, ISO та ін.

Sun, Jiawen. "The GraphGrind framework : fast graph analytics on large shared-memory systems." Thesis, Queen's University Belfast, 2018. https://pure.qub.ac.uk/portal/en/theses/the-graphgrind-framework-fast-graph-analytics-on-large-sharedmemory-systems(e1eb006f-3a68-4d05-91fe-961d04b42694).html.

Повний текст джерела

Анотація:

As shared memory systems support terabyte-sized main memory, they provide an opportunity to perform efficient graph analytics on a single machine. Graph analytics is characterised by frequent synchronisation, which is addressed in part by shared memory systems. However, performance is limited by load imbalance and poor memory locality, which originate in the irregular structure of small-world graphs. This dissertation demonstrates how graph partitioning can be used to optimise (i) load balance, (ii) Non-Uniform Memory Access (NUMA) locality and (iii) temporal locality of graph partitioning in

Стилі APA, Harvard, Vancouver, ISO та ін.

Deveci, Mehmet. "Load-Balancing and Task Mapping for Exascale Systems." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429199721.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Botadra, Harnish. "iC2mpi a platform for parallel execution of graph-structured iterative computations /." unrestricted, 2006. http://etd.gsu.edu/theses/available/etd-07252006-165725/.

Повний текст джерела

Анотація:

Thesis (M.S.)--Georgia State University, 2006. Title from title screen. Sushil Prasad, committee chair. Electronic text (106 p. : charts) : digital, PDF file. Description based on contents viewed June 11, 2007. Includes bibliographical references. Includes bibliographical references (p. 61-53).

Стилі APA, Harvard, Vancouver, ISO та ін.

Yildiz, Ali. "Resource-aware Load Balancing System With Artificial Neural Networks." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607613/index.pdf.

Повний текст джерела

Анотація:

As the distributed systems becomes popular, efficient load balancing systems taking better decisions must be designed. The most important reasons that necessitate load balancing in a distributed system are the heterogeneous hosts having different com- puting powers, external loads and the tasks running on different hosts but communi- cating with each other. In this thesis, a load balancing approach, called RALBANN, developed using graph partitioning and artificial neural networks (ANNs) is de- scribed. The aim of RALBANN is to integrate the successful load balancing

Стилі APA, Harvard, Vancouver, ISO та ін.

Zheng, Chunfang. "GRAPHICAL MODELING AND SIMULATION OF A HYBRID HETEROGENEOUS AND DYNAMIC SINGLE-CHIP MULTIPROCESSOR ARCHITECTURE." UKnowledge, 2004. http://uknowledge.uky.edu/gradschool_theses/249.

Повний текст джерела

Анотація:

A single-chip, hybrid, heterogeneous, and dynamic shared memory multiprocessor architecture is being developed which may be used for real-time and non-real-time applications. This architecture can execute any application described by a dataflow (process flow) graph of any topology; it can also dynamically reconfigure its structure at the node and processor architecture levels and reallocate its resources to maximize performance and to increase reliability and fault tolerance. Dynamic change in the architecture is triggered by changes in parameters such as application input data rates, process

Стилі APA, Harvard, Vancouver, ISO та ін.

Gillet, Noel. "Optimisation de requêtes sur des données massives dans un environnement distribué." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0553/document.

Повний текст джерела

Анотація:

Les systèmes de stockage distribués sont massivement utilisés dans le contexte actuel des grandes masses de données. En plus de gérer le stockage de ces données, ces systèmes doivent répondre à une quantité toujours plus importante de requêtes émises par des clients distants afin d’effectuer de la fouille de données ou encore de la visualisation. Une problématique majeure dans ce contexte consiste à répartir efficacement les requêtes entre les différents noeuds qui composent ces systèmes afin de minimiser le temps de traitement des requêtes ( temps maximum et en moyenne d’une requête, temps to

Стилі APA, Harvard, Vancouver, ISO та ін.

Tbaileh, Ahmad Anan. "Robust Non-Matrix Based Power Flow Algorithm for Solving Integrated Transmission and Distribution Systems." Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/89362.

Повний текст джерела

Анотація:

This work presents an alternative approach to power system computations, Graph Trace Analysis (GTA), and applies GTA to the power flow problem. A novel power flow algorithm is presented, where GTA traces are used to implement a modified Gauss-Seidel algorithm coupled with a continuation method. GTA is derived from the Generic Programming Paradigm of computer science. It uses topology iterators to move through components in a model and perform calculations. Two advantages that GTA brings are the separation of system equations from component equations and the ability to distribute calculations a

Стилі APA, Harvard, Vancouver, ISO та ін.

Cheng, Danling. "Integrated System Model Reliability Evaluation and Prediction for Electrical Power Systems: Graph Trace Analysis Based Solutions." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/28944.

Повний текст джерела

Анотація:

A new approach to the evaluation of the reliability of electrical systems is presented. In this approach a Graph Trace Analysis based approach is applied to integrated system models and reliability analysis. The analysis zones are extended from the traditional power system functional zones. The systems are modeled using containers with iterators, where the iterators manage graph edges and are used to process through the topology of the graph. The analysis provides a means of computationally handling dependent outages and cascading failures. The effects of adverse weather, time-varying loads,

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Load graph"

Morales-Luna, Guillermo, Alberto Garcia-Robledo, and Arturo Diaz-Perez. Creativity in Load-Balance Schemes for Multi/Many-Core Heterogeneous Graph Computing: Emerging Research and Opportunities. IGI Global, 2018.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hexagonal Graph Paper Nickelodeon the Loud House Character. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hexagonal Graph Paper Nickelodeon the Loud House Character. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Graph out loud: A graphical guide to popular culture. Gotham Books, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Graph out loud: A graphical guide to popular culture. Gotham Books, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Graph out loud: A graphical guide to popular culture. Gotham Books, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Graph out loud: A graphical guide to popular culture. Gotham Books, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Krake, LR, N. Steele Scott, MA Rezaian, and RH Taylor. Graft-transmitted Diseases of Grapevines. CSIRO Publishing, 1999. http://dx.doi.org/10.1071/9780643101067.

Повний текст джерела

Анотація:

For almost 40 years, Australian researchers have been part of an international group of scientists who have studied graft-transmitted disorders of the grapevine. The Australian wine and grape industries are undergoing significant expansion as is the case in some other countries. Preventing the spread of pathogens, by producing clean propagation material, and minimising the disease load on new vines, is essential for the continuing success of the industry. This book covers the characteristics of each class of graft-transmitted pathogen, their effect on vines, how they spread and strategie

Стилі APA, Harvard, Vancouver, ISO та ін.

Hexagonal Graph Paper - Trust in the Lord Scriptural Quote Biblical Christian. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Womens the Lord Is My Shepherd Biblical Quote - Hexagonal Graph Paper. Independently Published, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Load graph"

Mystakidis, Aristeidis. "Graph Databases in Smart City Applications – Using Neo4j and Machine Learning for Energy Load Forecasting 7." In Graph Databases. CRC Press, 2023. http://dx.doi.org/10.1201/9781003183532-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dey, Lakshmi Kanta, Debashis Ghosh, and Satya Bagchi. "Efficient Load Balancing Algorithm Using Complete Graph." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23223-7_83.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Boillat, Jacques E. "Fast load balancing in Cayley graphs and in circuits." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57899-4_62.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zheng, Guoqing, Yuming Hu, Zhenlong Xiao, and Xinghao Ding. "Graph-Based Dependency-Aware Non-Intrusive Load Monitoring." In Pattern Recognition and Computer Vision. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-8549-4_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kiefer, Tim, Dirk Habich, and Wolfgang Lehner. "Penalized Graph Partitioning for Static and Dynamic Load Balancing." In Euro-Par 2016: Parallel Processing. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-43659-3_11.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Aliev, Araz R., and Nigar T. Ismayilova. "Graph-Based Load Balancing Model for Exascale Computing Systems." In 11th International Conference on Theory and Application of Soft Computing, Computing with Words and Perceptions and Artificial Intelligence - ICSCCW-2021. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-92127-9_33.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wanka, Rolf. "Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36379-3_36.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Munasinghe, Kalyani, and Richard Wait. "Load Balancing by Changing the Graph Connectivity on Heterogeneous Clusters." In Advances in Grid Computing - EGC 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11508380_106.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Busato, Federico, and Nicola Bombieri. "Efficient Load Balancing Techniques for Graph Traversal Applications on GPUs." In Euro-Par 2018: Parallel Processing. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96983-1_45.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Márquez, Claudio, Eduardo César, and Joan Sorribes. "Graph-Based Automatic Dynamic Load Balancing for HPC Agent-Based Simulations." In Euro-Par 2015: Parallel Processing Workshops. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27308-2_33.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Load graph"

Zhong, Yuhui, Tiangui Yang, Xiaoling Chen, et al. "Dynamic graph convolution with graph sparsification for power load forecasting." In International Symposium on Artificial Intelligence Innovations (ISAII 2025), edited by Xin Xu and Weihua Ou. SPIE, 2025. https://doi.org/10.1117/12.3075131.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dong, Jun, Jinming Zheng, Lina Stankovic, and Vladimir Stankovic. "Semi-Supervised Graph-Based Non-Intrusive Load Monitoring Method Combining Transformer and Graph Laplacian Smoothing." In 2024 IEEE 8th Conference on Energy Internet and Energy System Integration (EI2). IEEE, 2024. https://doi.org/10.1109/ei264398.2024.10991553.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhao, Yuting, Hu Li, Yongxiang Guo, et al. "Global-local Spatiotemporal Graph Neural Network for Power Load Forecasting." In 2024 5th International Conference on Clean Energy and Electric Power Engineering (ICCEPE). IEEE, 2024. https://doi.org/10.1109/iccepe62686.2024.10931504.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

He, Chun, Shilin Gao, and Xu Zhou. "Clustering of Daily Load Curves Based on Graph Convolutional Network." In 2025 7th Asia Energy and Electrical Engineering Symposium (AEEES). IEEE, 2025. https://doi.org/10.1109/aeees64634.2025.11020491.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Bo, Yutong Wu, Keke Li, Wenpeng Luan, Bochao Zhao, and Yanru Ren. "Enhanced Semi-supervised Non-intrusive Load Identification via Contrastive Graph Regularization." In 2024 3rd International Conference on Power Systems and Electrical Technology (PSET). IEEE, 2024. https://doi.org/10.1109/pset62496.2024.10808830.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ren, Yingjie, Lisha Wu, Jing Xu, Zhen Zhang, Longgang He, and Zhenhua Wei. "Time-series Electric Power Charge Load Prediction based on Graph Feature Fusion." In 2024 6th International Conference on Frontier Technologies of Information and Computer (ICFTIC). IEEE, 2024. https://doi.org/10.1109/icftic64248.2024.10913213.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Li, Xiuqiang, Xiaoguang Wei, Zhigang Liu, et al. "SFLGNN: Power Load Forecasting Based on Spectral-Frequency Learning and Graph Neural Network." In 2024 4th International Conference on Computer Systems (ICCS). IEEE, 2024. https://doi.org/10.1109/iccs62594.2024.10795826.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Xiang, Minjiang, Bingxu Zhang, Xu Zhang, Jie Xiao, and Ning Niu. "Construction and Application of the Knowledge Graph Based on Power Load Management Standards." In 2024 14th International Conference on Power and Energy Systems (ICPES). IEEE, 2024. https://doi.org/10.1109/icpes63746.2024.10856599.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Li, Yilin, Guangfen Wei, Tapiwa T. Kuzengurira, and Yuxuan Chen. "A Study of Non-Intrusive Load Recognition Based on Improved Unthresholded Recurrence Graph." In 2024 6th International Conference on Energy Systems and Electrical Power (ICESEP). IEEE, 2024. http://dx.doi.org/10.1109/icesep62218.2024.10651805.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Tan, Zhe, Chenyi Ge, and Zheng Pan. "Short-term Spatial Load Forecasting Method Based on Spatio-Temporal Graph Convolutional Network." In 2024 4th International Conference on New Energy and Power Engineering (ICNEPE). IEEE, 2024. https://doi.org/10.1109/icnepe64067.2024.10860477.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Load graph"

Bhatele, Abhinav, Sebastien Fourestier, Harshitha Menon, Laxmikant V. Kale, and Francois Pellegrini. Applying graph partitioning methods in measurement-based dynamic load balancing. Office of Scientific and Technical Information (OSTI), 2011. http://dx.doi.org/10.2172/1114706.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bhatele, A., S. Fourestier, H. Menon, L. Kale, and F. Pellegrini. Applying graph partitioning methods in measurement-based dynamic load balancing. Office of Scientific and Technical Information (OSTI), 2012. http://dx.doi.org/10.2172/1093410.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ramakrishnan, Aravind, Fangyu Liu, Angeli Jayme, and Imad Al-Qadi. Prediction of Pavement Damage under Truck Platoons Utilizing a Combined Finite Element and Artificial Intelligence Model. Illinois Center for Transportation, 2024. https://doi.org/10.36501/0197-9191/24-030.

Повний текст джерела

Анотація:

For robust pavement design, accurate damage computation is essential, especially for loading scenarios such as truck platoons. Studies have developed a framework to compute pavement distresses as function of lateral position, spacing, and market-penetration level of truck platoons. The established framework uses a robust 3D pavement model, along with the AASHTOWare Mechanistic–Empirical Pavement Design Guidelines (MEPDG) transfer functions to compute pavement distresses. However, transfer functions include high variability and lack physical significance. Therefore, as an improvement to effecti

Стилі APA, Harvard, Vancouver, ISO та ін.

INVERSION METHOD OF UNCERTAIN PARAMETERS FOR TRUSS STRUCTURES BASED ON GRAPH NEURAL NETWORKS. The Hong Kong Institute of Steel Construction, 2023. http://dx.doi.org/10.18057/ijasc.2023.19.4.5.

Повний текст джерела

Анотація:

Uncertainty exists widely in practical engineering. It is an important challenge in engineering structural analysis. In truss structures, the uncertainties of axial stiffness of bolted joints will significantly affect the mechanical behavior of the structure as the axial load is dominated by the member internal forces. Structural response analysis based on determined structural parameters is a common forward problem that can be solved by modeling analysis methods. However, the uncertainties parameter of axial stiffness of bolted joint cannot be determined during the design and analysis of trus

Стилі APA, Harvard, Vancouver, ISO та ін.

Financial Stability Report - Second Semester of 2020. Banco de la República de Colombia, 2021. http://dx.doi.org/10.32468/rept-estab-fin.sem2.eng-2020.

Повний текст джерела

Анотація:

The Colombian financial system has not suffered major structural disruptions during these months of deep economic contraction and has continued to carry out its basic functions as usual, thus facilitating the economy's response to extreme conditions. This is the result of the soundness of financial institutions at the beginning of the crisis, which was reflected in high liquidity and capital adequacy indicators as well as in the timely response of various authorities. Banco de la República lowered its policy interest rates 250 points to 1.75%, the lowest level since the creation of the new ind

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!