检索结果-内蒙古大学图书馆

An Approach to Detect Abnormal Submissions for CodeWorkout Dataset

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hicks, Alex Shi, Yang Arun-Balajiee Yan, Wei Marwan, Samiha Dept of Computer Science Virginia Tech BlacksburgVA United States Dept of Computer Science Utah State University LoganUT United States Lekshmi-Narayanan Intelligent Systems Program University of Pittsburgh PittsburghPA United States School of Informatics Computing and Cyber Systems North Arizona University FlagstaffAZ United States Dept. of Computer Science University of Virginia CharlottesvilleVA United States

Students’ interactions while solving problems in learning environments (i.e. log data) are often used to support students’ learning. For example, researchers use log data to develop systems that can provide students with personalized problem recommendations based on their knowledge level. However, anomalies in the students’ log data, such as cheating to solve programming problems, could introduce a hidden bias in the log data. As a result, these systems may provide inaccurate problem recommendations, and therefore, defeat their purpose. Classical cheating detection methods, such as MOSS, can be used to detect code plagiarism. However, these methods cannot detect other abnormal events such as a student gaming a system with multiple attempts of similar solutions to a particular programming problem. This paper presents a preliminary study to analyze log data with anomalies. The goal of our work is to overcome the abnormal instances when modeling personalizable recommendations in programming learning environments. © 2024, CC BY-NC-SA.

关键词： Students

Towards Safe AI Clinicians: A Comprehensive Study on Large Language Model Jailbreaking in Healthcare

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Hang Lou, Qian Wang, Yanshan Intelligent Systems Program School of Computing and Information University of Pittsburgh PA United States Department of Computer Science University of Central Florida OrlandoFL United States Department of Health Information Management University of Pittsburgh PA United States Department of Biomedical Informatics University of Pittsburgh PA United States Clinical and Translational Science Institute University of Pittsburgh PittsburghPA United States University of Pittsburgh Medical Center PittsburghPA United States

Large language models (LLMs) are increasingly utilized in healthcare applications. However, their deployment in clinical practice raises significant safety concerns, including the potential spread of harmful information. This study systematically assesses the vulnerabilities of seven LLMs to three advanced black-box jailbreaking techniques within medical contexts. To quantify the effectiveness of these techniques, we propose an automated and domain-adapted agentic evaluation pipeline. Experiment results indicate that leading commercial and open-source LLMs are highly vulnerable to medical jailbreaking attacks. To bolster model safety and reliability, we further investigate the effectiveness of Continual Fine-Tuning (CFT) in defending against medical adversarial attacks. Our findings underscore the necessity for evolving attack methods evaluation, domain-specific safety alignment, and LLM safety-utility balancing. This research offers actionable insights for advancing the safety and reliability of AI clinicians, contributing to ethical and effective AI deployment in healthcare. © 2025, CC BY-NC-SA.

关键词： Patient treatment

Modular boundaries in recurrent neural networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Tanner, Jacob C. Mansour, Sina L. Coletta, Ludovico Gozzi, Alessandro Betzel, Richard F. Cognitive Science Program 2 School of Informatics Computing and Engineering Indiana University BloomingtonIN47405 United States National University of Singapore Singapore Fondazione Bruno Kessler Trento Italy Functional Neuroimaging Lab Istituto Italiano di Tecnologia Center for Neuroscience and Cognitive Systems Rovereto Italy Department of Psychological and Brain Sciences Indiana University BloomingtonIN47405 United States

Recent theoretical and experimental work in neuroscience has focused on the representational and dynamical character of neural manifolds –subspaces in neural activity space wherein many neurons coactivate. Importantly, neural populations studied under this "neural manifold hypothesis" are continuous and not cleanly divided into separate neural populations. This perspective clashes with the "modular hypothesis" of brain organization, wherein neural elements maintain an "all- or-nothing" affiliation with modules. In line with this modular hypothesis, recent research on recurrent neural networks suggests that multi-task networks become modular across training, such that different modules specialize for task-general dynamical motifs [1, 2]. If the modular hypothesis is true, then it would be important to use a dimensionality reduction technique that captures modular structure. Here, we investigate the features of such a method. We leverage RNNs as a model system to study the character of modular neural populations, using a community detection method from network science known as modularity maximization to partition neurons into distinct modules. These partitions allow us to ask the following question: do these modular boundaries matter to the system? We find evidence that they do. First, we find that these boundaries neatly divide the representational content and role of neurons. Next, we find that these boundaries can be directly inferred from features of the weight matrix in feed-forward neural networks, and are related to clustering of the Jacobian matrix in recurrent neural networks. We also find that the weights of input neurons to recurrent neurons partially inform their modular structure, an observation that we corroborated using structural and functional imaging data from mice and humans. Finally, we find that the dynamics of these RNNs reflected the boundaries between modules. Collectively, our results suggest that neural populations in RNNs sometimes form modu

