Department of Computer Science Works

Permanent URI for this collection

https://hdl.handle.net/1805/41296

Browse

Now showing 1 - 10 of 176

A framework for graph-base neural network using numerical simulation of metal powder bed fusion for correlating process parameters and defect generation
(Elsevier, 2022) Akter Jahan, Suchana; Al Hasan, Mohammad; El-Mounayri, Hazim; Mechanical and Energy Engineering, School of Engineering and Technology
Powder bed fusion (PBF) is the most common technique used for metal additive manufacturing. This process involves consolidation of metal powder using a heat source such as laser or electron beam. During the formation of three-dimensional(3D) objects by sintering metal powders layer by layer, many different thermal phenomena occur that can create defects or anomalies on the final printed part. Similar to other additive manufacturing techniques, PBF has been in practice for decades, yet it is still going through research and development endeavors which is required to understand the physics behind this process. Defects and deformations highly impact the product quality and reliability of the overall manufacturing process; hence, it is essential that we understand the reason and mechanism of defect generation in PBF process and take appropriate measures to rectify them. In this paper, we have attempted to study the effect of processing parameters (scanning speed, laser power) on the generation of defects in PBF process using a graph-based artificial neural network that uses numerical simulation results as input or training data. Use of graph-based machine learning is novel in the area of manufacturing let alone additive manufacturing or powder bed fusion. The outcome of this study provides an opportunity to design a feedback controlled in-situ online monitoring system in powder bed fusion to reduce printing defects and optimize the manufacturing process.
Informative Causality Extraction from Medical Literature via Dependency-Tree-Based Patterns
(Springer, 2022-05-25) Kabir, M. Ahsanul; Almulhim, AlJohara; Luo, Xiao; Al Hasan, Mohammad; Computer and Information Science, School of Science
Extracting cause-effect entities from medical literature is an important task in medical information retrieval. A solution for solving this task can be used for compilation of various causality relations, such as causality between disease and symptoms, between medications and side effects, and between genes and diseases. Existing solutions for extracting cause-effect entities work well for sentences where the cause and the effect phrases are name entities, single-word nouns, or noun phrases consisting of two to three words. Unfortunately, in medical literature, cause and effect phrases in a sentence are not simply nouns or noun phrases, rather they are complex phrases consisting of several words, and existing methods fail to correctly extract the cause and effect entities in such sentences. Partial extraction of cause and effect entities conveys poor quality, non-informative, and often, contradictory facts, comparing to the one intended in the given sentence. In this work, we solve this problem by designing an unsupervised method for cause and effect phrase extraction, patterncausality, which is specifically suitable for the medical literature. Our proposed approach first uses a collection of cause-effect dependency patterns as template to extract head words of cause and effect phrases and then it uses a novel phrase extraction method to obtain complete and meaningful cause and effect phrases from a sentence. Experiments on a cause-effect dataset built from sentences from PubMed articles show that for extracting cause and effect entities, patterncausality is substantially better than the existing methods—with an order of magnitude improvement in the F-score metric over the best of the existing methods. We also build different variants of patterncausality, which use different phrase extraction methods; all variants are better than the existing methods. patterncausality and its variants also show modest performance improvement over the existing methods for extracting cause and effect entities in a domain-neutral benchmark dataset, in which cause and effect entities are nouns or noun phrases consisting of one to two words.
Time-to-event modeling of subreddits transitions to r/SuicideWatch
(IEEE, 2022) Liu, Xueying; Fang, Shiaofen; Mohler, George; Carlson, Joan; Xiao, Yunyu; Computer and Information Science, School of Science
Recent data mining research has focused on the analysis of social media text, content and networks to identify suicide ideation online. However, there has been limited research on the temporal dynamics of users and suicide ideation. In this work, we use time-to-event modeling to identify which subreddits have a higher association with users transitioning to posting on r/suicidewatch. For this purpose we use a Cox proportional hazards model that takes as input text and subreddit network features and outputs a probability distribution for the time until a Reddit user posts on r/suicidewatch. In our analysis we find a number of statistically significant features that predict earlier transitions to r/suicidewatch. While some patterns match existing intuition, for example r/depression is positively associated with posting sooner on r/suicidewatch, others were more surprising (for example, the average time between a high risk post on r/Wishlist and a post on r/suicidewatch is 10.2 days). We then discuss these results as well as directions for future research.
A Large Open Access Dataset of Brain Metastasis 3D Segmentations with Clinical and Imaging Feature Information
(Springer Nature, 2024-02-29) Ramakrishnan, Divya; Jekel, Leon; Chadha, Saahil; Janas, Anastasia; Moy, Harrison; Maleki, Nazanin; Sala, Matthew; Kaur, Manpreet; Cassinelli Petersen, Gabriel; Merkaj, Sara; von Reppert, Marc; Baid, Ujjwal; Bakas, Spyridon; Kirsch, Claudia; Davis, Melissa; Bousabarah, Khaled; Holler, Wolfgang; Lin, MingDe; Westerhoff, Malte; Aneja, Sanjay; Memon, Fatima; Aboian, Mariam S.; Pathology and Laboratory Medicine, School of Medicine
Resection and whole brain radiotherapy (WBRT) are standard treatments for brain metastases (BM) but are associated with cognitive side effects. Stereotactic radiosurgery (SRS) uses a targeted approach with less side effects than WBRT. SRS requires precise identification and delineation of BM. While artificial intelligence (AI) algorithms have been developed for this, their clinical adoption is limited due to poor model performance in the clinical setting. The limitations of algorithms are often due to the quality of datasets used for training the AI network. The purpose of this study was to create a large, heterogenous, annotated BM dataset for training and validation of AI models. We present a BM dataset of 200 patients with pretreatment T1, T1 post-contrast, T2, and FLAIR MR images. The dataset includes contrast-enhancing and necrotic 3D segmentations on T1 post-contrast and peritumoral edema 3D segmentations on FLAIR. Our dataset contains 975 contrast-enhancing lesions, many of which are sub centimeter, along with clinical and imaging information. We used a streamlined approach to database-building through a PACS-integrated segmentation workflow.
The Brain Tumor Segmentation (BraTS-METS) Challenge 2023: Brain Metastasis Segmentation on Pre-treatment MRI
(ArXiv, 2023-06-01) Moawad, Ahmed W.; Janas, Anastasia; Baid, Ujjwal; Ramakrishnan, Divya; Jekel, Leon; Krantchev, Kiril; Moy, Harrison; Saluja, Rachit; Osenberg, Klara; Wilms, Klara; Kaur, Manpreet; Avesta, Arman; Cassinelli Pedersen, Gabriel; Maleki, Nazanin; Salimi, Mahdi; Merkaj, Sarah; von Reppert, Marc; Tillmans, Niklas; Lost, Jan; Bousabarah, Khaled; Holler, Wolfgang; Lin, MingDe; Westerhoff, Malte; Maresca, Ryan; Link, Katherine E.; Tahon, Nourel Hoda; Marcus, Daniel; Sotiras, Aristeidis; LaMontagne, Pamela; Chakrabarty, Strajit; Teytelboym, Oleg; Youssef, Ayda; Nada, Ayaman; Velichko, Yuri S.; Gennaro, Nicolo; Connectome Students; Group of Annotators; Cramer, Justin; Johnson, Derek R.; Kwan, Benjamin Y. M.; Petrovic, Boyan; Patro, Satya N.; Wu, Lei; So, Tiffany; Thompson, Gerry; Kam, Anthony; Guzman Perez-Carrillo, Gloria; Lall, Neil; Group of Approvers; Albrecht, Jake; Anazodo, Udunna; Lingaru, Marius George; Menze, Bjoern H.; Wiestler, Benedikt; Adewole, Maruf; Anwar, Syed Muhammad; Labella, Dominic; Li, Hongwei Bran; Iglesias, Juan Eugenio; Farahani, Keyvan; Eddy, James; Bergquist, Timothy; Chung, Verena; Shinohara, Russel Takeshi; Dako, Farouk; Wiggins, Walter; Reitman, Zachary; Wang, Chunhao; Liu, Xinyang; Jiang, Zhifan; Van Leemput, Koen; Piraud, Marie; Ezhov, Ivan; Johanson, Elaine; Meier, Zeke; Familiar, Ariana; Kazerooni, Anahita Fathi; Kofler, Florian; Calabrese, Evan; Aneja, Sanjay; Chiang, Veronica; Ikuta, Ichiro; Shafique, Umber; Memon, Fatima; Conte, Gian Marco; Bakas, Spyridon; Rudie, Jeffrey; Aboian, Mariam; Radiology and Imaging Sciences, School of Medicine
Clinical monitoring of metastatic disease to the brain can be a laborious and timeconsuming process, especially in cases involving multiple metastases when the assessment is performed manually. The Response Assessment in Neuro-Oncology Brain Metastases (RANO-BM) guideline, which utilizes the unidimensional longest diameter, is commonly used in clinical and research settings to evaluate response to therapy in patients with brain metastases. However, accurate volumetric assessment of the lesion and surrounding peri-lesional edema holds significant importance in clinical decision-making and can greatly enhance outcome prediction. The unique challenge in performing segmentations of brain metastases lies in their common occurrence as small lesions. Detection and segmentation of lesions that are smaller than 10 mm in size has not demonstrated high accuracy in prior publications. The brain metastases challenge sets itself apart from previously conducted MICCAI challenges on glioma segmentation due to the significant variability in lesion size. Unlike gliomas, which tend to be larger on presentation scans, brain metastases exhibit a wide range of sizes and tend to include small lesions. We hope that the BraTS-METS dataset and challenge will advance the field of automated brain metastasis detection and segmentation.
Strategic signaling for utility control in audit games
(Elsevier, 2022-07) Chen, Jianan; Hu, Qin; Jiang, Honglu; Computer and Information Science, School of Science
As an effective method to protect the daily access to sensitive data against malicious attacks, the audit mechanism has been widely deployed in various practical fields. In order to examine security vulnerabilities and prevent the leakage of sensitive data in a timely manner, the database logging system usually employs an online signaling scheme to issue an alert when suspicious access is detected. Defenders can audit alerts to reduce potential damage. This interaction process between a defender and an attacker can be modeled as an audit game. In previous studies, it was found that sending real-time signals in the audit game to warn visitors can improve the benefits of the defender. However, the previous approaches usually assume perfect information of the attacker, or simply concentrate on the utility of the defender. In this paper, we introduce a brand-new zero-determinant (ZD) strategy to study the sequential audit game with online signaling, which empowers the defender to unilaterally control the utility of visitors when accessing sensitive data. In addition, an optimization scheme based on the ZD strategy is designed to effectively maximize the utility difference between the defender and the attacker. Extensive simulation results show that our proposed scheme enhances the security management and control capabilities of the defender to better handle different access requests and safeguard the system security in a cost-efficient manner.
Solving the Federated Edge Learning Participation Dilemma: A Truthful and Correlated Perspective
(IEEE, 2022-07) Hu, Qin; Li, Feng; Zou, Xukai; Xiao, Yinhao; Computer and Information Science, School of Science
An emerging computational paradigm, named federated edge learning (FEL), enables intelligent computing at the network edge with the feature of preserving data privacy for edge devices. Given their constrained resources, it becomes a great challenge to achieve high execution performance for FEL. Most of the state-of-the-arts concentrate on enhancing FEL from the perspective of system operation procedures, taking few precautions during the composition step of the FEL system. Though a few recent studies recognize the importance of FEL formation and propose server-centric device selection schemes, the impact of data sizes is largely overlooked. In this paper, we take advantage of game theory to depict the decision dilemma among edge devices regarding whether to participate in FEL or not given their heterogeneous sizes of local datasets. For realizing both the individual and global optimization, the server is employed to solve the participation dilemma, which requires accurate information collection for devices’ local datasets. Hence, we utilize mechanism design to enable truthful information solicitation. With the help of correlated equilibrium , we derive a decision making strategy for devices from the global perspective, which can achieve the long-term stability and efficacy of FEL. For scalability consideration, we optimize the computational complexity of the basic solution to the polynomial level. Lastly, extensive experiments based on both real and synthetic data are conducted to evaluate our proposed mechanisms, with experimental results demonstrating the performance advantages.
Social Welfare Maximization in Cross-Silo Federated Learning
(IEEE, 2022-05-23) Chen, Jianan; Hu, Qin; Jiang, Honglu; Computer and Information Science, School of Science
As one of the typical settings of Federated Learning (FL), cross-silo FL allows organizations to jointly train an optimal Machine Learning (ML) model. In this case, some organizations may try to obtain the global model without contributing their local training, lowering the social welfare. In this paper, we model the interactions among organizations in cross-silo FL as a public goods game for the first time and theoretically prove that there exists a social dilemma where the maximum social welfare is not achieved in Nash equilibrium. To over-come this social dilemma, we employ the Multi-player Multi-action Zero-Determinant (MMZD) strategy to maximize the social welfare. With the help of the MMZD, an individual organization can unilaterally control the social welfare without extra cost. Experimental results validate that the MMZD strategy is effective in maximizing the social welfare.
Robust Node Classification on Graphs: Jointly from Bayesian Label Transition and Topology-based Label Propagation
(ACM, 2022-10-17) Zhuang, Jun; Al Hasan, Mohammad; Computer and Information Science, School of Science
Node classification using Graph Neural Networks (GNNs) has been widely applied in various real-world scenarios. However, in recent years, compelling evidence emerges that the performance of GNN-based node classification may deteriorate substantially by topological perturbation, such as random connections or adversarial attacks. Various solutions, such as topological denoising methods and mechanism design methods, have been proposed to develop robust GNN-based node classifiers but none of these works can fully address the problems related to topological perturbations. Recently, the Bayesian label transition model is proposed to tackle this issue but its slow convergence may lead to inferior performance. In this work, we propose a new label inference model, namely LInDT, which integrates both Bayesian label transition and topology-based label propagation for improving the robustness of GNNs against topological perturbations. LInDT is superior to existing label transition methods as it improves the label prediction of uncertain nodes by utilizing neighborhood-based label propagation leading to better convergence of label inference. Besides, LIndT adopts asymmetric Dirichlet distribution as a prior, which also helps it to improve label inference. Extensive experiments on five graph datasets demonstrate the superiority of LInDT for GNN-based node classification under three scenarios of topological perturbations.
zk-PCN: A Privacy-Preserving Payment Channel Network Using zk-SNARKs
(IEEE, 2022-11) Yu, Wenxuan; Xu, Minghui; Yu, Dongxiao; Cheng, Xiuzhen; Hu, Qin; Xiong, Zehui; Computer and Information Science, School of Science
Payment channel network (PCN) is a layer-two scaling solution that enables fast off-chain transactions but does not involve on-chain transaction settlement. PCNs raise new privacy issues including balance secrecy, relationship anonymity and payment privacy. Moreover, protecting privacy causes low transaction success rates. To address this dilemma, we propose zk-PCN, a privacy-preserving payment channel network using zk-SNARKs. We prevent from exposing true balances by setting up public balances instead. Using public balances, zk-PCN can guarantee high transaction success rates and protect PCN privacy with zero-knowledge proofs. Additionally, zk-PCN is compatible with the existing routing algorithms of PCNs. To support such compatibility, we propose zk-IPCN to improve zk-PCN with a novel proof generation (RPG) algorithm. zk-IPCN reduces the overheads of storing channel information and lowers the frequency of generating zero-knowledge proofs. Finally, extensive simulations demonstrate the effectiveness and efficiency of zk-PCN in various settings.

Browse

Recent Submissions