首页 > 最新文献

Cybernetics and Information Technologies最新文献

英文 中文
Enhancing Weak Nodes in Decision Tree Algorithm Using Data Augmentation 利用数据增强技术增强决策树算法中的弱节点
IF 1.2 Q2 Computer Science Pub Date : 2022-06-01 DOI: 10.2478/cait-2022-0016
Youness Manzali, Mohamed El far, M. Chahhou, Mohammed Elmohajir
Abstract Decision trees are among the most popular classifiers in machine learning, artificial intelligence, and pattern recognition because they are accurate and easy to interpret. During the tree construction, a node containing too few observations (weak node) could still get split, and then the resulted split is unreliable and statistically has no value. Many existing machine-learning methods can resolve this issue, such as pruning, which removes the tree’s non-meaningful parts. This paper deals with the weak nodes differently; we introduce a new algorithm Enhancing Weak Nodes in Decision Tree (EWNDT), which reinforces them by increasing their data from other similar tree nodes. We called the data augmentation a virtual merging because we temporarily recalculate the best splitting attribute and the best threshold in the weak node. We have used two approaches to defining the similarity between two nodes. The experimental results are verified using benchmark datasets from the UCI machine-learning repository. The results indicate that the EWNDT algorithm gives a good performance.
决策树是机器学习、人工智能和模式识别中最流行的分类器之一,因为它们准确且易于解释。在树的构建过程中,观测值过少的节点(弱节点)仍然可能被分割,那么分割的结果是不可靠的,在统计上没有价值。许多现有的机器学习方法都可以解决这个问题,比如修剪,它可以去除树中没有意义的部分。本文对弱节点进行了不同的处理;本文提出了一种新的决策树弱节点增强算法(EWNDT),该算法通过增加其他类似树节点的数据来增强决策树弱节点。我们称这种数据增强为虚拟合并,因为我们临时重新计算弱节点上的最佳分割属性和最佳阈值。我们使用了两种方法来定义两个节点之间的相似性。实验结果使用来自UCI机器学习存储库的基准数据集进行验证。结果表明,EWNDT算法具有良好的性能。
{"title":"Enhancing Weak Nodes in Decision Tree Algorithm Using Data Augmentation","authors":"Youness Manzali, Mohamed El far, M. Chahhou, Mohammed Elmohajir","doi":"10.2478/cait-2022-0016","DOIUrl":"https://doi.org/10.2478/cait-2022-0016","url":null,"abstract":"Abstract Decision trees are among the most popular classifiers in machine learning, artificial intelligence, and pattern recognition because they are accurate and easy to interpret. During the tree construction, a node containing too few observations (weak node) could still get split, and then the resulted split is unreliable and statistically has no value. Many existing machine-learning methods can resolve this issue, such as pruning, which removes the tree’s non-meaningful parts. This paper deals with the weak nodes differently; we introduce a new algorithm Enhancing Weak Nodes in Decision Tree (EWNDT), which reinforces them by increasing their data from other similar tree nodes. We called the data augmentation a virtual merging because we temporarily recalculate the best splitting attribute and the best threshold in the weak node. We have used two approaches to defining the similarity between two nodes. The experimental results are verified using benchmark datasets from the UCI machine-learning repository. The results indicate that the EWNDT algorithm gives a good performance.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44457956","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
A Proposal for Honeyword Generation via Meerkat Clan Algorithm 一种基于Meerkat Clan算法的蜜语生成方案
IF 1.2 Q2 Computer Science Pub Date : 2022-03-01 DOI: 10.2478/cait-2022-0003
Yasser A. Yasser, A. Sadiq, Wasim Alhamdani
Abstract An effective password cracking detection system is the honeyword system. The Honeyword method attempts to increase the security of hashed passwords by making password cracking easier to detect. Each user in the system has many honeywords in the password database. If the attacker logs in using a honeyword, a quiet alert trigger indicates that the password database has been hacked. Many honeyword generation methods have been proposed, they have a weakness in generating process, do not support all honeyword properties, and have many honeyword issues. This article proposes a novel method to generate honeyword using the meerkat clan intelligence algorithm, a metaheuristic swarm intelligence algorithm. The proposed generation methods will improve the honeyword generating process, enhance the honeyword properties, and solve the issues of previous methods. This work will show some previous generation methods, explain the proposed method, discuss the experimental results and compare the new one with the prior ones.
摘要蜜语系统是一种有效的密码破解检测系统。Honeyword方法试图通过使密码破解更容易检测来提高哈希密码的安全性。系统中的每个用户在密码数据库中都有许多蜜语。如果攻击者使用蜜语登录,则会触发安静警报,表明密码数据库已被黑客入侵。已经提出了许多蜜语生成方法,它们在生成过程中存在弱点,不支持所有的蜜语属性,并且存在许多蜜语问题。本文提出了一种利用猫鼬族智能算法生成蜜语的新方法,该算法是一种元启发式群体智能算法。所提出的生成方法将改进蜜字生成过程,增强蜜字属性,并解决以前方法的问题。这项工作将展示一些以前的方法,解释所提出的方法,讨论实验结果,并将新方法与以前的方法进行比较。
{"title":"A Proposal for Honeyword Generation via Meerkat Clan Algorithm","authors":"Yasser A. Yasser, A. Sadiq, Wasim Alhamdani","doi":"10.2478/cait-2022-0003","DOIUrl":"https://doi.org/10.2478/cait-2022-0003","url":null,"abstract":"Abstract An effective password cracking detection system is the honeyword system. The Honeyword method attempts to increase the security of hashed passwords by making password cracking easier to detect. Each user in the system has many honeywords in the password database. If the attacker logs in using a honeyword, a quiet alert trigger indicates that the password database has been hacked. Many honeyword generation methods have been proposed, they have a weakness in generating process, do not support all honeyword properties, and have many honeyword issues. This article proposes a novel method to generate honeyword using the meerkat clan intelligence algorithm, a metaheuristic swarm intelligence algorithm. The proposed generation methods will improve the honeyword generating process, enhance the honeyword properties, and solve the issues of previous methods. This work will show some previous generation methods, explain the proposed method, discuss the experimental results and compare the new one with the prior ones.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48001864","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
Data Fusion and the Impact of Group Mobility on Load Distribution on MRHOF and OF0 数据融合及群迁移对MRHOF和OF0载荷分布的影响
IF 1.2 Q2 Computer Science Pub Date : 2022-03-01 DOI: 10.2478/cait-2022-0005
Raad S. Al-Qassas, Malik Qasaimeh
Abstract Many routing algorithms proposed for IoT are based on modifications on RPL objective functions and trickle algorithms. However, there is a lack of an in-depth study to examine the impact of mobility on routing protocols based on MRHOF and OF0 algorithms. This paper examines the impact of group mobility on these algorithms, also examines their ability in distributing the load and the impact of varying traffic with the aid of simulations using the well-known Cooja simulator. The two algorithms exhibit similar performance for various metrics for low traffic rates and low mobility speed. However, when the traffic rate becomes relatively high, OF0 performance merits appear, in terms of throughput, packet load deviation, power deviation, and CPU power deviation. The mobility with higher speeds helps MRHOF to enhance its throughput and load deviation. The mobility allowed MRHOF to demonstrate better packets load deviation.
针对物联网提出的许多路由算法都是基于对RPL目标函数和涓流算法的修改。然而,缺乏深入研究移动性对基于MRHOF和OF0算法的路由协议的影响。本文研究了群体移动性对这些算法的影响,并通过使用著名的Cooja模拟器进行模拟,研究了它们在分配负载和不同流量影响方面的能力。对于低流量率和低移动速度的各种指标,这两种算法表现出相似的性能。但是,当业务量较大时,OF0的性能优势就显现出来了,表现在吞吐量、报文负载偏差、功率偏差、CPU功率偏差等方面。更高速度的移动性有助于MRHOF提高其吞吐量和负载偏差。可移动性允许MRHOF展示更好的数据包负载偏差。
{"title":"Data Fusion and the Impact of Group Mobility on Load Distribution on MRHOF and OF0","authors":"Raad S. Al-Qassas, Malik Qasaimeh","doi":"10.2478/cait-2022-0005","DOIUrl":"https://doi.org/10.2478/cait-2022-0005","url":null,"abstract":"Abstract Many routing algorithms proposed for IoT are based on modifications on RPL objective functions and trickle algorithms. However, there is a lack of an in-depth study to examine the impact of mobility on routing protocols based on MRHOF and OF0 algorithms. This paper examines the impact of group mobility on these algorithms, also examines their ability in distributing the load and the impact of varying traffic with the aid of simulations using the well-known Cooja simulator. The two algorithms exhibit similar performance for various metrics for low traffic rates and low mobility speed. However, when the traffic rate becomes relatively high, OF0 performance merits appear, in terms of throughput, packet load deviation, power deviation, and CPU power deviation. The mobility with higher speeds helps MRHOF to enhance its throughput and load deviation. The mobility allowed MRHOF to demonstrate better packets load deviation.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47567044","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
Early Student-at-Risk Detection by Current Learning Performance and Learning Behavior Indicators 通过当前学习表现和学习行为指标检测早期学生的风险
IF 1.2 Q2 Computer Science Pub Date : 2022-03-01 DOI: 10.2478/cait-2022-0008
T. A. Kustitskaya, A. A. Kytmanov, M. Noskov
Abstract The article is focused on the problem of early prediction of students’ learning failures with the purpose of their possible prevention by timely introducing supportive measures. We propose an approach to designing a predictive model for an academic course or module taught in a blended learning format. We introduce certain requirements to predictive models concerning their applicability to the educational process such as interpretability, actionability, and adaptability to a course design. We test three types of classifiers meeting these requirements and choose the one that provides best performance starting from the early stages of the semester, and therefore provides various opportunities to timely support at-risk students. Our empirical studies confirm that the proposed approach is promising for the development of an early warning system in a higher education institution. Such systems can positively influence student retention rates and enhance learning and teaching experience for a long term.
摘要本文着重探讨了早期预测学生学习失败的问题,目的是通过及时引入支持措施来预防学生学习失败。我们提出了一种为以混合学习形式教授的学术课程或模块设计预测模型的方法。我们介绍了预测模型在教育过程中的适用性的某些要求,如可解释性、可操作性和对课程设计的适应性。我们测试了满足这些要求的三种类型的分类器,并从学期的早期阶段开始选择一种表现最好的分类器,从而为及时支持有风险的学生提供各种机会。我们的实证研究证实,所提出的方法对高等教育机构早期预警系统的开发是有希望的。这样的系统可以积极影响学生的保留率,并长期提高学习和教学体验。
{"title":"Early Student-at-Risk Detection by Current Learning Performance and Learning Behavior Indicators","authors":"T. A. Kustitskaya, A. A. Kytmanov, M. Noskov","doi":"10.2478/cait-2022-0008","DOIUrl":"https://doi.org/10.2478/cait-2022-0008","url":null,"abstract":"Abstract The article is focused on the problem of early prediction of students’ learning failures with the purpose of their possible prevention by timely introducing supportive measures. We propose an approach to designing a predictive model for an academic course or module taught in a blended learning format. We introduce certain requirements to predictive models concerning their applicability to the educational process such as interpretability, actionability, and adaptability to a course design. We test three types of classifiers meeting these requirements and choose the one that provides best performance starting from the early stages of the semester, and therefore provides various opportunities to timely support at-risk students. Our empirical studies confirm that the proposed approach is promising for the development of an early warning system in a higher education institution. Such systems can positively influence student retention rates and enhance learning and teaching experience for a long term.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49335322","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}
引用次数: 6
Combination of Resnet and Spatial Pyramid Pooling for Musical Instrument Identification 结合Resnet和空间金字塔池进行乐器识别
IF 1.2 Q2 Computer Science Pub Date : 2022-03-01 DOI: 10.2478/cait-2022-0007
Christine Dewi, Rung-Ching Chen
Abstract Identifying similar objects is one of the most challenging tasks in computer vision image recognition. The following musical instruments will be recognized in this study: French horn, harp, recorder, bassoon, cello, clarinet, erhu, guitar saxophone, trumpet, and violin. Numerous musical instruments are identical in size, form, and sound. Further, our works combine Resnet 50 with Spatial Pyramid Pooling (SPP) to identify musical instruments that are similar to one another. Next, the Resnet 50 and Resnet 50 SPP model evaluation performance includes the Floating-Point Operations (FLOPS), detection time, mAP, and IoU. Our work can increase the detection performance of musical instruments similar to one another. The method we propose, Resnet 50 SPP, shows the highest average accuracy of 84.64% compared to the results of previous studies.
摘要识别相似物体是计算机视觉图像识别中最具挑战性的任务之一。以下乐器将在本研究中得到认可:法国圆号、竖琴、录音机、巴松管、大提琴、单簧管、二胡、吉他萨克斯管、小号和小提琴。许多乐器在大小、形式和声音上都是相同的。此外,我们的作品将Resnet 50与空间金字塔池(SPP)相结合,以识别彼此相似的乐器。接下来,Resnet 50和Resnet 50 SPP模型评估性能包括浮点运算(FLOPS)、检测时间、mAP和IoU。我们的工作可以提高彼此相似的乐器的检测性能。与之前的研究结果相比,我们提出的方法Resnet 50 SPP显示出84.64%的最高平均准确率。
{"title":"Combination of Resnet and Spatial Pyramid Pooling for Musical Instrument Identification","authors":"Christine Dewi, Rung-Ching Chen","doi":"10.2478/cait-2022-0007","DOIUrl":"https://doi.org/10.2478/cait-2022-0007","url":null,"abstract":"Abstract Identifying similar objects is one of the most challenging tasks in computer vision image recognition. The following musical instruments will be recognized in this study: French horn, harp, recorder, bassoon, cello, clarinet, erhu, guitar saxophone, trumpet, and violin. Numerous musical instruments are identical in size, form, and sound. Further, our works combine Resnet 50 with Spatial Pyramid Pooling (SPP) to identify musical instruments that are similar to one another. Next, the Resnet 50 and Resnet 50 SPP model evaluation performance includes the Floating-Point Operations (FLOPS), detection time, mAP, and IoU. Our work can increase the detection performance of musical instruments similar to one another. The method we propose, Resnet 50 SPP, shows the highest average accuracy of 84.64% compared to the results of previous studies.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42432861","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}
引用次数: 7
Hy-MOM: Hybrid Recommender System Framework Using Memory-Based and Model-Based Collaborative Filtering Framework Hy-MOM:基于记忆和模型协同过滤的混合推荐系统框架
IF 1.2 Q2 Computer Science Pub Date : 2022-03-01 DOI: 10.2478/cait-2022-0009
G. George, Anisha M. Lal
Abstract Lack of personalization, rating sparsity, and cold start are commonly seen in e-Learning based recommender systems. The proposed work here suggests a personalized fused recommendation framework for e-Learning. The framework consists of a two-fold approach to generate recommendations. Firstly, it attempts to find the neighbourhood of similar learners based on certain learner characteristics by applying a user-based collaborative filtering approach. Secondly, it generates a matrix of ratings given by the learners. The outcome of the first stage is merged with the second stage to generate recommendations for the learner. Learner characteristics, namely knowledge level, learning style, and learner preference, have been considered to bring in the personalization factor on the recommendations. As the stochastic gradient approach predicts the learner-course rating matrix, it helps overcome the rating sparsity and cold-start issues. The fused model is compared with traditional stand-alone methods and shows performance improvement.
摘要在基于电子学习的推荐系统中,缺乏个性化、评分稀疏和冷启动是常见的。本文提出了一种用于电子学习的个性化融合推荐框架。该框架包括产生建议的双重方法。首先,它试图通过应用基于用户的协同过滤方法,根据特定的学习者特征来寻找相似学习者的邻域。其次,它生成了一个由学习者给出的评分矩阵。将第一阶段的结果与第二阶段合并,以生成针对学习者的推荐。学习者的特征,即知识水平、学习风格和学习者偏好,被认为在推荐中引入了个性化因素。由于随机梯度方法预测学习者课程评分矩阵,它有助于克服评分稀疏和冷启动问题。将融合模型与传统的单机方法进行了比较,表明融合模型的性能有所提高。
{"title":"Hy-MOM: Hybrid Recommender System Framework Using Memory-Based and Model-Based Collaborative Filtering Framework","authors":"G. George, Anisha M. Lal","doi":"10.2478/cait-2022-0009","DOIUrl":"https://doi.org/10.2478/cait-2022-0009","url":null,"abstract":"Abstract Lack of personalization, rating sparsity, and cold start are commonly seen in e-Learning based recommender systems. The proposed work here suggests a personalized fused recommendation framework for e-Learning. The framework consists of a two-fold approach to generate recommendations. Firstly, it attempts to find the neighbourhood of similar learners based on certain learner characteristics by applying a user-based collaborative filtering approach. Secondly, it generates a matrix of ratings given by the learners. The outcome of the first stage is merged with the second stage to generate recommendations for the learner. Learner characteristics, namely knowledge level, learning style, and learner preference, have been considered to bring in the personalization factor on the recommendations. As the stochastic gradient approach predicts the learner-course rating matrix, it helps overcome the rating sparsity and cold-start issues. The fused model is compared with traditional stand-alone methods and shows performance improvement.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46459125","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}
引用次数: 3
Enhancеd Analysis Approach to Detect Phishing Attacks During COVID-19 Crisis 新型冠状病毒危机中网络钓鱼攻击检测的增强分析方法
IF 1.2 Q2 Computer Science Pub Date : 2022-03-01 DOI: 10.2478/cait-2022-0004
Mousa Tayseer Jafar, Mohammad Al-Fawa'reh, Malek Barhoush, Mohammad H. Alshira'H
Abstract Public health responses to the COVID-19 pandemic since March 2020 have led to lockdowns and social distancing in most countries around the world, with a shift from the traditional work environment to virtual one. Employees have been encouraged to work from home where possible to slow down the viral infection. The massive increase in the volume of professional activities executed online has posed a new context for cybercrime, with the increase in the number of emails and phishing websites. Phishing attacks have been broadened and extended through years of pandemics COVID-19. This paper presents a novel approach for detecting phishing Uniform Resource Locators (URLs) applying the Gated Recurrent Unit (GRU), a fast and highly accurate phishing classifier system. Comparative analysis of the GRU classification system indicates better accuracy (98.30%) than other classifier systems.
自2020年3月以来,针对COVID-19大流行的公共卫生应对措施导致世界上大多数国家实行封锁和保持社交距离,从传统的工作环境转向虚拟工作环境。公司鼓励员工尽可能在家工作,以减缓病毒感染。随着电子邮件和钓鱼网站数量的增加,在线执行的专业活动数量的大量增加为网络犯罪提供了新的环境。在COVID-19大流行的多年里,网络钓鱼攻击已经扩大和延伸。本文提出了一种基于门控循环单元(GRU)的网络钓鱼统一资源定位器(url)检测方法。GRU是一种快速、高精度的网络钓鱼分类器。对比分析表明,GRU分类系统的准确率(98.30%)高于其他分类系统。
{"title":"Enhancеd Analysis Approach to Detect Phishing Attacks During COVID-19 Crisis","authors":"Mousa Tayseer Jafar, Mohammad Al-Fawa'reh, Malek Barhoush, Mohammad H. Alshira'H","doi":"10.2478/cait-2022-0004","DOIUrl":"https://doi.org/10.2478/cait-2022-0004","url":null,"abstract":"Abstract Public health responses to the COVID-19 pandemic since March 2020 have led to lockdowns and social distancing in most countries around the world, with a shift from the traditional work environment to virtual one. Employees have been encouraged to work from home where possible to slow down the viral infection. The massive increase in the volume of professional activities executed online has posed a new context for cybercrime, with the increase in the number of emails and phishing websites. Phishing attacks have been broadened and extended through years of pandemics COVID-19. This paper presents a novel approach for detecting phishing Uniform Resource Locators (URLs) applying the Gated Recurrent Unit (GRU), a fast and highly accurate phishing classifier system. Comparative analysis of the GRU classification system indicates better accuracy (98.30%) than other classifier systems.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44403421","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}
引用次数: 2
Blockchain-Enabled Supply-Chain in Crop Production Framework 作物生产框架中的区块链支持供应链
IF 1.2 Q2 Computer Science Pub Date : 2022-03-01 DOI: 10.2478/cait-2022-0010
I. Radeva, I. Popchev
Abstract The purpose of this paper is to propose an approach to blockchain-enabled supply-chain model for a smart crop production framework. The defined tasks are: (1) analysis of blockchain ecosystem as a network of stakeholders and as an infrastructure of technical and logical elements; (2) definition of a supply-chain model; (3) design of blockchain reference infrastructure; (4) description of blockchain information channels with smart contracts basic functionalities. The results presented include: а supply-chain model facilitating seeds certification process, monitoring and supervision of the grain process, provenance and as optional interactions with regulatory bodies, logistics and financial services; the three level blockchain reference infrastructure and a blockchain-enabled supply-chain supporting five information channels with nine participants and smart contracts. An account management user application tool, the general descriptions of smart contract basic functionalities and a selected parts of one smart contract code are provided as examples.
摘要本文的目的是为智能作物生产框架提出一种基于区块链的供应链模型。定义的任务是:(1)分析区块链生态系统作为利益相关者网络以及技术和逻辑元素的基础设施;(2) 供应链模型的定义;(3) 区块链参考基础设施的设计;(4) 区块链信息渠道与智能合约基本功能的描述。所提出的结果包括:促进种子认证过程的供应链模型,对粮食过程、原产地的监测和监督,以及与监管机构、物流和金融服务的可选互动;三级区块链参考基础设施和一个支持区块链的供应链,支持五个信息渠道,有九个参与者和智能合约。提供了账户管理用户应用工具、智能合约基本功能的一般描述以及一个智能合约代码的选定部分作为示例。
{"title":"Blockchain-Enabled Supply-Chain in Crop Production Framework","authors":"I. Radeva, I. Popchev","doi":"10.2478/cait-2022-0010","DOIUrl":"https://doi.org/10.2478/cait-2022-0010","url":null,"abstract":"Abstract The purpose of this paper is to propose an approach to blockchain-enabled supply-chain model for a smart crop production framework. The defined tasks are: (1) analysis of blockchain ecosystem as a network of stakeholders and as an infrastructure of technical and logical elements; (2) definition of a supply-chain model; (3) design of blockchain reference infrastructure; (4) description of blockchain information channels with smart contracts basic functionalities. The results presented include: а supply-chain model facilitating seeds certification process, monitoring and supervision of the grain process, provenance and as optional interactions with regulatory bodies, logistics and financial services; the three level blockchain reference infrastructure and a blockchain-enabled supply-chain supporting five information channels with nine participants and smart contracts. An account management user application tool, the general descriptions of smart contract basic functionalities and a selected parts of one smart contract code are provided as examples.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47462515","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}
引用次数: 10
ESAR, An Expert Shoplifting Activity Recognition System ESAR,一个专业的商店行窃活动识别系统
IF 1.2 Q2 Computer Science Pub Date : 2022-03-01 DOI: 10.2478/cait-2022-0012
Mohd. Aquib Ansari, D. Singh
Abstract Shoplifting is a troubling and pervasive aspect of consumers, causing great losses to retailers. It is the theft of goods from the stores/shops, usually by hiding the store item either in the pocket or in carrier bag and leaving without any payment. Revenue loss is the most direct financial effect of shoplifting. Therefore, this article introduces an Expert Shoplifting Activity Recognition (ESAR) system to reduce shoplifting incidents in stores/shops. The system being proposed seamlessly examines each frame in video footage and alerts security personnel when shoplifting occurs. It uses dual-stream convolutional neural network to extract appearance and salient motion features in the video sequences. Here, optical flow and gradient components are used to extract salient motion features related to shoplifting movement in the video sequence. Long Short Term Memory (LSTM) based deep learner is modeled to learn the extracted features in the time domain for distinguishing person actions (i.e., normal and shoplifting). Analyzing the model behavior for diverse modeling environments is an added contribution of this paper. A synthesized shoplifting dataset is used here for experimentations. The experimental outcomes show that the proposed approach attains better consequences up to 90.26% detection accuracy compared to the other prevalent approaches.
摘要入店行窃是困扰消费者的一个普遍现象,给零售商造成了巨大的损失。这是指从商店里偷东西,通常把商店里的东西藏在口袋里或手提袋里,不付任何钱就离开。收入损失是入店行窃最直接的经济影响。因此,本文引入专家入店行窃行为识别系统(ESAR),以减少在商店/店铺发生的入店行窃事件。该系统将无缝地检查视频片段中的每一帧,并在发生入店行窃时向保安人员发出警报。它采用双流卷积神经网络提取视频序列中的外观和显著运动特征。本文利用光流和梯度分量提取视频序列中与入店行窃运动相关的显著运动特征。基于长短期记忆(LSTM)的深度学习模型在时域中学习提取的特征,用于区分人的行为(即正常行为和入店行窃)。分析不同建模环境下的模型行为是本文的另一个贡献。本文使用一个合成的入店行窃数据集进行实验。实验结果表明,与其他常用方法相比,该方法的检测准确率达到了90.26%。
{"title":"ESAR, An Expert Shoplifting Activity Recognition System","authors":"Mohd. Aquib Ansari, D. Singh","doi":"10.2478/cait-2022-0012","DOIUrl":"https://doi.org/10.2478/cait-2022-0012","url":null,"abstract":"Abstract Shoplifting is a troubling and pervasive aspect of consumers, causing great losses to retailers. It is the theft of goods from the stores/shops, usually by hiding the store item either in the pocket or in carrier bag and leaving without any payment. Revenue loss is the most direct financial effect of shoplifting. Therefore, this article introduces an Expert Shoplifting Activity Recognition (ESAR) system to reduce shoplifting incidents in stores/shops. The system being proposed seamlessly examines each frame in video footage and alerts security personnel when shoplifting occurs. It uses dual-stream convolutional neural network to extract appearance and salient motion features in the video sequences. Here, optical flow and gradient components are used to extract salient motion features related to shoplifting movement in the video sequence. Long Short Term Memory (LSTM) based deep learner is modeled to learn the extracted features in the time domain for distinguishing person actions (i.e., normal and shoplifting). Analyzing the model behavior for diverse modeling environments is an added contribution of this paper. A synthesized shoplifting dataset is used here for experimentations. The experimental outcomes show that the proposed approach attains better consequences up to 90.26% detection accuracy compared to the other prevalent approaches.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47463371","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}
引用次数: 9
Deterministic Centroid Localization for Improving Energy Efficiency in Wireless Sensor Networks 提高无线传感器网络能量效率的确定质心定位
IF 1.2 Q2 Computer Science Pub Date : 2022-03-01 DOI: 10.2478/cait-2022-0002
Sneha Vijayan, Nagarajan Munusamy
Abstract Wireless sensor networks are an enthralling field of study with numerous applications. A Wireless Sensor Network (WSN) is used to monitor real-time scenarios such as weather, temperature, humidity, and military surveillance. A WSN is composed of several sensor nodes that are responsible for sensing, aggregating, and transmitting data in the system, in which it has been deployed. These sensors are powered by small batteries because they are small. Managing power consumption and extending network life is a common challenge in WSNs. Data transmission is a critical process in a WSN that consumes the majority of the network’s resources. Since the cluster heads in the network are in charge of data transmission, they require more energy. We need to know where these CHs are deployed in order to calculate how much energy they use. The deployment of a WSN can be either static or random. Although most researchers focus on random deployment, this paper applies the proposed Deterministic Centroid algorithm for static deployment. Based on the coverage of the deployment area, this algorithm places the sensors in a predetermined location. The simulation results show how this algorithm generates balanced clusters, improves coverage, and saves energy.
摘要无线传感器网络是一个具有众多应用的迷人研究领域。无线传感器网络(WSN)用于监测天气、温度、湿度和军事监视等实时场景。WSN由几个传感器节点组成,这些节点负责在部署了WSN的系统中感知、聚合和传输数据。这些传感器由小型电池供电,因为它们很小。管理功耗和延长网络寿命是无线传感器网络中常见的挑战。数据传输是WSN中的一个关键过程,它消耗了网络的大部分资源。由于网络中的簇头负责数据传输,因此它们需要更多的能量。我们需要知道这些CH部署在哪里,以便计算它们使用了多少能量。WSN的部署可以是静态的,也可以是随机的。尽管大多数研究人员关注随机部署,但本文将所提出的确定性质心算法应用于静态部署。基于部署区域的覆盖范围,该算法将传感器放置在预定位置。仿真结果表明,该算法能够生成均衡的聚类,提高覆盖率,节约能源。
{"title":"Deterministic Centroid Localization for Improving Energy Efficiency in Wireless Sensor Networks","authors":"Sneha Vijayan, Nagarajan Munusamy","doi":"10.2478/cait-2022-0002","DOIUrl":"https://doi.org/10.2478/cait-2022-0002","url":null,"abstract":"Abstract Wireless sensor networks are an enthralling field of study with numerous applications. A Wireless Sensor Network (WSN) is used to monitor real-time scenarios such as weather, temperature, humidity, and military surveillance. A WSN is composed of several sensor nodes that are responsible for sensing, aggregating, and transmitting data in the system, in which it has been deployed. These sensors are powered by small batteries because they are small. Managing power consumption and extending network life is a common challenge in WSNs. Data transmission is a critical process in a WSN that consumes the majority of the network’s resources. Since the cluster heads in the network are in charge of data transmission, they require more energy. We need to know where these CHs are deployed in order to calculate how much energy they use. The deployment of a WSN can be either static or random. Although most researchers focus on random deployment, this paper applies the proposed Deterministic Centroid algorithm for static deployment. Based on the coverage of the deployment area, this algorithm places the sensors in a predetermined location. The simulation results show how this algorithm generates balanced clusters, improves coverage, and saves energy.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46006469","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}
引用次数: 2
期刊
Cybernetics and Information Technologies
全部 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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1