Miracle-dz/UniFAR-FTUs huggingface dataset:
Hybrid Whale-Mud-Ring Optimization for Precise Color Skin Cancer Image Segmentation

Timely identification and treatment of rapidly progressing skin cancers can significantly contribute to the preservation of patients' health and well-being. Dermoscopy, a dependable and accessible tool, plays a pivotal role in the initial stages of skin cancer detection. Consequently, the effective processing of digital dermoscopy images holds significant importance in elevating the accuracy of skin cancer diagnoses. Multilevel thresholding is a key tool in medical imaging that extracts objects within the image to facilitate its analysis. In this paper, an enhanced version of the Mud Ring Algorithm hybridized with the Whale Optimization Algorithm, named WMRA, is proposed. The proposed approach utilizes bubble-net attack and mud ring strategy to overcome stagnation in local optima and obtain optimal thresholds. The experimental results show that WMRA is powerful against a cluster of recent methods in terms of fitness, Peak Signal to Noise Ratio (PSNR), and Mean Square Error (MSE).
Effect of (001) and (111) Epitaxial Strain on \emph{Pnma} Perovskite Oxides

With recent advances in strain engineering and its widespread applications, it is becoming increasingly important to understand the effect of biaxial strain on the most common structural phase of perovskites -- the orthorhombic $Pnma$ structure. In this work, by using a combination of group theory and first principles density functional theory, we study the effect of biaxial strain on (001) and (111)-oriented CaTiO$_3$, SrSnO$_3$ and SrZrO$_3$ films. We observe manifestly different behaviors depending on the strain orientation, with common trends emerging between different materials. In addition to many different structural phases observed in individual compounds before, we identify a transition between two different phases with the same space group name ($P2_1/c$) but different symmetries in (111)-strained materials. We also find that allowing the relaxation of the out-of-plane monoclinic angles, often ignored in first principles studies, lead to significant stabilization of certain phases and is essential to correctly determine the structural ground state.
End-to-end Phase Field Model Discovery Combining Experimentation, Crowdsourcing, Simulation and Learning

The availability of tera-byte scale experiment data calls for AI driven approaches which automatically discover scientific models from data. Nonetheless, significant challenges present in AI-driven scientific discovery: (i) The annotation of large scale datasets requires fundamental re-thinking in developing scalable crowdsourcing tools. (ii) The learning of scientific models from data calls for innovations beyond black-box neural nets. (iii) Novel visualization & diagnosis tools are needed for the collaboration of experimental and theoretical physicists, and computer scientists. We present Phase-Field-Lab platform for end-to-end phase field model discovery, which automatically discovers phase field physics models from experiment data, integrating experimentation, crowdsourcing, simulation and learning. Phase-Field-Lab combines (i) a streamlined annotation tool which reduces the annotation time (by ~50-75%), while increasing annotation accuracy compared to baseline; (ii) an end-to-end neural model which automatically learns phase field models from data by embedding phase field simulation and existing domain knowledge into learning; and (iii) novel interfaces and visualizations to integrate our platform into the scientific discovery cycle of domain scientists. Our platform is deployed in the analysis of nano-structure evolution in materials under extreme conditions (high temperature and irradiation). Our approach reveals new properties of nano-void defects, which otherwise cannot be detected via manual analysis.
Using geophysical surveys to test tracer‐based storage estimates in headwater catchments

Hydrogeophysical surveys were carried out in a 3.2 km2 Scottish catchment where previous isotope studies inferred significant groundwater storage that makes important contributions to streamflow. We used electrical resistivity tomography (ERT) to characterize the architecture of glacial drifts and make an approximation of catchment‐scale storage. Four ERT lines (360–535 m in length) revealed extensive 5–10 m deep drift cover on steeper slopes, which extends up to 20–40 m in valley bottom areas. Assuming low clay fractions, we interpret variable resistivity as correlating with variations in porosity and water content. Using Archie's Law as a first approximation, we compute likely bounds for storage along the ERT transects. Areas of highest groundwater storage occur in valley bottom peat soils (up to 4 m deep) and underlying drift where up to 10 000 mm of precipitation equivalent may be stored. This is consistent with groundwater levels which indicate saturation to within 0.2 m of the surface. However, significant slow groundwater flow paths occur in the shallower drifts on steeper hillslopes, where point storage varies between ~1000 mm–5000 mm. These fluxes maintain saturated conditions in the valley bottom and are recharged from drift‐free areas on the catchment interfluves. The surveys indicate that catchment scale storage is >2000 mm which is consistent with tracer‐based estimates. Copyright © 2016 John Wiley & Sons, Ltd.
Alleviating Barren Plateaus in Parameterized Quantum Machine Learning Circuits: Investigating Advanced Parameter Initialization Strategies

