首页 > 最新文献

2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)最新文献

英文 中文
Code clone detection using coarse and fine-grained hybrid approaches 使用粗粒度和细粒度混合方法的代码克隆检测
Abdullah M. Sheneamer, J. Kalita
If two fragments of source code are identical to each other, they are called code clones. Code clones introduce difficulties in software maintenance and cause bug propagation. Coarse-grained clone detectors have higher precision than fine-grained, but fine-grained detectors have higher recall than coarse-grained. In this paper, we present a hybrid clone detection technique that first uses a coarse-grained technique to analyze clones effectively to improve precision. Subsequently, we use a fine-grained detector to obtain additional information about the clones and to improve recall. Our method detects Type-1 and Type-2 clones using hash values for blocks, and gapped code clones (Type-3) using block detection and subsequent comparison between them using Levenshtein distance and Cosine measures with varying thresholds.
如果两个源代码片段彼此相同,它们被称为代码克隆。代码克隆给软件维护带来困难,并导致bug传播。粗粒度克隆检测器比细粒度克隆检测器具有更高的精度,但细粒度克隆检测器具有比粗粒度克隆检测器更高的召回率。在本文中,我们提出了一种混合克隆检测技术,该技术首先使用粗粒度技术来有效地分析克隆以提高精度。随后,我们使用细粒度检测器来获取有关克隆的附加信息并提高召回率。我们的方法使用块的哈希值来检测Type-1和Type-2克隆,使用块检测来检测缺口代码克隆(Type-3),然后使用Levenshtein距离和余弦测量在不同阈值下对它们进行比较。
{"title":"Code clone detection using coarse and fine-grained hybrid approaches","authors":"Abdullah M. Sheneamer, J. Kalita","doi":"10.1109/INTELCIS.2015.7397263","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397263","url":null,"abstract":"If two fragments of source code are identical to each other, they are called code clones. Code clones introduce difficulties in software maintenance and cause bug propagation. Coarse-grained clone detectors have higher precision than fine-grained, but fine-grained detectors have higher recall than coarse-grained. In this paper, we present a hybrid clone detection technique that first uses a coarse-grained technique to analyze clones effectively to improve precision. Subsequently, we use a fine-grained detector to obtain additional information about the clones and to improve recall. Our method detects Type-1 and Type-2 clones using hash values for blocks, and gapped code clones (Type-3) using block detection and subsequent comparison between them using Levenshtein distance and Cosine measures with varying thresholds.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"96 1","pages":"472-480"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88550403","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}
引用次数: 21
Large-scale ontology storage and query using graph database-oriented approach: The case of Freebase 面向图数据库的大规模本体存储与查询:以Freebase为例
Mahmoud Elbattah, Mohamed Roushdy, M. Aref, Abdel-badeeh M. Salem
Ontology has been increasingly recognised as an instrumental artifact to help make sense of large amounts of data. However, the challenges of Big Data significantly overburden the process of ontology storage and query particularly. In this respect, the paper aims to convey considerations in relation to improving the practice of storing or querying large-scale ontologies. Initially, a systematic literature review is conducted with the aim of thoroughly inspecting the state-of-the-art in literature. Subsequently, a graph database-oriented approach is proposed, considering ontology as a large graph. The approach endeavours to address the limitations encountered within traditional relational models. Furthermore, scalability and query efficiency of the approach are verified based on empirical experiments using a subset of Freebase data. The Freebase subset is utilised to build a large-scale ontology graph composed of more than 500K nodes, and 2M edges.
本体越来越被认为是帮助理解大量数据的工具。然而,大数据带来的挑战给本体的存储和查询过程带来了极大的负担。在这方面,本文旨在传达与改进存储或查询大规模本体的实践有关的考虑。首先,进行系统的文献综述,目的是彻底检查文献的最新进展。随后,提出了一种面向图数据库的方法,将本体视为一个大的图。该方法努力解决传统关系模型中遇到的限制。通过Freebase数据子集的实验验证了该方法的可扩展性和查询效率。利用Freebase子集构建了一个由超过500K个节点和2M条边组成的大规模本体图。
{"title":"Large-scale ontology storage and query using graph database-oriented approach: The case of Freebase","authors":"Mahmoud Elbattah, Mohamed Roushdy, M. Aref, Abdel-badeeh M. Salem","doi":"10.1109/INTELCIS.2015.7397191","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397191","url":null,"abstract":"Ontology has been increasingly recognised as an instrumental artifact to help make sense of large amounts of data. However, the challenges of Big Data significantly overburden the process of ontology storage and query particularly. In this respect, the paper aims to convey considerations in relation to improving the practice of storing or querying large-scale ontologies. Initially, a systematic literature review is conducted with the aim of thoroughly inspecting the state-of-the-art in literature. Subsequently, a graph database-oriented approach is proposed, considering ontology as a large graph. The approach endeavours to address the limitations encountered within traditional relational models. Furthermore, scalability and query efficiency of the approach are verified based on empirical experiments using a subset of Freebase data. The Freebase subset is utilised to build a large-scale ontology graph composed of more than 500K nodes, and 2M edges.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"21 1","pages":"39-43"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75588828","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}
引用次数: 11
Towards of intelligence education and learning 走向智能教育与学习
A. M. Salem
Researchers have been used the artificial intelligence (AI) area of research in education to develop a new generation of intelligent tutoring and learning systems. AI concepts, theories and approaches receive increasing attention within the educational technology community. This paper discusses the AI approaches, methodologies and techniques for developing the intelligent e-Learning and tutoring systems. In addition, the paper presents some examples of the developed systems by the author and his colleagues at Artificial intelligence and Knowledge Engineering Research Labs, Ain Shams University, Cairo, Egypt.
研究人员已经将人工智能(AI)领域的研究应用于教育领域,以开发新一代智能辅导和学习系统。人工智能的概念、理论和方法在教育技术界受到越来越多的关注。本文讨论了开发智能电子学习和辅导系统的人工智能方法、方法和技术。此外,本文还介绍了作者和他的同事在埃及开罗艾因沙姆斯大学人工智能和知识工程研究实验室开发的系统的一些例子。
{"title":"Towards of intelligence education and learning","authors":"A. M. Salem","doi":"10.1109/INTELCIS.2015.7397221","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397221","url":null,"abstract":"Researchers have been used the artificial intelligence (AI) area of research in education to develop a new generation of intelligent tutoring and learning systems. AI concepts, theories and approaches receive increasing attention within the educational technology community. This paper discusses the AI approaches, methodologies and techniques for developing the intelligent e-Learning and tutoring systems. In addition, the paper presents some examples of the developed systems by the author and his colleagues at Artificial intelligence and Knowledge Engineering Research Labs, Ain Shams University, Cairo, Egypt.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"108 1","pages":"196-202"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83290648","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
A proposed security service set for VANET SOA 为VANET SOA提议的安全服务集
Safi Ibrahim, M. Hamdy, E. Shaaban
In Vehicular Ad Hoc Networks (VANETs), nodes are represented by Vehicles. Communication in VANETs can take place either between vehicles Vehicle-to-Vehicle (V2V), or between Vehicle and Infrastructure (V2I). Securing exchanged messages between Vehicles is of great importance, especially when they are life critical messages. Some of the Previous security researches discussed how to enable secure communication depending on the support of Infrastructure. In this work, security supported by infrastructure is defined by Services Oriented. Service Oriented Architecture (SOA) can be a novel alternative to satisfy all security requirements. We show the completeness of the proposed system by comparing it with previous security researches.
在车辆自组织网络(vanet)中,节点由车辆表示。vanet中的通信既可以在车辆之间(V2V)进行,也可以在车辆与基础设施(V2I)之间进行。确保车辆之间交换的信息是非常重要的,特别是当它们是生命关键信息时。以前的一些安全研究讨论了如何依靠基础设施的支持来实现安全通信。在这项工作中,基础设施支持的安全性由面向服务定义。面向服务的体系结构(Service Oriented Architecture, SOA)可以成为满足所有安全需求的新颖替代方案。通过与以往安全研究的比较,证明了该系统的完备性。
{"title":"A proposed security service set for VANET SOA","authors":"Safi Ibrahim, M. Hamdy, E. Shaaban","doi":"10.1109/INTELCIS.2015.7397192","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397192","url":null,"abstract":"In Vehicular Ad Hoc Networks (VANETs), nodes are represented by Vehicles. Communication in VANETs can take place either between vehicles Vehicle-to-Vehicle (V2V), or between Vehicle and Infrastructure (V2I). Securing exchanged messages between Vehicles is of great importance, especially when they are life critical messages. Some of the Previous security researches discussed how to enable secure communication depending on the support of Infrastructure. In this work, security supported by infrastructure is defined by Services Oriented. Service Oriented Architecture (SOA) can be a novel alternative to satisfy all security requirements. We show the completeness of the proposed system by comparing it with previous security researches.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"1 1","pages":"649-653"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83070932","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
Dimensions-based classifier for strategy classification of opponent models in real-time strategy games 基于维数的实时策略博弈对手模型策略分类器
M. Aly, M. Aref, M.I. Hassan
Real-time strategy games are strategic war games where two or more players operate on a virtual battlefield, controlling resources, buildings, units and technologies to achieve victory by destroying others. Achieving victory depends on selecting a suitable plan (set of actions), selecting a suitable plan depends on building an imagination (building a model) of the opponent to know how to deal with. This imagination is the opponent model, the stronger the opponent modelling process is, the more accurate the selected suitable plan is and consequently the higher probability achieving the victory is. One of the environment's challenges in real-time strategy games is that classifying the opponent model is game specific. This paper introduces a new methodology through which we can classify the observed opponent model in a way that is not game specific. Our methodology includes two paths, only one of them is executed per real-time strategy game type (per opponent models trained), which means that different type of real-time strategy games will execute different paths of the two paths of our methodology.
即时战略游戏是指两名或多名玩家在虚拟战场上操作,控制资源、建筑、单位和技术,通过摧毁他人来取得胜利的战略战争游戏。取得胜利取决于选择一个合适的计划(一套行动),选择一个合适的计划取决于对对手建立一个想象(建立一个模型)来知道如何应对。这种想象就是对手模型,对手建模过程越强,选择合适的方案就越准确,从而获得胜利的可能性就越高。即时策略游戏的环境挑战之一是,对手模型的分类是特定于游戏的。本文介绍了一种新的方法,通过这种方法,我们可以以一种非特定于游戏的方式对观察到的对手模型进行分类。我们的方法包含两条路径,每一种实时战略游戏类型(每一种训练过的对手模型)只执行一条路径,这意味着不同类型的实时战略游戏将执行我们方法的两条路径中的不同路径。
{"title":"Dimensions-based classifier for strategy classification of opponent models in real-time strategy games","authors":"M. Aly, M. Aref, M.I. Hassan","doi":"10.1109/INTELCIS.2015.7397258","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397258","url":null,"abstract":"Real-time strategy games are strategic war games where two or more players operate on a virtual battlefield, controlling resources, buildings, units and technologies to achieve victory by destroying others. Achieving victory depends on selecting a suitable plan (set of actions), selecting a suitable plan depends on building an imagination (building a model) of the opponent to know how to deal with. This imagination is the opponent model, the stronger the opponent modelling process is, the more accurate the selected suitable plan is and consequently the higher probability achieving the victory is. One of the environment's challenges in real-time strategy games is that classifying the opponent model is game specific. This paper introduces a new methodology through which we can classify the observed opponent model in a way that is not game specific. Our methodology includes two paths, only one of them is executed per real-time strategy game type (per opponent models trained), which means that different type of real-time strategy games will execute different paths of the two paths of our methodology.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"1 1","pages":"442-446"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89971134","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
Finding the pin in the haystack: A Bot Traceback service for public clouds 大海捞针:公共云的Bot追溯服务
E. Hossny, S. Khattab, F. Omara, H. Hassan
Cloud computing permits customers to host their data and applications to the cloud with an interesting economic cost-benefit tradeoff. However, the low price of cloud computing resources encourages attackers to rent a bulk of their botnets on the cloud and launch their attacks from there, which makes customers worry about using cloud computing. Therefore, in this paper, we propose a Bot Traceback (BTB) service for reporting and tracing back the presence of a bot inside an IaaS cloud provider. BTB aims to identify the virtual machine on which a bot runs either inside the same provider or inside a federated provider. The BTB service has been implemented as a part of the security tools in the EASI-CLOUDS project and has been deployed online. We present the implementation details of the BTB service and its main components (the BTB reporting service and BTB detection service). The BTB detection service will start running after a BTB report is received either from the same provider or from another federated provider.
云计算允许客户将他们的数据和应用程序托管到云中,并在经济上进行有趣的成本效益权衡。然而,云计算资源的低廉价格鼓励攻击者在云上租用大量僵尸网络,并从那里发动攻击,这使得客户对使用云计算感到担忧。因此,在本文中,我们提出了一个Bot Traceback (BTB)服务,用于报告和跟踪IaaS云提供商内部Bot的存在。BTB旨在识别机器人在其上运行的虚拟机,该虚拟机在同一提供程序内或在联合提供程序内运行。BTB服务已作为EASI-CLOUDS项目安全工具的一部分实施,并已在线部署。我们介绍了BTB服务及其主要组件(BTB报告服务和BTB检测服务)的实现细节。BTB检测服务将在从同一提供者或从另一个联合提供者接收到BTB报告后开始运行。
{"title":"Finding the pin in the haystack: A Bot Traceback service for public clouds","authors":"E. Hossny, S. Khattab, F. Omara, H. Hassan","doi":"10.1109/INTELCIS.2015.7397230","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397230","url":null,"abstract":"Cloud computing permits customers to host their data and applications to the cloud with an interesting economic cost-benefit tradeoff. However, the low price of cloud computing resources encourages attackers to rent a bulk of their botnets on the cloud and launch their attacks from there, which makes customers worry about using cloud computing. Therefore, in this paper, we propose a Bot Traceback (BTB) service for reporting and tracing back the presence of a bot inside an IaaS cloud provider. BTB aims to identify the virtual machine on which a bot runs either inside the same provider or inside a federated provider. The BTB service has been implemented as a part of the security tools in the EASI-CLOUDS project and has been deployed online. We present the implementation details of the BTB service and its main components (the BTB reporting service and BTB detection service). The BTB detection service will start running after a BTB report is received either from the same provider or from another federated provider.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"3 1","pages":"258-262"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73612394","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 performance study of the chain sampling algorithm 链式采样算法的性能研究
Rayane El Sibai, Yousra Chabchoub, J. Demerjian, Zakia Kazi-Aoul, Kabalan Barbar
On-line data stream analysis is an important challenge today because of the always-increasing rates of the streams issued from multiple heterogeneous sources, in many application domains. To reduce the amount of the data stream, several sampling methods were designed by the data stream research community. We focus in this paper, on the chain sampling algorithm proposed by Babcock et al. The aim of this algorithm is to select randomly and at any time, a given fixed proportion from the most recent items of the stream contained in the last sliding window. This algorithm is well adapted to the stream context, as only one pass over the data is performed. Moreover it uses a small memory, as it does not store all the items of the current sliding window. We show in this paper that the chain sampling algorithm suffers from some collision or redundancy problems. The collision occurs when the same item is selected as a sample more than once during the execution of the algorithm. We propose two approaches to overcome this weakness and improve the chain sampling algorithm. The first one is called “inverting the selection for a high sampling rate” and the second one is inspired from the “divide to conquer strategy”. Different experimentations are performed to show the efficiency of these two improvements, in particular their impact on the execution time of the algorithm.
在线数据流分析是当今的一个重要挑战,因为在许多应用领域中,来自多个异构源的数据流的比率一直在增加。为了减少数据流的量,数据流研究界设计了几种采样方法。本文主要研究Babcock等人提出的链式采样算法。该算法的目的是在任何时候随机地从包含在最后一个滑动窗口中的流的最近项中选择给定的固定比例。该算法很好地适应了流上下文,因为只对数据执行一次传递。此外,它使用很小的内存,因为它不存储当前滑动窗口的所有项目。本文证明了链式采样算法存在一些碰撞或冗余问题。当在算法执行期间多次选择同一项作为样本时,就会发生冲突。我们提出了两种方法来克服这一缺点并改进链采样算法。第一种方法被称为“高采样率的反向选择”,第二种方法的灵感来自于“分而治之”策略。通过不同的实验来证明这两种改进的效率,特别是它们对算法执行时间的影响。
{"title":"A performance study of the chain sampling algorithm","authors":"Rayane El Sibai, Yousra Chabchoub, J. Demerjian, Zakia Kazi-Aoul, Kabalan Barbar","doi":"10.1109/INTELCIS.2015.7397265","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397265","url":null,"abstract":"On-line data stream analysis is an important challenge today because of the always-increasing rates of the streams issued from multiple heterogeneous sources, in many application domains. To reduce the amount of the data stream, several sampling methods were designed by the data stream research community. We focus in this paper, on the chain sampling algorithm proposed by Babcock et al. The aim of this algorithm is to select randomly and at any time, a given fixed proportion from the most recent items of the stream contained in the last sliding window. This algorithm is well adapted to the stream context, as only one pass over the data is performed. Moreover it uses a small memory, as it does not store all the items of the current sliding window. We show in this paper that the chain sampling algorithm suffers from some collision or redundancy problems. The collision occurs when the same item is selected as a sample more than once during the execution of the algorithm. We propose two approaches to overcome this weakness and improve the chain sampling algorithm. The first one is called “inverting the selection for a high sampling rate” and the second one is inspired from the “divide to conquer strategy”. Different experimentations are performed to show the efficiency of these two improvements, in particular their impact on the execution time of the algorithm.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"91 1","pages":"487-494"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78245454","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
Cyber fuzzy assessment methods 网络模糊评价方法
M. Voskoglou
The assessment of a system's performance is a very important task for its operation, because the results obtained by this action help the designer/user of the system to correct its weaknesses, thus making it more effective. The assessment methods usually utilized in practice are based on the principles of classical, bivalent logic (yes-no). However, in our everyday life they frequently appear assessment situations involving a degree of uncertainty and (or) ambiguity. Fuzzy logic, due to its nature of characterizing a case with multiple values, offers rich resources for dealing with such kind of situations. This gave us several times in past the impulse to apply principles of fuzzy logic for assessment purposes using as tools the corresponding system's total uncertainty (e.g. see [2] and its relevant references, Section of [3], etc) the Center of Gravity (COG) defuzzification technique (e.g. Section of [3], [4], etc) as well as the Triangular (TFAM) (e.g. [1]) and Trapezoidal (TRFAM) (e.g. [5]) Fuzzy Assessment Models, which are recently developed variations of the COG technique. In this presentation we shall use the Fuzzy Numbers (FNs), and in particular the Triangular (TFN) (e.g. [6]) and Trapezoidal (TpFN) Fuzzy Numbers, as an alternative assessment tool. FNs play a fundamental role in fuzzy mathematics, analogous to the role played by the ordinary numbers in classical mathematics. Our results are illustrated by an example, while this alternative assessment approach is compared with the assessment methods of the bivalent (calculation of the means, GPA index) and fuzzy logic (see above) that we have already used in earlier works.
评估系统的性能对系统的运行是一项非常重要的任务,因为通过评估获得的结果可以帮助系统的设计者/使用者纠正其弱点,从而使系统更加有效。通常在实践中使用的评估方法是基于经典的二值逻辑(是-否)原则。然而,在我们的日常生活中,他们经常出现评估情况涉及一定程度的不确定性和(或)模糊性。模糊逻辑以其具有多值特征的特性,为处理这类情况提供了丰富的资源。这使我们在过去几次有了将模糊逻辑原理应用于评估目的的动力,使用相应系统的总不确定性作为工具(例如参见[2]及其相关参考文献,[3]的Section等),重心(COG)去模糊化技术(例如[3]的Section,[4]等)以及三角形(TFAM)(例如[1])和梯形(TRFAM)(例如[5])模糊评估模型,它们是COG技术的最新发展变种。在本演示中,我们将使用模糊数(FNs),特别是三角形(TFN)(例如b[6])和梯形(TpFN)模糊数作为替代评估工具。fn在模糊数学中扮演着基础性的角色,类似于普通数字在经典数学中所扮演的角色。通过一个例子说明了我们的结果,同时将这种替代评估方法与我们在早期工作中已经使用的二价(计算平均值,GPA指数)和模糊逻辑(见上文)的评估方法进行了比较。
{"title":"Cyber fuzzy assessment methods","authors":"M. Voskoglou","doi":"10.1109/INTELCIS.2015.7397189","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397189","url":null,"abstract":"The assessment of a system's performance is a very important task for its operation, because the results obtained by this action help the designer/user of the system to correct its weaknesses, thus making it more effective. The assessment methods usually utilized in practice are based on the principles of classical, bivalent logic (yes-no). However, in our everyday life they frequently appear assessment situations involving a degree of uncertainty and (or) ambiguity. Fuzzy logic, due to its nature of characterizing a case with multiple values, offers rich resources for dealing with such kind of situations. This gave us several times in past the impulse to apply principles of fuzzy logic for assessment purposes using as tools the corresponding system's total uncertainty (e.g. see [2] and its relevant references, Section of [3], etc) the Center of Gravity (COG) defuzzification technique (e.g. Section of [3], [4], etc) as well as the Triangular (TFAM) (e.g. [1]) and Trapezoidal (TRFAM) (e.g. [5]) Fuzzy Assessment Models, which are recently developed variations of the COG technique. In this presentation we shall use the Fuzzy Numbers (FNs), and in particular the Triangular (TFN) (e.g. [6]) and Trapezoidal (TpFN) Fuzzy Numbers, as an alternative assessment tool. FNs play a fundamental role in fuzzy mathematics, analogous to the role played by the ordinary numbers in classical mathematics. Our results are illustrated by an example, while this alternative assessment approach is compared with the assessment methods of the bivalent (calculation of the means, GPA index) and fuzzy logic (see above) that we have already used in earlier works.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"113 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79836326","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
Online multi-person tracking-by-detection method using ACF and particle filter 基于ACF和粒子滤波的在线多人检测跟踪方法
T. Kokul, A. Ramanan, U. Pinidiyaarachchi
Automatically detecting and tracking multiple persons in videos is one of the main research interest in computer vision based applications. This paper presents a tracking-by-detection approach for tracking people in dynamic backgrounds with frequent occlusions by combining pre-trained generic person detector, online trained person-specific detector and a motion tracker. The popular aggregate channel features (ACF) are used to train the detectors and target specific particle filter is used as motion tracker. In order to learn right appearance of a target person, person-specific detector learns positive samples from prior frames which are detected by both generic person detector and person-specific detector. Data associations among the coincident detections of the detectors and tracker are used to update the person-specific detector and motion tracker. The person-specific detector searches the target person in a reduced region, which is defined by the associate motion tracker. A careful combination of detections of both detectors and tracker are used to locate the correct target person in the video sequence. Experiments have been carried out on Caltech pedestrian benchmark dataset. The proposed method shows better performance against state-of-the-art tracker while maintaining the tracking speed in real-time.
自动检测和跟踪视频中的多人是基于计算机视觉应用的主要研究方向之一。本文提出了一种结合预训练的一般人检测器、在线训练的特定人检测器和运动跟踪器的基于检测的跟踪方法,用于在频繁遮挡的动态背景下跟踪人。采用流行的聚合通道特征(ACF)训练检测器,并采用目标特定粒子滤波器作为运动跟踪器。为了学习目标人的正确外观,特定人检测器从之前的帧中学习阳性样本,这些样本由一般人检测器和特定人检测器检测。利用检测器和跟踪器的一致检测之间的数据关联来更新个人专用检测器和运动跟踪器。特定于人的检测器在由关联运动跟踪器定义的缩小区域中搜索目标人。检测器和跟踪器的检测结合使用,以在视频序列中定位正确的目标人。在加州理工学院行人基准数据集上进行了实验。该方法在保持实时跟踪速度的同时,对最先进的跟踪器具有更好的性能。
{"title":"Online multi-person tracking-by-detection method using ACF and particle filter","authors":"T. Kokul, A. Ramanan, U. Pinidiyaarachchi","doi":"10.1109/INTELCIS.2015.7397272","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397272","url":null,"abstract":"Automatically detecting and tracking multiple persons in videos is one of the main research interest in computer vision based applications. This paper presents a tracking-by-detection approach for tracking people in dynamic backgrounds with frequent occlusions by combining pre-trained generic person detector, online trained person-specific detector and a motion tracker. The popular aggregate channel features (ACF) are used to train the detectors and target specific particle filter is used as motion tracker. In order to learn right appearance of a target person, person-specific detector learns positive samples from prior frames which are detected by both generic person detector and person-specific detector. Data associations among the coincident detections of the detectors and tracker are used to update the person-specific detector and motion tracker. The person-specific detector searches the target person in a reduced region, which is defined by the associate motion tracker. A careful combination of detections of both detectors and tracker are used to locate the correct target person in the video sequence. Experiments have been carried out on Caltech pedestrian benchmark dataset. The proposed method shows better performance against state-of-the-art tracker while maintaining the tracking speed in real-time.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"55 1","pages":"529-536"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89008483","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
Development of a novel EEG wave controlled security system 一种新型脑电波控制安全系统的研制
Pritham Gajakumar Shah, Krishna Chaithanya Vastare, Xu Huang, Ajithkumar Srikumar, Suraj Mademur Sreenivasa, Adarsh Puvvadi Ram Mohan Kumar, Karthik Rajashekhar Kodada
The need for good security systems in banking, e-commerce and other applications is ever increasing. The proposed project makes the security system more robust and less prone to attacks. Brain Computer Interface (BCI) is used in order to obtain the password from the user by using their brain waves. This paper describes the current trend in BCI technologies and then the Hardware implementation of the proposed solution has been described. The Electro-Encephalogram (EEG) waves are obtained with the help of active dry electrodes and processed using signal conditioning circuits. These EEG signals are then interpreted to obtain the thought pattern of the user to match them to the stored password in the system. Finally a Transmitter-Receiver model has been used with a lock interface system is used to indicate the opening or closing of the lock.
银行、电子商务和其他应用对良好安全系统的需求日益增加。提出的项目使安全系统更加健壮,不易受到攻击。脑机接口(BCI)是利用用户的脑电波从用户那里获取密码的接口。本文首先介绍了当前BCI技术的发展趋势,然后对所提出的解决方案的硬件实现进行了描述。脑电图(EEG)波是在有源干电极的帮助下获得的,并使用信号调理电路进行处理。然后对这些脑电图信号进行解释,以获得用户的思维模式,并将其与系统中存储的密码进行匹配。最后采用了一种收发模型,并采用了锁接口系统来指示锁的开启或关闭。
{"title":"Development of a novel EEG wave controlled security system","authors":"Pritham Gajakumar Shah, Krishna Chaithanya Vastare, Xu Huang, Ajithkumar Srikumar, Suraj Mademur Sreenivasa, Adarsh Puvvadi Ram Mohan Kumar, Karthik Rajashekhar Kodada","doi":"10.1109/INTELCIS.2015.7397207","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397207","url":null,"abstract":"The need for good security systems in banking, e-commerce and other applications is ever increasing. The proposed project makes the security system more robust and less prone to attacks. Brain Computer Interface (BCI) is used in order to obtain the password from the user by using their brain waves. This paper describes the current trend in BCI technologies and then the Hardware implementation of the proposed solution has been described. The Electro-Encephalogram (EEG) waves are obtained with the help of active dry electrodes and processed using signal conditioning circuits. These EEG signals are then interpreted to obtain the thought pattern of the user to match them to the stored password in the system. Finally a Transmitter-Receiver model has been used with a lock interface system is used to indicate the opening or closing of the lock.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"37 1","pages":"116-120"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88550219","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
期刊
2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)
全部 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