Search

This study investigates thermal transport across nanocrystalline diamond/AlGaN interfaces, crucial for enhancing thermal management in AlGaN/AlGaN-based devices. Chemical vapor deposition growth of diamond directly on AlGaN resulted in a disordered interface with a high thermal boundary resistance (TBR) of 20.6 m^2-K/GW. We employed sputtered carbide interlayers (e.g., $B_4C$, $SiC$, $B_4C/SiC$) to reduce thermal boundary resistance in diamond/AlGaN interfaces. The carbide interlayers resulted in record-low thermal boundary resistance values of 3.4 and 3.7 m^2-K/GW for Al$_{0.65}$Ga$_{0.35}$N samples with $B_4C$ and $SiC$ interlayers, respectively. STEM imaging of the interface reveals interlayer thicknesses between 1.7-2.5 nm, with an amorphous structure. Additionally, Fast-Fourier Transform (FFT) characterization of sections of the STEM images displayed sharp crystalline fringes in the AlGaN layer, confirming it was properly protected from damage from hydrogen plasma during the diamond growth. In order to accurately measure the thermal boundary resistance we develop a hybrid technique, combining time-domain thermoreflectance and steady-state thermoreflectance fitting, offering superior sensitivity to buried thermal resistances. Our findings underscore the efficacy of interlayer engineering in enhancing thermal transport and demonstrate the importance of innovative measurement techniques in accurately characterizing complex thermal interfaces. This study provides a foundation for future research in improving thermal properties of semiconductor devices through interface engineering and advanced measurement methodologies.

A recent research trend involves treating database index structures as Machine Learning (ML) models. In this domain, single or multiple ML models are trained to learn the mapping from keys to positions inside a data set. This class of indexes is known as "Learned Indexes." Learned indexes have demonstrated improved search performance and reduced space requirements for one-dimensional data. The concept of one-dimensional learned indexes has naturally been extended to multi-dimensional (e.g., spatial) data, leading to the development of "Learned Multi-dimensional Indexes". This survey focuses on learned multi-dimensional index structures. Specifically, it reviews the current state of this research area, explains the core concepts behind each proposed method, and classifies these methods based on several well-defined criteria. We present a taxonomy that classifies and categorizes each learned multi-dimensional index, and survey the existing literature on learned multi-dimensional indexes according to this taxonomy. Additionally, we present a timeline to illustrate the evolution of research on learned indexes. Finally, we highlight several open challenges and future research directions in this emerging and highly active field.

The Center for Disease Control estimates that over 37 million US adults suffer from chronic kidney disease (CKD), yet 9 out of 10 of these individuals are unaware of their condition due to the absence of symptoms in the early stages. It has a significant impact on patients' quality of life, particularly when it progresses to the need for dialysis. Early prediction of dialysis is crucial as it can significantly improve patient outcomes and assist healthcare providers in making timely and informed decisions. However, developing an effective machine learning (ML)-based Clinical Decision Support System (CDSS) for early dialysis prediction poses a key challenge due to the imbalanced nature of data. To address this challenge, this study evaluates various data augmentation techniques to understand their effectiveness on real-world datasets. We propose a new approach named Binary Gaussian Copula Synthesis (BGCS). BGCS is tailored for binary medical datasets and excels in generating synthetic minority data that mirrors the distribution of the original data. BGCS enhances early dialysis prediction by outperforming traditional methods in detecting dialysis patients. For the best ML model, Random Forest, BCGS achieved a 72% improvement, surpassing the state-of-the-art augmentation approaches. Also, we present a ML-based CDSS, designed to aid clinicians in making informed decisions. CDSS, which utilizes decision tree models, is developed to improve patient outcomes, identify critical variables, and thereby enable clinicians to make proactive decisions, and strategize treatment plans effectively for CKD patients who are more likely to require dialysis in the near future. Through comprehensive feature analysis and meticulous data preparation, we ensure that the CDSS's dialysis predictions are not only accurate but also actionable, providing a valuable tool in the management and treatment of CKD.

