Увійти

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

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Load graph.

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

Автор: Grafiati

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

Оновлено: 31 травня 2022

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

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

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Load graph".

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

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

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Bok, Kyoungsoo, Junwon Kim, and Jaesoo Yoo. "Dynamic Partitioning Supporting Load Balancing for Distributed RDF Graph Stores." Symmetry 11, no. 7 (July 16, 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 graph partitioning. It creates a cluster by grouping RDF subgraphs with higher usage frequency while creating a subcluster with lower usage frequency. These clusters and subclusters conduct load balancing by using the mean frequency of queries for the distributed server and conduct graph data partitioning by considering the size of the data stored in each distributed server. It also minimizes the number of edge-cuts connected to clusters and subclusters to minimize communication costs between servers. This solves the problem of data concentration to specific servers due to ongoing data changes and additions and allows efficient load balancing among servers. The performance results show that the proposed method significantly outperforms the existing partitioning methods in terms of query performance time in a distributed server.

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

2

Moharir, Sharayu, Sujay Sanghavi, and Sanjay Shakkottai. "Online load balancing under graph constraints." ACM SIGMETRICS Performance Evaluation Review 41, no. 1 (June 14, 2013): 363–64. http://dx.doi.org/10.1145/2494232.2465751.

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

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

3

Moharir, Sharayu, Sujay Sanghavi, and Sanjay Shakkottai. "Online Load Balancing Under Graph Constraints." IEEE/ACM Transactions on Networking 24, no. 3 (June 2016): 1690–703. http://dx.doi.org/10.1109/tnet.2015.2442597.

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

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

4

COSNARD, M., and M. LOI. "AUTOMATIC TASK GRAPH GENERATION TECHNIQUES." Parallel Processing Letters 05, no. 04 (December 1995): 527–38. http://dx.doi.org/10.1142/s0129626495000473.

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

Анотація:

We present a model of parallel computation, the parameterized task graph, which is a compact, problem size independent, representation of some frequently used directed acyclic task graphs. Techniques automating the construction of such a representation, starting from an annotated sequential program are proposed. We show that many important properties of the task graph such as the computational load of the nodes and the communication volume of the edges can be automatically deduced in a problem size independent way.

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

5

Yang, Carl, Aydın Buluç, and John D. Owens. "GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU." ACM Transactions on Mathematical Software 48, no. 1 (March 31, 2022): 1–51. http://dx.doi.org/10.1145/3466795.

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

Анотація:

High-performance implementations of graph algorithms are challenging to implement on new parallel hardware such as GPUs because of three challenges: (1) the difficulty of coming up with graph building blocks, (2) load imbalance on parallel hardware, and (3) graph problems having low arithmetic intensity. To address some of these challenges, GraphBLAS is an innovative, on-going effort by the graph analytics community to propose building blocks based on sparse linear algebra, which allow graph algorithms to be expressed in a performant, succinct, composable, and portable manner. In this paper, we examine the performance challenges of a linear-algebra-based approach to building graph frameworks and describe new design principles for overcoming these bottlenecks. Among the new design principles is exploiting input sparsity , which allows users to write graph algorithms without specifying push and pull direction. Exploiting output sparsity allows users to tell the backend which values of the output in a single vectorized computation they do not want computed. Load-balancing is an important feature for balancing work amongst parallel workers. We describe the important load-balancing features for handling graphs with different characteristics. The design principles described in this paper have been implemented in “GraphBLAST”, the first high-performance linear algebra-based graph framework on NVIDIA GPUs that is open-source. The results show that on a single GPU, GraphBLAST has on average at least an order of magnitude speedup over previous GraphBLAS implementations SuiteSparse and GBTL, comparable performance to the fastest GPU hardwired primitives and shared-memory graph frameworks Ligra and Gunrock, and better performance than any other GPU graph framework, while offering a simpler and more concise programming model.

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

6

Draief, M., A. Ganesh, and L. Massoulié. "Exponential Random Graphs as Models of Overlay Networks." Journal of Applied Probability 46, no. 01 (March 2009): 199–220. http://dx.doi.org/10.1017/s0021900200005313.

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

Анотація:

In this paper we give an analytic solution for graphs with n nodes and E = cn log n edges for which the probability of obtaining a given graph G is µn (G) = exp (- β ∑i=1 n d i 2), where d i is the degree of node i. We describe how this model appears in the context of load balancing in communication networks, namely peer-to-peer overlays. We then analyse the degree distribution of such graphs and show that the degrees are concentrated around their mean value. Finally, we derive asymptotic results for the number of edges crossing a graph cut and use these results (i) to compute the graph expansion and conductance, and (ii) to analyse the graph resilience to random failures.

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

7

Draief, M., A. Ganesh, and L. Massoulié. "Exponential Random Graphs as Models of Overlay Networks." Journal of Applied Probability 46, no. 1 (March 2009): 199–220. http://dx.doi.org/10.1239/jap/1238592125.

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

Анотація:

In this paper we give an analytic solution for graphs withnnodes andE=cnlognedges for which the probability of obtaining a given graphGisµn(G) = exp (-β∑i=1ndi2), wherediis the degree of nodei. We describe how this model appears in the context of load balancing in communication networks, namely peer-to-peer overlays. We then analyse the degree distribution of such graphs and show that the degrees are concentrated around their mean value. Finally, we derive asymptotic results for the number of edges crossing a graph cut and use these results (i) to compute the graph expansion and conductance, and (ii) to analyse the graph resilience to random failures.

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

8

Sharma, Bhuvan, Van C. Willis, Claudia S. Huettner, Kirk Beaty, Jane L. Snowdon, Shang Xue, Brett R. South, Gretchen P. Jackson, Dilhan Weeraratne, and Vanessa Michelini. "Predictive article recommendation using natural language processing and machine learning to support evidence updates in domain-specific knowledge graphs." JAMIA Open 3, no. 3 (September 29, 2020): 332–37. http://dx.doi.org/10.1093/jamiaopen/ooaa028.

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

Анотація:

Abstract Objectives Describe an augmented intelligence approach to facilitate the update of evidence for associations in knowledge graphs. Methods New publications are filtered through multiple machine learning study classifiers, and filtered publications are combined with articles already included as evidence in the knowledge graph. The corpus is then subjected to named entity recognition, semantic dictionary mapping, term vector space modeling, pairwise similarity, and focal entity match to identify highly related publications. Subject matter experts review recommended articles to assess inclusion in the knowledge graph; discrepancies are resolved by consensus. Results Study classifiers achieved F-scores from 0.88 to 0.94, and similarity thresholds for each study type were determined by experimentation. Our approach reduces human literature review load by 99%, and over the past 12 months, 41% of recommendations were accepted to update the knowledge graph. Conclusion Integrated search and recommendation exploiting current evidence in a knowledge graph is useful for reducing human cognition load.

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

9

Alistarh, Dan, Giorgi Nadiradze, and Amirmojtaba Sabour. "Dynamic Averaging Load Balancing on Cycles." Algorithmica 84, no. 4 (December 24, 2021): 1007–29. http://dx.doi.org/10.1007/s00453-021-00905-9.

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

Анотація:

AbstractWe consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step $$t\ge 0$$ t ≥ 0 , a random edge is chosen, one unit of load is created, and placed at one of the endpoints. In the same step, assuming that loads are arbitrarily divisible, the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Peres et al. (Random Struct Algorithms 47(4):760–775, 2015) studied the variant of this process, where the unit of load is placed in the least loaded endpoint of the chosen edge, and the averaging is not performed. In the case of dynamic load balancing on the cycle of length n the only known upper bound on the expected gap is of order $$\mathcal {O}( n \log n )$$ O ( n log n ) , following from the majorization argument due to the same work. In this paper, we leverage the power of averaging and provide an improved upper bound of $$\mathcal {O} ( \sqrt{n} \log n )$$ O ( n log n ) . We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any $$k \le n/2$$ k ≤ n / 2 . We complement this with a “gap covering” argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We also show that our analysis can be extended to the specific instance of Harary graphs. On the other hand, we prove that the expected second moment of the gap is lower bounded by $$\Omega (n)$$ Ω ( n ) . Additionally, we provide experimental evidence that our upper bound on the gap is tight up to a logarithmic factor.

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

10

Jeurissen, R., and W. Layton. "Load balancing by graph coloring, an algorithm." Computers & Mathematics with Applications 27, no. 3 (February 1994): 27–32. http://dx.doi.org/10.1016/0898-1221(94)90043-4.

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

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

11

Zainullina, R. "Automatic Graph Generation for E-learning Systems." Bulletin of Science and Practice 7, no. 6 (June 15, 2021): 12–16. http://dx.doi.org/10.33619/2414-2948/67/01.

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

Анотація:

The subject of the research is one of the ways of updating modern training systems for solving problems of graph theory, namely, automatic generation of graphs. This approach will reduce the load on the training system database and generate tasks for the user in real-time without updating the bank of tasks. In the course of the work, the advantages and disadvantages of this approach were identified. The most suitable method for the implementation of the research was chosen to represent graphs in electronic computers. The requirements for generated graphs and possible ways of implementing these requirements are identified and substantiated. Namely: in the implemented program, simple connected undirected graphs will be generated. We considered an important detail in working with graphs — graph traversal using the “Depth (width) search” algorithm, which in this task is used to check the graph for connectivity. The result of the work is presented — a software implementation of the graph generation algorithm in the C# programming language. In it, graphs are represented by an adjacency list, generated randomly, and checked for connectivity using the DFS (Depth First Search) function. DFS is a software implementation of the Depth First Search algorithm.

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

12

Choi, Dojin, Jinsu Han, Jongtae Lim, Jinsuk Han, Kyoungsoo Bok, and Jaesoo Yoo. "Dynamic Graph Partitioning Scheme for Supporting Load Balancing in Distributed Graph Environments." IEEE Access 9 (2021): 65254–65. http://dx.doi.org/10.1109/access.2021.3075457.

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

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

13

Lü, Yashuai, Hui Guo, Libo Huang, Qi Yu, Li Shen, Nong Xiao, and Zhiying Wang. "GraphPEG." ACM Transactions on Architecture and Code Optimization 18, no. 3 (June 2021): 1–24. http://dx.doi.org/10.1145/3450440.

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

Анотація:

Due to massive thread-level parallelism, GPUs have become an attractive platform for accelerating large-scale data parallel computations, such as graph processing. However, achieving high performance for graph processing with GPUs is non-trivial. Processing graphs on GPUs introduces several problems, such as load imbalance, low utilization of hardware unit, and memory divergence. Although previous work has proposed several software strategies to optimize graph processing on GPUs, there are several issues beyond the capability of software techniques to address. In this article, we present GraphPEG, a graph processing engine for efficient graph processing on GPUs. Inspired by the observation that many graph algorithms have a common pattern on graph traversal, GraphPEG improves the performance of graph processing by coupling automatic edge gathering with fine-grain work distribution. GraphPEG can also adapt to various input graph datasets and simplify the software design of graph processing with hardware-assisted graph traversal. Simulation results show that, in comparison with two representative highly efficient GPU graph processing software framework Gunrock and SEP-Graph, GraphPEG improves graph processing throughput by 2.8× and 2.5× on average, and up to 7.3× and 7.0× for six graph algorithm benchmarks on six graph datasets, with marginal hardware cost.

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

14

He, Kanghang, Lina Stankovic, Jing Liao, and Vladimir Stankovic. "Non-Intrusive Load Disaggregation Using Graph Signal Processing." IEEE Transactions on Smart Grid 9, no. 3 (May 2018): 1739–47. http://dx.doi.org/10.1109/tsg.2016.2598872.

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

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

15

Boillat, J. E. "Load balancing and Poisson equation in a graph." Concurrency: Practice and Experience 2, no. 4 (December 1990): 289–313. http://dx.doi.org/10.1002/cpe.4330020403.

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

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

16

DIVAKARAN, UMA, and AMIT DUTTA. "FIBERS ON A GRAPH WITH LOCAL LOAD SHARING." International Journal of Modern Physics C 18, no. 06 (June 2007): 919–26. http://dx.doi.org/10.1142/s0129183107010632.

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

Анотація:

We study a random fiber bundle model with tips of the fibers placed on a graph having co-ordination number 3. These fibers follow local load sharing with uniformly distributed threshold strengths of the fibers. We have studied the critical behavior of the model numerically using a finite size scaling method and the mean field critical behavior is established. The avalanche size distribution is also found to exhibit a mean field nature in the asymptotic limit.

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

17

Musaev, Timur, Marat Khabibullin, Ramil Kamaliev, Oleg Fedorov, Ilgiz Valeev, and Oleg Vladimirov. "Influence of smart metering systems on increasing the accuracy of calculation electrical power losses in electrical networks." E3S Web of Conferences 220 (2020): 01026. http://dx.doi.org/10.1051/e3sconf/202022001026.

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

Анотація:

The article discusses the possibility of using data from smart electricity meters (SEM) to increase the accuracy of calculation losses in 0.4 kV low-voltage networks. An increase in accuracy can be achieved using actual data about the load graph of electricity consumers (in this case, 6(10)-0.4 kV transformer substations are meant). To date, the operating load factor is taken equal to 0.5, which does not always correspond to the actual data. Using SEM, actual load graphs can be obtained, which enable more accurate determination of the operating load factor. Consequently, the accuracy of calculation of electrical energy losses will be increased.

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

18

Huang, Weidong, Peter Eades, and Seok-Hee Hong. "Measuring Effectiveness of Graph Visualizations: A Cognitive Load Perspective." Information Visualization 8, no. 3 (January 25, 2009): 139–52. http://dx.doi.org/10.1057/ivs.2009.10.

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

Анотація:

Graph visualizations are typically evaluated by comparing their differences in effectiveness, measured by task performance such as response time and accuracy. Such performance-based measures have proved to be useful in their own right. There are some situations, however, where the performance measures alone may not be sensitive enough to detect differences. This limitation can be seen from the fact that the graph viewer may achieve the same level of performance by devoting different amounts of cognitive effort. In addition, it is not often that individual performance measures are consistently in favor of a particular visualization. This makes design and evaluation difficult in choosing one visualization over another. In an attempt to overcome the above-mentioned limitations, we measure the effectiveness of graph visualizations from a cognitive load perspective. Human memory as an information processing system and recent results from cognitive load research are reviewed first. The construct of cognitive load in the context of graph visualization is proposed and discussed. A model of user task performance, mental effort and cognitive load is proposed thereafter to further reveal the interacting relations between these three concepts. A cognitive load measure called mental effort is introduced and this measure is further combined with traditional performance measures into a single multi-dimensional measure called visualization efficiency. The proposed model and measurements are tested in a user study for validity. Implications of the cognitive load considerations in graph visualization are discussed.

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

19

Shao, Jun Peng, Jian Ying Li, Zhong Wen Wang, and Gui Hua Han. "Research on Electro-Hydraulic Load Simulator Based on Building Model of Flow Press Servo Valve." Advanced Materials Research 129-131 (August 2010): 213–17. http://dx.doi.org/10.4028/www.scientific.net/amr.129-131.213.

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

Анотація:

The model of flow press servo valve is built in this paper, during building the model, the author emphatically analyses the flow equation and force (torque) balance equation of every part of the valve, at the same time, all levels sub-models are organic combined according to power flow direction, signal flow direction of elements and causality, then we get the bond graph model of the flow press servo from this way. Adapting flow press servo valve and flow servo valve to concurrently control load system has its great advantage in restraining the superfluous force of the electro-hydraulic load simulator system, the performance such as load precision of system is enhanced greatly according to this method. Based on the system bond graph model, and by comparing the simulation curves and experiment curves, we can know that the simulation curves basically tally with the experiment curves, the bond graph models are validated right, which are flow press servo valve bond graph model and double valves concurrently control the electro-hydraulic load simulator system bond graph model. Simultaneity, the bond graph models in this paper take on generality, they are can be used on other aspects, such as other valve controlling cylinder system simulation, design and control strategy theory research.

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

20

Gedvila, Andrius, and Vadim Mokšin. "FEM Investigation of Load Carrying Capacity of Magnetic Vibration Isolating Supports." Solid State Phenomena 251 (July 2016): 94–99. http://dx.doi.org/10.4028/www.scientific.net/ssp.251.94.

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

Анотація:

The load carrying capacity of self-centering permanent magnet based vibration isolating support is analyzed in the article. COMSOL Multiphysics® modeling software was used for numerical simulation. Results are presented as repulsion force versus support cap displacement graph as well as magnetic flux density distribution graphs. Repulsion force was also measured experimentally. It is established that differences between numerically and experimentally obtained values are only about 2–8%. It is also established that near-zero stiffness of the support is achieved in case of 70 N normal load force.

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

21

Qi, Bing, Liya Liu, and Xin Wu. "Low-rate nonintrusive load disaggregation for resident load based on graph signal processing." IEEJ Transactions on Electrical and Electronic Engineering 13, no. 12 (June 22, 2018): 1833–34. http://dx.doi.org/10.1002/tee.22746.

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

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

22

HOLZRICHTER, MICHAEL, and SUELY OLIVEIRA. "A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM." International Journal of Foundations of Computer Science 10, no. 02 (June 1999): 225–46. http://dx.doi.org/10.1142/s0129054199000162.

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

Анотація:

The problem of partitioning a graph such that the number of edges incident to vertices in different partitions is minimized, arises in many contexts. Some examples include its recursive application for minimizing fill-in in matrix factorizations and load-balancing for parallel algorithms. Spectral graph partitioning algorithms partition a graph using the eigenvector associated with the second smallest eigenvalue of a matrix called the graph Laplacian. The focus of this paper is the use graph theory to compute this eigenvector more quickly.

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

23

Beyer, F., D. Schneider, and A. Schumacher. "Finding three-dimensional layouts for crashworthiness load cases using the graph and heuristic based topology optimization." Structural and Multidisciplinary Optimization 63, no. 1 (November 14, 2020): 59–73. http://dx.doi.org/10.1007/s00158-020-02768-0.

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

Анотація:

AbstractIn this paper we present a new procedure using the graph and heuristic based topology optimization in order to find layouts for three-dimensional frame structures under crash loads. A three-dimensional graph describes the geometry and is used to derive a finite element shell model. The model of the frame structure consists of different profiles with continuous cross-sections. The ends of the profiles are currently rigidly connected. Each cross-section is defined by an individual two-dimensional graph. After performing a simulation its results are used by competing heuristics to propose new topologies for the frame structure. Most of these heuristics are derived from expert knowledge. Over several iterations, the goal is to improve the structures mechanical behavior. Typical objectives are the minimization of the structural intrusion in a crash scenario or the minimization of the maximal contact force between structural components. The presented method includes topology optimization by heuristics and shape optimization respectively sizing by mathematical optimization algorithms. The new flexible syntax for three- and two-dimensional graphs, the optimization process and the currently used heuristics are described. The performance is demonstrated for two examples, each optimized twice with opposing objectives.

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

24

Sun, Jiawen, Hans Vandierendonck, and Dimitrios S. Nikolopoulos. "Fast load balance parallel graph analytics with an automatic graph data structure selection algorithm." Future Generation Computer Systems 112 (November 2020): 612–23. http://dx.doi.org/10.1016/j.future.2020.06.005.

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

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

25

Zheng, Yao, Dong Hua Zhou, Zhi Lun Ouyang, Jing Lin Zhu, and Chun Xiu Han. "Nomo-Graph for Determining the Effective Length of Columns with the Leaning Columns." Applied Mechanics and Materials 610 (August 2014): 88–93. http://dx.doi.org/10.4028/www.scientific.net/amm.610.88.

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

Анотація:

In this paper the elastic load-carrying capacity of the stability columns, which provide lateral support to leaning columns, is investigated. The solution to the effective length of the columns is obtained by using of differential equations. The influences of the leaning columns on the stabilizing columns are studied and the nomo-graphs for determining effective length of the supporting columns are made for practical using. The effective length of columns can be quickly determined by using the nomo-graph, which shows intuitively the trends of the curves in the nomo-graph owing to some relevant parameters.

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

26

He, Kanghang, Vladimir Stankovic, and Lina Stankovic. "Building a Graph Signal Processing Model Using Dynamic Time Warping for Load Disaggregation." Sensors 20, no. 22 (November 19, 2020): 6628. http://dx.doi.org/10.3390/s20226628.

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

Анотація:

Building on recent unsupervised Non-intrusive load monitoring (NILM) algorithms that use graph Laplacian regularization (GLR) and achieve state-of-the-art performance, in this paper, we propose a novel unsupervised approach to design an underlying graph to model the correlation within time-series smart meter measurements. We propose a variable-length data segmentation approach to extract potential events, assign all measurements associated with an identified event to each graph node, employ dynamic time warping to define the adjacency matrix of the graph, and propose a robust cluster labeling approach. Our simulation results on four different datasets show up to 10% improvement in classification performance over competing approaches.

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

27

ELSÄSSER, ROBERT, BURKHARD MONIEN, ROBERT PREIS, and ANDREAS FROMMER. "Optimal Diffusion Schemes and Load Balancing on Product Graphs." Parallel Processing Letters 14, no. 01 (March 2004): 61–73. http://dx.doi.org/10.1142/s0129626404001714.

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

Анотація:

We discuss nearest neighbor load balancing schemes on processor networks which are represented by a cartesian product of graphs and present a new optimal diffusion scheme for general graphs. In the first part of the paper, we introduce the Alternating-Direction load balancing scheme, which reduces the number of load balance iterations by a factor of 2 for cartesian products of graphs. The resulting flow is theoretically analyzed and can be very high for certain cases. Therefore, we further present the Mixed-Direction scheme which needs the same number of iterations but computes in most cases a much smaller flow. In the second part of the paper, we present a simple optimal diffusion scheme for general graphs, calculating a balancing flow which is minimal in the l2 norm. It is based on the spectra of the graph representing the network and needs only m-1 iterations to balance the load with m being the number of distinct eigenvalues. Known optimal diffusion schemes have the same performance, however the optimal scheme presented in this paper can be implemented in a very simple manner. The number of iterations of optimal diffusion schemes is independent of the load scenario and, thus, they are practical for networks which represent graphs with known spectra. Finally, our experiments exhibit that the new optimal scheme can successfully be combined with the Alternating-Direction and Mixed-Direction schemes for efficient load balancing on product graphs.

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

28

Thompson, J. M. T., and G. H. M. van der Heijden. "Quantified "Shock-Sensitivity" Above the Maxwell Load." International Journal of Bifurcation and Chaos 24, no. 03 (March 2014): 1430009. http://dx.doi.org/10.1142/s0218127414300092.

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

Анотація:

Using the static-dynamic analogy, work at Bath and Bristol has uncovered the vital organizing role of the Maxwell "energy criterion" load in the advanced post-buckling of long-thin structures which exhibit severe shell-like imperfection sensitivity. It has become clear that above the Maxwell load, PM, there are localized solutions offering an order-of-magnitude increase in sensitivity to lateral side-loads, whether static or dynamic. We propose to call this "shock-sensitivity", and notice that so far only the seminal paper by Horak et al. in 2006 has quantified this in terms of an E(P) energy-barrier versus load graph. In this paper, we present three graphs of this nature for archetypal problems: the free twisted rod, the cylindrically constrained rod, and the strut on a softening elastic foundation. We find in all cases that the energy barrier of the localizing solution above PM is quite close to the energy of a single periodic wave. Now a single such wave is not kinematically admissible, and the corresponding periodic barrier must be for all the waves in the long structure, N, say. So in practice N will be large, and does indeed tend to infinity with the length of the structure. Thus the sensitivity increases by a factor of a large N as the Maxwell load is exceeded. This is important in its own right, and we do not seek to explain or fit curves to the scattered experimental buckling loads of shell structures.

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

29

Shurygin, Yu A. "Adjusting the Load Graph by Coordinating Major Power Consumers." Steel in Translation 48, no. 1 (January 2018): 67–71. http://dx.doi.org/10.3103/s0967091218010138.

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

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

30

Frank, Susan, and Arie Kaufman. "Dependency graph approach to load balancing distributed volume visualization." Visual Computer 25, no. 4 (September 4, 2008): 325–37. http://dx.doi.org/10.1007/s00371-008-0295-z.

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

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

31

Bazarov, Alexander A., and Alexander I. Danilushkin. "Method for aligning the load graph powerful induction plants." Vestnik of Samara State Technical University. Technical Sciences Series 29, no. 4 (December 15, 2021): 71–85. http://dx.doi.org/10.14498/tech.2021.4.6.

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

Анотація:

The paper deals with the issues of load balancing in the shop power supply system containing powerful electrothermal installations. There is a cyclical change in load parameters with significant variations in current and power factor during operating multi-section induction installations of methodical action. The largest deviations of these parameters occur in transient modes at heater start or at changing the billets nomenclature. It is shown that when the load changes in starting modes, an increase in power and a decrease in the power factor can lead to unacceptable current overloads of the power supply. Correction during start-up of section currents and power factor allows us to reduce current fluctuations, to provide a smoother power diagram and eliminate power supply overload. It is possible to implement current and power factor correction using semiconductor frequency converters in each section. This approach prevents decreasing the voltage quality indicators and reduces possible deviations of the billets temperature distribution. The parameters of the heater sections in transient modes are calculated. The ranges of power, voltage, current and frequency variation are determined, corresponding to the capabilities of semiconductor frequency converters used in these installations. The proposed start-up algorithm provides the smallest of all possible power fluctuations.

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

32

Padilla Garcia, Aaron, Gilberto Gonzalez-Avalos, Gerardo Ayala-Jaimes, Noe Barrera Gallegos, Juancarlos Mendez-B., and David Alvarado-Zamora. "Tracking Control of Physical Systems with Application to a System with a DC Motor: A Bond Graph Approach." Symmetry 14, no. 4 (April 6, 2022): 755. http://dx.doi.org/10.3390/sym14040755.

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

Анотація:

In this paper, the bond graph modeling for the control of tracking systems has been applied. The closed loop system is built by the bond graph model of the system to be controlled, an additional bond graph according to the tracking input signal, and feedback gains in the physical domain. Hence, a procedure to obtain the closed loop tracking system is proposed. The proposal of modeling and tracking control systems in this paper determines symmetries in the bond graph approach with respect to the traditional algebraic approach. The great advantage of this graphical approach is that the mathematical determination of the system model is not necessary. Moreover, the coefficients of the characteristic polynomial using unidirectional causal loops of the closed loop system modeled in bond graphs are obtained. A case of study of a DC motor connected to an electrical supply network and a mechanical load is considered. Tracking control for the step, ramp, and acceleration type input signals in a bond graph approach are applied. In order to show the effectiveness of the proposed procedure, the simulation results are shown.

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

33

Kesavan, S., S. Ramesh, Alexabhishek ., J. S.Sudarsan, P. Vanamoorthy kumaran, and G. Muthukumar. "Buckling Analysis of Belly Shaped Composite Column." International Journal of Engineering & Technology 7, no. 3.12 (July 20, 2018): 715. http://dx.doi.org/10.14419/ijet.v7i3.12.16462.

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

Анотація:

The study of Non prismatic column is designed to minimize the volume of material in the column by changing its shape, the column is subject to both buckling and strength constraints under axial compression load. The belly column is designed as Encased Composite column to improve the strength and ductility of column. The effective use of material through optimal shape of the column. Five models have been created in ANSYS WORKBENCH and all the columns having the same volume of materials, fixed end conditions and length of column. The behaviour of non-prismatic column is always based on tapering ratio and the slenderness ratio of the column. As the taper ratio increases, the elastic buckling load increases and stress decreases in the mean while the maximum stress occurs in the prismatic column compared with the non-prismatic column. As a result of this analysis Equivalent stress, Equivalent elastic strain, Total Deformation and Buckling load Deformation was observed and hence Stress-Strain graphs, Load -Deformation graphs and Mode-Load multiplier graph had been plotted.

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

34

Hiwa, Satoru, Shogo Obuchi, and Tomoyuki Hiroyasu. "Automated Extraction of Human Functional Brain Network Properties Associated with Working Memory Load through a Machine Learning-Based Feature Selection Algorithm." Computational Intelligence and Neuroscience 2018 (2018): 1–12. http://dx.doi.org/10.1155/2018/4835676.

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

Анотація:

Working memory (WM) load-dependent changes of functional connectivity networks have previously been investigated by graph theoretical analysis. However, the extraordinary number of nodes represented within the complex network of the human brain has hindered the identification of functional regions and their network properties. In this paper, we propose a novel method for automatically extracting characteristic brain regions and their graph theoretical properties that reflect load-dependent changes in functional connectivity using a support vector machine classification and genetic algorithm optimization. The proposed method classified brain states during 2- and 3-back test conditions based upon each of the three regional graph theoretical metrics (degree, clustering coefficient, and betweenness centrality) and automatically identified those brain regions that were used for classification. The experimental results demonstrated that our method achieved a >90% of classification accuracy using each of the three graph metrics, whereas the accuracy of the conventional manual approach of assigning brain regions was only 80.4%. It has been revealed that the proposed framework can extract meaningful features of a functional brain network that is associated with WM load from a large number of nodal graph theoretical metrics without prior knowledge of the neural basis of WM.

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

35

Mallet, Vincent, Carlos Oliver, Jonathan Broadbent, William L. Hamilton, and Jérôme Waldispühl. "RNAglib: a python package for RNA 2.5 D graphs." Bioinformatics 38, no. 5 (December 15, 2021): 1458–59. http://dx.doi.org/10.1093/bioinformatics/btab844.

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

Анотація:

Abstract Summary RNA 3D architectures are stabilized by sophisticated networks of (non-canonical) base pair interactions, which can be conveniently encoded as multi-relational graphs and efficiently exploited by graph theoretical approaches and recent progresses in machine learning techniques. RNAglib is a library that eases the use of this representation, by providing clean data, methods to load it in machine learning pipelines and graph-based deep learning models suited for this representation. RNAglib also offers other utilities to model RNA with 2.5 D graphs, such as drawing tools, comparison functions or baseline performances on RNA applications. Availability and implementation The method is distributed as a pip package, RNAglib. Data are available in a repository and can be accessed on rnaglib's web page. The source code, data and documentation are available at https://rnaglib.cs.mcgill.ca. Supplementary information Supplementary data are available at Bioinformatics online.

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

36

Lee, Shiowjen, S. Durham, and J. Lynch. "On the calculation of the reliability of general load sharing systems." Journal of Applied Probability 32, no. 3 (September 1995): 777–92. http://dx.doi.org/10.2307/3215129.

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

Анотація:

Harlow et al. (1983) have given a recursive formula which is fundamental for computing the bundle strength distribution under a general class of load sharing rules called monotone load sharing rules. As the bundle size increases, the formula becomes prohibitively complex and, by itself, does not give much insight into the relationship of the assumed load sharing rule to the overall strength distribution. In this paper, an algorithm is given which gives some additional insight into this relationship. Here it is shown how to explicitly compute the bundle strength survival distribution by using a new type of graph called the loading diagram. The graph is parallel in structure and recursive in nature and so would appear to lend itself to large-scale computation. In addition, the graph has an interesting property (which we refer to as the cancellation property) which is related to the asymptotics of the Weibull as a minimum stable law.

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

37

Lee, Shiowjen, S. Durham, and J. Lynch. "On the calculation of the reliability of general load sharing systems." Journal of Applied Probability 32, no. 03 (September 1995): 777–92. http://dx.doi.org/10.1017/s0021900200103201.

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

Анотація:

Harlow et al. (1983) have given a recursive formula which is fundamental for computing the bundle strength distribution under a general class of load sharing rules called monotone load sharing rules. As the bundle size increases, the formula becomes prohibitively complex and, by itself, does not give much insight into the relationship of the assumed load sharing rule to the overall strength distribution. In this paper, an algorithm is given which gives some additional insight into this relationship. Here it is shown how to explicitly compute the bundle strength survival distribution by using a new type of graph called the loading diagram. The graph is parallel in structure and recursive in nature and so would appear to lend itself to large-scale computation. In addition, the graph has an interesting property (which we refer to as the cancellation property) which is related to the asymptotics of the Weibull as a minimum stable law.

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

38

Soukov, Sergey A. "Load balancing method for heterogeneous CFD algorithms." Zhurnal Srednevolzhskogo Matematicheskogo Obshchestva 23, no. 2 (June 30, 2021): 193–206. http://dx.doi.org/10.15507/2079-6900.23.202102.193-206.

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

Анотація:

Abstract. The problem of load balancing for unstructured heterogeneous numerical algorithms for simulation of physical processes is considered. A computational distribution method for hybrid supercomputers with multicore CPUs and massively parallel accelerators is described. The load balancing procedure includes determination of dual graph vertices and edges weights, devices’ performance test and two-level decomposition of the computational mesh based on domain decomposition method. First level decomposition involves the graph partitioning between supercomputer nodes. On the second level node subdomains are partitioned between the MPI- processes running on the nodes. The details of the proposed approach are considered on the example of an unstructured finite-volume algorithm for modeling the Navier-Stokes equations with polynomial reconstruction of variables and explicit time integration scheme. The parallel version of the algorithm is developed using the MPI, OpenMP and CUDA programming models. The parameters of performance, parallel efficiency and scalability of the heterogeneous program are given. The results mentioned are obtained during the simulation of a supersonic flow around a sphere on a mixed mesh consisting of tetrahedrons, triangular prisms, quadrangular pyramids and hexagons.

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

39

Arkhipova, O. V., N. N. Dolgikh, S. Yu Dolinger, V. Z. Kovalev, and D. S. Osipov. "Wavelet transform algorithm of daily load graphs for choosing parameters of hybrid energy storage." Omsk Scientific Bulletin, no. 174 (2020): 57–62. http://dx.doi.org/10.25206/1813-8225-2020-174-57-62.

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

Анотація:

The paper presents an algorithm for frequency decomposition of daily load graphs based on a discrete wavelet transform. This algorithm makes it possible to choose the optimal type of wavelet function, optimal level and wavelet decomposition tree. The inverse wavelet transform (recovery) along a single branch of the approximating coefficient allows obtaining the lowfrequency component of the power graph for selecting the optimal mode of the hybrid energy storage battery. The detailing branch of the wavelet coefficients determines the operating mode of the supercapacitor. A numerical experiment is built on the basis of data obtained using certified equipment

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

40

Davoudian, Ali, Liu Chen, Hongwei Tu, and Mengchi Liu. "A Workload-Adaptive Streaming Partitioner for Distributed Graph Stores." Data Science and Engineering 6, no. 2 (April 15, 2021): 163–79. http://dx.doi.org/10.1007/s41019-021-00156-2.

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

Анотація:

AbstractStreaming graph partitioning methods have recently gained attention due to their ability to scale to very large graphs with limited resources. However, many such methods do not consider workload and graph characteristics. This may degrade the performance of queries by increasing inter-node communication and computational load imbalance. Moreover, existing workload-aware methods cannot consistently provide good performance as they do not consider dynamic workloads that keep emerging in graph applications. We address these issues by proposing a novel workload-adaptive streaming partitioner named WASP, that aims to achieve low-latency and high-throughput online graph queries. As each workload typically contains frequent query patterns, WASP exploits the existing workload to capture active vertices and edges which are frequently visited and traversed, respectively. This information is used to heuristically improve the quality of partitions either by avoiding the concentration of active vertices in a few partitions proportional to their visit frequencies or by reducing the probability of the cut of active edges proportional to their traversal frequencies. In order to assess the impact of WASP on a graph store and to show how easily the approach can be plugged on top of the system, we exploit it in a distributed graph-based RDF store. Our experiments over three synthetic and real-world graph datasets and the corresponding static and dynamic query workloads show that WASP achieves a better query performance against state-of-the-art graph partitioners, especially in dynamic query workloads.

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

41

Quanyi, Hu, Zhang Hong, Tian Shujun, and Qin Xuxin. "Performances analysis of a novel load-sensing hydraulic system with overriding differential pressure control." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 231, no. 23 (September 3, 2016): 4331–43. http://dx.doi.org/10.1177/0954406216667760.

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

Анотація:

The traditional load-sensing hydraulic system is an energy-saving fluid power transmission, which supply “on-demand” flow at a prescribed pressure margin greater than the highest load pressure of the system. In this paper, a novel load-sensing system that has a variable pressure margin through overriding differential pressure control via integrating an electro-proportional three-way type pressure reducing valve into the hydro-mechanical load-sensing valve is proposed. Also, a bond graph model taking into account the dynamic characteristics of load-sensing valve and load-sensing path is constructed, and three group experiments are performed to verify the validation of the model. Based on the bond graph model, a series of theoretical simulations are carried out to prove that the proposed Load-Sensing system enables a satisfactory balance between energy efficiency and rapid dynamic response over a wide range of operating conditions. In addition, due to overriding differential pressure control, mode selection and power limit regulation can also be achieved.

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

42

Nurazmi, Nurazmi, A. Taufik Hidayat Prayuda, Nurul Ainun Maudil Khawair, Harni Harni, Surya Sutriana, and Riska Riska. "An Analysis on the Relationship between the Number of Particles and the Volume by Using the Gas Kinetic Theory Model." Jurnal Pendidikan Fisika 8, no. 1 (January 30, 2020): 87–93. http://dx.doi.org/10.26618/jpf.v8i1.3110.

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

Анотація:

This study aims at finding out the relationship between the number of particles and the volume by using the gas kinetic theory model. In this study, the data collection was conducted three times employing different particle numbers, namely 10 particles, 20 particles and 30 particles group. During the data collection process, the scale reading of the load height was done when the load collision has been going on for 20 seconds. Based on the observations, it can be obtained that the more the number of particles, the greater the volume. The graph analysis also reveals that the slope of the three graphs varies. Graph 4.1 and graph 4.2 share the same slope that is 0.1, while the slope of graph 4.3 is 0.095. The slope of the graph illustrates that once the number of particle increases, the position of the piston will also go up. In other words, it can be said that the changes in the position of the piston (v) is directly proportional to the number of particles (n).Keywords: Kinetic Theory Of Gases, Volume, Piston Position, ParticlePenelitian ini bertujuan untuk mengetahui hubungan jumlah partikel dengan volume menggunakan model teori kinetic gas. Pada penelitian ini, pengambilan data dilakukan sebanyak tiga kali dengan jumlah partikel yang berbeda-beda yaitu 10 partikel, 20 partikel dan 30 partikel. Pada proses pengambilan data yang dilakukan, pembacaan skala ketinggian beban dilakukan ketika penumbukan beban telah berlangsung selama 20 detik. Berdasarkan hasil pengamatan diperoleh bahwa semakin banyak jumlah partikel maka volumenya akan semakin besar pula. Dari hasil analisis grafik diperoleh kemiringan pada grafik 4.1 yaitu 0,1, grafik 4.2 diperoleh kemiringan 0,1 dan grafik 4.3 diperoleh kemiringan 0,095. Kemiringan grafik menggambarkan bahwa setiap pertambahan partikel bertambah pula kedudukan piston atau dapat dikatakan hubungan antara perubahan kedudukan piston (v) berbanding lurus dengan jumlah partikel (n).Kata kunci: Teori Kinetik Gas, Volume, Kedudukan Piston, Partikel

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

43

Saberi, Leila, and Mohammad Hossein Niksokhan. "Optimal waste load allocation using graph model for conflict resolution." Water Science and Technology 75, no. 6 (January 25, 2017): 1512–22. http://dx.doi.org/10.2166/wst.2016.429.

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

Анотація:

In this paper, a new methodology is proposed for waste load allocation in river systems using the decision support system (DSS) for the graph model for conflict resolution II (GMCRII), multi-criteria decision making (MCDM) analysis and the Multi-Objective Particle Swarm Optimization (MOPSO) algorithm. Minimization of total treatment and penalty costs and minimization of biological oxygen demand violation of standards at the check point are considered as the main objectives of this study. At first, the water quality along the river was simulated using the Streeter-Phelps (S-P) equation coupled with the MOPSO model. Thereby a trade-off curve between the objectives is obtained and a set of non-dominated solutions is selected. In the next step, the best alternative is chosen using MCDM techniques and the GMCRII DSS package and non-cooperative stability definitions. The applicability and efficiency of the methodology are examined in a real-world case study of the Sefidrud River in the northern part of Iran.

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

44

Lam, Le Hong, Nguyen Huu Hieu, Ngo Minh Khoa, Nguyen Thanh Minh, and Tran Tan Vinh. "Solution to Handle Missing Data in Create Typical Load Graph." IOP Conference Series: Earth and Environmental Science 505 (July 18, 2020): 012046. http://dx.doi.org/10.1088/1755-1315/505/1/012046.

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

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

45

Ningning, Song, Gong Chao, An Xingshuo, and Zhan Qiang. "Fog computing dynamic load balancing mechanism based on graph repartitioning." China Communications 13, no. 3 (March 2016): 156–64. http://dx.doi.org/10.1109/cc.2016.7445510.

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

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

46

Dinesh, Chinthaka, Stephen Makonin, and Ivan V. Bajic. "Residential Power Forecasting Using Load Identification and Graph Spectral Clustering." IEEE Transactions on Circuits and Systems II: Express Briefs 66, no. 11 (November 2019): 1900–1904. http://dx.doi.org/10.1109/tcsii.2019.2891704.

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

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

47

Kirkland, Steve. "Load balancing for Markov chains with a specified directed graph." Linear and Multilinear Algebra 62, no. 11 (January 9, 2014): 1491–508. http://dx.doi.org/10.1080/03081087.2013.837050.

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

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

48

Hosseini, S. H., B. Litow, M. Malkawi, J. McPherson, and K. Vairavan. "Analysis of a graph coloring based distributed load balancing algorithm." Journal of Parallel and Distributed Computing 10, no. 2 (October 1990): 160–66. http://dx.doi.org/10.1016/0743-7315(90)90025-k.

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

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

49

Tao, Peng, Fei Xu, Zengbo Dong, Chao Zhang, Xuefeng Peng, Junpeng Zhao, Kangping Li, and Fei Wang. "Graph convolutional network-based aggregated demand response baseline load estimation." Energy 251 (July 2022): 123847. http://dx.doi.org/10.1016/j.energy.2022.123847.

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

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

50

Shahrivari, Saeed, and Saeed Jalili. "Fast Parallel All-Subgraph Enumeration Using Multicore Machines." Scientific Programming 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/901321.

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

Анотація:

Enumerating all subgraphs of an input graph is an important task for analyzing complex networks. Valuable information can be extracted about the characteristics of the input graph using all-subgraph enumeration. Notwithstanding, the number of subgraphs grows exponentially with growth of the input graph or by increasing the size of the subgraphs to be enumerated. Hence, all-subgraph enumeration is very time consuming when the size of the subgraphs or the input graph is big. We propose a parallel solution namedSubenumwhich in contrast to available solutions can perform much faster. Subenum enumerates subgraphs using edges instead of vertices, and this approach leads to a parallel and load-balanced enumeration algorithm that can have efficient execution on current multicore and multiprocessor machines. Also, Subenum uses a fast heuristic which can effectively accelerate non-isomorphism subgraph enumeration. Subenum can efficiently use external memory, and unlike other subgraph enumeration methods, it is not associated with the main memory limits of the used machine. Hence, Subenum can handle large input graphs and subgraph sizes that other solutions cannot handle. Several experiments are done using real-world input graphs. Compared to the available solutions, Subenum can enumerate subgraphs several orders of magnitude faster and the experimental results show that the performance of Subenum scales almost linearly by using additional processor cores.

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

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