{"title":"Stochastic Mean-Shift for Speaker Clustering","authors":"I. Lapidot","doi":"10.1109/CISS56502.2023.10089776","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089776","url":null,"abstract":"This work is a continuation of our previous work on short segments speaker clustering. We have shown that mean-shift clustering algorithm with probabilistic linear discriminant analysis (PLDA) score as the similarity measure, can be a good approach for this task. While the standard mean-shift clustering algorithm is a deterministic algorithm, in this work we suggest a stochastic version to train the mean-shift. The quality of the clustering is measured by the value K, which is a geometric mean of average cluster purity (ACP) and average speaker purity (ASP). We test the proposed algorithm in the range of 3 to 60 speakers and show that it outperforms the deterministic mean-shift in all cases.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"28 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":"127734083","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 Analysis of Model-Free Control and PID Control on a Class of Nonlinear MIMO Systems","authors":"James Cheng Peng, J. Spall","doi":"10.1109/CISS56502.2023.10089683","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089683","url":null,"abstract":"Modern dynamical systems are generally non-linear, which make traditional linear controllers infeasible in some cases. To cope with the need for controlling such modern systems, researchers have developed robust nonlinear controllers that leverage function approximators such as neural networks and polynomials. In this work, we investigate one successful nonlinear controller, the SPSA (si-multaneous perturbation stochastic approximation)-based model-free control. We shall make a rigorous performance analysis on a class of nonlinear MIMO systems. As a benchmark, we compare it with PID, one of the most-widely used control technique.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"67 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":"126938165","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":"Linearization of Non-Uniform Quantizers via Adaptive Non-Subtractive Dithering","authors":"Morriel Kasher, P. Spasojevic, M. Tinston","doi":"10.1109/CISS56502.2023.10089625","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089625","url":null,"abstract":"Non-subtractive dithering is an effective method to improve quantizer performance by injecting input noise that reduces statistical correlations between input signals and quantization error. Existing non-subtractive dither theory has primarily designed dither signal distributions for linear, uniform quantizers, neglecting real-world non-idealities including non-uniformity and finite-level saturation. We develop a generalized analytical condition to guarantee independence of the quantization error moments from the input signal for an arbitrary finite-level non-linear quantizer characteristic. We use this to propose a novel asymmetric, adaptive dither technique for effective linearization of non-uniform quantizers via reduction of the first conditional quantization error moment. These adaptive dither distributions are shown to completely eliminate the first error moment in Lloyd-Max quantizers and significantly reduce it in non-linear quantizers. This allows the use of time-averaging to converge to an arbitrarily precise signal estimate in non-uniform quantizers.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"88 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":"127019452","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":"Evaluating FFT performance of the C and Rust Languages on Raspberry Pi platforms","authors":"Michael P. Rooney, Suzanne J. Matthews","doi":"10.1109/CISS56502.2023.10089631","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089631","url":null,"abstract":"The Fast Fourier Transform (FFT) is perhaps the most consequential algorithm for real-time applications for digital signals processing. Given the increased importance of securing devices on the edge, memory safety becomes an increasing concern for FFT applications. This work compares the performance of four FFT implementations written in the C and the Rust languages, benchmarked on the Raspberry Pi 4 and the Raspberry Pi Zero W platforms. Our results suggest that FFTs implemented in Rust are up to 45% more energy efficient than those written in C, and that Rust FFT implementations execute up to 37% faster than corresponding FFTs implemented in C. These results suggest that real-time application designers should take a closer look at the Rust language to enhance the safety and performance of their FFT applications.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"27 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":"131761099","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}
Saloni Mahatma, Lisa Van den Broeck, Nicholas Morffy, M. Staller, L. Strader, Rosangela Sozzani
{"title":"Prediction and functional characterization of transcriptional activation domains","authors":"Saloni Mahatma, Lisa Van den Broeck, Nicholas Morffy, M. Staller, L. Strader, Rosangela Sozzani","doi":"10.1109/CISS56502.2023.10089768","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089768","url":null,"abstract":"Gene expression is induced by transcription factors (TFs) through their activation domains (ADs). However, ADs are unconserved, intrinsically disordered sequences without a secondary structure, making it challenging to recognize and predict these regions and limiting our ability to identify TFs. Here, we address this challenge by leveraging a neural network approach to systematically predict ADs. As input for our neural network, we used computed properties for amino acid (AA) side chain and secondary structure, rather than relying on the raw sequence. Moreover, to shed light on the features learned by our neural network and greatly increase interpretability, we computed the input properties most important for an accurate prediction. Our findings further highlight the importance of aromatic and negatively charged AA and reveal the importance of unknown AA properties. Taking advantage of these most important features, we used an unsupervised learning approach to classify the ADs into 10 subclasses, which can further be explored for AA specificity and AD functionality. Overall, our pipeline, relying on supervised and unsupervised machine learning, shed light on the non-linear properties of ADs.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"47 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":"133760474","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":"Boolean Factor Graph Modeling and Analysis of Gene Graphs: Budding Yeast Cell-Cycle","authors":"Stephen Kotiang, A. Eslami","doi":"10.1109/CISS56502.2023.10089697","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089697","url":null,"abstract":"The desire to understand genomic functions and the behavior of complex gene regulatory networks has recently been a major research focus in systems biology. As a result, a plethora of computational and modeling tools have been proposed to identify and infer interactions among biological entities. Here, we consider the general question of the effect of perturbation on the global dynamical network behavior as well as error propagation in biological networks to incite research pertaining to intervention strategies. This paper introduces a computational framework that combines the formulation of Boolean networks (BNs) and factor graphs to explore the global dynamical features of biological systems. A message-passing algorithm is proposed for this formalism to evolve network states as messages in the graph. The model is applied to assess the network state progression and the impact of gene deletion in the budding yeast cell cycle. Simulation results show that our model predictions match published experimental data.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"20 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":"131166154","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}
Khalid Mohammed Ali, Michele Saruwatari, Kochai Jawed, Yoseph Kim, Seihoon Park, Seongjun Cha, Bo Ning, R. J. Cha
{"title":"Artificial Intelligence-Assisted Laparoscopic Cholecystectomy in a Preclinical Swine Model","authors":"Khalid Mohammed Ali, Michele Saruwatari, Kochai Jawed, Yoseph Kim, Seihoon Park, Seongjun Cha, Bo Ning, R. J. Cha","doi":"10.1109/CISS56502.2023.10089690","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089690","url":null,"abstract":"Iatrogenic bile duct injury during laparoscopic cholecystectomy has an incidence rate of 1-2%. The small size of the duct, multiple anatomical variations, and inflammatory conditions make it challenging for the surgeon to identify or protect it during dissection. Despite the difficulties and rising concerns about identifying the bile duct during surgeries, surgeons do not have a specific modality to identify the bile duct except intraoperative cholangiography, which disrupts workflows. Here, we present our new study on laparoscopic cholecystectomy using a quasi-real-time artificial intelligence-assisted biliary-specific fluorescence imaging in a swine model in vivo.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"69 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":"116022191","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":"Optimal Decision Making with Rational Inattention Using Noisy Data","authors":"Yuan Zhao, A. Abdi, M. Dean, A. Abdi","doi":"10.1109/CISS56502.2023.10089696","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089696","url":null,"abstract":"Rational inattention of decision makers to costly data and information and resources affects their optimal decision making strategies. The theory of rational inattention has found applications in several areas such as economics, finance and psychology. In this paper, we study scenarios where the available data is noisy. The noise may have been generated because of inaccuracies or errors in data collection methods, or the data may have been intentionally distorted to protect private or secret information. Here we introduce a formulation for rationally inattentive decision making when the data is noisy, and derive its optimal decision making strategy. Using a stock trading problem as an example, we demonstrate that as the noise level in the data increases, probability of correct decision decreases. This results in less payoff for the decision maker, when using noisy data. We also show how the noise level and information cost parameters can be estimated using the developed formulation. The results are useful for developing decision making strategies, when using noisy data.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"144 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":"116443591","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":"Forward and Backward Private Dynamic Searchable Encryption with Better Space Efficiency","authors":"Yexuan Liu, Yohei Watanabe, Junji Shikata","doi":"10.1109/CISS56502.2023.10089760","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089760","url":null,"abstract":"Dynamic searchable symmetric encryption (SSE) provides efficient update and search operations over encrypted data, while it leaks some inconsequential information to increase search efficiency. Since the more dynamic SSE allows leakage, the easier it is to break its security, it is important to realize efficient schemes with less leakages. For that reason, most recent works on dynamic SSE focus on forward and backward privacy, which are important security notions for dynamic SSE. In particular, Sun et al. (NDSS 2021) recently proposed Aura, an efficient dynamic SSE scheme with forward and backward privacy. Although Aura provides good update and search efficiency, it requires large encrypted database. Taking into account the practical use of dynamic SSE, i.e., search systems that many users involve, the sizes of encrypted databases should be small enough. In this paper, based on Aura, we propose a new dynamic SSE scheme with forward and backward privacy, called Aura +; it provides not only efficient update and search operations but also smaller encrypted database than Aura, though Aura+ requires a few more interactions than Aura.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"167 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":"128277220","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":"The ε-Effective Capacity for Statistical Delay and Error-Rate Bounded QoS Provisioning Over 6G CF M-MIMO Wireless Networks Using HARQ-IR","authors":"Xi Zhang, Jingqing Wang, H. Poor","doi":"10.1109/CISS56502.2023.10089782","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089782","url":null,"abstract":"Significant effort has been devoted to the problem of guaranteeing stringent ultra-reliable and low-latency communications (URLLC) while introducing new requirements for better quality-of-services (QoS) over next generation wireless networks. One of the major design issues raised by URLLC is how to support explosively growing demands for delay-sensitive multimedia applications while guaranteeing ultra-reliability. Towards this end, there have been a wide spectrum of promising techniques, including statistical delay and error rate-bounded QoS provisioning, cell-free (CF) massive multiple-input-multiple-output (m-MIMO), finite blocklength coding (FBC), hybrid automatic repeat request with incremental redundancy (HARQ-IR) protocol, etc. However, when being integrated with FBC, how to rigorously and efficiently characterize the dynamics of mobile wireless networks in terms of statistical delay and error-rate bounded QoS provisioning for CF m-MIMO has imposed many new challenges not encountered before. To overcome these challenges, in this paper we develop statistical delay and error-rate bounded QoS analytical modeling schemes to characterize the FBC-based $epsilon$-effective capacity over 6G CF m-MIMO wireless networks using HARQ-IR. In particular, first we establish CF m-MIMO based system architecture models. Second, we apply a HARQ-IR protocol for deriving the channel coding rate, outage probability, and FBC based $epsilon$-effective capacity function using the Mellin transform. Finally, we conduct a set of simulations to validate and evaluate our proposed schemes.","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":"125945504","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}