2017 International Conference on the Frontiers and Advances in Data Science (FADS)最新文献

筛选
英文 中文
A weak blind quantum signature protocol based on four-particle cluster state 基于四粒子簇态的弱盲量子签名协议
2017 International Conference on the Frontiers and Advances in Data Science (FADS) Pub Date : 2017-10-01 DOI: 10.1109/FADS.2017.8253210
Minghui-Zhang, Huifang-Li, Yun-Zhou, Xiaoyi-Feng, Zhengwen-Cao, Jinye-Peng
{"title":"A weak blind quantum signature protocol based on four-particle cluster state","authors":"Minghui-Zhang, Huifang-Li, Yun-Zhou, Xiaoyi-Feng, Zhengwen-Cao, Jinye-Peng","doi":"10.1109/FADS.2017.8253210","DOIUrl":"https://doi.org/10.1109/FADS.2017.8253210","url":null,"abstract":"In this paper, we introduce the cluster states into the weak blind quantum signature mechanism and put forward a weak blind quantum signature protocol with the four-particle entangled cluster states. The proposed protocol generates four relatively bases to be served as the measurement bases for two- qubit. The employment of QKD protocol and one-time pad encryption algorithm ensure the unconditional security of the protocol. Moreover, we hereinafter prove the security of the protocol against some individual eavesdropping attacks, and we show that our protocol has the characteristics of unforgeability, undeniability, blindness and traceability.","PeriodicalId":358459,"journal":{"name":"2017 International Conference on the Frontiers and Advances in Data Science (FADS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114650091","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
Word mover's distance for affect detection 用于影响检测的词移动距离
2017 International Conference on the Frontiers and Advances in Data Science (FADS) Pub Date : 2017-10-01 DOI: 10.1109/FADS.2017.8253186
Mohammed Alshahrani, Spyridon Samothrakis, M. Fasli
{"title":"Word mover's distance for affect detection","authors":"Mohammed Alshahrani, Spyridon Samothrakis, M. Fasli","doi":"10.1109/FADS.2017.8253186","DOIUrl":"https://doi.org/10.1109/FADS.2017.8253186","url":null,"abstract":"Emotion detection from text has been an important task in Natural language processing (NLP) for many years. Many approaches were based on the emotional words or lexicon in order to detect emotions. While the word embedding vectors like Word2Vec were successfully employed in many NLP approaches. Also, word mover's distance (WMD) is a method introduced recently to calculate the distance between two documents based on the embedded words. However, this paper is investigating the ability to detect or classify emotions in sentences using word vectorization and distance measures. Our results confirm the novelty of using Word2Vec and WMD in predicting the emotions in text.","PeriodicalId":358459,"journal":{"name":"2017 International Conference on the Frontiers and Advances in Data Science (FADS)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125703318","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}
引用次数: 5
From convolutional to recurrent: Case study in Nasopharyngeal Carcinoma segmentation 从卷积到复发:鼻咽癌分割的个案研究
2017 International Conference on the Frontiers and Advances in Data Science (FADS) Pub Date : 2017-10-01 DOI: 10.1109/FADS.2017.8253187
Ao Feng, Zhenghao Chen, Xi Wu, Zongqing Ma
{"title":"From convolutional to recurrent: Case study in Nasopharyngeal Carcinoma segmentation","authors":"Ao Feng, Zhenghao Chen, Xi Wu, Zongqing Ma","doi":"10.1109/FADS.2017.8253187","DOIUrl":"https://doi.org/10.1109/FADS.2017.8253187","url":null,"abstract":"Convolutional Neural Network (CNN) is the prevalent framework of image classification, and is also widely used in other image applications including semantic segmentation. Advantages of CNN include hierarchical extraction of patterns, effective training and a small number of parameters. Do they make CNN the ideal candidate for all image processing tasks? In a patch-based semantic image segmentation experiment of Nasopharyngeal Carcinoma (NPC), three different network structures are tested on the same input — CNN, Recurrent Neural Network (RNN) and a mixed model. Results show that RNN achieves comparable accuracy to CNN, and replacing fully- connected layers with RNN further improves performance. A 2D Graph Cut algorithm follows each network to post-process heat maps for a global optimal solution. Within the limited scope of a patch, CNN, RNN and RNN-injected CNN return similar performance metrics, but it becomes a more complex issue to design an appropriate network structure for the complete image, which may be much larger or even in higher dimension. Fully Convolutional Networks (FCNs) have also been proposed for semantic image segmentation, in which the full image goes through consecutive convolutional units for coarse-grained features, then the smaller feature maps must be up-sampled to match the original size. A multidimensional recurrent network at the pixel level or on top of CNN-processed patches will be explored next, aiming at a larger receptive field and higher training efficiency.","PeriodicalId":358459,"journal":{"name":"2017 International Conference on the Frontiers and Advances in Data Science (FADS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125756037","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
Fast QR code detection 快速二维码检测
2017 International Conference on the Frontiers and Advances in Data Science (FADS) Pub Date : 2017-10-01 DOI: 10.1109/FADS.2017.8253216
Xiang Zhang, Hangzai Luo, Jinye Peng, Jianping Fan, Long Chen
{"title":"Fast QR code detection","authors":"Xiang Zhang, Hangzai Luo, Jinye Peng, Jianping Fan, Long Chen","doi":"10.1109/FADS.2017.8253216","DOIUrl":"https://doi.org/10.1109/FADS.2017.8253216","url":null,"abstract":"Quick Response (QR) code is introduced by the Denso Wave in 1994 [7]. It can encode alphanumeric characters, a rich set of information can be made available through encoded URL addresses [2]. Nowadays, with the rich development of Mobile Internet and Internet of Things, it is desired to have a quick and efficient QR code recognition method. However, QR code detection is not an easy job. In this paper, a set of novel approaches to detecting QR code in arbitrarily acquired images are proposed. The proposed method has been evaluated with arbitrarily acquired images. The experimental results show that the proposed methods are effective way to detect QR code position.","PeriodicalId":358459,"journal":{"name":"2017 International Conference on the Frontiers and Advances in Data Science (FADS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130556633","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
A performance comparison of load balancing algorithms for cloud computing 云计算负载均衡算法的性能比较
2017 International Conference on the Frontiers and Advances in Data Science (FADS) Pub Date : 2017-10-01 DOI: 10.1109/FADS.2017.8253211
Tahira Islam, M. S. Hasan
{"title":"A performance comparison of load balancing algorithms for cloud computing","authors":"Tahira Islam, M. S. Hasan","doi":"10.1109/FADS.2017.8253211","DOIUrl":"https://doi.org/10.1109/FADS.2017.8253211","url":null,"abstract":"Cloud service providers such as Amazon Web Services (AWS), Microsoft Azure, and Google Cloud Platform (GCP) have seen exponential growth over the past few years as more companies are shifting their operations to the Cloud. As Cloud serves multiple clients and users simultaneously, it is important but challenging to estimate the performance of load balancing mechanisms for the tasks running on the Cloud. This research has investigated First Come First Served (FCFS), Shortest Job First (SJF) and Least Connection (LC) load balancing algorithms using CloudSim framework and realistic models for Cloud platform e.g. AWS, task etc. The simulation results show that the task execution time for space-shared scheduling policy is closer to the theoretical time than that of time-shared scheduling. Furthermore, it has been observed that LC performs better than SJF and FCFS at lower load.","PeriodicalId":358459,"journal":{"name":"2017 International Conference on the Frontiers and Advances in Data Science (FADS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131148869","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
Lung nodule detection based on 3D convolutional neural networks 基于三维卷积神经网络的肺结节检测
2017 International Conference on the Frontiers and Advances in Data Science (FADS) Pub Date : 2017-10-01 DOI: 10.1109/FADS.2017.8253184
Lei Fan, Zhaoqiang Xia, Xiaobiao Zhang, Xiaoyi Feng
{"title":"Lung nodule detection based on 3D convolutional neural networks","authors":"Lei Fan, Zhaoqiang Xia, Xiaobiao Zhang, Xiaoyi Feng","doi":"10.1109/FADS.2017.8253184","DOIUrl":"https://doi.org/10.1109/FADS.2017.8253184","url":null,"abstract":"With the increasing number of lung cancer patients, the CAD system is playing an increasingly important rule in the field of automatic identification for medical images. Since the 3D characteristics of low-dose CT images make the 3D convolution more suitable than 2D convolution, in this paper, we propose a method to detect lung nodule of lung CT images using 3D convolutional neural networks. Combined with the traditional morphological preprocessing methods, 3D convolutional neural networks are applied to lung CT images. The experimental accuracy indicates that this method is suitable for the problem of lung nodule detection and has great room to improve. The experimental results also demonstrate that the application of deep learning in the medical field will bring great progress for medical development.","PeriodicalId":358459,"journal":{"name":"2017 International Conference on the Frontiers and Advances in Data Science (FADS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131610020","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}
引用次数: 18
Innovative signature based intrusion detection system: Parallel processing and minimized database 基于特征的入侵检测系统:并行处理和最小化数据库
2017 International Conference on the Frontiers and Advances in Data Science (FADS) Pub Date : 2017-10-01 DOI: 10.1109/FADS.2017.8253208
A. H. Almutairi, Nabih T. Abdelmajeed
{"title":"Innovative signature based intrusion detection system: Parallel processing and minimized database","authors":"A. H. Almutairi, Nabih T. Abdelmajeed","doi":"10.1109/FADS.2017.8253208","DOIUrl":"https://doi.org/10.1109/FADS.2017.8253208","url":null,"abstract":"Securing information systems these days in not an option rather than it is a must. The increasing number of attacks on networks and individual systems raised the need for a fast, light, and reliable Intrusion Detection System (IDS). There are two types of detection that an IDS uses: anomaly based detection and signature based detection. This paper focus on the signature based detection. Signature based IDS suffers from the huge number of signatures stored in its database. Some researchers provided the concept of frequent signature database to solve database size problem but never discussed how to deal with new signatures and the old signature that became unnecessary. This paper represents a proposed module that uses parallel processing with small databases with most frequent signatures and an updating agent. This module could be used for both Host based IDS and Network based IDS.","PeriodicalId":358459,"journal":{"name":"2017 International Conference on the Frontiers and Advances in Data Science (FADS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131871591","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}
引用次数: 15
Robust recognition of human activities using smartphone sensor data 使用智能手机传感器数据对人类活动进行鲁棒识别
2017 International Conference on the Frontiers and Advances in Data Science (FADS) Pub Date : 2017-10-01 DOI: 10.1109/FADS.2017.8253203
R. Hussein, Jianzhe Lin, K. Madden, Z. J. Wang
{"title":"Robust recognition of human activities using smartphone sensor data","authors":"R. Hussein, Jianzhe Lin, K. Madden, Z. J. Wang","doi":"10.1109/FADS.2017.8253203","DOIUrl":"https://doi.org/10.1109/FADS.2017.8253203","url":null,"abstract":"Human Activity Recognition (HAR) plays a key role in remote patient activity monitoring, particularly for the disabled and elderly. Manually supervising human's activity would be labor and time-consuming. To relieve this manual process, machine learning-based HAR has drawn researchers' attention. In this work, we introduce a robust HAR system capable of identifying six different classes of body movements with high accuracy. The input data is first collected by a smart phone worn on the subject's waist, where the tri-axial accelerometer signals are recorded. Then, the most discriminant features are extracted and further selected from the captured smart phone sensor data, which are further classified by the random forest classifier. We examine the classification performance of the proposed method on a publicly available HAR dataset. The superiority of the proposed method is verified by comparing its performance to those of the state-of-the-art methods. An overall classification accuracy of 98.05% can be achieved.","PeriodicalId":358459,"journal":{"name":"2017 International Conference on the Frontiers and Advances in Data Science (FADS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133548776","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
Pattern discovery from dynamic data streams using frequent pattern mining with multi-support thresholds 使用具有多支持阈值的频繁模式挖掘从动态数据流中发现模式
2017 International Conference on the Frontiers and Advances in Data Science (FADS) Pub Date : 2017-10-01 DOI: 10.1109/FADS.2017.8253190
Manal Almuammar, M. Fasli
{"title":"Pattern discovery from dynamic data streams using frequent pattern mining with multi-support thresholds","authors":"Manal Almuammar, M. Fasli","doi":"10.1109/FADS.2017.8253190","DOIUrl":"https://doi.org/10.1109/FADS.2017.8253190","url":null,"abstract":"Discover the frequent patterns from streams of data is challenging due to the characteristics of such streams: a continuous unbounded high speed data of evolving nature which must be processed on the fly with bounded computing memory and limited storage capacities. On other hand, the growth of the Internet of Things (IoT) has helped to sense everything around us at home, work and in the streets. The IoT is a network of physical devices, vehicles and other items which are embedded with sensors, software and network connectivity that enables these objects to collect and exchange data. Data from a large numbers of sensors, deployed in infrastructure (such as roads and buildings) or to report on environmental conditions, can give decision makers a heightened awareness of real-time events. In this work, we develop methods to exploit real-time streaming data that flows from IoT devices. In particular, we aim to discover the interesting frequent patterns from these heterogeneous streams. Therefore we will classify the items in the joint stream over titled time windows to reduce the number of emerging patterns, then we will mine the frequent pattern over the classified items using multi-support threshold. We conduct the experiment on a car parking lots environment with three simulated streams from sensors, smart payment machines and a mobile application.","PeriodicalId":358459,"journal":{"name":"2017 International Conference on the Frontiers and Advances in Data Science (FADS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123484949","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
An exploration of the directional change based trading strategy with dynamic thresholds on variable frequency data streams 基于方向变化的动态阈值交易策略在变频数据流上的探索
2017 International Conference on the Frontiers and Advances in Data Science (FADS) Pub Date : 2017-10-01 DOI: 10.1109/FADS.2017.8253207
Nora Alkhamees, M. Fasli
{"title":"An exploration of the directional change based trading strategy with dynamic thresholds on variable frequency data streams","authors":"Nora Alkhamees, M. Fasli","doi":"10.1109/FADS.2017.8253207","DOIUrl":"https://doi.org/10.1109/FADS.2017.8253207","url":null,"abstract":"The Directional Change (DC) is an event approach for summarizing price movements in financial markets based on a given threshold value. The Dynamic Threshold Trading Strategy (DT-TS) is a trading strategy built based on the DC approach with daily dynamic defined threshold values. The DT-TS trading action is triggered, if a DC event is detected (price change is spotted) and the prices continue to increase or decrease. The Buy or Sell trading action to be taken depends on the previous day price changes (short term history). In this paper, we apply the DT-TS trading strategy on data streams of different frequency to investigate its potential to generate surplus. One major issue under examination is the strategy's applicability and ability to provide good results on data streams of different frequency (higher versus lower frequency). An experiment was conducted using the FTSE 100 index min-bymin and day-by-day streams for more than 35 weeks. Results showed that the DT-TS works better (gained higher profits) with higher frequency data rather than lower frequency data.","PeriodicalId":358459,"journal":{"name":"2017 International Conference on the Frontiers and Advances in Data Science (FADS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115031188","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
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书