{"title":"Doubly-Rational Series: Recognizability and Realizations","authors":"G. Venkatesh","doi":"10.1109/CISS53076.2022.9751193","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751193","url":null,"abstract":"The goal of this paper is to introduce the notion of a doubly-rational formal power series and two equivalent characterizations, one in terms of an analogue of recognizability of a series, and the other in the context of state space realizations of nonlinear input-output systems represented by Chen-Fliess series. As an application, it is shown how to model a bilinear system with output saturation in this context.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121317315","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 Non-Zero Sum Bandwidth Scanning Game with a Sophisticated Adversary","authors":"A. Garnaev, W. Trappe","doi":"10.1109/CISS53076.2022.9751180","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751180","url":null,"abstract":"Detecting malicious users (adversaries) or unlicensed activities is a crucial problem facing dynamic spectrum access. Traditionally, in such a problem, the adversary is considered to be one who wants to get achieve malicious goal undetected. In this paper we deal with a new type of adversary, called sophisticated adversary, who, besides the basic goal of being malicious and undetected, it also wants to achieve this in the most unpredictable way. As a metric for such unpredictability we consider the entropy of adversary strategy. We model this problem by a nonzero-sum two players resource allocation game. One of the players, called the Scanner, wants to detect the sophisticated adversary. The other player (adversary), called the Invader, wants to find a trade-off between two goals: to sneak bandwidth usage undetected and to achieve such sneaking in the most unpredictable way. The equilibrium is found in closed form, and its dependence on communication network parameters is illustrated. Finally, weighting coefficients for the basic and secondary goals of the Invader are optimized via Nash bargaining.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128460419","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":"Sequential Recommendation Using Deep Reinforcement Learning and Multi-Head Attention","authors":"Raneem Sultan, Mervat Abu-Elkheir","doi":"10.1109/CISS53076.2022.9751174","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751174","url":null,"abstract":"Recommender Systems have become a crucial part of many of our online interactions. From shopping for clothes, planning a trip, or deciding what to watch, recommender systems are aiming to help users navigate the overwhelming amount of options available online. The problem with most of the existing recommender systems is that they treat the recommendation process as a static one and make recommendations according to a fixed greedy strategy. This is a problem because user preferences are dynamic. In this paper, we aim to address this problem by modeling the recommendation problem as a Markov Decision Process (MDP) and solving it using deep reinforcement learning. Furthermore, we use multi-head attention to improve the recommendations. We conduct extensive experiments using the MovieLens real-world dataset and achieve an improvement of 6% over the state-of-the-art approach results in terms of precision@20.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123950531","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":"Differentially Private Federated Learning with Drift Control","authors":"Wei-Ting Chang, Mohamed Seif, R. Tandon","doi":"10.1109/CISS53076.2022.9751200","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751200","url":null,"abstract":"In this paper, we consider the problem of differentially private federated learning with statistical data heterogeneity. More specifically, users collaborate with the parameter server (PS) to jointly train a machine learning model using their local datasets that are non-i.i.d. across users. The PS is assumed to be honest-but-curious so that the data at users need to be kept private from the PS. More specifically, interactions between the PS and users must satisfy differential privacy (DP) for each user. In this work, we propose a differentially private mechanism that simultaneously deals with user-drift caused by non-i.i.d. data and the randomized user participation in the training process. Specifically, we study SCAFFOLD, a popular federated learning algorithm, that has shown better performance on dealing with non-i.i.d. data than previous federated averaging algorithms. We study the convergence rate of SCAFFOLD under differential privacy constraint. Our convergence results take into account time-varying perturbation noises used by the users, and data and user sampling. We propose two time-varying noise allocation schemes in order to achieve better convergence rate and satisfy a total DP privacy budget. We also conduct experiments to confirm our theoretical findings on real world dataset.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128743988","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":"Rate Region of the One-Help-Two Quadratic Gaussian Source-Coding Problem with Markovity","authors":"O. Bilgen, A. Wagner","doi":"10.1109/CISS53076.2022.9751169","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751169","url":null,"abstract":"We study the quadratic Gaussian one-help-two source-coding problem with Markovity, in which three encoders separately encode the components of a memoryless vector-Gaussian source that form a Markov chain and the central decoder aims to reproduce the first and the second components in the chain subject to individual mean-squared distortion constraints. We determine the rate region under a high-resolution assumption for the middle source.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128702012","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":"Development of Anomalous Video Detection System using Hybrid-Features Analysis of Actions and Scene-Backgrounds Information","authors":"Bharindra Kamanditya","doi":"10.1109/CISS53076.2022.9751197","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751197","url":null,"abstract":"Detecting an anomalous event in video clips captured from a surveillance camera is an important task, especially for security system purposes. However, as the probability of such occurrence is very low, automatic detection of the anomalous event is then necessary to replace the human labor-intensive works. Researchers have developed various methods to solve this problem, however, most of the proposed methods limit their definitions of anomalous events that might be perceived as having a different meaning when it occurs in other scene backgrounds. We have developed an automatic anomalous video detection system by extracting the individual action from the video clips, followed by extracting also various scene-background characteristics related with the respective action, and represented as a Video Graph to be classified as an anomaly through a Graph Convolutional Networks. We also constructed a new database as the available databases could not be used in this experiment. Results of experiments show that the various anomalous actions videos have been successfully detected with higher recognition capability compared with that of the conventional methods.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133767685","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":"Statistical Delay and Error-Rate Bounded QoS Control for mURLLC Over 6G Multimedia Mobile Wireless Networks in the Non-Asymptotic Regime","authors":"Xi Zhang, Jingqing Wang, H. Poor","doi":"10.1109/CISS53076.2022.9751187","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751187","url":null,"abstract":"To support the exponentially increasing demand for bandwidth-intensive and delay-sensitive real-time multimedia data services, researchers have made tremendous efforts to provide a better quality-of-service (QoS) when designing next generation wireless network architecture models for massive ultra-reliable and low-latency communications (mURLLC). One of the major design issues raised by mURLLC is how to guarantee stringent delay and error-rate bounded QoS requirements when implementing short-packet data communications, such as finite blocklength coding (FBC), over highly time-varying wireless fading channels. To efficiently accommodate statistical QoS for mURLLC over 6G mobile wireless networks, it is important to remodel wireless fading channel's stochastic-characteristics by defining statistical QoS metrics and their analytical relationships, such as delay-bound-violating probability, effective capacity, error probability, outage capacity, etc., when applying FBC. However, when being integrated with FBC, how to rigorously characterize stochastic dynamics of wireless networks in terms of statistically upper-bounding both delay and error-rate QoS metrics has been neither well understood not thoroughly studied. To overcome these obstacles, in this paper we develop analytical frameworks and control mechanisms for statistical delay and error-rate bounded QoS in non-asymptotic regime. First, we establish FBC-based wireless-fading channels model by characterizing various information-theoretic specifications. Then, we develop a set of new statistical delay and error-rate bounded QoS metrics, tradeoff-functions, and control mechanisms including e-effective capacity, delay-bound-violating probability, Markov-model-based QoS-exponents functions, and FBC-based outage-capacity in finite blocklength regime. Finally, our simulation results validate and evaluate our developed mechanisms for statistical QoS in supporting mURLLC over 6G wireless networks.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125748560","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":"Hidden Vulnerabilities in Cosine Similarity based Poisoning Defense","authors":"Harsh Kasyap, S. Tripathy","doi":"10.1109/CISS53076.2022.9751167","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751167","url":null,"abstract":"Federated learning is a collaborative learning paradigm that deploys the model to the edge for training over the local data of the participants under the supervision of a trusted server. Despite the fact that this paradigm guarantees privacy, it is vulnerable to poisoning. Malicious participants alter their locally maintained data or model to publish an insidious update, to reduce the accuracy of the global model. Recent byzantine-robust (euclidean or cosine-similarity) based aggregation techniques, claim to protect against data poisoning attacks. On the other hand, model poisoning attacks are more insidious and adaptable to current defenses. Though different local model poisoning attacks are proposed to attack euclidean based defenses, we could not find any work to investigate cosine-similarity based defenses. We examine such defenses (FLTrust and FoolsGold) and find their underlying issues. We also demonstrate an efficient layer replacement attack that is adaptable to FLTrust, impacting to lower the accuracy up to 10%. Further, we propose a cosine-similarity based local model poisoning attack (CSA) on FLTrust and FoolsGold, which generates diverse and poisonous client updates. The later attack maintains a high trust score and a high averaged weighted score for respective defenses. Experiments are carried out on different datasets, with varying attack capabilities and settings, to study the effectiveness of the proposed attack. The results show that the test loss is increased by 10 - 20×.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129582416","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}
Md. Sabbir Hossain, Nishat Nayla, Annajiat Alim Rasel
{"title":"Product Market Demand Analysis Using NLP in Banglish Text with Sentiment Analysis and Named Entity Recognition","authors":"Md. Sabbir Hossain, Nishat Nayla, Annajiat Alim Rasel","doi":"10.48550/arXiv.2204.01827","DOIUrl":"https://doi.org/10.48550/arXiv.2204.01827","url":null,"abstract":"Product market demand analysis plays a significant role for originating business strategies due to its noticeable impact on the competitive business field. Furthermore, there are roughly 228 million native Bengali speakers, the majority of whom use Banglish text to interact with one another on social media. Consumers are buying and evaluating items on social media with Banglish text as social media emerges as an online marketplace for entrepreneurs. People use social media to find preferred smartphone brands and models by sharing their positive and bad experiences with them. For this reason, our goal is to gather Banglish text data and use sentiment analysis and named entity identification to assess Bangladeshi market demand for smartphones in order to determine the most popular smartphones by gender. We scraped product related data from social media with instant data scrapers and crawled data from Wikipedia and other sites for product information with python web scrapers. Using Python's Pandas and Seaborn libraries, the raw data is filtered using NLP methods. To train our datasets for named entity recognition, we utilized Spacey's custom NER model, Amazon Comprehend Custom NER. A tensorflow sequential model was deployed with parameter tweaking for sentiment analysis. Meanwhile, we used the Google Cloud Translation API to estimate the gender of the reviewers using the BanglaLinga library. In this article, we use natural language processing (NLP) approaches and several machine learning models to identify the most in-demand items and services in the Bangladeshi market. Our model has an accuracy of 87.99% in Spacy Custom Named Entity recognition, 95.51% in Amazon Comprehend Custom NER, and 87.02% in the Sequential model for demand analysis. After Spacy's study, we were able to manage 80% of mistakes related to misspelled words using a mix of Levenshtein distance and ratio algorithms.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122785392","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":"Fast Breadth-First Search Approximation for Epidemic Source Inference","authors":"Congduan Li, Siya Chen, C. Tan","doi":"10.1109/CISS53076.2022.9751156","DOIUrl":"https://doi.org/10.1109/CISS53076.2022.9751156","url":null,"abstract":"Detecting the epidemic source has applications to computational epidemiology of infectious diseases and rumor source detection in online social networks. The problem of epidemic source inference was first studied in the seminal work by Shah and Zaman using maximum likelihood (ML) estimation and solved optimally only for the case of degree-regular trees. In this paper, we study the problem for the general graph setting, which is challenging due to the combinatorial complexity and problem scale. As a first step, we study the ML estimator on almost degree-regular trees with a single irregular node. By demonstrating how the probability of spreading permutation affects the likelihood, we propose a fast Breadth-First Search algorithm and a greedy algorithm to approximate the solution for general irregular trees, and then extend the methods to cactus graphs. Our performance evaluation results demonstrate that the algorithms improve over prior heuristics in the literature and serve as a basis for designing data-driven health response analytics to combat the epidemic.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114510678","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}