Recognizing Instantaneous Group Patterns in Vessel Trajectory Data: A Snapshot Perspective
Recognizing vessel navigation patterns plays a vital role in understanding maritime traffic behaviors, managing and planning vessel activities, spotting outliers, and predicting traffic.
Xiang Zhang, Yuchuan Zhou, Lianying Li
doaj +1 more source
Bridge Network Seismic Risk Assessment Using ShakeMap/HAZUS with Dynamic Traffic Modeling
Bridge infrastructures are critical nodes in a transportation network. In earthquake-prone areas, seismic performance assessment of infrastructure is essential to identify, retrofit, reconstruct, or, if necessary, demolish the infrastructure systems ...
Arman Malekloo, Ekin Ozer, Wasim Ramadan
doaj +1 more source
Characterizing Spectral Properties of Bridge [PDF]
The Bridge graph is a special type of graph which are constructed by connecting identical connected graphs with path graphs. We discuss different types of bridge graphs $B_{n\times l}^{m\times k}$ in this paper. In particular, we discuss the following: complete-type bridge graphs, star-type bridge graphs, and full binary tree bridge graphs.
arxiv
Chromatically unique 6-bridge graph theta(a, a, a, b, b, c)
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if for any graph chromatically equivalent to $
N. S. A. Karim, R. Hasni, G. Lau
semanticscholar +1 more source
A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability [PDF]
The usual epistemic model S5n for a multi-agent system is based on a Kripke frame, which is a graph whose edges are labeled with agents that do not distinguish between two states.
Éric Goubault+2 more
doaj +1 more source
Graphs with $G^p$-connected medians [PDF]
The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any non-negative weights, median sets always induce connected subgraphs in the $p$th power $G^p$ of $G$.
arxiv +1 more source
Understanding Negative Sampling in Graph Representation Learning [PDF]
Graph representation learning has been extensively studied in recent years, in which sampling is a critical point. Prior arts usually focus on sampling positive node pairs, while the strategy for negative sampling is left insufficiently explored.
Z. Yang+5 more
semanticscholar +1 more source
Utilizing m-Polar Fuzzy Saturation Graphs for Optimized Allocation Problem Solutions
It is well known that crisp graph theory is saturated. However, saturation in a fuzzy environment has only lately been created and extensively researched. It is necessary to consider m components for each node and edge in an m-polar fuzzy graph.
Abdulaziz M. Alanazi+4 more
doaj +1 more source
Implementation of Computing Node Centrality with Bridge and Community Detection
As our society grows, the potential of certain people affecting the masses has increased dramatically with the presence of media, virality, and celebrities.
Leonardo Chung, K. Park
semanticscholar +1 more source
A Novel Cascaded Multilevel Converter Topology Based on Three-Phase Cells—CHB-SDC
This paper proposes a new cascaded multilevel converter topology based on three-phase H bridge cells with a common DC-link structure. The proposed multilevel converter topology main advantages, compared with literature renowned multilevel converters ...
Renner Sartório Camargo+4 more
doaj +1 more source