This study developed a generative adversarial network (GAN)-based defense method for traffic sign classification in an autonomous vehicle (AV), referred to as the attack-resilient GAN (AR-GAN). The novelty of the AR-GAN lies in (i) assuming zero knowledge of adversarial attack models and samples and (ii) providing consistently high traffic sign classification performance under various adversarial attack types. The AR-GAN classification system consists of a generator that denoises an image by reconstruction, and a classifier that classifies the reconstructed image. The authors have tested the AR-GAN under no-attack and under various adversarial attacks, such as Fast Gradient Sign Method (FGSM), DeepFool, Carlini and Wagner (C&W), and Projected Gradient Descent (PGD). The authors considered two forms of these attacks, i.e., (i) black-box attacks (assuming the attackers possess no prior knowledge of the classifier), and (ii) white-box attacks (assuming the attackers possess full knowledge of the classifier). The classification performance of the AR-GAN was compared with several benchmark adversarial defense methods. The results showed that both the AR-GAN and the benchmark defense methods are resilient against black-box attacks and could achieve similar classification performance to that of the unperturbed images. However, for all the white-box attacks considered in this study, the AR-GAN method outperformed the benchmark defense methods. In addition, the AR-GAN was able to maintain its high classification performance under varied white-box adversarial perturbation magnitudes, whereas the performance of the other defense methods dropped abruptly at increased perturbation magnitudes.

We are concerned with a novel Bayesian statistical framework for the characterization of natural subsurface formations, a very challenging task. Because of the large dimension of the stochastic space of the prior distribution in the framework, typically a dimensional reduction method, such as a Karhunen-Leove expansion (KLE), needs to be applied to the prior distribution to make the characterization computationally tractable. Due to the large variability of properties of subsurface formations (such as permeability and porosity) it may be of value to localize the sampling strategy so that it can better adapt to large local variability of rock properties. In this paper, we introduce the concept of multiscale sampling to localize the search in the stochastic space. We combine the simplicity of a preconditioned Markov Chain Monte Carlo method with a new algorithm to decompose the stochastic space into orthogonal subspaces, through a one-to-one mapping of the subspaces to subdomains of a non-overlapping domain decomposition of the region of interest. The localization of the search is performed by a multiscale blocking strategy within Gibbs sampling: we apply a KL expansion locally, at the subdomain level. Within each subdomain, blocking is applied again, for the sampling of the KLE random coefficients. The effectiveness of the proposed framework is tested in the solution of inverse problems related to elliptic partial differential equations arising in porous media flows. We use multi-chain studies in a multi-GPU cluster to show that the new algorithm clearly improves the convergence rate of the preconditioned MCMC method. Moreover, we illustrate the importance of a few conditioning points to further improve the convergence of the proposed method.

This paper presents an effective few-shot point cloud semantic segmentation approach for real-world applications. Existing few-shot segmentation methods on point cloud heavily rely on the fully-supervised pretrain with large annotated datasets, which causes the learned feature extraction bias to those pretrained classes. However, as the purpose of few-shot learning is to handle unknown/unseen classes, such class-specific feature extraction in pretrain is not ideal to generalize into new classes for few-shot learning. Moreover, point cloud datasets hardly have a large number of classes due to the annotation difficulty. To address these issues, we propose a contrastive self-supervision framework for few-shot learning pretrain, which aims to eliminate the feature extraction bias through class-agnostic contrastive supervision. Specifically, we implement a novel contrastive learning approach with a learnable augmentor for a 3D point cloud to achieve point-wise differentiation, so that to enhance the pretrain with managed overfitting through the self-supervision. Furthermore, we develop a multi-resolution attention module using both the nearest and farthest points to extract the local and global point information more effectively, and a center-concentrated multi-prototype is adopted to mitigate the intra-class sparsity. Comprehensive experiments are conducted to evaluate the proposed approach, which shows our approach achieves state-of-the-art performance. Moreover, a case study on practical CAM/CAD segmentation is presented to demonstrate the effectiveness of our approach for real-world applications., Comment: ICRA 2023

