首页 > 最新文献

Information (Switzerland)最新文献

英文 中文
Temporal Convolutional Networks and BERT-Based Multi-Label Emotion Analysis for Financial Forecasting 基于时间卷积网络和bert的金融预测多标签情绪分析
Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-11-03 DOI: 10.3390/info14110596
Charalampos M. Liapis, Sotiris Kotsiantis
The use of deep learning in conjunction with models that extract emotion-related information from texts to predict financial time series is based on the assumption that what is said about a stock is correlated with the way that stock fluctuates. Given the above, in this work, a multivariate forecasting methodology incorporating temporal convolutional networks in combination with a BERT-based multi-label emotion classification procedure and correlation feature selection is proposed. The results from an extensive set of experiments, which included predictions of three different time frames and various multivariate ensemble schemes that capture 28 different types of emotion-relative information, are presented. It is shown that the proposed methodology exhibits universal predominance regarding aggregate performance over six different metrics, outperforming all the compared schemes, including a multitude of individual and ensemble methods, both in terms of aggregate average scores and Friedman rankings. Moreover, the results strongly indicate that the use of emotion-related features has beneficial effects on the derived forecasts.
将深度学习与从文本中提取情感相关信息的模型结合起来预测金融时间序列,是基于这样一个假设:关于股票的言论与股票波动的方式相关。鉴于上述情况,本文提出了一种将时间卷积网络与基于bert的多标签情感分类过程和相关特征选择相结合的多元预测方法。本文介绍了一系列广泛的实验结果,其中包括对三种不同时间框架的预测和捕捉28种不同类型的情感相关信息的各种多元集成方案。研究表明,所提出的方法在六个不同的指标上表现出总体表现的普遍优势,优于所有比较的方案,包括大量的个人和集合方法,无论是在总体平均分还是弗里德曼排名方面。此外,研究结果强烈表明,情绪相关特征的使用对导出的预测有有益的影响。
{"title":"Temporal Convolutional Networks and BERT-Based Multi-Label Emotion Analysis for Financial Forecasting","authors":"Charalampos M. Liapis, Sotiris Kotsiantis","doi":"10.3390/info14110596","DOIUrl":"https://doi.org/10.3390/info14110596","url":null,"abstract":"The use of deep learning in conjunction with models that extract emotion-related information from texts to predict financial time series is based on the assumption that what is said about a stock is correlated with the way that stock fluctuates. Given the above, in this work, a multivariate forecasting methodology incorporating temporal convolutional networks in combination with a BERT-based multi-label emotion classification procedure and correlation feature selection is proposed. The results from an extensive set of experiments, which included predictions of three different time frames and various multivariate ensemble schemes that capture 28 different types of emotion-relative information, are presented. It is shown that the proposed methodology exhibits universal predominance regarding aggregate performance over six different metrics, outperforming all the compared schemes, including a multitude of individual and ensemble methods, both in terms of aggregate average scores and Friedman rankings. Moreover, the results strongly indicate that the use of emotion-related features has beneficial effects on the derived forecasts.","PeriodicalId":38479,"journal":{"name":"Information (Switzerland)","volume":"1 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135819393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhancing Walking Accessibility in Urban Transportation: A Comprehensive Analysis of Influencing Factors and Mechanisms 提高城市交通步行可达性:影响因素与机制综合分析
Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-11-02 DOI: 10.3390/info14110595
Yong Liu, Xueqi Ding, Yanjie Ji
The rise in “urban diseases” like population density, traffic congestion, and environmental pollution has renewed attention to urban livability. Walkability, a critical measure of pedestrian friendliness, has gained prominence in urban and transportation planning. This research delves into a comprehensive analysis of walking accessibility, examining both subjective and objective aspects. This study aims to identify the influencing factors and explore the underlying mechanisms driving walkability within a specific area. Through a questionnaire survey, residents’ subjective perceptions were gathered concerning various factors such as traffic operations, walking facilities, and the living environment. Structural equation modeling was employed to analyze the collected data, revealing that travel experience significantly impacts perceived accessibility, followed by facility condition, traffic condition, and safety perception. In the objective analysis, various types of POI data served as explanatory variables, dividing the study area into grids using ArcGIS, with the Walk Score® as the dependent variable. Comparisons of OLS, GWR and MGWR demonstrated that MGWR yielded the most accurate fitting results. Mixed land use, shopping, hotels, residential, government, financial, and medical public services exhibited positive correlations with local walkability, while corporate enterprises and street greening showed negative correlations. These findings were attributed to the level of development, regional functions, population distribution, and supporting facility deployment, collectively influencing the walking accessibility of the area. In conclusion, this research presents crucial insights into enhancing walkability, with implications for urban planning and management, thereby enriching residents’ walking travel experience and promoting sustainable transportation practices. Finally, the limitations of the thesis are discussed.
人口密度、交通拥堵和环境污染等“城市病”的增加重新引起了人们对城市宜居性的关注。可步行性是衡量行人友好性的一项重要指标,在城市和交通规划中日益突出。本研究从主观和客观两个方面对步行可达性进行了综合分析。本研究旨在确定特定区域内步行性的影响因素并探索其潜在机制。通过问卷调查,收集居民对交通运营、步行设施、居住环境等各因素的主观感受。利用结构方程模型对收集到的数据进行分析,发现出行体验对感知可达性的影响显著,其次是设施条件、交通条件和安全感知。在客观分析中,各种类型的POI数据作为解释变量,使用ArcGIS将研究区域划分为网格,以Walk Score®作为因变量。OLS、GWR和MGWR的比较表明,MGWR的拟合结果最为准确。混合土地利用、购物、酒店、住宅、政府、金融和医疗公共服务与当地步行性呈正相关,而企业企业与街道绿化呈负相关。这些发现归因于发展水平,区域功能,人口分布和配套设施部署,共同影响该地区的步行可达性。总之,本研究为提高步行性提供了重要的见解,对城市规划和管理具有重要意义,从而丰富居民的步行旅行体验,促进可持续交通实践。最后,讨论了本文的局限性。
{"title":"Enhancing Walking Accessibility in Urban Transportation: A Comprehensive Analysis of Influencing Factors and Mechanisms","authors":"Yong Liu, Xueqi Ding, Yanjie Ji","doi":"10.3390/info14110595","DOIUrl":"https://doi.org/10.3390/info14110595","url":null,"abstract":"The rise in “urban diseases” like population density, traffic congestion, and environmental pollution has renewed attention to urban livability. Walkability, a critical measure of pedestrian friendliness, has gained prominence in urban and transportation planning. This research delves into a comprehensive analysis of walking accessibility, examining both subjective and objective aspects. This study aims to identify the influencing factors and explore the underlying mechanisms driving walkability within a specific area. Through a questionnaire survey, residents’ subjective perceptions were gathered concerning various factors such as traffic operations, walking facilities, and the living environment. Structural equation modeling was employed to analyze the collected data, revealing that travel experience significantly impacts perceived accessibility, followed by facility condition, traffic condition, and safety perception. In the objective analysis, various types of POI data served as explanatory variables, dividing the study area into grids using ArcGIS, with the Walk Score® as the dependent variable. Comparisons of OLS, GWR and MGWR demonstrated that MGWR yielded the most accurate fitting results. Mixed land use, shopping, hotels, residential, government, financial, and medical public services exhibited positive correlations with local walkability, while corporate enterprises and street greening showed negative correlations. These findings were attributed to the level of development, regional functions, population distribution, and supporting facility deployment, collectively influencing the walking accessibility of the area. In conclusion, this research presents crucial insights into enhancing walkability, with implications for urban planning and management, thereby enriching residents’ walking travel experience and promoting sustainable transportation practices. Finally, the limitations of the thesis are discussed.","PeriodicalId":38479,"journal":{"name":"Information (Switzerland)","volume":"17 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135973727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Range-Free Localization Approaches Based on Intelligent Swarm Optimization for Internet of Things 基于智能群优化的物联网无距离定位方法
Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-11-01 DOI: 10.3390/info14110592
Abdelali Hadir, Naima Kaabouch, Mohammed-Alamine El Houssaini, Jamal El Kafi
Recently, the precise location of sensor nodes has emerged as a significant challenge in the realm of Internet of Things (IoT) applications, including Wireless Sensor Networks (WSNs). The accurate determination of geographical coordinates for detected events holds pivotal importance in these applications. Despite DV-Hop gaining popularity due to its cost-effectiveness, feasibility, and lack of additional hardware requirements, it remains hindered by a relatively notable localization error. To overcome this limitation, our study introduces three new localization approaches that combine DV-Hop with Chicken Swarm Optimization (CSO). The primary objective is to improve the precision of DV-Hop-based approaches. In this paper, we compare the efficiency of the proposed localization algorithms with other existing approaches, including several algorithms based on Particle Swarm Optimization (PSO), while considering random network topologies. The simulation results validate the efficiency of our proposed algorithms. The proposed HW-DV-HopCSO algorithm achieves a considerable improvement in positioning accuracy compared to those of existing models.
最近,传感器节点的精确位置已经成为物联网(IoT)应用领域的一个重大挑战,包括无线传感器网络(wsn)。在这些应用中,准确确定检测到的事件的地理坐标具有至关重要的意义。尽管DV-Hop因其成本效益、可行性和缺乏额外的硬件需求而受到欢迎,但它仍然受到相对明显的本地化错误的阻碍。为了克服这一局限性,本研究引入了将DV-Hop与鸡群优化(CSO)相结合的三种新的定位方法。主要目的是提高基于dv - hop方法的精度。在本文中,我们比较了所提出的定位算法与其他现有方法的效率,包括几种基于粒子群优化(PSO)的算法,同时考虑了随机网络拓扑结构。仿真结果验证了所提算法的有效性。与现有模型相比,本文提出的HW-DV-HopCSO算法在定位精度上有了较大的提高。
{"title":"Range-Free Localization Approaches Based on Intelligent Swarm Optimization for Internet of Things","authors":"Abdelali Hadir, Naima Kaabouch, Mohammed-Alamine El Houssaini, Jamal El Kafi","doi":"10.3390/info14110592","DOIUrl":"https://doi.org/10.3390/info14110592","url":null,"abstract":"Recently, the precise location of sensor nodes has emerged as a significant challenge in the realm of Internet of Things (IoT) applications, including Wireless Sensor Networks (WSNs). The accurate determination of geographical coordinates for detected events holds pivotal importance in these applications. Despite DV-Hop gaining popularity due to its cost-effectiveness, feasibility, and lack of additional hardware requirements, it remains hindered by a relatively notable localization error. To overcome this limitation, our study introduces three new localization approaches that combine DV-Hop with Chicken Swarm Optimization (CSO). The primary objective is to improve the precision of DV-Hop-based approaches. In this paper, we compare the efficiency of the proposed localization algorithms with other existing approaches, including several algorithms based on Particle Swarm Optimization (PSO), while considering random network topologies. The simulation results validate the efficiency of our proposed algorithms. The proposed HW-DV-HopCSO algorithm achieves a considerable improvement in positioning accuracy compared to those of existing models.","PeriodicalId":38479,"journal":{"name":"Information (Switzerland)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135221111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
CoDiS: Community Detection via Distributed Seed Set Expansion on Graph Streams CoDiS:基于图流上分布式种子集展开的社区检测
Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-11-01 DOI: 10.3390/info14110594
Austin Anderson, Petros Potikas, Katerina Potika
Community detection has been (and remains) a very important topic in several fields. From marketing and social networking to biological studies, community detection plays a key role in advancing research in many different fields. Research on this topic originally looked at classifying nodes into discrete communities (non-overlapping communities) but eventually moved forward to placing nodes in multiple communities (overlapping communities). Unfortunately, community detection has always been a time-inefficient process, and datasets are too large to realistically process them using traditional methods. Because of this, recent methods have turned to parallelism and graph stream models, where the edge list is accessed one edge at a time. However, all these methods, while offering a significant decrease in processing time, still have several shortcomings. We propose a new parallel algorithm called community detection with seed sets (CoDiS), which solves the overlapping community detection problem in graph streams. Initially, some nodes (seed sets) have known community structures, and the aim is to expand these communities by processing one edge at a time. The innovation of our approach is that it splits communities among the parallel computation workers so that each worker is only updating a subset of all the communities. By doing so, we decrease the edge processing throughput and decrease the amount of time each worker spends on each edge. Crucially, we remove the need for every worker to have access to every community. Experimental results show that we are able to gain a significant improvement in running time with no loss of accuracy.
社区检测一直是(并且仍然是)几个领域的一个非常重要的主题。从市场营销和社会网络到生物学研究,社区检测在推进许多不同领域的研究中发挥着关键作用。关于该主题的研究最初着眼于将节点分类到离散社区(非重叠社区),但最终将节点放在多个社区(重叠社区)中。不幸的是,社区检测一直是一个时间效率低下的过程,而且数据集太大,无法使用传统方法实际处理它们。正因为如此,最近的方法已经转向并行和图流模型,其中边列表一次访问一条边。然而,所有这些方法在显著减少处理时间的同时,仍然有一些缺点。提出了一种基于种子集的社区检测算法(CoDiS),解决了图流中的重叠社区检测问题。最初,一些节点(种子集)有已知的社区结构,目的是通过一次处理一个边来扩展这些社区。我们方法的创新之处在于,它在并行计算工作者之间划分社区,这样每个工作者只更新所有社区的一个子集。通过这样做,我们减少了边缘处理吞吐量并减少了每个工作人员在每个边缘上花费的时间。至关重要的是,我们消除了每个工人都需要进入每个社区的需求。实验结果表明,我们能够在不损失精度的情况下显著提高运行时间。
{"title":"CoDiS: Community Detection via Distributed Seed Set Expansion on Graph Streams","authors":"Austin Anderson, Petros Potikas, Katerina Potika","doi":"10.3390/info14110594","DOIUrl":"https://doi.org/10.3390/info14110594","url":null,"abstract":"Community detection has been (and remains) a very important topic in several fields. From marketing and social networking to biological studies, community detection plays a key role in advancing research in many different fields. Research on this topic originally looked at classifying nodes into discrete communities (non-overlapping communities) but eventually moved forward to placing nodes in multiple communities (overlapping communities). Unfortunately, community detection has always been a time-inefficient process, and datasets are too large to realistically process them using traditional methods. Because of this, recent methods have turned to parallelism and graph stream models, where the edge list is accessed one edge at a time. However, all these methods, while offering a significant decrease in processing time, still have several shortcomings. We propose a new parallel algorithm called community detection with seed sets (CoDiS), which solves the overlapping community detection problem in graph streams. Initially, some nodes (seed sets) have known community structures, and the aim is to expand these communities by processing one edge at a time. The innovation of our approach is that it splits communities among the parallel computation workers so that each worker is only updating a subset of all the communities. By doing so, we decrease the edge processing throughput and decrease the amount of time each worker spends on each edge. Crucially, we remove the need for every worker to have access to every community. Experimental results show that we are able to gain a significant improvement in running time with no loss of accuracy.","PeriodicalId":38479,"journal":{"name":"Information (Switzerland)","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135371364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Machine Learning in the Analysis of Carbon Dioxide Flow on a Site with Heterogeneous Vegetation 机器学习在异质植被场地二氧化碳流量分析中的应用
Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-11-01 DOI: 10.3390/info14110591
Ekaterina Kulakova, Elena Muravyova
The article presents the results of studies of carbon dioxide flow in the territory of section No. 5 of the Eurasian Carbon Polygon (Russia, Republic of Bashkortostan). The gas analyzer Sniffer4D V2.0 (manufactured in Shenzhen, China) with an installed CO2 sensor, quadrocopter DJI MATRICE 300 RTK (manufactured in Shenzhen, China) were used as control devices. The studies were carried out on a clear autumn day in conditions of green vegetation and on a frosty November day with snow cover. Statistical characteristics of experimental data arrays are calculated. Studies of the influence of temperature, humidity of atmospheric air on the current value of CO2 have been carried out. Graphs of the distribution of carbon dioxide concentration in the atmospheric air of section No. 5 on autumn and winter days were obtained. It has been established that when building a model of CO2 in the air, the parameters of the process of deposition by green vegetation should be considered. It was found that in winter, an increase in air humidity contributes to a decrease in gas concentration. At an ambient temperature of 21 °C, an increase in humidity leads to an increase in the concentration of carbon dioxide.
本文介绍了欧亚碳多边形第5段(俄罗斯,巴什科尔托斯坦共和国)境内二氧化碳流动的研究结果。气体分析仪Sniffer4D V2.0(中国深圳制造),安装二氧化碳传感器,四旋翼机DJI MATRICE 300 RTK(中国深圳制造)作为控制装置。这些研究是在一个晴朗的秋日,在绿色植被的条件下进行的,而在11月一个霜冻的雪天进行的。计算了实验数据阵列的统计特性。研究了大气温度、湿度对CO2电流值的影响。得到了5号断面秋冬两季大气中二氧化碳浓度分布图。建立空气中CO2的模型时,应考虑绿色植被沉积过程的参数。研究发现,在冬季,空气湿度的增加有助于气体浓度的降低。在环境温度为21℃时,湿度的增加会导致二氧化碳浓度的增加。
{"title":"Machine Learning in the Analysis of Carbon Dioxide Flow on a Site with Heterogeneous Vegetation","authors":"Ekaterina Kulakova, Elena Muravyova","doi":"10.3390/info14110591","DOIUrl":"https://doi.org/10.3390/info14110591","url":null,"abstract":"The article presents the results of studies of carbon dioxide flow in the territory of section No. 5 of the Eurasian Carbon Polygon (Russia, Republic of Bashkortostan). The gas analyzer Sniffer4D V2.0 (manufactured in Shenzhen, China) with an installed CO2 sensor, quadrocopter DJI MATRICE 300 RTK (manufactured in Shenzhen, China) were used as control devices. The studies were carried out on a clear autumn day in conditions of green vegetation and on a frosty November day with snow cover. Statistical characteristics of experimental data arrays are calculated. Studies of the influence of temperature, humidity of atmospheric air on the current value of CO2 have been carried out. Graphs of the distribution of carbon dioxide concentration in the atmospheric air of section No. 5 on autumn and winter days were obtained. It has been established that when building a model of CO2 in the air, the parameters of the process of deposition by green vegetation should be considered. It was found that in winter, an increase in air humidity contributes to a decrease in gas concentration. At an ambient temperature of 21 °C, an increase in humidity leads to an increase in the concentration of carbon dioxide.","PeriodicalId":38479,"journal":{"name":"Information (Switzerland)","volume":"74 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135221107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multiple Information-Aware Recurrent Reasoning Network for Joint Dialogue Act Recognition and Sentiment Classification 联合对话行为识别与情感分类的多信息感知循环推理网络
Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-11-01 DOI: 10.3390/info14110593
Shi Li, Xiaoting Chen
The task of joint dialogue act recognition (DAR) and sentiment classification (DSC) aims to predict both the act and sentiment labels of each utterance in a dialogue. Existing methods mainly focus on local or global semantic features of the dialogue from a single perspective, disregarding the impact of the other part. Therefore, we propose a multiple information-aware recurrent reasoning network (MIRER). Firstly, the sequence information is smoothly sent to multiple local information layers for fine-grained feature extraction through a BiLSTM-connected hybrid CNN group method. Secondly, to obtain global semantic features that are speaker-, context-, and temporal-sensitive, we design a speaker-aware temporal reasoning heterogeneous graph to characterize interactions between utterances spoken by different speakers, incorporating different types of nodes and meta-relations with node-edge-type-dependent parameters. We also design a dual-task temporal reasoning heterogeneous graph to realize the semantic-level and prediction-level self-interaction and interaction, and we constantly revise and improve the label in the process of dual-task recurrent reasoning. MIRER fully integrates context-level features, fine-grained features, and global semantic features, including speaker, context, and temporal sensitivity, to better simulate conversation scenarios. We validated the method on two public dialogue datasets, Mastodon and DailyDialog, and the experimental results show that MIRER outperforms various existing baseline models.
联合对话行为识别(DAR)和情感分类(DSC)的任务旨在预测对话中每个话语的行为和情感标签。现有的方法主要是从单一角度关注对话的局部或全局语义特征,而忽略了另一部分的影响。因此,我们提出了一种多信息感知循环推理网络(MIRER)。首先,通过bilstm连接的混合CNN群方法,将序列信息平滑发送到多个局部信息层进行细粒度特征提取;其次,为了获得说话人、上下文和时间敏感的全局语义特征,我们设计了一个说话人感知的时间推理异构图来表征不同说话人所说的话语之间的相互作用,并结合了不同类型的节点和元关系以及节点边缘类型依赖的参数。我们还设计了双任务时间推理异构图,实现语义级和预测级的自交互和交互,并在双任务循环推理过程中不断修改和完善标签。MIRER完全集成了上下文级功能、细粒度功能和全局语义功能,包括说话人、上下文和时间敏感性,以更好地模拟会话场景。我们在两个公共对话数据集Mastodon和DailyDialog上验证了该方法,实验结果表明,MIRER优于现有的各种基线模型。
{"title":"Multiple Information-Aware Recurrent Reasoning Network for Joint Dialogue Act Recognition and Sentiment Classification","authors":"Shi Li, Xiaoting Chen","doi":"10.3390/info14110593","DOIUrl":"https://doi.org/10.3390/info14110593","url":null,"abstract":"The task of joint dialogue act recognition (DAR) and sentiment classification (DSC) aims to predict both the act and sentiment labels of each utterance in a dialogue. Existing methods mainly focus on local or global semantic features of the dialogue from a single perspective, disregarding the impact of the other part. Therefore, we propose a multiple information-aware recurrent reasoning network (MIRER). Firstly, the sequence information is smoothly sent to multiple local information layers for fine-grained feature extraction through a BiLSTM-connected hybrid CNN group method. Secondly, to obtain global semantic features that are speaker-, context-, and temporal-sensitive, we design a speaker-aware temporal reasoning heterogeneous graph to characterize interactions between utterances spoken by different speakers, incorporating different types of nodes and meta-relations with node-edge-type-dependent parameters. We also design a dual-task temporal reasoning heterogeneous graph to realize the semantic-level and prediction-level self-interaction and interaction, and we constantly revise and improve the label in the process of dual-task recurrent reasoning. MIRER fully integrates context-level features, fine-grained features, and global semantic features, including speaker, context, and temporal sensitivity, to better simulate conversation scenarios. We validated the method on two public dialogue datasets, Mastodon and DailyDialog, and the experimental results show that MIRER outperforms various existing baseline models.","PeriodicalId":38479,"journal":{"name":"Information (Switzerland)","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135325932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Predicting COVID-19 Hospital Stays with Kolmogorov–Gabor Polynomials: Charting the Future of Care 用Kolmogorov-Gabor多项式预测COVID-19住院时间:描绘护理的未来
Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-10-31 DOI: 10.3390/info14110590
Hamidreza Marateb, Mina Norouzirad, Kouhyar Tavakolian, Faezeh Aminorroaya, Mohammadreza Mohebbian, Miguel Ángel Mañanas, Sergio Romero Lafuente, Ramin Sami, Marjan Mansourian
Optimal allocation of ward beds is crucial given the respiratory nature of COVID-19, which necessitates urgent hospitalization for certain patients. Several governments have leveraged technology to mitigate the pandemic’s adverse impacts. Based on clinical and demographic variables assessed upon admission, this study predicts the length of stay (LOS) for COVID-19 patients in hospitals. The Kolmogorov–Gabor polynomial (a.k.a., Volterra functional series) was trained using regularized least squares and validated on a dataset of 1600 COVID-19 patients admitted to Khorshid Hospital in the central province of Iran, and the five-fold internal cross-validated results were presented. The Volterra method provides flexibility, interactions among variables, and robustness. The most important features of the LOS prediction system were inflammatory markers, bicarbonate (HCO3), and fever—the adj. R2 and Concordance Correlation Coefficients were 0.81 [95% CI: 0.79–0.84] and 0.94 [0.93–0.95], respectively. The estimation bias was not statistically significant (p-value = 0.777; paired-sample t-test). The system was further analyzed to predict “normal” LOS ≤ 7 days versus “prolonged” LOS > 7 days groups. It showed excellent balanced diagnostic accuracy and agreement rate. However, temporal and spatial validation must be considered to generalize the model. This contribution is hoped to pave the way for hospitals and healthcare providers to manage their resources better.
考虑到COVID-19的呼吸性质,优化病床配置至关重要,因为某些患者需要紧急住院。一些国家的政府已经利用技术来减轻大流行的不利影响。基于入院时评估的临床和人口统计学变量,本研究预测了COVID-19患者在医院的住院时间(LOS)。使用正则化最小二乘法训练Kolmogorov-Gabor多项式(又称Volterra函数序列),并在伊朗中部省份Khorshid医院入院的1600名COVID-19患者数据集上进行验证,并给出了五倍内部交叉验证结果。Volterra方法提供了灵活性、变量之间的相互作用和鲁棒性。LOS预测系统最重要的特征是炎症标志物、碳酸氢盐(HCO3)和发烧。R2和一致性相关系数分别为0.81 [95% CI: 0.79-0.84]和0.94[0.93-0.95]。估计偏差无统计学意义(p值= 0.777;paired-sample t检验)。进一步分析该系统以预测“正常”LOS≤7天与“延长”LOS >7天组。它显示了良好的平衡诊断准确性和符合率。然而,时间和空间验证必须考虑推广模型。这一贡献有望为医院和医疗保健提供者更好地管理其资源铺平道路。
{"title":"Predicting COVID-19 Hospital Stays with Kolmogorov–Gabor Polynomials: Charting the Future of Care","authors":"Hamidreza Marateb, Mina Norouzirad, Kouhyar Tavakolian, Faezeh Aminorroaya, Mohammadreza Mohebbian, Miguel Ángel Mañanas, Sergio Romero Lafuente, Ramin Sami, Marjan Mansourian","doi":"10.3390/info14110590","DOIUrl":"https://doi.org/10.3390/info14110590","url":null,"abstract":"Optimal allocation of ward beds is crucial given the respiratory nature of COVID-19, which necessitates urgent hospitalization for certain patients. Several governments have leveraged technology to mitigate the pandemic’s adverse impacts. Based on clinical and demographic variables assessed upon admission, this study predicts the length of stay (LOS) for COVID-19 patients in hospitals. The Kolmogorov–Gabor polynomial (a.k.a., Volterra functional series) was trained using regularized least squares and validated on a dataset of 1600 COVID-19 patients admitted to Khorshid Hospital in the central province of Iran, and the five-fold internal cross-validated results were presented. The Volterra method provides flexibility, interactions among variables, and robustness. The most important features of the LOS prediction system were inflammatory markers, bicarbonate (HCO3), and fever—the adj. R2 and Concordance Correlation Coefficients were 0.81 [95% CI: 0.79–0.84] and 0.94 [0.93–0.95], respectively. The estimation bias was not statistically significant (p-value = 0.777; paired-sample t-test). The system was further analyzed to predict “normal” LOS ≤ 7 days versus “prolonged” LOS > 7 days groups. It showed excellent balanced diagnostic accuracy and agreement rate. However, temporal and spatial validation must be considered to generalize the model. This contribution is hoped to pave the way for hospitals and healthcare providers to manage their resources better.","PeriodicalId":38479,"journal":{"name":"Information (Switzerland)","volume":"94 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135809334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Security Analysis and Enhancement of INTERBUS Protocol in ICS Based on Colored Petri Net 基于有色Petri网的ICS中INTERBUS协议的安全性分析与改进
Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-10-29 DOI: 10.3390/info14110589
Tao Feng, Chengfan Liu, Xiang Gong, Ye Lu
The integration of buses in industrial control systems, fueled by advancements such as the Internet of Things (IoT), has led to their widespread adoption, significantly enhancing operational efficiency. However, with the increasing interconnection of systems, ensuring the security of bus communications and protocols has become an urgent priority. This paper focuses on addressing the specific security concerns associated with the widely adopted INTERBUS protocol—a fieldbus protocol. Our approach leverages the theory of colored Petri nets (CPN) for modeling, enabling a comprehensive analysis of the protocol’s security. Rigorous formal verification and analysis of the security protocol are conducted by employing the Dolev–Yao adversary model. Our investigation reveals the presence of three critical vulnerabilities: replay attacks, tampering, and impersonation. To fortify the security of the protocol, we propose the introduction of a key distribution center and the utilization of hash values. Through meticulous analysis and verification, our proposed enhancements effectively reinforce the security performance of the INTERBUS protocol.
在物联网(IoT)等技术进步的推动下,工业控制系统中总线的集成导致了它们的广泛采用,显著提高了运营效率。然而,随着系统互联程度的提高,确保总线通信和协议的安全已成为当务之急。本文着重于解决与广泛采用的INTERBUS协议(一种现场总线协议)相关的特定安全问题。我们的方法利用彩色Petri网(CPN)理论进行建模,从而能够对协议的安全性进行全面分析。采用Dolev-Yao对手模型对安全协议进行了严格的形式化验证和分析。我们的调查揭示了三个关键漏洞的存在:重放攻击、篡改和冒充。为了加强协议的安全性,我们建议引入密钥分发中心并利用哈希值。通过细致的分析和验证,我们提出的改进有效地增强了INTERBUS协议的安全性能。
{"title":"Security Analysis and Enhancement of INTERBUS Protocol in ICS Based on Colored Petri Net","authors":"Tao Feng, Chengfan Liu, Xiang Gong, Ye Lu","doi":"10.3390/info14110589","DOIUrl":"https://doi.org/10.3390/info14110589","url":null,"abstract":"The integration of buses in industrial control systems, fueled by advancements such as the Internet of Things (IoT), has led to their widespread adoption, significantly enhancing operational efficiency. However, with the increasing interconnection of systems, ensuring the security of bus communications and protocols has become an urgent priority. This paper focuses on addressing the specific security concerns associated with the widely adopted INTERBUS protocol—a fieldbus protocol. Our approach leverages the theory of colored Petri nets (CPN) for modeling, enabling a comprehensive analysis of the protocol’s security. Rigorous formal verification and analysis of the security protocol are conducted by employing the Dolev–Yao adversary model. Our investigation reveals the presence of three critical vulnerabilities: replay attacks, tampering, and impersonation. To fortify the security of the protocol, we propose the introduction of a key distribution center and the utilization of hash values. Through meticulous analysis and verification, our proposed enhancements effectively reinforce the security performance of the INTERBUS protocol.","PeriodicalId":38479,"journal":{"name":"Information (Switzerland)","volume":"35 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136135709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Large-Scale Group Decision-Making Method Using Hesitant Fuzzy Rule-Based Network for Asset Allocation 基于犹豫模糊规则网络的大规模群体资产配置决策方法
Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-10-26 DOI: 10.3390/info14110588
Abdul Malek Yaakob, Shahira Shafie, Alexander Gegov, Siti Fatimah Abdul Rahman, Ku Muhammad Naim Ku Khalif
Large-scale group decision-making (LSGDM) has become common in the new era of technology development involving a large number of experts. Recently, in the use of social network analysis (SNA), the community detection method has been highlighted by researchers as a useful method in handling the complexity of LSGDM. However, it is still challenging to deal with the reliability and hesitancy of information as well as the interpretability of the method. For this reason, we introduce a new approach of a Z-hesitant fuzzy network with the community detection method being put into practice for stock selection. The proposed approach was subsequently compared to an established approach in order to evaluate its applicability and efficacy.
在技术发展的新时代,涉及大量专家的大规模群体决策(LSGDM)已成为一种普遍现象。近年来,在社会网络分析(SNA)的应用中,社区检测方法作为处理LSGDM复杂性的一种有效方法受到了研究人员的重视。然而,在处理信息的可靠性和犹豫性以及方法的可解释性方面仍然存在挑战。为此,我们引入了一种新的z -犹豫模糊网络方法,并将社区检测方法应用于股票选择。随后将提出的方法与已建立的方法进行比较,以评估其适用性和有效性。
{"title":"Large-Scale Group Decision-Making Method Using Hesitant Fuzzy Rule-Based Network for Asset Allocation","authors":"Abdul Malek Yaakob, Shahira Shafie, Alexander Gegov, Siti Fatimah Abdul Rahman, Ku Muhammad Naim Ku Khalif","doi":"10.3390/info14110588","DOIUrl":"https://doi.org/10.3390/info14110588","url":null,"abstract":"Large-scale group decision-making (LSGDM) has become common in the new era of technology development involving a large number of experts. Recently, in the use of social network analysis (SNA), the community detection method has been highlighted by researchers as a useful method in handling the complexity of LSGDM. However, it is still challenging to deal with the reliability and hesitancy of information as well as the interpretability of the method. For this reason, we introduce a new approach of a Z-hesitant fuzzy network with the community detection method being put into practice for stock selection. The proposed approach was subsequently compared to an established approach in order to evaluate its applicability and efficacy.","PeriodicalId":38479,"journal":{"name":"Information (Switzerland)","volume":"39 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135013195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Securing the Network: A Red and Blue Cybersecurity Competition Case Study 网络安全:红蓝网络安全竞争案例研究
Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-10-26 DOI: 10.3390/info14110587
Cristian Chindrus, Constantin-Florin Caruntu
In today’s dynamic and evolving digital landscape, safeguarding network infrastructure against cyber threats has become a paramount concern for organizations worldwide. This paper presents a novel and practical approach to enhancing cybersecurity readiness. The competition, designed as a simulated cyber battleground, involves a Red Team emulating attackers and a Blue Team defending against their orchestrated assaults. Over two days, multiple teams engage in strategic maneuvers to breach and fortify digital defenses. The core objective of this study is to assess the efficacy of the Red and Blue cybersecurity competition in fostering real-world incident response capabilities and honing the skills of cybersecurity practitioners. This paper delves into the competition’s structural framework, including the intricate network architecture and the roles of the participating teams. This study gauges the competition’s impact on enhancing teamwork and incident response strategies by analyzing participant performance data and outcomes. The findings underscore the significance of immersive training experiences in cultivating proactive cybersecurity mindsets. Participants not only showcase heightened proficiency in countering cyber threats but also develop a profound understanding of attacker methodologies. Furthermore, the competition fosters an environment of continuous learning and knowledge exchange, propelling participants toward heightened cyber resilience.
在当今充满活力和不断发展的数字环境中,保护网络基础设施免受网络威胁已成为全球组织最关心的问题。本文提出了一种新颖实用的方法来增强网络安全准备。这场比赛被设计成一个模拟的网络战场,红队模拟攻击者,蓝队抵御他们精心策划的攻击。在两天的时间里,多个团队进行战略演习,以突破和加强数字防御。本研究的核心目标是评估红蓝网络安全竞赛在培养现实世界事件响应能力和磨练网络安全从业者技能方面的有效性。本文深入研究了比赛的结构框架,包括复杂的网络架构和参赛队伍的角色。本研究通过分析参与者的表现数据和结果来衡量竞争对加强团队合作和事件应对策略的影响。研究结果强调了沉浸式培训体验在培养积极主动的网络安全心态方面的重要性。参与者不仅展示了应对网络威胁的熟练程度,而且还对攻击者的方法有了深刻的理解。此外,竞赛营造了一个持续学习和知识交流的环境,推动参与者提高网络应变能力。
{"title":"Securing the Network: A Red and Blue Cybersecurity Competition Case Study","authors":"Cristian Chindrus, Constantin-Florin Caruntu","doi":"10.3390/info14110587","DOIUrl":"https://doi.org/10.3390/info14110587","url":null,"abstract":"In today’s dynamic and evolving digital landscape, safeguarding network infrastructure against cyber threats has become a paramount concern for organizations worldwide. This paper presents a novel and practical approach to enhancing cybersecurity readiness. The competition, designed as a simulated cyber battleground, involves a Red Team emulating attackers and a Blue Team defending against their orchestrated assaults. Over two days, multiple teams engage in strategic maneuvers to breach and fortify digital defenses. The core objective of this study is to assess the efficacy of the Red and Blue cybersecurity competition in fostering real-world incident response capabilities and honing the skills of cybersecurity practitioners. This paper delves into the competition’s structural framework, including the intricate network architecture and the roles of the participating teams. This study gauges the competition’s impact on enhancing teamwork and incident response strategies by analyzing participant performance data and outcomes. The findings underscore the significance of immersive training experiences in cultivating proactive cybersecurity mindsets. Participants not only showcase heightened proficiency in countering cyber threats but also develop a profound understanding of attacker methodologies. Furthermore, the competition fosters an environment of continuous learning and knowledge exchange, propelling participants toward heightened cyber resilience.","PeriodicalId":38479,"journal":{"name":"Information (Switzerland)","volume":"68 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134905830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Information (Switzerland)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1