SearcharxivSearch

arXiv subjects

Shahid Hussain

Publications and source records attributed to Shahid Hussain.

At least 19 recordsLinked to original sources

An Improved Quantum Software Challenges Classification Approach using Transfer Learning and Explainable AI

Quantum Software Engineering (QSE) is a research area practiced by tech firms. Quantum developers face challenges in optimizing quantum computing and QSE concepts. They use Stack Overflow (SO) to discuss challenges and label posts with specialized quantum tags, which often refer to technical aspects rather than developer posts. Categorizing questions based on quantum concepts can help identify frequent QSE challenges. We conducted studies to classify questions into various challenges. We extracted 2829 questions from Q&A platforms using quantum-related tags. Posts were analyzed to identify frequent challenges and develop a novel grounded theory. Challenges include Tooling, Theoretical, Learning, Conceptual, Errors, and API Usage. Through content analysis and grounded theory, discussions were annotated with common challenges to develop a ground truth dataset. ChatGPT validated human annotations and resolved disagreements. Fine-tuned transformer algorithms, including BERT, DistilBERT, and RoBERTa, classified discussions into common challenges. We achieved an average accuracy of 95% with BERT DistilBERT, compared to fine-tuned Deep and Machine Learning (D&ML) classifiers, including Feedforward Neural Networks (FNN), Convolutional Neural Networks (CNN), and Long Short-Term Memory networks (LSTM), which achieved accuracies of 89%, 86%, and 84%, respectively. The Transformer-based approach outperforms the D&ML-based approach with a 6\% increase in accuracy by processing actual discussions, i.e., without data augmentation. We applied SHAP (SHapley Additive exPlanations) for model interpretability, revealing how linguistic features drive predictions and enhancing transparency in classification. These findings can help quantum vendors and forums better organize discussions for improved access and readability. However,empirical evaluation studies with actual developers and vendors are needed.

cs.SE

On coloring graphs with well-distributed edge density

In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as regular graphs, trees and other popular classes of graphs. The paper aims to explore some interesting properties regarding colorings average hereditary graphs. We prove a new upper bound for the chromatic number of a graph in terms of its maximum average degree and show that this bound is an improvement on previous bounds. From this, we show a relationship between the average degree and the chromatic number of an average hereditary graph. We then show that even with new bound, the graph 3-coloring problem remains NP-hard when the input is restricted to average hereditary graphs. We provide an equivalent condition for a graph to be average hereditary, through which we show that we can decide if a given graph is average hereditary in polynomial time.

cs.DM

Reducibility among NP-Hard graph problems and boundary classes

Many NP-hard graph problems become easy for some classes of graphs. For example, coloring is easy for bipartite graphs, but NP-hard in general. So we can ask question like when does a hard problem become easy? What is the minimum substructure for which the problem remains hard? We use the notion of boundary classes to study such questions. In this paper, we introduce a method for transforming the boundary class of one NP-hard graph problem into a boundary class for another problem. If Π and Γ are two NP-hard graph problems where Π is reducible to Γ, we transform a boundary class of Π into a boundary class of Γ. More formally if Π is reducible to Γ, where the reduction satisfies certain conditions, then X is a boundary class of Π if and only if the image of X under the reduction is a boundary class of Γ. This gives us a relationship between boundary classes and reducibility among several NP-hard problems. To show the strength of our main result, we apply our theorem to obtain some previously unknown boundary classes for a few graph problems namely; vertex-cover, clique, traveling-salesperson, bounded-degree-spanning-tree, subgraph-isomorphism and clique-cover.

cs.CC

LLM-based Content Classification Approach for GitHub Repositories by the README Files

GitHub is the world's most popular platform for storing, sharing, and managing code. Every GitHub repository has a README file associated with it. The README files should contain project-related information as per the recommendations of GitHub to support the usage and improvement of repositories. However, GitHub repository owners sometimes neglected these recommendations. This prevents a GitHub repository from reaching its full potential. This research posits that the comprehensiveness of a GitHub repository's README file significantly influences its adoption and utilization, with a lack of detail potentially hindering its full potential for widespread engagement and impact within the research community. Large Language Models (LLMs) have shown great performance in many text-based tasks including text classification, text generation, text summarization and text translation. In this study, an approach is developed to fine-tune LLMs for automatically classifying different sections of GitHub README files. Three encoder-only LLMs are utilized, including BERT, DistilBERT and RoBERTa. These pre-trained models are then fine-tuned based on a gold-standard dataset consisting of 4226 README file sections. This approach outperforms current state-of-the-art methods and has achieved an overall F1 score of 0.98. Moreover, we have also investigated the use of Parameter-Efficient Fine-Tuning (PEFT) techniques like Low-Rank Adaptation (LoRA) and shown an economical alternative to full fine-tuning without compromising much performance. The results demonstrate the potential of using LLMs in designing an automatic classifier for categorizing the content of GitHub README files. Consequently, this study contributes to the development of automated tools for GitHub repositories to improve their identifications and potential usages.

