{"title":"Malware Subspecies Detection Method by Suffix Arrays and Machine Learning","authors":"Kouhei Kita, R. Uda","doi":"10.1109/CISS50987.2021.9400219","DOIUrl":"https://doi.org/10.1109/CISS50987.2021.9400219","url":null,"abstract":"Malware such as metamorphic virus changes its codes and it cannot be detected by pattern matching. Such malware can be detected by surface analysis, dynamic analysis or static analysis. We focused on surface analysis since neither virtual environments nor high level engineering is required. A representative method in surface analysis is n-gram with machine learning. On the other hand, important features are sometimes cut off by n-gram since n is not variable in some existing methods. Hence, scores of malware detection methods are not perfect. Moreover, creating n-gram features takes long time for comparing files. Furthermore, in some n-gram methods, invisible malware can be created when the methods are known to attackers. Therefore, we proposed a new malware subspecies detection method by suffix arrays and machine learning. We evaluated the method with four real malware subspecies families and succeeded to classify them with almost 100% accuracy.","PeriodicalId":228112,"journal":{"name":"2021 55th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115348637","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}
Jessica Maghakian, Russell Lee, M. Hajiesmaili, Jian Li, Zhenhua Liu, R. Sitaraman
{"title":"Leveraging Different Types of Predictors for Online Optimization (Invited Paper)","authors":"Jessica Maghakian, Russell Lee, M. Hajiesmaili, Jian Li, Zhenhua Liu, R. Sitaraman","doi":"10.1109/CISS50987.2021.9400315","DOIUrl":"https://doi.org/10.1109/CISS50987.2021.9400315","url":null,"abstract":"Predictions have a long and rich history in online optimization research, with applications ranging from video streaming to electrical vehicle charging. Traditionally, different algorithms are evaluated on their performance given access to the same type of predictions. However, motivated by the problem of bandwidth cost minimization in large distributed systems, we consider the benefits of using different types of predictions. We show that the two different types of predictors we consider have complimentary strengths and weaknesses. Specifically, we show that one type of predictor has strong average-case performance but weak worst-case performance, while the other has weak average-case performance but strong worst-case performance. By using a learning-augmented meta-algorithm, we demonstrate that it is possible to exploit both types of predictors for strong performance in all scenarios.","PeriodicalId":228112,"journal":{"name":"2021 55th Annual Conference on Information Sciences and Systems (CISS)","volume":"2006 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116932515","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":"Performance of a Blind Adaptive Digital Beamformer on a Multi-user Rician Channel","authors":"Peter O. Taiwo, A. Cole-Rhodes","doi":"10.1109/CISS50987.2021.9400226","DOIUrl":"https://doi.org/10.1109/CISS50987.2021.9400226","url":null,"abstract":"In this work we test the performance of a blind adaptive digital beamformer for multiple users transmitting to a base station that is equipped with a uniform linear array (ULA) antenna. Each user transmits a signal block of complex QAM signals over a wireless channel, with multipath fading and noise. This channel is modeled by a Rician distribution with a dominant line-of-sight (LOS) path and three non-LOS (NLOS) paths. The beamformer is implemented using a blind adaptive CMA-AMA cost function to recover the signal block from each user, and to estimate the channel in a multi-stage manner. The performance of the system is evaluated over a range of transmitted signal power from the users. We evaluate the effect of varying the number of elements at the base station ULA antenna, by comparing symbol error rates (SER) of the received signal and the mean square error (MSE) of the estimated channel.","PeriodicalId":228112,"journal":{"name":"2021 55th Annual Conference on Information Sciences and Systems (CISS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129626098","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}
Z. Ali, G. Qi, Khan Muhammad, Asim Khalil, Inam Ullah, Amin Khan
{"title":"Global Citation Recommendation employing Multi-view Heterogeneous Network Embedding","authors":"Z. Ali, G. Qi, Khan Muhammad, Asim Khalil, Inam Ullah, Amin Khan","doi":"10.1109/CISS50987.2021.9400311","DOIUrl":"https://doi.org/10.1109/CISS50987.2021.9400311","url":null,"abstract":"The enormous number of research papers on the Web motivated researchers to propose models that could assist users with personalized citation recommendations. Recently, Citation Recommendation (CR) models applying Network Representation Learning (NRL) techniques have revealed promising outcomes. Still, current NRL-based models are limited in terms of employing salient factors and relations between the objects of Multi-view Heterogeneous Networks (MHNs), hence, they failed to capture researchers' preferences. Besides, these models cannot exploit heterogeneity in the networks and hence suffer from the sparsity problems. To overcome these problems, we propose GCR-MHNE model, which employs a Multi-View Heterogeneous Network Embedding method to generate personalized recommendations. Specifically, it exploits semantic relations between papers based on citations, venue information, topical relevance, authors' information, and relevant labels to learn their vector representations. Moreover, the model captures the most influential features related to each semantic relation employing an attention mechanism. Compared to its counterparts, GCR-MHNE brings 6% and 7% improvements using the openly-available datasets in terms of Mean Average Precision and Normalized Discounted Cumulative Gain metrics, respectively. Furthermore, the proposed model outperforms its counterparts when the networks are sparse.","PeriodicalId":228112,"journal":{"name":"2021 55th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129632362","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}
Mini Jain, Peya Mowar, Ruchika Goel, D. Vishwakarma
{"title":"Clickbait in Social Media: Detection and Analysis of the Bait","authors":"Mini Jain, Peya Mowar, Ruchika Goel, D. Vishwakarma","doi":"10.1109/CISS50987.2021.9400293","DOIUrl":"https://doi.org/10.1109/CISS50987.2021.9400293","url":null,"abstract":"Taking advantage of visual-centric social media's rising popularity, content creators have started using enticing images to lure users into clicking on bothersome clickbaits, in place of previously used text-based baits. In addition, the development of a single model to detect clickbait on multiple image-centric social media platforms is largely an unexplored problem. Therefore, we introduce a novel model that can detect visual clickbaits on both Instagram and Twitter posts. The proposed model consists of a stacking classifier framework composed of six base models (K-Nearest Neighbors, Support Vector Machine, XGBoost, Naive Bayes, Logistic Regression, and Multilayer Perceptron) and a meta-classifier (Random Forest). The developed classifier achieved an accuracy of 88.5% for Instagram posts and 85% for Twitter posts, which is an improvement over previous separate state-of-the-art models for both platforms. Additionally, the stated classifier does not use meta-features (e.g., the number of likes or followers) for classification, which helps to detect potential clickbaits right away, enhancing its applicability in real-time clickbait detection use cases. Furthermore, based on our analysis, we have drawn essential conclusions about the telling characteristics of clickbaits.","PeriodicalId":228112,"journal":{"name":"2021 55th Annual Conference on Information Sciences and Systems (CISS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124071429","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":"Model-free safe policy learning via hard action barrier functions","authors":"Agustin Castellano, J. Bazerque, Enrique Mallada","doi":"10.1109/CISS50987.2021.9400210","DOIUrl":"https://doi.org/10.1109/CISS50987.2021.9400210","url":null,"abstract":"To enable model-free learning of safe policies in Constrained Markov Decision Processes, we advance the notion of penalties as an information source that complements rewards and is similarly acquired from experience. Without prior knowledge of the safety constraints, the agent must resort to penalties-that signal infeasibility-in order to learn which actions lead to constraint violations. Accordingly, we define the notion of hard action barrier functions, which incorporate penalties as (0,+infinity) binary information, and gradually reveal implicit state-action pair constraints that must be satisfied in order to avoid (possibly future) unsafe states. Using this notion, we characterize a separation principle that decouples safety from reward maximization. Based on this principle we propose an adaptive algorithm that learns the action barrier function independently of the specific reward structure. As a result, our Barrier-Learning algorithm can wrap around standard on-and off-policy algorithms such as Q-Learning and SARSA. Our solution has the added benefit of learning from previous mistakes by avoiding bumping into the same rock twice, i.e., not taking the same unsafe action that led to a constraint violation in the past. This results in a policy that complies with the constraints almost surely. We demonstrate these combined algorithms in a grid-walk with walls that must be avoided on the way to a target.","PeriodicalId":228112,"journal":{"name":"2021 55th Annual Conference on Information Sciences and Systems (CISS)","volume":"62 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132983075","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":"Robust Automatic Modulation Classification in the Presence of Adversarial Attacks","authors":"R. Sahay, D. Love, Christopher G. Brinton","doi":"10.1109/CISS50987.2021.9400326","DOIUrl":"https://doi.org/10.1109/CISS50987.2021.9400326","url":null,"abstract":"Automatic modulation classification (AMC) is used in intelligent receivers operating in shared spectrum environments to classify the modulation constellation of radio frequency (RF) signals from received waveforms. Recently, deep learning has proven capable of enhancing AMC performance using both convolutional neural networks (CNNs) and recurrent neural networks (RNNs). However, deep learning-based AMC models are susceptible to adversarial attacks, which can significantly degrade the performance of well-trained models by adding small amounts of interference into wireless RF signals during transmission. In this work, we present a two-fold defense mechanism to withstand adversarial interference on modulated radio signals. Specifically, our method consists of (1) correcting misclassifications on mild attacks and (2) detecting the presence of an adversary on more potent attacks. We show that our proposed defense is capable of withstanding adversarial interference injected into RF signals while maintaining false positive detection rates on CNNs and RNNs as low as 3%.","PeriodicalId":228112,"journal":{"name":"2021 55th Annual Conference on Information Sciences and Systems (CISS)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134011663","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":"Investigating the Statistical Assumptions of Naïve Bayes Classifiers","authors":"A. Kelly, M. Johnson","doi":"10.1109/CISS50987.2021.9400215","DOIUrl":"https://doi.org/10.1109/CISS50987.2021.9400215","url":null,"abstract":"This paper investigates the impact of the probability distribution of a Naive Bayes classifier and the statistical distribution of the underlying feature data on the classifier's performance. Typical Naive Bayes performance assumptions lack quantitative and rigorous evidence in the common literature creating risk in rote application of Naive Bayes. This study investigates these performance assumptions to quantify where they are true, and the risk of maintaining those assumptions when utilizing Naive Bayes classifiers. Naive Bayes classifiers' exceptionally fast training times, performance, ease to implement, and minimal required resources often make them candidates for early classification trials, especially in Natural Language Processing tasks such as sentiment analysis. It is frequently assumed that the performance of a Naive Bayes classifier is heavily reliant with the distribution of the underlying data. This assumption is noted both in standard documentation and academic research and has largely been accepted as truth with little verification. This paper outlines an experiment that tests this assumption with real world sentiment analysis data. Naive Bayes classifiers were tested against non-Gaussian data, non-Gaussian feature weighted data, Gaussian-like data, and synthetically generated Gaussian data to observe the relationship between classifier performance and data distribution. Initial findings suggested that while this assumption is partially true, there may be additional factors heavily related with Naive Bayes performance that are not strictly related to a feature's distribution.","PeriodicalId":228112,"journal":{"name":"2021 55th Annual Conference on Information Sciences and Systems (CISS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130121003","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}
Zhuobin Lin, Xue-chen Chen, Xuming Lu, Hongzhou Tan
{"title":"A Practical Low Delay Digital Scheme for Wyner-Ziv Coding over Gaussian Broadcast Channel","authors":"Zhuobin Lin, Xue-chen Chen, Xuming Lu, Hongzhou Tan","doi":"10.1109/CISS50987.2021.9400282","DOIUrl":"https://doi.org/10.1109/CISS50987.2021.9400282","url":null,"abstract":"In this paper, we propose a practical low delay digital scheme for lossy transmission of a Gaussian source over Gaussian broadcast channel when there is correlated side information at the receivers. Focusing on two receivers scenario, a bit-filling criterion is applied at the transmitter, to establish a connection between the common layer and refinement layer data. Then, we complete the dirty paper coding according to jointly typicality and finally superimpose the two layers for transmission. At the receiver, we propose a modified log-likelihood ratio-belief propagation decoding algorithm to utilize side information. And a typical-set based decoding algorithm is introduced to be an effective supplement if the decoding decision of the successive canceling method fails. Simulated results show that the proposed typical set decoding algorithm plays an excellent part in refinement layer recovery, and on the whole, the proposed digital scheme renders better reconstruction accuracy than the corresponding low delay separate source channel coding.","PeriodicalId":228112,"journal":{"name":"2021 55th Annual Conference on Information Sciences and Systems (CISS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134044570","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":"A Deep Transfer Learning-based Edge Computing Method for Home Health Monitoring","authors":"A. Sufian, Changsheng You, M. Dong","doi":"10.1109/CISS50987.2021.9400321","DOIUrl":"https://doi.org/10.1109/CISS50987.2021.9400321","url":null,"abstract":"The health-care gets huge stress in a pandemic or epidemic situation. Some diseases such as COVID-19 that causes a pandemic is highly spreadable from an infected person to others. Therefore, providing health services at home for noncritical infected patients with isolation shall assist to mitigate this kind of stress. In addition, this practice is also very useful for monitoring the health-related activities of elders who live at home. The home health monitoring, a continuous monitoring of a patient or elder at home using visual sensors is one such nonintrusive sub-area of health services at home. In this article, we propose a transfer learning-based edge computing method for home health monitoring. Specifically, a pre-trained convolutional neural network-based model can leverage edge devices with a small amount of ground-labeled data and fine-tuning method to train the model. Therefore, on-site computing of visual data captured by RGB, depth, or thermal sensor could be possible in an affordable way. As a result, raw data captured by these types of sensors is not required to be sent outside from home. Therefore, privacy, security, and bandwidth scarcity shall not be issues. Moreover, real-time computing for the above-mentioned purposes shall be possible in an economical way.","PeriodicalId":228112,"journal":{"name":"2021 55th Annual Conference on Information Sciences and Systems (CISS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133682396","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}