SearcharxivSearch

arXiv subjects

Muhammad Hassan

Publications and source records attributed to Muhammad Hassan.

At least 37 records · Page 2Linked to original sources

Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer

Hybrid quantum-classical adaptive Variational Quantum Eigensolvers (VQE) hold the potential to outperform classical computing for simulating many-body quantum systems. However, practical implementations on current quantum processing units (QPUs) are challenging due to the noisy evaluation of a polynomially scaling number of observables, undertaken for operator selection and high-dimensional cost function optimization. We introduce an adaptive algorithm using analytic, gradient-free optimization, called Greedy Gradient-free Adaptive VQE (GGA-VQE). In addition to demonstrating the algorithm's improved resilience to statistical sampling noise in the computation of simple molecular ground states, we execute GGA-VQE on a 25-qubit error-mitigated QPU by computing the ground state of a 25-body Ising model. Although hardware noise on the QPU produces inaccurate energies, our implementation outputs a parameterized quantum circuit yielding a favorable ground-state approximation. We demonstrate this by retrieving the parameterized operators calculated on the QPU and evaluating the resulting ansatz wave-function via noiseless emulation (i.e., hybrid observable measurement).

quant-ph

Trace estimates for harmonic functions along circular arcs with applications to domain decomposition on overlapping disks

In this paper we derive several (and in many cases sharp) estimates for the $\mathrm{L}^2$-trace norm of harmonic functions along circular arcs. More precisely, we obtain geometry-dependent estimates on the norm, spectral radius, and numerical range of the Dirchlet-to-Dirichlet (DtD) operator sending data on the boundary of the disk to the restriction of its harmonic extension along circular arcs inside the disk. The estimates we derive here have applications in the convergence analysis of the Schwarz domain decomposition method for overlapping disks in two dimensions. In particular, they allow us to establish a rigorous convergence proof for the discrete parallel Schwarz method applied to the Conductor-like Screening Model (COSMO) from theoretical chemistry in the two-disk case, and to derive error estimates with respect to the discretization parameter, the number of Schwarz iterations, and the geometry of the domain. Our analysis addresses challenges beyond classical domain decomposition theory, especially the weak enforcement of boundary conditions.

math.AP

RISC-V V Vector Extension (RVV) with reduced number of vector registers

To reduce the area of RISC-V Vector extension (RVV) in small processors, the authors are considering one simple modification: reduce the number of registers in the vector register file. The standard 'V' extension requires 32 vector registers that we propose to reduce to 16 or 8 registers. Other features of RVV are still supported. Reducing the number of vector registers does not generate a completely new programming model: although the resulting core does not have binary code compatibility with standard RVV, compiling for it just requires parameterization of the vector register file size in the compiler. The reduced vector register file allows for still high utilization of vector RVV processor core. Many useful signal processing kernels require few registers, and become efficient at 1:4 chaining ratio.

cs.AR

What is in Your App? Uncovering Privacy Risks of Female Health Applications

FemTech or Female Technology, is an expanding field dedicated to providing affordable and accessible healthcare solutions for women, prominently through Female Health Applications that monitor health and reproductive data. With the leading app exceeding 1 billion downloads, these applications are gaining widespread popularity. However, amidst contemporary challenges to women's reproductive rights and privacy, there is a noticeable lack of comprehensive studies on the security and privacy aspects of these applications. This exploratory study delves into the privacy risks associated with seven popular applications. Our initial quantitative static analysis reveals varied and potentially risky permissions and numerous third-party trackers. Additionally, a preliminary examination of privacy policies indicates non-compliance with fundamental data privacy principles. These early findings highlight a critical gap in establishing robust privacy and security safeguards for FemTech apps, especially significant in a climate where women's reproductive rights face escalating threats.

cs.HC

Ammonia-Net: A Multi-task Joint Learning Model for Multi-class Segmentation and Classification in Tooth-marked Tongue Diagnosis

In Traditional Chinese Medicine, the tooth marks on the tongue, stemming from prolonged dental pressure, serve as a crucial indicator for assessing qi (yang) deficiency, which is intrinsically linked to visceral health. Manual diagnosis of tooth-marked tongue solely relies on experience. Nonetheless, the diversity in shape, color, and type of tooth marks poses a challenge to diagnostic accuracy and consistency. To address these problems, herein we propose a multi-task joint learning model named Ammonia-Net. This model employs a convolutional neural network-based architecture, specifically designed for multi-class segmentation and classification of tongue images. Ammonia-Net performs semantic segmentation of tongue images to identify tongue and tooth marks. With the assistance of segmentation output, it classifies the images into the desired number of classes: healthy tongue, light tongue, moderate tongue, and severe tongue. As far as we know, this is the first attempt to apply the semantic segmentation results of tooth marks for tooth-marked tongue classification. To train Ammonia-Net, we collect 856 tongue images from 856 subjects. After a number of extensive experiments, the experimental results show that the proposed model achieves 99.06% accuracy in the two-class classification task of tooth-marked tongue identification and 80.02%. As for the segmentation task, mIoU for tongue and tooth marks amounts to 71.65%.