cs.AI

Fuzzy Logic Weight based Coordination Scheme for Utilizing Electric Vehicle Charging Stations

The larger battery capacities and the longer waiting and charging time of electric vehicles (EVs) results in low utilization of charging stations (CSs). This paper, proposes fuzzy logic weight based coordination (FLWC) scheme to enhance the utilization of CSs. Each EV has an associated uncertain information including stay time and the current state-of-charge (SoC). The fuzzy logic controller (FLC) analyze these inputs and determines a weight value. The proposed FLWC scheme then allocates CSs to the EVs according to the weight values. The proposed scheme is simulated for 100 EVs and 5 CSs using Matlab. The simulation result shows about 30% improvement in the average utilization of CSs as compared to first-come-first-serve (FCFS) based scheme.

cs.ET

Greedy Algorithms for Decision Trees with Hypotheses

We investigate at decision trees that incorporate both traditional queries based on one attribute and queries based on hypotheses about the values of all attributes. Such decision trees are similar to ones studied in exact learning, where membership and equivalence queries are allowed. We present greedy algorithms based on diverse uncertainty measures for construction of above decision trees and discuss results of computer experiments on various data sets from the UCI ML Repository and randomly generated Boolean functions. We also study the length and coverage of decision rules derived from the decisiontrees constructed by greedy algorithms.

cs.CC

Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sorting

In this paper, we consider decision trees that use both queries based on one attribute each and queries based on hypotheses about values of all attributes. Such decision trees are similar to ones studied in exact learning, where not only membership but also equivalence queries are allowed. We investigate the problem of recognition of monotone Boolean functions with $n$ variables, $n=2, \ldots, 4$, and the problem of sorting $n$ pairwise different elements from linearly ordered set, $n=3, \ldots, 6$. For each of these problems, we compare the complexity of different types of optimal (relative to the depth or the number of realizable nodes) decision trees with hypotheses. We also study the complexity of decision trees constructed by entropy-based greedy algorithm and analyze the length of decision rules derived from these trees.

cs.CC

Static Wormhole Solutions and Noether Symmetry in Modified Gauss-Bonnet Gravity

In this paper, we analyze static traversable wormholes via Noether symmetry technique in modified Gauss-Bonnet $f(\mathcal{G})$ theory of gravity (where $\mathcal{G}$ represents Gauss-Bonnet term). We assume isotropic matter configuration and spherically symmetric metric. We construct three $f(\mathcal{G})$ models, i.e, linear, quadratic and exponential forms and examine the consistency of these models. The traversable nature of wormhole solutions is discussed via null energy bound of the effective stress-energy tensor while physical behavior is studied through standard energy bounds of isotropic fluid. We also discuss the stability of these wormholes inside the wormhole throat and conclude the presence of traversable and physically stable wormholes for quadratic as well as exponential $f(\mathcal{G})$ models.

gr-qc

Upper Domination: towards a dichotomy through boundary properties

An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes of graphs defined by finitely many forbidden induced subgraphs and conjecture that the problem admits a dichotomy in this family, i.e. it is either NP-hard or polynomial-time solvable for each class in the family. A helpful tool to study the complexity of an algorithmic problem on finitely defined classes of graphs is the notion of boundary classes. However, none of such classes has been identified so far for the upper dominating set problem. In the present paper, we discover the first boundary class for this problem and prove the dichotomy for classes defined by a single forbidden induced subgraph.

cs.DM

Measurements of the cosmic ray spectrum and average mass with IceCube

Located at the South Pole, IceCube is a particle-astrophysics observatory composed of a square-kilometer surface air shower array (IceTop) and a 1.4 km deep cubic-kilometer optical Cherenkov detector array. We review results of measurements of the cosmic ray spectrum and average mass in the energy range 1 PeV to 1 EeV.

astro-ph.HE

Automatic Vehicle Checking Agent (VCA)

A definition of intelligence is given in terms of performance that can be quantitatively measured. In this study, we have presented a conceptual model of Intelligent Agent System for Automatic Vehicle Checking Agent (VCA). To achieve this goal, we have introduced several kinds of agents that exhibit intelligent features. These are the Management agent, internal agent, External Agent, Watcher agent and Report agent. Metrics and measurements are suggested for evaluating the performance of Automatic Vehicle Checking Agent (VCA). Calibrate data and test facilities are suggested to facilitate the development of intelligent systems.

cs.AI

Mapping of SOA and RUP: DOA as Case Study

