{"title":"Distributed Detection in EH-Powered Mobile WSNs: Adaptive Transmission over Temporally Correlated MIMO Channels with Limited Feedback","authors":"Ghazaleh Ardeshiri, A. Vosoughi","doi":"10.1109/CISS56502.2023.10089747","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089747","url":null,"abstract":"We address distributed detection problem in a mobile wireless sensor network, where each deployed sensor stores randomly arriving energy units in a finite-size battery. Sensors transmit their symbols simultaneously to a mobile fusion center (FC) with $M > 1$ antennas, over temporally correlated fading channels. To characterize the time variation of the fading channel, we adopt a Markovian model and assume that the fading channel time-correlation is defined by the Jakes-Clark's correlation function. We consider limited feedback of channel gain, defined as the Frobenius norm of MIMO channel matrix, at a fixed feedback frequency from the FC to sensors. Modeling the randomly arriving energy units during a time slot as a Poisson process, and the quantized channel gain and the battery dynamics as homogeneous finite-state Markov chains, we propose an adaptive transmission scheme such that the $J$-divergence based detection metric is maximized at the FC, subject to an average per-sensor transmit power constraint. The proposed scheme is parameterized in terms of the scale factors (our optimization variables) corresponding to the channel gain quantization intervals. This scheme allows each sensor to adapt its transmit power in each time slot, based on its current battery state and the latest available channel gain feedback.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130313220","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}
Niharika Deshpande, Hyoshin Park, Venktesh Pandey, Gyugeun Yoon
{"title":"Advancing Temporal Multimodal Learning with Physics Informed Regularization","authors":"Niharika Deshpande, Hyoshin Park, Venktesh Pandey, Gyugeun Yoon","doi":"10.1109/CISS56502.2023.10089632","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089632","url":null,"abstract":"Estimating multimodal distributions of travel times from real-world data is critical for understanding and managing congestion. Mixture models can estimate the overall distribution when distinct peaks exist in the probability density function, but no transfer of mixture information under epistemic uncertainty across different spatiotemporal scales has been considered for capturing unobserved heterogeneity. In this paper, a physics-informed and -regularized prediction model is developed that shares observations across similarly distributed network segments across time and space. By grouping similar mixture models, the model uses a particular sample distribution at distant non-contiguous unexplored locations and improves TT prediction. Compared to traditional prediction without those updates, the proposed model's 19% of performance show the benefit of indirect learning. Different from traditional travel time prediction tools, the developed model can be used by traffic and planning agencies in knowing how far back in history and what sample size of historic data would be useful for current prediction.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"09 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127374852","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}
Victoria Subritzky-Katz, Aaron L. Sampson, Erik E. Emeric, W. Lipski, Sophia Moreira-González, Jorge González-Martínez, S. Sarma, V. Stuphorn, E. Niebur
{"title":"Quantifying Phase- Amplitude Modulation in Neural Data","authors":"Victoria Subritzky-Katz, Aaron L. Sampson, Erik E. Emeric, W. Lipski, Sophia Moreira-González, Jorge González-Martínez, S. Sarma, V. Stuphorn, E. Niebur","doi":"10.1109/CISS56502.2023.10089691","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089691","url":null,"abstract":"Phase-amplitude modulation (the modulation of the amplitude of higher frequency oscillations by the phase of lower frequency oscillations) is a specific type of cross-frequency coupling that has been observed in neural recordings from multiple species in a range of behavioral contexts. Given its potential importance, care must be taken with how it is measured and quantified. Previous studies have quantified phase-amplitude modulation by measuring the distance of the amplitude distribution from a uniform distribution. While this method is of general applicability, it is not targeted to the specific modulation pattern frequently observed with low-frequency oscillations. Here we develop a new method that has increased specificity to detect modulation in the sinusoidal shape commonly observed in neural data.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125959426","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}
R. Precup, Raul-Cristian Roman, Elena-Lorena Hedrea, E. Petriu, C. Dragos, Alexandra-Iulia Szedlak-Stînean
{"title":"Slime Mold Algorithm-Based Performance Improvement of PD-Type Indirect Iterative Learning Fuzzy Control of Tower Crane Systems","authors":"R. Precup, Raul-Cristian Roman, Elena-Lorena Hedrea, E. Petriu, C. Dragos, Alexandra-Iulia Szedlak-Stînean","doi":"10.1109/CISS56502.2023.10089708","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089708","url":null,"abstract":"This current paper proposes to improve the performance of three Single Input-Single Output (SISO) fuzzy control systems of controlling every position of tower crane systems using Proportional-Derivative (PD)-type indirect iterative learning rules at the higher hierarchical levels in each SISO control loop. The lower hierarchical levels in the three SISO control loops are built upon three low-cost Takagi-Sugeno Proportional-Integral (PI)-fuzzy controllers tuned by the initial application of Extended Symmetrical Optimum (ESO) method to the linear PI controllers and next the transfer of the results to the PI-fuzzy controllers in terms of the modal equivalence principle. Set-point filters are included at the lower hierarchical level in the context of the ESO method for overshoot reduction. The design approach is presented in a unified way for all three controllers. The gains of the PD-type learning rules are optimally computed in the iteration domain considering a metaheuristic Slime Mold Algorithm (SMA) in a transparent and simplified version, that settles the optimization problems with objective functions expressed as the sums of squared control errors multiplied by time. The enhanced performance is settled considering ten sets of iterations of SMA.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133197824","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":"An Accelerated Asynchronous Distributed Method for Convex Constrained Optimization Problems","authors":"Nazanin Abolfazli, A. Jalilzadeh, E. Y. Hamedani","doi":"10.1109/CISS56502.2023.10089633","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089633","url":null,"abstract":"We consider a class of multi-agent cooperative consensus optimization problems with local nonlinear convex constraints where only those agents connected by an edge can directly communicate, hence, the optimal consensus decision lies in the intersection of these private sets. We develop an asynchronous distributed accelerated primal-dual algorithm to solve the considered problem. The proposed scheme is the first asynchronous method with an optimal convergence guarantee for this class of problems, to the best of our knowledge. In particular, we provide an optimal convergence rate of $mathcal{O}(1/K)$ for suboptimality, infeasibility, and consensus violation.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131191487","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":"Federated Learning via Indirect Server-Client Communications","authors":"Jieming Bian, Cong Shen, Jie Xu","doi":"10.1109/CISS56502.2023.10089783","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089783","url":null,"abstract":"Federated Learning (FL) is a communication-efficient and privacy-preserving distributed machine learning framework that has gained a significant amount of research attention recently. Despite the different forms of FL algorithms (e.g., synchronous FL, asynchronous FL) and the underlying optimization methods, nearly all existing works implicitly assumed the existence of a communication infrastructure that facilitates the direct communication between the server and the clients for the model data exchange. This assumption, however, does not hold in many real-world applications that can benefit from distributed learning but lack a proper communication infrastructure (e.g., smart sensing in remote areas). In this paper, we propose a novel FL framework, named FedEx (short for FL via Model Express Delivery), that utilizes mobile transporters (e.g., Unmanned Aerial Vehicles) to establish indirect communication channels between the server and the clients. Two algorithms, called FedEx-Sync and FedEx-Async, are developed depending on whether the transporters adopt a synchronized or an asynchronized schedule. Even though the indirect communications introduce heterogeneous delays to clients for both the global model dissemination and the local model collection, we prove the convergence of both versions of FedEx. The convergence analysis subsequently sheds lights on how to assign clients to different transporters and design the routes among the clients. The performance of FedEx is evaluated through experiments in a simulated network on two public datasets.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132380273","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":"Piecewise Linear and Stochastic Models for the Analysis of Cyber Resilience","authors":"Michael J. Weisman, A. Kott, J. Vandekerckhove","doi":"10.1109/CISS56502.2023.10089725","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089725","url":null,"abstract":"We model a vehicle equipped with an autonomous cyber-defense system in addition to its inherent physical resilience features. When attacked, this ensemble of cyber-physical features (i.e., “bonware”) strives to resist and recover from the performance degradation caused by the malware's attack. We model the underlying differential equations governing such attacks for piecewise linear characterizations of malware and bonware, develop a discrete time stochastic model, and show that averages of instantiations of the stochastic model approximate solutions to the continuous differential equation. We develop a theory and methodology for approximating the parameters associated with these equations.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126351989","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}
Hossein Rajoli, Fatemeh Lotfi, A. Atyabi, F. Afghah
{"title":"Triplet Loss-less Center Loss Sampling Strategies in Facial Expression Recognition Scenarios","authors":"Hossein Rajoli, Fatemeh Lotfi, A. Atyabi, F. Afghah","doi":"10.1109/CISS56502.2023.10089734","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089734","url":null,"abstract":"Facial expressions convey massive information and play a crucial role in emotional expression. Deep neural network (DNN) accompanied by deep metric learning (DML) techniques boost the discriminative ability of the model in facial expression recognition (FER) applications. DNN, equipped with only classification loss functions such as Cross-Entropy cannot compact intra-class feature variation or separate inter-class feature distance as well as when it gets fortified by a DML supporting loss item. The triplet center loss (TCL) function is applied on all dimensions of the sample's embedding in the embedding space. In our work, we developed three strategies: fully-synthesized, semi-synthesized, and prediction-based negative sample selection strategies. To achieve better results, we introduce a selective attention module that provides a combination of pixel-wise and element-wise attention coefficients using high-semantic deep features of input samples. We evaluated the proposed method on the RAF-DB, a highly imbalanced dataset. The experimental results reveal significant improvements in comparison to the baseline for all three negative sample selection strategies.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128021829","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":"Human-machine Hierarchical Networks for Decision Making under Byzantine Attacks","authors":"Chen Quan, Baocheng Geng, Y. Han, P. Varshney","doi":"10.1109/CISS56502.2023.10089766","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089766","url":null,"abstract":"This paper proposes a belief-updating scheme in a human-machine collaborative decision-making network to com-bat Byzantine attacks. A hierarchical framework is used to realize the network where local decisions from physical sensors act as reference decisions to improve the quality of human sensor decisions. During the decision-making process, the belief that each physical sensor is malicious is updated. The case when humans have side information available is investigated, and its impact is analyzed. Simulation results substantiate that the proposed scheme can significantly improve the quality of human sensor decisions, even when most physical sensors are malicious. Moreover, the performance of the proposed method does not necessarily depend on the knowledge of the actual fraction of malicious physical sensors. Consequently, the proposed scheme can effectively defend against Byzantine attacks and improve the quality of human sensors' decisions so that the performance of the human-machine collaborative system is enhanced.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127275339","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 Segmentation for Storage Efficient Private Federated Learning with Top $r$ Sparsification","authors":"Sajani Vithana, S. Ulukus","doi":"10.1109/CISS56502.2023.10089698","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089698","url":null,"abstract":"In federated learning (FL) with top $r$ sparsification, millions of users collectively train a machine learning (ML) model locally, using their personal data by only communicating the most significant $r$ fraction of updates to reduce the communication cost. It has been shown that the values as well as the indices of these selected (sparse) updates leak information about the users' personal data. In this work, we investigate different methods to carry out user-database communications in FL with top $r$ sparsification efficiently, while guaranteeing information theoretic privacy of users' personal data. These methods incur considerable storage cost. As a solution, we present two schemes with different properties that use MDS coded storage along with a model segmentation mechanism to reduce the storage cost at the expense of a controllable amount of information leakage, to perform private FL with top $r$ sparsification.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132698773","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}