Prescription medications often impose temporal constraints on regular health behaviors (RHBs) of patients, e.g., eating before taking medication. Violations of such medical temporal constraints (MTCs) can result in adverse effects. Detecting and predicting such violations before they occur can help alert the patient. We formulate the problem of modeling MTCs and develop a proof-of-concept solution, ActSafe, to predict violations of MTCs well ahead of time. ActSafe utilizes a context-free grammar based approach for extracting and mapping MTCs from patient education materials. It also addresses the challenges of accurately predicting RHBs central to MTCs (e.g., medication intake). Our novel behavior prediction model, HERBERT , utilizes a basis vectorization of time series that is generalizable across temporal scale and duration of behaviors, explicitly capturing the dependency between temporally collocated behaviors. Based on evaluation using a real-world RHB dataset collected from 28 patients in uncontrolled environments, HERBERT outperforms baseline models with an average of 51% reduction in root mean square error. Based on an evaluation involving patients with chronic conditions, ActSafe can predict MTC violations a day ahead of time with an average F1 score of 0.86.

An economic zone requires continuous monitoring and controlling by an autonomous surveillance system for heightening its production competency and security. Wireless sensor network (WSN) has swiftly grown popularity over the world for uninterruptedly monitoring and controlling a system. Sensor devices, the main elements of WSN, are given limited amount of energy, which leads the network to limited lifespan. Therefore, the most significant challenge is to increase the lifespan of a WSN system. Topology control mechanism (TCM) is a renowned method to enhance the lifespan of WSN. This paper proposes an approach to extend the lifetime of WSN for an economic area, targeting an economic zone in Bangladesh. Observations are made on the performance of the network lifetime considering the individual combinations of the TCM protocols and comparative investigation between the time and energy triggering strategy of TCM protocols. Results reveal the network makes a better performance in the case of A3 protocol while using the topology maintenance protocols with both time and energy triggering methods. Moreover, the performance of the A3 and DGETRec is superior to the other combinations of TCM protocols. Hence, the WSN system can be able to serve better connectivity coverage in the target economic zone., Comment: 14 pages, 10 figures

3D part segmentation is an essential step in advanced CAM/CAD workflow. Precise 3D segmentation contributes to lower defective rate of work-pieces produced by the manufacturing equipment (such as computer controlled CNCs), thereby improving work efficiency and attaining the attendant economic benefits. A large class of existing works on 3D model segmentation are mostly based on fully-supervised learning, which trains the AI models with large, annotated datasets. However, the disadvantage is that the resulting models from the fully-supervised learning methodology are highly reliant on the completeness of the available dataset, and its generalization ability is relatively poor to new unknown segmentation types (i.e. further additional novel classes). In this work, we propose and develop a noteworthy few-shot learning-based approach for effective part segmentation in CAM/CAD; and this is designed to significantly enhance its generalization ability and flexibly adapt to new segmentation tasks by using only relatively rather few samples. As a result, it not only reduces the requirements for the usually unattainable and exhaustive completeness of supervision datasets, but also improves the flexibility for real-world applications. As further improvement and innovation, we additionally adopt the transform net and the center loss block in the network. These characteristics serve to improve the comprehension for 3D features of the various possible instances of the whole work-piece and ensure the close distribution of the same class in feature space., Comment: 7 pages, 5 figures

R2 is a novel online any-angle path planner that uses heuristic bug-based or ray casting approaches to find optimal paths in 2D maps with non-convex, polygonal obstacles. R2 is competitive to traditional free-space planners, finding paths quickly if queries have direct line-of-sight. On large sparse maps with few obstacle contours, which are likely to occur in practice, R2 outperforms free-space planners, and can be much faster than state-of-the-art free-space expansion planner Anya. On maps with many contours, Anya performs faster than R2. R2 is built on RayScan, introducing lazy-searches and a source-pledge counter to find successors optimistically on contiguous contours. The novel approach bypasses most successors on jagged contours to reduce expensive line-of-sight checks, therefore requiring no pre-processing to be a competitive online any-angle planner., Comment: Rejected, and replaced with new prototype with same name