1,221,165 results on '"Khan, A."'
Search Results
2. Efficient and Power-Aware Design of a Novel Sparse Kogge-Stone Adder using Hybrid Carry Prefix Generator Adder
- Author
-
KHAN, A. and WAIRYA, S.
- Subjects
circuit simulation ,circuit topology ,digital circuits ,parallel architectures ,very large scale integration ,Electrical engineering. Electronics. Nuclear engineering ,TK1-9971 ,Computer engineering. Computer hardware ,TK7885-7895 - Abstract
This paper presents a novel Sparse Kogge-Stone adder architecture with a sparsity factor of 2, offering a compelling solution to the challenges faced by parallel prefix adders. The superior performance is achieved by including the hybrid carry prefix generator adder (HCPGA), which leads to the elimination of redundant components, and improvements in power consumption and circuit area without compromising computation speed. The proposed hybrid architecture efficiently generates carry prefixes that negates the need for the conventional generate and propagate block, resulting in reduced computational complexity. The effectiveness of the proposed architecture has been extensively validated using Cadence Virtuoso in the 45nm technology node. In addition to evaluating standard performance parameters such as power, delay, and area, comprehensive Monte Carlo simulations and process corner analyses have been performed to ensure the robustness and reliability of the design. Furthermore, the practical application of the proposed architecture has been demonstrated by integrating it into a digital multiplier architecture, showcasing its potential to enhance the computational capabilities of complex arithmetic circuits. This research contributes to the advancement of efficient adder designs for high-performance computing applications, making it highly beneficial and relevant for modern digital circuit designs.
- Published
- 2024
- Full Text
- View/download PDF
3. Evaluation of antianxiety effect of Nigella sativa Linn. seed oil in mice
- Author
-
Khan, A.K. Afzal, Ghanta, Mohan Krishna, Nayaka, Swapna R., and Usha, N.S.
- Published
- 2023
- Full Text
- View/download PDF
4. Utilization of mushroom waste as non-conventional feed additive in broiler chicken
- Author
-
Banday, M.T., Adil, S., Wani, M.A., Khan, A.A., Sheikh, I.U., and Shubeena, S.
- Published
- 2023
- Full Text
- View/download PDF
5. Constraints faced by yak and yak cross rearing communities of Ladakh Region
- Author
-
Wani, Akeel Yousf, Khan, A. A., Hamadani, H., Sheikh, I.U., Banday, M.T., Akand, A. H., Shahnaz, S., and Baba, S.H.
- Published
- 2023
- Full Text
- View/download PDF
6. Indian agricultural sector present and post pandemic condition
- Author
-
Upendra, R.S., Ahmed, Mohammed Riyaz, Kumar, T. Nitesh, Prithviraj, S.R., and Khan, A. Shahid
- Published
- 2023
- Full Text
- View/download PDF
7. Productive performance and economics of broiler chicken fed heat treated sheep manure based diets supplemented with enzyme
- Author
-
Sheikh, I.U., Banday, M.T., Khan, A.A., Adil, S., Baba, I.A., Hamadani, H., Patoo, R.A., Zaffer, B., and Nissa, S.S.
- Published
- 2022
- Full Text
- View/download PDF
8. Epidemiological Pattern of Neonatal Calf Diarrhea and a Randomized On-Field Trial to Evaluate Effectiveness of Zinc
- Author
-
Bhat, I.A., Ain, Q.U., Bashir, S., Nazir, T., Sheikh, G.N., Khan, A.A., and Dar, A.A.
- Published
- 2022
- Full Text
- View/download PDF
9. CDChat: A Large Multimodal Model for Remote Sensing Change Description
- Author
-
Noman, Mubashir, Ahsan, Noor, Naseer, Muzammal, Cholakkal, Hisham, Anwer, Rao Muhammad, Khan, Salman, and Khan, Fahad Shahbaz
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Large multimodal models (LMMs) have shown encouraging performance in the natural image domain using visual instruction tuning. However, these LMMs struggle to describe the content of remote sensing images for tasks such as image or region grounding, classification, etc. Recently, GeoChat make an effort to describe the contents of the RS images. Although, GeoChat achieves promising performance for various RS tasks, it struggles to describe the changes between bi-temporal RS images which is a key RS task. This necessitates the development of an LMM that can describe the changes between the bi-temporal RS images. However, there is insufficiency of datasets that can be utilized to tune LMMs. In order to achieve this, we introduce a change description instruction dataset that can be utilized to finetune an LMM and provide better change descriptions for RS images. Furthermore, we show that the LLaVA-1.5 model, with slight modifications, can be finetuned on the change description instruction dataset and achieve favorably better performance.
- Published
- 2024
10. Efficient Localized Adaptation of Neural Weather Forecasting: A Case Study in the MENA Region
- Author
-
Munir, Muhammad Akhtar, Khan, Fahad Shahbaz, and Khan, Salman
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Physics - Atmospheric and Oceanic Physics - Abstract
Accurate weather and climate modeling is critical for both scientific advancement and safeguarding communities against environmental risks. Traditional approaches rely heavily on Numerical Weather Prediction (NWP) models, which simulate energy and matter flow across Earth's systems. However, heavy computational requirements and low efficiency restrict the suitability of NWP, leading to a pressing need for enhanced modeling techniques. Neural network-based models have emerged as promising alternatives, leveraging data-driven approaches to forecast atmospheric variables. In this work, we focus on limited-area modeling and train our model specifically for localized region-level downstream tasks. As a case study, we consider the MENA region due to its unique climatic challenges, where accurate localized weather forecasting is crucial for managing water resources, agriculture and mitigating the impacts of extreme weather events. This targeted approach allows us to tailor the model's capabilities to the unique conditions of the region of interest. Our study aims to validate the effectiveness of integrating parameter-efficient fine-tuning (PEFT) methodologies, specifically Low-Rank Adaptation (LoRA) and its variants, to enhance forecast accuracy, as well as training speed, computational resource utilization, and memory efficiency in weather and climate modeling for specific regions., Comment: Our codebase and pre-trained models can be accessed at: [this url](https://github.com/akhtarvision/weather-regional)
- Published
- 2024
11. Personalized Federated Learning Techniques: Empirical Analysis
- Author
-
Khan, Azal Ahmad, Khan, Ahmad Faraz, Ali, Haider, and Anwar, Ali
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Cryptography and Security - Abstract
Personalized Federated Learning (pFL) holds immense promise for tailoring machine learning models to individual users while preserving data privacy. However, achieving optimal performance in pFL often requires a careful balancing act between memory overhead costs and model accuracy. This paper delves into the trade-offs inherent in pFL, offering valuable insights for selecting the right algorithms for diverse real-world scenarios. We empirically evaluate ten prominent pFL techniques across various datasets and data splits, uncovering significant differences in their performance. Our study reveals interesting insights into how pFL methods that utilize personalized (local) aggregation exhibit the fastest convergence due to their efficiency in communication and computation. Conversely, fine-tuning methods face limitations in handling data heterogeneity and potential adversarial attacks while multi-objective learning methods achieve higher accuracy at the cost of additional training and resource consumption. Our study emphasizes the critical role of communication efficiency in scaling pFL, demonstrating how it can significantly affect resource usage in real-world deployments.
- Published
- 2024
12. Fault Tolerant Metric Dimensions of Leafless Cacti Graphs with Application in Supply Chain Management
- Author
-
Asif, Tauseef, Haidar, Ghulam, Yousafzai, Faisal, Khan, Murad Ul Islam, Khan, Qaisar, and Fatima, Rakea
- Subjects
Computer Science - Discrete Mathematics ,Mathematics - Combinatorics ,05C12, 05C90 - Abstract
A resolving set for a simple graph $G$ is a subset of vertex set of $G$ such that it distinguishes all vertices of $G$ using the shortest distance from this subset. This subset is a metric basis if it is the smallest set with this property. A resolving set is a fault tolerant resolving set if the removal of any vertex from the subset still leaves it a resolving set. The smallest set satisfying this property is the fault tolerant metric basis, and the cardinality of this set is termed as fault tolerant metric dimension of $G$, denoted by $\beta'(G)$. In this article, we determine the fault tolerant metric dimension of bicyclic graphs of type-I and II and show that it is always $4$ for both types of graphs. We then use these results to form our basis to consider leafless cacti graphs, and calculate their fault tolerant metric dimensions in terms of \textit{inner cycles} and \textit{outer cycles}. We then consider a detailed real world example of supply and distribution center management, and discuss the application of fault tolerant metric dimension in such a scenario. We also briefly discuss some other scenarios where leafless cacti graphs can be used to model real world problems.
- Published
- 2024
13. AD-Net: Attention-based dilated convolutional residual network with guided decoder for robust skin lesion segmentation
- Author
-
Naveed, Asim, Naqvi, Syed S., Khan, Tariq M., Iqbal, Shahzaib, Wani, M. Yaqoob, and Khan, Haroon Ahmed
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence - Abstract
In computer-aided diagnosis tools employed for skin cancer treatment and early diagnosis, skin lesion segmentation is important. However, achieving precise segmentation is challenging due to inherent variations in appearance, contrast, texture, and blurry lesion boundaries. This research presents a robust approach utilizing a dilated convolutional residual network, which incorporates an attention-based spatial feature enhancement block (ASFEB) and employs a guided decoder strategy. In each dilated convolutional residual block, dilated convolution is employed to broaden the receptive field with varying dilation rates. To improve the spatial feature information of the encoder, we employed an attention-based spatial feature enhancement block in the skip connections. The ASFEB in our proposed method combines feature maps obtained from average and maximum-pooling operations. These combined features are then weighted using the active outcome of global average pooling and convolution operations. Additionally, we have incorporated a guided decoder strategy, where each decoder block is optimized using an individual loss function to enhance the feature learning process in the proposed AD-Net. The proposed AD-Net presents a significant benefit by necessitating fewer model parameters compared to its peer methods. This reduction in parameters directly impacts the number of labeled data required for training, facilitating faster convergence during the training process. The effectiveness of the proposed AD-Net was evaluated using four public benchmark datasets. We conducted a Wilcoxon signed-rank test to verify the efficiency of the AD-Net. The outcomes suggest that our method surpasses other cutting-edge methods in performance, even without the implementation of data augmentation strategies.
- Published
- 2024
14. CONDA: Condensed Deep Association Learning for Co-Salient Object Detection
- Author
-
Li, Long, Liu, Nian, Zhang, Dingwen, Li, Zhongyu, Khan, Salman, Anwer, Rao, Cholakkal, Hisham, Han, Junwei, and Khan, Fahad Shahbaz
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Inter-image association modeling is crucial for co-salient object detection. Despite satisfactory performance, previous methods still have limitations on sufficient inter-image association modeling. Because most of them focus on image feature optimization under the guidance of heuristically calculated raw inter-image associations. They directly rely on raw associations which are not reliable in complex scenarios, and their image feature optimization approach is not explicit for inter-image association modeling. To alleviate these limitations, this paper proposes a deep association learning strategy that deploys deep networks on raw associations to explicitly transform them into deep association features. Specifically, we first create hyperassociations to collect dense pixel-pair-wise raw associations and then deploys deep aggregation networks on them. We design a progressive association generation module for this purpose with additional enhancement of the hyperassociation calculation. More importantly, we propose a correspondence-induced association condensation module that introduces a pretext task, i.e. semantic correspondence estimation, to condense the hyperassociations for computational burden reduction and noise elimination. We also design an object-aware cycle consistency loss for high-quality correspondence estimations. Experimental results in three benchmark datasets demonstrate the remarkable effectiveness of our proposed method with various training settings., Comment: There is an error. In Sec 4.1, the number of images in some dataset is incorrect and needs to be revised
- Published
- 2024
15. Metric dimensions of bicyclic graphs with potential applications in Supply Chain Logistics
- Author
-
Wang, Muwen, Haidar, Ghulam, Yousafzai, Faisal, Khan, Murad Ul Islam, Sikandar, Waseem, and Khan, Asad Ul Islam
- Subjects
Mathematics - General Mathematics ,05C12, 05C90 - Abstract
Metric dimensions and metric basis are graph invariants studied for their use in locating and indexing nodes in a graph. It was recently established that for bicyclic graph of type-III ($\Theta $-graphs), the metric dimension is $3$ only, when all paths have equal lengths, or when one of the outside path has a length $2$ more than the other two paths. In this article, we refute this claim and show that the case where the middle path is $2$ vertices more than the other two paths, also has metric dimension $3$. We also determine the metric dimension for other values of $p,q,r$ which were omitted in the recent research due to the constraint $p \leq q \leq r$. We also propose a graph-based technique to transform an agricultural supply chain logistics problem into a mathematical model, by using metric basis and metric dimensions. We provide a theoretical groundwork which can be used to model and solve these problems using machine learning algorithms.
- Published
- 2024
16. Zak-OTFS with Interleaved Pilots to Extend the Region of Predictable Operation
- Author
-
Jayachandran, Jinu, Khan, Imran Ali, Mohammed, Saif Khan, Hadani, Ronny, Chockalingam, Ananthanarayanan, and Calderbank, Robert
- Subjects
Electrical Engineering and Systems Science - Signal Processing ,Computer Science - Information Theory - Abstract
When the delay period of the Zak-OTFS carrier is greater than the delay spread of the channel, and the Doppler period of the carrier is greater than the Doppler spread of the channel, the effective channel filter taps can simply be read off from the response to a single pilot carrier waveform. The input-output (I/O) relation can then be reconstructed for a sampled system that operates under finite duration and bandwidth constraints. We introduce a framework for pilot design in the delay-Doppler (DD) domain which makes it possible to support users with very different delay-Doppler characteristics when it is not possible to choose a single delay and Doppler period to support all users. The method is to interleave single pilots in the DD domain, and to choose the pilot spacing so that the I/O relation can be reconstructed by solving a small linear system of equations., Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible
- Published
- 2024
17. BAPLe: Backdoor Attacks on Medical Foundational Models using Prompt Learning
- Author
-
Hanif, Asif, Shamshad, Fahad, Awais, Muhammad, Naseer, Muzammal, Khan, Fahad Shahbaz, Nandakumar, Karthik, Khan, Salman, and Anwer, Rao Muhammad
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Medical foundation models are gaining prominence in the medical community for their ability to derive general representations from extensive collections of medical image-text pairs. Recent research indicates that these models are susceptible to backdoor attacks, which allow them to classify clean images accurately but fail when specific triggers are introduced. However, traditional backdoor attacks necessitate a considerable amount of additional data to maliciously pre-train a model. This requirement is often impractical in medical imaging applications due to the usual scarcity of data. Inspired by the latest developments in learnable prompts, this work introduces a method to embed a backdoor into the medical foundation model during the prompt learning phase. By incorporating learnable prompts within the text encoder and introducing imperceptible learnable noise trigger to the input images, we exploit the full capabilities of the medical foundation models (Med-FM). Our method, BAPLe, requires only a minimal subset of data to adjust the noise trigger and the text prompts for downstream tasks, enabling the creation of an effective backdoor attack. Through extensive experiments with four medical foundation models, each pre-trained on different modalities and evaluated across six downstream datasets, we demonstrate the efficacy of our approach. BAPLe achieves a high backdoor success rate across all models and datasets, outperforming the baseline backdoor attack methods. Our work highlights the vulnerability of Med-FMs towards backdoor attacks and strives to promote the safe adoption of Med-FMs before their deployment in real-world applications. Code is available at https://asif-hanif.github.io/baple/., Comment: MICCAI 2024
- Published
- 2024
18. Connecting Dreams with Visual Brainstorming Instruction
- Author
-
Sun, Yasheng, Li, Bohan, Zhuge, Mingchen, Fan, Deng-Ping, Khan, Salman, Khan, Fahad Shahbaz, and Koike, Hideki
- Subjects
Computer Science - Human-Computer Interaction - Abstract
Recent breakthroughs in understanding the human brain have revealed its impressive ability to efficiently process and interpret human thoughts, opening up possibilities for intervening in brain signals. In this paper, we aim to develop a straightforward framework that uses other modalities, such as natural language, to translate the original dreamland. We present DreamConnect, employing a dual-stream diffusion framework to manipulate visually stimulated brain signals. By integrating an asynchronous diffusion strategy, our framework establishes an effective interface with human dreams, progressively refining their final imagery synthesis. Through extensive experiments, we demonstrate the method ability to accurately instruct human brain signals with high fidelity. Our project will be publicly available on https://github.com/Sys-Nexus/DreamConnect
- Published
- 2024
19. Sumotosima: A Framework and Dataset for Classifying and Summarizing Otoscopic Images
- Author
-
Khan, Eram Anwarul and Khan, Anas Anwarul Haq
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Computation and Language - Abstract
Otoscopy is a diagnostic procedure to examine the ear canal and eardrum using an otoscope. It identifies conditions like infections, foreign bodies, ear drum perforations and ear abnormalities. We propose a novel resource efficient deep learning and transformer based framework, Sumotosima (Summarizer for otoscopic images), an end-to-end pipeline for classification followed by summarization. Our framework works on combination of triplet and cross-entropy losses. Additionally, we use Knowledge Enhanced Multimodal BART whose input is fused textual and image embedding. The objective is to provide summaries that are well-suited for patients, ensuring clarity and efficiency in understanding otoscopic images. Given the lack of existing datasets, we have curated our own OCASD (Otoscopic Classification And Summary Dataset), which includes 500 images with 5 unique categories annotated with their class and summaries by Otolaryngologists. Sumotosima achieved a result of 98.03%, which is 7.00%, 3.10%, 3.01% higher than K-Nearest Neighbors, Random Forest and Support Vector Machines, respectively, in classification tasks. For summarization, Sumotosima outperformed GPT-4o and LLaVA by 88.53% and 107.57% in ROUGE scores, respectively. We have made our code and dataset publicly available at https://github.com/anas2908/Sumotosima, Comment: Work in Progress
- Published
- 2024
20. Current Practices and Pitfalls of ELT Syllabi for Developing Engineering Students' Communicative English in Bangladesh
- Author
-
Mohammad Ehsanul Islam Khan, Mohammad Shahazahan Seraj Bhuiyan, and Mohammad Ekramul Islam Khan
- Abstract
The current practices and shortcomings of engineering students' English language teaching (ELT) syllabi were examined from the perspectives of learners and teachers in English as a foreign language (EFL) context. The syllabi included content that had little impact on students' communicative competence in English (CC-E). Students were generally concerned about their professional communication abilities. In this study, the researchers collected data from ten engineering-focused universities in Bangladesh. These universities' existing ELT syllabi (ELT-S) were examined, seeking the current practices and pitfalls. The study sampled 152 participants from the selected universities. The study followed a mixed-method approach. In the qualitative technique, content analysis, focus group discussion (FGD), and interviews were employed for data collection, while survey questions were used in the quantitative approach. The study's findings revealed that the existing English syllabi of those selected universities required updating and modification to meet the identified professional requirements regarding the type, credit allotment, content, classroom practices, class size, policies, etc. The improvements included redesigning English syllabi, material, and teaching methods to improve engineering students' communicative abilities. A uniform curriculum with at least one English language sessional course per semester in all engineering majors was strongly recommended.
- Published
- 2024
21. Study of the effects of heating on the physical, optical, and electrical properties of NiO thin films synthesized using a low-cost sol-gel method
- Author
-
Khan, Muhammad Yasir, Akhtar, Muhammad Wasim, Khan, Muhammad Furqan Ali, Abbass, Zeeshan, ur-Rasheed, Fayyaz, Ali, Muhammad Saquib, Pirzada, Noman, and Shahbaz, Raja
- Published
- 2024
22. Effect of Inclusion of Different Levels of Duckweed (Lemna minor) on the Performance of Broiler Chicken
- Author
-
Zaffer, B., Sheikh, I.U., Banday, M.T., Adil, S., Ahmed, H.A., Khan, A.S., Nissa, S.S., and Mirza, U.
- Published
- 2021
- Full Text
- View/download PDF
23. Standardization and HPTLC Fingerprinting of Unani compound formulation Habb-e-Muqil Jadeed
- Author
-
Negi, R. K., Naikodi, M. A. Rasheed, Sajwan, S., Khan, Asim Ali, Khan, A. S., and Meena, R. P.
- Published
- 2021
- Full Text
- View/download PDF
24. Enabling P-type Conduction in Bilayer WS2 with NbP Topological Semimetal Contacts
- Author
-
Hoang, Lauren, Khan, Asir Intisar, Bennett, Robert K. A., Kim, Hyun-mi, Zhang, Zhepeng, Hocking, Marisa, Choi, Ae Rim, Oh, Il-Kwon, Mannix, Andrew J., and Pop, Eric
- Subjects
Condensed Matter - Materials Science ,Condensed Matter - Mesoscale and Nanoscale Physics - Abstract
Two-dimensional (2D) semiconductors are promising for low-power complementary metal oxide semiconductor (CMOS) electronics, which require ultrathin n- and p-type transistor channels. Among 2D semiconductors, WS2 is expected to have good conduction for both electrons and holes, but p-type WS2 transistors have been difficult to realize due to the relatively deep valence band and the presence of mid-gap states with conventional metal contacts. Here, we report topological semimetal NbP as p-type electrical contacts to bilayer WS2 with up to 5.8 microamperes per micron hole current at room temperature; this is the highest to date for sub 2 nm thin WS2 and more than 50 times larger than with metals like Ni or Pd. The p-type conduction is enabled by the simultaneously high work function and low density of states of the NbP, which reduce Fermi level pinning. These contacts are sputter-deposited at room temperature, an approach compatible with CMOS fabrication, a step towards enabling ultrathin WS2 semiconductors in future nanoelectronics.
- Published
- 2024
25. Multi-modal Medical Image Fusion For Non-Small Cell Lung Cancer Classification
- Author
-
Hassan, Salma, Hammadi, Hamad Al, Mohammed, Ibrahim, and Khan, Muhammad Haris
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Computer Science - Artificial Intelligence ,Computer Science - Computer Vision and Pattern Recognition - Abstract
The early detection and nuanced subtype classification of non-small cell lung cancer (NSCLC), a predominant cause of cancer mortality worldwide, is a critical and complex issue. In this paper, we introduce an innovative integration of multi-modal data, synthesizing fused medical imaging (CT and PET scans) with clinical health records and genomic data. This unique fusion methodology leverages advanced machine learning models, notably MedClip and BEiT, for sophisticated image feature extraction, setting a new standard in computational oncology. Our research surpasses existing approaches, as evidenced by a substantial enhancement in NSCLC detection and classification precision. The results showcase notable improvements across key performance metrics, including accuracy, precision, recall, and F1-score. Specifically, our leading multi-modal classifier model records an impressive accuracy of 94.04%. We believe that our approach has the potential to transform NSCLC diagnostics, facilitating earlier detection and more effective treatment planning and, ultimately, leading to superior patient outcomes in lung cancer care.
- Published
- 2024
26. URIEL+: Enhancing Linguistic Inclusion and Usability in a Typological and Multilingual Knowledge Base
- Author
-
Khan, Aditya, Shipton, Mason, Anugraha, David, Duan, Kaiyao, Hoang, Phuong H., Khiu, Eric, Doğruöz, A. Seza, and Lee, En-Shiun Annie
- Subjects
Computer Science - Computation and Language ,Computer Science - Machine Learning - Abstract
URIEL is a knowledge base offering geographical, phylogenetic, and typological vector representations for 7970 languages. It includes distance measures between these vectors for 4005 languages, which are accessible via the lang2vec tool. Despite being frequently cited, URIEL is limited in terms of linguistic inclusion and overall usability. To tackle these challenges, we introduce URIEL+, an enhanced version of URIEL and lang2vec addressing these limitations. In addition to expanding typological feature coverage for 2898 languages, URIEL+ improves user experience with robust, customizable distance calculations to better suit the needs of the users. These upgrades also offer competitive performance on downstream tasks and provide distances that better align with linguistic distance studies.
- Published
- 2024
27. Code Vulnerability Repair with Large Language Model using Context-Aware Prompt Tuning
- Author
-
Khan, Arshiya, Liu, Guannan, and Gao, Xing
- Subjects
Computer Science - Cryptography and Security ,Computer Science - Artificial Intelligence - Abstract
Large Language Models (LLMs) have shown significant challenges in detecting and repairing vulnerable code, particularly when dealing with vulnerabilities involving multiple aspects, such as variables, code flows, and code structures. In this study, we utilize GitHub Copilot as the LLM and focus on buffer overflow vulnerabilities. Our experiments reveal a notable gap in Copilot's abilities when dealing with buffer overflow vulnerabilities, with a 76% vulnerability detection rate but only a 15% vulnerability repair rate. To address this issue, we propose context-aware prompt tuning techniques designed to enhance LLM performance in repairing buffer overflow. By injecting a sequence of domain knowledge about the vulnerability, including various security and code contexts, we demonstrate that Copilot's successful repair rate increases to 63%, representing more than four times the improvement compared to repairs without domain knowledge.
- Published
- 2024
28. The hypothetical track-length fitting algorithm for energy measurement in liquid argon TPCs
- Author
-
DUNE Collaboration, Abud, A. Abed, Abi, B., Acciarri, R., Acero, M. A., Adames, M. R., Adamov, G., Adamowski, M., Adams, D., Adinolfi, M., Adriano, C., Aduszkiewicz, A., Aguilar, J., Akbar, F., Alex, N. S., Allison, K., Monsalve, S. Alonso, Alrashed, M., Alton, A., Alvarez, R., Alves, T., Amar, H., Amedo, P., Anderson, J., Andreopoulos, C., Andreotti, M., Andrews, M. P., Andrianala, F., Andringa, S., Anfimov, N., Ankowski, A., Antic, D., Antoniassi, M., Antonova, M., Antoshkin, A., Aranda-Fernandez, A., Arellano, L., Diaz, E. Arrieta, Arroyave, M. A., Asaadi, J., Ashkenazi, A., Asner, D., Asquith, L., Atkin, E., Auguste, D., Aurisano, A., Aushev, V., Autiero, D., Azam, M. B., Azfar, F., Back, A., Back, H., Back, J. J., Bagaturia, I., Bagby, L., Balashov, N., Balasubramanian, S., Baldi, P., Baldini, W., Baldonedo, J., Baller, B., Bambah, B., Banerjee, R., Barao, F., Barbu, D., Barenboim, G., Alzás, P. Barham, Barker, G. J., Barkhouse, W., Barr, G., Monarca, J. Barranco, Barros, A., Barros, N., Barrow, D., Barrow, J. L., Basharina-Freshville, A., Bashyal, A., Basque, V., Batchelor, C., Bathe-Peters, L., Battat, J. B. R., Battisti, F., Bay, F., Bazetto, M. C. Q., Alba, J. L. L. Bazo, Beacom, J. F., Bechetoille, E., Behera, B., Belchior, E., Bell, G., Bellantoni, L., Bellettini, G., Bellini, V., Beltramello, O., Benekos, N., Montiel, C. Benitez, Benjamin, D., Neves, F. Bento, Berger, J., Berkman, S., Bernal, J., Bernardini, P., Bersani, A., Bertolucci, S., Betancourt, M., Rodríguez, A. Betancur, Bevan, A., Bezawada, Y., Bezerra, A. T., Bezerra, T. J., Bhat, A., Bhatnagar, V., Bhatt, J., Bhattacharjee, M., Bhattacharya, M., Bhuller, S., Bhuyan, B., Biagi, S., Bian, J., Biery, K., Bilki, B., Bishai, M., Bitadze, A., Blake, A., Blaszczyk, F. D., Blazey, G. C., Blucher, E., Bodek, A., Bogenschuetz, J., Boissevain, J., Bolognesi, S., Bolton, T., Bomben, L., Bonesini, M., Bonilla-Diaz, C., Bonini, F., Booth, A., Boran, F., Bordoni, S., Merlo, R. Borges, Borkum, A., Bostan, N., Bouet, R., Boza, J., Bracinik, J., Brahma, B., Brailsford, D., Bramati, F., Branca, A., Brandt, A., Bremer, J., Brew, C., Brice, S. J., Brio, V., Brizzolari, C., Bromberg, C., Brooke, J., Bross, A., Brunetti, G., Brunetti, M., Buchanan, N., Budd, H., Buergi, J., Bundock, A., Burgardt, D., Butchart, S., V., G. Caceres, Cagnoli, I., Cai, T., Calabrese, R., Calcutt, J., Calivers, L., Calvo, E., Caminata, A., Camino, A. F., Campanelli, W., Campani, A., Benitez, A. Campos, Canci, N., Capó, J., Caracas, I., Caratelli, D., Carber, D., Carceller, J. M., Carini, G., Carlus, B., Carneiro, M. F., Carniti, P., Terrazas, I. Caro, Carranza, H., Carrara, N., Carroll, L., Carroll, T., Carter, A., Casarejos, E., Casazza, D., Forero, J. F. Castaño, Castaño, F. A., Castillo, A., Castromonte, C., Catano-Mur, E., Cattadori, C., Cavalier, F., Cavanna, F., Centro, S., Cerati, G., Cerna, C., Cervelli, A., Villanueva, A. Cervera, Chakraborty, K., Chalifour, M., Chappell, A., Charitonidis, N., Chatterjee, A., Chen, H., Chen, M., Chen, W. C., Chen, Y., Chen-Wishart, Z., Cherdack, D., Chi, C., Chiapponi, F., Chirco, R., Chitirasreemadam, N., Cho, K., Choate, S., Choi, G., Chokheli, D., Chong, P. S., Chowdhury, B., Christian, D., Chukanov, A., Chung, M., Church, E., Cicala, M. F., Cicerchia, M., Cicero, V., Ciolini, R., Clarke, P., Cline, G., Coan, T. E., Cocco, A. G., Coelho, J. A. B., Cohen, A., Collazo, J., Collot, J., Conley, E., Conrad, J. M., Convery, M., Copello, S., Cova, P., Cox, C., Cremaldi, L., Cremonesi, L., Crespo-Anadón, J. I., Crisler, M., Cristaldo, E., Crnkovic, J., Crone, G., Cross, R., Cudd, A., Cuesta, C., Cui, Y., Curciarello, F., Cussans, D., Dai, J., Dalager, O., Dallavalle, R., Dallaway, W., D'Amico, R., da Motta, H., Dar, Z. A., Darby, R., Peres, L. Da Silva, David, Q., Davies, G. S., Davini, S., Dawson, J., De Aguiar, R., De Almeida, P., Debbins, P., De Bonis, I., Decowski, M. P., de Gouvêa, A., De Holanda, P. C., Astiz, I. L. De Icaza, De Jong, P., Sanchez, P. Del Amo, De la Torre, A., De Lauretis, G., Delbart, A., Delepine, D., Delgado, M., Dell'Acqua, A., Monache, G. Delle, Delmonte, N., De Lurgio, P., Demario, R., De Matteis, G., Neto, J. R. T. de Mello, DeMuth, D. M., Dennis, S., Densham, C., Denton, P., Deptuch, G. W., De Roeck, A., De Romeri, V., Detje, J. P., Devine, J., Dharmapalan, R., Dias, M., Diaz, A., Díaz, J. S., Díaz, F., Di Capua, F., Di Domenico, A., Di Domizio, S., Di Falco, S., Di Giulio, L., Ding, P., Di Noto, L., Diociaiuti, E., Distefano, C., Diurba, R., Diwan, M., Djurcic, Z., Doering, D., Dolan, S., Dolek, F., Dolinski, M. J., Domenici, D., Domine, L., Donati, S., Donon, Y., Doran, S., Douglas, D., Doyle, T. A., Dragone, A., Drielsma, F., Duarte, L., Duchesneau, D., Duffy, K., Dugas, K., Dunne, P., Dutta, B., Duyang, H., Dwyer, D. A., Dyshkant, A. S., Dytman, S., Eads, M., Earle, A., Edayath, S., Edmunds, D., Eisch, J., Englezos, P., Ereditato, A., Erjavec, T., Escobar, C. O., Evans, J. J., Ewart, E., Ezeribe, A. C., Fahey, K., Fajt, L., Falcone, A., Fani', M., Farnese, C., Farrell, S., Farzan, Y., Fedoseev, D., Felix, J., Feng, Y., Fernandez-Martinez, E., Ferry, G., Fialova, E., Fields, L., Filip, P., Filkins, A., Filthaut, F., Fine, R., Fiorillo, G., Fiorini, M., Fogarty, S., Foreman, W., Fowler, J., Franc, J., Francis, K., Franco, D., Franklin, J., Freeman, J., Fried, J., Friedland, A., Fuess, S., Furic, I. K., Furman, K., Furmanski, A. P., Gaba, R., Gabrielli, A., Gago, A. M., Galizzi, F., Gallagher, H., Gallice, N., Galymov, V., Gamberini, E., Gamble, T., Ganacim, F., Gandhi, R., Ganguly, S., Gao, F., Gao, S., Garcia-Gamez, D., García-Peris, M. Á., Gardim, F., Gardiner, S., Gastler, D., Gauch, A., Gauvreau, J., Gauzzi, P., Gazzana, S., Ge, G., Geffroy, N., Gelli, B., Gent, S., Gerlach, L., Ghorbani-Moghaddam, Z., Giammaria, T., Gibin, D., Gil-Botella, I., Gilligan, S., Gioiosa, A., Giovannella, S., Girerd, C., Giri, A. K., Giugliano, C., Giusti, V., Gnani, D., Gogota, O., Gollapinni, S., Gollwitzer, K., Gomes, R. A., Bermeo, L. V. Gomez, Fajardo, L. S. Gomez, Gonnella, F., Gonzalez-Diaz, D., Gonzalez-Lopez, M., Goodman, M. C., Goswami, S., Gotti, C., Goudeau, J., Goudzovski, E., Grace, C., Gramellini, E., Gran, R., Granados, E., Granger, P., Grant, C., Gratieri, D. R., Grauso, G., Green, P., Greenberg, S., Greer, J., Griffith, W. C., Groetschla, F. T., Grzelak, K., Gu, L., Gu, W., Guarino, V., Guarise, M., Guenette, R., Guerzoni, M., Guffanti, D., Guglielmi, A., Guo, B., Guo, F. Y., Gupta, A., Gupta, V., Gurung, G., Gutierrez, D., Guzowski, P., Guzzo, M. M., Gwon, S., Habig, A., Hadavand, H., Haegel, L., Haenni, R., Hagaman, L., Hahn, A., Haiston, J., Hakenmüller, J., Hamernik, T., Hamilton, P., Hancock, J., Happacher, F., Harris, D. A., Hart, A. L., Hartnell, J., Hartnett, T., Harton, J., Hasegawa, T., Hasnip, C. M., Hatcher, R., Hayrapetyan, K., Hays, J., Hazen, E., He, M., Heavey, A., Heeger, K. M., Heise, J., Hellmuth, P., Henry, S., Herner, K., Hewes, V., Higuera, A., Hilgenberg, C., Hillier, S. J., Himmel, A., Hinkle, E., Hirsch, L. R., Ho, J., Hoff, J., Holin, A., Holvey, T., Hoppe, E., Horiuchi, S., Horton-Smith, G. A., Houdy, T., Howard, B., Howell, R., Hristova, I., Hronek, M. S., Huang, J., Huang, R. G., Hulcher, Z., Ibrahim, M., Iles, G., Ilic, N., Iliescu, A. M., Illingworth, R., Ingratta, G., Ioannisian, A., Irwin, B., Isenhower, L., Oliveira, M. Ismerio, Itay, R., Jackson, C. M., Jain, V., James, E., Jang, W., Jargowsky, B., Jena, D., Jentz, I., Ji, X., Jiang, C., Jiang, J., Jiang, L., Jipa, A., Jo, J. H., Joaquim, F. R., Johnson, W., Jollet, C., Jones, B., Jones, R., Jovancevic, N., Judah, M., Jung, C. K., Jung, K. Y., Junk, T., Jwa, Y., Kabirnezhad, M., Kaboth, A. C., Kadenko, I., Kakorin, I., Kalitkina, A., Kalra, D., Kandemir, M., Kaplan, D. M., Karagiorgi, G., Karaman, G., Karcher, A., Karyotakis, Y., Kasai, S., Kasetti, S. P., Kashur, L., Katsioulas, I., Kauther, A., Kazaryan, N., Ke, L., Kearns, E., Keener, P. T., Kelly, K. J., Kemp, E., Kemularia, O., Kermaidic, Y., Ketchum, W., Kettell, S. H., Khabibullin, M., Khan, N., Khvedelidze, A., Kim, D., Kim, J., Kim, M. J., King, B., Kirby, B., Kirby, M., Kish, A., Klein, J., Kleykamp, J., Klustova, A., Kobilarcik, T., Koch, L., Koehler, K., Koerner, L. W., Koh, D. H., Kolupaeva, L., Korablev, D., Kordosky, M., Kosc, T., Kose, U., Kostelecký, V. A., Kothekar, K., Kotler, I., Kovalcuk, M., Kozhukalov, V., Krah, W., Kralik, R., Kramer, M., Kreczko, L., Krennrich, F., Kreslo, I., Kroupova, T., Kubota, S., Kubu, M., Kudenko, Y., Kudryavtsev, V. A., Kufatty, G., Kuhlmann, S., Kulagin, S., Kumar, J., Kumar, P., Kumaran, S., Kunzmann, J., Kuravi, R., Kurita, N., Kuruppu, C., Kus, V., Kutter, T., Kvasnicka, J., Labree, T., Lackey, T., Lalău, I., Lambert, A., Land, B. J., Lane, C. E., Lane, N., Lang, K., Langford, T., Langstaff, M., Lanni, F., Lantwin, O., Larkin, J., Lasorak, P., Last, D., Laudrain, A., Laundrie, A., Laurenti, G., Lavaut, E., Laycock, P., Lazanu, I., LaZur, R., Lazzaroni, M., Le, T., Leardini, S., Learned, J., LeCompte, T., Legin, V., Miotto, G. Lehmann, Lehnert, R., de Oliveira, M. A. Leigui, Leitner, M., Silverio, D. Leon, Lepin, L. M., Li, J. -Y, Li, S. W., Li, Y., Liao, H., Lin, C. S., Lindebaum, D., Linden, S., Lineros, R. A., Lister, A., Littlejohn, B. R., Liu, H., Liu, J., Liu, Y., Lockwitz, S., Lokajicek, M., Lomidze, I., Long, K., Lopes, T. V., Lopez, J., de Rego, I. López, López-March, N., Lord, T., LoSecco, J. M., Louis, W. C., Sanchez, A. Lozano, Lu, X. -G., Luk, K. B., Lunday, B., Luo, X., Luppi, E., MacFarlane, D., Machado, A. A., Machado, P., Macias, C. T., Macier, J. R., MacMahon, M., Maddalena, A., Madera, A., Madigan, P., Magill, S., Magueur, C., Mahn, K., Maio, A., Major, A., Majumdar, K., Mameli, S., Man, M., Mandujano, R. C., Maneira, J., Manly, S., Mann, A., Manolopoulos, K., Plata, M. Manrique, Corchado, S. Manthey, Manyam, V. N., Marchan, M., Marchionni, A., Marciano, W., Marfatia, D., Mariani, C., Maricic, J., Marinho, F., Marino, A. D., Markiewicz, T., Marques, F. Das Chagas, Marquet, C., Marshak, M., Marshall, C. M., Marshall, J., Martina, L., Martín-Albo, J., Martinez, N., Caicedo, D. A. Martinez, López, F. Martínez, Miravé, P. Martínez, Martynenko, S., Mascagna, V., Massari, C., Mastbaum, A., Matichard, F., Matsuno, S., Matteucci, G., Matthews, J., Mauger, C., Mauri, N., Mavrokoridis, K., Mawby, I., Mazza, R., McAskill, T., McConkey, N., McFarland, K. S., McGrew, C., McNab, A., Meazza, L., Meddage, V. C. N., Mefodiev, A., Mehta, B., Mehta, P., Melas, P., Mena, O., Mendez, H., Mendez, P., Méndez, D. P., Menegolli, A., Meng, G., Mercuri, A. C. E. A., Meregaglia, A., Messier, M. D., Metallo, S., Metcalf, W., Mewes, M., Meyer, H., Miao, T., Micallef, J., Miccoli, A., Michna, G., Milincic, R., Miller, F., Miller, G., Miller, W., Mineev, O., Minotti, A., Miralles, L., Mironov, C., Miryala, S., Miscetti, S., Mishra, C. S., Mishra, P., Mishra, S. R., Mislivec, A., Mitchell, M., Mladenov, D., Mocioiu, I., Mogan, A., Moggi, N., Mohanta, R., Mohayai, T. A., Mokhov, N., Molina, J., Bueno, L. Molina, Montagna, E., Montanari, A., Montanari, C., Montanari, D., Montanino, D., Zetina, L. M. Montaño, Mooney, M., Moor, A. F., Moore, Z., Moreno, D., Moreno-Palacios, O., Morescalchi, L., Moretti, D., Moretti, R., Morris, C., Mossey, C., Moura, C. A., Mouster, G., Mu, W., Mualem, L., Mueller, J., Muether, M., Muheim, F., Muir, A., Mukhamejanov, Y., Mulhearn, M., Munford, D., Munteanu, L. J., Muramatsu, H., Muraz, J., Murphy, M., Murphy, T., Muse, J., Mytilinaki, A., Nachtman, J., Nagai, Y., Nagu, S., Nandakumar, R., Naples, D., Narita, S., Navrer-Agasson, A., Nayak, N., Nebot-Guinot, M., Nehm, A., Nelson, J. K., Neogi, O., Nesbit, J., Nessi, M., Newbold, D., Newcomer, M., Nichol, R., Nicolas-Arnaldos, F., Nikolica, A., Nikolov, J., Niner, E., Nishimura, K., Norman, A., Norrick, A., Novella, P., Nowak, A., Nowak, J. A., Oberling, M., Ochoa-Ricoux, J. P., Oh, S., Oh, S. B., Olivier, A., Olshevskiy, A., Olson, T., Onel, Y., Onishchuk, Y., Oranday, A., Osbiston, M., Vélez, J. A. Osorio, O'Sullivan, L., Ormachea, L. Otiniano, Ott, J., Pagani, L., Palacio, G., Palamara, O., Palestini, S., Paley, J. M., Pallavicini, M., Palomares, C., Pan, S., Panda, P., Vazquez, W. Panduro, Pantic, E., Paolone, V., Papaleo, R., Papanestis, A., Papoulias, D., Paramesvaran, S., Paris, A., Parke, S., Parozzi, E., Parsa, S., Parsa, Z., Parveen, S., Parvu, M., Pasciuto, D., Pascoli, S., Pasqualini, L., Pasternak, J., Patrick, C., Patrizii, L., Patterson, R. B., Patzak, T., Paudel, A., Paulucci, L., Pavlovic, Z., Pawloski, G., Payne, D., Pec, V., Pedreschi, E., Peeters, S. J. M., Pellico, W., Perez, A. Pena, Pennacchio, E., Penzo, A., Peres, O. L. G., Gonzalez, Y. F. Perez, Pérez-Molina, L., Pernas, C., Perry, J., Pershey, D., Pessina, G., Petrillo, G., Petta, C., Petti, R., Pfaff, M., Pia, V., Pickering, L., Pietropaolo, F., Pimentel, V. L., Pinaroli, G., Pincha, S., Pinchault, J., Pitts, K., Plows, K., Pollack, C., Pollman, T., Pompa, F., Pons, X., Poonthottathil, N., Popov, V., Poppi, F., Porter, J., Paixão, L. G. Porto, Potekhin, M., Potenza, R., Pozzato, M., Prakash, T., Pratt, C., Prest, M., Psihas, F., Pugnere, D., Qian, X., Queen, J., Raaf, J. L., Radeka, V., Rademacker, J., Radics, B., Raffaelli, F., Rafique, A., Raguzin, E., Rahaman, U., Rai, M., Rajagopalan, S., Rajaoalisoa, M., Rakhno, I., Rakotondravohitra, L., Ralte, L., Delgado, M. A. Ramirez, Ramson, B., Rappoldi, A., Raselli, G., Ratoff, P., Ray, R., Razafinime, H., Razakamiandra, R. F., Rea, E. M., Real, J. S., Rebel, B., Rechenmacher, R., Reichenbacher, J., Reitzner, S. D., Sfar, H. Rejeb, Renner, E., Renshaw, A., Rescia, S., Resnati, F., Restrepo, Diego, Reynolds, C., Ribas, M., Riboldi, S., Riccio, C., Riccobene, G., Ricol, J. S., Rigan, M., Rincón, E. V., Ritchie-Yates, A., Ritter, S., Rivera, D., Rivera, R., Robert, A., Rocha, J. L. Rocabado, Rochester, L., Roda, M., Rodrigues, P., Alonso, M. J. Rodriguez, Rondon, J. Rodriguez, Rosauro-Alcaraz, S., Rosier, P., Ross, D., Rossella, M., Rossi, M., Ross-Lonergan, M., Roy, N., Roy, P., Rubbia, C., Ruggeri, A., Ferreira, G. Ruiz, Russell, B., Ruterbories, D., Rybnikov, A., Sacerdoti, S., Saha, S., Sahoo, S. K., Sahu, N., Sala, P., Samios, N., Samoylov, O., Sanchez, M. C., Bravo, A. Sánchez, Sánchez-Castillo, A., Sanchez-Lucas, P., Sandberg, V., Sanders, D. A., Sanfilippo, S., Sankey, D., Santoro, D., Saoulidou, N., Sapienza, P., Sarasty, C., Sarcevic, I., Sarra, I., Savage, G., Savinov, V., Scanavini, G., Scaramelli, A., Scarff, A., Schefke, T., Schellman, H., Schifano, S., Schlabach, P., Schmitz, D., Schneider, A. W., Scholberg, K., Schukraft, A., Schuld, B., Segade, A., Segreto, E., Selyunin, A., Senadheera, D., Senise, C. R., Sensenig, J., Shaevitz, M. H., Shanahan, P., Sharma, P., Kumar, R., Poudel, S. Sharma, Shaw, K., Shaw, T., Shchablo, K., Shen, J., Shepherd-Themistocleous, C., Sheshukov, A., Shi, J., Shi, W., Shin, S., Shivakoti, S., Shoemaker, I., Shooltz, D., Shrock, R., Siddi, B., Siden, M., Silber, J., Simard, L., Sinclair, J., Sinev, G., Singh, Jaydip, Singh, J., Singh, L., Singh, P., Singh, V., Chauhan, S. Singh, Sipos, R., Sironneau, C., Sirri, G., Siyeon, K., Skarpaas, K., Smedley, J., Smith, E., Smith, J., Smith, P., Smolik, J., Smy, M., Snape, M., Snider, E. L., Snopok, P., Snowden-Ifft, D., Nunes, M. Soares, Sobel, H., Soderberg, M., Sokolov, S., Salinas, C. J. Solano, Söldner-Rembold, S., Solomey, N., Solovov, V., Sondheim, W. E., Sorel, M., Sotnikov, A., Soto-Oton, J., Sousa, A., Soustruznik, K., Spinella, F., Spitz, J., Spooner, N. J. C., Spurgeon, K., Stalder, D., Stancari, M., Stanco, L., Steenis, J., Stein, R., Steiner, H. M., Lisbôa, A. F. Steklain, Stepanova, A., Stewart, J., Stillwell, B., Stock, J., Stocker, F., Stokes, T., Strait, M., Strauss, T., Strigari, L., Stuart, A., Suarez, J. G., Subash, J., Surdo, A., Suter, L., Sutera, C. M., Sutton, K., Suvorov, Y., Svoboda, R., Swain, S. K., Szczerbinska, B., Szelc, A. M., Sztuc, A., Taffara, A., Talukdar, N., Tamara, J., Tanaka, H. A., Tang, S., Taniuchi, N., Casanova, A. M. Tapia, Oregui, B. Tapia, Tapper, A., Tariq, S., Tarpara, E., Tatar, E., Tayloe, R., Tedeschi, D., Teklu, A. M., Vidal, J. Tena, Tennessen, P., Tenti, M., Terao, K., Terranova, F., Testera, G., Thakore, T., Thea, A., Thomas, S., Thompson, A., Thorn, C., Timm, S. C., Tiras, E., Tishchenko, V., Tiwari, S., Todorović, N., Tomassetti, L., Tonazzo, A., Torbunov, D., Torti, M., Tortola, M., Tortorici, F., Tosi, N., Totani, D., Toups, M., Touramanis, C., Tran, D., Travaglini, R., Trevor, J., Triller, E., Trilov, S., Truchon, J., Truncali, D., Trzaska, W. H., Tsai, Y., Tsai, Y. -T., Tsamalaidze, Z., Tsang, K. V., Tsverava, N., Tu, S. Z., Tufanli, S., Tunnell, C., Turnberg, S., Turner, J., Tuzi, M., Tyler, J., Tyley, E., Tzanov, M., Uchida, M. A., González, J. Ureña, Urheim, J., Usher, T., Utaegbulam, H., Uzunyan, S., Vagins, M. R., Vahle, P., Valder, S., Valdiviesso, G. A., Valencia, E., Valentim, R., Vallari, Z., Vallazza, E., Valle, J. W. F., Van Berg, R., Van de Water, R. G., Forero, D. V., Vannozzi, A., Van Nuland-Troost, M., Varanini, F., Oliva, D. Vargas, Vasina, S., Vaughan, N., Vaziri, K., Vázquez-Ramos, A., Vega, J., Ventura, S., Verdugo, A., Vergani, S., Verzocchi, M., Vetter, K., Vicenzi, M., de Souza, H. Vieira, Vignoli, C., Vilela, C., Villa, E., Viola, S., Viren, B., Vizarreta, R., Hernandez, A. P. Vizcaya, Vuong, Q., Waldron, A. V., Wallbank, M., Walsh, J., Walton, T., Wang, H., Wang, J., Wang, L., Wang, M. H. L. S., Wang, X., Wang, Y., Warburton, K., Warner, D., Warsame, L., Wascko, M. O., Waters, D., Watson, A., Wawrowska, K., Weber, A., Weber, C. M., Weber, M., Wei, H., Weinstein, A., Westerdale, S., Wetstein, M., Whalen, K., White, A., Whitehead, L. H., Whittington, D., Wilhlemi, J., Wilking, M. J., Wilkinson, A., Wilkinson, C., Wilson, F., Wilson, R. J., Winter, P., Wisniewski, W., Wolcott, J., Wolfs, J., Wongjirad, T., Wood, A., Wood, K., Worcester, E., Worcester, M., Wospakrik, M., Wresilo, K., Wret, C., Wu, S., Wu, W., Wurm, M., Wyenberg, J., Xiao, Y., Xiotidis, I., Yaeggy, B., Yahlali, N., Yandel, E., Yang, J., Yang, K., Yang, T., Yankelevich, A., Yershov, N., Yonehara, K., Young, T., Yu, B., Yu, H., Yu, J., Yu, Y., Yuan, W., Zaki, R., Zalesak, J., Zambelli, L., Zamorano, B., Zani, A., Zapata, O., Zazueta, L., Zeller, G. P., Zennamo, J., Zeug, K., Zhang, C., Zhang, S., Zhao, M., Zhivun, E., Zimmerman, E. D., Zucchelli, S., Zuklin, J., Zutshi, V., and Zwaska, R.
- Subjects
Physics - Instrumentation and Detectors ,High Energy Physics - Experiment - Abstract
This paper introduces the hypothetical track-length fitting algorithm, a novel method for measuring the kinetic energies of ionizing particles in liquid argon time projection chambers (LArTPCs). The algorithm finds the most probable offset in track length for a track-like object by comparing the measured ionization density as a function of position with a theoretical prediction of the energy loss as a function of the energy, including models of electron recombination and detector response. The algorithm can be used to measure the energies of particles that interact before they stop, such as charged pions that are absorbed by argon nuclei. The algorithm's energy measurement resolutions and fractional biases are presented as functions of particle kinetic energy and number of track hits using samples of stopping secondary charged pions in data collected by the ProtoDUNE-SP detector, and also in a detailed simulation. Additional studies describe impact of the dE/dx model on energy measurement performance. The method described in this paper to characterize the energy measurement performance can be repeated in any LArTPC experiment using stopping secondary charged pions.
- Published
- 2024
29. Criticality and Safety Margins for Reinforcement Learning
- Author
-
Grushin, Alexander, Woods, Walt, Velasquez, Alvaro, and Khan, Simon
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Electrical Engineering and Systems Science - Systems and Control ,68T07 ,I.2.6 - Abstract
State of the art reinforcement learning methods sometimes encounter unsafe situations. Identifying when these situations occur is of interest both for post-hoc analysis and during deployment, where it might be advantageous to call out to a human overseer for help. Efforts to gauge the criticality of different points in time have been developed, but their accuracy is not well established due to a lack of ground truth, and they are not designed to be easily interpretable by end users. Therefore, we seek to define a criticality framework with both a quantifiable ground truth and a clear significance to users. We introduce true criticality as the expected drop in reward when an agent deviates from its policy for n consecutive random actions. We also introduce the concept of proxy criticality, a low-overhead metric that has a statistically monotonic relationship to true criticality. Safety margins make these interpretable, when defined as the number of random actions for which performance loss will not exceed some tolerance with high confidence. We demonstrate this approach in several environment-agent combinations; for an A3C agent in an Atari Beamrider environment, the lowest 5% of safety margins contain 47% of agent losses; i.e., supervising only 5% of decisions could potentially prevent roughly half of an agent's errors. This criticality framework measures the potential impacts of bad decisions, even before those decisions are made, allowing for more effective debugging and oversight of autonomous agents., Comment: 17 pages, 10 figures. This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible
- Published
- 2024
30. Capping effects on spin and charge excitations in parent and superconducting Nd1-xSrxNiO2
- Author
-
Fan, S., LaBollita, H., Gao, Q., Khan, N., Gu, Y., Kim, T., Li, J., Bhartiya, V., Li, Y., Sun, W., Yang, J., Yan, S., Barbour, A., Zhou, X., Cano, A., Bernardini, F., Nie, Y., Zhu, Z., Bisogni, V., Mazzoli, C., Botana, A. S., and Pelliciari, J.
- Subjects
Condensed Matter - Superconductivity ,Condensed Matter - Strongly Correlated Electrons - Abstract
Superconductivity in infinite layer nickelates Nd1-xSrxNiO2 has so far been achieved only in thin films raising questions on the role of substrates and interfaces. Given the challenges associated with their synthesis it is imperative to identify their intrinsic properties. We use Resonant Inelastic X-ray Scattering (RIXS) to investigate the influence of the SrTiO3 capping layer on the excitations of Nd1-xSrxNiO2 (x = 0 and 0.2). Spin excitations are observed in parent and 20% doped Nd1-xSrxNiO2 regardless of capping, proving that magnetism is intrinsic to infinite-layer nickelates and appears in a significant fraction of their phase diagram. In parent and superconducting Nd1-xSrxNiO2, the spin excitations are slightly hardened in capped samples compared to the non-capped ones. Additionally, a weaker Ni - Nd charge transfer peak at ~ 0.6 eV suggests that the hybridization between Ni 3d and Nd 5d orbitals is reduced in capped samples. From our data, capping induces only minimal differences in Nd1-xSrxNiO2 and we phenomenologically discuss these differences based on the reconstruction of the SrTiO3 - NdNiO2 interface and other mechanisms such as crystalline disorder., Comment: 9 pages, 6 figures
- Published
- 2024
31. Alchemical harmonic approximation based potential for all iso-electronic diatomics: Foundational baseline for $\Delta$-machine learning
- Author
-
Krug, Simon León, Khan, Danish, and von Lilienfeld, O. Anatole
- Subjects
Physics - Chemical Physics - Abstract
We introduce the alchemical harmonic approximation (AHA) of the absolute electronic energy for all charge-neutral iso-electronic diatomics at some fixed interatomic distance $d_0$. To account for variations in this distance, we combine AHA with the following Ansatz for the electronic binding potential, $E(d)=(E_{u}-E_s)\left(\frac{E_c-E_s}{E_u-E_s} \right)^{\sqrt{d/d_0}}+E_s$, where $E_u$, $E_c$, and $E_s$ correspond to the energies of the united atom, calibration at $d_0$, and sum of infinitely separated atoms, respectively. For any number of electrons, our model covers the entire two-dimensional electronic potential energy surface spanned by distance and difference in nuclear charge. Using data from pbe0/ccpvdz as reference, we present numerical evidence for all neutral diatomics with 8, 10, 12, 14 electrons. We assess the validity of our model by comparison to legacy potentials (Harm. osc., Lennard-Jones, Morse) within the most relevant range of binding (0.7 - 2.5 A), and find comparable accuracy if restricted to one diatomic, and significantly better when extrapolating to the entire iso-electronic series. We have also investigated $\Delta$-learning with our model as baseline. For any given iso-electronic charge neutral diatomic surface, this baseline results in a systematic improvement, effectively reducing training data for reaching chemical accuracy by up to an order of magnitude from $\sim1000$ to $\sim100$. By contrast and with respect to direct learning, using AHA+Morse as a baseline hardly leads to any improvement, and sometimes even deteriorates predictive power. Direct KRR-based extrapolation throughout chemical space converges to an error of $\sim$0.1 Ha when inferring the energy of unseen CO after training on all other iso-electronic diatomics. Our model as a baseline (calibrated to the energy of BF at $d_0 = 1.2$ A) lowers the error to $\sim$0.04 Ha.
- Published
- 2024
32. HazeSpace2M: A Dataset for Haze Aware Single Image Dehazing
- Author
-
Islam, Md Tanvir, Rahim, Nasir, Anwar, Saeed, Saqib, Muhammad, Bakshi, Sambit, and Muhammad, Khan
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,I.4.3 - Abstract
Reducing the atmospheric haze and enhancing image clarity is crucial for computer vision applications. The lack of real-life hazy ground truth images necessitates synthetic datasets, which often lack diverse haze types, impeding effective haze type classification and dehazing algorithm selection. This research introduces the HazeSpace2M dataset, a collection of over 2 million images designed to enhance dehazing through haze type classification. HazeSpace2M includes diverse scenes with 10 haze intensity levels, featuring Fog, Cloud, and Environmental Haze (EH). Using the dataset, we introduce a technique of haze type classification followed by specialized dehazers to clear hazy images. Unlike conventional methods, our approach classifies haze types before applying type-specific dehazing, improving clarity in real-life hazy images. Benchmarking with state-of-the-art (SOTA) models, ResNet50 and AlexNet achieve 92.75\% and 92.50\% accuracy, respectively, against existing synthetic datasets. However, these models achieve only 80% and 70% accuracy, respectively, against our Real Hazy Testset (RHT), highlighting the challenging nature of our HazeSpace2M dataset. Additional experiments show that haze type classification followed by specialized dehazing improves results by 2.41% in PSNR, 17.14% in SSIM, and 10.2\% in MSE over general dehazers. Moreover, when testing with SOTA dehazing models, we found that applying our proposed framework significantly improves their performance. These results underscore the significance of HazeSpace2M and our proposed framework in addressing atmospheric haze in multimedia processing. Complete code and dataset is available on \href{https://github.com/tanvirnwu/HazeSpace2M} {\textcolor{blue}{\textbf{GitHub}}}., Comment: Accepted by ACM Multimedia 2024
- Published
- 2024
- Full Text
- View/download PDF
33. Exceptional Reduction of Electrical Resistivity in Ultrathin Non-Crystalline NbP Semimetal
- Author
-
Khan, Asir Intisar, Ramdas, Akash, Lindgren, Emily, Kim, Hyun-Mi, Won, Byoungjun, Wu, Xiangjin, Saraswat, Krishna, Chen, Ching-Tzu, Suzuki, Yuri, da Jornada, Felipe H., Oh, Il-Kwon, and Pop, Eric
- Subjects
Condensed Matter - Materials Science ,Condensed Matter - Mesoscale and Nanoscale Physics - Abstract
The electrical resistivity of conventional metals, such as copper, is known to increase in thinner films due to electron-surface scattering, limiting the performance of metals in nanoscale electronics. Here, we uncover an exceptional reduction of resistivity with decreasing film thickness in NbP semimetal, deposited at relatively low temperatures of 400 {\deg}C. In sub-5 nm thin films, we find a significantly lower resistivity (~34 uOhm.cm for 1.5 nm thin NbP, at room temperature) than in the bulk form, and lower than conventional metals at similar thickness. Remarkably, the NbP films are not crystalline, but display local nanocrystalline, short-range order within an amorphous matrix. Our analysis suggests that the lower resistivity is due to conduction through surface channels, together with high surface carrier density and sufficiently good mobility, as the film thickness is reduced. These results and the fundamental insights obtained here could enable ultrathin, low-resistivity wires for nanoelectronics, beyond the limitations of conventional metals.
- Published
- 2024
34. Polarized and unpolarized gluon PDFs: generative machine learning applications for lattice QCD matrix elements at short distance and large momentum
- Author
-
Chowdhury, Talal Ahmed, Izubuchi, Taku, Kamruzzaman, Methun, Karthik, Nikhil, Khan, Tanjib, Liu, Tianbo, Paul, Arpon, Schoenleber, Jakob, and Sufian, Raza Sabbir
- Subjects
High Energy Physics - Lattice ,High Energy Physics - Phenomenology ,Nuclear Theory - Abstract
Lattice quantum chromodynamics (QCD) calculations share a defining challenge by requiring a small finite range of spatial separation $z$ between quark/gluon bilinears for controllable power corrections in the perturbative QCD factorization, and a large hadron boost $p_z$ for a successful determination of collinear parton distribution functions (PDFs). However, these two requirements make the determination of PDFs from lattice data very challenging. We present the application of generative machine learning algorithms to estimate the polarized and unpolarized gluon correlation functions utilizing short-distance data and extending the correlation up to $zp_z \lesssim 14$, surpassing the current capabilities of lattice QCD calculations. We train physics-informed machine learning algorithms to learn from the short-distance correlation at $z\lesssim 0.36$ fm and take the limit, $p_z \to \infty$, thereby minimizing possible contamination from the higher-twist effects for a successful reconstruction of the polarized gluon PDF. We also expose the bias and problems with underestimating uncertainties associated with the use of model-dependent and overly constrained functional forms, such as $x^\alpha(1-x)^\beta$ and its variants to extract PDFs from the lattice data. We propose the use of generative machine learning algorithms to mitigate these issues and present our determination of the polarized and unpolarized gluon PDFs in the nucleon., Comment: 24 pages, 18 figures
- Published
- 2024
35. Text2CAD: Generating Sequential CAD Models from Beginner-to-Expert Level Text Prompts
- Author
-
Khan, Mohammad Sadil, Sinha, Sankalp, Sheikh, Talha Uddin, Stricker, Didier, Ali, Sk Aziz, and Afzal, Muhammad Zeshan
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Graphics - Abstract
Prototyping complex computer-aided design (CAD) models in modern softwares can be very time-consuming. This is due to the lack of intelligent systems that can quickly generate simpler intermediate parts. We propose Text2CAD, the first AI framework for generating text-to-parametric CAD models using designer-friendly instructions for all skill levels. Furthermore, we introduce a data annotation pipeline for generating text prompts based on natural language instructions for the DeepCAD dataset using Mistral and LLaVA-NeXT. The dataset contains $\sim170$K models and $\sim660$K text annotations, from abstract CAD descriptions (e.g., generate two concentric cylinders) to detailed specifications (e.g., draw two circles with center $(x,y)$ and radius $r_{1}$, $r_{2}$, and extrude along the normal by $d$...). Within the Text2CAD framework, we propose an end-to-end transformer-based auto-regressive network to generate parametric CAD models from input texts. We evaluate the performance of our model through a mixture of metrics, including visual quality, parametric precision, and geometrical accuracy. Our proposed framework shows great potential in AI-aided design applications. Our source code and annotations will be publicly available., Comment: Accepted in NeurIPS 2024 (Spotlight)
- Published
- 2024
36. A Novel MOSFET based Single Event Latchup Detection, Current Limiting & Self Power Cycling circuit for Spacecraft systems
- Author
-
Pandey, Ishan, Gupta, Kinshuk, Kumar, Vinod, Khan, A. R., and Kamat, Sandhya V.
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
Single Event Latch-up (SEL) is one of the prime concerns for CMOS ICs used in space systems. Galactic Cosmic Rays or Solar Energetic Particles (SEP) may trigger the parasitic latch up circuit in CMOS ICs and cause increase in current beyond the safe limits thereby presenting a threat of permanent failure of the IC. Mitigation of the SEL is always a challenging task. The conventional mitigation approaches inherently introduce some response time which presents an uncertainty because during this response time the current may exceed the safe current limits. This paper presents a novel circuit based on MOSFETs which provides end-to-end complete solution of detecting SEL, limiting the current below the set threshold and executing power cycling to restore the normal functioning of the CMOS IC. The proposed circuit has been simulated in MULTISIM and the simulation results match very well with the expected behavior of (i)current limiting and (ii) the total time duration taken in power cycling to bring the SEL sensitive device back to its normal operational state. This circuit can be harnessed by spacecraft system designers to overcome the catastrophic threat of SEL posed by space radiation environment.
- Published
- 2024
37. Automated Surgical Skill Assessment in Endoscopic Pituitary Surgery using Real-time Instrument Tracking on a High-fidelity Bench-top Phantom
- Author
-
Das, Adrito, Sidiqi, Bilal, Mennillo, Laurent, Mao, Zhehua, Brudfors, Mikael, Xochicale, Miguel, Khan, Danyal Z., Newall, Nicola, Hanrahan, John G., Clarkson, Matthew J., Stoyanov, Danail, Marcus, Hani J., and Bano, Sophia
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Computer Science - Computer Vision and Pattern Recognition - Abstract
Improved surgical skill is generally associated with improved patient outcomes, although assessment is subjective; labour-intensive; and requires domain specific expertise. Automated data driven metrics can alleviate these difficulties, as demonstrated by existing machine learning instrument tracking models in minimally invasive surgery. However, these models have been tested on limited datasets of laparoscopic surgery, with a focus on isolated tasks and robotic surgery. In this paper, a new public dataset is introduced, focusing on simulated surgery, using the nasal phase of endoscopic pituitary surgery as an exemplar. Simulated surgery allows for a realistic yet repeatable environment, meaning the insights gained from automated assessment can be used by novice surgeons to hone their skills on the simulator before moving to real surgery. PRINTNet (Pituitary Real-time INstrument Tracking Network) has been created as a baseline model for this automated assessment. Consisting of DeepLabV3 for classification and segmentation; StrongSORT for tracking; and the NVIDIA Holoscan SDK for real-time performance, PRINTNet achieved 71.9% Multiple Object Tracking Precision running at 22 Frames Per Second. Using this tracking output, a Multilayer Perceptron achieved 87% accuracy in predicting surgical skill level (novice or expert), with the "ratio of total procedure time to instrument visible time" correlated with higher surgical skill. This therefore demonstrates the feasibility of automated surgical skill assessment in simulated endoscopic pituitary surgery. The new publicly available dataset can be found here: https://doi.org/10.5522/04/26511049., Comment: 7 pages, 6 figures
- Published
- 2024
38. PitRSDNet: Predicting Intra-operative Remaining Surgery Duration in Endoscopic Pituitary Surgery
- Author
-
Wijekoon, Anjana, Das, Adrito, Herrera, Roxana R., Khan, Danyal Z., Hanrahan, John, Carter, Eleanor, Luoma, Valpuri, Stoyanov, Danail, Marcus, Hani J., and Bano, Sophia
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Machine Learning - Abstract
Accurate intra-operative Remaining Surgery Duration (RSD) predictions allow for anaesthetists to more accurately decide when to administer anaesthetic agents and drugs, as well as to notify hospital staff to send in the next patient. Therefore RSD plays an important role in improving patient care and minimising surgical theatre costs via efficient scheduling. In endoscopic pituitary surgery, it is uniquely challenging due to variable workflow sequences with a selection of optional steps contributing to high variability in surgery duration. This paper presents PitRSDNet for predicting RSD during pituitary surgery, a spatio-temporal neural network model that learns from historical data focusing on workflow sequences. PitRSDNet integrates workflow knowledge into RSD prediction in two forms: 1) multi-task learning for concurrently predicting step and RSD; and 2) incorporating prior steps as context in temporal learning and inference. PitRSDNet is trained and evaluated on a new endoscopic pituitary surgery dataset with 88 videos to show competitive performance improvements over previous statistical and machine learning methods. The findings also highlight how PitRSDNet improve RSD precision on outlier cases utilising the knowledge of prior steps., Comment: Accepted to the Augmented Environments for Computer-Assisted Interventions (AE-CAI) Workshop at the Medical Image Computing and Computer-Assisted Interventions (MICCAI) Conference 2024
- Published
- 2024
39. Transformer based time series prediction of the maximum power point for solar photovoltaic cells
- Author
-
Agrawal, Palaash, Bansal, Hari Om, Gautam, Aditya R., Mahela, Om Prakash, and Khan, Baseem
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Computer Science - Machine Learning - Abstract
This paper proposes an improved deep learning based maximum power point tracking (MPPT) in solar photovoltaic cells considering various time series based environmental inputs. Generally, artificial neural network based MPPT algorithms use basic neural network architectures and inputs which do not represent the ambient conditions in a comprehensive manner. In this article, the ambient conditions of a location are represented through a comprehensive set of environmental features. Furthermore, the inclusion of time based features in the input data is considered to model cyclic patterns temporally within the atmospheric conditions leading to robust modeling of the MPPT algorithm. A transformer based deep learning architecture is trained as a time series prediction model using multidimensional time series input features. The model is trained on a dataset containing typical meteorological year data points of ambient weather conditions from 50 locations. The attention mechanism in the transformer modules allows the model to learn temporal patterns in the data efficiently. The proposed model achieves a 0.47% mean average percentage error of prediction on non zero operating voltage points in a test dataset consisting of data collected over a period of 200 consecutive hours resulting in the average power efficiency of 99.54% and peak power efficiency of 99.98%. The proposed model is validated through real time simulations. The proposed model performs power point tracking in a robust, dynamic, and nonlatent manner, over a wide range of atmospheric conditions., Comment: Published June 2022, in Energy Science and Engineering, Volume10, Issue9, Pages 3397-3410
- Published
- 2024
- Full Text
- View/download PDF
40. Eavesdropping on the BB84 Protocol using Phase-Covariant Cloning: Experimental Results
- Author
-
Pigott, Brian, Campolongo, Elizabeth, Routray, Hardik, and Khan, Alex
- Subjects
Quantum Physics - Abstract
Though the BB84 protocol has provable security over a noiseless quantum channel, the security is not proven over current noisy technology. The level of tolerable error on such systems is still unclear, as is how much information about a raw key may be obtained by an eavesdropper. We develop a reproducible test to determine the security--or lack thereof--of the protocol in practice. This enables us to obtain an experimental estimate of the information that can be obtained using asymmetric phase-covariant cloning to eavesdrop on the BB84 protocol.
- Published
- 2024
41. OpenFMR: A low-cost open-source broadband ferromagnetic resonance spectrometer
- Author
-
Meinert, Markus, Schneider, Tiago de Oliveira, Sharma, Shalini, and Khan, Amir
- Subjects
Condensed Matter - Materials Science ,Physics - Instrumentation and Detectors - Abstract
We describe a broadband ferromagnetic resonance spectrometer for scientific and educational applications with a frequency range up to 30 GHz. It is built with low-cost components available off-the-shelf and utilizes 3D printed parts for sample holders and support structures, and requires little assembly. A PCB design for the grounded coplanar waveguide (GCPW) is presented and analysed. We further include a software suite for command-line or script driven data acqusition, a graphical user interface, and a graphical data analysis program. The capabilities of the system design are demonstrated with measurements on ferromagnetic thin films with a thickness of 1 nm. All designs and scripts are published under the GNU GPL v3.0 license., Comment: 7 pages, 7 figures
- Published
- 2024
42. Computational Pathology for Accurate Prediction of Breast Cancer Recurrence: Development and Validation of a Deep Learning-based Tool
- Author
-
Su, Ziyu, Guo, Yongxin, Wesolowski, Robert, Tozbikian, Gary, O'Connell, Nathaniel S., Niazi, M. Khalid Khan, and Gurcan, Metin N.
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Computer Science - Artificial Intelligence ,Quantitative Biology - Quantitative Methods - Abstract
Accurate recurrence risk stratification is crucial for optimizing treatment plans for breast cancer patients. Current prognostic tools like Oncotype DX (ODX) offer valuable genomic insights for HR+/HER2- patients but are limited by cost and accessibility, particularly in underserved populations. In this study, we present Deep-BCR-Auto, a deep learning-based computational pathology approach that predicts breast cancer recurrence risk from routine H&E-stained whole slide images (WSIs). Our methodology was validated on two independent cohorts: the TCGA-BRCA dataset and an in-house dataset from The Ohio State University (OSU). Deep-BCR-Auto demonstrated robust performance in stratifying patients into low- and high-recurrence risk categories. On the TCGA-BRCA dataset, the model achieved an area under the receiver operating characteristic curve (AUROC) of 0.827, significantly outperforming existing weakly supervised models (p=0.041). In the independent OSU dataset, Deep-BCR-Auto maintained strong generalizability, achieving an AUROC of 0.832, along with 82.0% accuracy, 85.0% specificity, and 67.7% sensitivity. These findings highlight the potential of computational pathology as a cost-effective alternative for recurrence risk assessment, broadening access to personalized treatment strategies. This study underscores the clinical utility of integrating deep learning-based computational pathology into routine pathological assessment for breast cancer prognosis across diverse clinical settings.
- Published
- 2024
43. Beyond Fine-tuning: Unleashing the Potential of Continuous Pretraining for Clinical LLMs
- Author
-
Christophe, Clément, Raha, Tathagata, Maslenkova, Svetlana, Salman, Muhammad Umar, Kanithi, Praveen K, Pimentel, Marco AF, and Khan, Shadab
- Subjects
Computer Science - Computation and Language - Abstract
Large Language Models (LLMs) have demonstrated significant potential in transforming clinical applications. In this study, we investigate the efficacy of four techniques in adapting LLMs for clinical use-cases: continuous pretraining, instruct fine-tuning, NEFTune, and prompt engineering. We employ these methods on Mistral 7B and Mixtral 8x7B models, leveraging a large-scale clinical pretraining dataset of 50 billion tokens and an instruct fine-tuning dataset of 500 million tokens. Our evaluation across various clinical tasks reveals the impact of each technique. While continuous pretraining beyond 250 billion tokens yields marginal improvements on its own, it establishes a strong foundation for instruct fine-tuning. Notably, NEFTune, designed primarily to enhance generation quality, surprisingly demonstrates additional gains on our benchmark. Complex prompt engineering methods further enhance performance. These findings show the importance of tailoring fine-tuning strategies and exploring innovative techniques to optimize LLM performance in the clinical domain.
- Published
- 2024
44. Predicting Coronary Heart Disease Using a Suite of Machine Learning Models
- Author
-
Al-Karaki, Jamal, Ilono, Philip, Baweja, Sanchit, Naghiyev, Jalal, Yadav, Raja Singh, and Khan, Muhammad Al-Zafar
- Subjects
Computer Science - Artificial Intelligence - Abstract
Coronary Heart Disease affects millions of people worldwide and is a well-studied area of healthcare. There are many viable and accurate methods for the diagnosis and prediction of heart disease, but they have limiting points such as invasiveness, late detection, or cost. Supervised learning via machine learning algorithms presents a low-cost (computationally speaking), non-invasive solution that can be a precursor for early diagnosis. In this study, we applied several well-known methods and benchmarked their performance against each other. It was found that Random Forest with oversampling of the predictor variable produced the highest accuracy of 84%., Comment: 14 pages, 3 figures, 2 tables
- Published
- 2024
45. BRep Boundary and Junction Detection for CAD Reverse Engineering
- Author
-
Ali, Sk Aziz, Khan, Mohammad Sadil, and Stricker, Didier
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Machine Learning ,Computer Science - Multimedia - Abstract
In machining process, 3D reverse engineering of the mechanical system is an integral, highly important, and yet time consuming step to obtain parametric CAD models from 3D scans. Therefore, deep learning-based Scan-to-CAD modeling can offer designers enormous editability to quickly modify CAD model, being able to parse all its structural compositions and design steps. In this paper, we propose a supervised boundary representation (BRep) detection network BRepDetNet from 3D scans of CC3D and ABC dataset. We have carefully annotated the 50K and 45K scans of both the datasets with appropriate topological relations (e.g., next, mate, previous) between the geometrical primitives (i.e., boundaries, junctions, loops, faces) of their BRep data structures. The proposed solution decomposes the Scan-to-CAD problem in Scan-to-BRep ensuring the right step towards feature-based modeling, and therefore, leveraging other existing BRep-to-CAD modeling methods. Our proposed Scan-to-BRep neural network learns to detect BRep boundaries and junctions by minimizing focal-loss and non-maximal suppression (NMS) during training time. Experimental results show that our BRepDetNet with NMS-Loss achieves impressive results., Comment: 6 pages, 5 figures
- Published
- 2024
- Full Text
- View/download PDF
46. Evaluating Optimal Safe Flows Decomposition for RNA Assembly
- Author
-
Ahmed, Bashar, Rana, Siddharth Singh, Ujjwal, and Khan, Shahbaz
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
In Bioinformatics, the applications of flow decomposition in directed acyclic graphs are highlighted in RNA Assembly problem. However, it admits multiple solutions where exactly one solution correctly represents the underlying transcripts. The problem was addressed by Safe and Complete framework~[RECOMB16], which reports all the parts of the solution that are present in every possible solution. Khan et al.~[RECOMB22] first studied flow decomposition in the safe and complete framework. Their algorithm showed superior performance ($\approx20\%$) over the popular heuristic (greedy-width) on sufficiently complex graphs for a unified metric of precision and coverage (F-score). They presented the solution in multiple representations using simple but suboptimal algorithms, which were later optimized by Khan and Tomescu~[ESA22], who also presented an optimal representation. In this paper, we evaluate the practical significance of the optimal algorithms by Khan and Tomescu~[ESA22]. Our work highlights the significance of the theoretically optimal algorithms improving time (up to $60-70\%$) and memory (up to $76-85\%$), and the optimal representations improving output size (up to $135-170\%$) significantly. However, the impact of optimal algorithms was limited due to a large number of extremely short safe paths. We propose heuristics to improve these representations further, resulting in further improvement in time (up to $10\%$) and output size ($10-25\%$). However, in absolute terms, these improvements were limited to a few seconds on real datasets involved due to the smaller size of the graphs. We thus generated large random graphs, to demonstrate the scalability of the above results. The older algorithms [RECOMB22] were not practical on moderately large graphs ($\geq 1M$ nodes), while optimal algorithms [ESA22] were linearly scalable for much larger graphs ($\geq 100M$ nodes).
- Published
- 2024
47. Language Models Learn to Mislead Humans via RLHF
- Author
-
Wen, Jiaxin, Zhong, Ruiqi, Khan, Akbir, Perez, Ethan, Steinhardt, Jacob, Huang, Minlie, Bowman, Samuel R., He, He, and Feng, Shi
- Subjects
Computer Science - Computation and Language - Abstract
Language models (LMs) can produce errors that are hard to detect for humans, especially when the task is complex. RLHF, the most popular post-training method, may exacerbate this problem: to achieve higher rewards, LMs might get better at convincing humans that they are right even when they are wrong. We study this phenomenon under a standard RLHF pipeline, calling it "U-SOPHISTRY" since it is Unintended by model developers. Specifically, we ask time-constrained (e.g., 3-10 minutes) human subjects to evaluate the correctness of model outputs and calculate humans' accuracy against gold labels. On a question-answering task (QuALITY) and programming task (APPS), RLHF makes LMs better at convincing our subjects but not at completing the task correctly. RLHF also makes the model harder to evaluate: our subjects' false positive rate increases by 24.1% on QuALITY and 18.3% on APPS. Finally, we show that probing, a state-of-the-art approach for detecting Intended Sophistry (e.g. backdoored LMs), does not generalize to U-SOPHISTRY. Our results highlight an important failure mode of RLHF and call for more research in assisting humans to align them.
- Published
- 2024
48. Ground states of strongly-correlated materials on quantum computers using ab initio downfolding
- Author
-
Alvertis, Antonios M., Khan, Abid, and Tubman, Norm M.
- Subjects
Quantum Physics ,Condensed Matter - Strongly Correlated Electrons - Abstract
The accurate first-principles description of strongly-correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving accurate many-body Hamiltonians including strong correlations, representing a subspace of interest of a material, using density functional theory calculations as a starting point. However, the solution of these material-specific models can scale exponentially on classical computers, constituting a challenge. Here we propose that utilizing quantum computers for obtaining the properties of downfolded Hamiltonians yields an accurate description of the ground state properties of strongly-correlated systems, while circumventing the exponential scaling problem. We demonstrate this for diverse strongly-correlated materials by combining ab initio downfolding and variational quantum eigensolvers, correctly predicting the antiferromagnetic state of one-dimensional cuprate $\text{Ca}_2\text{CuO}_3$, the excitonic ground state of monolayer $\text{WTe}_2$, and the charge-ordered state of correlated metal $\text{SrVO}_3$. By utilizing a classical tensor network implementation of variational quantum eigensolvers we are able to simulate large models with up to $54$ qubits and encompassing up to four bands in the correlated subspace, which is indicative of the complexity that our framework can address.
- Published
- 2024
49. An Explainable Machine Learning Approach to Traffic Accident Fatality Prediction
- Author
-
Rifat, Md. Asif Khan, Kabir, Ahmedul, and Huq, Armana Sabiha
- Subjects
Computer Science - Machine Learning - Abstract
Road traffic accidents (RTA) pose a significant public health threat worldwide, leading to considerable loss of life and economic burdens. This is particularly acute in developing countries like Bangladesh. Building reliable models to forecast crash outcomes is crucial for implementing effective preventive measures. To aid in developing targeted safety interventions, this study presents a machine learning-based approach for classifying fatal and non-fatal road accident outcomes using data from the Dhaka metropolitan traffic crash database from 2017 to 2022. Our framework utilizes a range of machine learning classification algorithms, comprising Logistic Regression, Support Vector Machines, Naive Bayes, Random Forest, Decision Tree, Gradient Boosting, LightGBM, and Artificial Neural Network. We prioritize model interpretability by employing the SHAP (SHapley Additive exPlanations) method, which elucidates the key factors influencing accident fatality. Our results demonstrate that LightGBM outperforms other models, achieving a ROC-AUC score of 0.72. The global, local, and feature dependency analyses are conducted to acquire deeper insights into the behavior of the model. SHAP analysis reveals that casualty class, time of accident, location, vehicle type, and road type play pivotal roles in determining fatality risk. These findings offer valuable insights for policymakers and road safety practitioners in developing countries, enabling the implementation of evidence-based strategies to reduce traffic crash fatalities., Comment: 10 Pages, 6 figures, 2 tables, 28th International Conference on Knowledge-Based and Intelligent Information & Engineering Systems (KES 2024)
- Published
- 2024
50. RaggeDi: Diffusion-based State Estimation of Disordered Rags, Sheets, Towels and Blankets
- Author
-
Ye, Jikai, Li, Wanze, Khan, Shiraz, and Chirikjian, Gregory S.
- Subjects
Computer Science - Robotics ,Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Machine Learning - Abstract
Cloth state estimation is an important problem in robotics. It is essential for the robot to know the accurate state to manipulate cloth and execute tasks such as robotic dressing, stitching, and covering/uncovering human beings. However, estimating cloth state accurately remains challenging due to its high flexibility and self-occlusion. This paper proposes a diffusion model-based pipeline that formulates the cloth state estimation as an image generation problem by representing the cloth state as an RGB image that describes the point-wise translation (translation map) between a pre-defined flattened mesh and the deformed mesh in a canonical space. Then we train a conditional diffusion-based image generation model to predict the translation map based on an observation. Experiments are conducted in both simulation and the real world to validate the performance of our method. Results indicate that our method outperforms two recent methods in both accuracy and speed.
- Published
- 2024
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.