Parameterized quantum circuits (PQCs) have emerged as a foundational element in the development and applications of quantum algorithms. However, when initialized with random parameter values, PQCs often exhibit barren plateaus (BP). These plateaus, characterized by vanishing gradients with an increasing number of qubits, hinder optimization in quantum algorithms. In this paper, we analyze the impact of state-of-the-art parameter initialization strategies from classical machine learning in random PQCs from the aspect of BP phenomenon. Our investigation encompasses a spectrum of initialization techniques, including random, Xavier (both normal and uniform variants), He, LeCun, and Orthogonal methods. Empirical assessment reveals a pronounced reduction in variance decay of gradients across all these methodologies compared to the randomly initialized PQCs. Specifically, the Xavier initialization technique outperforms the rest, showing a 62\% improvement in variance decay compared to the random initialization. The He, Lecun, and orthogonal methods also display improvements, with respective enhancements of 32\%, 28\%, and 26\%. This compellingly suggests that the adoption of these existing initialization techniques holds the potential to significantly amplify the training efficacy of Quantum Neural Networks (QNNs), a subclass of PQCs. Demonstrating this effect, we employ the identified techniques to train QNNs for learning the identity function, effectively mitigating the adverse effects of BPs. The training performance, ranked from the best to the worst, aligns with the variance decay enhancement as outlined above. This paper underscores the role of tailored parameter initialization in mitigating the BP problem and eventually enhancing the training dynamics of QNNs.
A Fine-Grained Image Description Generation Method Based on Joint Objectives

The goal of fine-grained image description generation techniques is to learn detailed information from images and simulate human-like descriptions that provide coherent and comprehensive textual details about the image content. Currently, most of these methods face two main challenges: description repetition and omission. Moreover, the existing evaluation metrics cannot clearly reflect the performance of models on these two issues. To address these challenges, we propose an innovative Fine-grained Image Description Generation model based on Joint Objectives. Furthermore, we introduce new object-based evaluation metrics to more intuitively assess the model's performance in handling description repetition and omission. This novel approach combines visual features at both the image level and object level to maximize their advantages and incorporates an object penalty mechanism to reduce description repetition. Experimental results demonstrate that our proposed method significantly improves the CIDEr evaluation metric, indicating its excellent performance in addressing description repetition and omission issues.
On the tensor product of enriched $\infty$-categories

We show that the tensor product of $\infty$-categories enriched in a suitable monoidal $\infty$-category preserves colimits in each variable, fixing a mistake in an earlier paper of Gepner and the author. We also prove that essentially surjective and fully faithful functors form a factorization system on enriched $\infty$-categories, and that the tensor product and internal hom are compatible with this.
Towards Detecting, Recognizing, and Parsing the Address Information from Bangla Signboard: A Deep Learning-based Approach

Retrieving textual information from natural scene images is an active research area in the field of computer vision with numerous practical applications. Detecting text regions and extracting text from signboards is a challenging problem due to special characteristics like reflecting lights, uneven illumination, or shadows found in real-life natural scene images. With the advent of deep learning-based methods, different sophisticated techniques have been proposed for text detection and text recognition from the natural scene. Though a significant amount of effort has been devoted to extracting natural scene text for resourceful languages like English, little has been done for low-resource languages like Bangla. In this research work, we have proposed an end-to-end system with deep learning-based models for efficiently detecting, recognizing, correcting, and parsing address information from Bangla signboards. We have created manually annotated datasets and synthetic datasets to train signboard detection, address text detection, address text recognition, address text correction, and address text parser models. We have conducted a comparative study among different CTC-based and Encoder-Decoder model architectures for Bangla address text recognition. Moreover, we have designed a novel address text correction model using a sequence-to-sequence transformer-based network to improve the performance of Bangla address text recognition model by post-correction. Finally, we have developed a Bangla address text parser using the state-of-the-art transformer-based pre-trained language model.
On convergence of points to limiting processes, with an application to zeta zeros

This paper considers sequences of points on the real line which have been randomly translated, and provides conditions under which various notions of convergence to a limiting point process are equivalent. In particular we consider convergence in correlation, convergence in distribution, and convergence of spacings between points. We also prove a simple Tauberian theorem regarding rescaled correlations. The results are applied to zeros of the Riemann zeta-function to show that several ways to state the GUE Hypothesis are equivalent. The proof relies on a moment bound of A. Fujii.
Complexity-Guided Curriculum Learning for Text Graphs

