发布求助
文献互助 智能选刊 最新文献

International Conference on Computers and Their Applications最新文献

筛选
英文 中文
Optimization of Advanced Encryption Standard (AES) Using Vivado High Level Synthesis (HLS) 基于Vivado高级综合(HLS)的高级加密标准(AES)优化
International Conference on Computers and Their Applications Pub Date : 2019-03-13 DOI: 10.29007/X3TX
Luka Daoud, F. Hussein, N. Rafla
{"title":"Optimization of Advanced Encryption Standard (AES) Using Vivado High Level Synthesis (HLS)","authors":"Luka Daoud, F. Hussein, N. Rafla","doi":"10.29007/X3TX","DOIUrl":"https://doi.org/10.29007/X3TX","url":null,"abstract":"Advanced Encryption Standard (AES) represents a fundamental building module of many network security protocols to ensure data confidentiality in various applications ranging from data servers to low-power hardware embedded systems. In order to optimize such hardware implementations, High-Level Synthesis (HLS) provides flexibility in designing and rapid optimization of dedicated hardware to meet the design constraints. In this paper, we present the implementation of AES encryption processor on FPGA using Xilinx Vivado HLS. The AES architecture was analyzed and designed by loop unrolling, and inner-round and outer-round pipelining techniques to achieve a maximum throughput of the AES algorithm up to 1290 Mbps (Mega bit per second) with very significant low resources of 3.24% slices of the FPGA, achieving 3 Mbps per slice area. keywords: Advanced Encryption Standard, AES, High Level Synthesis, HLS, Optimization, High throughput, Low area resources, Zynq, FPGA.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133511782","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}
引用次数: 13
Behaviour Based Ransomware Detection 基于行为的勒索软件检测
International Conference on Computers and Their Applications Pub Date : 2019-03-13 DOI: 10.29007/T5Q7
C. Chew, Vimal Kumar
{"title":"Behaviour Based Ransomware Detection","authors":"C. Chew, Vimal Kumar","doi":"10.29007/T5Q7","DOIUrl":"https://doi.org/10.29007/T5Q7","url":null,"abstract":"Ransomware is an ever-increasing threat in the world of cyber security targeting vulnerable users and companies, but what is lacking is an easier way to group, and devise practical and easy solutions which every day users can utilise. In this paper we look at the different characteristics of ransomware, and present preventative techniques to tackle these ransomware attacks. More specifically our techniques are based on ransomware behaviour as opposed to the signature based detection used by most anti-malware software. We further discuss the implementation of these techniques and their effectiveness. We have tested the techniques on four prominent ransomware strains, WannaCry, TeslaCrypt, Cerber and Petya. In this paper we discuss how our techniques dealt with these ransomware strains and the performance impact of these techniques.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132101204","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
Learning Financial Time Series for Prediction of the Stock Exchange Market 学习金融时间序列预测证券交易市场
International Conference on Computers and Their Applications Pub Date : 2019-03-13 DOI: 10.29007/MH4M
R. Rosas-Romero, Juan-Pablo Medina-Ochoa
{"title":"Learning Financial Time Series for Prediction of the Stock Exchange Market","authors":"R. Rosas-Romero, Juan-Pablo Medina-Ochoa","doi":"10.29007/MH4M","DOIUrl":"https://doi.org/10.29007/MH4M","url":null,"abstract":"This paper presents the extension and application of three predictive models to time series within the financial sector, specifically data from 75 companies on the Mexican stock exchange market. A tool, which generates awareness of the potential benefits obtained from using formal financial services, would encourage more participation in a formal system. The three statistical models used for prediction of financial time series are a regression model, multi-layer perceptron with linear activation function at the output, and a Hidden Markov Model. Experiments were conducted by finding the optimal set of parameters for each predicting model while applying a model to 75 companies. Theory, issues, challenges and results related to the application of artificial predicting systems to financial time series, and performance of the methods are presented.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124559222","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 Novel Multi-radio Rendezvous Algorithm for Cognitive Radio Networks 一种新的认知无线网络多无线电交会算法
International Conference on Computers and Their Applications Pub Date : 2019-03-13 DOI: 10.29007/4LKQ
Michael Fischer, Jonathan D. Backens
{"title":"A Novel Multi-radio Rendezvous Algorithm for Cognitive Radio Networks","authors":"Michael Fischer, Jonathan D. Backens","doi":"10.29007/4LKQ","DOIUrl":"https://doi.org/10.29007/4LKQ","url":null,"abstract":"Channel Rendezvous between secondary users remains a key challenge to the development of cognitive ad-hoc networks. The decentralized and heterogeneous nature of ad-hoc CRNs makes guaranteeing rendezvous across multiple users within a short time difficult. Current research focuses on single hop networks or on multi-radio platforms to reduce the Time To Rendezvous (TTR). This work presents a Novel Multi-radio Rendezvous algorithm that leverages increasing availability of multi-radio secondary users to reduce TTR in heterogeneous and anonymous CRNs with multiple users.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124283001","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
An Alternative Natural Action Interface for Virtual Reality 虚拟现实的另一种自然动作界面
International Conference on Computers and Their Applications Pub Date : 2019-03-13 DOI: 10.29007/2ZST
Jay Woo, A. Frost, Tyler Goffinet, Vinh D. Le, Connor Scully-Allison, Chase D. Carthen, S. Dascalu
{"title":"An Alternative Natural Action Interface for Virtual Reality","authors":"Jay Woo, A. Frost, Tyler Goffinet, Vinh D. Le, Connor Scully-Allison, Chase D. Carthen, S. Dascalu","doi":"10.29007/2ZST","DOIUrl":"https://doi.org/10.29007/2ZST","url":null,"abstract":"The development of affordable virtual reality (VR) hardware represents a keystone of progress in modern software development and human-computer interaction. Despite the ready availability of robust hardware tools, there is presently a lack of video games or software in VR that demonstrates the gamut of unique and novel interfaces a virtual environment can provide. In this paper, we present a virtual reality video game which introduces unique user interface elements that can only be achieved in a 3D virtual environment. The video game, titled Wolf Hunt, provides users with a menu system that innovates on traditional interfaces with a virtual representation of a common item people interact with daily: a mobile phone. Wolf Hunt throws users into a procedurally generated world where they take the role of an individual escaping a wolf assailant. Deviating from traditional locomotion options in VR interfaces, such as teleportation, Wolf Hunt measures the displacement of hand-held VR controllers with the VR headset to simulate the natural action of running. Wolf Hunt provides an alternate interfacing solution for VR systems without having to conform to common 2D interface design schemes.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116069672","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
Choosing the Best-fit Lifecycle Framework while Addressing Functionality and Security Issues 选择最合适的生命周期框架，同时解决功能和安全问题
International Conference on Computers and Their Applications Pub Date : 2019-03-13 DOI: 10.29007/CFM3
Salman M. Faizi, Shawon S. M. Rahman
{"title":"Choosing the Best-fit Lifecycle Framework while Addressing Functionality and Security Issues","authors":"Salman M. Faizi, Shawon S. M. Rahman","doi":"10.29007/CFM3","DOIUrl":"https://doi.org/10.29007/CFM3","url":null,"abstract":"Software application development must include implementation of core functionality along with secure coding to contain security vulnerabilities of applications. Considering the life cycle that a software application undergoes, application developers have many opportunities to include security starting from the very first stage of planning or requirement gathering. However, before even starting requirement gathering, the software application development team must select a framework to use for the application’s lifecycle. Based on the application and organizational characteristics, software application developers must select the best-fit framework for the lifecycle. A software application’s functionality and security start with picking the right lifecycle framework. When it comes to application development frameworks, one size does not fit all. Based on the characteristics of the application development organization such as the number of application developers involved, project budget and criticality, and the number of teams, one of the five frameworks will work better than others.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117335899","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
Web Request Predictions Web请求预测
International Conference on Computers and Their Applications Pub Date : 2019-03-13 DOI: 10.29007/H63W
R. Appleton, B. Slater, Connor Laitinen, L. Ammel, Cody Malnor
{"title":"Web Request Predictions","authors":"R. Appleton, B. Slater, Connor Laitinen, L. Ammel, Cody Malnor","doi":"10.29007/H63W","DOIUrl":"https://doi.org/10.29007/H63W","url":null,"abstract":"If one could predict future web requests, it would be possible to make the web much faster. One could fetch web resources before they are needed. When the human user clicks on a link, the needed data would already have been downloaded. We have created several algorithms that attempt to predict future web requests based on past histories. Our research evaluates and compares these prediction algorithms against real histories of web usage. Prediction algorithm results are compared based on correct predictions, erroneous predictions, and prediction rate. Some algorithms make predictions rarely but accurately, while others may predict more often but with less accuracy. To take full advantage of this, we combine multiple algorithms and use different voting strategies to determine the best prediction.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128990425","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
New classes of monohedral spherical tilings by non-convex spherical hexagons and non-convex spherical Pentagons with GeoGebra 基于GeoGebra的非凸球面六边形和非凸球面五边形单面体球面平铺新类
International Conference on Computers and Their Applications Pub Date : 2019-03-13 DOI: 10.29007/QK2K
A. Breda, José Manuel Dos Santos Dos Santos
{"title":"New classes of monohedral spherical tilings by non-convex spherical hexagons and non-convex spherical Pentagons with GeoGebra","authors":"A. Breda, José Manuel Dos Santos Dos Santos","doi":"10.29007/QK2K","DOIUrl":"https://doi.org/10.29007/QK2K","url":null,"abstract":"In previous works we have ilustrate a procedure to obtain spherical tiling with GeoGebra. We have found new classes of monohedral spherical tiling by four spherical pentagons, and new class of dihedral spherical tiling by twelve spherical pentagons. One again, we would make use of GeoGebra to show how we can do generate new classes of monohedral non-convex hexagonal spherical tilings, H(C ,τ), changing the side gluing rules of the regular spherical octahedral tiling, by local action of particular subgroups of spherical isometries. In relation to one of the new classes, by hexagonal tiles, we describe some of its properties. We also show the existence of a a new family of monohedral pentagonal tiling which arises as a degenarated case associated to the family H(C ,0). All these classes of spherical tilings have emerged as a result of an interactive construction process, only possible by the use of newly produced GeoGebra tools and the dynamic interaction capabilities of this software.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115837841","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
L, M&A: An Algorithm for Music Lyrics Mining and Sentiment Analysis 李建军，一种基于情感分析的音乐歌词挖掘算法
International Conference on Computers and Their Applications Pub Date : 2019-03-13 DOI: 10.29007/WKJ6
Vasu Saluja, Minni Jain, Prakarsh Yadav
{"title":"L, M&A: An Algorithm for Music Lyrics Mining and Sentiment Analysis","authors":"Vasu Saluja, Minni Jain, Prakarsh Yadav","doi":"10.29007/WKJ6","DOIUrl":"https://doi.org/10.29007/WKJ6","url":null,"abstract":"Here we propose an open source algorithm, L,M&A(Lyrics, Mine and Analyse) to create a dataset of lyrics of the works of various artists. The aim of this approach is to facilitate the generation of a large data set that can be used for improving accuracy of song recommendation algorithms. The limited availability of such datasets has excluded the sentiment analysis of lyrics from music recommendation systems. By using the L,M&A algorithm, it is possible to generate a large dataset which can function as training dataset for future classifier systems. We have used iterative API requests from musixmatch and Genius servers to text mine lyrics data of songs by multiple artists. The data is processed and then analysed for sentiment using lexicons provided in the Tidytext package (BING, AFINN, NRC) and the overall sentiment of artist was determined through modal counts. The occurrence of each sentiments was evaluated and visualized using ggplot2. This representation exhibits the merit of our approach and the applicability of our data. The key feature of our approach is the open source platforms utilized and simplicity of input required from user.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125246736","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 New Method of Calculating Squared Euclidean Distance (SED) Using pTree Technology and Its Performance Analysis 一种利用pTree技术计算平方欧氏距离的新方法及其性能分析
International Conference on Computers and Their Applications Pub Date : 2019-03-13 DOI: 10.29007/TRRG
Mohammad Hossain, Sameer Abufardeh
{"title":"A New Method of Calculating Squared Euclidean Distance (SED) Using pTree Technology and Its Performance Analysis","authors":"Mohammad Hossain, Sameer Abufardeh","doi":"10.29007/TRRG","DOIUrl":"https://doi.org/10.29007/TRRG","url":null,"abstract":"One of the advantages of Euclidean distance is that it measures the regular distance between two points in space. For this reason, it is widely used in the applications where the distance between data points are needed to be calculated to measure similarities. However, this method is costly as there involve expensive square and square root operations. One useful observation is that in many data mining applications absolute distance measures are not necessary as long as the distances are used to compare the closeness between various data points. For example, in classification and clustering, we often measure the distances of multiple data points to compare their distances from known classes or from centroids to assign those points in a class or in a cluster. In this regards, an alternative approach known as Squared Euclidean Distance (SED) can be used to avoid the computation of square root to get the squared distance between the data points. SED has been used in classification, clustering, image processing, and other areas to save the computational expenses. In this paper, we show how SED can be calculated for the vertical data represented in pTrees. We also analyze its performance and compared it with traditional horizontal data representation.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133306271","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信