cs.CV

Overlap-ADAPT-VQE: Practical Quantum Chemistry on Quantum Computers via Overlap-Guided Compact Ansätze

ADAPT-VQE is a robust algorithm for hybrid quantum-classical simulations of quantum chemical systems on near-term quantum computers. While its iterative process systematically reaches the ground state energy, ADAPT-VQE is sensitive to local energy minima, leading to over-parameterized ansätze. We introduce the Overlap-ADAPT-VQE to grow wave-functions by maximizing their overlap with any intermediate target wave-function that already captures some electronic correlation. By avoiding building the ansatz in the energy landscape strewn with local minima, the Overlap-ADAPT-VQE produces ultra-compact ansätze suitable for high-accuracy initializations of a new ADAPT procedure. Spectacular advantages over ADAPT-VQE are observed for strongly correlated systems including massive savings in circuit depth. Since this compression strategy can also be initialized with accurate Selected-Configuration Interaction (SCI) classical target wave-functions, it paves the way for chemically accurate simulations of larger systems, and strengthens the promise of decisively surpassing classical quantum chemistry through the power of quantum computing.

quant-ph

Futuristic Variations and Analysis in Fundus Images Corresponding to Biological Traits

Fundus image captures rear of an eye, and which has been studied for the diseases identification, classification, segmentation, generation, and biological traits association using handcrafted, conventional, and deep learning methods. In biological traits estimation, most of the studies have been carried out for the age prediction and gender classification with convincing results. However, the current study utilizes the cutting-edge deep learning (DL) algorithms to estimate biological traits in terms of age and gender together with associating traits to retinal visuals. For the traits association, our study embeds aging as the label information into the proposed DL model to learn knowledge about the effected regions with aging. Our proposed DL models, named FAG-Net and FGC-Net, correspondingly estimate biological traits (age and gender) and generates fundus images. FAG-Net can generate multiple variants of an input fundus image given a list of ages as conditions. Our study analyzes fundus images and their corresponding association with biological traits, and predicts of possible spreading of ocular disease on fundus images given age as condition to the generative model. Our proposed models outperform the randomly selected state of-the-art DL models.

eess.IV

Analysis of the Single Reference Coupled Cluster Method for Electronic Structure Calculations: The Full Coupled Cluster Equations

The central problem in electronic structure theory is the computation of the eigenvalues of the electronic Hamiltonian -- an unbounded, self-adjoint operator acting on a Hilbert space of antisymmetric functions. Coupled cluster (CC) methods, which are based on a non-linear parameterisation of the sought-after eigenfunction and result in non-linear systems of equations, are the method of choice for high accuracy quantum chemical simulations but their numerical analysis is underdeveloped. The existing numerical analysis relies on a local, strong monotonicity property of the CC function that is valid only in a perturbative regime, i.e., when the sought-after ground state CC solution is sufficiently close to zero. In this article, we introduce a new well-posedness analysis for the single reference coupled cluster method based on the invertibility of the CC derivative. Under the minimal assumption that the sought-after eigenfunction is intermediately normalisable and the associated eigenvalue is isolated and non-degenerate, we prove that the continuous (infinite-dimensional) CC equations are always locally well-posed. Under the same minimal assumptions and provided that the discretisation is fine enough, we prove that the discrete Full-CC equations are locally well-posed, and we derive residual-based error estimates with guaranteed positive constants. Preliminary numerical experiments indicate that the constants that appear in our estimates are a significant improvement over those obtained from the local monotonicity approach.

math.NA

Modified-operator method for the calculation of band diagrams of crystalline materials

In solid state physics, electronic properties of crystalline materials are often inferred from the spectrum of periodic Schrödinger operators. As a consequence of Bloch's theorem, the numerical computation of electronic quantities of interest involves computing derivatives or integrals over the Brillouin zone of so-called energy bands, which are piecewise smooth, Lipschitz continuous periodic functions obtained by solving a parametrized elliptic eigenvalue problem on a Hilbert space of periodic functions. Classical discretization strategies for resolving these eigenvalue problems produce approximate energy bands that are either non-periodic or discontinuous, both of which cause difficulty when computing numerical derivatives or employing numerical quadrature. In this article, we study an alternative discretization strategy based on an ad hoc operator modification approach. While specific instances of this approach have been proposed in the physics literature, we introduce here a systematic formulation of this operator modification approach. We derive a priori error estimates for the resulting energy bands and we show that these bands are periodic and can be made arbitrarily smooth (away from band crossings) by adjusting suitable parameters in the operator modification approach. Numerical experiments involving a toy model in 1D, graphene in 2D, and silicon in 3D validate our theoretical results and showcase the efficiency of the operator modification approach.