Curriculum learning provides a systematic approach to training. It refines training progressively, tailors training to task requirements, and improves generalization through exposure to diverse examples. We present a curriculum learning approach that builds on existing knowledge about text and graph complexity formalisms for training with text graph data. The core part of our approach is a novel data scheduler, which employs"spaced repetition"and complexity formalisms to guide the training process. We demonstrate the effectiveness of the proposed approach on several text graph tasks and graph neural network architectures. The proposed model gains more and uses less data; consistently prefers text over graph complexity indices throughout training, while the best curricula derived from text and graph complexity indices are equally effective; and it learns transferable curricula across GNN models and datasets. In addition, we find that both node-level (local) and graph-level (global) graph complexity indices, as well as shallow and traditional text complexity indices play a crucial role in effective curriculum learning.
Building the Future of Responsible AI: A Reference Architecture for Designing Large Language Model based Agents

Large language models (LLMs) have been widely recognised as transformative artificial generative intelligence (AGI) technologies due to their capabilities to understand and generate content, including plans with reasoning capabilities. Foundation model based agents derive their autonomy from the capabilities of foundation models, which enable them to autonomously break down a given goal into a set of manageable tasks and orchestrate task execution to meet the goal. Despite the huge efforts put into building foundation model based autonomous agents, the architecture design of the agents has not yet been systematically explored. Also, while there are significant benefits of using autonomous agents for planning and execution, there are serious considerations regarding responsible AI related software quality attributes, such as security and accountability. Therefore, this paper presents a pattern-oriented reference architecture that serves as architecture design guidance and enables responsible-AI-by-design when designing foundation model based autonomous agents. We evaluate the completeness and utility of the proposed reference architecture by mapping it to the architecture of two real-world agents.
High-Quality Face Caricature via Style Translation

Caricature is an exaggerated form of artistic portraiture that accentuates unique yet subtle characteristics of human faces. Recently, advancements in deep end-to-end techniques have yielded encouraging outcomes in capturing both style and elevated exaggerations in creating face caricatures. Most of these approaches tend to produce cartoon-like results that could be more practical for real-world applications. In this study, we proposed a high-quality, unpaired face caricature method that is appropriate for use in the real world and uses computer vision techniques and GAN models. We attain the exaggeration of facial features and the stylization of appearance through a two-step process: Face caricature generation and face caricature projection. The face caricature generation step creates new caricature face datasets from real images and trains a generative model using the real and newly created caricature datasets. The Face caricature projection employs an encoder trained with real and caricature faces with the pre-trained generator to project real and caricature faces. Using the encoder and generator’s latent space, we perform an incremental facial exaggeration from the real image to the caricature faces. Our projection preserves the facial identity, attributes, and expressions from the input image. Also, it accounts for facial occlusions, such as reading glasses or sunglasses, to enhance the robustness of our model. Furthermore, we comprehensively compared our approach with various state-of-the-art face caricature methods, highlighting our process’s distinctiveness and exceptional realism.
MagGen: A graph aided deep generative model for inverse design of stable, permanent magnets

A significant development towards inverse design of materials with well-defined target properties is reported. A deep generative model based on variational autoencoder (VAE), conditioned simultaneously by two target properties, is developed to inverse design stable magnetic materials. Structure of the physics informed, property embedded latent space of the model is analyzed using graph theory, based on the idea of similarity index. The graph idea is shown to be useful for generating new materials that are likely to satisfy target properties. An impressive ~96% of the generated materials is found to satisfy the target properties as per predictions from the target learning branches. This is a huge improvement over approaches that do not condition the VAE latent space by target properties, or do not consider connectivity of the parent materials perturbing which the new materials are generated. In such models, the fraction of materials satisfying targets can be as low as ~5%. This impressive feat is achieved using a simple real-space only representation called Invertible Real-space Crystallographic Representation (IRCR), that can be directly read from material cif files. Model predictions are finally validated by performing DFT calculations on a randomly chosen subset of materials. Performance of the present model using IRCR is comparable or superior to that of the models reported earlier. This model for magnetic material generation, MagGen, is applied to the problem of designing rare earth free permanent magnets with promising results.
Single Image Compressed Sensing MRI via a Self-Supervised Deep Denoising Approach

