Relevant bibliographies by topics / K-graph system

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'K-graph system'

Author: Grafiati
Published: 25 May 2024
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'K-graph system.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "K-graph system"

1

Asif, Muhammad, Hamad Almohamedh, Muhammad Hussain, Khalid M. Alhamed, Abdulrazaq A. Almutairi, and Sultan Almotairi. "An Approach to the Geometric-Arithmetic Index for Graphs under Transformations’ Fact over Pendent Paths." Complexity 2021 (June 24, 2021): 1–13. http://dx.doi.org/10.1155/2021/3745862.

Full text
Abstract:
Graph theory is a dynamic tool for designing and modeling of an interconnection system by a graph. The vertices of such graph are processor nodes and edges are the connections between these processors nodes. The topology of a system decides its best use. Geometric-arithmetic index is one of the most studied graph invariant to characterize the topological aspects of underlying interconnection networks or graphs. Transformation over graph is also an important tool to define new network of their own choice in computer science. In this work, we discuss transformed family of graphs. Let Γ n k , l b
APA, Harvard, Vancouver, ISO, and other styles
2

Il’ev, A. V., and V. P. Il’ev. "ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS." Prikladnaya Diskretnaya Matematika, no. 53 (2021): 89–102. http://dx.doi.org/10.17223/20710410/53/6.

Full text
Abstract:
The aim of the paper is to study and to solve finite systems of equations over finite undirected graphs. Equations over graphs are atomic formulas of the language L consisting of the set of constants (graph vertices), the binary vertex adjacency predicate and the equality predicate. It is proved that the problem of checking compatibility of a system of equations S with k variables over an arbitrary simple n-vertex graph Γ is N P-complete. The computational complexity of the procedure for checking compatibility of a system of equations S over a simple graph Γ and the procedure for finding a gen
APA, Harvard, Vancouver, ISO, and other styles
3

RANAWAKE, U. A., P. M. LENDERS, and S. M. GOODNICK. "ON LOWER BOUNDS FOR THE COMMUNICATION VOLUME IN DISTRIBUTED SYSTEMS." Parallel Processing Letters 01, no. 02 (1991): 125–33. http://dx.doi.org/10.1142/s0129626491000070.

Full text
Abstract:
In this paper we derive a lower bound for the total communication volume when mapping arbitrary task graphs onto a distributed processor system. For a K processor system this lower bound can be computed with only the K (possibly) largest eigen values of the adjacency matrix of the task graph and the eigen values of the adjacency matrix of the processor graph. We also derive the eigen values of the adjacency matrix of the processor graph for a hypercube multiprocessor and illustrate the concept with a simple example for the two processor case.
APA, Harvard, Vancouver, ISO, and other styles
4

Hong, Yanmei, Yihong Wu, and Qinghai Liu. "Redundant Trees in Bipartite Graphs." Mathematics 13, no. 6 (2025): 1005. https://doi.org/10.3390/math13061005.

Full text
Abstract:
It has been conjectured that for each positive integer k and each tree T with bipartite (Z1,Z2), every k-connected bipartite graph G with δ(G)≥k+max{|Z1|,|Z2|} admits a subgraph T′≅T such that G−V(T′) is still k-connected. In this paper, we generalize the ear decompositions of 2-connected graphs into a (k,ak)-extensible system for a general k-connected graph. As a result, we confirm the conjecture for k≤3 by proving a slightly stronger version of it.
APA, Harvard, Vancouver, ISO, and other styles
5

Ustimenko, Vasyl O., and Oleksandr S. Pustovit. "On security of GIS systems with N-tier architecture and family of graph based ciphers." Environmental safety and natural resources 47, no. 3 (2023): 113–32. http://dx.doi.org/10.32347/2411-4049.2023.3.113-132.

Full text
Abstract:
Discovery of q-regular tree description in terms of an infinite system of quadratic equations over finite field Fq had an impact on Computer Science, theory of graph based cryptographic algorithms in particular. It stimulates the development of new graph based stream ciphers. It turns out that such encryption instruments can be efficiently used in GIS protection systems which use N-Tier Architecture. We observe known encryption algorithms based on the approximations of regular tree, their modifications defined over arithmetical rings and implementations of these ciphers. Additionally new more
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Haiyan, and Fuji Zhang. "Spectral Dynamics of Graph Sequences Generated by Subdivision and Triangle Extension." Electronic Journal of Linear Algebra 32 (February 6, 2017): 454–63. http://dx.doi.org/10.13001/1081-3810.3583.

