首页 > 最新文献

Iranian Journal of Botany最新文献

英文 中文
Latest trends in the Cybersecurity after the solar wind hacking attack 太阳风黑客攻击后网络安全的最新趋势
Q4 Environmental Science Pub Date : 2021-03-24 DOI: 10.33897/FUJEAS.V1I2.347
Naveed Akhtar
That dominance, in any case, has gotten to be a risk. On Sunday, Solar Winds alarmed thousands of its clients that an “outside country state” had found a back entryway into its most well-known item, an instrument called Orion that makes a difference organizations screen blackouts on their computer systems and servers. The company uncovered that programmers snuck a malevolent code that gave them inaccessible get to customers’ systems into an upgrade of Orion. The hack started as early as Walk, Solar Winds conceded, giving the programmers bounty of time to get to the customers’ inside workings. The  breach was not found until the unmistakable cybersecurity company FireEye, which itself employments Solar Winds, decided it had experienced a breach through the program. FireEye has not freely faulted that breach on the Solar Winds hack, but it allegedly affirmed that was the case to the tech location Krebs On Security on Tuesday. FireEye depicted the malware’s bewildering capabilities, from at first lying torpid up to two weeks, to stowed away. That was December 13, 2020. FireEye gauges programmers to begin with picked up get to in Walk 2020. For about eight months, malevolent on-screen characters carted absent untold sums of touchy information from contaminated organizations — and the total scope of the breach is still unfolding. Despite Microsoft seizing the code’s command and control server (a common component in botnet assaults as well), a few security specialists think the assailants may still have get to the Solar Winds Orion program system. Others are conjecturing that these programmers cleared out behind extra, yet-to-be-seen malevolent code.
无论如何,这种主导地位已经成为一种风险。周日,太阳风公司提醒了成千上万的客户,一个“境外国家”找到了进入其最知名产品的后门。该产品名为“猎户座”(Orion),可以让组织在电脑系统和服务器上屏蔽停电情况。该公司发现,程序员在Orion的升级中偷偷植入了一段恶意代码,使他们无法访问客户的系统。太阳风承认,黑客早在Walk就开始了,这给了程序员充足的时间进入客户的内部工作。直到网络安全公司火眼(FireEye)(它自己也雇佣了太阳风公司)认定它通过该项目遭遇了一次入侵,才发现了漏洞。火眼并没有自由地指责太阳风的黑客攻击,但据称它在周二向技术机构克雷布斯安全公司(Krebs on Security)证实了这一点。FireEye描述了该恶意软件令人困惑的能力,从一开始休眠到两周,再到隐藏起来。那是2020年12月13日。FireEye测量程序员从2020年开始到2020年。在大约8个月的时间里,屏幕上的恶意角色从受污染的组织中带走了数不清的敏感信息,而这次入侵的总体范围仍在扩大。尽管微软抓住了代码的命令和控制服务器(也是僵尸网络攻击的常见组件),但一些安全专家认为攻击者可能仍然可以进入太阳风猎户座程序系统。其他人则猜测,这些程序员清除了额外的、尚未被发现的恶意代码。
{"title":"Latest trends in the Cybersecurity after the solar wind hacking attack","authors":"Naveed Akhtar","doi":"10.33897/FUJEAS.V1I2.347","DOIUrl":"https://doi.org/10.33897/FUJEAS.V1I2.347","url":null,"abstract":"That dominance, in any case, has gotten to be a risk. On Sunday, Solar Winds alarmed thousands of its clients that an “outside country state” had found a back entryway into its most well-known item, an instrument called Orion that makes a difference organizations screen blackouts on their computer systems and servers. The company uncovered that programmers snuck a malevolent code that gave them inaccessible get to customers’ systems into an upgrade of Orion. The hack started as early as Walk, Solar Winds conceded, giving the programmers bounty of time to get to the customers’ inside workings. The  breach was not found until the unmistakable cybersecurity company FireEye, which itself employments Solar Winds, decided it had experienced a breach through the program. FireEye has not freely faulted that breach on the Solar Winds hack, but it allegedly affirmed that was the case to the tech location Krebs On Security on Tuesday. FireEye depicted the malware’s bewildering capabilities, from at first lying torpid up to two weeks, to stowed away. That was December 13, 2020. FireEye gauges programmers to begin with picked up get to in Walk 2020. For about eight months, malevolent on-screen characters carted absent untold sums of touchy information from contaminated organizations — and the total scope of the breach is still unfolding. Despite Microsoft seizing the code’s command and control server (a common component in botnet assaults as well), a few security specialists think the assailants may still have get to the Solar Winds Orion program system. Others are conjecturing that these programmers cleared out behind extra, yet-to-be-seen malevolent code.","PeriodicalId":36255,"journal":{"name":"Iranian Journal of Botany","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83960998","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
Phone numbers classificationwith feed-forward neural networks 前馈神经网络的电话号码分类
Q4 Environmental Science Pub Date : 2021-03-22 DOI: 10.33897/FUJEAS.V1I2.340
S. Hayat
A neural network (NN)-based method for phone number classification or recognition is provided in this paper. The used network is a one-hidden-layer multilayer perceptron (MLP) classifier. Its training is based on backpropagation learning. I present the results of a Feed Forward Neural Network trained to classify phone numbers into four categories: Different training data were pre-processed and then tested to distinguish between four classes/patterns of phone numbers in order to train the FFNN. My goal is to provide a coalescence of the published research in this field and to arouse further research interest in and efforts to research the identified topics.
提出了一种基于神经网络的电话号码分类识别方法。所使用的网络是一个单隐藏层多层感知器(MLP)分类器。它的训练是基于反向传播学习。我展示了一个前馈神经网络的训练结果,将电话号码分为四类:不同的训练数据经过预处理,然后进行测试,以区分电话号码的四类/模式,以训练FFNN。我的目标是提供该领域已发表的研究的汇总,并引起进一步的研究兴趣和努力研究确定的主题。
{"title":"Phone numbers classificationwith feed-forward neural networks","authors":"S. Hayat","doi":"10.33897/FUJEAS.V1I2.340","DOIUrl":"https://doi.org/10.33897/FUJEAS.V1I2.340","url":null,"abstract":"A neural network (NN)-based method for phone number classification or recognition is provided in this paper. The used network is a one-hidden-layer multilayer perceptron (MLP) classifier. Its training is based on backpropagation learning. I present the results of a Feed Forward Neural Network trained to classify phone numbers into four categories: Different training data were pre-processed and then tested to distinguish between four classes/patterns of phone numbers in order to train the FFNN. My goal is to provide a coalescence of the published research in this field and to arouse further research interest in and efforts to research the identified topics.","PeriodicalId":36255,"journal":{"name":"Iranian Journal of Botany","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79794061","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
A comprehensive analysis of adaptive image restoration techniques in the presence of different noise models 综合分析了不同噪声模型下的自适应图像恢复技术
Q4 Environmental Science Pub Date : 2021-03-22 DOI: 10.33897/FUJEAS.V1I2.322
A. Khan
Any deprivation caused in the image signal can be thought as a noise. When any image signal is routed through wireless or wired medium it experiences deterioration because of channel characteristics. By knowing the type of noise interfered in the signal, we can use the pertinent filtering techniques to remove the noise from the image. Restoration of the image signal corrupted by noise is very essential for better communication. This paper provides the digital image handling techniques in MATLAB to restore the corrupted image. In this paper, different filtering methods have been discussed in the presence of two separate noise models that distort images. Four different  techniques of filtering, ‘Mean/Average filtering', 'Median filtering', 'Adaptive median filtering' and 'Image Averaging' have been chosen against selected noise models. At the end of the paper we will compare which filtering technique works best for removing a particular noise.
在图像信号中引起的任何剥夺都可以认为是噪声。当任何图像信号通过无线或有线介质传输时,由于信道特性的影响,图像信号都会变差。通过了解干扰信号的噪声类型,我们可以使用相关的滤波技术从图像中去除噪声。对受噪声干扰的图像信号进行恢复是提高通信质量的关键。本文提供了在MATLAB中对损坏图像进行数字处理的技术。在本文中,讨论了不同的滤波方法,在存在两种不同的噪声模型,使图像失真。针对选定的噪声模型,选择了四种不同的滤波技术,即“均值/平均滤波”、“中值滤波”、“自适应中值滤波”和“图像平均”。在本文的最后,我们将比较哪种滤波技术最适合去除特定的噪声。
{"title":"A comprehensive analysis of adaptive image restoration techniques in the presence of different noise models","authors":"A. Khan","doi":"10.33897/FUJEAS.V1I2.322","DOIUrl":"https://doi.org/10.33897/FUJEAS.V1I2.322","url":null,"abstract":"Any deprivation caused in the image signal can be thought as a noise. When any image signal is routed through wireless or wired medium it experiences deterioration because of channel characteristics. By knowing the type of noise interfered in the signal, we can use the pertinent filtering techniques to remove the noise from the image. Restoration of the image signal corrupted by noise is very essential for better communication. This paper provides the digital image handling techniques in MATLAB to restore the corrupted image. In this paper, different filtering methods have been discussed in the presence of two separate noise models that distort images. Four different  techniques of filtering, ‘Mean/Average filtering', 'Median filtering', 'Adaptive median filtering' and 'Image Averaging' have been chosen against selected noise models. At the end of the paper we will compare which filtering technique works best for removing a particular noise.","PeriodicalId":36255,"journal":{"name":"Iranian Journal of Botany","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74996566","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
تنوع ژنتیکی در میان جوامع گونههای گز با استفاده از نشانگر مولکولی CDDP
Q4 Environmental Science Pub Date : 2020-12-21 DOI: 10.22092/IJB.2020.342824.1281
محمدعلی قوامپور, سید عباس میرجلیلی, محمد جعفری, حسین آذرنیوند, سید اکبر جوادی
سرده Tamarix به دلیل عدم قطعیت تعداد گونه‌ها، پراکنش و اهمیت اکولوژیکی در ایران، یکی از مهم‌ترین موضوعات در رده‌بندی تیره گز است. در این مطالعه، تنوع ژنتیکی و روابط خانوادگی 34 فرد از 8 جمعیت از 3 گونه Tamarix در استان اصفهان مورد بررسی قرار گرفت. ده آغازگر از نشانگر مولکولی CDDP برای بررسی تنوع ژنتیکی این سرده استفاده شد. 125 باند از ده آغازگر ایجاد شد، که از این تعداد 102 (16/80 درصد) چند شکلی بودند. آنالیز خوشه‌ای جمعیت‌ها را به سه گروه مجزا دسته‌بندی کرد. جریان بالای ژنی در میان گونه‌های Tamarix با استفاده از تجزیه و تحلیل PCoA  تنوع زیادی در بین سه گونه Tamarix نشان داد، به طوری که نمونه‌های گونه‌های مختلف با هم گروه‌بندی شدند. تجزیه واریانس مولکولی نشان داد که تنوع ژنتیکی بین جمعیت (90٪) بیشتر از تنوع ژنتیکی درون جمعیت (10٪) است. بالاترین میانگین تنوع ژنتیکی نای (H) و شاخص تنوع شانون (I) در جمعیت حبیب‌آباد مشاهده شد. تجزیه و تحلیل داده‌ها نشان داد که صفات ریخت‌شناختی و داده‌های توالی DNA  در سرده Tamarix  کاملا با هم ارتباط ندارند، که می‌تواند با وجود تعداد زیاد دورگه‌ بین گونه‌ها و عدم تمایز ژنتیکی بین گونه‌های مورد مطالعه توجیه شود.
{"title":"تنوع ژنتیکی در میان جوامع گونههای گز با استفاده از نشانگر مولکولی CDDP","authors":"محمدعلی قوامپور, سید عباس میرجلیلی, محمد جعفری, حسین آذرنیوند, سید اکبر جوادی","doi":"10.22092/IJB.2020.342824.1281","DOIUrl":"https://doi.org/10.22092/IJB.2020.342824.1281","url":null,"abstract":"سرده Tamarix به دلیل عدم قطعیت تعداد گونه‌ها، پراکنش و اهمیت اکولوژیکی در ایران، یکی از مهم‌ترین موضوعات در رده‌بندی تیره گز است. در این مطالعه، تنوع ژنتیکی و روابط خانوادگی 34 فرد از 8 جمعیت از 3 گونه Tamarix در استان اصفهان مورد بررسی قرار گرفت. ده آغازگر از نشانگر مولکولی CDDP برای بررسی تنوع ژنتیکی این سرده استفاده شد. 125 باند از ده آغازگر ایجاد شد، که از این تعداد 102 (16/80 درصد) چند شکلی بودند. آنالیز خوشه‌ای جمعیت‌ها را به سه گروه مجزا دسته‌بندی کرد. جریان بالای ژنی در میان گونه‌های Tamarix با استفاده از تجزیه و تحلیل PCoA  تنوع زیادی در بین سه گونه Tamarix نشان داد، به طوری که نمونه‌های گونه‌های مختلف با هم گروه‌بندی شدند. تجزیه واریانس مولکولی نشان داد که تنوع ژنتیکی بین جمعیت (90٪) بیشتر از تنوع ژنتیکی درون جمعیت (10٪) است. بالاترین میانگین تنوع ژنتیکی نای (H) و شاخص تنوع شانون (I) در جمعیت حبیب‌آباد مشاهده شد. تجزیه و تحلیل داده‌ها نشان داد که صفات ریخت‌شناختی و داده‌های توالی DNA  در سرده Tamarix  کاملا با هم ارتباط ندارند، که می‌تواند با وجود تعداد زیاد دورگه‌ بین گونه‌ها و عدم تمایز ژنتیکی بین گونه‌های مورد مطالعه توجیه شود.","PeriodicalId":36255,"journal":{"name":"Iranian Journal of Botany","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87905282","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
گزارش جدید گونه Cerastium ponticum Albov برای فلور ایران
Q4 Environmental Science Pub Date : 2020-12-21 DOI: 10.22092/IJB.2020.343022.1282
Katayoun Poursakhi, Mostafa Assadi, Farrokh Ghahremaninejad
During a revision of the genus Cerastium L. in Iran, Cerastium ponticum Albov was identified and is reported as a new record from Iran and Flora Iranica area. Morphological characteristics, as well as a full description and distribution of the new record are provided. This taxon is also compared with its close relative species.
在对伊朗Cerastium L.属植物的修订中,发现了来自伊朗和Flora Iranica地区的新记录Cerastium ponticum Albov。给出了新记录的形态特征,以及完整的描述和分布。本分类单元还与其近亲种进行了比较。
{"title":"گزارش جدید گونه Cerastium ponticum Albov برای فلور ایران","authors":"Katayoun Poursakhi, Mostafa Assadi, Farrokh Ghahremaninejad","doi":"10.22092/IJB.2020.343022.1282","DOIUrl":"https://doi.org/10.22092/IJB.2020.343022.1282","url":null,"abstract":"During a revision of the genus Cerastium L. in Iran, Cerastium ponticum Albov was identified and is reported as a new record from Iran and Flora Iranica area. Morphological characteristics, as well as a full description and distribution of the new record are provided. This taxon is also compared with its close relative species.","PeriodicalId":36255,"journal":{"name":"Iranian Journal of Botany","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83521944","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
Scorzonera alborzensis، گونه جدیدی از زیرجنس Scorzonera و بخشه Nervosae (Asteraceae) از ایران
Q4 Environmental Science Pub Date : 2020-12-21 DOI: 10.22092/IJB.2020.343548.1290
سیدرضا صفوی, محمد امینی راد
گونه جدیدی از جنس Scorzonera (متعلق به زیرجنس Scorzonera و بخشه Nervosae) به همراه تعدادی تصویر معرفی می‌شود.Scorzonera alborzensis از کوه سیاه‌سنگ در البرز مرکزی جمع‌آوری شده است. این گونه از نظر ریخت‌شناسی نزدیک به Scorzonera cinerea است و با توجه به اندازه و شکل ساقه، اندازه و نحوه پراکندگی برگ‌ها بر روی ساقه، اندازه برگه‌های گریبانی و همچنین اندازه فندقه‌ها از آن متمایز می‌گردد. یک نقاشی و تصویر اسکن شده از نمونه تیپ گونه جدید نیز ارائه شده است.
{"title":"Scorzonera alborzensis، گونه جدیدی از زیرجنس Scorzonera و بخشه Nervosae (Asteraceae) از ایران","authors":"سیدرضا صفوی, محمد امینی راد","doi":"10.22092/IJB.2020.343548.1290","DOIUrl":"https://doi.org/10.22092/IJB.2020.343548.1290","url":null,"abstract":"گونه جدیدی از جنس Scorzonera (متعلق به زیرجنس Scorzonera و بخشه Nervosae) به همراه تعدادی تصویر معرفی می‌شود.Scorzonera alborzensis از کوه سیاه‌سنگ در البرز مرکزی جمع‌آوری شده است. این گونه از نظر ریخت‌شناسی نزدیک به Scorzonera cinerea است و با توجه به اندازه و شکل ساقه، اندازه و نحوه پراکندگی برگ‌ها بر روی ساقه، اندازه برگه‌های گریبانی و همچنین اندازه فندقه‌ها از آن متمایز می‌گردد. یک نقاشی و تصویر اسکن شده از نمونه تیپ گونه جدید نیز ارائه شده است.","PeriodicalId":36255,"journal":{"name":"Iranian Journal of Botany","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88382387","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
Privacy Threats on Social Networking Websites 社交网站上的隐私威胁
Q4 Environmental Science Pub Date : 2020-07-23 DOI: 10.33897/fujeas.v1i1.198
A. Shahid, Umair Abdullah
Abstract: Widespread use of Social networking sites has increased the privacy threat for every individual. Privacy and security problem are two major issues associated with social networks, as the majority of the social network users are not cautious about the usability of the social websites. Social media sites have become latent target regarding offenders because of the occurrence of sensitive information and lack of user awareness of privacy settings. The overall aim of this paper is to enhance awareness about privacy and security issues associated with social networks and to provide guidelines to users for secure usage of social websites. Descriptive research has been conducted as it takes up the majority of online surveying and because of its quantitative nature, it is considered as conclusive. The survey results show that most of the users have their real information on social networking sites and they don’t change privacy settings of their accounts on regular basis. Moreover, as per survey findings, most users accept friend requests and invitations of unknown persons on social networking sites. Results of this research study will be helpful to bring awareness among users about privacy setting and they will learn how to control the privacy settings of their accounts and what type of content should be uploaded on social networking sites.
摘要:社交网站的广泛使用增加了每个人的隐私威胁。隐私和安全问题是与社交网络相关的两个主要问题,因为大多数社交网络用户对社交网站的可用性并不谨慎。由于敏感信息的出现和用户隐私设置意识的缺乏,社交媒体网站已经成为罪犯的潜在目标。本文的总体目标是提高对与社交网络相关的隐私和安全问题的认识,并为用户安全使用社交网站提供指导。描述性研究已经进行,因为它占据了大多数在线调查,由于其定量性质,它被认为是结论性的。调查结果显示,大多数用户在社交网站上拥有自己的真实信息,并且他们没有定期更改自己账户的隐私设置。此外,根据调查结果,大多数用户在社交网站上接受陌生人的好友请求和邀请。本研究的结果将有助于提高用户对隐私设置的认识,他们将学习如何控制他们的账户隐私设置,以及在社交网站上应该上传什么类型的内容。
{"title":"Privacy Threats on Social Networking Websites","authors":"A. Shahid, Umair Abdullah","doi":"10.33897/fujeas.v1i1.198","DOIUrl":"https://doi.org/10.33897/fujeas.v1i1.198","url":null,"abstract":"Abstract: Widespread use of Social networking sites has increased the privacy threat for every individual. Privacy and security problem are two major issues associated with social networks, as the majority of the social network users are not cautious about the usability of the social websites. Social media sites have become latent target regarding offenders because of the occurrence of sensitive information and lack of user awareness of privacy settings. The overall aim of this paper is to enhance awareness about privacy and security issues associated with social networks and to provide guidelines to users for secure usage of social websites. Descriptive research has been conducted as it takes up the majority of online surveying and because of its quantitative nature, it is considered as conclusive. The survey results show that most of the users have their real information on social networking sites and they don’t change privacy settings of their accounts on regular basis. Moreover, as per survey findings, most users accept friend requests and invitations of unknown persons on social networking sites. Results of this research study will be helpful to bring awareness among users about privacy setting and they will learn how to control the privacy settings of their accounts and what type of content should be uploaded on social networking sites.","PeriodicalId":36255,"journal":{"name":"Iranian Journal of Botany","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83910270","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
A Word Embedding Model for Fault Localization using Bug and Software Change Repositories 基于Bug和软件变更库的故障定位词嵌入模型
Q4 Environmental Science Pub Date : 2020-07-22 DOI: 10.33897/fujeas.v1i1.201
Aqib Rehman
Software developed and then deployed in a real world environment is inevitable to exhibit some undesirable behavior. Therefore, developers need to provide maintenance facilities to enable the bugs causing the undesirable behavior to be fixed. However, prior to fixing the bug, the suspicious part of the code needs to be identified. For this purpose, they usually perform fault localization. This can be done manually as well as automatically. Several techniques exist in the literature for fault localization. However, most of them are static based techniques because they do not depend on a specific programming language along with the possibility to work on underdeveloped software and some other benefits. These techniques are largely based on lexical matching of terms which leads to mismatch of terms, large precision value because of limited vocabulary of a programming language and some techniques consider the semantics but it is computationally expensive to localize faults through this. In this paper we have proposed a fault localization technique which is based on the machine learning concept of word embedding. Our proposed approach aims at looking at the relatedness between the bug terms and source code artifact. We mined the bug repositories and software change repositories to train the word embedding model on the mined repositories data. On the arrival of a new bug, the cluster of the bugs from the model is searched and the files from the software change repositories are retrieved which are used for fixing those bugs. We have compared the results of our approach with the latest technique proposed in year 2018 Pointwise Mutual Information (PMI) and Normalized Google Distance (NGD) which consider the context and also with existing lexical techniques Vector Space Model (VSM) and the semantic based method Latent Semantic Indexing (LSI). We have used the benchmark dataset “MoreBugs” which has been widely used in this domain. The results show that our approach outperforms other techniques.
开发并部署到现实环境中的软件不可避免地会出现一些不良行为。因此,开发人员需要提供维护工具来修复导致不良行为的错误。但是,在修复错误之前,需要识别代码的可疑部分。为此,他们通常执行故障定位。这可以手动完成,也可以自动完成。文献中存在几种故障定位技术。然而,它们中的大多数都是基于静态的技术,因为它们不依赖于特定的编程语言,并且可以在未开发的软件上工作,并具有其他一些好处。这些技术主要基于术语的词汇匹配,这导致了术语的不匹配,由于编程语言的词汇量有限,精度值很大,一些技术考虑了语义,但通过这种方法来定位错误的计算成本很高。本文提出了一种基于词嵌入机器学习概念的故障定位技术。我们建议的方法旨在查看bug术语和源代码工件之间的关系。我们挖掘bug库和软件变更库,在挖掘的库数据上训练词嵌入模型。在出现新错误时,将搜索模型中的错误集群,并检索用于修复这些错误的软件变更存储库中的文件。我们将我们的方法与2018年提出的考虑上下文的点互信息(PMI)和归一化谷歌距离(NGD)的最新技术以及现有的词汇技术向量空间模型(VSM)和基于语义的潜在语义索引(LSI)方法进行了比较。我们使用了在该领域广泛使用的基准数据集“MoreBugs”。结果表明,我们的方法优于其他技术。
{"title":"A Word Embedding Model for Fault Localization using Bug and Software Change Repositories","authors":"Aqib Rehman","doi":"10.33897/fujeas.v1i1.201","DOIUrl":"https://doi.org/10.33897/fujeas.v1i1.201","url":null,"abstract":"Software developed and then deployed in a real world environment is inevitable to exhibit some undesirable behavior. Therefore, developers need to provide maintenance facilities to enable the bugs causing the undesirable behavior to be fixed. However, prior to fixing the bug, the suspicious part of the code needs to be identified. For this purpose, they usually perform fault localization. This can be done manually as well as automatically. Several techniques exist in the literature for fault localization. However, most of them are static based techniques because they do not depend on a specific programming language along with the possibility to work on underdeveloped software and some other benefits. These techniques are largely based on lexical matching of terms which leads to mismatch of terms, large precision value because of limited vocabulary of a programming language and some techniques consider the semantics but it is computationally expensive to localize faults through this. In this paper we have proposed a fault localization technique which is based on the machine learning concept of word embedding. Our proposed approach aims at looking at the relatedness between the bug terms and source code artifact. We mined the bug repositories and software change repositories to train the word embedding model on the mined repositories data. On the arrival of a new bug, the cluster of the bugs from the model is searched and the files from the software change repositories are retrieved which are used for fixing those bugs. We have compared the results of our approach with the latest technique proposed in year 2018 Pointwise Mutual Information (PMI) and Normalized Google Distance (NGD) which consider the context and also with existing lexical techniques Vector Space Model (VSM) and the semantic based method Latent Semantic Indexing (LSI). We have used the benchmark dataset “MoreBugs” which has been widely used in this domain. The results show that our approach outperforms other techniques.","PeriodicalId":36255,"journal":{"name":"Iranian Journal of Botany","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90581755","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
Applying Centrality Measures for Impact Analysis in Coauthor ship Network 中心性测度在合作船舶网络影响分析中的应用
Q4 Environmental Science Pub Date : 2020-07-22 DOI: 10.33897/fujeas.v1i1.200
Adeel Ahmed, Riqza Shabbir, Atifa Afzal, Muhammad Akmal, Sahar Fatimah
Nowadays social networking is an essential part of everyone’s life to communicate with different people around the globe. Due to improvement in expertise networks are growing rapidly and becoming more complex. Through social networking, we can identify different communities that help us to get information about different people and their work in different fields. In social networks, community detection is one of the hot areas. In this paper, we have analyzed a co-authorship network of political science and ranked the authors on the basis of common centrality measures. Finding reveals that these common centrality measures can be useful indicators for impact analysis.
如今,社交网络是每个人生活中与全球不同的人交流的重要组成部分。由于专业知识的提高,网络正在迅速发展,变得越来越复杂。通过社交网络,我们可以识别不同的社区,帮助我们获得不同的人和他们在不同领域的工作的信息。在社交网络中,社区检测是研究的热点之一。在本文中,我们分析了一个政治学的合著者网络,并根据共同的中心性指标对作者进行了排名。研究结果表明,这些共同的中心性措施可以作为影响分析的有用指标。
{"title":"Applying Centrality Measures for Impact Analysis in Coauthor ship Network","authors":"Adeel Ahmed, Riqza Shabbir, Atifa Afzal, Muhammad Akmal, Sahar Fatimah","doi":"10.33897/fujeas.v1i1.200","DOIUrl":"https://doi.org/10.33897/fujeas.v1i1.200","url":null,"abstract":"Nowadays social networking is an essential part of everyone’s life to communicate with different people around the globe. Due to improvement in expertise networks are growing rapidly and becoming more complex. Through social networking, we can identify different communities that help us to get information about different people and their work in different fields. In social networks, community detection is one of the hot areas. In this paper, we have analyzed a co-authorship network of political science and ranked the authors on the basis of common centrality measures. Finding reveals that these common centrality measures can be useful indicators for impact analysis.","PeriodicalId":36255,"journal":{"name":"Iranian Journal of Botany","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79941352","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}
引用次数: 4
Assessing Research Collaboration in Database Systems and Computer Networks by Analysis of Coauthorship Network 从合作网络的分析评估数据库系统和计算机网络中的研究合作
Q4 Environmental Science Pub Date : 2020-07-22 DOI: 10.33897/fujeas.v1i1.199
Adeel Ahmed, Tanveer Ahmed
Community detection is a fundamental problem in social networks. These networks detect communities based on link analysis and strong connection strengths, but cannot reflect Author’s from different research areas. To address the problem of community detection, we have done a study for “Analyzing patterns of collaboration in co-authorship network using Modularity and Centrality Measures”. This analysis study uses combine features of Modularity with centrality measure to effectively detect community of different author’s having different research collaboration with different interests in domain of Computer Networks and Database Systems. Experiment of Dataset shown that this approach is better detect best authors from specific domain having high collaboration with other coauthors and presents information to the researcher’s that have relative interest in relative author’s community.
社区检测是社交网络中的一个基本问题。这些网络基于链接分析和强连接强度来检测社区,但不能反映来自不同研究领域的作者。为了解决社区检测问题,我们对“使用模块化和中心性度量分析合作网络中的协作模式”进行了研究。本分析研究采用模块化特征与中心性测度相结合的方法,有效地检测了计算机网络与数据库系统领域中不同作者、不同兴趣、不同研究合作的社区。数据集实验表明,该方法可以更好地从特定领域中发现与其他合著者合作程度较高的最佳作者,并将信息呈现给对相关作者社区有相对兴趣的研究人员。
{"title":"Assessing Research Collaboration in Database Systems and Computer Networks by Analysis of Coauthorship Network","authors":"Adeel Ahmed, Tanveer Ahmed","doi":"10.33897/fujeas.v1i1.199","DOIUrl":"https://doi.org/10.33897/fujeas.v1i1.199","url":null,"abstract":"Community detection is a fundamental problem in social networks. These networks detect communities based on link analysis and strong connection strengths, but cannot reflect Author’s from different research areas. To address the problem of community detection, we have done a study for “Analyzing patterns of collaboration in co-authorship network using Modularity and Centrality Measures”. This analysis study uses combine features of Modularity with centrality measure to effectively detect community of different author’s having different research collaboration with different interests in domain of Computer Networks and Database Systems. Experiment of Dataset shown that this approach is better detect best authors from specific domain having high collaboration with other coauthors and presents information to the researcher’s that have relative interest in relative author’s community.","PeriodicalId":36255,"journal":{"name":"Iranian Journal of Botany","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80695756","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
期刊
Iranian Journal of Botany
全部 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