关键词： Recurrent neural networks

The content and structure of dreams are coupled to affect

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Leckie, Luke Bershad, Anya K. Heppler, Jes McClay, Mason Rappe, Sofiia Foster, Jacob G. School of Biological Sciences University of Bristol United Kingdom Department of Psychiatry and Biobehavioral Sciences Semel Institute for Neuroscience and Human Behavior UCLA Los AngelesCA United States Department of Philosophy University of California Berkeley BerkeleyCA United States Department of Psychology UCLA Los Angeles United States Department of Philosophy II Chair of Philosophy of Language and Cognition Ruhr University Bochum Germany Department of Informatics Luddy School of Informatics Computing and Engineering Indiana University United States Cognitive Science Program Indiana University Bloomington United States Santa Fe Institute United States

Dreams offer a unique window into the cognitive and affective dynamics of the sleeping and the waking mind. Recent quantitative linguistic approaches have shown promise in obtaining corpus-level measures of dream sentiment and topic occurrence. However, it is currently unclear how the affective content of individual dreams relates to their semantic content and structure. Here, we combine word embedding, topic modeling, and network analysis to investigate this relationship. By applying Discourse Atom Topic Modeling (DATM) to the DreamBank corpus of >18K dream reports, we represent the latent themes arising within dreams as a sparse dictionary of topics and identify the affective associations of those topics. We show that variation in dream affect (valence and arousal) is associated with changes in topical content. By representing each dream report as a network of topics, we demonstrate that the affective content of dreams is also coupled to semantic structure. Specifically, positively valenced dreams exhibit more coherent, structured, and linear narratives, whilst negatively valenced dreams have more narrative loops and dominant topics. Additionally, topic networks of high arousal dreams are structurally dominated by few high arousal topics and incoherent topical connections, whereas low arousal dreams contain more loops. These findings suggest that affective processes are associated with both the content and structure of dreams. Our approach showcases the potential of integrating natural language processing and network analysis with psychology to elucidate the interplay of affect, cognition and narrative in dreams. This methodology has broad applications for the study of narrated experience and psychiatric symptomatology. © 2024, CC BY-NC-ND.

关键词： Semantics

Deep STI: Deep Stochastic Time-series Imputation on Electronic Health Records

学校读者我要写书评

暂无评论

Deep STI: Deep Stochastic Time-series Imputation on Electron...

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Ming-Che Cheng Yi-Hsien Hsieh Te-Cheng Hsu Tung-Hung Su Che Lin Institute of Communications Engineering National Tsing Hua University Hsinchu Taiwan Graduate Institute of Communication Engineering National Taiwan University (NTU) Taipei Taiwan Dept. of Internal Medicine Division of Gastroenterolgy and Hepatology National Taiwan University Hospital Taipei Taiwan Department of Electrical Engineering NTU Taipei Taiwan Center for Advanced Computing and Imaging in Biomedicine NTU Taipei Taiwan Smart Medicine and Health Informatics Program NTU Taipei Taiwan

ISBN: (数字)9798350371499

ISBN: (纸本)9798350371505

Electronic Health Records (EHRs) are a cornerstone of modern healthcare analytics, offering rich datasets for various disease analyses through advanced deep learning algorithms. However, the pervasive issue of missing values in EHRs significantly hampers the development and performance of these models. Addressing this challenge is crucial for enhancing clinical decision-making and patient care. Existing methods for handling missing data, ranging from simple imputation to more sophisticated approaches, often fall short of capturing the temporal dynamics inherent in EHRs. To bridge this gap, we introduce the Deep Stochastic Time-series Imputation (Deep STI) algorithm, an innovative end-to-end deep learning model that seamlessly integrates a sequence-to-sequence generative network with a prediction network. Deep STI is designed to leverage the observed time-series data in EHRs, learning to infer missing values from the temporal context with high accuracy. We evaluated Deep STI on the liver cancer data from the National Taiwan University Hospital (NTUH), Taiwan. Our results showed that Deep STI achieved better 5-year hepatocellular carcinoma predictions (19.21% in the area under the precision-recall curve) than extreme gradient boosting (18.15%) and Transformer (18.09%). The ablation study also illustrates the efficacy of our generative architecture design compared to regular imputations. This approach not only promises to improve the reliability of disease analysis in the presence of incomplete data but also sets a new standard for utilizing EHRs in predictive healthcare. Our work aims to advance the field of healthcare analytics and open new avenues for research in deep learning applications to EHRs.