math.NA

Neuro-Symbolic Learning: Principles and Applications in Ophthalmology

Neural networks have been rapidly expanding in recent years, with novel strategies and applications. However, challenges such as interpretability, explainability, robustness, safety, trust, and sensibility remain unsolved in neural network technologies, despite the fact that they will unavoidably be addressed for critical applications. Attempts have been made to overcome the challenges in neural network computing by representing and embedding domain knowledge in terms of symbolic representations. Thus, the neuro-symbolic learning (NeSyL) notion emerged, which incorporates aspects of symbolic representation and bringing common sense into neural networks (NeSyL). In domains where interpretability, reasoning, and explainability are crucial, such as video and image captioning, question-answering and reasoning, health informatics, and genomics, NeSyL has shown promising outcomes. This review presents a comprehensive survey on the state-of-the-art NeSyL approaches, their principles, advances in machine and deep learning algorithms, applications such as opthalmology, and most importantly, future perspectives of this emerging field.

cs.CV

Continuity estimates for Riesz potentials on polygonal boundaries

Riesz potentials are well known objects of study in the theory of singular integrals that have been the subject of recent, increased interest from the numerical analysis community due to their connections with fractional Laplace problems and proposed use in certain domain decomposition methods. While the L$^p$-mapping properties of Riesz potentials on flat geometries are well-established, comparable results on rougher geometries for Sobolev spaces are very scarce. In this article, we study the continuity properties of the surface Riesz potential generated by the $1/\sqrt{x}$ singular kernel on a polygonal domain $Ω\subset \mathbb{R}^2$. We prove that this surface Riesz potential maps L$^{2}(\partialΩ)$ into H$^{+1/2}(\partialΩ)$. Our proof is based on a careful analysis of the Riesz potential in the neighbourhood of corners of the domain $Ω$. The main tool we use for this corner analysis is the Mellin transform which can be seen as a counterpart of the Fourier transform that is adapted to corner geometries.

math.NA

Deep Learning Analysis and Age Prediction from Shoeprints

Human walking and gaits involve several complex body parts and are influenced by personality, mood, social and cultural traits, and aging. These factors are reflected in shoeprints, which in turn can be used to predict age, a problem not systematically addressed using any computational approach. We collected 100,000 shoeprints of subjects ranging from 7 to 80 years old and used the data to develop a deep learning end-to-end model ShoeNet to analyze age-related patterns and predict age. The model integrates various convolutional neural network models together using a skip mechanism to extract age-related features, especially in pressure and abrasion regions from pair-wise shoeprints. The results show that 40.23% of the subjects had prediction errors within 5-years of age and the prediction accuracy for gender classification reached 86.07%. Interestingly, the age-related features mostly reside in the asymmetric differences between left and right shoeprints. The analysis also reveals interesting age-related and gender-related patterns in the pressure distributions on shoeprints; in particular, the pressure forces spread from the middle of the toe toward outside regions over age with gender-specific variations on heel regions. Such statistics provide insight into new methods for forensic investigations, medical studies of gait-pattern disorders, biometrics, and sport studies.

cs.CV

Short term solar energy prediction by machine learning algorithms

Smooth power generation from solar stations demand accurate, reliable and efficient forecast of solar energy for optimal integration to cater market demand; however, the implicit instability of solar energy production may cause serious problems for the smooth power generation. We report daily prediction of solar energy by exploiting the strength of machine learning techniques to capture and analyze complicated behavior of enormous features effectively. For this purpose, dataset comprising of 98 solar stations has been taken from energy competition of American Meteorological Society (AMS) for predicting daily solar energy. Forecast models of base line regressors including linear, ridge, lasso, decision tree, random forest and artificial neural networks have been implemented on the AMS solar dataset. Grid size is converted into two sections: 16x9 and 10x4 to ascertain attributes contributing more towards the generated power from densely located stations on global ensemble forecast system (GEFS). To evaluate the models, statistical measures of prediction error in terms of RMSE, MAE and R2_score have been analyzed and compared with the existing techniques. It has been observed that improved accuracy is achieved through random forest and ridge regressor for both grid sizes in contrast to all other proposed methods. Stability and reliability of the proposed schemes are evaluated on a single solar station as well as on multiple independent runs.

physics.ao-ph

An Integral Equation Formulation of the $N$-body Dielectric Spheres Problem. Part II: Complexity Analysis

