{"title":"Non-connection Wireless IoT Network Control Using WiFi and Bluetooth Beacon","authors":"Sanggon Lee","doi":"10.1145/3155133.3155169","DOIUrl":"https://doi.org/10.1145/3155133.3155169","url":null,"abstract":"In this paper, we propose a control system and algorithm that can send and receive data between smartphone and IoT device without connections. Existing technologies have incurred overhead such as current consumption and network occupation required for connection and connection maintenance for services and products that do not require continuous information reception or control. In order to reduce the overhead of existing technology, this paper proposes a method of transmitting control information by omitting a separate connection process by transmitting a beacon signal to an IoT device when a user inputs a control command. Soft AP and low power Bluetooth (BLE) are used in smartphone of Android platform and evaluated in Home IoT Network environment. As a result of implementing the proposed algorithm and measuring the performance, there is no overhead such as current consumption and network occupation required for connection and connection maintenance occurring in existing technology. The system using Soft AP was controlled at speed equivalent to that of existing technology within 8 meters in terms of control speed and improved about 10% at a distance of 8 meters or more. The system using BLE showed about 30% improvement in overall distance.","PeriodicalId":258764,"journal":{"name":"Proceedings of the 8th International Symposium on Information and Communication Technology","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114666834","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}
V. T. Pham, Haihua Xu, Xiong Xiao, Nancy F. Chen, Chng Eng Siong
{"title":"Pruning Strategies for Partial Search in Spoken Term Detection","authors":"V. T. Pham, Haihua Xu, Xiong Xiao, Nancy F. Chen, Chng Eng Siong","doi":"10.1145/3155133.3155164","DOIUrl":"https://doi.org/10.1145/3155133.3155164","url":null,"abstract":"In this paper, we propose a partial search approach for subword-based keyword search (KWS) systems. The proposed approach addresses the problem of high miss rate in the conventional full sequence matching approach by retaining detections that only contain some partial sequences. To control the increase of false alarm (FA), we propose two pruning methods, global threshold pruning (GTP) and keyword-specific pruning (KSP). The former uses the same threshold for all keywords; while the latter gradually adjusts a specific threshold for each keyword. Experimental results on the NIST OpenKWS15 and OpenKWS16 Evaluations show that partial search using KSP is effective. For out-of-vocabulary keywords, our proposed approach reduces the miss rate up to 21.0% absolute and improves the Actual Term Weighted Value (ATWV) up to 19.2% absolute over the full search baseline","PeriodicalId":258764,"journal":{"name":"Proceedings of the 8th International Symposium on Information and Communication Technology","volume":"80 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122368889","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}
{"title":"SAT Encodings of Finite-CSP Domains: A Survey","authors":"Van-Hau Nguyen","doi":"10.1145/3155133.3155167","DOIUrl":"https://doi.org/10.1145/3155133.3155167","url":null,"abstract":"Many real-world applications can be expressed as constraint satisfaction problems (CSPs), although hardly any problems are originally given by SAT formulas. Nevertheless, to benefit from powerful SAT solvers, many SAT encodings of CSPs have been studied recently. Such encodings should not only be effectively generated, but should also be efficiently processed by SAT solvers. In this survey we present a novel approach on how to encode a finite-CSP domains into a SAT instance in a comprehensive and precise way. The paper also provides a informative comparison among SAT encodings in term of the number of variables and clauses required, and the strength of consistency achieved by unit propagation.","PeriodicalId":258764,"journal":{"name":"Proceedings of the 8th International Symposium on Information and Communication Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121742279","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}
{"title":"Toward a Crowdsourcing-Based Urban Flood Mitigation Platform","authors":"Q. Minh, Thanh Nguyen Chi, M. Toulouse","doi":"10.1145/3155133.3155153","DOIUrl":"https://doi.org/10.1145/3155133.3155153","url":null,"abstract":"Urban flood management and mitigation is one of the critical missions to maintain a stable city development. Most of the current available flood mitigation approaches are using data from fixed-site sensor systems which are not only costly but also limited in their coverage. Crowdsourcing is one of the potential approaches for addressing the coverage issue where flood data is collected and shared by crowds available everywhere. However, existing crowdsourcing-based approaches to flood mitigation systems lack thorough solutions on data validity. This paper proposes an appropriate crowdsourced data validity scheme which relies on both the scores evaluated by other users in the crowds and the accumulated reputation obtained by the user who shares the data. The paper also presents a practical mechanism to cluster reported data based on spatial and temporal information to improve the effectiveness of the data analytics. The proposed approaches have been implemented in an urban flood mitigation platform prototype running on both the IOS and the Android mobile devices. This prototype preliminarily shows the appropriateness and the usefulness of the proposed solutions.","PeriodicalId":258764,"journal":{"name":"Proceedings of the 8th International Symposium on Information and Communication Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115868190","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}
{"title":"Abnormal Activity Detection based on Dense Spatial-Temporal Features and Improved One-Class Learning","authors":"Tam N. Nguyen, N. Ly","doi":"10.1145/3155133.3155147","DOIUrl":"https://doi.org/10.1145/3155133.3155147","url":null,"abstract":"Abnormal activity detection is an important issue in video surveillance. The abnormal activity could be a predictable activity or unpredictable activity. This paper focuses on unpredictable activity detection. Due to unpredictable anomalies, we do not have training data of them, so we could not use the discriminative learning model to detect abnormal activity and normal activity. One class learning method is the generative model and it is suitable to model unpredictable abnormal activities. In this paper, we use fast dense spatial-temporal features within regions of interest points to model normal activities by Support Vector Data Description (SVDD). Besides. we use K-means++ algorithm to cluster normal data then the multi hyperspheres SVDD are constructed separately on clusters instead of only one hypersphere SVDD on multi-distribution data. Experiments on benchmark datasets contain various situations with human crowds, overlapping between individual subjects and low resolution. The experiments show that our approach could outperform some state of the art methods on the Ped2 dataset.","PeriodicalId":258764,"journal":{"name":"Proceedings of the 8th International Symposium on Information and Communication Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134394082","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}
{"title":"U-RPC: a Protocol for Microservices in DHT","authors":"G. Utard, Hung-Cuong Le, Trung-Thanh Tran","doi":"10.1145/3155133.3155198","DOIUrl":"https://doi.org/10.1145/3155133.3155198","url":null,"abstract":"In this paper, we will describe a new programming framework call U-RPC to ensure a fault tolerant distributed computing system by using Distributed Hash Table (DHT). DHT is widely used in P2P networks as a scalable mechanism to store and get data since many years ago. Many of the DHT algorithm and implementation was proposed and applied in the real system, each one has advantages or disadvantages depending on the context of the system. In our proposal, we would like to add an RPC layer on top of any DHT. With U-RPC, users can do many more complex tasks in the DHT but not limited to traditional tasks: put/get/free anymore. In order to prove the correctness of our framework, we had implemented our framework on top of Kademlia and deployed it on Grid5000, a French large scale, testbed for experiment driven research in all areas of computer science. Our results show that we can easily provide an RPC layer for an existing Kademlia DHT to use in microservices architecture and guarantee the fault tolerance.","PeriodicalId":258764,"journal":{"name":"Proceedings of the 8th International Symposium on Information and Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129374965","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}
Canh V. Pham, Hoang M. Dinh, H. Nguyen, Huyen T. Dang, Huan X. Hoang
{"title":"Limiting the Spread of Epidemics within Time Constraint on Online Social Networks","authors":"Canh V. Pham, Hoang M. Dinh, H. Nguyen, Huyen T. Dang, Huan X. Hoang","doi":"10.1145/3155133.3155157","DOIUrl":"https://doi.org/10.1145/3155133.3155157","url":null,"abstract":"In this paper, we investigate the problem of limiting the spread of epidemics on online social networks (OSNs) with the aim to seek a set nodes of size at most k to remove from the networks such that the number of saved nodes is maximal for cases where we already know the set of infected nodes on the networks. The problem is proved to be NP-hard and it is NP-hard to approximate the problem with ratio n1-ϵ, for 0 < ϵ < 1. Besides, we also suggest two algorithms to solve the problem. Experimental results show that our propsed outperform baseline algorithms.","PeriodicalId":258764,"journal":{"name":"Proceedings of the 8th International Symposium on Information and Communication Technology","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127173791","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}
{"title":"Parallel Multi-feature Attention on Neural Sentiment Classification","authors":"Zhu Pengcheng, Yang Yujiu","doi":"10.1145/3155133.3155193","DOIUrl":"https://doi.org/10.1145/3155133.3155193","url":null,"abstract":"The analysis of the review's sentiment polarity is a fundamental task in NLP. However, most of the existing sentiment classification models only focus on extracting features but ignore features' own differences. Additionally, these models only pay attention to content information but ignore the user's ranking preference. To address these issues, we propose a novel Parallel Multi-feature Attention (PMA) neural network which concentrates on fine-grained information between user and product level content features. Moreover, we use multi-feature, user's ranking preference included, to improve the performance of sentiment classification. Experimental results on IMDB and Yelp datasets show that PMA model achieves state-of-the-art performance.","PeriodicalId":258764,"journal":{"name":"Proceedings of the 8th International Symposium on Information and Communication Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129948731","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}
{"title":"GINTATE: Scalable and Extensible Deep Packet Inspection System for Encrypted Network Traffic: Session Resumption in Transport Layer Security Communication Considered Harmful to DPI","authors":"Ryosuke Miura, Yuuki Takano, Shinsuke Miwa, Tomoya Inoue","doi":"10.1145/3155133.3155152","DOIUrl":"https://doi.org/10.1145/3155133.3155152","url":null,"abstract":"Deep packet inspection (DPI) is a basic monitoring technology, which realizes network traffic control based on application payload. The technology is used to prevent threats (e.g., intrusion detection systems, firewalls) and extract information (e.g., content filtering systems). Moreover, transport layer security (TLS) monitoring is required because of the increasing use of the TLS protocol, particularly by hypertext transfer protocol secure (HTTPS). TLS monitoring is different from TCP monitoring in two aspects. First, monitoring systems cannot inspect the content in TLS communication, which is encrypted. Second, TLS communication is a session unit composed of one or more TCP connections. In enterprise networks, dedicated TLS proxies are deployed to perform TLS monitoring. However, the proxies cannot be used when monitored devices are unable to use a custom certificate. Additionally, these networks contain problems of scale and complexity that affect the monitoring. Therefore, the DPI processing using another method requires high-speed processing and various protocol analyses across TCP connections in TLS monitoring. However, it is difficult to realize both simultaneously. We propose GINTATE, which decrypts TLS communication using shared keys and monitors the results. GINTATE is a scalable architecture that uses distributed computing and considers relational sessions across multiple TCP connections in TLS communication. Additionally, GINTATE achieves DPI processing by adding an extensible analysis module. By comparing GINTATE against other systems, we show that it can perform DPI processing by managing relational sessions via distributed computing and that it is scalable.","PeriodicalId":258764,"journal":{"name":"Proceedings of the 8th International Symposium on Information and Communication Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127960083","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}
{"title":"Ontology-Based Entity Coreference Resolution For Sentiment Analysis","authors":"T. L. Thi, Tho Quan Thanh, Tuoi Phan Thi","doi":"10.1145/3155133.3155168","DOIUrl":"https://doi.org/10.1145/3155133.3155168","url":null,"abstract":"To date, entity coreference resolution and sentiment analysis still exist as independent problems, but they are both popular research topics in the community of natural language processing. However, the combination of those two problems. even though very potentially useful, has not been getting much attention. This paper addresses this issue by proposing an approach applying knowledge base to resolve coreference between two kinds of entities, objects and aspects, which are embedded with sentiment information. The knowledge base is introduced as a sentiment ontology. In addition, the paper also proposes a model of ontology-based coreference resolution in sentiment analysis for English text. Finally, we also discuss evaluation methods applied for our model and the results obtained.","PeriodicalId":258764,"journal":{"name":"Proceedings of the 8th International Symposium on Information and Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131309646","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}