Popular methods in compressed sensing (CS) are dependent on deep learning (DL), where large amounts of data are used to train non-linear reconstruction models. However, ensuring generalisability over and access to multiple datasets is challenging to realise for real-world applications. To address these concerns, this paper proposes a single image, self-supervised (SS) CS-MRI framework that enables a joint deep and sparse regularisation of CS artefacts. The approach effectively dampens structured CS artefacts, which can be difficult to remove assuming sparse reconstruction, or relying solely on the inductive biases of CNN to produce noise-free images. Image quality is thereby improved compared to either approach alone. Metrics are evaluated using Cartesian 1D masks on a brain and knee dataset, with PSNR improving by 2-4dB on average.
SiGeo: Sub-One-Shot NAS via Information Theory and Geometry of Loss Landscape

Neural Architecture Search (NAS) has become a widely used tool for automating neural network design. While one-shot NAS methods have successfully reduced computational requirements, they often require extensive training. On the other hand, zero-shot NAS utilizes training-free proxies to evaluate a candidate architecture's test performance but has two limitations: (1) inability to use the information gained as a network improves with training and (2) unreliable performance, particularly in complex domains like RecSys, due to the multi-modal data inputs and complex architecture configurations. To synthesize the benefits of both methods, we introduce a"sub-one-shot"paradigm that serves as a bridge between zero-shot and one-shot NAS. In sub-one-shot NAS, the supernet is trained using only a small subset of the training data, a phase we refer to as"warm-up. "Within this framework, we present SiGeo, a proxy founded on a novel theoretical framework that connects the supernet warm-up with the efficacy of the proxy. Extensive experiments have shown that SiGeo, with the benefit of warm-up, consistently outperforms state-of-the-art NAS proxies on various established NAS benchmarks. When a supernet is warmed up, it can achieve comparable performance to weight-sharing one-shot NAS methods, but with a significant reduction ($\sim 60$\%) in computational costs.
Breast Cancer classification by adaptive weighted average ensemble of previously trained models

Breast cancer is a serious disease that inflicts millions of people each year, and the number of cases is increasing. Early detection is the best way to reduce the impact of the disease. Researchers have developed many techniques to detect breast cancer, including the use of histopathology images in CAD systems. This research proposes a technique that combine already fully trained model using adaptive average ensemble, this is different from the literature which uses average ensemble before training and the average ensemble is trained simultaneously. Our approach is different because it used adaptive average ensemble after training which has increased the performance of evaluation metrics. It averages the outputs of every trained model, and every model will have weight according to its accuracy. The accuracy in the adaptive weighted ensemble model has achieved 98% where the accuracy has increased by 1 percent which is better than the best participating model in the ensemble which was 97%. Also, it decreased the numbers of false positive and false negative and enhanced the performance metrics.
HydraScreen: A Generalizable Structure-Based Deep Learning Approach to Drug Discovery

We propose HydraScreen, a deep-learning approach that aims to provide a framework for more robust machine-learning-accelerated drug discovery. HydraScreen utilizes a state-of-the-art 3D convolutional neural network, designed for the effective representation of molecular structures and interactions in protein-ligand binding. We design an end-to-end pipeline for high-throughput screening and lead optimization, targeting applications in structure-based drug design. We assess our approach using established public benchmarks based on the CASF 2016 core set, achieving top-tier results in affinity and pose prediction (Pearson's r = 0.86, RMSE = 1.15, Top-1 = 0.95). Furthermore, we utilize a novel interaction profiling approach to identify potential biases in the model and dataset to boost interpretability and support the unbiased nature of our method. Finally, we showcase HydraScreen's capacity to generalize across unseen proteins and ligands, offering directions for future development of robust machine learning scoring functions. HydraScreen (accessible at https://hydrascreen.ro5.ai) provides a user-friendly GUI and a public API, facilitating easy assessment of individual protein-ligand complexes.
NeISF: Neural Incident Stokes Field for Geometry and Material Estimation

Multi-view inverse rendering is the problem of estimating the scene parameters such as shapes, materials, or illuminations from a sequence of images captured under different viewpoints. Many approaches, however, assume single light bounce and thus fail to recover challenging scenarios like inter-reflections. On the other hand, simply extending those methods to consider multi-bounced light requires more assumptions to alleviate the ambiguity. To address this problem, we propose Neural Incident Stokes Fields (NeISF), a multi-view inverse rendering framework that reduces ambiguities using polarization cues. The primary motivation for using polarization cues is that it is the accumulation of multi-bounced light, providing rich information about geometry and material. Based on this knowledge, the proposed incident Stokes field efficiently models the accumulated polarization effect with the aid of an original physically-based differentiable polarimetric renderer. Lastly, experimental results show that our method outperforms the existing works in synthetic and real scenarios.