Full text
Abstract:
For a graph G and a unary graph operation X, there is a graph sequence \G_k generated by G_0=G and G_{k+1}=X(G_k). Let Sp({G_k}) denote the set of normalized Laplacian eigenvalues of G_k. The set of limit points of \bigcup_{k=0}^\infty Sp(G_k)$, $\liminf_{k\rightarrow\infty}Sp(G_k) and $\limsup_{k\rightarrow \infty}Sp(G_k)$ are considered in this paper for graph sequences generated by two operations: subdivision and triangle extension. It is obtained that the spectral dynamic of graph sequence generated by subdivision is determined by a quadratic function, which is closely related to the the w
APA, Harvard, Vancouver, ISO, and other styles
7

Ngo, Tien, Jiao Yin, Yong-Feng Ge, and Hua Wang. "Optimizing IoT Intrusion Detection—A Graph Neural Network Approach with Attribute-Based Graph Construction." Information 16, no. 6 (2025): 499. https://doi.org/10.3390/info16060499.

Full text
Abstract:
The inherent complexity and heterogeneity of the Internet of Things (IoT) ecosystem present significant challenges for developing effective intrusion detection systems. While graph deep-learning-based methods have shown promise in cybersecurity applications, existing approaches primarily construct graphs based on physical network connections, which may not effectively capture node representations. This paper proposes a Top-K Similarity Graph Framework (TKSGF) for IoT network intrusion detection. Instead of relying on physical links, the TKSGF constructs graphs based on Top-K attribute similari
APA, Harvard, Vancouver, ISO, and other styles
8

Shirdel, G. H., M. Ghanbari, and M. Ramezani. "Generalized 3-Rainbow Domination in Graphs and Honeycomb System (HC(n))." Utilitas Mathematica 119, no. 1 (2024): 3–7. http://dx.doi.org/10.61091/um119-01.

Full text
Abstract:
In this paper, we introduce the concept of the generalized 3 -rainbow dominating function of a graph G . This function assigns an arbitrary subset of three colors to each vertex of the graph with the condition that every vertex (including its neighbors) must have access to all three colors within its closed neighborhood. The minimum sum of assigned colors over all vertices of G is defined as the g 3 -rainbow domination number, denoted by γ g 3 r . We present a linear-time algorithm to determine a minimum generalized 3-rainbow dominating set for several graph classes: trees, paths ( P n ) , cyc
APA, Harvard, Vancouver, ISO, and other styles
9

Razumovsky, P. V., and M. B. Abrosimov. "THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS." Bulletin of the South Ural State University series "Mathematics. Mechanics. Physics" 13, no. 4 (2021): 77–89. http://dx.doi.org/10.14529/mmph210409.

Full text
Abstract:
The article proposes the results of the search for minimal vertex extensions of undirected colored complete graphs. The research topic is related to the modelling of full fault tolerant technical systems with a different type of their objects in the terminology of graph theory. Let a technical system be Σ, then there is a graph G(Σ), which vertices reflects system’s objects and edges reflects connections between these objects. Type of each object reflected in a mapping of some color from F = {1,2…,i} to the corresponding vertex. System’s Σ vertex extension is a graph G(Σ) which contains additi
APA, Harvard, Vancouver, ISO, and other styles
10

Lobov, Alexander A., and Mikhail B. Abrosimov. "About uniqueness of the minimal 1-edge extension of hypercube Q4." Prikladnaya Diskretnaya Matematika, no. 58 (2023): 84–93. http://dx.doi.org/10.17223/20710410/58/8.

Full text
Abstract:
One of the important properties of reliable computing systems is their fault tolerance. To study fault tolerance, you can use the apparatus of graph theory. Minimal edge extensions of a graph are considered, which are a model for studying the failure of links in a computing system. A graph G* = (V*,α*) with n vertices is called a minimal k-edge extension of an n-vertex graph G = (V, α) if the graph G is embedded in every graph obtained from G* by deleting any of its k edges and has the minimum possible number of edges. The hypercube Qn is a regular 2n-vertex graph of order n, which is the Cart
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "K-graph system"

1

Wang, Bin. "Rainbow structures in properly edge-colored graphs and hypergraph systems." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG016.

Full text
Abstract:
La combinatoire extrémale est l'une des branches les plus vigoureuses des mathématiques combinatoires au cours des dernières décennies, et elle a été largement utilisée en informatique, en conception de réseaux et en conception de codage. Elle se concentre sur la détermination de la taille maximale ou minimale possible de certaines structures combinatoires, sous certaines conditions ou contraintes. Les ensembles hôtes peuvent être des graphes, des digraphes, des graphes aléatoires, des hypergraphes, des entiers, des nombres premiers, des ensembles, des graphes avec arêtes colorées, etc. Les st
APA, Harvard, Vancouver, ISO, and other styles
2

