Results 21 to 30 of about 134 (105)
IET Cyber-Physical Systems: Theory &Applications, Volume 9, Issue 4, Page 435-453, December 2024.By employing the graph embedding‐based approach, the authors present a structured and methodical framework for risk assessment in cyber‐physical systems. The proposed graph embedding‐based risk analysis framework aims to provide a more insightful perspective on risk assessment and situational awareness for cyber‐physical power systems to prevent and ...
Shining Sun +7 more
wiley +1 more source
Ethereum phishing detection based on graph neural networks
IET Blockchain, Volume 4, Issue 3, Page 226-234, September 2024.A feature learning algorithm named TransWalk is proposed, which consists of a random walk strategy for transaction net‐works and a multi‐scale feature extraction method for Ethereum. Then, an Ethereum phishing fraud detection framework based on TransWalk is built, and extensive experiments are conducted on the Ethereum dataset to verify the ...
Ao Xiong +7 more
wiley +1 more source
Smart city fire surveillance: A deep state‐space model with intelligent agents
IET Smart Cities, Volume 6, Issue 3, Page 199-210, September 2024.This research study introduces a state‐space navigational model using intelligent agents, combined with a convolutional neural network and multilayer perceptron, for efficient fire surveillance in smart cities. The model proactively guides agents through the shortest path to a fire, utilising the A∗ algorithm. Comparative analysis with other algorithms
A. Rehman +4 more
wiley +1 more source
JAPAN ARCHITECTURAL REVIEW, Volume 7, Issue 1, January–December 2024.We developed a method to support more general and rational reorganization planning, demonstrating its practicality through application to Kobe municipal housing complexes. Using a cost‐effective algorithm with depth‐first search, we considered a larger pool of dwelling units while accounting for practical constraints, such as grouping sale sites and ...
Kouya Inada, Ken Miura
wiley +1 more source
The strong network orientation problem
International Transactions in Operational Research, Volume 31, Issue 1, Page 192-220, January 2024.Abstract This study presents models and heuristics for solving the strong network orientation problem (SNOP), which can model several tactical optimization problems of setting directions in urban networks. The objective is to set an orientation for each edge in an undirected graph such that the resulting digraph is strongly connected and the total ...
Christophe Duhamel +1 more
wiley +1 more source
A Review of Graph Traversal Algorithms: Techniques and Applications in Network Analysis
This review identifies graph traversal methods as fundamental steps in network analysis that facilitate easy examination of relations within the network. In this review, we plan to discuss multiple graph traversal approaches like depth first search (DFS),
M. Ali, Chreesk Sabah +1 more
core +1 more source
Propagation‐Based Train Rescheduling under Recoverable Delay Disturbances
Journal of Advanced Transportation, Volume 2024, Issue 1, 2024.Real‐time train rescheduling for high‐speed railway (HSR) is a pivotal technique in HSR transportation to efficiently recover train operation under disturbance scenarios. This paper aims to put forward an integrated resolving and rescheduling method considering network delay propagation.
Jun Zhang +4 more
wiley +1 more source
Implementation and evaluation of space-efficient traversal algorithms on succinct de Bruijn graphs
Succinct de Bruijn graphs (dBGs) store a k-mer graph in four to five bits per edge, enabling metagenome assemblers to run on modern computers. Yet standard traversal methods, such as breadth-first search (BFS) with a 32-bit distance array or depth-first ...
Fikrat Talibli
core +1 more source
Correlation Constraint Shortest Path over Large MultiRelation Graphs
, 2018 Multi-relation graphs intuitively capture the heterogeneous correlations among real-world entities by allowing multiple types of relationships to be represented as entity-connecting edges, i.e., two entities could be correlated with more than one type of
Özsu, M. Tamer, Zhang, Xiaofei
core +1 more source
GraphOS: Towards Oblivious Graph Processing [PDF]
We propose GraphOS, a system that allows a client that owns a graph database to outsource it to an untrusted server for storage and querying. It relies on doubly-oblivious primitives and trusted hardware to achieve a very strong privacy and efficiency ...
Javad Ghareh Chamani +4 more
core +1 more source