In this paper, we propose a dynamic object elimination algorithm that combines semantic and geometric constraints to address the problem of visual SLAM being easily affected by dynamic feature poin...
本文提出了一种结合语义和几何约束的动态物体消除算法，以解决视觉 SLAM 易受动态特征点影响的问题。
{"title":"DOE: a dynamic object elimination scheme based on geometric and semantic constraints","authors":"Yanli Liu, Siyi Chen, Heng Zhang, Neal N. Xiong, Wei Liang","doi":"10.1080/09540091.2023.2293460","DOIUrl":"https://doi.org/10.1080/09540091.2023.2293460","url":null,"abstract":"In this paper, we propose a dynamic object elimination algorithm that combines semantic and geometric constraints to address the problem of visual SLAM being easily affected by dynamic feature poin...","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138692986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Studying brain activity and deciphering the information in electroencephalogram (EEG) signals has become an emerging research field, and substantial advances have been made in the EEG-based classif...
{"title":"Emotion recognition based on convolutional gated recurrent units with attention","authors":"Zhu Ye, Yuan Jing, Qinghua Wang, Pengrui Li, Zhihong Liu, Mingjing Yan, Yongqing Zhang, Dongrui Gao","doi":"10.1080/09540091.2023.2289833","DOIUrl":"https://doi.org/10.1080/09540091.2023.2289833","url":null,"abstract":"Studying brain activity and deciphering the information in electroencephalogram (EEG) signals has become an emerging research field, and substantial advances have been made in the EEG-based classif...","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138563528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-08DOI: 10.1080/09540091.2023.2289837
Ji Ma, Jinjin Chen
We have witnessed substantial growth in super-resolution research within the computer vision community. Unlike previous works that mainly focus on the super-resolution synthesis of images, videos, ...
{"title":"Reconstructing higher-resolution four-dimensional time-varying volumetric data","authors":"Ji Ma, Jinjin Chen","doi":"10.1080/09540091.2023.2289837","DOIUrl":"https://doi.org/10.1080/09540091.2023.2289837","url":null,"abstract":"We have witnessed substantial growth in super-resolution research within the computer vision community. Unlike previous works that mainly focus on the super-resolution synthesis of images, videos, ...","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138563654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-02DOI: 10.1080/09540091.2023.2284645
Daniele Granata, Massimiliano Rak, Giovanni Salzillo, Giacomo Di Guida, Salvatore Petrillo
Recent progress integrates security requirements into BPMN, enhancing its framework. Extensions aim to seamlessly embed security concepts, yet the inherent ambiguity of security terms may lead to m...
{"title":"Automated threat modelling and risk analysis in e-Government using BPMN","authors":"Daniele Granata, Massimiliano Rak, Giovanni Salzillo, Giacomo Di Guida, Salvatore Petrillo","doi":"10.1080/09540091.2023.2284645","DOIUrl":"https://doi.org/10.1080/09540091.2023.2284645","url":null,"abstract":"Recent progress integrates security requirements into BPMN, enhancing its framework. Extensions aim to seamlessly embed security concepts, yet the inherent ambiguity of security terms may lead to m...","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-02DOI: 10.1080/09540091.2023.2283390
Le Chen, Lina Ge, Wei Zhou
Term polarity co-extraction is an aspect-based sentiment analysis task, which has been widely used in the fields of user opinions extraction. It consists of two subtasks: aspect term extraction and...
{"title":"IIM: an information interaction mechanism for aspect-based sentiment analysis","authors":"Le Chen, Lina Ge, Wei Zhou","doi":"10.1080/09540091.2023.2283390","DOIUrl":"https://doi.org/10.1080/09540091.2023.2283390","url":null,"abstract":"Term polarity co-extraction is an aspect-based sentiment analysis task, which has been widely used in the fields of user opinions extraction. It consists of two subtasks: aspect term extraction and...","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
To properly predict the security posture of these networks, we provide a method based on machine learning algorithms to detect the security condition of power information networks. A perception mod...
{"title":"Security situational awareness of power information networks based on machine learning algorithms","authors":"Chao Wang, Jia-han Dong, Guang-xin Guo, Tian-yu Ren, Xiao-hu Wang, Ming-yu Pan","doi":"10.1080/09540091.2023.2284649","DOIUrl":"https://doi.org/10.1080/09540091.2023.2284649","url":null,"abstract":"To properly predict the security posture of these networks, we provide a method based on machine learning algorithms to detect the security condition of power information networks. A perception mod...","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-16DOI: 10.1080/09540091.2023.2283394
Antonio Esposito, Beniamino Di Martino, Rosario Ammendolia, Pietro Lupi, Massimo Orlando, Wei Liang
Through the digitalisation of Civil Trials and the implementation of the Telematic Civil Process framework, the Italian Ministry of Justice has amassed a wealth of data covering all facets of moder...
{"title":"Time anomaly detection in the duration of civil trials in Italian justice","authors":"Antonio Esposito, Beniamino Di Martino, Rosario Ammendolia, Pietro Lupi, Massimo Orlando, Wei Liang","doi":"10.1080/09540091.2023.2283394","DOIUrl":"https://doi.org/10.1080/09540091.2023.2283394","url":null,"abstract":"Through the digitalisation of Civil Trials and the implementation of the Telematic Civil Process framework, the Italian Ministry of Justice has amassed a wealth of data covering all facets of moder...","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-16DOI: 10.1080/09540091.2023.2275534
Minghao Chen, Shuai Wang, Jiazhong Zhang
In recent years, one of the prominent research areas in the complex network field has been the Influence Maximization Problem. This problem focuses on selecting seed sets to achieve optimal informa...
影响最大化问题是近年来复杂网络领域研究的热点之一。该问题的重点是选择种子集以获得最优信息。
{"title":"A multi-factorial evolutionary algorithm concerning diversity information for solving the multitasking Robust Influence Maximization Problem on networks","authors":"Minghao Chen, Shuai Wang, Jiazhong Zhang","doi":"10.1080/09540091.2023.2275534","DOIUrl":"https://doi.org/10.1080/09540091.2023.2275534","url":null,"abstract":"In recent years, one of the prominent research areas in the complex network field has been the Influence Maximization Problem. This problem focuses on selecting seed sets to achieve optimal informa...","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2023-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-10DOI: 10.1080/09540091.2023.2281250
Keqin Li
Unmanned aerial vehicles (UAVs) are widely used in various military and civilian applications. UAV mission scheduling is a key issue in UAV applications and a central topic in UAV research. UAV task scheduling should include several constraints into consideration, such as completion time constraint, flight distance constraint, and resource consumption constraint. Furthermore, UAV task scheduling should be studied within the traditional framework of combinatorial optimisation. In this paper, we consider optimal mission scheduling for heterogeneous UAVs with completion time, flight distance, and resource consumption constraints. The contributions of the paper are summarised as follows. We define two combinatorial optimisation problems, namely, the NFTM (number of finished tasks maximisation) problem and the RFTM (reward of finished tasks maximisation) problem. We construct an algorithmic framework for both NFTM and RFTM problems, so that our heuristic algorithms (four for NFTM and two for RFTM) can be presented in a unified way. We derive upper bounds for optimal solutions, so that our heuristic solutions can be compared with optimal solutions. We experimentally evaluate the performance of our heuristic algorithms. To the best of our knowledge, this is the first paper studying UAV mission scheduling with time, distance, and resource constraints as combinatorial optimisation problems.
{"title":"UAV mission scheduling with completion time, flight distance, and resource consumption constraints","authors":"Keqin Li","doi":"10.1080/09540091.2023.2281250","DOIUrl":"https://doi.org/10.1080/09540091.2023.2281250","url":null,"abstract":"Unmanned aerial vehicles (UAVs) are widely used in various military and civilian applications. UAV mission scheduling is a key issue in UAV applications and a central topic in UAV research. UAV task scheduling should include several constraints into consideration, such as completion time constraint, flight distance constraint, and resource consumption constraint. Furthermore, UAV task scheduling should be studied within the traditional framework of combinatorial optimisation. In this paper, we consider optimal mission scheduling for heterogeneous UAVs with completion time, flight distance, and resource consumption constraints. The contributions of the paper are summarised as follows. We define two combinatorial optimisation problems, namely, the NFTM (number of finished tasks maximisation) problem and the RFTM (reward of finished tasks maximisation) problem. We construct an algorithmic framework for both NFTM and RFTM problems, so that our heuristic algorithms (four for NFTM and two for RFTM) can be presented in a unified way. We derive upper bounds for optimal solutions, so that our heuristic solutions can be compared with optimal solutions. We experimentally evaluate the performance of our heuristic algorithms. To the best of our knowledge, this is the first paper studying UAV mission scheduling with time, distance, and resource constraints as combinatorial optimisation problems.","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135093338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-09DOI: 10.1080/09540091.2023.2279900
Beniamino Di Martino, Antonio Esposito, Gennaro Junior Pezzullo, Tien-Hsiung Weng
This paper focuses on exploring and comparing different machine learning algorithms in the context of diabetes management. The aim is to understand their characteristics, mathematical foundations, and practical implications specifically for predicting blood glucose levels. The study provides an overview of the algorithms, with a particular emphasis on deep learning techniques such as Long Short-Term Memory Networks. Efficiency is a crucial factor in practical machine learning applications, especially in the context of diabetes management. Therefore, the paper investigates the trade-off between accuracy, resource utilisation, time consumption, and computational power requirements, aiming to identify the optimal balance. By analysing these algorithms, the research uncovers their distinct behaviours and highlights their dissimilarities, even when their analytical underpinnings may appear similar.
{"title":"Evaluating machine and deep learning techniques in predicting blood sugar levels within the E-health domain","authors":"Beniamino Di Martino, Antonio Esposito, Gennaro Junior Pezzullo, Tien-Hsiung Weng","doi":"10.1080/09540091.2023.2279900","DOIUrl":"https://doi.org/10.1080/09540091.2023.2279900","url":null,"abstract":"This paper focuses on exploring and comparing different machine learning algorithms in the context of diabetes management. The aim is to understand their characteristics, mathematical foundations, and practical implications specifically for predicting blood glucose levels. The study provides an overview of the algorithms, with a particular emphasis on deep learning techniques such as Long Short-Term Memory Networks. Efficiency is a crucial factor in practical machine learning applications, especially in the context of diabetes management. Therefore, the paper investigates the trade-off between accuracy, resource utilisation, time consumption, and computational power requirements, aiming to identify the optimal balance. By analysing these algorithms, the research uncovers their distinct behaviours and highlights their dissimilarities, even when their analytical underpinnings may appear similar.","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135241413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：