SOA (Service Oriented Architecture) is a new trend towards increasing the profit margins in an organization due to incorporating business services to business practices. Rational Unified Process (RUP) is a unified method planning form for large business applications that provides a language for describing method content and processes. The well defined mapping of SOA and RUP leads to successful completion of RUP software projects to provide services to their users. DOA (Digital Office Assistant) is a multi user SOA type application that provides appropriate viewer for each user to assist him through services. In this paper authors proposed the mapping strategy of SOA with RUP by considering DOA as case study.

cs.SE

Improvement in RUP Project Management via Service Monitoring: Best Practice of SOA

Management of project planning, monitoring, scheduling, estimation and risk management are critical issues faced by a project manager during development life cycle of software. In RUP, project management is considered as core discipline whose activities are carried in all phases during development of software products. On other side service monitoring is considered as best practice of SOA which leads to availability, auditing, debugging and tracing process. In this paper, authors define a strategy to incorporate the service monitoring of SOA into RUP to improve the artifacts of project management activities. Moreover, the authors define the rules to implement the features of service monitoring, which help the project manager to carry on activities in well define manner. Proposed frame work is implemented on RB (Resuming Bank) application and obtained improved results on PM (Project Management) work.

cs.SE

Mapping The Best Practices of XP and Project Management: Well defined approach for Project Manager

Software engineering is one of the most recent additions in various disciplines of system engineering. It has emerged as a key obedience of system engineering in a quick succession of time. Various Software Engineering approaches are followed in order to produce comprehensive software solutions of affordable cost with reasonable delivery timeframe with less uncertainty. All these objectives are only satisfied when project's status is properly monitored and controlled; eXtreme Programming (XP) uses the best practices of AGILE methodology and helps in development of small size software very sharply. In this paper, authors proposed that via XP, high quality software with less uncertainty and under estimated cost can be developed due to proper monitoring and controlling of project. Moreover, authors give guidelines that how activities of project management can be embedded into development life cycle of XP to enhance the quality of software products and reduce the uncertainty.

cs.SE

Small air showers in IceTop

IceTop is an air shower array that is part of the IceCube Observatory currently under construction at the geographic South Pole. When completed, it will consist of 80 stations covering an area of 1 km2. Previous analyzes done with IceTop studied the events that triggered five or more stations, leading to an effective energy threshold of about 0.5 PeV. The goal of this study is to push this threshold lower, into the region where it will overlap with direct measurements of cosmic rays which currently have an upper limit around 300TeV.We select showers that trigger exactly three or exactly four adjacent surface stations that are not on the periphery of the detector (contained events). This extends the energy threshold down to 150TeV.

astro-ph.HE

A Step towards Software Corrective Maintenance Using RCM model

From the preliminary stage of software engineering, selection of appropriate enforcement of standards remained a challenge for stakeholders during entire cycle of software development, but it can lead to reduce the efforts desired for software maintenance phase. Corrective maintenance is the reactive modification of a software product performed after delivery to correct discovered faults. Studies conducted by different researchers reveal that approximately 50 to 75 percent of the effort is spent on maintenance, out of which about 17 to 21 percent is exercised on corrective maintenance. In this paper, authors proposed a RCM (Reduce Corrective Maintenance) model which represents the implementation process of number of checklists to guide the stakeholders of all phases of software development. These check lists will be filled by corresponding stake holder of all phases before its start. More precise usage of the check list in relevant phase ensures successful enforcement of analysis, design, coding and testing standards for reducing errors in operation stage. Moreover authors represent the step by step integration of checklists in software development life cycle through RCM model.

cs.SE

Event rates vs. cross sections at neutrino telescopes

One of the major goals of neutrino astronomy is to explore the otherwise unknown fluxes and interactions of ultrahigh energy neutrinos. The existing neutrino telescopes look at three types of events: particle showers, muons, and taus. In this paper we discuss the dependence of the event rates on the neutrino nucleon cross-sections as we scale the cross sections, with energy, in different scenarios beyond the standard model. Our focus will be on the IceCube detector.

hep-ph

Bounds on Low Scale Gravity from RICE data and Cosmogenic Neutrino Flux Models

We explore limits on low scale gravity models set by results from the Radio Ice Cherenkov Experiment's (RICE) ongoing search for cosmic ray neutrinos in the cosmogenic, or GZK, energy range. The bound on M_D, the fundamental scale of gravity, depends upon cosmogenic flux model, black hole formation and decay treatments, inclusion of graviton mediated elastic neutrino processes, and the number of large extra dimensions, d. Assuming proton-based cosmogenic flux models that cover a broad range of flux possibilities, we find bounds in the interval 0.9 TeV <M_D< 10 TeV. Heavy nucleus-based models generally lead to smaller fluxes and correspondingly weaker bounds. Values d = 5, 6 and 7, for which laboratory and astrophysical bounds on LSG models are less restrictive, lead to essentially the same limits on M_D.

hep-ph