关键词： Deep learning Time series analysis Stochastic processes Predictive models Transformers Imputation Reliability Electronic medical records Standards Diseases

Computer Modelling of the Information Properties of Hyper Chaotic Lorenz System and Its Application in Secure Communication System 1

学校读者我要写书评

暂无评论

Computer Modelling of the Information Properties of Hyper Ch...

1st Paris Van Java International Seminar on Computer, Science, Engineering, and Technology, PVJ ISComSET 2020

作者： Rusyn, Volodymyr Mujiarto Mamat, Mustafa Azharul, Firmansyah Mada Sanjaya, W.S. Sambas, Aceng Dwipriyoko, Estiyan Sutoni, Akhmad Yuriy Fedkovych Chernivtsi National University Kotsybynsky str. 2 Chernivtsi58012 Ukraine Department of Mechanical Engineering Universitas Muhammadiyah Tasikmalaya Indonesia Faculty of Informatics and Computing Universiti Sultan Zainal Abidin Kuala Terengganu Malaysia Department of Mechanical Engineering Sekolah Tinggi Teknologi Cileungsi Indonesia Department of Physics Universitas Islam Negeri Sunan Gunung Djati Bandung Indonesia Informatics Study Program Universitas Langlangbuana Bandung Indonesia Department of Industrial Engineering Universitas Suryakancana Cianjur Indonesia

This paper presents computer modeling, analysis and research of the hyper-chaotic Lorenz system based on programming interface that has been developed in LabView software environment. This study allows for generating and research of the main information properties of hyper-chaotic Lorenz system, focusing on time distribution of the four chaotic coordinates, phase portraits and Lyapunov exponents. The programming interface demonstrates the algorithm of masking and decrypt of the information carrier. © Published under licence by IOP Publishing Ltd.

关键词： Lyapunov methods

Dynamic programming Algorithm using Furniture Industry 0/1 Knapsack Problem

学校读者我要写书评

暂无评论

Dynamic Programming Algorithm using Furniture Industry 0/1 K...

International Conference on Cybernetics and Intelligent System (ICORIS)

作者： Mietha Anditta Natashya Amartya Laurens Spits Warnars Harco Leslie Hendric Spits Warnars Arief Ramadhan Teddy Siswanto Teddy Mantoro Nurulhuda Noordin Computer Science Departement School of Computer Science Bina Nusantara University Jakarta Indonesia Information Systems Departement School of Information Systems Bina Nusantara University Jakarta Indonesia Computer Science Departement BINUS Graduate Program - Computer Science Bina Nusantara University Jakarta Indonesia PJJ Informatika Telkom University Bandung Indonesia Information Systems Department Trisakti University Jakarta Indonesia Faculty of Engineering and Technology Sampoerna University Jakarta Indonesia School of Computing Sciences College of Computing Informatics and Mathematics Universiti Teknologi MARA Selangor Malaysia

Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem can be seen from industrial production cost. It is prevalent that a production cost has to be as efficient as possible, but the expectation is to get the proceeds of the products higher. Thus, the dynamic programming algorithm can be implemented to solve the diverse knapsack problem, one of which is the 0/1 knapsack problem, which would be the main focus of this paper. The implementation was implemented using C language. This paper was created as an early implementation algorithm using a Dynamic program algorithm applied to an Automatic Identification System (AIS) dataset.

关键词：

MoCab: A framework for the deployment of machine learning models across health information systems

学校读者我要写书评

暂无评论

Computer Methods and programs in Biomedicine 2024年 255卷 108336页