This article is the second in a series of two papers concerning the mathematical study of a boundary integral equation of the second kind that describes the interaction of $N$ dielectric spherical particles undergoing mutual polarisation. The first article presented the numerical analysis of the Galerkin method used to solve this boundary integral equation and derived $N$-independent convergence rates for the induced surface charges and total electrostatic energy. The current article will focus on computational aspects of the algorithm. We provide a convergence analysis of the iterative method used to solve the underlying linear system and show that the number of liner solver iterations required to obtain a solution is independent of $N$. Additionally, we present two linear scaling solution strategies for the computation of the approximate induced surface charges. Finally, we consider a series of numerical experiments designed to validate our theoretical results and explore the dependence of the numerical errors and computational cost of solving the underlying linear system on different system parameters.

math.NA

An Integral Equation Formulation of the $N$-Body Dielectric Spheres Problem. Part I: Numerical Analysis

In this article, we analyse an integral equation of the second kind that represents the solution of $N$ interacting dielectric spherical particles undergoing mutual polarisation. A traditional analysis can not quantify the scaling of the stability constants -- and thus the approximation error -- with respect to the number $N$ of involved dielectric spheres. We develop a new a priori error analysis that demonstrates $N$-independent stability of the continuous and discrete formulations of the integral equation. Consequently, we obtain convergence rates that are independent of $N$.

math.NA

A Linear Scaling in Accuracy Numerical Method for Computing the Electrostatic Forces in the $N$-Body Dielectric Spheres Problem

This article deals with the efficient and accurate computation of the electrostatic forces between charged, spherical dielectric particles undergoing mutual polarisation. We use the spectral Galerkin boundary integral equation framework developed by Lindgren et al. (J. Comput. Phys. 371 (2018): 712-731) and subsequently analysed in two earlier contributions of the authors to propose a linear scaling in cost algorithm for the computation of the approximate forces. We establish exponential convergence of the method and derive error estimates for the approximate forces that do not explicitly depend on the number of dielectric particles $N$. Consequently, the proposed method requires only $\mathcal{O}(N)$ operations to compute the electrostatic forces acting on $N$ dielectric particles up to any given and fixed relative error.

math.NA

Towards Characterizing COVID-19 Awareness on Twitter

The coronavirus (COVID-19) pandemic has significantly altered our lifestyles as we resort to minimize the spread through preventive measures such as social distancing and quarantine. An increasingly worrying aspect is the gap between the exponential disease spread and the delay in adopting preventive measures. This gap is attributed to the lack of awareness about the disease and its preventive measures. Nowadays, social media platforms (ie., Twitter) are frequently used to create awareness about major events, including COVID-19. In this paper, we use Twitter to characterize public awareness regarding COVID-19 by analyzing the information flow in the most affected countries. Towards that, we collect more than 46K trends and 622 Million tweets from the top twenty most affected countries to examine 1) the temporal evolution of COVID-19 related trends, 2) the volume of tweets and recurring topics in those trends, and 3) the user sentiment towards preventive measures. Our results show that countries with a lower pandemic spread generated a higher volume of trends and tweets to expedite the information flow and contribute to public awareness. We also observed that in those countries, the COVID-19 related trends were generated before the sharp increase in the number of cases, indicating a preemptive attempt to notify users about the potential threat. Finally, we noticed that in countries with a lower spread, users had a positive sentiment towards COVID-19 preventive measures. Our measurements and analysis show that effective social media usage can influence public behavior, which can be leveraged to better combat future pandemics.

cs.SI

Design and Implementation of a DTMF Based Pick and Place Robotic Arm

In recent times, developments in field of communication and robotics has progressed with leaps and bounds. In addition, the blend of both disciplines has contributed heavily in making human life easier and better. So in this work while making use of both the aforementioned technologies, a procedure for design and implementation of a mobile operated mechanical arm is proposed, that is, the proposed arm will be operated via a cellular device that connects with the receiver mounted on the robotic arm. Moreover, over the duration of a call, if any key is pressed from the cellular device than an indicator indistinct to the key pressed is noticed at the receiver side. This tone represents superimposition of two distinct frequencies and referred to as DTMF (dual tone multi-frequency). Further, the mechanical arm is handled via the DTMF tone. Also, the acquired tone at the receiver is taken into a micro-controller (ATMEGA16) using the DTMF decipher module i.e. MT8870. Further, the decipher module unwinds the DTMF signal into its corresponding two bit representation and then the matched number is transmitted to the micro-controller. The micro-controller is programmed to take an action based on the decoded value. Further, the micro-controller forwards control signals to the motor driver unit to move the arm in forward/backward or multi-directional course. Lastly, the mechanical arm is capable of picking and placing objects while being controlled wirelessly over GSM (Global System for Mobile Communications).

eess.SY