Dyck, Johannes [Verfasser], Holger [Akademischer Betreuer] Giese, Holger [Gutachter] Giese, Arend [Gutachter] Rensink, and Heike [Gutachter] Wehrheim. "Verification of graph transformation systems with k-inductive invariants / Johannes Dyck ; Gutachter: Holger Giese, Arend Rensink, Heike Wehrheim ; Betreuer: Holger Giese." Potsdam : Universität Potsdam, 2020. http://d-nb.info/121816980X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Xiaohu. "Security Analysis on Network Systems Based on Some Stochastic Models." ScholarWorks@UNO, 2014. http://scholarworks.uno.edu/td/1931.

Full text
Abstract:
Due to great effort from mathematicians, physicists and computer scientists, network science has attained rapid development during the past decades. However, because of the complexity, most researches in this area are conducted only based upon experiments and simulations, it is critical to do research based on theoretical results so as to gain more insight on how the structure of a network affects the security. This dissertation introduces some stochastic and statistical models on certain networks and uses a k-out-of-n tolerant structure to characterize both logically and physically the behavi
APA, Harvard, Vancouver, ISO, and other styles
4

Swailes, David. "Some topics in industrial mathematics arising from a multi-national company : gel electrophoresis graph matching algorithm; modelling H'+ and K'+ transport across cell membranes; and micellization and adsorption processes in micellar systems." Thesis, University of Strathclyde, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339870.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Davison, Benjamin Kenneth. "Universal graph literacy: understanding how blind and low vision students can satisfy the common core standards with accessible auditory graphs." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47621.

Full text
Abstract:
Auditory graphs and active point estimation provide an inexpensive, accessible alternative for low vision and blind K-12 students using number lines and coordinate graphs. In the first phase of this research program, a series of four psychophysics studies demonstrated an interactive auditory number line that enables blind, low vision, and sighted people to find small targets with a laptop, headphones, and a mouse or a keyboard. The Fitts' Law studies showed that, given appropriate auditory feedback, blind people can use a mouse. In addition, auditory feedback can generate target response patte
APA, Harvard, Vancouver, ISO, and other styles
6

Морозов, Костянтин В’ячеславович. "Методи і засоби побудови моделей поведінки небазових відмовостійких багатопроцесорних систем". Doctoral thesis, Київ, 2021. https://ela.kpi.ua/handle/123456789/40485.

Full text
Abstract:
Дисертація присвячена проблемі побудови графо-логічних моделей (GL-моделей) небазових відмовостійких багатопроцесорних систем (ВБС) з метою розрахунку їх параметрів надійності шляхом проведення статистичних експериментів із вищезгаданими моделями. Запропоновано метод перетворення GL-моделей за рахунок модифікації виразу будь-якої реберної функції так званої МВР-моделі. Метод базуються на зміні як однієї, так і обох частин виразу реберної функції та дозволяє модифікувати модель так, що на деяких векторах стану системи вона, на відміну від оригінальної, починає показувати роботозд
APA, Harvard, Vancouver, ISO, and other styles
7

Bodin, Bruno. "Analyse d'Applications Flot de Données pour la Compilation Multiprocesseur." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2013. http://tel.archives-ouvertes.fr/tel-00922578.

Full text
Abstract:
Les systèmes embarqués sont des équipements électroniques et informatiques, soumis à de nombreuses contraintes et dont le fonctionnement doit être continu. Pour définir le comportement de ces systèmes, les modèles de programmation dataflows sont souvent utilisés. Ce choix de modèle est motivé d'une part, parce qu'ils permettent de décrire un comportement cyclique, nécessaire aux systèmes embarqués ; et d'autre part, parce que ces modèles s'apprêtent à des analyses qui peuvent fournir des garanties de fonctionnement et de performance essentielles. La société Kalray propose une architecture emba
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "K-graph system"

1

Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. "A Direct Symbolic Algorithm for Solving Stochastic Rabin Games." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99527-0_5.

Full text
Abstract:
AbstractWe consider turn-based stochastic 2-player games on graphs with $$\omega $$ ω -regular winning conditions. We provide a direct symbolic algorithm for solving such games when the winning condition is formulated as a Rabin condition. For a stochastic Rabin game with k pairs over a game graph with n vertices, our algorithm runs in $$O(n^{k+2}k!)$$ O ( n k + 2 k ! ) symbolic steps, which improves the state of the art.We have implemented our symbolic algorithm, along with performance optimizations including parallellization and acceleration, in a BDD-based synthesis tool called . We demonst
APA, Harvard, Vancouver, ISO, and other styles
2

