|
|
|
|
|
Fumin Zou, Yue Xing, Qiang Ren, Feng Guo, Zhaoyi Zhou and Zihan Ye
With the wide application of Electronic Toll Collection (ETC) systems, the effectiveness of the operation and maintenance of gantry equipment still need to be improved. This paper proposes a dynamic anomaly detection method for gantry transactions, utili...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shadi Atalla, Saed Tarapiah, Amjad Gawanmeh, Mohammad Daradkeh, Husameldin Mukhtar, Yassine Himeur, Wathiq Mansoor, Kamarul Faizal Bin Hashim and Motaz Daadoo
The Internet of Things (IoT) has the potential to revolutionize agriculture by providing real-time data on crop and livestock conditions. This study aims to evaluate the performance scalability of wireless sensor networks (WSNs) in agriculture, specifica...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bhargav Prakash, Gautam Kumar Baboo and Veeky Baths
Brain connectivity is studied as a functionally connected network using statistical methods such as measuring correlation or covariance. The non-invasive neuroimaging techniques such as Electroencephalography (EEG) signals are converted to networks by tr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Federico Corò, Gianlorenzo D'Angelo and Cristina M. Pinotti
In this paper, we consider the problem of improving the reachability of a graph. We approach the problem from a graph augmentation perspective, in which a limited set size of edges is added to the graph to increase the overall number of reachable nodes. ...
ver más
|
|
|
|
|
|
|
|
|
|
|
David Fernández-Baca and Lei Liu
We study two problems in computational phylogenetics. The first is tree compatibility. The input is a collection ??
P
of phylogenetic trees over different partially-overlapping sets of species. The goal is to find a single phylogenetic tree that display...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kengo Nakamura and Kunihiko Sadakane
Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in ??(??+??)
O
(
n
+
m
)
time for a graph with n vertices and m edges. We consider the dynamic DFS problem, that is, to maintain a DFS tree of an undirected graph G ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Roberto Patuelli, Aura Reggiani, Peter Nijkamp, Franz-Josef Bade
The analysis of the structure and evolution of complex networks has recently received considerable attention. Although research on networks originated in mathematical studies dating back to the nineteenth century (or earlier), and developed further in th...
ver más
|
|
|
|
|
|