作者： Kuo, Zhe-Ming Chen, Kuan-Fu Tseng, Yi-Ju Department of Information Management National Central University Taoyuan Taiwan College of Intelligent Computing Chang Gung University Taoyuan Taiwan Medical Statistics Research Center Chang Gung University Taoyuan Taiwan Department of Emergency Medicine Chang Gung Memorial Hospital Keelung Taiwan Department of Computer Science National Yang Ming Chiao Tung University Hsinchu Taiwan Computational Health Informatics Program Boston Children's Hospital BostonMA United States

Background and Objective: Machine learning models are vital for enhancing healthcare services. However, integrating them into health information systems (HISs) introduces challenges beyond clinical decision making, such as interoperability and diverse electronic health records (EHR) formats. We proposed Model Cabinet Architecture (MoCab), a framework designed to leverage fast healthcare interoperability resources (FHIR) as the standard for data storage and retrieval when deploying machine learning models across various HISs, addressing the challenges highlighted by platforms such as EPOCH®, ePRISM®, KETOS, and others. Methods: The MoCab architecture is designed to streamline predictive modeling in healthcare through a structured framework incorporating several specialized parts. The Data Service Center manages patient data retrieval from FHIR servers. These data are then processed by the Knowledge Model Center, where they are formatted and fed into predictive models. The Model Retraining Center is crucial in continuously updating these models to maintain accuracy in dynamic clinical environments. The framework further incorporates Clinical Decision Support (CDS) Hooks for issuing clinical alerts. It uses Substitutable Medical Apps Reusable Technologies (SMART) on FHIR to develop applications for displaying alerts, prediction results, and patient records. Results: The MoCab framework was demonstrated using three types of predictive models: a scoring model (qCSI), a machine learning model (NSTI), and a deep learning model (SPC), applied to synthetic data that mimic a major EHR system. The implementations showed how MoCab integrates predictive models with health data for clinical decision support, utilizing CDS Hooks and SMART on FHIR for seamless HIS integration. The demonstration confirmed the practical utility of MoCab in supporting clinical decision making, validated by its application in various healthcare settings. Conclusions: We demonstrate MoCab's potential in

关键词： Interoperability

ReViT: A Hybrid Approach for BCLC Staging of Hepatocellular Carcinoma Using 3D CT with Multiple Instance Learning

学校读者我要写书评

暂无评论

ReViT: A Hybrid Approach for BCLC Staging of Hepatocellular ...

IEEE EMBS International Conference on Information Technology Applications in Biomedicine (ITAB)

作者： Shun-Cheng Chang Hsin-Pei Yu Yi-Hsien Hsieh Pochuang Wang Weichung Wang Tung-Hung Su Jia-Horng Kao Che Lin Graduate Institute of Communication Engineering National Taiwan University (NTU) Taipei Taiwan Department of Computer Science and Information Engineering NTU Taipei Taiwan Institute of Applied Mathematical Sciences NTU Taipei Taiwan Department of Internal Medicine Division of Gastroenterology and Hepatology National Taiwan University Hospital Taipei Taiwan Department of Electrical Engineering NTU Taipei Taiwan Center for Advanced Computing and Imaging in Biomedicine NTU Taipei Taiwan Smart Medicine and Health Informatics Program NTU Taipei Taiwan

ISBN: (数字)9798350351552

ISBN: (纸本)9798350351569

Deep learning has revolutionized medical imaging, offering advanced methods for accurate diagnosis and treatment planning. The BCLC staging system is crucial for staging Hepatocellular Carcinoma (HCC), a high-mortality cancer. An automated BCLC staging system could significantly enhance diagnosis and treatment planning efficiency. However, we found that BCLC staging, which is directly related to the size and number of liver tumors, aligns well with the principles of the Multiple Instance Learning (MIL) framework. To effectively achieve this, we proposed a new preprocessing technique called Masked Cropping and Padding(MCP), which addresses the variability in liver volumes and ensures consistent input sizes. This technique preserves the structural integrity of the liver, facilitating more effective learning. Furthermore, we introduced Re ViT, a novel hybrid model that integrates the local feature extraction capabilities of Convolutional Neural Networks (CNNs) with the global context modeling of Vision Transformers (ViTs). Re ViT leverages the strengths of both architectures within the MIL framework, enabling a robust and accurate approach for BCLC staging. We will further explore the trade-off between performance and interpretability by employing TopK Pooling strategies, as our model focuses on the most informative instances within each bag.

关键词： Visualization Accuracy Three-dimensional displays Liver Transformers Planning Convolutional neural networks Context modeling Biomedical imaging Tumors