Sun, Wei, Laisheng Xiang, Xiyu Liu, and Dan Zhao. "An Improved K-medoids Clustering Algorithm Based on a Grid Cell Graph Realized by the P System." In Human Centered Computing. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-31854-7_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Morais, Bruno, Miguel E. Coimbra, and Luís Veiga. "PK-Graph: Partitioned $$k^2$$-Trees to Enable Compact and Dynamic Graphs in Spark GraphX." In Cooperative Information Systems. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17834-4_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Larsen, Casper Abild, Simon Meldahl Schmidt, Jesper Steensgaard, Anna Blume Jakobsen, Jaco van de Pol, and Andreas Pavlogiannis. "A Truly Symbolic Linear-Time Algorithm for SCC Decomposition." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_22.

Full text
Abstract:
AbstractDecomposing a directed graph to its strongly connected components (SCCs) is a fundamental task in model checking. To deal with the state-space explosion problem, graphs are often represented symbolically using binary decision diagrams (BDDs), which have exponential compression capabilities. The theoretically-best symbolic algorithm for SCC decomposition is Gentilini et al’s $$\textsc {Skeleton}$$ S K E L E T O N algorithm, that uses O(n) symbolic steps on a graph of n nodes. However, $$\textsc {Skeleton}$$ S K E L E T O N uses $$\Theta (n)$$ Θ ( n ) symbolic objects, as opposed to (pol
APA, Harvard, Vancouver, ISO, and other styles
5

Zou, Lei, Lei Chen, and Yansheng Lu. "Top-K Correlation Sub-graph Search in Graph Databases." In Database Systems for Advanced Applications. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00887-0_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Stokes, Klara. "Graph k-Anonymity through k-Means and as Modular Decomposition." In Secure IT Systems. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41488-6_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Subercaseaux, Bernardo, and Marijn J. H. Heule. "The Packing Chromatic Number of the Infinite Square Grid is 15." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_20.

Full text
Abstract:
AbstractA packing k-coloring is a natural variation on the standard notion of graph k-coloring, where vertices are assigned numbers from $$\{1, \ldots , k\}$$ { 1 , … , k } , and any two vertices assigned a common color $$c \in \{1, \ldots , k\}$$ c ∈ { 1 , … , k } need to be at a distance greater than c (as opposed to 1, in standard graph colorings). Despite a sequence of incremental work, determining the packing chromatic number of the infinite square grid has remained an open problem since its introduction in 2002. We culminate the search by proving this number to be 15. We achieve this res
APA, Harvard, Vancouver, ISO, and other styles
8

Nayak, Satya Prakash, and Anne-Kathrin Schmuck. "Most General Winning Secure Equilibria Synthesis in Graph Games." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57256-2_9.

Full text
Abstract:
AbstractThis paper considers the problem of co-synthesis in k-player games over a finite graph where each player has an individual $$\omega $$ ω -regular specification $$\phi _i$$ ϕ i . In this context, a secure equilibrium (SE) is a Nash equilibrium w.r.t. the lexicographically ordered objectives of each player to first satisfy their own specification, and second, to falsify other players’ specifications. A winning secure equilibrium (WSE) is an SE strategy profile $$(\pi _i)_{i\in [1;k]}$$ ( π i ) i ∈ [ 1 ; k ] that ensures the specification $$\phi :=\bigwedge _{i\in [1;k]}\phi _i$$ ϕ : = ⋀
APA, Harvard, Vancouver, ISO, and other styles
9

Hausmann, Daniel, and Lutz Schröder. "Quasipolynomial Computation of Nested Fixpoints." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_3.

Full text
Abstract:
AbstractIt is well-known that the winning region of a parity game with n nodes and k priorities can be computed as a k-nested fixpoint of a suitable function; straightforward computation of this nested fixpoint requires $$\mathcal {O}(n^{\frac{k}{2}})$$ O ( n k 2 ) iterations of the function. Calude et al.’s recent quasipolynomial-time parity game solving algorithm essentially shows how to compute the same fixpoint in only quasipolynomially many iterations by reducing parity games to quasipolynomially sized safety games. Universal graphs have been used to modularize this transformation of pari
APA, Harvard, Vancouver, ISO, and other styles
10

Vasilyeva, Elena, Maik Thiele, Christof Bornhövd, and Wolfgang Lehner. "Top-k Differential Queries in Graph Databases." In Advances in Databases and Information Systems. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10933-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "K-graph system"

1

Zhang, Jin, Yimin Yang, Xiaoheng Wu, and Honggang Wang. "K-shape-based spatio-temporal graph attention network for traffic flow prediction." In Fourth International Conference on Intelligent Traffic Systems and Smart City (ITSSC 2024), edited by Hao Chen and Wei Shangguan. SPIE, 2025. https://doi.org/10.1117/12.3050703.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kocan, F. "Reconfigurable randomized K-way graph partitioning." In Proceedings. Euromicro Symposium on Digital System Design. IEEE, 2003. http://dx.doi.org/10.1109/dsd.2003.1231947.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Penghe, Yu Lu, Vincent W. Zheng, Xiyang Chen, and Xiaoqing Li. "An automatic knowledge graph construction system for K-12 education." In L@S '18: Fifth (2018) ACM Conference on Learning @ Scale. ACM, 2018. http://dx.doi.org/10.1145/3231644.3231698.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Yan, Amar Henni, Azade Fotouhi, and Leopold Mvondo Ze. "Leveraging K-hop based Graph for the Staffing Recommender System with Parametric Geolocation." In 2022 International Conference on Computational Science and Computational Intelligence (CSCI). IEEE, 2022. http://dx.doi.org/10.1109/csci58124.2022.00122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Asgari, Zahra, and Maryam Sadat Mastoori. "Binomial Distribution based K-means for Graph Partitioning Approach in Partially Reconfigurable Computing system." In 2021 29th Iranian Conference on Electrical Engineering (ICEE). IEEE, 2021. http://dx.doi.org/10.1109/icee52715.2021.9544358.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Asgari, Zahra, and Maryam Sadat Mastoori. "Binomial Distribution based K-means for Graph Partitioning Approach in Partially Reconfigurable Computing system." In 2021 29th Iranian Conference on Electrical Engineering (ICEE). IEEE, 2021. http://dx.doi.org/10.1109/icee52715.2021.9544358.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Riveret, Regis, Son Tran, and Artur d'Avila Garcez. "Neuro-Symbolic Probabilistic Argumentation Machines." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/90.

Full text
Abstract:
Neural-symbolic systems combine the strengths of neural networks and symbolic formalisms. In this paper, we introduce a neural-symbolic system which combines restricted Boltzmann machines and probabilistic semi-abstract argumentation. We propose to train networks on argument labellings explaining the data, so that any sampled data outcome is associated with an argument labelling. Argument labellings are integrated as constraints within restricted Boltzmann machines, so that the neural networks are used to learn probabilistic dependencies amongst argument labels. Given a dataset and an argument
APA, Harvard, Vancouver, ISO, and other styles
8

Sun, Sichao, Xinyu Xia, Jiale Yang, and Hua Zhou. "Fault Diagnosis of Pump Rotor-Bearing System Based on Frequency Temporal Series Graph Under Time-Varying Speed Conditions." In BATH/ASME 2024 Symposium on Fluid Power and Motion Control. American Society of Mechanical Engineers, 2024. http://dx.doi.org/10.1115/fpmc2024-139566.

Full text
Abstract:
Abstract The pump serves as crucial power component in the hydraulic system. In the actual working process, it often runs in time-varying speed conditions such as startup, shutdown, acceleration, and deceleration, which makes the rotor-bearing system in the pump often work in an unstable environment and prone to failure. Most of the existing fault diagnosis researches are based on vibration signals. However, variations in rotational speed over time will also induce changes in vibration signal, which will cover the signal change caused by the fault of the system itself, resulting in confusion o
APA, Harvard, Vancouver, ISO, and other styles
9

Stańczak, Jarosław, Jan Owsiński, Barbara Mażbic-Kulma, Aleksy Barski, and Krzysztof Sęp. "Evolutionary k-means Graph Clustering Method to Obtain the hub&spoke Structure for Warsaw Communication System." In 18th Conference on Computer Science and Intelligence Systems. PTI, 2023. http://dx.doi.org/10.15439/2023f9176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Briggs, Shannon, Emily Conway, Clare Arrington, et al. "Novice and expert performance in a knowledge graph-driven assistive dialogue system." In 16th International Conference on Applied Human Factors and Ergonomics (AHFE 2025). AHFE International, 2025. https://doi.org/10.54941/ahfe1006139.

Full text
Abstract:
This paper describes a LLM-supported assistive dialog system and a proposed evaluation methodology for this system, developed for Air Force intelligence analysts in intelligence reporting scenarios. Part of this technology has previously been described in other work which developed the core technology of the assistive dialog function (Sanders, A). This paper expands the previous system by incorporating RAG with a recommendation system. This recommendation system is informed by knowledge graphs. These knowledge graphs describe analysts’ progress through information foraging and sensemaking proc
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'K-graph system' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography