|
|
|
|
|
Kexiang Qian, Hongyu Yang, Ruyu Li, Weizhe Chen, Xi Luo and Lihua Yin
With the rapid growth of IoT devices, the threat of botnets is becoming increasingly worrying. There are more and more intelligent detection solutions for botnets that have been proposed with the development of artificial intelligence. However, due to th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hristo N. Djidjev, Georg Hahn, Susan M. Mniszewski, Christian F. A. Negre and Anders M. N. Niklasson
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several advanced algorithm...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yingying Ma, Minglang Xu, Xiaoran Qin, Ying Zeng and Lingyu Zeng
The urban road network is a large and complex system characterized by significant heterogeneity arising from different spatial structures and traffic demands. To facilitate effective management and control, it is necessary to partition the road network i...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shalini Sharma and Jerry Chou
In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the TS...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fabíola Martins Campos de Oliveira and Edson Borin
Billions of devices will compose the IoT system in the next few years, generating a huge amount of data. We can use fog computing to process these data, considering that there is the possibility of overloading the network towards the cloud. In this conte...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl and Dorothea Wagner
Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on computing a nested dissection order by recursively dividing the road network...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kevin Aydin, MohammadHossein Bateni and Vahab Mirrokni
Balanced partitioning is often a crucial first step in solving large-scale graph optimization problems, for example, in some cases, a big graph can be chopped into pieces that fit on one machine to be processed independently before stitching the results ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sergey V. Belim and Svetlana Yu. Belim
This article considers the problem of image segmentation based on its representation as an undirected weighted graph. Image segmentation is equivalent to partitioning a graph into communities. The image segment corresponds to each community. The growing ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christos Makris and Georgios Pispirigos
Nowadays, due to the extensive use of information networks in a broad range of fields, e.g., bio-informatics, sociology, digital marketing, computer science, etc., graph theory applications have attracted significant scientific interest. Due to its appar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Noriyuki Kushiro, Ami Fukuda, Masatada Kawatsu and Toshihiro Mega
In this study, methods for predicting energy demand on hourly consumption data are established for realizing an energy management system for buildings. The methods consist of an energy prediction algorithm that automatically separates the datasets to par...
ver más
|
|
|
|
|
|
|
|
|
|
|
Armando Di Nardo, Carlo Giudicianni, Roberto Greco, Manuel Herrera and Giovanni F. Santonastaso
Cities depend on multiple heterogeneous, interconnected infrastructures to provide safe water to consumers. Given this complexity, efficient numerical techniques are needed to support optimal control and management of a water distribution network (WDN). ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shaahin Angizi, Naima Ahmed Fahmi, Deniz Najafi, Wei Zhang and Deliang Fan
In this work, we present an efficient Processing in MRAM-Accelerated De Bruijn Graph-based DNA Assembly platform, named PANDA, based on an optimized and hardware-friendly genome assembly algorithm. PANDA is able to assemble large-scale DNA sequence datas...
ver más
|
|
|
|
|
|
|
|
|
|
|
Soufiane Maguerra, Azedine Boulmakoul, Lamia Karim and Hassan Badir
The proliferation of indoor and outdoor tracking devices has led to a vast amount of spatial data. Each object can be described by several trajectories that, once analysed, can yield to significant knowledge. In particular, pattern analysis by clustering...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nina Kuchuk, Roman Artiukh, Artem Nechausov
Pág. 62 - 69
The subject matter of the article is semantic networks of distributed search in e-learning. The goal is to synthesize a decision tree and a stratified semantic network that allows network intelligent agents in the e-learning to construct inference mechan...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mugang Lin, Jianxin Wang, Qilong Feng and Bin Fu
In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries. In the programs, designing algorithms for the kidney exchange problem plays a critical rol...
ver más
|
|
|
|
|
|